Artificial Chemistries Autonomic Computer Systems University of Basel Yvonne Mathis.

Slides:



Advertisements
Similar presentations
The Evolution of Complexity: an introduction Francis Heylighen Evolution, Complexity and Cognition group (ECCO) Vrije Universiteit Brussel Francis Heylighen.
Advertisements

Using Parallel Genetic Algorithm in a Predictive Job Scheduling
DYNAMICS OF RANDOM BOOLEAN NETWORKS James F. Lynch Clarkson University.
Dealing with Complexity Robert Love, Venkat Jayaraman July 24, 2008 SSTP Seminar – Lecture 10.
Åbo Akademi University & TUCS, Turku, Finland Ion PETRE Andrzej MIZERA COPASI Complex Pathway Simulator.
Multiscale Stochastic Simulation Algorithm with Stochastic Partial Equilibrium Assumption for Chemically Reacting Systems Linda Petzold and Yang Cao University.
The process of evolution drives the diversity and unity of life
EvoDebate Statement September 2001 Wolfgang Banzhaf Universität Dortmund, Informatik XI.
System Biology Study Group Walker Research Group Spring 2007.
Dynamics of RNA-based replicator networks Camille STEPHAN-OTTO ATTOLINI, Christof FLAMM, Peter STADLER Institut for Theoretical Chemistry and Structural.
Computational Biology, Part 17 Biochemical Kinetics I Robert F. Murphy Copyright  1996, All rights reserved.
Mathematical Modelling of Phage Dynamics: Applications in STEC studies Tom Evans.
Chemical Computing Peter Dittrich Bio Systems Analysis Department. of Mathematics and Computer Science Friedrich-Schiller-University Jena Friedrich-Schiller-Universität.
Genetic Algorithms Learning Machines for knowledge discovery.
Natural Computation: computational models inspired by nature Dr. Daniel Tauritz Department of Computer Science University of Missouri-Rolla CS347 Lecture.
Altruism A Simulated Investigation COM SCI 194 Honors Research Fall 2007 ~ Spring 2008 Alexander Liu and Eric Chang Professor Amit Sahai.
Simulation Models as a Research Method Professor Alexander Settles.
Triangulation of network metaphors The Royal Netherlands Academy of Arts and Sciences Iina Hellsten & Andrea Scharnhorst Networked Research and Digital.
UNIVERSITY OF JYVÄSKYLÄ Resource Discovery in Unstructured P2P Networks Distributed Systems Research Seminar on Mikko Vapa, research student.
Genetic Algorithms: A Tutorial
Optimization Based Modeling of Social Network Yong-Yeol Ahn, Hawoong Jeong.
Artificial Chemistries – A Review Peter Dittrich, Jens Ziegler, and Wolfgang Banzhaf Artificial Life 7: , 2001 Summarized by In-Hee Lee.
Microsoft Research Faculty Summit Colonies Of Synchronizing Agents: Molecules, Cells, And Tissues Matteo Cavaliere – MSR – UNITN CoSBi (Trento,
Converting Macromolecular Regulatory Models from Deterministic to Stochastic Formulation Pengyuan Wang, Ranjit Randhawa, Clifford A. Shaffer, Yang Cao,
Week 3a Mechanisms for Adaptation. POLS-GEOG-SOC 495 Spring Lecture Overview Review –CAS –Principles of chaos How do systems “learn”? –“Credit.
Study on Genetic Network Programming (GNP) with Learning and Evolution Hirasawa laboratory, Artificial Intelligence section Information architecture field.
The Received View of Evolution Sex and Death: An Introduction to Philosophy of Biology
Boltzmann Machine (BM) (§6.4) Hopfield model + hidden nodes + simulated annealing BM Architecture –a set of visible nodes: nodes can be accessed from outside.
Presenter: Chih-Yuan Chou GA-BASED ALGORITHMS FOR FINDING EQUILIBRIUM 1.
A new Programming Paradigm inspired by Algorithmic Chemistries UPP 2004 September 2004 Wolfgang Banzhaf, Memorial University of Newfoundland, Canada and.
+ Simulation Design. + Types event-advance and unit-time advance. Both these designs are event-based but utilize different ways of advancing the time.
Emergent Robustness in Software Systems through Decentralized Adaptation: an Ecologically-Inspired ALife Approach Franck Fleurey, Benoit Baudry, Benoit.
Introduction to Lattice Simulations. Cellular Automata What are Cellular Automata or CA? A cellular automata is a discrete model used to study a range.
Introduction to Self-Organization
Timoteo Carletti PACE – PA’s Coordination Workshop, Los Alamos July 2005 Dipartimento di Statistica, Università Ca’ Foscari Venezia,
Agent-based methods for translational cancer multilevel modelling Sylvia Nagl PhD Cancer Systems Science & Biomedical Informatics UCL Cancer Institute.
Fuzzy Genetic Algorithm
1 “Genetic Algorithms are good at taking large, potentially huge search spaces and navigating them, looking for optimal combinations of things, solutions.
Soft Computing A Gentle introduction Richard P. Simpson.
Autonomy and Artificiality Margaret A. Boden Hojin Youn.
What is a QUASI-SPECIES By Ye Dan U062281A USC3002 Picturing the World through Mathematics.
Chapter Eighteen: Energy and Reactions
Unit 1 - Organization Topics: Chemistry of Life Function of Organic Molecules Cell Structure and Function Evolutionary History History of Life Classification.
Agent Based Modeling (ABM) in Complex Systems George Kampis ETSU, 2007 Spring Semester.
Genetic Algorithms ML 9 Kristie Simpson CS536: Advanced Artificial Intelligence Montana State University.
Formal Specification and Analysis of Software Architectures Using the Chemical Abstract Machine Model CS 5381 Juan C. González Authors: Paola Inverardi.
Neural Networks and Machine Learning Applications CSC 563 Prof. Mohamed Batouche Computer Science Department CCIS – King Saud University Riyadh, Saudi.
Edge Assembly Crossover
CS 484 Designing Parallel Algorithms Designing a parallel algorithm is not easy. There is no recipe or magical ingredient Except creativity We can benefit.
The Equilibrium Condition, the Equilibrium Constant and Equilibrium in Terms of Pressures Chemistry 142 B Autumn Quarter 2004 J. B. Callis, Instructor.
… evolution by natural selection?. Summary of Darwin’s evidence and main ideas on the Origin of Species by Means of Natural Selection Convergent evolution.
Complexity and Hierarchy
MA354 Math Modeling Introduction. Outline A. Three Course Objectives 1. Model literacy: understanding a typical model description 2. Model Analysis 3.
1 Autonomic Computer Systems Evolutionary Computation Pascal Paysan.
What is life? What makes something living? Living Things vs. Non-living Things Living Non-living.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
Evolution The Big Picture. Darwin’s alternative explanation to Special Creation - Evolution "In the broadest sense, evolution is merely change … Biological.
Genetic Algorithms. Solution Search in Problem Space.
Artificial Neural Networks By: Steve Kidos. Outline Artificial Neural Networks: An Introduction Frank Rosenblatt’s Perceptron Multi-layer Perceptron Dot.
Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.
Objectives Explain the concept of reaction mechanism. Use the collision theory to interpret chemical reactions. Define activated complex. Relate activation.
Reaction Process. A reaction mechanism is a step by step sequence of reactions that show an overall chemical change The same reaction can occur by different.
Cmpe 588- Modeling of Internet Emergence of Scale-Free Network with Chaotic Units Pulin Gong, Cees van Leeuwen by Oya Ünlü Instructor: Haluk Bingöl.
Sub-fields of computer science. Sub-fields of computer science.
Reaction Process.
Monte Carlo methods 10/20/11.
SPS1. Obtain, evaluate, and communicate information from the Periodic Table to explain the relative properties of elements based on patterns of atomic.
Biology: Understanding Life
Boltzmann Machine (BM) (§6.4)
A Gentle introduction Richard P. Simpson
Presentation transcript:

Artificial Chemistries Autonomic Computer Systems University of Basel Yvonne Mathis

Motivation Chemical program evolution rather than design Chemical system quickly become complex Exploit emergent properties (self-organization, self-healing, robustness) ‏ Bottum-up approach From Pre-Programmed to Emergent Chemical Programs Chemistry not only as a metaphor for parallel computation, but also emergent computation, c.f. Section 5 2

Contents  Classification & Definition of AC  Motivation & Goal of AC  Artificial Chemical Computing  Dynamics  Emergent Computation  Evolutionary Dynamics  Algorithmic Chemistry  Chemical Organization Theory  Examples in Fraglets 3

1. Classification & Definition of AC  A branch of Artificial Life (ALife), dedicated to the study of chemical processes related to life and organizations in general [1]  AC is on the level of molecules, molecules as information carriers and processors. It is about chemistry, biochemistry, prebiotic evolution.  AC can be defined by a triple (S, R, A), where S is the set of all possible molecules, R is a set of collision rules representing the interaction among the molecules si є S, and A is an algorithm describing the reaction vessel or domain and how much the rules are applied to the molecules inside the vessel. [1] 4

2. Motivation & Goal of AC  Simulate (bio-)chemical processes, e.g. origin of life from primordial soup of molecules  Explore alternative computation models: chemical computing, c.f. section 3  Understand emerging/self-maintaining structures, e.g. chemical organization theory [2], c.f. sections 5, 8  Terminology: Molecular species, Multiset, (well- stirred) Vessel, Concentration, Chemical reaction 5

3. Artificial Chemical Computing  Program (= set of molecules) is executed (= molecules are consumed and produced in chemical reactions) until no more reactions can take place  Examples:  Computing with rules in a multiset (Gamma)‏  Computing with hierarchical multisets (Membrane Computing (P Systems))‏ -> result is within molecule  Computing with Concentrations (algebraic functions, also with real chemistry)‏ -> result is reflected by the concentration Formal models P Systems 6

4. Dynamics  Concentration levels convey information about dynamics. Computation is used to assess changes in concentration. The Result is ready when the system reaches equilibrium. C oncentration dynamics are describes by a system of ODEs:  Terminology: law of mass action, reaction networks, equilibrium: simulation algorithms: deterministic vs stochastic 7

4. Dynamics Stochastic simulation: Gillespie’s Algorithm (1977)‏ calculates which reaction occurs when Advantages:  Realistic for small numbers of molecules  Can easily deal with the dynamic creation of new species Shortcomings: not scalable to large numbers of molecules, or large numbers of possible reactions 8

4. Dynamics Chemical reactions network emerge from an initial population and seem to stabilize -> emergence of organizations (c.f. section 8, Chemical Org. Theory)‏ Dynamics can be analyzed by the following methods:  Perturbation analysis: equilibrium and stability (steady-state analysis)‏  Simulation algorithms: deterministic vs stochastic Problem: The analysis doesn't include the creation of new species (c.f. section 7, Algorithmic Chemistry)‏ 9

4. Dynamics  Dynamics control which of the parallel execution paths is processed at which speed  Under selective pressure, the growth rate of a set of molecules determines its fitness (see Evolutionary Dynamics)‏ 10

5. Emergent Computation  Creation/Selection process from an evolutionary dynamics (c.f. Section 6) perspective  Molecules with structure (program, data) instead of simple atoms  Reaction rules defined by the molecular structure instead of being fixed and predefined  Advantages: more robust and efficient, more flexible in the face of complex and dynamic environments, do not need to foresee all contingencies, better model for complex natural processes  Terminology: Emergent phenomena (unexpected global behavior or pattern arising from the interaction of parts in a complex system) Self-organization (process by which the system is able organize itself from the inside, out of a disordered state), Complex System 11

6. Evolutionary Dynamics Terminology: Replication (autocatalytic reaction) and Death (decay reaction)‏ Selection and Fitness (=rate of reproduction)‏ Growth laws Variation (e.g. mutations), induced external/passive or internal/active, Reproduction = Replication + Variation, quasispecies Interactions (Random catalytic reaction networks with Catalytic Reaction Equation:)‏ 12

7. Algorithmic Chemistry  A Constructive system: A set of molecules may generate new molecule species, which again influence the reaction dynamics  Considers molecule structure: Molecules are λ-expressions from λ-calculus All molecules represent functions (programs in functional programming)‏ Functions operate on functions to produce other functions: f + g → f + g + f(g)‏ Precursor of chemical organization theory 13

8. Chemical Organization Theory  Identify organizations (stable set of molecules) and the transition between them  Definition: An organization is a set of molecule species that is closed and self-maintaining  Chemical Organization Theory determines the stability of the set of molecule species and analyzes then dynamic fixpoints (= instances of organizations)‏  The set of organizations form a lattice  Mutations cause molecule species to come and go  Down- and upward movement 14

9. Examples in Fraglets  Distributed Averaging Distributed calculation as an emergent phenomena Make use of the chemical equilibrium Reaction network is distributed among the whole network System strives to equilibrium where solution is presented 15

9. Examples in Fraglets  Self-Healing Programs Autocatalytic reaction Two molecules species form an organization population grows hyperbolically -> introduce limitation (total number of molecules) -> survival of the common (first program). The resulting program is robust to invasion from other programs and code deletion -> inherent self-healing emerges Application: Self-Healing link load balancing protocol 16

References  P. Dittrich, J. Ziegler, and W. Banzhaf. “Artificial Chemistries – A Review”. Artificial Life, 7(3):225–275,  P. Dittrich and P. Speroni di Fenizio. “Chemical Organization Theory”. Bulletin of Matematical Biology, 69(4):1199–1231, 2007.