biologically-inspired computing lecture 18
|
|
- Julia Welch
- 5 years ago
- Views:
Transcription
1 Informatics -inspired lecture 18
2 Sections I485/H400 course outlook Assignments: 35% Students will complete 4/5 assignments based on algorithms presented in class Lab meets in I1 (West) 109 on Lab Wednesdays Lab 0 : January 14 th (completed) Introduction to Python (No Assignment) Lab 1 : January 28 th Measuring Information (Assignment 1) Graded Lab 2 : February 11 th L-Systems (Assignment 2) Graded Lab 3: March 25 th Cellular Automata & Boolean Networks (Assignment 3) Graded Lab 4: April 8 th Genetic Algorithms (Assignment 4) Due: April 22 nd Lab 5: April 22 nd Ant Clustering Algorithm (Assignment 5) Due May 4 th
3 Readings until now Class Book Nunes de Castro, Leandro [2006]. Fundamentals of Natural Computing: Basic Concepts, Algorithms, and Applications. Chapman & Hall. Chapters 1, 2, 3, , , Lecture notes Chapter 1: What is Life? Chapter 2: The Logical Mechanisms of Life Chapter 3: Formalizing and Modeling the World Chapter 4: Self-Organization and Emergent Complex Behavior Chapter 5: Reality is Stranger than Fiction posted Other materials Flake s [1998], The Computational Beauty of Nature. MIT Press Chapters 20
4 final project schedule ALIFE 15 Projects Due by May 4 th in Oncourse ALIFE 15 (14) Actual conference due date: pages (LNCS proceedings format) D= Preliminary ideas overdue! Individual or group With very definite tasks assigned per member of group
5 highlights Kyle Nealy Lab 3: CA & BN Matthew Remmel Darlan Farias
6 highlights Jonathan Stout Rafael Paiva Lab 3: CA & BN Lorander Saggu
7 The workings 1) Generate Random population of bit-strings 2) Evaluate Fitness Function for each decoded solution 3) Reproduce next generation Selection by fitness Variation crossover and mutation Fill new population 4) Go back to 2) until stop criteria is met Desired fitness Specified number of generations Convergence Lack of variability in population and/or fitness Tends to a peak f(x 3 ) genetic algorithms f(x i ) f(x 2 ) f(x 1 ) Parents
8 artificial genotype/phenotype mapping Search algorithms based on the mechanics of Natural Selection Based on distinction between a machine and a description of a machine Solution alternatives for optimization problems Genotype DNA Inherited variation computational evolution transcription translation (code) development RNA amino acid chains Traditional Genetic Algorithm Genotype environmental ramifications phenotype organism S S n 2 p!!! 1 S Variation Code: φ code x x x 1 2 n p Phenotype Selection
9 Types of encoding Binary encodings Typically fixed-length Many-letter encoding Larger alphabet (e.g. graph-generation grammars) Real-valued encodings Genes take real values Tree Encodings Genetic programming Indirect Encodings Modeling Phenotype development or posttranscription processes L-Systems, Dynamical systems, evolutionary robotics
10 homogenous lattice of state-determined systems t Cellular Automata x x-1 x+1 x t Possible neighborhood states K N Cellular automata Density Task (a.k.a majority classification problem) #Lattices of 149 Binary Cells (599, 999) #Rules of Radius 3 (7 Cells in Neighborhood) #Task: Organize to < All 1's if Initial Configuration (IC) has more 1 Cells < All 0's if IC has more 0 Cells x x Possible CA transition functions K K N
11 encoding in GA with binary encoding t x x Possible neighborhood states Pop of rules K N Used in the evolutionary search by GA (elite selection) code Traditional Genetic Algorithm Genotype S S 2 n p!!! 1 S Code: φ x1 x 2 x n p Phenotype Variation Selection Cellular automata
12 With genetic algorithms Evolving CA rules #Das, Mitchell and Crutchfield < Used Genetic Algorithm to evolve rules for this task Typical Result: Block Expansion Regular domains {0+} {10+} {1+} Particles Das,R., Mitchell,M., Crutchfield,J.P., [1994]. "A genetic algorithm discovers particle-based computation in cellular automata". In: Parallel Problem Solving from Nature - PPSN III. Davidor,Y., Schwefel,H.-P., Manner,R. (Eds.), Springer-Verlag, pp
13 Informatics evolutionary algorithms to evolve photos with numerical encodings
14 In genetic algorithms real and integer encoding 1) Genotypes contain real or integer values 1) Crossover is performed in the same way 2) Mutation assigns a random number in a given interval 2) More computationally demanding for Reals 3) Attention to crossover points 1) Conversion to binary avoids crossover issues, but longer genotypes x y r R G B n circles n Genes Agent Chromosome/Genotype (Population of p agents)
15 Tree encodings (no clear genotype) Fogel, Owens and Walsh (1966) evolving computer programs Artificial Intelligence through simulated evolution. Wiley. Evolution of finite-state machines John Koza (1992) at Stanford University Genetic Programming: On the programming of computers by means of Natural Selection. MIT Press.
16 The workings 1) Generate Random population of tree/programs 2) Evaluate Fitness Function for each program Desired I/O, simplicity, speed 3) Reproduce next generation Selection by fitness Variation crossover and mutation Fill new population 4) Go back to 2) until stop criteria is met Desired fitness Specified number of generations Convergence + R * R + R+( *D) / f(x 3 ) / / / genetic programming / * / / D f(x 2 ) f(x 1 ) R R * - * C R*[(*C)- R] / + f(x i ) D * D R
17 A symbolic regression tool Eureqa Eureqa:
18 Gene expression programming Including a genotype/phenotype map in GP Proposed by Candida Ferreira Program trees are encoded in fixed-length linear genotypes Genotypes Open-reading frame architecture Stop signal not necessarily at end of genotype Non-coding genes are possible Can include genetic operators Genes contain two types of symbols Functions (only at the head) and terminals Multigenic solutions Assembled from non-coding operations between various open-reading frames C. FERREIRA [2001]. Gene Expression Programming: A New Adaptive Algorithm for Solving Problems. Complex Systems, 13 (2):
19 evolving morphologies and robots with indirect encodings Karl Sim s simulations and The Golem Project
20 objective function may be subjective evolutionary design "Once a Darwinian process gets going in a world, it has an open-ended power to generate surprising consequences: us, for example" Richard Dawkins Biomorphs
21 readings Next lectures Class Book Nunes de Castro, Leandro [2006]. Fundamentals of Natural Computing: Basic Concepts, Algorithms, and Applications. Chapman & Hall. Chapter 3, all sections Sections 7.8 (evolving L-Systems), (biomorphs) Chapter 5, all sections Section 7.7, 8.3.1,8.3.6, Lecture notes Chapter 1: What is Life? Chapter 2: The logical Mechanisms of Life Chapter 3: Formalizing and Modeling the World Chapter 4: Self-Organization and Emergent Complex Behavior Chapter 5: Reality is Stranger than Fiction posted Optional materials Flake s [1998], The Computational Beauty of Life. MIT Press Chapter 20 Scientific American: Special Issue on the evolution of Evolution, January 2009.
Development. biologically-inspired computing. lecture 16. Informatics luis rocha x x x. Syntactic Operations. biologically Inspired computing
lecture 16 -inspired S S2 n p!!! 1 S Syntactic Operations al Code:N Development x x x 1 2 n p S Sections I485/H400 course outlook Assignments: 35% Students will complete 4/5 assignments based on algorithms
More informationbiologically-inspired computing lecture 12 Informatics luis rocha 2015 INDIANA UNIVERSITY biologically Inspired computing
lecture 12 -inspired Sections I485/H400 course outlook Assignments: 35% Students will complete 4/5 assignments based on algorithms presented in class Lab meets in I1 (West) 109 on Lab Wednesdays Lab 0
More informationbiologically-inspired computing lecture 5 Informatics luis rocha 2015 biologically Inspired computing INDIANA UNIVERSITY
lecture 5 -inspired Sections I485/H400 course outlook Assignments: 35% Students will complete 4/5 assignments based on algorithms presented in class Lab meets in I1 (West) 109 on Lab Wednesdays Lab 0 :
More informationbiologically-inspired computing lecture 6 Informatics luis rocha 2015 INDIANA UNIVERSITY biologically Inspired computing
lecture 6 -inspired Sections I485/H400 course outlook Assignments: 35% Students will complete 4/5 assignments based on algorithms presented in class Lab meets in I1 (West) 109 on Lab Wednesdays Lab 0 :
More informationDiscovery of the Boolean Functions to the Best Density-Classification Rules Using Gene Expression Programming
Discovery of the Boolean Functions to the Best Density-Classification Rules Using Gene Expression Programming Cândida Ferreira Gepsoft, 37 The Ridings, Bristol BS13 8NU, UK candidaf@gepsoft.com http://www.gepsoft.com
More informationbiologically-inspired computing lecture 22 Informatics luis rocha 2015 INDIANA UNIVERSITY biologically Inspired computing
lecture 22 -inspired Sections I485/H400 course outlook Assignments: 35% Students will complete 4/5 assignments based on algorithms presented in class Lab meets in I1 (West) 109 on Lab Wednesdays Lab 0
More informationEvolutionary Computation
Evolutionary Computation - Computational procedures patterned after biological evolution. - Search procedure that probabilistically applies search operators to set of points in the search space. - Lamarck
More informationEvolutionary computation
Evolutionary computation Andrea Roli andrea.roli@unibo.it DEIS Alma Mater Studiorum Università di Bologna Evolutionary computation p. 1 Evolutionary Computation Evolutionary computation p. 2 Evolutionary
More informationLecture 9 Evolutionary Computation: Genetic algorithms
Lecture 9 Evolutionary Computation: Genetic algorithms Introduction, or can evolution be intelligent? Simulation of natural evolution Genetic algorithms Case study: maintenance scheduling with genetic
More informationEvolutionary Design I
Evolutionary Design I Jason Noble jasonn@comp.leeds.ac.uk Biosystems group, School of Computing Evolutionary Design I p.1/29 This lecture Harnessing evolution in a computer program How to construct a genetic
More informationChapter 8: Introduction to Evolutionary Computation
Computational Intelligence: Second Edition Contents Some Theories about Evolution Evolution is an optimization process: the aim is to improve the ability of an organism to survive in dynamically changing
More informationEvolutionary Computation. DEIS-Cesena Alma Mater Studiorum Università di Bologna Cesena (Italia)
Evolutionary Computation DEIS-Cesena Alma Mater Studiorum Università di Bologna Cesena (Italia) andrea.roli@unibo.it Evolutionary Computation Inspiring principle: theory of natural selection Species face
More informationEvolutionary computation in high-energy physics
Evolutionary computation in high-energy physics Liliana Teodorescu Brunel University, United Kingdom Abstract Evolutionary computation is a branch of computer science with which, traditionally, high-energy
More informationCellular automata are idealized models of complex systems Large network of simple components Limited communication among components No central
Cellular automata are idealized models of complex systems Large network of simple components Limited communication among components No central control Complex dynamics from simple rules Capability of information
More informationCSC 4510 Machine Learning
10: Gene(c Algorithms CSC 4510 Machine Learning Dr. Mary Angela Papalaskari Department of CompuBng Sciences Villanova University Course website: www.csc.villanova.edu/~map/4510/ Slides of this presenta(on
More informationEvolutionary Robotics
Evolutionary Robotics Previously on evolutionary robotics Evolving Neural Networks How do we evolve a neural network? Evolving Neural Networks How do we evolve a neural network? One option: evolve the
More informationEvolution of Genotype-Phenotype mapping in a von Neumann Self-reproduction within the Platform of Tierra
Evolution of Genotype-Phenotype mapping in a von Neumann Self-reproduction within the Platform of Tierra Declan Baugh and Barry Mc Mullin The Rince Institute, Dublin City University, Ireland declan.baugh2@mail.dcu.ie,
More informationEvolutionary computation
Evolutionary computation Andrea Roli andrea.roli@unibo.it Dept. of Computer Science and Engineering (DISI) Campus of Cesena Alma Mater Studiorum Università di Bologna Outline 1 Basic principles 2 Genetic
More informationV. Evolutionary Computing. Read Flake, ch. 20. Genetic Algorithms. Part 5A: Genetic Algorithms 4/10/17. A. Genetic Algorithms
V. Evolutionary Computing A. Genetic Algorithms 4/10/17 1 Read Flake, ch. 20 4/10/17 2 Genetic Algorithms Developed by John Holland in 60s Did not become popular until late 80s A simplified model of genetics
More informationIV. Evolutionary Computing. Read Flake, ch. 20. Assumptions. Genetic Algorithms. Fitness-Biased Selection. Outline of Simplified GA
IV. Evolutionary Computing A. Genetic Algorithms Read Flake, ch. 20 2014/2/26 1 2014/2/26 2 Genetic Algorithms Developed by John Holland in 60s Did not become popular until late 80s A simplified model
More informationLecture 5: Linear Genetic Programming
Lecture 5: Linear Genetic Programming CIU036 Artificial Intelligence 2, 2010 Krister Wolff, Ph.D. Department of Applied Mechanics Chalmers University of Technology 41296 Göteborg, Sweden krister.wolff@chalmers.se
More informationGenetic Engineering and Creative Design
Genetic Engineering and Creative Design Background genes, genotype, phenotype, fitness Connecting genes to performance in fitness Emergent gene clusters evolved genes MIT Class 4.208 Spring 2002 Evolution
More informationGecco 2007 Tutorial / Grammatical Evolution
Gecco 2007 Grammatical Evolution Tutorial Conor Ryan Biocomputing and Developmental Systems Group Department of Computer Science and Information Systems University of Limerick Copyright is held by the
More informationCOMP3411: Artificial Intelligence 7a. Evolutionary Computation
COMP3411 14s1 Evolutionary Computation 1 COMP3411: Artificial Intelligence 7a. Evolutionary Computation Outline Darwinian Evolution Evolutionary Computation paradigms Simulated Hockey Evolutionary Robotics
More informationbiologically-inspired computing lecture 15 Informatics luis rocha 2015 biologically Inspired computing INDIANA UNIVERSITY
lecture 15 -inspired Sections I485/H400 course outlook Assignments: 35% Students will complete 4/5 assignments based on algorithms presented in class Lab meets in I1 (West) 109 on Lab Wednesdays Lab 0
More informationSorting Network Development Using Cellular Automata
Sorting Network Development Using Cellular Automata Michal Bidlo, Zdenek Vasicek, and Karel Slany Brno University of Technology, Faculty of Information Technology Božetěchova 2, 61266 Brno, Czech republic
More informationV. Evolutionary Computing. Read Flake, ch. 20. Assumptions. Genetic Algorithms. Fitness-Biased Selection. Outline of Simplified GA
Part 5A: Genetic Algorithms V. Evolutionary Computing A. Genetic Algorithms Read Flake, ch. 20 1 2 Genetic Algorithms Developed by John Holland in 60s Did not become popular until late 80s A simplified
More informationFundamentals of Genetic Algorithms
Fundamentals of Genetic Algorithms : AI Course Lecture 39 40, notes, slides www.myreaders.info/, RC Chakraborty, e-mail rcchak@gmail.com, June 01, 2010 www.myreaders.info/html/artificial_intelligence.html
More informationUsing Differential Evolution for GEP Constant Creation
Using Differential Evolution for GEP Constant Creation Qiongyun Zhang Department of Computer Science University of Illinois at Chicago Chicago, IL, 60607, USA qzhang@cs.uic.edu Chi Zhou Realization Research
More informationThe Role of Crossover in Genetic Algorithms to Solve Optimization of a Function Problem Falih Hassan
The Role of Crossover in Genetic Algorithms to Solve Optimization of a Function Problem Falih Hassan ABSTRACT The genetic algorithm is an adaptive search method that has the ability for a smart search
More informationA Generalized Quantum-Inspired Evolutionary Algorithm for Combinatorial Optimization Problems
A Generalized Quantum-Inspired Evolutionary Algorithm for Combinatorial Optimization Problems Julio M. Alegría 1 julio.alegria@ucsp.edu.pe Yván J. Túpac 1 ytupac@ucsp.edu.pe 1 School of Computer Science
More informationNormalised evolutionary activity statistics and the need for phenotypic evidence
Open Ended Evolution workshop, ECAL 2015 20 July 2015 Normalised evolutionary activity statistics and the need for phenotypic evidence Dr Alastair Channon School of Computing and Mathematics Keele University
More informationImproving Coordination via Emergent Communication in Cooperative Multiagent Systems: A Genetic Network Programming Approach
Proceedings of the 2009 IEEE International Conference on Systems, Man, and Cybernetics San Antonio, TX, USA - October 2009 Improving Coordination via Emergent Communication in Cooperative Multiagent Systems:
More informationvon Neumann Architecture
Computing with DNA & Review and Study Suggestions 1 Wednesday, April 29, 2009 von Neumann Architecture Refers to the existing computer architectures consisting of a processing unit a single separate storage
More informationGENETIC ALGORITHM FOR CELL DESIGN UNDER SINGLE AND MULTIPLE PERIODS
GENETIC ALGORITHM FOR CELL DESIGN UNDER SINGLE AND MULTIPLE PERIODS A genetic algorithm is a random search technique for global optimisation in a complex search space. It was originally inspired by an
More informationMechanisms of Emergent Computation in Cellular Automata
Mechanisms of Emergent Computation in Cellular Automata Wim Hordijk, James P. Crutchfield, Melanie Mitchell Santa Fe Institute, 1399 Hyde Park Road, Santa Fe, 87501 NM, USA email: {wim,chaos,mm}@santafe.edu
More informationGenetic Algorithm for Solving the Economic Load Dispatch
International Journal of Electronic and Electrical Engineering. ISSN 0974-2174, Volume 7, Number 5 (2014), pp. 523-528 International Research Publication House http://www.irphouse.com Genetic Algorithm
More informationBiology Scope and Sequence Student Outcomes (Objectives Skills/Verbs)
C-4 N.12.A 1-6 N.12.B.1-4 Scientific Literacy/ Nature of (embedded throughout course) Scientific Inquiry is the process by which humans systematically examine the natural world. Scientific inquiry is a
More informationGenetic Algorithms: Basic Principles and Applications
Genetic Algorithms: Basic Principles and Applications C. A. MURTHY MACHINE INTELLIGENCE UNIT INDIAN STATISTICAL INSTITUTE 203, B.T.ROAD KOLKATA-700108 e-mail: murthy@isical.ac.in Genetic algorithms (GAs)
More informationLecture 22. Introduction to Genetic Algorithms
Lecture 22 Introduction to Genetic Algorithms Thursday 14 November 2002 William H. Hsu, KSU http://www.kddresearch.org http://www.cis.ksu.edu/~bhsu Readings: Sections 9.1-9.4, Mitchell Chapter 1, Sections
More informationOn computer aided knowledge discovery in logic and related areas
Proceedings of the Conference on Mathematical Foundations of Informatics MFOI2016, July 25-29, 2016, Chisinau, Republic of Moldova On computer aided knowledge discovery in logic and related areas Andrei
More informationLecture 15: Genetic Algorithms
Lecture 15: Genetic Algorithms Dr Roman V Belavkin BIS3226 Contents 1 Combinatorial Problems 1 2 Natural Selection 2 3 Genetic Algorithms 3 31 Individuals and Population 3 32 Fitness Functions 3 33 Encoding
More informationArtificial Intelligence (AI) Common AI Methods. Training. Signals to Perceptrons. Artificial Neural Networks (ANN) Artificial Intelligence
Artificial Intelligence (AI) Artificial Intelligence AI is an attempt to reproduce intelligent reasoning using machines * * H. M. Cartwright, Applications of Artificial Intelligence in Chemistry, 1993,
More informationCOMP3411: Artificial Intelligence 10a. Evolutionary Computation
COMP3411 16s1 Evolutionary Computation 1 COMP3411: Artificial Intelligence 10a. Evolutionary Computation Outline Darwinian Evolution Evolutionary Computation paradigms Simulated Hockey Evolutionary Robotics
More informationKoza s Algorithm. Choose a set of possible functions and terminals for the program.
Step 1 Koza s Algorithm Choose a set of possible functions and terminals for the program. You don t know ahead of time which functions and terminals will be needed. User needs to make intelligent choices
More informationA New Approach to Estimating the Expected First Hitting Time of Evolutionary Algorithms
A New Approach to Estimating the Expected First Hitting Time of Evolutionary Algorithms Yang Yu and Zhi-Hua Zhou National Laboratory for Novel Software Technology Nanjing University, Nanjing 20093, China
More informationComputational Tasks and Models
1 Computational Tasks and Models Overview: We assume that the reader is familiar with computing devices but may associate the notion of computation with specific incarnations of it. Our first goal is to
More informationCo-evolution of Morphology and Control for Roombots
Co-evolution of Morphology and Control for Roombots Master Thesis Presentation Ebru Aydın Advisors: Prof. Auke Jan Ijspeert Rico Möckel Jesse van den Kieboom Soha Pouya Alexander Spröwitz Co-evolution
More informationEvolving more efficient digital circuits by allowing circuit layout evolution and multi-objective fitness
Evolving more efficient digital circuits by allowing circuit layout evolution and multi-objective fitness Tatiana Kalganova Julian Miller School of Computing School of Computing Napier University Napier
More informationComputational Biology: Basics & Interesting Problems
Computational Biology: Basics & Interesting Problems Summary Sources of information Biological concepts: structure & terminology Sequencing Gene finding Protein structure prediction Sources of information
More informationNUMERICAL SOLUTION FOR FREDHOLM FIRST KIND INTEGRAL EQUATIONS OCCURRING IN SYNTHESIS OF ELECTROMAGNETIC FIELDS
GENERAL PHYSICS EM FIELDS NUMERICAL SOLUTION FOR FREDHOLM FIRST KIND INTEGRAL EQUATIONS OCCURRING IN SYNTHESIS OF ELECTROMAGNETIC FIELDS ELENA BÃUTU, ELENA PELICAN Ovidius University, Constanta, 9527,
More informationEvolving Cellular Automata with Genetic Algorithms: A Review of Recent Work
Evolving Cellular Automata with Genetic Algorithms: A Review of Recent Work Melanie Mitchell Santa Fe Institute 1399 Hyde Park Road Santa Fe, NM 8751 mm@santafe.edu James P. Crutchfield 1 Santa Fe Institute
More informationSwarm-bots. Marco Dorigo FNRS Research Director IRIDIA Université Libre de Bruxelles
Swarm-bots Marco Dorigo FNRS Research Director IRIDIA Université Libre de Bruxelles Swarm-bots The swarm-bot is an experiment in swarm robotics Swarm robotics is the application of swarm intelligence principles
More informationOverview of ECNN Combinations
1 Overview of ECNN Combinations Evolutionary Computation ECNN Neural Networks by Paulo Cortez and Miguel Rocha pcortez@dsi.uminho.pt mrocha@di.uminho.pt (Presentation available at: http://www.dsi.uminho.pt/
More informationComputational statistics
Computational statistics Combinatorial optimization Thierry Denœux February 2017 Thierry Denœux Computational statistics February 2017 1 / 37 Combinatorial optimization Assume we seek the maximum of f
More informationHaploid & diploid recombination and their evolutionary impact
Haploid & diploid recombination and their evolutionary impact W. Garrett Mitchener College of Charleston Mathematics Department MitchenerG@cofc.edu http://mitchenerg.people.cofc.edu Introduction The basis
More informationAn Effective Chromosome Representation for Evolving Flexible Job Shop Schedules
An Effective Chromosome Representation for Evolving Flexible Job Shop Schedules Joc Cing Tay and Djoko Wibowo Intelligent Systems Lab Nanyang Technological University asjctay@ntuedusg Abstract As the Flexible
More informationVideos. Bozeman, transcription and translation: https://youtu.be/h3b9arupxzg Crashcourse: Transcription and Translation - https://youtu.
Translation Translation Videos Bozeman, transcription and translation: https://youtu.be/h3b9arupxzg Crashcourse: Transcription and Translation - https://youtu.be/itsb2sqr-r0 Translation Translation The
More informationEvolutionary Algorithms
Evolutionary Algorithms a short introduction Giuseppe Narzisi Courant Institute of Mathematical Sciences New York University 31 January 2008 Outline 1 Evolution 2 Evolutionary Computation 3 Evolutionary
More informationArtificial Ecosystems for Creative Discovery
Artificial Ecosystems for Creative Discovery Jon McCormack Centre for Electronic Media Art Monash University Clayton 3800, Australia www.csse.monash.edu.au/~jonmc Jon.McCormack@infotech.monash.edu.au 1
More informationImproved TBL algorithm for learning context-free grammar
Proceedings of the International Multiconference on ISSN 1896-7094 Computer Science and Information Technology, pp. 267 274 2007 PIPS Improved TBL algorithm for learning context-free grammar Marcin Jaworski
More informationbiologically-inspired computing lecture 14 Informatics luis rocha 2015 biologically Inspired computing INDIANA UNIVERSITY
lecture 14 -inspired Sections I485/H400 course outlook Assignments: 35% Students will complete 4/5 assignments based on algorithms presented in class Lab meets in I1 (West) 109 on Lab Wednesdays Lab 0
More informationA comparison of evolutionary and coevolutionary search
A comparison of evolutionary and coevolutionary search Ludo Pagie and Melanie Mitchell Santa Fe Institute 1399 Hyde Park Road Santa Fe, NM8751, US ludo@santafe.edu mm@santafe.edu phone: (+1)(55)-984-88
More informationGenetic Algorithms & Modeling
Genetic Algorithms & Modeling : Soft Computing Course Lecture 37 40, notes, slides www.myreaders.info/, RC Chakraborty, e-mail rcchak@gmail.com, Aug. 10, 2010 http://www.myreaders.info/html/soft_computing.html
More informationContents. Grammatical Evolution Tutorial. Biological Phenomena. Issues with GP GECCO Motivation. Overview. Example
Contents GECCO 25 Grammatical Evolution Tutorial Biocomputing and Developmental Systems Department of Computer Science & Information Systems University of Limerick, Ireland. Motivation Overview Example
More informationChapter 0 Introduction. Fourth Academic Year/ Elective Course Electrical Engineering Department College of Engineering University of Salahaddin
Chapter 0 Introduction Fourth Academic Year/ Elective Course Electrical Engineering Department College of Engineering University of Salahaddin October 2014 Automata Theory 2 of 22 Automata theory deals
More informationBusy Beaver The Influence of Representation
Busy Beaver The Influence of Representation Penousal Machado *, Francisco B. Pereira *, Amílcar Cardoso **, Ernesto Costa ** Centro de Informática e Sistemas da Universidade de Coimbra {machado, xico,
More informationA comparison of evolutionary and coevolutionary search
A comparison of evolutionary and coevolutionary search Ludo Pagie Santa Fe Institute 1399 Hyde Park Road Santa Fe, NM87501, US ludo@santafe.edu Melanie Mitchell Santa Fe Institute 1399 Hyde Park Road Santa
More informationA GENETIC ALGORITHM FOR FINITE STATE AUTOMATA
A GENETIC ALGORITHM FOR FINITE STATE AUTOMATA Aviral Takkar Computer Engineering Department, Delhi Technological University( Formerly Delhi College of Engineering), Shahbad Daulatpur, Main Bawana Road,
More informationPeddie Summer Day School
Peddie Summer Day School Course Syllabus: BIOLOGY Teacher: Mr. Jeff Tuliszewski Text: Biology by Miller and Levine, Prentice Hall, 2010 edition ISBN 9780133669510 Guided Reading Workbook for Biology ISBN
More informationBackground: Comment [1]: Comment [2]: Comment [3]: Comment [4]: mass spectrometry
Background: Imagine it is time for your lunch break, you take your sandwich outside and you sit down to enjoy your lunch with a beautiful view of Montana s Rocky Mountains. As you look up, you see what
More informationTowards Automatic Design of Adaptive Evolutionary Algorithms. Ayman Srour - Patrick De Causmaecker
Towards Automatic Design of Adaptive Evolutionary Algorithms Ayman Srour - Patrick De Causmaecker Outline Background Parameter tuning Adaptive Parameter control Preliminary investigation The proposed framework
More informationGenetic Algorithms. Donald Richards Penn State University
Genetic Algorithms Donald Richards Penn State University Easy problem: Find the point which maximizes f(x, y) = [16 x(1 x)y(1 y)] 2, x, y [0,1] z (16*x*y*(1-x)*(1-y))**2 0.829 0.663 0.497 0.331 0.166 1
More informationA Note on Crossover with Interval Representations
A Note on Crossover with Interval Representations Christopher Stone and Larry Bull UWE Learning Classifier System Technical Report UWELCSG03-00 Faculty of Computing, Engineering and Mathematical Sciences
More informationmrna Codon Table Mutant Dinosaur Name: Period:
Mutant Dinosaur Name: Period: Intro Your dinosaur is born with a new genetic mutation. Your job is to map out the genes that are influenced by the mutation and to discover how the new dinosaurs interact
More informationSymbolic Computation using Grammatical Evolution
Symbolic Computation using Grammatical Evolution Alan Christianson Department of Mathematics and Computer Science South Dakota School of Mines and Technology Rapid City, SD 577 Alan.Christianson@mines.sdsmt.edu
More informationIntroduction to Informatics
Introduction to Informatics Lecture 7: Modeling the World Readings until now Lecture notes Posted online @ http://informatics.indiana.edu/rocha/i101 The Nature of Information Technology Modeling the World
More information0 o 1 i B C D 0/1 0/ /1
A Comparison of Dominance Mechanisms and Simple Mutation on Non-Stationary Problems Jonathan Lewis,? Emma Hart, Graeme Ritchie Department of Articial Intelligence, University of Edinburgh, Edinburgh EH
More informationSwarm-bots and Swarmanoid: Two experiments in embodied swarm intelligence
Swarm-bots and Swarmanoid: Two experiments in embodied swarm intelligence Marco Dorigo FNRS Research Director IRIDIA Université Libre de Bruxelles IAT - 17.9.2009 - Milano, Italy What is swarm intelligence?
More informationIntroduction to Informatics
Introduction to Informatics Lecture 20: Information and Uncertainty Uncertainty is the condition in which the possibility of error exists, because we have less than total information about our environment
More informationCSE 20. Lecture 4: Introduction to Boolean algebra. CSE 20: Lecture4
CSE 20 Lecture 4: Introduction to Boolean algebra Reminder First quiz will be on Friday (17th January) in class. It is a paper quiz. Syllabus is all that has been done till Wednesday. If you want you may
More informationData Warehousing & Data Mining
13. Meta-Algorithms for Classification Data Warehousing & Data Mining Wolf-Tilo Balke Silviu Homoceanu Institut für Informationssysteme Technische Universität Braunschweig http://www.ifis.cs.tu-bs.de 13.
More informationSTRUCTURAL BIOINFORMATICS I. Fall 2015
STRUCTURAL BIOINFORMATICS I Fall 2015 Info Course Number - Classification: Biology 5411 Class Schedule: Monday 5:30-7:50 PM, SERC Room 456 (4 th floor) Instructors: Vincenzo Carnevale - SERC, Room 704C;
More informationQ = Set of states, IE661: Scheduling Theory (Fall 2003) Primer to Complexity Theory Satyaki Ghosh Dastidar
IE661: Scheduling Theory (Fall 2003) Primer to Complexity Theory Satyaki Ghosh Dastidar Turing Machine A Turing machine is an abstract representation of a computing device. It consists of a read/write
More informationCellular Automata. ,C ) (t ) ,..., C i +[ K / 2] Cellular Automata. x > N : C x ! N. = C x. x < 1: C x. = C N+ x.
and beyond Lindenmayer Systems The World of Simple Programs Christian Jacob Department of Computer Science Department of Biochemistry & Molecular Biology University of Calgary CPSC 673 Winter 2004 Random
More informationUsing Genetic Algorithm for classification of flower plants
Using Genetic Algorithm for classification of flower plants by Mohammed Abbas Kadhum AL-Qadisiyia University-College of science Computer Dept. Abstract The aim of this research is use adaptive search (genetic
More informationGrade 7 Science Learning Standards
Grrade 7 Sciience Currrriicullum Overrviiew Middle School Science Hands-on, Minds-On, Science is the primary focus of the middle school science program, and includes content from Earth and Space Science,
More information(Preliminary Version) Evolutionary Turing Machines The Quest for Busy. Beavers
(Preliminary Version) Evolutionary Turing Machines The Quest for Busy Beavers Penousal Machado, Francisco B. Pereira Instituto Superior de Engenharia de Coimbra (ISEC), Quinta da Nora, 3030 Coimbra, Portugal.
More informationcse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska
cse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska LECTURE 1 Course Web Page www3.cs.stonybrook.edu/ cse303 The webpage contains: lectures notes slides; very detailed solutions to
More informationIntroduction to Scientific Modeling CS 365, Fall 2011 Cellular Automata
Introduction to Scientific Modeling CS 365, Fall 2011 Cellular Automata Stephanie Forrest ME 214 http://cs.unm.edu/~forrest/cs365/ forrest@cs.unm.edu 505-277-7104 Reading Assignment! Mitchell Ch. 10" Wolfram
More informationIndividual learning and population evolution
Genetic Algorithms [Read Chapter 9] [Exercises 9.1, 9.2, 9.3, 9.4] Evolutionary computation Prototypical GA An example: GABIL Genetic Programming Individual learning and population evolution 168 lecture
More information1 of 13 8/11/2014 10:32 AM Units: Teacher: APBiology, CORE Course: APBiology Year: 2012-13 Chemistry of Life Chapters 1-4 Big Idea 1, 2 & 4 Change in the genetic population over time is feedback mechanisms
More informationTOPOLOGY STRUCTURAL OPTIMIZATION USING A HYBRID OF GA AND ESO METHODS
TOPOLOGY STRUCTURAL OPTIMIZATION USING A HYBRID OF GA AND METHODS Hiroki Kajiwara Graduate School of Engineering email: hkajiwara@mikilab.doshisha.ac.jp Mitsunori Miki Department of Knowledge Engineering
More informationA Genetic Algorithm with Expansion and Exploration Operators for the Maximum Satisfiability Problem
Applied Mathematical Sciences, Vol. 7, 2013, no. 24, 1183-1190 HIKARI Ltd, www.m-hikari.com A Genetic Algorithm with Expansion and Exploration Operators for the Maximum Satisfiability Problem Anna Gorbenko
More informationII. Spatial Systems A. Cellular Automata 8/24/08 1
II. Spatial Systems A. Cellular Automata 8/24/08 1 Cellular Automata (CAs) Invented by von Neumann in 1940s to study reproduction He succeeded in constructing a self-reproducing CA Have been used as: massively
More informationADVANCED PLACEMENT BIOLOGY
ADVANCED PLACEMENT BIOLOGY Description Advanced Placement Biology is designed to be the equivalent of a two-semester college introductory course for Biology majors. The course meets seven periods per week
More informationInGen: Dino Genetics Lab Post-Lab Activity: DNA and Genetics
InGen: Dino Genetics Lab Post-Lab Activity: DNA and Genetics This activity is meant to extend your students knowledge of the topics covered in our DNA and Genetics lab. Through this activity, pairs of
More informationLowndes County Biology II Pacing Guide Approximate
Lowndes County Biology II Pacing Guide 2009-2010 MS Frameworks Pacing Guide Worksheet Grade Level: Biology II Grading Period: 1 st 9 weeks Chapter/Unit Lesson Topic Objective Number 1 The Process of 1.
More informationAutopoietic automata: Complexity issues in offspring-producing evolving processes
Theoretical Computer Science 383 (2007) 260 269 www.elsevier.com/locate/tcs Autopoietic automata: Complexity issues in offspring-producing evolving processes Jiří Wiedermann Institute of Computer Science,
More informationwww.lessonplansinc.com Topic: Dinosaur Evolution Project Summary: Students pretend to evolve two dinosaurs using genetics and watch how the dinosaurs adapt to an environmental change. This is a very comprehensive
More information