1,787 research outputs found

    The search for black hole binaries using a genetic algorithm

    Full text link
    In this work we use genetic algorithm to search for the gravitational wave signal from the inspiralling massive Black Hole binaries in the simulated LISA data. We consider a single signal in the Gaussian instrumental noise. This is a first step in preparation for analysis of the third round of the mock LISA data challenge. We have extended a genetic algorithm utilizing the properties of the signal and the detector response function. The performance of this method is comparable, if not better, to already existing algorithms.Comment: 11 pages, 4 figures, proceeding for GWDAW13 (Puerto Rico

    Towards 'smart lasers': self-optimisation of an ultrafast pulse source using a genetic algorithm

    Full text link
    Short-pulse fibre lasers are a complex dynamical system possessing a broad space of operating states that can be accessed through control of cavity parameters. Determination of target regimes is a multi-parameter global optimisation problem. Here, we report the implementation of a genetic algorithm to intelligently locate optimum parameters for stable single-pulse mode-locking in a Figure-8 fibre laser, and fully automate the system turn-on procedure. Stable ultrashort pulses are repeatably achieved by employing a compound fitness function that monitors both temporal and spectral output properties of the laser. Our method of encoding photonics expertise into an algorithm and applying machine-learning principles paves the way to self-optimising `smart' optical technologies

    Gene expression programming approach to event selection in high energy physics

    Get PDF
    Gene Expression Programming is a new evolutionary algorithm that overcomes many limitations of the more established Genetic Algorithms and Genetic Programming. Its first application to high energy physics data analysis is presented. The algorithm was successfully used for event selection on samples with both low and high background level. It allowed automatic identification of selection rules that can be interpreted as cuts applied on the input variables. The signal/background classification accuracy was over 90% in all cases

    PonyGE2: Grammatical Evolution in Python

    Full text link
    Grammatical Evolution (GE) is a population-based evolutionary algorithm, where a formal grammar is used in the genotype to phenotype mapping process. PonyGE2 is an open source implementation of GE in Python, developed at UCD's Natural Computing Research and Applications group. It is intended as an advertisement and a starting-point for those new to GE, a reference for students and researchers, a rapid-prototyping medium for our own experiments, and a Python workout. As well as providing the characteristic genotype to phenotype mapping of GE, a search algorithm engine is also provided. A number of sample problems and tutorials on how to use and adapt PonyGE2 have been developed.Comment: 8 pages, 4 figures, submitted to the 2017 GECCO Workshop on Evolutionary Computation Software Systems (EvoSoft

    An artificial immune systems based predictive modelling approach for the multi-objective elicitation of Mamdani fuzzy rules: a special application to modelling alloys

    Get PDF
    In this paper, a systematic multi-objective Mamdani fuzzy modeling approach is proposed, which can be viewed as an extended version of the previously proposed Singleton fuzzy modeling paradigm. A set of new back-error propagation (BEP) updating formulas are derived so that they can replace the old set developed in the singleton version. With the substitution, the extension to the multi-objective Mamdani Fuzzy Rule-Based Systems (FRBS) is almost endemic. Due to the carefully chosen output membership functions, the inference and the defuzzification methods, a closed form integral can be deducted for the defuzzification method, which ensures the efficiency of the developed Mamdani FRBS. Some important factors, such as the variable length coding scheme and the rule alignment, are also discussed. Experimental results for a real data set from the steel industry suggest that the proposed approach is capable of eliciting not only accurate but also transparent FRBS with good generalization ability

    Generalized disjunction decomposition for evolvable hardware

    Get PDF
    Evolvable hardware (EHW) refers to self-reconfiguration hardware design, where the configuration is under the control of an evolutionary algorithm (EA). One of the main difficulties in using EHW to solve real-world problems is scalability, which limits the size of the circuit that may be evolved. This paper outlines a new type of decomposition strategy for EHW, the “generalized disjunction decomposition” (GDD), which allows the evolution of large circuits. The proposed method has been extensively tested, not only with multipliers and parity bit problems traditionally used in the EHW community, but also with logic circuits taken from the Microelectronics Center of North Carolina (MCNC) benchmark library and randomly generated circuits. In order to achieve statistically relevant results, each analyzed logic circuit has been evolved 100 times, and the average of these results is presented and compared with other EHW techniques. This approach is necessary because of the probabilistic nature of EA; the same logic circuit may not be solved in the same way if tested several times. The proposed method has been examined in an extrinsic EHW system using the(1+lambda)(1 + lambda)evolution strategy. The results obtained demonstrate that GDD significantly improves the evolution of logic circuits in terms of the number of generations, reduces computational time as it is able to reduce the required time for a single iteration of the EA, and enables the evolution of larger circuits never before evolved. In addition to the proposed method, a short overview of EHW systems together with the most recent applications in electrical circuit design is provided

    Genetic-algorithm-optimized neural networks for gravitational wave classification

    Get PDF
    Gravitational-wave detection strategies are based on a signal analysis technique known as matched filtering. Despite the success of matched filtering, due to its computational cost, there has been recent interest in developing deep convolutional neural networks (CNNs) for signal detection. Designing these networks remains a challenge as most procedures adopt a trial and error strategy to set the hyperparameter values. We propose a new method for hyperparameter optimization based on genetic algorithms (GAs). We compare six different GA variants and explore different choices for the GA-optimized fitness score. We show that the GA can discover high-quality architectures when the initial hyperparameter seed values are far from a good solution as well as refining already good networks. For example, when starting from the architecture proposed by George and Huerta, the network optimized over the 20-dimensional hyperparameter space has 78% fewer trainable parameters while obtaining an 11% increase in accuracy for our test problem. Using genetic algorithm optimization to refine an existing network should be especially useful if the problem context (e.g. statistical properties of the noise, signal model, etc) changes and one needs to rebuild a network. In all of our experiments, we find the GA discovers significantly less complicated networks as compared to the seed network, suggesting it can be used to prune wasteful network structures. While we have restricted our attention to CNN classifiers, our GA hyperparameter optimization strategy can be applied within other machine learning settings.Comment: 25 pages, 8 figures, and 2 tables; Version 2 includes an expanded discussion of our hyperparameter optimization mode
    corecore