DYNAMIC PROGRAMMING. Dynamic Programming. Costs. Prototype example. Solving the problem. Formulation
|
|
- Leslie Emma McCoy
- 5 years ago
- Views:
Transcription
1 DYNAMIC PROGRAMMING Dyamc Programmg It s a useful mathematcal techque for makg a sequece of terrelated decsos. Systematc procedure for determg the optmal combato of decsos. There s o stadard mathematcal formulato of the Dyamc Programmg problem. Kowg whe to apply dyamc programmg depeds largely o experece wth ts geeral structure. João Mguel da Costa Sousa / Alexadra Moutho 03 Prototype example Costs Cost c j of gog from state to state j s: Stagecoach problem Fortue seeker wats to go from Mssour (A) to Calfora (J) the md 9th cetury. Jourey has 4 stages. Cost s the lfe surace of a specfc route; lowest cost s equvalet to safest trp. João Mguel da Costa Sousa / Alexadra Moutho 04 B C D E F G H I J A 4 3 B E 4 H 3 C 3 4 F 6 3 I 4 D 4 5 G 3 3 Problem: whch route mmzes the total cost of the polcy? João Mguel da Costa Sousa / Alexadra Moutho 05 Solvg the problem Note that greedy approach does ot work. Soluto A B F I J has total cost of 3. However, e.g. A D F s cheaper tha A B F. Other possblty: tral ad error. Too much effort eve for ths smple problem. Dyamc programmg s much more effcet tha exhaustve eumerato, especally for large problems. Starts from the last stage of the problem, ad elarges t oe stage at a tme. João Mguel da Costa Sousa / Alexadra Moutho 06 Formulato Decso varables x ( =,, 3, 4) are the mmedate destato of stage. Route s A x x x 3 x 4, where x 4 = J. Total cost of the best overall polcy for the remag stages s f (s, x ) Actual state s s, ready to start stage, selectg x as the mmedate destato. x mmzes f (s, x ) ad f (s, x ) s the mmum value of f (s, x ): f () s = m f (, s x ) = f (, s x ) x João Mguel da Costa Sousa / Alexadra Moutho 07
2 Formulato Soluto procedure where f( s, x) = mmedate cost (stage ) + mmum future cost (stages + oward) ( ) = c + sx f + x Value of c sx gve by c j where = s (curret state) ad j = x (mmedate destato). Objectve: fd f (A) ad the correspodg route. Dyamc programmg fds successvely f 4 (s), f 3 (s), f (s) ad fally f (A). Whe = 4, the route s determed by ts curret state s (H or I) ad ts fal destato J. Sce f 4 (s) = f 4 (s, J) = c sj, the soluto for = 4: s f 4 (s) x 4 H 3 J I 4 J João Mguel da Costa Sousa / Alexadra Moutho 08 João Mguel da Costa Sousa / Alexadra Moutho 09 Stage = 3 Needs a few calculatos. If fortue seeker s state F, he ca go to ether H or I wth costs c F,H = 6 or c F,I = 3. Choosg H, the mmum addtoal cost s f 4 (H) = 3. Total cost s = 9. Choosg I, the total cost s = 7. Ths s smaller, ad t s the optmal choce for state F. Stage = 3 Smlar calculatos ca be made for the two possble states s = E ad s = G, resultg the table for = 3: f 3 (s, x 3 ) = c sx3 + f 4 (x 3 ) s x 3 H I f 3 (s) x 3 E H F I G H João Mguel da Costa Sousa / Alexadra Moutho 0 João Mguel da Costa Sousa / Alexadra Moutho Stage = I ths case, f (s, x ) = c sx + f 3 (x ). Example for ode C: x = E: f (C, E) = c C,E + f 3 (E) = = 7 optmal x = F: f (C, F) = c C,F + f 3 (F) = + 7 = 9. x = G: f (C, G) = c C,G + f 3 (G) = = 0. Stage = Smlar calculatos ca be made for the two possble states s = B ad s = D, resultg the table for = : f (s,, x ) = c + f 3 (x sx ) s x E F G f (s) x B E or F C E D E or F João Mguel da Costa Sousa / Alexadra Moutho João Mguel da Costa Sousa / Alexadra Moutho 3
3 Stage = Just oe possble startg state: A. x = B: f (A, B) = c A,B + f (B) = + = 3. x = C: f (A, C) = c A,C + f (C) = = optmal x = D: f (A, D) = c A,D + f (D) = = optmal Optmal soluto Three optmal solutos, all wth f (A) = : Results the table: s x f (s, x ) = c sx + f (x ) B C D f (s) x A 3 C or D João Mguel da Costa Sousa / Alexadra Moutho 4 João Mguel da Costa Sousa / Alexadra Moutho 5 Characterstcs of DP. The problem ca be dvded to stages, wth a polcy decso requred at each stage. Example: 4 stages ad lfe surace polcy to choose. Dyamc programmg problems requre makg a sequece of terrelated decsos.. Each stage has a umber of states assocated wth the begg of each stage. Example: states are the possble terrtores where the fortue seeker could be located. States are possble codtos whch the system mght be. Characterstcs of DP 3. Polcy decso trasforms the curret state to a state assocated wth the begg of the ext stage. Example: fortue seeker s decso led hm from hs curret state to the ext state o hs jourey. DP problems ca be terpreted terms of etworks: each ode correspod to a state. Value assged to each lk s the mmedate cotrbuto to the objectve fucto from makg that polcy decso. I most cases, objectve correspods to fdg the shortest or the logest path. João Mguel da Costa Sousa / Alexadra Moutho 6 João Mguel da Costa Sousa / Alexadra Moutho 7 Characterstcs of DP 4. The soluto procedure fds a optmal polcy for the overall problem. Fds a prescrpto of the optmal polcy decso at each stage for each of the possble states. Example: soluto procedure costructed a table for each stage,, that prescrbed the optmal decso, x, for each possble state s. I addto to detfyg optmal solutos, DP provdes a polcy prescrpto of what to do uder every possble crcumstace (why a decso s called polcy decso). Ths s useful for sestvty aalyss. João Mguel da Costa Sousa / Alexadra Moutho 8 Characterstcs of DP 5. Gve the curret state, a optmal polcy for the remag stages s depedet of the polcy decsos adopted prevous stages. Optmal mmedate decso depeds oly o curret state ad ot o how t was obtaed: ths s the prcple of optmalty for DP. Example: at ay state, the surace polcy s depedet o how the fortue seeker got there. Kowledge of the curret state coveys all formato ecessary for determg the optmal polcy heceforth (Markova property). Problems lackg ths property are ot Dyamc Programmg Problems. João Mguel da Costa Sousa / Alexadra Moutho 9 3
4 Characterstcs of DP 6. Soluto procedure begs by fdg the optmal polcy for the last stage. Soluto s usually trval. 7. A recursve relatoshp that detfes optmal polcy for stage, gve optmal polcy for stage +, s avalable. Example: recursve relatoshp was { + } f () s = m c + f ( x ) sx x Recursve relatoshp dffers somewhat amog dyamc programmg problems. João Mguel da Costa Sousa / Alexadra Moutho 0 Characterstcs of DP 7. (cot.) Notato: N = umber of stages. = label for curret stage ( =,,, N). s = curret stae t for stage. x = decso varable for stage. x = optmal value of x (gve s ). f ( s, x ) = cotrbuto of stages, +,, N to objectve f ( s ) = f ( s, x ) fucto f system starts state s at stage, mmedate decso s x, ad optmal decsos are made thereafter. João Mguel da Costa Sousa / Alexadra Moutho Characterstcs of DP 7. (cot.) Recursve relatoshp: f ( s ) = max { f ( s, x )} or f ( s ) = m { f ( s, x )} x x where f (s, x ) s wrtte terms of s, x, f, ad + ( s+ ) probably some measure of the mmedate cotrbuto of x to the objectve fucto. 8. Usg recursve relatoshp, soluto procedure starts at the ed ad moves backward stage by stage. Stops whe optmal polcy startg at tal stage s foud. The optmal polcy for the etre problem s foud. Example: the tables for the stages show ths procedure. João Mguel da Costa Sousa / Alexadra Moutho Characterstcs of DP 8. (cot.) For DP problems, a table such as the followg would be obtaed for each stage ( = N, N,, ): s x f (s, x ) f ( s ) João Mguel da Costa Sousa / Alexadra Moutho 3 x Determstc dyamc programmg Determstc problems: the state at the ext stage s completely determed by the state ad polcy decso at the curret stage. Form of the objectve fucto: mmze or maxmze the sum, product, etc. of the cotrbutos from the dvdual stages. Set of states: may be dscrete or cotuous, or a state vector. Decso varables ca also be dscrete or cotuous. João Mguel da Costa Sousa / Alexadra Moutho 4 Example: dstrbutg medcal teams The World Health Coucl has fve medcal teams to allocate to three uderdeveloped coutres. Measure of performace: addtoal perso years of lfe,.e., creased lfe expectacy ( years) tmes coutry s populato. Thousads of addtoal perso years of lfe Coutry Medcal teams João Mguel da Costa Sousa / Alexadra Moutho 5 4
5 Formulato of the problem States to be cosdered Problem requres three terrelated decsos: how may teams to allocate to the three coutres (stages). x s the umber of teams to allocate to stage. What are the states? What chages from oe stage to aother? s = umber of medcal teams stll avalable for remag coutres (,, 3). Thus: s = 5, s = 5 x = s x, s 3 = s x. Thousads of addtoal perso years of lfe Coutry Medcal teams João Mguel da Costa Sousa / Alexadra Moutho 6 João Mguel da Costa Sousa 7 Overall problem Polcy p (x ): measure of performace from allocatg x medcal teams to coutry. 3 = Maxmze p( x ), subject to Recursve relatoshp relatg fuctos: { + } f ( s ) = max p ( x ) + f ( s x ), for =, x= 0,,, s f ( s ) = max p ( x ) x = 0,,, s 3 ad x 3 = x = 5, are oegatve tegers. João Mguel da Costa Sousa / Alexadra Moutho 8 João Mguel da Costa Sousa / Alexadra Moutho 9 Soluto procedure, stage = 3 For last stage = 3, values of p 3 (x 3 ) are the last colum of table. Here, x 3 = s 3 ad f 3 (s 3 )= p 3 (s 3 ). Stage = Here, fdg x requres calculatg f (s, x ) for the values of x = 0,,, s. Example for s = : Medcal teams Thousads of addtoal perso years of lfe Coutry = 3: s 3 f 3 (s 3 ) x Medcal teams Thousads of addtoal perso years of lfe Coutry State: João Mguel da Costa Sousa / Alexadra Moutho 30 João Mguel da Costa Sousa / Alexadra Moutho 3 5
6 Stage = Smlar calculatos ca be made for the other values of s : f (s, x ) = p (x ) + f 3 (s x ) = : s x f (s ) x or João Mguel da Costa Sousa / Alexadra Moutho 3 Stage = Oly state s the startg state s = 5: State: Thousads of addtoal perso years of lfe Coutry Medcal teams = : s x f (s, x ) = p (x ) + f (s x ) f (s ) x João Mguel da Costa Sousa / Alexadra Moutho 33 Optmal polcy decso Dstrbuto of effort problem Oe kd of resource s allocated to a umber of actvtes. Objectve: how to dstrbute the effort (resource) amog the actvtes most effectvely. DP volves oly oe (or few) resources, whle LP ca deal wth thousads of resources. The assumptos of LP: proportoalty, dvsblty ad certaty ca be volated by DP. Oly addtvty (or aalogous for product of terms) s ecessary because of the prcple of optmalty. World Health Coucl problem volates proportoalty ad dvsblty (WHY?) João Mguel da Costa Sousa 34 João Mguel da Costa Sousa / Alexadra Moutho 35 Formulato of dstrbuto of effort Stage = actvty ( =,,, N). x = amout of resource allocated to actvty. State s = amout of resource stll avalable for allocato to remag actvtes (,, N). Whe system starts at stage state s, choce x results the ext state at stage + beg s + = s x : Stage: + State: s x s x Example Dstrbutg scetsts to research teams 3 teams are solvg egeerg problem to safely fly people to Mars. extra scetsts reduce the probablty of falure. Probablty of falure Team New scetsts João Mguel da Costa Sousa / Alexadra Moutho 36 João Mguel da Costa Sousa / Alexadra Moutho 37 6
7 Cotuous dyamc programmg Prevous examples had a dscrete state varable s, at each stage. They all have bee reversble; the soluto procedure could have moved backward or forward stage by stage. Next example s cotuous. As s ca take ay values certa tervals, the solutos f (s ) ad x must be expressed as fuctos of s. Stages the ext example wll correspod to tme perods, so the soluto must proceed backwards. Example: schedulg jobs The compay Local Job Shop eeds to schedule employmet jobs due to seasoal fluctuatos. Mache operators are dffcult to hre ad costly to tra. Peak seaso payroll should ot be mataed afterwards. Overtme work o a regular bass should be avoded. Mmum requremets ear future: Seaso Sprg Summer Autum Wter Sprg Requremets João Mguel da Costa Sousa / Alexadra Moutho 38 João Mguel da Costa Sousa / Alexadra Moutho 39 Example: schedulg jobs Formulato Employmet above level the table costs $,000 per perso per seaso. Total cost of chagg level of employmet from oe seaso to the other s $00 tmes the square of the dfferece employmet levels. Fractoal levels are possble due to part tme employees. From data, maxmum employmet should be 55 (sprg). It s ecessary to fd the level of employmet for other seasos. Seasos are stages. Oe cycle of four seasos, where stage s summer ad stage 4 s sprg (kow employmet). x = employmet level for stage ( =,,3,4); x 4 =55 r = mmum employmet requremet for stage : r =0, r =40, r 3 =00, r 4 =55. Thus: r x 55 João Mguel da Costa Sousa / Alexadra Moutho 40 João Mguel da Costa Sousa / Alexadra Moutho 4 Formulato Cost for stage = 00(x x ) + 000(x r ) State s : employmet the precedg seaso x s = x (=: s = x 0 = x 4 = 55) Problem: Choose x, x ad x 3 as to 4 x x + x r = mmze 000( ) 00( ), subject to r x 55, for =,,3,4 Data Choose x, x ad x 3 as to 4 x x + x r = mmze 000( ) 00( ), subject to r x 55, for =,,3,4 r Feasble x Possble s = x Cost 0 0 x 55 s = 55 00(x 55) + 000(x 0) x 55 0 s 55 00(x x ) + 000(x 40) x s (x 3 x ) + 000(x 3 00) 4 55 x 4 = s (55 x 3 ) João Mguel da Costa Sousa / Alexadra Moutho 4 João Mguel da Costa Sousa / Alexadra Moutho 43 7
8 Formulato Recursve relatoshp: Basc structure of the problem: { + } f ( s ) = m 00( x s ) + 000( x r ) + f ( x ) r x 55 Soluto procedure r Feasble x Possble s = x Cost 0 0 x 55 s = 55 00(x 55) + 000(x 0) x 55 0 s 55 00(x x ) + 000(x 40) x s (x 3 x ) + 000(x 3 00) 4 55 x 4 = s (55 x 3) Stage 4: the soluto s kow to be x 4 = 55. s 4 f 4 (s 4 ) x 4 00 s (55 s 4 ) 55 João Mguel da Costa Sousa / Alexadra Moutho 44 João Mguel da Costa Sousa / Alexadra Moutho 45 Soluto procedure Graphcal soluto for f 3 (x 3 ) r Feasble x Possble s = x Cost 0 0 x 55 s = 55 00(x 55) + 000(x 0) x 55 0 s 55 00(x x ) + 000(x 40) x s (x 3 x ) + 000(x 3 00) 4 55 x 4 = s (55 x 3 ) Stage 3: 40 s 3 55: { } f ( s ) = m 00( x s ) + 000( x 00) + f ( x ) x x3 55 { x3 s3 x3 x3 } = m 00( ) + 000( 00) + 00(55 ) João Mguel da Costa Sousa / Alexadra Moutho 46 João Mguel da Costa Sousa / Alexadra Moutho 47 Calculus soluto for f 3 (x 3 ) Usg calculus: f3( s3, x3) = 400( x3 s3) (55 x3) x3 = 400(x3 s3 50) = 0 s x3 = Guaratees mmum? s 3 f 3 (s 3 ) x 3 40 s (50 s 3 ) +50(60 s 3 ) +000(s 3 50) (s 3 +50)/ Stage Solved a smlar fasho, wth f( s, x) = 00( x s) + 000( x r) + f3 ( x3) = 00( x s) + 000( x 40) + 50(50 x ) + 50(60 x ) + 000( x 50) for 0 s 55 (possble values) ad 40 x 55 (feasble values). Solvg / x [f (s, x )] = 0, yelds: s + 40 x = 3 João Mguel da Costa Sousa / Alexadra Moutho 48 João Mguel da Costa Sousa / Alexadra Moutho 49 8
9 Stage The soluto has to be feasble for 0 s 55 (.e., 40 x 55 for 0 s 55 )! s + 40 x = oly feasble for 40 s Need d to solve for feasble value of x that t mmzes f (s, x ) whe 0 s 40. For s 40, so x = 40. x f ( s, x ) > 0 for 40 x 55 Why? João Mguel da Costa Sousa / Alexadra Moutho 50 Stage ad Stage s f (s ) x 0 s 40 00(40 s ) s 55 00/9[(40 s ) +(55 s ) (70 s ) ]+000(s 95) Stage : procedure s smlar. (s +40)/ Soluto: x = 47.5, x = 45, x 3 = 47.5, x 4 = 55 Total cost of $85,000 s f (s ) x How? João Mguel da Costa Sousa / Alexadra Moutho 5 Determstc cotuous problem Cosder the followg olear programmg problem: Maxmze Z x x, subject to x x. (There are o oegatvty costrats.) Use dyamc programmg to solve ths problem. Probablstc dyamc programmg State at ext stage s ot completely determed by state ad polcy decso at curret stage. There s a probablty dstrbuto for determg the ext state, see fgure. S = umber of possble states at stage +. system goes to ( =,,,S) wth probablty p gve state s ad decso x at stage. C = cotrbuto of stage to objectve fucto. If fgure s expaded to all possble states ad decsos at all stages, t s a decso tree. João Mguel da Costa Sousa / Alexadra Moutho 5 João Mguel da Costa Sousa / Alexadra Moutho 53 Basc structure Probablstc dyamc programmg Relato betwee f (s, x ) ad f + (s + ) depeds upo form of overall objectve fucto. Example: mmze the expected sum of the cotrbutos from dvdual stages. f (s, x ) s the mmum expected sum from stage oward, gve state s ad polcy decso x at stage : wth S = + + = f ( s, x ) p C f ( ) f () = m f (, x ) + x João Mguel da Costa Sousa / Alexadra Moutho 54 João Mguel da Costa Sousa / Alexadra Moutho 55 9
10 Example: determg reject allowaces The Ht ad Mss Maufacturg Compay receved a order to supply tem of a partcular type. Customer requres specfed strget qualty requremets. Maufacturer has to produce more tha oe to acheve oe acceptable. Number of extra tems s the reject allowace. Probablty of acceptable or defectve s ½. Number of acceptable tems a lot of sze L has a bomal dstrbuto: probablty of ot acceptable tems s (/) L. Setup cost = $300, cost per tem = $00. Maxmum producto rus = 3. Cost of o acceptable tem after 3 rus = $,600. João Mguel da Costa Sousa / Alexadra Moutho 56 Formulato Objectve: determe polcy regardg lot sze (+reject allowace) for requred producto ru(s) that mmzes total expected cost. Stage = producto ru ( =,,3), x = lot sze for stage, State s = umber of acceptable tems stll eeded ( or 0) at the begg of stage. At stage, state s =. João Mguel da Costa Sousa / Alexadra Moutho 57 Formulato f (s, x ) = total expected cost for stages,,3 ad optmal decsos are: f ( s) = m f( s, x) x = 0,, f (0) = 0. Moetary t ut s $00. Cotrbuto t to cost from stage s [K(x ) + x ], wth 0, f x = 0 Kx ( ) = 3, f x > 0 Note that f 4 () = 6. João Mguel da Costa Sousa / Alexadra Moutho 58 Basc structure of the problem Recursve relatoshp: x { + } f () = m K( x ) + x f () x = 0,,, for =,,3 João Mguel da Costa Sousa / Alexadra Moutho 59 Soluto procedure s 3 x 3 f 3 (, x 3 ) = K(x 3 ) + x 3 + (/) x 36 = 3: f 3 (s 3 ) x or 4 f (, x ) = K(x ) + x +(/) x f3 () s x = : f (s x ) or 3 s x f (, x ) = K(x ) + x +(/) x f () = : f (s ) x Optmal soluto? João Mguel da Costa Sousa / Alexadra Moutho 60 Probablstc problem A eterprsg youg statstca beleves that she has developed a system for wg a popular Las Vegas game. Her colleagues do ot beleve that her system works, so they have made a large bet wth her that f she starts wth three chps, she wll ot have at least fve chps after three plays of the game. Each play of the game volves bettg ay desred umber of avalable chps ad the ether wg or losg ths umber of chps. The statstca beleves that her system wll gve her a probablty of /3 of wg a gve play of the game. Assumg the statstca s correct, use dyamc programmg to determe her optmal polcy regardg how may chps to bet (f ay) at each of the three plays of the game. The decso at each play should take to accout the results of earler plays. The objectve s to maxmze the probablty of wg her bet wth her colleagues. João Mguel da Costa Sousa / Alexadra Moutho 6 0
Solving Constrained Flow-Shop Scheduling. Problems with Three Machines
It J Cotemp Math Sceces, Vol 5, 2010, o 19, 921-929 Solvg Costraed Flow-Shop Schedulg Problems wth Three Maches P Pada ad P Rajedra Departmet of Mathematcs, School of Advaced Sceces, VIT Uversty, Vellore-632
More informationFunctions of Random Variables
Fuctos of Radom Varables Chapter Fve Fuctos of Radom Varables 5. Itroducto A geeral egeerg aalyss model s show Fg. 5.. The model output (respose) cotas the performaces of a system or product, such as weght,
More information(b) By independence, the probability that the string 1011 is received correctly is
Soluto to Problem 1.31. (a) Let A be the evet that a 0 s trasmtted. Usg the total probablty theorem, the desred probablty s P(A)(1 ɛ ( 0)+ 1 P(A) ) (1 ɛ 1)=p(1 ɛ 0)+(1 p)(1 ɛ 1). (b) By depedece, the probablty
More informationCHAPTER VI Statistical Analysis of Experimental Data
Chapter VI Statstcal Aalyss of Expermetal Data CHAPTER VI Statstcal Aalyss of Expermetal Data Measuremets do ot lead to a uque value. Ths s a result of the multtude of errors (maly radom errors) that ca
More informationLecture 3. Sampling, sampling distributions, and parameter estimation
Lecture 3 Samplg, samplg dstrbutos, ad parameter estmato Samplg Defto Populato s defed as the collecto of all the possble observatos of terest. The collecto of observatos we take from the populato s called
More informationThird handout: On the Gini Index
Thrd hadout: O the dex Corrado, a tala statstca, proposed (, 9, 96) to measure absolute equalt va the mea dfferece whch s defed as ( / ) where refers to the total umber of dvduals socet. Assume that. The
More information{ }{ ( )} (, ) = ( ) ( ) ( ) Chapter 14 Exercises in Sampling Theory. Exercise 1 (Simple random sampling): Solution:
Chapter 4 Exercses Samplg Theory Exercse (Smple radom samplg: Let there be two correlated radom varables X ad A sample of sze s draw from a populato by smple radom samplg wthout replacemet The observed
More informationContinuous Distributions
7//3 Cotuous Dstrbutos Radom Varables of the Cotuous Type Desty Curve Percet Desty fucto, f (x) A smooth curve that ft the dstrbuto 3 4 5 6 7 8 9 Test scores Desty Curve Percet Probablty Desty Fucto, f
More informationf f... f 1 n n (ii) Median : It is the value of the middle-most observation(s).
CHAPTER STATISTICS Pots to Remember :. Facts or fgures, collected wth a defte pupose, are called Data.. Statstcs s the area of study dealg wth the collecto, presetato, aalyss ad terpretato of data.. The
More informationChapter 9 Jordan Block Matrices
Chapter 9 Jorda Block atrces I ths chapter we wll solve the followg problem. Gve a lear operator T fd a bass R of F such that the matrx R (T) s as smple as possble. f course smple s a matter of taste.
More informationIntroduction to local (nonparametric) density estimation. methods
Itroducto to local (oparametrc) desty estmato methods A slecture by Yu Lu for ECE 66 Sprg 014 1. Itroducto Ths slecture troduces two local desty estmato methods whch are Parze desty estmato ad k-earest
More informationmeans the first term, a2 means the term, etc. Infinite Sequences: follow the same pattern forever.
9.4 Sequeces ad Seres Pre Calculus 9.4 SEQUENCES AND SERIES Learg Targets:. Wrte the terms of a explctly defed sequece.. Wrte the terms of a recursvely defed sequece. 3. Determe whether a sequece s arthmetc,
More informationSummary of the lecture in Biostatistics
Summary of the lecture Bostatstcs Probablty Desty Fucto For a cotuos radom varable, a probablty desty fucto s a fucto such that: 0 dx a b) b a dx A probablty desty fucto provdes a smple descrpto of the
More informationA New Family of Transformations for Lifetime Data
Proceedgs of the World Cogress o Egeerg 4 Vol I, WCE 4, July - 4, 4, Lodo, U.K. A New Famly of Trasformatos for Lfetme Data Lakhaa Watthaacheewakul Abstract A famly of trasformatos s the oe of several
More informationChapter 14 Logistic Regression Models
Chapter 4 Logstc Regresso Models I the lear regresso model X β + ε, there are two types of varables explaatory varables X, X,, X k ad study varable y These varables ca be measured o a cotuous scale as
More informationOrdinary Least Squares Regression. Simple Regression. Algebra and Assumptions.
Ordary Least Squares egresso. Smple egresso. Algebra ad Assumptos. I ths part of the course we are gog to study a techque for aalysg the lear relatoshp betwee two varables Y ad X. We have pars of observatos
More informationFor combinatorial problems we might need to generate all permutations, combinations, or subsets of a set.
Addtoal Decrease ad Coquer Algorthms For combatoral problems we mght eed to geerate all permutatos, combatos, or subsets of a set. Geeratg Permutatos If we have a set f elemets: { a 1, a 2, a 3, a } the
More informationThe Mathematical Appendix
The Mathematcal Appedx Defto A: If ( Λ, Ω, where ( λ λ λ whch the probablty dstrbutos,,..., Defto A. uppose that ( Λ,,..., s a expermet type, the σ-algebra o λ λ λ are defed s deoted by ( (,,...,, σ Ω.
More informationDepartment of Agricultural Economics. PhD Qualifier Examination. August 2011
Departmet of Agrcultural Ecoomcs PhD Qualfer Examato August 0 Istructos: The exam cossts of sx questos You must aswer all questos If you eed a assumpto to complete a questo, state the assumpto clearly
More informationLecture 9: Tolerant Testing
Lecture 9: Tolerat Testg Dael Kae Scrbe: Sakeerth Rao Aprl 4, 07 Abstract I ths lecture we prove a quas lear lower boud o the umber of samples eeded to do tolerat testg for L dstace. Tolerat Testg We have
More informationLecture 2 - What are component and system reliability and how it can be improved?
Lecture 2 - What are compoet ad system relablty ad how t ca be mproved? Relablty s a measure of the qualty of the product over the log ru. The cocept of relablty s a exteded tme perod over whch the expected
More informationECONOMETRIC THEORY. MODULE VIII Lecture - 26 Heteroskedasticity
ECONOMETRIC THEORY MODULE VIII Lecture - 6 Heteroskedastcty Dr. Shalabh Departmet of Mathematcs ad Statstcs Ida Isttute of Techology Kapur . Breusch Paga test Ths test ca be appled whe the replcated data
More informationAnalysis of System Performance IN2072 Chapter 5 Analysis of Non Markov Systems
Char for Network Archtectures ad Servces Prof. Carle Departmet of Computer Scece U Müche Aalyss of System Performace IN2072 Chapter 5 Aalyss of No Markov Systems Dr. Alexader Kle Prof. Dr.-Ig. Georg Carle
More informationRandom Variables and Probability Distributions
Radom Varables ad Probablty Dstrbutos * If X : S R s a dscrete radom varable wth rage {x, x, x 3,. } the r = P (X = xr ) = * Let X : S R be a dscrete radom varable wth rage {x, x, x 3,.}.If x r P(X = x
More information12.2 Estimating Model parameters Assumptions: ox and y are related according to the simple linear regression model
1. Estmatg Model parameters Assumptos: ox ad y are related accordg to the smple lear regresso model (The lear regresso model s the model that says that x ad y are related a lear fasho, but the observed
More informationMEASURES OF DISPERSION
MEASURES OF DISPERSION Measure of Cetral Tedecy: Measures of Cetral Tedecy ad Dsperso ) Mathematcal Average: a) Arthmetc mea (A.M.) b) Geometrc mea (G.M.) c) Harmoc mea (H.M.) ) Averages of Posto: a) Meda
More informationDiscrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand DIS 10b
CS 70 Dscrete Mathematcs ad Probablty Theory Fall 206 Sesha ad Walrad DIS 0b. Wll I Get My Package? Seaky delvery guy of some compay s out delverg packages to customers. Not oly does he had a radom package
More informationFeature Selection: Part 2. 1 Greedy Algorithms (continued from the last lecture)
CSE 546: Mache Learg Lecture 6 Feature Selecto: Part 2 Istructor: Sham Kakade Greedy Algorthms (cotued from the last lecture) There are varety of greedy algorthms ad umerous amg covetos for these algorthms.
More informationCS286.2 Lecture 4: Dinur s Proof of the PCP Theorem
CS86. Lecture 4: Dur s Proof of the PCP Theorem Scrbe: Thom Bohdaowcz Prevously, we have prove a weak verso of the PCP theorem: NP PCP 1,1/ (r = poly, q = O(1)). Wth ths result we have the desred costat
More informationSimple Linear Regression
Statstcal Methods I (EST 75) Page 139 Smple Lear Regresso Smple regresso applcatos are used to ft a model descrbg a lear relatoshp betwee two varables. The aspects of least squares regresso ad correlato
More informationChapter 5 Properties of a Random Sample
Lecture 6 o BST 63: Statstcal Theory I Ku Zhag, /0/008 Revew for the prevous lecture Cocepts: t-dstrbuto, F-dstrbuto Theorems: Dstrbutos of sample mea ad sample varace, relatoshp betwee sample mea ad sample
More informationLecture Notes Types of economic variables
Lecture Notes 3 1. Types of ecoomc varables () Cotuous varable takes o a cotuum the sample space, such as all pots o a le or all real umbers Example: GDP, Polluto cocetrato, etc. () Dscrete varables fte
More informationSTATISTICAL PROPERTIES OF LEAST SQUARES ESTIMATORS. x, where. = y - ˆ " 1
STATISTICAL PROPERTIES OF LEAST SQUARES ESTIMATORS Recall Assumpto E(Y x) η 0 + η x (lear codtoal mea fucto) Data (x, y ), (x 2, y 2 ),, (x, y ) Least squares estmator ˆ E (Y x) ˆ " 0 + ˆ " x, where ˆ
More informationMultiple Regression. More than 2 variables! Grade on Final. Multiple Regression 11/21/2012. Exam 2 Grades. Exam 2 Re-grades
STAT 101 Dr. Kar Lock Morga 11/20/12 Exam 2 Grades Multple Regresso SECTIONS 9.2, 10.1, 10.2 Multple explaatory varables (10.1) Parttog varablty R 2, ANOVA (9.2) Codtos resdual plot (10.2) Trasformatos
More informationMultiple Choice Test. Chapter Adequacy of Models for Regression
Multple Choce Test Chapter 06.0 Adequac of Models for Regresso. For a lear regresso model to be cosdered adequate, the percetage of scaled resduals that eed to be the rage [-,] s greater tha or equal to
More informationAssignment 5/MATH 247/Winter Due: Friday, February 19 in class (!) (answers will be posted right after class)
Assgmet 5/MATH 7/Wter 00 Due: Frday, February 9 class (!) (aswers wll be posted rght after class) As usual, there are peces of text, before the questos [], [], themselves. Recall: For the quadratc form
More informationBounds on the expected entropy and KL-divergence of sampled multinomial distributions. Brandon C. Roy
Bouds o the expected etropy ad KL-dvergece of sampled multomal dstrbutos Brado C. Roy bcroy@meda.mt.edu Orgal: May 18, 2011 Revsed: Jue 6, 2011 Abstract Iformato theoretc quattes calculated from a sampled
More informationLikewise, properties of the optimal policy for equipment replacement & maintenance problems can be used to reduce the computation.
Whe solvg a vetory repleshmet problem usg a MDP model, kowg that the optmal polcy s of the form (s,s) ca reduce the computatoal burde. That s, f t s optmal to replesh the vetory whe the vetory level s,
More informationUNIVERSITY OF OSLO DEPARTMENT OF ECONOMICS
UNIVERSITY OF OSLO DEPARTMENT OF ECONOMICS Postpoed exam: ECON430 Statstcs Date of exam: Jauary 0, 0 Tme for exam: 09:00 a.m. :00 oo The problem set covers 5 pages Resources allowed: All wrtte ad prted
More informationSTA302/1001-Fall 2008 Midterm Test October 21, 2008
STA3/-Fall 8 Mdterm Test October, 8 Last Name: Frst Name: Studet Number: Erolled (Crcle oe) STA3 STA INSTRUCTIONS Tme allowed: hour 45 mutes Ads allowed: A o-programmable calculator A table of values from
More informationLINEAR REGRESSION ANALYSIS
LINEAR REGRESSION ANALYSIS MODULE V Lecture - Correctg Model Iadequaces Through Trasformato ad Weghtg Dr. Shalabh Departmet of Mathematcs ad Statstcs Ida Isttute of Techology Kapur Aalytcal methods for
More informationPoint Estimation: definition of estimators
Pot Estmato: defto of estmators Pot estmator: ay fucto W (X,..., X ) of a data sample. The exercse of pot estmato s to use partcular fuctos of the data order to estmate certa ukow populato parameters.
More informationChapter 4 (Part 1): Non-Parametric Classification (Sections ) Pattern Classification 4.3) Announcements
Aoucemets No-Parametrc Desty Estmato Techques HW assged Most of ths lecture was o the blacboard. These sldes cover the same materal as preseted DHS Bometrcs CSE 90-a Lecture 7 CSE90a Fall 06 CSE90a Fall
More informationSTA 105-M BASIC STATISTICS (This is a multiple choice paper.)
DCDM BUSINESS SCHOOL September Mock Eamatos STA 0-M BASIC STATISTICS (Ths s a multple choce paper.) Tme: hours 0 mutes INSTRUCTIONS TO CANDIDATES Do ot ope ths questo paper utl you have bee told to do
More informationEconometric Methods. Review of Estimation
Ecoometrc Methods Revew of Estmato Estmatg the populato mea Radom samplg Pot ad terval estmators Lear estmators Ubased estmators Lear Ubased Estmators (LUEs) Effcecy (mmum varace) ad Best Lear Ubased Estmators
More informationESS Line Fitting
ESS 5 014 17. Le Fttg A very commo problem data aalyss s lookg for relatoshpetwee dfferet parameters ad fttg les or surfaces to data. The smplest example s fttg a straght le ad we wll dscuss that here
More informationThe Selection Problem - Variable Size Decrease/Conquer (Practice with algorithm analysis)
We have covered: Selecto, Iserto, Mergesort, Bubblesort, Heapsort Next: Selecto the Qucksort The Selecto Problem - Varable Sze Decrease/Coquer (Practce wth algorthm aalyss) Cosder the problem of fdg the
More information2.28 The Wall Street Journal is probably referring to the average number of cubes used per glass measured for some population that they have chosen.
.5 x 54.5 a. x 7. 786 7 b. The raked observatos are: 7.4, 7.5, 7.7, 7.8, 7.9, 8.0, 8.. Sce the sample sze 7 s odd, the meda s the (+)/ 4 th raked observato, or meda 7.8 c. The cosumer would more lkely
More informationPTAS for Bin-Packing
CS 663: Patter Matchg Algorthms Scrbe: Che Jag /9/00. Itroducto PTAS for B-Packg The B-Packg problem s NP-hard. If we use approxmato algorthms, the B-Packg problem could be solved polyomal tme. For example,
More informationMA/CSSE 473 Day 27. Dynamic programming
MA/CSSE 473 Day 7 Dyamc Programmg Bomal Coeffcets Warshall's algorthm (Optmal BSTs) Studet questos? Dyamc programmg Used for problems wth recursve solutos ad overlappg subproblems Typcally, we save (memoze)
More informationBayes (Naïve or not) Classifiers: Generative Approach
Logstc regresso Bayes (Naïve or ot) Classfers: Geeratve Approach What do we mea by Geeratve approach: Lear p(y), p(x y) ad the apply bayes rule to compute p(y x) for makg predctos Ths s essetally makg
More informationENGI 3423 Simple Linear Regression Page 12-01
ENGI 343 mple Lear Regresso Page - mple Lear Regresso ometmes a expermet s set up where the expermeter has cotrol over the values of oe or more varables X ad measures the resultg values of aother varable
More informationLecture 7. Confidence Intervals and Hypothesis Tests in the Simple CLR Model
Lecture 7. Cofdece Itervals ad Hypothess Tests the Smple CLR Model I lecture 6 we troduced the Classcal Lear Regresso (CLR) model that s the radom expermet of whch the data Y,,, K, are the outcomes. The
More informationSTA 108 Applied Linear Models: Regression Analysis Spring Solution for Homework #1
STA 08 Appled Lear Models: Regresso Aalyss Sprg 0 Soluto for Homework #. Let Y the dollar cost per year, X the umber of vsts per year. The the mathematcal relato betwee X ad Y s: Y 300 + X. Ths s a fuctoal
More informationChapter 8. Inferences about More Than Two Population Central Values
Chapter 8. Ifereces about More Tha Two Populato Cetral Values Case tudy: Effect of Tmg of the Treatmet of Port-We tas wth Lasers ) To vestgate whether treatmet at a youg age would yeld better results tha
More informationRandom Variate Generation ENM 307 SIMULATION. Anadolu Üniversitesi, Endüstri Mühendisliği Bölümü. Yrd. Doç. Dr. Gürkan ÖZTÜRK.
adom Varate Geerato ENM 307 SIMULATION Aadolu Üverstes, Edüstr Mühedslğ Bölümü Yrd. Doç. Dr. Gürka ÖZTÜK 0 adom Varate Geerato adom varate geerato s about procedures for samplg from a varety of wdely-used
More informationThe number of observed cases The number of parameters. ith case of the dichotomous dependent variable. the ith case of the jth parameter
LOGISTIC REGRESSION Notato Model Logstc regresso regresses a dchotomous depedet varable o a set of depedet varables. Several methods are mplemeted for selectg the depedet varables. The followg otato s
More informationDATE: 21 September, 1999 TO: Jim Russell FROM: Peter Tkacik RE: Analysis of wide ply tube winding as compared to Konva Kore CC: Larry McMillan
M E M O R A N D U M DATE: 1 September, 1999 TO: Jm Russell FROM: Peter Tkack RE: Aalyss of wde ply tube wdg as compared to Kova Kore CC: Larry McMlla The goal of ths report s to aalyze the spral tube wdg
More informationPGE 310: Formulation and Solution in Geosystems Engineering. Dr. Balhoff. Interpolation
PGE 30: Formulato ad Soluto Geosystems Egeerg Dr. Balhoff Iterpolato Numercal Methods wth MATLAB, Recktewald, Chapter 0 ad Numercal Methods for Egeers, Chapra ad Caale, 5 th Ed., Part Fve, Chapter 8 ad
More informationMulti Objective Fuzzy Inventory Model with. Demand Dependent Unit Cost and Lead Time. Constraints A Karush Kuhn Tucker Conditions.
It. Joural of Math. Aalyss, Vol. 8, 204, o. 4, 87-93 HIKARI Ltd, www.m-hkar.com http://dx.do.org/0.2988/jma.204.30252 Mult Objectve Fuzzy Ivetory Model wth Demad Depedet Ut Cost ad Lead Tme Costrats A
More informationAnalysis of Variance with Weibull Data
Aalyss of Varace wth Webull Data Lahaa Watthaacheewaul Abstract I statstcal data aalyss by aalyss of varace, the usual basc assumptos are that the model s addtve ad the errors are radomly, depedetly, ad
More information1. Overview of basic probability
13.42 Desg Prcples for Ocea Vehcles Prof. A.H. Techet Sprg 2005 1. Overvew of basc probablty Emprcally, probablty ca be defed as the umber of favorable outcomes dvded by the total umber of outcomes, other
More informationUNIT 2 SOLUTION OF ALGEBRAIC AND TRANSCENDENTAL EQUATIONS
Numercal Computg -I UNIT SOLUTION OF ALGEBRAIC AND TRANSCENDENTAL EQUATIONS Structure Page Nos..0 Itroducto 6. Objectves 7. Ital Approxmato to a Root 7. Bsecto Method 8.. Error Aalyss 9.4 Regula Fals Method
More informationhp calculators HP 30S Statistics Averages and Standard Deviations Average and Standard Deviation Practice Finding Averages and Standard Deviations
HP 30S Statstcs Averages ad Stadard Devatos Average ad Stadard Devato Practce Fdg Averages ad Stadard Devatos HP 30S Statstcs Averages ad Stadard Devatos Average ad stadard devato The HP 30S provdes several
More informationMidterm Exam 1, section 2 (Solution) Thursday, February hour, 15 minutes
coometrcs, CON Sa Fracsco State Uverst Mchael Bar Sprg 5 Mdterm xam, secto Soluto Thursda, Februar 6 hour, 5 mutes Name: Istructos. Ths s closed book, closed otes exam.. No calculators of a kd are allowed..
More informationMultivariate Transformation of Variables and Maximum Likelihood Estimation
Marquette Uversty Multvarate Trasformato of Varables ad Maxmum Lkelhood Estmato Dael B. Rowe, Ph.D. Assocate Professor Departmet of Mathematcs, Statstcs, ad Computer Scece Copyrght 03 by Marquette Uversty
More informationEstimation of Stress- Strength Reliability model using finite mixture of exponential distributions
Iteratoal Joural of Computatoal Egeerg Research Vol, 0 Issue, Estmato of Stress- Stregth Relablty model usg fte mxture of expoetal dstrbutos K.Sadhya, T.S.Umamaheswar Departmet of Mathematcs, Lal Bhadur
More informationLecture 8: Linear Regression
Lecture 8: Lear egresso May 4, GENOME 56, Sprg Goals Develop basc cocepts of lear regresso from a probablstc framework Estmatg parameters ad hypothess testg wth lear models Lear regresso Su I Lee, CSE
More informationTHE ROYAL STATISTICAL SOCIETY HIGHER CERTIFICATE
THE ROYAL STATISTICAL SOCIETY 00 EXAMINATIONS SOLUTIONS HIGHER CERTIFICATE PAPER I STATISTICAL THEORY The Socety provdes these solutos to assst caddates preparg for the examatos future years ad for the
More informationHomework 1: Solutions Sid Banerjee Problem 1: (Practice with Asymptotic Notation) ORIE 4520: Stochastics at Scale Fall 2015
Fall 05 Homework : Solutos Problem : (Practce wth Asymptotc Notato) A essetal requremet for uderstadg scalg behavor s comfort wth asymptotc (or bg-o ) otato. I ths problem, you wll prove some basc facts
More informationbest estimate (mean) for X uncertainty or error in the measurement (systematic, random or statistical) best
Error Aalyss Preamble Wheever a measuremet s made, the result followg from that measuremet s always subject to ucertaty The ucertaty ca be reduced by makg several measuremets of the same quatty or by mprovg
More informationDescriptive Statistics
Page Techcal Math II Descrptve Statstcs Descrptve Statstcs Descrptve statstcs s the body of methods used to represet ad summarze sets of data. A descrpto of how a set of measuremets (for eample, people
More informationUNIVERSITY OF OSLO DEPARTMENT OF ECONOMICS
UNIVERSITY OF OSLO DEPARTMENT OF ECONOMICS Exam: ECON430 Statstcs Date of exam: Frday, December 8, 07 Grades are gve: Jauary 4, 08 Tme for exam: 0900 am 00 oo The problem set covers 5 pages Resources allowed:
More information8.1 Hashing Algorithms
CS787: Advaced Algorthms Scrbe: Mayak Maheshwar, Chrs Hrchs Lecturer: Shuch Chawla Topc: Hashg ad NP-Completeess Date: September 21 2007 Prevously we looked at applcatos of radomzed algorthms, ad bega
More informationF. Inequalities. HKAL Pure Mathematics. 進佳數學團隊 Dr. Herbert Lam 林康榮博士. [Solution] Example Basic properties
進佳數學團隊 Dr. Herbert Lam 林康榮博士 HKAL Pure Mathematcs F. Ieualtes. Basc propertes Theorem Let a, b, c be real umbers. () If a b ad b c, the a c. () If a b ad c 0, the ac bc, but f a b ad c 0, the ac bc. Theorem
More informationBayesian Classification. CS690L Data Mining: Classification(2) Bayesian Theorem: Basics. Bayesian Theorem. Training dataset. Naïve Bayes Classifier
Baa Classfcato CS6L Data Mg: Classfcato() Referece: J. Ha ad M. Kamber, Data Mg: Cocepts ad Techques robablstc learg: Calculate explct probabltes for hypothess, amog the most practcal approaches to certa
More informationSimulation Output Analysis
Smulato Output Aalyss Summary Examples Parameter Estmato Sample Mea ad Varace Pot ad Iterval Estmato ermatg ad o-ermatg Smulato Mea Square Errors Example: Sgle Server Queueg System x(t) S 4 S 4 S 3 S 5
More information( ) 2 2. Multi-Layer Refraction Problem Rafael Espericueta, Bakersfield College, November, 2006
Mult-Layer Refracto Problem Rafael Espercueta, Bakersfeld College, November, 006 Lght travels at dfferet speeds through dfferet meda, but refracts at layer boudares order to traverse the least-tme path.
More informationMidterm Exam 1, section 1 (Solution) Thursday, February hour, 15 minutes
coometrcs, CON Sa Fracsco State Uversty Mchael Bar Sprg 5 Mdterm am, secto Soluto Thursday, February 6 hour, 5 mutes Name: Istructos. Ths s closed book, closed otes eam.. No calculators of ay kd are allowed..
More informationECON 5360 Class Notes GMM
ECON 560 Class Notes GMM Geeralzed Method of Momets (GMM) I beg by outlg the classcal method of momets techque (Fsher, 95) ad the proceed to geeralzed method of momets (Hase, 98).. radtoal Method of Momets
More informationCHAPTER 4 RADICAL EXPRESSIONS
6 CHAPTER RADICAL EXPRESSIONS. The th Root of a Real Number A real umber a s called the th root of a real umber b f Thus, for example: s a square root of sce. s also a square root of sce ( ). s a cube
More informationBlock-Based Compact Thermal Modeling of Semiconductor Integrated Circuits
Block-Based Compact hermal Modelg of Semcoductor Itegrated Crcuts Master s hess Defese Caddate: Jg Ba Commttee Members: Dr. Mg-Cheg Cheg Dr. Daqg Hou Dr. Robert Schllg July 27, 2009 Outle Itroducto Backgroud
More informationExercises for Square-Congruence Modulo n ver 11
Exercses for Square-Cogruece Modulo ver Let ad ab,.. Mark True or False. a. 3S 30 b. 3S 90 c. 3S 3 d. 3S 4 e. 4S f. 5S g. 0S 55 h. 8S 57. 9S 58 j. S 76 k. 6S 304 l. 47S 5347. Fd the equvalece classes duced
More informationTaylor s Series and Interpolation. Interpolation & Curve-fitting. CIS Interpolation. Basic Scenario. Taylor Series interpolates at a specific
CIS 54 - Iterpolato Roger Crawfs Basc Scearo We are able to prod some fucto, but do ot kow what t really s. Ths gves us a lst of data pots: [x,f ] f(x) f f + x x + August 2, 25 OSU/CIS 54 3 Taylor s Seres
More informationGOALS The Samples Why Sample the Population? What is a Probability Sample? Four Most Commonly Used Probability Sampling Methods
GOLS. Epla why a sample s the oly feasble way to lear about a populato.. Descrbe methods to select a sample. 3. Defe ad costruct a samplg dstrbuto of the sample mea. 4. Epla the cetral lmt theorem. 5.
More informationLecture 1 Review of Fundamental Statistical Concepts
Lecture Revew of Fudametal Statstcal Cocepts Measures of Cetral Tedecy ad Dsperso A word about otato for ths class: Idvduals a populato are desgated, where the dex rages from to N, ad N s the total umber
More informationChapter 3 Sampling For Proportions and Percentages
Chapter 3 Samplg For Proportos ad Percetages I may stuatos, the characterstc uder study o whch the observatos are collected are qualtatve ature For example, the resposes of customers may marketg surveys
More informationMedian as a Weighted Arithmetic Mean of All Sample Observations
Meda as a Weghted Arthmetc Mea of All Sample Observatos SK Mshra Dept. of Ecoomcs NEHU, Shllog (Ida). Itroducto: Iumerably may textbooks Statstcs explctly meto that oe of the weakesses (or propertes) of
More informationObjectives of Multiple Regression
Obectves of Multple Regresso Establsh the lear equato that best predcts values of a depedet varable Y usg more tha oe eplaator varable from a large set of potetal predctors {,,... k }. Fd that subset of
More information1 Onto functions and bijections Applications to Counting
1 Oto fuctos ad bectos Applcatos to Coutg Now we move o to a ew topc. Defto 1.1 (Surecto. A fucto f : A B s sad to be surectve or oto f for each b B there s some a A so that f(a B. What are examples of
More informationEvaluating Polynomials
Uverst of Nebraska - Lcol DgtalCommos@Uverst of Nebraska - Lcol MAT Exam Expostor Papers Math the Mddle Isttute Partershp 7-7 Evaluatg Polomals Thomas J. Harrgto Uverst of Nebraska-Lcol Follow ths ad addtoal
More informationPart 4b Asymptotic Results for MRR2 using PRESS. Recall that the PRESS statistic is a special type of cross validation procedure (see Allen (1971))
art 4b Asymptotc Results for MRR usg RESS Recall that the RESS statstc s a specal type of cross valdato procedure (see Alle (97)) partcular to the regresso problem ad volves fdg Y $,, the estmate at the
More informationSTATISTICAL INFERENCE
(STATISTICS) STATISTICAL INFERENCE COMPLEMENTARY COURSE B.Sc. MATHEMATICS III SEMESTER ( Admsso) UNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION CALICUT UNIVERSITY P.O., MALAPPURAM, KERALA, INDIA -
More information1. A real number x is represented approximately by , and we are told that the relative error is 0.1 %. What is x? Note: There are two answers.
PROBLEMS A real umber s represeted appromately by 63, ad we are told that the relatve error s % What s? Note: There are two aswers Ht : Recall that % relatve error s What s the relatve error volved roudg
More informationTHE ROYAL STATISTICAL SOCIETY GRADUATE DIPLOMA
THE ROYAL STATISTICAL SOCIETY EXAMINATIONS SOLUTIONS GRADUATE DIPLOMA PAPER II STATISTICAL THEORY & METHODS The Socety provdes these solutos to assst caddates preparg for the examatos future years ad for
More informationModule 7: Probability and Statistics
Lecture 4: Goodess of ft tests. Itroducto Module 7: Probablty ad Statstcs I the prevous two lectures, the cocepts, steps ad applcatos of Hypotheses testg were dscussed. Hypotheses testg may be used to
More informationNewton s Power Flow algorithm
Power Egeerg - Egll Beedt Hresso ewto s Power Flow algorthm Power Egeerg - Egll Beedt Hresso The ewto s Method of Power Flow 2 Calculatos. For the referece bus #, we set : V = p.u. ad δ = 0 For all other
More informationThis lecture and the next. Why Sorting? Sorting Algorithms so far. Why Sorting? (2) Selection Sort. Heap Sort. Heapsort
Ths lecture ad the ext Heapsort Heap data structure ad prorty queue ADT Qucksort a popular algorthm, very fast o average Why Sortg? Whe doubt, sort oe of the prcples of algorthm desg. Sortg used as a subroute
More informationSPECIAL CONSIDERATIONS FOR VOLUMETRIC Z-TEST FOR PROPORTIONS
SPECIAL CONSIDERAIONS FOR VOLUMERIC Z-ES FOR PROPORIONS Oe s stctve reacto to the questo of whether two percetages are sgfcatly dfferet from each other s to treat them as f they were proportos whch the
More informationOn Fuzzy Arithmetic, Possibility Theory and Theory of Evidence
O Fuzzy rthmetc, Possblty Theory ad Theory of Evdece suco P. Cucala, Jose Vllar Isttute of Research Techology Uversdad Potfca Comllas C/ Sata Cruz de Marceado 6 8 Madrd. Spa bstract Ths paper explores
More information