Capacity Bounds for Backhaul-Supported Wireless Multicast Relay Networks with Cross-Links

Size: px
Start display at page:

Download "Capacity Bounds for Backhaul-Supported Wireless Multicast Relay Networks with Cross-Links"

Transcription

1 Capacty Bouds for Backhaul-Supported Wreless Multcast Relay Networks wth Cross-Lks Proc. of IEEE ICC, Ju. 0. c 0 IEEE. Persoal use of ths materal s permtted. However, permsso to reprt/republsh ths materal for advertsg or promotoal purposes or for creatg ew collectve works for resale or redstrbuto to servers or lsts, or to reuse ay copyrghted compoet of ths work other works must be obtaed from the IEEE. JINFENG DU, MING XIAO, MIKAEL SKOGLUND Stockholm Jue 0 School of Electrcal Egeerg ad the ACCESS Laeus Ceter, Royal Isttute of Techology (KTH), SE Stockholm, Swede IR-EE-KT 0:004

2 Capacty Bouds for Backhaul-Supported Wreless Multcast Relay Networks wth Cross-Lks Jfeg Du, Mg Xao, ad Mkael Skoglud ACCESS Laeus Ceter, Royal Isttute of Techology, Stockholm, Swede Emal: Abstract We vestgate the capacty bouds for a wreless multcast relay etwork where two sources smultaeously multcast to two destatos through Gaussa chaels wth the help of a full-duplex relay ode. All the dvdual chael gas are assumed to be tme-varat ad kow to every odes the etwork. The trasmssos from two sources ad from the relay use the same chael resource (.e. co-chael trasmsso) ad the two source odes are coected wth a orthogoal error-free backhaul. Ths multcast relay etwork s geerc the sese that t ca be exteded to more geeral etworks by tug the chael gas wth the rage [0, ). By extedg the proof of the coverse developed by Cover ad El Gamal for the Gaussa relay chael, we characterze the cut-set boud for ths multcast relay etwork. We also preset a lower boud by usg decodgad-forward relayg combed wth etwork beam-formg. I. INTRODUCTION As show Fg., we cosder a relay-aded two-source two-destato multple multcast etwork where two source odes S ad S multcast ther dvdual message W at rate R ad W at rate R, respectvely, to both destatos D ad D, wth the help of a relay R. Two source odes ca cooperate wth each other through a orthogoal error-free backhaul wth capacty C b. The relay forwards the formato t receves prevous tme slot to both destatos. The trasmssos from S, S, ad R use the same chael resource (.e. co-chael trasmsso) ad mx up at all the recevg termals wth depedet Gaussa ose. The dvdual chael gas g j 0,, j =,, r are assumed to be tme-varat ad kow to every odes ths etwork. The model Fg. s geerc sce t covers a class of etworks by tug the chael gas g j wth the rage [0, ). Such a system s terestg sce t arses, for example, a wreless cellular dowlk where two base statos multcast multmeda formato to two moble termals, oe each cell, wth the help of a dedcated relay deployed at the commo cell boudary. Sce the base statos are coected through the (fber or mcrowave) backhaul, varous cooperatve strateges ca be used to boost the throughput. The full uderstadg of such systems, eve for the orgal three-ode relay etwork, s ot ready yet. Sce 970s, umerous research efforts have bee casted o the relay etworks. Capacty bouds for three-ode relayg etworks (source-relay-sk, or two cooperatve sources ad oe sk) have bee studed [], [], where the capacty regos for degraded or reversely degraded scearos are characterzed. Codg schemes have bee vestgated for multple-access W Backhaul W C b S X g r S g r X R g g g X r g g r g r Y Y D D Ŵ Ŵ Ŵ Ŵ Fg.. Two source odes S ad S, coected wth backhaul, multcast formato W at rate R ad W at rate R respectvely to both destatos D ad D through Gaussa chaels, wth ad from a full-duplex relay R. relay chaels (MARC) [3], [4] volvg multple sources ad a sgle destato, ad for broadcast relay chaels (BRC) [4], [5] where a sgle source trasmts to multple destatos. Recet results o capacty bouds for multplesource multple-destato relay etworks, [6] [9] ad refereces there, have provded valuable sghts. Apart from troducg a dedcated relay, the rate rego ca also be elarged by cooperato amog coferecg/cogtve ecoders [0] [] ad/or amog coferecg decoders []. I ths paper, we am at characterzg the capacty upper ad lower bouds for the system show Fg., where relayg s combed wth source cooperato. To smplfy our aalyss, we wll restrct our aalyss wth a full-duplex relay ad a error-free backhaul wth suffcetly hgh capacty (larger tha the sum-rate,.e. C b >R +R ). Extesos to a half-duplex relay or low-rate backhaul (C b <R +R ) wll be left to future work. Note that, the hgh-rate backhaul makes the capacty rego (R, R ) oly bouded by R +R, whch makes our system closely related to the MIMO relay chaels [3], [4], where S ad S ca be grouped together as a vrtual trasmtter equpped wth two ateas. As dscussed our prevous work [5] for the case wthout cross-lk (.e. g =g =0), the capacty upper bouds derved based o the MIMO relay chael [3], [4] are geeral larger tha the cut-set boud: () the equalty (4) of [3] s acheved oly f whe the relay has at least the same umber of trasmt ateas compared wth the vrtual trasmtter, whch s ot the case here; () the boud (9) of [4] s derved based o the sum-power costrat, whle our case oly per-atea/ode power costrat s appled. Moreover, for the cases of lowrate backhaul, the MIMO upper bouds developed [3], [4] seem rrelevat, but our proof developed here ca stll be helpful by combg wth the strateges [0] [].

3 I our prevous work [6], we have successfully characterzed the exact cut-set boud for the case wthout cross-lk by extedg the proof of the coverse developed by Cover ad El Gamal for the Gaussa relay chael, ad verfed that ths cut-set boud s tght (cocde wth a lower boud) whe the trasmttg power s lower tha a sphere defed by the dvdual chael gas. We exted ths method to the system Fg. ad preset capacty upper ad lower bouds. The rest of ths paper s orgazed as follows. The system model s troduced Sec. II. Our ma results are summarzed Sec. III wth the detaled proof of the cut-set boud preseted Sec. IV. Numercal results are preseted Sec. V wth the cocludg remarks preseted Sec. VI. Notatos: Captal letter X dcates a real valued radom varable ad p(x) dcates ts probablty desty/mass fucto. X () deotes a vector of radom varables of legth ad I(X; Y ) deotes the mutual formato betwee X ad Y. C(x) = log ( + x) s the Gaussa capacty fucto. II. SYSTEM MODEL Gve a average trasmt power costrat P, fxed chael ga g, ad ose power σ, the sgal-to-ose rato (SNR) of that lk ca be wrtte as γ = g P/σ. We ca therefore characterze the trasmsso lks oly by ther dvdual SNR γ, wthout dstgushg the SNR cotrbuto from the trasmt power or the chael ga. Therefore we ca model the system show Fg. as follows Y () = γ X () + γ X () + γ r X r () + Z (), Y () = γ X () + γ X () + γ r X r () + Z (), () () = γ r X () + γ r X () +Z r (), where γ j 0,, j =,, r are the effectve SNR for the correspodg lks. X (), Y (), Z (), =,, r are - dmesoal trasmtted sgals, receved sgals, ad ose at odes S, S ad R, respectvely. A average ut-power costrats are appled to all the trasmtted sgals,.e., X [k]. () k= The ose compoets Z [k], =,, r ad k =,..., are..d. zero-mea ut-varace Gaussa radom varables. III. MAIN RESULTS Theorem : Defe a rate rego as R + R C 0 = sup m{ 0 α,α,ρ C ( (γ +γ r )α +( ρ )α α ( γ γ r γ γ r ) +(γ +γ r )α + ρ α α ( γ γ + γ r γ r ) ), C ( (γ +γ r )α +( ρ )α α ( γ γ r γ γ r ) +(γ +γ r )α + ρ α α ( γ γ + γ r γ r ) ), C ( γ + γ + γ r + ᾱ γ γ r + ᾱ γ γ r +(ρ α α + ᾱ ᾱ ) γ γ ), C ( γ + γ + γ r + ᾱ γ γ r + ᾱ γ γ r +(ρ α α + ᾱ ᾱ ) γ γ )}, (3) Backhaul S S X X D X Y R r Cut Cut Backhaul S X S X Cut 3 R X r Cut 4 Y D Fg.. The sum multcast capacty s bouded by the cut-set boud based o the four cuts show the fgure. where ᾱ = α ad ᾱ = α. For the system Fg. wth power costrats (), ts cut-set boud C cut-set equals to C 0. Proof: The proof ca be foud Secto IV. We also preset a lower boud gve by the cooperatve strategy etwork beam-formg (NBF) [6], whch essetally frst geerates the etwork coded message W b at source odes, ad the cooperates ts trasmsso at S ad S wth the relayg sgal a beam-formg fasho to take advatage of the coheret combg ga. Sce S ad S trasmt the same etwork coded message W b, the achevable sum-rate ca be splt arbtrarly betwee them. Proposto : The capacty rego s lower bouded by the achevable rate rego of NBF, whch s the uo of all rate pars (R, R ) whch satsfy R 0, R 0, ad R + R < m { C ( ( α γ r + α γ r ) ), C ( ( α γ + α γ ) +( ᾱ γ + ᾱ γ + γ r ) ), C(( α γ + α γ ) +( ᾱ γ + ᾱ γ + γ r ) )}, wth the uo take over all 0 α, α. Proof: Ths result s a straghtforward exteso of Proposto 4 [6] by replacg the system model wth () ad formulatg the trasmtted sgals as X () r,b = U() (W b ), X (),b = α V () (W b, W b ) + ᾱ U () (W b ), X (),b = α V () (W b, W b ) + ᾱ U () (W b ), where 0 α, α are power allocato parameters, U (), V () are radom codewords geerated the same way as [6]. Detaled descrpto o ecodg/decodg s skpped due to space lmtato. The costrats (4) correspod to successful decodg at R, D, ad D, respectvely. IV. PROOF OF THE CUT-SET BOUND By the maxmum-flow m-cut theorem [7], the maxmum achevable sum-rate from the source odes to ay of the destatos ca be o larger tha the mmum of the mutual formato flows across all possble cuts, maxmzed over a jot dstrbuto for the trasmtted sgals. The cut-set boud betwee the two sources ad each of the sk for the etwork Fg. ca be derved based o four cuts show Fg. as follows (the dmeso super scrpt () s suppressed hereafter to smplfy the otato) R + R C cut-set = sup p(x,x,x r) m{ I(X, X ; Y, X r ), I(X, X, X r ; Y ), I(X, X ; Y, X r ), I(X, X, X r ; Y )}+ǫ, (4) (5) (6)

4 where X, X ad X r are potetally correlated, ad ǫ 0 as. We wll frst fd a upper boud C upp C cut-set by usg the ew techque, ad the fd a lower boud C cut-set, G C cut-set by restrctg the source dstrbuto to Gaussa. Fally by showg that C cut-set, G = C upp we ca fd the exact cut-set boud C cut-set = C upp = C cut-set, G. A. The upper boud C upp Followg the covetoal otato for the dfferetal etropy h(x) of a cotuous valued radom varable X, the mutual formato correspodg to cut ca be wrtte as I(X, X, X r ; Y ) = h(y ) h(y X, X, X r ) = h(y ) h(z ) = h(y ) log(πe). (7) From the maxmum etropy lemma [7], we get h(y ) h(y, ) log(πevar[y,]), (8) where the secod equalty s acheved whe Y, s Gaussa dstrbuted. Hece I(X, X, X r ; Y ) log(var[y,]) (9) log( Var[Y, ]), where the last steps follow from Jese s equalty, wth Var[Y, ] = +Var[ γ X, + γ X, + γ r X r, ]. (0) Accordg to the law of total varace, for two radom varables X ad Y o the same probablty space, ad the varace of X s fte, the Var[X] = E(Var[X Y ]) + Var[E(X Y )]. We ca therefore rewrte (0) as Var[Y, ] = +Var[E( γ X, + γ X, + γ r X r, X r, )] + E(Var[ γ X, + γ X, + γ r X r, X r, ]) = + E(Var[ γ X, + γ X, X r, ]) () where + Var[ γ E(X, X r, )+ γ E(X, X r, )+ γ r X r, ], E(Var[ γ X, + γ X, X r, ]) = E(γ Var[X, X r, ] ad + γ Var[X, X r, ]+ γ γ Cov(X,, X, X r, )) =γ E(Var[X, X r, ]) + γ E(Var[X, X r, ]) () + γ γ E(Cov(X,, X, X r, )), Var[ γ E(X, X r, )+ γ E(X, X r, )+ γ r X r, ] E[( γ E[X, X r, ]+ γ E[X, X r, ]+ γ r X r, ) ] =γ E(E [X, X r, ])+ γ γ r E(X r, E[X, X r, ]) (3) +γ E(E [X, X r, ])+ γ γ r E(X r, E[X, X r, ]) +γ r E(X r, )+ γ γ E(E[X, X r, ]E[X, X r, ]). As [], defe ᾱ = E[E (X, X r, )], α [0, ], (4) the we have E[Var(X, X r, )] = (E[X,] E[E (X, X r, )]) = E[X, ] E[E (X, X r, )] α, (5) where the equalty comes from (). Smlarly we have ᾱ = E[E (X, X r, )], E[Var(X, X r, )] α, (6) where α [0, ]. O the other had, as Cov(X,, X, X r, ) = φ Var(X, X r, )Var(X, X r, ), where φ s the correlato coeffcet, we have E[Cov(X,, X, X r, )] φ E[Var(X, X r, )] φ E[Var(X, X r, )] α α, (7) where the frst equalty s due to the Cauchy Schwarz equalty ad the last step s gve by (5) ad (6). Gve that φ, we ca troduce a auxlary varable 0 ρ such that E[Cov(X,, X, X r, )] = ρ α α. (8) Also, usg the Cauchy Schwarz equalty we get E(X r, E[X, X r, ]) (9) E[Xr, ] E(E [X, X r, ]) ᾱ, E(X r, E[X, X r, ]) ᾱ, (0) E(E[X, X r, ]E[X, X r, ]) ᾱ ᾱ. () Now, substtutg () () to (9), ad apply the same approach also to cut 4, we get I(X, X, X r ; Y ) C(γ +γ +γ r + ᾱ γ γ r + ᾱ γ γ r + (ρ α α + ᾱ ᾱ ) γ γ ), () I(X, X, X r ; Y ) C(γ +γ +γ r + ᾱ γ γ r + ᾱ γ γ r + (ρ α α + ᾱ ᾱ ) γ γ ). (3)

5 For cut we have I(X, X ; Y, X r ) = h(y, X r ) h(y, X, X, X r ) =h(y, X r ) h(y X, X, X r ) h( X, X, X r ) (4) = h(y, X r ) h(z ) h(z r ) = h(y, X r ) log(πe) log ( (πe) K ) log(πe) = log ( K ), C cut-set C cut-set, G = where the secod equalty (4) comes from the fact that Y ad are depedet gve (X, X, X r ) ad the equalty s due to the maxmum etropy lemma [7], wth equalty acheved by jot Gaussa dstrbuted (Y,,, ) wth codtoal covarace matrces K, whch s defed by [ K = E(Var[Y, X r, ]) E[Cov(Y,,, X r, )] E[Cov(Y,,, X r, )] E(Var[, X r, ]) Obvously, the covarace matrces K are postve semdefte. Sce the fucto log K s cocave [8], we ca thus boud the throughput of cut from (4) as follows I(X, X ; Y, X r ) log ( K ) = log ( E(Var[Y, X r, ]) j= E(Var[,j X r,j ]) ]. ( E[Cov(Y,,, X r, )] ) ). (5) Furthermore, sce E(Var[Y, X r, ]) = + E(Var[ γ X, + γ X, X r, ]), E(Var[, X r, ]) = + E(Var[ γ r X, + γ r X, X r, ]), E[Cov(Y,,, X r, )] = γ γ r E(Var[X, X r, ]) + γ γ r E(Var[X, X r, ]) +( γ γ r + γ γ r )E[Cov(X,, X, X r, )], by combg wth () ad (5) (8), we ca coclude that I(X, X ; Y, X r ) C ( (γ +γ r )α +( ρ )α α ( γ γ r γ γ r ) +(γ +γ r )α + ρ α α ( γ γ + γ r γ r ) ). (6) Smlarly, we ca boud the throughput of cut 3 as follows I(X, X ; Y, X r ) C ( (γ +γ r )α +( ρ )α α ( γ γ r γ γ r ) +(γ +γ r )α + ρ α α ( γ γ + γ r γ r ) ). (7) By substtutg () (3) (6) (7) to (6) ad, comparg the resultg rego to (3) we ca coclude that C cut-set C upp = C 0. B. The lower boud C cut-set, G By restrctg p(x, X, X r ) (6) to be Gaussa, we ca partto X, X ad X r as follows X r = U, X = ( ρ)α S + ρα V + ( α )U, X = ( ρ)α S + ρα V + ( α )U, (8a) (8b) (8c) where S, S, V, U are -dmesoal depedet Gaussa radom vectors wth zero-mea ad ut-varace. Auxlary varables 0 α, α, ρ are troduced to represet the potetal correlato amog X, X ad X r due to cooperato. by substtutg (8) to (), we ca derve from (6) that sup m 0 α,α,ρ { (9) log(var[y, ]), log(var[y, ]), log ( K, ),log ( K, )}+ǫ, where ǫ 0 as, ad for =,..., we have Var[Y, ] =+ ρα γ + ρα γ +ρ( α γ + α γ ) +( ᾱ γ + ᾱ γ + γ r ), Var[Y, ] =+ ρα γ + ρα γ +ρ( α γ + α γ ) +( ᾱ γ + ᾱ γ + γ r ), (30) K, = (+ ρα γ + ρα γ +ρ( α γ + α γ ) ) (+ ρα γ r + ρα γ r +ρ( α γ r + α γ r ) ) ( γ γ r α + γ γ r α +( γ γ r + γ γ r )ρ α α ), K, = (+ ρα γ + ρα γ +ρ( α γ + α γ ) ) (+ ρα γ r + ρα γ r +ρ( α γ r + α γ r ) ) ( γ γ r α + γ γ r α +( γ γ r + γ γ r )ρ α α ). By substtutg (30) to (9) ad lettg, comparg the resultg rego to (3) we ca coclude that C cut-set C cut-set, G = C 0. Recall that C cut-set, G C cut-set C upp, we ca fally coclude that C cut-set = C 0,.e., Theorem holds. V. NUMERICAL RESULTS We preset the umercal results of the cut-set boud ad the NBF lower boud o the capacty regos wth dfferet lk qualty. Uless stated otherwse, the followg heurstc parameters wll be used: The S D lk SNR γ =5dB, the source-destato lk SNR γ, the source-relay lk SNR γ r =γ r, the relay-destato lk SNR γ r, ad the cross-lk SNR γ =γ. I Fg. 3 we vestgate the mpact of the relay-destato lk qualty o the capacty rego. Whe the R D lk s ot strog, the R D lk SNR γ r s ot a lmtg factor ad therefore the capacty wll mootocally crease wth γ r utl t s large eough to reach the bottleeck set by γ r, as demostrated Fg. 3. The gap betwee the cut-set boud the NBF lower boud s always less tha 0. bts/chael use. I Fg. 4 we fx the S R lk SNR γ r ad vary the SNR of the S R lk. Whe the S R lk s poor (γ r = 0dB), the S R lk s the oly relable chael betwee S, S ad R ad therefore ts qualty has a large mpact o the capacty. Whe the S R lk s strog, however, S ca commucate wth R relably va S thaks to the backhual, eve for a poor S R lk. The mpact of γ r wll dmsh whe γ r becomes very large, as show the zoom- plot. Note that the decodg requremet at relay for NBF troduces a large gap whe both γ r ad γ r are small.

6 Capacty bouds [bts/chael use] R D lk SNR, γ r Fg. 3. Capacty bouds for varyg R D lk SNR γ r. Capacty bouds [bts/chael use] 3.5.5, γ =γ, γ =γ, γ =γ, γ =γ S R SNR, γ r =γ r Fg. 5. Capacty bouds for varyg symmetrc source-relay SNR γ r = γ r. Capacty bouds [bts/chael use] , γ r, γ r, γ r, γ r S R lk SNR, γ r Fg. 4. Capacty bouds for varyg S R lk SNR γ r. I Fg. 5 we show the mpact of the source-relay lk for weak ad strog cross-lk qualty. Obvously the NBF strategy does ot utlze the beeft from the cross-lk whe the source-relay coecto s ot good eough. Whe the source-relay lk s good, as show Fg. 6, the achevable rate of NBF creases wth mproved cross-lk qualty utl the decodg at the relay becomes the bottleeck. The cut-set boud has o restrcto o decodg at R ad therefore wll crease wth the mproved cross-lk qualty. VI. CONCLUSION We have derved the cut-set boud for backhaul-supported wreless multcast relay etworks wth cross-lk ad provded achevable rate based o etwork beam-formg strategy. The gap betwee the cut-set boud ad the achevable rate s ot large geeral, as llustrated the umercal results. Sce the NBF strategy caot take full advatage of the cross-lk, a better scheme has to be sought further work. ACKNOWLEDGMENTS Ths work s fuded by VR ad VINNOVA. REFERENCES [] T. M. Cover ad A. El Gamal, Capacty theorems for the relay chael, IEEE Tras. If. Theory, vol. 5, pp , Sep [] A. Høst-Madse ad J. Zhag, Capacty bouds ad power allocato for wreless relay chaels, IEEE Tras. If. Theory, vol. 5, pp , Ju [3] G. Kramer ad A. J. va Wjgaarde, O the whte Gaussa multpleaccess relay chael, Proc. of IEEE ISIT, Ja Capacty bouds [bts/chael use] , γ r =5dB, γ r =5dB, γ r, γ r Cross lk SNR, γ =γ Fg. 6. Capacty bouds for varyg symmetrc cross-lk SNR γ =γ. [4] G. Kramer, M. Gastpar ad P. Gupta, Cooperatve strateges ad capacty theorems for relay etworks, IEEE Tras. If. Theory, vol. 5, pp , Sep [5] Y. Lag ad G. Kramer, Rate regos for relay broadcast chaels, IEEE Tras. If. Theory, vol. 53, pp , Oct [6] O. Sah ad E. Erkp, Achevable rates for the Gaussa terferece relay chael, Proc. of IEEE GLOBECOM, Nov [7] A. Avestmehr ad T. Ho, Approxmate capacty of the symmetrc halfduplex Gaussa butterfly etwork, Proc. of IEEE ITW, Ju [8] D. Güdüz, O. Smeoe, A. J. Goldsmth, H. V. Poor, ad S. Shama, Relayg smultaeous multcast messages, Proc. of IEEE ITW, Ju [9], Multple multcasts wth the help of a relay, IEEE Tras. If. Theory, vol. 56, pp , Dec. 00. [0] N. Devroye, P. Mtra, ad V. Tarokh, Achevable rates cogtve rado chaels, IEEE Tras. If. Theory, vol. 5, pp , May 006. [] S. I. Bross, A. Lapdoth, ad M. A. Wgger, The Gaussa MAC wth coferecg ecoders, Proc. of IEEE ISIT, Jul [] O. Smeoe, D. Güdüz, H. V. Poor, A. J. Goldsmth, ad S. Shama, Compoud multple-access chaels wth partal cooperato, IEEE Tras. If. Theory, vol. 55, pp , Ju [3] B. Wag, J. Zhag, ad A. Høst-Madse, O the capacty of MIMO relay chaels, IEEE Tras. If. Theory, vol. 5, pp. 9 43, Ja [4] S. Smoes, O. Muñoz-Meda, J. Vdal, ad A. del Coso, O the Gaussa MIMO relay chael wth full chael state formato, IEEE Tras. Sgal Proc., vol. 57, pp , Sep [5] J. Du, M. Xao, ad M. Skoglud, Capacty bouds for relay-aded wreless multple multcast wth backhaul, proc. of WCSP, Oct. 00. [6] J. Du, M. Xao, ad M. Skoglud, Cooperatve etwork codg strateges for wreless relay etworks wth backhaul, accepted for publcato IEEE Tras. Commu., to appear Sep. 0. [7] T. M. Cover ad J. A. Thomas, Elemets of Iformato Theory, New York, Wley, 006. [8], Determat equaltes va formato theory, SIAM joural o matrx aalyss ad applcatos, vol. 9, pp , Jul. 998.

Functions of Random Variables

Functions 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

Lecture 3 Probability review (cont d)

Lecture 3 Probability review (cont d) STATS 00: Itroducto to Statstcal Iferece Autum 06 Lecture 3 Probablty revew (cot d) 3. Jot dstrbutos If radom varables X,..., X k are depedet, the ther dstrbuto may be specfed by specfyg the dvdual dstrbuto

More information

UNIVERSITY OF OSLO DEPARTMENT OF ECONOMICS

UNIVERSITY 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 information

ρ < 1 be five real numbers. The

ρ < 1 be five real numbers. The Lecture o BST 63: Statstcal Theory I Ku Zhag, /0/006 Revew for the prevous lecture Deftos: covarace, correlato Examples: How to calculate covarace ad correlato Theorems: propertes of correlato ad covarace

More information

Chapter 4 Multiple Random Variables

Chapter 4 Multiple Random Variables Revew for the prevous lecture: Theorems ad Examples: How to obta the pmf (pdf) of U = g (, Y) ad V = g (, Y) Chapter 4 Multple Radom Varables Chapter 44 Herarchcal Models ad Mxture Dstrbutos Examples:

More information

A tighter lower bound on the circuit size of the hardest Boolean functions

A tighter lower bound on the circuit size of the hardest Boolean functions Electroc Colloquum o Computatoal Complexty, Report No. 86 2011) A tghter lower boud o the crcut sze of the hardest Boolea fuctos Masak Yamamoto Abstract I [IPL2005], Fradse ad Mlterse mproved bouds o the

More information

Bounds on the expected entropy and KL-divergence of sampled multinomial distributions. Brandon C. Roy

Bounds 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 information

Lecture 02: Bounding tail distributions of a random variable

Lecture 02: Bounding tail distributions of a random variable CSCI-B609: A Theorst s Toolkt, Fall 206 Aug 25 Lecture 02: Boudg tal dstrbutos of a radom varable Lecturer: Yua Zhou Scrbe: Yua Xe & Yua Zhou Let us cosder the ubased co flps aga. I.e. let the outcome

More information

Estimation of Stress- Strength Reliability model using finite mixture of exponential distributions

Estimation 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 information

{ }{ ( )} (, ) = ( ) ( ) ( ) Chapter 14 Exercises in Sampling Theory. Exercise 1 (Simple random sampling): Solution:

{ }{ ( )} (, ) = ( ) ( ) ( ) 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 information

Econometric Methods. Review of Estimation

Econometric 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 information

Basics of Information Theory: Markku Juntti. Basic concepts and tools 1 Introduction 2 Entropy, relative entropy and mutual information

Basics of Information Theory: Markku Juntti. Basic concepts and tools 1 Introduction 2 Entropy, relative entropy and mutual information : Maru Jutt Overvew he propertes of adlmted Gaussa chaels are further studed, parallel Gaussa chaels ad Gaussa chaels wth feedac are solved. Source he materal s maly ased o Sectos.4.6 of the course oo

More information

ECE 559: Wireless Communication Project Report Diversity Multiplexing Tradeoff in MIMO Channels with partial CSIT. Hoa Pham

ECE 559: Wireless Communication Project Report Diversity Multiplexing Tradeoff in MIMO Channels with partial CSIT. Hoa Pham ECE 559: Wreless Commucato Project Report Dversty Multplexg Tradeoff MIMO Chaels wth partal CSIT Hoa Pham. Summary I ths project, I have studed the performace ga of MIMO systems. There are two types of

More information

D. VQ WITH 1ST-ORDER LOSSLESS CODING

D. VQ WITH 1ST-ORDER LOSSLESS CODING VARIABLE-RATE VQ (AKA VQ WITH ENTROPY CODING) Varable-Rate VQ = Quatzato + Lossless Varable-Legth Bary Codg A rage of optos -- from smple to complex A. Uform scalar quatzato wth varable-legth codg, oe

More information

Summary of the lecture in Biostatistics

Summary 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 information

Introduction to local (nonparametric) density estimation. methods

Introduction 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 information

CHAPTER VI Statistical Analysis of Experimental Data

CHAPTER 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 information

best estimate (mean) for X uncertainty or error in the measurement (systematic, random or statistical) best

best 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 information

Chapter 5 Properties of a Random Sample

Chapter 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 information

TESTS BASED ON MAXIMUM LIKELIHOOD

TESTS BASED ON MAXIMUM LIKELIHOOD ESE 5 Toy E. Smth. The Basc Example. TESTS BASED ON MAXIMUM LIKELIHOOD To llustrate the propertes of maxmum lkelhood estmates ad tests, we cosder the smplest possble case of estmatg the mea of the ormal

More information

Investigation of Partially Conditional RP Model with Response Error. Ed Stanek

Investigation of Partially Conditional RP Model with Response Error. Ed Stanek Partally Codtoal Radom Permutato Model 7- vestgato of Partally Codtoal RP Model wth Respose Error TRODUCTO Ed Staek We explore the predctor that wll result a smple radom sample wth respose error whe a

More information

Homework 1: Solutions Sid Banerjee Problem 1: (Practice with Asymptotic Notation) ORIE 4520: Stochastics at Scale Fall 2015

Homework 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 information

Point Estimation: definition of estimators

Point 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 information

Chapter 4 (Part 1): Non-Parametric Classification (Sections ) Pattern Classification 4.3) Announcements

Chapter 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 information

MEASURES OF DISPERSION

MEASURES 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 information

Rademacher Complexity. Examples

Rademacher Complexity. Examples Algorthmc Foudatos of Learg Lecture 3 Rademacher Complexty. Examples Lecturer: Patrck Rebesch Verso: October 16th 018 3.1 Itroducto I the last lecture we troduced the oto of Rademacher complexty ad showed

More information

3. Basic Concepts: Consequences and Properties

3. Basic Concepts: Consequences and Properties : 3. Basc Cocepts: Cosequeces ad Propertes Markku Jutt Overvew More advaced cosequeces ad propertes of the basc cocepts troduced the prevous lecture are derved. Source The materal s maly based o Sectos.6.8

More information

Bayes Estimator for Exponential Distribution with Extension of Jeffery Prior Information

Bayes Estimator for Exponential Distribution with Extension of Jeffery Prior Information Malaysa Joural of Mathematcal Sceces (): 97- (9) Bayes Estmator for Expoetal Dstrbuto wth Exteso of Jeffery Pror Iformato Hadeel Salm Al-Kutub ad Noor Akma Ibrahm Isttute for Mathematcal Research, Uverst

More information

18.413: Error Correcting Codes Lab March 2, Lecture 8

18.413: Error Correcting Codes Lab March 2, Lecture 8 18.413: Error Correctg Codes Lab March 2, 2004 Lecturer: Dael A. Spelma Lecture 8 8.1 Vector Spaces A set C {0, 1} s a vector space f for x all C ad y C, x + y C, where we take addto to be compoet wse

More information

2. Independence and Bernoulli Trials

2. Independence and Bernoulli Trials . Ideedece ad Beroull Trals Ideedece: Evets ad B are deedet f B B. - It s easy to show that, B deedet mles, B;, B are all deedet ars. For examle, ad so that B or B B B B B φ,.e., ad B are deedet evets.,

More information

1 Solution to Problem 6.40

1 Solution to Problem 6.40 1 Soluto to Problem 6.40 (a We wll wrte T τ (X 1,...,X where the X s are..d. wth PDF f(x µ, σ 1 ( x µ σ g, σ where the locato parameter µ s ay real umber ad the scale parameter σ s > 0. Lettg Z X µ σ we

More information

9 U-STATISTICS. Eh =(m!) 1 Eh(X (1),..., X (m ) ) i.i.d

9 U-STATISTICS. Eh =(m!) 1 Eh(X (1),..., X (m ) ) i.i.d 9 U-STATISTICS Suppose,,..., are P P..d. wth CDF F. Our goal s to estmate the expectato t (P)=Eh(,,..., m ). Note that ths expectato requres more tha oe cotrast to E, E, or Eh( ). Oe example s E or P((,

More information

Bounds for the Connective Eccentric Index

Bounds for the Connective Eccentric Index It. J. Cotemp. Math. Sceces, Vol. 7, 0, o. 44, 6-66 Bouds for the Coectve Eccetrc Idex Nlaja De Departmet of Basc Scece, Humates ad Socal Scece (Mathematcs Calcutta Isttute of Egeerg ad Maagemet Kolkata,

More information

Solving Constrained Flow-Shop Scheduling. Problems with Three Machines

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 information

Discrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand DIS 10b

Discrete 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 information

Analysis of Variance with Weibull Data

Analysis 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 information

PTAS for Bin-Packing

PTAS 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 information

Chapter 14 Logistic Regression Models

Chapter 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 information

Multiple Linear Regression Analysis

Multiple Linear Regression Analysis LINEA EGESSION ANALYSIS MODULE III Lecture - 4 Multple Lear egresso Aalyss Dr. Shalabh Departmet of Mathematcs ad Statstcs Ida Isttute of Techology Kapur Cofdece terval estmato The cofdece tervals multple

More information

Entropy ISSN by MDPI

Entropy ISSN by MDPI Etropy 2003, 5, 233-238 Etropy ISSN 1099-4300 2003 by MDPI www.mdp.org/etropy O the Measure Etropy of Addtve Cellular Automata Hasa Aı Arts ad Sceces Faculty, Departmet of Mathematcs, Harra Uversty; 63100,

More information

Chapter 13, Part A Analysis of Variance and Experimental Design. Introduction to Analysis of Variance. Introduction to Analysis of Variance

Chapter 13, Part A Analysis of Variance and Experimental Design. Introduction to Analysis of Variance. Introduction to Analysis of Variance Chapter, Part A Aalyss of Varace ad Epermetal Desg Itroducto to Aalyss of Varace Aalyss of Varace: Testg for the Equalty of Populato Meas Multple Comparso Procedures Itroducto to Aalyss of Varace Aalyss

More information

Module 7: Probability and Statistics

Module 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 information

A New Measure of Probabilistic Entropy. and its Properties

A New Measure of Probabilistic Entropy. and its Properties Appled Mathematcal Sceces, Vol. 4, 200, o. 28, 387-394 A New Measure of Probablstc Etropy ad ts Propertes Rajeesh Kumar Departmet of Mathematcs Kurukshetra Uversty Kurukshetra, Ida rajeesh_kuk@redffmal.com

More information

THE ROYAL STATISTICAL SOCIETY 2016 EXAMINATIONS SOLUTIONS HIGHER CERTIFICATE MODULE 5

THE ROYAL STATISTICAL SOCIETY 2016 EXAMINATIONS SOLUTIONS HIGHER CERTIFICATE MODULE 5 THE ROYAL STATISTICAL SOCIETY 06 EAMINATIONS SOLUTIONS HIGHER CERTIFICATE MODULE 5 The Socety s provdg these solutos to assst cadtes preparg for the examatos 07. The solutos are teded as learg ads ad should

More information

X X X E[ ] E X E X. is the ()m n where the ( i,)th. j element is the mean of the ( i,)th., then

X X X E[ ] E X E X. is the ()m n where the ( i,)th. j element is the mean of the ( i,)th., then Secto 5 Vectors of Radom Varables Whe workg wth several radom varables,,..., to arrage them vector form x, t s ofte coveet We ca the make use of matrx algebra to help us orgaze ad mapulate large umbers

More information

Broadcast Channel with Transmitter Noncausal Interference and Receiver Side Information

Broadcast Channel with Transmitter Noncausal Interference and Receiver Side Information IEEE ICC 04 - Commucatos Theory Broadcast Chael wth Trasmtter Nocausal Iterferece ad Recever Sde Iformato Hayag X, Xaoju Yua ad Soug Chag Lew Dept. of Iformato Egeerg, The Chese Uversty of Hog Kog, Hog

More information

Sampling Theory MODULE X LECTURE - 35 TWO STAGE SAMPLING (SUB SAMPLING)

Sampling Theory MODULE X LECTURE - 35 TWO STAGE SAMPLING (SUB SAMPLING) Samplg Theory ODULE X LECTURE - 35 TWO STAGE SAPLIG (SUB SAPLIG) DR SHALABH DEPARTET OF ATHEATICS AD STATISTICS IDIA ISTITUTE OF TECHOLOG KAPUR Two stage samplg wth uequal frst stage uts: Cosder two stage

More information

Ordinary Least Squares Regression. Simple Regression. Algebra and Assumptions.

Ordinary 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 information

Comparing Different Estimators of three Parameters for Transmuted Weibull Distribution

Comparing Different Estimators of three Parameters for Transmuted Weibull Distribution Global Joural of Pure ad Appled Mathematcs. ISSN 0973-768 Volume 3, Number 9 (207), pp. 55-528 Research Ida Publcatos http://www.rpublcato.com Comparg Dfferet Estmators of three Parameters for Trasmuted

More information

Algorithms behind the Correlation Setting Window

Algorithms behind the Correlation Setting Window Algorths behd the Correlato Settg Wdow Itroducto I ths report detaled forato about the correlato settg pop up wdow s gve. See Fgure. Ths wdow s obtaed b clckg o the rado butto labelled Kow dep the a scree

More information

Complete Convergence and Some Maximal Inequalities for Weighted Sums of Random Variables

Complete Convergence and Some Maximal Inequalities for Weighted Sums of Random Variables Joural of Sceces, Islamc Republc of Ira 8(4): -6 (007) Uversty of Tehra, ISSN 06-04 http://sceces.ut.ac.r Complete Covergece ad Some Maxmal Iequaltes for Weghted Sums of Radom Varables M. Am,,* H.R. Nl

More information

ECE 729 Introduction to Channel Coding

ECE 729 Introduction to Channel Coding chaelcodg.tex May 4, 2006 ECE 729 Itroducto to Chael Codg Cotets Fudametal Cocepts ad Techques. Chaels.....................2 Ecoders.....................2. Code Rates............... 2.3 Decoders....................

More information

Multiple Choice Test. Chapter Adequacy of Models for Regression

Multiple 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 information

CS286.2 Lecture 4: Dinur s Proof of the PCP Theorem

CS286.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 information

Lecture 9: Tolerant Testing

Lecture 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 information

Chapter 8. Inferences about More Than Two Population Central Values

Chapter 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 information

Supplementary Material for Limits on Sparse Support Recovery via Linear Sketching with Random Expander Matrices

Supplementary Material for Limits on Sparse Support Recovery via Linear Sketching with Random Expander Matrices Joata Scarlett ad Volka Cever Supplemetary Materal for Lmts o Sparse Support Recovery va Lear Sketcg wt Radom Expader Matrces (AISTATS 26, Joata Scarlett ad Volka Cever) Note tat all ctatos ere are to

More information

Qualifying Exam Statistical Theory Problem Solutions August 2005

Qualifying Exam Statistical Theory Problem Solutions August 2005 Qualfyg Exam Statstcal Theory Problem Solutos August 5. Let X, X,..., X be d uform U(,),

More information

PROJECTION PROBLEM FOR REGULAR POLYGONS

PROJECTION PROBLEM FOR REGULAR POLYGONS Joural of Mathematcal Sceces: Advaces ad Applcatos Volume, Number, 008, Pages 95-50 PROJECTION PROBLEM FOR REGULAR POLYGONS College of Scece Bejg Forestry Uversty Bejg 0008 P. R. Cha e-mal: sl@bjfu.edu.c

More information

UNIVERSITY OF OSLO DEPARTMENT OF ECONOMICS

UNIVERSITY 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 information

CIS 800/002 The Algorithmic Foundations of Data Privacy October 13, Lecture 9. Database Update Algorithms: Multiplicative Weights

CIS 800/002 The Algorithmic Foundations of Data Privacy October 13, Lecture 9. Database Update Algorithms: Multiplicative Weights CIS 800/002 The Algorthmc Foudatos of Data Prvacy October 13, 2011 Lecturer: Aaro Roth Lecture 9 Scrbe: Aaro Roth Database Update Algorthms: Multplcatve Weghts We ll recall aga) some deftos from last tme:

More information

On the Delay-Throughput Tradeoff in Distributed Wireless Networks

On the Delay-Throughput Tradeoff in Distributed Wireless Networks SUBMITTED TO IEEE TRANSACTIONS ON INFORMATION THEORY, OCTOBER 2009 O the Delay-Throughput Tradeoff Dstrbuted Wreless Networks Jamshd Aboue, Alreza Bayesteh, ad Amr K. Khada Codg ad Sgal Trasmsso Laboratory

More information

C-1: Aerodynamics of Airfoils 1 C-2: Aerodynamics of Airfoils 2 C-3: Panel Methods C-4: Thin Airfoil Theory

C-1: Aerodynamics of Airfoils 1 C-2: Aerodynamics of Airfoils 2 C-3: Panel Methods C-4: Thin Airfoil Theory ROAD MAP... AE301 Aerodyamcs I UNIT C: 2-D Arfols C-1: Aerodyamcs of Arfols 1 C-2: Aerodyamcs of Arfols 2 C-3: Pael Methods C-4: Th Arfol Theory AE301 Aerodyamcs I Ut C-3: Lst of Subects Problem Solutos?

More information

CHAPTER 3 POSTERIOR DISTRIBUTIONS

CHAPTER 3 POSTERIOR DISTRIBUTIONS CHAPTER 3 POSTERIOR DISTRIBUTIONS If scece caot measure the degree of probablt volved, so much the worse for scece. The practcal ma wll stck to hs apprecatve methods utl t does, or wll accept the results

More information

Simulation Output Analysis

Simulation 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

THE ROYAL STATISTICAL SOCIETY HIGHER CERTIFICATE

THE 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 information

Lecture Notes Types of economic variables

Lecture 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 information

Lecture 07: Poles and Zeros

Lecture 07: Poles and Zeros Lecture 07: Poles ad Zeros Defto of poles ad zeros The trasfer fucto provdes a bass for determg mportat system respose characterstcs wthout solvg the complete dfferetal equato. As defed, the trasfer fucto

More information

(b) By independence, the probability that the string 1011 is received correctly is

(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 information

ESS Line Fitting

ESS 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 information

Principal Components. Analysis. Basic Intuition. A Method of Self Organized Learning

Principal Components. Analysis. Basic Intuition. A Method of Self Organized Learning Prcpal Compoets Aalss A Method of Self Orgazed Learg Prcpal Compoets Aalss Stadard techque for data reducto statstcal patter matchg ad sgal processg Usupervsed learg: lear from examples wthout a teacher

More information

Derivation of 3-Point Block Method Formula for Solving First Order Stiff Ordinary Differential Equations

Derivation of 3-Point Block Method Formula for Solving First Order Stiff Ordinary Differential Equations Dervato of -Pot Block Method Formula for Solvg Frst Order Stff Ordary Dfferetal Equatos Kharul Hamd Kharul Auar, Kharl Iskadar Othma, Zara Bb Ibrahm Abstract Dervato of pot block method formula wth costat

More information

The Mathematical Appendix

The 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 information

Analysis of Lagrange Interpolation Formula

Analysis of Lagrange Interpolation Formula P IJISET - Iteratoal Joural of Iovatve Scece, Egeerg & Techology, Vol. Issue, December 4. www.jset.com ISS 348 7968 Aalyss of Lagrage Iterpolato Formula Vjay Dahya PDepartmet of MathematcsMaharaja Surajmal

More information

Feature Selection: Part 2. 1 Greedy Algorithms (continued from the last lecture)

Feature 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 information

Chapter 10 Two Stage Sampling (Subsampling)

Chapter 10 Two Stage Sampling (Subsampling) Chapter 0 To tage amplg (usamplg) I cluster samplg, all the elemets the selected clusters are surveyed oreover, the effcecy cluster samplg depeds o sze of the cluster As the sze creases, the effcecy decreases

More information

Channel Polarization and Polar Codes; Capacity Achieving

Channel Polarization and Polar Codes; Capacity Achieving Chael Polarzato ad Polar Codes; Capacty chevg Peyma Hesam Tutoral of Iformato Theory Course Uversty of otre Dame December, 9, 009 bstract: ew proposed method for costructg codes that acheves the symmetrc

More information

Logistic regression (continued)

Logistic regression (continued) STAT562 page 138 Logstc regresso (cotued) Suppose we ow cosder more complex models to descrbe the relatoshp betwee a categorcal respose varable (Y) that takes o two (2) possble outcomes ad a set of p explaatory

More information

Lecture 7. Confidence Intervals and Hypothesis Tests in the Simple CLR Model

Lecture 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 information

A New Family of Transformations for Lifetime Data

A 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 information

Multi Objective Fuzzy Inventory Model with. Demand Dependent Unit Cost and Lead Time. Constraints A Karush Kuhn Tucker Conditions.

Multi 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 information

2.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.

2.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 information

Lecture 4 Sep 9, 2015

Lecture 4 Sep 9, 2015 CS 388R: Radomzed Algorthms Fall 205 Prof. Erc Prce Lecture 4 Sep 9, 205 Scrbe: Xagru Huag & Chad Voegele Overvew I prevous lectures, we troduced some basc probablty, the Cheroff boud, the coupo collector

More information

Chain Rules for Entropy

Chain Rules for Entropy Cha Rules for Etroy The etroy of a collecto of radom varables s the sum of codtoal etroes. Theorem: Let be radom varables havg the mass robablty x x.x. The...... The roof s obtaed by reeatg the alcato

More information

Arithmetic Mean and Geometric Mean

Arithmetic Mean and Geometric Mean Acta Mathematca Ntresa Vol, No, p 43 48 ISSN 453-6083 Arthmetc Mea ad Geometrc Mea Mare Varga a * Peter Mchalča b a Departmet of Mathematcs, Faculty of Natural Sceces, Costate the Phlosopher Uversty Ntra,

More information

The number of observed cases The number of parameters. ith case of the dichotomous dependent variable. the ith case of the jth parameter

The 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 information

THE ROYAL STATISTICAL SOCIETY GRADUATE DIPLOMA

THE ROYAL STATISTICAL SOCIETY GRADUATE DIPLOMA THE ROYAL STATISTICAL SOCIETY 3 EXAMINATIONS SOLUTIONS GRADUATE DIPLOMA PAPER I STATISTICAL THEORY & METHODS The Socety provdes these solutos to assst caddates preparg for the examatos future years ad

More information

Mu Sequences/Series Solutions National Convention 2014

Mu Sequences/Series Solutions National Convention 2014 Mu Sequeces/Seres Solutos Natoal Coveto 04 C 6 E A 6C A 6 B B 7 A D 7 D C 7 A B 8 A B 8 A C 8 E 4 B 9 B 4 E 9 B 4 C 9 E C 0 A A 0 D B 0 C C Usg basc propertes of arthmetc sequeces, we fd a ad bm m We eed

More information

Block-Based Compact Thermal Modeling of Semiconductor Integrated Circuits

Block-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 information

THE COMPLETE ENUMERATION OF FINITE GROUPS OF THE FORM R 2 i ={R i R j ) k -i=i

THE COMPLETE ENUMERATION OF FINITE GROUPS OF THE FORM R 2 i ={R i R j ) k -i=i ENUMERATON OF FNTE GROUPS OF THE FORM R ( 2 = (RfR^'u =1. 21 THE COMPLETE ENUMERATON OF FNTE GROUPS OF THE FORM R 2 ={R R j ) k -= H. S. M. COXETER*. ths paper, we vestgate the abstract group defed by

More information

L5 Polynomial / Spline Curves

L5 Polynomial / Spline Curves L5 Polyomal / Sple Curves Cotets Coc sectos Polyomal Curves Hermte Curves Bezer Curves B-Sples No-Uform Ratoal B-Sples (NURBS) Mapulato ad Represetato of Curves Types of Curve Equatos Implct: Descrbe a

More information

Wireless Link Properties

Wireless Link Properties Opportustc Ecrypto for Robust Wreless Securty R. Chadramoul ( Moul ) moul@steves.edu Multmeda System, Networkg, ad Commucatos (MSyNC) Laboratory, Departmet of Electrcal ad Computer Egeerg, Steves Isttute

More information

STK4011 and STK9011 Autumn 2016

STK4011 and STK9011 Autumn 2016 STK4 ad STK9 Autum 6 Pot estmato Covers (most of the followg materal from chapter 7: Secto 7.: pages 3-3 Secto 7..: pages 3-33 Secto 7..: pages 35-3 Secto 7..3: pages 34-35 Secto 7.3.: pages 33-33 Secto

More information

NP!= P. By Liu Ran. Table of Contents. The P vs. NP problem is a major unsolved problem in computer

NP!= P. By Liu Ran. Table of Contents. The P vs. NP problem is a major unsolved problem in computer NP!= P By Lu Ra Table of Cotets. Itroduce 2. Strategy 3. Prelmary theorem 4. Proof 5. Expla 6. Cocluso. Itroduce The P vs. NP problem s a major usolved problem computer scece. Iformally, t asks whether

More information

Multivariate Transformation of Variables and Maximum Likelihood Estimation

Multivariate 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 information

VARIABLE-RATE VQ (AKA VQ WITH ENTROPY CODING)

VARIABLE-RATE VQ (AKA VQ WITH ENTROPY CODING) VARIABLE-RATE VQ (AKA VQ WITH ENTROPY CODING) Varable-Rate VQ = Quatzato + Lossless Varable-Legth Bary Codg A rage of optos -- from smple to complex a. Uform scalar quatzato wth varable-legth codg, oe

More information

Exercises for Square-Congruence Modulo n ver 11

Exercises 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 information

Error probability and error stream properties in channel with slow Rician fading

Error probability and error stream properties in channel with slow Rician fading Error probablty ad error stream propertes chael wth slow Rca fadg Paper Krystya M. Noga Abstract I a rado commucato chael wave parameters fluctuate radomly. The sgal evelope udergoes deep fades. Whe bary

More information

[ L] υ = (3) [ L] n. Q: What are the units of K in Eq. (3)? (Why is units placed in quotations.) What is the relationship to K in Eq. (1)?

[ L] υ = (3) [ L] n. Q: What are the units of K in Eq. (3)? (Why is units placed in quotations.) What is the relationship to K in Eq. (1)? Chem 78 Spr. M. Wes Bdg Polyomals Bdg Polyomals We ve looked at three cases of lgad bdg so far: The sgle set of depedet stes (ss[]s [ ] [ ] Multple sets of depedet stes (ms[]s, or m[]ss All or oe, or two-state

More information

Introduction to Matrices and Matrix Approach to Simple Linear Regression

Introduction to Matrices and Matrix Approach to Simple Linear Regression Itroducto to Matrces ad Matrx Approach to Smple Lear Regresso Matrces Defto: A matrx s a rectagular array of umbers or symbolc elemets I may applcatos, the rows of a matrx wll represet dvduals cases (people,

More information