Simulation of Discrete Event Systems
|
|
- Silvester Leonard
- 5 years ago
- Views:
Transcription
1 Simulatio of Discrete Evet Systems Uit 13 Evet Schedulig Scheme ad Output Aalysis Fall Witer 2017/2018 Prof. Dr.-Ig. Dipl.-Wirt.-Ig. Sve Tackeberg Beedikt Adrew Latos M.Sc.RWTH Chair ad Istitute of Idustrial Egieerig ad Ergoomics RWTH Aache Uiversity Bergdriesch Aache phoe:
2 Cotets 1. Evet schedulig scheme - Approach - Fuctioal model - Process-orieted simulatio scheme 2. Output aalysis - Termiatig simulatios - No-termiatig simulatios 13-2
3 Focus of lecture ad exercise model static dyamic time-varyig time-ivariat liear oliear cotiuous states time-drive discrete states Focus of lecture ad exercise evet-drive determiistic stochastic discrete-time cotiuous-time 13-3
4 1. Evet Schedulig Scheme 1. Evet Schedulig Scheme 13-4
5 Itroductio If real-world problems are trasferred to algebraic structures, these models are ofte too complicated to obtai aalytical results Desig, develop ad deploy computer-supported simulatio to compare alterative system desigs Computer-supported simulatio models ca be cosidered as electroic couterpart of empirical laboratory experimets 13-5
6 Approach (I) Remember Def.: A Stochastic Timed Automato is a six-tuple: (, ε, (x), p, p 0, V), where: ε coutable state space, coutable evet set, (x) set of feasible or eabled evets, defied for all x with (x) ε, p(x ; x, e ) state trasitio probability defied for all x, x ad e ε, ad such that p(x ; x, e ) = 0 for all e (x), p 0 (x) probability mass fuctio P(X 0 = x), x, w.r.t the iitial state X 0, V stochastic timig structure. The automato geerates a stochastic state sequece {X 0, X 1, } through a trasitio mechaism (based o observatios X = x, E = e ): X = x with probability p(x ; x, e ) ad it is drive by a stochastic evet sequece {E 1,E 2, } geerated through E Y with the stochastic clock values Y i, i ε arg mi. i( x) i 13-6
7 Approach (II) The formal cocept of a automato (, ε, (x), p, p 0, V) ca be trasferred ito a computer based simulatio model. 1 Evet schedulig scheme o a digital computer is as follows Time variable t = 0 is iitialized Iitial system state x 0 is defied by samplig the iitial probability mass fuctio p 0 The clock value of every feasible evet is set to a evet lifetime 1. Note: I order to sample this distributio the computer may geerate a radom umber with a uiform probability desity fuctio over the iterval [0; 1] ad the evaluate i which of the bis (discrete itervals) the computed value lies i. Radomly a value betwee 0.0 ad 1.0 is determied e.g.: ത ത The lifetime is sampled from a predefied cotiuous probability distributio (e.g. expoetial) usig the radom umber geerator of the computer. 13-7
8 Approach (III) 2 The set of feasible evets (x) is determied Valuatio of evet i: - If i (x) is a feasible evet, we associate with it a clock value, which represets the amout of time required util evet i occurs. Deotatio of clock values for evet i by y i ad their sampled lifetimes by v i. At t = 0 we set y i = v i for all i (x) All clock values y i where i (x) are cosidered The triggerig evet e is the evet with the smallest clock value: e arg mi y * i mi i( x) y i ( x) Update of the state of the system accordig to the state trasitio mechaism The ew state will be x with probability p(x ; x, e ) The value of x is determied by a simulated radom experimet o the basis of the coditioal distributio of the probability mass. Calculatig the iterevet time based o the amout of time spet at state x: y i 13-8
9 Approach (IV) 6 Updatig the system time by settig: t = t + y* 7 8 Updatig the clock values for all feasible evets i the ew state x (from 4 ) Two cases have to be cosidered: - If a evet i (x), i e remais feasible i the ew state, the remaiig time util its occurrece is simply give by: y i = y i - y* - The secod case applies to e itself if e (x ) ad to all other evets which were ot feasible i x, but become feasible i x. Lifetime values are defied by the radom umber geerator. If there are additioal evets to be processed the computer goes back to step 2 ad uses state x istead of x 0. Istead of time values y i ad the correspodig feasible evets i (x), the most computer-based simulatio systems use a simplified scheduled evet list (SEL): SEL = {(e k, t k )}; k = 1,..., m L ; m L <= m; m L : Number of feasible evets i curret state m: Number of evets i the set t k =t k-1 + v i : ext evet schedulig The SEL is always ordered o a smallest-scheduled-time-first basis. The first evet e 1 o the list is always the triggerig evet. 13-9
10 Fuctioal model of evet schedulig scheme i Computer simulatio (I) Iitialize Settig the state x to its iitial value x 0 Settig the simulatio time t to zero Defiitio of the seed values for the radom umber geerator ad specifies the probability distributios Program segmet: Idetificatio triggerig evet Update the stored system state Radom umber geerator System state variables x x Update state p(x ; x, e 1 ) Geerates pseudo radom umbers accordig to predefied distributio fuctios SEL e 1 t 1 e 2 t Data structure of simulatio time t Update time t = t 1 x t SEL: Ordered list of scheduled evets (smallest-scheduledtime-first) Delete ifeasible (e k, t k ) New evet lifetime v k Add ew feasible (e k, t + v k ) ad reorder t Program segmet: Idetificatio ext evet Icremetig the stored simulatio time 13-10
11 Fuctioal model of evet schedulig scheme i Computer simulatio (II) Simulatio procedure: Radom umber geerator System state variables x x Update state p(x ; x, e 1 ) x Delete ifeasible (e k, t k ) New evet lifetime v k Iitialize SEL e 1 t 1 e 2 t Add ew feasible (e k, t + v k ) ad reorder Data structure of simulatio time t t Update time t = t 1 t 1. Remove the first etry (e 1, t 1 ) from the list of scheduled evets SEL 2. Update the simulatio time t by advacig it to the ew evet time t 1 3. Update the state accordig to the state trasitio mechaism p(x ; x, e 1 ) 4. Delete from SEL ay etries correspodig to ifeasible evets i the ew state, that is, delete all (e k, t k ) SEL with such that e k (x ) 5. Add to SEL ay feasible evet which is ot already scheduled (possibly icludig the triggerig evet e 1 removed i Step 1). Scheduled evet time for i is give by t + v i, where t was set i step 2 ad v i is a lifetime from the radom umber geerator 6. Reorder the updated SEL based o a smallest-scheduled-time-first scheme
12 The process-orieted simulatio scheme The itroduced evet schedulig scheme is ofte hidde i moder simulatio tools ad istead graphical editors are used to desig, verify, ad validate the system processes Process-orieted simulatio scheme. Thik of etities such as workpieces as udergoig a process as they flow through the DES. Process: Sequece of evets i terms of activities separated by time itervals The behavior of the DES is described through processes, oe process for each type of system s etity of iterest
13 Example of a process-orieted simulatio scheme M / M / 3 Subject or object occur (Evet a) Subject or object is part of the set which wait for processig (Queue) Service (Server) Subject or object is fully processed (Evet d) Sigle type of etity i this system (e.g. a workpiece) Sigle type of resource (the server) Process: The workpiece arrives The workpiece eters the queue The workpiece requests service from the server; If the server is idle, the etity seizes that resource, If the server is busy, it remais i the queue util the server becomes idle If the server hadles the workpiece, it remais i service for some period of time correspodig to the service time Whe the service is complete, it releases the server It leaves the system 13-13
14 Compoets of the process-orieted simulatio scheme Etities Attributes Objects of the simulatio system to be processed Each type of etity is characterized by a particular process (e.g. workpieces i a maufacturig system) Iformatio to characterize a particular idividual etity of ay type A uique record to each etity that cosist of etity s attributes is attached (e.g. for a workpiece i a maufacturig system: attributes are arrival time, its type etc.) Process fuctios Resources Queues Descriptio of the processed trasformatios for a etity Logical fuctios ca be classified: - spotaeous without time cosumptio - certai time cosumptio of the fuctio Objects providig service to etities Time delays experieced by a etity: - waitig for a particular resource - receivig service (e.g. machies) Sets of etities with some commo characteristics, e.g. waitig for the use of a particular resource. If a etity is curretly ot i progress it must be i a queue or i a magazie
15 2. Output Aalysis 2. Output Aalysis 13-15
16 Approach Computer-based simulatio models geerate data output through repeated simulatio rus. Termiatig simulatio: The simulatio rus termiate after a fiite umber of time steps (fiite time horizo) The output ca directly be aalyzed with the help of: - descriptive statistical methods (mea, sample variace etc.) - iferetial statistics (tests of sigificace etc.) No-Termiatig simulatio: The model simulates a system i steady state ad is therefore by desig o-termiatig Compute statioary probability distributios of the covered state variables We cosider the performace variables geeratig the output data as radom variables. The radom performace variables X 1,..., X idetically distributed are idepedet from each other ad are Note: I the followig we assume that radom variables are idepedetly draw from idetical probability distributios (iid sequece) with mea ad variace
17 Poit estimatio (I) Oly a search of the total populatio leads to a complete descriptio of the distributio of a radom variable X i a give populatio. A poit estimate describes a method of determiig a sigle value to estimate a ukow parameter The ukow mea value μ of a metric radom variable X of a total populatio is estimated based o a radom sample size. The arithmetic average of the samplig elemets represets the estimated value μ for the ukow average value. x 1, x 2,, x Θ = 1 x i Estimated value of a poit estimatio of a variable is a radom variable which ca have differet values Θ Θ Θ = X 1,, X True value withi the populatio Estimated value of the parameter Estimatio fuctio 13-17
18 Poit estimatio (II) Ubiasedess of the estimates A estimator is ubiased if the expected value correspods to the true value of the parameter to be estimated: E( ˆ ) Variace describes the deviatio from the mea value. The empirically determied variace of the sample s 2 is used for the estimated value for the ukow variace of the basic populatio σ 2. biased estimator The empirically determied variace of the sample s 2 is calculated as follows: Bias is described by the factor: Deviatio of the sample s 2 = 1 x i xҧ 2 1 σ 2 = 1 1 i=1-1: umber of degrees of freedom Due to a correctio with its reciprocal: x i xҧ
19 Poit estimatio (III) The sample variace is a ubiased poit estimator of the variace of the sample mea, because it satisfies: Var( ˆ ) ˆ 2 S 1 ˆ X i ( 1) i1 2 Example of developmet of the probability desity fuctio of ˆ : f p ( ˆ ) is growig is growig further True value withi the populatio ˆ Estimated value of the parameter For all differet umbers of, the mea (ceter of gravity) of f p is. However, the variace is decreasig as more data are collected. For goig to ifiity the probability mass is cetered aroud like a Dirac impulse
20 Iterval estimatio (I) Iterval estimatio is a systematic way to defie a iterval cotaiig withi which we ca fid the true value with a predefied cofidece level (1-α). The variable is the probability that the true values lies outside the cofidece iterval. Based o the Cetral Limit Theorem, a stadardized radom variable is defied: Z ˆ ˆ E ˆ Var 2 ˆ / pdf Z ( x) ( x) as where ( x) represets the stadard ormal distributio with the pdf : 1 ( x) 2 e x 2 /2 Θ Θ σ 2 True value withi the populatio Estimated value of the parameter Deviatio of the sample Cetral Limit Theorem: For the probability desity fuctio (pdf) of the stadardized radom variable Z the followig holds: 13-20
21 Iterval estimatio (II) Due to the fact that we have a stadard ormal distributio we are able to defie symmetric iterval limits -z /2 ad z /2, so that area uder the Gaussia bell curve equals the cofidece level 1-. ( x) 1 For large we have: P z Z z / 2 / 2 1 x z /2 z /2 ˆ 2 2 P ˆ ˆ z / 2 z / 2 1 P z / 2 / z / 2 / 1 2 / Clearly, the sample mea, the variace, ad the sample size are the idepedet parameters to estimate the iterval limits i a iterval estimatio
22 Iterval estimatio (III) e.g. distributio of productio time The variace of the distributio of the most real-world problems is ukow! I that case, we have to cosider the sample variace: P ˆ z Sˆ / ˆ z Sˆ / /2 /2 e.g. simulated productio time e.g. simulated productio time e.g. simulatio rus If the output data X 1,..., X, are give ad is large eough The equatio above leads to a cosistet estimatio of the iterval of the expected value. How large should be so that it is sufficietly large for the Cetral Limit Theorem to hold Solutio: If the sequece X 1,..., X, is ormally distributed tha T ˆ P t1, /2 T t 1, /2 1 with T S / P ˆ t Sˆ / ˆ t Sˆ / , /2 1, /2 2 is based o t -1 distributio The first parameter of the t -1 -distributio is the corrected sample size (-1) idicatig the degrees of freedom (df) of X 1,..., X. The secod parameter is the error level which is divided ito upper ad lower limits /2 of the cofidece iterval
23 Iterval estimatio (IV) The probability desity fuctio of t-distributio is described here algebraic graphical Studet p f x df 1 / 2 1 / /2 x 1 1 e.g. experimetal df = 2 observatios df = 10 df = 100 I egieerig scieces, values of = 0.05 or = 0.01 are typical
24 Output aalysis of termiatig simulatios (1/2) Termiatig simulatios have well-defied termiatio criteria. Because the values are computed o the basis of a fuctioal system model with associatig evets: We caot expect that the sequece of radom variables X 1,..., X M is idepedet ad idetically distributed! By the use of simulatio models: we are i geeral ot iterested i sigle data poits X 1,..., X M we are iterested i aggregated performace measures L = f(x 1,..., X M ) Clearly, we ca repeat a simulatio with the same iitial coditios ad termiatig evets times, ad collect data L 1, L 2,, L. These data are a idepedet sequece as log as each simulatio ru is performed idepedetly from each other (e.g. differet seeds of the radom umber geerator) If the sample size is sufficietly large, the Cetral Limit Theorem ca be used to estimate the mea ad variace
25 Output aalysis of termiatig simulatios (2/2) A commo performace measure is the mea of the distributio characterizig the idepedet sequece {L 1, L 2,, L }. Let this mea be ad let the variace be 2. The estimates are as follows: ˆ L Sˆ j ˆ 2 Lj 1 j1 j1 P ˆ t Sˆ / ˆ t Sˆ / , /2 1, /
26 Example of output aalysis of termiatig simulatios (I) Task A compay wats to assess the assembly time of 200 egies Assembly steps of oe egie are 100 A stochastic-timed automato model is developed Procedure Step 1 Step 2 Simulatio of the executio time of 100 assembly steps (x i, i = 1,,100) As a aggregated performace measure the accumulated assembly time is used: L j 100 x i1 Based o the aggregated performace measure the mea assembly time of the lot is computed: ˆ 200 i j1 Cofidece level for a iterval estimatio is defied as: 1% L j Step 3 Iverse t-distributio with df = -1 = ad /2 = iterval limits: t 2.60 t , ,
27 Example of output aalysis of termiatig simulatios (II) The system simulatio computes the followig mea ad sample variace: ˆ [ s] S [ s ] Fially, we have the iterval estimate: P ˆ t Sˆ / 200 ˆ t Sˆ / , , [ s] 12026[ s] 2 2 PP ˆ 200 t ˆ ˆ ˆ 199,0.005 (2,60 S / Θ t199, (2,60 S / P 9864[ s] 12026[ s] 0.99 Therefore, the probability of fidig the mea assembly time of the lot i the iterval [9864 s; s] is 99%
28 Output aalysis of o-termiatig simulatios Ufortuately, i o-termiatig simulatios there are o model-related stoppig criteria ad therefore the data output as realizatios of the radom variables X 1,..., X grows over all limits. I this case we are usually iterested i estimatig parameters of a statioary distributio P(X = x), where X is a state variable of iterest i steady state. There is o guaratee that this distributio exists, but it is ofte the case that P(X k <= x) P(X <= x) as k. I the followig we assume that the statioary distributio exists. We try to obtai performace measures, which are represeted by parameters of the distributio such as the mea. A simple approach to deal with a o-termiatig simulatio is to select a appropriate widow over the data startig by step r ad edig by step m: (X r,..., X m ). For istace, the modeler ca elimiate the effect of the trasiet part of the system s behavior ad cocetrate o the steady state. This approach called a iitial data deletio or warmig up of the simulatio: 0 r m sample size Warmup iterval where data is igored Data collectio ad used for parameter estimatio 13-28
29 Regeerative simulatio (I) The warmup approach ofte is ot sufficiet for a reliable parameter estimatio. A alterative approach is referred to as a regeerative simulatio. The basic idea is that a stochastic process may be characterized by radom poits i time whe it regeerates itself ad becomes idepedet of its past history. Let R 1, R 2,... be process regeeratio poits i time. The, [R j ; R j+1 ), j = 1,2,... is called a regeerative iterval. If these itervals exist, the part of the stochastic process defied over such iterval is idepedet from the past defied over aother iterval. I the regeerative itervals the values of the cumulative performace measure L j are acquired, where N j deotes the umber of values i the j-th iterval. Due to the radom time poits of the regeerative itervals, N j ca be also cosidered as a radom variable. Because of the regeeratio properties the followig coditios hold: L1, L2,... is a iid sequece with expectatio E L N, N,... is a iid sequece with expectatio E N 1 2 However, L j i geeral is ot idepedet of N j! 13-29
30 Regeerative simulatio (II) A basic property of stochastic processes is that the mea defied as before for the statioary distributio of {X 1, X 2,...} is give by: lim E X k k E L E N If we set the total umber of data obtaied over regeerative itervals The we have M( ) X 1 j j1 j1 M( ) 1 j1 L N j j M ( ) N j1 j Now we ca come up with a poit estimate of usig data collected over regeerative itervals: 1 Lj Lj ˆ j1 j1 1 N j N j j1 j
31 Regeerative simulatio (III) For the poit estimate ca be show that it is a strogly cosistet estimator of : as ˆ However, the estimator is ot ubiased. Due to the legth limitatio of this itroductory course the correspodig iterval estimatio ca ot be derived. The iterested reader ca fid it i Law, A.M. ud Kelto, W.D. (1991): Simulatio Modelig ad Aalysis. New York: McGraw-Hill
32 Example of regeerative simulatio (I) A airlie has developed a G/G/1 queueig model for the customer service at their check-i desks. Iterarrival time: Give as empirical frequecy distributios time G Service time: Give as empirical frequecy distributios time G G / G / 1 Subject or object occur (Evet a) Subject or object is part of the set which wait for processig (Queue) Service (Server) Subject or object is fully processed (Evet d) Note: We assume the system is stable (arrival rate smaller tha service rate). Objective: Estimate the mea time the customer speds at the check-i desk at steady state, deoted by system time S. For this system the crucial observatio is that every arrivig customer fidig the system empty defies a regeeratio poit. The behavior of the system over the busy period that follows is idepedet of the behavior i ay other busy period
33 Example of regeerative simulatio (II) Every arrivig customer fidig the system empty defies a regeeratio poit. 1. Regeerative iterval: N 1 = 3 customers served 2. Regeerative iterval: N 2 = 2 customers served M 1 = 3 M 2 = 5 System time S i ( i = 1, 2,...): System time of the i-th customer i a simulatio ru j-th busy period: Starts with the arrival of the (M j-1 + 1) th customer ad cosists of N j = M j M j-1 customers (M 0 = 0) Specific busy period: Cumulative system time experieced by all N i customers: Estimator of the mea customer system time: busy periods are observed: Sˆ L j j1 j1 M j j1 1 im L N j j S i
34 Refereces CASSANDRAS, C.,G.; LAFORTUNE, S. (2008): Itroductio to Discrete Evet Systems. 2 d editio. Bosto (MA): Spriger Sciece+Busiess Media. Baks, J.B. (Ed.) (1998): Hadbook of Simulatio. New York (NY): Joh Wiley & Sos
35 Questios? Ope Questios??? 13-35
Simulation of Discrete Event Systems
Simulatio of Discrete Evet Systems Uit 9 Queueig Models Fall Witer 2014/2015 Uiv.-Prof. Dr.-Ig. Dipl.-Wirt.-Ig. Christopher M. Schlick Chair ad Istitute of Idustrial Egieerig ad Ergoomics RWTH Aache Uiversity
More informationhttp://www.xelca.l/articles/ufo_ladigsbaa_houte.aspx imulatio Output aalysis 3/4/06 This lecture Output: A simulatio determies the value of some performace measures, e.g. productio per hour, average queue
More informationMATH 320: Probability and Statistics 9. Estimation and Testing of Parameters. Readings: Pruim, Chapter 4
MATH 30: Probability ad Statistics 9. Estimatio ad Testig of Parameters Estimatio ad Testig of Parameters We have bee dealig situatios i which we have full kowledge of the distributio of a radom variable.
More informationChapter 11 Output Analysis for a Single Model. Banks, Carson, Nelson & Nicol Discrete-Event System Simulation
Chapter Output Aalysis for a Sigle Model Baks, Carso, Nelso & Nicol Discrete-Evet System Simulatio Error Estimatio If {,, } are ot statistically idepedet, the S / is a biased estimator of the true variace.
More informationRandom Variables, Sampling and Estimation
Chapter 1 Radom Variables, Samplig ad Estimatio 1.1 Itroductio This chapter will cover the most importat basic statistical theory you eed i order to uderstad the ecoometric material that will be comig
More informationStatistical Inference (Chapter 10) Statistical inference = learn about a population based on the information provided by a sample.
Statistical Iferece (Chapter 10) Statistical iferece = lear about a populatio based o the iformatio provided by a sample. Populatio: The set of all values of a radom variable X of iterest. Characterized
More informationLecture 2: Monte Carlo Simulation
STAT/Q SCI 43: Itroductio to Resamplig ethods Sprig 27 Istructor: Ye-Chi Che Lecture 2: ote Carlo Simulatio 2 ote Carlo Itegratio Assume we wat to evaluate the followig itegratio: e x3 dx What ca we do?
More informationBasis for simulation techniques
Basis for simulatio techiques M. Veeraraghava, March 7, 004 Estimatio is based o a collectio of experimetal outcomes, x, x,, x, where each experimetal outcome is a value of a radom variable. x i. Defiitios
More informationThere is no straightforward approach for choosing the warmup period l.
B. Maddah INDE 504 Discrete-Evet Simulatio Output Aalysis () Statistical Aalysis for Steady-State Parameters I a otermiatig simulatio, the iterest is i estimatig the log ru steady state measures of performace.
More informationComputing Confidence Intervals for Sample Data
Computig Cofidece Itervals for Sample Data Topics Use of Statistics Sources of errors Accuracy, precisio, resolutio A mathematical model of errors Cofidece itervals For meas For variaces For proportios
More informationGeneralized Semi- Markov Processes (GSMP)
Geeralized Semi- Markov Processes (GSMP) Summary Some Defiitios Markov ad Semi-Markov Processes The Poisso Process Properties of the Poisso Process Iterarrival times Memoryless property ad the residual
More informationB. Maddah ENMG 622 ENMG /27/07
B. Maddah ENMG 622 ENMG 5 3/27/7 Queueig Theory () What is a queueig system? A queueig system cosists of servers (resources) that provide service to customers (etities). A Customer requestig service will
More information7-1. Chapter 4. Part I. Sampling Distributions and Confidence Intervals
7-1 Chapter 4 Part I. Samplig Distributios ad Cofidece Itervals 1 7- Sectio 1. Samplig Distributio 7-3 Usig Statistics Statistical Iferece: Predict ad forecast values of populatio parameters... Test hypotheses
More informationChapter 2 The Monte Carlo Method
Chapter 2 The Mote Carlo Method The Mote Carlo Method stads for a broad class of computatioal algorithms that rely o radom sampligs. It is ofte used i physical ad mathematical problems ad is most useful
More informationStat 421-SP2012 Interval Estimation Section
Stat 41-SP01 Iterval Estimatio Sectio 11.1-11. We ow uderstad (Chapter 10) how to fid poit estimators of a ukow parameter. o However, a poit estimate does ot provide ay iformatio about the ucertaity (possible
More informationTopic 9: Sampling Distributions of Estimators
Topic 9: Samplig Distributios of Estimators Course 003, 2016 Page 0 Samplig distributios of estimators Sice our estimators are statistics (particular fuctios of radom variables), their distributio ca be
More informationSimulation. Two Rule For Inverting A Distribution Function
Simulatio Two Rule For Ivertig A Distributio Fuctio Rule 1. If F(x) = u is costat o a iterval [x 1, x 2 ), the the uiform value u is mapped oto x 2 through the iversio process. Rule 2. If there is a jump
More informationModule 1 Fundamentals in statistics
Normal Distributio Repeated observatios that differ because of experimetal error ofte vary about some cetral value i a roughly symmetrical distributio i which small deviatios occur much more frequetly
More informationEcon 325/327 Notes on Sample Mean, Sample Proportion, Central Limit Theorem, Chi-square Distribution, Student s t distribution 1.
Eco 325/327 Notes o Sample Mea, Sample Proportio, Cetral Limit Theorem, Chi-square Distributio, Studet s t distributio 1 Sample Mea By Hiro Kasahara We cosider a radom sample from a populatio. Defiitio
More informationCS/ECE 715 Spring 2004 Homework 5 (Due date: March 16)
CS/ECE 75 Sprig 004 Homework 5 (Due date: March 6) Problem 0 (For fu). M/G/ Queue with Radom-Sized Batch Arrivals. Cosider the M/G/ system with the differece that customers are arrivig i batches accordig
More informationA Question. Output Analysis. Example. What Are We Doing Wrong? Result from throwing a die. Let X be the random variable
A Questio Output Aalysis Let X be the radom variable Result from throwig a die 5.. Questio: What is E (X? Would you throw just oce ad take the result as your aswer? Itroductio to Simulatio WS/ - L 7 /
More informationExpectation and Variance of a random variable
Chapter 11 Expectatio ad Variace of a radom variable The aim of this lecture is to defie ad itroduce mathematical Expectatio ad variace of a fuctio of discrete & cotiuous radom variables ad the distributio
More informationEstimation for Complete Data
Estimatio for Complete Data complete data: there is o loss of iformatio durig study. complete idividual complete data= grouped data A complete idividual data is the oe i which the complete iformatio of
More informationTopic 9: Sampling Distributions of Estimators
Topic 9: Samplig Distributios of Estimators Course 003, 2018 Page 0 Samplig distributios of estimators Sice our estimators are statistics (particular fuctios of radom variables), their distributio ca be
More informationStatistical Pattern Recognition
Statistical Patter Recogitio Classificatio: No-Parametric Modelig Hamid R. Rabiee Jafar Muhammadi Sprig 2014 http://ce.sharif.edu/courses/92-93/2/ce725-2/ Ageda Parametric Modelig No-Parametric Modelig
More informationTopic 9: Sampling Distributions of Estimators
Topic 9: Samplig Distributios of Estimators Course 003, 2018 Page 0 Samplig distributios of estimators Sice our estimators are statistics (particular fuctios of radom variables), their distributio ca be
More information9. Simulation lect09.ppt S Introduction to Teletraffic Theory - Fall
lect09.ppt S-38.145 - Itroductio to Teletraffic Theory - Fall 2001 1 Cotets Itroductio Geeratio of realizatios of the traffic process Geeratio of realizatios of radom variables Collectio of data Statistical
More informationChapter 6 Sampling Distributions
Chapter 6 Samplig Distributios 1 I most experimets, we have more tha oe measuremet for ay give variable, each measuremet beig associated with oe radomly selected a member of a populatio. Hece we eed to
More informationEcon 325 Notes on Point Estimator and Confidence Interval 1 By Hiro Kasahara
Poit Estimator Eco 325 Notes o Poit Estimator ad Cofidece Iterval 1 By Hiro Kasahara Parameter, Estimator, ad Estimate The ormal probability desity fuctio is fully characterized by two costats: populatio
More informationIE 230 Probability & Statistics in Engineering I. Closed book and notes. No calculators. 120 minutes.
Closed book ad otes. No calculators. 120 miutes. Cover page, five pages of exam, ad tables for discrete ad cotiuous distributios. Score X i =1 X i / S X 2 i =1 (X i X ) 2 / ( 1) = [i =1 X i 2 X 2 ] / (
More information6.041/6.431 Spring 2009 Final Exam Thursday, May 21, 1:30-4:30 PM.
6.041/6.431 Sprig 2009 Fial Exam Thursday, May 21, 1:30-4:30 PM. Name: Recitatio Istructor: Questio Part Score Out of 0 2 1 all 18 2 all 24 3 a 4 b 4 c 4 4 a 6 b 6 c 6 5 a 6 b 6 6 a 4 b 4 c 4 d 5 e 5 7
More informationElement sampling: Part 2
Chapter 4 Elemet samplig: Part 2 4.1 Itroductio We ow cosider uequal probability samplig desigs which is very popular i practice. I the uequal probability samplig, we ca improve the efficiecy of the resultig
More informationIntroductory statistics
CM9S: Machie Learig for Bioiformatics Lecture - 03/3/06 Itroductory statistics Lecturer: Sriram Sakararama Scribe: Sriram Sakararama We will provide a overview of statistical iferece focussig o the key
More information4. Partial Sums and the Central Limit Theorem
1 of 10 7/16/2009 6:05 AM Virtual Laboratories > 6. Radom Samples > 1 2 3 4 5 6 7 4. Partial Sums ad the Cetral Limit Theorem The cetral limit theorem ad the law of large umbers are the two fudametal theorems
More informationResampling Methods. X (1/2), i.e., Pr (X i m) = 1/2. We order the data: X (1) X (2) X (n). Define the sample median: ( n.
Jauary 1, 2019 Resamplig Methods Motivatio We have so may estimators with the property θ θ d N 0, σ 2 We ca also write θ a N θ, σ 2 /, where a meas approximately distributed as Oce we have a cosistet estimator
More information1.010 Uncertainty in Engineering Fall 2008
MIT OpeCourseWare http://ocw.mit.edu.00 Ucertaity i Egieerig Fall 2008 For iformatio about citig these materials or our Terms of Use, visit: http://ocw.mit.edu.terms. .00 - Brief Notes # 9 Poit ad Iterval
More informationt distribution [34] : used to test a mean against an hypothesized value (H 0 : µ = µ 0 ) or the difference
EXST30 Backgroud material Page From the textbook The Statistical Sleuth Mea [0]: I your text the word mea deotes a populatio mea (µ) while the work average deotes a sample average ( ). Variace [0]: The
More informationLecture 19: Convergence
Lecture 19: Covergece Asymptotic approach I statistical aalysis or iferece, a key to the success of fidig a good procedure is beig able to fid some momets ad/or distributios of various statistics. I may
More informationHypothesis Testing. Evaluation of Performance of Learned h. Issues. Trade-off Between Bias and Variance
Hypothesis Testig Empirically evaluatig accuracy of hypotheses: importat activity i ML. Three questios: Give observed accuracy over a sample set, how well does this estimate apply over additioal samples?
More informationProperties and Hypothesis Testing
Chapter 3 Properties ad Hypothesis Testig 3.1 Types of data The regressio techiques developed i previous chapters ca be applied to three differet kids of data. 1. Cross-sectioal data. 2. Time series data.
More informationAdvanced Stochastic Processes.
Advaced Stochastic Processes. David Gamarik LECTURE 2 Radom variables ad measurable fuctios. Strog Law of Large Numbers (SLLN). Scary stuff cotiued... Outlie of Lecture Radom variables ad measurable fuctios.
More informationAn Introduction to Randomized Algorithms
A Itroductio to Radomized Algorithms The focus of this lecture is to study a radomized algorithm for quick sort, aalyze it usig probabilistic recurrece relatios, ad also provide more geeral tools for aalysis
More informationProbability and statistics: basic terms
Probability ad statistics: basic terms M. Veeraraghava August 203 A radom variable is a rule that assigs a umerical value to each possible outcome of a experimet. Outcomes of a experimet form the sample
More informationLecture 6 Chi Square Distribution (χ 2 ) and Least Squares Fitting
Lecture 6 Chi Square Distributio (χ ) ad Least Squares Fittig Chi Square Distributio (χ ) Suppose: We have a set of measuremets {x 1, x, x }. We kow the true value of each x i (x t1, x t, x t ). We would
More informationStatistics 511 Additional Materials
Cofidece Itervals o mu Statistics 511 Additioal Materials This topic officially moves us from probability to statistics. We begi to discuss makig ifereces about the populatio. Oe way to differetiate probability
More informationDiscrete Mathematics for CS Spring 2008 David Wagner Note 22
CS 70 Discrete Mathematics for CS Sprig 2008 David Wager Note 22 I.I.D. Radom Variables Estimatig the bias of a coi Questio: We wat to estimate the proportio p of Democrats i the US populatio, by takig
More informationECE 901 Lecture 12: Complexity Regularization and the Squared Loss
ECE 90 Lecture : Complexity Regularizatio ad the Squared Loss R. Nowak 5/7/009 I the previous lectures we made use of the Cheroff/Hoeffdig bouds for our aalysis of classifier errors. Hoeffdig s iequality
More informationQueuing Theory. Basic properties, Markovian models, Networks of queues, General service time distributions, Finite source models, Multiserver queues
Queuig Theory Basic properties, Markovia models, Networks of queues, Geeral service time distributios, Fiite source models, Multiserver queues Chapter 8 Kedall s Notatio for Queuig Systems A/B/X/Y/Z: A
More informationENGI 4421 Confidence Intervals (Two Samples) Page 12-01
ENGI 44 Cofidece Itervals (Two Samples) Page -0 Two Sample Cofidece Iterval for a Differece i Populatio Meas [Navidi sectios 5.4-5.7; Devore chapter 9] From the cetral limit theorem, we kow that, for sufficietly
More informationSTAT 350 Handout 19 Sampling Distribution, Central Limit Theorem (6.6)
STAT 350 Hadout 9 Samplig Distributio, Cetral Limit Theorem (6.6) A radom sample is a sequece of radom variables X, X 2,, X that are idepedet ad idetically distributed. o This property is ofte abbreviated
More informationLecture 6 Chi Square Distribution (χ 2 ) and Least Squares Fitting
Lecture 6 Chi Square Distributio (χ ) ad Least Squares Fittig Chi Square Distributio (χ ) Suppose: We have a set of measuremets {x 1, x, x }. We kow the true value of each x i (x t1, x t, x t ). We would
More informationEE / EEE SAMPLE STUDY MATERIAL. GATE, IES & PSUs Signal System. Electrical Engineering. Postal Correspondence Course
Sigal-EE Postal Correspodece Course 1 SAMPLE STUDY MATERIAL Electrical Egieerig EE / EEE Postal Correspodece Course GATE, IES & PSUs Sigal System Sigal-EE Postal Correspodece Course CONTENTS 1. SIGNAL
More informationLecture 5. Random variable and distribution of probability
Itroductio to theory of probability ad statistics Lecture 5. Radom variable ad distributio of probability prof. dr hab.iż. Katarzya Zarzewsa Katedra Eletroii, AGH e-mail: za@agh.edu.pl http://home.agh.edu.pl/~za
More informationBig Picture. 5. Data, Estimates, and Models: quantifying the accuracy of estimates.
5. Data, Estimates, ad Models: quatifyig the accuracy of estimates. 5. Estimatig a Normal Mea 5.2 The Distributio of the Normal Sample Mea 5.3 Normal data, cofidece iterval for, kow 5.4 Normal data, cofidece
More information1 of 7 7/16/2009 6:06 AM Virtual Laboratories > 6. Radom Samples > 1 2 3 4 5 6 7 6. Order Statistics Defiitios Suppose agai that we have a basic radom experimet, ad that X is a real-valued radom variable
More informationA statistical method to determine sample size to estimate characteristic value of soil parameters
A statistical method to determie sample size to estimate characteristic value of soil parameters Y. Hojo, B. Setiawa 2 ad M. Suzuki 3 Abstract Sample size is a importat factor to be cosidered i determiig
More informationThe Sample Variance Formula: A Detailed Study of an Old Controversy
The Sample Variace Formula: A Detailed Study of a Old Cotroversy Ky M. Vu PhD. AuLac Techologies Ic. c 00 Email: kymvu@aulactechologies.com Abstract The two biased ad ubiased formulae for the sample variace
More informationOutput Analysis (2, Chapters 10 &11 Law)
B. Maddah ENMG 6 Simulatio Output Aalysis (, Chapters 10 &11 Law) Comparig alterative system cofiguratio Sice the output of a simulatio is radom, the comparig differet systems via simulatio should be doe
More informationKLMED8004 Medical statistics. Part I, autumn Estimation. We have previously learned: Population and sample. New questions
We have previously leared: KLMED8004 Medical statistics Part I, autum 00 How kow probability distributios (e.g. biomial distributio, ormal distributio) with kow populatio parameters (mea, variace) ca give
More informationECONOMETRIC THEORY. MODULE XIII Lecture - 34 Asymptotic Theory and Stochastic Regressors
ECONOMETRIC THEORY MODULE XIII Lecture - 34 Asymptotic Theory ad Stochastic Regressors Dr. Shalabh Departmet of Mathematics ad Statistics Idia Istitute of Techology Kapur Asymptotic theory The asymptotic
More informationStatisticians use the word population to refer the total number of (potential) observations under consideration
6 Samplig Distributios Statisticias use the word populatio to refer the total umber of (potetial) observatios uder cosideratio The populatio is just the set of all possible outcomes i our sample space
More information9. Simulation. lect09.ppt S Introduction to Teletraffic Theory - Fall Literature
lect09.ppt S-38.45 - Itroductio to Teletraffic Theory - Fall 999 Literature I. Mitrai (98) Simulatio techiques for discrete evet systems Cambridge Uiversity Press, Cambridge A.M. Law ad W. D. Kelto (98,
More informationTopic 10: Introduction to Estimation
Topic 0: Itroductio to Estimatio Jue, 0 Itroductio I the simplest possible terms, the goal of estimatio theory is to aswer the questio: What is that umber? What is the legth, the reactio rate, the fractio
More information1 Introduction to reducing variance in Monte Carlo simulations
Copyright c 010 by Karl Sigma 1 Itroductio to reducig variace i Mote Carlo simulatios 11 Review of cofidece itervals for estimatig a mea I statistics, we estimate a ukow mea µ = E(X) of a distributio by
More informationLecture 4. Random variable and distribution of probability
Itroductio to theory of probability ad statistics Lecture. Radom variable ad distributio of probability dr hab.iż. Katarzya Zarzewsa, prof.agh Katedra Eletroii, AGH e-mail: za@agh.edu.pl http://home.agh.edu.pl/~za
More informationChapter 6. Sampling and Estimation
Samplig ad Estimatio - 34 Chapter 6. Samplig ad Estimatio 6.. Itroductio Frequetly the egieer is uable to completely characterize the etire populatio. She/he must be satisfied with examiig some subset
More informationCEE 522 Autumn Uncertainty Concepts for Geotechnical Engineering
CEE 5 Autum 005 Ucertaity Cocepts for Geotechical Egieerig Basic Termiology Set A set is a collectio of (mutually exclusive) objects or evets. The sample space is the (collectively exhaustive) collectio
More informationIt should be unbiased, or approximately unbiased. Variance of the variance estimator should be small. That is, the variance estimator is stable.
Chapter 10 Variace Estimatio 10.1 Itroductio Variace estimatio is a importat practical problem i survey samplig. Variace estimates are used i two purposes. Oe is the aalytic purpose such as costructig
More informationDistribution of Random Samples & Limit theorems
STAT/MATH 395 A - PROBABILITY II UW Witer Quarter 2017 Néhémy Lim Distributio of Radom Samples & Limit theorems 1 Distributio of i.i.d. Samples Motivatig example. Assume that the goal of a study is to
More informationReliability and Queueing
Copyright 999 Uiversity of Califoria Reliability ad Queueig by David G. Messerschmitt Supplemetary sectio for Uderstadig Networked Applicatios: A First Course, Morga Kaufma, 999. Copyright otice: Permissio
More information4. Basic probability theory
Cotets Basic cocepts Discrete radom variables Discrete distributios (br distributios) Cotiuous radom variables Cotiuous distributios (time distributios) Other radom variables Lect04.ppt S-38.45 - Itroductio
More information(6) Fundamental Sampling Distribution and Data Discription
34 Stat Lecture Notes (6) Fudametal Samplig Distributio ad Data Discriptio ( Book*: Chapter 8,pg5) Probability& Statistics for Egieers & Scietists By Walpole, Myers, Myers, Ye 8.1 Radom Samplig: Populatio:
More informationThis exam contains 19 pages (including this cover page) and 10 questions. A Formulae sheet is provided with the exam.
Probability ad Statistics FS 07 Secod Sessio Exam 09.0.08 Time Limit: 80 Miutes Name: Studet ID: This exam cotais 9 pages (icludig this cover page) ad 0 questios. A Formulae sheet is provided with the
More informationAxioms of Measure Theory
MATH 532 Axioms of Measure Theory Dr. Neal, WKU I. The Space Throughout the course, we shall let X deote a geeric o-empty set. I geeral, we shall ot assume that ay algebraic structure exists o X so that
More informationMATHEMATICAL SCIENCES PAPER-II
MATHEMATICAL SCIENCES PAPER-II. Let {x } ad {y } be two sequeces of real umbers. Prove or disprove each of the statemets :. If {x y } coverges, ad if {y } is coverget, the {x } is coverget.. {x + y } coverges
More informationInfinite Sequences and Series
Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet
More informationFirst come, first served (FCFS) Batch
Queuig Theory Prelimiaries A flow of customers comig towards the service facility forms a queue o accout of lack of capacity to serve them all at a time. RK Jaa Some Examples: Persos waitig at doctor s
More informationVector Quantization: a Limiting Case of EM
. Itroductio & defiitios Assume that you are give a data set X = { x j }, j { 2,,, }, of d -dimesioal vectors. The vector quatizatio (VQ) problem requires that we fid a set of prototype vectors Z = { z
More informationDepartment of Mathematics
Departmet of Mathematics Ma 3/103 KC Border Itroductio to Probability ad Statistics Witer 2017 Lecture 19: Estimatio II Relevat textbook passages: Larse Marx [1]: Sectios 5.2 5.7 19.1 The method of momets
More informationAMS570 Lecture Notes #2
AMS570 Lecture Notes # Review of Probability (cotiued) Probability distributios. () Biomial distributio Biomial Experimet: ) It cosists of trials ) Each trial results i of possible outcomes, S or F 3)
More informationEECS564 Estimation, Filtering, and Detection Hwk 2 Solns. Winter p θ (z) = (2θz + 1 θ), 0 z 1
EECS564 Estimatio, Filterig, ad Detectio Hwk 2 Sols. Witer 25 4. Let Z be a sigle observatio havig desity fuctio where. p (z) = (2z + ), z (a) Assumig that is a oradom parameter, fid ad plot the maximum
More information32 estimating the cumulative distribution function
32 estimatig the cumulative distributio fuctio 4.6 types of cofidece itervals/bads Let F be a class of distributio fuctios F ad let θ be some quatity of iterest, such as the mea of F or the whole fuctio
More informationBIOSTATISTICS. Lecture 5 Interval Estimations for Mean and Proportion. dr. Petr Nazarov
Microarray Ceter BIOSTATISTICS Lecture 5 Iterval Estimatios for Mea ad Proportio dr. Petr Nazarov 15-03-013 petr.azarov@crp-sate.lu Lecture 5. Iterval estimatio for mea ad proportio OUTLINE Iterval estimatios
More informationn n i=1 Often we also need to estimate the variance. Below are three estimators each of which is optimal in some sense: n 1 i=1 k=1 i=1 k=1 i=1 k=1
MATH88T Maria Camero Cotets Basic cocepts of statistics Estimators, estimates ad samplig distributios 2 Ordiary least squares estimate 3 3 Maximum lielihood estimator 3 4 Bayesia estimatio Refereces 9
More informationc. Explain the basic Newsvendor model. Why is it useful for SC models? e. What additional research do you believe will be helpful in this area?
1. Research Methodology a. What is meat by the supply chai (SC) coordiatio problem ad does it apply to all types of SC s? Does the Bullwhip effect relate to all types of SC s? Also does it relate to SC
More informationStat 319 Theory of Statistics (2) Exercises
Kig Saud Uiversity College of Sciece Statistics ad Operatios Research Departmet Stat 39 Theory of Statistics () Exercises Refereces:. Itroductio to Mathematical Statistics, Sixth Editio, by R. Hogg, J.
More informationNOTES ON DISTRIBUTIONS
NOTES ON DISTRIBUTIONS MICHAEL N KATEHAKIS Radom Variables Radom variables represet outcomes from radom pheomea They are specified by two objects The rage R of possible values ad the frequecy fx with which
More informationMOST PEOPLE WOULD RATHER LIVE WITH A PROBLEM THEY CAN'T SOLVE, THAN ACCEPT A SOLUTION THEY CAN'T UNDERSTAND.
XI-1 (1074) MOST PEOPLE WOULD RATHER LIVE WITH A PROBLEM THEY CAN'T SOLVE, THAN ACCEPT A SOLUTION THEY CAN'T UNDERSTAND. R. E. D. WOOLSEY AND H. S. SWANSON XI-2 (1075) STATISTICAL DECISION MAKING Advaced
More informationLecture 3. Properties of Summary Statistics: Sampling Distribution
Lecture 3 Properties of Summary Statistics: Samplig Distributio Mai Theme How ca we use math to justify that our umerical summaries from the sample are good summaries of the populatio? Lecture Summary
More informationFACULTY OF MATHEMATICAL STUDIES MATHEMATICS FOR PART I ENGINEERING. Lectures
FACULTY OF MATHEMATICAL STUDIES MATHEMATICS FOR PART I ENGINEERING Lectures MODULE 5 STATISTICS II. Mea ad stadard error of sample data. Biomial distributio. Normal distributio 4. Samplig 5. Cofidece itervals
More informationLecture 11 and 12: Basic estimation theory
Lecture ad 2: Basic estimatio theory Sprig 202 - EE 94 Networked estimatio ad cotrol Prof. Kha March 2 202 I. MAXIMUM-LIKELIHOOD ESTIMATORS The maximum likelihood priciple is deceptively simple. Louis
More informationConfidence interval for the two-parameter exponentiated Gumbel distribution based on record values
Iteratioal Joural of Applied Operatioal Research Vol. 4 No. 1 pp. 61-68 Witer 2014 Joural homepage: www.ijorlu.ir Cofidece iterval for the two-parameter expoetiated Gumbel distributio based o record values
More informationParameter, Statistic and Random Samples
Parameter, Statistic ad Radom Samples A parameter is a umber that describes the populatio. It is a fixed umber, but i practice we do ot kow its value. A statistic is a fuctio of the sample data, i.e.,
More informationJanuary 25, 2017 INTRODUCTION TO MATHEMATICAL STATISTICS
Jauary 25, 207 INTRODUCTION TO MATHEMATICAL STATISTICS Abstract. A basic itroductio to statistics assumig kowledge of probability theory.. Probability I a typical udergraduate problem i probability, we
More information6. Sufficient, Complete, and Ancillary Statistics
Sufficiet, Complete ad Acillary Statistics http://www.math.uah.edu/stat/poit/sufficiet.xhtml 1 of 7 7/16/2009 6:13 AM Virtual Laboratories > 7. Poit Estimatio > 1 2 3 4 5 6 6. Sufficiet, Complete, ad Acillary
More informationMathacle. PSet Stats, Concepts In Statistics Level Number Name: Date:
PSet ----- Stats, Cocepts I Statistics 7.3. Cofidece Iterval for a Mea i Oe Sample [MATH] The Cetral Limit Theorem. Let...,,, be idepedet, idetically distributed (i.i.d.) radom variables havig mea µ ad
More information9. Simulation. Contents
9. Simulatio lect09.ppt S-38.45 - Itroductio to Teletraffic Theory - Fall 000 9. Simulatio Cotets Itroductio Geeratio of realizatios of the traffic process Geeratio of realizatios of radom variables Collectio
More informationLecture 7: Properties of Random Samples
Lecture 7: Properties of Radom Samples 1 Cotiued From Last Class Theorem 1.1. Let X 1, X,...X be a radom sample from a populatio with mea µ ad variace σ
More informationChapter 6 Principles of Data Reduction
Chapter 6 for BST 695: Special Topics i Statistical Theory. Kui Zhag, 0 Chapter 6 Priciples of Data Reductio Sectio 6. Itroductio Goal: To summarize or reduce the data X, X,, X to get iformatio about a
More informationCS284A: Representations and Algorithms in Molecular Biology
CS284A: Represetatios ad Algorithms i Molecular Biology Scribe Notes o Lectures 3 & 4: Motif Discovery via Eumeratio & Motif Represetatio Usig Positio Weight Matrix Joshua Gervi Based o presetatios by
More information