Femtosecond pulse shaping using differential evolutionary algorithm and wavelet operators

Evolutionary meta-algorithms for pulse shaping of broadband femtosecond duration laser pulses are proposed. The genetic algorithm searching the evolutionary landscape for desired pulse shapes consists of a population of waveforms (genes), each made from two concatenated vectors, specifying phases and magnitudes, respectively, over a range of frequencies. Frequency domain operators such as mutation, two-point crossover average crossover, polynomial phase mutation, creep and three-point smoothing as well as a time-domain crossover are combined to produce fitter offsprings at each iteration step. The algorithm applies roulette wheel selection; elitists and linear fitness scaling to the gene population. A differential evolution (DE) operator that provides a source of directed mutation and new wavelet operators are proposed. Using properly tuned parameters for DE, the meta-algorithm is used to solve a waveform matching problem. Tuning allows either a greedy directed search near the best known solution or a robust search across the entire parameter space.

A hybridised evolutionary algorithm for multi-criterion minimum spanning tree problems

A hybridised and Knowledge-based Evolutionary Algorithm (KEA) is applied to the multi-criterion minimum spanning tree problems. Hybridisation is used across its three phases. In the first phase a deterministic single objective optimization algorithm finds the extreme points of the Pareto front. In the second phase a K-best approach finds the first neighbours of the extreme points, which serve as an elitist parent population to an evolutionary algorithm in the third phase. A knowledge-based mutation operator is applied in each generation to reproduce individuals that are at least as good as the unique parent. The advantages of KEA over previous algorithms include its speed (making it applicable to large real-world problems), its scalability to more than two criteria, and its ability to find both the supported and unsupported optimal solutions.

Landscape state machines: Tools for evolutionary algorithm performance analyses and landscape/algorithm mapping

Many evolutionary algorithm applications involve either fitness functions with high time complexity or large dimensionality (hence very many fitness evaluations will typically be needed) or both. In such circumstances, there is a dire need to tune various features of the algorithm well so that performance and time savings are optimized. However, these are precisely the circumstances in which prior tuning is very costly in time and resources. There is hence a need for methods which enable fast prior tuning in such cases. We describe a candidate technique for this purpose, in which we model a landscape as a finite state machine, inferred from preliminary sampling runs. In prior algorithm-tuning trials, we can replace the 'real' landscape with the model, enabling extremely fast tuning, saving far more time than was required to infer the model. Preliminary results indicate much promise, though much work needs to be done to establish various aspects of the conditions under which it can be most beneficially used. A main limitation of the method as described here is a restriction to mutation-only algorithms, but there are various ways to address this and other limitations.

Parameter estimation based on stacked regression and evolutionary algorithms

A new parameter-estimation algorithm, which minimises the cross-validated prediction error for linear-in-the-parameter models, is proposed, based on stacked regression and an evolutionary algorithm. It is initially shown that cross-validation is very important for prediction in linear-in-the-parameter models using a criterion called the mean dispersion error (MDE). Stacked regression, which can be regarded as a sophisticated type of cross-validation, is then introduced based on an evolutionary algorithm, to produce a new parameter-estimation algorithm, which preserves the parsimony of a concise model structure that is determined using the forward orthogonal least-squares (OLS) algorithm. The PRESS prediction errors are used for cross-validation, and the sunspot and Canadian lynx time series are used to demonstrate the new algorithms.

Selfish genetic elements favor the evolution of a distinction between soma and germline

Many multicellular organisms have evolved a dedicated germline. This can benefit the whole organism, but its advantages to genetic parasites have not been explored. Here I model the evolutionary success of a selfish element, such as a transposable element or endosymbiont, which is capable of creating or strengthening a germline-soma distinction in a primitively multicellular host, and find that it will always benefit the element to do so. Genes causing germline sequestration can therefore spread in a population even if germline sequestration is maladaptive for the host organism. Costly selfish elements are expected to survive only in sexual populations, so sexual species may experience an additional push toward germline-soma distinction, and hence toward cell differentiation and multicellularity.

Exploration vs exploitation in differential evolution

Differential Evolution (DE) is a tool for efficient optimisation, and it belongs to the class of evolutionary algorithms, which include Evolution Strategies and Genetic Algorithms. DE algorithms work well when the population covers the entire search space, and they have shown to be effective on a large range of classical optimisation problems. However, an undesirable behaviour was detected when all the members of the population are in a basin of attraction of a local optimum (local minimum or local maximum), because in this situation the population cannot escape from it. This paper proposes a modification of the standard mechanisms in DE algorithm in order to change the exploration vs. exploitation balance to improve its behaviour.

Quantitative genetic divergence and standing genetic (co)variance in thermal reaction norms along latitude

Although the potential to adapt to warmer climate is constrained by genetic trade-offs, our understanding of how selection and mutation shape genetic (co)variances in thermal reaction norms is poor. Using 71 isofemale lines of the fly Sepsis punctum, originating from northern, central, and southern European climates, we tested for divergence in juvenile development rate across latitude at five experimental temperatures. To investigate effects of evolutionary history in different climates on standing genetic variation in reaction norms, we further compared genetic (co)variances between regions. Flies were reared on either high or low food resources to explore the role of energy acquisition in determining genetic trade-offs between different temperatures. Although the latter had only weak effects on the strength and sign of genetic correlations, genetic architecture differed significantly between climatic regions, implying that evolution of reaction norms proceeds via different trajectories at high latitude versus low latitude in this system. Accordingly, regional genetic architecture was correlated to region-specific differentiation. Moreover, hot development temperatures were associated with low genetic variance and stronger genetic correlations compared to cooler temperatures. We discuss the evolutionary potential of thermal reaction norms in light of their underlying genetic architectures, evolutionary histories, and the materialization of trade-offs in natural environments.

Mutations in H5N1 influenza virus hemagglutinin that confer binding to human tracheal airway epithelium

The emergence in 2009 of a swine-origin H1N1 influenza virus as the first pandemic of the 21st Century is a timely reminder of the international public health impact of influenza viruses, even those associated with mild disease. The widespread distribution of highly pathogenic H5N1 influenza virus in the avian population has spawned concern that it may give rise to a human influenza pandemic. The mortality rate associated with occasional human infection by H5N1 virus approximates 60%, suggesting that an H5N1 pandemic would be devastating to global health and economy. To date, the H5N1 virus has not acquired the propensity to transmit efficiently between humans. The reasons behind this are unclear, especially given the high mutation rate associated with influenza virus replication. Here we used a panel of recombinant H5 hemagglutinin (HA) variants to demonstrate the potential for H5 HA to bind human airway epithelium, the predominant target tissue for influenza virus infection and spread. While parental H5 HA exhibited limited binding to human tracheal epithelium, introduction of selected mutations converted the binding profile to that of a current human influenza strain HA. Strikingly, these amino-acid changes required multiple simultaneous mutations in the genomes of naturally occurring H5 isolates. Moreover, H5 HAs bearing intermediate sequences failed to bind airway tissues and likely represent mutations that are an evolutionary "dead end." We conclude that, although genetic changes that adapt H5 to human airways can be demonstrated, they may not readily arise during natural virus replication. This genetic barrier limits the likelihood that current H5 viruses will originate a human pandemic.

Genetic least squares for system identification

The recursive least-squares algorithm with a forgetting factor has been extensively applied and studied for the on-line parameter estimation of linear dynamic systems. This paper explores the use of genetic algorithms to improve the performance of the recursive least-squares algorithm in the parameter estimation of time-varying systems. Simulation results show that the hybrid recursive algorithm (GARLS), combining recursive least-squares with genetic algorithms, can achieve better results than the standard recursive least-squares algorithm using only a forgetting factor.

Chromatographic alignment of LC-MS and LC-MS/MS datasets by genetic algorithm feature extraction

Liquid chromatography-mass spectrometry (LC-MS) datasets can be compared or combined following chromatographic alignment. Here we describe a simple solution to the specific problem of aligning one LC-MS dataset and one LC-MS/MS dataset, acquired on separate instruments from an enzymatic digest of a protein mixture, using feature extraction and a genetic algorithm. First, the LC-MS dataset is searched within a few ppm of the calculated theoretical masses of peptides confidently identified by LC-MS/MS. A piecewise linear function is then fitted to these matched peptides using a genetic algorithm with a fitness function that is insensitive to incorrect matches but sufficiently flexible to adapt to the discrete shifts common when comparing LC datasets. We demonstrate the utility of this method by aligning ion trap LC-MS/MS data with accurate LC-MS data from an FTICR mass spectrometer and show how hybrid datasets can improve peptide and protein identification by combining the speed of the ion trap with the mass accuracy of the FTICR, similar to using a hybrid ion trap-FTICR instrument. We also show that the high resolving power of FTICR can improve precision and linear dynamic range in quantitative proteomics. The alignment software, msalign, is freely available as open source.

Self-tuning proportional, integral and derivative controller based on genetic algorithm least squares

A self-tuning proportional, integral and derivative control scheme based on genetic algorithms (GAs) is proposed and applied to the control of a real industrial plant. This paper explores the improvement in the parameter estimator, which is an essential part of an adaptive controller, through the hybridization of recursive least-squares algorithms by making use of GAs and the possibility of the application of GAs to the control of industrial processes. Both the simulation results and the experiments on a real plant show that the proposed scheme can be applied effectively.

Variable selection for financial distress classification using a genetic algorithm

This paper is concerned with the use of a genetic algorithm to select financial ratios for corporate distress classification models. For this purpose, the fitness value associated to a set of ratios is made to reflect the requirements of maximizing the amount of information available for the model and minimizing the collinearity between the model inputs. A case study involving 60 failed and continuing British firms in the period 1997-2000 is used for illustration. The classification model based on ratios selected by the genetic algorithm compares favorably with a model employing ratios usually found in the financial distress literature.

A genetic algorithm for the design of a fuzzy controller for active queue management

Active queue management (AQM) policies are those policies of router queue management that allow for the detection of network congestion, the notification of such occurrences to the hosts on the network borders, and the adoption of a suitable control policy. This paper proposes the adoption of a fuzzy proportional integral (FPI) controller as an active queue manager for Internet routers. The analytical design of the proposed FPI controller is carried out in analogy with a proportional integral (PI) controller, which recently has been proposed for AQM. A genetic algorithm is proposed for tuning of the FPI controller parameters with respect to optimal disturbance rejection. In the paper the FPI controller design metodology is described and the results of the comparison with random early detection (RED), tail drop, and PI controller are presented.

Efficient operator pipelining in a bit serial genetic algorithm engine

The authors propose a bit serial pipeline used to perform the genetic operators in a hardware genetic algorithm. The bit-serial nature of the dataflow allows the operators to be pipelined, resulting in an architecture which is area efficient, easily scaled and is independent of the lengths of the chromosomes. An FPGA implementation of the device achieves a throughput of >25 million genes per second