Simulation and Random Number Generation
|
|
- Todd Norman
- 6 years ago
- Views:
Transcription
1 Smulaton and Random Number Generaton Summary Dscrete Tme vs Dscrete Event Smulaton Random number generaton Generatng a random sequence Generatng random varates from a Unform dstrbuton Testng the qualty of the random number generator Some probablty results Evaluatng ntegrals usng Monte-Carlo smulaton Generatng random numbers from varous dstrbutons Generatng dscrete random varates from a gven pmf Generatng contnuous random varates from a gven dstrbuton
2 Dscrete Tme vs. Dscrete Event Smulaton Solve the fnte dfference equaton x = mn, x +.x + log x + u { } k+ k k k k Gven the ntal condtons x, x - and the nput functon u k, k=,, we can smulate the output! Ths s a tme drven smulaton. For the systems we are nterested n, ths method has two man problems. x(k) k Issues wth Tme-Drven Smulaton System Input System Dynamcs f parcel arrves at t u () t = otherwse f truck arrves at t u2 () t = otherwse u (t) xt () + f u() t =, u2() t =, + xt ( ) = xt () f u() t =, u2() t = xt () otherwse t u 2 (t) x(t) Ineffcent: At most steps nothng happens Accuracy: Event order n each nterval t t t
3 Tme Drven vs. Event Drven Smulaton Models Tme Drven Dynamcs Event Drven Dynamcs xt () + f u() t =, u2() t =, + xt ( ) = xt () f u() t =, u2() t = xt ( ) otherwse f ( x, e ) x+ f e = a = x f e = d In ths case, tme s dvded n ntervals of length t, and the state s updated at every step State s updated only at the occurrence of a dscrete event Pseudo-Random Number Generaton It s dffcult to construct a truly random number generator. Random number generators consst of a sequence of determnstcally generated numbers that look random. A determnstc sequence can never be truly random. Ths property, though seemngly problematc, s actually desrable because t s possble to reproduce the results of an experment! Multplcatve Congruental Method x k+ = a x k modulo m The constants a and m should follow the followng crtera For any ntal seed x, the resultant sequence should look lke random For any ntal seed, the perod (number of varables that can be generated before repetton) should be large. The value can be computed effcently on a dgtal computer.
4 Pseudo-Random Number Generaton To ft the above requrements, m should be chosen to be a large prme number. Good choces for parameters are m= and a=7 5 for 32-bt word machnes m= and a=5 5 for 36-bt word machnes Mxed Congruental Method x k+ =(a x k + c) modulo m A more general form: n xk = ax j k j mod m j= where n s a postve constant x k /m maps the random varates n the nterval [,) Qualty of the Random Number Generator (RNG) The random varate u k =x k /m should be unformly dstrbuted n the nterval [,). Dvde the nterval [,) nto k subntervals and count the number of varates that fall wthn each nterval. Run the ch-square test. The sequence of random varates should be uncorrelated Defne the auto-correlaton coeffcent wth lag k > C k and verfy that E[C k ] approached for all k=,2, n k ( )( ) Ck = u u 2 + k 2 n k = where u s the random varate n the nterval [,).
5 Some Probablty Revew/Results Probablty mass functons Cumulatve mass functons Pr{=}=p F ( x) = Pr{ x} Pr{=2}=p x 2 Pr{=3}=p = Pr 3 { = } = 2 3 p + p 2 + p 3 = { } Pr = = p + p 2 p 2 3 Some Probablty Results/Revew Probablty densty functons Cumulatve dstrbuton f (x) ( x) = Pr{ } F x Pr{x=x }=! x x x = f ( y) dy Pr { x ε x ε} + = x + ε = x ε f ( x) dx F (x) x
6 Independence of Random Varables Jont cumulatve probablty dstrbuton. { } F ( x, y) = Pr x, Y y Y Independent Random Varables. { C Y D} = { C} { Y D} Pr, Pr Pr For dscrete varables { = x Y = y} = { = x} { Y = y} Pr, Pr Pr For contnuous varables f ( x, y) = f ( x) f ( y) F ( x, y) = F ( x) F ( y) Y Y Y Y Condtonal Probablty Condtonal probablty for two events. Bayes Rule. { A B} Pr { } { A} Total Probablty = Pr Pr { AB} { B} { = x} = { = x Y = y } { Y = y } Pr Pr Pr k k { } { } Pr{ B} Pr AB Pr B A Pr A Pr { B A} = Pr { A B} = Pr k
7 Expectaton and Varance Expected value of a random varable E [ ] = x Pr{ = x} = E [ ] = xf ( xdx ) Expected value of a functon of a random varable E[ g ( )] = g( x )Pr{ = x} = Varance of a random varable var[ ] = E E[ ] E [ g ( )] = g( x) f ( xdx ) ( ) 2 Covarance of two random varables The covarance between two random varables s defned as cov [ Y, ] = E ( E[ ] )( Y E[ Y] ) [ ] = [ [ ] [ ] + [ ] [ ]] cov Y, E Y E Y YE E E Y = E[ Y ] E[ ] E[ Y ] The covarance between two ndependent random varables s (why?) [ Y ] = j Pr { =, = j} E x y x Y y j { } Pr{ } [ ] [ Y ] = x Pr = x y Y = y = E E j j j
8 Markov Inequalty If the random varable takes only non-negatve values, then for any value a >. Pr { a} E [ ] a Note that for any value <a < E[], the above nequalty says nothng! Chebyshev s Inequalty If s a random varable havng mean µ and varance σ 2, then for any value k >. Pr { µ kσ} 2 σ k f (x) kσ Ths may be a very conservatve bound! Note that for ~N(,σ 2 ), for k=2, from Chebyshev s nequalty Pr{.}<.25, when n fact the actual value s Pr{.}<.5 µ kσ x
9 The Law of Large Numbers Weak: Let, 2, be a sequence of ndependent and dentcally dstrbuted random varables havng mean µ. Then, for any ε > Pr n µ > ε, as n n Strong: wth probablty, lm n n n = µ The Central Lmt Theorem Let, 2, n be a sequence of ndependent random varables wth mean µ and varance σ ι2. Then, defne the random varable, Let σ = n = E[ ] = E[ n] = µ µ 2 n 2 ( µ ) 2 = E = σι Then, the dstrbuton of approaches the normal dstrbuton as n ncreases, and f are contnuous, then f ( x) e 2π = ( x µ ) 2 /2σ n =
10 Ch-Square Test Let k be the number of subntervals, thus p =/k, =,,k. Let N be the number of samples n each subnterval. Note that E[N ]=Np where N s the total number of samples Null Hypothess H : The probablty that the observed random varates are ndeed unformly dstrbuted n (,). Let T be k k 2 k ( ) = = N T = N Np = N Np N k Defne p-value= P H {T>t} ndcate the probablty of observng a value t assumng H s correct. For large N, T s approxmated by a ch-square dstrbuton wth k- degrees of freedom, thus we can use ths approxmaton to evaluate the p-value The H s accepted f p-value s greater than.5 or. 2 Monte-Carlo Approach to Evaluatng Integrals Suppose that you want to estmate θ, however t s rather dffcult to analytcally evaluate the ntegral. θ = g( x) dx Suppose also that you don t want to use numercal ntegraton. Let U be a unformly dstrbuted random varable n the nterval [,) and u are random varates of the same dstrbuton. Consder the followng estmator. n ˆ θ = g u n = ( ) Also note that: E[ g ( U )] as n [ ] θ = g( u) du = E g ( U ) Strong Law of Large Numbers
11 Monte-Carlo Approach to Evaluatng Integrals Use Monte-Carlo smulaton to estmate the followng b ntegral. θ = g( x) dx a Let y=(x-a)/(b-a), then the ntegral becomes θ = ( b a) g ( b a) y+ a dy = h y dy What f θ = g( x) dx Use the substtuton y= /(+x), ( ) ( ) What f ( ) θ =... g x,..., x dx... dx n n Example: Estmate the value of π. (-,) Area of Crcle π = Area of square 4 (,) (-,-) (,-) SOLUTION Let, Y, be ndependent random varables unformly dstrbuted n the nterval [-,] The probablty that a pont (,Y) falls n the crcle s gven by 2 2 π Pr{ + Y } = 4 Generate N pars of unformly dstrbuted random varates (u,u 2 ) n the nterval [,). Transform them to become unform over the nterval [-,), usng (2u -,2u 2 -). Form the rato of the number of ponts that fall n the crcle over N
12 Dscrete Random Varates Suppose we would lke to generate a sequence of dscrete random varates accordng to a probablty mass functon N Pr = x = p, j =,,..., N, p = u { } Inverse Transform Method j j j j= x x f u p x f p u p + p M M = j j xj f p u p = = M M Dscrete Random Varate Algorthm (D-RNG-) Algorthm D-RNG- Generate u=u(,) If u<p, set =x, return; If u<p +p, set =x, return; Set =x n, return; Recall the requrement for effcent mplementaton, thus the above search algorthm should be made as effcent as possble! Example: Suppose that {,,,n} and p = p = = p n = /(n+), then = ( n + ) u
13 Dscrete Random Varate Algorthm Assume p =., p =.2, p 2 =.4, p 3 =.3. What s an effcent RNG? D-RNG-: Verson Generate u=u(,) If u<., set =x, return; If u<.3, set =x, return; If u<.7, set =x2, return; Set =x3, return; D-RNG-: Verson 2 Generate u=u(,) If u<.4, set =x2, return; If u<.7, set =x3, return; If u<.9, set =x, return; Set =x, return; More Effcent Geometrc Random Varables Let p the probablty of success and q=-p the probablty of falure, then s the tme of the frst success wth pmf Pr{ = } = pq Usng the prevous dscrete random varate algorthm, =j f j = j Pr { = } U < Pr{ = } = = j { } { } Pr = = Pr > j = q { j } = mn j: q < U { ( ) ( )} = mn j: jlog q < log U log ( U ) = mn j: j > log ( q) j As a result: j < q U q j j q < U q log ( U ) = + log ( q) j
14 Posson and Bnomal Dstrbutons Posson Dstrbuton wth rate λ. { } λ e λ Pr = =, =,,...! λ Note: p = p + + The bnomal dstrbuton (n,p) gves the number of successes n n trals gven that the probablty of success s p. n! n Pr { = } = p ( p), =,,..., n! ( n )! Note: p+ = n p p + p Accept/Reject Method (D-RNG-AR) Suppose that we would lke to generate random varates from a pmf {p j, j } and we have an effcent way to generate varates from a pmf {q j, j }. Let a constant c such that p j c for all j such that pj q > j In ths case, use the followng algorthm D-RNG-AR:. Generate a random varate Y from pmf {q j, j }. 2. Generate u=u(,) 3. If u< py/(cqy), set =Y and return; 4. Else repeat from Step.
15 Accept/Reject Method (D-RNG-AR) Show that the D-RNG-AR algorthm generates a random varate wth the requred pmf {p j, j }. p = Pr{ = } = Pr{ not stop for,..., k } Pr { = and stop at teraton k} k = { = k} = p p { = Y = } { Y = } { Y = } = = Pr and stop after Pr and s accepted Pr Y accepted Pr p /cq q Pr{ Not stop up to k } = Pr Y not accepted Y = j Pr Y = j j k k p j = q j = j cq j c Therefore k p p = = p c c k = { } { } q cq k c D-RNG-AR Example Determne an algorthm for generatng random varates for a random varable that take values,2,.., wth probabltes.,.2,.9,.8,.2,.,.9,.9,.,. respectvely. p c = max =.2 q D-RNG-: Generate u=u(,) k=; whle(u >cdf(k)) k=k+; x()=k; D-RNG-AR: u=u(,), u2=u(,) Y=floor(*u + ); whle(u2 > p(y)/c) u= U(,); u2=u(,); Y=floor(*rand + ); y()=y;
16 The Composton Approach Suppose that we have an effcent way to generate varates from two pmfs {q j, j } and {r j, j } Suppose that we would lke to generate random varates for a random varable havng pmf, a (,). { } Pr = j = p = aq + ( a) r, j j j j Let have pmf {q j, j } and 2 have pmf {r j, j } and defne wth probablty a = 2 wth probablty - a Algorthm D-RNG-C: Generate u=u(,) If u <= a generate Else generate 2 Contnuous Random Varates Inverse Transform Method Suppose we would lke to generate a sequence of contnuous random varates havng densty functon F (x) Algorthm C-RNG-: Let U be a random varable unformly dstrbuted n the nterval (,). For any contnuous dstrbuton functon, the random varate s gven by = F ( U ) F (x) u x
17 Example: Exponentally Dstrbuted Random Varable Suppose we would lke to generate a sequence of random varates havng densty functon Soluton f x ( x) = λe λ Fnd the cumulatve dstrbuton x λ y F ( x) = λe dy = e Let a unformly dstrbuted random varable u λx u = F ( x) = e ln ( u) = λx x = ln ( u) λ Equvalently, snce -u s also unformly dstrbuted n (,) x = ln ( u ) λ λx Convoluton Technques and the Erlang Dstrbuton Suppose the random varable s the sum of a number of ndependent dentcally dstrbuted random varables Algorthm C-RNG-Cv: n = Y = Generate Y,,Yn from the gven dstrbuton =Y+Y2+ +Yn. An example of such random varable s the Erlang wth order n whch s the sum of n d exponental random varables wth rate λ. n λx ( λx) e f ( x) = n!
18 Accept/Reject Method (C-RNG-AR) Suppose that we would lke to generate random varates from a pdf f (x) and we have an effcent way to generate varates from a pdf g (x). Let a constant c such that f ( x) for all g ( x) c x In ths case, use the followng algorthm C-RNG-AR:. Generate a random varate Y from densty g (x). 2. Generate u=u(,) 3. If u< f (Y)/(cg (Y)), set =Y and return; 4. Else repeat from Step. Accept/Reject Method (C-RNG-AR) The C-RNG-AR s smlar to the D-RNG-AR algorthm except the comparson step where rather than comparng the two probabltes we compare the values of the densty functons. Theorem The random varates generated by the Accept/Reject method have densty f (x). The number of teratons of the algorthm that are needed s a geometrc random varable wth mean c Note: The constant c s mportant snce s mples the number of teratons needed before a number s accepted, therefore t s requred that t s selected so that t has ts mnmum value.
19 C-RNG-AR Example Use the C-RNG-AR method to generate random varates that are normally dstrbuted wth mean and varance, N(,). Frst consder the pdf of the absolute value of. 2 2 x 2 f ( x) = e 2π We know how to generate exponentally dstrbuted random varates Y wth rate λ=. x g ( x) = e, x Y Determne c such that t s equal to the maxmum of the rato f ( ) 2 x 2 x x 2 = e 2e c = g ( x) 2π π Y C-RNG-AR Example C-RNG-AR for N(,): u=u(,), u2=u(,); Y= -log(u); whle(u2 > exp(-.5(y-)*(y-))) u= U(,); u2=u(,); Y= -log(u); u3= U(,); If u3 <.5 =Y; Else = -Y; Suppose we would lke Z~N(µ, σ 2 ), then Z : = σ + µ
20 Generatng a Homogeneous Posson Processes A homogenous Posson process s a sequence of ponts (events) where the nter-even tmes are exponentally dstrbuted wth rate λ (The Posson process wll be studed n detal durng later classes) Let t denote the th pont of a Posson process, then the algorthm for generatng the frst N ponts of the sequence {t, =,2,,N} s gven by Algorthm Posson-λ: k=, t(k)=; Whle k<n k= k+; Generate u=u(,) t(k)= t(k-) log(u)/lambda; Return t. Generatng a Non-Homogeneous Posson Processes Suppose that the process s non-homogeneous.e., the rate vares wth tme,.e., λ(t) λ, for all t<t. Let t denote the th pont of a Posson process, and τ the actual tme, then the algorthm for generatng the frst N ponts of the sequence {t, =,2,,N} s gven by Algorthm Thnnng Posson-λ: k=, t(k)=, tau= ; Whle k<n Generate u=u(,); tau= tau log(u)/lambda; Generate u2= U(,); If(lambda(tau)\lambda < u2) k= k+, t(k)= tau; Return t.
21 Generatng a Non-Homogeneous Posson Processes Agan, suppose that the process s non-homogeneous.e., the rate vares wth tme,.e., λ(t) λ, for all t<t but now we would lke to generate all ponts t drectly, wthout thnnng. Assumng that we are at pont t, then the queston that we need to answer s what s the cdf of S where S s the tme untl the next event s = { < = } = exp λ ( t + ) F () s Pr S s t t S { } y dy Thus, to smulate ths process, we start from t and generate S from F S to go to t =t +S. Then, from t, we generate S 2 from F S2 to go to t 2 =t +S 2 and so on. Example of Non-Homogeneous Posson Processes Suppose that λ(t)= /(t+α), t, for some postve constant a. Generate varates from ths non-homogeneous Posson process. Frst, let us determne the rate of the cdf s s s + t + a λ ( t ) + y dy = dy = log ( a+ t + y) t a + s+ t + a t + a s F = exp log S = t + a = s + t + a s+ t + a Invertng ths yelds ( t + a) u F = S u
22 Example of Non-Homogeneous Posson Processes Inverse Transform F = ( t ) + S a u u Thus we start from t = ( t + a) u au t = t + = u u t 2 t ( ) u 2 t + a t + au = t + = u u 2 ( ) 2 2 t + a u t + au = t + = u u The Composton Approach Suppose that we have an effcent way to generate varates from cdfs G (x),, G n (x). Suppose that we would lke to generate random varates for a random varable havng cdf n F ( x) = rg ( x), r =, r >, =,..., n = = n Algorthm C-RNG-C: Generate u=u(,) If u<p, get from G(x), return; If u<p +p 2, get from G2(x), return;
23 Polar Method for Generatng Normal Random Varates Let and Y be ndependent normally dstrbuted random varables wth zero mean and varance. Then the jont densty functon s gven by 2 2 x y ( x + y ) fy ( x, y) = e e = e 2π 2π 2π Y R θ Then make a varable change r x y θ = 2 2 = + arctan y x The new jont densty functon s Unform n the nterval [,2π] frθ (, r θ ) = e 2π 2 2 r Exponental wth rate /2 Polar Method for Generatng Normal Random Varates Algorthm C-RNG-N: Generate u=u(,), u2=u(,); R= -2*log(u); W= 2*p*u2; = sqrt(r) cos(w); Y= sqrt(r) sn(w); But, sne and cosne evaluatons are neffcent! Algorthm C-RNG-N2:. Generate u=u(,), u2=u(,); 2. Set V= 2*u-, V2= 2*u2-; (-,) 3. S=V*V+V2*V2; 4. If S >, Go to 5. R= sqrt(-2*log(s)/s); 6. = R*V; 7. Y= R*V2; (-,-) Generates 2 ndependent RVs (V,V 2 ) (,) (,-)
24 Smulaton of Dscrete Event Systems INITIALIZE STATE Update State x =f(x,e ) EVENT CALENDAR e t e 2 t 2 TIME Update Tme t =t CLOCK STRUCTURE RNG Delete Infeasble Events Add New Feasble Events Verfcaton of a Smulaton Program Standard debuggng technques Debug modules or subroutnes Create smple specal cases, where you know what to expect as an output from each of the modules Often choosng carefully the system parameters, the smulaton model can be evaluated analytcally. Create a trace whch keeps track of the state varables, the event lst and other varables.
3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X
Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number
More informationProbability and Random Variable Primer
B. Maddah ENMG 622 Smulaton 2/22/ Probablty and Random Varable Prmer Sample space and Events Suppose that an eperment wth an uncertan outcome s performed (e.g., rollng a de). Whle the outcome of the eperment
More informationCS-433: Simulation and Modeling Modeling and Probability Review
CS-433: Smulaton and Modelng Modelng and Probablty Revew Exercse 1. (Probablty of Smple Events) Exercse 1.1 The owner of a camera shop receves a shpment of fve cameras from a camera manufacturer. Unknown
More informationANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U)
Econ 413 Exam 13 H ANSWERS Settet er nndelt 9 deloppgaver, A,B,C, som alle anbefales å telle lkt for å gøre det ltt lettere å stå. Svar er gtt . Unfortunately, there s a prntng error n the hnt of
More informationMarkov Chain Monte Carlo (MCMC), Gibbs Sampling, Metropolis Algorithms, and Simulated Annealing Bioinformatics Course Supplement
Markov Chan Monte Carlo MCMC, Gbbs Samplng, Metropols Algorthms, and Smulated Annealng 2001 Bonformatcs Course Supplement SNU Bontellgence Lab http://bsnuackr/ Outlne! Markov Chan Monte Carlo MCMC! Metropols-Hastngs
More informationj) = 1 (note sigma notation) ii. Continuous random variable (e.g. Normal distribution) 1. density function: f ( x) 0 and f ( x) dx = 1
Random varables Measure of central tendences and varablty (means and varances) Jont densty functons and ndependence Measures of assocaton (covarance and correlaton) Interestng result Condtonal dstrbutons
More informationFirst Year Examination Department of Statistics, University of Florida
Frst Year Examnaton Department of Statstcs, Unversty of Florda May 7, 010, 8:00 am - 1:00 noon Instructons: 1. You have four hours to answer questons n ths examnaton.. You must show your work to receve
More informationSuites of Tests. DIEHARD TESTS (Marsaglia, 1985) See
Sutes of Tests DIEHARD TESTS (Marsagla, 985 See http://stat.fsu.edu/~geo/dehard.html NIST Test sute- 6 tests on the sequences of bts http://csrc.nst.gov/rng/ Test U0 Includes the above tests. http://www.ro.umontreal.ca/~lecuyer/
More informationNotes prepared by Prof Mrs) M.J. Gholba Class M.Sc Part(I) Information Technology
Inverse transformatons Generaton of random observatons from gven dstrbutons Assume that random numbers,,, are readly avalable, where each tself s a random varable whch s unformly dstrbuted over the range(,).
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationSELECTED PROOFS. DeMorgan s formulas: The first one is clear from Venn diagram, or the following truth table:
SELECTED PROOFS DeMorgan s formulas: The frst one s clear from Venn dagram, or the followng truth table: A B A B A B Ā B Ā B T T T F F F F T F T F F T F F T T F T F F F F F T T T T The second one can be
More informationStrong Markov property: Same assertion holds for stopping times τ.
Brownan moton Let X ={X t : t R + } be a real-valued stochastc process: a famlty of real random varables all defned on the same probablty space. Defne F t = nformaton avalable by observng the process up
More informationRELIABILITY ASSESSMENT
CHAPTER Rsk Analyss n Engneerng and Economcs RELIABILITY ASSESSMENT A. J. Clark School of Engneerng Department of Cvl and Envronmental Engneerng 4a CHAPMAN HALL/CRC Rsk Analyss for Engneerng Department
More informationLecture Notes on Linear Regression
Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume
More informationRandomness and Computation
Randomness and Computaton or, Randomzed Algorthms Mary Cryan School of Informatcs Unversty of Ednburgh RC 208/9) Lecture 0 slde Balls n Bns m balls, n bns, and balls thrown unformly at random nto bns usually
More informationLimited Dependent Variables
Lmted Dependent Varables. What f the left-hand sde varable s not a contnuous thng spread from mnus nfnty to plus nfnty? That s, gven a model = f (, β, ε, where a. s bounded below at zero, such as wages
More informationMaximum Likelihood Estimation of Binary Dependent Variables Models: Probit and Logit. 1. General Formulation of Binary Dependent Variables Models
ECO 452 -- OE 4: Probt and Logt Models ECO 452 -- OE 4 Maxmum Lkelhood Estmaton of Bnary Dependent Varables Models: Probt and Logt hs note demonstrates how to formulate bnary dependent varables models
More informationCS 798: Homework Assignment 2 (Probability)
0 Sample space Assgned: September 30, 2009 In the IEEE 802 protocol, the congeston wndow (CW) parameter s used as follows: ntally, a termnal wats for a random tme perod (called backoff) chosen n the range
More informationProbability Theory (revisited)
Probablty Theory (revsted) Summary Probablty v.s. plausblty Random varables Smulaton of Random Experments Challenge The alarm of a shop rang. Soon afterwards, a man was seen runnng n the street, persecuted
More informationPredictive Analytics : QM901.1x Prof U Dinesh Kumar, IIMB. All Rights Reserved, Indian Institute of Management Bangalore
Sesson Outlne Introducton to classfcaton problems and dscrete choce models. Introducton to Logstcs Regresson. Logstc functon and Logt functon. Maxmum Lkelhood Estmator (MLE) for estmaton of LR parameters.
More informationProbability Theory. The nth coefficient of the Taylor series of f(k), expanded around k = 0, gives the nth moment of x as ( ik) n n!
8333: Statstcal Mechancs I Problem Set # 3 Solutons Fall 3 Characterstc Functons: Probablty Theory The characterstc functon s defned by fk ep k = ep kpd The nth coeffcent of the Taylor seres of fk epanded
More informationCHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE
CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng
More informationConvergence of random processes
DS-GA 12 Lecture notes 6 Fall 216 Convergence of random processes 1 Introducton In these notes we study convergence of dscrete random processes. Ths allows to characterze phenomena such as the law of large
More information10.34 Fall 2015 Metropolis Monte Carlo Algorithm
10.34 Fall 2015 Metropols Monte Carlo Algorthm The Metropols Monte Carlo method s very useful for calculatng manydmensonal ntegraton. For e.g. n statstcal mechancs n order to calculate the prospertes of
More informationMaximum Likelihood Estimation of Binary Dependent Variables Models: Probit and Logit. 1. General Formulation of Binary Dependent Variables Models
ECO 452 -- OE 4: Probt and Logt Models ECO 452 -- OE 4 Mamum Lkelhood Estmaton of Bnary Dependent Varables Models: Probt and Logt hs note demonstrates how to formulate bnary dependent varables models for
More informationModeling and Simulation NETW 707
Modelng and Smulaton NETW 707 Lecture 5 Tests for Random Numbers Course Instructor: Dr.-Ing. Magge Mashaly magge.ezzat@guc.edu.eg C3.220 1 Propertes of Random Numbers Random Number Generators (RNGs) must
More informationEcon107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)
I. Classcal Assumptons Econ7 Appled Econometrcs Topc 3: Classcal Model (Studenmund, Chapter 4) We have defned OLS and studed some algebrac propertes of OLS. In ths topc we wll study statstcal propertes
More informationChapter 2 Transformations and Expectations. , and define f
Revew for the prevous lecture Defnton: support set of a ranom varable, the monotone functon; Theorem: How to obtan a cf, pf (or pmf) of functons of a ranom varable; Eamples: several eamples Chapter Transformatons
More informationLecture 3: Probability Distributions
Lecture 3: Probablty Dstrbutons Random Varables Let us begn by defnng a sample space as a set of outcomes from an experment. We denote ths by S. A random varable s a functon whch maps outcomes nto the
More informationWhy Monte Carlo Integration? Introduction to Monte Carlo Method. Continuous Probability. Continuous Probability
Introducton to Monte Carlo Method Kad Bouatouch IRISA Emal: kad@rsa.fr Wh Monte Carlo Integraton? To generate realstc lookng mages, we need to solve ntegrals of or hgher dmenson Pel flterng and lens smulaton
More informationMATH 829: Introduction to Data Mining and Analysis The EM algorithm (part 2)
1/16 MATH 829: Introducton to Data Mnng and Analyss The EM algorthm (part 2) Domnque Gullot Departments of Mathematcal Scences Unversty of Delaware Aprl 20, 2016 Recall 2/16 We are gven ndependent observatons
More informationLecture 4: Universal Hash Functions/Streaming Cont d
CSE 5: Desgn and Analyss of Algorthms I Sprng 06 Lecture 4: Unversal Hash Functons/Streamng Cont d Lecturer: Shayan Oves Gharan Aprl 6th Scrbe: Jacob Schreber Dsclamer: These notes have not been subjected
More informationChapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems
Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons
More informationLecture 4 Hypothesis Testing
Lecture 4 Hypothess Testng We may wsh to test pror hypotheses about the coeffcents we estmate. We can use the estmates to test whether the data rejects our hypothess. An example mght be that we wsh to
More informationHere is the rationale: If X and y have a strong positive relationship to one another, then ( x x) will tend to be positive when ( y y)
Secton 1.5 Correlaton In the prevous sectons, we looked at regresson and the value r was a measurement of how much of the varaton n y can be attrbuted to the lnear relatonshp between y and x. In ths secton,
More information6. Stochastic processes (2)
Contents Markov processes Brth-death processes Lect6.ppt S-38.45 - Introducton to Teletraffc Theory Sprng 5 Markov process Consder a contnuous-tme and dscrete-state stochastc process X(t) wth state space
More informationApplied Stochastic Processes
STAT455/855 Fall 23 Appled Stochastc Processes Fnal Exam, Bref Solutons 1. (15 marks) (a) (7 marks) The dstrbuton of Y s gven by ( ) ( ) y 2 1 5 P (Y y) for y 2, 3,... The above follows because each of
More information6. Stochastic processes (2)
6. Stochastc processes () Lect6.ppt S-38.45 - Introducton to Teletraffc Theory Sprng 5 6. Stochastc processes () Contents Markov processes Brth-death processes 6. Stochastc processes () Markov process
More informationLecture 6 More on Complete Randomized Block Design (RBD)
Lecture 6 More on Complete Randomzed Block Desgn (RBD) Multple test Multple test The multple comparsons or multple testng problem occurs when one consders a set of statstcal nferences smultaneously. For
More informationParametric fractional imputation for missing data analysis. Jae Kwang Kim Survey Working Group Seminar March 29, 2010
Parametrc fractonal mputaton for mssng data analyss Jae Kwang Km Survey Workng Group Semnar March 29, 2010 1 Outlne Introducton Proposed method Fractonal mputaton Approxmaton Varance estmaton Multple mputaton
More informationHydrological statistics. Hydrological statistics and extremes
5--0 Stochastc Hydrology Hydrologcal statstcs and extremes Marc F.P. Berkens Professor of Hydrology Faculty of Geoscences Hydrologcal statstcs Mostly concernes wth the statstcal analyss of hydrologcal
More informationError Probability for M Signals
Chapter 3 rror Probablty for M Sgnals In ths chapter we dscuss the error probablty n decdng whch of M sgnals was transmtted over an arbtrary channel. We assume the sgnals are represented by a set of orthonormal
More informationSee Book Chapter 11 2 nd Edition (Chapter 10 1 st Edition)
Count Data Models See Book Chapter 11 2 nd Edton (Chapter 10 1 st Edton) Count data consst of non-negatve nteger values Examples: number of drver route changes per week, the number of trp departure changes
More informationb ), which stands for uniform distribution on the interval a x< b. = 0 elsewhere
Fall Analyss of Epermental Measurements B. Esensten/rev. S. Errede Some mportant probablty dstrbutons: Unform Bnomal Posson Gaussan/ormal The Unform dstrbuton s often called U( a, b ), hch stands for unform
More informationsince [1-( 0+ 1x1i+ 2x2 i)] [ 0+ 1x1i+ assumed to be a reasonable approximation
Econ 388 R. Butler 204 revsons Lecture 4 Dummy Dependent Varables I. Lnear Probablty Model: the Regresson model wth a dummy varables as the dependent varable assumpton, mplcaton regular multple regresson
More informationThe Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction
ECONOMICS 5* -- NOTE (Summary) ECON 5* -- NOTE The Multple Classcal Lnear Regresson Model (CLRM): Specfcaton and Assumptons. Introducton CLRM stands for the Classcal Lnear Regresson Model. The CLRM s also
More information( ) ( ) ( ) ( ) STOCHASTIC SIMULATION FOR BLOCKED DATA. Monte Carlo simulation Rejection sampling Importance sampling Markov chain Monte Carlo
SOCHASIC SIMULAIO FOR BLOCKED DAA Stochastc System Analyss and Bayesan Model Updatng Monte Carlo smulaton Rejecton samplng Importance samplng Markov chan Monte Carlo Monte Carlo smulaton Introducton: If
More informationMarkov Chain Monte Carlo Lecture 6
where (x 1,..., x N ) X N, N s called the populaton sze, f(x) f (x) for at least one {1, 2,..., N}, and those dfferent from f(x) are called the tral dstrbutons n terms of mportance samplng. Dfferent ways
More informationExercises of Chapter 2
Exercses of Chapter Chuang-Cheh Ln Department of Computer Scence and Informaton Engneerng, Natonal Chung Cheng Unversty, Mng-Hsung, Chay 61, Tawan. Exercse.6. Suppose that we ndependently roll two standard
More informationStat 543 Exam 2 Spring 2016
Stat 543 Exam 2 Sprng 206 I have nether gven nor receved unauthorzed assstance on ths exam. Name Sgned Date Name Prnted Ths Exam conssts of questons. Do at least 0 of the parts of the man exam. I wll score
More informationCS 2750 Machine Learning. Lecture 5. Density estimation. CS 2750 Machine Learning. Announcements
CS 750 Machne Learnng Lecture 5 Densty estmaton Mlos Hauskrecht mlos@cs.ptt.edu 539 Sennott Square CS 750 Machne Learnng Announcements Homework Due on Wednesday before the class Reports: hand n before
More information1. Inference on Regression Parameters a. Finding Mean, s.d and covariance amongst estimates. 2. Confidence Intervals and Working Hotelling Bands
Content. Inference on Regresson Parameters a. Fndng Mean, s.d and covarance amongst estmates.. Confdence Intervals and Workng Hotellng Bands 3. Cochran s Theorem 4. General Lnear Testng 5. Measures of
More informationISQS 6348 Final Open notes, no books. Points out of 100 in parentheses. Y 1 ε 2
ISQS 6348 Fnal Open notes, no books. Ponts out of 100 n parentheses. 1. The followng path dagram s gven: ε 1 Y 1 ε F Y 1.A. (10) Wrte down the usual model and assumptons that are mpled by ths dagram. Soluton:
More informationNUMERICAL DIFFERENTIATION
NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the
More informationMonte Carlo Simulation and Generation of Random Numbers
S-7.333 Postgraduate Course n Radocommuncatons Sprng 000 Monte Carlo Smulaton and Generaton of Random umbers Dmtr Foursov Dmtr.Foursov@noka.com Contents. Introducton. Prncple of Monte Carlo Smulaton 3.
More informationprinceton univ. F 13 cos 521: Advanced Algorithm Design Lecture 3: Large deviations bounds and applications Lecturer: Sanjeev Arora
prnceton unv. F 13 cos 521: Advanced Algorthm Desgn Lecture 3: Large devatons bounds and applcatons Lecturer: Sanjeev Arora Scrbe: Today s topc s devaton bounds: what s the probablty that a random varable
More informationEconomics 130. Lecture 4 Simple Linear Regression Continued
Economcs 130 Lecture 4 Contnued Readngs for Week 4 Text, Chapter and 3. We contnue wth addressng our second ssue + add n how we evaluate these relatonshps: Where do we get data to do ths analyss? How do
More informationEngineering Risk Benefit Analysis
Engneerng Rsk Beneft Analyss.55, 2.943, 3.577, 6.938, 0.86, 3.62, 6.862, 22.82, ESD.72, ESD.72 RPRA 2. Elements of Probablty Theory George E. Apostolaks Massachusetts Insttute of Technology Sprng 2007
More informationA be a probability space. A random vector
Statstcs 1: Probablty Theory II 8 1 JOINT AND MARGINAL DISTRIBUTIONS In Probablty Theory I we formulate the concept of a (real) random varable and descrbe the probablstc behavor of ths random varable by
More informationWhat would be a reasonable choice of the quantization step Δ?
CE 108 HOMEWORK 4 EXERCISE 1. Suppose you are samplng the output of a sensor at 10 KHz and quantze t wth a unform quantzer at 10 ts per sample. Assume that the margnal pdf of the sgnal s Gaussan wth mean
More informationTHE ROYAL STATISTICAL SOCIETY 2006 EXAMINATIONS SOLUTIONS HIGHER CERTIFICATE
THE ROYAL STATISTICAL SOCIETY 6 EXAMINATIONS SOLUTIONS HIGHER CERTIFICATE PAPER I STATISTICAL THEORY The Socety provdes these solutons to assst canddates preparng for the eamnatons n future years and for
More informationMATH 281A: Homework #6
MATH 28A: Homework #6 Jongha Ryu Due date: November 8, 206 Problem. (Problem 2..2. Soluton. If X,..., X n Bern(p, then T = X s a complete suffcent statstc. Our target s g(p = p, and the nave guess suggested
More informationAnalysis of Discrete Time Queues (Section 4.6)
Analyss of Dscrete Tme Queues (Secton 4.6) Copyrght 2002, Sanjay K. Bose Tme axs dvded nto slots slot slot boundares Arrvals can only occur at slot boundares Servce to a job can only start at a slot boundary
More informationTHE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens
THE CHINESE REMAINDER THEOREM KEITH CONRAD We should thank the Chnese for ther wonderful remander theorem. Glenn Stevens 1. Introducton The Chnese remander theorem says we can unquely solve any par of
More informationTAIL BOUNDS FOR SUMS OF GEOMETRIC AND EXPONENTIAL VARIABLES
TAIL BOUNDS FOR SUMS OF GEOMETRIC AND EXPONENTIAL VARIABLES SVANTE JANSON Abstract. We gve explct bounds for the tal probabltes for sums of ndependent geometrc or exponental varables, possbly wth dfferent
More informationAppendix B. The Finite Difference Scheme
140 APPENDIXES Appendx B. The Fnte Dfference Scheme In ths appendx we present numercal technques whch are used to approxmate solutons of system 3.1 3.3. A comprehensve treatment of theoretcal and mplementaton
More informationAPPENDIX A Some Linear Algebra
APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,
More informationChapter 7 Channel Capacity and Coding
Chapter 7 Channel Capacty and Codng Contents 7. Channel models and channel capacty 7.. Channel models Bnary symmetrc channel Dscrete memoryless channels Dscrete-nput, contnuous-output channel Waveform
More informationGeneralized Linear Methods
Generalzed Lnear Methods 1 Introducton In the Ensemble Methods the general dea s that usng a combnaton of several weak learner one could make a better learner. More formally, assume that we have a set
More informationStatistics Spring MIT Department of Nuclear Engineering
Statstcs.04 Sprng 00.04 S00 Statstcs/Probablty Analyss of eperments Measurement error Measurement process systematc vs. random errors Nose propertes of sgnals and mages quantum lmted mages.04 S00 Probablty
More informationLecture 3: Shannon s Theorem
CSE 533: Error-Correctng Codes (Autumn 006 Lecture 3: Shannon s Theorem October 9, 006 Lecturer: Venkatesan Guruswam Scrbe: Wdad Machmouch 1 Communcaton Model The communcaton model we are usng conssts
More informationChapter 7 Channel Capacity and Coding
Wreless Informaton Transmsson System Lab. Chapter 7 Channel Capacty and Codng Insttute of Communcatons Engneerng atonal Sun Yat-sen Unversty Contents 7. Channel models and channel capacty 7.. Channel models
More informationThe optimal delay of the second test is therefore approximately 210 hours earlier than =2.
THE IEC 61508 FORMULAS 223 The optmal delay of the second test s therefore approxmately 210 hours earler than =2. 8.4 The IEC 61508 Formulas IEC 61508-6 provdes approxmaton formulas for the PF for smple
More informationProblem Set 9 - Solutions Due: April 27, 2005
Problem Set - Solutons Due: Aprl 27, 2005. (a) Frst note that spam messages, nvtatons and other e-mal are all ndependent Posson processes, at rates pλ, qλ, and ( p q)λ. The event of the tme T at whch you
More informationChapter 2 - The Simple Linear Regression Model S =0. e i is a random error. S β2 β. This is a minimization problem. Solution is a calculus exercise.
Chapter - The Smple Lnear Regresson Model The lnear regresson equaton s: where y + = β + β e for =,..., y and are observable varables e s a random error How can an estmaton rule be constructed for the
More informationNotes on Frequency Estimation in Data Streams
Notes on Frequency Estmaton n Data Streams In (one of) the data streamng model(s), the data s a sequence of arrvals a 1, a 2,..., a m of the form a j = (, v) where s the dentty of the tem and belongs to
More informationComposite Hypotheses testing
Composte ypotheses testng In many hypothess testng problems there are many possble dstrbutons that can occur under each of the hypotheses. The output of the source s a set of parameters (ponts n a parameter
More informationLecture 21: Numerical methods for pricing American type derivatives
Lecture 21: Numercal methods for prcng Amercan type dervatves Xaoguang Wang STAT 598W Aprl 10th, 2014 (STAT 598W) Lecture 21 1 / 26 Outlne 1 Fnte Dfference Method Explct Method Penalty Method (STAT 598W)
More informationDigital Signal Processing
Dgtal Sgnal Processng Dscrete-tme System Analyss Manar Mohasen Offce: F8 Emal: manar.subh@ut.ac.r School of IT Engneerng Revew of Precedent Class Contnuous Sgnal The value of the sgnal s avalable over
More informationChapter Newton s Method
Chapter 9. Newton s Method After readng ths chapter, you should be able to:. Understand how Newton s method s dfferent from the Golden Secton Search method. Understand how Newton s method works 3. Solve
More informationStanford University CS254: Computational Complexity Notes 7 Luca Trevisan January 29, Notes for Lecture 7
Stanford Unversty CS54: Computatonal Complexty Notes 7 Luca Trevsan January 9, 014 Notes for Lecture 7 1 Approxmate Countng wt an N oracle We complete te proof of te followng result: Teorem 1 For every
More informationComments on Detecting Outliers in Gamma Distribution by M. Jabbari Nooghabi et al. (2010)
Comments on Detectng Outlers n Gamma Dstrbuton by M. Jabbar Nooghab et al. (21) M. Magdalena Lucn Alejandro C. Frery September 17, 215 arxv:159.55v1 [stat.co] 16 Sep 215 Ths note shows that the results
More informationTransfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system
Transfer Functons Convenent representaton of a lnear, dynamc model. A transfer functon (TF) relates one nput and one output: x t X s y t system Y s The followng termnology s used: x y nput output forcng
More informationLecture 3. Ax x i a i. i i
18.409 The Behavor of Algorthms n Practce 2/14/2 Lecturer: Dan Spelman Lecture 3 Scrbe: Arvnd Sankar 1 Largest sngular value In order to bound the condton number, we need an upper bound on the largest
More informationDurban Watson for Testing the Lack-of-Fit of Polynomial Regression Models without Replications
Durban Watson for Testng the Lack-of-Ft of Polynomal Regresson Models wthout Replcatons Ruba A. Alyaf, Maha A. Omar, Abdullah A. Al-Shha ralyaf@ksu.edu.sa, maomar@ksu.edu.sa, aalshha@ksu.edu.sa Department
More informationCIS526: Machine Learning Lecture 3 (Sept 16, 2003) Linear Regression. Preparation help: Xiaoying Huang. x 1 θ 1 output... θ M x M
CIS56: achne Learnng Lecture 3 (Sept 6, 003) Preparaton help: Xaoyng Huang Lnear Regresson Lnear regresson can be represented by a functonal form: f(; θ) = θ 0 0 +θ + + θ = θ = 0 ote: 0 s a dummy attrbute
More informationSimulation and Probability Distribution
CHAPTER Probablty, Statstcs, and Relablty for Engneers and Scentsts Second Edton PROBABILIT DISTRIBUTION FOR CONTINUOUS RANDOM VARIABLES A. J. Clark School of Engneerng Department of Cvl and Envronmental
More informationDO NOT OPEN THE QUESTION PAPER UNTIL INSTRUCTED TO DO SO BY THE CHIEF INVIGILATOR. Introductory Econometrics 1 hour 30 minutes
25/6 Canddates Only January Examnatons 26 Student Number: Desk Number:...... DO NOT OPEN THE QUESTION PAPER UNTIL INSTRUCTED TO DO SO BY THE CHIEF INVIGILATOR Department Module Code Module Ttle Exam Duraton
More informationAn Experiment/Some Intuition (Fall 2006): Lecture 18 The EM Algorithm heads coin 1 tails coin 2 Overview Maximum Likelihood Estimation
An Experment/Some Intuton I have three cons n my pocket, 6.864 (Fall 2006): Lecture 18 The EM Algorthm Con 0 has probablty λ of heads; Con 1 has probablty p 1 of heads; Con 2 has probablty p 2 of heads
More informationReview of Taylor Series. Read Section 1.2
Revew of Taylor Seres Read Secton 1.2 1 Power Seres A power seres about c s an nfnte seres of the form k = 0 k a ( x c) = a + a ( x c) + a ( x c) + a ( x c) k 2 3 0 1 2 3 + In many cases, c = 0, and the
More informationModule 2. Random Processes. Version 2 ECE IIT, Kharagpur
Module Random Processes Lesson 6 Functons of Random Varables After readng ths lesson, ou wll learn about cdf of functon of a random varable. Formula for determnng the pdf of a random varable. Let, X be
More information2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification
E395 - Pattern Recognton Solutons to Introducton to Pattern Recognton, Chapter : Bayesan pattern classfcaton Preface Ths document s a soluton manual for selected exercses from Introducton to Pattern Recognton
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 12 10/21/2013. Martingale Concentration Inequalities and Applications
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.65/15.070J Fall 013 Lecture 1 10/1/013 Martngale Concentraton Inequaltes and Applcatons Content. 1. Exponental concentraton for martngales wth bounded ncrements.
More informationFinding Dense Subgraphs in G(n, 1/2)
Fndng Dense Subgraphs n Gn, 1/ Atsh Das Sarma 1, Amt Deshpande, and Rav Kannan 1 Georga Insttute of Technology,atsh@cc.gatech.edu Mcrosoft Research-Bangalore,amtdesh,annan@mcrosoft.com Abstract. Fndng
More informationCollege of Computer & Information Science Fall 2009 Northeastern University 20 October 2009
College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:
More informationU-Pb Geochronology Practical: Background
U-Pb Geochronology Practcal: Background Basc Concepts: accuracy: measure of the dfference between an expermental measurement and the true value precson: measure of the reproducblty of the expermental result
More informationBinomial Distribution: Tossing a coin m times. p = probability of having head from a trial. y = # of having heads from n trials (y = 0, 1,..., m).
[7] Count Data Models () Some Dscrete Probablty Densty Functons Bnomal Dstrbuton: ossng a con m tmes p probablty of havng head from a tral y # of havng heads from n trals (y 0,,, m) m m! fb( y n) p ( p)
More informationLecture 12: Discrete Laplacian
Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly
More informationStat 543 Exam 2 Spring 2016
Stat 543 Exam 2 Sprng 2016 I have nether gven nor receved unauthorzed assstance on ths exam. Name Sgned Date Name Prnted Ths Exam conssts of 11 questons. Do at least 10 of the 11 parts of the man exam.
More informationSTAT 511 FINAL EXAM NAME Spring 2001
STAT 5 FINAL EXAM NAME Sprng Instructons: Ths s a closed book exam. No notes or books are allowed. ou may use a calculator but you are not allowed to store notes or formulas n the calculator. Please wrte
More information