Computational Models of Bio Heuristics Based on Physical and Cognitive Processes (Review)

Computational models of bio heuristics based on physical and cognitive processes are presented. Data on such characteristics of bio heuristics (including evolutionary and swarm bio heuristics) are compared.) such as the rate of convergence, computational complexity, the required amount of memory, the configuration of the algorithm parameters, the difficulties of software implementation. The balance between the convergence rate of bio heuristics and the diversification of the search space for solutions to optimization problems is estimated. Experimental results are presented for the problem of placing Peco graphs in a lattice with the minimum total length of the graph edges.

Computational Models of Evolutionary and Swarm Bio Heuristics (Review)

omputational models of evolutionary and swarm algorithms using nature-inspired mechanisms of self-organization and learning are presented. Experimental results are presented for the problem of placing a graph on a plane with the minimum total length of the graph edges.

Optimization of Main Link Lengths of Transplanting Device of Semi-Automatic Vegetable Transplanter

In this study, the lengths of the main links of the transplanting device of a semi-automatic vegetable transplanter were optimized to reduce the weight at the same planting trajectory. The theoretical planting trajectory was obtained from the kinematic analysis for the link structure of the transplanting device and verified through kinematic simulation using commercial software and actual measurement using high-speed camera. Then, the lengths of the main links that have a great influence on the planting trajectory were optimized to have a minimum total length at the same planting trajectory. A genetic algorithm was used as an optimization tool. As a result, with the optimal lengths of the main links, the same planting trajectory was maintained while reducing the total length by 18.32% compared to the conventional one. The transplanting device with the optimal main link lengths would have benefits in terms of agricultural economy by reducing manufacturing and fuel costs.

Geometric Multicut: Shortest Fences for Separating Groups of Objects in the Plane

We study the following separation problem: Given a collection of pairwise disjoint coloured objects in the plane with k different colours, compute a shortest “fence” F, i.e., a union of curves of minimum total length, that separates every pair of objects of different colours. Two objects are separated if F contains a simple closed curve that has one object in the interior and the other in the exterior. We refer to the problem as geometrick-cut, as it is a geometric analog to the well-studied multicut problem on graphs. We first give an $$O(n^4\log ^3\!n)$$ O ( n 4 log 3 n ) -time algorithm that computes an optimal fence for the case where the input consists of polygons of two colours with n corners in total. We then show that the problem is NP-hard for the case of three colours. Finally, we give a randomised $$4/3\cdot 1.2965$$ 4 / 3 · 1.2965 -approximation algorithm for polygons and any number of colours.

Monofilament Gillnet Selectivity for Hampala Barb (Hampala macrolepidota) Management at Ir. H. Djuanda Reservoir-West Java

Ir. H. Djuanda Reservoir have high fishes biodiversity and one of them is Hampala barb (Hampala macrolepidota) and it’s economical species. Hampala barb is one of dominant species was captured at Ir. H. Djuanda Reservoir but was experience decreasing of population by overfishing. The objective of this research were to known gillnet selectivity and length at first mature for hampala barb (Hampala macrolepidota) at Ir. H. Djuanda Reservoir. The information will be used as base determination of gillnet mesh size and legal size for sustainability fisheries management. The research was done at February-September 2017 with experimental fishing used gillnet with mesh size between 1.0-3.0 inch with intervals 0.5 inch. Total length hampala barb with highest captured probability for gillnet with mesh size 1.0; 1.5; 2.0; 2.5 and 3.0 inch were 11.0; 17.0; 22.5; 28,0 and 33.5 cm respectively. Length at first mature of hampala barb for female and male were 14.2 and 13.8 cm respectively. Based on the information, the minimum total length for exploitation was 19 cm using gillnet with mesh size > 2.0 inch.

Reconstruction of Weakly Simple Polygons from Their Edges

We address the problem of reconstructing a polygon from the multiset of its edges. Given [Formula: see text] line segments in the plane, find a polygon with [Formula: see text] vertices whose edges are these segments, or report that none exists. It is easy to solve the problem in [Formula: see text] time if we seek an arbitrary polygon or a simple polygon. We show that the problem is NP-complete for weakly simple polygons, that is, a polygon whose vertices can be perturbed by at most [Formula: see text], for any [Formula: see text], to obtain a simple polygon. We give [Formula: see text]-time algorithms for reconstructing weakly simple polygons: when all segments are collinear or the segment endpoints are in general position. These results extend to the variant in which the segments are directed. We study related problems for the case that the union of the [Formula: see text] input segments is connected. (i) If each segment can be subdivided into several segments, find the minimum number of subdivision points to form a weakly simple polygon. (ii) If new line segments can be added, find the minimum total length of new segments that creates a weakly simple polygon. We give worst-case upper and lower bounds for both problems.

NEW DATA ON FISH COREGONUS PELED (GMELIN,1788) IN SOME WATERBODIES OF MONGOLIA

In connection with the planned establishment of a coregonid fishery and the construction of a specialized hatchery in the area of Western Mongolia was organized with the task of studying some parts of the reproduction biology of Coregonus peled population inhabiting Lake Ulaagchnii Khar Nuur (Zavhan aimag). This species was introduced into this Mongolian lake, originally lacking any fish stock, in 1980 -1982. The samples of 11230 fish examined was collected during 1993 -1999, 2005-2011 and consisted partly of the fish originating from imported and introduced larvae and partly of the individuals belonging about 25th generating , already born in the lake studied. Most of parameters studied, such as absolute size, weight, the population dynamics, reproduction biology, of food analyses, and fatnes observed to the during vegetation period (November – December and first half of January), when the minimum daily waters temperature drops to 40centigrade or less. The sex ratio is fairly balanced if the total material from all fishings is considered. During this period of peak-spawning females predominate. The average individual standard length of spawners was 400 mm in males and 420 mm in females, the average weight 700 g in males and 900 g in females. Nevertheless, all parameters under study tend slightly to deteriorate in the course of time, which is obviously a result of the gradually increasing population density and of decreasing quantity of food available in the lake. In Khuisiin Naiman Nuur (Uburchangajskij ajmag) sexually mature at the age of 2 + , exceptionally already at the age of 1 + , at the minimum total length of 323 mm and minimum weight 295 g. Gonadosomatic index of mature females ranged 9.0 to 25.0 %, mean absolute fecundity averaged 58.060 eggs.

A Floorplanning Algorithm with Minimum Total Length Wires

A floorplan is employed to represent the placement of modules in VLSI design. Floorplanning is a key step in the design of VLSI systems because it provides the first estimates of performance and cost including placement and routing. In this paper, we show an algorithm1 for initial global routing by the single-sequence (SS). The aim of our algorithm is to get a minimum chip area and the shortest total length of wires where the longest (critical) wire in every net is reduced to a minimum. The experimental results show that the design of placement and routing in floorplanning can be considered simultaneously by our algorithm, the efficiency of automatic layout in VLSI can be raised.

THE COMPLEXITY OF RIEMANN SURFACES AND THE HURWITZ EXISTENCE PROBLEM

The complexity of a branched cover of a Riemann surface M to the Riemann sphere S2 is defined as its degree times the hyperbolic area of the complement of its branching set in S2. The complexity of M is defined as the infimum of the complexities of all branched covers of M to S2. We prove that if M is a connected, closed, orientable Riemann surface of genus g≥1, then its complexity equals 2π(mmin+2g−2) , where mmin is the minimum total length of a branch datum realisable by a branched cover p:M→S2.