Propulsion at the microscale requires unique strategies such as the undulating or rotating filaments that microorganisms have evolved to swim. These features however can be difficult to artificially replicate and control, limiting the ability to actuate and direct engineered microdevices to targeted locations within practical timeframes. An alternative propulsion strategy to swimming is rolling...

This paper describes two elitism-based compact genetic algorithms (cGAs)—persistent elitist compact genetic algorithm (pe-cGA), and nonpersistent elitist compact genetic algorithm (ne-cGA). The aim is to design efficient compact-type GAs by treating them as estimation of distribution algorithms (EDAs) for solving difficult optimization problems without compromising on memory and computation cos...

The urinary metabolomic study based on gas chromatography-mass spectrometry (GC-MS) had been developed to investigate the possible antidepressant mechanism of chlorogenic acid (CGA) in a rat model of sleep deprivation (SD). According to pattern recognition analysis, there was a clear separation among big platform group (BP), sleep deprivation group (SD), and the CGA (model + CGA), and CGA group...

An analytical expression of Coulomb interaction between a sphere and a cylindrical rod was derived. Along with a recently reported van der Waals interaction expression, the derived Coulomb interaction expression, for the first time, allows one to quantitatively evaluate the activation energy in the oriented attachment growth of colloidal nanorods.

Cellular Genetic Algorithms (cGA) are spatially distributed Genetic Algorithms that, because of their high level of diversity, are superior to regular GAs on several optimization functions. Also, since these distributed algorithms only require communication between few closely arranged individuals, they are very suitable for a parallel implementation. We propose a new kind of cGA, called hierar...

It has been a well-known fact that genetic algorithms (GAs) get part of their success from the efficient exploration/exploitation balance. This equilibrium is related to the population diversity decreasing rate. This rate is not the same for all GAs, but it depends on the reproductive cycle being used. In particular, steady-state (μ+1)-GAs (ssGA) have a larger convergence rate than traditional ...

Nurse scheduling problem (NSPs) represents a diicult class of Multi-objective optimization problems consisting of a number of interfering objectives between the hospitals and individual nurses. The objective of this research is to investigate diiculties that occur during solution of NSP using Evolutionary Algorithms, in particular Genetic Algorithms (GA). As the solution method a population-les...

An augmented compact genetic algorithm (acGA) is presented in this paper. It exhibits all the desirable characteristics of compact genetic algorithm (cGA). While the selection strategy of cGA is similar to (steady-state) tournament selection with replacement (TSR), the proposed algorithm employs a strategy akin to tournament selection without replacement (TS/R). The latter is a common feature o...

The distance-resolved effective interaction between two colloidal particles in a subcritical solvent is explored both by an explicit and implicit modeling. An implicit solvent approach based on a simple thermodynamic interface model is tested against grand-canonical Monte Carlo computer simulations using explicit Lennard-Jones solvent molecules. Close to liquid-gas coexistence, a joint gas bubb...

Mixtures of colloids and polymers display a rich phase behavior, involving colloidal gas (rich in polymer, poor in colloid), colloidal liquid (poor in polymer, rich in colloid) and colloidal crystal phases (poor in polymer, highly ordered colloids). Recently, the colloidal gas-colloidal liquid interface received considerable attention as well. Due to the colloidal length scale the interfacial t...