Evolutionary tuning of SVM parameter values in multiclass problems

Support vector machines (SVMs) were originally formulated for the solution of binary classification problems. In multiclass problems, a decomposition approach is often employed, in which the multiclass problem is divided into multiple binary subproblems, whose results are combined. Generally, the performance of SVM classifiers is affected by the selection of values for their parameters. This paper investigates the use of genetic algorithms (GAs) to tune the parameters of the binary SVMs in common multiclass decompositions. The developed GA may search for a set of parameter values common to all binary classifiers or for differentiated values for each binary classifier. (C) 2008 Elsevier B.V. All rights reserved.

Power flow optimization for grid connected inverter using evolutionary algorithm and additional control loop

In this work it is proposed to validate an evolutionary tuning algorithm in plants composed by a grid connected inverter. The optimization aims the tuning of the slopes of P-Ω and Q-V curves so that the system is stable, damped and minimum settling time. Simulation and experimental results are presented to prove the feasibility of the proposed approach. However, experimental results demonstrate a compromising effect of grid frequency oscillations in the active power transferring. In addition, it was proposed an additional loop to compensate this effect ensuring a constant active power flow. © 2011 IEEE.

Evolutionary optimization applied for fine-tuning parameter estimation in optical flow-based environments

Optical flow methods are accurate algorithms for estimating the displacement and velocity fields of objects in a wide variety of applications, being their performance dependent on the configuration of a set of parameters. Since there is a lack of research that aims to automatically tune such parameters, in this work we have proposed an evolutionary-based framework for such task, thus introducing three techniques for such purpose: Particle Swarm Optimization, Harmony Search and Social-Spider Optimization. The proposed framework has been compared against with the well-known Large Displacement Optical Flow approach, obtaining the best results in three out eight image sequences provided by a public dataset. Additionally, the proposed framework can be used with any other optimization technique.

Multi-objective adaptive evolutionary strategy for tuning compilations

Tuning compilations is the process of adjusting the values of a compiler options to improve some features of the final application. In this paper, a strategy based on the use of a genetic algorithm and a multi-objective scheme is proposed to deal with this task. Unlike previous works, we try to take advantage of the knowledge of this domain to provide a problem-specific genetic operation that improves both the speed of convergence and the quality of the results. The evaluation of the strategy is carried out by means of a case of study aimed to improve the performance of the well-known web server Apache. Experimental results show that a 7.5% of overall improvement can be achieved. Furthermore, the adaptive approach has shown an ability to markedly speed-up the convergence of the original strategy.

Automatic tuning method for the design of supplementary damping controllers for flexible alternating current transmission system devices

The design of supplementary damping controllers to mitigate the effects of electromechanical oscillations in power systems is a highly complex and time-consuming process, which requires a significant amount of knowledge from the part of the designer. In this study, the authors propose an automatic technique that takes the burden of tuning the controller parameters away from the power engineer and places it on the computer. Unlike other approaches that do the same based on robust control theories or evolutionary computing techniques, our proposed procedure uses an optimisation algorithm that works over a formulation of the classical tuning problem in terms of bilinear matrix inequalities. Using this formulation, it is possible to apply linear matrix inequality solvers to find a solution to the tuning problem via an iterative process, with the advantage that these solvers are widely available and have well-known convergence properties. The proposed algorithm is applied to tune the parameters of supplementary controllers for thyristor controlled series capacitors placed in the New England/New York benchmark test system, aiming at the improvement of the damping factor of inter-area modes, under several different operating conditions. The results of the linear analysis are validated by non-linear simulation and demonstrate the effectiveness of the proposed procedure.

Optimal tuning of fractional controllers using genetic algorithms

This study addresses the optimization of fractional algorithms for the discrete-time control of linear and non-linear systems. The paper starts by analyzing the fundamentals of fractional control systems and genetic algorithms. In a second phase the paper evaluates the problem in an optimization perspective. The results demonstrate the feasibility of the evolutionary strategy and the adaptability to distinct types of systems.

Automated design of microwave discrete tuning differential capacitance circuits in Si-integrated technologies

A genetic algorithm used to design radio-frequency binary-weighted differential switched capacitor arrays (RFDSCAs) is presented in this article. The algorithm provides a set of circuits all having the same maximum performance. This article also describes the design, implementation, and measurements results of a 0.25 lm BiCMOS 3-bit RFDSCA. The experimental results show that the circuit presents the expected performance up to 40 GHz. The similarity between the evolutionary solutions, circuit simulations, and measured results indicates that the genetic synthesis method is a very useful tool for designing optimum performance RFDSCAs.

Evolutionary origin and functions of retrogene introns.

Retroposed genes (retrogenes) originate via the reverse transcription of mature messenger RNAs from parental source genes and are therefore usually devoid of introns. Here, we characterize a particular set of mammalian retrogenes that acquired introns upon their emergence and thus represent rare cases of intron gain in mammals. We find that although a few retrogenes evolved introns in their coding or 3' untranslated regions (untranslated region, UTR), most introns originated together with untranslated exons in the 5' flanking regions of the retrogene insertion site. They emerged either de novo or through fusions with 5' UTR exons of host genes into which the retrogenes inserted. Generally, retrogenes with introns display high transcription levels and show broader spatial expression patterns than other retrogenes. Our experimental expression analyses of individual intron-containing retrogenes show that 5' UTR introns may indeed promote higher expression levels, at least in part through encoded regulatory elements. By contrast, 3' UTR introns may lead to downregulation of expression levels via nonsense-mediated decay mechanisms. Notably, the majority of retrogenes with introns in their 5' flanks depend on distant, sometimes bidirectional CpG dinucleotide-enriched promoters for their expression that may be recruited from other genes in the genomic vicinity. We thus propose a scenario where the acquisition of new 5' exon-intron structures was directly linked to the recruitment of distant promoters by these retrogenes, a process potentially facilitated by the presence of proto-splice sites in the genomic vicinity of retrogene insertion sites. Thus, the primary role and selective benefit of new 5' introns (and UTR exons) was probably initially to span the often substantial distances to potent CpG promoters driving retrogene transcription. Later in evolution, these introns then obtained additional regulatory roles in fine tuning retrogene expression levels. Our study provides novel insights regarding mechanisms underlying the origin of new introns, the evolutionary relevance of intron gain, and the origin of new gene promoters.

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.

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.

Optimized dynamic response of parallel operation of two single phase inverters based on evolutionary theory

In this work it is proposed an optimized dynamic response of parallel operation of two single-phase inverters with no control communication. The optimization aims the tuning of the slopes of P-ω and Q-V curves so that the system is stable, damped and minimum settling time. The slopes are tuned using an algorithm based on evolutionary theory. Simulation and experimental results are presented to prove the feasibility of the proposed approach. © 2010 IEEE.

GRASP with evolutionary path-relinking for the capacitated arc routing problem

The Capacitated Arc Routing Problem (CARP) is a well-known NP-hard combinatorial optimization problem where, given an undirected graph, the objective is to find a minimum cost set of tours servicing a subset of required edges under vehicle capacity constraints. There are numerous applications for the CARP, such as street sweeping, garbage collection, mail delivery, school bus routing, and meter reading. A Greedy Randomized Adaptive Search Procedure (GRASP) with Path-Relinking (PR) is proposed and compared with other successful CARP metaheuristics. Some features of this GRASP with PR are (i) reactive parameter tuning, where the parameter value is stochastically selected biased in favor of those values which historically produced the best solutions in average; (ii) a statistical filter, which discard initial solutions if they are unlikely to improve the incumbent best solution; (iii) infeasible local search, where high-quality solutions, though infeasible, are used to explore the feasible/infeasible boundaries of the solution space; (iv) evolutionary PR, a recent trend where the pool of elite solutions is progressively improved by successive relinking of pairs of elite solutions. Computational tests were conducted using a set of 81 instances, and results reveal that the GRASP is very competitive, achieving the best overall deviation from lower bounds and the highest number of best solutions found. © 2011 Elsevier Ltd. All rights reserved.

Molecular and evolutionary genetics of the X -linked visual pigment genes in humans and New World monkeys

Normal humans have one red and at least one green visual pigment genes. These genes are tightly linked as tandem repeats on the X chromosome and each of them has six exons. There is only one X-linked visual pigment gene in New World monkeys (NWMs) but the locus has three polymorphic alleles encoding red, yellow and green visual pigments, respectively. The spectral properties of the squirrel monkey and the marmoset (both NWMs) have been studied and partial sequences of the three alleles are available. To study the evolutionary history of these X-linked opsin genes in humans and NWMs, coding and intron sequences of the three squirrel monkey alleles and the three marmoset alleles were amplified by PCR followed by subcloning and sequencing. Introns 2 and 4 of the human red and green pigment genes were also sequenced. The results obtained are as follows: (1) The sequences of introns 2 and 4 of the human red and green opsin genes are significantly more similar between the two genes than are coding sequences, contrary to the usual situation where coding regions are better conserved in evolution than are introns. The high similarities in the two introns are probably due to recent gene conversion events during evolution of the human lineage. (2) Phylogenetic analysis of both intron and exon sequences indicates that the phylogenetic tree of the available primate opsin genes is the same as the species tree. The two human genes were derived from a gene duplication event after the divergence of the human and NWM lineages. The three alleles in each of the two NWM species diverged after the split of the two NWMs but have persisted in the population for at least 5 million years. (3) Allelic gene conversion might have occurred between the three squirrel monkey alleles. (4) A model of additive effect of hydroxyl-bearing amino acids on spectral tuning is proposed by treating some unknown variables as groups. Under the assumption that some residues have no effect, it is found that at least five amino acid residues, at positions 178 (3 nm), 180 (5 nm), 230 ($-$4 nm), 277 (9 nm) and 285 (13 nm), have linear spectral tuning effects. (5) Adaptive evolution of the opsin genes to different spectral peaks was observed at four residues that are important for spectral tuning. ^

Tuning compilations by multi-objective optimization: Application to Apache web server

Modern compilers present a great and ever increasing number of options which can modify the features and behavior of a compiled program. Many of these options are often wasted due to the required comprehensive knowledge about both the underlying architecture and the internal processes of the compiler. In this context, it is usual, not having a single design goal but a more complex set of objectives. In addition, the dependencies between different goals are difficult to be a priori inferred. This paper proposes a strategy for tuning the compilation of any given application. This is accomplished by using an automatic variation of the compilation options by means of multi-objective optimization and evolutionary computation commanded by the NSGA-II algorithm. This allows finding compilation options that simultaneously optimize different objectives. The advantages of our proposal are illustrated by means of a case study based on the well-known Apache web server. Our strategy has demonstrated an ability to find improvements up to 7.5% and up to 27% in context switches and L2 cache misses, respectively, and also discovers the most important bottlenecks involved in the application performance.

Tuning The Surface Anisotropy In Fe-doped Nio Nanoparticles.

Ni(1-x)FexO nanoparticles have been obtained by the co-precipitation chemical route. X-ray diffraction analyses using Rietveld refinement have shown a slight decrease in the microstrain and mean particle size as a function of the Fe content. The zero-field-cooling (ZFC) and field-cooling (FC) magnetization curves show superparamagnetic behavior at high temperatures and a low temperature peak (at T = 11 K), which is enhanced with increasing Fe concentration. Unusual behavior of the coercive field in the low temperature region and an exchange bias behavior were also observed. A decrease in the Fe concentration induces an increase in the exchange bias field. We argue that these behaviors can be linked with the strengthening of surface anisotropy caused by the incorporation of Fe ions.