Division of Labor in Ant Colonies
|
|
- Egbert Hawkins
- 6 years ago
- Views:
Transcription
1 Division of Labor in Ant Colonies Alex Cornejo, Anna Dornhaus, Nancy Lynch and Radhika Nagpal October 13, /19
2 What is division of labor? Division of labor is the process by which individual ants in a colony decide which task to perform to ensure the survival of the colony. 2/19
3 What is division of labor? Division of labor is the process by which individual ants in a colony decide which task to perform to ensure the survival of the colony. 2/19
4 What is division of labor? Division of labor is the process by which individual ants in a colony decide which task to perform to ensure the survival of the colony. 2/19
5 What is division of labor? Division of labor is the process by which individual ants in a colony decide which task to perform to ensure the survival of the colony. 2/19
6 What is division of labor? (cont.) Much of the existing work focuses on exploring the correlation between temporal and morphological variations and worker behavior. 3/19
7 What is division of labor? (cont.) Much of the existing work focuses on exploring the correlation between temporal and morphological variations and worker behavior. 3/19
8 What is division of labor? (cont.) Much of the existing work focuses on exploring the correlation between temporal and morphological variations and worker behavior. 3/19
9 Contributions A very general mathematical formulation for the phenomenon of division of labor in ant colonies. 4/19
10 Contributions A very general mathematical formulation for the phenomenon of division of labor in ant colonies. A distributed algorithm that quickly reaches a near optimal task allocation and imposing only minimal assumptions on the capabilities of individual ants. 4/19
11 A model for division of labor 5/19
12 A model for division of labor A set A of ants. 5/19
13 A model for division of labor A set A of ants. A set T of tasks. 5/19
14 A model for division of labor A set A of ants. A set T of tasks. For task τ T, ant a A and time t R 0 : 5/19
15 A model for division of labor A set A of ants. A set T of tasks. For task τ T, ant a A and time t R 0 : d(τ, t) is the total energy demand for task τ at time t. 5/19
16 A model for division of labor A set A of ants. A set T of tasks. For task τ T, ant a A and time t R 0 : d(τ, t) is the total energy demand for task τ at time t. e(τ, a, t) is the energy that can be supplied by ant a if engaged at task τ at time t. 5/19
17 Task Assignment 6/19
18 Task Assignment A task assignment is a function y : A R 0 T { }. 6/19
19 Task Assignment A task assignment is a function y : A R 0 T { }. Given y we define Y (τ, t) as the set of ants assigned to task τ at time t, and I(t) as the set of ants assigned to no task at time t. Y (τ, t) = {a A : y(a, t) = τ} I(t) = {a A : y(a, t) = } 6/19
20 Task Assignment A task assignment is a function y : A R 0 T { }. Given y we define Y (τ, t) as the set of ants assigned to task τ at time t, and I(t) as the set of ants assigned to no task at time t. Y (τ, t) = {a A : y(a, t) = τ} I(t) = {a A : y(a, t) = } Observe that by definition A = Y (τ, t) I(t). 6/19
21 What is a good task allocation? 7/19
22 What is a good task allocation? w(τ, t) = a Y (τ,t) e(τ, a, t) is the energy supplied to task τ at time t. 7/19
23 What is a good task allocation? w(τ, t) = a Y (τ,t) e(τ, a, t) is the energy supplied to task τ at time t. q(τ, t) = d(τ, t) w(τ, t), if negative represents a surplus of energy at task τ, if positive represents a deficit of energy at task τ, and if zero then the task τ is in equilibrium. 7/19
24 What is a good task allocation? w(τ, t) = a Y (τ,t) e(τ, a, t) is the energy supplied to task τ at time t. q(τ, t) = d(τ, t) w(τ, t), if negative represents a surplus of energy at task τ, if positive represents a deficit of energy at task τ, and if zero then the task τ is in equilibrium. An optimal task assignment is one that minimizes τ T q(τ, t)2 7/19
25 Restricted System Model 8/19
26 Restricted System Model We assume e(τ, a, t) = c for all τ T, every ant a A, and every time t R 0. 8/19
27 Restricted System Model We assume e(τ, a, t) = c for all τ T, every ant a A, and every time t R 0. We consider synchronous model where time proceeds in lock-step rounds 1, 2,..., and for the duration of each round i N each ant a A works at task y(a, i). 8/19
28 Capabilities of Individuals 9/19
29 Capabilities of Individuals Recall that q(τ, i) = d(τ, i) w(τ, i) is the difference between the energy demand for task τ at round i and the energy supplied for task τ at round i. 9/19
30 Capabilities of Individuals Recall that q(τ, i) = d(τ, i) w(τ, i) is the difference between the energy demand for task τ at round i and the energy supplied for task τ at round i. For each task τ T ants can sense only a binary feedback function f(τ, i) where: f(τ, i) = { +1 q(τ, i) 0, 1 q(τ, i) < 0. 9/19
31 Algorithm Idea 10/19
32 Algorithm Idea Intuition: Given sufficient memory, ants could use a randomized binary-search-like strategy, guided by the function f, to reach the optimal division of labor. 10/19
33 Algorithm Idea Intuition: Given sufficient memory, ants could use a randomized binary-search-like strategy, guided by the function f, to reach the optimal division of labor. Idea 1: Offload the burden of memory from the individuals to the colony. 10/19
34 Algorithm Idea Intuition: Given sufficient memory, ants could use a randomized binary-search-like strategy, guided by the function f, to reach the optimal division of labor. Idea 1: Offload the burden of memory from the individuals to the colony. Idea 2: Let ants use a response-threshold strategy to pick tasks, and allow them to specialize. 10/19
35 Algorithm Details Each ant stores a task currentt ask T { } and a potential table ϱ[τ]. 11/19
36 Algorithm Details Each ant stores a task currentt ask T { } and a potential table ϱ[τ]. Initially ants start in the Resting state with currentt ask = and a potential of zero for every task τ T, ϱ[τ] = 0. 11/19
37 Algorithm Details Each ant stores a task currentt ask T { } and a potential table ϱ[τ]. Initially ants start in the Resting state with currentt ask = and a potential of zero for every task τ T, ϱ[τ] = 0. Ants can be in one of the five states Resting, FirstReserve, SecondReserve, TempWorker and CoreWorker. 11/19
38 Simplified State Machine +1 prob prob Resting FirstReserve SecondReserve TempWorker CoreWorker threshold 12/19
39 Resting State τ T, ϱ[τ] { 0 if f(τ, i) < 0 min(ϱ[τ] + 1, 3) if f(τ, i) > 0 13/19
40 Resting State { 0 if f(τ, i) < 0 τ T, ϱ[τ] min(ϱ[τ] + 1, 3) if f(τ, i) > 0 candidate {τ T ϱ[τ] = 3} 13/19
41 Resting State { 0 if f(τ, i) < 0 τ T, ϱ[τ] min(ϱ[τ] + 1, 3) if f(τ, i) > 0 candidate {τ T ϱ[τ] = 3} if candidate then 13/19
42 Resting State { 0 if f(τ, i) < 0 τ T, ϱ[τ] min(ϱ[τ] + 1, 3) if f(τ, i) > 0 candidate {τ T ϱ[τ] = 3} if candidate then with probability 1 do 2 τ T, ϱ[τ] 0 currentt ask random candidate task state TempWorker end with end if 13/19
43 Working States case state = TempWorker 14/19
44 Working States case state = TempWorker if f(currentt ask, i) < 0 then state FirstReserve 14/19
45 Working States case state = TempWorker if f(currentt ask, i) < 0 then state FirstReserve else state CoreWorker end if 14/19
46 Working States case state = TempWorker if f(currentt ask, i) < 0 then state FirstReserve else state CoreWorker end if case state = CoreWorker 14/19
47 Working States case state = TempWorker if f(currentt ask, i) < 0 then state FirstReserve else state CoreWorker end if case state = CoreWorker if f(currentt ask, i) < 0 then state TempWorker end if end case 14/19
48 Reserve States case state = FirstReserve 15/19
49 Reserve States case state = FirstReserve if f(currentt ask, i) < 0 then state Resting else 15/19
50 Reserve States case state = FirstReserve if f(currentt ask, i) < 0 then state Resting else with probability 1 2 do state TempWorker otherwise state SecondReserve end with end if 15/19
51 Reserve States case state = FirstReserve if f(currentt ask, i) < 0 then state Resting else with probability 1 2 do state TempWorker otherwise state SecondReserve end with end if case state = SecondReserve 15/19
52 Reserve States case state = FirstReserve if f(currentt ask, i) < 0 then state Resting else with probability 1 2 do state TempWorker otherwise state SecondReserve end with end if case state = SecondReserve if f(currentt ask, i) < 0 then state Resting 15/19
53 Reserve States case state = FirstReserve if f(currentt ask, i) < 0 then state Resting else with probability 1 2 do state TempWorker otherwise state SecondReserve end with end if case state = SecondReserve if f(currentt ask, i) < 0 then state Resting else state TempWorker end if 15/19
54 Analysis Outline 16/19
55 Analysis Outline Lemma 1: If during an interval tasks are not too oversatisfied, the probability there is a task with a deficit is exponentially small in the interval length. 16/19
56 Analysis Outline Lemma 1: If during an interval tasks are not too oversatisfied, the probability there is a task with a deficit is exponentially small in the interval length. ants 0 time 16/19
57 Analysis Outline Lemma 1: If during an interval tasks are not too oversatisfied, the probability there is a task with a deficit is exponentially small in the interval length. ants 0 time 16/19
58 Analysis Outline Lemma 1: If during an interval tasks are not too oversatisfied, the probability there is a task with a deficit is exponentially small in the interval length. ants 0 time 16/19
59 Analysis Outline Lemma 1: If during an interval tasks are not too oversatisfied, the probability there is a task with a deficit is exponentially small in the interval length. ants 0 time 16/19
60 Analysis Outline Lemma 1: If during an interval tasks are not too oversatisfied, the probability there is a task with a deficit is exponentially small in the interval length. ants 0 time 16/19
61 Analysis Outline Lemma 2: Once a task transitions from having a deficit to a surplus, it will keep oscillating every two or three rounds; moreover, with constant probability the number of ants involved in the oscillations is reduced by a constant fraction. 17/19
62 Analysis Outline Lemma 2: Once a task transitions from having a deficit to a surplus, it will keep oscillating every two or three rounds; moreover, with constant probability the number of ants involved in the oscillations is reduced by a constant fraction. ants 0 time 17/19
63 Analysis Outline Lemma 2: Once a task transitions from having a deficit to a surplus, it will keep oscillating every two or three rounds; moreover, with constant probability the number of ants involved in the oscillations is reduced by a constant fraction. ants 0 time 17/19
64 Analysis Outline Lemma 2: Once a task transitions from having a deficit to a surplus, it will keep oscillating every two or three rounds; moreover, with constant probability the number of ants involved in the oscillations is reduced by a constant fraction. ants 0 time 17/19
65 Analysis Outline Lemma 2: Once a task transitions from having a deficit to a surplus, it will keep oscillating every two or three rounds; moreover, with constant probability the number of ants involved in the oscillations is reduced by a constant fraction. ants 0 time 17/19
66 Analysis Outline Lemma 2: Once a task transitions from having a deficit to a surplus, it will keep oscillating every two or three rounds; moreover, with constant probability the number of ants involved in the oscillations is reduced by a constant fraction. ants 0 time 17/19
67 Analysis Outline Theorem: After O(log n) rounds, with high probability, ants reach an optimal task allocation. ants 0 time 18/19
68 19/19 Questions?
Advanced topic: Space complexity
Advanced topic: Space complexity CSCI 3130 Formal Languages and Automata Theory Siu On CHAN Chinese University of Hong Kong Fall 2016 1/28 Review: time complexity We have looked at how long it takes to
More informationSC741 W12: Division of Labor Part I: Fixed- and Variable- Threshold Algorithms
SC741 W12: Division of Labor Part I: Fixed- and Variable- Threshold Algorithms Outline Division of labor in natural systems Ants Bees, wasps Models and mechanisms Fixed-threshold mechanisms Variable-threshold
More informationLecture 6: Communication Complexity of Auctions
Algorithmic Game Theory October 13, 2008 Lecture 6: Communication Complexity of Auctions Lecturer: Sébastien Lahaie Scribe: Rajat Dixit, Sébastien Lahaie In this lecture we examine the amount of communication
More informationS62 Leslie A. Kolodziejski Chair of the Committee on Graduate Students
A Symbiotic Perspective on Distributed Algorithms and Social Insects by Tsvetomira Radeva B.S., State University of New York, College at Brockport (2010) S.M., Massachusetts Institute of Technology (2013)
More informationUniversal Algebra and Computational Complexity Lecture 1
Universal Algebra and Computational Complexity Lecture 1 Ross Willard University of Waterloo, Canada Třešt, September 2008 Ross Willard (Waterloo) Algebra and Complexity Třešt, September 2008 1 / 23 Outline
More informationSequential Logic (3.1 and is a long difficult section you really should read!)
EECS 270, Fall 2014, Lecture 6 Page 1 of 8 Sequential Logic (3.1 and 3.2. 3.2 is a long difficult section you really should read!) One thing we have carefully avoided so far is feedback all of our signals
More informationSolving ANTS with Loneliness Detection and Constant Memory. Casey O Brien
Solving ANTS with Loneliness Detection and Constant Memory by Casey O Brien B.S., Computer Science, B.S., Mathematics Massachusetts Institute of Technology (2014) Submitted to the Department of Electrical
More informationComputational Complexity for Algebraists
Computational Complexity for Algebraists Ross Willard University of Waterloo, Canada January 20, 2009 Ross Willard (Waterloo) Complexity for Algebraists January 20, 2009 1 / 23 Outline First hour: Decision
More informationWars of Attrition with Budget Constraints
Wars of Attrition with Budget Constraints Gagan Ghosh Bingchao Huangfu Heng Liu October 19, 2017 (PRELIMINARY AND INCOMPLETE: COMMENTS WELCOME) Abstract We study wars of attrition between two bidders who
More informationCh 01. Analysis of Algorithms
Ch 01. Analysis of Algorithms Input Algorithm Output Acknowledgement: Parts of slides in this presentation come from the materials accompanying the textbook Algorithm Design and Applications, by M. T.
More informationAsymmetric Communication Complexity and Data Structure Lower Bounds
Asymmetric Communication Complexity and Data Structure Lower Bounds Yuanhao Wei 11 November 2014 1 Introduction This lecture will be mostly based off of Miltersen s paper Cell Probe Complexity - a Survey
More informationLecture 6: Introducing Complexity
COMP26120: Algorithms and Imperative Programming Lecture 6: Introducing Complexity Ian Pratt-Hartmann Room KB2.38: email: ipratt@cs.man.ac.uk 2015 16 You need this book: Make sure you use the up-to-date
More informationNeural Nets and Symbolic Reasoning Hopfield Networks
Neural Nets and Symbolic Reasoning Hopfield Networks Outline The idea of pattern completion The fast dynamics of Hopfield networks Learning with Hopfield networks Emerging properties of Hopfield networks
More informationA Polynomial Time Deterministic Algorithm for Identity Testing Read-Once Polynomials
A Polynomial Time Deterministic Algorithm for Identity Testing Read-Once Polynomials Daniel Minahan Ilya Volkovich August 15, 2016 Abstract The polynomial identity testing problem, or PIT, asks how we
More informationOnline Learning, Mistake Bounds, Perceptron Algorithm
Online Learning, Mistake Bounds, Perceptron Algorithm 1 Online Learning So far the focus of the course has been on batch learning, where algorithms are presented with a sample of training data, from which
More informationSingle-part-type, multiple stage systems
MIT 2.853/2.854 Introduction to Manufacturing Systems Single-part-type, multiple stage systems Stanley B. Gershwin Laboratory for Manufacturing and Productivity Massachusetts Institute of Technology Single-stage,
More informationCh01. Analysis of Algorithms
Ch01. Analysis of Algorithms Input Algorithm Output Acknowledgement: Parts of slides in this presentation come from the materials accompanying the textbook Algorithm Design and Applications, by M. T. Goodrich
More informationValency Arguments CHAPTER7
CHAPTER7 Valency Arguments In a valency argument, configurations are classified as either univalent or multivalent. Starting from a univalent configuration, all terminating executions (from some class)
More informationAsynchronous Models For Consensus
Distributed Systems 600.437 Asynchronous Models for Consensus Department of Computer Science The Johns Hopkins University 1 Asynchronous Models For Consensus Lecture 5 Further reading: Distributed Algorithms
More informationPulsed Lasers Revised: 2/12/14 15: , Henry Zmuda Set 5a Pulsed Lasers
Pulsed Lasers Revised: 2/12/14 15:27 2014, Henry Zmuda Set 5a Pulsed Lasers 1 Laser Dynamics Puled Lasers More efficient pulsing schemes are based on turning the laser itself on and off by means of an
More informationModels for representing sequential circuits
Sequential Circuits Models for representing sequential circuits Finite-state machines (Moore and Mealy) Representation of memory (states) Changes in state (transitions) Design procedure State diagrams
More informationOutline. Ant Colony Optimization. Outline. Swarm Intelligence DM812 METAHEURISTICS. 1. Ant Colony Optimization Context Inspiration from Nature
DM812 METAHEURISTICS Outline Lecture 8 http://www.aco-metaheuristic.org/ 1. 2. 3. Marco Chiarandini Department of Mathematics and Computer Science University of Southern Denmark, Odense, Denmark
More informationDissipativity. Outline. Motivation. Dissipative Systems. M. Sami Fadali EBME Dept., UNR
Dissipativity M. Sami Fadali EBME Dept., UNR 1 Outline Differential storage functions. QSR Dissipativity. Algebraic conditions for dissipativity. Stability of dissipative systems. Feedback Interconnections
More informationIntroduction to Mathematical Programming
Introduction to Mathematical Programming Ming Zhong Lecture 22 October 22, 2018 Ming Zhong (JHU) AMS Fall 2018 1 / 16 Table of Contents 1 The Simplex Method, Part II Ming Zhong (JHU) AMS Fall 2018 2 /
More informationLecture: Workload Models (Advanced Topic)
Lecture: Workload Models (Advanced Topic) Real-Time Systems, HT11 Martin Stigge 28. September 2011 Martin Stigge Workload Models 28. September 2011 1 System
More informationCSC 5170: Theory of Computational Complexity Lecture 4 The Chinese University of Hong Kong 1 February 2010
CSC 5170: Theory of Computational Complexity Lecture 4 The Chinese University of Hong Kong 1 February 2010 Computational complexity studies the amount of resources necessary to perform given computations.
More informationEconomics 210B Due: September 16, Problem Set 10. s.t. k t+1 = R(k t c t ) for all t 0, and k 0 given, lim. and
Economics 210B Due: September 16, 2010 Problem 1: Constant returns to saving Consider the following problem. c0,k1,c1,k2,... β t Problem Set 10 1 α c1 α t s.t. k t+1 = R(k t c t ) for all t 0, and k 0
More informationNeural Turing Machine. Author: Alex Graves, Greg Wayne, Ivo Danihelka Presented By: Tinghui Wang (Steve)
Neural Turing Machine Author: Alex Graves, Greg Wayne, Ivo Danihelka Presented By: Tinghui Wang (Steve) Introduction Neural Turning Machine: Couple a Neural Network with external memory resources The combined
More informationIt ain t no good if it ain t snappy enough. (Efficient Computations) COS 116, Spring 2011 Sanjeev Arora
It ain t no good if it ain t snappy enough. (Efficient Computations) COS 116, Spring 2011 Sanjeev Arora Administrative stuff Readings avail. from course web page Feedback form on course web page; fully
More informationModel Structures and Behavior Patterns
Model Structures and Behavior Patterns The systems modeler believes that the behavior of the system is a function of the system itself Translating that idea to the model realm, this means that certain
More informationPlanning in Markov Decision Processes
Carnegie Mellon School of Computer Science Deep Reinforcement Learning and Control Planning in Markov Decision Processes Lecture 3, CMU 10703 Katerina Fragkiadaki Markov Decision Process (MDP) A Markov
More informationLecture 8. Instructor: Haipeng Luo
Lecture 8 Instructor: Haipeng Luo Boosting and AdaBoost In this lecture we discuss the connection between boosting and online learning. Boosting is not only one of the most fundamental theories in machine
More informationMultiprocessor Scheduling I: Partitioned Scheduling. LS 12, TU Dortmund
Multiprocessor Scheduling I: Partitioned Scheduling Prof. Dr. Jian-Jia Chen LS 12, TU Dortmund 22/23, June, 2015 Prof. Dr. Jian-Jia Chen (LS 12, TU Dortmund) 1 / 47 Outline Introduction to Multiprocessor
More informationStatic Program Analysis
Static Program Analysis Xiangyu Zhang The slides are compiled from Alex Aiken s Michael D. Ernst s Sorin Lerner s A Scary Outline Type-based analysis Data-flow analysis Abstract interpretation Theorem
More informationDecentralized Sequential Hypothesis Testing. Change Detection
Decentralized Sequential Hypothesis Testing & Change Detection Giorgos Fellouris, Columbia University, NY, USA George V. Moustakides, University of Patras, Greece Outline Sequential hypothesis testing
More informationDivisible Load Scheduling
Divisible Load Scheduling Henri Casanova 1,2 1 Associate Professor Department of Information and Computer Science University of Hawai i at Manoa, U.S.A. 2 Visiting Associate Professor National Institute
More informationLimitations of Efficient Reducibility to the Kolmogorov Random Strings
Limitations of Efficient Reducibility to the Kolmogorov Random Strings John M. HITCHCOCK 1 Department of Computer Science, University of Wyoming Abstract. We show the following results for polynomial-time
More informationA Simple Left-to-Right Algorithm for Minimal Weight Signed Radix-r Representations
A Simple Left-to-Right Algorithm for Minimal Weight Signed Radix-r Representations James A. Muir School of Computer Science Carleton University, Ottawa, Canada http://www.scs.carleton.ca/ jamuir 23 October
More informationLecture 2: Learning from Evaluative Feedback. or Bandit Problems
Lecture 2: Learning from Evaluative Feedback or Bandit Problems 1 Edward L. Thorndike (1874-1949) Puzzle Box 2 Learning by Trial-and-Error Law of Effect: Of several responses to the same situation, those
More informationLow-Density Parity-Check Codes
Department of Computer Sciences Applied Algorithms Lab. July 24, 2011 Outline 1 Introduction 2 Algorithms for LDPC 3 Properties 4 Iterative Learning in Crowds 5 Algorithm 6 Results 7 Conclusion PART I
More informationPolitical Economy of Institutions and Development: Problem Set 1. Due Date: Thursday, February 23, in class.
Political Economy of Institutions and Development: 14.773 Problem Set 1 Due Date: Thursday, February 23, in class. Answer Questions 1-3. handed in. The other two questions are for practice and are not
More informationClock-driven scheduling
Clock-driven scheduling Also known as static or off-line scheduling Michal Sojka Czech Technical University in Prague, Faculty of Electrical Engineering, Department of Control Engineering November 8, 2017
More informationThe Greedy Method. Design and analysis of algorithms Cs The Greedy Method
Design and analysis of algorithms Cs 3400 The Greedy Method 1 Outline and Reading The Greedy Method Technique Fractional Knapsack Problem Task Scheduling 2 The Greedy Method Technique The greedy method
More informationPayment Rules for Combinatorial Auctions via Structural Support Vector Machines
Payment Rules for Combinatorial Auctions via Structural Support Vector Machines Felix Fischer Harvard University joint work with Paul Dütting (EPFL), Petch Jirapinyo (Harvard), John Lai (Harvard), Ben
More informationThe Firm-Growth Imperative: A Theory of Production and Personnel Management
The Firm-Growth Imperative: A Theory of Production and Personnel Management Rongzhu Ke Hong Kong Baptist University Jin Li London School of Economics Michael Powell Kellogg School of Management Management
More informationDistributed Optimization. Song Chong EE, KAIST
Distributed Optimization Song Chong EE, KAIST songchong@kaist.edu Dynamic Programming for Path Planning A path-planning problem consists of a weighted directed graph with a set of n nodes N, directed links
More informationEcon 201: Problem Set 3 Answers
Econ 20: Problem Set 3 Ansers Instructor: Alexandre Sollaci T.A.: Ryan Hughes Winter 208 Question a) The firm s fixed cost is F C = a and variable costs are T V Cq) = 2 bq2. b) As seen in class, the optimal
More informationLecture 7: Passive Learning
CS 880: Advanced Complexity Theory 2/8/2008 Lecture 7: Passive Learning Instructor: Dieter van Melkebeek Scribe: Tom Watson In the previous lectures, we studied harmonic analysis as a tool for analyzing
More informationTopic 17: Simple Hypotheses
Topic 17: November, 2011 1 Overview and Terminology Statistical hypothesis testing is designed to address the question: Do the data provide sufficient evidence to conclude that we must depart from our
More informationCDM. Recurrences and Fibonacci. 20-fibonacci 2017/12/15 23:16. Terminology 4. Recurrence Equations 3. Solution and Asymptotics 6.
CDM Recurrences and Fibonacci 1 Recurrence Equations Klaus Sutner Carnegie Mellon University Second Order 20-fibonacci 2017/12/15 23:16 The Fibonacci Monoid Recurrence Equations 3 Terminology 4 We can
More informationDistributed Systems Byzantine Agreement
Distributed Systems Byzantine Agreement He Sun School of Informatics University of Edinburgh Outline Finish EIG algorithm for Byzantine agreement. Number-of-processors lower bound for Byzantine agreement.
More informationTheory of Computation
Theory of Computation Lecture #6 Sarmad Abbasi Virtual University Sarmad Abbasi (Virtual University) Theory of Computation 1 / 39 Lecture 6: Overview Prove the equivalence of enumerators and TMs. Dovetailing
More informationEECS Components and Design Techniques for Digital Systems. FSMs 9/11/2007
EECS 150 - Components and Design Techniques for Digital Systems FSMs 9/11/2007 Sarah Bird Electrical Engineering and Computer Sciences University of California, Berkeley Slides borrowed from David Culler
More informationSection 6 Fault-Tolerant Consensus
Section 6 Fault-Tolerant Consensus CS586 - Panagiota Fatourou 1 Description of the Problem Consensus Each process starts with an individual input from a particular value set V. Processes may fail by crashing.
More informationCapacitors. Chapter How capacitors work Inside a capacitor
Chapter 6 Capacitors In every device we have studied so far sources, resistors, diodes and transistors the relationship between voltage and current depends only on the present, independent of the past.
More informationAge-structured model in subdiffusion
Age-structured model in subdiffusion T. LEPOUTRE thomas.lepoutre@inria.fr INRIA-Rhone Alpes (DRACULA) and ICJ (Univ. Lyon ) (StG: MESOPROBIO) Model u(t, x, a) : density of particles of age a R + at time
More informationTopic 3: Hypothesis Testing
CS 8850: Advanced Machine Learning Fall 07 Topic 3: Hypothesis Testing Instructor: Daniel L. Pimentel-Alarcón c Copyright 07 3. Introduction One of the simplest inference problems is that of deciding between
More informationAdministration. CSCI567 Machine Learning (Fall 2018) Outline. Outline. HW5 is available, due on 11/18. Practice final will also be available soon.
Administration CSCI567 Machine Learning Fall 2018 Prof. Haipeng Luo U of Southern California Nov 7, 2018 HW5 is available, due on 11/18. Practice final will also be available soon. Remaining weeks: 11/14,
More informationDifferential Analaysis of Block Ciphers SIMON and SPECK
1 / 36 Differential Analaysis of Block Ciphers SIMON and SPECK Alex Biryukov, Arnab Roy, Vesselin Velichkov 2 / 36 Outline Introduction Light-Weight Block Ciphers: SIMON and SPECK Differential Anlaysis
More informationTheory of Computation
Theory of Computation Dr. Sarmad Abbasi Dr. Sarmad Abbasi () Theory of Computation 1 / 33 Lecture 20: Overview Incompressible strings Minimal Length Descriptions Descriptive Complexity Dr. Sarmad Abbasi
More information4 Stability analysis of finite-difference methods for ODEs
MATH 337, by T. Lakoba, University of Vermont 36 4 Stability analysis of finite-difference methods for ODEs 4.1 Consistency, stability, and convergence of a numerical method; Main Theorem In this Lecture
More informationHandout: Competitive Equilibrium
1 Competitive equilibrium Handout: Competitive Equilibrium Definition 1. A competitive equilibrium is a set of endogenous variables (Ĉ, N s, N d, T, π, ŵ), such that given the exogenous variables (G, z,
More informationA Threshold of ln(n) for approximating set cover
A Threshold of ln(n) for approximating set cover October 20, 2009 1 The k-prover proof system There is a single verifier V and k provers P 1, P 2,..., P k. Binary code with k codewords, each of length
More informationSanta Claus Schedules Jobs on Unrelated Machines
Santa Claus Schedules Jobs on Unrelated Machines Ola Svensson (osven@kth.se) Royal Institute of Technology - KTH Stockholm, Sweden March 22, 2011 arxiv:1011.1168v2 [cs.ds] 21 Mar 2011 Abstract One of the
More informationName: Student number:
UNIVERSITY OF TORONTO Faculty of Arts and Science APRIL 2018 EXAMINATIONS CSC321H1S Duration 3 hours No Aids Allowed Name: Student number: This is a closed-book test. It is marked out of 35 marks. Please
More informationTopic 17. Analysis of Algorithms
Topic 17 Analysis of Algorithms Analysis of Algorithms- Review Efficiency of an algorithm can be measured in terms of : Time complexity: a measure of the amount of time required to execute an algorithm
More informationRepresentation of Geographic Data
GIS 5210 Week 2 The Nature of Spatial Variation Three principles of the nature of spatial variation: proximity effects are key to understanding spatial variation issues of geographic scale and level of
More informationSpace Complexity. The space complexity of a program is how much memory it uses.
Space Complexity The space complexity of a program is how much memory it uses. Measuring Space When we compute the space used by a TM, we do not count the input (think of input as readonly). We say that
More informationLabor Economics, Lecture 11: Partial Equilibrium Sequential Search
Labor Economics, 14.661. Lecture 11: Partial Equilibrium Sequential Search Daron Acemoglu MIT December 6, 2011. Daron Acemoglu (MIT) Sequential Search December 6, 2011. 1 / 43 Introduction Introduction
More informationIntermediate public economics 6 Public goods Hiroaki Sakamoto
Intermediate public economics 6 Public goods Hiroaki Sakamoto June 26, 2015 Contents 1. Definition and examples 2. Modeling public goods 2.1 Model 2.2 Efficient allocation and equilibrium 3. Lindahl mechanism
More informationOutline. CS21 Decidability and Tractability. Regular expressions and FA. Regular expressions and FA. Regular expressions and FA
Outline CS21 Decidability and Tractability Lecture 4 January 14, 2019 FA and Regular Exressions Non-regular languages: Puming Lemma Pushdown Automata Context-Free Grammars and Languages January 14, 2019
More informationDivision of Labour and Task Allocation
Division of Labour and Task Allocation Introduction Many species of insects have division of labour Task allocation at colony level linked to elasticity of individuals Model is based upon response thresholds
More informationStructural Change, Demographic Transition and Fertility Di erence
Structural Change, Demographic Transition and Fertility Di erence T. Terry Cheung February 14, 2017 T. Terry Cheung () Structural Change and Fertility February 14, 2017 1 / 35 Question Question: The force
More informationCS599: Algorithm Design in Strategic Settings Fall 2012 Lecture 12: Approximate Mechanism Design in Multi-Parameter Bayesian Settings
CS599: Algorithm Design in Strategic Settings Fall 2012 Lecture 12: Approximate Mechanism Design in Multi-Parameter Bayesian Settings Instructor: Shaddin Dughmi Administrivia HW1 graded, solutions on website
More informationForecasting Wind Ramps
Forecasting Wind Ramps Erin Summers and Anand Subramanian Jan 5, 20 Introduction The recent increase in the number of wind power producers has necessitated changes in the methods power system operators
More informationAdvice Coins for Classical and Quantum Computation
Advice Coins for Classical and Quantum Computation Andrew Drucker Joint work with Scott Aaronson July 4, 2011 Andrew Drucker Joint work with Scott Aaronson, Advice Coins for Classical and Quantum Computation
More informationUtility Maximizing Routing to Data Centers
0-0 Utility Maximizing Routing to Data Centers M. Sarwat, J. Shin and S. Kapoor (Presented by J. Shin) Sep 26, 2011 Sep 26, 2011 1 Outline 1. Problem Definition - Data Center Allocation 2. How to construct
More informationLecture 2 September 4, 2014
CS 224: Advanced Algorithms Fall 2014 Prof. Jelani Nelson Lecture 2 September 4, 2014 Scribe: David Liu 1 Overview In the last lecture we introduced the word RAM model and covered veb trees to solve the
More informationMATH 56A: STOCHASTIC PROCESSES CHAPTER 6
MATH 56A: STOCHASTIC PROCESSES CHAPTER 6 6. Renewal Mathematically, renewal refers to a continuous time stochastic process with states,, 2,. N t {,, 2, 3, } so that you only have jumps from x to x + and
More informationLINEAR PROGRAMMING: A GEOMETRIC APPROACH. Copyright Cengage Learning. All rights reserved.
3 LINEAR PROGRAMMING: A GEOMETRIC APPROACH Copyright Cengage Learning. All rights reserved. 3.4 Sensitivity Analysis Copyright Cengage Learning. All rights reserved. Sensitivity Analysis In this section,
More informationSubmitted by: Ashish Gupta Group 3
Evolutionary Algorithms CS 356N Analysis and Design of Algorithms Third Programming Assignment Submitted by: Ashish Gupta 98131 Group 3 Description This assignment is related to the Darwinian evolutionary
More informationComputer Intensive Methods in Mathematical Statistics
Computer Intensive Methods in Mathematical Statistics Department of mathematics KTH Royal Institute of Technology jimmyol@kth.se Lecture 2 Random number generation 27 March 2014 Computer Intensive Methods
More informationLayo Costs and E ciency with Asymmetric Information
Layo Costs and E ciency with Asymmetric Information Alain Delacroix (UQAM) and Etienne Wasmer (Sciences-Po) September 4, 2009 Abstract Wage determination under asymmetric information generates ine ciencies
More informationTwo optimization problems in a stochastic bandit model
Two optimization problems in a stochastic bandit model Emilie Kaufmann joint work with Olivier Cappé, Aurélien Garivier and Shivaram Kalyanakrishnan Journées MAS 204, Toulouse Outline From stochastic optimization
More informationImprovements to Core-Guided Binary Search for MaxSAT
Improvements to Core-Guided Binary Search for MaxSAT A.Morgado F.Heras J.Marques-Silva CASL/CSI, University College Dublin Dublin, Ireland SAT, June 2012 Outline Motivation Previous Algorithms - Overview
More informationSAMPLE. Read the information below and follow the instructions.
Sometimes errors can be made when using a calculator because of the nature of a question. Because a calculator is a machine, it doesn t always know what order to carry out functions, and so brackets must
More informationSTATE VARIABLE (SV) SYSTEMS
Copyright F.L. Lewis 999 All rights reserved Updated:Tuesday, August 05, 008 STATE VARIABLE (SV) SYSTEMS A natural description for dynamical systems is the nonlinear state-space or state variable (SV)
More informationScheduling periodic Tasks on Multiple Periodic Resources
Scheduling periodic Tasks on Multiple Periodic Resources Xiayu Hua, Zheng Li, Hao Wu, Shangping Ren* Department of Computer Science Illinois Institute of Technology Chicago, IL 60616, USA {xhua, zli80,
More informationA Simple Left-to-Right Algorithm for Minimal Weight Signed Radix-r Representations
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. XX, NO. X, MONTH 2007 1 A Simple Left-to-Right Algorithm for Minimal Weight Signed Radix-r Representations James A. Muir Abstract We present a simple algorithm
More informationAN EXTERNALITY BASED DECENTRALIZED OPTIMAL POWER ALLOCATION SCHEME FOR WIRELESS MESH NETWORKS
AN EXTERNALITY BASED DECENTRALIZED OPTIMAL POWER ALLOCATION SCHEME FOR WIRELESS MESH NETWORKS Shruti Sharma and Demos Teneketzis Department of Electrical Engineering and Computer Science University of
More informationChapter 2 The Pumping Lemma
Chapter 2 The Pumping Lemma Fourth Academic Year/ Elective Course-General Electrical Engineering Department College of Engineering University of Salahaddin April 2015 Nonregular Languages Consider the
More informationCC283 Intelligent Problem Solving 28/10/2013
Machine Learning What is the research agenda? How to measure success? How to learn? Machine Learning Overview Unsupervised Learning Supervised Learning Training Testing Unseen data Data Observed x 1 x
More informationA population of fish is modeled by the logistic equation modified to account for harvesting: 4
Partial solution key A population of fish is modeled by the logistic equation modified to account for harvesting: dddd dddd =.pp pp aa or equivalently dddd dddd = 6 pp + pp aa. What are the equilibrium
More informationVariable-Rate Universal Slepian-Wolf Coding with Feedback
Variable-Rate Universal Slepian-Wolf Coding with Feedback Shriram Sarvotham, Dror Baron, and Richard G. Baraniuk Dept. of Electrical and Computer Engineering Rice University, Houston, TX 77005 Abstract
More informationMechanism Design: Dominant Strategies
May 20, 2014 Some Motivation Previously we considered the problem of matching workers with firms We considered some different institutions for tackling the incentive problem arising from asymmetric information
More informationc 1 v 1 + c 2 v 2 = 0 c 1 λ 1 v 1 + c 2 λ 1 v 2 = 0
LECTURE LECTURE 2 0. Distinct eigenvalues I haven t gotten around to stating the following important theorem: Theorem: A matrix with n distinct eigenvalues is diagonalizable. Proof (Sketch) Suppose n =
More information6196 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 57, NO. 9, SEPTEMBER 2011
6196 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 57, NO. 9, SEPTEMBER 2011 On the Structure of Real-Time Encoding and Decoding Functions in a Multiterminal Communication System Ashutosh Nayyar, Student
More informationFault-Tolerant Consensus
Fault-Tolerant Consensus CS556 - Panagiota Fatourou 1 Assumptions Consensus Denote by f the maximum number of processes that may fail. We call the system f-resilient Description of the Problem Each process
More informationShared resources. Sistemi in tempo reale. Giuseppe Lipari. Scuola Superiore Sant Anna Pisa -Italy
istemi in tempo reale hared resources Giuseppe Lipari cuola uperiore ant Anna Pisa -Italy inher.tex istemi in tempo reale Giuseppe Lipari 7/6/2005 12:35 p. 1/21 Interacting tasks Until now, we have considered
More informationBranching. Teppo Niinimäki. Helsinki October 14, 2011 Seminar: Exact Exponential Algorithms UNIVERSITY OF HELSINKI Department of Computer Science
Branching Teppo Niinimäki Helsinki October 14, 2011 Seminar: Exact Exponential Algorithms UNIVERSITY OF HELSINKI Department of Computer Science 1 For a large number of important computational problems
More information