Availability Analysis of Repairable Computer Systems and Stationarity Detection
|
|
- Rodger Fisher
- 5 years ago
- Views:
Transcription
1 1166 IEEE TRANSACTIONS ON COMPUTERS, VOL. 48, NO. 11, NOVEMBER 1999 Availabiliy Analysis of Rpairabl Compur Sysms and Saionariy Dcion Bruno Sricola AbsracÐPoin availabiliy and xpcd inrval availabiliy ar dpndabiliy masurs rspcivly dfind by h probabiliy ha a sysm is in opraion a a givn insan and by h man prcnag of im during which a sysm is in opraion ovr a fini obsrvaion priod. W considr a rpairabl compur sysm and w assum, as usual, ha h sysm is modld by a fini Markov procss. W propos in his papr a nw algorihm o compu hs wo availabiliy masurs. This algorihm is basd on h classical uniformizaion chniqu in which a s o dc h saionary bhavior of h sysm is usd o sop h compuaion if h saionariy is rachd. In ha cas, h algorihm givs no only h ransin availabiliy masurs, bu also h sady sa availabiliy, wih significan compuaional savings, spcially whn h im a which masurs ar ndd is larg. In h cas whr h saionariy is no rachd, h algorihm provids h ransin availabiliy masurs and bounds for h sady sa availabiliy. I is also shown how h nw algorihm can b xndd o h compuaion of prformabiliy masurs. Indx TrmsÐRpairabl compur sysms, dpndabiliy, availabiliy, prformabiliy, Markov procsss, saionariy dcion. æ 1 INTRODUCTION IN h dpndabiliy analysis of rpairabl compuing sysms, hr is an incrasing inrs in valuaing ransin masurs, in paricular, h poin availabiliy and h availabiliy ovr a givn priod. This papr dals wih h compuaion of h poin availabiliy and of h xpcd inrval availabiliy rspcivly dfind by h probabiliy ha h sysm is in opraion a a givn insan and by h man prcnag of im during which h sysm is in opraion ovr a fini obsrvaion priod. Formally, h sysm is modld by a Markov procss. Is sa spac is dividd ino wo disjoin ss which rprsn h up sas in which h sysm dlivrs h spcifid srvic and h down sas in which hr is no mor srvic dlivrd. Transiions from h up (rsp. down) sas o h down(rsp. up) sas ar calld failurs (rsp. rpairs). Th inrval availabiliy ovr ; is hn h fracion of h inrval ; during which h procss is in h up sas. This random variabl has bn sudid in prvious paprs as, for insanc, in [1], [], and [3], whr is disribuion is valuad using h uniformizaion chniqu. This approach is inrsing bcaus i has good numrical propris and i allows h usr o prform h compuaion wih an rror as small as dsird. An approach o dc h saionariy of Markov procsss has bn proposd in [4], [5]. This approach is basd on h uniformizaion mhod. Th sa probabiliy vcors of h uniformizd Markov chain ar succssivly compud and h iras ha ar spacd m iraions apar ar compard. Whn h diffrnc bwn wo such iras is small nough, h compuaion is soppd. Th main problm wih his mhod is ha, unlik h sandard uniformizaion, hr is no abiliy o spcify rror bounds asily compuabl. In his papr, w dvlop a nw mhod o compu h poin availabiliy and h xpcd inrval availabiliy which is also basd on h uniformizaion chniqu and on h saionary rgim dcion. In pracic, on usually dos no know whhr h im horizon h/sh is considring is larg nough for a sady sa analysis. Th main advanag of our algorihm is ha h compuaion is soppd whn h sady sa availabiliy of h sysm is rachd, giving boh ransin and sady sa masurs wih an rror olranc spcifid in advanc. Whn h saionariy is no rachd, h algorihm givs h ransin masurs and bounds for h sady sa availabiliy. Th rmaindr of h papr is organizd as follows In h following scion, w rcall h classical way o compu h poin availabiliy and w driv nw rsuls o sop h compuaion whn h saionary rgim is rachd. W also giv in his scion h psudocod of boh algorihms. In Scion 3, w considr h xpcd inrval availabiliy and w show how i can b compud using h saionariy dcion. In Scion 4, w show, by mans of a numrical xampl, ha our nw algorihm can considrably rduc h compuaion im of h availabiliy masurs considrd hr whn h im a which masurs ar ndd is sufficinly larg. I is also shown ha compuaional savings can b obaind vn whn h im horizon is small. In Scion 5, w show how h rsuls obaind for h availabiliy masurs can b asily xndd o h corrsponding prformabiliy masurs. Th las scion is dvod o som conclusions.. Th auhor is wih IRISA-INRIA, Campus d Bauliu, 354 Rnns CÂdx, Franc. sricola@irisa.fr. For informaion on obaining rprins of his aricl, plas snd -mail o c@compur.org, and rfrnc IEEECS Log Numbr POINT AVAILABILITY ANALYSIS Considr an irrducibl coninuous-im homognous Markov procss X ˆfX ; g, ovr a fini sa spac /99/$1. ß 1999 IEEE
2 SERICOLA AVAILABILITY ANALYSIS OF REPAIRABLE COMPUTER SYSTEMS AND STATIONARITY DETECTION 1167 dnod by S. Th sas of S ar dividd ino wo disjoin subss U, h s of h opraional sas (or h up sas), and D, h s of h unopraional sas (or h down sas). For a sysm modld by such a procss, h poin availabiliy a im is dnod by PAV and dfind by TABLE 1 Classical Algorihm for h Compuaion of PAV PAV ˆPrfX Ug Th procss X is, as usual, givn by is infinisimal gnraor, dnod by A, in which h ih diagonal nry A i; i vrifis A i; i ˆ P j6ˆi A i; j. Is iniial probabiliy disribuion is dnod by h row vcor. Th uniformizd Markov chain associad o h procss X is characrizd by is uniformizaion ra and by is ransiion probabiliy marix P [6]. Th uniformizaion ra vrifis max A i; i ; i S and P is rlad o A by P ˆ I A=, whr I dnos h idniy marix. Using his noaion, w g PAV ˆ A 1 U ˆ X 1 P n 1 U ; whr 1 U is a column vcor whos ih nry is 1 if i U and if i D. W dno by V n h column vcor dfind by V n ˆ P n 1 U. I follows ha, for vry n, w hav V n ˆ PV n 1 and V ˆ 1 U. In h following, w dfin for vry n, v n ˆ P n 1 U ˆ V n..1 Th Classical Uniformizaion Mhod Th classical way o compu h poin availabiliy a im is basd on (1). L " b a givn spcifid rror olranc and N b dfind as ( ) N ˆ min n IN Xn j 1 " j! Thn, w obain PAV ˆXN jˆ v n N ; whr h rs of h sris N vrifis N ˆ ˆ 1 XN v n " Th compuaion of ingr N can b mad wihou any numrical problms, vn for larg valus of, by using h mhod dscribd in [7]. Th runcaion lvl N is, in fac, a funcion of, say N. For a fixd valu of ", N is an incrasing funcion of. I follows ha if w wan o compu PAV for J disinc valus of, dnod by 1 < < J, w only nd o compu v n for n ˆ 1;...;N J sinc h valus of v n ar indpndn of h paramr. Th psudocod of h classical uniformizaion mhod can hn b wrin as shown in Tabl Saionariy Dcion Th saionariy dcion ha w considr is basd on h conrol of h squnc of vcors V n ˆ P n 1 U. L h row vcor dno h saionary probabiliy disribuion of h Markov procss X. This vcor vrifis A ˆ and P ˆ. Th sady sa availabiliy is givn by PAV 1 ˆ 1 U.To nsur h convrgnc of h squnc of vcors V n,w rquir ha h uniformizaion ra vrifis > max A i; i ; i S sinc his guarans ha h ransiion probabiliy marix P is apriodic. W hn hav, for vry i S, lim V n i ˆ1 U 1 W dscrib now h s usd o dc ha, for a givn valu of n, h nris of vcor V n ar clos o 1 U. For vry n, w dfin m n ˆ min V n i and M n ˆ max V n i is is No ha, sinc V ˆ 1 U, w hav M ˆ 1 and m ˆ. Th following rsul givs bounds of h sady sa availabiliy PAV 1 ˆ 1 U. Lmma.1. Th squncs m n and M n ar, rspcivly, nondcrasing and nonincrasing and, for vry n, w hav v n M n m n M n m n and 1 U M n m n M n m n Morovr, boh squncs m n and M n convrg o 1 U. Proof. For vry i S, w hav V n 1 i ˆPjS P i; j V n j. I follows ha m n V n 1 i M n and, so, w g m n m n 1 and M n 1 M n, which shows ha h squncs m n and M n ar, rspcivly, nondcrasing and nonincrasing. Sinc v n ˆ PjS j V n j, w g m n v n M n, which is quivaln o
3 1168 IEEE TRANSACTIONS ON COMPUTERS, VOL. 48, NO. 11, NOVEMBER 1999 v n M n m n M n m n Wriing now 1 U ˆ P n 1 U ˆ V n ˆ PjS j V n j, w g, in h sam way, m n 1 U M n, which is quivaln o 1 U M n m n M n m n Th sa spac S bing fini and h fac ha, for vry i S, V n i convrgs o 1 U show ha boh squncs m n and M n convrg o 1 U. u Rmark. W hav assumd ha h Markov procss X is irrducibl. If h Markov procss X is no irrducibl, bu conains an absorbing sa dnod by a wih a D, hn w hav 1 U ˆ and, for vry i S, w asily g V n i! whn n!1. Now, sinc a D, w hav V n a ˆ for vry n and so w also hav m n ˆ for vry n. Thus, in his cas, i sufficis o considr h squnc M n which is nonincrasing and convrgs o. This lmma shows ha h diffrnc M n m n convrgs o, ha is, for a fixd rror olranc ">, hr xiss an ingr k such ha, for n k, w hav M n m n ". Sinc m n M n, w hav m n m n 1 M n 1 M n and, so, h squnc M n m n is nonincrasing. W can hn dfin h following ingr K ˆ inffn jm n m n "=g Using h ingr K, (1) can b wrin as PAV ˆ XK whr 1 K ˆ M K m K v n 1 XK v n M K m K! 1 K ; X 1 Using Lmma.1, h rs 1 K vrifis j 1 K j v n M K m K "=4 This las inqualiy follows from h fac ha, for n K, w hav, from Lmma.1, m K m n v n M n M K and, so, v n M K m K M K m K "=4. Th im K can b inrprd as h discr im o saionariy wih rspc o h subs U. For vry and for vry ingr l, w dno by F l h funcion dfind by F l ˆXl M n m n I is asy o chck ha, for a fixd valu of l, h funcion F l dcrass from 1 o ovr h inrval ; 1. W can 3 4 hn dfin for vry ingr l and for vry ">, h im T l as T l ˆ inff ; F l "=4g W hn hav h following horm Thorm.. For vry ">, for vry T K w hav jpav 1 U j3"=4 1 U M K m K "=4 PAV M K m K " Proof. Firs no ha, from Lmma.1, w hav m n v n M n and m n 1 U M n, for vry n. I follows ha jv n 1 U jm n m n for vry n. W hn hav jpav 1 U jˆ v n 1 U jv n 1 U j M n m n ˆ F K M n m n Sinc T K, w hav F K "=4. In h scond rm, sinc n K, w hav M n m n M K m K "= and, so, w g (5). Rlaion (6) is immdia from Lmma.1. Finally, combining (5) and (6), w g (7). u Th im T K can b inrprd as h coninuous im o saionariy wih rspc o h subs U..3 Th Nw Algorihm Using hs rsuls, w obain h following nw algorihm (shown in Tabl ). To simplify h wriing of his algorihm, w dfin G l ˆXl H l ˆ1 Xl v n ; S l ˆ Ml m l ; No ha i is no ncssary o compu h coninuous im o saionariy T K wih a high prcision. I is sufficin o obain an uppr bound of T K such as, for insanc, dt K, which is h smalls ingr grar or qual o T K. I mus b also nod ha, in his algorihm, h runcaion sp N is a funcion of h im J as in h classical unformizaion algorihm, bu h ims o 5 6 7
4 SERICOLA AVAILABILITY ANALYSIS OF REPAIRABLE COMPUTER SYSTEMS AND STATIONARITY DETECTION 1169 TABLE Algorihm for h Compuaion of PAV Using Saionariy Dcion Z EIAV ˆ1 PAV s ds Using (1) and by ingraion ovr ;, w obain EIAV ˆX 1 1 P k 1 U W dno by Vn h column vcor dfind by Vn ˆ 1 P k 1 U ; and w dfin v n ˆ V n. By dfiniion of V n and v n in h prvious scion, w g, for vry n, Vn ˆ 1 V k and v n ˆ 1 I follows ha Vn and v n ar rcursivly givn, for n 1, by Vn ˆ n V n 1 1 V n; and v n ˆ n v n 1 1 v n; 8 wih V ˆ V ˆ 1 U and, hus, v ˆ v. For vry n, w hav v n 1. I follows ha, using h runcaion sp N dfind in (), w g h classical algorihm o compu h xpcd inrval availabiliy by wriing v k whr EIAV ˆXN v n N ; saionariy K and T K ar indpndn of h im paramr, whn h discr im K is rachd. Th compuaional im complxiy of boh algorihms is ssnially du o h compuaion of h vcors V n.to compu hs vcors, h classical algorihm rquirs N marix-vcor producs and our nw algorihm rquirs only min K;N marix-vcor producs. 3 EXPECTED INTERVAL AVAILABILITY ANALYSIS W show in his scion how h nw algorihm proposd abov for h poin availabiliy compuaion can b adapd o compu h xpcd inrval availabiliy aking accoun of h saionariy dcion. Th xpcd inrval availabiliy rprsns h man prcnag of im during which h sysm is in opraion ovr a fini obsrvaion priod ;. Th inrval availabiliy ovr ; is dnod by IAV and is xpcaion is givn by N ˆ v n ˆ 1 XN " This algorihm is basically as h on dpicd in Tabl 1. Mor prcisly h compuaion of v n in Tabl 1 mus b followd by h h rcursion (8), wih v ˆ v, and, in h las loop ovr j, v n mus b rplacd by v n in ordr o g EIAV j insad of PAV j. 3.1 Saionariy Dcion for h Expcd Inrval Availabiliy Using h rsuls obaind for h poin availabiliy, w can driv a nw mhod o obain h xpcd inrval availabiliy using h saionariy dcion. This mhod is basd on h wo following horms. Boh horms will b usd in h cas whr h discr im o saionariy K is such ha K N. Th firs horm sas ha, in ordr o compu h xpcd inrval availabiliy, EIAV, w only nd h valus of v n for n K. Th scond horm sas ha, in ordr o compu h xpcd inrval availabiliy, EIAV, for T K, w only nd h valu EIAV a a im such ha T K. W dno by G K h funcion
5 117 IEEE TRANSACTIONS ON COMPUTERS, VOL. 48, NO. 11, NOVEMBER 1999 and rcall ha H K ˆ1 XK G K ˆXK v n ; and ˆ MK m K Thorm 3.1. For vry, w hav EIAV G K K 1 v K S K H K 1 H K "=4 9 Proof. For vry, w hav whr EIAV ˆG K ; ˆ For n K 1, w hav v n ˆ 1 v k " # ˆ 1 X K v k Xn v k ˆ K 1 v K 1 ˆ K 1 v K 1 v k v n v k ˆ K 1 n K v K x n ; whr jx n jˆ 1 v k 1 jv k j n K n K " 4 "=4 Th inqualiy jv k j"=4, for k K, follows from Lmma.1; i has alrady bn usd o bound h rror 1 K in (4). If is h funcion dfind by ˆ x n ; w obain j j "=4. W hn hav ˆ K 1 v K n K By wriing n K ˆ K 1 in his las xprssion, w g ˆK 1 v K H K 1 H K W hn obain EIAV G K K 1 v K S K H K 1 H K ˆ ; which compls h proof sinc j j "=4. Thorm 3.. For vry ">, for vry and such ha T K w hav EIAV EIAV 1 " 1 Proof. For vry and such ha T K, w hav Z EIAV ˆ1 PAV s ds " ˆ 1 Z Z # PAV s ds PAV s ds " ˆ 1 Z PAV s ds Z PAV s Šds ˆ EIAV 1 1 Z PAV s Šds Using (7), w hav, sinc T K Z 1 PAV s Šds 1 Z jpav s jds 1 " "; which compls h proof. u No ha Thorm 3. is sill valid if w rplac T K by dt K. So, as for h poin availabiliy, w can us dt K insad of T K o mak asir h compuaion of h xpcd inrval availabiliy. Using hs wo horms, w obain a nw algorihm o compu h xpcd inrval availabiliy which is similar o h on dscribd in Tabl for h poin availabiliy. I suffics o prform h following changs in h algorihm givn in Tabl Th compuaion of v n givn by (8) mus b addd jus afr h compuaion of v n, wih v ˆ v. Th rlaion PAV j ˆG K j mus b rplacd by EIAV j ˆ G K j and h compuaions of PAV j in h cas whr K N mus b rplacd by hos of EIAV j givn in (9) for j T K and in (1) for j >T K. To us (1), w nd EIAV for on valu of such ha T K. Such a valu can b obaind by using (9) on mor im for h smalls valu of j such ha j T K. No ha w hav h wllknown saionary rlaion PAV 1 ˆ EIAV 1. u
6 SERICOLA AVAILABILITY ANALYSIS OF REPAIRABLE COMPUTER SYSTEMS AND STATIONARITY DETECTION 1171 Fig. 1. Sa-ransiion diagram for an n-procssor sysm. 4 NUMERICAL EXAMPLE W considr a faul-olran muliprocssor sysm wih fini buffr sags. This sysm was firs considrd in [8] for wo procssors wihou rpair and has bn xndd in [9] o includ rpair for h compuaion of h momns of prformabiliy. Is has bn also usd in [1] o obain h disribuion of prformabiliy. W us h sam modl hr for h compuaion of h poin availabiliy wih our nw mhod. I consiss of n idnical procssors and b buffr sags. Procssors fail indpndnly a ra and ar rpaird singly wih ra. Buffrs sags fail indpndnly a ra and ar rpaird wih ra. Procssor failurs caus a gracful dgradaion of h sysm and h numbr of opraional procssors is dcrasd by on. Th sysm is in a faild sa whn all h procssors hav faild or any of h buffr sags has faild. No addiional procssor failurs ar assumd o occur whn h sysm is in a faild sa. Th modl is rprsnd by a Markov procss wih sa ransiion diagram shown in Fig. 1. Th sa spac of h sysm is S ˆf i; j ; i n; j ˆ ; 1g. Th componn i of a sa i; j mans ha hr ar i opraional procssors and h componn j is zro if any of h buffr sags fails; ohrwis, i is on. I follows ha h s U of opraional sas is U ˆf i; 1 ;1 i ng. W valua h poin availabiliy givn ha h sysm sard in sa n; 1. Th numbr of procssors is fixd o 16, ach wih a failur ra ˆ 1 pr wk and a rpair ra ˆ 1666 pr hour. Th individual buffr sag failur ra is ˆ pr wk and is rpair ra is ˆ 1666 pr hour. Th rror olranc is " ˆ 1. In Fig., w plo h poin availabiliy, PAV, asa funcion of for diffrn valus of h numbr of buffr sags b. Th largs valu of, ha is, h valu of J in h algorihm, has bn chosn qual o 1; hours. For h largs valu of, w show, in Fig. 3, h runcaion sp N ˆ N 1, h discr im o saionariy K, and h coninuous im o saionariy T K (in fac, w Fig.. From op o h boom PAV for b ˆ ; 4; 8; 16; 3. giv dt K ) for diffrn valus of h numbr of buffr sags b. This figur shows, for xampl, ha whn b ˆ 16 h classical algorihm nds 3; 581 marix-vcor producs and our nw algorihm nds only 18 marix-vcor producs, h coninuous im o saionariy bing qual o 77. Whn b ˆ 1; 4 h classical algorihm nds 15; 616 marix-vcor producs and our nw algorihm nds only 86 marix-vcor producs, h coninuous im o saionariy bing qual o 6. Morovr, our algorihm also compus h sady sa poin availabiliy wih a prcision qual o "=4. Fig. 3 also shows ha boh siuaions, K<T K and K>T K, ar possibl. W considr in Fig. 4 smallr valus of J. Th numbr of buffr sags is fixd o b ˆ 8. For J 1, w g N 1 14 and h discr im o saionariy K is no rachd. This mans ha K>14. For J w g N J and h discr im o saionariy is rachd. Is valu is K ˆ 18 and h coninuous im o saionariy is dt K ˆ8. Fig. 4 shows ha, vn for small valus of J ( J <T K ), our algorihm can rduc h compuaion im wih rspc o h classical algorihm. For insanc, whn J ˆ 6, h classical algorihm nds 4 marix-vcor producs and our nw algorihm nds only 18 marix-vcor producs. 5 EXTENSION TO THE PERFORMABILITY ANALYSIS Th mhod proposd for h compuaion of h poin availabiliy and h xpcd inrval availabiliy using h sady sa availabiliy dcion can b xndd o mor gnral masurs such as h poin prformabiliy and h xpcd inrval prformabiliy. Fig. 3. Saionariy dcion for diffrn numbrs of buffr sags.
7 117 IEEE TRANSACTIONS ON COMPUTERS, VOL. 48, NO. 11, NOVEMBER 1999 Fig. 4. Saionariy dcion for small valus of h im. In prformabiliy modling (s, for insanc, [8], [9], [1], [11], [1], [13], [14], [15] and h rfrncs hrin), rward ras ar associad wih sas of h modl o quanify h abiliy of h sysm o prform in h corrsponding sas. W dno by i h rward ra associad o h sa i S. Th rward ras i ar assumd o b nonngaiv ral numbrs. Th poin prformabiliy a im, dnod by PP, and h xpcd inrval prformabiliy, dnod by EIP, ar dfind by PP ˆX is i PrfX ˆ ig and EIP ˆ1 Z PP s ds W dfin ˆ max is i and r i ˆ i = and w dno by r h column vcor whos ih nry is qual o r i. W hn hav PP ˆf and EIP ˆg, whr f ˆ A r and g ˆ1 f s ds Sinc, for vry i S, w hav r i 1, all h rsuls and algorihms obaind for h compuaion of h availabiliy masurs can b asily xndd o h compuaion of f and g. To do ha, i suffics o rplac h column vcor 1 U by h column vcor r. Th valus M and m bcom M ˆ max is r i and m ˆ min is r i. Morovr, w hav f 1 ˆ g 1 ˆ r. Z [3] G. Rubino and B. Sricola, ªInrval Availabiliy Analysis Using Dnumrabl Markov Procsss Applicaion o Muliprocssor Subjc o Brakdowns and Rpair,º IEEE Trans. Compurs, vol. 44, no., pp , Fb [4] G. Ciardo, A. Blakmor, P.F. Chimno, J. K. Muppala, and K.S. Trivdi, ªAuomad Gnraion and Analysis of Markov Rward Modl Using Sochasic Rward Ns,º Linar Algbra, Markov Chains, and Quuing Modls, C.D. Myr and E.R.J. Plmmons, ds., pp , Springr-Vrlag, [5] M. Malhora, J.K. Muppala, and K.S. Trivdi, ªSiffnss-Tolran Mhods for Transin Analysis of Siff Markov Chains,º Microlcronics and Rliabiliy, vol. 34, no. 11, pp. 1,85-1,841, [6] S.M. Ross, Sochasic Procsss. John Wily & Sons, [7] P.N. Bowrman, R.G. Noly, and E.M. Schur, ªCalculaion of h Poisson Cumulaiv Disribuion Funcion,º IEEE Trans. Rliabiliy, vol. 39, pp , 199. [8] J.F. Myr, ªClosd-Form Soluions for Prformabiliy,º IEEE Trans. Compurs, vol. 31, no. 7, pp , July 198. [9] B.R. Iyr, L. Donaillo, and P. Hidlbrgr, ªAnalysis of Prformabiliy for Sochasic Modls of Faul-Tolran Sysms,º IEEE Trans. Compurs, vol. 35, no. 1, pp. 9-97, Oc [1] V.G. Kulkarni, V.F. Nicola, R.M. Smih, and K.S. Trivdi, ªNumrical Evaluaion of Prformabiliy and Job Complion Tim in Rpairabl Faul-Tolran Sysms,º Proc. IEEE 16h Faul- Tolran Compuing Symp., pp. 5-57, Vinna, Ausria, July [11] G. Ciardo, R. Mari, B. Sricola, and K.S. Trivdi, ªPrformabiliy Analysis Using Smi-Markov Rward Procsss,º IEEE Trans. Compurs, vol. 39, no. 1, pp. 1,51-1,64, Oc [1] R.M. Smih, K.S. Trivdi, and A.V. Ramsh, ªPrformabiliy Analysis Masurs, an Algorihm, and a Cas Sudy,º IEEE Trans. Compurs, vol. 37, no. 4, pp , Apr [13] H. Nabli and B. Sricola, ªPrformabiliy Analysis A Nw Algorihm,º IEEE Trans. Compurs, vol. 45, no. 4, pp , Apr [14] E. d Souza Silva and H.R. Gail, ªCalculaing Availabiliy and Prformabiliy Masurs of Rpairabl Compur Sysms Using Randomizaion,º J. ACM, vol. 36, pp , Jan [15] J.F. Myr, ªOn Evaluaing h Prformabiliy of Dgradabl Compuing Sysms,º IEEE Trans. Compurs, vol. 9, no. 8, pp , Aug CONCLUSIONS A nw algorihm has bn dvlopd o compu h poin availabiliy and h xpcd inrval availabiliy of rpairabl compur sysms modld by Markov procsss. This nw algorihm is basd on h uniformizaion chniqu and on h dcion of h sady sa availabiliy. I compars favorably wih h classical uniformizaion algorihm whn h im horizon is larg and i is shown hrough a numrical xampl ha compuaional savings can b obaind vn whn h im horizon is small. Morovr, our algorihm givs h sady sa availabiliy if h saionariy is rachd and bounds of h sady sa availabiliy ohrwis. Finally, his mhod can b asily xndd o h compuaion of mor gnral masurs such as h poin prformabiliy and h xpcd inrval prformabiliy. Bruno Sricola rcivd h PhD dgr in compur scinc from h Univrsiy of Rnns I in H has bn wih INRIA (Insiu Naional d Rchrch n Informaiqu n Auomaiqu, (a public Frnch laboraory) sinc His main rsarch aciviy is in compur and communicaion sysms prformanc valuaion, dpndabiliy and prformabiliy of faulolran archicurs, and applid sochasic procsss. REFERENCES [1] E. d Souza Silva and H.R. Gail, ªCalculaing Cumulaiv Opraional Tim Disribuions of Rpairabl Compur Sysms,º IEEE Trans. Compurs, vol. 35, no. 4, pp. 3-33, Apr [] G. Rubino and B. Sricola, ªInrval Availabiliy Disribuion Compuaion,º Proc. IEEE 3rd Faul-Tolran Compuing Symp., pp , Toulous, Franc, Jun 1993.
On the Derivatives of Bessel and Modified Bessel Functions with Respect to the Order and the Argument
Inrnaional Rsarch Journal of Applid Basic Scincs 03 Aailabl onlin a wwwirjabscom ISSN 5-838X / Vol 4 (): 47-433 Scinc Eplorr Publicaions On h Driais of Bssl Modifid Bssl Funcions wih Rspc o h Ordr h Argumn
More informationLecture 1: Numerical Integration The Trapezoidal and Simpson s Rule
Lcur : Numrical ngraion Th Trapzoidal and Simpson s Rul A problm Th probabiliy of a normally disribud (man µ and sandard dviaion σ ) vn occurring bwn h valus a and b is B A P( a x b) d () π whr a µ b -
More informationCPSC 211 Data Structures & Implementations (c) Texas A&M University [ 259] B-Trees
CPSC 211 Daa Srucurs & Implmnaions (c) Txas A&M Univrsiy [ 259] B-Trs Th AVL r and rd-black r allowd som variaion in h lnghs of h diffrn roo-o-laf pahs. An alrnaiv ida is o mak sur ha all roo-o-laf pahs
More informationChapter 3: Fourier Representation of Signals and LTI Systems. Chih-Wei Liu
Chapr 3: Fourir Rprsnaion of Signals and LTI Sysms Chih-Wi Liu Oulin Inroducion Complx Sinusoids and Frquncy Rspons Fourir Rprsnaions for Four Classs of Signals Discr-im Priodic Signals Fourir Sris Coninuous-im
More informationPoisson process Markov process
E2200 Quuing hory and lraffic 2nd lcur oion proc Markov proc Vikoria Fodor KTH Laboraory for Communicaion nwork, School of Elcrical Enginring 1 Cour oulin Sochaic proc bhind quuing hory L2-L3 oion proc
More informationUNIT #5 EXPONENTIAL AND LOGARITHMIC FUNCTIONS
Answr Ky Nam: Da: UNIT # EXPONENTIAL AND LOGARITHMIC FUNCTIONS Par I Qusions. Th prssion is quivaln o () () 6 6 6. Th ponnial funcion y 6 could rwrin as y () y y 6 () y y (). Th prssion a is quivaln o
More informationCSE 245: Computer Aided Circuit Simulation and Verification
CSE 45: Compur Aidd Circui Simulaion and Vrificaion Fall 4, Sp 8 Lcur : Dynamic Linar Sysm Oulin Tim Domain Analysis Sa Equaions RLC Nwork Analysis by Taylor Expansion Impuls Rspons in im domain Frquncy
More informationDEPARTMENT OF ELECTRICAL &ELECTRONICS ENGINEERING SIGNALS AND SYSTEMS. Assoc. Prof. Dr. Burak Kelleci. Spring 2018
DEPARTMENT OF ELECTRICAL &ELECTRONICS ENGINEERING SIGNALS AND SYSTEMS Aoc. Prof. Dr. Burak Kllci Spring 08 OUTLINE Th Laplac Tranform Rgion of convrgnc for Laplac ranform Invr Laplac ranform Gomric valuaion
More informationMidterm exam 2, April 7, 2009 (solutions)
Univrsiy of Pnnsylvania Dparmn of Mahmaics Mah 26 Honors Calculus II Spring Smsr 29 Prof Grassi, TA Ashr Aul Midrm xam 2, April 7, 29 (soluions) 1 Wri a basis for h spac of pairs (u, v) of smooh funcions
More informationInstitute of Actuaries of India
Insiu of Acuaris of India ubjc CT3 Probabiliy and Mahmaical aisics Novmbr Examinaions INDICATIVE OLUTION Pag of IAI CT3 Novmbr ol. a sampl man = 35 sampl sandard dviaion = 36.6 b for = uppr bound = 35+*36.6
More informationApplied Statistics and Probability for Engineers, 6 th edition October 17, 2016
Applid Saisics and robabiliy for Enginrs, 6 h diion Ocobr 7, 6 CHATER Scion - -. a d. 679.. b. d. 88 c d d d. 987 d. 98 f d.. Thn, = ln. =. g d.. Thn, = ln.9 =.. -7. a., by symmry. b.. d...6. 7.. c...
More informationI) Title: Rational Expectations and Adaptive Learning. II) Contents: Introduction to Adaptive Learning
I) Til: Raional Expcaions and Adapiv Larning II) Conns: Inroducion o Adapiv Larning III) Documnaion: - Basdvan, Olivir. (2003). Larning procss and raional xpcaions: an analysis using a small macroconomic
More informationLet s look again at the first order linear differential equation we are attempting to solve, in its standard form:
Th Ingraing Facor Mhod In h prvious xampls of simpl firs ordr ODEs, w found h soluions by algbraically spara h dpndn variabl- and h indpndn variabl- rms, and wri h wo sids of a givn quaion as drivaivs,
More informationElementary Differential Equations and Boundary Value Problems
Elmnar Diffrnial Equaions and Boundar Valu Problms Boc. & DiPrima 9 h Ediion Chapr : Firs Ordr Diffrnial Equaions 00600 คณ ตศาสตร ว ศวกรรม สาขาว ชาว ศวกรรมคอมพ วเตอร ป การศ กษา /55 ผศ.ดร.อร ญญา ผศ.ดร.สมศ
More informationThe transition:transversion rate ratio vs. the T-ratio.
PhyloMah Lcur 8 by Dan Vandrpool March, 00 opics of Discussion ransiion:ransvrsion ra raio Kappa vs. ransiion:ransvrsion raio raio alculaing h xpcd numbr of subsiuions using marix algbra Why h nral im
More informationA MATHEMATICAL MODEL FOR NATURAL COOLING OF A CUP OF TEA
MTHEMTICL MODEL FOR NTURL COOLING OF CUP OF TE 1 Mrs.D.Kalpana, 2 Mr.S.Dhvarajan 1 Snior Lcurr, Dparmn of Chmisry, PSB Polychnic Collg, Chnnai, India. 2 ssisan Profssor, Dparmn of Mahmaics, Dr.M.G.R Educaional
More informationSpring 2006 Process Dynamics, Operations, and Control Lesson 2: Mathematics Review
Spring 6 Procss Dynamics, Opraions, and Conrol.45 Lsson : Mahmaics Rviw. conx and dircion Imagin a sysm ha varis in im; w migh plo is oupu vs. im. A plo migh imply an quaion, and h quaion is usually an
More informationMicroscopic Flow Characteristics Time Headway - Distribution
CE57: Traffic Flow Thory Spring 20 Wk 2 Modling Hadway Disribuion Microscopic Flow Characrisics Tim Hadway - Disribuion Tim Hadway Dfiniion Tim Hadway vrsus Gap Ahmd Abdl-Rahim Civil Enginring Dparmn,
More informationGeneral Article Application of differential equation in L-R and C-R circuit analysis by classical method. Abstract
Applicaion of Diffrnial... Gnral Aricl Applicaion of diffrnial uaion in - and C- circui analysis by classical mhod. ajndra Prasad gmi curr, Dparmn of Mahmaics, P.N. Campus, Pokhara Email: rajndraprasadrgmi@yahoo.com
More informationFIRST-ORDER SYSTEMS OF ORDINARY DIFFERENTIAL EQUATIONS I: Introduction and Linear Systems
FIRST-ORDER SYSTEMS OF ORDINARY DIFFERENTIAL EQUATIONS I: Inroducion and Linar Sysms David Lvrmor Dparmn of Mahmaics Univrsiy of Maryland 9 Dcmbr 0 Bcaus h prsnaion of his marial in lcur will diffr from
More information1. Inverse Matrix 4[(3 7) (02)] 1[(0 7) (3 2)] Recall that the inverse of A is equal to:
Rfrncs Brnank, B. and I. Mihov (1998). Masuring monary policy, Quarrly Journal of Economics CXIII, 315-34. Blanchard, O. R. Proi (00). An mpirical characrizaion of h dynamic ffcs of changs in govrnmn spnding
More information4.1 The Uniform Distribution Def n: A c.r.v. X has a continuous uniform distribution on [a, b] when its pdf is = 1 a x b
4. Th Uniform Disribuion Df n: A c.r.v. has a coninuous uniform disribuion on [a, b] whn is pdf is f x a x b b a Also, b + a b a µ E and V Ex4. Suppos, h lvl of unblivabiliy a any poin in a Transformrs
More informationAn Indian Journal FULL PAPER. Trade Science Inc. A stage-structured model of a single-species with density-dependent and birth pulses ABSTRACT
[Typ x] [Typ x] [Typ x] ISSN : 974-7435 Volum 1 Issu 24 BioTchnology 214 An Indian Journal FULL PAPE BTAIJ, 1(24), 214 [15197-1521] A sag-srucurd modl of a singl-spcis wih dnsiy-dpndn and birh pulss LI
More informationA Condition for Stability in an SIR Age Structured Disease Model with Decreasing Survival Rate
A Condiion for abiliy in an I Ag rucurd Disas Modl wih Dcrasing urvival a A.K. upriana, Edy owono Dparmn of Mahmaics, Univrsias Padjadjaran, km Bandung-umng 45363, Indonsia fax: 6--7794696, mail: asupria@yahoo.com.au;
More information3(8 ) (8 x x ) 3x x (8 )
Scion - CHATER -. a d.. b. d.86 c d 8 d d.9997 f g 6. d. d. Thn, = ln. =. =.. d Thn, = ln.9 =.7 8 -. a d.6 6 6 6 6 8 8 8 b 9 d 6 6 6 8 c d.8 6 6 6 6 8 8 7 7 d 6 d.6 6 6 6 6 6 6 8 u u u u du.9 6 6 6 6 6
More informationDiscussion 06 Solutions
STAT Discussion Soluions Spring 8. Th wigh of fish in La Paradis follows a normal disribuion wih man of 8. lbs and sandard dviaion of. lbs. a) Wha proporion of fish ar bwn 9 lbs and lbs? æ 9-8. - 8. P
More informationControl System Engineering (EE301T) Assignment: 2
Conrol Sysm Enginring (EE0T) Assignmn: PART-A (Tim Domain Analysis: Transin Rspons Analysis). Oain h rspons of a uniy fdack sysm whos opn-loop ransfr funcion is (s) s ( s 4) for a uni sp inpu and also
More informationOn Ψ-Conditional Asymptotic Stability of First Order Non-Linear Matrix Lyapunov Systems
In. J. Nonlinar Anal. Appl. 4 (213) No. 1, 7-2 ISSN: 28-6822 (lcronic) hp://www.ijnaa.smnan.ac.ir On Ψ-Condiional Asympoic Sabiliy of Firs Ordr Non-Linar Marix Lyapunov Sysms G. Sursh Kumar a, B. V. Appa
More informationDouble Slits in Space and Time
Doubl Slis in Sac an Tim Gorg Jons As has bn ror rcnly in h mia, a am l by Grhar Paulus has monsra an inrsing chniqu for ionizing argon aoms by using ulra-shor lasr ulss. Each lasr uls is ffcivly on an
More informationH is equal to the surface current J S
Chapr 6 Rflcion and Transmission of Wavs 6.1 Boundary Condiions A h boundary of wo diffrn mdium, lcromagnic fild hav o saisfy physical condiion, which is drmind by Maxwll s quaion. This is h boundary condiion
More informationAR(1) Process. The first-order autoregressive process, AR(1) is. where e t is WN(0, σ 2 )
AR() Procss Th firs-ordr auorgrssiv procss, AR() is whr is WN(0, σ ) Condiional Man and Varianc of AR() Condiional man: Condiional varianc: ) ( ) ( Ω Ω E E ) var( ) ) ( var( ) var( σ Ω Ω Ω Ω E Auocovarianc
More informationMEM 355 Performance Enhancement of Dynamical Systems A First Control Problem - Cruise Control
MEM 355 Prformanc Enhancmn of Dynamical Sysms A Firs Conrol Problm - Cruis Conrol Harry G. Kwany Darmn of Mchanical Enginring & Mchanics Drxl Univrsiy Cruis Conrol ( ) mv = F mg sinθ cv v +.2v= u 9.8θ
More informationSOLUTIONS. 1. Consider two continuous random variables X and Y with joint p.d.f. f ( x, y ) = = = 15. Stepanov Dalpiaz
STAT UIUC Pracic Problms #7 SOLUTIONS Spanov Dalpiaz Th following ar a numbr of pracic problms ha ma b hlpful for compling h homwor, and will lil b vr usful for suding for ams.. Considr wo coninuous random
More informationBoyce/DiPrima 9 th ed, Ch 2.1: Linear Equations; Method of Integrating Factors
Boc/DiPrima 9 h d, Ch.: Linar Equaions; Mhod of Ingraing Facors Elmnar Diffrnial Equaions and Boundar Valu Problms, 9 h diion, b William E. Boc and Richard C. DiPrima, 009 b John Wil & Sons, Inc. A linar
More informationLecture 2: Current in RC circuit D.K.Pandey
Lcur 2: urrn in circui harging of apacior hrough Rsisr L us considr a capacior of capacianc is conncd o a D sourc of.m.f. E hrough a rsisr of rsisanc R and a ky K in sris. Whn h ky K is swichd on, h charging
More informationCHAPTER CHAPTER14. Expectations: The Basic Tools. Prepared by: Fernando Quijano and Yvonn Quijano
Expcaions: Th Basic Prpard by: Frnando Quijano and Yvonn Quijano CHAPTER CHAPTER14 2006 Prnic Hall Businss Publishing Macroconomics, 4/ Olivir Blanchard 14-1 Today s Lcur Chapr 14:Expcaions: Th Basic Th
More informationTransient Performance Analysis of Serial Production Lines
Univrsiy of Wisconsin Milwauk UWM Digial Commons Thss and Dissraions Augus 25 Transin Prformanc Analysis of Srial Producion Lins Yang Sun Univrsiy of Wisconsin-Milwauk Follow his and addiional works a:
More informationImpulsive Differential Equations. by using the Euler Method
Applid Mahmaical Scincs Vol. 4 1 no. 65 19 - Impulsiv Diffrnial Equaions by using h Eulr Mhod Nor Shamsidah B Amir Hamzah 1 Musafa bin Mama J. Kaviumar L Siaw Chong 4 and Noor ani B Ahmad 5 1 5 Dparmn
More informationWave Equation (2 Week)
Rfrnc Wav quaion ( Wk 6.5 Tim-armonic filds 7. Ovrviw 7. Plan Wavs in Losslss Mdia 7.3 Plan Wavs in Loss Mdia 7.5 Flow of lcromagnic Powr and h Poning Vcor 7.6 Normal Incidnc of Plan Wavs a Plan Boundaris
More information10. The Discrete-Time Fourier Transform (DTFT)
Th Discrt-Tim Fourir Transform (DTFT Dfinition of th discrt-tim Fourir transform Th Fourir rprsntation of signals plays an important rol in both continuous and discrt signal procssing In this sction w
More informationRevisiting what you have learned in Advanced Mathematical Analysis
Fourir sris Rvisiing wh you hv lrnd in Advncd Mhmicl Anlysis L f x b priodic funcion of priod nd is ingrbl ovr priod. f x cn b rprsnd by rigonomric sris, f x n cos nx bn sin nx n cos x b sin x cosx b whr
More informationUNSTEADY FLOW OF A FLUID PARTICLE SUSPENSION BETWEEN TWO PARALLEL PLATES SUDDENLY SET IN MOTION WITH SAME SPEED
006-0 Asian Rsarch Publishing work (ARP). All righs rsrvd. USTEADY FLOW OF A FLUID PARTICLE SUSPESIO BETWEE TWO PARALLEL PLATES SUDDELY SET I MOTIO WITH SAME SPEED M. suniha, B. Shankr and G. Shanha 3
More information2.1. Differential Equations and Solutions #3, 4, 17, 20, 24, 35
MATH 5 PS # Summr 00.. Diffrnial Equaions and Soluions PS.# Show ha ()C #, 4, 7, 0, 4, 5 ( / ) is a gnral soluion of h diffrnial quaion. Us a compur or calculaor o skch h soluions for h givn valus of h
More informationBoyce/DiPrima 9 th ed, Ch 7.8: Repeated Eigenvalues
Boy/DiPrima 9 h d Ch 7.8: Rpad Eignvalus Elmnary Diffrnial Equaions and Boundary Valu Problms 9 h diion by William E. Boy and Rihard C. DiPrima 9 by John Wily & Sons In. W onsidr again a homognous sysm
More informationFinal Exam : Solutions
Comp : Algorihm and Daa Srucur Final Exam : Soluion. Rcuriv Algorihm. (a) To bgin ind h mdian o {x, x,... x n }. Sinc vry numbr xcp on in h inrval [0, n] appar xacly onc in h li, w hav ha h mdian mu b
More informationLogistic equation of Human population growth (generalization to the case of reactive environment).
Logisic quaion of Human populaion growh gnralizaion o h cas of raciv nvironmn. Srg V. Ershkov Insiu for Tim aur Exploraions M.V. Lomonosov's Moscow Sa Univrsi Lninski gor - Moscow 999 ussia -mail: srgj-rshkov@andx.ru
More information7.4 QUANTUM MECHANICAL TREATMENT OF FLUCTUATIONS *
Andri Tokmakoff, MIT Dparmn of Chmisry, 5/19/5 7-11 7.4 QUANTUM MECANICAL TREATMENT OF FLUCTUATIONS * Inroducion and Prviw Now h origin of frquncy flucuaions is inracions of our molcul (or mor approprialy
More informationChapter 5 The Laplace Transform. x(t) input y(t) output Dynamic System
EE 422G No: Chapr 5 Inrucor: Chung Chapr 5 Th Laplac Tranform 5- Inroducion () Sym analyi inpu oupu Dynamic Sym Linar Dynamic ym: A procor which proc h inpu ignal o produc h oupu dy ( n) ( n dy ( n) +
More informationTransfer function and the Laplace transformation
Lab No PH-35 Porland Sa Univriy A. La Roa Tranfr funcion and h Laplac ranformaion. INTRODUTION. THE LAPLAE TRANSFORMATION L 3. TRANSFER FUNTIONS 4. ELETRIAL SYSTEMS Analyi of h hr baic paiv lmn R, and
More informationMidterm Examination (100 pts)
Econ 509 Spring 2012 S.L. Parn Midrm Examinaion (100 ps) Par I. 30 poins 1. Dfin h Law of Diminishing Rurns (5 ps.) Incrasing on inpu, call i inpu x, holding all ohr inpus fixd, on vnuall runs ino h siuaion
More informationChapter 12 Introduction To The Laplace Transform
Chapr Inroducion To Th aplac Tranorm Diniion o h aplac Tranorm - Th Sp & Impul uncion aplac Tranorm o pciic uncion 5 Opraional Tranorm Applying h aplac Tranorm 7 Invr Tranorm o Raional uncion 8 Pol and
More informationThe Matrix Exponential
Th Matrix Exponntial (with xrciss) by D. Klain Vrsion 207.0.05 Corrctions and commnts ar wlcom. Th Matrix Exponntial For ach n n complx matrix A, dfin th xponntial of A to b th matrix A A k I + A + k!
More informationS.Y. B.Sc. (IT) : Sem. III. Applied Mathematics. Q.1 Attempt the following (any THREE) [15]
S.Y. B.Sc. (IT) : Sm. III Applid Mahmaics Tim : ½ Hrs.] Prlim Qusion Papr Soluion [Marks : 75 Q. Amp h following (an THREE) 3 6 Q.(a) Rduc h mari o normal form and find is rank whr A 3 3 5 3 3 3 6 Ans.:
More informationOn the Speed of Heat Wave. Mihály Makai
On h Spd of Ha Wa Mihály Maai maai@ra.bm.hu Conns Formulaion of h problm: infini spd? Local hrmal qulibrium (LTE hypohsis Balanc quaion Phnomnological balanc Spd of ha wa Applicaion in plasma ranspor 1.
More informationSUPERCRITICAL BRANCHING DIFFUSIONS IN RANDOM ENVIRONMENT
Elc. Comm. in Proa. 6 (), 78 79 ELECTRONIC COMMUNICATIONS in PROBABILITY SUPERCRITICAL BRANCHING DIFFUSIONS IN RANDOM ENVIRONMENT MARTIN HUTZENTHALER ETH Zürich, Dparmn of Mahmaics, Rämisrass, 89 Zürich.
More informationwhereby we can express the phase by any one of the formulas cos ( 3 whereby we can express the phase by any one of the formulas
Third In-Class Exam Soluions Mah 6, Profssor David Lvrmor Tusday, 5 April 07 [0] Th vrical displacmn of an unforcd mass on a spring is givn by h 5 3 cos 3 sin a [] Is his sysm undampd, undr dampd, criically
More informationFixed-Relative-Deadline Scheduling of Hard Real-Time Tasks with Self-Suspensions
Fixd-Rlaiv-Dadlin Schduling of Hard Ral-Tim Tasks wih Slf-Suspnsions Jian-Jia Chn Dparmn of Informaics TU Dormund Univrsiy, Grmany jia.chn@u-dormund.d Absrac In many ral-im sysms, asks may xprinc slf-suspnsion
More informationsymmetric/hermitian matrices, and similarity transformations
Linar lgbra for Wirlss Communicaions Lcur: 6 Diffrnial quaions, Grschgorin's s circl horm, symmric/hrmiian marics, and similariy ransformaions Ov Edfors Dparmn of Elcrical and Informaion Tchnology Lund
More informationThe Matrix Exponential
Th Matrix Exponntial (with xrciss) by Dan Klain Vrsion 28928 Corrctions and commnts ar wlcom Th Matrix Exponntial For ach n n complx matrix A, dfin th xponntial of A to b th matrix () A A k I + A + k!
More informationA THREE COMPARTMENT MATHEMATICAL MODEL OF LIVER
A THREE COPARTENT ATHEATICAL ODEL OF LIVER V. An N. Ch. Paabhi Ramacharyulu Faculy of ahmaics, R D collgs, Hanamonda, Warangal, India Dparmn of ahmaics, Naional Insiu of Tchnology, Warangal, India E-ail:
More informationAFFINITY SET AND ITS APPLICATIONS *
oussa Larbani Yuh-Wn Chn FFINITY SET ND ITS PPLICTIONS * bsrac ffiniy has a long hisory rlad o h social bhavior of human, spcially, h formaion of social groups or social nworks. ffiniy has wo manings.
More informationLecture 4: Laplace Transforms
Lur 4: Lapla Transforms Lapla and rlad ransformaions an b usd o solv diffrnial quaion and o rdu priodi nois in signals and imags. Basially, hy onvr h drivaiv opraions ino mulipliaion, diffrnial quaions
More informationCramér-Rao Inequality: Let f(x; θ) be a probability density function with continuous parameter
WHEN THE CRAMÉR-RAO INEQUALITY PROVIDES NO INFORMATION STEVEN J. MILLER Abstract. W invstigat a on-paramtr family of probability dnsitis (rlatd to th Parto distribution, which dscribs many natural phnomna)
More informationIntroduction to Arithmetic Geometry Fall 2013 Lecture #20 11/14/2013
18.782 Introduction to Arithmtic Gomtry Fall 2013 Lctur #20 11/14/2013 20.1 Dgr thorm for morphisms of curvs Lt us rstat th thorm givn at th nd of th last lctur, which w will now prov. Thorm 20.1. Lt φ:
More informationRouting in Delay Tolerant Networks
Rouing in Dlay Tolran Nworks Primary Rfrnc: S. Jain K. Fall and R. Para Rouing in a Dlay Tolran Nwork SIGCOMM 04 Aug. 30-Sp. 3 2004 Porland Orgon USA Sudn lcur by: Soshan Bali (748214) mail : sbali@ic.ku.du
More informationA Simple Procedure to Calculate the Control Limit of Z Chart
Inrnaional Journal of Saisics and Applicaions 214, 4(6): 276-282 DOI: 1.5923/j.saisics.21446.4 A Simpl Procdur o Calcula h Conrol Limi of Z Char R. C. Loni 1, N. A. S. Sampaio 2, J. W. J. Silva 2,3,*,
More informationAN INTRODUCTION TO FOURIER ANALYSIS PROF. VEDAT TAVSANOĞLU
A IRODUCIO O FOURIER AALYSIS PROF. VEDA AVSAOĞLU 994 A IRODUCIO O FOURIER AALYSIS ABLE OF COES. HE FOURIER SERIES ---------------------------------------------------------------------3.. Priodic Funcions-----------------------------------------------------------------------3..
More informationEXERCISE - 01 CHECK YOUR GRASP
DIFFERENTIAL EQUATION EXERCISE - CHECK YOUR GRASP 7. m hn D() m m, D () m m. hn givn D () m m D D D + m m m m m m + m m m m + ( m ) (m ) (m ) (m + ) m,, Hnc numbr of valus of mn will b. n ( ) + c sinc
More informationOn General Solutions of First-Order Nonlinear Matrix and Scalar Ordinary Differential Equations
saartvlos mcnirbata rovnuli akadmiis moamb 3 #2 29 BULLTN OF TH ORN NTONL DMY OF SNS vol 3 no 2 29 Mahmaics On nral Soluions of Firs-Ordr Nonlinar Mari and Scalar Ordinary Diffrnial uaions uram L Kharaishvili
More informationfiziks Institute for NET/JRF, GATE, IIT JAM, JEST, TIFR and GRE in PHYSICAL SCIENCES MATEMATICAL PHYSICS SOLUTIONS are
MTEMTICL PHYSICS SOLUTIONS GTE- Q. Considr an ani-symmric nsor P ij wih indics i and j running from o 5. Th numbr of indpndn componns of h nsor is 9 6 ns: Soluion: Th numbr of indpndn componns of h nsor
More informationLagrangian for RLC circuits using analogy with the classical mechanics concepts
Lagrangian for RLC circuis using analogy wih h classical mchanics concps Albrus Hariwangsa Panuluh and Asan Damanik Dparmn of Physics Educaion, Sanaa Dharma Univrsiy Kampus III USD Paingan, Maguwoharjo,
More informationMixing time with Coupling
Mixig im wih Couplig Jihui Li Mig Zhg Saisics Dparm May 7 Goal Iroducio o boudig h mixig im for MCMC wih couplig ad pah couplig Prsig a simpl xampl o illusra h basic ida Noaio M is a Markov chai o fii
More information5. An object moving along an x-coordinate axis with its scale measured in meters has a velocity of 6t
AP CALCULUS FINAL UNIT WORKSHEETS ACCELERATION, VELOCTIY AND POSITION In problms -, drmin h posiion funcion, (), from h givn informaion.. v (), () = 5. v ()5, () = b g. a (), v() =, () = -. a (), v() =
More informationSoftware Reliability using SPRT: Inflection S- shaped Model
Volum 2, Issu 6, Jun 23 ISSN 239-4847 Sofwar Rliabiliy using SPRT: Inflcion S- shapd Modl Dr. R. Saya Prasad, K. Prasada Rao 2 and G. Krishna Mohan3 Associa Profssor, Dp. of Compur Scinc & Engg., Acharya
More informationPhys463.nb Conductivity. Another equivalent definition of the Fermi velocity is
39 Anohr quival dfiniion of h Fri vlociy is pf vf (6.4) If h rgy is a quadraic funcion of k H k L, hs wo dfiniions ar idical. If is NOT a quadraic funcion of k (which could happ as will b discussd in h
More informationLecture 1: Growth and decay of current in RL circuit. Growth of current in LR Circuit. D.K.Pandey
cur : Growh and dcay of currn in circui Growh of currn in Circui us considr an inducor of slf inducanc is conncd o a DC sourc of.m.f. E hrough a rsisr of rsisanc and a ky K in sris. Whn h ky K is swichd
More informationWEIBULL FUZZY PROBABILITY DISTRIBUTION FOR RELIABILITY OF CONCRETE STRUCTURES
Enginring MECHANICS, Vol. 17, 2010, No. 5/6, p. 363 372 363 WEIBULL FUZZY PROBABILITY DISTRIBUTION FOR RELIABILITY OF CONCRETE STRUCTURES Zdněk Karpíšk*, Pr Šěpánk**, Pr Jurák* Basd on h fuzzy probabiliy
More informationFourier Transforms and the Wave Equation. Key Mathematics: More Fourier transform theory, especially as applied to solving the wave equation.
Lur 7 Fourir Transforms and th Wav Euation Ovrviw and Motivation: W first discuss a fw faturs of th Fourir transform (FT), and thn w solv th initial-valu problm for th wav uation using th Fourir transform
More informationHomotopy perturbation technique
Comput. Mthods Appl. Mch. Engrg. 178 (1999) 257±262 www.lsvir.com/locat/cma Homotopy prturbation tchniqu Ji-Huan H 1 Shanghai Univrsity, Shanghai Institut of Applid Mathmatics and Mchanics, Shanghai 272,
More informationStudy on the Lightweight checkpoint based rollback recovery mechanism
9 Inrnaional Confrnc on Compur Enginring and Applicaions II vol. IAI rss, Singapor Sudy on h ighwigh chcpoin basd rollbac rcovry mchanism Zhang i,3, ang Rui Dai Hao 3, Ma Mingai 3 and i Xianghong 4 Insiu
More informationC From Faraday's Law, the induced voltage is, C The effect of electromagnetic induction in the coil itself is called selfinduction.
Inducors and Inducanc C For inducors, v() is proporional o h ra of chang of i(). Inducanc (con d) C Th proporionaliy consan is h inducanc, L, wih unis of Hnris. 1 Hnry = 1 Wb / A or 1 V sc / A. C L dpnds
More informationCircuits and Systems I
Circuis and Sysms I LECTURE #3 Th Spcrum, Priodic Signals, and h Tim-Varying Spcrum lions@pfl Prof. Dr. Volan Cvhr LIONS/Laboraory for Informaion and Infrnc Sysms Licns Info for SPFirs Slids This wor rlasd
More informationDecline Curves. Exponential decline (constant fractional decline) Harmonic decline, and Hyperbolic decline.
Dlin Curvs Dlin Curvs ha lo flow ra vs. im ar h mos ommon ools for forasing roduion and monioring wll rforman in h fild. Ths urvs uikly show by grahi mans whih wlls or filds ar roduing as xd or undr roduing.
More informationChapter 10. The singular integral Introducing S(n) and J(n)
Chaptr Th singular intgral Our aim in this chaptr is to rplac th functions S (n) and J (n) by mor convnint xprssions; ths will b calld th singular sris S(n) and th singular intgral J(n). This will b don
More informationIntegrity Control in Nested Certificates
Ingriy onrol in Nsd s $OEHUW/HYLDQG08IXNdD OD\DQ %R D]LoL8QLYHUVLW\'HSDUWPHQWRI&RPSXWHU(QJLQHHULQJ Bbk, Isanbul 80815, Turky lvi@boun.du.r caglayan@boun.du.r Absrac Nsd crificas [3,4] ar proposd as crificas
More informationSECTION where P (cos θ, sin θ) and Q(cos θ, sin θ) are polynomials in cos θ and sin θ, provided Q is never equal to zero.
SETION 6. 57 6. Evaluation of Dfinit Intgrals Exampl 6.6 W hav usd dfinit intgrals to valuat contour intgrals. It may com as a surpris to larn that contour intgrals and rsidus can b usd to valuat crtain
More informationVoltage v(z) ~ E(z)D. We can actually get to this wave behavior by using circuit theory, w/o going into details of the EM fields!
Considr a pair of wirs idal wirs ngh >, say, infinily long olag along a cabl can vary! D olag v( E(D W can acually g o his wav bhavior by using circui hory, w/o going ino dails of h EM filds! Thr
More informationReal time estimation of traffic flow and travel time Based on time series analysis
TNK084 Traffic Thory sris Vol.4, numbr.1 May 008 Ral im simaion of raffic flow and ravl im Basd on im sris analysis Wi Bao Absrac In his papr, h auhor sudy h raffic parn and im sris. Afr ha, a im sris
More informationEE 434 Lecture 22. Bipolar Device Models
EE 434 Lcur 22 Bipolar Dvic Modls Quiz 14 Th collcor currn of a BJT was masurd o b 20mA and h bas currn masurd o b 0.1mA. Wha is h fficincy of injcion of lcrons coming from h mir o h collcor? 1 And h numbr
More informationForecasting in functional regressive or autoregressive models
Forcasing in funcional rgrssiv or auorgrssiv modls Ann Philipp 1 and Mari-Claud Viano 2 Univrsié d Nans Univrsié d Lill 1 2008-2009 1 Laboraoir d mahémaiqus Jan Lray, 2 ru d la Houssinièr 44322 Nans, Franc
More informationSection. Problem Representation. Substation. Protection Device. protection equipments. Substation. Client. EPDS divided in blocks connected by
HIERARCHICAL MULTIPLE CRITERIA OPTIMIZATION OF MAINTENANCE ACTIVITIES ON POWER DISTRIBUTION NETWORKS Problm Rprsaion EPDS comprising: Subsaions, primary nworks, scondary, nworks; Fdrs (cabls, lins, pols,
More informationData Assimilation 1. Alan O Neill National Centre for Earth Observation UK
Data Assimilation 1 Alan O Nill National Cntr for Earth Obsrvation UK Plan Motivation & basic idas Univariat (scalar) data assimilation Multivariat (vctor) data assimilation 3d-Variational Mthod (& optimal
More informationwhere: u: input y: output x: state vector A, B, C, D are const matrices
Sa pac modl: linar: y or in om : Sa q : f, u Oupu q : y h, u u Du F Gu y H Ju whr: u: inpu y: oupu : a vcor,,, D ar con maric Eampl " $ & ' " $ & 'u y " & * * * * [ ],, D H D I " $ " & $ ' " & $ ' " &
More informationThe Science of Monetary Policy
Th Scinc of Monary Policy. Inroducion o Topics of Sminar. Rviw: IS-LM, AD-AS wih an applicaion o currn monary policy in Japan 3. Monary Policy Sragy: Inrs Ra Ruls and Inflaion Targing (Svnsson EER) 4.
More informationNonlocal Symmetries and Exact Solutions for PIB Equation
Commun. Thor. Phys. 58 01 331 337 Vol. 58 No. 3 Spmbr 15 01 Nonlocal Symmris and Exac Soluions for PIB Equaion XIN Xiang-Png 1 MIAO Qian 1 and CHEN Yong í 1 1 Shanghai Ky Laboraory of Trusworhy Compuing
More informationBifurcation Theory. , a stationary point, depends on the value of α. At certain values
Dnamic Macroconomic Thor Prof. Thomas Lux Bifurcation Thor Bifurcation: qualitativ chang in th natur of th solution occurs if a paramtr passs through a critical point bifurcation or branch valu. Local
More informationCHAPTER. Linear Systems of Differential Equations. 6.1 Theory of Linear DE Systems. ! Nullcline Sketching. Equilibrium (unstable) at (0, 0)
CHATER 6 inar Sysms of Diffrnial Equaions 6 Thory of inar DE Sysms! ullclin Skching = y = y y υ -nullclin Equilibrium (unsabl) a (, ) h nullclin y = υ nullclin = h-nullclin (S figur) = + y y = y Equilibrium
More informationDE Dr. M. Sakalli
DE-0 Dr. M. Sakalli DE 55 M. Sakalli a n n 0 a Lh.: an Linar g Equaions Hr if g 0 homognous non-homognous ohrwis driving b a forc. You know h quaions blow alrad. A linar firs ordr ODE has h gnral form
More informationCharging of capacitor through inductor and resistor
cur 4&: R circui harging of capacior hrough inducor and rsisor us considr a capacior of capacianc is conncd o a D sourc of.m.f. E hrough a rsisr of rsisanc R, an inducor of inducanc and a y K in sris.
More informationCopyright 2012 Pearson Education, Inc. Publishing as Prentice Hall.
Chapr Rviw 0 6. ( a a ln a. This will qual a if an onl if ln a, or a. + k an (ln + c. Thrfor, a an valu of, whr h wo curvs inrsc, h wo angn lins will b prpnicular. 6. (a Sinc h lin passs hrough h origin
More information