Bucket brigades - an example of self-organized production. April 20, 2016

Size: px
Start display at page:

Download "Bucket brigades - an example of self-organized production. April 20, 2016"

Transcription

1 Bucket brigades - an example of self-organized production. April 20, 2016

2 Bucket Brigade Definition A bucket brigade is a flexible worker system defined by rules that determine what each worker does next: Each worker processes his item until he is bumped by a downstream worker, after which he walks back and takes over a job from an upstream worker. Industry examples: Apparel industry Order picking (Amazon)

3 Setup Key assumptions 1 Work content varies continuously along the production line 2 Handover is possible at any position 3 Workers walk back with infinite speed 4 Processing times are deterministic, variation in processing times are due to different worker velocities 5 There is a fixed and well defined ranking of the worker speed. The ranking is constant along the production line.

4 Time evolution of the bucket brigade: Dynamics I Let x m (t) be the position of the worker m at time t and c m his velocity. Assuming no blocking from a downstream worker we have the time evolution of position: x 1 (t) = c 1 t x 2 (t) = c 2 t + x x N (t) = c N t + x N 0 The time to finish the next product is given by x N ( t) = 1. Hence t = 1 x N 0 c N.

5 Dynamics II Poincaré map: P: Σ = {(x 1 ( t), x 2 ( t)...x N 1 ( t), 1)} Σ x 1 n+1 = c 1 c N (1 x N 1 n ) xn+1 2 = c 2 (1 xn N 1 ) + xn 1 c N... xn+1 N 1 = c N 1 (1 xn N 1 ) + xn 1 c N

6 Fixed point Theorem: The Poincaré map has a unique fixed point. Proof: P is an affine map with the linear part A = c 1 c N c 2 c N c N 1 c N det(a Id) is nonzero.

7 Theorem: If workers are ordered along the production line with increasing speed, i.e. c 1 < c 2...c N then the fixed point is globally stable. Proof: Bartholdi and Eisenstein, 1996, For c 1 < c 2...c N blocking is impossible Dynamics is strictly linear with above Poincaré map. Define a j = xj+1 x j c j. Then the Poincaré map becomes a n+1 = T a n Stabiliity I with T = c 0 c c 0 c c N 1 c N 1 c N 1 c N

8 Stabiliity II Proof continued Notice that T is a stochastic matrix with positive entries and whose rows sum to 1. Hence by the following theorems from Markov chains we have asymptotic stability: Theorem: a) The eigenvalues of a stochastic matrix must have modulus less than or equal to 1. b) There is a unique stationary distribution corresponding to eigenvector of T with simple eigenvalue 1.

9 Extensions to inhomogeneous systems. Spatial inhomogeneity Worker skills vary along the production line i.e. no uniform speed ordering. No theory for arbitrary number of workers. Consider two workers, A and B. Scale time and work content such that c B = 1, let worker B start the production line, and { v1 (ξ) for ξ < X c A = v 2 (ξ) for ξ > X with v 1 < 1 < v 2 or v 1 > 1 > v 2.

10 Inhomogeneous systems I Spatial inhomogeneity Case study: v 1, v 2 constant and v 1 < 1 < v 2 q B (t) = t q A (t) = q 0 + v 2 t for q 0 > X q 0 + v 1 t for q 0 < X and t < t x x + v 2 (t t X ) for q 0 < X and t > t X Reset map: Position of worker B when worker A has finished: q n+1 = f (q n ) = { 1 q n v 2 for q n > X X ( 1 v 1 1 v 2 ) qn v v 2 for q n X Most important parameter: f (0) = X v X v 2 and v A = 1/f (0).

11 All possible dynamics for v 1 < 1 when passing is allowed. 1 Examples I x Figure 1: X x, v A > 1: globally stable fixed point x Figure 2: X > x, v A > 1: unstable fixed point, stable period-two orbit

12 Examples II x Figure 3: X x, v A 1: locally stable fixed point, unstable period-two orbit x Figure 4: X > x, v A 1: globally unstable fixed point, reversal of workers

13 General Theory I Lemma 1 There exists a unique fixed point that balances the bucket brigade for all values of v 1 and v 2. Lemma 2 Consider the parameter space (v 1, v 2, X ). The manifold X = 1 1+v 2 separates stable from unstable fixed points. Theorem 1 The two curves f (0) = 1 and X = 1/(1 + v 2 ) determine the average velocity of the second worker and the stability of the fixed point. They intersect in parameter space (v 2, X ) and generate four regions with different dynamical behavior. The resulting dynamics are the ones shown in the figures 1-4

14 General Theory II Theorem 2 All previous theorems are still valid if the velocity of worker A is not piecewise constant but depends on its exact location along the production line as long as there is only one point at which the relative order of the worker s velocities changes. Lemma 3 The throughput for a period-two orbit is always less than the throughput of the fixed point. Lemma 4 Reversing the worker order for a given set of velocities and a given break point interchanges the dynamics between Figure 1 and 4, and between Figure 2 and 3.

15 Conclusion Consequence We may have to choose between self-balancing (e.g. to a limit cycle) and optimal throughput associated with an (unstable) fixed point.

16 Temporal inhomogeneity: Bucket Brigades and Learning Problem Statement One of the basic assumptions of BB: worker speeds are constant in time (though possibly stochastic) Not true in many situations that involve learning and/or forgetting: High turnover production lines - most workers are still on a learning curve Loss and replacement of one experienced worker in an established BB. BB with special skills sections that need constant reinforcement Common to all situations: Learning leeds to nonautonomous dynamical systems

17 Adding a novice to a balanced production line Key assumptions as in standard BB Additionally: n workers arranged from slowest to fastest: c 1 < c 2 <... < c n. one new worker will be added at arbitrary places in the worker ordering. Switching/Passing policy: Workers can pass each other. Handovers will always be done to the nearest worker upstream. Equivalently: Whenever a worker gets blocked he/she will interchange position with the blocking worker.

18 Setup Learning I Starting velocity for new worker: v l < c i i, constant. Potential maximal velocity for new worker: v h. Worker learns only on those parts of the production line where he/she has worked. Learning Rule Wright s model v n = v l tn m t n = Σ n i=0t i The t i are the times between successive finishes of the BB. Towell & Bevis model: v n = v l + (v h v l )(1 e tn/τ ) t n = Σ n i=0t i

19 Learning II Note Wright s model in priciple will allow for unlimited growth but finite resolution will lead to a limiting velocity v h. Production line partitioned into segments of length 0.05.

20 Learning III Examples: final new worker speed profile τ = 0.7, 4 workers + one new worker Starting speed distribution: (c 1, c 2, c 3, c 4 ) = (1.3, 1.6, 2.0, 2.3) Starting speed for new worker v l = 1 Limiting speed for new worker v h = 1.8 Plot of Worker Speeds (1) 2.5 Worker 1 Worker 2 Worker 3 Worker 4 Worker 5 2 Speed Location Figure 1: new worker starts in position 1

21 Examples II Plot of Worker Speeds (2) 2.5 Worker 1 Worker 2 Worker 3 Worker 4 Worker 5 2 Speed Location Figure 2: new worker starts in position 2 Plot of Worker Speeds (3) 2.5 Worker 1 Worker 2 Worker 3 Worker 4 Worker 5 2 Speed Location Figure 3: new worker starts in position 3

22 Examples III Plot of Worker Speeds (4) 2.5 Worker 1 Worker 2 Worker 3 Worker 4 Worker 5 2 Speed Location Figure 4: new worker starts in position 4 Plot of Worker Speeds (5) 2.5 Worker 1 Worker 2 Worker 3 Worker 4 Worker 5 2 Speed Location Figure 5: new worker starts in position 5

23 Result of simulations System stabilizes with new worker in position 1, 2, 3, and 4. Eventual throughput is the same for all worker orders.

24 Analysis I Theorem: The bucket brigade will self organize to the same throughput, independent of initial conditions (initial worker ordering).

25 Analysis II Proof Learning and switching always leeds to an interval of maximal speed I max (obvious) Boundaries of I max are the handover points for the new worker, corresponding to a fixed point of the BB. No periodic orbit inside I max since the motion of the new worker inside I max is completely linear. balanced BB implies that throughput before, after and on I max are equal: v h X Y = Σc i X = Σc j Y

26 Analysis III Proof continued This leads to X = Y = Σc i Σc i + Σc j + v h Σc i + v h Σc i + Σc j + v h which leads to an overall throughput of TP = Σc i + Σc j + v h independent of the position of the new worker.

27 Stability Self Organization of the BB Consider a velocity distribution for the new worker: v l 0 < x < X v(x) = v h X < x < Y v l Y < x < 1 Approximation: Replace the m workers before the new worker and the k workers after the new worker by one worker each with a mean velocity v 1 = Σm i=1 c i m v 2 = Σk j=1 c j k

28 Stability II 2-d Maps Analyze a three worker system that has a fixed point at the starting points. (x 1, x new, x 2 ) = (0, X, Y ). Resulting 2-d map is piecewise linear with four different regions all meeting at the fixed point. Stability of this point is extremely difficult. However: Finite partition into learning region implies X < x new < x 2 < Y.

29 Stability III Implications: for a stability analysis, the new worker always moves with speed v h. Analyze stability of the fixed point of a 3 worker BB with homogeneous velocities v 1, v h, v 2. Necessary and sufficient for stability of the three worker BB is that v 2 > v 1 v 2 > v h v 1

30 Stability IV v Stability region for a 3 worker system v Notice v h might be higher than v 2. Case v) in Example shows v 1 = 1.8, v h = 1.8. Since v new only assymptotically reaches v h we get instability. For stable v h we numerically find that very few transients lead to order changes. For unstable v h order changes are generated and typically lead to a final order from slowest to fastest.

31 1 Plot of Takeovers Chaotic transients Location Time Chaotic transients when worker is placed at unstable position: Transition of new worker from position 3 to position 4.

32 Conclusions Study add a new worker to a stable bucket brigade - new worker learns. Results: BB are very robust and typically adjust to self organized optimal behavior. Positioning of the new worker is irrelevant if BB has a switching rule.

33 Open questions Extend spatial inhomogeneity to n - workers Open questions: Is chaos possible what is the period of the typical orbit for a 3 worker chain? period 3 or period it seems that ordering according to average velocity will lead to locally stable solutions (fixed points or periodic orbits). Is that true for n- workers too? are there practically useful rules for placing workers in an inhomogeneous production line?

Some Generalizations of Bucket Brigade Assembly Lines

Some Generalizations of Bucket Brigade Assembly Lines Some Generalizations of Bucket Brigade Assembly Lines A Thesis Presented to The Academic Faculty by Yun Fong Lim In Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy in Industrial

More information

Modified work rule for Y-shaped self-balancing line with walk-back and travel time

Modified work rule for Y-shaped self-balancing line with walk-back and travel time Modified work rule for Y-shaped self-balancing line with walk-back and travel time Daisuke Hirotani Faculty of Management and Information Systems Prefectural University of Hiroshima, Hiroshima, Japan Tel:

More information

Markov Chains, Random Walks on Graphs, and the Laplacian

Markov Chains, Random Walks on Graphs, and the Laplacian Markov Chains, Random Walks on Graphs, and the Laplacian CMPSCI 791BB: Advanced ML Sridhar Mahadevan Random Walks! There is significant interest in the problem of random walks! Markov chain analysis! Computer

More information

Finite-Horizon Statistics for Markov chains

Finite-Horizon Statistics for Markov chains Analyzing FSDT Markov chains Friday, September 30, 2011 2:03 PM Simulating FSDT Markov chains, as we have said is very straightforward, either by using probability transition matrix or stochastic update

More information

Markov Chains and Stochastic Sampling

Markov Chains and Stochastic Sampling Part I Markov Chains and Stochastic Sampling 1 Markov Chains and Random Walks on Graphs 1.1 Structure of Finite Markov Chains We shall only consider Markov chains with a finite, but usually very large,

More information

Note that in the example in Lecture 1, the state Home is recurrent (and even absorbing), but all other states are transient. f ii (n) f ii = n=1 < +

Note that in the example in Lecture 1, the state Home is recurrent (and even absorbing), but all other states are transient. f ii (n) f ii = n=1 < + Random Walks: WEEK 2 Recurrence and transience Consider the event {X n = i for some n > 0} by which we mean {X = i}or{x 2 = i,x i}or{x 3 = i,x 2 i,x i},. Definition.. A state i S is recurrent if P(X n

More information

Stability of the two queue system

Stability of the two queue system Stability of the two queue system Iain M. MacPhee and Lisa J. Müller University of Durham Department of Mathematical Science Durham, DH1 3LE, UK (e-mail: i.m.macphee@durham.ac.uk, l.j.muller@durham.ac.uk)

More information

, some directions, namely, the directions of the 1. and

, some directions, namely, the directions of the 1. and 11. Eigenvalues and eigenvectors We have seen in the last chapter: for the centroaffine mapping, some directions, namely, the directions of the 1 coordinate axes: and 0 0, are distinguished 1 among all

More information

Dynamical Systems and Chaos Part I: Theoretical Techniques. Lecture 4: Discrete systems + Chaos. Ilya Potapov Mathematics Department, TUT Room TD325

Dynamical Systems and Chaos Part I: Theoretical Techniques. Lecture 4: Discrete systems + Chaos. Ilya Potapov Mathematics Department, TUT Room TD325 Dynamical Systems and Chaos Part I: Theoretical Techniques Lecture 4: Discrete systems + Chaos Ilya Potapov Mathematics Department, TUT Room TD325 Discrete maps x n+1 = f(x n ) Discrete time steps. x 0

More information

18.175: Lecture 30 Markov chains

18.175: Lecture 30 Markov chains 18.175: Lecture 30 Markov chains Scott Sheffield MIT Outline Review what you know about finite state Markov chains Finite state ergodicity and stationarity More general setup Outline Review what you know

More information

1 Stochastic Dynamic Programming

1 Stochastic Dynamic Programming 1 Stochastic Dynamic Programming Formally, a stochastic dynamic program has the same components as a deterministic one; the only modification is to the state transition equation. When events in the future

More information

Summary: A Random Walks View of Spectral Segmentation, by Marina Meila (University of Washington) and Jianbo Shi (Carnegie Mellon University)

Summary: A Random Walks View of Spectral Segmentation, by Marina Meila (University of Washington) and Jianbo Shi (Carnegie Mellon University) Summary: A Random Walks View of Spectral Segmentation, by Marina Meila (University of Washington) and Jianbo Shi (Carnegie Mellon University) The authors explain how the NCut algorithm for graph bisection

More information

µ n 1 (v )z n P (v, )

µ n 1 (v )z n P (v, ) Plan More Examples (Countable-state case). Questions 1. Extended Examples 2. Ideas and Results Next Time: General-state Markov Chains Homework 4 typo Unless otherwise noted, let X be an irreducible, aperiodic

More information

http://www.math.uah.edu/stat/markov/.xhtml 1 of 9 7/16/2009 7:20 AM Virtual Laboratories > 16. Markov Chains > 1 2 3 4 5 6 7 8 9 10 11 12 1. A Markov process is a random process in which the future is

More information

Markov Chains. As part of Interdisciplinary Mathematical Modeling, By Warren Weckesser Copyright c 2006.

Markov Chains. As part of Interdisciplinary Mathematical Modeling, By Warren Weckesser Copyright c 2006. Markov Chains As part of Interdisciplinary Mathematical Modeling, By Warren Weckesser Copyright c 2006 1 Introduction A (finite) Markov chain is a process with a finite number of states (or outcomes, or

More information

Reinforcement Learning

Reinforcement Learning Reinforcement Learning March May, 2013 Schedule Update Introduction 03/13/2015 (10:15-12:15) Sala conferenze MDPs 03/18/2015 (10:15-12:15) Sala conferenze Solving MDPs 03/20/2015 (10:15-12:15) Aula Alpha

More information

STOCHASTIC PROCESSES Basic notions

STOCHASTIC PROCESSES Basic notions J. Virtamo 38.3143 Queueing Theory / Stochastic processes 1 STOCHASTIC PROCESSES Basic notions Often the systems we consider evolve in time and we are interested in their dynamic behaviour, usually involving

More information

4.1 Markov Processes and Markov Chains

4.1 Markov Processes and Markov Chains Chapter Markov Processes. Markov Processes and Markov Chains Recall the following example from Section.. Two competing Broadband companies, A and B, each currently have 0% of the market share. Suppose

More information

MDP Preliminaries. Nan Jiang. February 10, 2019

MDP Preliminaries. Nan Jiang. February 10, 2019 MDP Preliminaries Nan Jiang February 10, 2019 1 Markov Decision Processes In reinforcement learning, the interactions between the agent and the environment are often described by a Markov Decision Process

More information

Math 1553, Introduction to Linear Algebra

Math 1553, Introduction to Linear Algebra Learning goals articulate what students are expected to be able to do in a course that can be measured. This course has course-level learning goals that pertain to the entire course, and section-level

More information

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 1 x 2. x n 8 (4) 3 4 2

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 1 x 2. x n 8 (4) 3 4 2 MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS SYSTEMS OF EQUATIONS AND MATRICES Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a

More information

Data Mining and Analysis: Fundamental Concepts and Algorithms

Data Mining and Analysis: Fundamental Concepts and Algorithms : Fundamental Concepts and Algorithms dataminingbook.info Mohammed J. Zaki 1 Wagner Meira Jr. 2 1 Department of Computer Science Rensselaer Polytechnic Institute, Troy, NY, USA 2 Department of Computer

More information

TMA Calculus 3. Lecture 21, April 3. Toke Meier Carlsen Norwegian University of Science and Technology Spring 2013

TMA Calculus 3. Lecture 21, April 3. Toke Meier Carlsen Norwegian University of Science and Technology Spring 2013 TMA4115 - Calculus 3 Lecture 21, April 3 Toke Meier Carlsen Norwegian University of Science and Technology Spring 2013 www.ntnu.no TMA4115 - Calculus 3, Lecture 21 Review of last week s lecture Last week

More information

The Decomposability Problem for Torsion-Free Abelian Groups is Analytic-Complete

The Decomposability Problem for Torsion-Free Abelian Groups is Analytic-Complete The Decomposability Problem for Torsion-Free Abelian Groups is Analytic-Complete Kyle Riggs Indiana University April 29, 2014 Kyle Riggs Decomposability Problem 1/ 22 Computable Groups background A group

More information

Stochastic processes. MAS275 Probability Modelling. Introduction and Markov chains. Continuous time. Markov property

Stochastic processes. MAS275 Probability Modelling. Introduction and Markov chains. Continuous time. Markov property Chapter 1: and Markov chains Stochastic processes We study stochastic processes, which are families of random variables describing the evolution of a quantity with time. In some situations, we can treat

More information

Matrices and RRE Form

Matrices and RRE Form Matrices and RRE Form Notation R is the real numbers, C is the complex numbers (we will only consider complex numbers towards the end of the course) is read as an element of For instance, x R means that

More information

Robotics. Control Theory. Marc Toussaint U Stuttgart

Robotics. Control Theory. Marc Toussaint U Stuttgart Robotics Control Theory Topics in control theory, optimal control, HJB equation, infinite horizon case, Linear-Quadratic optimal control, Riccati equations (differential, algebraic, discrete-time), controllability,

More information

Information Theory. Lecture 5 Entropy rate and Markov sources STEFAN HÖST

Information Theory. Lecture 5 Entropy rate and Markov sources STEFAN HÖST Information Theory Lecture 5 Entropy rate and Markov sources STEFAN HÖST Universal Source Coding Huffman coding is optimal, what is the problem? In the previous coding schemes (Huffman and Shannon-Fano)it

More information

dynamical zeta functions: what, why and what are the good for?

dynamical zeta functions: what, why and what are the good for? dynamical zeta functions: what, why and what are the good for? Predrag Cvitanović Georgia Institute of Technology November 2 2011 life is intractable in physics, no problem is tractable I accept chaos

More information

Chapter 5. Linear Algebra. Sections A linear (algebraic) equation in. unknowns, x 1, x 2,..., x n, is. an equation of the form

Chapter 5. Linear Algebra. Sections A linear (algebraic) equation in. unknowns, x 1, x 2,..., x n, is. an equation of the form Chapter 5. Linear Algebra Sections 5.1 5.3 A linear (algebraic) equation in n unknowns, x 1, x 2,..., x n, is an equation of the form a 1 x 1 + a 2 x 2 + + a n x n = b where a 1, a 2,..., a n and b are

More information

Chaotic Behavior in a Deterministic Model of Manufacturing

Chaotic Behavior in a Deterministic Model of Manufacturing Chaotic Behavior in a Deterministic Model of Manufacturing The Supply Chain & Logistics Institute School of Industrial and Systems Engineering Georgia Institute of Technology Atlanta, GA 30332-0205 USA

More information

Review of Linear Algebra

Review of Linear Algebra Review of Linear Algebra Definitions An m n (read "m by n") matrix, is a rectangular array of entries, where m is the number of rows and n the number of columns. 2 Definitions (Con t) A is square if m=

More information

Chapter 5. Linear Algebra. A linear (algebraic) equation in. unknowns, x 1, x 2,..., x n, is. an equation of the form

Chapter 5. Linear Algebra. A linear (algebraic) equation in. unknowns, x 1, x 2,..., x n, is. an equation of the form Chapter 5. Linear Algebra A linear (algebraic) equation in n unknowns, x 1, x 2,..., x n, is an equation of the form a 1 x 1 + a 2 x 2 + + a n x n = b where a 1, a 2,..., a n and b are real numbers. 1

More information

Markov Chains Handout for Stat 110

Markov Chains Handout for Stat 110 Markov Chains Handout for Stat 0 Prof. Joe Blitzstein (Harvard Statistics Department) Introduction Markov chains were first introduced in 906 by Andrey Markov, with the goal of showing that the Law of

More information

Stochastic Processes (Week 6)

Stochastic Processes (Week 6) Stochastic Processes (Week 6) October 30th, 2014 1 Discrete-time Finite Markov Chains 2 Countable Markov Chains 3 Continuous-Time Markov Chains 3.1 Poisson Process 3.2 Finite State Space 3.2.1 Kolmogrov

More information

Solving Homogeneous Systems with Sub-matrices

Solving Homogeneous Systems with Sub-matrices Pure Mathematical Sciences, Vol 7, 218, no 1, 11-18 HIKARI Ltd, wwwm-hikaricom https://doiorg/112988/pms218843 Solving Homogeneous Systems with Sub-matrices Massoud Malek Mathematics, California State

More information

Definition 2.3. We define addition and multiplication of matrices as follows.

Definition 2.3. We define addition and multiplication of matrices as follows. 14 Chapter 2 Matrices In this chapter, we review matrix algebra from Linear Algebra I, consider row and column operations on matrices, and define the rank of a matrix. Along the way prove that the row

More information

Final Review Sheet. B = (1, 1 + 3x, 1 + x 2 ) then 2 + 3x + 6x 2

Final Review Sheet. B = (1, 1 + 3x, 1 + x 2 ) then 2 + 3x + 6x 2 Final Review Sheet The final will cover Sections Chapters 1,2,3 and 4, as well as sections 5.1-5.4, 6.1-6.2 and 7.1-7.3 from chapters 5,6 and 7. This is essentially all material covered this term. Watch

More information

Lecture 5: Random Walks and Markov Chain

Lecture 5: Random Walks and Markov Chain Spectral Graph Theory and Applications WS 20/202 Lecture 5: Random Walks and Markov Chain Lecturer: Thomas Sauerwald & He Sun Introduction to Markov Chains Definition 5.. A sequence of random variables

More information

Hybrid Control and Switched Systems. Lecture #11 Stability of switched system: Arbitrary switching

Hybrid Control and Switched Systems. Lecture #11 Stability of switched system: Arbitrary switching Hybrid Control and Switched Systems Lecture #11 Stability of switched system: Arbitrary switching João P. Hespanha University of California at Santa Barbara Stability under arbitrary switching Instability

More information

Lecture 5. If we interpret the index n 0 as time, then a Markov chain simply requires that the future depends only on the present and not on the past.

Lecture 5. If we interpret the index n 0 as time, then a Markov chain simply requires that the future depends only on the present and not on the past. 1 Markov chain: definition Lecture 5 Definition 1.1 Markov chain] A sequence of random variables (X n ) n 0 taking values in a measurable state space (S, S) is called a (discrete time) Markov chain, if

More information

Manufacturing System Flow Analysis

Manufacturing System Flow Analysis Manufacturing System Flow Analysis Ronald G. Askin Systems & Industrial Engineering The University of Arizona Tucson, AZ 85721 ron@sie.arizona.edu October 12, 2005 How Many IEs Does It Take to Change a

More information

Linear Algebra 1 Exam 1 Solutions 6/12/3

Linear Algebra 1 Exam 1 Solutions 6/12/3 Linear Algebra 1 Exam 1 Solutions 6/12/3 Question 1 Consider the linear system in the variables (x, y, z, t, u), given by the following matrix, in echelon form: 1 2 1 3 1 2 0 1 1 3 1 4 0 0 0 1 2 3 Reduce

More information

Controlling Chaos in a State-Dependent Nonlinear System

Controlling Chaos in a State-Dependent Nonlinear System Electronic version of an article published as International Journal of Bifurcation and Chaos Vol. 12, No. 5, 2002, 1111-1119, DOI: 10.1142/S0218127402004942 World Scientific Publishing Company, https://www.worldscientific.com/worldscinet/ijbc

More information

Lecture: Local Spectral Methods (1 of 4)

Lecture: Local Spectral Methods (1 of 4) Stat260/CS294: Spectral Graph Methods Lecture 18-03/31/2015 Lecture: Local Spectral Methods (1 of 4) Lecturer: Michael Mahoney Scribe: Michael Mahoney Warning: these notes are still very rough. They provide

More information

Global Analysis of Piecewise Linear Systems Using Impact Maps and Surface Lyapunov Functions

Global Analysis of Piecewise Linear Systems Using Impact Maps and Surface Lyapunov Functions IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL 48, NO 12, DECEMBER 2003 2089 Global Analysis of Piecewise Linear Systems Using Impact Maps and Surface Lyapunov Functions Jorge M Gonçalves, Alexandre Megretski,

More information

Chapter 5. Linear Algebra. Sections A linear (algebraic) equation in. unknowns, x 1, x 2,..., x n, is. an equation of the form

Chapter 5. Linear Algebra. Sections A linear (algebraic) equation in. unknowns, x 1, x 2,..., x n, is. an equation of the form Chapter 5. Linear Algebra Sections 5.1 5.3 A linear (algebraic) equation in n unknowns, x 1, x 2,..., x n, is an equation of the form a 1 x 1 + a 2 x 2 + + a n x n = b where a 1, a 2,..., a n and b are

More information

1. Let m 1 and n 1 be two natural numbers such that m > n. Which of the following is/are true?

1. Let m 1 and n 1 be two natural numbers such that m > n. Which of the following is/are true? . Let m and n be two natural numbers such that m > n. Which of the following is/are true? (i) A linear system of m equations in n variables is always consistent. (ii) A linear system of n equations in

More information

The Transition Probability Function P ij (t)

The Transition Probability Function P ij (t) The Transition Probability Function P ij (t) Consider a continuous time Markov chain {X(t), t 0}. We are interested in the probability that in t time units the process will be in state j, given that it

More information

2. Every linear system with the same number of equations as unknowns has a unique solution.

2. Every linear system with the same number of equations as unknowns has a unique solution. 1. For matrices A, B, C, A + B = A + C if and only if A = B. 2. Every linear system with the same number of equations as unknowns has a unique solution. 3. Every linear system with the same number of equations

More information

Lab 8: Measuring Graph Centrality - PageRank. Monday, November 5 CompSci 531, Fall 2018

Lab 8: Measuring Graph Centrality - PageRank. Monday, November 5 CompSci 531, Fall 2018 Lab 8: Measuring Graph Centrality - PageRank Monday, November 5 CompSci 531, Fall 2018 Outline Measuring Graph Centrality: Motivation Random Walks, Markov Chains, and Stationarity Distributions Google

More information

7 Planar systems of linear ODE

7 Planar systems of linear ODE 7 Planar systems of linear ODE Here I restrict my attention to a very special class of autonomous ODE: linear ODE with constant coefficients This is arguably the only class of ODE for which explicit solution

More information

An Introduction to Entropy and Subshifts of. Finite Type

An Introduction to Entropy and Subshifts of. Finite Type An Introduction to Entropy and Subshifts of Finite Type Abby Pekoske Department of Mathematics Oregon State University pekoskea@math.oregonstate.edu August 4, 2015 Abstract This work gives an overview

More information

Paul Schrimpf. September 10, 2013

Paul Schrimpf. September 10, 2013 Systems of UBC Economics 526 September 10, 2013 More cardinality Let A and B be sets, the Cartesion product of A and B is A B := {(a, b) : a A, b B} Question If A and B are countable is A B countable?

More information

Markov Chains, Stochastic Processes, and Matrix Decompositions

Markov Chains, Stochastic Processes, and Matrix Decompositions Markov Chains, Stochastic Processes, and Matrix Decompositions 5 May 2014 Outline 1 Markov Chains Outline 1 Markov Chains 2 Introduction Perron-Frobenius Matrix Decompositions and Markov Chains Spectral

More information

MATH 564/STAT 555 Applied Stochastic Processes Homework 2, September 18, 2015 Due September 30, 2015

MATH 564/STAT 555 Applied Stochastic Processes Homework 2, September 18, 2015 Due September 30, 2015 ID NAME SCORE MATH 56/STAT 555 Applied Stochastic Processes Homework 2, September 8, 205 Due September 30, 205 The generating function of a sequence a n n 0 is defined as As : a ns n for all s 0 for which

More information

LINEAR ALGEBRA KNOWLEDGE SURVEY

LINEAR ALGEBRA KNOWLEDGE SURVEY LINEAR ALGEBRA KNOWLEDGE SURVEY Instructions: This is a Knowledge Survey. For this assignment, I am only interested in your level of confidence about your ability to do the tasks on the following pages.

More information

18.06 Problem Set 8 - Solutions Due Wednesday, 14 November 2007 at 4 pm in

18.06 Problem Set 8 - Solutions Due Wednesday, 14 November 2007 at 4 pm in 806 Problem Set 8 - Solutions Due Wednesday, 4 November 2007 at 4 pm in 2-06 08 03 Problem : 205+5+5+5 Consider the matrix A 02 07 a Check that A is a positive Markov matrix, and find its steady state

More information

SVD, Power method, and Planted Graph problems (+ eigenvalues of random matrices)

SVD, Power method, and Planted Graph problems (+ eigenvalues of random matrices) Chapter 14 SVD, Power method, and Planted Graph problems (+ eigenvalues of random matrices) Today we continue the topic of low-dimensional approximation to datasets and matrices. Last time we saw the singular

More information

Stochastic modelling of epidemic spread

Stochastic modelling of epidemic spread Stochastic modelling of epidemic spread Julien Arino Centre for Research on Inner City Health St Michael s Hospital Toronto On leave from Department of Mathematics University of Manitoba Julien Arino@umanitoba.ca

More information

Chapter III. Stability of Linear Systems

Chapter III. Stability of Linear Systems 1 Chapter III Stability of Linear Systems 1. Stability and state transition matrix 2. Time-varying (non-autonomous) systems 3. Time-invariant systems 1 STABILITY AND STATE TRANSITION MATRIX 2 In this chapter,

More information

Chapter 3 - Temporal processes

Chapter 3 - Temporal processes STK4150 - Intro 1 Chapter 3 - Temporal processes Odd Kolbjørnsen and Geir Storvik January 23 2017 STK4150 - Intro 2 Temporal processes Data collected over time Past, present, future, change Temporal aspect

More information

Chapter 5. Linear Algebra. A linear (algebraic) equation in. unknowns, x 1, x 2,..., x n, is. an equation of the form

Chapter 5. Linear Algebra. A linear (algebraic) equation in. unknowns, x 1, x 2,..., x n, is. an equation of the form Chapter 5. Linear Algebra A linear (algebraic) equation in n unknowns, x 1, x 2,..., x n, is an equation of the form a 1 x 1 + a 2 x 2 + + a n x n = b where a 1, a 2,..., a n and b are real numbers. 1

More information

Lecture 7. We can regard (p(i, j)) as defining a (maybe infinite) matrix P. Then a basic fact is

Lecture 7. We can regard (p(i, j)) as defining a (maybe infinite) matrix P. Then a basic fact is MARKOV CHAINS What I will talk about in class is pretty close to Durrett Chapter 5 sections 1-5. We stick to the countable state case, except where otherwise mentioned. Lecture 7. We can regard (p(i, j))

More information

Lecture Summaries for Linear Algebra M51A

Lecture Summaries for Linear Algebra M51A These lecture summaries may also be viewed online by clicking the L icon at the top right of any lecture screen. Lecture Summaries for Linear Algebra M51A refers to the section in the textbook. Lecture

More information

Symbolic dynamics and chaos in plane Couette flow

Symbolic dynamics and chaos in plane Couette flow Dynamics of PDE, Vol.14, No.1, 79-85, 2017 Symbolic dynamics and chaos in plane Couette flow Y. Charles Li Communicated by Y. Charles Li, received December 25, 2016. Abstract. According to a recent theory

More information

LECTURE NOTES: Discrete time Markov Chains (2/24/03; SG)

LECTURE NOTES: Discrete time Markov Chains (2/24/03; SG) LECTURE NOTES: Discrete time Markov Chains (2/24/03; SG) A discrete time Markov Chains is a stochastic dynamical system in which the probability of arriving in a particular state at a particular time moment

More information

MTH Linear Algebra. Study Guide. Dr. Tony Yee Department of Mathematics and Information Technology The Hong Kong Institute of Education

MTH Linear Algebra. Study Guide. Dr. Tony Yee Department of Mathematics and Information Technology The Hong Kong Institute of Education MTH 3 Linear Algebra Study Guide Dr. Tony Yee Department of Mathematics and Information Technology The Hong Kong Institute of Education June 3, ii Contents Table of Contents iii Matrix Algebra. Real Life

More information

Lecture 9 Classification of States

Lecture 9 Classification of States Lecture 9: Classification of States of 27 Course: M32K Intro to Stochastic Processes Term: Fall 204 Instructor: Gordan Zitkovic Lecture 9 Classification of States There will be a lot of definitions and

More information

Markov Chains. Sarah Filippi Department of Statistics TA: Luke Kelly

Markov Chains. Sarah Filippi Department of Statistics  TA: Luke Kelly Markov Chains Sarah Filippi Department of Statistics http://www.stats.ox.ac.uk/~filippi TA: Luke Kelly With grateful acknowledgements to Prof. Yee Whye Teh's slides from 2013 14. Schedule 09:30-10:30 Lecture:

More information

25.1 Ergodicity and Metric Transitivity

25.1 Ergodicity and Metric Transitivity Chapter 25 Ergodicity This lecture explains what it means for a process to be ergodic or metrically transitive, gives a few characterizes of these properties (especially for AMS processes), and deduces

More information

MIT Manufacturing Systems Analysis Lectures 6 9: Flow Lines

MIT Manufacturing Systems Analysis Lectures 6 9: Flow Lines 2.852 Manufacturing Systems Analysis 1/165 Copyright 2010 c Stanley B. Gershwin. MIT 2.852 Manufacturing Systems Analysis Lectures 6 9: Flow Lines Models That Can Be Analyzed Exactly Stanley B. Gershwin

More information

Random Times and Their Properties

Random Times and Their Properties Chapter 6 Random Times and Their Properties Section 6.1 recalls the definition of a filtration (a growing collection of σ-fields) and of stopping times (basically, measurable random times). Section 6.2

More information

The set of all solutions to the homogeneous equation Ax = 0 is a subspace of R n if A is m n.

The set of all solutions to the homogeneous equation Ax = 0 is a subspace of R n if A is m n. 0 Subspaces (Now, we are ready to start the course....) Definitions: A linear combination of the vectors v, v,..., v m is any vector of the form c v + c v +... + c m v m, where c,..., c m R. A subset V

More information

Global Analysis of Piecewise Linear Systems Using Impact Maps and Quadratic Surface Lyapunov Functions

Global Analysis of Piecewise Linear Systems Using Impact Maps and Quadratic Surface Lyapunov Functions Global Analysis of Piecewise Linear Systems Using Impact Maps and Quadratic Surface Lyapunov Functions Jorge M. Gonçalves, Alexandre Megretski, Munther A. Dahleh Department of EECS, Room 35-41 MIT, Cambridge,

More information

Discrete time Markov chains. Discrete Time Markov Chains, Definition and classification. Probability axioms and first results

Discrete time Markov chains. Discrete Time Markov Chains, Definition and classification. Probability axioms and first results Discrete time Markov chains Discrete Time Markov Chains, Definition and classification 1 1 Applied Mathematics and Computer Science 02407 Stochastic Processes 1, September 5 2017 Today: Short recap of

More information

CHAPTER 6. Markov Chains

CHAPTER 6. Markov Chains CHAPTER 6 Markov Chains 6.1. Introduction A(finite)Markovchainisaprocess withafinitenumberofstates (or outcomes, or events) in which the probability of being in a particular state at step n+1depends only

More information

Appendix A Taylor Approximations and Definite Matrices

Appendix A Taylor Approximations and Definite Matrices Appendix A Taylor Approximations and Definite Matrices Taylor approximations provide an easy way to approximate a function as a polynomial, using the derivatives of the function. We know, from elementary

More information

Math 113 Homework 5. Bowei Liu, Chao Li. Fall 2013

Math 113 Homework 5. Bowei Liu, Chao Li. Fall 2013 Math 113 Homework 5 Bowei Liu, Chao Li Fall 2013 This homework is due Thursday November 7th at the start of class. Remember to write clearly, and justify your solutions. Please make sure to put your name

More information

MATH 56A: STOCHASTIC PROCESSES CHAPTER 7

MATH 56A: STOCHASTIC PROCESSES CHAPTER 7 MATH 56A: STOCHASTIC PROCESSES CHAPTER 7 7. Reversal This chapter talks about time reversal. A Markov process is a state X t which changes with time. If we run time backwards what does it look like? 7.1.

More information

Maximum Pressure Policies in Stochastic Processing Networks

Maximum Pressure Policies in Stochastic Processing Networks OPERATIONS RESEARCH Vol. 53, No. 2, March April 2005, pp. 197 218 issn 0030-364X eissn 1526-5463 05 5302 0197 informs doi 10.1287/opre.1040.0170 2005 INFORMS Maximum Pressure Policies in Stochastic Processing

More information

Math 4A Notes. Written by Victoria Kala Last updated June 11, 2017

Math 4A Notes. Written by Victoria Kala Last updated June 11, 2017 Math 4A Notes Written by Victoria Kala vtkala@math.ucsb.edu Last updated June 11, 2017 Systems of Linear Equations A linear equation is an equation that can be written in the form a 1 x 1 + a 2 x 2 +...

More information

CS145: Probability & Computing Lecture 18: Discrete Markov Chains, Equilibrium Distributions

CS145: Probability & Computing Lecture 18: Discrete Markov Chains, Equilibrium Distributions CS145: Probability & Computing Lecture 18: Discrete Markov Chains, Equilibrium Distributions Instructor: Erik Sudderth Brown University Computer Science April 14, 215 Review: Discrete Markov Chains Some

More information

Alternating nonzero automata

Alternating nonzero automata Alternating nonzero automata Application to the satisfiability of CTL [,, P >0, P =1 ] Hugo Gimbert, joint work with Paulin Fournier LaBRI, Université de Bordeaux ANR Stoch-MC 06/07/2017 Control and verification

More information

HW2 Solutions Problem 1: 2.22 Find the sign and inverse of the permutation shown in the book (and below).

HW2 Solutions Problem 1: 2.22 Find the sign and inverse of the permutation shown in the book (and below). Teddy Einstein Math 430 HW Solutions Problem 1:. Find the sign and inverse of the permutation shown in the book (and below). Proof. Its disjoint cycle decomposition is: (19)(8)(37)(46) which immediately

More information

Chapter 23. Predicting Chaos The Shift Map and Symbolic Dynamics

Chapter 23. Predicting Chaos The Shift Map and Symbolic Dynamics Chapter 23 Predicting Chaos We have discussed methods for diagnosing chaos, but what about predicting the existence of chaos in a dynamical system. This is a much harder problem, and it seems that the

More information

Probability & Computing

Probability & Computing Probability & Computing Stochastic Process time t {X t t 2 T } state space Ω X t 2 state x 2 discrete time: T is countable T = {0,, 2,...} discrete space: Ω is finite or countably infinite X 0,X,X 2,...

More information

A Cross-Associative Neural Network for SVD of Nonsquared Data Matrix in Signal Processing

A Cross-Associative Neural Network for SVD of Nonsquared Data Matrix in Signal Processing IEEE TRANSACTIONS ON NEURAL NETWORKS, VOL. 12, NO. 5, SEPTEMBER 2001 1215 A Cross-Associative Neural Network for SVD of Nonsquared Data Matrix in Signal Processing Da-Zheng Feng, Zheng Bao, Xian-Da Zhang

More information

Math Final December 2006 C. Robinson

Math Final December 2006 C. Robinson Math 285-1 Final December 2006 C. Robinson 2 5 8 5 1 2 0-1 0 1. (21 Points) The matrix A = 1 2 2 3 1 8 3 2 6 has the reduced echelon form U = 0 0 1 2 0 0 0 0 0 1. 2 6 1 0 0 0 0 0 a. Find a basis for the

More information

MATH 1700 FINAL SPRING MOON

MATH 1700 FINAL SPRING MOON MATH 700 FINAL SPRING 0 - MOON Write your answer neatly and show steps If there is no explanation of your answer, then you may not get the credit Except calculators, any electronic devices including laptops

More information

A FAMILY OF PIECEWISE EXPANDING MAPS HAVING SINGULAR MEASURE AS A LIMIT OF ACIM S

A FAMILY OF PIECEWISE EXPANDING MAPS HAVING SINGULAR MEASURE AS A LIMIT OF ACIM S A FAMILY OF PIECEWISE EXPANDING MAPS HAVING SINGULAR MEASURE AS A LIMIT OF ACIM S ZHENYANG LI, PAWE L GÓ, ABRAHAM BOYARSKY, HARALD PROPPE, AND PEYMAN ESLAMI Abstract Keller [9] introduced families of W

More information

Lecture 2 Systems of Linear Equations and Matrices, Continued

Lecture 2 Systems of Linear Equations and Matrices, Continued Lecture 2 Systems of Linear Equations and Matrices, Continued Math 19620 Outline of Lecture Algorithm for putting a matrix in row reduced echelon form - i.e. Gauss-Jordan Elimination Number of Solutions

More information

Lecture 6 & 7. Shuanglin Shao. September 16th and 18th, 2013

Lecture 6 & 7. Shuanglin Shao. September 16th and 18th, 2013 Lecture 6 & 7 Shuanglin Shao September 16th and 18th, 2013 1 Elementary matrices 2 Equivalence Theorem 3 A method of inverting matrices Def An n n matrice is called an elementary matrix if it can be obtained

More information

Stochastic modelling of epidemic spread

Stochastic modelling of epidemic spread Stochastic modelling of epidemic spread Julien Arino Department of Mathematics University of Manitoba Winnipeg Julien Arino@umanitoba.ca 19 May 2012 1 Introduction 2 Stochastic processes 3 The SIS model

More information

Stochastic2010 Page 1

Stochastic2010 Page 1 Stochastic2010 Page 1 Extinction Probability for Branching Processes Friday, April 02, 2010 2:03 PM Long-time properties for branching processes Clearly state 0 is an absorbing state, forming its own recurrent

More information

The field of Dynamics and Control is concerned with the study of dynamical systems. A dynamical system

The field of Dynamics and Control is concerned with the study of dynamical systems. A dynamical system Analysis of Nonlinear Dynamical Systems Using Markovian Representations Christopher L. Bertagne, Raktim Bhattacharya Department of Aerospace Engineering, Texas A&M University, College Station, TX 77840

More information

Neural, Parallel, and Scientific Computations 18 (2010) A STOCHASTIC APPROACH TO THE BONUS-MALUS SYSTEM 1. INTRODUCTION

Neural, Parallel, and Scientific Computations 18 (2010) A STOCHASTIC APPROACH TO THE BONUS-MALUS SYSTEM 1. INTRODUCTION Neural, Parallel, and Scientific Computations 18 (2010) 283-290 A STOCHASTIC APPROACH TO THE BONUS-MALUS SYSTEM KUMER PIAL DAS Department of Mathematics, Lamar University, Beaumont, Texas 77710, USA. ABSTRACT.

More information

Solving a system by back-substitution, checking consistency of a system (no rows of the form

Solving a system by back-substitution, checking consistency of a system (no rows of the form MATH 520 LEARNING OBJECTIVES SPRING 2017 BROWN UNIVERSITY SAMUEL S. WATSON Week 1 (23 Jan through 27 Jan) Definition of a system of linear equations, definition of a solution of a linear system, elementary

More information

STABILITY OF 2D SWITCHED LINEAR SYSTEMS WITH CONIC SWITCHING. 1. Introduction

STABILITY OF 2D SWITCHED LINEAR SYSTEMS WITH CONIC SWITCHING. 1. Introduction STABILITY OF D SWITCHED LINEAR SYSTEMS WITH CONIC SWITCHING H LENS, M E BROUCKE, AND A ARAPOSTATHIS 1 Introduction The obective of this paper is to explore necessary and sufficient conditions for stability

More information

1300 Linear Algebra and Vector Geometry

1300 Linear Algebra and Vector Geometry 1300 Linear Algebra and Vector Geometry R. Craigen Office: MH 523 Email: craigenr@umanitoba.ca May-June 2017 Matrix Inversion Algorithm One payoff from this theorem: It gives us a way to invert matrices.

More information