Computing Systems Lecture 12 Future Computing. Natural computing Take inspiration from nature for the development of novel problem-solving techniques.

Slides:



Advertisements
Similar presentations
Chapter 8 Geocomputation Part A:
Advertisements

Approaches, Tools, and Applications Islam A. El-Shaarawy Shoubra Faculty of Eng.
Computational Intelligence Winter Term 2011/12 Prof. Dr. Günter Rudolph Lehrstuhl für Algorithm Engineering (LS 11) Fakultät für Informatik TU Dortmund.
Swarm-Based Traffic Simulation
Computational Intelligence Winter Term 2013/14 Prof. Dr. Günter Rudolph Lehrstuhl für Algorithm Engineering (LS 11) Fakultät für Informatik TU Dortmund.
An Introduction to Artificial Intelligence. Introduction Getting machines to “think”. Imitation game and the Turing test. Chinese room test. Key processes.
CITS4403 Computational Modelling Game of Life. One of the first cellular automata to be studied, and probably the most popular of all time, is a 2-D CA.
Bio-Inspired Optimization. Our Journey – For the remainder of the course A brief review of classical optimization methods The basics of several stochastic.
Biologically Inspired AI (mostly GAs). Some Examples of Biologically Inspired Computation Neural networks Evolutionary computation (e.g., genetic algorithms)
Chapter 4 DECISION SUPPORT AND ARTIFICIAL INTELLIGENCE
Producing Artificial Neural Networks using a Simple Embryogeny Chris Bowers School of Computer Science, University of Birmingham White.
1 Chapter 13 Artificial Life: Learning through Emergent Behavior.
Natural Computation: computational models inspired by nature Dr. Daniel Tauritz Department of Computer Science University of Missouri-Rolla CS347 Lecture.
Simulation Models as a Research Method Professor Alexander Settles.
Joanne Turner 15 Nov 2005 Introduction to Cellular Automata.
D Nagesh Kumar, IIScOptimization Methods: M1L4 1 Introduction and Basic Concepts Classical and Advanced Techniques for Optimization.
Lectures on Cellular Automata Continued Modified and upgraded slides of Martijn Schut Vrij Universiteit Amsterdam Lubomir Ivanov Department.
Today’s Plan Introduction to Artificial Life Cellular Automata
Nawaf M Albadia Introduction. Components. Behavior & Characteristics. Classes & Rules. Grid Dimensions. Evolving Cellular Automata using Genetic.
MASS: From Social Science to Environmental Modelling Hazel Parry
Artificial Chemistries – A Review Peter Dittrich, Jens Ziegler, and Wolfgang Banzhaf Artificial Life 7: , 2001 Summarized by In-Hee Lee.
Discovery of Cellular Automata Rules Using Cases Ken-ichi Maeda Chiaki Sakama Wakayama University Discovery Science 2003, Oct.17.
THE NEW ERA OF LIFE. Introduction: Artificial Intelligence (AI) is the area of computer science focusing on creating machines that can engage on behaviors.
The Role of Artificial Life, Cellular Automata and Emergence in the study of Artificial Intelligence Ognen Spiroski CITY Liberal Studies 2005.
1 Bio + Informatics AAACTGCTGACCGGTAACTGAGGCCTGCCTGCAATTGCTTAACTTGGC An Overview پرتال پرتال بيوانفورماتيك ايرانيان.
Department of Information Technology Indian Institute of Information Technology and Management Gwalior AASF hIQ 1 st Nov ‘09 Department of Information.
Swarm Computing Applications in Software Engineering By Chaitanya.
CS 484 – Artificial Intelligence1 Announcements Lab 4 due today, November 8 Homework 8 due Tuesday, November 13 ½ to 1 page description of final project.
Swarm Intelligence 虞台文.
Lecture 8: 24/5/1435 Genetic Algorithms Lecturer/ Kawther Abas 363CS – Artificial Intelligence.
Welcome to AP Biology Mr. Levine Ext. # 2317.
Computational Intelligence II Lecturer: Professor Pekka Toivanen Exercises: Nina Rogelj
Course material – G. Tempesti Course material will generally be available the day before the lecture Includes.
Modern Heuristic Optimization Techniques and Potential Applications to Power System Control Mohamed A El-Sharkawi The CIA lab Department of Electrical.
(Particle Swarm Optimisation)
Kavita Singh CS-A What is Swarm Intelligence (SI)? “The emergent collective intelligence of groups of simple agents.”
1 Chapter 13 Artificial Life: Learning through Emergent Behavior.
Studying Life Vodcast 1.3 Unit 1: Introduction to Biology.
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
Cellular Automata Spatio-Temporal Information for Society Münster, 2014.
Evolving Virtual Creatures & Evolving 3D Morphology and Behavior by Competition Papers by Karl Sims Presented by Sarah Waziruddin.
Algorithms and their Applications CS2004 ( ) 13.1 Further Evolutionary Computation.
Neural Networks and Machine Learning Applications CSC 563 Prof. Mohamed Batouche Computer Science Department CCIS – King Saud University Riyadh, Saudi.
Quantum computing, teleportation, cryptography Computing Teleportation Cryptography.
From Swarm Intelligence to Swarm Robotics
Technical Seminar Presentation Presented By:- Prasanna Kumar Misra(EI ) Under the guidance of Ms. Suchilipi Nepak Presented By Prasanna.
1. Genetic Algorithms: An Overview  Objectives - Studying basic principle of GA - Understanding applications in prisoner’s dilemma & sorting network.
SIMULATIONS, REALIZATIONS, AND THEORIES OF LIFE H. H. PATTEE (1989) By Hyojung Seo Dept. of Psychology.
Cellular Automata Introduction  Cellular Automata originally devised in the late 1940s by Stan Ulam (a mathematician) and John von Neumann.  Originally.
Introduction to Quantum Computing
SwinTop: Optimizing Memory Efficiency of Packet Classification in Network Author: Chen, Chang; Cai, Liangwei; Xiang, Yang; Li, Jun Conference: Communication.
Circulation Simulation Andrew Moeding. Simulation Types Traffic flow pattern simulation Building/pedestrian circulation simulation.
TRU-COMP3710 Artificial Life and Emergent Behavior1 Course Outline Part I – Introduction to Artificial Intelligence Part II – Classical Artificial Intelligence.
Swarms MONT 104Q – Mathematical Journeys, November 2015.
A field of study that encompasses computational techniques for performing tasks that require intelligence when performed by humans. Simulation of human.
Robot Intelligence Technology Lab. Evolutionary Robotics Chapter 3. How to Evolve Robots Chi-Ho Lee.
Emergent Structures
Presented By: Farid, Alidoust Vahid, Akbari 18 th May IAUT University – Faculty.
Sub-fields of computer science. Sub-fields of computer science.
Agent-Based Modeling ANB 218a Jeff Schank.
Artificial Life and Emergent Behavior
Spatio-Temporal Information for Society Münster, 2014
Marco Mamei Franco Zambonelli Letizia Leonardi ESAW '02
Computational Intelligence
Dr. Unnikrishnan P.C. Professor, EEE
Artificial Life and Emergent Behavior
Computational Intelligence
Introduction to Artificial Intelligence Instructor: Dr. Eduardo Urbina
Speaker: Ao Weng Chon Advisor: Kwang-Cheng Chen
Presentation transcript:

Computing Systems Lecture 12 Future Computing

Natural computing Take inspiration from nature for the development of novel problem-solving techniques. Include: – Artificial Neural Networks – Evolutionary Algorithms – Swarm Intelligence – Artificial Immune Systems – Artificial Life – Molecular Computing – Quantum Computing.

Nature as Information Processing One can view processes occurring in nature as information processing. Understanding the universe itself from the point of view of information processing. The Zuse-Fredkin thesis, dating back to the 1960s, states that the entire universe is a huge cellular automaton which continuously updates its rules. Recently it has been suggested that the whole universe is a quantum computer that computes its own behaviour.

Nature-Inspired Models of Computation The most established "classical" nature- inspired models of computation are – cellular automata – neural computation – evolutionary computation

Nature-Inspired Models of Computation More recent computational systems abstracted from natural processes include – swarm intelligence – artificial immune systems – amorphous computing

Cellular Automata A cellular automaton is a dynamical system consisting of a two-dimensional grid of cells. Space and time are discrete and each of the cells can be in a finite number of states. The cellular automaton updates the states of its cells synchronously according to the transition rules given a priori. The next state of a cell is computed by a transition rule and it depends only on its current state and the states of its neighbours.

Cellular Automata Cellular automata have been applied to modelling a variety of phenomena such as communication, growth, reproduction, competition, evolution and other physical and biological processes.

Game of Life Probably the most widely discussed and investigated cellular automata is that known as the Game of Life which was developed by John Conway. The Game is played on a square draughts-like board (and so each cell has precisely 8 neighbours) with only three very simple rules:

Game of Life A cell that is white becomes black at the next time if it has precisely three black neighbours. A cell that is black becomes white at the next time if it has four or more black neighbours. A cell that is black at one instant becomes white at the next if it has one or no black neighbours. All other cells retain their colour.

Game of Life Life is started with a small black object and the rest of the board white. Two very simple starting shapes are shown in next slide. These are of no great interest since the first immediately dies while the second reproduces itself without change for all time.

Game of Life

More complicated (and more interesting) objects are possible, however, such as a “glider” which moves across the screen changing its shape in a regular manner. One particular glider is shown on the right of the diagram.

Logic Operations by CA Further we can create “glider-guns” which emit regular streams of gliders. Finally we can position our streams of gliders so that one knocks out the other. It is using objects such as these that we can prove that CA are capable of being thought of as computers.

Logic Operations by CA For example if we wish to represent the (binary) number , we could do so using glider glider noglider noglider glider glider glider where the nogliders have been removed from a stream of gliders by a collision with another stream.

Logic Operations by CA By positioning glider-guns in the appropriate positions, we can perform any logic operation.

Neural Computation Neural computation is the field of research that emerged from the comparison between computing machines and the human nervous system. This field aims both to understand how the brain of living organisms works (brain theory or computational neuroscience), and to design efficient algorithms based on the principles of how the human brain processes information (Artificial Neural Networks, ANN).

Evolutionary Computation Evolutionary computation is a computational paradigm inspired by Darwinian evolution. An artificial evolutionary system is a computational system based on the notion of simulated evolution. Evolution strategies Genetic algorithms

Swarm Intelligence Swarm intelligence, sometimes referred to as collective intelligence, is defined as the problem solving behaviour that emerges from the interaction of individual agents (e.g., bacteria, ants, termites, bees, spiders, fish, birds) which communicate with other agents by acting on their local environments. Particle swarm optimization Ant algorithms

Complex Systems It becomes apparent that most of the complex systems share a common “swarm-like” architecture. The essential characteristic of this kind of system is a non-centralized collection of relatively autonomous entities interacting with each other and a dynamic environment.

Complex Systems Typically, there is no central authority dictating the behaviour of the collection of individuals: each of the many individuals making up the “swarm” makes its own behavioural choices on the basis of its own sampling and evaluation of the world, its own internal state, and through communication with other individuals.

Swarm We use the term “swarm” in a general sense to refer to any such loosely structured collection of interacting agents. The classic example of a swarm is a swarm of bees, but the metaphor of a swarm can be extended to other systems with a similar architecture.

Swarm An ant colony can be thought of as a swarm whose individual agents are ants, a flock of birds is a swarm whose agents are birds, traffic is a swarm of cars, a crowd is a swarm of people, an immune system is a swarm of cells and molecules, and an economy is a swarm of economic agents.

Individual → Group What makes swarms scientifically interesting, and often mathematically intractable, is the coupling between the individual and the group behaviours.

Simplicity → Complexity Although the individuals are usually relatively simple, their collective behaviour can be quite complex. Swarms allow us to focus directly on the fundamental roots of complexity: they capture the point at which simplicity becomes complexity.

Swarm Emergent Behaviour The behaviour of a swarm as a whole emerges in a highly nonlinear manner from the behaviours of the individuals. This emergence involves a critical feedback loop between the behaviour of the individuals and the behaviour of the whole collection. In a swarm, the combination of individual behaviours determines the collective behaviour of the whole group.

Swarm Emergent Behaviour In turn, the behaviour of the whole group determines the conditions (spatial and temporal patterns of information) within which each individual makes its behavioural choices. These individual choices again collectively determine the overall group behaviour, and on and on, in a never-ending loop.

Emergent Behaviour This is a behaviour exhibited by a system consisting of a large number of simple and similar (or identical) components, which is surprisingly complex given the simplicity of the individual components of the system. The essential characteristic of this kind of system is a non-centralized collection of relatively autonomous entities interacting with each other and a dynamic environment.

Ant colony optimization Wander randomly. Search for food. Lay down pheromone. Follow pheromone. Pheromone trail evaporates. Longer paths less likely to survive. Positive feedback.

Artificial Immune Systems Artificial immune systems are computational systems inspired by the natural immune systems of biological organisms. Viewed as an information processing system, the natural immune system of organisms performs many complex tasks in parallel and distributed computing fashion.

Amorphous Computing In biological organisms, morphogenesis (the development of well-defined shapes and functional structures) is achieved by the interactions between cells guided by the genetic program encoded in the organism's DNA.

Amorphous Computing Inspired by this idea, amorphous computing aims at engineering well-defined shapes and patterns, or coherent computational behaviours, from the local interactions of a multitude of simple unreliable, irregularly placed, asynchronous, identically programmed computing elements (particles).

Artificial Life Artificial life (ALife) is a research field whose ultimate goal is to understand the essential properties of life organisms by building, within electronic computers or other artificial media, ab initio systems that exhibit properties normally associated only with living organisms. Early examples include Lindenmayer systems (L-systems), that have been used to model plant growth and development.

Artificial Life Pioneering experiments in artificial life included the design of evolving "virtual block creatures" acting in simulated environments with realistic features such as kinetics, dynamics, gravity, collision, and friction. [ These artificial creatures were selected for their abilities endowed to swim, or walk, or jump, and they competed for a common limited resource (controlling a cube).

Artificial Life The simulation resulted in the evolution of creatures exhibiting surprising behaviour: some developed hands to grab the cube, others developed legs to move towards the cube. This computational approach was further combined with rapid manufacturing technology to actually build the physical robots that virtually evolved.

Molecular Computing Molecular computing (a.k.a. biomolecular computing, biocomputing, biochemical computing, DNA computing) is a computational paradigm in which data is encoded as biomolecules such as DNA strands, and molecular biology tools act on the data to perform various operations (e.g., arithmetic or logical operations).

Quantum Computing A quantum computer [ processes data stored as quantum bits (qubits), and uses quantum mechanical phenomena such as superposition and entanglement to perform computations. A qubit can hold a "0", a "1", or a quantum superposition of these. A quantum computer operates on qubits with quantum logic gates.

Quantum Computing Quantum cryptography A successful open air experiment in quantum cryptography was reported in 2007, where data was transmitted securely over a distance of 144 km. Quantum teleportation is another promising application, in which a quantum state (not matter or energy) is transferred to an arbitrary distant location.