Random Variables and Distribution Functions

Save this PDF as:

Size: px
Start display at page:

Transcription

1 Topic 7 Rndom Vibles nd Distibution Functions 7.1 Intoduction Fom the univese of possible infomtion, we sk question. To ddess this question, we might collect quntittive dt nd ognize it, fo emple, using the empiicl cumultive distibution function. With this infomtion, we e ble to compute smple mens, stndd devitions, medins nd so on. Similly, even fily simple pobbility model cn hve n enomous numbe of outcomes. Fo emple, flip coin 332 times. Then the numbe of outcomes is moe thn google ( ) numbe t lest 100 quintillion times the numbe of elementy pticles in the known univese. We my not be inteested in n nlysis tht consides septely evey possible outcome but the some simple concept like the numbe of heds o the longest un of tils. To focus ou ttention on the issues of inteest, we tke given outcome nd compute numbe. This function is clled ndom vible. Definition 7.1. A ndom vible is el vlued function fom the pobbility spce. sttistics pobbility univese of smple spce - infomtion nd pobbility - P + + sk question nd define ndom collect dt vible X + + ognize into the ognize into the empiicl cumultive cumultive distibution function distibution function + + compute smple compute distibutionl mens nd vinces mens nd vinces Tble I: Coesponding notions between sttistics nd pobbility. Emining pobbilities models nd ndom vibles will led to sttegies fo the collection of dt nd infeence fom these dt. X :! R. Genelly speking, we shll use cpitl lettes ne the end of the lphbet, e.g., X, Y, Z fo ndom vibles. The nge S of ndom vible is sometimes clled the stte spce. Eecise 7.2. Roll die twice nd conside the smple spce ={(i, j); i, j =1, 2, 3, 4, 5, 6} nd give some ndom vibles on. Eecise 7.3. Flip coin 10 times nd conside the smple spce, the set of 10-tuples of heds nd tils, nd give some ndom vibles on. 101

2 We often cete new ndom vibles vi composition of functions: Thus, if X is ndom vible, then so e! 7! X(!) 7! f(x(!)) X 2, ep X, p X2 +1, tn 2 X, bxc nd so on. The lst of these, ounding down X to the neest intege, is clled the floo function. Eecise 7.4. How would we use the floo function to ound down numbe to n deciml plces. 7.2 Distibution Functions Hving defined ndom vible of inteest, X, the question typiclly becomes, Wht e the chnces tht X lnds in some subset of vlues B? Fo emple, We wite B = {odd numbes}, B = {gete thn 1}, o B = {between 2 nd 7}. {! 2 ; X(!) 2 B} (7.1) to indicte those outcomes! which hve X(!), the vlue of the ndom vible, in the subset A. We shll often bbevite (7.1) to the shote sttement {X 2 B}. Thus, fo the emple bove, we my wite the events {X is n odd numbe}, {X is gete thn 1} = {X >1}, {X is between 2 nd 7} = {2 <X<7} to coespond to the thee choices bove fo the subset B. Mny of the popeties of ndom vibles e not concened with the specific ndom vible X given bove, but the depends on the wy X distibutes its vlues. This leds to definition in the contet of ndom vibles tht we sw peviously with quntitive dt.. Definition 7.5. A (cumultive) distibution function of ndom vible X is defined by F X () =P {! 2 ; X(!) pple }. Recll tht with quntittive obsevtions, we clled the nlogous notion the empiicl cumultive distibution function. Using the bbevited nottion bove, we shll typiclly wite the less eplicit epession fo the distibution function. F X () =P {X pple } Eecise 7.6. Estblish the following identities tht elte ndom vible the complement of n event nd the union nd intesection of events 1. {X 2 B} c = {X 2 B c } 2. Fo sets B 1,B 2,..., [ {X 2 B i } = {X 2 [ i i B} nd \ {X 2 B i } = {X 2 \ i i B}. 3. If B 1,...B n fom ptition of the smple spce S, then C i = {X 2 B i }, i =1,...,nfom ptition of the pobbility spce. 102

3 Eecise 7.7. Fo ndom vible X nd subset B of the smple spce S, define P X (B) =P {X 2 B}. Show tht P X is pobbility. Fo the complement of {X pple }, we hve the suvivl function F X () =P {X >} =1 P {X pple } =1 F X (). Choose <b, then the event {X pple } {X pple b}. Thei set theoetic diffeence {X pple b}\{x pple } = { <Xpple b}. In wods, the event tht X is less thn o equl to b but not less thn o equl to is the event tht X is gete thn nd less thn o equl to b. Consequently, by the diffeence ule fo pobbilities, P { <Xpple b} = P ({X pple b}\{x pple }) =P {X pple b} P {X pple } = F X (b) F X (). (7.2) Thus, we cn compute the pobbility tht ndom vible tkes vlues in n intevl by subtcting the distibution function evluted t the endpoints of the intevls. Ce is needed on the issue of the inclusion o eclusion of the endpoints of the intevl. Emple 7.8. To give the cumultive distibution function fo X, the sum of the vlues fo two olls of die, we stt with the tble nd cete the gph P {X = } 1/36 2/36 3/36 4/36 5/36 6/36 5/36 4/36 3/36 2/36 1/ /4 1/2 1/ Figue 7.1: Gph of F X, the cumultive distibution function fo the sum of the vlues fo two olls of die. 103

4 If we look t the gph of this cumultive distibution function, we see tht it is constnt in between the possible vlues fo X nd tht the jump size t is equl to P {X = }. In this emple, P {X =5} =4/36, the size of the jump t =5. In ddition, F X (5) F X (2) = P {2 <Xpple 5} = P {X =3} + P {X =4} + P {X =5} = X P {X = } = = <pple5 We shll cll ndom vible discete if it hs finite o countbly infinite stte spce. Thus, we hve in genel tht: P { <Xpple b} = X P {X = }. <ppleb Eecise 7.9. Let X be the numbe of heds on thee independent flips of bised coin tht tuns ups heds with pobbility p. Give the cumultive distibution function F X fo X. Eecise Let X be the numbe of spdes in collection of thee cds. Give the cumultive distibution function fo X. Use R to plot this function. Eecise Find the cumultive distibution function of Y = X 3 in tems of F X, the distibution function fo X. 7.3 Popeties of the Distibution Function A distibution function F X hs the popety tht it stts t 0, ends t 1 nd does not decese with incesing vlues of.. This is the content of the net eecise. Eecise lim! 1 F X () =0. 2. lim!1 F X () =1. 3. F X is nondecesing. The cumultive distibution function F X of discete ndom vible X is constnt ecept fo jumps. At the jump, F X is ight continuous, lim F X() =F X ( 0 ).! 0+ The net eecise sk tht this be shown moe genelly. Eecise Pove the sttement concening the ight continuity of the distibution function fom the continuity popety of pobbility. Definition A continuous ndom vible hs cumultive distibution function F X tht is diffeentible. So, distibution functions fo continuous ndom vibles incese smoothly. To show how this cn occu, we will develop n emple of continuous ndom vible. Emple Conside dtbod hving unit dius. Assume tht the dt lnds ndomly unifomly on the dtbod. Let X be the distnce fom the cente. Fo 2 [0, 1], F X () =P {X pple } = e inside cicle of dius e of cicle = = pobbility !0.2!0.4!0.6! !1!1!0.8!0.6!0.4! Figue 7.2: (top) Dtbod. (bottom) Cumultive distibution function fo the dtbod ndom vible.

5 Thus, we hve the distibution function 8 < 0 if pple 0, F X () = 2 if 0 <pple 1, : 1 if >1. The fist line sttes tht X cnnot be negtive. The thid sttes tht X is t most 1, nd the middle lines descibes how X distibutes is vlues between 0 nd 1. Fo emple, F X 1 2 = 1 4 indictes tht with pobbility 1/4, the dt will lnd within 1/2 unit of the cente of the dtbod. Eecise Find the pobbility tht the dt lnds between 1/3 unit nd 2/3 unit fom the cente. Eecise Let the ewd Y fo though the dt be the invese 1/X of the distnce fom the cente. Find the cumultive distibution function fo Y. Eecise An eponentil ndom vible X hs cumultive distibution function F X () =P {X pple } = 0 if pple 0, 1 ep( ) if >0. (7.3) fo some >0. Show tht F X hs the popeties of distibution function. Its vlue t cn be computed in R using the commnd pep(,0.1) fo > cuve(pep(,0.1),0,80) =1/10 nd dwn using pep(, 0.1) Figue 7.3: Cumultive distibution function fo n eponentil ndom vible with =1/10. Eecise The time until the net bus ives is n eponentil ndom vible with = 1/10 minutes. A peson wits fo bus t the bus stop until the bus ives, giving up when the wit eches 20 minutes. Give the cumultive distibution function fo T, the time tht the peson emins t the bus sttion nd sketch gph. Even though the cumultive distibution function is defined fo evey ndom vible, we will often use othe chcteiztions, nmely, the mss function fo discete ndom vible nd the density function fo continuous ndom vibles. Indeed, we typiclly will intoduce ndom vible vi one of these two functions. In the net two sections we intoduce these two concepts nd develop some of thei popeties. 105

6 7.4 Mss Functions Definition The (pobbility) mss function of discete ndom vible X is f X () =P {X = }. The mss function hs two bsic popeties: f X () 0 fo ll in the stte spce. P f X() =1. The fist popety is bsed on the fct tht pobbilities e non-negtive. The second follows fom the obsevtion tht the collection C = {!; X(!) =} fo ll 2 S, the stte spce fo X, foms ptition of the pobbility spce. In Emple 7.8, we sw the mss function fo the ndom vible X tht is the sum of the vlues on two independent olls of fi dice. Emple Let s mke tosses of bised coin whose outcomes e independent. We shll continue tossing until we obtin toss of heds. Let X denote the ndom vible tht gives the numbe of tils befoe the fist hed nd p denote the pobbility of heds in ny given toss. Then f X (0) = P {X =0} = P {H} = p f X (1) = P {X =1} = P {TH} =(1 f X (2) = P {X =2} = P {TTH} =(1 p)p p) 2 p... f X () =P {X = } = P {T TH} =(1 p) p So, the pobbility mss function f X () =(1 p) p. Becuse the tems in this mss function fom geometic sequence, X is clled geometic ndom vible. Recll tht geometic sequence c, c, c 2,...,c n hs sum s n = c + c + c c n = c(1 n+1 ) 1 fo 6= 1. If < 1, then lim n!1 n =0nd thus s n hs limit s n!1. In this cse, the infinite sum is the limit Eecise Estblish the fomul bove fo s n. c + c + c c n + = lim n!1 s n = c 1. The mss function bove foms geometic sequence with the tio =1 nd b, p. Consequently, fo positive integes P { <Xpple b} = bx =+1 (1 p) p =(1 p) +1 p + +(1 p) b p = (1 p)+1 p (1 p) b+1 p 1 (1 p) =(1 p) +1 (1 p) b+1 We cn tke =0to find the distibution function fo geometic ndom vible. F X (b) =P {X pple b} =1 (1 p) b+1. Eecise Give second wy to find the distibution function bove by eplining why P {X >b} =(1 p) b

7 The mss function nd the cumultive distibution function fo the geometic ndom vible with pmete p =1/3 cn be found in R by witing > <-c(0:10) > f<-dgeom(,1/3) > F<-pgeom(,1/3) The initil d indictes density nd p indictes the pobbility fom the distibution function. > dt.fme(,f,f) f F Note tht the diffeence in vlues in the distibution function F X () F X ( 1), giving the height of the jump in F X t, is equl to the vlue of the mss function. Fo emple, F X (3) F X (2) = = = f X (2). Eecise Check tht the jumps in the cumultive distibution function fo the geometic ndom vible bove is equl to the vlues of the mss function. Eecise Fo the geometic ndom vible bove, find P {X pple 3}, P {2 <Xpple 5}. P {X >4}. We cn simulte 100 geometic ndom vibles with pmete p = 1/3 using the R commnd geom(100,1/3). (See Figue 7.4.) Histogm of Histogm of Fequency Fequency Figue 7.4: Histogm of 100 nd 10,000 simulted geometic ndom vibles with p =1/3. Note tht the histogm looks much moe like geometic seies fo 10,000 simultions. We shll see lte how this eltes to the lw of lge numbes. 107

8 7.5 Density Functions Definition Fo X ndom vible whose distibution function F X hs deivtive. The function f X stisfying F X () = Z 1 f X (t) dt is clled the pobbility density function nd X is clled continuous ndom vible. By the fundmentl theoem of clculus, the density function is the deivtive of the distibution function. In othe wods, F X ( + ) F X () f X () = lim = F 0!0 X(). F X ( + ) F X () f X (). We cn compute pobbilities by evluting definite integls P { <Xpple b} = F X (b) F X () = The density function hs two bsic popeties tht mio the popeties of the mss function: Z b f X (t) dt. f X () 0 fo ll in the stte spce. R 11 f X() d =1. Retun to the dt bod emple, letting X be the distnce fom the cente of dtbod hving unit dius. Then, P { <Xpple + } = F X ( + ) F X () f X () =2 nd X hs density 8 < 0 if <0, f X () = 2 if 0 pple pple 1, : 0 if >1. Figue 7.5: The pobbility P { <Xpple b} is the e unde the density function, bove the is between y = nd y = b. Eecise Let f X be the density fo ndom vible X nd pick numbe 0. Eplin why P {X = 0 } =0. Emple Fo the eponentil distibution function (7.3), we hve the density function 0 if pple 0, f X () = e if >0. Emple Density functions do not need to be bounded, fo emple, if we tke 8 < 0 if pple 0, f X () = pc : if 0 <<1, 0 if 1 pple. 108

9 Then, to find the vlue of the constnt c, we compute the integl So c =1/2. Fo 0 pple <bpple 1, 1= Z 1 0 P { <Xpple b} = c p t dt =2c p t 1 0 =2c. Z b 1 2 p t dt = p t b = p b Eecise Give the cumultive distibution function fo the ndom vible in the pevious emple. Eecise Let X be continuous ndom vible with density f X, then the ndom vible Y = X + b hs density f Y (y) = 1 y b f X (Hint: Begin with the definition of the cumultive distibution function F Y fo Y. Conside the cses >0 nd <0 septely.) p. 7.6 Joint Distibutions Becuse we will collect dt on sevel obsevtions, we must, s well, conside moe thn one ndom vible t time in ode to model ou epeimentl pocedues. Consequently, we will epnd on the concepts bove to the cse of multiple ndom vibles nd thei joint distibution. Fo the cse of two ndom vibles, X 1 nd X 2, this mens looking t the pobbility of events, P {X 1 2 B 1,X 2 2 B 2 }. Fo discete ndom vibles, tke B 1 = { 1 } nd B 2 = { 2 } nd define the joint pobbility mss function f X1,X 2 ( 1, 2 )=P {X 1 = 1,X 2 = 2 }. Fo continuous ndom vibles, we conside B 1 =( 1, ] nd B 2 =( 2, ] nd sk tht fo some function f X1,X 2, the joint pobbility density function to stisfy P { 1 <X 1 pple 1 + 1, 2 <X 2 pple } f X1,X 2 ( 1, 2 ) 1 2. Emple Genelize the notion of mss nd density functions to moe thn two ndom vibles Independent Rndom Vibles Mny of ou epeimentl potocols will be designed so tht obsevtions e independent. Moe pecisely, we will sy tht two ndom vibles X 1 nd X 2 e independent if ny two events ssocited to them e independent, i.e., P {X 1 2 B 1,X 2 2 B 2 } = P {X 1 2 B 1 }P {X 2 2 B 2 }. In wods, the pobbility tht the two events {X 1 2 B 1 } nd {X 2 2 B 2 } hppen simultneously is equl to the poduct of the pobbilities tht ech of them hppen individully. Fo independent discete ndom vibles, we hve tht f X1,X 2 ( 1, 2 )=P {X 1 = 1,X 2 = 2 } = P {X 1 = 1 }P {X 2 = 2 } = f X1 ( 1 )f X2 ( 2 ). In this cse, we sy tht the joint pobbility mss function is the poduct of the mginl mss functions. 109

10 Fo continuous ndom vibles, f X1,X 2 ( 1, 2 ) 1 2 P { 1 <X 1 pple 1 + 1, 2 <X 2 pple } = P { 1 <X 1 pple }P { 2 <X 2 pple } f X1 ( 1 ) 1 f X2 ( 2 ) 2 = f X1 ( 1 )f X2 ( 2 ) 1 2. Thus, fo independent continuous ndom vibles, the joint pobbility density function is the poduct of the mginl density functions. f X1,X 2 ( 1, 2 )=f X1 ( 1 )f X2 ( 2 ) Eecise Genelize the notion of independent mss nd density functions to moe thn two ndom vibles. Soon, we will be looking t n independent obsevtions 1, 2,..., n ising fom n unknown density o mss function f. Thus, the joint density is f( 1 )f( 2 ) f( n ). Genelly speking, the density function f will depend on the choice of pmete vlue. (Fo emple, the unknown pmete in the density function fo n eponentil ndom vible tht descibes the witing time fo bus.) Given the dt ising fom the n obsevtions, the likelihood function ises by consideing this joint density not s function of 1,..., n, but the s function of the pmete. We shll len how the study of the likelihood plys mjo ole in pmete estimtion nd in the testing of hypotheses. 7.7 Simulting Rndom Vibles One gol fo these notes is to povide the tools needed to design infeentil pocedues bsed on sound pinciples of sttisticl science. Thus, one of the vey impotnt uses of sttisticl softwe is the bility to genete pseudodt to simulte the ctul dt. This povides the oppotunity to test nd efine methods of nlysis in dvnce of the need to use these methods on genuine dt. This equies tht we eploe the popeties of the dt though simultion. Fo mny of the fequently used fmilies of ndom vibles, R povides commnds fo thei simultion. We shll emine these fmilies nd thei popeties in Topic 9, Emples of Mss Functions nd Densities. Fo othe cicumstnces, we will need to hve methods fo simulting sequence of independent ndom vibles tht possess common distibution. We fist conside the cse of discete ndom vibles Discete Rndom Vibles nd the smple Commnd The smple commnd is used to cete simple nd sttified ndom smples. Thus, if we ente sequence, smple(,40) chooses 40 enties fom in such wy tht ll choices of size 40 hve the sme pobbility. This uses the defult R commnd of smpling without eplcement. We cn use this commnd to simulte discete ndom vibles. To do this, we need to give the stte spce in vecto nd mss function f. The cll fo eplce=true indictes tht we e smpling with eplcement. Then to give smple of n independent ndom vibles hving common mss function f, we use smple(,n,eplce=true,pob=f). Emple Let X be descibed by the mss function f X () Then to simulte 50 independent obsevtions fom this mss function: > <-c(1,2,3,4) > f<-c(0.1,0.2,0.3,0.4) > sum(f) 110

11 [1] 1 > dt<-smple(,50,eplce=true,pob=f) > dt [1] [43] Notice tht 1 is the lest epesented vlue nd 4 is the most epesented. If the commnd pob=f is omitted, then smple will choose unifomly fom the vlues in the vecto. Let s check ou simultion ginst the mss function tht geneted the dt. (Notice the double equl sign, ==.) Fist, ecount the obsevtions tht tke on ech possible vlue fo. We cn mke tble. > tble(dt) dt o use the counts to detemine the simulted popotions. > counts<-ep(0,m()-min()+1) > fo (i in min():m()){counts[i]<-length(dt[dt==i])} > simpob<-counts/(sum(counts)) > dt.fme(,f,simpob) f simpob Eecise Simulte the sums on ech of 20 olls of pi of dice. Repet this fo 1000 olls nd compe the simultion with the ppopite mss function Figue 7.6: Illustting the Pobbility Tnsfom. Fist simulte unifom ndom vibles u 1,u 2,...,u n on the intevl [0, 1]. About 10% of the ndom numbes should be in the intevl [0.3, 0.4]. This coesponds to the 10% of the simultions on the intevl [0.28, 0.38] fo ndom vible with distibution function F X shown. Similly, bout 10% of the ndom numbes should be in the intevl [0.7, 0.8] which coesponds to the 10% of the simultions on the intevl [0.96, 1.51] fo ndom vible with distibution function F X, These vlues on the -is cn be obtined fom tking the invese function of F X, i.e., i = F 1 X (u i). 111

12 7.7.2 Continuous Rndom Vibles nd the Pobbility Tnsfom If X continuous ndom vible with density f X tht is positive eveywhee in its domin, then the distibution function F X () =P {X pple } is stictly incesing. In this cse F X hs invese function F 1 X, known s the quntile function. Eecise F X () pple u if nd only if pple F 1 X (u). The pobbility tnsfom follows fom n nlysis of the ndom vible U = F X (X) Note tht F X hs nge fom 0 to 1. It cnnot tke vlues below 0 o bove 1. Thus, U tkes on vlues between 0 nd 1. Thus, F U (u) =0fo u<0 nd F U (u) =1fo u 1. Fo vlues of u between 0 nd 1, note tht P {F X (X) pple u} = P {X pple F 1 X (u)} = F X(F 1 X (u)) = u. Thus, the distibution function fo the ndom vible U, 8 < 0 u<0, F U (u) = u 0 pple u<1, : 1 1 pple u. If we cn simulte U, we cn simulte ndom vible with distibution F X vi the quntile function X = F 1 X (U). (7.4) Tke deivtive to see tht the density 8 < 0 u<0, f U (u) = 1 0 pple u<1, : 0 1 pple u. Becuse the ndom vible U hs constnt density ove the intevl of its possible vlues, it is clled unifom on the intevl [0, 1]. It is simulted in R using the unif commnd. The identity (7.4) is clled the pobbility tnsfom. This tnsfom is illustted in Figue 7.6. We cn see how the pobbility tnsfom woks in the following emple. Emple Fo the dt bod, fo between 0 nd 1, the distibution function u = F X () = 2 nd thus the quntile function = F 1 X (u) =p u. We cn simulte independent obsevtions of the distnce fom the cente X 1,X 2,...,X n of the dt bod by simulting independent unifom ndom vibles U 1,U 2,...U n nd tking the quntile function X i = p U i. 112 pobbility Figue 7.7: The distibution function (ed) nd the empiicl cumultive distibution function (blck) bsed on 100 simultions of the dt bod distibution. R commnds given below.

13 > u<-unif(100) > <-sqt(u) > d<-seq(0,1,0.01) > plot(sot(),1:length()/length(), type="s",lim=c(0,1),ylim=c(0,1), lb="",ylb="pobbility") > p(new=true) > plot(d,dˆ2,type="l",lim=c(0,1),ylim=c(0,1),lb="",ylb="",col="ed") Eecise If U is unifom on [0, 1], then so is V =1 U. Sometimes, it is esie to simulte X using F 1 X (V ). Emple Fo n eponentil ndom vible, set u = F X () =1 ep( ), nd thus = 1 ln(1 u) Consequently, we cn simulte independent eponentil ndom vibles X 1,X 2,...,X n by simulting independent unifom ndom vibles V 1,V 2,...V n nd tking the tnsfom R ccomplishes this diectly though the ep commnd. X i = 1 ln V i. 7.8 Answes to Selected Eecises 7.2. The sum, the mimum, the minimum, the diffeence, the vlue on the fist die, the poduct The oll with the fist H, the numbe of T, the longest un of H, the numbe of T s fte the fist H b10 n c/10 n 7.6. A common wy to show tht two events A 1 nd A 2 e equl is to pick n element! 2 A 1 nd show tht it is in A 2. This poves A 1 A 2. Then pick n element! 2 A 2 nd show tht it is in A 1, poving tht A 2 A 1. Tken togethe, we hve tht the events e equl, A 1 = A 2. Sometimes the logic needed in showing A 1 A 2 consist not solely of implictions, but the of equivlent sttements. (We cn indicte this with the symbol ().) In this cse we cn combine the two pts of the gument. Fo this eecise, s the lines below show, this is successful sttegy. We follow n bity outcome! 2. 1.! 2{X 2 B} c ()! /2{X 2 B} ()X(!) /2 B () X(!) 2 B c ()! 2{X 2 B c }. Thus, {X 2 B} c = {X 2 B c }. 2.! 2 S i {X 2 B i}()! 2{X 2 B i } fo some i () X(!) 2 B i fo some i () X(!) 2 S i B i ()! 2{X 2 S i B}. Thus, S i {X 2 B i} = {X 2 S i B}. The identity with intesection is simil with fo ll insted of fo some. 3. We must show tht the union of the C i is equl to the stte spce S nd tht ech pi e mutully eclusive. Fo this () Becuse B i e ptition of, S i B i =, nd [ C i = [ {X 2 B i } = {X 2 [ i i i B i } = {X 2 } = S, the stte spce. 113

14 (b) Fo i 6= j, B i \ B j = ;, nd C i \ C j = {X 2 B i }\{X 2 B j } = {X 2 B i \ B j } = {X 2 ;} = ; Let s check the thee ioms. Ech veifiction is bsed on the coesponding iom fo the pobbility P. 1. Fo ny subset B, P X (B) =P {X 2 B} Fo the smple spce S, P X (S) =P {X 2 S} = P ( ) = Fo mutully eclusive subsets B i,i =1, 2,, we hve by the eecise bove the mutully eclusive events {X 2 B i },i=1, 2,. Thus,! ( )! [ 1 1[ 1[ 1X 1X P X B i = P X 2 B i = P {X 2 B i } = P {X 2 B i } = P X (B i ). i=1 i= Fo thee tosses of bised coin, we hve i=1 i= P {X = } (1 p) 3 3p(1 p) 2 3p 2 (1 p) p 3 Thus, the cumultive distibution function, 8 0 fo <0, >< (1 p) 3 fo 0 pple <1, F X () = (1 p) 3 +3p(1 p) 2 =(1 p) 2 (1 + 2p) fo 1 pple <2, (1 p) >: 2 (1 + 2p)+3p 2 (1 p) =1 p 3 fo 2 pple <3, 1 fo 3 pple Fom the emple in the section Bsics of Pobbility, we know tht To plot the distibution function, we use, P {X = } > hets<-c(0:3) > f<-choose(13,hets)*choose(39,3-hets)/choose(52,3) > (F<-cumsum(f)) [1] > plot(hets,f,ylim=c(0,1),type="s") Thus, the cumultive distibution function, 8 0 fo <0, >< fo 0 pple <1, F X () = fo 1 pple <2, fo 2 pple <3, >: 1 fo 3 pple The cumultive distibution function fo Y, F Y (y) =P {Y pple y} = P {X 3 pple y} = P {X pple 3p y} = F X ( 3p y) To veify the thee popeties fo the distibution function: F i= hets

15 1. Let n! 1be decesing sequence. Then 1 > 2 > Thus, {X pple 1 } {X pple 2 } P {X pple 1 } P {X pple 2 } Fo ech outcome!, eventully, fo some n, X(!) > n, nd!/2{x pple n } nd consequently no outcome! is in ll of the events {X pple n } nd 1\ {X pple n } = ;. n=1 Now, use the second continuity popety of pobbilities. 2. Let n!1be n incesing sequence. Then 1 < 2 < Thus, {X pple 1 } {X pple 2 }. P {X pple 1 }pplep {X pple 2 }pple. Fo ech outcome!, eventully, fo some n, X(!) pple n, nd 1[ {X pple n } =. n=1 Now, use the fist continuity popety of pobbilities. 3. Let 1 < 2, then {X pple 1 } {X pple 2 } nd by the monotonicity ule fo pobbilities P {X pple 1 }pplep {X pple 2 }, o witten in tems of the distibution function, F X ( 1 ) pple F X ( 2 ) Let n! 0 be stictly decesing sequence. Then 1 > 2 > 1\ {X pple 1 } {X pple 2 }, {X pple n } = {X pple 0 }. (Check this lst equlity.) Then P {X pple 1 } P {X pple 2 }. Now, use the second continuity popety of pobbilities to obtin lim n!1 F X ( n )=lim n!1 P {X pple n } = P {X pple 0 } = F X ( 0 ). Becuse this holds fo evey stictly decesing sequencing sequence with limit 0, we hve tht n=1 lim F X() =F X ( 0 ).! Using the identity in (7.2), we hve 1 P 3 <Xpple 2 3 = F F = = 3 9 = 1 3. Check Eecise 7.22 to see tht the nswe does not depend on whethe o not the endpoints of the intevl e included Using the eltion Y =1/X, we find tht the distibution function fo Y, F Y (y) =P {Y pple y} = P {1/X pple y} = P {X 1/y} =1 P {X <1/y} =1 Thus uses the fct tht P {X =1/y} = We use the fct tht the eponentil function is incesing, nd tht lim u!1 ep( u) =0. Using the numbeing of the popeties bove y 2.

16 1. Becuse F X () =0fo ll <0, lim! 1 F X () =0. 2. lim!1 ep( ) =0. Thus, lim!1 F X () =lim!1 1 ep( ) =1. 3. Fo <0, F X is constnt, F X (0) = 0. Fo 0, note tht ep( ) is decesing. Thus, F X () = 1 ep( ) is incesing. Consequenlty, the distibution function F X is non-decesing The distibution function hs the gph shown in Figue 7.8. F Figue 7.8: Cumultive distibution function fo n eponentil ndom vible with =1/10 nd jump t =20. The fomul 8 < 0 if <0, F T () =P {X pple } = 1 ep( /10) if 0 pple <20, : 1 if 20 pple Fo 6= 1, wite the epessions fo s n nd s n nd subtct. Notice tht most of the tems cncel. Now divide by 1 s n = c+ c +c c n s n = c +c c n +c n+1 (1 )s n = c c n+1 = c(1 n+1 ) to obtin the fomul The event {X >b} is the sme s hving the fist b +1coin tosses tun up tils. Thus, the outcome is b +1 independent events ech with pobbility 1 p. Consequently, P {X >b} =(1 p) b P {X pple 3} = F X (3) = , P {2 <Xpple 5} = F X (5) F X (2) = = , nd P {X >4} 1 F X (4) = = Let f X be the density. Then 0 pple P {X = 0 }pplep { 0 <Xpple + } = Now the integl goes to 0 s! 0. So, we must hve P {X = 0 } = Z 0+ 0 f X () d.

17 7.28. Becuse the density is non-negtive on the intevl [0, 1], F X () =0if <0 nd F X () =1if 1. Fo between 0 nd 1, Z 1 2 p t dt = p t = p. 0 Thus, 8 < 0 p if pple 0, F X () = if 0 <<1, : 1 if 1 pple The ndom vible Y hs distibution function F Y (y) =P {Y pple y} = P {X + b pple y} = P {X pple y b}. Fo >0 F Y (y) =P X pple y b y b = F X. Now tke deivtive nd use the chin ule to find the density y b 1 f Y (y) =FY 0 (y) =f X = 1 y b f X. Fo <0 Now the deivtive F Y (y) =P X y b y b =1 F X. y b 1 f Y (y) =FY 0 (y) = f X = 1 y f X b The joint density (mss function) fo X 1,X 2,...,X n f X1,X 2,...,X n ( 1, 2,..., n )=f X1 ( 1 )f X2 ( 2 ) f Xn ( n ) is the poduct of the mginl densities (mss functions) Hee is the R code. > <-c(2:12) > [1] > f<-c(1,2,3,4,5,6,5,4,3,2,1)/36 > sum(f) [1] 1 > (twodice<-smple(,20,eplce=true,pob=f)) [1] > twodice<-smple(,1000,eplce=true,pob=f) > counts<-ep(0,m()-min()+1) > fo (i in min():m()){counts[i]<-length(twodice[twodice==i])} > feq=counts/(sum(counts)) > dt.fme(,f,feq[min():m()]) f feq.min...m

18 F Figue 7.9: Sum on two fi dice. The empiicl cumultive distibution function fom the simultion (in blck) nd the cumultive distibution function (in ed) e shown fo Eecise We lso hve plot to compe the empiicl cumultive distibution function fom the simultion with the cumultive distibution function. > plot(sot(twodice),1:length(twodice)/length(twodice),type="s",lim=c(2,12), ylim=c(0,1),lb="",ylb="") > p(new=true) > plot(,f,type="s",lim=c(2,12),ylim=c(0,1),col="ed") F X is incesing nd continuous, so the set {; F X () pple u} is the intevl ( 1,F 1 X (u)]. In ddition, is in this invevl pecisely when pple F 1 X (u) Let s find F V. If v<0, then 0 pple P {V pple v} pplep {V pple 0} = P {1 U pple 0} = P {1 pple U} =0 becuse U is neve gete thn 1. Thus, F V (v) =0Similly, if v 1, 1 P {V pple v} P {V pple 1} = P {1 U pple 1} = P {0 pple U} =1 becuse U is lwys gete thn 0. Thus, F V (v) =1. Fo 0 pple v<1, F V (v) =P {V pple v} = P {1 U pple v} = P {1 v pple U} =1 P {U <1 v} =1 (1 v) =v. This mtches the distibution function of unifom ndom vible on [0, 1]. 118

Orbits and Kepler s Laws

Obits nd Keple s Lws This web pge intoduces some of the bsic ides of obitl dynmics. It stts by descibing the bsic foce due to gvity, then consides the ntue nd shpe of obits. The next section consides how

Summary: Vectors. This theorem is used to find any points (or position vectors) on a given line (direction vector). Two ways RT can be applied:

Summ: Vectos ) Rtio Theoem (RT) This theoem is used to find n points (o position vectos) on given line (diection vecto). Two ws RT cn e pplied: Cse : If the point lies BETWEEN two known position vectos

(1) continuity equation: 0. momentum equation: u v g (2) u x. 1 a

Comment on The effect of vible viscosity on mied convection het tnsfe long veticl moving sufce by M. Ali [Intentionl Jounl of Theml Sciences, 006, Vol. 45, pp. 60-69] Asteios Pntoktos Associte Pofesso

Polynomial Functions. Polynomial functions in one variable can be written in expanded form as ( )

Polynomil Functions Polynomil functions in one vrible cn be written in expnded form s n n 1 n 2 2 f x = x + x + x + + x + x+ n n 1 n 2 2 1 0 Exmples of polynomils in expnded form re nd 3 8 7 4 = 5 4 +

Sceentde C Insunce Policy Summy This is summy of the policy nd does not contin the full tems nd conditions of the cove, which cn be found in the policy booklet nd schedule. It is impotnt tht you ed the

Helicopter Theme and Variations

Helicopter Theme nd Vritions Or, Some Experimentl Designs Employing Pper Helicopters Some possible explntory vribles re: Who drops the helicopter The length of the rotor bldes The height from which the

MATH 150 HOMEWORK 4 SOLUTIONS

MATH 150 HOMEWORK 4 SOLUTIONS Section 1.8 Show tht the product of two of the numbers 65 1000 8 2001 + 3 177, 79 1212 9 2399 + 2 2001, nd 24 4493 5 8192 + 7 1777 is nonnegtive. Is your proof constructive

SPECIAL PRODUCTS AND FACTORIZATION

MODULE - Specil Products nd Fctoriztion 4 SPECIAL PRODUCTS AND FACTORIZATION In n erlier lesson you hve lernt multipliction of lgebric epressions, prticulrly polynomils. In the study of lgebr, we come

Adaptive Control of a Production and Maintenance System with Unknown Deterioration and Obsolescence Rates

Int J of Mthemtic Sciences nd Appictions, Vo, No 3, Septembe Copyight Mind Rede Pubictions wwwjounshubcom Adptive Conto of Poduction nd Mintennce System with Unknown Deteiotion nd Obsoescence Rtes Fwzy

Continuous Compounding and Annualization

Continuous Compounding and Annualization Philip A. Viton Januay 11, 2006 Contents 1 Intoduction 1 2 Continuous Compounding 2 3 Pesent Value with Continuous Compounding 4 4 Annualization 5 5 A Special Poblem

Factoring Polynomials

Fctoring Polynomils Some definitions (not necessrily ll for secondry school mthemtics): A polynomil is the sum of one or more terms, in which ech term consists of product of constnt nd one or more vribles

GFI EventsMnge vs Netikus.net EventSenty GFI Softwe www.gfi.com GFI EventsMnge vs Netikus.net EventSenty GFI EventsMnge EventSenty Who we e Suppot fo MS SQL Seve Suppot fo MSDE / MS SQL Expess Suppot fo

Mathematics. Vectors. hsn.uk.net. Higher. Contents. Vectors 128 HSN23100

hsn.uk.net Higher Mthemtics UNIT 3 OUTCOME 1 Vectors Contents Vectors 18 1 Vectors nd Sclrs 18 Components 18 3 Mgnitude 130 4 Equl Vectors 131 5 Addition nd Subtrction of Vectors 13 6 Multipliction by

Appendix D: Completing the Square and the Quadratic Formula. In Appendix A, two special cases of expanding brackets were considered:

Appendi D: Completing the Squre nd the Qudrtic Formul Fctoring qudrtic epressions such s: + 6 + 8 ws one of the topics introduced in Appendi C. Fctoring qudrtic epressions is useful skill tht cn help you

5.2. LINE INTEGRALS 265. Let us quickly review the kind of integrals we have studied so far before we introduce a new one.

5.2. LINE INTEGRALS 265 5.2 Line Integrls 5.2.1 Introduction Let us quickly review the kind of integrls we hve studied so fr before we introduce new one. 1. Definite integrl. Given continuous rel-vlued

UNIT CIRCLE TRIGONOMETRY

UNIT CIRCLE TRIGONOMETRY The Unit Cicle is the cicle centeed at the oigin with adius unit (hence, the unit cicle. The equation of this cicle is + =. A diagam of the unit cicle is shown below: + = - - -

LINEAR TRANSFORMATIONS AND THEIR REPRESENTING MATRICES

LINEAR TRANSFORMATIONS AND THEIR REPRESENTING MATRICES DAVID WEBB CONTENTS Liner trnsformtions 2 The representing mtrix of liner trnsformtion 3 3 An ppliction: reflections in the plne 6 4 The lgebr of

Integration. 148 Chapter 7 Integration

48 Chpter 7 Integrtion 7 Integrtion t ech, by supposing tht during ech tenth of second the object is going t constnt speed Since the object initilly hs speed, we gin suppose it mintins this speed, but

GFI MilEssentils & GFI MilSecuity vs Symntec Bightmil 6 & Anti Vius GFI Softwe www.gfi.com GFI MilEssentils & GFI MilSecuity vs Symntec Bightmil 6 & Anti Vius GFI MilEssentils & GFI MilSecuity Bightmil

16. Mean Square Estimation

6 Me Sque stmto Gve some fomto tht s elted to uow qutty of teest the poblem s to obt good estmte fo the uow tems of the obseved dt Suppose epeset sequece of dom vbles bout whom oe set of obsevtos e vlble

AREA OF A SURFACE OF REVOLUTION

AREA OF A SURFACE OF REVOLUTION h cut r πr h A surfce of revolution is formed when curve is rotted bout line. Such surfce is the lterl boundr of solid of revolution of the tpe discussed in Sections 7.

LAPLACE S EQUATION IN SPHERICAL COORDINATES. With Applications to Electrodynamics

LALACE S EQUATION IN SHERICAL COORDINATES With Appitions to Eetodynmis We hve seen tht Lpe s eqution is one of the most signifint equtions in physis. It is the soution to pobems in wide viety of fieds

SOEPpapers on Multidisciplinary Panel Data Research

Deutsches Institut fü Witschftsfoschung www.diw.de SOEPppes on Multidiscipliny Pnel Dt Resech 136 Thoms Conelissen John S. Heywood Uwe Jijhn S, Pefomnce Py, Risk Attitudes nd Job Stisfction Belin, Octobe

Chapter 3 Savings, Present Value and Ricardian Equivalence

Chapte 3 Savings, Pesent Value and Ricadian Equivalence Chapte Oveview In the pevious chapte we studied the decision of households to supply hous to the labo maket. This decision was a static decision,

tools for Web data extraction

HTML-we tools fo Web dt extction Thesis pesenttion 1 Student: Xvie Azg Supeviso: Andes Tho Tble of contents Intoduction Dt Extction Pocess Dt Extction Tools Relized tests Futue Wok 2 Intoduction We e going

GFI MilEssentils & GFI MilSecuity vs Bcud Spm Fiewll GFI Softwe www.gfi.com GFIMilEssentils & GFI MilSecuity vs Bcud Spm Fiewll GFI MilEssentils 12 & GFI MilSecuity 10 Bcud Spm Fiewll Who we e Integtes

EQUATIONS OF LINES AND PLANES

EQUATIONS OF LINES AND PLANES MATH 195, SECTION 59 (VIPUL NAIK) Corresponding mteril in the ook: Section 12.5. Wht students should definitely get: Prmetric eqution of line given in point-direction nd twopoint

INITIAL MARGIN CALCULATION ON DERIVATIVE MARKETS OPTION VALUATION FORMULAS

INITIAL MARGIN CALCULATION ON DERIVATIVE MARKETS OPTION VALUATION FORMULAS Vesion:.0 Date: June 0 Disclaime This document is solely intended as infomation fo cleaing membes and othes who ae inteested in

Vectors 2. 1. Recap of vectors

Vectors 2. Recp of vectors Vectors re directed line segments - they cn be represented in component form or by direction nd mgnitude. We cn use trigonometry nd Pythgors theorem to switch between the forms

Section 7-4 Translation of Axes

62 7 ADDITIONAL TOPICS IN ANALYTIC GEOMETRY Section 7-4 Trnsltion of Aes Trnsltion of Aes Stndrd Equtions of Trnslted Conics Grphing Equtions of the Form A 2 C 2 D E F 0 Finding Equtions of Conics In the

GFI MilEssentils & GFI MilSecuity vs Tend Mico ScnMil Suite fo Micosoft Exchnge GFI Softwe www.gfi.com GFI MilEssentils & GFI MilSecuity vs Tend Mico ScnMil Suite fo Micosoft Exchnge Exchnge Seve 2000/2003

Vector Calculus: Are you ready? Vectors in 2D and 3D Space: Review

Vecto Calculus: Ae you eady? Vectos in D and 3D Space: Review Pupose: Make cetain that you can define, and use in context, vecto tems, concepts and fomulas listed below: Section 7.-7. find the vecto defined

Reasoning to Solve Equations and Inequalities

Lesson4 Resoning to Solve Equtions nd Inequlities In erlier work in this unit, you modeled situtions with severl vriles nd equtions. For exmple, suppose you were given usiness plns for concert showing

All pay auctions with certain and uncertain prizes a comment

CENTER FOR RESEARC IN ECONOMICS AND MANAGEMENT CREAM Publiction No. 1-2015 All py uctions with certin nd uncertin prizes comment Christin Riis All py uctions with certin nd uncertin prizes comment Christin

Skills Needed for Success in Calculus 1

Skills Needed fo Success in Calculus Thee is much appehension fom students taking Calculus. It seems that fo man people, "Calculus" is snonmous with "difficult." Howeve, an teache of Calculus will tell

Treatment Spring Late Summer Fall 0.10 5.56 3.85 0.61 6.97 3.01 1.91 3.01 2.13 2.99 5.33 2.50 1.06 3.53 6.10 Mean = 1.33 Mean = 4.88 Mean = 3.

The nlysis of vrince (ANOVA) Although the t-test is one of the most commonly used sttisticl hypothesis tests, it hs limittions. The mjor limittion is tht the t-test cn be used to compre the mens of only

Introduction to Integration Part 2: The Definite Integral

Mthemtics Lerning Centre Introduction to Integrtion Prt : The Definite Integrl Mr Brnes c 999 Universit of Sdne Contents Introduction. Objectives...... Finding Ares 3 Ares Under Curves 4 3. Wht is the

9.3. The Scalar Product. Introduction. Prerequisites. Learning Outcomes

The Sclr Product 9.3 Introduction There re two kinds of multipliction involving vectors. The first is known s the sclr product or dot product. This is so-clled becuse when the sclr product of two vectors

Smll Business Cloud Services Summry. We re thick in the midst of historic se-chnge in computing. Like the emergence of personl computers, grphicl user interfces, nd mobile devices, the cloud is lredy profoundly

PHY 140A: Solid State Physics. Solution to Homework #2

PHY 140A: Solid Stte Physics Solution to Homework # TA: Xun Ji 1 October 14, 006 1 Emil: jixun@physics.ucl.edu Problem #1 Prove tht the reciprocl lttice for the reciprocl lttice is the originl lttice.

4a 4ab b 4 2 4 2 5 5 16 40 25. 5.6 10 6 (count number of places from first non-zero digit to

. Simplify: 0 4 ( 8) 0 64 ( 8) 0 ( 8) = (Ode of opeations fom left to ight: Paenthesis, Exponents, Multiplication, Division, Addition Subtaction). Simplify: (a 4) + (a ) (a+) = a 4 + a 0 a = a 7. Evaluate

Econ 4721 Money and Banking Problem Set 2 Answer Key

Econ 472 Money nd Bnking Problem Set 2 Answer Key Problem (35 points) Consider n overlpping genertions model in which consumers live for two periods. The number of people born in ech genertion grows in

CURVES ANDRÉ NEVES. that is, the curve α has finite length. v = p q p q. a i.e., the curve of smallest length connecting p to q is a straight line.

CURVES ANDRÉ NEVES 1. Problems (1) (Ex 1 of 1.3 of Do Crmo) Show tht the tngent line to the curve α(t) (3t, 3t 2, 2t 3 ) mkes constnt ngle with the line z x, y. (2) (Ex 6 of 1.3 of Do Crmo) Let α(t) (e

Lesson 7 Gauss s Law and Electric Fields

Lesson 7 Gauss s Law and Electic Fields Lawence B. Rees 7. You may make a single copy of this document fo pesonal use without witten pemission. 7. Intoduction While it is impotant to gain a solid conceptual

Pure C4. Revision Notes

Pure C4 Revision Notes Mrch 0 Contents Core 4 Alger Prtil frctions Coordinte Geometry 5 Prmetric equtions 5 Conversion from prmetric to Crtesin form 6 Are under curve given prmetriclly 7 Sequences nd

P.3 Polynomials and Factoring. P.3 an 1. Polynomial STUDY TIP. Example 1 Writing Polynomials in Standard Form. What you should learn

33337_0P03.qp 2/27/06 24 9:3 AM Chpter P Pge 24 Prerequisites P.3 Polynomils nd Fctoring Wht you should lern Polynomils An lgeric epression is collection of vriles nd rel numers. The most common type of

est using the formula I = Prt, where I is the interest earned, P is the principal, r is the interest rate, and t is the time in years.

9.2 Inteest Objectives 1. Undestand the simple inteest fomula. 2. Use the compound inteest fomula to find futue value. 3. Solve the compound inteest fomula fo diffeent unknowns, such as the pesent value,

Things to Remember. r Complete all of the sections on the Retirement Benefit Options form that apply to your request.

Retiement Benefit 1 Things to Remembe Complete all of the sections on the Retiement Benefit fom that apply to you equest. If this is an initial equest, and not a change in a cuent distibution, emembe to

. At first sight a! b seems an unwieldy formula but use of the following mnemonic will possibly help. a 1 a 2 a 3 a 1 a 2

7 CHAPTER THREE. Cross Product Given two vectors = (,, nd = (,, in R, the cross product of nd written! is defined to e: " = (!,!,! Note! clled cross is VECTOR (unlike which is sclr. Exmple (,, " (4,5,6

Warm-up for Differential Calculus

Summer Assignment Wrm-up for Differentil Clculus Who should complete this pcket? Students who hve completed Functions or Honors Functions nd will be tking Differentil Clculus in the fll of 015. Due Dte:

Valuation of Floating Rate Bonds 1

Valuation of Floating Rate onds 1 Joge uz Lopez us 316: Deivative Secuities his note explains how to value plain vanilla floating ate bonds. he pupose of this note is to link the concepts that you leaned

Numerical Methods of Approximating Definite Integrals

6 C H A P T E R Numericl Methods o Approimting Deinite Integrls 6. APPROXIMATING SUMS: L n, R n, T n, AND M n Introduction Not only cn we dierentite ll the bsic unctions we ve encountered, polynomils,

Seshadri constants and surfaces of minimal degree

Seshadi constants and sufaces of minimal degee Wioletta Syzdek and Tomasz Szembeg Septembe 29, 2007 Abstact In [] we showed that if the multiple point Seshadi constants of an ample line bundle on a smooth

Unambiguous Recognizable Two-dimensional Languages

Unmbiguous Recognizble Two-dimensionl Lnguges Mrcell Anselmo, Dor Gimmrresi, Mri Mdoni, Antonio Restivo (Univ. of Slerno, Univ. Rom Tor Vergt, Univ. of Ctni, Univ. of Plermo) W2DL, My 26 REC fmily I REC

ON THE CHINESE CHECKER SPHERE. Mine TURAN, Nihal DONDURMACI ÇİN DAMA KÜRESİ ÜZERİNE

DÜ Fen Bilimlei Enstitüsü Degisi Sı 9 Ağustos 9 On The Chinese Cheke Sphee M. Tun N. Donumı ON THE CHINESE CHECKER SHERE Mine TURAN Nihl DONDURMACI Deptment of Mthemtis Fult of Ats n Sienes Dumlupin Univesit

Applications to Physics and Engineering

Section 7.5 Applictions to Physics nd Engineering Applictions to Physics nd Engineering Work The term work is used in everydy lnguge to men the totl mount of effort required to perform tsk. In physics

Definitions and terminology

I love the Case & Fai textbook but it is out of date with how monetay policy woks today. Please use this handout to supplement the chapte on monetay policy. The textbook assumes that the Fedeal Reseve

883 Brochure A5 GENE ss vernis.indd 1-2

ess x a eu / u e a. p o.eu c e / :/ http EURAXESS Reseaches in Motion is the gateway to attactive eseach caees in Euope and to a pool of wold-class eseach talent. By suppoting the mobility of eseaches,

The Velocity Factor of an Insulated Two-Wire Transmission Line

The Velocity Fctor of n Insulted Two-Wire Trnsmission Line Problem Kirk T. McDonld Joseph Henry Lbortories, Princeton University, Princeton, NJ 08544 Mrch 7, 008 Estimte the velocity fctor F = v/c nd the

The Supply of Loanable Funds: A Comment on the Misconception and Its Implications

JOURNL OF ECONOMICS ND FINNCE EDUCTION Volume 7 Numbe 2 Winte 2008 39 The Supply of Loanable Funds: Comment on the Misconception and Its Implications. Wahhab Khandke and mena Khandke* STRCT Recently Fields-Hat

CHAPTER 5 GRAVITATIONAL FIELD AND POTENTIAL

CHATER 5 GRAVITATIONAL FIELD AND OTENTIAL 5. Intoduction. This chapte deals with the calculation of gavitational fields and potentials in the vicinity of vaious shapes and sizes of massive bodies. The

Marketing Logistics: Opportunities and Limitations

Mketig Logistics: Oppotuities d Limittios Pethip Vdhsidhu 1, Ugul Lpted 2 1 Gdute School, MBA i Itetiol Busiess, The Uivesity of the Thi Chmbe of Commece Vibhvdee-Rgsit Rod, Dideg, Bgkok, 10400, Thild

A r. (Can you see that this just gives the formula we had above?)

24-1 (SJP, Phys 1120) lectic flux, and Gauss' law Finding the lectic field due to a bunch of chages is KY! Once you know, you know the foce on any chage you put down - you can pedict (o contol) motion

GFI MilAchive 6 vs H&S Exchnge@PAM GFI Softwe www.gfi.com GFI MilAchive 6 vs H&S Exchnge@PAM GFI MilAchive 6 H&S Exchnge@PAM Who we e Genel fetues Suppots Micosoft Exchnge 2000, 2003 & 2007 Suppots distibuted

I calculate the unemployment rate as (In Labor Force Employed)/In Labor Force

Introduction to the Prctice of Sttistics Fifth Edition Moore, McCbe Section 4.5 Homework Answers to 98, 99, 100,102, 103,105, 107, 109,110, 111, 112, 113 Working. In the lnguge of government sttistics,

Health insurance exchanges What to expect in 2014

Helth insurnce exchnges Wht to expect in 2014 33096CAEENABC 02/13 The bsics of exchnges As prt of the Affordble Cre Act (ACA or helth cre reform lw), strting in 2014 ALL Americns must hve minimum mount

Module 2. Analysis of Statically Indeterminate Structures by the Matrix Force Method. Version 2 CE IIT, Kharagpur

Module Anlysis of Stticlly Indeterminte Structures by the Mtrix Force Method Version CE IIT, Khrgpur esson 9 The Force Method of Anlysis: Bems (Continued) Version CE IIT, Khrgpur Instructionl Objectives

Spirotechnics! September 7, 2011. Amanda Zeringue, Michael Spannuth and Amanda Zeringue Dierential Geometry Project

Spiotechnics! Septembe 7, 2011 Amanda Zeingue, Michael Spannuth and Amanda Zeingue Dieential Geomety Poject 1 The Beginning The geneal consensus of ou goup began with one thought: Spiogaphs ae awesome.

The Role of Gravity in Orbital Motion

! The Role of Gavity in Obital Motion Pat of: Inquiy Science with Datmouth Developed by: Chistophe Caoll, Depatment of Physics & Astonomy, Datmouth College Adapted fom: How Gavity Affects Obits (Ohio State

Approximation Algorithms for Data Management in Networks

Appoximation Algoithms fo Data Management in Netwoks Chistof Kick Heinz Nixdof Institute and Depatment of Mathematics & Compute Science adebon Univesity Gemany kueke@upb.de Haald Räcke Heinz Nixdof Institute

Implementation and Evaluation of Transparent Fault-Tolerant Web Service with Kernel-Level Support

Poceedings of the IEEE Intentionl Confeence on Compute Communictions nd Netwoks Mimi, Floid, pp. 63-68, Octobe 2002. Implementtion nd Evlution of Tnspent Fult-Tolent Web Sevice with Kenel-Level Suppot

AP STATISTICS SUMMER MATH PACKET

AP STATISTICS SUMMER MATH PACKET This pcket is review of Algebr I, Algebr II, nd bsic probbility/counting. The problems re designed to help you review topics tht re importnt to your success in the clss.

Network Configuration Independence Mechanism

3GPP TSG SA WG3 Security S3#19 S3-010323 3-6 July, 2001 Newbury, UK Source: Title: Document for: AT&T Wireless Network Configurtion Independence Mechnism Approvl 1 Introduction During the lst S3 meeting

Health insurance marketplace What to expect in 2014

Helth insurnce mrketplce Wht to expect in 2014 33096VAEENBVA 06/13 The bsics of the mrketplce As prt of the Affordble Cre Act (ACA or helth cre reform lw), strting in 2014 ALL Americns must hve minimum

Concept and Experiences on using a Wiki-based System for Software-related Seminar Papers

Concept and Expeiences on using a Wiki-based System fo Softwae-elated Semina Papes Dominik Fanke and Stefan Kowalewski RWTH Aachen Univesity, 52074 Aachen, Gemany, {fanke, kowalewski}@embedded.wth-aachen.de,

Derivatives and Rates of Change

Section 2.1 Derivtives nd Rtes of Cnge 2010 Kiryl Tsiscnk Derivtives nd Rtes of Cnge Te Tngent Problem EXAMPLE: Grp te prbol y = x 2 nd te tngent line t te point P(1,1). Solution: We ve: DEFINITION: Te

2 DIODE CLIPPING and CLAMPING CIRCUITS

2 DIODE CLIPPING nd CLAMPING CIRCUITS 2.1 Ojectives Understnding the operting principle of diode clipping circuit Understnding the operting principle of clmping circuit Understnding the wveform chnge of

Economics Letters 65 (1999) 9 15. macroeconomists. a b, Ruth A. Judson, Ann L. Owen. Received 11 December 1998; accepted 12 May 1999

Economics Letters 65 (1999) 9 15 Estimting dynmic pnel dt models: guide for q mcroeconomists b, * Ruth A. Judson, Ann L. Owen Federl Reserve Bord of Governors, 0th & C Sts., N.W. Wshington, D.C. 0551,

Space Vector Pulse Width Modulation Based Induction Motor with V/F Control

Interntionl Journl of Science nd Reserch (IJSR) Spce Vector Pulse Width Modultion Bsed Induction Motor with V/F Control Vikrmrjn Jmbulingm Electricl nd Electronics Engineering, VIT University, Indi Abstrct:

Risk Sensitive Portfolio Management With Cox-Ingersoll-Ross Interest Rates: the HJB Equation

Risk Sensitive Potfolio Management With Cox-Ingesoll-Ross Inteest Rates: the HJB Equation Tomasz R. Bielecki Depatment of Mathematics, The Notheasten Illinois Univesity 55 Noth St. Louis Avenue, Chicago,

c. Values in statements are broken down by fiscal years; many projects are

Lecture 18: Finncil Mngement (Continued)/Csh Flow CEE 498 Construction Project Mngement L Schedules A. Schedule.of Contrcts Completed See Attchment # 1 ll. 1. Revenues Erned 2. Cost of Revenues 3. Gross

Solving BAMO Problems

Solving BAMO Problems Tom Dvis tomrdvis@erthlink.net http://www.geometer.org/mthcircles Februry 20, 2000 Abstrct Strtegies for solving problems in the BAMO contest (the By Are Mthemticl Olympid). Only

Channel selection in e-commerce age: A strategic analysis of co-op advertising models

Jounal of Industial Engineeing and Management JIEM, 013 6(1):89-103 Online ISSN: 013-0953 Pint ISSN: 013-843 http://dx.doi.og/10.396/jiem.664 Channel selection in e-commece age: A stategic analysis of

STATUS OF LAND-BASED WIND ENERGY DEVELOPMENT IN GERMANY

Yer STATUS OF LAND-BASED WIND ENERGY Deutsche WindGurd GmbH - Oldenburger Strße 65-26316 Vrel - Germny +49 (4451)/9515 - info@windgurd.de - www.windgurd.com Annul Added Cpcity [MW] Cumultive Cpcity [MW]

Unit 29: Inference for Two-Way Tables

Unit 29: Inference for Two-Wy Tbles Prerequisites Unit 13, Two-Wy Tbles is prerequisite for this unit. In ddition, students need some bckground in significnce tests, which ws introduced in Unit 25. Additionl

AN IMPLEMENTATION OF BINARY AND FLOATING POINT CHROMOSOME REPRESENTATION IN GENETIC ALGORITHM

AN IMPLEMENTATION OF BINARY AND FLOATING POINT CHROMOSOME REPRESENTATION IN GENETIC ALGORITHM Main Golub Faculty of Electical Engineeing and Computing, Univesity of Zageb Depatment of Electonics, Micoelectonics,

AntiSpyware Enterprise Module 8.5

AntiSpywre Enterprise Module 8.5 Product Guide Aout the AntiSpywre Enterprise Module The McAfee AntiSpywre Enterprise Module 8.5 is n dd-on to the VirusScn Enterprise 8.5i product tht extends its ility

STUDENT RESPONSE TO ANNUITY FORMULA DERIVATION

Page 1 STUDENT RESPONSE TO ANNUITY FORMULA DERIVATION C. Alan Blaylock, Hendeson State Univesity ABSTRACT This pape pesents an intuitive appoach to deiving annuity fomulas fo classoom use and attempts

Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd processes. Introducing technology

GFI MilAchive 6 vs EMC EmilXtende Achive Edition GFI Softwe www.gfi.com GFI MilAchive 6 vs EMC EmilXtende Achive Edition GFI MilAchive 6 EMC EmilXtende Achive Edition Who we e Genel fetues Suppots Micosoft

Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd business. Introducing technology

INTERCHANGING TWO LIMITS. Zoran Kadelburg and Milosav M. Marjanović

THE TEACHING OF MATHEMATICS 2005, Vol. VIII, 1, pp. 15 29 INTERCHANGING TWO LIMITS Zorn Kdelburg nd Milosv M. Mrjnović This pper is dedicted to the memory of our illustrious professor of nlysis Slobodn

g(y(a), y(b)) = o, B a y(a)+b b y(b)=c, Boundary Value Problems Lecture Notes to Accompany

Lecture Notes to Accompny Scientific Computing An Introductory Survey Second Edition by Michel T Heth Boundry Vlue Problems Side conditions prescribing solution or derivtive vlues t specified points required

Decision Rule Extraction from Trained Neural Networks Using Rough Sets

Decision Rule Extrction from Trined Neurl Networks Using Rough Sets Alin Lzr nd Ishwr K. Sethi Vision nd Neurl Networks Lbortory Deprtment of Computer Science Wyne Stte University Detroit, MI 48 ABSTRACT

Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd business. Introducing technology

An Efficient Group Key Agreement Protocol for Ad hoc Networks

An Efficient Goup Key Ageement Potocol fo Ad hoc Netwoks Daniel Augot, Raghav haska, Valéie Issany and Daniele Sacchetti INRIA Rocquencout 78153 Le Chesnay Fance {Daniel.Augot, Raghav.haska, Valéie.Issany,

ON THE (Q, R) POLICY IN PRODUCTION-INVENTORY SYSTEMS

ON THE R POLICY IN PRODUCTION-INVENTORY SYSTEMS Saifallah Benjaafa and Joon-Seok Kim Depatment of Mechanical Engineeing Univesity of Minnesota Minneapolis MN 55455 Abstact We conside a poduction-inventoy