A New Bayesian Network Method for Computing Bottom Event's Structural Importance Degree using Jointree
|
|
- Bernice Hawkins
- 8 years ago
- Views:
Transcription
1 , pp A New Bayesa Network Method for Computg Bottom Evet's Structural Importace Degree usg Jotree Wag Yao ad Su Q School of Aeroautcs, Northwester Polytechcal Uversty, X a, PR Cha) wagyaorose@126.com, suqg@wpu.edu.c Abstract T Bayesa etwork methodology takg place of fault tree aalyss used for relablty assessmet has gotte lots of atteto recet years. O bass of the curret Bayesa etwork method used for calculatg structural mportace degree, a ew Bayesa etwork method s rased. Ths ew method ca avod repeat modfcato of the parameters the codtoal probablty tables, ad hece the termedate results computed durg ferece process ca be shared to decrease calculatg complexty. The ew method s proved to be correct a mathematc way ad a correspodg algorthm amed SID_Jotree for realzg ths ew method s desged, whch guaratees the ew method ca be realzed computer. Fally, the correctess ad effcecy of the ew method s valdated by usg two fault tree cases. Keywords: Bayesa etwork; fault tree; structural mportace degree; relablty assessmet; ferece 1. Itroducto As a model used for relablty assessmet, Bayesa etwork mapped from a fault tree ca acheve more useful results tha fault tree aalyss (FTA). Studes show that, all the results calculated through FTA ca be computed through Bayesa etwork ad the coverse s ot true. For example, f the top evet occurs, oe ca calculate the posteror probablty of the bottom evet usg Bayesa etwork, whch ca t be calculated usg FTA. The methods for evaluatg system usg a fault tree s equvalet Bayesa etwork have gotte lots of atteto home ad abroad. I specal, may researchers focus o the methods for solvg relablty dexes, such as mmal cut sets, mmal path cuts, structural mportace degree, ad probablty mportace degree. Amog these researchers, Lug Portale [1, 2] ad Nma Khakzad [3] studed how to solve the mmal cut sets ad how to calculate relablty degree a mathematcal way; Wedl [5] studed how to calculate the relablty degree ad some other tradtoal relablty dexes usg the exstet Bayesa etwork toolbox. Zhou Zhogbao [6] rased a ew method for computg the structural mportace degree, whch represets the ew state-of-the-art solvg such a tradtoal relablty dex usg Bayesa etwork. However, the ew method s complcated: for each bottom evet, oe eeds to ferece the equvalet Bayesa etwork oce. That s to say, for a system wth bottom evets, oe has to ferece tmes the Bayesa etwork. As creases, the effcecy of the method decreases. O the bass of researches stated above, ths paper presets a ew method for calculatg all the bottom evets structural mportace degree usg a Jotree extracted from the fault tree s equvalet Bayesa etwork, as well as the correspodg algorthm SID_Jotree. Jotree s a kd of structural that the termedate results ca be stored the edges of tself durg ferece, so through Jotree ISSN: IJUNESST Copyrght c 2015 SERSC
2 oe ca reduce the ferece complexty by sharg the stored results [7-8]. I fact, through a ward ad outward ferece the Jotree (both ward ad outward ferece s equvalet to ferece oce usg varable elmato algorthm a Bayesa etwork, separately [8]), oe ca store all the termedate results eeded for calculatg each ode s posteror probablty, whch s the key kd of probablty for calculatg each ode s structural mportace degree. However, accordg to Zhou s method, oe has to chage other odes CPTs before calculatg oe bottom evet s structural mportace degree a Bayesa etwork. Oce ay CPT chaged a Bayesa etwork, the termedate results stored the edges of Bayesa etwork s correspodg Jotree become vald ad caot be shared for calculatg aother bottom evet s structural mportace degree. That meas oe has to calculate each bottom evet s structural mportace degree oe by oe. O the cotrary, the method rased ths paper avods chagg ay ode s CPT durg ferece. Thus, the termedate results stored the edges of the Jotree are stll vald for calculatg ay other evet s structural mportace degree. I addto, the ew method s proved correct a mathematcal way. Fally, such a method s exemplfed wth two fault cases. 2. Bayesa Network 2.1. Defto of Bayesa Network Bayesa etwork s a drected acyclc graph, cosstg of odes deoted by varables ad drected edges that pot from father odes to chldre odes, each edge deoted by oe-le arrows [7]. Every ode Bayesa etwork has a codtoal probablty table (CTP). To be specfc, the CPT of ode Y ca be represeted wth Pr( Y ( Y)), whch ( Y ) stads for the set of odey s fathers. Varable Y ad ts fathers ( Y ) make up a famly. Itutvely, every CPT stores ts famly s possble states, as well as the states correspodg probabltes. A smple Bayesa etwork s show Fg.1 (b). For a Bayesa etwork, whch all the varables make up set N { Y1, Y2,, Y }, jot probablty dstrbuto of the etwork ca be computed by multplyg all the odes CPTs: Pr( Y, Y,, Y ) Pr( Y ( Y )) [8] T X 1 A X 2 X 3 (a) 278 Copyrght c 2015 SERSC
3 X 1 A T Pr (T X 1,A) X 0 X 1 Pr(X ) 1 q 1 q T A X 2 X 3 X 2 X 3 A Pr (A X 2 X 3 ) Pr (T X 1 A) (b) Pr (A X 2 X 3 ) T,X 1,A T,A A X 3,A X 3,X 2 A X 1 T X 3 X 2 Pr (X 1 ) (c) Pr (X 3 ) Pr (X 2 ) Fgure 1. A Smple System Descrbed Dfferet Topologes (a) Fault Tree; (b) The equvalet Bayesa etwork; (c) A Jotree extracted from the Bayesa etwork wth each CPT assged to ther famly clusters, takg the cluster {T,X 1,A} as root, sold arrows dcate the drecto of ward calculato ad dotted arrows dcate the drecto of outward calculato. After a ward ad outward calculato, termedate results ca be stored the edges or clusters. Ad If termedate results ca be shared, Pr( X E e ) ca be read from cluster{ X } drectly Iferece Bayesa Networks All the ferece problems Bayesa etwork ca be boled dow to solvg the probablty dstrbuto of Pr( Q, E e ), whch Q stads for the set of query varables that people are terested ad E stads for the set of evdece varables that people have already kow ts values e. Mastream, varable elmato algorthm (VE) ad Jotree algorthm are two ma exact ferece algorthms Bayesa etwork. Jotree algorthm starts wth a jotree extracted from Bayesa etwork (see Fg. 1(c)).For a Bayesa etwork, t has may dfferet Jotrees accordg to dfferet costructo algorthms. I ths paper, oe kd of Jotree amed bary Jotree s adopted by usg the costructo algorthm stated the lterature [9,10]. Nodes of jotree are called clusters ad each cluster cotas oe or several varables. As stated before, f a cluster Copyrght c 2015 SERSC 279
4 cossts of a varable wth all ts fathers, the cluster s called famly cluster. After a jotree s extracted, assg every CPT to ts famly cluster. The a jotree ca be vewed as a specal structure that oe ca store termedate results the edges or clusters durg ferece process ad these termedate results ca be shared whe solvg aother dfferet Bayesa etwork ferece problem. Such a data-shared mechasm ca avod more calculato solvg aother ferece problem. Because of these shared termedate data, oe ca compute the probablty dstrbuto Pr( Y, E e) of each odey by just performg Jotree algorthm oce. Here Y ca represet ay ode the etwork. But whe ay CPT s chaged, the termedate results stored the jotree become vald. Oe has to perform the Jotree algorthm aga oce ay CPT has bee chaged. VE algorthm does t store ay termedate results ferece process. Therefore, there s o shared data whe solvg aother ferece problem. Oe ca oly compute the probablty dstrbuto Pr( Y, E e) of someoe ode Y by VE algorthm. Here, Y stads oly some ode the etwork, ot ay ode. I fact, Jotree algorthm cotas two computato parts: ward calculato ad outward calculato. Each kd of calculato s equvalet to performg VE algorthm oce except that termedate results are store durg performg ward ad outward calculato whle VE algorthm stores othg. Takg Fg.1(c) for a stace, set evdece T=1. Usg Jotree algorthm, oe ca extract the results Pr( X, T 1), 1, 2,3 from the cluster { X } after a ward ad outward calculato. Whle oe eeds to perform VE algorthm three tmes order to calculate Pr( X, T 1), 1,2, Mappg Fault Trees to Bayesa Networks Deote a fault tree usg FT ad deote ts equvalet Bayesa etwork usg BN. O the bass of refereces [1-3], the steps for mappg FT to BN are gve as below. 1. For every bottom evet FT, buld oly oe ode BN to correspod to. The draw arrows that pot from odes whch are correspodet wth bottom evets to odes whch are correspodet wth termedate/top evets. Specfcally, BN, varable T deotes the ode that correspods to top evet, ad T=0/1 holds; X deotes the ode that correspods to bottom evet, ad X 0 /1 holds; Aj deotes the ode that correspods to termedate evet, ad Aj 0 /1 holds. I the followg, 1 represets the fault state ad 0 represets the ormal/workable state. 2. Determe every root ode CPT, deoted by Pr( X ). Root odes are mapped from bottom evets, therefore Pr( X ) s decded by each bottom evet s falure probablty q. To be specfc, Pr( X 1) q ad Pr( X 0) 1 q holds. 3. Determe o-root odes CPTs, deoted by Pr( T ( T)) or Pr( A ( A )). These o-root odes are mapped from termedate/top evets. These evets are caused by bottom evets some kd of determstc logc relatoshp, such as AND ad VOTE. The CPT of o-root ode must be gve correspodg to such a determstc relatoshp. The detaled method for geeratg o-root ode s CPT s dscussed [1, 6]. Accordg to the procedures above, the equvalet Bayesa etwork of Fgure 1 (a) s gve Fgure 1 (b). j j 280 Copyrght c 2015 SERSC
5 3. Methods for Solvg Structural Importace Degree 3.1. FTA Method The state of top evet s a structural fucto (or called state fucto), whch vares wth every bottom evet s state, deoted by ( X ) ( X1, X 2,, X ). Both ( X ) ad X take the value 1 or 0. Usg FTA, the structural mportace degree of bottom evet X s computed by Eq. (1) [11] based o FT. 1 1 I [ ( X 1, X k, X k, X k, X k,, X k ) (1) ( ) k, k k, k, k ( X 0, X1 k1, X 2 k2, X 1 k 1, X 1 k 1,, X k )] I Eq. (1), the summato symbol meas that all the varables sde the bracket should traverse the value 0 ad 1 except the bottom evet ode X Bayesa Network Method Exstet Bayesa Network Method: Eq. (1) provdes a exact way to solve bottom evet X s structural mportace degree. I essece, t s a exhaust method that oe should lst a system s every possble state. For example, f a system has bottom evets, the system wll have exp() states ad oe has to lst all these states to computg the dex. As crease, lstg all the possble states s a hardly work. I cotrast, the Bayesa etwork method proposed by Zhou [6] avods such a exhaust lst, whch makes exact computato feasble a larger system. Accordg to Zhou s method, ode X s structural mportace degree ca be computed usg Eq. (2) BN : I =Pr( T 1 X 1) Pr( T 1 X 0) () (2) X s the ode whose structural mportace degree to be calculated. However, for Eq. (2) there are the followg calculato codtos. Before usg Eq.(2), the o-root odes CPTs should rema uchaged just as ther orgal CPTs geerated the frst begg usg the mappg method Secto 2.3, as well as ode X s CPT; Meawhle, all the root odes CPTs except X s should be chaged to a uform dstrbuto as follows: Pr( X j 0) 1/ 2, Pr( X j 1) 1/ 2, j. Accordg to Eq. (2) ad ts calculato codtos, whe solvg X s structural mportace degree, the rest root odes CPTs have to be chaged. Therefore, termedate results caot be shared eve though Jotree algorthm s adopted (Obvously, the termedate results stored Jotree become vald whe solvg aother bottom evet because some CPTs have to be chaged aga). Oe has to solve each bottom evet s structural mportace degree oe by oe. Above all, usg the exstet Bayesa etwork method to solve a system wth bottom evets, Eq. (2) has to be computed tmes A New Bayesa Network Method: Here a ew method s rased ad wll be proved a mathematcal way. The ew Bayesa etwork method s expressed wth Eq. (3) as below: I () =2 Pr( T 1, X 1) Pr( T 1, X 0) (3) Before calculatg Eq. (3), set every root ode s CPT to a uform dstrbuto as follows: Pr( X j 0) 1/ 2, Pr( X j 1) 1/ 2. Copyrght c 2015 SERSC 281
6 Comparg the ew method wth Eq. (2), a major dfferece les that all the CPTs are set oce ad oe of them wll be chaged aga usg the ew method whle usg Eq. (2), some root odes CPTs have to be chaged aga whe solvg a dfferet bottom evet s structural mportace degree. No chagg CPTs ay more meas that termedate results wll be stll useful ad ca be shared whe solvg aother dfferet bottom evet s structural mportace degree usg Jotree algorthm (As stated Secto 2.2, Jotree algorthm ca store termedate results, ad f the CPTs are ever bee chaged, these termedate data wll vald forever ). Therefore, oe ca compute every bottom evet s structural mportace degree just performg Jotree algorthm oce. I what follows, Eq. (3) s proved a mathematcal way. Proof: As structural mportace degree s rrespectve of the falure probablty of each bottom evet of FT, set each bottom evet s falure probablty equals to 0.5. Obvously, for each root ode X BN, ts CPT s as below: Pr( X 0) 1/ 2, Pr( X 1) 1/ 2. j j As X1, X2,, X 1 ad X are depedet of each other, Eq. (4) ad Eq. (5) hold (4) Pr( X, X,, X, X,, X ) 1 2 Pr( X1, X2,, X ) 1 2 (5) Combg Bayer Theorem, Eq. (6) ad Eq. (7) ca be derved from Eq. (4) ad Eq. (5). Pr( T 1 X 1, X1 k1, X 2 k2,, X 1 k 1, X 1 k 1,, X k) (6) Pr( T 1, X 1, X k, X k,, X k, X k,, X k ) Pr( T 1 X 0, X1 k1, X 2 k2,, X 1 k 1, X 1 k 1,, X k) (7) Pr( T 1, X 0, X1 k1, X 2 k2,, X 1 k 1, X 1 k 1,, X k) 2 I FT, setece ( X1 k1, X 2 k2,, X 1 k 1, X k, X 1 k 1, X k) 0 meas that top evet certaly wo t happe whe all the bottom evets take the state k1, k2,, k 1, k, k 1,, k lsted the Paretheses. I BN, such a setece meas that top evet T takes state 1wth a probablty of. Aalogously, FT setece ( X k, X k,, X k, X k, X k, X k ) 1 meas that the top evet curtas to occur whe all the bottom evets take the state k1, k2,, k 1, k, k 1,, k lsted the Paretheses. I BN, such a setece meas that top evet T takes state 1wth a probablty of. Accordg to the llustrato above, Eq. (8) holds. ( X1 k1, X 2 k2,, X 1 k 1,, X 1 k 1,, X k) (8) Pr( T 1 X1 k1, X 2 k2,, X 1 k 1,, X 1 k 1,, X k) Take Eq. (6), Eq. (7) ad Eq. (8) to Eq. (1), Eq. (9) ca be acheved. 1 I 2 Pr( T 1, X 1, X k,, X k, X k,, X k ) ( ) k, k, k, k T X X1 k1 X 1 k 1 X 1 k 1 X k (9) k, k, k, k 0 2 Pr( 1, 0,,,,,, ) [Pr( T 1, X 1) Pr( T 1, X 0)] Proof eds. 282 Copyrght c 2015 SERSC
7 Above all, for a system wth bottom evets, oe ca compute all bottom evets structural mportace degree wth two tmes ferece usg the ew method: a ward computato ad a outward computato The Correspodg New Algorthm SID_Jotree: Eq. (3) s a ew mathematcal method for computg each bottom evet s structural mportace degree. As a complemet to the ew method, the correspodg ew algorthm SID_Jotree s desged. I fact, two tmes ferece (a ward ad outward) s performed after callg SID_Jotree, whch results every bottom evet s structural mportace degree. Algorthm SID _Jotree (N, N, CPTs, X, X ) Iputs: N: set whch cotas all the varables Bayesa etwork; N : the umber of varables Bayesa etwork; CPTs: every ode s CPT; X: set whch cotas all root odes (bottom evets) Bayesa etwork; X : the umber of root odes; Outputs: I () 1,2,, X : each bottom evet s structural mportace degree 1: for(=1,, X ) 2: Set Pr(X =1)=1/2, Pr(X =0)=1/2; 3: Covert a Bayesa etwork to a jotree; 4: for(=1,, N ) 5: { I ode s CPT, delete the parameters that are compatble wth T=1; 6: Assg ode s CPT to ts famly cluster the jotree buld le 3; } 7: Choose oe cluster the jotree as root; 8: Perform ward calculato; 9: Perform outward calculato; 10: for(=1,, X ) 11: {Extract results Pr(T=1, X =0) ad Pr(T=1, X =1) from cluster { X }; 12: I () 2[Pr( T 1, X 1) Pr( T 1, X 0)] ;} 4. Case Studes Two cases are dscussed usg the old ad ew Bayesa etwork method, separately. Ad the results are compared. The effcecy ad feasblty of the ew Bayesa etwork method s the ma cocer ths paper. I addto, the ew method s a geeral methodology whch ca be appled to ay system, ot lmted to ay cocrete specal systems. Therefore, the followg fault trees omt each evet s physcal meag A Smple Fault Tree Takg Fgure 1 for the frst case, Fgure 1 (a) s a fault tree, the equvalet Bayesa etwork mapped from the tree show Fgure 1 (b), ad the correspodg Jotree extracted from the Bayesa etwork show Fgure 1 (c). All the bottom evets CPTs should be set to Pr( X 0) 1/ 2, Pr( X 1) 1/ 2 ad the top evet T should be set to T=1 the Jotree accordg to the ew method. After the ward ad outward calculato, the results Pr(X 1 T=1),Pr(X 2 T=1) ad Pr(X 3 T=1) ca be read from the cluster {X 1 },{X 2 }ad Copyrght c 2015 SERSC 283
8 {X 3 }separately. The accordg to the Eq. (3), all these three bottom evets structural mportace degree ca be computed. Apparetly, ward ad outward two tmes ferece are eeded here.the fal results are show Table 1. Table 1. Results of Case 1 Bottom evets Old Bayesa etwork method New Bayesa etwork method X X X Number of ferece 3 tmes 2 tmes 4.2. A Fault Tree for a Power Dstrbuto System Fgure 2(a) s a fault tree for a power dstrbuto system [12-13]. Accordg to the steps for mappg fault trees to Bayesa etworks, the acheved equvalet BN s show Fgure 2. (b) ad the Jotree mapped from the Bayesa etwork s show Fgure 2 (c). It easly ca be see that all the bottom evets correspodg clusters ca be foud the Jotree, separately. Accordg to the ew method, set every bottom evet s CPT to Pr( X 0) 1/ 2, Pr( X 1) 1/ 2 ad T=1. The the results Pr( X 0 T 1), Pr( X 1 T 1) ca be read from the Jotree after a ward ad outward computato. The all the bottom evets structural mportace degree ca be computed accordg to Eq. (3), results show Table 2, whch the results computed usg the Eq.(2) (the old method) also provded. From the results Table 1 ad Table 2, t ca be see that the same results ca be computed by these two methods, whch proves the correctess of the ew method. I case 1, there are three bottom evets, three tmes ferece are performed usg old method whle two tmes ferece are performed usg the ew algorthm; I case 2, there are eght bottom evets, eght tmes ferece are ecessary usg the old method whle stll two tmes ferece are performed usg the ew algorthm. It ca be cocluded that as the umber of bottom evets creases, the umber of ferece creases whe usg the old method. However, the umber of ferece s rrespectve of whe usg the ew method (oly a ward ad outward ferece s ecessary). 284 Copyrght c 2015 SERSC
9 T T A 1 A2 A 1 A 2 X 7 A 3 X 8 A 4 X 7 A 3 A 4 X 8 X 6 A 5 X 4 X 2 X 5 X 6 A 5 A 6 X 4 X 5 X 4 A 6 X 5 X 1 X 2 X 3 X 1 X 2 X 3 (a) (b) X 1 Pr(X 1 ) X 5 Pr(X 5 ) X 1 X 2 X 3 X X 4 X 5 A 5 A 4 6 Pr(A 6 X 1 X 2 X 3 ) Pr(X 4 ) A Pr(X 6 ) 6 X 6 Pr(A 5 X 4 X 5 A 6 ) X 1 X 2 X 3 X 2 X 3 X 1 X 2 X 3 X 5 X 1 X 2 X 3 X 5 A 6 X 2 X 5 A 6 X 2 X 4 X 5 Pr(A 2 X 8 A 4 ) A 2 X 8 A 4 Pr(X 7 ) X 7 A 3 A 4 X 8 A 6 A 3 A 5 X 6 X 2 X 4 X 5 X 2 X 4 X 5 X 2 X 4 X 5 A 5 A 6 A 5 X 6 A 5 Pr(A 3 X 6 A 5 ) X 8 Pr(X 8 ) X 2 X 4 X 5 X 6 A 4 A 5 X 2 X 3 Pr(X 2 ) Pr(X 3 ) A 2 A 3 A 4 X 7 X 8 A 3 A 4 X 7 X 8 A 1 A 3 X 7 Pr(A 1 X 7 A 3 ) A 3 A 4 A 5 X 6 X 8 A 2 A 3 X 7 A 1 A 2 A 3 X 7 A 1 A 2 T A 1 A 2 A 4 A 5 X 6 X 8 Pr(T A 1,A 2 ) A 4 A 5 X 6 Pr(A 4 X 2 X 4 X 5 ) Fgure 2. A Power Dstrbuto System Descrbed Dfferet Topologes (a) A fault tree for a power dstrbuto system; (b) Equvalet Bayesa etwork; (c) Jotree extracted from Bayesa etwork wth each CPT assged to ther famly clusters, takg the cluster {T,A 1,A 2 } as root, sold arrows dcate the drecto of ward calculato ad dotted arrows dcate the drecto of outward calculato. (c) X 2 X 4 A 4 A 5 Bottom evets Table 2. Results of Case 2 Old Bayesa etwork method New Bayesa etwork method Copyrght c 2015 SERSC 285
10 X X X X X X X X Number of ferece 8 tmes 2 tmes 5. Coclusos O the bass of the exstet exact methods for solvg bottom evet s structural mportace degree cludg the tradtoal FTA method ad the Bayesa etwork method rased by Zhou Zhogbao, combg wth Bayesa etwork s ferece characterstcs, a ew exact method for solvg such a dex together wth the correspodg algorthm SID_Jotree s rased ad proved to be correct a mathematcal way. Two cases are used to llustrate the ew Bayesa etwork method whch a Jotree ca be used effectvely. Both practce ad theory show that, as the bottom evets umber creases, oly two tmes computato s requred usg the ew method stead of tmes computato usg the exstet old method. As creases, the ew method s more effectve, whch s a feasble way to compute each bottom evet s structural mportace degree exactly ad ca be a useful assstat aalyzg a system s relablty. Refereces [1] L. Portale ad A. Bobbo, Bayesa etworks for depedablty aalyss: a applcato to dgtal cotrol relablty, I Proceedgs of the ffteeth coferece o ucertaty artfcal tellgece, Morga Kaufma Publshers Ic., (1999), July, pp [2] H. Lagseth ad L. Portale, Bayesa etworks relablty, Relablty Egeerg & System Safety, vol. 92, o. 1, (2007), pp [3] N. Khakzad, F. Kha ad P. Amyotte, Safety aalyss process facltes: Comparso of fault tree ad Bayesa etwork approaches, Relablty Egeerg & System Safety, vol. 96, o. 8, (2011), pp [4] Y. Xaowe, Q. Wexue ad X. Lyag, A Method for System Relablty Assessmet Based o Bayesa Networks [J], Acta Aeroautca Et Astroautca Sca, vol. 6, o. 013, ( Chese), (2008). [5] G. Wedl, A. L. Madse ad S. Israelso, Applcatos of object-oreted Bayesa etworks for codto motorg, root cause aalyss ad decso support o operato of complex cotuous processes, Computers & chemcal egeerg, vol. 29, o. 9, (2005), pp [6] Z. Zhogbao, D. Doudou ad Z. Jglu, Applcato of Bayesa Networks Relablty Aalyss [J], Systems Egeerg-Theory & Practce, vol. 6, (2006), pp ( Chese). [7] A. Darwche, Modelg ad reasog wth Bayesa etworks, New York: Cambrdge Uversty Press, (2012). [8] Z. Lawe ad G. Hapeg, A Itroducto to Bayesa Networks, Bejg: Scece Press ( Chese), (2006). [9] P. P. Sheoy, Bary jo trees for computg margals the Sheoy-Shafer archtecture, Iteratoal Joural of approxmate reasog, vol. 17, o. 2, (1997), pp [10] K. Lgasubramaa, S. M. Alam ad S. Bhaja, Maxmum error modelg for fault-tolerat computato usg maxmum a posteror (MAP) hypothess, Mcroelectrocs Relablty, vol. 51, o. 2, (2011), pp [11] D. Qog, Safety system egeerg, X a: Northwest Idustral Uversty press ( Chese), (2009). [12] S. Mahadeva, R. Zhag ad N. Smth, Bayesa etworks for system relablty reassessmet, Structural Safety, vol. 23, o. 3, (2001), pp Copyrght c 2015 SERSC
11 [13] E. Castllo, C. Solares ad P. Gómez, Estmatg extreme probabltes usg tal smulated data, Iteratoal Joural of Approxmate Reasog, vol. 17, o. 2, (1997), pp Authors Wag Yao, She receved her B.Eg. Arcraft Desg ad Egeerg (2011) ad s curretly dog a doctorate Arcraft Desg at School of Aeroautcs, Northwester Polytechcal Uversty as a full-tme studet (Sce 2011). Her curret research terests clude the Arcraft system relablty assessmet ad fault dagoss. Su Q, He receved hs PhD Arcraft Desg from Northwester Polytechcal Uversty. Now he s full professor of Arcraft Desg at School of Aeroautcs, Northwester Polytechcal Uversty. He s the charma of the structure desg ad stregth of Cha avato commttee. He has publshed a total of more tha 100 academc papers (10/SCI, 50/EI, 20/ISTP). Hs curret research terests clude the arcraft structural desg, arcraft system desg ad relablty evaluato. Copyrght c 2015 SERSC 287
12 288 Copyrght c 2015 SERSC
Maintenance Scheduling of Distribution System with Optimal Economy and Reliability
Egeerg, 203, 5, 4-8 http://dx.do.org/0.4236/eg.203.59b003 Publshed Ole September 203 (http://www.scrp.org/joural/eg) Mateace Schedulg of Dstrbuto System wth Optmal Ecoomy ad Relablty Syua Hog, Hafeg L,
More informationAPPENDIX III THE ENVELOPE PROPERTY
Apped III APPENDIX III THE ENVELOPE PROPERTY Optmzato mposes a very strog structure o the problem cosdered Ths s the reaso why eoclasscal ecoomcs whch assumes optmzg behavour has bee the most successful
More informationFractal-Structured Karatsuba`s Algorithm for Binary Field Multiplication: FK
Fractal-Structured Karatsuba`s Algorthm for Bary Feld Multplcato: FK *The authors are worg at the Isttute of Mathematcs The Academy of Sceces of DPR Korea. **Address : U Jog dstrct Kwahadog Number Pyogyag
More informationNumerical Methods with MS Excel
TMME, vol4, o.1, p.84 Numercal Methods wth MS Excel M. El-Gebely & B. Yushau 1 Departmet of Mathematcal Sceces Kg Fahd Uversty of Petroleum & Merals. Dhahra, Saud Araba. Abstract: I ths ote we show how
More informationGreen Master based on MapReduce Cluster
Gree Master based o MapReduce Cluster Mg-Zh Wu, Yu-Chag L, We-Tsog Lee, Yu-Su L, Fog-Hao Lu Dept of Electrcal Egeerg Tamkag Uversty, Tawa, ROC Dept of Electrcal Egeerg Tamkag Uversty, Tawa, ROC Dept of
More informationOptimal multi-degree reduction of Bézier curves with constraints of endpoints continuity
Computer Aded Geometrc Desg 19 (2002 365 377 wwwelsevercom/locate/comad Optmal mult-degree reducto of Bézer curves wth costrats of edpots cotuty Guo-Dog Che, Guo-J Wag State Key Laboratory of CAD&CG, Isttute
More information1. The Time Value of Money
Corporate Face [00-0345]. The Tme Value of Moey. Compoudg ad Dscoutg Captalzato (compoudg, fdg future values) s a process of movg a value forward tme. It yelds the future value gve the relevat compoudg
More informationIDENTIFICATION OF THE DYNAMICS OF THE GOOGLE S RANKING ALGORITHM. A. Khaki Sedigh, Mehdi Roudaki
IDENIFICAION OF HE DYNAMICS OF HE GOOGLE S RANKING ALGORIHM A. Khak Sedgh, Mehd Roudak Cotrol Dvso, Departmet of Electrcal Egeerg, K.N.oos Uversty of echology P. O. Box: 16315-1355, ehra, Ira sedgh@eetd.ktu.ac.r,
More information6.7 Network analysis. 6.7.1 Introduction. References - Network analysis. Topological analysis
6.7 Network aalyss Le data that explctly store topologcal formato are called etwork data. Besdes spatal operatos, several methods of spatal aalyss are applcable to etwork data. Fgure: Network data Refereces
More informationSTATISTICAL PROPERTIES OF LEAST SQUARES ESTIMATORS. x, where. = y - ˆ " 1
STATISTICAL PROPERTIES OF LEAST SQUARES ESTIMATORS Recall Assumpto E(Y x) η 0 + η x (lear codtoal mea fucto) Data (x, y ), (x 2, y 2 ),, (x, y ) Least squares estmator ˆ E (Y x) ˆ " 0 + ˆ " x, where ˆ
More informationSecurity Analysis of RAPP: An RFID Authentication Protocol based on Permutation
Securty Aalyss of RAPP: A RFID Authetcato Protocol based o Permutato Wag Shao-hu,,, Ha Zhje,, Lu Sujua,, Che Da-we, {College of Computer, Najg Uversty of Posts ad Telecommucatos, Najg 004, Cha Jagsu Hgh
More informationStudy on prediction of network security situation based on fuzzy neutral network
Avalable ole www.ocpr.com Joural of Chemcal ad Pharmaceutcal Research, 04, 6(6):00-06 Research Artcle ISS : 0975-7384 CODE(USA) : JCPRC5 Study o predcto of etwork securty stuato based o fuzzy eutral etwork
More informationBanking (Early Repayment of Housing Loans) Order, 5762 2002 1
akg (Early Repaymet of Housg Loas) Order, 5762 2002 y vrtue of the power vested me uder Secto 3 of the akg Ordace 94 (hereafter, the Ordace ), followg cosultato wth the Commttee, ad wth the approval of
More informationSHAPIRO-WILK TEST FOR NORMALITY WITH KNOWN MEAN
SHAPIRO-WILK TEST FOR NORMALITY WITH KNOWN MEAN Wojcech Zelńsk Departmet of Ecoometrcs ad Statstcs Warsaw Uversty of Lfe Sceces Nowoursyowska 66, -787 Warszawa e-mal: wojtekzelsk@statystykafo Zofa Hausz,
More informationIP Network Topology Link Prediction Based on Improved Local Information Similarity Algorithm
Iteratoal Joural of Grd Dstrbuto Computg, pp.141-150 http://dx.do.org/10.14257/jgdc.2015.8.6.14 IP Network Topology Lk Predcto Based o Improved Local Iformato mlarty Algorthm Che Yu* 1, 2 ad Dua Zhem 1
More informationApplications of Support Vector Machine Based on Boolean Kernel to Spam Filtering
Moder Appled Scece October, 2009 Applcatos of Support Vector Mache Based o Boolea Kerel to Spam Flterg Shugag Lu & Keb Cu School of Computer scece ad techology, North Cha Electrc Power Uversty Hebe 071003,
More informationT = 1/freq, T = 2/freq, T = i/freq, T = n (number of cash flows = freq n) are :
Bullets bods Let s descrbe frst a fxed rate bod wthout amortzg a more geeral way : Let s ote : C the aual fxed rate t s a percetage N the otoal freq ( 2 4 ) the umber of coupo per year R the redempto of
More informationAn Approach to Evaluating the Computer Network Security with Hesitant Fuzzy Information
A Approach to Evaluatg the Computer Network Securty wth Hestat Fuzzy Iformato Jafeg Dog A Approach to Evaluatg the Computer Network Securty wth Hestat Fuzzy Iformato Jafeg Dog, Frst ad Correspodg Author
More informationA Study of Unrelated Parallel-Machine Scheduling with Deteriorating Maintenance Activities to Minimize the Total Completion Time
Joural of Na Ka, Vol. 0, No., pp.5-9 (20) 5 A Study of Urelated Parallel-Mache Schedulg wth Deteroratg Mateace Actvtes to Mze the Total Copleto Te Suh-Jeq Yag, Ja-Yuar Guo, Hs-Tao Lee Departet of Idustral
More informationECONOMIC CHOICE OF OPTIMUM FEEDER CABLE CONSIDERING RISK ANALYSIS. University of Brasilia (UnB) and The Brazilian Regulatory Agency (ANEEL), Brazil
ECONOMIC CHOICE OF OPTIMUM FEEDER CABE CONSIDERING RISK ANAYSIS I Camargo, F Fgueredo, M De Olvera Uversty of Brasla (UB) ad The Brazla Regulatory Agecy (ANEE), Brazl The choce of the approprate cable
More informationAgent-based modeling and simulation of multiproject
Aget-based modelg ad smulato of multproject schedulg José Alberto Araúzo, Javer Pajares, Adolfo Lopez- Paredes Socal Systems Egeerg Cetre (INSISOC) Uversty of Valladold Valladold (Spa) {arauzo,pajares,adolfo}ssoc.es
More informationChapter 3. AMORTIZATION OF LOAN. SINKING FUNDS R =
Chapter 3. AMORTIZATION OF LOAN. SINKING FUNDS Objectves of the Topc: Beg able to formalse ad solve practcal ad mathematcal problems, whch the subjects of loa amortsato ad maagemet of cumulatve fuds are
More informationFault Tree Analysis of Software Reliability Allocation
Fault Tree Aalyss of Software Relablty Allocato Jawe XIANG, Kokch FUTATSUGI School of Iformato Scece, Japa Advaced Isttute of Scece ad Techology - Asahda, Tatsuokuch, Ishkawa, 92-292 Japa ad Yaxag HE Computer
More informationClassic Problems at a Glance using the TVM Solver
C H A P T E R 2 Classc Problems at a Glace usg the TVM Solver The table below llustrates the most commo types of classc face problems. The formulas are gve for each calculato. A bref troducto to usg the
More informationPreprocess a planar map S. Given a query point p, report the face of S containing p. Goal: O(n)-size data structure that enables O(log n) query time.
Computatoal Geometry Chapter 6 Pot Locato 1 Problem Defto Preprocess a plaar map S. Gve a query pot p, report the face of S cotag p. S Goal: O()-sze data structure that eables O(log ) query tme. C p E
More informationSoftware Reliability Index Reasonable Allocation Based on UML
Sotware Relablty Idex Reasoable Allocato Based o UML esheg Hu, M.Zhao, Jaeg Yag, Guorog Ja Sotware Relablty Idex Reasoable Allocato Based o UML 1 esheg Hu, 2 M.Zhao, 3 Jaeg Yag, 4 Guorog Ja 1, Frst Author
More informationStatistical Pattern Recognition (CE-725) Department of Computer Engineering Sharif University of Technology
I The Name of God, The Compassoate, The ercful Name: Problems' eys Studet ID#:. Statstcal Patter Recogto (CE-725) Departmet of Computer Egeerg Sharf Uversty of Techology Fal Exam Soluto - Sprg 202 (50
More informationChapter Eight. f : R R
Chapter Eght f : R R 8. Itroducto We shall ow tur our atteto to the very mportat specal case of fuctos that are real, or scalar, valued. These are sometmes called scalar felds. I the very, but mportat,
More informationThe analysis of annuities relies on the formula for geometric sums: r k = rn+1 1 r 1. (2.1) k=0
Chapter 2 Autes ad loas A auty s a sequece of paymets wth fxed frequecy. The term auty orgally referred to aual paymets (hece the ame), but t s ow also used for paymets wth ay frequecy. Autes appear may
More informationWeb Service Composition Optimization Based on Improved Artificial Bee Colony Algorithm
JOURNAL OF NETWORKS, VOL. 8, NO. 9, SEPTEMBER 2013 2143 Web Servce Composto Optmzato Based o Improved Artfcal Bee Coloy Algorthm Ju He The key laboratory, The Academy of Equpmet, Beg, Cha Emal: heu0123@sa.com
More informationOnline Appendix: Measured Aggregate Gains from International Trade
Ole Appedx: Measured Aggregate Gas from Iteratoal Trade Arel Burste UCLA ad NBER Javer Cravo Uversty of Mchga March 3, 2014 I ths ole appedx we derve addtoal results dscussed the paper. I the frst secto,
More informationA Parallel Transmission Remote Backup System
2012 2d Iteratoal Coferece o Idustral Techology ad Maagemet (ICITM 2012) IPCSIT vol 49 (2012) (2012) IACSIT Press, Sgapore DOI: 107763/IPCSIT2012V495 2 A Parallel Trasmsso Remote Backup System Che Yu College
More informationAbraham Zaks. Technion I.I.T. Haifa ISRAEL. and. University of Haifa, Haifa ISRAEL. Abstract
Preset Value of Autes Uder Radom Rates of Iterest By Abraham Zas Techo I.I.T. Hafa ISRAEL ad Uversty of Hafa, Hafa ISRAEL Abstract Some attempts were made to evaluate the future value (FV) of the expected
More informationThe Gompertz-Makeham distribution. Fredrik Norström. Supervisor: Yuri Belyaev
The Gompertz-Makeham dstrbuto by Fredrk Norström Master s thess Mathematcal Statstcs, Umeå Uversty, 997 Supervsor: Yur Belyaev Abstract Ths work s about the Gompertz-Makeham dstrbuto. The dstrbuto has
More informationANOVA Notes Page 1. Analysis of Variance for a One-Way Classification of Data
ANOVA Notes Page Aalss of Varace for a Oe-Wa Classfcato of Data Cosder a sgle factor or treatmet doe at levels (e, there are,, 3, dfferet varatos o the prescrbed treatmet) Wth a gve treatmet level there
More informationBayesian Network Representation
Readgs: K&F 3., 3.2, 3.3, 3.4. Bayesa Network Represetato Lecture 2 Mar 30, 20 CSE 55, Statstcal Methods, Sprg 20 Istructor: Su-I Lee Uversty of Washgto, Seattle Last tme & today Last tme Probablty theory
More informationAnalysis of one-dimensional consolidation of soft soils with non-darcian flow caused by non-newtonian liquid
Joural of Rock Mechacs ad Geotechcal Egeerg., 4 (3): 5 57 Aalyss of oe-dmesoal cosoldato of soft sols wth o-darca flow caused by o-newtoa lqud Kaghe Xe, Chuaxu L, *, Xgwag Lu 3, Yul Wag Isttute of Geotechcal
More informationThe Analysis of Development of Insurance Contract Premiums of General Liability Insurance in the Business Insurance Risk
The Aalyss of Developmet of Isurace Cotract Premums of Geeral Lablty Isurace the Busess Isurace Rsk the Frame of the Czech Isurace Market 1998 011 Scetfc Coferece Jue, 10. - 14. 013 Pavla Kubová Departmet
More informationUsing Phase Swapping to Solve Load Phase Balancing by ADSCHNN in LV Distribution Network
Iteratoal Joural of Cotrol ad Automato Vol.7, No.7 (204), pp.-4 http://dx.do.org/0.4257/jca.204.7.7.0 Usg Phase Swappg to Solve Load Phase Balacg by ADSCHNN LV Dstrbuto Network Chu-guo Fe ad Ru Wag College
More informationADAPTATION OF SHAPIRO-WILK TEST TO THE CASE OF KNOWN MEAN
Colloquum Bometrcum 4 ADAPTATION OF SHAPIRO-WILK TEST TO THE CASE OF KNOWN MEAN Zofa Hausz, Joaa Tarasńska Departmet of Appled Mathematcs ad Computer Scece Uversty of Lfe Sceces Lubl Akademcka 3, -95 Lubl
More informationDynamic Two-phase Truncated Rayleigh Model for Release Date Prediction of Software
J. Software Egeerg & Applcatos 3 63-69 do:.436/jsea..367 Publshed Ole Jue (http://www.scrp.org/joural/jsea) Dyamc Two-phase Trucated Raylegh Model for Release Date Predcto of Software Lafe Qa Qgchua Yao
More informationThe Digital Signature Scheme MQQ-SIG
The Dgtal Sgature Scheme MQQ-SIG Itellectual Property Statemet ad Techcal Descrpto Frst publshed: 10 October 2010, Last update: 20 December 2010 Dalo Glgorosk 1 ad Rue Stesmo Ødegård 2 ad Rue Erled Jese
More informationAn Effectiveness of Integrated Portfolio in Bancassurance
A Effectveess of Itegrated Portfolo Bacassurace Taea Karya Research Ceter for Facal Egeerg Isttute of Ecoomc Research Kyoto versty Sayouu Kyoto 606-850 Japa arya@eryoto-uacp Itroducto As s well ow the
More informationCHAPTER 2. Time Value of Money 6-1
CHAPTER 2 Tme Value of Moey 6- Tme Value of Moey (TVM) Tme Les Future value & Preset value Rates of retur Autes & Perpetutes Ueve cash Flow Streams Amortzato 6-2 Tme les 0 2 3 % CF 0 CF CF 2 CF 3 Show
More informationLoad Balancing Algorithm based Virtual Machine Dynamic Migration Scheme for Datacenter Application with Optical Networks
0 7th Iteratoal ICST Coferece o Commucatos ad Networkg Cha (CHINACOM) Load Balacg Algorthm based Vrtual Mache Dyamc Mgrato Scheme for Dataceter Applcato wth Optcal Networks Xyu Zhag, Yogl Zhao, X Su, Ruyg
More informationRUSSIAN ROULETTE AND PARTICLE SPLITTING
RUSSAN ROULETTE AND PARTCLE SPLTTNG M. Ragheb 3/7/203 NTRODUCTON To stuatos are ecoutered partcle trasport smulatos:. a multplyg medum, a partcle such as a eutro a cosmc ray partcle or a photo may geerate
More informationAutomated Event Registration System in Corporation
teratoal Joural of Advaces Computer Scece ad Techology JACST), Vol., No., Pages : 0-0 0) Specal ssue of CACST 0 - Held durg 09-0 May, 0 Malaysa Automated Evet Regstrato System Corporato Zafer Al-Makhadmee
More informationResearch on Cloud Computing and Its Application in Big Data Processing of Railway Passenger Flow
325 A publcato of CHEMICAL ENGINEERING TRANSACTIONS VOL. 46, 2015 Guest Edtors: Peyu Re, Yacag L, Hupg Sog Copyrght 2015, AIDIC Servz S.r.l., ISBN 978-88-95608-37-2; ISSN 2283-9216 The Itala Assocato of
More informationThe impact of service-oriented architecture on the scheduling algorithm in cloud computing
Iteratoal Research Joural of Appled ad Basc Sceces 2015 Avalable ole at www.rjabs.com ISSN 2251-838X / Vol, 9 (3): 387-392 Scece Explorer Publcatos The mpact of servce-oreted archtecture o the schedulg
More informationRESEARCH ON PERFORMANCE MODELING OF TRANSACTIONAL CLOUD APPLICATIONS
Joural of Theoretcal ad Appled Iformato Techology 3 st October 22. Vol. 44 No.2 25-22 JATIT & LLS. All rghts reserved. ISSN: 992-8645 www.jatt.org E-ISSN: 87-395 RESEARCH ON PERFORMANCE MODELING OF TRANSACTIONAL
More information10.5 Future Value and Present Value of a General Annuity Due
Chapter 10 Autes 371 5. Thomas leases a car worth $4,000 at.99% compouded mothly. He agrees to make 36 lease paymets of $330 each at the begg of every moth. What s the buyout prce (resdual value of the
More informationAverage Price Ratios
Average Prce Ratos Morgstar Methodology Paper August 3, 2005 2005 Morgstar, Ic. All rghts reserved. The formato ths documet s the property of Morgstar, Ic. Reproducto or trascrpto by ay meas, whole or
More informationCredibility Premium Calculation in Motor Third-Party Liability Insurance
Advaces Mathematcal ad Computatoal Methods Credblty remum Calculato Motor Thrd-arty Lablty Isurace BOHA LIA, JAA KUBAOVÁ epartmet of Mathematcs ad Quattatve Methods Uversty of ardubce Studetská 95, 53
More informationOptimal replacement and overhaul decisions with imperfect maintenance and warranty contracts
Optmal replacemet ad overhaul decsos wth mperfect mateace ad warraty cotracts R. Pascual Departmet of Mechacal Egeerg, Uversdad de Chle, Caslla 2777, Satago, Chle Phoe: +56-2-6784591 Fax:+56-2-689657 rpascual@g.uchle.cl
More informationCyber Journals: Multidisciplinary Journals in Science and Technology, Journal of Selected Areas in Telecommunications (JSAT), January Edition, 2011
Cyber Jourals: Multdscplary Jourals cece ad Techology, Joural of elected Areas Telecommucatos (JAT), Jauary dto, 2011 A ovel rtual etwork Mappg Algorthm for Cost Mmzg ZHAG hu-l, QIU Xue-sog tate Key Laboratory
More informationCompressive Sensing over Strongly Connected Digraph and Its Application in Traffic Monitoring
Compressve Sesg over Strogly Coected Dgraph ad Its Applcato Traffc Motorg Xao Q, Yogca Wag, Yuexua Wag, Lwe Xu Isttute for Iterdscplary Iformato Sceces, Tsghua Uversty, Bejg, Cha {qxao3, kyo.c}@gmal.com,
More informationof the relationship between time and the value of money.
TIME AND THE VALUE OF MONEY Most agrbusess maagers are famlar wth the terms compoudg, dscoutg, auty, ad captalzato. That s, most agrbusess maagers have a tutve uderstadg that each term mples some relatoshp
More informationIntegrating Production Scheduling and Maintenance: Practical Implications
Proceedgs of the 2012 Iteratoal Coferece o Idustral Egeerg ad Operatos Maagemet Istabul, Turkey, uly 3 6, 2012 Itegratg Producto Schedulg ad Mateace: Practcal Implcatos Lath A. Hadd ad Umar M. Al-Turk
More informationResearch on the Evaluation of Information Security Management under Intuitionisitc Fuzzy Environment
Iteratoal Joural of Securty ad Its Applcatos, pp. 43-54 http://dx.do.org/10.14257/sa.2015.9.5.04 Research o the Evaluato of Iformato Securty Maagemet uder Itutostc Fuzzy Evromet LI Feg-Qua College of techology,
More informationProjection model for Computer Network Security Evaluation with interval-valued intuitionistic fuzzy information. Qingxiang Li
Iteratoal Joural of Scece Vol No7 05 ISSN: 83-4890 Proecto model for Computer Network Securty Evaluato wth terval-valued tutostc fuzzy formato Qgxag L School of Software Egeerg Chogqg Uversty of rts ad
More informationApproximation Algorithms for Scheduling with Rejection on Two Unrelated Parallel Machines
(ICS) Iteratoal oural of dvaced Comuter Scece ad lcatos Vol 6 No 05 romato lgorthms for Schedulg wth eecto o wo Urelated Parallel aches Feg Xahao Zhag Zega Ca College of Scece y Uversty y Shadog Cha 76005
More informationModels for Selecting an ERP System with Intuitionistic Trapezoidal Fuzzy Information
JOURNAL OF SOFWARE, VOL 5, NO 3, MARCH 00 75 Models for Selectg a ERP System wth Itutostc rapezodal Fuzzy Iformato Guwu We, Ru L Departmet of Ecoomcs ad Maagemet, Chogqg Uversty of Arts ad Sceces, Yogchua,
More informationAn IG-RS-SVM classifier for analyzing reviews of E-commerce product
Iteratoal Coferece o Iformato Techology ad Maagemet Iovato (ICITMI 205) A IG-RS-SVM classfer for aalyzg revews of E-commerce product Jaju Ye a, Hua Re b ad Hagxa Zhou c * College of Iformato Egeerg, Cha
More informationConstrained Cubic Spline Interpolation for Chemical Engineering Applications
Costraed Cubc Sple Iterpolato or Chemcal Egeerg Applcatos b CJC Kruger Summar Cubc sple terpolato s a useul techque to terpolate betwee kow data pots due to ts stable ad smooth characterstcs. Uortuatel
More informationNetwork dimensioning for elastic traffic based on flow-level QoS
Network dmesog for elastc traffc based o flow-level QoS 1(10) Network dmesog for elastc traffc based o flow-level QoS Pas Lassla ad Jorma Vrtamo Networkg Laboratory Helsk Uversty of Techology Itroducto
More informationDiscrete-Event Simulation of Network Systems Using Distributed Object Computing
Dscrete-Evet Smulato of Network Systems Usg Dstrbuted Object Computg Welog Hu Arzoa Ceter for Itegratve M&S Computer Scece & Egeerg Dept. Fulto School of Egeerg Arzoa State Uversty, Tempe, Arzoa, 85281-8809
More informationChapter 3 0.06 = 3000 ( 1.015 ( 1 ) Present Value of an Annuity. Section 4 Present Value of an Annuity; Amortization
Chapter 3 Mathematcs of Face Secto 4 Preset Value of a Auty; Amortzato Preset Value of a Auty I ths secto, we wll address the problem of determg the amout that should be deposted to a accout ow at a gve
More informationn. We know that the sum of squares of p independent standard normal variables has a chi square distribution with p degrees of freedom.
UMEÅ UNIVERSITET Matematsk-statstska sttutoe Multvarat dataaalys för tekologer MSTB0 PA TENTAMEN 004-0-9 LÖSNINGSFÖRSLAG TILL TENTAMEN I MATEMATISK STATISTIK Multvarat dataaalys för tekologer B, 5 poäg.
More informationFast, Secure Encryption for Indexing in a Column-Oriented DBMS
Fast, Secure Ecrypto for Idexg a Colum-Oreted DBMS Tgja Ge, Sta Zdok Brow Uversty {tge, sbz}@cs.brow.edu Abstract Networked formato systems requre strog securty guaratees because of the ew threats that
More informationDECISION MAKING WITH THE OWA OPERATOR IN SPORT MANAGEMENT
ESTYLF08, Cuecas Meras (Meres - Lagreo), 7-9 de Septembre de 2008 DECISION MAKING WITH THE OWA OPERATOR IN SPORT MANAGEMENT José M. Mergó Aa M. Gl-Lafuete Departmet of Busess Admstrato, Uversty of Barceloa
More informationA Single Machine Scheduling with Periodic Maintenance
A Sgle Mache Schedulg wth Perodc Mateace Fracsco Ágel-Bello Ada Álvarez 2 Joaquí Pacheco 3 Irs Martíez Ceter for Qualty ad Maufacturg, Tecológco de Moterrey, Eugeo Garza Sada 250, 64849 Moterrey, NL, Meco
More informationReport 52 Fixed Maturity EUR Industrial Bond Funds
Rep52, Computed & Prted: 17/06/2015 11:53 Report 52 Fxed Maturty EUR Idustral Bod Fuds From Dec 2008 to Dec 2014 31/12/2008 31 December 1999 31/12/2014 Bechmark Noe Defto of the frm ad geeral formato:
More informationMobile Agents in Telecommunications Networks A Simulative Approach to Load Balancing
Moble Agets Telecommucatos Networks A Smulatve Approach to Load Balacg Steffe Lpperts Departmet of Computer Scece (4), Uversty of Techology Aache Aache, 52056, Germay Ad Brgt Kreller Corporate Techology
More informationApplication of Grey Relational Analysis in Computer Communication
Applcato of Grey Relatoal Aalyss Computer Commucato Network Securty Evaluato Jgcha J Applcato of Grey Relatoal Aalyss Computer Commucato Network Securty Evaluato *1 Jgcha J *1, Frst ad Correspodg Author
More informationOn formula to compute primes and the n th prime
Joural's Ttle, Vol., 00, o., - O formula to compute prmes ad the th prme Issam Kaddoura Lebaese Iteratoal Uversty Faculty of Arts ad ceces, Lebao Emal: ssam.addoura@lu.edu.lb amh Abdul-Nab Lebaese Iteratoal
More informationNumerical Comparisons of Quality Control Charts for Variables
Global Vrtual Coferece Aprl, 8. - 2. 203 Nuercal Coparsos of Qualty Cotrol Charts for Varables J.F. Muñoz-Rosas, M.N. Pérez-Aróstegu Uversty of Graada Facultad de Cecas Ecoócas y Epresarales Graada, pa
More informationSettlement Prediction by Spatial-temporal Random Process
Safety, Relablty ad Rs of Structures, Ifrastructures ad Egeerg Systems Furuta, Fragopol & Shozua (eds Taylor & Fracs Group, Lodo, ISBN 978---77- Settlemet Predcto by Spatal-temporal Radom Process P. Rugbaapha
More informationANALYTICAL MODEL FOR TCP FILE TRANSFERS OVER UMTS. Janne Peisa Ericsson Research 02420 Jorvas, Finland. Michael Meyer Ericsson Research, Germany
ANALYTICAL MODEL FOR TCP FILE TRANSFERS OVER UMTS Jae Pesa Erco Research 4 Jorvas, Flad Mchael Meyer Erco Research, Germay Abstract Ths paper proposes a farly complex model to aalyze the performace of
More informationSpeeding up k-means Clustering by Bootstrap Averaging
Speedg up -meas Clusterg by Bootstrap Averagg Ia Davdso ad Ashw Satyaarayaa Computer Scece Dept, SUNY Albay, NY, USA,. {davdso, ashw}@cs.albay.edu Abstract K-meas clusterg s oe of the most popular clusterg
More informationFuzzy Task Assignment Model of Web Services Supplier in Collaborative Development Environment
, pp.199-210 http://dx.do.org/10.14257/uesst.2015.8.6.19 Fuzzy Task Assget Model of Web Servces Suppler Collaboratve Developet Evroet Su Ja 1,2, Peg Xu-ya 1, *, Xu Yg 1,3, Wag Pe-e 2 ad Ma Na- 4,2 1. College
More informationAN ALGORITHM ABOUT PARTNER SELECTION PROBLEM ON CLOUD SERVICE PROVIDER BASED ON GENETIC
Joural of Theoretcal ad Appled Iformato Techology 0 th Aprl 204. Vol. 62 No. 2005-204 JATIT & LLS. All rghts reserved. ISSN: 992-8645 www.jatt.org E-ISSN: 87-395 AN ALGORITHM ABOUT PARTNER SELECTION PROBLEM
More informationLoad Balancing Control for Parallel Systems
Proc IEEE Med Symposum o New drectos Cotrol ad Automato, Chaa (Grèce),994, pp66-73 Load Balacg Cotrol for Parallel Systems Jea-Claude Heet LAAS-CNRS, 7 aveue du Coloel Roche, 3077 Toulouse, Frace E-mal
More informationOn Error Detection with Block Codes
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 9, No 3 Sofa 2009 O Error Detecto wth Block Codes Rostza Doduekova Chalmers Uversty of Techology ad the Uversty of Gotheburg,
More informationAnySee: Peer-to-Peer Live Streaming
ysee: Peer-to-Peer Lve Streamg School of Computer Scece ad Techology Huazhog Uversty of Scece ad Techology Wuha, 40074, Cha {xflao, hj, dfdeg }@hust.edu.c Xaofe Lao, Ha J, *Yuhao Lu, *Loel M. N, ad afu
More informationAP Statistics 2006 Free-Response Questions Form B
AP Statstcs 006 Free-Respose Questos Form B The College Board: Coectg Studets to College Success The College Board s a ot-for-proft membershp assocato whose msso s to coect studets to college success ad
More informationAnalysis of Multi-product Break-even with Uncertain Information*
Aalyss o Mult-product Break-eve wth Ucerta Iormato* Lazzar Lusa L. - Morñgo María Slva Facultad de Cecas Ecoómcas Uversdad de Bueos Ares 222 Córdoba Ave. 2 d loor C20AAQ Bueos Ares - Argeta lazzar@eco.uba.ar
More informationCurve Fitting and Solution of Equation
UNIT V Curve Fttg ad Soluto of Equato 5. CURVE FITTING I ma braches of appled mathematcs ad egeerg sceces we come across epermets ad problems, whch volve two varables. For eample, t s kow that the speed
More informationLoad and Resistance Factor Design (LRFD)
53:134 Structural Desg II Load ad Resstace Factor Desg (LRFD) Specfcatos ad Buldg Codes: Structural steel desg of buldgs the US s prcpally based o the specfcatos of the Amerca Isttute of Steel Costructo
More informationImpact of Interference on the GPRS Multislot Link Level Performance
Impact of Iterferece o the GPRS Multslot Lk Level Performace Javer Gozalvez ad Joh Dulop Uversty of Strathclyde - Departmet of Electroc ad Electrcal Egeerg - George St - Glasgow G-XW- Scotlad Ph.: + 8
More informationRQM: A new rate-based active queue management algorithm
: A ew rate-based actve queue maagemet algorthm Jeff Edmods, Suprakash Datta, Patrck Dymod, Kashf Al Computer Scece ad Egeerg Departmet, York Uversty, Toroto, Caada Abstract I ths paper, we propose a ew
More informationConversion of Non-Linear Strength Envelopes into Generalized Hoek-Brown Envelopes
Covero of No-Lear Stregth Evelope to Geeralzed Hoek-Brow Evelope Itroducto The power curve crtero commoly ued lmt-equlbrum lope tablty aaly to defe a o-lear tregth evelope (relatohp betwee hear tre, τ,
More informationThe Time Value of Money
The Tme Value of Moey 1 Iversemet Optos Year: 1624 Property Traded: Mahatta Islad Prce : $24.00, FV of $24 @ 6%: FV = $24 (1+0.06) 388 = $158.08 bllo Opto 1 0 1 2 3 4 5 t ($519.37) 0 0 0 0 $1,000 Opto
More informationOptimal Packetization Interval for VoIP Applications Over IEEE 802.16 Networks
Optmal Packetzato Iterval for VoIP Applcatos Over IEEE 802.16 Networks Sheha Perera Harsha Srsea Krzysztof Pawlkowsk Departmet of Electrcal & Computer Egeerg Uversty of Caterbury New Zealad sheha@elec.caterbury.ac.z
More informationAn Evaluation of Naïve Bayesian Anti-Spam Filtering Techniques
Proceedgs of the 2007 IEEE Workshop o Iformato Assurace Uted tates Mltary Academy, West Pot, Y 20-22 Jue 2007 A Evaluato of aïve Bayesa At-pam Flterg Techques Vkas P. Deshpade, Robert F. Erbacher, ad Chrs
More informationA Novel Resource Pricing Mechanism based on Multi-Player Gaming Model in Cloud Environments
1574 JOURNAL OF SOFTWARE, VOL. 9, NO. 6, JUNE 2014 A Novel Resource Prcg Mechasm based o Mult-Player Gamg Model Cloud Evromets Tea Zhag, Peg Xao School of Computer ad Commucato, Hua Isttute of Egeerg,
More informationEfficient Traceback of DoS Attacks using Small Worlds in MANET
Effcet Traceback of DoS Attacks usg Small Worlds MANET Yog Km, Vshal Sakhla, Ahmed Helmy Departmet. of Electrcal Egeerg, Uversty of Souther Calfora, U.S.A {yogkm, sakhla, helmy}@ceg.usc.edu Abstract Moble
More informationA Smart Machine Vision System for PCB Inspection
A Smart Mache Vso System for PCB Ispecto Te Q Che, JaX Zhag, YouNg Zhou ad Y Lu Murphey Please address all correspodece to Departmet of Electrcal ad Computer Egeerg Uversty of Mchga - Dearbor, Dearbor,
More informationProbability Analysis for the Damage of Gravity Dam
Egeerg,, 3, 3-3 do:.436/eg..3436 Publshed Ole Aprl (http://www.scrp.org/oural/eg) Probablty Aalyss for the Damage of Gravty Dam Qag Xu, Jg L, Jayu Che, School of Cvl ad Hydraulc Eg., Dala Uversty of echology,
More informationOPTIMAL KNOWLEDGE FLOW ON THE INTERNET
İstabul Tcaret Üverstes Fe Blmler Dergs Yıl: 5 Sayı:0 Güz 006/ s. - OPTIMAL KNOWLEDGE FLOW ON THE INTERNET Bura ORDİN *, Urfat NURİYEV ** ABSTRACT The flow roblem ad the mmum sag tree roblem are both fudametal
More informationHow To Balance Load On A Weght-Based Metadata Server Cluster
WLBS: A Weght-based Metadata Server Cluster Load Balacg Strategy J-L Zhag, We Qa, Xag-Hua Xu *, Ja Wa, Yu-Yu Y, Yog-Ja Re School of Computer Scece ad Techology Hagzhou Daz Uversty, Cha * Correspodg author:xhxu@hdu.edu.c
More information