Multiplication Algorithms for Radix-2 RN-Codings and Two s Complement Numbers

Save this PDF as:
 WORD  PNG  TXT  JPG

Size: px
Start display at page:

Download "Multiplication Algorithms for Radix-2 RN-Codings and Two s Complement Numbers"

Transcription

1 Multplcaton Algorthms for Radx- RN-Codngs and Two s Complement Numbers Jean-Luc Beuchat Projet Arénare, LIP, ENS Lyon 46, Allée d Itale F Lyon Cedex 07 Jean-Mchel Muller Projet Arénare, LIP, ENS Lyon 46, Allée d Itale F Lyon Cedex 07 Abstract The RN-codngs, where RN stands for Round to Nearest, are partcular cases of sgned-dgt representatons, for whch roundng to nearest s always dentcal to truncaton. In radx, Booth recodng s an RN-codng. In ths paper, we suggest several multplcaton algorthms able to handle RN-codngs, and we analyze ther propertes.. Introducton Kornerup and Muller recently ntroduced the noton of RN-codng [7], where RN stands for Round to Nearest. An RN-codng s a radx-β sgned-dgt representaton for whch truncatng s always equvalent to roundng to nearest. For example, n radx 0, the RN-codng of π starts wth where (as usually) 4 means 4. An nterestng property of these recodngs s that when we use them, there s no phenomenon of double roundng. In ths paper, we wsh to present some arthmetc operators for these RN codngs. More precsely, our goal s to add the smallest amount of hardware to a standard arthmetc and logc unt (ALU) so that t can effcently handle both two s complement numbers and RN-codngs. Before gong further, let us gve some defntons. Defnton. Let X be a radx-β number. We defne n (X) as X rounded to the nearest n-dgt radx-β number. Example. Consder the radx-0 number X = We have 8 (X) =.9345, 6 (X) =.935, 4 (X) =.9, and 3 (X) =.3. Defnton (RN-codngs [7]). Let β be an nteger greater than or equal to. The dgt sequence D = d n d n d n d n 3...d 0.d d...(wth β + d β ) s a radx-β RN-codng of X f X = j d β βj for any j. = n = d β and Theorem (Characterzatons of RN-codngs [7]). Let β be an nteger greater than or equal to. If β s odd, then D = d n d n d n d n 3...d 0.d d... s an RNcodng f and only f all dgts have absolute value less than or equal to (β )/. If β s even then D = d n d n d n d n 3...d 0.d d... s an RN-codng f and only f. all dgts have absolute value less than or equal to β/;. f d = β/, then the frst non-zero dgt that follows on the rght has an opposte sgn, that s, the largest j<such that d j 0satsfes d d j < 0. Example. The well-known Booth recodng [4] s a radx- RN-codng. Each number s wrtten on the dgt set {, 0, } and the rghtmost non-zero dgt s. Each number has therefore a sngle fnte representaton [7]. Algorthm summarzes the converson of a two s complement number, where each output dgt s deduced from a constant-szed sldng wndow of nput dgts. Consder the (n +)-bt two s complement number X = n = (00...0). Algorthm returns the (n +)-dgt number Y = n n =( 0...0), whereas the n-dgt number Z = n = (0...0) s also an RN-codng of X. If the (n +)-bt numbers we have to convert belong to the set { n,..., n }, t s therefore preferable to apply Algorthm, whch guarantees that the result s an n-dgt RN-codng [3]. In the followng, we wll represent a radx- RN-codng X wth a modfed borrow-save encodng []. We defne /05 $ IEEE

2 Algorthm Booth recodng of a two s complement number. Requre: An (n + )-bt two s complement number X { n,..., n } wth x =0 Ensure: An (n +)-dgt radx- RN-codng Y such that X = Y : for =0to n do : y x x ; 3: end for Algorthm Two s complement to radx- RN-codng converson. Requre: An (n + )-bt two s complement number X { n,..., n } wth x =0 Ensure: An n-dgt radx- RN-codng Y such that X = Y : for =0to n do : y x x ; 3: end for 4: y n x n(x n x n ) x nx n x n ; two bt-strngs X + and X such that { X = X + X, f x ± =then x =0. Ths paper devoted to the multplcaton of radx- RNcodngs s organzed as follows: Secton descrbes an mprovement of a multplcaton algorthm we have ntroduced prevously. Its major drawback s that t does not share many common resources wth a conventonal multpler. In Secton 3, we show how to very slghtly adapt a conventonal multpler so that t can also handle RN-codngs. Note that an extended verson ncludng proofs of propertes and algorthms s avalable as LIP Research Report [].. Improvement of the Multplcaton Algorthm Proposed n [3] Our frst multplcaton algorthm, publshed n [3], conssts n computng XY = X + Y + + X Y X + Y X Y + n two s complement and n convertng the result to radx- RN-codng. Accordng to Defnton and Equaton (), nether X + nor X contan a strng of ones whose length s greater than one (.e. f x ± =,thenx ± + = x ± = 0). Ths property reduces the number of partal products nvolved n the computaton of X + Y +, X Y, X + Y, and X Y + by half at the prce of OR gates (Fgure a). Fgure a depcts the archtecture of the multpler proposed n [3]. Four Partal Product Generators (PPGs) takng advantage of the above-mentoned property and four carry-save adder trees compute n parallel X + Y +, X Y, X + Y, and X Y +. Then, two adders based on (4, )- compressors and a subtracter generate the carry-save form of the product P = XY. The last step conssts n () convertng ths ntermedate result to radx- RN-codng. Snce the maxmal absolute value of an n-dgt radx- RN-codng X s n [3], the product XY belongs to { n,..., n }. We use a fast adder to compute the two s complement representaton of P and apply Algorthm to generate a (n )-dgt radx- RN-codng. Consder now the addton of X + Y + and X Y. The algorthm descrbed n [3] computes (x + 0 y+ + x+ y+ 0 )+ (x 0 y + x y 0 )=(x+ 0 y+ x+ y+ 0 )+(x 0 y x y 0 ) wth carry-save adders. Ths addton generates a carry ff x + 0 = y+ = x = y 0 =or x+ = y+ 0 = x 0 = y =. In both cases, the defnton of the radx- RN-codng guarantees that (x + 0 y+ +x+ y+ )+(x 0 y +x y )=0. Consequently, the jth partal products of X + Y + and X Y can be added wthout carry propagaton (Fgure b). In the followng, we respectvely denote the carry bt and the sum bt of (x + y+ j +x+ + y+ j )+(x y j +x + y j ) by ψ(, j) and ϕ(, j). Applyng ths notaton to our example, we obtan: (x + 0 y+ + x+ y+ 0 )+(x 0 y + x y 0 )=ψ(0, ) + ϕ(0, ), (x + 0 y+ + x+ y+ )+(x 0 y + x y )=ψ(0, ) + ϕ(0, ), and ψ(0, ) + ϕ(0, ) = ψ(0, ) ϕ(0, ). The mprovement proposed here s based on such propertes: nstead of addng X + Y + to X Y, we combne ther respectve partal products n order to compute (X + Y + +X Y ) wth a sngle n/ -operand carry-save adder. Theorem, and Algorthm 3 descrbe more precsely ths partal product generaton process. Compared to the scheme descrbed n [3], our new approach only requres half-adder () cells and OR gates, thus addng an XOR gate and an OR gate n the crtcal path. Theorem. Let X and Y be two radx- RN-codngs. Consder two functons ϕ(, j) and ψ(, j) defned as follows: ϕ(, j) =(x + y+ j x+ + y+ j ) (x y j x + y j ) () and ψ(, j) = (x + y+ j x+ + y+ j ) (x y j x + y j ) = x + y+ j x + y j x y j x+ + y+ j, (3) where j n and + j<n. Then, x + y+ j + x y j = x+ y+ j x y j, (4) x + y+ j + x y j + ψ(,j) = x + y+ j x y j ψ(,j), (5) x + y+ j + x+ + y+ j + x y j + x + y j =ψ(, j)+ϕ(, j) {0,, }, (6) ϕ(, j)+ψ(, j ) = ϕ(, j) ψ(, j ), (7) ϕ(, j)+ψ(,j)=ϕ(, j) ψ(,j). (8) /05 $ IEEE

3 x y + x + y x + y + x + y + x y x y x + y + x + y + 0 x y x 0 y x + y + x + y x y x 0 y 0 x 0 y + 0 x + 0 y 0 x + y + x x + y + x + y + y + x x y x y + + x y x y + y ψ (, ) ψ (0, ) ψ (0, ) ϕ (, ) ϕ (0, ) ϕ (0, ) (a) (4) (3) () (b) () (0) Fgure. (a) Computaton of X + Y + when n =3. (b) Computaton of X + Y + + X Y when n =3. Partal Product Generator Carry save adder tree (4,) compressors X + Y + X Y X + Y X Y + PPG PPG PPG PPG X + Y + Carry save adder X + Y + + X Y X Y Carry save subtracter X + Y X Y + n Carry save adder X + Y + X Y + partals products Carry save X + Y + + X + Y + X Y X + Y X Y + X Y PPG X + Y + X Y + Carry save subtracter PPG Carry save Two s complement to RN codng Two s complement Two s complement to RN codng Two s complement XY (RN codng) (a) XY (RN codng) (b) Fgure. Multplcaton of two RN-codngs. (a) Archtecture of the multpler descrbed n [3]. (b) Proposed mprovement. Example 3. Let us consder two 3-dgt RN-codngs X and Y. We could compute the sum of the sx partal products x + Y + and x Y, 0, by means of a carrysave adder tree. In ths example, Theorem allows to defne a sngle partal product (Fgure b), whose bt of weght j s denoted by λ (j) 0, 0 j 4. Accordng to Equaton (4), we replace an addton by an OR gate: λ (0) 0 = x + 0 y+ 0 x 0 y 0. Snce the computaton of λ (0) 0 does not generate a carry, we have λ () 0 = (x + 0 y+ + x+ y+ 0 + x 0 y + ) mod = ϕ(0, ) (Equaton (6). x y 0 We then apply twce Equaton (6) to compute ϕ(0, ), ψ(0, ), ϕ(, ), and ψ(, ). Fnally, Equatons (7), (8), and (5) respectvely allow to compute λ () 0, λ(3) 0, and λ(4) 0. Fgure b shows the general archtecture of the multpler. At the prce of a more complex partal product generaton, we save two carry-save adder trees and two carrysave adders based on (4, )-compressors. It s worth beng notced that the crtcal path of our new Partal Product Generator (two OR gates, one AND gate, and an XOR gate) s shorter than the one of a (4, )-compressor (three XOR gates). Let (U (c),u (s) ) denote the carry-save form of X + Y + + X Y.WehaveX + Y + + X Y =U (c) + U (s), where u (c) =0and u (s) = λ () 0 for {0,, n 3, n }. Algorthm 3 can also be appled to the computaton of (X + Y + X Y + ). Thus, we obtan a carrysave number (V (c),v (s) ) such that X + Y + X Y + = /05 $ IEEE

4 Algorthm 3 Partal product generaton for the computaton of X + Y + + X Y. Requre: Two n-dgt RN-codngs X and Y ; two functons ϕ(, j) and ψ(, j) respectvely defned by Equaton () and Equaton (3) Ensure: (n ) vectors Λ (j) = λ (j) k...λ(j) 0, where k n/ : λ (0) 0 x + 0 y+ 0 x 0 y 0 ; λ() 0 ϕ(0, ); λ (n ) 0 x + n y+ n x n y n ψ(n,n ); : for =to n do 3: for j =0to do 4: λ (+) j ϕ(j, + j) ψ(j, j); 5: end for 6: λ (+) ϕ(, ); 7: end for 8: for =to n do 9: for j =0to do 0: λ () j ϕ(j, j) ψ(j, j ); : end for : λ () x + y+ 0 x y 0 ; 3: end for 4: for = n+ to n do 5: for j =0to n do 6: λ () j ϕ( +j n +,n j ) ψ( +j n, n j ); 7: end for 8: λ () ψ(n, n+ n x+ n y+ n+ x n y n+ ); 9: end for 0: for = n to n do : for j =0to n do : λ (+) j ϕ( +j n +,n j ) ψ( j n +,n j ); 3: end for 4: end for V (c) +V (s). Note that the two s complement forms of V (s) and V (c) are respectvely defned by: n V (s) =+ n =0 v (s) and n V (c) = n +8+ n 3 =3 v (c). Thus, the carry-save form P =(P (c),p (s) ) of the product can be computed as follows: P (c) + P (s) = 9+(u (s) n + v(s) n + )n + n 3 =3 =0 (u (s) (u (s) + u (c) + v(s) + v (c) ) + + v (s) ). The operator mplementng ths equaton s manly based on (4, )-compressors. P s fnally converted to radx- RNcodng. Though ths multpler reduces the area and the delay compared to the one publshed n [3], t could only share a multoperand adder wth a two s complement multpler avalable n the ALU of a processor. 3. Modfed Booth Recodng Revsted Theorem 3 (Radx-β k RN-codngs). Let Y = y n...y 0 be an n-dgt radx-β RN-codng of X. The radx-β k number Z = z n/k...z 0,wthz = k j=0 y k+jβ j, s also an RN-codng of X. Example 4 (Radx-4 modfed Booth Recodng). Tryng to recode one of the bnary operands so that ts representaton contans as many zeros as possble s a common way to desgn fast multplers. The orgnal Booth recodng was a frst attempt [4]. However, t sometmes ncreases the number of non-zero dgts of the operand and s not mplemented n modern ALUs: f we apply Algorthm to X = (0.00) =.6875, we obtan Y =(. ).A common soluton, known as radx-4 modfed Booth recodng, conssts n wrtng X on the dgt set {,...,} as follows: Z = = ((x x + )+(x x ))4 = (y + + y )4 =(.) 4 =.6875, (9) = where x 5 =0and x 3 =(sgn extenson). We deduce from Equaton (9) and from Theorem 3 that the radx-4 modfed Booth recodng s an RN-codng of X. Daumas and Matula observed that a dgt can only be followed by a negatve dgt possbly preceded by a strng of zeros [5] and that ths specal notaton s not redundant. They appled ths fact to desgn a crcut able to effcently recode both bnary and carry-save operands, but dd not dscover the roundng property of the representaton. 3.. Multplcaton Algorthm Based on Radx-4 Modfed Booth Recodng A consequence of Theorem 3 s that a two s complement multpler wth radx-4 modfed Booth recodng can easly be modfed so that the recoded operand s ether a two s complement number or a radx- RN-codng. Partal product generaton s often performed n two steps n state-ofthe-art multplers [6]: a s responsble of wrtng the operand X on the dgt set {,...,}; then, a Booth selector chooses a partal product among 0, +Y, Y, +Y, and Y accordng to a dgt of the recoded operand. Goto et al. showed that the area of the Booth selector hghly depends on the encodng of the radx-4 dgts [6] and proposed a soluton wth four bts: PL (postve), M (negatve), R (doubled factor), and R (unchanged factor). Table descrbes the computaton of these control sgnals from two dgts of a radx- RN-codng X. Note that several patterns never occur (we denote them by φ) /05 $ IEEE

5 Accordng to the defnton of X, we know for nstance that x + = x =0. Buldng a Karnaugh map allows to compute the logc equatons defnng PL, M, R, and R : PL = x + + x+ x +, M = x + x x+ +, R = x + x, R = x + x = R. Fgure 3 shows the mplementaton of the proposed by Goto et al. and our for radx- RN-codngs. Accordng to Goto et al., the occupes.% of the space n a bt multpler. Therefore, our modfcaton does not ncrease sgnfcantly the area and the delay (a multplexer added n the crtcal path) of the multpler. Table. Truth table for radx-4 modfed Booth recodng. x + + x + x+ x Func R R PL M Y Y φ φ φ φ Y φ φ φ φ 0 0 Y φ φ φ φ Y Y φ φ φ φ φ φ φ φ Ths operator s a buldng block for our second multplcaton algorthm. We suggest to compute XY = XY + XY, where X s an n-dgt radx- RN-codng, and Y + and Y are n-bt unsgned numbers. Up to ths pont, we assumed that X was ether a two s complement number or a radx- RN-codng, and that the second operand was an n-bt two s complement number. Consequently, we need to perform a sgn extenson so that the second operand s an (n +)-bt two s complement number. We defne { n y n + Y f Y s a two s complement number, Ỹ = Y otherwse. Ths mples a modfcaton of the carry-save adder tree to handle an (n +)-bt nput. However, the number of partal products as well as the depth of the tree reman unchanged. Fgure 3 descrbes an operator based on two such multpler blocks, a subtracter, two fast adders, and multplexers able to multply two s complement numbers and RN-codngs. Fve control bts allow to select the desred operaton (Table ). 3.. Combnng Roundng to Nearest and Partal Product Generaton Theorem 4 (Radx- k modfed Booth recodng). Let X be a two s complement number wth n nteger bts and m fractonal bts. Choose two numbers b and k such that k and bk < m, assume that x j = x n, j n (sgn extenson), and consder the radx- k number Y defned as follows: Y = n/k = b ( ) k k x k+k + j x k+j + x k k. j=0 Y s the radx- k modfed Booth recodng of n+bk (X). If X s exactly between two representable numbers, then Y = X + bk. Algorthm 4 Combnng roundng to nearest and radx- k RN-codng converson. Requre: A two s complement number wth n nteger bts and m fractonal bts; two ntegers b and k wth bk < m; x j = x n, j n (sgn extenson) Ensure: A radx- k RN-codng Y such that Y = n+bk (X) : for = b to n/k do k : y k x k+k + j x k+j + x k ; 3: end for j=0 Example 5. Let X = ( ) = We want to multply a -bt two s complement number W by (X). The standard soluton conssts n roundng X to nearest and n recodng (X) to select the partal products. We obtan (X) = ( ) and Y =(. ) 4 = Theorem 4 allows to skp the frst step: appled to X wth k =and b =4, Algorthm 4 returns Y =(. ) 4 = To compute 3 (X), we choose b = k =3and obtan Y =( 3. 3 ) 8 = Note that X s exactly between two representable numbers. We check that X + bk = X + 0 = We can for nstance take advantage of Theorem 4 to evaluate a polynomal wth Horner s rule. Instead of roundng ntermedate results to nearest, we slghtly modfy the Booth selector of the multpler so that t mplements Algorthm 4. Assume that k =. In standard multpler, the recodng cell responsble for the least sgnfcant dgt s smpler than other cells n the sense that t only requres two bts (we assume that x bk =0). To apply Algorthm 4, t suffces to add a thrd nput bt to ths cell so that t takes x bk nto account /05 $ IEEE

6 c Y or Y + Z or Y y n z n x x X + X X (RN codng) (two s complement) R R PL 4 n bts c 0 0 n bts Sgn extenson Booth selector Sgn extenson Booth selector Carry save adder/subtracter n bts c 0 (two s complement) (RN codng) x + x c 3 x + + W + W W R R PL x + M 0 0 c 4 x + M Booth recodng Booth recodng P0 P Fgure 3. A multpler handlng two s complement numbers and radx- RN-codngs. W, X, Y, and W are n-bt two s complement numbers. X +, X, Y +, and Y are n-bt unsgned numbers. Table. Some operatons mplemented by the multpler shown n Fgure 3. Operaton c 4 c 3 c c c 0 P0 XY P WZ P0 XY + WZ P WZ P0 XY WZ P WZ P0 (X + X )Y P WZ P0 (X + X )Y P (X + X )Z P0 (X + X )(Y + Y ) P (X + X )Y 4. Concluson We have shown that very slghtly modfed arthmetc operators can effcently handle both conventonal bnary representatons and RN-codngs. Snce RN-codngs can also be effcently compressed for storage [7], we conclude that RN-codngs are a good canddate for numercal computatons. In a further study we wll desgn dedcated dvson and square root algorthms, as well as an ALU able to handle RN-codngs and conventonal bnary numbers. References [] J.-C. Bajard, J. Duprat, S. Kla, and J.-M. Muller. Some operators for on-lne radx- computatons. Journal of Parallel and Dstrbuted Computng, : , 994. [] J.-L. Beuchat and J.-M. Muller. Multplcaton algorthms for radx- RN-codngs and two s complement numbers. Techncal Report , Laboratore de l Informatque du Parallélsme, École Normale Supéreure de Lyon, 46 Allée d Itale, Lyon Cedex 07, Feb [3] J.-L. Beuchat and J.-M. Muller. RN-codes : algorthmes d addton, de multplcaton et d élévaton au carré. In SympA 005: 0ème édton du SYMPosum en Archtectures nouvelles de machnes, pages 73 84, Apr [4] A. D. Booth. A sgned bnary multplcaton technque. Quarterly Journal of Mechancs and Appled Mathematcs, 4():36 40, 95. [5] M. Daumas and D. W. Matula. Further reducng the redundancy of a notaton over a mnmally redundant dgt set. Journal of VLSI Sgnal Processng, 33:7 8, 003. [6] G. Goto, A. Inoue, R. Ohe, S. Kashwakura, S. Mtara, T. Tsuru, and T. Izawa. A 4.-ns compact b multpler utlzng sgn-select s. IEEE Journal of Sold-State Crcuts, 3():676 68, Nov [7] P. Kornerup and J.-M. Muller. RN-codng of numbers: defnton and some propertes. In Proceedngs of the 7th IMACS World Congress on Scentfc Computaton, Appled Mathematcs and Smulaton, Pars, July /05 $ IEEE

Complex Number Representation in RCBNS Form for Arithmetic Operations and Conversion of the Result into Standard Binary Form

Complex Number Representation in RCBNS Form for Arithmetic Operations and Conversion of the Result into Standard Binary Form Complex Number epresentaton n CBNS Form for Arthmetc Operatons and Converson of the esult nto Standard Bnary Form Hatm Zan and. G. Deshmukh Florda Insttute of Technology rgd@ee.ft.edu ABSTACT Ths paper

More information

What is Candidate Sampling

What is Candidate Sampling What s Canddate Samplng Say we have a multclass or mult label problem where each tranng example ( x, T ) conssts of a context x a small (mult)set of target classes T out of a large unverse L of possble

More information

Recurrence. 1 Definitions and main statements

Recurrence. 1 Definitions and main statements Recurrence 1 Defntons and man statements Let X n, n = 0, 1, 2,... be a MC wth the state space S = (1, 2,...), transton probabltes p j = P {X n+1 = j X n = }, and the transton matrx P = (p j ),j S def.

More information

Graph Theory and Cayley s Formula

Graph Theory and Cayley s Formula Graph Theory and Cayley s Formula Chad Casarotto August 10, 2006 Contents 1 Introducton 1 2 Bascs and Defntons 1 Cayley s Formula 4 4 Prüfer Encodng A Forest of Trees 7 1 Introducton In ths paper, I wll

More information

8 Algorithm for Binary Searching in Trees

8 Algorithm for Binary Searching in Trees 8 Algorthm for Bnary Searchng n Trees In ths secton we present our algorthm for bnary searchng n trees. A crucal observaton employed by the algorthm s that ths problem can be effcently solved when the

More information

Lossless Data Compression

Lossless Data Compression Lossless Data Compresson Lecture : Unquely Decodable and Instantaneous Codes Sam Rowes September 5, 005 Let s focus on the lossless data compresson problem for now, and not worry about nosy channel codng

More information

Luby s Alg. for Maximal Independent Sets using Pairwise Independence

Luby s Alg. for Maximal Independent Sets using Pairwise Independence Lecture Notes for Randomzed Algorthms Luby s Alg. for Maxmal Independent Sets usng Parwse Independence Last Updated by Erc Vgoda on February, 006 8. Maxmal Independent Sets For a graph G = (V, E), an ndependent

More information

8.5 UNITARY AND HERMITIAN MATRICES. The conjugate transpose of a complex matrix A, denoted by A*, is given by

8.5 UNITARY AND HERMITIAN MATRICES. The conjugate transpose of a complex matrix A, denoted by A*, is given by 6 CHAPTER 8 COMPLEX VECTOR SPACES 5. Fnd the kernel of the lnear transformaton gven n Exercse 5. In Exercses 55 and 56, fnd the mage of v, for the ndcated composton, where and are gven by the followng

More information

Extending Probabilistic Dynamic Epistemic Logic

Extending Probabilistic Dynamic Epistemic Logic Extendng Probablstc Dynamc Epstemc Logc Joshua Sack May 29, 2008 Probablty Space Defnton A probablty space s a tuple (S, A, µ), where 1 S s a set called the sample space. 2 A P(S) s a σ-algebra: a set

More information

Using Alpha-Beta Associative Memories to Learn and Recall RGB Images

Using Alpha-Beta Associative Memories to Learn and Recall RGB Images Usng Alpha-Beta Assocatve Memores to Learn and Recall RGB Images Cornelo Yáñez-Márquez, María Elena Cruz-Meza, Flavo Arturo Sánchez-Garfas, and Itzamá López-Yáñez Centro de Investgacón en Computacón, Insttuto

More information

Implementation of Boolean Functions through Multiplexers with the Help of Shannon Expansion Theorem

Implementation of Boolean Functions through Multiplexers with the Help of Shannon Expansion Theorem Internatonal Journal o Computer pplcatons (975 8887) Volume 62 No.6, January 23 Implementaton o Boolean Functons through Multplexers wth the Help o Shannon Expanson Theorem Saurabh Rawat Graphc Era Unversty.

More information

Aryabhata s Root Extraction Methods. Abhishek Parakh Louisiana State University Aug 31 st 2006

Aryabhata s Root Extraction Methods. Abhishek Parakh Louisiana State University Aug 31 st 2006 Aryabhata s Root Extracton Methods Abhshek Parakh Lousana State Unversty Aug 1 st 1 Introducton Ths artcle presents an analyss of the root extracton algorthms of Aryabhata gven n hs book Āryabhatīya [1,

More information

Quantization Effects in Digital Filters

Quantization Effects in Digital Filters Quantzaton Effects n Dgtal Flters Dstrbuton of Truncaton Errors In two's complement representaton an exact number would have nfntely many bts (n general). When we lmt the number of bts to some fnte value

More information

1 Example 1: Axis-aligned rectangles

1 Example 1: Axis-aligned rectangles COS 511: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture # 6 Scrbe: Aaron Schld February 21, 2013 Last class, we dscussed an analogue for Occam s Razor for nfnte hypothess spaces that, n conjuncton

More information

+ + + - - This circuit than can be reduced to a planar circuit

+ + + - - This circuit than can be reduced to a planar circuit MeshCurrent Method The meshcurrent s analog of the nodeoltage method. We sole for a new set of arables, mesh currents, that automatcally satsfy KCLs. As such, meshcurrent method reduces crcut soluton to

More information

Module 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Module 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur Module LOSSLESS IMAGE COMPRESSION SYSTEMS Lesson 3 Lossless Compresson: Huffman Codng Instructonal Objectves At the end of ths lesson, the students should be able to:. Defne and measure source entropy..

More information

II. PROBABILITY OF AN EVENT

II. PROBABILITY OF AN EVENT II. PROBABILITY OF AN EVENT As ndcated above, probablty s a quantfcaton, or a mathematcal model, of a random experment. Ths quantfcaton s a measure of the lkelhood that a gven event wll occur when the

More information

greatest common divisor

greatest common divisor 4. GCD 1 The greatest common dvsor of two ntegers a and b (not both zero) s the largest nteger whch s a common factor of both a and b. We denote ths number by gcd(a, b), or smply (a, b) when there s no

More information

Chapter 3 Group Theory p. 1 - Remark: This is only a brief summary of most important results of groups theory with respect

Chapter 3 Group Theory p. 1 - Remark: This is only a brief summary of most important results of groups theory with respect Chapter 3 Group Theory p. - 3. Compact Course: Groups Theory emark: Ths s only a bref summary of most mportant results of groups theory wth respect to the applcatons dscussed n the followng chapters. For

More information

We are now ready to answer the question: What are the possible cardinalities for finite fields?

We are now ready to answer the question: What are the possible cardinalities for finite fields? Chapter 3 Fnte felds We have seen, n the prevous chapters, some examples of fnte felds. For example, the resdue class rng Z/pZ (when p s a prme) forms a feld wth p elements whch may be dentfed wth the

More information

A Crossplatform ECG Compression Library for Mobile HealthCare Services

A Crossplatform ECG Compression Library for Mobile HealthCare Services A Crossplatform ECG Compresson Lbrary for Moble HealthCare Servces Alexander Borodn, Yulya Zavyalova Department of Computer Scence Petrozavodsk State Unversty Petrozavodsk, Russa {aborod, yzavyalo}@cs.petrsu.ru

More information

Chapter 7. Random-Variate Generation 7.1. Prof. Dr. Mesut Güneş Ch. 7 Random-Variate Generation

Chapter 7. Random-Variate Generation 7.1. Prof. Dr. Mesut Güneş Ch. 7 Random-Variate Generation Chapter 7 Random-Varate Generaton 7. Contents Inverse-transform Technque Acceptance-Rejecton Technque Specal Propertes 7. Purpose & Overvew Develop understandng of generatng samples from a specfed dstrbuton

More information

BERNSTEIN POLYNOMIALS

BERNSTEIN POLYNOMIALS On-Lne Geometrc Modelng Notes BERNSTEIN POLYNOMIALS Kenneth I. Joy Vsualzaton and Graphcs Research Group Department of Computer Scence Unversty of Calforna, Davs Overvew Polynomals are ncredbly useful

More information

Lecture 2: Single Layer Perceptrons Kevin Swingler

Lecture 2: Single Layer Perceptrons Kevin Swingler Lecture 2: Sngle Layer Perceptrons Kevn Sngler kms@cs.str.ac.uk Recap: McCulloch-Ptts Neuron Ths vastly smplfed model of real neurons s also knon as a Threshold Logc Unt: W 2 A Y 3 n W n. A set of synapses

More information

6. EIGENVALUES AND EIGENVECTORS 3 = 3 2

6. EIGENVALUES AND EIGENVECTORS 3 = 3 2 EIGENVALUES AND EIGENVECTORS The Characterstc Polynomal If A s a square matrx and v s a non-zero vector such that Av v we say that v s an egenvector of A and s the correspondng egenvalue Av v Example :

More information

Moment of a force about a point and about an axis

Moment of a force about a point and about an axis 3. STATICS O RIGID BODIES In the precedng chapter t was assumed that each of the bodes consdered could be treated as a sngle partcle. Such a vew, however, s not always possble, and a body, n general, should

More information

1 Approximation Algorithms

1 Approximation Algorithms CME 305: Dscrete Mathematcs and Algorthms 1 Approxmaton Algorthms In lght of the apparent ntractablty of the problems we beleve not to le n P, t makes sense to pursue deas other than complete solutons

More information

where the coordinates are related to those in the old frame as follows.

where the coordinates are related to those in the old frame as follows. Chapter 2 - Cartesan Vectors and Tensors: Ther Algebra Defnton of a vector Examples of vectors Scalar multplcaton Addton of vectors coplanar vectors Unt vectors A bass of non-coplanar vectors Scalar product

More information

Institute of Informatics, Faculty of Business and Management, Brno University of Technology,Czech Republic

Institute of Informatics, Faculty of Business and Management, Brno University of Technology,Czech Republic Lagrange Multplers as Quanttatve Indcators n Economcs Ivan Mezník Insttute of Informatcs, Faculty of Busness and Management, Brno Unversty of TechnologCzech Republc Abstract The quanttatve role of Lagrange

More information

A linear recurrence sequence of composite numbers

A linear recurrence sequence of composite numbers LMS J Comput Math 15 (2012) 360 373 C 2012 Author do:101112/s1461157012001143 A lnear recurrence sequence of composte numbers Jonas Šurys Abstract We prove that for each postve nteger k n the range 2 k

More information

RN-coding of Numbers: New Insights and Some Applications

RN-coding of Numbers: New Insights and Some Applications RN-coding of Numbers: New Insights and Some Applications Peter Kornerup Dept. of Mathematics and Computer Science SDU, Odense, Denmark & Jean-Michel Muller LIP/Arénaire (CRNS-ENS Lyon-INRIA-UCBL) Lyon,

More information

A Probabilistic Theory of Coherence

A Probabilistic Theory of Coherence A Probablstc Theory of Coherence BRANDEN FITELSON. The Coherence Measure C Let E be a set of n propostons E,..., E n. We seek a probablstc measure C(E) of the degree of coherence of E. Intutvely, we want

More information

Implementation of Deutsch's Algorithm Using Mathcad

Implementation of Deutsch's Algorithm Using Mathcad Implementaton of Deutsch's Algorthm Usng Mathcad Frank Roux The followng s a Mathcad mplementaton of Davd Deutsch's quantum computer prototype as presented on pages - n "Machnes, Logc and Quantum Physcs"

More information

Calculating the Trend Data

Calculating the Trend Data LASER INTERFEROMETER GRAVITATIONAL WAVE OBSERVATORY - LIGO - CALIFORNIA INSTITUTE OF TECHNOLOGY MASSACHUSETTS INSTITUTE OF TECHNOLOGY Techncal Note LIGO-T990110-B - D 3/29/07 Calculatng the Trend Data

More information

Project Networks With Mixed-Time Constraints

Project Networks With Mixed-Time Constraints Project Networs Wth Mxed-Tme Constrants L Caccetta and B Wattananon Western Australan Centre of Excellence n Industral Optmsaton (WACEIO) Curtn Unversty of Technology GPO Box U1987 Perth Western Australa

More information

An approach to Digital Low-Pass IIR Filter Design

An approach to Digital Low-Pass IIR Filter Design An approach to Dgtal Low-Pass IIR Flter Desgn Bojan Jovanovć, and Mlun Jevtć Abstract The paper descrbes the desgn process of dscrete network dgtal low-pass flter wth Infnte Impulse Response (IIR flter).

More information

v a 1 b 1 i, a 2 b 2 i,..., a n b n i.

v a 1 b 1 i, a 2 b 2 i,..., a n b n i. SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 455 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces we have studed thus far n the text are real vector spaces snce the scalars are

More information

DEFINING %COMPLETE IN MICROSOFT PROJECT

DEFINING %COMPLETE IN MICROSOFT PROJECT CelersSystems DEFINING %COMPLETE IN MICROSOFT PROJECT PREPARED BY James E Aksel, PMP, PMI-SP, MVP For Addtonal Informaton about Earned Value Management Systems and reportng, please contact: CelersSystems,

More information

INTERPRETING TRUE ARITHMETIC IN THE LOCAL STRUCTURE OF THE ENUMERATION DEGREES.

INTERPRETING TRUE ARITHMETIC IN THE LOCAL STRUCTURE OF THE ENUMERATION DEGREES. INTERPRETING TRUE ARITHMETIC IN THE LOCAL STRUCTURE OF THE ENUMERATION DEGREES. HRISTO GANCHEV AND MARIYA SOSKOVA 1. Introducton Degree theory studes mathematcal structures, whch arse from a formal noton

More information

Support Vector Machines

Support Vector Machines Support Vector Machnes Max Wellng Department of Computer Scence Unversty of Toronto 10 Kng s College Road Toronto, M5S 3G5 Canada wellng@cs.toronto.edu Abstract Ths s a note to explan support vector machnes.

More information

RN-Codings: New Insights and Some Applications

RN-Codings: New Insights and Some Applications RN-Codings: New Insights and Some Applications Abstract During any composite computation there is a constant need for rounding intermediate results before they can participate in further processing. Recently

More information

Fast degree elevation and knot insertion for B-spline curves

Fast degree elevation and knot insertion for B-spline curves Computer Aded Geometrc Desgn 22 (2005) 183 197 www.elsever.com/locate/cagd Fast degree elevaton and knot nserton for B-splne curves Q-Xng Huang a,sh-mnhu a,, Ralph R. Martn b a Department of Computer Scence

More information

Introduction: Analysis of Electronic Circuits

Introduction: Analysis of Electronic Circuits /30/008 ntroducton / ntroducton: Analyss of Electronc Crcuts Readng Assgnment: KVL and KCL text from EECS Just lke EECS, the majorty of problems (hw and exam) n EECS 3 wll be crcut analyss problems. Thus,

More information

9 Arithmetic and Geometric Sequence

9 Arithmetic and Geometric Sequence AAU - Busness Mathematcs I Lecture #5, Aprl 4, 010 9 Arthmetc and Geometrc Sequence Fnte sequence: 1, 5, 9, 13, 17 Fnte seres: 1 + 5 + 9 + 13 +17 Infnte sequence: 1,, 4, 8, 16,... Infnte seres: 1 + + 4

More information

Solution: Let i = 10% and d = 5%. By definition, the respective forces of interest on funds A and B are. i 1 + it. S A (t) = d (1 dt) 2 1. = d 1 dt.

Solution: Let i = 10% and d = 5%. By definition, the respective forces of interest on funds A and B are. i 1 + it. S A (t) = d (1 dt) 2 1. = d 1 dt. Chapter 9 Revew problems 9.1 Interest rate measurement Example 9.1. Fund A accumulates at a smple nterest rate of 10%. Fund B accumulates at a smple dscount rate of 5%. Fnd the pont n tme at whch the forces

More information

Solution : (a) FALSE. Let C be a binary one-error correcting code of length 9. Then it follows from the Sphere packing bound that.

Solution : (a) FALSE. Let C be a binary one-error correcting code of length 9. Then it follows from the Sphere packing bound that. MATH 29T Exam : Part I Solutons. TRUE/FALSE? Prove your answer! (a) (5 pts) There exsts a bnary one-error correctng code of length 9 wth 52 codewords. (b) (5 pts) There exsts a ternary one-error correctng

More information

PAS: A Packet Accounting System to Limit the Effects of DoS & DDoS. Debish Fesehaye & Klara Naherstedt University of Illinois-Urbana Champaign

PAS: A Packet Accounting System to Limit the Effects of DoS & DDoS. Debish Fesehaye & Klara Naherstedt University of Illinois-Urbana Champaign PAS: A Packet Accountng System to Lmt the Effects of DoS & DDoS Debsh Fesehaye & Klara Naherstedt Unversty of Illnos-Urbana Champagn DoS and DDoS DDoS attacks are ncreasng threats to our dgtal world. Exstng

More information

MAPP. MERIS level 3 cloud and water vapour products. Issue: 1. Revision: 0. Date: 9.12.1998. Function Name Organisation Signature Date

MAPP. MERIS level 3 cloud and water vapour products. Issue: 1. Revision: 0. Date: 9.12.1998. Function Name Organisation Signature Date Ttel: Project: Doc. No.: MERIS level 3 cloud and water vapour products MAPP MAPP-ATBD-ClWVL3 Issue: 1 Revson: 0 Date: 9.12.1998 Functon Name Organsaton Sgnature Date Author: Bennartz FUB Preusker FUB Schüller

More information

NPAR TESTS. One-Sample Chi-Square Test. Cell Specification. Observed Frequencies 1O i 6. Expected Frequencies 1EXP i 6

NPAR TESTS. One-Sample Chi-Square Test. Cell Specification. Observed Frequencies 1O i 6. Expected Frequencies 1EXP i 6 PAR TESTS If a WEIGHT varable s specfed, t s used to replcate a case as many tmes as ndcated by the weght value rounded to the nearest nteger. If the workspace requrements are exceeded and samplng has

More information

benefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ).

benefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ). REVIEW OF RISK MANAGEMENT CONCEPTS LOSS DISTRIBUTIONS AND INSURANCE Loss and nsurance: When someone s subject to the rsk of ncurrng a fnancal loss, the loss s generally modeled usng a random varable or

More information

Passive Filters. References: Barbow (pp 265-275), Hayes & Horowitz (pp 32-60), Rizzoni (Chap. 6)

Passive Filters. References: Barbow (pp 265-275), Hayes & Horowitz (pp 32-60), Rizzoni (Chap. 6) Passve Flters eferences: Barbow (pp 6575), Hayes & Horowtz (pp 360), zzon (Chap. 6) Frequencyselectve or flter crcuts pass to the output only those nput sgnals that are n a desred range of frequences (called

More information

PERRON FROBENIUS THEOREM

PERRON FROBENIUS THEOREM PERRON FROBENIUS THEOREM R. CLARK ROBINSON Defnton. A n n matrx M wth real entres m, s called a stochastc matrx provded () all the entres m satsfy 0 m, () each of the columns sum to one, m = for all, ()

More information

Section 5.4 Annuities, Present Value, and Amortization

Section 5.4 Annuities, Present Value, and Amortization Secton 5.4 Annutes, Present Value, and Amortzaton Present Value In Secton 5.2, we saw that the present value of A dollars at nterest rate per perod for n perods s the amount that must be deposted today

More information

A Secure Password-Authenticated Key Agreement Using Smart Cards

A Secure Password-Authenticated Key Agreement Using Smart Cards A Secure Password-Authentcated Key Agreement Usng Smart Cards Ka Chan 1, Wen-Chung Kuo 2 and Jn-Chou Cheng 3 1 Department of Computer and Informaton Scence, R.O.C. Mltary Academy, Kaohsung 83059, Tawan,

More information

Solution of Algebraic and Transcendental Equations

Solution of Algebraic and Transcendental Equations CHAPTER Soluton of Algerac and Transcendental Equatons. INTRODUCTION One of the most common prolem encountered n engneerng analyss s that gven a functon f (, fnd the values of for whch f ( = 0. The soluton

More information

SIGNIFICANT FIGURES (4SF) (4SF) (5SF) (3 SF) 62.4 (3 SF) x 10 4 (5 SF) Figure 0

SIGNIFICANT FIGURES (4SF) (4SF) (5SF) (3 SF) 62.4 (3 SF) x 10 4 (5 SF) Figure 0 SIGIFICAT FIGURES Wth any calbrated nstrument, there s a lmt to the number of fgures that can be relably kept n the answer. For dgtal nstruments, the lmtaton s the number of fgures appearng n the dsplay.

More information

Lecture 3. 1 Largest singular value The Behavior of Algorithms in Practice 2/14/2

Lecture 3. 1 Largest singular value The Behavior of Algorithms in Practice 2/14/2 18.409 The Behavor of Algorthms n Practce 2/14/2 Lecturer: Dan Spelman Lecture 3 Scrbe: Arvnd Sankar 1 Largest sngular value In order to bound the condton number, we need an upper bound on the largest

More information

Section 5.3 Annuities, Future Value, and Sinking Funds

Section 5.3 Annuities, Future Value, and Sinking Funds Secton 5.3 Annutes, Future Value, and Snkng Funds Ordnary Annutes A sequence of equal payments made at equal perods of tme s called an annuty. The tme between payments s the payment perod, and the tme

More information

The Greedy Method. Introduction. 0/1 Knapsack Problem

The Greedy Method. Introduction. 0/1 Knapsack Problem The Greedy Method Introducton We have completed data structures. We now are gong to look at algorthm desgn methods. Often we are lookng at optmzaton problems whose performance s exponental. For an optmzaton

More information

Embedding lattices in the Kleene degrees

Embedding lattices in the Kleene degrees F U N D A M E N T A MATHEMATICAE 62 (999) Embeddng lattces n the Kleene degrees by Hsato M u r a k (Nagoya) Abstract. Under ZFC+CH, we prove that some lattces whose cardnaltes do not exceed ℵ can be embedded

More information

Electric circuit components. Direct Current (DC) circuits

Electric circuit components. Direct Current (DC) circuits Electrc crcut components Capactor stores charge and potental energy, measured n Farads (F) Battery generates a constant electrcal potental dfference ( ) across t. Measured n olts (). Resstor ressts flow

More information

EE201 Circuit Theory I 2015 Spring. Dr. Yılmaz KALKAN

EE201 Circuit Theory I 2015 Spring. Dr. Yılmaz KALKAN EE201 Crcut Theory I 2015 Sprng Dr. Yılmaz KALKAN 1. Basc Concepts (Chapter 1 of Nlsson - 3 Hrs.) Introducton, Current and Voltage, Power and Energy 2. Basc Laws (Chapter 2&3 of Nlsson - 6 Hrs.) Voltage

More information

Calculation of Sampling Weights

Calculation of Sampling Weights Perre Foy Statstcs Canada 4 Calculaton of Samplng Weghts 4.1 OVERVIEW The basc sample desgn used n TIMSS Populatons 1 and 2 was a two-stage stratfed cluster desgn. 1 The frst stage conssted of a sample

More information

Calculating the high frequency transmission line parameters of power cables

Calculating the high frequency transmission line parameters of power cables < ' Calculatng the hgh frequency transmsson lne parameters of power cables Authors: Dr. John Dcknson, Laboratory Servces Manager, N 0 RW E B Communcatons Mr. Peter J. Ncholson, Project Assgnment Manager,

More information

Two Analytical Methods for Detection and Elimination of the Static Hazard in Combinational Logic Circuits

Two Analytical Methods for Detection and Elimination of the Static Hazard in Combinational Logic Circuits Crcuts and Systems,, 4, 466-47 Publshed Onlne November (http//wwwscrporg/journal/cs) http//ddoorg/46/cs476 Two Analytcal Methods for Detecton and Elmnaton of the Statc Hazard n Combnatonal Logc Crcuts

More information

Pre-Algebra. Mix-N-Match. Line-Ups. Inside-Outside Circle. A c t. t i e s & v i

Pre-Algebra. Mix-N-Match. Line-Ups. Inside-Outside Circle. A c t. t i e s & v i IV A c t Pre-Algebra v Mx-N-Match 1. Operatons on Fractons.................15 2. Order of Operatons....................15 3. Exponental Form......................16 4. Scentfc Notaton......................16

More information

State function: eigenfunctions of hermitian operators-> normalization, orthogonality completeness

State function: eigenfunctions of hermitian operators-> normalization, orthogonality completeness Schroednger equaton Basc postulates of quantum mechancs. Operators: Hermtan operators, commutators State functon: egenfunctons of hermtan operators-> normalzaton, orthogonalty completeness egenvalues and

More information

Section C2: BJT Structure and Operational Modes

Section C2: BJT Structure and Operational Modes Secton 2: JT Structure and Operatonal Modes Recall that the semconductor dode s smply a pn juncton. Dependng on how the juncton s based, current may easly flow between the dode termnals (forward bas, v

More information

Laddered Multilevel DC/AC Inverters used in Solar Panel Energy Systems

Laddered Multilevel DC/AC Inverters used in Solar Panel Energy Systems Proceedngs of the nd Internatonal Conference on Computer Scence and Electroncs Engneerng (ICCSEE 03) Laddered Multlevel DC/AC Inverters used n Solar Panel Energy Systems Fang Ln Luo, Senor Member IEEE

More information

PLANAR GRAPHS. Plane graph (or embedded graph) A graph that is drawn on the plane without edge crossing, is called a Plane graph

PLANAR GRAPHS. Plane graph (or embedded graph) A graph that is drawn on the plane without edge crossing, is called a Plane graph PLANAR GRAPHS Basc defntons Isomorphc graphs Two graphs G(V,E) and G2(V2,E2) are somorphc f there s a one-to-one correspondence F of ther vertces such that the followng holds: - u,v V, uv E, => F(u)F(v)

More information

Logistic Regression. Lecture 4: More classifiers and classes. Logistic regression. Adaboost. Optimization. Multiple class classification

Logistic Regression. Lecture 4: More classifiers and classes. Logistic regression. Adaboost. Optimization. Multiple class classification Lecture 4: More classfers and classes C4B Machne Learnng Hlary 20 A. Zsserman Logstc regresson Loss functons revsted Adaboost Loss functons revsted Optmzaton Multple class classfcaton Logstc Regresson

More information

A Computer Technique for Solving LP Problems with Bounded Variables

A Computer Technique for Solving LP Problems with Bounded Variables Dhaka Unv. J. Sc. 60(2): 163-168, 2012 (July) A Computer Technque for Solvng LP Problems wth Bounded Varables S. M. Atqur Rahman Chowdhury * and Sanwar Uddn Ahmad Department of Mathematcs; Unversty of

More information

IMPROVEMENT OF CONVERGENCE CONDITION OF THE SQUARE-ROOT INTERVAL METHOD FOR MULTIPLE ZEROS 1

IMPROVEMENT OF CONVERGENCE CONDITION OF THE SQUARE-ROOT INTERVAL METHOD FOR MULTIPLE ZEROS 1 Nov Sad J. Math. Vol. 36, No. 2, 2006, 0-09 IMPROVEMENT OF CONVERGENCE CONDITION OF THE SQUARE-ROOT INTERVAL METHOD FOR MULTIPLE ZEROS Modrag S. Petkovć 2, Dušan M. Mloševć 3 Abstract. A new theorem concerned

More information

Frequency Selective IQ Phase and IQ Amplitude Imbalance Adjustments for OFDM Direct Conversion Transmitters

Frequency Selective IQ Phase and IQ Amplitude Imbalance Adjustments for OFDM Direct Conversion Transmitters Frequency Selectve IQ Phase and IQ Ampltude Imbalance Adjustments for OFDM Drect Converson ransmtters Edmund Coersmeer, Ernst Zelnsk Noka, Meesmannstrasse 103, 44807 Bochum, Germany edmund.coersmeer@noka.com,

More information

Minimal Coding Network With Combinatorial Structure For Instantaneous Recovery From Edge Failures

Minimal Coding Network With Combinatorial Structure For Instantaneous Recovery From Edge Failures Mnmal Codng Network Wth Combnatoral Structure For Instantaneous Recovery From Edge Falures Ashly Joseph 1, Mr.M.Sadsh Sendl 2, Dr.S.Karthk 3 1 Fnal Year ME CSE Student Department of Computer Scence Engneerng

More information

n + d + q = 24 and.05n +.1d +.25q = 2 { n + d + q = 24 (3) n + 2d + 5q = 40 (2)

n + d + q = 24 and.05n +.1d +.25q = 2 { n + d + q = 24 (3) n + 2d + 5q = 40 (2) MATH 16T Exam 1 : Part I (In-Class) Solutons 1. (0 pts) A pggy bank contans 4 cons, all of whch are nckels (5 ), dmes (10 ) or quarters (5 ). The pggy bank also contans a con of each denomnaton. The total

More information

Week 6 Market Failure due to Externalities

Week 6 Market Failure due to Externalities Week 6 Market Falure due to Externaltes 1. Externaltes n externalty exsts when the acton of one agent unavodably affects the welfare of another agent. The affected agent may be a consumer, gvng rse to

More information

A Novel Methodology of Working Capital Management for Large. Public Constructions by Using Fuzzy S-curve Regression

A Novel Methodology of Working Capital Management for Large. Public Constructions by Using Fuzzy S-curve Regression Novel Methodology of Workng Captal Management for Large Publc Constructons by Usng Fuzzy S-curve Regresson Cheng-Wu Chen, Morrs H. L. Wang and Tng-Ya Hseh Department of Cvl Engneerng, Natonal Central Unversty,

More information

ALTERNATIVE ARITHMETIC STRUCTURES USING REDUNDANT NUMBERS AND MULTI-VALUED CIRCUIT TECHNIQUES

ALTERNATIVE ARITHMETIC STRUCTURES USING REDUNDANT NUMBERS AND MULTI-VALUED CIRCUIT TECHNIQUES ALTERNATIVE ARITHMETIC STRUCTURES USING REDUNDANT NUMBERS AND MULTI-VALUED CIRCUIT TECHNIQUES by Uğur Çn B.S., Electroncs and Communcatons Engneerng, Yıldız Techncal Unversty, 1999 M.S., Electrcal and

More information

Conversion between the vector and raster data structures using Fuzzy Geographical Entities

Conversion between the vector and raster data structures using Fuzzy Geographical Entities Converson between the vector and raster data structures usng Fuzzy Geographcal Enttes Cdála Fonte Department of Mathematcs Faculty of Scences and Technology Unversty of Combra, Apartado 38, 3 454 Combra,

More information

Feature selection for intrusion detection. Slobodan Petrović NISlab, Gjøvik University College

Feature selection for intrusion detection. Slobodan Petrović NISlab, Gjøvik University College Feature selecton for ntruson detecton Slobodan Petrovć NISlab, Gjøvk Unversty College Contents The feature selecton problem Intruson detecton Traffc features relevant for IDS The CFS measure The mrmr measure

More information

Formula of Total Probability, Bayes Rule, and Applications

Formula of Total Probability, Bayes Rule, and Applications 1 Formula of Total Probablty, Bayes Rule, and Applcatons Recall that for any event A, the par of events A and A has an ntersecton that s empty, whereas the unon A A represents the total populaton of nterest.

More information

ErrorPropagation.nb 1. Error Propagation

ErrorPropagation.nb 1. Error Propagation ErrorPropagaton.nb Error Propagaton Suppose that we make observatons of a quantty x that s subject to random fluctuatons or measurement errors. Our best estmate of the true value for ths quantty s then

More information

THE METHOD OF LEAST SQUARES THE METHOD OF LEAST SQUARES

THE METHOD OF LEAST SQUARES THE METHOD OF LEAST SQUARES The goal: to measure (determne) an unknown quantty x (the value of a RV X) Realsaton: n results: y 1, y 2,..., y j,..., y n, (the measured values of Y 1, Y 2,..., Y j,..., Y n ) every result s encumbered

More information

The eigenvalue derivatives of linear damped systems

The eigenvalue derivatives of linear damped systems Control and Cybernetcs vol. 32 (2003) No. 4 The egenvalue dervatves of lnear damped systems by Yeong-Jeu Sun Department of Electrcal Engneerng I-Shou Unversty Kaohsung, Tawan 840, R.O.C e-mal: yjsun@su.edu.tw

More information

An Alternative Way to Measure Private Equity Performance

An Alternative Way to Measure Private Equity Performance An Alternatve Way to Measure Prvate Equty Performance Peter Todd Parlux Investment Technology LLC Summary Internal Rate of Return (IRR) s probably the most common way to measure the performance of prvate

More information

SPEE Recommended Evaluation Practice #6 Definition of Decline Curve Parameters Background:

SPEE Recommended Evaluation Practice #6 Definition of Decline Curve Parameters Background: SPEE Recommended Evaluaton Practce #6 efnton of eclne Curve Parameters Background: The producton hstores of ol and gas wells can be analyzed to estmate reserves and future ol and gas producton rates and

More information

Online Learning from Experts: Minimax Regret

Online Learning from Experts: Minimax Regret E0 370 tatstcal Learnng Theory Lecture 2 Nov 24, 20) Onlne Learnng from Experts: Mn Regret Lecturer: hvan garwal crbe: Nkhl Vdhan Introducton In the last three lectures we have been dscussng the onlne

More information

The OC Curve of Attribute Acceptance Plans

The OC Curve of Attribute Acceptance Plans The OC Curve of Attrbute Acceptance Plans The Operatng Characterstc (OC) curve descrbes the probablty of acceptng a lot as a functon of the lot s qualty. Fgure 1 shows a typcal OC Curve. 10 8 6 4 1 3 4

More information

Multiple-Period Attribution: Residuals and Compounding

Multiple-Period Attribution: Residuals and Compounding Multple-Perod Attrbuton: Resduals and Compoundng Our revewer gave these authors full marks for dealng wth an ssue that performance measurers and vendors often regard as propretary nformaton. In 1994, Dens

More information

Linear Circuits Analysis. Superposition, Thevenin /Norton Equivalent circuits

Linear Circuits Analysis. Superposition, Thevenin /Norton Equivalent circuits Lnear Crcuts Analyss. Superposton, Theenn /Norton Equalent crcuts So far we hae explored tmendependent (resste) elements that are also lnear. A tmendependent elements s one for whch we can plot an / cure.

More information

A hybrid global optimization algorithm based on parallel chaos optimization and outlook algorithm

A hybrid global optimization algorithm based on parallel chaos optimization and outlook algorithm Avalable onlne www.ocpr.com Journal of Chemcal and Pharmaceutcal Research, 2014, 6(7):1884-1889 Research Artcle ISSN : 0975-7384 CODEN(USA) : JCPRC5 A hybrd global optmzaton algorthm based on parallel

More information

Causal, Explanatory Forecasting. Analysis. Regression Analysis. Simple Linear Regression. Which is Independent? Forecasting

Causal, Explanatory Forecasting. Analysis. Regression Analysis. Simple Linear Regression. Which is Independent? Forecasting Causal, Explanatory Forecastng Assumes cause-and-effect relatonshp between system nputs and ts output Forecastng wth Regresson Analyss Rchard S. Barr Inputs System Cause + Effect Relatonshp The job of

More information

ESTABLISHING TRADE-OFFS BETWEEN SUSTAINED AND MOMENTARY RELIABILITY INDICES IN ELECTRIC DISTRIBUTION PROTECTION DESIGN: A GOAL PROGRAMMING APPROACH

ESTABLISHING TRADE-OFFS BETWEEN SUSTAINED AND MOMENTARY RELIABILITY INDICES IN ELECTRIC DISTRIBUTION PROTECTION DESIGN: A GOAL PROGRAMMING APPROACH ESTABLISHIG TRADE-OFFS BETWEE SUSTAIED AD MOMETARY RELIABILITY IDICES I ELECTRIC DISTRIBUTIO PROTECTIO DESIG: A GOAL PROGRAMMIG APPROACH Gustavo D. Ferrera, Arturo S. Bretas, Maro O. Olvera Federal Unversty

More information

21 Vectors: The Cross Product & Torque

21 Vectors: The Cross Product & Torque 21 Vectors: The Cross Product & Torque Do not use our left hand when applng ether the rght-hand rule for the cross product of two vectors dscussed n ths chapter or the rght-hand rule for somethng curl

More information

INSTITUT FÜR INFORMATIK

INSTITUT FÜR INFORMATIK INSTITUT FÜR INFORMATIK Schedulng jobs on unform processors revsted Klaus Jansen Chrstna Robene Bercht Nr. 1109 November 2011 ISSN 2192-6247 CHRISTIAN-ALBRECHTS-UNIVERSITÄT ZU KIEL Insttut für Informat

More information

An Overview of Financial Mathematics

An Overview of Financial Mathematics An Overvew of Fnancal Mathematcs Wllam Benedct McCartney July 2012 Abstract Ths document s meant to be a quck ntroducton to nterest theory. It s wrtten specfcally for actuaral students preparng to take

More information

Inter-Ing 2007. INTERDISCIPLINARITY IN ENGINEERING SCIENTIFIC INTERNATIONAL CONFERENCE, TG. MUREŞ ROMÂNIA, 15-16 November 2007.

Inter-Ing 2007. INTERDISCIPLINARITY IN ENGINEERING SCIENTIFIC INTERNATIONAL CONFERENCE, TG. MUREŞ ROMÂNIA, 15-16 November 2007. Inter-Ing 2007 INTERDISCIPLINARITY IN ENGINEERING SCIENTIFIC INTERNATIONAL CONFERENCE, TG. MUREŞ ROMÂNIA, 15-16 November 2007. UNCERTAINTY REGION SIMULATION FOR A SERIAL ROBOT STRUCTURE MARIUS SEBASTIAN

More information

1. Fundamentals of probability theory 2. Emergence of communication traffic 3. Stochastic & Markovian Processes (SP & MP)

1. Fundamentals of probability theory 2. Emergence of communication traffic 3. Stochastic & Markovian Processes (SP & MP) 6.3 / -- Communcaton Networks II (Görg) SS20 -- www.comnets.un-bremen.de Communcaton Networks II Contents. Fundamentals of probablty theory 2. Emergence of communcaton traffc 3. Stochastc & Markovan Processes

More information

The Development of Web Log Mining Based on Improve-K-Means Clustering Analysis

The Development of Web Log Mining Based on Improve-K-Means Clustering Analysis The Development of Web Log Mnng Based on Improve-K-Means Clusterng Analyss TngZhong Wang * College of Informaton Technology, Luoyang Normal Unversty, Luoyang, 471022, Chna wangtngzhong2@sna.cn Abstract.

More information