Markov chains. Definition of a CTMC: [2, page 381] is a continuous time, discrete value random process such that for an infinitesimal
|
|
- Marshall Hancock
- 6 years ago
- Views:
Transcription
1 Markov chans M. Veeraraghavan; March 17, 2004 [Tp: Study the MC, QT, and Lttle s law lectures together: CTMC (MC lecture), M/M/1 queue (QT lecture), Lttle s law lecture (when dervng the mean response tme from mean number of customers), DTMC (MC lecture), M/M/1 queue dervaton usng DTMC analyss, derve dstrbuton of response tme n M/M/1 queue (QT lecture), relaton between Markov property and memoryless property (MC lecture), M/M/m queue (QT lecture).] Markov process [1, pg. 337] s a stochastc process whose dynamc behavor s such that probablty dstrbuton for ts future development depends only on ts present state and not how the process arrved n that state. If state space s dscrete, then t s a Markov chan,.e., the random X n varables or Xt () are dscrete. 1. CTMC Defnton of a CTMC: [2, page 381] A CTMC { Xt ()t 0} s a contnuous tme, dscrete value random process such that for an nfntesmal tme step of sze, PXt [ ( + ) Xt () ] q PXt [ ( + ) Xt () ] 1 q The above defnton s somewhat smplstc snce t treats transton rates q (1) to be ndependent of tme. A more general defnton s gven below. Reference [3] s defnton of a CTMC s { Xt ()t 0} s a contnuous tme, dscrete value random process f for t o < t 1 < < t n < t, wth t and t r 0 for r 12,,, n, PXt [ () Xt ( n ) Xt, ( n 1 ) n 1,, Xt ( 0 ) o ] PXt [ () Xt ( n ) ] (2) If t s a Markov process (meanng we allow for contnuous state, then the probablty should be PXt ( () x) nstead of PXt ( () ). 1
2 1.1 Transton probabltes, state probabltes and transton rates The behavor of the process s characterzed by the dstrbuton of the ntal state of the system gven by the pmf of Xt ( 0 ), PXt ( ( 0 ) k), k 012,,, and the transton probabltes p t) PXt [ () ( X( ν) ) ] for 0 ν t and, 012,,, where (3) p ( tt, ) 1 f 0 otherwse (4) The pmf of Xt ()(or the state probabltes at tme t ; remember n Markov chans X(t) s dscrete, hence we talk of a pmf) s denoted by P PXt [ () ] 012,,, t 0 (5) Usng the theorem of total probablty: Clearly, P 1 for each tme t 0 (6) P PXt [ () ] PXt [ () X( ν) ]PXν [ ( ) ] p t)p ( ν) (7) If ν 0, then P p ( 0, t)p ( 0) ; ths means that f we know the ntal state probabltes P ( 0) and the transton probabltes p ( 0, t), the Markov chan s completely determned. But for what values of t do we need to defne p ( 0, t)? All values of t? That s an number! Contrast wth DTMC. Meanwhle for CTMC, we defne two other functons, transton rates, whch are nonnegatve contnuous functons Defnton of transton rates: For, q p p t) ( t, t+ h) p ( tt, ) p lm ( t, t + h) lm (8) t ν t h 0 h h 0 h because as per (4), p ( tt, ) 0 f. q p ( p t t) ) ( t, t) p ( t, t+ h) lm ν t h 0 h 1 p ( tt, + h) lm h h 0 (9) 2
3 agan by (4). Note that these are defntons and hence q can be defned to be the negatve of the dervatve of. t ( p t) ) ν t Relaton between transton probabltes and transton rates: p ( tt, + h) q h+ o( h) f (10) p ( tt, + h) 1 q h+ o( h) (11) where lm oh ( ) h 0 h 0 (12) 1.2 Chapman-Kolmogorov equaton Property of a Markov chan: The transton probabltes of a Markov chan { Xt ()t 0} satsfy the Chapman-Kolmogorov equaton: For all, I, where I s the state space of the process, p t) p k u)p k ( ut, ) 0 ν < u < t k I Proof: Use the theorem of total probablty: PXt ( () X( ν) ) PXt [ () Xu ( ) k, X( ν) ]PXu [ ( ) k X( ν) ] k Apply Markov property, whch s that the state of the system depends only on the last state. PXt ( () X( ν) ) PXt [ () Xu ( ) k]pxu [ ( ) k X( ν) ] k (13) (14) (15) 1.3 Kolmogorov s equatons: Brngng n the transton rate equatons (10) and (11) nto the Chapman-Kolmogorov equaton, we derve Kolmogorov s equatons: p t + h) p k u)p k ( ut, + h) 0 ν < u< t k I p t + h) p t) p k u) ( p k ( ut, + h) p k ( ut, )) k I (16) (17) Dvdng both sdes by h and takng the lmt as h 0 and u t, we get 3
4 p t) p t k u) ( pk ( ut, )) t The above s called Kolmogorov s forward equaton. Smlarly, Kolmogorov s backward equaton s: k I u t p k t)q k p t)q (18) p t) p ν k t)q k ( ν) p t)q ( ν) (19) Combnng (18) wth (7), we get a dfferental equaton for the state probabltes: dp dt p t)p t ( ν) P ( ν) p k t)q k p t)q (20) Flppng the order of the summatons: dp q dt k p k t)p ( ν) q P ( ν)p t) (21) dp Usng (7), q (22) dt k ()P t k q ()P t A Markov process s hence qute general - the q could be functons of tme; t could be nondecreasng (countng) or a process that ncreases and decreases. And hence M n M/M/1 should stand for Memoryless not Markov. The arrval process s Posson, whch s a specal case of Markov. 1.4 Tme-homogeneous Markov chans (3, page 361, 363): A Markov chan { Xt ()t 0} s sad to be tme-homogeneous f p t) depends only on the tme dfference t ν, where p t) PXt [ () Xν ( ) ]. In other words, p PXt [ ( + u) Xu ( ) ] for any u 0. (23) Or, equvalently n a tme-homogeneous Markov chan PXt [ () Xt ( n ) ] PXt [ ( t n ) X( 0) ] for any t n. (24) See defnton of strct-sense statonary processes where the ont CDF of random varables Xt ( 1 ), Xt ( 2 ), Xt ( m ) stays the same as the tme range t 1, t 2, t m shfts by a scalar τ. Pg. 275 of 4
5 [3] states that statonarty of the condtonal dstrbuton does not mply statonarty of the ont dstrbuton functon. Therefore, a tme-homogeneous Markov process need not be a statonary SP. In tme-homogeneous Markov chans, the transton rates q and q are ndependent of tme. We can see ths from (8) and (9). If p ( tt, + h) s ndependent of t n tme-homogeneous Markov chans, q s ndependent of t. In tme-homogeneous MCs, we can rewrte the Kolmogorov s forward equaton (18) and state probablty dfferental equaton (22) as follows: dp p dt k ()q t k p ()q t and (25) dp q dt k P k q P (26) 1.5 Why a Posson process s a specal case of a CTMC For example, n Posson process defnton, we see a smlar dependence on ust the nterval, and λ beng ndependent of tme. A Posson process s a pure-brth tme-homogeneous MC n whch p and the ntal state of the system s PXt [ ( 0 ) k] λt λt 0 otherwse ( λt 0 ) k e λt k 012,,, k! (27) (28) 5
6 See Fg. 1 that shows a Posson process as a pure-brth CTMC. Transton probablty p 01 t) λ λ λ λ λ n n+1... Fgure 1:Posson process as a pure-brth CTMC depends only on t ν (number of arrvals n a Posson process wthn an nterval only depends on the nterval). Therefore a Posson process s a tme-homogeneous process. Snce the number of arrvals wthn an nterval t ν s a Posson rv, p 01 ( t ν) PN [ 1], where N s the number of arrvals. PN [ 1] λ( t ν)e λ( t ν). Rewrtng p 01 ( t ν) as p 01, we can equate t to λt usng the Taylor s seres approxmaton for e λt f t s very small. p 00 can be smlarly approxmated to 1 λt. In CTMCs, the arcs are marked wth the transton rates. Usng (8) and (9), we can fnd the transton rates correpondng to the transton probabltes from (27) for the Posson process: q ( + 1) λ λ 1.6 Irreducble MCs and Global Balance equatons q q 0 for other cases Even n the tme-homogeneous case, t s hard to fnd tme-dependent probabltes, but for a specal knd of tme-homogeneous Markov chan, we can fnd the steady-state probabltes. Defntons: A state s reachable from state f for some tme t > 0, p > 0. A CTMC s sad to be rreducble f every state s reachable from every other state. Theorem 8.1 of [3], page 363: For an rreducble CTMC, the lmts p lm p lm P for, I (29) t t 6
7 always exst and are ndependent of the ntal state. If these lmts exst, then dp lm dt t (30) Substtutng nto (26), we get dp lm dt t lm t q k P k + q P (31) p k q k q p 0 (32) Ths s the global balance equatons. Combned wth the equaton p 1, we can solve for p, steady-state probabltes of beng n the states. Does an rreducble MC have to be tme-homogeneous? Irreducble Markov chans that yeld postve lmtng probabltes { p } are called recurrent non-null or postve recurrent. The number of transtons n any fnte length of tme s fnte wth probablty 1 - chans wth ths property are referred to as regular. Most queueng systems have underlyng regular Markov chans. 2. DTMC: [3] Defnton of a DTMC: A DTMC { X n n 012,,, } s a dscrete tme dscrete value random sequence such that gven X 0, X 1,, X n 1, the next random varable X n depends only on X n 1 through the transton probablty PX [ n X n 1, X n 2 n 2,, X 0 o ] PX [ n X n 1 ] (33) The pmf of the random varable X n s p ( n) PX ( n ) (34) The transton probablty of the DTMC s defned as p k ( mn, ) PX ( n k ( X m ) ) 0 m n (35) 7
8 2.1 Transton probabltes and transton probablty matrx n DTMCs For (tme)-homogeneous DTMCs, p k ( mn, ) depends only upon the dfference n m. For such chans, The probablty p k ( n) PX ( m + n k ( X m ) ) for any m 0. (36) s called an n-step transton probablty,.e., t s the probablty that the MC wll move from state to state k n exactly n steps. If n 1, the 1-step transton probablty: p k ( n) p k ( 1) PX ( m + 1 k ( X m ) ) for any m 0. (37) We can also defne a 0-step transton probablty: p k ( 0) 1 f k 0 otherwse (38) Usng the generalzed multplcaton rule to obtan the ont probablty: PX ( 0 o, X 1 1,, X n n ) PX ( n n X n 1 n 1,, X 0 0 )PX ( n 1 n 1,, X 0 0 ) PX ( n n X n 1 n 1 )PX ( n 1 n 1,, X 0 0 ) PX ( n n X n 1 n 1 )( PX ( n 1 n 1 X n 2 n 2,, X 0 0 )) PX ( n n X n 1 n 1 )( PX ( n 1 n 1 X n 2 n 2 ))PX ( n 2 n 2,, X 0 0 ) p n n 1 p n 1 n 2 p 1 0 P 0 ( 0) In other words, as wth the CTMC, f we have the ntal pmf P 0 PX ( 0 0 ) and the one-step transton probabltes p, we can determne all the ont probabltes. The pmf of X 0 s called the ntal dstrbuton, specfed by a probablty vector p( 0) [ p 0 ( 0), p 1 ( 0), ] (39) The one-step transton probabltes s specfed n the form of a transton probablty matrx as: P p 00 p 01 p 02 p 0 p 1 p 2 (40) 8
9 2.2 Chapman-Kolmogorov equaton for DTMC Property of a DTMC: The Chapman-Kolmogorov equaton provdes a way to compute the n- step transton probabltes. p ( m + n) p k ( m)p k ( n) mn, 0, 0 k 0 Proof: Use the theorem of total probablty: PX [ m + n X 0 ] PX [ m + n X m k, X 0 ]PX [ m k X 0 ] k 0 Apply Markov property, whch s that the state of the system depends only on the last state. PX [ m + n X 0 ] PX [ m + n X m k]px [ m k X 0 ] k 0 (41) (42) (43) p ( m + n) p k ( m)p k ( n) mn, 0, 0 k 0 In the explanaton for the Chapman-Kolmogorov equaton for CTMCs we ddn t need them to be homogeneous. Same goes for DTMCs. The above proof s for the tme-homogeneous case, but t can be proven ust as easly for non-homogeneous DTMCs. We see that whle Chapman-Kolmogorov equaton holds for both CTMC and DTMC, the Kolmogorov forward and backward equatons are for transton rates and hence applcable only for CTMCs. (44) The matrx of n-step transton probabltes s obtaned from (44) by replacng m by 1 and n by n 1 and notng that p ( n) s an entry n the matrx P( n) as: P( n) P P( n 1) P n To obtan the pmf of random varable X n, usng (34), we get p ( n) PX ( n ) PX ( n X 0 )PX ( 0 ) p ( n)p ( 0) (45) If the pmf of X n s expressed as a vector: p( n) [ p 0 ( n), p 1 ( n),, p ( n), ], 9
10 where p ( n) s the probablty that the system s n state after n transtons, then p( n) p( 0)P( n) p( 0)P n (46) P( n) s a stochastc matrx because ts row sums are equal to 1,.e. 2.3 Irreducble DTMCs Defntons from [4]: p ( n ) 1 for all. Two states and communcate f for some n and n', we have p ( n) > 0 and p ( n' ) > 0. Irreducble Markov chan: If all states communcate, we say that the MC s rreducble. Perhaps we can see here that rreducble MC do not have to be tme-homogeneous. Couldn t we say that f for some m, n, m', n', p ( mn, ) > 0 and p ( m', n' ) > 0 then the non-homogeneous MC s rreducble? A state of a MC s perodc f there exsts some nteger m 1 such that p ( m) > 0 and some nteger d > 1 such that p ( n) > 0 only f n s a multple of d. A MC s aperodc f none of ts states s perodc. If p ( n) becomes ndependent of n and, then from (45), we see that p ( n) approaches a constant as n. Not all MC exhbt ths behavor. To determne whch ones do we need to classfy states of a MC [3]. We note that the n -step transton probabltes p ( n) of fnte, rreducble, aperodc MCs become ndependent of and n as n. Let q lm p ( n) n ν lm p ( n) lm p ( 0) p ( n) p ( 0) ( lm p ( n) ) p ( 0)q q p ( 0) n n n q In other words, ν lm p ( n) lm p ( n) q (47) n n Ths mples that P n converges to a matrx V, wth all rows beng equal to ( ν 0, ν 1, ) as n. From [4], page : 10
11 Ether ν 0 for all (whch happens n a queueng system when arrval rate exceeds the servce rate, n whch case the number of customers n the system approaches ; therefore the steady-state probablty of any state wth a fnte number of customers s 0 - example from [4], page 260), OR ν > 0 for all, n whch case { ν 0} s the unque statonary dstrbuton of the MC,.e. t s the only dstrbuton that satsfes the equaton ν ν p 01,, and ν 1 (see below for dervaton) (48) 0 The vector V s called the steady-state probablty vector of the MC. s nterpreted as the long-run proporton of the tme the MC spends n state. Dervaton of (48) s from [3], page 320: From the theorem of total probablty, ν From (47), we have p ( n) p ( n 1)p ( 1) (49) ν lm p ( n) lm p ( n 1). (50) n n Therefore, takng the lmt as n tends to nfnty of both sdes of (49), ν ν p, where we have replaced the 1-step transton probablty p ( 1) by the smpler notaton p. Note that whle ν s the steady-state probablty of beng n state, the probablty p s the one-step transton probablty. Theorem on pg. 260 of [4] states: In an rreducble aperodc MC, there are two possbltes for the scalars lm ( n), 1. q 0 for all 0, n whch case the MC has no statonary dstrbuton 2. q > 0 for all 0, n whch case { q 0} s the unque statonary dstrbuton of the chan (.e., t s the only probablty dstrbuton satsfyng (48). q p n 11
12 NOTE: The above theorem does not need the MC to be fnte. 2.4 Global balance equatons [4]: Multply both sdes of the equaton p 1 by ν and replace ν on RHS usng (48). We get the global balance equatons. 0 ν 0 p ν p 01,, 0 (51) These state that frequency of transtons out of state s equal to the frequency of transtons nto state. The long-term frequency of transtons from state to state s ν p. The global balance equatons can be generalzed to apply to a set of states. Consder a subset of states (51) over all S, we get: ν p S S 2.5 Detaled balance equatons for brth-death DTMCs ν p S S S By addng (52) A brth-death MC s one where two successve states can only dffer by unty,.e., p 0 f ( > 1) and P ( + 1) > 0 and p ( + 1) > 0 for all. Let the set of states S { 012,,,, n} as shown n Fg. 2. Applyng (52) yelds ν n p nn+ 1 n 01,, ( ) ν n + 1 p ( n + 1)n (53) Fgure 2:MC for a brth-death process... n n+1... Set S Equaton (53) s a specal caseof ν p ν p, 0 (54) 12
13 Queston: Do the detaled balance equatons only apply for brth-death MCs or other MCs too? [4] (page 262) says assume t holds and solve the MC. Ether an nconsstency wll be seen where ν 1 0 or you get a steady-state soluton. Compare global balance equatons of CTMC wth that of DTMC. Does the detaled balance equaton hold for a brth-death CTMC? 3. Relaton between Markov property and the memoryless property The relaton between these two propertes appears n a tme-homogeneous CTMC, where the holdng tme n a state has a dstrbuton that s memoryless (exponental). For a tme-homogeneous CTMC, f the state of the system Xt (), then the condtonal probablty of the tme Y spent n state can be characterzed as follows: PY ( r+ ty t) PY ( r) (55) To understand the above, consder t and t+ s as two tme nstants wthn the holdng tme of state, such that 0 s r. In ths case, because the CTMC s tme-homogeneous, PXt [ ( + s) Xt () ] PXs [ ( ) X( 0) ]. (56) From (56), we see that (55) follows. For a homogeneous MC, the past hstory of the process s completely summarzed n the current state ([1], page 296). For a non-homogeneous MC, t addtonally depends on tme spent n the state? If (55) holds, then PY ( r) Pt ( Y t+ r) F Y ( t + r) F Y or F (57) PY ( t) Y ( r) F Y Dvde by r and take the lmt as r 0, we get F' Y ( 0) F Y '() t (58) 1 F Y The above dfferental equaton has the unque soluton: F Y 1 e F' Y'0 ( )t, whch s the exponental dstrbuton. (59) 13
14 In other words, the tme spent n a gven state s exponentally dstrbuted for a tme-homogeneous MC (also referred to as a homogeneous MC). If the MC s a DTMC, the holdng tme dstrbuton s geometrc. Problem 5 n [1], page 421: Let the random varable denote the holdng tme n state k of the M/M/1 queue. Show that the dstrbuton of s exponental (for each k ). T k T k Answer: Consder T 0 frst. The only event leadng out of state 0 s a ob arrval. Snce ob nterarrval tmes are exponentally dstrbuted, tme to the next arrval s also EXP( λ), and hence T 0 EXP( λ). Next, consder the holdng tme n any state k, k 1. The tme X to the next arrval s EXP( λ), and tme Y to the servce completon of the ob n servce s EXP ( µ ). Clearly, T k mn{ X, Y}. If X and Y are exponentally dstrbuted random varables, then so s T k. Ths s because of the order statstcs result [1], page 157. Compute varables Y 1, Y 2,, Y n by reorderng the random varables X 1, X 2,, X n such that Y 1 mn{ X 1, X 2,, X n }, and (60) Y n max{ X 1, X 2,, X n }. (61) Y k s called the k-th order statstc. To derve the dstrbuton of Y k, exactly k le n the range (, y ] and n k le n the range [ y, ). F Yk ( y) PY ( k y) P( at least k of the X s le mn the nterval(, y ]) (62) F Yk ( y) n n F ( y) ( 1 Fy ( )) n < y < k (63) Therefore ( y) 1 [ 1 Fy ( )] n (64) F Y1 If all X s are greater than y (prob: [ 1 Fy ( )] n ), then Y 1 should be greater than y too. Applyng ths result to our problem of mn{ X, Y}, where X EXP( λ) and Y EXP ( µ ), we get F Tk T k ( y) 1 e λt e µt ( 1 e λ + µ )t. In other words, T k EXP( λ + µ ). But the above result s for an M/M/1 queue. It does not prove that ths holds for any tme-homogeneous CTMC. 14
15 For a tme-homogeneous DTMC, we can derve the dstrbuton of tmes between state changes as follows [1], page 356: Let the random varable represent the tme the system spends n state k durng a sngle vst to that state. T k n 1 P( T k n) ( 1 p kk )p kk, for all states k (65) Ths s a geometrc dstrbuton wth parameter p kk (one-step probablty). Apply same reasonng to a tme-homogeneous CTMC: q s the transton rate assocated wth stayng n state. Probablty of stayng n state from tme t to tme t + y s P( x < T < x + dx) lm ( 1 q ) 0 -- x ( q dx) (66) from (9) but for a tme-homogeneous system whch means q s ndependent of tme y PT ( y) lm ( 1 q ) q d x 1 e q y x lm h 0 ( 1 + h) 1 -- h e ; set h q PT ( y) 1 e q y Interestng that ths holdng tme dstrbuton holds at any tme t - meanng t apples even n the transent state. H k ( t 1 ) s a random varable: start a clock as soon as the system enters state k and stop t when t leaves. Ths varable has ths exponental dstrbuton (memoryless property). It s not necessary that we only consder the holdng tmes n a state n the steady state for ths memoryless property to hold. The above leads to another defnton of CTMC: Reference [4] gves a defnton for CTMC that only holds for tme-homogeneous MCs. It states (on page 262): 15
16 A CTMC s a process { Xt ()t 0} takng values from the set of states 01,,, that has the property that each tme t enters state : 1. The tme t spends n state s exponentally dstrbuted wth parameter ν. We may vew ν as the rate (n transtons/sec) at whch the process makes a transton when at state. 2. When the process leaves state, t wll enter state wth probablty P, where P 1. It goes on to defne the transton rate q from state to state as q ν P. References [1] K. S. Trved, Probablty, Statstcs wth Relablty, Queueng and Computer Scence Applcatons, Second Edton, Wley, 2002, ISBN [2] R. Yates and D. Goodman, Probablty and Stochastc Processes, Wley, ISBN [3] K. S. Trved, Probablty, Statstcs wth Relablty, Queueng and Computer Scence Applcatons, Frst Edton, Prentce Hall, ISBN r. [4] D. Bertsekas and R. Gallager, Data Networks, Prentce Hall, Second Edton,
Continuous Time Markov Chain
Contnuous Tme Markov Chan Hu Jn Department of Electroncs and Communcaton Engneerng Hanyang Unversty ERICA Campus Contents Contnuous tme Markov Chan (CTMC) Propertes of sojourn tme Relatons Transton probablty
More informationContinuous Time Markov Chains
Contnuous Tme Markov Chans Brth and Death Processes,Transton Probablty Functon, Kolmogorov Equatons, Lmtng Probabltes, Unformzaton Chapter 6 1 Markovan Processes State Space Parameter Space (Tme) Dscrete
More information6. Stochastic processes (2)
6. Stochastc processes () Lect6.ppt S-38.45 - Introducton to Teletraffc Theory Sprng 5 6. Stochastc processes () Contents Markov processes Brth-death processes 6. Stochastc processes () Markov process
More information6. Stochastic processes (2)
Contents Markov processes Brth-death processes Lect6.ppt S-38.45 - Introducton to Teletraffc Theory Sprng 5 Markov process Consder a contnuous-tme and dscrete-state stochastc process X(t) wth state space
More informationApplied Stochastic Processes
STAT455/855 Fall 23 Appled Stochastc Processes Fnal Exam, Bref Solutons 1. (15 marks) (a) (7 marks) The dstrbuton of Y s gven by ( ) ( ) y 2 1 5 P (Y y) for y 2, 3,... The above follows because each of
More informationIntroduction to Continuous-Time Markov Chains and Queueing Theory
Introducton to Contnuous-Tme Markov Chans and Queueng Theory From DTMC to CTMC p p 1 p 12 1 2 k-1 k p k-1,k p k-1,k k+1 p 1 p 21 p k,k-1 p k,k-1 DTMC 1. Transtons at dscrete tme steps n=,1,2, 2. Past doesn
More informationGoogle PageRank with Stochastic Matrix
Google PageRank wth Stochastc Matrx Md. Sharq, Puranjt Sanyal, Samk Mtra (M.Sc. Applcatons of Mathematcs) Dscrete Tme Markov Chan Let S be a countable set (usually S s a subset of Z or Z d or R or R d
More informationLectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix
Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could
More informationAnalysis of Discrete Time Queues (Section 4.6)
Analyss of Dscrete Tme Queues (Secton 4.6) Copyrght 2002, Sanjay K. Bose Tme axs dvded nto slots slot slot boundares Arrvals can only occur at slot boundares Servce to a job can only start at a slot boundary
More information3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X
Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number
More informationEquilibrium Analysis of the M/G/1 Queue
Eulbrum nalyss of the M/G/ Queue Copyrght, Sanay K. ose. Mean nalyss usng Resdual Lfe rguments Secton 3.. nalyss usng an Imbedded Marov Chan pproach Secton 3. 3. Method of Supplementary Varables done later!
More informationConvergence of random processes
DS-GA 12 Lecture notes 6 Fall 216 Convergence of random processes 1 Introducton In these notes we study convergence of dscrete random processes. Ths allows to characterze phenomena such as the law of large
More informationDS-GA 1002 Lecture notes 5 Fall Random processes
DS-GA Lecture notes 5 Fall 6 Introducton Random processes Random processes, also known as stochastc processes, allow us to model quanttes that evolve n tme (or space n an uncertan way: the trajectory of
More informationAPPENDIX A Some Linear Algebra
APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,
More informationTCOM 501: Networking Theory & Fundamentals. Lecture 7 February 25, 2003 Prof. Yannis A. Korilis
TCOM 501: Networkng Theory & Fundamentals Lecture 7 February 25, 2003 Prof. Yanns A. Korls 1 7-2 Topcs Open Jackson Networks Network Flows State-Dependent Servce Rates Networks of Transmsson Lnes Klenrock
More informationNUMERICAL DIFFERENTIATION
NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the
More informationProblem Set 9 - Solutions Due: April 27, 2005
Problem Set - Solutons Due: Aprl 27, 2005. (a) Frst note that spam messages, nvtatons and other e-mal are all ndependent Posson processes, at rates pλ, qλ, and ( p q)λ. The event of the tme T at whch you
More informationReview: Discrete Event Random Processes. Hongwei Zhang
Revew: Dscrete Event Random Processes Hongwe Zhang http://www.cs.wayne.edu/~hzhang Outlne Markov chans and some renewal theory Markov chan Renewal processes, renewal reward processes, Markov renewal processes
More informationHidden Markov Models & The Multivariate Gaussian (10/26/04)
CS281A/Stat241A: Statstcal Learnng Theory Hdden Markov Models & The Multvarate Gaussan (10/26/04) Lecturer: Mchael I. Jordan Scrbes: Jonathan W. Hu 1 Hdden Markov Models As a bref revew, hdden Markov models
More informationPHYS 705: Classical Mechanics. Calculus of Variations II
1 PHYS 705: Classcal Mechancs Calculus of Varatons II 2 Calculus of Varatons: Generalzaton (no constrant yet) Suppose now that F depends on several dependent varables : We need to fnd such that has a statonary
More informationMore metrics on cartesian products
More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of
More informationFoundations of Arithmetic
Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 12 10/21/2013. Martingale Concentration Inequalities and Applications
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.65/15.070J Fall 013 Lecture 1 10/1/013 Martngale Concentraton Inequaltes and Applcatons Content. 1. Exponental concentraton for martngales wth bounded ncrements.
More informationTransfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system
Transfer Functons Convenent representaton of a lnear, dynamc model. A transfer functon (TF) relates one nput and one output: x t X s y t system Y s The followng termnology s used: x y nput output forcng
More informationStructure and Drive Paul A. Jensen Copyright July 20, 2003
Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.
More informationEcon107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)
I. Classcal Assumptons Econ7 Appled Econometrcs Topc 3: Classcal Model (Studenmund, Chapter 4) We have defned OLS and studed some algebrac propertes of OLS. In ths topc we wll study statstcal propertes
More informationThe Feynman path integral
The Feynman path ntegral Aprl 3, 205 Hesenberg and Schrödnger pctures The Schrödnger wave functon places the tme dependence of a physcal system n the state, ψ, t, where the state s a vector n Hlbert space
More informationQueueing Networks II Network Performance
Queueng Networks II Network Performance Davd Tpper Assocate Professor Graduate Telecommuncatons and Networkng Program Unversty of Pttsburgh Sldes 6 Networks of Queues Many communcaton systems must be modeled
More informationANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U)
Econ 413 Exam 13 H ANSWERS Settet er nndelt 9 deloppgaver, A,B,C, som alle anbefales å telle lkt for å gøre det ltt lettere å stå. Svar er gtt . Unfortunately, there s a prntng error n the hnt of
More informationLecture 3: Probability Distributions
Lecture 3: Probablty Dstrbutons Random Varables Let us begn by defnng a sample space as a set of outcomes from an experment. We denote ths by S. A random varable s a functon whch maps outcomes nto the
More informationCOMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
Avalable onlne at http://sck.org J. Math. Comput. Sc. 3 (3), No., 6-3 ISSN: 97-537 COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
More informationFINITE-STATE MARKOV CHAINS
Chapter 4 FINITE-STATE MARKOV CHAINS 4.1 Introducton The countng processes {N(t), t 0} of Chapterss 2 and 3 have the property that N(t) changes at dscrete nstants of tme, but s defned for all real t 0.
More informationThe Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction
ECONOMICS 5* -- NOTE (Summary) ECON 5* -- NOTE The Multple Classcal Lnear Regresson Model (CLRM): Specfcaton and Assumptons. Introducton CLRM stands for the Classcal Lnear Regresson Model. The CLRM s also
More informationAdditional Codes using Finite Difference Method. 1 HJB Equation for Consumption-Saving Problem Without Uncertainty
Addtonal Codes usng Fnte Dfference Method Benamn Moll 1 HJB Equaton for Consumpton-Savng Problem Wthout Uncertanty Before consderng the case wth stochastc ncome n http://www.prnceton.edu/~moll/ HACTproect/HACT_Numercal_Appendx.pdf,
More information= z 20 z n. (k 20) + 4 z k = 4
Problem Set #7 solutons 7.2.. (a Fnd the coeffcent of z k n (z + z 5 + z 6 + z 7 + 5, k 20. We use the known seres expanson ( n+l ( z l l z n below: (z + z 5 + z 6 + z 7 + 5 (z 5 ( + z + z 2 + z + 5 5
More informationBernoulli Numbers and Polynomials
Bernoull Numbers and Polynomals T. Muthukumar tmk@tk.ac.n 17 Jun 2014 The sum of frst n natural numbers 1, 2, 3,..., n s n n(n + 1 S 1 (n := m = = n2 2 2 + n 2. Ths formula can be derved by notng that
More informationUsing T.O.M to Estimate Parameter of distributions that have not Single Exponential Family
IOSR Journal of Mathematcs IOSR-JM) ISSN: 2278-5728. Volume 3, Issue 3 Sep-Oct. 202), PP 44-48 www.osrjournals.org Usng T.O.M to Estmate Parameter of dstrbutons that have not Sngle Exponental Famly Jubran
More informationTopics in Probability Theory and Stochastic Processes Steven R. Dunbar. Classes of States and Stationary Distributions
Steven R. Dunbar Department of Mathematcs 203 Avery Hall Unversty of Nebraska-Lncoln Lncoln, NE 68588-0130 http://www.math.unl.edu Voce: 402-472-3731 Fax: 402-472-8466 Topcs n Probablty Theory and Stochastc
More informationRandom Walks on Digraphs
Random Walks on Dgraphs J. J. P. Veerman October 23, 27 Introducton Let V = {, n} be a vertex set and S a non-negatve row-stochastc matrx (.e. rows sum to ). V and S defne a dgraph G = G(V, S) and a drected
More informationThe optimal delay of the second test is therefore approximately 210 hours earlier than =2.
THE IEC 61508 FORMULAS 223 The optmal delay of the second test s therefore approxmately 210 hours earler than =2. 8.4 The IEC 61508 Formulas IEC 61508-6 provdes approxmaton formulas for the PF for smple
More informationDynamic Programming. Preview. Dynamic Programming. Dynamic Programming. Dynamic Programming (Example: Fibonacci Sequence)
/24/27 Prevew Fbonacc Sequence Longest Common Subsequence Dynamc programmng s a method for solvng complex problems by breakng them down nto smpler sub-problems. It s applcable to problems exhbtng the propertes
More informationCHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE
CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng
More informationLecture Notes on Linear Regression
Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume
More informationLectures on Stochastic Stability. Sergey FOSS. Heriot-Watt University. Lecture 5. Monotonicity and Saturation Rule
Lectures on Stochastc Stablty Sergey FOSS Herot-Watt Unversty Lecture 5 Monotoncty and Saturaton Rule Introducton The paper of Loynes [8] was the frst to consder a system (sngle server queue, and, later,
More informationA note on almost sure behavior of randomly weighted sums of φ-mixing random variables with φ-mixing weights
ACTA ET COMMENTATIONES UNIVERSITATIS TARTUENSIS DE MATHEMATICA Volume 7, Number 2, December 203 Avalable onlne at http://acutm.math.ut.ee A note on almost sure behavor of randomly weghted sums of φ-mxng
More informationLecture 17 : Stochastic Processes II
: Stochastc Processes II 1 Contnuous-tme stochastc process So far we have studed dscrete-tme stochastc processes. We studed the concept of Makov chans and martngales, tme seres analyss, and regresson analyss
More informationSL n (F ) Equals its Own Derived Group
Internatonal Journal of Algebra, Vol. 2, 2008, no. 12, 585-594 SL n (F ) Equals ts Own Derved Group Jorge Macel BMCC-The Cty Unversty of New York, CUNY 199 Chambers street, New York, NY 10007, USA macel@cms.nyu.edu
More informationProbability and Random Variable Primer
B. Maddah ENMG 622 Smulaton 2/22/ Probablty and Random Varable Prmer Sample space and Events Suppose that an eperment wth an uncertan outcome s performed (e.g., rollng a de). Whle the outcome of the eperment
More informationLinear Approximation with Regularization and Moving Least Squares
Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...
More informationApplication of Queuing Theory to Waiting Time of Out-Patients in Hospitals.
Applcaton of Queung Theory to Watng Tme of Out-Patents n Hosptals. R.A. Adeleke *, O.D. Ogunwale, and O.Y. Hald. Department of Mathematcal Scences, Unversty of Ado-Ekt, Ado-Ekt, Ekt State, Ngera. E-mal:
More informationExercises of Chapter 2
Exercses of Chapter Chuang-Cheh Ln Department of Computer Scence and Informaton Engneerng, Natonal Chung Cheng Unversty, Mng-Hsung, Chay 61, Tawan. Exercse.6. Suppose that we ndependently roll two standard
More informationELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM
ELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM An elastc wave s a deformaton of the body that travels throughout the body n all drectons. We can examne the deformaton over a perod of tme by fxng our look
More informationCS-433: Simulation and Modeling Modeling and Probability Review
CS-433: Smulaton and Modelng Modelng and Probablty Revew Exercse 1. (Probablty of Smple Events) Exercse 1.1 The owner of a camera shop receves a shpment of fve cameras from a camera manufacturer. Unknown
More information2.3 Nilpotent endomorphisms
s a block dagonal matrx, wth A Mat dm U (C) In fact, we can assume that B = B 1 B k, wth B an ordered bass of U, and that A = [f U ] B, where f U : U U s the restrcton of f to U 40 23 Nlpotent endomorphsms
More informationSELECTED PROOFS. DeMorgan s formulas: The first one is clear from Venn diagram, or the following truth table:
SELECTED PROOFS DeMorgan s formulas: The frst one s clear from Venn dagram, or the followng truth table: A B A B A B Ā B Ā B T T T F F F F T F T F F T F F T T F T F F F F F T T T T The second one can be
More informationSupplement: Proofs and Technical Details for The Solution Path of the Generalized Lasso
Supplement: Proofs and Techncal Detals for The Soluton Path of the Generalzed Lasso Ryan J. Tbshran Jonathan Taylor In ths document we gve supplementary detals to the paper The Soluton Path of the Generalzed
More informationSee Book Chapter 11 2 nd Edition (Chapter 10 1 st Edition)
Count Data Models See Book Chapter 11 2 nd Edton (Chapter 10 1 st Edton) Count data consst of non-negatve nteger values Examples: number of drver route changes per week, the number of trp departure changes
More informationInner Product. Euclidean Space. Orthonormal Basis. Orthogonal
Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,
More informationEconomics 130. Lecture 4 Simple Linear Regression Continued
Economcs 130 Lecture 4 Contnued Readngs for Week 4 Text, Chapter and 3. We contnue wth addressng our second ssue + add n how we evaluate these relatonshps: Where do we get data to do ths analyss? How do
More information1 Derivation of Rate Equations from Single-Cell Conductance (Hodgkin-Huxley-like) Equations
Physcs 171/271 -Davd Klenfeld - Fall 2005 (revsed Wnter 2011) 1 Dervaton of Rate Equatons from Sngle-Cell Conductance (Hodgkn-Huxley-lke) Equatons We consder a network of many neurons, each of whch obeys
More informationA be a probability space. A random vector
Statstcs 1: Probablty Theory II 8 1 JOINT AND MARGINAL DISTRIBUTIONS In Probablty Theory I we formulate the concept of a (real) random varable and descrbe the probablstc behavor of ths random varable by
More informationprinceton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg
prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there
More informationSection 8.3 Polar Form of Complex Numbers
80 Chapter 8 Secton 8 Polar Form of Complex Numbers From prevous classes, you may have encountered magnary numbers the square roots of negatve numbers and, more generally, complex numbers whch are the
More informationj) = 1 (note sigma notation) ii. Continuous random variable (e.g. Normal distribution) 1. density function: f ( x) 0 and f ( x) dx = 1
Random varables Measure of central tendences and varablty (means and varances) Jont densty functons and ndependence Measures of assocaton (covarance and correlaton) Interestng result Condtonal dstrbutons
More informationPhysics 5153 Classical Mechanics. Principle of Virtual Work-1
P. Guterrez 1 Introducton Physcs 5153 Classcal Mechancs Prncple of Vrtual Work The frst varatonal prncple we encounter n mechancs s the prncple of vrtual work. It establshes the equlbrum condton of a mechancal
More informationarxiv: v1 [math.ho] 18 May 2008
Recurrence Formulas for Fbonacc Sums Adlson J. V. Brandão, João L. Martns 2 arxv:0805.2707v [math.ho] 8 May 2008 Abstract. In ths artcle we present a new recurrence formula for a fnte sum nvolvng the Fbonacc
More informationAN EXTENDED CLASS OF TIME-CONTINUOUS BRANCHING PROCESSES. Rong-Rong Chen. ( University of Illinois at Urbana-Champaign)
AN EXTENDED CLASS OF TIME-CONTINUOUS BRANCHING PROCESSES Rong-Rong Chen ( Unversty of Illnos at Urbana-Champagn Abstract. Ths paper s devoted to studyng an extended class of tme-contnuous branchng processes,
More informationChapter 12. Ordinary Differential Equation Boundary Value (BV) Problems
Chapter. Ordnar Dfferental Equaton Boundar Value (BV) Problems In ths chapter we wll learn how to solve ODE boundar value problem. BV ODE s usuall gven wth x beng the ndependent space varable. p( x) q(
More information9 Derivation of Rate Equations from Single-Cell Conductance (Hodgkin-Huxley-like) Equations
Physcs 171/271 - Chapter 9R -Davd Klenfeld - Fall 2005 9 Dervaton of Rate Equatons from Sngle-Cell Conductance (Hodgkn-Huxley-lke) Equatons We consder a network of many neurons, each of whch obeys a set
More informationLecture 6/7 (February 10/12, 2014) DIRAC EQUATION. The non-relativistic Schrödinger equation was obtained by noting that the Hamiltonian 2
P470 Lecture 6/7 (February 10/1, 014) DIRAC EQUATION The non-relatvstc Schrödnger equaton was obtaned by notng that the Hamltonan H = P (1) m can be transformed nto an operator form wth the substtutons
More informationThe equation of motion of a dynamical system is given by a set of differential equations. That is (1)
Dynamcal Systems Many engneerng and natural systems are dynamcal systems. For example a pendulum s a dynamcal system. State l The state of the dynamcal system specfes t condtons. For a pendulum n the absence
More information5 The Rational Canonical Form
5 The Ratonal Canoncal Form Here p s a monc rreducble factor of the mnmum polynomal m T and s not necessarly of degree one Let F p denote the feld constructed earler n the course, consstng of all matrces
More informationRandomness and Computation
Randomness and Computaton or, Randomzed Algorthms Mary Cryan School of Informatcs Unversty of Ednburgh RC 208/9) Lecture 0 slde Balls n Bns m balls, n bns, and balls thrown unformly at random nto bns usually
More informationExpected Value and Variance
MATH 38 Expected Value and Varance Dr. Neal, WKU We now shall dscuss how to fnd the average and standard devaton of a random varable X. Expected Value Defnton. The expected value (or average value, or
More informationSuggested solutions for the exam in SF2863 Systems Engineering. June 12,
Suggested solutons for the exam n SF2863 Systems Engneerng. June 12, 2012 14.00 19.00 Examner: Per Enqvst, phone: 790 62 98 1. We can thnk of the farm as a Jackson network. The strawberry feld s modelled
More informationTHE ROYAL STATISTICAL SOCIETY 2006 EXAMINATIONS SOLUTIONS HIGHER CERTIFICATE
THE ROYAL STATISTICAL SOCIETY 6 EXAMINATIONS SOLUTIONS HIGHER CERTIFICATE PAPER I STATISTICAL THEORY The Socety provdes these solutons to assst canddates preparng for the eamnatons n future years and for
More informationNumerical Heat and Mass Transfer
Master degree n Mechancal Engneerng Numercal Heat and Mass Transfer 06-Fnte-Dfference Method (One-dmensonal, steady state heat conducton) Fausto Arpno f.arpno@uncas.t Introducton Why we use models and
More information2 Finite difference basics
Numersche Methoden 1, WS 11/12 B.J.P. Kaus 2 Fnte dfference bascs Consder the one- The bascs of the fnte dfference method are best understood wth an example. dmensonal transent heat conducton equaton T
More informationCollege of Computer & Information Science Fall 2009 Northeastern University 20 October 2009
College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:
More informationInformation Geometry of Gibbs Sampler
Informaton Geometry of Gbbs Sampler Kazuya Takabatake Neuroscence Research Insttute AIST Central 2, Umezono 1-1-1, Tsukuba JAPAN 305-8568 k.takabatake@ast.go.jp Abstract: - Ths paper shows some nformaton
More informationEXPONENTIAL ERGODICITY FOR SINGLE-BIRTH PROCESSES
J. Appl. Prob. 4, 022 032 (2004) Prnted n Israel Appled Probablty Trust 2004 EXPONENTIAL ERGODICITY FOR SINGLE-BIRTH PROCESSES YONG-HUA MAO and YU-HUI ZHANG, Beng Normal Unversty Abstract An explct, computable,
More informationCase Study of Markov Chains Ray-Knight Compactification
Internatonal Journal of Contemporary Mathematcal Scences Vol. 9, 24, no. 6, 753-76 HIKAI Ltd, www.m-har.com http://dx.do.org/.2988/cms.24.46 Case Study of Marov Chans ay-knght Compactfcaton HaXa Du and
More informationACTM State Calculus Competition Saturday April 30, 2011
ACTM State Calculus Competton Saturday Aprl 30, 2011 ACTM State Calculus Competton Sprng 2011 Page 1 Instructons: For questons 1 through 25, mark the best answer choce on the answer sheet provde Afterward
More informationThe Order Relation and Trace Inequalities for. Hermitian Operators
Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence
More informationChapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems
Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons
More informationNumerical Solution of Ordinary Differential Equations
Numercal Methods (CENG 00) CHAPTER-VI Numercal Soluton of Ordnar Dfferental Equatons 6 Introducton Dfferental equatons are equatons composed of an unknown functon and ts dervatves The followng are examples
More informationMATH 281A: Homework #6
MATH 28A: Homework #6 Jongha Ryu Due date: November 8, 206 Problem. (Problem 2..2. Soluton. If X,..., X n Bern(p, then T = X s a complete suffcent statstc. Our target s g(p = p, and the nave guess suggested
More information10-801: Advanced Optimization and Randomized Methods Lecture 2: Convex functions (Jan 15, 2014)
0-80: Advanced Optmzaton and Randomzed Methods Lecture : Convex functons (Jan 5, 04) Lecturer: Suvrt Sra Addr: Carnege Mellon Unversty, Sprng 04 Scrbes: Avnava Dubey, Ahmed Hefny Dsclamer: These notes
More informationDeparture Process from a M/M/m/ Queue
Dearture rocess fro a M/M// Queue Q - (-) Q Q3 Q4 (-) Knowledge of the nature of the dearture rocess fro a queue would be useful as we can then use t to analyze sle cases of queueng networs as shown. The
More informationTHE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens
THE CHINESE REMAINDER THEOREM KEITH CONRAD We should thank the Chnese for ther wonderful remander theorem. Glenn Stevens 1. Introducton The Chnese remander theorem says we can unquely solve any par of
More informationCS 798: Homework Assignment 2 (Probability)
0 Sample space Assgned: September 30, 2009 In the IEEE 802 protocol, the congeston wndow (CW) parameter s used as follows: ntally, a termnal wats for a random tme perod (called backoff) chosen n the range
More informationPerron Vectors of an Irreducible Nonnegative Interval Matrix
Perron Vectors of an Irreducble Nonnegatve Interval Matrx Jr Rohn August 4 2005 Abstract As s well known an rreducble nonnegatve matrx possesses a unquely determned Perron vector. As the man result of
More informationPhysics 5153 Classical Mechanics. D Alembert s Principle and The Lagrangian-1
P. Guterrez Physcs 5153 Classcal Mechancs D Alembert s Prncple and The Lagrangan 1 Introducton The prncple of vrtual work provdes a method of solvng problems of statc equlbrum wthout havng to consder the
More informationProblem Solving in Math (Math 43900) Fall 2013
Problem Solvng n Math (Math 43900) Fall 2013 Week four (September 17) solutons Instructor: Davd Galvn 1. Let a and b be two nteger for whch a b s dvsble by 3. Prove that a 3 b 3 s dvsble by 9. Soluton:
More informationBallot Paths Avoiding Depth Zero Patterns
Ballot Paths Avodng Depth Zero Patterns Henrch Nederhausen and Shaun Sullvan Florda Atlantc Unversty, Boca Raton, Florda nederha@fauedu, ssull21@fauedu 1 Introducton In a paper by Sapounaks, Tasoulas,
More informationModeling and Simulation NETW 707
Modelng and Smulaton NETW 707 Lecture 5 Tests for Random Numbers Course Instructor: Dr.-Ing. Magge Mashaly magge.ezzat@guc.edu.eg C3.220 1 Propertes of Random Numbers Random Number Generators (RNGs) must
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationImplicit Integration Henyey Method
Implct Integraton Henyey Method In realstc stellar evoluton codes nstead of a drect ntegraton usng for example the Runge-Kutta method one employs an teratve mplct technque. Ths s because the structure
More informationModule 2. Random Processes. Version 2 ECE IIT, Kharagpur
Module Random Processes Lesson 6 Functons of Random Varables After readng ths lesson, ou wll learn about cdf of functon of a random varable. Formula for determnng the pdf of a random varable. Let, X be
More informationCOMPLEX NUMBERS AND QUADRATIC EQUATIONS
COMPLEX NUMBERS AND QUADRATIC EQUATIONS INTRODUCTION We know that x 0 for all x R e the square of a real number (whether postve, negatve or ero) s non-negatve Hence the equatons x, x, x + 7 0 etc are not
More information