IE 336 Seat # Name (one point) < KEY > Closed book. Two pages of hand-written notes, front and back. No calculator. 60 minutes.

Similar documents
Page 0 of 5 Final Examination Name. Closed book. 120 minutes. Cover page plus five pages of exam.

IE 336 Seat # Name (clearly) Closed book. One page of hand-written notes, front and back. No calculator. 60 minutes.

IE 336 Seat # Name. Closed book. One page of hand-written notes, front and back. No calculator. 60 minutes.

IE 336 Seat # Name (clearly) < KEY > Open book and notes. No calculators. 60 minutes. Cover page and five pages of exam.

57:022 Principles of Design II Final Exam Solutions - Spring 1997

Closed book and notes. 60 minutes. Cover page and four pages of exam. No calculators.

Statistics 150: Spring 2007

The Transition Probability Function P ij (t)

IE 581 Introduction to Stochastic Simulation. Three pages of hand-written notes, front and back. Closed book. 120 minutes.

Chapter 5. Continuous-Time Markov Chains. Prof. Shun-Ren Yang Department of Computer Science, National Tsing Hua University, Taiwan

Markov Chains. X(t) is a Markov Process if, for arbitrary times t 1 < t 2 <... < t k < t k+1. If X(t) is discrete-valued. If X(t) is continuous-valued

Closed book and notes. 120 minutes. Cover page, five pages of exam. No calculators.

Statistics 253/317 Introduction to Probability Models. Winter Midterm Exam Friday, Feb 8, 2013

Exercises Solutions. Automation IEA, LTH. Chapter 2 Manufacturing and process systems. Chapter 5 Discrete manufacturing problems

Recap. Probability, stochastic processes, Markov chains. ELEC-C7210 Modeling and analysis of communication networks

Solutions to Homework Discrete Stochastic Processes MIT, Spring 2011

LTCC. Exercises. (1) Two possible weather conditions on any day: {rainy, sunny} (2) Tomorrow s weather depends only on today s weather

This exam contains 6 questions. The questions are of equal weight. Print your name at the top of this page in the upper right hand corner.

Since D has an exponential distribution, E[D] = 0.09 years. Since {A(t) : t 0} is a Poisson process with rate λ = 10, 000, A(0.

Birth-Death Processes

Statistics 253/317 Introduction to Probability Models. Winter Midterm Exam Monday, Feb 10, 2014

ECE 302 Division 1 MWF 10:30-11:20 (Prof. Pollak) Final Exam Solutions, 5/3/2004. Please read the instructions carefully before proceeding.

Calculator Exam 2009 University of Houston Math Contest. Name: School: There is no penalty for guessing.

stochnotes Page 1

Part 3: Parametric Models

EECS 126 Probability and Random Processes University of California, Berkeley: Fall 2014 Kannan Ramchandran November 13, 2014.

Stochastic Models in Computer Science A Tutorial

Exponential Distribution and Poisson Process

Operations Research II, IEOR161 University of California, Berkeley Spring 2007 Final Exam. Name: Student ID:

Queueing Systems: Lecture 3. Amedeo R. Odoni October 18, Announcements

Exercises Stochastic Performance Modelling. Hamilton Institute, Summer 2010

6.041/6.431 Fall 2010 Final Exam Wednesday, December 15, 9:00AM - 12:00noon.

IE 230 Probability & Statistics in Engineering I. Closed book and notes. 60 minutes.

IEOR 6711, HMWK 5, Professor Sigman

Continuous-time Markov Chains

ECE 302 Division 2 Exam 2 Solutions, 11/4/2009.

Readings: Finish Section 5.2

BMIR Lecture Series on Probability and Statistics Fall, 2015 Uniform Distribution

STAT 516 Midterm Exam 2 Friday, March 7, 2008

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science

YORK UNIVERSITY FACULTY OF ARTS DEPARTMENT OF MATHEMATICS AND STATISTICS MATH , YEAR APPLIED OPTIMIZATION (TEST #4 ) (SOLUTIONS)

Multiple Choice Answers. MA 110 Precalculus Spring 2015 Exam 3 14 April Question

MAS1302 Computational Probability and Statistics

(b) What is the variance of the time until the second customer arrives, starting empty, assuming that we measure time in minutes?

Exam 3. Math Spring 2015 April 8, 2015 Name: } {{ } (from xkcd) Read all of the following information before starting the exam:

Queueing Theory. VK Room: M Last updated: October 17, 2013.

6.041/6.431 Fall 2010 Final Exam Solutions Wednesday, December 15, 9:00AM - 12:00noon.

STUDENT NAME: STUDENT SIGNATURE: STUDENT ID NUMBER: SECTION NUMBER RECITATION INSTRUCTOR:

A) Questions on Estimation

Ching-Han Hsu, BMES, National Tsing Hua University c 2015 by Ching-Han Hsu, Ph.D., BMIR Lab. = a + b 2. b a. x a b a = 12

Part I Stochastic variables and Markov chains

ECE302 Spring 2006 Practice Final Exam Solution May 4, Name: Score: /100

MATH 407 FINAL EXAM May 6, 2011 Prof. Alexander

Multiple Choice Answers. MA 110 Precalculus Spring 2016 Exam 1 9 February Question

Q = (c) Assuming that Ricoh has been working continuously for 7 days, what is the probability that it will remain working at least 8 more days?

PBW 654 Applied Statistics - I Urban Operations Research

Continuous time Markov chains

The exponential distribution and the Poisson process

Interlude: Practice Final

QUEUING MODELS AND MARKOV PROCESSES

This exam is closed book and closed notes. (You will have access to a copy of the Table of Common Distributions given in the back of the text.

M/G/1 and M/G/1/K systems

Midterm Exam 1 Solution

IE 230 Seat # (1 point) Name (clearly) < KEY > Closed book and notes. No calculators. Designed for 60 minutes, but time is essentially unlimited.

Probability and Statistics Concepts

Basics of Stochastic Modeling: Part II

CIVL Continuous Distributions

SOLUTIONS IEOR 3106: Second Midterm Exam, Chapters 5-6, November 8, 2012

Continuous-Valued Probability Review

Math Spring Practice for the Second Exam.

Math Spring Practice for the final Exam.

Math 416 Lecture 11. Math 416 Lecture 16 Exam 2 next time

Spring /11/2014

DO NOT OPEN THIS QUESTION BOOKLET UNTIL YOU ARE TOLD TO DO SO

1.225 Transportation Flow Systems Quiz (December 17, 2001; Duration: 3 hours)

Stochastic Processes

(Practice Version) Midterm Exam 2

Lecture 4a: Continuous-Time Markov Chain Models

MA 113 Calculus I Fall 2015 Exam 1 Tuesday, 22 September Multiple Choice Answers. Question

Chapter 4 Continuous Random Variables and Probability Distributions

IEOR 6711: Stochastic Models I, Fall 2003, Professor Whitt. Solutions to Final Exam: Thursday, December 18.

Northwestern University Department of Electrical Engineering and Computer Science

STA 624 Practice Exam 2 Applied Stochastic Processes Spring, 2008

Name of the Student:

18.05 Exam 1. Table of normal probabilities: The last page of the exam contains a table of standard normal cdf values.

CPSC 531 Systems Modeling and Simulation FINAL EXAM

Performance Evaluation of Queuing Systems

ECEn 370 Introduction to Probability

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 8 10/1/2008 CONTINUOUS RANDOM VARIABLES

CPSC 531: System Modeling and Simulation. Carey Williamson Department of Computer Science University of Calgary Fall 2017

Introduction to Queuing Networks Solutions to Problem Sheet 3

Examination paper for TMA4265 Stochastic Processes

Game Theory: Lecture #5

Notes on Continuous Random Variables

Irreducibility. Irreducible. every state can be reached from every other state For any i,j, exist an m 0, such that. Absorbing state: p jj =1

Probability Midterm Exam 2:15-3:30 pm Thursday, 21 October 1999

CHAPTER 6. 1, if n =1, 2p(1 p), if n =2, n (1 p) n 1 n p + p n 1 (1 p), if n =3, 4, 5,... var(d) = 4var(R) =4np(1 p).

STAT509: Continuous Random Variable

STAT 430/510 Probability Lecture 12: Central Limit Theorem and Exponential Distribution

Page Max. Possible Points Total 100

Transcription:

Closed book. Two pages of hand-written notes, front and back. No calculator. 6 minutes. Cover page and four pages of exam. Four questions. To receive full credit, show enough work to indicate your logic. Do not spend time calculating. Unless stated otherwise, you will receive full credit if someone with no understanding of probability could simplify your answer to obtain the correct numerical solution. This exam covers through Chapter 5 of Solberg (August 25). Recall: The Poisson pmf with meanµis f (x )=e µ µ x / x! for x =, 1, 2,... Recall: The geometric pmf with probability of success p is f (x )=p (1 p) x 1 for x = 1, 2, 3,... The mean is 1 / p. Recall: The exponential pdf with mean 1 /λ is f (x )=λe λx for x. Recall: The exponential cdf with mean 1 /λ is F (x )=1 e λx for x. Recall: a c 1 b d = d /(ad bc ) c /(ad bc ) b /(ad bc ) a /(ad bc ) Score Exam #3, Spring 26 Schmeiser

Closed book. Two pages of hand-written notes, front and back. No calculator. 1. (Based on Solberg s Problem 9, Chapter 5) Customers arrive at a bank machine according to a Poisson process with rate 4 per hour. Over time, half of the customers are men and half are women. Suppose that twenty men arrive in a particular eight-hour day. (a) (six points) Conditional that the twenty men arrived, determine the arrival rate for women for that particular eight-hour day. λ W =λ/2=2women per hour (b) (six points) Conditional that the twenty men arrived, determine the expected number of women who arrive in that particular eight-hour day. λ W t = (2) (8)=16 women (c) (seven points) Conditional that the twenty men arrived, determine the probability that twenty women arrive in that particular eight-hour day. Let W denote the number of women arriving in a random eight-hour day. Arrivals are according to a Poisson process, so the number of arrivals is Poisson: P(W = 2)= e µ µ 2, 2 whereµ=λ W t = 16 from Part (b). HP (d) (seven points) Conditional that the twenty men arrived, determine the distribution of time from the beginning of the day until the first woman arrives. The distribution is exponential with mean 1 /λ W = 1 / 2 hour. Exam #3, Spring 26 Page 1 of 4 Schmeiser

2. (Based on Solberg s Problem 2, Chapter 5) Two copies of a particular library book are held on reserve. Anyone who wants to read the book has to request it at the reserve desk and must return it there the same day; the copy cannot be removed from the library. Demands for the book occur throughout the day according to a Poisson process with rate two per hour. Users keep the book for an exponential time, with an average of ninety minutes; user times are independent of each other. At opening time, both copies are available for check out. (a) (six points) Which seems to be the more-appropriate assumption: that demands are from a Poisson process or that time to keep the book is exponential? Why? To argue against Poisson arrivals with constant rate: dependence: students arrival together dependence: finite number of students reduces demand rate nonstationary: demand rate should depend on time of day To argue against exponential time to keep the book: mode: zero is not the most likely time memory: remaining time depends on past time finite range: time must be less than time until closing (b) (eight points) State a Markov process model for this situation. Let time be measured in hours. (Other choices, such as minutes, are ok.) Let state be the number of copies available. (Number checked out is also ok.) Then the rate matrix is 2 2 8 / 3 4 / 3 2. 4 / 3 Λ = 1 2 / 3 2 (c) (three points) Is your model of Part (b) a birth-death model? < yes > (d) (six points) Write the Kolmogorov forward equations, including initial conditions. Using double subscripts: The initial state is, so p ()=1, p 1 ()=and p 2 ()=. For j =, 1, 2, dp j (t ) = p + p 1 (t )λ 1j + p 2 (t )λ 2j dt Alternatively, use a single subscript: The initial state is, so p ()=1, p 1 ()=and p 2 ()=. For j =, 1, 2, dp j (t ) = p + p 1 + p 2 dt (e) (six points) In terms of your notation from Part (d), what is the probability that no copies are available four hours into the day? (with two subscripts) p 2 (4) or (with one subscript) p 2 (4) Exam #3, Spring 26 Page 2 of 4 Schmeiser

3. Consider the three-state rate matrix 1 2 3.5 1..1 3..4 2.. Assume that at time t = 6 the system is equally likely to be in any of the three states. (a) (eight points) From time t = 6, determine the expected time until the system is next in State 1. (If in State 1 at time t = 6, wait until the next visit.) Maybe never return to State 1, so this is not a mean first-passage time. Either of two answers for full credit: Expected time is infinite. Conditional mean first-passage time: h 1 + h 2 = ( 1 /λ 11 )+( 1 /λ 22 )=2+(1 / 3)=7 / 3 time units. (b) (six points) From time t = 6, determine the probability that the system ever reaches State 3. State 3 is absorbing, so the answer is one. Because State 3 is absorbing, ok to solve for the steady-state probabilityπ 3 = 1. (c) (six points) Now assume that the system is in State 1. What is the probability that it will next be in State 3? λ 13.4 = λ 12 +λ 13.1+.4 =.8 Exam #3, Spring 26 Page 3 of 4 Schmeiser

4. Consider the time until the next event in a Poisson process with rateλ. (Recall: The time is exponential with mean 1 / λ.) (a) (eight points) Develop a Markov process model that can be used for Parts (b) and (c). Full credit for any of several models. Model 1: Two states, say and 1, with rateλ 1 =λ. Model 2: Infinite states, say, 1,..., with ratesλ i,i+1 =λ. Model 3: Choose the model of your choice. (b) (six points) Based on your model, explain how to calculate the probability that the time until the next event is greater than 1 /λ. Assume currently in State i = for Model 1 or any State i for Model 2. Time in State i is exponential with mean 1 /λ, so P(T > t )=e λ t. Therefore, P(T > 1 /λ)=e 1. More completely, dp i,i (t ) / dt = p i,i (t )λ with p i,i ()=1 implies that p i,i (t )=e λ t. But P(T > t )=p i,i (t ), so the holding time is exponential with rateλ. (c) (six points) Based on your model, explain how to calculate the expected time until the next event. Assume currently in State i = for Model 1 or any State i for Model 2. For any Markov process, the mean holding time is h i = 1 /λ ii = 1 / ( λ)=1/λ. Exam #3, Spring 26 Page 4 of 4 Schmeiser