A simple two-module problem to exemplify building-block assembly under crossover

Theoretically and empirically it is clear that a genetic algorithm with crossover will outperform a genetic algorithm without crossover in some fitness landscapes, and vice versa in other landscapes. Despite an extensive literature on the subject, and recent proofs of a principled distinction in the abilities of crossover and non-crossover algorithms for a particular theoretical landscape, building general intuitions about when and why crossover performs well when it does is a different matter. In particular, the proposal that crossover might enable the assembly of good building-blocks has been difficult to verify despite many attempts at idealized building-block landscapes. Here we show the first example of a two-module problem that shows a principled advantage for cross-over. This allows us to understand building-block assembly under crossover quite straightforwardly and build intuition about more general landscape classes favoring crossover or disfavoring it

Generic systolic array for genetic algorithms

The authors present a systolic design for a simple GA mechanism which provides high throughput and unidirectional pipelining by exploiting the inherent parallelism in the genetic operators. The design computes in O(N+G) time steps using O(N2) cells where N is the population size and G is the chromosome length. The area of the device is independent of the chromosome length and so can be easily scaled by replicating the arrays or by employing fine-grain migration. The array is generic in the sense that it does not rely on the fitness function and can be used as an accelerator for any GA application using uniform crossover between pairs of chromosomes. The design can also be used in hybrid systems as an add-on to complement existing designs and methods for fitness function acceleration and island-style population managemen

Identifying component modules

A computer-based system for modelling component dependencies and identifying component modules is presented. A variation of the Dependency Structure Matrix (DSM) representation was used to model component dependencies. The system utilises a two-stage approach towards facilitating the identification of a hierarchical modular structure. The first stage calculates a value for a clustering criterion that may be used to group component dependencies together. A Genetic Algorithm is described to optimise the order of the components within the DSM with the focus of minimising the value of the clustering criterion to identify the most significant component groupings (modules) within the product structure. The second stage utilises a 'Module Strength Indicator' (MSI) function to determine a value representative of the degree of modularity of the component groupings. The application of this function to the DSM produces a 'Module Structure Matrix' (MSM) depicting the relative modularity of available component groupings within it. The approach enabled the identification of hierarchical modularity in the product structure without the requirement for any additional domain specific knowledge within the system. The system supports design by providing mechanisms to explicitly represent and utilise component and dependency knowledge to facilitate the nontrivial task of determining near-optimal component modules and representing product modularity

A new pheromone trail-based genetic algorithm for comparative genome assembly

Gap closing is considered one of the most challenging and time-consuming tasks in bacterial genome sequencing projects, especially with the emergence of new sequencing technologies, such as pyrosequencing, which may result in large amounts of data without the benefit of large insert libraries for contig scaffolding. We propose a novel algorithm to align contigs with more than one reference genome at a time. This approach can successfully overcome the limitations of low degrees of conserved gene order for the reference and target genomes. A pheromone trail-based genetic algorithm (PGA) was used to search globally for the optimal placement for each contig. Extensive testing on simulated and real data sets shows that PGA significantly outperforms previous methods, especially when assembling genomes that are only moderately related. An extended version of PGA can predict additional candidate connections for each contig and can thus increase the likelihood of identifying the correct arrangement of each contig. The software and test data sets can be accessed at http://sourceforge.net/projects/pga4genomics/

Legacy effects of grassland management on soil carbon to depth

The importance of managing land to optimise carbon sequestration for climate change mitigation is widely recognised, with grasslands being identified as having the potential to sequester additional carbon. However, most soil carbon inventories only consider surface soils, and most large scale surveys group ecosystems into broad habitats without considering management intensity. Consequently, little is known about the quantity of deep soil carbon and its sensitivity to management. From a nationwide survey of grassland soils to 1 m depth, we show that carbon in grasslands soils is vulnerable to management and that these management effects can be detected to considerable depth down the soil profile, albeit at decreasing significance with depth. Carbon concentrations in soil decreased as management intensity increased, but greatest soil carbon stocks (accounting for bulk density differences), were at intermediate levels of management. Our study also highlights the considerable amounts of carbon in sub-surface soil below 30cm, which is missed by standard carbon inventories. We estimate grassland soil carbon in Great Britain to be 2097 Tg C to a depth of 1 m, with ~60% of this carbon being below 30cm. Total stocks of soil carbon (t ha-1) to 1 m depth were 10.7% greater at intermediate relative to intensive management, which equates to 10.1 t ha-1 in surface soils (0-30 cm), and 13.7 t ha-1 in soils from 30-100 cm depth. Our findings highlight the existence of substantial carbon stocks at depth in grassland soils that are sensitive to management. This is of high relevance globally, given the extent of land cover and large stocks of carbon held in temperate managed grasslands. Our findings have implications for the future management of grasslands for carbon storage and climate mitigation, and for global carbon models which do not currently account for changes in soil carbon to depth with management

Toward energy Autonomy in heterogeneous Modular Plant-Inspired Robots through Artificial evolution

Contemporary robots perform energy intensive tasks—e.g., manipulation and locomotion—making the development of energy autonomous robots challenging. Since plants are primary energy producers in natural ecosystems, we took plants as a source of inspiration for designing our robotics platform. This led us to investigate energy autonomy in robots through employing solar panels. As plants move slowly compared to other large terrestrial organisms, it is expected that plant-inspired robots can enable robotic applications, such as long-term monitoring and exploration, where energy consumption could be minimized. Since it is difficult to manually design robotic systems that adhere to full energy autonomy, we utilize evolutionary algorithms to automate the design and evaluation of energy harvesting robots. We demonstrate how artificial evolution can lead to the design and control of a modular plant-like robot. Robotic phenotypes were acquired through implementing an evolutionary algorithm, a generative encoding and modular building blocks in a simulation environment. The generative encoding is based on a context sensitive Lindenmayer-System (L-System) and the evolutionary algorithm is used to optimize compositions of heterogeneous modular building blocks in the simulation environment. Phenotypes that evolved from the simulation environment are in turn transferred to a physical robot platform. The robotics platform consists of five different types of modules: (1) a base module, (2) a cube module, (3) servo modules, and (4,5) two types of solar panel modules that are used to harvest energy. The control system for the platform is initially evolved in the simulation environment and afterward transferred to an actual physical robot. A few experiments were done showing the relationship between energy cost and the amount of light tracking that evolved in the simulation. The reconfigurable modular robots are eventually used to harvest light with the possibility to be reconfigured based on the needs of the designer, the type of usable modules, and/or the optimal configuration derived from the simulation environment. Long-term energy autonomy has not been tested in this robotics platform. However, we think our robotics platform can serve as a stepping stone toward full energy autonomy in modular robots

Detection of severe obstructive sleep apnea through voice analysis

tThis paper deals with the potential and limitations of using voice and speech processing to detect Obstruc-tive Sleep Apnea (OSA). An extensive body of voice features has been extracted from patients whopresent various degrees of OSA as well as healthy controls. We analyse the utility of a reduced set offeatures for detecting OSA. We apply various feature selection and reduction schemes (statistical rank-ing, Genetic Algorithms, PCA, LDA) and compare various classifiers (Bayesian Classifiers, kNN, SupportVector Machines, neural networks, Adaboost). S-fold crossvalidation performed on 248 subjects showsthat in the extreme cases (that is, 127 controls and 121 patients with severe OSA) voice alone is able todiscriminate quite well between the presence and absence of OSA. However, this is not the case withmild OSA and healthy snoring patients where voice seems to play a secondary role. We found that thebest classification schemes are achieved using a Genetic Algorithm for feature selection/reduction

A case study of controlling crossover in a selection hyper-heuristic framework using the multidimensional knapsack problem

Hyper-heuristics are high-level methodologies for solving complex problems that operate on a search space of heuristics. In a selection hyper-heuristic framework, a heuristic is chosen from an existing set of low-level heuristics and applied to the current solution to produce a new solution at each point in the search. The use of crossover low-level heuristics is possible in an increasing number of general-purpose hyper-heuristic tools such as HyFlex and Hyperion. However, little work has been undertaken to assess how best to utilise it. Since a single-point search hyper-heuristic operates on a single candidate solution, and two candidate solutions are required for crossover, a mechanism is required to control the choice of the other solution. The frameworks we propose maintain a list of potential solutions for use in crossover. We investigate the use of such lists at two conceptual levels. First, crossover is controlled at the hyper-heuristic level where no problem-specific information is required. Second, it is controlled at the problem domain level where problem-specific information is used to produce good-quality solutions to use in crossover. A number of selection hyper-heuristics are compared using these frameworks over three benchmark libraries with varying properties for an NP-hard optimisation problem: the multidimensional 0-1 knapsack problem. It is shown that allowing crossover to be managed at the domain level outperforms managing crossover at the hyper-heuristic level in this problem domain. © 2016 Massachusetts Institute of Technolog