` Question: How do immune systems achieve such remarkable scalability? Approach: Simulate lymphoid compartments, fixed circulatory networks, cytokine communication.

Slides:



Advertisements
Similar presentations
Approaches, Tools, and Applications Islam A. El-Shaarawy Shoubra Faculty of Eng.
Advertisements

Using Parallel Genetic Algorithm in a Predictive Job Scheduling
Adaptability Theory as a Guide for Interfacing Computers and Human Society.
Institute of Intelligent Power Electronics – IPE Page1 Introduction to Basics of Genetic Algorithms Docent Xiao-Zhi Gao Department of Electrical Engineering.
1 Sensor Networks and Networked Societies of Artifacts Jose Rolim University of Geneva.
Neuro-Evolution of Augmenting Topologies Ben Trewhella.
Parallelized Evolution System Onur Soysal, Erkin Bahçeci Erol Şahin Dept. of Computer Engineering Middle East Technical University.
The Immune System as a Complex Adaptive System: A RePast Simulation of the Anti- Viral Immune Response Virginia A. Folcik, Ph.D. Charles.
HIV/AIDS as a Microcosm for the Study of Evolution.
1 Abstract This study presents an analysis of two modified fuzzy ARTMAP neural networks. The modifications are first introduced mathematically. Then, the.
MANETs A Mobile Ad Hoc Network (MANET) is a self-configuring network of mobile nodes connected by wireless links. Characteristics include: no fixed infrastructure.
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.
Simulation Models as a Research Method Professor Alexander Settles.
The Bio-Networking Architecture: An Infrastructure of Autonomic Agents in Pervasive Networks Jun Suzuki netresearch.ics.uci.edu/bionet/
Artificial Immune Systems Our body’s immune system is a perfect example of a learning system. It is able to distinguish between good cells and potentially.
D Nagesh Kumar, IIScOptimization Methods: M1L4 1 Introduction and Basic Concepts Classical and Advanced Techniques for Optimization.
UNIVERSITY OF JYVÄSKYLÄ Resource Discovery Using NeuroSearch Presentation for the Agora Center InBCT-seminar Mikko Vapa, researcher InBCT 3.2.
Subgoal: conduct an in-depth study of critical representation, operator and other choices used for evolutionary program repair at the source code level.
Image Registration of Very Large Images via Genetic Programming Sarit Chicotay Omid E. David Nathan S. Netanyahu CVPR ‘14 Workshop on Registration of Very.
Genetic Algorithms Overview Genetic Algorithms: a gentle introduction –What are GAs –How do they work/ Why? –Critical issues Use in Data Mining –GAs.
1 Principles of a Computer Immune System Anil Somayaji, Steven Hofmeyr, & Stephanie Forrest Presented by: Jesus Morales.
Development in hardware – Why? Option: array of custom processing nodes Step 1: analyze the application and extract the component tasks Step 2: design.
By Paul Cottrell, BSc, MBA, ABD. Author Complexity Science, Behavioral Finance, Dynamic Hedging, Financial Statistics, Chaos Theory Proprietary Trader.
Genetic Algorithms and Ant Colony Optimisation
Chapter 11: Artificial Intelligence
Revolutionizing the Field of Grey-box Attack Surface Testing with Evolutionary Fuzzing Department of Computer Science & Engineering College of Engineering.
Tennessee Technological University1 The Scientific Importance of Big Data Xia Li Tennessee Technological University.
Evolutionary Algorithms BIOL/CMSC 361: Emergence Lecture 4/03/08.
` Research 2: Information Diversity through Information Flow Subgoal: Systematically and precisely measure program diversity by measuring the information.
Cristian Urs and Ben Riveira. Introduction The article we chose focuses on improving the performance of Genetic Algorithms by: Use of predictive models.
Swarm Computing Applications in Software Engineering By Chaitanya.
Swarm Intelligence 虞台文.
Study on Genetic Network Programming (GNP) with Learning and Evolution Hirasawa laboratory, Artificial Intelligence section Information architecture field.
Robotica Lecture 3. 2 Robot Control Robot control is the mean by which the sensing and action of a robot are coordinated The infinitely many possible.
(Particle Swarm Optimisation)
Evolving Virtual Creatures & Evolving 3D Morphology and Behavior by Competition Papers by Karl Sims Presented by Sarah Waziruddin.
1 “Genetic Algorithms are good at taking large, potentially huge search spaces and navigating them, looking for optimal combinations of things, solutions.
MURI: Integrated Fusion, Performance Prediction, and Sensor Management for Automatic Target Exploitation 1 Dynamic Sensor Resource Management for ATE MURI.
Project funded by the Future and Emerging Technologies arm of the IST Programme FET-Open scheme Project funded by the Future and Emerging Technologies.
Industrial Data Modeling with DataModeler Mark Kotanchek Evolved Analytics
Bio-Networking: Biology Inspired Approach for Development of Adaptive Network Applications 21 May 2005Ognen Paunovski Bio-Networking: Biology Inspired.
REPRESENTATIONS AND OPERATORS FOR IMPROVING EVOLUTIONARY SOFTWARE REPAIR Claire Le Goues Westley Weimer Stephanie Forrest
Neural Networks and Machine Learning Applications CSC 563 Prof. Mohamed Batouche Computer Science Department CCIS – King Saud University Riyadh, Saudi.
Self-healing Architectures based on context DEpendent adaptive Software Agents (SADESA) – an extension of EU-IST Project SAFEGUARD DeSIRE Workshop Pisa,
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology 1 Evolving Reactive NPCs for the Real-Time Simulation Game.
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.
Changing the Rules of the Game Dr. Marco A. Janssen Department of Spatial Economics.
SPYCE/May’04 coverage: A Cooperative Immunization System for an Untrusting Internet Kostas Anagnostakis University of Pennsylvania Joint work with: Michael.
CITS7212: Computational Intelligence An Overview of Core CI Technologies Lyndon While.
Coevolutionary Automated Software Correction Josh Wilkerson PhD Candidate in Computer Science Missouri S&T.
Neural Networks Presented by M. Abbasi Course lecturer: Dr.Tohidkhah.
Chapter 1: Introduction to Neuro-Fuzzy (NF) and Soft Computing (SC)
Biologically Inspired Computation Ant Colony Optimisation.
Designing High-Capacity Neural Networks for Storing, Retrieving and Forgetting Patterns in Real-Time Dmitry O. Gorodnichy IMMS, Cybernetics Center of Ukrainian.
Patterns of Evolution SC Standard B-5 Students will demonstrate an understanding of biological evolution & the diversity of life.
Presentation By SANJOG BHATTA Student ID : July 1’ 2009.
Multi-cellular paradigm The molecular level can support self- replication (and self- repair). But we also need cells that can be designed to fit the specific.
Genetic Algorithms. Solution Search in Problem Space.
Genetic Algorithm(GA)
Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.
March 1, 2016Introduction to Artificial Intelligence Lecture 11: Machine Evolution 1 Let’s look at… Machine Evolution.
Genetic Algorithms.
Cluster formation based comparison of Genetic algorithm and Particle Swarm Optimization in Wireless Sensor Network Ms.Amita Yadav.
Operating System Protection Through Program Evolution
Mapping Artificial Intelligence
Lecture 4. Niching and Speciation (1)
Coevolutionary Automated Software Correction
Immunocomputing and Artificial Immune Systems
Presentation transcript:

` Question: How do immune systems achieve such remarkable scalability? Approach: Simulate lymphoid compartments, fixed circulatory networks, cytokine communication pathways and signals. Examine relationships between: 1.Lymph node size/number and flow locality and time for T cells to reach an infection. 2.Inter-cell communication and system size. 3.Communication pathway types and sufficient antibody production. Question: How do immune systems achieve such remarkable scalability? Approach: Simulate lymphoid compartments, fixed circulatory networks, cytokine communication pathways and signals. Examine relationships between: 1.Lymph node size/number and flow locality and time for T cells to reach an infection. 2.Inter-cell communication and system size. 3.Communication pathway types and sufficient antibody production. Size and number of lymph nodes scale sublinearly with mass. Approximate remote attacker control of a vulnerable and invulnerable machine, over time. Research 2: Information-Theoretic Fuzz Tester Subgoal: Fuzz tester that estimates distance between an input and an exploit. Problem: Fuzz testers only indicate whether an input succeeds, regardless of how close it is to an exploit. Fuzz testers generate unexpected program input; they are useful for assessing fix quality. Insight: Attacks have unique information flow signatures. Approach: Extend our existing simulation platforms: AntGA: Quantifies how pheromone communication improves ant foraging behavior. CyCells: Implements 3-D simulations of immune response. Systems contain more errors and are more prone to attack than ever. The balance of power favors the attacker:  Software replicates are all vulnerable to the same attack.  System complexity precludes rapid repair. We must rethink the current cybersecurity paradigm. Subgoal: Develop models and simulations to understand Scalable RADAR principles and adapt them to computation. Scalable RADAR for Co-evolutionary Adaptive Environments Wes Weimer Stephanie Forrest (PI)Jed CrandallMelanie Moses Biological systems search complex spaces without a “leader.” Biological Principles Insight Cells respond to environmental signals automatically. Research 1: Evolutionary Program Repair Competitive Co-evolution: Simultaneously generate tests, attacks, and repairs. Improving Programs via Evolution: Evolve more efficient but less accurate vertex and pixel shader programs. Iterative Repairs: Mimic gradual evolutionary change. Iteration and Co-evolution Approach: Evolve a version of a buggy program that passes all of its test cases. Result: Automatically repairs 8 error types in 12 programs (> 2.2M lines of code) containing 8 error types (most from public vulnerability reports), in 2200 s on average. Patches vary in size from lines of code. Subgoal: Extend evolutionary repair – whereby software bugs are automatically repaired using genetic programming, a computational technique inspired by evolution – towards a software immune system. Question: What is the trade-off between learning (i.e., naïve T-cells) and memory (i.e., memory T- cells)? Approach: Use GA to learn an optimal probability for the replacement of a naïve cell with a memory cell. Investigate the effect of biasing naïve cells to contain memory cell signatures. Problem Animal immune systems can defeat multiple, adaptable adversaries. Adapt Scalable RADAR to a new, clean-slate paradigm for software development/maintenance. Demonstrate large, complex software systems that:  automatically detect attacks  repair themselves  evolve a diversity of solutions. Goal Question: Are the limitations of the adaptive immune system inherent to scalable RADAR? Approach: Simulate co- evolution and new rule sets to determine viability of systems that attempt to predict future attacks or eliminate undesirable behaviors, such as: 1.Destroying host cells. 2.Killing the host. 3.Succumbing to infection. 4.Behaving reactively. Limitations Learning/Memory Scalabilit y Approach: Exploit information theoretic features of program behavior, exploits and vulnerabilities: An exploit is an input X correlated with a low-level behavior L—I(X;L)—to gain control over a high-level behavior H with which L correlates: I(H; L). Program behavior on X reveals patterns:  An increase in I(X;L) for some L followed by an increase in I(X;H) when the attacker has control.  A decrease in I(H; L|X) relative to I(H; L), as X is more closely correlated with H and L than expected. A good repair for a vulnerability should eliminate the increase in I(X; L) and, by extension, in I(X; H). Approach: Exploit information theoretic features of program behavior, exploits and vulnerabilities: An exploit is an input X correlated with a low-level behavior L—I(X;L)—to gain control over a high-level behavior H with which L correlates: I(H; L). Program behavior on X reveals patterns:  An increase in I(X;L) for some L followed by an increase in I(X;H) when the attacker has control.  A decrease in I(H; L|X) relative to I(H; L), as X is more closely correlated with H and L than expected. A good repair for a vulnerability should eliminate the increase in I(X; L) and, by extension, in I(X; H). Immune systems are composed of millions of cells. Redundancy, diversity, “wisdom of the crowd.” Genes, cells, systems adapt over multiple time scales. Software is a complex, evolving system. 1`. Distributed Repair: Use multiple, independent, trusting agents to cooperatively evolve repairs. N-Variant Systems: Deploy different program variants in parallel. Anomaly Detection: Repair in the face of a noisy automatic intrusion detection signal. Anomaly Detection, Automation Immune Memory: Generate a population of useful repair structures and substructures. Immune Memory: Generate a population of useful repair structures and substructures. Repair Templates Research 3: Simulation and Modeling