Parallel Programming 0024 Spring Semester 2010 May 6, 2010.

Slides:



Advertisements
Similar presentations
{ John Conway’s Game of Life.  John von Neumann  Wanted to find/create a machine that could replicate itself  Found an answer, but it was very complex.
Advertisements

Game of Life in 21 st Century ECE817 Presentation By Kyusik Chung
Game of Life Rules and Games Linh Tran ECE 573. What is Life? Life is just one example of a cellular automaton, which is any system in which rules are.
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.
Slides for Parallel Programming Techniques & Applications Using Networked Workstations & Parallel Computers 2nd ed., by B. Wilkinson & M
1 The Game of Life Supplement 2. 2 Background The Game of Life was devised by the British mathematician John Horton Conway in More sophisticated.
Adventures in the Computational Universe Modelling Flocking Behaviour.
Cellular Automata (Reading: Chapter 10, Complexity: A Guided Tour)
1 Chapter 13 Artificial Life: Learning through Emergent Behavior.
CELLULAR AUTOMATON Presented by Rajini Singh.
CELLULAR AUTOMATA Derek Karssenberg, Utrecht University, the Netherlands LIFE (Conway)
CS Summer 2005 Final class - July 1st Assorted fun topics in computability and complexity.
Cellular Automata MATH 800 Fall “Cellular Automata” 588,000 results in 94,600 results in 61,500 results in 2.
Game of Life Changhyo Yu Game of Life2 Introduction Conway’s Game of Life  Rule Dies if # of alive neighbor cells =< 2 (loneliness) Dies.
Conway’s Game of Life Andrew Williams
CS305j Introduction to Computing Two Dimensional Arrays 1 Topic 22 Two Dimensional Arrays "Computer Science is a science of abstraction -creating the right.
Today’s Plan Introduction to Artificial Life Cellular Automata
Cellular Automata Orit Moskovich
A cellular automata Developed by John Conway in 1970 Its evolution is determined by its initial state.
1 GEM2505M Frederick H. Willeboordse Taming Chaos.
RECURSIVE PATTERNS WRITE A START VALUE… THEN WRITE THE PATTERN USING THE WORDS NOW AND NEXT: NEXT = NOW _________.
04/25/13 Halting Problem Discrete Structures (CS 173) Derek Hoiem, University of Illinois 1
Cellular Automata This is week 7 of Biologically Inspired Computing Various credits for these slides, which have in part been adapted from slides by:
Cellular Automata Avi Swartz 2015 UNC Awards Ceremony.
Introduction At the heart of the growth of a multi-cellular organism is the process of cellular division… … aka (in computing) self-replication.
Cellular Automata and Game Design By Pete Strader.
Nawaf M Albadia Introduction. Components. Behavior & Characteristics. Classes & Rules. Grid Dimensions. Evolving Cellular Automata using Genetic.
General Purpose 3D Cellular Automata Modeller. A Regular Lattice of Cells, each obeying the same set of rules Simple rules for individual cells can produce.
Variations of Conway’s Game of Life Eswar Kondapavuluri.
Parallelization: Conway’s Game of Life. Cellular automata: Important for science Biology – Mapping brain tumor growth Ecology – Interactions of species.
Introduction Computational Challenges Serial Solutions Distributed Memory Solution Shared Memory Solution Parallel Analysis Conclusion Introduction: 
SE367 Project Final Presentation By: Sujith Thomas Parimi Krishna Chaitanya In charge:- Prof Amitabha Mukerjee.
The Role of Artificial Life, Cellular Automata and Emergence in the study of Artificial Intelligence Ognen Spiroski CITY Liberal Studies 2005.
CA tracker for TPC online reconstruction CERN, April 10, 2008 S. Gorbunov 1 and I. Kisel 1,2 S. Gorbunov 1 and I. Kisel 1,2 ( for the ALICE Collaboration.
STAT115 STAT225 BIST512 BIO298 - Intro to Computational Biology Python Tutorial II Monty Python, Game of Life and Sequence Alignment Feb 1, 2011 Daniel.
More Accurate Rate Estimation CS 170: Computing for the Sciences and Mathematics.
Prime Numbers.
CS 484 – Artificial Intelligence1 Announcements Lab 4 due today, November 8 Homework 8 due Tuesday, November 13 ½ to 1 page description of final project.
Scatology. Scatology Study of output Study of output Also called coprology Also called coprology From what comes out you get a pretty good idea of what.
CELLULAR AUTOMATA RULES GENERATOR FOR MICROBIAL COMMUNITIES CALIFORNIA STATE UNIVERSITY, SAN BERNARDINO SCHOOL OF COMPUTER SCIENCE & ENGINEERING By Melissa.
1 Data Structures CSCI 132, Spring 2014 Lecture 3 Programming Principles and Life Read Ch. 1.
Introduction  Per the project description: “Conway's Game of Life is a cellular automaton operating on a grid of rectangles, infinite in both directions.”
1 Chapter 13 Artificial Life: Learning through Emergent Behavior.
The Game of Life A simulation of "life". From simple rules, complex behavior arises Rules –A cell that is alive and has fewer than two live neighbors dies.
Tracking using Cellular Automaton Algorithm for CBM experiment Arkadiusz Bubak University of Silesia, Katowice, Poland.
Activity 2-1: The Game of Life
Introduction to Lattice Simulations. Cellular Automata What are Cellular Automata or CA? A cellular automata is a discrete model used to study a range.
Topic 26 Two Dimensional Arrays "Computer Science is a science of abstraction -creating the right model for a problem and devising the appropriate mechanizable.
Cellular Automata. The Game The Game of Life is not your typical computer game. It is a 'cellular automation', and was invented by the Cambridge mathematician.
CELLULAR AUTOMATA A Presentation By CSC. OUTLINE History One Dimension CA Two Dimension CA Totalistic CA & Conway’s Game of Life Classification of CA.
The Game of Life Erik Amelia Amy. What is the “Game of Life?” The “Game of Life” (often referred to as Life) is not your typical game. There are no actual.
עקרונות תכנות מונחה עצמים תרגול 6 - GUI. סיכום ביניים GUI:  Swing  Basic components  Event handling  Containers  Layouts.
Review Recursion Call Stack. Two-dimensional Arrays Visualized as a grid int[][] grays = {{0, 20, 40}, {60, 80, 100}, {120, 140, 160}, {180, 200, 220}};
HW5: Parallelization. – 2 – Conway’s Game of Life Simple 2D universe with simple rules, complex results! 1. Any live cell with fewer than two live neighbors.
Cellular Automata. John von Neumann 1903 – 1957 “a Hungarian-American mathematician and polymath who made major contributions to a vast number of fields,
A Variation on Conway’s Game of Life Winston Lee EPS 109.
Clicker questions 11/14/13 CSE 1102 Fall A. Composite B. Holder C. Proxy D. Factory E. Impossible to tell from diagram In this example, we want.
The Northern Lights: Demonstrations. Programmability Overview A major aspect of our project is programmability- it is an interactive display medium, the.
Cellular Automata Introduction  Cellular Automata originally devised in the late 1940s by Stan Ulam (a mathematician) and John von Neumann.  Originally.
A few of the people involved and what they’ve done.
TRU-COMP3710 Artificial Life and Emergent Behavior1 Course Outline Part I – Introduction to Artificial Intelligence Part II – Classical Artificial Intelligence.
David Squeri CELLULAR AUTOMATON. A cellular automaton is an array of cells that switch on or off depending on whether other cells are on or off. “Rules”
Conway’s Game of Life Jess Barak Game Theory. History Invented by John Conway in 1970 Wanted to simplify problem from 1940s presented by John von Neumann.
The Shape of Math R09 VOL.3 The Life Game 09.08.0 4 Masashi SANAE.
pictures_slideshow/article.htm.
Cellular automata.
Illustrations of Simple Cellular Automata
Cellular Automata.
Modeling Pattern Formation in Skin Diseases by a Cellular Automaton
Activity 2-1: The Game of Life
Presentation transcript:

Parallel Programming 0024 Spring Semester 2010 May 6, 2010

– R 9 :: 2 – 0024 Spring 2010 What we do today Primes with JSCP JCSP Übung Swing Assignment 9 Game of Life MVC Pattern Swing Tutorial Links

– R 9 :: 3 – 0024 Spring 2010 Conway‘s Game of Life Wikipedia: The Game of Life, also known simply as Life, is a cellular automaton devised by the British mathematician John Horton Conway in It is the best-known example of a cellular automaton.

– R 9 :: 4 – 0024 Spring 2010 Assignment 9 Solution Demo

– R 9 :: 5 – 0024 Spring 2010 GoL Rules Any live cell with fewer than two live neighbours dies, as if by needs caused by underpopulation. Any live cell with more than three live neighbours dies, as if by overcrowding. Any live cell with two or three live neighbours lives, unchanged, to the next generation. Any dead cell with exactly three live neighbours becomes a live cell.

– R 9 :: 6 – 0024 Spring 2010 GoL: Glider

– R 9 :: 7 – 0024 Spring 2010 GoL: Glider Gun

– R 9 :: 8 – 0024 Spring 2010 GoL: Breeder

– R 9 :: 9 – 0024 Spring 2010 MVC by Wikipedia

– R 9 :: 10 – 0024 Spring 2010 MVC by Sun

– R 9 :: 11 – 0024 Spring 2010 Swing Tutorials nents/index.html darmstadt.de/courses/helpdesk/swing.html

– R 9 :: 12 – 0024 Spring 2010 Questions