6,120 research outputs found
Born to learn: The inspiration, progress, and future of evolved plastic artificial neural networks
Biological plastic neural networks are systems of extraordinary computational
capabilities shaped by evolution, development, and lifetime learning. The
interplay of these elements leads to the emergence of adaptive behavior and
intelligence. Inspired by such intricate natural phenomena, Evolved Plastic
Artificial Neural Networks (EPANNs) use simulated evolution in-silico to breed
plastic neural networks with a large variety of dynamics, architectures, and
plasticity rules: these artificial systems are composed of inputs, outputs, and
plastic components that change in response to experiences in an environment.
These systems may autonomously discover novel adaptive algorithms, and lead to
hypotheses on the emergence of biological adaptation. EPANNs have seen
considerable progress over the last two decades. Current scientific and
technological advances in artificial neural networks are now setting the
conditions for radically new approaches and results. In particular, the
limitations of hand-designed networks could be overcome by more flexible and
innovative solutions. This paper brings together a variety of inspiring ideas
that define the field of EPANNs. The main methods and results are reviewed.
Finally, new opportunities and developments are presented
Coronal hole boundaries evolution at small scales: I. EIT 195 A and TRACE 171 A view
We aim at studying the small-scale evolution at the boundaries of an
equatorial coronal hole connected with a channel of open magnetic flux with the
polar region and an `isolated' one in the extreme-ultraviolet spectral range.
We intend to determine the spatial and temporal scale of these changes. Imager
data from TRACE in the Fe IX/X 171 A passband and EIT on-board Solar and
Heliospheric Observatory in the Fe XII 195 A passband were analysed. We found
that small-scale loops known as bright points play an essential role in coronal
holes boundaries evolution at small scales. Their emergence and disappearance
continuously expand or contract coronal holes. The changes appear to be random
on a time scale comparable with the lifetime of the loops seen at these
temperatures. No signature was found for a major energy release during the
evolution of the loops. Although coronal holes seem to maintain their general
shape during a few solar rotations, a closer look at their day-by-day and even
hour-by-hour evolution demonstrates a significant dynamics. The small-scale
loops (10" - 40" and smaller) which are abundant along coronal hole boundaries
have a contribution to the small-scale evolution of coronal holes. Continuous
magnetic reconnection of the open magnetic field lines of the coronal hole and
the closed field lines of the loops in the quiet Sun is more likely to take
place.Comment: 7 pages, 6 figures. in press in A&
A heuristic-based approach to code-smell detection
Encapsulation and data hiding are central tenets of the object oriented paradigm. Deciding what data and behaviour to form into a class and where to draw the line between its public and private details can make the difference between a class that is an understandable, flexible and reusable abstraction and one which is not. This decision is a difficult one and may easily result in poor encapsulation which can then have serious implications for a number of system qualities. It is often hard to identify such encapsulation problems within large software systems until they cause a maintenance problem (which is usually too late) and attempting to perform such analysis manually can also be tedious and error prone. Two of the common encapsulation problems that can arise as a consequence of this decomposition process are data classes and god classes. Typically, these two problems occur together â data classes are lacking in functionality that has typically been sucked into an over-complicated and domineering god class. This paper describes the architecture of a tool which automatically detects data and god classes that has been developed as a plug-in for the Eclipse IDE. The technique has been evaluated in a controlled study on two large open source systems which compare the tool results to similar work by Marinescu, who employs a metrics-based approach to detecting such features. The study provides some valuable insights into the strengths and weaknesses of the two approache
The emerging structure of the Extended Evolutionary Synthesis: where does Evo-Devo fit in?
The Extended Evolutionary Synthesis (EES) debate is gaining ground in contemporary evolutionary biology. In parallel, a number of philosophical standpoints have emerged in an attempt to clarify what exactly is represented by the EES. For Massimo Pigliucci, we are in the wake of the newest instantiation of a persisting Kuhnian paradigm; in contrast, Telmo Pievani has contended that the transition to an EES could be best represented as a progressive reformation of a prior Lakatosian scientific research program, with the extension of its Neo-Darwinian core and the addition of a brand-new protective belt of assumptions and auxiliary hypotheses. Here, we argue that those philosophical vantage points are not the only ways to interpret what current proposals to âextendâ the Modern Synthesis-derived âstandard evolutionary theoryâ (SET) entail in terms of theoretical change in evolutionary biology. We specifically propose the image of the emergent EES as a vast network of models and interweaved representations that, instantiated in diverse practices, are connected and related in multiple ways. Under that assumption, the EES could be articulated around a paraconsistent network of evolutionary theories (including some elements of the SET), as well as models, practices and representation systems of contemporary evolutionary biology, with edges and nodes that change their position and centrality as a consequence of the co-construction and stabilization of facts and historical discussions revolving around the epistemic goals of this area of the life sciences. We then critically examine the purported structure of the EESâpublished by Laland and collaborators in 2015âin light of our own network-based proposal. Finally, we consider which epistemic units of Evo-Devo are present or still missing from the EES, in preparation for further analyses of the topic of explanatory integration in this conceptual framework
Virtual reality in biology : could we become virtual naturalists?
Acknowledgements We would like to thank editors and anonymous reviewers for insightful comments that improved readability of our manuscript. In particular, we would like to thank Reviewer #1 whose comments made the entire peer-review a stimulating and productive process. We would like to acknowledge Lucy C. Kerr for kindly proof-reading the final version of this manuscript.Peer reviewedPublisher PD
A Field Guide to Genetic Programming
xiv, 233 p. : il. ; 23 cm.Libro ElectrĂłnicoA Field Guide to Genetic Programming (ISBN 978-1-4092-0073-4) is an introduction to genetic programming (GP). GP is a systematic, domain-independent method for getting computers to solve problems automatically starting from a high-level statement of what needs to be done. Using ideas from natural evolution, GP starts from an ooze of random computer programs, and progressively refines them through processes of mutation and sexual recombination, until solutions emerge. All this without the user having to know or specify the form or structure of solutions in advance. GP has generated a plethora of human-competitive results and applications, including novel scientific discoveries and patentable inventions. The authorsIntroduction --
Representation, initialisation and operators in Tree-based GP --
Getting ready to run genetic programming --
Example genetic programming run --
Alternative initialisations and operators in Tree-based GP --
Modular, grammatical and developmental Tree-based GP --
Linear and graph genetic programming --
Probalistic genetic programming --
Multi-objective genetic programming --
Fast and distributed genetic programming --
GP theory and its applications --
Applications --
Troubleshooting GP --
Conclusions.Contents
xi
1 Introduction
1.1 Genetic Programming in a Nutshell
1.2 Getting Started
1.3 Prerequisites
1.4 Overview of this Field Guide I
Basics
2 Representation, Initialisation and GP
2.1 Representation
2.2 Initialising the Population
2.3 Selection
2.4 Recombination and Mutation Operators in Tree-based
3 Getting Ready to Run Genetic Programming 19
3.1 Step 1: Terminal Set 19
3.2 Step 2: Function Set 20
3.2.1 Closure 21
3.2.2 Sufficiency 23
3.2.3 Evolving Structures other than Programs 23
3.3 Step 3: Fitness Function 24
3.4 Step 4: GP Parameters 26
3.5 Step 5: Termination and solution designation 27
4 Example Genetic Programming Run
4.1 Preparatory Steps 29
4.2 Step-by-Step Sample Run 31
4.2.1 Initialisation 31
4.2.2 Fitness Evaluation Selection, Crossover and Mutation Termination and Solution Designation Advanced Genetic Programming
5 Alternative Initialisations and Operators in
5.1 Constructing the Initial Population
5.1.1 Uniform Initialisation
5.1.2 Initialisation may Affect Bloat
5.1.3 Seeding
5.2 GP Mutation
5.2.1 Is Mutation Necessary?
5.2.2 Mutation Cookbook
5.3 GP Crossover
5.4 Other Techniques 32
5.5 Tree-based GP 39
6 Modular, Grammatical and Developmental Tree-based GP 47
6.1 Evolving Modular and Hierarchical Structures 47
6.1.1 Automatically Defined Functions 48
6.1.2 Program Architecture and Architecture-Altering 50
6.2 Constraining Structures 51
6.2.1 Enforcing Particular Structures 52
6.2.2 Strongly Typed GP 52
6.2.3 Grammar-based Constraints 53
6.2.4 Constraints and Bias 55
6.3 Developmental Genetic Programming 57
6.4 Strongly Typed Autoconstructive GP with PushGP 59
7 Linear and Graph Genetic Programming 61
7.1 Linear Genetic Programming 61
7.1.1 Motivations 61
7.1.2 Linear GP Representations 62
7.1.3 Linear GP Operators 64
7.2 Graph-Based Genetic Programming 65
7.2.1 Parallel Distributed GP (PDGP) 65
7.2.2 PADO 67
7.2.3 Cartesian GP 67
7.2.4 Evolving Parallel Programs using Indirect Encodings 68
8 Probabilistic Genetic Programming
8.1 Estimation of Distribution Algorithms 69
8.2 Pure EDA GP 71
8.3 Mixing Grammars and Probabilities 74
9 Multi-objective Genetic Programming 75
9.1 Combining Multiple Objectives into a Scalar Fitness Function 75
9.2 Keeping the Objectives Separate 76
9.2.1 Multi-objective Bloat and Complexity Control 77
9.2.2 Other Objectives 78
9.2.3 Non-Pareto Criteria 80
9.3 Multiple Objectives via Dynamic and Staged Fitness Functions 80
9.4 Multi-objective Optimisation via Operator Bias 81
10 Fast and Distributed Genetic Programming 83
10.1 Reducing Fitness Evaluations/Increasing their Effectiveness 83
10.2 Reducing Cost of Fitness with Caches 86
10.3 Parallel and Distributed GP are Not Equivalent 88
10.4 Running GP on Parallel Hardware 89
10.4.1 Masterâslave GP 89
10.4.2 GP Running on GPUs 90
10.4.3 GP on FPGAs 92
10.4.4 Sub-machine-code GP 93
10.5 Geographically Distributed GP 93
11 GP Theory and its Applications 97
11.1 Mathematical Models 98
11.2 Search Spaces 99
11.3 Bloat 101
11.3.1 Bloat in Theory 101
11.3.2 Bloat Control in Practice 104
III
Practical Genetic Programming
12 Applications
12.1 Where GP has Done Well
12.2 Curve Fitting, Data Modelling and Symbolic Regression
12.3 Human Competitive Results â the Humies
12.4 Image and Signal Processing
12.5 Financial Trading, Time Series, and Economic Modelling
12.6 Industrial Process Control
12.7 Medicine, Biology and Bioinformatics
12.8 GP to Create Searchers and Solvers â Hyper-heuristics xiii
12.9 Entertainment and Computer Games 127
12.10The Arts 127
12.11Compression 128
13 Troubleshooting GP
13.1 Is there a Bug in the Code?
13.2 Can you Trust your Results?
13.3 There are No Silver Bullets
13.4 Small Changes can have Big Effects
13.5 Big Changes can have No Effect
13.6 Study your Populations
13.7 Encourage Diversity
13.8 Embrace Approximation
13.9 Control Bloat
13.10 Checkpoint Results
13.11 Report Well
13.12 Convince your Customers
14 Conclusions
Tricks of the Trade
A Resources
A.1 Key Books
A.2 Key Journals
A.3 Key International Meetings
A.4 GP Implementations
A.5 On-Line Resources 145
B TinyGP 151
B.1 Overview of TinyGP 151
B.2 Input Data Files for TinyGP 153
B.3 Source Code 154
B.4 Compiling and Running TinyGP 162
Bibliography 167
Inde
Ergonomic Chair Design by Fusing Qualitative and Quantitative Criteria using Interactive Genetic Algorithms
This paper emphasizes the necessity of formally bringing qualitative and
quantitative criteria of ergonomic design together, and provides a novel
complementary design framework with this aim. Within this framework, different
design criteria are viewed as optimization objectives; and design solutions are
iteratively improved through the cooperative efforts of computer and user. The
framework is rooted in multi-objective optimization, genetic algorithms and
interactive user evaluation. Three different algorithms based on the framework
are developed, and tested with an ergonomic chair design problem. The parallel
and multi-objective approaches show promising results in fitness convergence,
design diversity and user satisfaction metrics
- âŠ