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

Similar documents
IE 581 Introduction to Stochastic Simulation. One page of notes, front and back. Closed book. 50 minutes. Score

IE 581 Introduction to Stochastic Simulation. One page of notes, front and back. Closed book. 50 minutes. Score

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

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

IE 581 Introduction to Stochastic Simulation

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

Computer Science, Informatik 4 Communication and Distributed Systems. Simulation. Discrete-Event System Simulation. Dr.

Chapter 11. Output Analysis for a Single Model Prof. Dr. Mesut Güneş Ch. 11 Output Analysis for a Single Model

Chapter 11 Output Analysis for a Single Model. Banks, Carson, Nelson & Nicol Discrete-Event System Simulation

The exponential distribution and the Poisson process

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science

Statistics 433 Practice Final Exam: Cover Sheet and Marking Sheet

Queueing Theory I Summary! Little s Law! Queueing System Notation! Stationary Analysis of Elementary Queueing Systems " M/M/1 " M/M/m " M/M/1/K "

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

Little s result. T = average sojourn time (time spent) in the system N = average number of customers in the system. Little s result says that

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

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

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

NANYANG TECHNOLOGICAL UNIVERSITY SEMESTER I EXAMINATION MH4702/MAS446/MTH437 Probabilistic Methods in OR

Slides 12: Output Analysis for a Single Model

BIRTH DEATH PROCESSES AND QUEUEING SYSTEMS

X i. X(n) = 1 n. (X i X(n)) 2. S(n) n

Page Max. Possible Points Total 100

EE/PEP 345. Modeling and Simulation. Spring Class 11

λ λ λ In-class problems

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

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

Computer Systems Modelling

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

Stochastic Models of Manufacturing Systems

EE126: Probability and Random Processes

7 Variance Reduction Techniques

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

Midterm Exam 2. Prof. Miloš Popović

5/15/18. Operations Research: An Introduction Hamdy A. Taha. Copyright 2011, 2007 by Pearson Education, Inc. All rights reserved.

Queuing Analysis. Chapter Copyright 2010 Pearson Education, Inc. Publishing as Prentice Hall

2WB05 Simulation Lecture 7: Output analysis

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

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

B. Maddah INDE 504 Discrete-Event Simulation. Output Analysis (1)

HITTING TIME IN AN ERLANG LOSS SYSTEM

Computer Systems Modelling

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

Notes on Continuous Random Variables

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?

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

Janacek statistics tables (2009 edition) are available on your desk. Do not turn over until you are told to do so by the Invigilator.

HW7 Solutions. f(x) = 0 otherwise. 0 otherwise. The density function looks like this: = 20 if x [10, 90) if x [90, 100]

O June, 2010 MMT-008 : 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?

S n = x + X 1 + X X n.

Simulation of stationary processes. Timo Tiihonen

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

Probability and Statistics Concepts

Exponential Distribution and Poisson Process

CPSC 531 Systems Modeling and Simulation FINAL EXAM

QUEUING MODELS AND MARKOV PROCESSES

Solutions to Homework Discrete Stochastic Processes MIT, Spring 2011

Exercises Stochastic Performance Modelling. Hamilton Institute, Summer 2010

ECE580 Exam 2 November 01, Name: Score: / (20 points) You are given a two data sets

ec1 e-companion to Liu and Whitt: Stabilizing Performance

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

Chapter 6 Queueing Models. Banks, Carson, Nelson & Nicol Discrete-Event System Simulation

Chapter 11 Estimation of Absolute Performance

Stat 515 Midterm Examination II April 4, 2016 (7:00 p.m. - 9:00 p.m.)

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

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science

Slides 9: Queuing Models

ISyE 2030 Practice Test 2

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

Final EXAM. Physics 203. Prof. Daniel A. Martens Yaverbaum. John Jay College of Criminal Justice, the CUNY. Sections 1, 2. Wednesday, 5/21/14

Open book and notes. 120 minutes. Covers Chapters 8 through 14 of Montgomery and Runger (fourth edition).

Part I Stochastic variables and Markov chains

Variance reduction techniques

Logistical and Transportation Planning. QUIZ 1 Solutions

Variance reduction techniques

Stochastic Processes

Designing Information Devices and Systems II Spring 2016 Anant Sahai and Michel Maharbiz Midterm 2

Continuous-Time Markov Chain

Simulation. Where real stuff starts

Computer Science, Informatik 4 Communication and Distributed Systems. Simulation. Discrete-Event System Simulation. Dr.

Solutions For Stochastic Process Final Exam

IEOR 4106: Spring Solutions to Homework Assignment 7: Due on Tuesday, March 22.

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.

Chapter 3: Markov Processes First hitting times

EXAM IN COURSE TMA4265 STOCHASTIC PROCESSES Wednesday 7. August, 2013 Time: 9:00 13:00

Lecture 20. Poisson Processes. Text: A Course in Probability by Weiss STAT 225 Introduction to Probability Models March 26, 2014

REAL-TIME DELAY ESTIMATION BASED ON DELAY HISTORY SUPPLEMENTARY MATERIAL

Queueing Theory (Part 4)

MA 113 Calculus I Fall 2016 Exam 3 Tuesday, November 15, True/False 1 T F 2 T F 3 T F 4 T F 5 T F. Name: Section:

Sample questions for Fundamentals of Machine Learning 2018

M.Sc.(Mathematics with Applications in Computer Science) Probability and Statistics

Queueing Review. Christos Alexopoulos and Dave Goldsman 10/6/16. (mostly from BCNN) Georgia Institute of Technology, Atlanta, GA, USA

Midterm: CS 6375 Spring 2018

Simulation. Where real stuff starts

Performance Evaluation of Queuing Systems

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

Two hours. To be supplied by the Examinations Office: Mathematical Formula Tables THE UNIVERSITY OF MANCHESTER. 21 June :45 11:45

Non Markovian Queues (contd.)

Physics 2212 GJ. Fill in bubbles for your Multiple Choice answers darkly and neatly. a b c d e 1 a b c d e. 2 a b c d e. 3 a b c d e.

Transcription:

Three pages of hand-written notes, front and back. Closed book. 120 minutes. 1. SIMLIB. True or false. (2 points each. If you wish, write an explanation of your thinking.) (a) T F The time of the next event and the type of the next event are stored as "attributes" in a "list". (b) T F The average size, over time, of every list is collected automatically. (c) T F The average size of a list is an observational statistic, maintained through the routine "sampst". (d) T F The variance of the size of a list is a time-based statistic. (e) T F When simulating a system using SIMLIB, the state cannot change continuously through time. (f) T F When simulating a system using SIMLIB, the next-event list is ordered based on the scheduled time of the event. (g) T F When simulating a system using SIMLIB, the "main" routine is user written. (h) T F When simulating a system using SIMLIB, reducing variance by using control variates is not possible. (i) T F When simulating a system using SIMLIB, reducing variance by using antithetic variates is not possible. (j) T F When simulating a system using SIMLIB, an "arrival" event must always be scheduled to occur at time zero. (k) T F In SIMLIB, every event occurs at a point in time, not over an interval of time. Schmeiser Page 1 of 6 Final Exam, Spring 2011 (May 6)

2. True or false. (2 points each. If you wish, write an explanation of your thinking.) (a) T F The only reason to use multiple random-number streams is to induce correlation in the hope of improving the efficiency of the simulation experiment. (b) T F If an experiment with sample size n = 10000 produces a point estimator θˆ with variance var(θˆ)=100, then the "ones" digit is meaningful. (c) T F If two uniform (0,1) random numbers U and V are independent, then the fractional part of their sum is also uniform (0,1). (d) T F The average number of jobs in a system is a time integral divided by the elapsed time of simulation. (e) T F The average time of a customer in the system is a time integral divided by the time of simulation. (f) T F For a stationary set of data Y 1, Y 2,..., Y n, the variance of Y i can be estimated by the usual estimator S 2 = n Σ i=1 (Y i Y ) 2 n 1 where Y is the sample average. (That is, S 2 goes to var(y i ) as the simulation run length goes to infinity.) (g) T F If the length of a simulation run is quadrupled, then the standard error of the point estimators is approximately halved, whether or not the output observations are autocorrelated. (h) T F The "loss factor" in linear control variates arises because linearity is only an approximation. Schmeiser Page 2 of 6 Final Exam, Spring 2011 (May 6)

3. (4 points) In a simulation experiment to estimate a performance measure θ, an ideal control variate C is one that is (1) inexpensive to compute, (2) is highly correlated with the point estimator θˆ, and (3) has known mean E(C ). Since we are free to choose any random variable as the control, why not chooseθˆ itself; that is, why not choose C =θˆ? 4. (2 points each) Indicate whether the statistic is a "time average" (T) or "observational" (O). (a) T O Variance of the number of customers waiting for service. (b) T O Average number of customers waiting for service. (c) T O Fraction of customers who wait for service. 5. (2 points each) Suppose you rerun a simulation experiment, keeping everything the same except the random-number seeds. Which are constants, which are random, and which are undefined. (Circle one.) (a) θ constant random undefined (b) S 2 constant random undefined (c) s.e.(θˆ) constant random undefined Schmeiser Page 3 of 6 Final Exam, Spring 2011 (May 6)

6. Suppose that we are keeping statistics about the time spent in the system, say T i for customer i. We wish to estimate the steady-state mean E(T ), variance Var(T ), and P(T < 10 minutes). (a) (5 points) Some statistical accumulators need to be maintained. Choose names and write the logic to update them for one new observation, say t i. (b) (5 points) Write the logic to compute the point estimators at the end of the simulation. Schmeiser Page 4 of 6 Final Exam, Spring 2011 (May 6)

7. Let L (t ) denote the number of customers in the system at time t in a steady-state simulation. We wish to estimate the long-term average number of customers in the system, θ=lim t E(L (t )). Suppose that we observe L (t ) from time t = 0 until the simulation ends at time t end. (a) (5 points) Write a reasonable point estimatorθˆ. (b) (5 points) Write the definition of the steady-state variance of L (t ). (c) (5 points) Write a reasonable point estimator for your answer to Part (b). Schmeiser Page 5 of 6 Final Exam, Spring 2011 (May 6)

8. (2 points each) Why is the "initial transient" a concern? That is, why do we sometimes discard data from the beginning of a simulation replication? Circle all correct answers. Reduce the bias ofθˆ. Reduce the variance ofθˆ. Get a better estimator of the standard error ofθˆ. 9. (5 points) In the thinning algorithm for generating the next arrival time t i given the last arrival time t i 1 from a Poisson process with rate λ(t ), suppose a potential arrival has arrived at time t* via the Poisson process with rate λ*. What is the probability that the potential arrival enters the system? 10. (2 points each) The variance-reduction techniques of common random numbers, antithetic variates, and (external) control variates require "correlation induction". (a) T F The correlation being induced is (i) a property of the simulation experiment and (ii) not a property of the model being analyzed. (b) T F The induced correlation should always be positive. (c) T F The use of NORTA (normal to anything) is an example of such correlation induction. Schmeiser Page 6 of 6 Final Exam, Spring 2011 (May 6)