ISyE 6644 Fall 2014 Test #2 Solutions (revised 11/7/16)
|
|
- Aubrie Thomas
- 5 years ago
- Views:
Transcription
1 1 NAME ISyE 6644 Fall 2014 Test #2 Solutions (revised 11/7/16) This test is 85 minutes. You are allowed two cheat sheets. Good luck! 1. Some short answer questions to get things going. (a) Consider the linear congruential generator X n+1 = (17X n + 7)mod(128). Using X 0 = 5, calculate the first two pseudo-random numbers, U 1 and U 2. Solution: X 1 = (17X 0 + 7)mod(128) = 92, so U 1 = 92/128 = Similarly, U 2 = (b) You may recall the following corollary from the class notes: The LCG X i = (ax i 1 + c)mod(2 n ) (for c and n > 1) has full cycle if c is odd and a = 4k + 1 for some integer k. With this result in mind, again consider the LCG in Question 1a with seed X 0 = 5. Calculate U Solution: For this generator, c = 7 is odd, the modulus is 2 n, where n = 7 > 1, and a = 17 = 4k + 1 for k = 4. Thus, the corollary applies and so the period of this generator is 128. Thus, U 2050 = U 1922 = = U 130 = U 2 = (c) Use the Box-Muller method along with U 1 and U 2 from Question 1a to generate two independent Nor(0, 1) random variables. Solution: We have Z 1 = Z 2 = 2ln(U 1 ) cos(2πu 2 ) = ln(U 1 ) sin(2πu 2 ) = (d) Use your answer in Question 1c to generate two independent Nor(0, 0.25) random variables. Solution: X 1 = 0.25 Z 1 = and X 2 = 0.25 Z 2 =
2 2 (e) Use your answer in Question 1c to generate a χ 2 (2) random variable. Solution: χ 2 (2) = Z Z 2 2 = (f) Consider a Tausworthe generator with r = 2, q = 4, and B 1 = B 2 = B 3 = B 4 = 1. Find B 5 and B 6. Solution: We have B i = (B i r + B i q )mod(2) = B i 2 XOR B i 4. Thus, B 5 = B 3 XOR B 1 = 1 XOR 1 = 0 and B 6 = B 4 XOR B 2 = Consider the following n = 12 pseudo-random numbers We shall assume that the U i s are all Unif(0, 1). But let s conduct a correlation test to test whether or not the U i s are independent. We define the lag-j correlation between the U i s by ρ j Corr(U i, U i+j ). Ideally, this correlation should equal zero for all j. A good estimator for the lag-1 correlation ρ 1 is given by ˆρ 1 [ ] 12 n 2 U 1+k U 2+k 3. n 1 k=0 Under the assumption that the U i s are independent, it turns out that Var(ˆρ 1 ) 13n 19 (n 1) 2. Under the null hypothesis H 0 : ρ 1 = 0, it can be shown that the test statistic C ˆρ 1 Var(ˆρ 1 ) is approximately standard normal. Of course, we reject the null hypothesis if C is too big or small. (a) Calculate ˆρ 1. Solution: ˆρ 1 = 12 (3.1204) 3 =
3 3 (b) Calculate Var(ˆρ 1 ) (using the above approximation). Solution: Var(ˆρ 1 ) (13)(12) = (c) Calculate C. Solution: C = / = (d) Use the above with level α = 0.05 to test whether or not H 0 is true. Solution: Since C < z α/2 = 1.96, we fail to reject H 0. (This is actually a little surprising to me, since ˆρ 1 seems high, but I guess the sample size is too low to merit rejection.) (e) If ρ 1 actually equals 0, does ρ 2 = 0? Solution: Not necessarily. You can easily come up with some weirdo cyclic behavior which gives ρ 2 0. For instance, let U 0 and U 1 be i.i.d. Unif(0,1), and then take U i = U i 2 for i Consider the first-order moving average process [MA(1)], X i+1 = θz i + Z i+1, where the Z i s are i.i.d. Normal(0,1) random variables, and 1 < θ < 1. (a) Calculate the covariance function, R k this process. = Cov(X i, X i+k ), k = 0, 1, 2,..., for Solution: We actually did this in class, but I ll go through the details again.... Since the Z i s are independent, and R 0 = Var(X i ) = Var(θZ i 1 + Z i ) = θ 2 Var(Z i 1 ) + Var(Z i ) = θ 2 + 1, R 1 = Cov(X i, X i+1 ) = Cov(θZ i 1 + Z i, θz i + Z i+1 ) = θvar(z i ) = θ, R 2 = Cov(X i, X i+2 ) = Cov(θZ i 1 + Z i, θz i+1 + Z i+2 ) = 0. Thus, R 0 = 1 + θ 2, R ±1 = θ, and R k = 0 for k 2.
4 4 (b) It turns out that (after some algebra) σ 2 n nvar( X) = (1 + θ) 2 2θ n, where X = n i=1 X i /n is the sample mean. Calculate the limiting quantity σ 2 = lim n σ 2 n. Solution: σ 2 = (1 + θ) 2. (c) For θ > 0, it turns out that the ratio σ 2 n/σ 2 < 1. Suppose that θ = 0.5. Using your answer to part (b), find the smallest value of n such that 0.95 σ 2 n/σ 2. Solution: By (b), σ 2 n/σ 2 which leads to n 8.89, i.e., 9. = (1 + θ)2 2θ n (1 + θ) 2 = /n , 4. Suppose we observe 1000 pseudo-random numbers to obtain the following data. interval [0.0, 0.2) [0.2, 0.4) [0.4, 0.6) [0.6, 0.8) [0.8, 1.0] number observed Conduct a χ 2 goodness-of-fit test to see if these numbers are approximately U(0, 1). Use level of significance α = Here are some table entries that you may need: χ ,3 = 7.81, χ ,4 = 9.49, and χ ,5 = Solution: Let s re-write the table: Then interval [0.0, 0.2) [0.2, 0.4) [0.4, 0.6) [0.6, 0.8) [0.8, 1.0] O i E i χ 2 0 = 5 (O i E i ) 2 = i=1 E i Note that we have k 1 = 4 degrees of freedom. Then since χ 2 0 < χ ,4, we fail to reject uniformity.
5 5 5. Suppose the random variable X has the following p.d.f. 0 if x < 0 or x > 2 f(x) = x if 0 x 1 1/2 if 1 x 2. (a) Give an inverse transform method for generating realizations of X. Solution: After a little algebra, we get the c.d.f., 0 if x < 0 x 2 F (x) = 2 if 0 x 1 x 2 if 1 x 2 1 if x > 2. Case 1: Setting X2 2 = U, we have X = 2U for 0 U 1/2. Case 2: Setting X 2 = U, we have X = 2U for 1/2 U 1. Thus, in order to generate the RV, we use X = { 2U if 0 U 1/2 2U if 1/2 U 1. (b) Use the U(0, 1) random number 0.55 to generate a realization of X. Solution: X = 2(0.55) = Questions on Poisson random variables. (a) Use the acceptance-rejection technique to generate one Poisson(4.5) random variate. Use as many of the following U(0, 1) numbers as is necessary Solution: Define p n n+1 i=1 U i. We ll stop as soon as p n < e 4.5 = Let s make the following convenient table. n U n+1 p n Stop? nope nope nope yup
6 6 So we take N = 3. (b) How many U(0, 1) s would you have expected to use in Question 6a? Solution: From class notes, E[N + 1] = 5.5. (c) What would you have had to do if I had asked you to generate a Poisson(200) random variate? Solution: Use the normal approximation. N = λ + λz 0.5 = Z Joey owns Dogs R Us, a fancy hot dog stand in Smyrna. Customers arrive to buy hot dogs according to a Poisson process at the rate of 10/hour. Two servers work for Joey. Each customer buys X hot dogs, where X Pois(3) + 1. It takes exactly 4 minutes to serve each hot dog. After a customer is served, there is a 20% chance that he will chat for U(4, 8) minutes with his server. The servers take a 30-minute break every 4 hours (although they will finish serving any customer currently in progress). Write a VERY, VERY NEAT Arena program to simulate this system for 40 hours. In particular, (a) Draw an appropriate block diagram. I know that you are not an artist, so label each block indicating what kind of block it is; and indicate any necessary information about the block, such as parameters like arrival rates, or commands such as Seize-Delay-Release. (b) Write out the precise command that you would need to implement the random variable X. Solution: In the Delay information, just enter 4 (POIS(3) + 1). (c) Describe in words how you might schedule the breaks. Solution: Define a resource schedule and fill in the table or chart.
7 7 (d) Describe in words how you would run the simulation for 40 hours. Solution: Go to Run Setup > Replication Parameters and stop the run at 40 hours. 8. More short answer questions. (a) If the number of arrivals to a parking lot follows a nonhomogeneous Poisson process with intensity function λ(t) = t 2, where t [0, 10] denotes hours, find the expected number of customers to show up between t = 4 and 6. Solution: E[N(6) N(4)] = 6 4 λ(t) dt = (b) What is the name of the method we discussed in class to generate NHPP arrivals? Solution: Thinning. (c) Suppose that W Q i+1 is the (i + 1)st customer s waiting time. Write down a simple expression for this time in terms of the previous customer i s waiting time and service time, and customer (i + 1) s interarrival time. Solution: W Q i+1 = max {0, W Q i + S i I i+1 }. (d) Consider the majorizing function t(x) used in an acceptance-rejection algorithm. i. TRUE or FALSE? t(x) f(x) for all x. Solution: TRUE. ii. TRUE or FALSE? For efficiency purposes, t(x) should be as close to the target p.d.f. as possible. Solution: TRUE. iii. TRUE or FALSE? Let c max x t(x). Then t(x)/c is a p.d.f.
8 8 Solution: This problem seems to be a little ambiguous, so let s pretend it never happened! iv. TRUE or FALSE? The p.d.f. corresponding to t(x) should be as easy as possible to generate RV s from. Solution: TRUE. v. TRUE or FALSE? The number of trials before an acceptance takes place is geometric. Solution: TRUE. (e) Suppose that W(t) is a Brownian motion process. Find Cov ( 1 0 W(t) dt, W(1)). Solution: 1 0 Cov(W(t), W(1)) dt = 1 0 t dt = 1/2. (f) What is the process e W(t) called? Solution: Geometric Brownian motion.
ISyE 3044 Fall 2017 Test #1a Solutions
1 NAME ISyE 344 Fall 217 Test #1a Solutions This test is 75 minutes. You re allowed one cheat sheet. Good luck! 1. Suppose X has p.d.f. f(x) = 4x 3, < x < 1. Find E[ 2 X 2 3]. Solution: By LOTUS, we have
More informationISyE 6644 Fall 2016 Test #1 Solutions
1 NAME ISyE 6644 Fall 2016 Test #1 Solutions This test is 85 minutes. You re allowed one cheat sheet. Good luck! 1. Suppose X has p.d.f. f(x) = 3x 2, 0 < x < 1. Find E[3X + 2]. Solution: E[X] = 1 0 x 3x2
More informationISyE 6644 Fall 2014 Test 3 Solutions
1 NAME ISyE 6644 Fall 14 Test 3 Solutions revised 8/4/18 You have 1 minutes for this test. You are allowed three cheat sheets. Circle all final answers. Good luck! 1. [4 points] Suppose that the joint
More informationISyE 6644 Fall 2015 Test #1 Solutions (revised 10/5/16)
1 NAME ISyE 6644 Fall 2015 Test #1 Solutions (revised 10/5/16) You have 85 minutes. You get one cheat sheet. Put your succinct answers below. All questions are 3 points, unless indicated. You get 1 point
More informationISyE 3044 Fall 2015 Test #1 Solutions
1 NAME ISyE 3044 Fall 2015 Test #1 Solutions You have 85 minutes. You get one cheat sheet. Put your succinct answers below. All questions are 3 points, unless indicated. You get 1 point for writing your
More informationQualifying Exam CS 661: System Simulation Summer 2013 Prof. Marvin K. Nakayama
Qualifying Exam CS 661: System Simulation Summer 2013 Prof. Marvin K. Nakayama Instructions This exam has 7 pages in total, numbered 1 to 7. Make sure your exam has all the pages. This exam will be 2 hours
More informationGenerating Uniform Random Numbers
1 / 41 Generating Uniform Random Numbers Christos Alexopoulos and Dave Goldsman Georgia Institute of Technology, Atlanta, GA, USA 10/13/16 2 / 41 Outline 1 Introduction 2 Some Lousy Generators We Won t
More informationGenerating Uniform Random Numbers
1 / 44 Generating Uniform Random Numbers Christos Alexopoulos and Dave Goldsman Georgia Institute of Technology, Atlanta, GA, USA 10/29/17 2 / 44 Outline 1 Introduction 2 Some Lousy Generators We Won t
More informationSystems Simulation Chapter 7: Random-Number Generation
Systems Simulation Chapter 7: Random-Number Generation Fatih Cavdur fatihcavdur@uludag.edu.tr April 22, 2014 Introduction Introduction Random Numbers (RNs) are a necessary basic ingredient in the simulation
More information2905 Queueing Theory and Simulation PART IV: SIMULATION
2905 Queueing Theory and Simulation PART IV: SIMULATION 22 Random Numbers A fundamental step in a simulation study is the generation of random numbers, where a random number represents the value of a random
More informationUniform random numbers generators
Uniform random numbers generators Lecturer: Dmitri A. Moltchanov E-mail: moltchan@cs.tut.fi http://www.cs.tut.fi/kurssit/tlt-2707/ OUTLINE: The need for random numbers; Basic steps in generation; Uniformly
More informationSlides 3: Random Numbers
Slides 3: Random Numbers We previously considered a few examples of simulating real processes. In order to mimic real randomness of events such as arrival times we considered the use of random numbers
More informationISyE 2030 Practice Test 1
1 NAME ISyE 2030 Practice Test 1 Summer 2005 This test is open notes, open books. You have exactly 90 minutes. 1. Some Short-Answer Flow Questions (a) TRUE or FALSE? One of the primary reasons why theoretical
More informationUNIT 5:Random number generation And Variation Generation
UNIT 5:Random number generation And Variation Generation RANDOM-NUMBER GENERATION Random numbers are a necessary basic ingredient in the simulation of almost all discrete systems. Most computer languages
More informationSimulation. Where real stuff starts
1 Simulation Where real stuff starts ToC 1. What is a simulation? 2. Accuracy of output 3. Random Number Generators 4. How to sample 5. Monte Carlo 6. Bootstrap 2 1. What is a simulation? 3 What is a simulation?
More informationCPSC 531: Random Numbers. Jonathan Hudson Department of Computer Science University of Calgary
CPSC 531: Random Numbers Jonathan Hudson Department of Computer Science University of Calgary http://www.ucalgary.ca/~hudsonj/531f17 Introduction In simulations, we generate random values for variables
More informationISyE 2030 Practice Test 2
1 NAME ISyE 2030 Practice Test 2 Summer 2005 This test is open notes, open books. You have exactly 75 minutes. 1. Short-Answer Questions (a) TRUE or FALSE? If arrivals occur according to a Poisson process
More informationSimulation. Where real stuff starts
Simulation Where real stuff starts March 2019 1 ToC 1. What is a simulation? 2. Accuracy of output 3. Random Number Generators 4. How to sample 5. Monte Carlo 6. Bootstrap 2 1. What is a simulation? 3
More information2 Random Variable Generation
2 Random Variable Generation Most Monte Carlo computations require, as a starting point, a sequence of i.i.d. random variables with given marginal distribution. We describe here some of the basic methods
More informationVariance reduction techniques
Variance reduction techniques Lecturer: Dmitri A. Moltchanov E-mail: moltchan@cs.tut.fi http://www.cs.tut.fi/ moltchan/modsim/ http://www.cs.tut.fi/kurssit/tlt-2706/ OUTLINE: Simulation with a given confidence;
More informationGenerating Uniform Random Numbers
1 / 43 Generating Uniform Random Numbers Christos Alexopoulos and Dave Goldsman Georgia Institute of Technology, Atlanta, GA, USA March 1, 2016 2 / 43 Outline 1 Introduction 2 Some Generators We Won t
More informationWrite your Registration Number, Test Centre, Test Code and the Number of this booklet in the appropriate places on the answer sheet.
2017 Booklet No. Test Code : PSA Forenoon Questions : 30 Time : 2 hours Write your Registration Number, Test Centre, Test Code and the Number of this booklet in the appropriate places on the answer sheet.
More informationIE 581 Introduction to Stochastic Simulation
1. List criteria for choosing the majorizing density r (x) when creating an acceptance/rejection random-variate generator for a specified density function f (x). 2. Suppose the rate function of a nonhomogeneous
More informationCPSC 531: System Modeling and Simulation. Carey Williamson Department of Computer Science University of Calgary Fall 2017
CPSC 531: System Modeling and Simulation Carey Williamson Department of Computer Science University of Calgary Fall 2017 Quote of the Day A person with one watch knows what time it is. A person with two
More informationB.N.Bandodkar College of Science, Thane. Random-Number Generation. Mrs M.J.Gholba
B.N.Bandodkar College of Science, Thane Random-Number Generation Mrs M.J.Gholba Properties of Random Numbers A sequence of random numbers, R, R,., must have two important statistical properties, uniformity
More informationClass 26: review for final exam 18.05, Spring 2014
Probability Class 26: review for final eam 8.05, Spring 204 Counting Sets Inclusion-eclusion principle Rule of product (multiplication rule) Permutation and combinations Basics Outcome, sample space, event
More informationChapter 5. Chapter 5 sections
1 / 43 sections Discrete univariate distributions: 5.2 Bernoulli and Binomial distributions Just skim 5.3 Hypergeometric distributions 5.4 Poisson distributions Just skim 5.5 Negative Binomial distributions
More informationIEOR 6711: Stochastic Models I SOLUTIONS to the First Midterm Exam, October 7, 2008
IEOR 6711: Stochastic Models I SOLUTIONS to the First Midterm Exam, October 7, 2008 Justify your answers; show your work. 1. A sequence of Events. (10 points) Let {B n : n 1} be a sequence of events in
More informationChapter 1 Statistical Reasoning Why statistics? Section 1.1 Basics of Probability Theory
Chapter 1 Statistical Reasoning Why statistics? Uncertainty of nature (weather, earth movement, etc. ) Uncertainty in observation/sampling/measurement Variability of human operation/error imperfection
More informationPrecept 4: Hypothesis Testing
Precept 4: Hypothesis Testing Soc 500: Applied Social Statistics Ian Lundberg Princeton University October 6, 2016 Learning Objectives 1 Introduce vectorized R code 2 Review homework and talk about RMarkdown
More information15 Discrete Distributions
Lecture Note 6 Special Distributions (Discrete and Continuous) MIT 4.30 Spring 006 Herman Bennett 5 Discrete Distributions We have already seen the binomial distribution and the uniform distribution. 5.
More informationIEOR 6711, HMWK 5, Professor Sigman
IEOR 6711, HMWK 5, Professor Sigman 1. Semi-Markov processes: Consider an irreducible positive recurrent discrete-time Markov chain {X n } with transition matrix P (P i,j ), i, j S, and finite state space.
More informationThe exponential distribution and the Poisson process
The exponential distribution and the Poisson process 1-1 Exponential Distribution: Basic Facts PDF f(t) = { λe λt, t 0 0, t < 0 CDF Pr{T t) = 0 t λe λu du = 1 e λt (t 0) Mean E[T] = 1 λ Variance Var[T]
More informationECE 302, Final 3:20-5:20pm Mon. May 1, WTHR 160 or WTHR 172.
ECE 302, Final 3:20-5:20pm Mon. May 1, WTHR 160 or WTHR 172. 1. Enter your name, student ID number, e-mail address, and signature in the space provided on this page, NOW! 2. This is a closed book exam.
More informationHow does the computer generate observations from various distributions specified after input analysis?
1 How does the computer generate observations from various distributions specified after input analysis? There are two main components to the generation of observations from probability distributions.
More informationProbability and Statistics Concepts
University of Central Florida Computer Science Division COT 5611 - Operating Systems. Spring 014 - dcm Probability and Statistics Concepts Random Variable: a rule that assigns a numerical value to each
More informationVariance reduction techniques
Variance reduction techniques Lecturer: Dmitri A. Moltchanov E-mail: moltchan@cs.tut.fi http://www.cs.tut.fi/kurssit/elt-53606/ OUTLINE: Simulation with a given accuracy; Variance reduction techniques;
More informationSources of randomness
Random Number Generator Chapter 7 In simulations, we generate random values for variables with a specified distribution Ex., model service times using the exponential distribution Generation of random
More informationHand Simulations. Christos Alexopoulos and Dave Goldsman 9/2/14. Georgia Institute of Technology, Atlanta, GA, USA 1 / 26
1 / 26 Hand Simulations Christos Alexopoulos and Dave Goldsman Georgia Institute of Technology, Atlanta, GA, USA 9/2/14 2 / 26 Outline 1 Monte Carlo Integration 2 Making Some π 3 Single-Server Queue 4
More informationOptional Stopping Theorem Let X be a martingale and T be a stopping time such
Plan Counting, Renewal, and Point Processes 0. Finish FDR Example 1. The Basic Renewal Process 2. The Poisson Process Revisited 3. Variants and Extensions 4. Point Processes Reading: G&S: 7.1 7.3, 7.10
More informationContinuous random variables
Continuous random variables Continuous r.v. s take an uncountably infinite number of possible values. Examples: Heights of people Weights of apples Diameters of bolts Life lengths of light-bulbs We cannot
More informationt x 1 e t dt, and simplify the answer when possible (for example, when r is a positive even number). In particular, confirm that EX 4 = 3.
Mathematical Statistics: Homewor problems General guideline. While woring outside the classroom, use any help you want, including people, computer algebra systems, Internet, and solution manuals, but mae
More informationRandom Number Generation. CS1538: Introduction to simulations
Random Number Generation CS1538: Introduction to simulations Random Numbers Stochastic simulations require random data True random data cannot come from an algorithm We must obtain it from some process
More information2. Variance and Covariance: We will now derive some classic properties of variance and covariance. Assume real-valued random variables X and Y.
CS450 Final Review Problems Fall 08 Solutions or worked answers provided Problems -6 are based on the midterm review Identical problems are marked recap] Please consult previous recitations and textbook
More informationUniversity of Illinois ECE 313: Final Exam Fall 2014
University of Illinois ECE 313: Final Exam Fall 2014 Monday, December 15, 2014, 7:00 p.m. 10:00 p.m. Sect. B, names A-O, 1013 ECE, names P-Z, 1015 ECE; Section C, names A-L, 1015 ECE; all others 112 Gregory
More informationBEST TESTS. Abstract. We will discuss the Neymann-Pearson theorem and certain best test where the power function is optimized.
BEST TESTS Abstract. We will discuss the Neymann-Pearson theorem and certain best test where the power function is optimized. 1. Most powerful test Let {f θ } θ Θ be a family of pdfs. We will consider
More informationHW7 Solutions. f(x) = 0 otherwise. 0 otherwise. The density function looks like this: = 20 if x [10, 90) if x [90, 100]
HW7 Solutions. 5 pts.) James Bond James Bond, my favorite hero, has again jumped off a plane. The plane is traveling from from base A to base B, distance km apart. Now suppose the plane takes off from
More informationEECS 126 Probability and Random Processes University of California, Berkeley: Fall 2014 Kannan Ramchandran November 13, 2014.
EECS 126 Probability and Random Processes University of California, Berkeley: Fall 2014 Kannan Ramchandran November 13, 2014 Midterm Exam 2 Last name First name SID Rules. DO NOT open the exam until instructed
More information3. Poisson Processes (12/09/12, see Adult and Baby Ross)
3. Poisson Processes (12/09/12, see Adult and Baby Ross) Exponential Distribution Poisson Processes Poisson and Exponential Relationship Generalizations 1 Exponential Distribution Definition: The continuous
More informationChapter 4 Continuous Random Variables and Probability Distributions
Chapter 4 Continuous Random Variables and Probability Distributions Part 3: The Exponential Distribution and the Poisson process Section 4.8 The Exponential Distribution 1 / 21 Exponential Distribution
More information1 Continuous-time chains, finite state space
Université Paris Diderot 208 Markov chains Exercises 3 Continuous-time chains, finite state space Exercise Consider a continuous-time taking values in {, 2, 3}, with generator 2 2. 2 2 0. Draw the diagramm
More information1 st Midterm Exam Solution. Question #1: Student s Number. Student s Name. Answer the following with True or False:
1 st Midterm Exam Solution اس تعن ابهلل وكن عىل يقني بأ ن لك ما ورد يف هذه الورقة تعرفه جيدا وقد تدربت عليه مبا فيه الكفاية Student s Name Student s Number Question #1: Answer the following with True or
More informationM/G/1 and M/G/1/K systems
M/G/1 and M/G/1/K systems Dmitri A. Moltchanov dmitri.moltchanov@tut.fi http://www.cs.tut.fi/kurssit/elt-53606/ OUTLINE: Description of M/G/1 system; Methods of analysis; Residual life approach; Imbedded
More informationStatistics 253/317 Introduction to Probability Models. Winter Midterm Exam Monday, Feb 10, 2014
Statistics 253/317 Introduction to Probability Models Winter 2014 - Midterm Exam Monday, Feb 10, 2014 Student Name (print): (a) Do not sit directly next to another student. (b) This is a closed-book, closed-note
More informationIndependent Events. Two events are independent if knowing that one occurs does not change the probability of the other occurring
Independent Events Two events are independent if knowing that one occurs does not change the probability of the other occurring Conditional probability is denoted P(A B), which is defined to be: P(A and
More informationExponential Distribution and Poisson Process
Exponential Distribution and Poisson Process Stochastic Processes - Lecture Notes Fatih Cavdur to accompany Introduction to Probability Models by Sheldon M. Ross Fall 215 Outline Introduction Exponential
More informationInterlude: Practice Final
8 POISSON PROCESS 08 Interlude: Practice Final This practice exam covers the material from the chapters 9 through 8. Give yourself 0 minutes to solve the six problems, which you may assume have equal point
More information7 Variance Reduction Techniques
7 Variance Reduction Techniques In a simulation study, we are interested in one or more performance measures for some stochastic model. For example, we want to determine the long-run average waiting time,
More informationSOLUTIONS IEOR 3106: Second Midterm Exam, Chapters 5-6, November 8, 2012
SOLUTIONS IEOR 3106: Second Midterm Exam, Chapters 5-6, November 8, 2012 This exam is closed book. YOU NEED TO SHOW YOUR WORK. Honor Code: Students are expected to behave honorably, following the accepted
More information57:022 Principles of Design II Final Exam Solutions - Spring 1997
57:022 Principles of Design II Final Exam Solutions - Spring 1997 Part: I II III IV V VI Total Possible Pts: 52 10 12 16 13 12 115 PART ONE Indicate "+" if True and "o" if False: + a. If a component's
More informationEECS 126 Probability and Random Processes University of California, Berkeley: Spring 2018 Kannan Ramchandran February 14, 2018.
EECS 126 Probability and Random Processes University of California, Berkeley: Spring 2018 Kannan Ramchandran February 14, 2018 Midterm 1 Last Name First Name SID You have 10 minutes to read the exam and
More informationIEOR 3106: Second Midterm Exam, Chapters 5-6, November 7, 2013
IEOR 316: Second Midterm Exam, Chapters 5-6, November 7, 13 SOLUTIONS Honor Code: Students are expected to behave honorably, following the accepted code of academic honesty. You may keep the exam itself.
More information1 Exercises for lecture 1
1 Exercises for lecture 1 Exercise 1 a) Show that if F is symmetric with respect to µ, and E( X )
More informationVerification and Validation. CS1538: Introduction to Simulations
Verification and Validation CS1538: Introduction to Simulations Steps in a Simulation Study Problem & Objective Formulation Model Conceptualization Data Collection Model translation, Verification, Validation
More informationProbabilities & Statistics Revision
Probabilities & Statistics Revision Christopher Ting Christopher Ting http://www.mysmu.edu/faculty/christophert/ : christopherting@smu.edu.sg : 6828 0364 : LKCSB 5036 January 6, 2017 Christopher Ting QF
More informationSTAT 135 Lab 11 Tests for Categorical Data (Fisher s Exact test, χ 2 tests for Homogeneity and Independence) and Linear Regression
STAT 135 Lab 11 Tests for Categorical Data (Fisher s Exact test, χ 2 tests for Homogeneity and Independence) and Linear Regression Rebecca Barter April 20, 2015 Fisher s Exact Test Fisher s Exact Test
More informationNonparametric hypothesis tests and permutation tests
Nonparametric hypothesis tests and permutation tests 1.7 & 2.3. Probability Generating Functions 3.8.3. Wilcoxon Signed Rank Test 3.8.2. Mann-Whitney Test Prof. Tesler Math 283 Fall 2018 Prof. Tesler Wilcoxon
More informationThis does not cover everything on the final. Look at the posted practice problems for other topics.
Class 7: Review Problems for Final Exam 8.5 Spring 7 This does not cover everything on the final. Look at the posted practice problems for other topics. To save time in class: set up, but do not carry
More informationReview. DS GA 1002 Statistical and Mathematical Models. Carlos Fernandez-Granda
Review DS GA 1002 Statistical and Mathematical Models http://www.cims.nyu.edu/~cfgranda/pages/dsga1002_fall16 Carlos Fernandez-Granda Probability and statistics Probability: Framework for dealing with
More informationChapter 5. Statistical Models in Simulations 5.1. Prof. Dr. Mesut Güneş Ch. 5 Statistical Models in Simulations
Chapter 5 Statistical Models in Simulations 5.1 Contents Basic Probability Theory Concepts Discrete Distributions Continuous Distributions Poisson Process Empirical Distributions Useful Statistical Models
More informationSince 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.
IEOR 46: Introduction to Operations Research: Stochastic Models Chapters 5-6 in Ross, Thursday, April, 4:5-5:35pm SOLUTIONS to Second Midterm Exam, Spring 9, Open Book: but only the Ross textbook, the
More informationSolutions to Homework Discrete Stochastic Processes MIT, Spring 2011
Exercise 6.5: Solutions to Homework 0 6.262 Discrete Stochastic Processes MIT, Spring 20 Consider the Markov process illustrated below. The transitions are labelled by the rate q ij at which those transitions
More informationQ = (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?
IEOR 4106: Introduction to Operations Research: Stochastic Models Spring 2005, Professor Whitt, Second Midterm Exam Chapters 5-6 in Ross, Thursday, March 31, 11:00am-1:00pm Open Book: but only the Ross
More informationIEOR 6711: Stochastic Models I, Fall 2003, Professor Whitt. Solutions to Final Exam: Thursday, December 18.
IEOR 6711: Stochastic Models I, Fall 23, Professor Whitt Solutions to Final Exam: Thursday, December 18. Below are six questions with several parts. Do as much as you can. Show your work. 1. Two-Pump Gas
More informationB. Maddah INDE 504 Discrete-Event Simulation. Output Analysis (1)
B. Maddah INDE 504 Discrete-Event Simulation Output Analysis (1) Introduction The basic, most serious disadvantage of simulation is that we don t get exact answers. Two different runs of the same model
More informationOnline Supplement to Are Call Center and Hospital Arrivals Well Modeled by Nonhomogeneous Poisson Processes?
Online Supplement to Are Call Center and Hospital Arrivals Well Modeled by Nonhomogeneous Poisson Processes? Song-Hee Kim and Ward Whitt Industrial Engineering and Operations Research Columbia University
More information2. Two binary operations (addition, denoted + and multiplication, denoted
Chapter 2 The Structure of R The purpose of this chapter is to explain to the reader why the set of real numbers is so special. By the end of this chapter, the reader should understand the difference between
More informationProbability Distributions
02/07/07 PHY310: Statistical Data Analysis 1 PHY310: Lecture 05 Probability Distributions Road Map The Gausssian Describing Distributions Expectation Value Variance Basic Distributions Generating Random
More informationComputer Science, Informatik 4 Communication and Distributed Systems. Simulation. Discrete-Event System Simulation. Dr.
Simulation Discrete-Event System Simulation Chapter 0 Output Analysis for a Single Model Purpose Objective: Estimate system performance via simulation If θ is the system performance, the precision of the
More informationChi Square Analysis M&M Statistics. Name Period Date
Chi Square Analysis M&M Statistics Name Period Date Have you ever wondered why the package of M&Ms you just bought never seems to have enough of your favorite color? Or, why is it that you always seem
More informationCONTINUOUS RANDOM VARIABLES
the Further Mathematics network www.fmnetwork.org.uk V 07 REVISION SHEET STATISTICS (AQA) CONTINUOUS RANDOM VARIABLES The main ideas are: Properties of Continuous Random Variables Mean, Median and Mode
More informationEEC 686/785 Modeling & Performance Evaluation of Computer Systems. Lecture 19
EEC 686/785 Modeling & Performance Evaluation of Computer Systems Lecture 19 Department of Electrical and Computer Engineering Cleveland State University wenbing@ieee.org (based on Dr. Raj Jain s lecture
More informationContinuous Distributions
Chapter 3 Continuous Distributions 3.1 Continuous-Type Data In Chapter 2, we discuss random variables whose space S contains a countable number of outcomes (i.e. of discrete type). In Chapter 3, we study
More informationTest Code: STA/STB (Short Answer Type) 2013 Junior Research Fellowship for Research Course in Statistics
Test Code: STA/STB (Short Answer Type) 2013 Junior Research Fellowship for Research Course in Statistics The candidates for the research course in Statistics will have to take two shortanswer type tests
More informationQueueing Review. Christos Alexopoulos and Dave Goldsman 10/25/17. (mostly from BCNN) Georgia Institute of Technology, Atlanta, GA, USA
1 / 26 Queueing Review (mostly from BCNN) Christos Alexopoulos and Dave Goldsman Georgia Institute of Technology, Atlanta, GA, USA 10/25/17 2 / 26 Outline 1 Introduction 2 Queueing Notation 3 Transient
More informationChapter 11. Output Analysis for a Single Model Prof. Dr. Mesut Güneş Ch. 11 Output Analysis for a Single Model
Chapter Output Analysis for a Single Model. Contents Types of Simulation Stochastic Nature of Output Data Measures of Performance Output Analysis for Terminating Simulations Output Analysis for Steady-state
More informationIE 303 Discrete-Event Simulation L E C T U R E 6 : R A N D O M N U M B E R G E N E R A T I O N
IE 303 Discrete-Event Simulation L E C T U R E 6 : R A N D O M N U M B E R G E N E R A T I O N Review of the Last Lecture Continuous Distributions Uniform distributions Exponential distributions and memoryless
More information18.05 Final Exam. Good luck! Name. No calculators. Number of problems 16 concept questions, 16 problems, 21 pages
Name No calculators. 18.05 Final Exam Number of problems 16 concept questions, 16 problems, 21 pages Extra paper If you need more space we will provide some blank paper. Indicate clearly that your solution
More informationRecap. Probability, stochastic processes, Markov chains. ELEC-C7210 Modeling and analysis of communication networks
Recap Probability, stochastic processes, Markov chains ELEC-C7210 Modeling and analysis of communication networks 1 Recap: Probability theory important distributions Discrete distributions Geometric distribution
More informationMore on Input Distributions
More on Input Distributions Importance of Using the Correct Distribution Replacing a distribution with its mean Arrivals Waiting line Processing order System Service mean interarrival time = 1 minute mean
More informationStochastic Simulation of
Stochastic Simulation of Communication Networks -WS 2014/2015 Part 2 Random Number Generation Prof. Dr. C. Görg www.comnets.uni-bremen.de VSIM 2-1 Table of Contents 1 General Introduction 2 Random Number
More information2008 Winton. Statistical Testing of RNGs
1 Statistical Testing of RNGs Criteria for Randomness For a sequence of numbers to be considered a sequence of randomly acquired numbers, it must have two basic statistical properties: Uniformly distributed
More informationAsymptotic Statistics-III. Changliang Zou
Asymptotic Statistics-III Changliang Zou The multivariate central limit theorem Theorem (Multivariate CLT for iid case) Let X i be iid random p-vectors with mean µ and and covariance matrix Σ. Then n (
More informationThe Chi-Square Distributions
MATH 183 The Chi-Square Distributions Dr. Neal, WKU The chi-square distributions can be used in statistics to analyze the standard deviation σ of a normally distributed measurement and to test the goodness
More informationECE353: Probability and Random Processes. Lecture 18 - Stochastic Processes
ECE353: Probability and Random Processes Lecture 18 - Stochastic Processes Xiao Fu School of Electrical Engineering and Computer Science Oregon State University E-mail: xiao.fu@oregonstate.edu From RV
More informationGuidelines for Solving Probability Problems
Guidelines for Solving Probability Problems CS 1538: Introduction to Simulation 1 Steps for Problem Solving Suggested steps for approaching a problem: 1. Identify the distribution What distribution does
More informationChapter 5 continued. Chapter 5 sections
Chapter 5 sections Discrete univariate distributions: 5.2 Bernoulli and Binomial distributions Just skim 5.3 Hypergeometric distributions 5.4 Poisson distributions Just skim 5.5 Negative Binomial distributions
More informationIEOR 4106: Spring Solutions to Homework Assignment 7: Due on Tuesday, March 22.
IEOR 46: Spring Solutions to Homework Assignment 7: Due on Tuesday, March. More of Chapter 5: Read the rest of Section 5.3, skipping Examples 5.7 (Coupon Collecting), 5. (Insurance claims)and Subsection
More informationTHE ROYAL STATISTICAL SOCIETY GRADUATE DIPLOMA
THE ROYAL STATISTICAL SOCIETY 4 EXAINATIONS SOLUTIONS GRADUATE DIPLOA PAPER I STATISTICAL THEORY & ETHODS The Societ provides these solutions to assist candidates preparing for the examinations in future
More information[y i α βx i ] 2 (2) Q = i=1
Least squares fits This section has no probability in it. There are no random variables. We are given n points (x i, y i ) and want to find the equation of the line that best fits them. We take the equation
More information