Fitness Landscape Simulation Modeling Architecture and Component Research Laurent Mirabeau Igor Feldman Murat Cokol Ezra Goodnoe.

Slides:



Advertisements
Similar presentations
Ch. 12 Routing in Switched Networks
Advertisements

Probability in Propagation
1 Introduction to Transportation Systems. 2 PART I: CONTEXT, CONCEPTS AND CHARACTERIZATI ON.
Solving problems by searching
Ch. 12 Routing in Switched Networks Routing in Packet Switched Networks Routing Algorithm Requirements –Correctness –Simplicity –Robustness--the.
Visualisation Network-of-Experts Malvern, UK NOV 4-6th 2008 Amy Vanderbilt ~ Vin Taylor ~ Martin Taylor ~ Mark Nixon ~ Jan Terje Bjorke Sven Brueckner.
CSE 5243 (AU 14) Graph Basics and a Gentle Introduction to PageRank 1.
Effort Games and the Price of Myopia Michael Zuckerman Joint work with Yoram Bachrach and Jeff Rosenschein.
Optimal Collaborative Access Point Association In Wireless Networks Ouldooz Baghban Karimi School of Computing Science Simon Fraser University Jiangchuan.
报告人: 林 苑 指导老师:章忠志 副教授 复旦大学  Introduction about random walks  Concepts  Applications  Our works  Fixed-trap problem  Multi-trap problem.
Design Organizations for the International Environment
Multiple V-model. Introduction In embedded systems, the test object is not just executable code. First a model of the system is built on a PC, which simulates.
An Approach to Evaluate Data Trustworthiness Based on Data Provenance Department of Computer Science Purdue University.
Network Approaches to Managing Complex Urban River Systems Research Team: CSIRO Sustainable Ecosystems CSIRO Land and Water Complex Systems Science University.
COMPLEX NETWORK APPROACH TO PREDICTING MUTATIONS ON CARDIAC MYOSIN Del Jackson CS 790G Complex Networks
Technion –Israel Institute of Technology Software Systems Laboratory A Comparison of Peer-to-Peer systems by Gomon Dmitri and Kritsmer Ilya under Roi Melamed.
Degree correlations in complex networks Lazaros K. Gallos Chaoming Song Hernan A. Makse Levich Institute, City College of New York.
Three heuristics for transmission scheduling in sensor networks with multiple mobile sinks Damla Turgut and Lotzi Bölöni University of Central Florida.
© 2007 The MITRE Corporation. All rights reserved Approved for Public Release; Distribution Unlimited Potential New Ideas from Complexity Science.
 I/O channel ◦ direct point to point or multipoint comms link ◦ hardware based, high speed, very short distances  network connection ◦ based on interconnected.
Developing the Advertising Campaign The Advertising Plan.
Peer-to-Peer and Social Networks Random Graphs. Random graphs E RDÖS -R ENYI MODEL One of several models … Presents a theory of how social webs are formed.
Engineering and Physical Sciences Research Council Shaping Capabilities in ICT ENGINEERING AND PHYSICAL SCIENCES RESEARCH COUNCIL.
Social Networks Corina Ciubuc.
By Paul Cottrell, BSc, MBA, ABD. Author Complexity Science, Behavioral Finance, Dynamic Hedging, Financial Statistics, Chaos Theory Proprietary Trader.
IEEE P2P, Aachen, Germany, September Ad-hoc Limited Scale-Free Models for Unstructured Peer-to-Peer Networks Hasan Guclu
1 Performance Evaluation of Computer Networks: Part II Objectives r Simulation Modeling r Classification of Simulation Modeling r Discrete-Event Simulation.
All the components of network are connected to the central device called “hub” which may be a hub, a router or a switch. There is no direct traffic between.
Boltzmann Machine (BM) (§6.4) Hopfield model + hidden nodes + simulated annealing BM Architecture –a set of visible nodes: nodes can be accessed from outside.
Deeply Embedded Large Scale Networks Specify and Control Emerging Behavior.
Uncovering Overlap Community Structure in Complex Networks using Particle Competition Fabricio A. Liang
Network Topology
Growth Codes: Maximizing Sensor Network Data Persistence abhinav Kamra, Vishal Misra, Jon Feldman, Dan Rubenstein Columbia University, Google Inc. (SIGSOMM’06)
The Geography and Evolution of the European Internet Infrastructure Sandra Vinciguerra URU – Utrecht University
Connected Components Fun with graphs, searching, and queues.
Visual Analytics Decision Support Environment for Epidemic Modeling and Response Evaluation Shehzad Afzal, Ross Maciejewski, David S. Ebert VACCINE, Purdue.
Decapitation of networks with and without weights and direction : The economics of iterated attack and defense Advisor : Professor Frank Y. S. Lin Presented.
Zhuo Peng, Chaokun Wang, Lu Han, Jingchao Hao and Yiyuan Ba Proceedings of the Third International Conference on Emerging Databases, Incheon, Korea (August.
Random Graph Generator University of CS 8910 – Final Research Project Presentation Professor: Dr. Zhu Presented: December 8, 2010 By: Hanh Tran.
Developed by Cool Pictures & MultiMedia Presentations
 Probability in Propagation. Transmission Rates  Models discussed so far assume a 100% transmission rate to susceptible individuals (e.g. Firefighter.
1 New Product Development and Design for Manufacturability
PnP Networks Self-Aware Networks Self-Aware Networks Self-Healing and Self-Defense via Aware and Vigilant Networks PnP Networks, Inc. August, 2002.
© 2010 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole or in part.
Local Search. Systematic versus local search u Systematic search  Breadth-first, depth-first, IDDFS, A*, IDA*, etc  Keep one or more paths in memory.
PRODUCTION & PRODUCT PLANNING. What is Production Planning? Planning is a process for accomplishing purpose. Production planning is one of the planning.
BUSINESS MANAGEMENT SIMULATION APT Resources & Services Trainer: Uwe Schulte Training session.
Siddhartha Gunda Sorabh Hamirwasia.  Generating small world network model.  Optimal network property for decentralized search.  Variation in epidemic.
Project funded by the Future and Emerging Technologies arm of the IST Programme Search in Unstructured Networks Niloy Ganguly, Andreas Deutsch Center for.
Using Ant Agents to Combine Reactive and Proactive strategies for Routing in Mobile Ad Hoc Networks Fredrick Ducatelle, Gianni di caro, and Luca Maria.
Improving System Availability in Distributed Environments Sam Malek with Marija Mikic-Rakic Nels.
An Improved Acquaintance Immunization Strategy for Complex Network.
Chapter 16 March 25, Probability Theory: What an agent should believe based on the evidence Utility Theory: What the agent wants Decision Theory:
Next Generation of Apache Hadoop MapReduce Owen
Hierarchical Organization in Complex Networks by Ravasz and Barabasi İlhan Kaya Boğaziçi University.
Border Gateway Protocol. Intra-AS v.s. Inter-AS Intra-AS Inter-AS.
Evolution of Cooperation in Mobile Ad Hoc Networks Jeff Hudack (working with some Italian guy)
DYNAMICS OF CITY BIKE SHARING NETWORKS Kasia Samson & Claudio Durastanti.
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.
Towards More Realistic Affinity Maturation Modeling Erich R. Schmidt, Steven H. Kleinstein Department of Computer Science, Princeton University July 19,
William Stallings Data and Computer Communications
Design Organizations for the International Environment
Elaboration Likelihood Model
Department of Computer Science University of York
The Asset Reinvestment Logic Diagram
Failure is an option: Vulnerability of charging infrastructure as part of rollout strategies Lecturer: J.R. Helmus & M. Glombek ARCHI symposium.
Boltzmann Machine (BM) (§6.4)
Characterization of Wireless Networks in the Home
Hiroki Sayama NECSI Summer School 2008 Week 2: Complex Systems Modeling and Networks Agent-Based Models Hiroki Sayama
Design Organizations for the International Environment
Presentation transcript:

Fitness Landscape Simulation Modeling Architecture and Component Research Laurent Mirabeau Igor Feldman Murat Cokol Ezra Goodnoe

Innovation Theory Dominant Design –After a given time a few dominant designs will emerge. They can be thought as basin of attractions Dominant Design Product Process

Innovation Theory Architecture Vs Component Innovation –Companies organize around the architecture of the product they research / manufacture

The Model One central hub: architecture team Several peripheral nodes: component teams Hub decisions impact overall system Generic network motif

Fitness Function Create n nodes, initialize values 1-5 utility Create n*(n-1)*s*s links, initialize random -1<<1 Calculate fitness for points in landscape Random drop on landscape Select one-mutant neighbor Calculate fitness and walk if higher Iterate, repeat for many agents over several landscapes

Results 10 Landscapes 100 Agents 500 Iterations

Emergence of Dominant Designs

Next Steps Increase complexity of model by adding dependencies Try various strategies – Stochastic process to melt off peaks, Concurrent agents, Increase hamming distance Combine several motifs to create new class of problems