Approximations on minimum weight pseudo-triangulation problem using ant colony optimization

In this work, we consider the Minimum Weight Pseudo-Triangulation (MWPT) problem of a given set of n points in the plane. Globally optimal pseudo-triangulations with respect to the weight, as optimization criteria, are difficult to be found by deterministic methods, since no polynomial algorithm is known. We show how the Ant Colony Optimization (ACO) metaheuristic can be used to find high quality pseudo-triangulations of minimum weight. We present the experimental and statistical study based on our own set of instances since no reference to benchmarks for these problems were found in the literature. Throughout the experimental evaluation, we appraise the ACO metaheuristic performance for MWPT problem.

Minimum time control for multiphase buck converter: analysis and application

The combination of minimum time control and multiphase converter is a favorable option for dc-dc converters in applications where output voltage variation is required, such as RF amplifiers and dynamic voltage scaling in microprocessors, due to their advantage of fast dynamic response. In this paper, an improved minimum time control approach for multiphase buck converter that is based on charge balance technique, aiming at fast output voltage transition is presented. Compared with the traditional method, the proposed control takes into account the phase delay and current ripple in each phase. Therefore, by investigating the behavior of multiphase converter during voltage transition, it resolves the problem of current unbalance after the transient, which can lead to long settling time of the output voltage. The restriction of this control is that the output voltage that the converter can provide is related to the number of the phases, because only the duty cycles at which the multiphase converter has total ripple cancellation are used in this approach. The model of the proposed control is introduced, and the design constraints of the buck converters filter for this control are discussed. In order to prove the concept, a four-phase buck converter is implemented and the experimental results that validate the proposed control method are presented. The application of this control to RF envelope tracking is also presented in this paper.

Planar point sets with large minimum convex decompositions

We show the existence of sets with n points (n ? 4) for which every convex decomposition contains more than (35/32)n?(3/2) polygons,which refutes the conjecture that for every set of n points there is a convex decomposition with at most n+C polygons. For sets having exactly three extreme pointswe show that more than n+sqr(2(n ? 3))?4 polygons may be necessary to form a convex decomposition.

Consideration of tip speed limitations in preliminary analysis of minimum COE wind turbines

A relation between Cost Of Energy, COE, maximum allowed tip speed, and rated wind speed, is obtained for wind turbines with a given goal rated power. The wind regime is characterised by the corresponding parameters of the probability density function of wind speed. The non-dimensional characteristics of the rotor: number of blades, the blade radial distributions of local solidity, twist angle, and airfoil type, play the role of parameters in the mentioned relation. The COE is estimated using a cost model commonly used by the designers. This cost model requires basic design data such as the rotor radius and the ratio between the hub height and the rotor radius. Certain design options, DO, related to the technology of the power plant, tower and blades are also required as inputs. The function obtained for the COE can be explored to �nd those values of rotor radius that give rise to minimum cost of energy for a given wind regime as the tip speed limitation changes. The analysis reveals that iso-COE lines evolve parallel to iso-radius lines for large values of limit tip speed but that this is not the case for small values of the tip speed limits. It is concluded that, as the tip speed limit decreases, the optimum decision for keeping minimum COE values can be: a) reducing the rotor radius for places with high weibull scale parameter or b) increasing the rotor radius for places with low weibull scale parameter

Strategies for Minimum Distance in Simulated Evacuation of Transport Airplanes

The present paper describes the preliminary stages of the development of a new, comprehensive model conceived to simulate the evacuation of transport airplanes in certification studies. Two previous steps were devoted to implementing an efficient procedure to define the whole geometry of the cabin, and setting up an algorithm for assigning seats to available exits. Now, to clarify the role of the cabin arrangement in the evacuation process, the paper addresses the influence of several restrictions on the seat-to-exit assignment algorithm, maintaining a purely geometrical approach for consistency. Four situations are considered: first, an assignment method without limitations to search the minimum for the total distance run by all passengers along their escaping paths; second, a protocol that restricts the number of evacuees through each exit according to updated FAR 25 capacity; third, a procedure which tends to the best proportional sharing among exits but obliges to each passenger to egress through the nearest fore or rear exits; and fourth, a scenario which includes both restrictions. The four assignment strategies are applied to turboprops, and narrow body and wide body jets. Seat to exit distance and number of evacuees per exit are the main output variables. The results show the influence of airplane size and the impact of non-symmetries and inappropriate matching between size and longitudinal location of exits.

Evolutionary computation of forests with Degree- and Role-Constrained Minimum Spanning Trees

Finding the degree-constrained minimum spanning tree (DCMST) of a graph is a widely studied NP-hard problem. One of its most important applications is network design. Here we deal with a new variant of the DCMST problem, which consists of finding not only the degree- but also the role-constrained minimum spanning tree (DRCMST), i.e., we add constraints to restrict the role of the nodes in the tree to root, intermediate or leaf node. Furthermore, we do not limit the number of root nodes to one, thereby, generally, building a forest of DRCMSTs. The modeling of network design problems can benefit from the possibility of generating more than one tree and determining the role of the nodes in the network. We propose a novel permutation-based representation to encode these forests. In this new representation, one permutation simultaneously encodes all the trees to be built. We simulate a wide variety of DRCMST problems which we optimize using eight different evolutionary computation algorithms encoding individuals of the population using the proposed representation. The algorithms we use are: estimation of distribution algorithm, generational genetic algorithm, steady-state genetic algorithm, covariance matrix adaptation evolution strategy, differential evolution, elitist evolution strategy, non-elitist evolution strategy and particle swarm optimization. The best results are for the estimation of distribution algorithms and both types of genetic algorithms, although the genetic algorithms are significantly faster.

Minimum volume stability limits for axisymmetric liquid bridges subject to steady axial acceleration

In this paper the influence of an axial microgravity on the minimum volume stability limit of axisymmetric liquid bridges between unequal disks is analyzed both theoretically and experimentally. The results here presented extend the knowledge of the static behaviour of liquid bridges to fluid configurations different from those studied up to now (almost equal disks). Experimental results, obtained by simulating microgravity conditions by the neutral buoyancy technique, are also presented and are shown to be in complete agreement with theoretical ones.

Stability limits of minimum volume and breaking axisymmetric liquid bridges between unequal disks

This paper deals with the stability limits of minimum volume and the breaking of axisymmetric liquid columns held by capillary forces between two concentric,circular solid disk of different radii. The problem has been analyzed both theoreti-cally and experimentally. A theoretical analysis concerning the breaking of liquid bridges has been performed by using a one-dimensional slice model already used in liquid bridge problems. Experiments have been carried out by using milli-metric liquid bridges, and minimum volume stability limits as well as the volumes of the drops resulting after breaking have been measured for a large number of liquid bridge configurations. Experimental results being in agreement with theoretical prediction.

An experimental study of the breakage of liquid bridges at stability limit of minimum volume

An experimental apparatus to study the breaking process of axisymmetric liquid bridges has been developed, and the breaking sequences of a large number of liquid bridge configurations at minimum-volume stability limit have been analyzed. Experimental results show that very close to the breaking moment the neck radius of the liquid bridge varies as t1/3, where t is the time to breakage, irrespective of the value of the distance between the solid disks that support the liquid column.

Minimum volume for a liquid bridge between equal disks

The lower stability limit for axisymmetric floating zones at rest between equal coaxial disks has been experimentally verified for several disk-separation/disk-diameter ratios by using the neutral buoyancy technique. Results show a close agre ment with theory in the case of bridge disruption and a wide scatter in the case of bridge etachment.

Minimum volume of long liquid bridges between noncoaxial, nonequal diameter circular disks under lateral acceleration

The stability limit of minimum volume and the breaking dynamics of liquid bridges between nonequal, noncoaxial, circular supporting disks subject to a lateral acceleration were experimentally analyzed by working with liquid bridges of very small dimensions. Experimental results are compared with asymptotic theoretical predictions, with the agreement between experimental results and asymptotic ones being satisfactory

Minimum size limit for useful locomotion by free-swimming microbes

Formulas are derived for the effect of size on a free-swimming microbe’s ability to follow chemical, light, or temperature stimuli or to disperse in random directions. The four main assumptions are as follows: (i) the organisms can be modeled as spheres, (ii) the power available to the organism for swimming is proportional to its volume, (iii) the noise in measuring a signal limits determination of the direction of a stimulus, and (iv) the time available to determine stimulus direction or to swim a straight path is limited by rotational diffusion caused by Brownian motion. In all cases, it is found that there is a sharp size limit below which locomotion has no apparent benefit. This size limit is estimated to most probably be about 0.6 μm diameter and is relatively insensitive to assumed values of the other parameters. A review of existing descriptions of free-floating bacteria reveals that the smallest of 97 motile genera has a mean length of 0.8 μm, whereas 18 of 94 nonmotile genera are smaller. Similar calculations have led to the conclusion that a minimum size also exists for use of pheromones in mate location, although this size limit is about three orders of magnitude larger. In both cases, the application of well-established physical laws and biological generalities has demonstrated that a common feature of animal behavior is of no use to small free-swimming organisms.

Orthogonal combinatorial mutagenesis: a codon-level combinatorial mutagenesis method useful for low multiplicity and amino acid-scanning protocols

We describe here a method to generate combinatorial libraries of oligonucleotides mutated at the codon-level, with control of the mutagenesis rate so as to create predictable binomial distributions of mutants. The method allows enrichment of the libraries with single, double or larger multiplicity of amino acid replacements by appropriate choice of the mutagenesis rate, depending on the concentration of synthetic precursors. The method makes use of two sets of deoxynucleoside-phosphoramidites bearing orthogonal protecting groups [4,4′-dimethoxytrityl (DMT) and 9-fluorenylmethoxycarbonyl (Fmoc)] in the 5′ hydroxyl. These phosphoramidites are divergently combined during automated synthesis in such a way that wild-type codons are assembled with commercial DMT-deoxynucleoside-methyl-phosphoramidites while mutant codons are assembled with Fmoc-deoxynucleoside-methyl-phosphoramidites in an NNG/C fashion in a single synthesis column. This method is easily automated and suitable for low mutagenesis rates and large windows, such as those required for directed evolution and alanine scanning. Through the assembly of three oligonucleotide libraries at different mutagenesis rates, followed by cloning at the polylinker region of plasmid pUC18 and sequencing of 129 clones, we concluded that the method performs essentially as intended.

Brownian flocculation of polymer colloids in the presence of a secondary minimum

Most analyses of Brownian flocculation apply to conditions where London–van der Waals attractive forces cause particles to be strongly bound in a deep interparticle potential well. In this paper, results are reported that show the interaction between primary- and secondary-minimum flocculation when the interparticle potential curve reflects both attractive and electrostatic repulsive forces. The process is highly time-dependent because of transfer of particles from secondary- to primary-minimum flocculation. Essential features of the analysis are corroborated by experiments with 0.80-μm polystyrene spheres suspended in aqueous solutions of NaCl over a range of ionic strengths. In all cases, experiments were restricted to the initial stage of coagulation, where singlets and doublets predominate.