High-Speed Decoding of the Binary Golay Code
|
|
- Barnaby Morris
- 7 years ago
- Views:
Transcription
1 Hgh-Speed Decodng of the Bnary Golay Code H. P. Lee *1, C. H. Chang 1, S. I. Chu 2 1 Department of Computer Scence and Informaton Engneerng, Fortune Insttute of Technology, Kaohsung 83160, Tawan *hpl@fotech.edu.tw 2 Department of Electronc Engneerng, Natonal Kaohsung Unversty of Appled Scences, Kaohsung 807, Tawan ABSTRACT Recently, some table-lookup decodng algorthms (TLDAs) have been used to correct the bnary Golay code. Ths paper proposes an effcent hgh-speed TLDA called message-syndrome decodng algorthm (MSDA) by usng the message syndrome to correct the bnary systematc Golay code. The proposed MSDA s based on the novel message-syndrome lookup table (MSLT). The MSLT merely conssts of 12 canddate syndromes and ts memory sze s sgnfcantly smaller than other exstng lookup tables. Computer software smulaton results show that the decodng speed of the proposed MSDA s superor to other proposed TLDAs. Keywords: Golay code, weght, syndrome, error pattern 1. Introducton The well-known bnary Golay code, also called the bnary (23, 12, 7) quadratc resdue (QR) code [2], was frst dscovered by Golay [1] n It s a very useful perfect lnear errorcorrectng code; partcularly, t has been used n the past decades for a varety of applcatons nvolvng a party bt beng added to each word to yeld a half-rate code called the bnary (24, 12, 8) extended Golay code. One of ts most nterestng applcatons s the provson of error control n the Voyager mssons [2]. The Golay code can allow the correcton of up to t ( d 1)/ 2 = ( 7 1)/ 2 3 errors, where x denotes the greatest nteger less than or equal to x, t s the error-correctng capablty, and d s the mnmum Hammng dstance of the code. In the past few decades, several decodng technques have been developed to decode the bnary Golay codes, for example, the famous algebrac decodng algorthm (ADA) developed by Ela [3], the notable shft-search algorthm proposed by Reed et al. [4] after that, and the nverse-free Berlekamp Massey algorthm used to obtan the error-locator polynomal by Chen et al. [5]. The above s some representatve lterature on ADAs used to correct Golay codes. Recently, the TLDAs gven n [6-9] have acqured a promnent role n error-correctng decodng. A TLDA wth a refned lookup table (RLT) has been proposed by Ln et al. [8]; the RLT only needs 168 bytes memory sze. The memory sze of the RLT s the smallest memory sze requred to correct the Golay code untl now. In general, the TLDA makes consderably faster decodng speeds possble for the cyclc codes, n comparson wth the ADA. However, the TLDA requres an extra memory space n the decoder chp or software and t ncreases the decodng cost rapdly when the code length s large. Although the ADA does not need any lookup table, t requres a large number of complcated computatons n the fnte feld. These complcated computatons wll degrade the decodng performance and lead to a serous decodng delay as the code length ncreases []. Chen et al. [7] proposed the fast lookup table decodng algorthm (FLTDA) wth a lookup table of 1.35K bytes by usng the shft-search algorthm [4] to decode the Golay code. The famous syndrome decodng algorthm (SDA) wth a reduced-sze lookup table (RSLT) gven n [2, p9] requres 89 syndromes and ther correspondng error patterns, whereas the RSLT requres 445 bytes of memory. Journal of Appled Research and Technology 331
2 Hgh Speed Decodng of the Bnary Golay Code, H. P. Lee et al. / Ln et al. [8] proposed the syndrome-weght decodng algorthm (SWDA) wth RLT whch needs 168 bytes of memory, and the smulaton result shows that the decodng speed s approxmately 9.7 tmes faster than the mproved Ela s decodng algorthm (EDA). In ths paper, an effcent hgh-speed MSDA wth a MSLT s proposed to decode the bnary systematc Golay code. The novel MSLT conssts only of 12 canddate syndromes whch have one error n the message part of the receved vector, and t merely requres 24 bytes of memory. Software smulaton results show that the average decodng speed s the fastest among the TLDAs as mentoned above. In the four-error soft-decson decoder n [], the mproved EDA s the role of the hard-decson decoder. We substtuted the proposed MSDA for the mproved EDA n the four-error soft-decson decoder. Apparently, the decodng speed of the soft-decson decoder was faster than before. The remander of ths paper s organzed as follows: The background of the bnary systematc Golay code s brefly revewed n Secton 2. Some related TLDAs and related theorems are brefly ntroduced n Secton 3. The proposed MSDA s presented n Secton 4. Computer smulaton results are gven n Secton 5. Fnally, ths paper concludes wth a bref summary n Secton Background of the bnary systematc Golay code The bnary (23, 12, 7) Golay code can be defned as a lnear cyclc code or QR code [2]. For the bnary Golay code over fnte feld GF(2 ), ts quadratc resdue set s gven by Q 23 = { j 2 mod 23 for 1 j 22} = {1, 2, 3, 4, 6, 8, 9, 12, 13, 16, 18}. (1) The generator polynomal g(x) of the bnary Golay code s defned by g( x) x Q23 x ( x β 9 x 7 ) x 6 x 5 x 1, (2) where s a prmtve 23rd root of unty n GF(2 ). n Let the codeword polynomal 1 C ( x) 0C x, where C GF(2) for 0 22, and the message k polynomal 1 m ( x) 0 m x, where k = 12 s the message length and m GF(2) for 0. C(x) s a multple of g(x), namely, C(x) = m(x)g(x). Also, let the product m(x)x dvde by g(x), then one has m(x)x = q(x)g(x) + d(x). Multplyng both sdes of last expresson by x 12 and usng x 23 = 1, one yelds d(x)x 12 + m(x) = (q(x)x 12 )g(x). The term (d(x)x 12 + m(x)), whch s a multple of g(x), s a systematc codeword gven by c(x) = d(x)x 12 + m(x) = p(x) + m(x), (3) 22 where p ( x ) 12 p x denotes the party-check polynomal [12] of a codeword and p GF(2) for The bnary systematc Golay code s practcally appled n the standard of the communcaton system for automatc lnk establshment (ALE) by the Unted States Department of Defense [13]. Now, let a 12-bt message be encoded nto a 23- bt systematc codeword and be transmtted through a nosy channel to obtan a receved word of the form r(x) = c(x) + e(x). 22 e ( x ) 0 e x s the error pattern polynomal, where e GF(2) for The syndromes of the code are defned by s r( ) c( ) e( ), (4) e( ) where Q j j 0 e j ( ) To smplfy the polynomal expressons above, the message, codeword, error pattern, receved word, and syndrome polynomals can be expressed as the bnary vector forms m = (m... m 1 m 0 ), c = (c c 1 c 0 ), e = (e e 1 e 0 ), r = c + e = (r r 1 r 0 ), and s = (s... s 1 s 0 ), respectvely. For the bnary systematc Golay code, t follows from [2, p85] that the systematc generator matrx G can be expressed as follows: 332 Vol., June 2013
3 Hgh Speed Decodng of the Bnary Golay Code, H. P. Lee et al. / I12 G PI , (5) where P and I 12 denote the 12 matrx and the 1212 dentty matrx, respectvely. The systematc vector form of the codeword can be obtaned by c mg ( p p p m m 0 ). (6) m The party-check polynomal h(x) = x 12 + x + x 7 + x 4 + x 3 + x 2 + x + 1 s a factor of x The 23 party-check matrx H can be expressed as follows: T I P 23 H, (7) where P T s a 12 transpose matrx of P and I s a dentty matrx. The H T denotes the 23 transpose matrx of H; I that s, H T. The vector form of the P 23 syndrome can be defned by s = rh T. (8) The followng lemma gven n [14] shows that the mappng between the syndromes and error patterns under the error-correctng capablty s one-to-one. Lemma 1. The mappng between the syndromes of a code and the correspondng error patterns of weght t s one-to-one. 3. Related work and theorems In ths secton, some related TLDAs and theorems are brefly ntroduced n order to develop the proposed MSDA. For the TLDA, the followng defnton, theorems and corollary gven n [9] are needed. Defnton 1. Let the Hammng norm or weght of a bnary vector a = (a n-1... a 1 a 0 ) be desgnated by w(a). The Hammng dstance between two bnary vectors a and b s defned by d(a, b) = w(a + b). Theorem 1. Let a = (a n-1... a 1 a 0 ) and b = (b n-1... b 1 b 0 ) be two bnary vectors, then w(a + b) = w(a) + w(b) 2 1 a b. (9) Corollary 1. Let a and b, defned n Defnton 1, be two bnary vectors. If a b = 0 for 1 n, then w(a + b) = w(a) + w(b). () Theorem 2. For the bnary systematc (n, k, d) QR codes, let us assume that there are v errors n the receved word, where 1 v t. All v errors occur n the n k party-check bts f and only f the weght of syndrome w(s) = v. As mentoned above, the error-correctng capablty of the bnary Golay code s t =3. The full lookup table (FLT) n the conventonal table lookup decodng 3 23 algorthm (CTLDA) requres n 1 = 2,047 syndromes and ther correspondng error patterns by Lemma 1. Each syndrome and error pattern needs 2 bytes and 3 bytes, respectvely, to store n the FLT. Thus, the total memory sze needed for the FLT s (2047 (2 + 3)) =,235 bytes. However, such a large memory s less effcent n practce. Recently, some useful TLDAs have been presented n the lterature to reduce the memory sze of the FLT. The LTDA [7] used the shftsearch method [4] to reduce the memory sze of the FLT and the bnary-search method to reduce the search tme n the FLT. The shft-search method deletes all v = t error patterns and keeps 1 v t 1 error patterns. Journal of Appled Research and Technology 333
4 Hgh Speed Decodng of the Bnary Golay Code, H. P. Lee et al. / t Therefore, the LTDA needs syndromes and ther correspondng error patterns; that s, the FLT needs 276 (2 + 3) = 1,380 bytes memory sze. Nevertheless, the memory sze of the FLT s stll large and the smulaton result shows that the average decodng tme of the proposed MSDA s about.6 tmes faster that the LTDA. To develop the followng TLDAs, Theorem 3 s useful to reduce the memory sze of the FLT. The well-known SDA wth RSLT [2, p9] has the followng useful theorem of the cyclc codes to dramatcally reduce the memory sze of the FLT. For more detaled proof of ths theorem, see [2, p8]. Theorem 3. Let s(x) be the syndrome polynomal correspondng to a receved polynomal r(x). Also, let r (1) (x) be the polynomal obtaned by cyclcally shftng the coeffcents of r(x) one bt to the left. Then the remander obtaned when dvdng xs(x) by g(x) s the syndrome s (1) (x) correspondng to r (1) (x). Decodng the bnary systematc Golay code by Theorem 3, the RSLT of the SDA only needs 1/23 memory sze of the FLT, namely,235/23 = 445 bytes memory sze [8]. Nonetheless, the memory sze of the RSLT s stll large and can be further reduced. Smlarly, by Theorem 3, r (j) (x) s the polynomal obtaned by cyclcally shftng the coeffcents of r(x) j bts to the left. Next, the syndrome dfference s d s defned by s d = s s for 1 N, where s s the syndrome of r, s s the syndrome n lookup table, and N s the table sze. ( j ) Smlarly, the syndrome dfference s s defned by s ( j ) d s ( j ) s for 1 j n, where s (j) d s the syndrome of r (j). By usng the property of the syndrome dfference, the RLT of the SWDA only requres 168 bytes. However, the decodng speed s not very outstandng accordng to the smulaton result. To overcome ths problem, the MSDA s presented by usng the syndrome that only one error occurred n the message part of the receved word. 4. MSDA for the bnary Golay code In ths secton, an effcent hgh-speed MSDA wth a MSLT for decodng the bnary systematc Golay code s developed to further reduce the decodng tme and the memory sze of the RLT. By Theorem 2 and (8), t s obvous that at least one error s n the message bts f the weght of syndrome w(s) > 3. Defnton 2. The message-syndrome lookup table (MSLT) s a table of all the error patterns occurred n the message part wth weght 1 v t / 2 together wth ther correspondng syndromes, where x denotes the smallest nteger less than or equal to x. Therefore, the novel MSLT merely conssts of 12 canddate syndromes whch are the syndromes of havng one error n the message part; that s, s s the syndrome of e whch s one error located at bt for The MSLT s lsted n Table 1. Syndrome Syndrome s 1 = (00) s 2 = (0) s 3 = (00) s 4 = (0) s 5 = (1) s 6 = (000) s 7 = (00) s 8 = (00) s 9 = (001) s = (01) s = (01) s 12 = (01) Table 1. MSLT for the Bnary Systematc Golay Code. To develop the proposed MSDA by usng the MSLT, the followng lemma and propertes are necessary. Lemma 2. For the bnary Golay code, let e be an error pattern, and let e p and e m be ts party-check part and message part, respectvely. Let s p and s m be the syndromes correspondng to e p and e m, respectvely. Assume that w(e) 3, then we have () w(s p ) = w(e p ); () w(s m ) d w(e m ), where d = 7; () ((s m << 12) + e m ) s always a codeword, where << denotes the logcal left shft operator n programmng or the extenson by zeros on the rght n mathematcs. Proof: By Equaton (8), () s obvous. Agan, by Equaton (8), gven that ((s m << 12) + e m )H T = ((s m I << 12) + e m ) I = (sm << 12) I P + e m P = s m P + s m = 0, ((s m << 12)+ e m ) s thus a codeword, whch proves (). Hence, w((s m << 12) + e m ) = w(s m ) + w(e m ) d, that s, w(s m ) d w(e m ). The proof s thus completed. 334 Vol., June 2013
5 Hgh Speed Decodng of the Bnary Golay Code, H. P. Lee et al. / By Lemma 2, f v t, then one can obtan the followng two propertes. Property 1. For the bnary Golay code, the weght of the syndrome dfference w(s d ) has the followng cases: Case 1: If w(s) 3, then all three errors are n the party-check part and no error s n the message part. Case 2: If w(s) > 3 and w(s d ) < 3, then only 1 error s n the message part. Case 3: If w(s) > 3 and w(s d ) > 3, than at least 2 errors are n the message part. Next, for Case 3 of Property 1, the r and s are cyclcally shfted left by bts, then one obtans r and s, respectvely. Thus, one yelds the followng property. Property 2 For the bnary Golay code, f w(s) > 3 and w(s d ) > 3, then the weght of s and s d have the followng cases: Case 1: If w(s ) = 2 or 3, then r has at least 2 errors n the message part and no error s n the party-check part. d Case 2: If w(s ) > 3 and w( s ) 2, then r has at least 2 errors n the message part. d Case 3: If w(s ) > 3 or w( s ) > 3, then 2 errors are n the message part and one of them s at the poston of bt 0. By usng the MSLT, the decodng process of the MSDA s as follows: (1) Gvng a receved vector r. (2) Compute the syndrome s = rh T and ts weght w(s). (3) If w(s) 3, then return c = r (s << 12), and go to step 13. (4) For 1 12, compute the syndrome s d = s s and ts weght w(s d ). (5) If w(s d ) 2, then return c = r (s d << 12) (1 << ( 1)), and go to step 13. (6) Cyclcally shft r and s left by bts obtanng r and s, and then compute w(s ). (7) If w(s ) = 2 or 3, then return c = ((r (s << 12)) << 12) ((r (s << 12)) >> ), and go to step 13. (8) For 1 12, compute the syndrome d = s s and ts weght w( s ). d s d (9) If w( s ) = 1 or 2, then return c = ((r ( s d << 12) (1 << ( 1))) << 12) ((r d ( s << 12) (1 << ( 1))) >> ), and go to step 13. () Compute r = r 1 and s = s s 1. For 2 12, compute the syndrome s d = s s and ts weght w(s d ). (12) If w(s d ) = 1, then return c = r (s d << 12) (1 << ( 1)). (13) Stop. An example s gven below. By (6), a message vector m = ( ) s encoded nto a bnary systematc Golay code c = ( ). Assume that a nose vector s e = ( ), then the receved word becomes r = c + e = ( ). The decodng steps proceed as follows: (1) The receved vector s r = ( ). (2) Compute the syndrome s = (00000) and ts weght w(s) = 5. (3) Gven that w(s) > 3, go to step 4. (4) For = 1, compute the syndrome s d1 = s s 1 = () and ts weght w(s d1 ) = 7. Journal of Appled Research and Technology 335
6 Hgh Speed Decodng of the Bnary Golay Code, H. P. Lee et al. / (5) Gven that w(s d1 ) > 2, go to step 4. repeatng steps 4 and 5 (4) For = 12, compute the syndrome s d12 = s s 12 = (00) and ts weght w(s d12 ) = 7. (5) Gven that w(s d12 ) > 2, go to step 6. (6) Cyclcally shft r and s left by bts obtanng r = ( ) and s = (0), and then compute w(s ) = 7. (7) Gven that w(s ) 2 or 3, go to step 8. (8) For = 1, compute the syndrome s d1 = s s 1 = (001) and ts weght d1 w( s ) = 7. d1 (9) Gven that w( s ) > 2, go to step 8. repeatng steps 8 and 9 (8) For = 12, compute the syndrome s d12= s s 12 = (000) and ts weght d12 w( s ) = 5. d12 (9) Gven that w( s ) > 2, go to step. () Compute r = r 1 = ( ) and s = s s 1 = (). For = 2, compute the syndrome s d2 = s s 2 = (00) and ts weght w(s d2 ) = 5. (12) Gven that w(s d2 ) > 1, go to step. repeatng steps and 12 (13) For = 8, compute the syndrome s d8 = s s 8 = ( ) and ts weght w(s d8 ) = 1. (12) (14) If w(s d8 ) = 1, then return the correct codeword c = r1 (s d8 << 12) (1 << ( 1)) = ( ) ( ) (000000) = ( ). Go to step 13. (13) (15) Stop. Therefore, the correct message can be retreved from the receved vector. 5. Smulaton results The proposed MSDA has been programmed n C++ language. On an Intel Q6600 PC, all codewords wth up to three errors, namely C 8, receved vectors, were created to check every possble error pattern. The detaled decodng tmes for decodng the bnary systematc Golay code wth dfferent decodng algorthms are gven n Table 2. The proposed MSDA has the fastest average decodng tme and works perfectly wth an average decodng tme of μs per error pattern. Algorthms Proposed MSDA SDA wth RSLT FLTDA wth table SWDA wth RLT Improved EDA Number of errors Average Table 2. Computer Decodng Tme for Decodng the Bnary Golay Code (n μs). From Table 2, the proposed MSDA has the fastest average decodng tme and s about 44.5 tmes faster than the mproved EDA. Furthermore, we substtuted the proposed MSDA for the mproved EDA n the four-error soft-decson decoder []. Apparently, the decodng speed of the softdecson decoder was about 44.5 tmes faster than before. The decodng tme of the two hard-decson decoders wth respect to the SNR values s shown n Fgure Conclusons Ths paper presented a smple and more effcent decodng algorthm for decodng the bnary systematc Golay code. The key deas of the MSDA are based on the propertes of cyclc codes, the one-error syndrome n the message part, the weght of syndrome, the weght of syndrome 336 Vol., June 2013
7 Hgh Speed Decodng of the Bnary Golay Code, H. P. Lee et al. / dfference, Property 1, and Property 2. The MSLT of the MSDA merely requres a very small memory sze of 24 bytes. These facts lead to a substantal mprovement n decodng the bnary systematc Golay code. Smulaton results show that, followng the new decodng strateges, the proposed MSDA acheves the best effcency. Hence, t s naturally sutable and proper for DSP or embedded system software mplementaton. [7] Y. H. Chen et al., Effcent decodng of systematc (23, 12, 7) and (41, 21, 9) quadratc resdue codes, J Inf Sc Eng, vol. 26, no. 5, pp , 20. [8] T. C. Ln et al., On the decodng of the (24, 12, 8) Golay code, Inf Sc, vol. 180, no. 23, pp , 20. [9] T. C. Ln et al., Hgh speed decodng of the bnary (47, 24, ) quadratc resdue code, Inf Sc, vol. 180, no. 20, pp , 20. [] S. Ln and E. J. Jr Weldon, Long BCH codes are bad, Inf Contr, vol., no. 4, pp , [] S. I. Chu et al., Fast decodng of the (23, 12, 7) Golay code wth four-error-correctng capablty, Eur Trans Telecomm, vol, 22, no. 7, pp , 20. [12] C. A. Vázquez-Fernández and G. Vega-Hernández, On the Weght Dstrbuton of the Dual of some Cyclc Codes wth Two Non Conjugated Zeros, J Appl Res Technol, vol.9, no.1, pp , 20. [13] MIL-STD-188/141B. Department of Defense Interface Standard: Interoperablty and Performance Standards for Medum and Hgh Frequency Rado Systems. STD+( )/MIL_STD_188_141B_1703. Fgure 1. Decodng Tme of Two Hard-Decson Decoders at SNR of 0~6 db. References [14] I. S Reed et al., The algebrac decodng of the (41, 21, 9) quadratc resdue code, IEEE Trans Inf Theory, vol. 38, no. 3, pp , [1] M. Golay, Notes on dgtal codng, Proc. IRE, vol. 37, p. 657, [2] S. Wcker, "Error Control Systems for Dgtal Communcaton and Storage, Prentce Hall: Upper Saddle Rver, NJ, [3] M. Ela, Algebrac decodng of the (23, 12, 7) Golay code, IEEE Trans Inf Theory, vol. 33, no. 1, pp , [4] I. S. Reed et al., Decodng the (24, 12, 8) Golay code, IEE P-COMPUT DIG T, vol. 137, no. 3, pp , [5] Y. H. Chen et al., Algebrac decodng of quadratc resdue codes usng Berlekamp-Massey algorthm, J Inf Sc Eng, vol. 23, no. 1, 2007, pp [6] H. Chang et al., A weght method of decodng the (23, 12, 7) Golay code Usng Reduced Lookup Table, 2008 Internatonal Conference On Communcaton, Crcuts and Systems (ICCCAS 2008), Xamen, Chna, 2008, pp Journal of Appled Research and Technology 337
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 informationModule 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 informationRecurrence. 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 informationForecasting the Direction and Strength of Stock Market Movement
Forecastng the Drecton and Strength of Stock Market Movement Jngwe Chen Mng Chen Nan Ye cjngwe@stanford.edu mchen5@stanford.edu nanye@stanford.edu Abstract - Stock market s one of the most complcated systems
More informationThe 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 information8.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 informationForecasting the Demand of Emergency Supplies: Based on the CBR Theory and BP Neural Network
700 Proceedngs of the 8th Internatonal Conference on Innovaton & Management Forecastng the Demand of Emergency Supples: Based on the CBR Theory and BP Neural Network Fu Deqang, Lu Yun, L Changbng School
More informationBERNSTEIN 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 information1 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 informationRESEARCH ON DUAL-SHAKER SINE VIBRATION CONTROL. Yaoqi FENG 1, Hanping QIU 1. China Academy of Space Technology (CAST) yaoqi.feng@yahoo.
ICSV4 Carns Australa 9- July, 007 RESEARCH ON DUAL-SHAKER SINE VIBRATION CONTROL Yaoq FENG, Hanpng QIU Dynamc Test Laboratory, BISEE Chna Academy of Space Technology (CAST) yaoq.feng@yahoo.com Abstract
More informationMinimal 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 informationA 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"Research Note" APPLICATION OF CHARGE SIMULATION METHOD TO ELECTRIC FIELD CALCULATION IN THE POWER CABLES *
Iranan Journal of Scence & Technology, Transacton B, Engneerng, ol. 30, No. B6, 789-794 rnted n The Islamc Republc of Iran, 006 Shraz Unversty "Research Note" ALICATION OF CHARGE SIMULATION METHOD TO ELECTRIC
More informationAn Interest-Oriented Network Evolution Mechanism for Online Communities
An Interest-Orented Network Evoluton Mechansm for Onlne Communtes Cahong Sun and Xaopng Yang School of Informaton, Renmn Unversty of Chna, Bejng 100872, P.R. Chna {chsun,yang}@ruc.edu.cn Abstract. Onlne
More informationv 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 informationA DATA MINING APPLICATION IN A STUDENT DATABASE
JOURNAL OF AERONAUTICS AND SPACE TECHNOLOGIES JULY 005 VOLUME NUMBER (53-57) A DATA MINING APPLICATION IN A STUDENT DATABASE Şenol Zafer ERDOĞAN Maltepe Ünversty Faculty of Engneerng Büyükbakkalköy-Istanbul
More informationAdaptive Fractal Image Coding in the Frequency Domain
PROCEEDINGS OF INTERNATIONAL WORKSHOP ON IMAGE PROCESSING: THEORY, METHODOLOGY, SYSTEMS AND APPLICATIONS 2-22 JUNE,1994 BUDAPEST,HUNGARY Adaptve Fractal Image Codng n the Frequency Doman K AI UWE BARTHEL
More informationWe 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 informationA Study on Secure Data Storage Strategy in Cloud Computing
Journal of Convergence Informaton Technology Volume 5, Number 7, Setember 00 A Study on Secure Data Storage Strategy n Cloud Comutng Danwe Chen, Yanjun He, Frst Author College of Comuter Technology, Nanjng
More informationADAPTIVE WIENER-TURBO SYSTEM AND ADAPTIVE WIENER-TURBO SYSTEMS WITH JPEG & BIT PLANE COMPRESSIONS
ISTANBUL UNIVERSITY JOURNAL OF ELECTRICAL & ELECTRONICS ENGINEERING YEAR VOLUME NUMBER : 2007 : 7 : 1 (257-276) ADAPTIVE WIENER-TURBO SYSTEM AND ADAPTIVE WIENER-TURBO SYSTEMS WITH JPEG & BIT PLANE COMPRESSIONS
More informationRing structure of splines on triangulations
www.oeaw.ac.at Rng structure of splnes on trangulatons N. Vllamzar RICAM-Report 2014-48 www.rcam.oeaw.ac.at RING STRUCTURE OF SPLINES ON TRIANGULATIONS NELLY VILLAMIZAR Introducton For a trangulated regon
More informationLaddered 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 informationNonbinary Quantum Error-Correcting Codes from Algebraic Curves
Nonbnary Quantum Error-Correctng Codes from Algebrac Curves Jon-Lark Km and Judy Walker Department of Mathematcs Unversty of Nebraska-Lncoln, Lncoln, NE 68588-0130 USA e-mal: {jlkm, jwalker}@math.unl.edu
More informationFrequency 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 informationConversion 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 informationSingle and multiple stage classifiers implementing logistic discrimination
Sngle and multple stage classfers mplementng logstc dscrmnaton Hélo Radke Bttencourt 1 Dens Alter de Olvera Moraes 2 Vctor Haertel 2 1 Pontfíca Unversdade Católca do Ro Grande do Sul - PUCRS Av. Ipranga,
More informationStudy on Model of Risks Assessment of Standard Operation in Rural Power Network
Study on Model of Rsks Assessment of Standard Operaton n Rural Power Network Qngj L 1, Tao Yang 2 1 Qngj L, College of Informaton and Electrcal Engneerng, Shenyang Agrculture Unversty, Shenyang 110866,
More informationDISTRIBUTED storage systems have been becoming increasingly
268 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 28, NO. 2, FEBRUARY 2010 Cooperatve Recovery of Dstrbuted Storage Systems from Multple Losses wth Network Codng Yuchong Hu, Ynlong Xu, Xaozhao
More informationHow To Understand The Results Of The German Meris Cloud And Water Vapour Product
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 informationA 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 informationLogical Development Of Vogel s Approximation Method (LD-VAM): An Approach To Find Basic Feasible Solution Of Transportation Problem
INTERNATIONAL JOURNAL OF SCIENTIFIC & TECHNOLOGY RESEARCH VOLUME, ISSUE, FEBRUARY ISSN 77-866 Logcal Development Of Vogel s Approxmaton Method (LD- An Approach To Fnd Basc Feasble Soluton Of Transportaton
More informationPerformance Analysis of Energy Consumption of Smartphone Running Mobile Hotspot Application
Internatonal Journal of mart Grd and lean Energy Performance Analyss of Energy onsumpton of martphone Runnng Moble Hotspot Applcaton Yun on hung a chool of Electronc Engneerng, oongsl Unversty, 511 angdo-dong,
More informationAN EFFICIENT GROUP AUTHENTICATION FOR GROUP COMMUNICATIONS
Internatonal Journal of Network Securty & Its Applcatons (IJNSA), Vol.5, No.3, May 2013 AN EFFICIENT GROUP AUTHENTICATION FOR GROUP COMMUNICATIONS Len Harn 1 and Changlu Ln 2 1 Department of Computer Scence
More informationCalculating 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 informationMAC Layer Service Time Distribution of a Fixed Priority Real Time Scheduler over 802.11
Internatonal Journal of Software Engneerng and Its Applcatons Vol., No., Aprl, 008 MAC Layer Servce Tme Dstrbuton of a Fxed Prorty Real Tme Scheduler over 80. Inès El Korb Ecole Natonale des Scences de
More informationLuby 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 informationThe 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 informationAutomated information technology for ionosphere monitoring of low-orbit navigation satellite signals
Automated nformaton technology for onosphere montorng of low-orbt navgaton satellte sgnals Alexander Romanov, Sergey Trusov and Alexey Romanov Federal State Untary Enterprse Russan Insttute of Space Devce
More informationWhat 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 informationMultiplication Algorithms for Radix-2 RN-Codings and Two s Complement Numbers
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 69364 Lyon Cedex 07 jean-luc.beuchat@ens-lyon.fr Jean-Mchel Muller
More informationHow To Calculate The Accountng Perod Of Nequalty
Inequalty and The Accountng Perod Quentn Wodon and Shlomo Ytzha World Ban and Hebrew Unversty September Abstract Income nequalty typcally declnes wth the length of tme taen nto account for measurement.
More informationA New Quality of Service Metric for Hard/Soft Real-Time Applications
A New Qualty of Servce Metrc for Hard/Soft Real-Tme Applcatons Shaoxong Hua and Gang Qu Electrcal and Computer Engneerng Department and Insttute of Advanced Computer Study Unversty of Maryland, College
More informationOn the Optimal Control of a Cascade of Hydro-Electric Power Stations
On the Optmal Control of a Cascade of Hydro-Electrc Power Statons M.C.M. Guedes a, A.F. Rbero a, G.V. Smrnov b and S. Vlela c a Department of Mathematcs, School of Scences, Unversty of Porto, Portugal;
More informationAn Analysis of Central Processor Scheduling in Multiprogrammed Computer Systems
STAN-CS-73-355 I SU-SE-73-013 An Analyss of Central Processor Schedulng n Multprogrammed Computer Systems (Dgest Edton) by Thomas G. Prce October 1972 Techncal Report No. 57 Reproducton n whole or n part
More informationA machine vision approach for detecting and inspecting circular parts
A machne vson approach for detectng and nspectng crcular parts Du-Mng Tsa Machne Vson Lab. Department of Industral Engneerng and Management Yuan-Ze Unversty, Chung-L, Tawan, R.O.C. E-mal: edmtsa@saturn.yzu.edu.tw
More informationINVESTIGATION OF VEHICULAR USERS FAIRNESS IN CDMA-HDR NETWORKS
21 22 September 2007, BULGARIA 119 Proceedngs of the Internatonal Conference on Informaton Technologes (InfoTech-2007) 21 st 22 nd September 2007, Bulgara vol. 2 INVESTIGATION OF VEHICULAR USERS FAIRNESS
More information8 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 informationLecture 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 information1. 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 informationAn Efficient Recovery Algorithm for Coverage Hole in WSNs
An Effcent Recover Algorthm for Coverage Hole n WSNs Song Ja 1,*, Wang Balng 1, Peng Xuan 1 School of Informaton an Electrcal Engneerng Harbn Insttute of Technolog at Weha, Shanong, Chna Automatc Test
More informationAn 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 informationIDENTIFICATION AND CORRECTION OF A COMMON ERROR IN GENERAL ANNUITY CALCULATIONS
IDENTIFICATION AND CORRECTION OF A COMMON ERROR IN GENERAL ANNUITY CALCULATIONS Chrs Deeley* Last revsed: September 22, 200 * Chrs Deeley s a Senor Lecturer n the School of Accountng, Charles Sturt Unversty,
More informationLoop Parallelization
- - Loop Parallelzaton C-52 Complaton steps: nested loops operatng on arrays, sequentell executon of teraton space DECLARE B[..,..+] FOR I :=.. FOR J :=.. I B[I,J] := B[I-,J]+B[I-,J-] ED FOR ED FOR analyze
More informationCalculation 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 informationOn fourth order simultaneously zero-finding method for multiple roots of complex polynomial equations 1
General Mathematcs Vol. 6, No. 3 (2008), 9 3 On fourth order smultaneously zero-fndng method for multple roots of complex polynomal euatons Nazr Ahmad Mr and Khald Ayub Abstract In ths paper, we present
More informationA Prefix Code Matching Parallel Load-Balancing Method for Solution-Adaptive Unstructured Finite Element Graphs on Distributed Memory Multicomputers
Ž. The Journal of Supercomputng, 15, 25 49 2000 2000 Kluwer Academc Publshers. Manufactured n The Netherlands. A Prefx Code Matchng Parallel Load-Balancng Method for Soluton-Adaptve Unstructured Fnte Element
More informationSolution: 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 informationOn-Line Fault Detection in Wind Turbine Transmission System using Adaptive Filter and Robust Statistical Features
On-Lne Fault Detecton n Wnd Turbne Transmsson System usng Adaptve Flter and Robust Statstcal Features Ruoyu L Remote Dagnostcs Center SKF USA Inc. 3443 N. Sam Houston Pkwy., Houston TX 77086 Emal: ruoyu.l@skf.com
More informationAn Evaluation of the Extended Logistic, Simple Logistic, and Gompertz Models for Forecasting Short Lifecycle Products and Services
An Evaluaton of the Extended Logstc, Smple Logstc, and Gompertz Models for Forecastng Short Lfecycle Products and Servces Charles V. Trappey a,1, Hsn-yng Wu b a Professor (Management Scence), Natonal Chao
More informationDamage detection in composite laminates using coin-tap method
Damage detecton n composte lamnates usng con-tap method S.J. Km Korea Aerospace Research Insttute, 45 Eoeun-Dong, Youseong-Gu, 35-333 Daejeon, Republc of Korea yaeln@kar.re.kr 45 The con-tap test has the
More informationMaster s Thesis. Configuring robust virtual wireless sensor networks for Internet of Things inspired by brain functional networks
Master s Thess Ttle Confgurng robust vrtual wreless sensor networks for Internet of Thngs nspred by bran functonal networks Supervsor Professor Masayuk Murata Author Shnya Toyonaga February 10th, 2014
More informationEfficient Bandwidth Management in Broadband Wireless Access Systems Using CAC-based Dynamic Pricing
Effcent Bandwdth Management n Broadband Wreless Access Systems Usng CAC-based Dynamc Prcng Bader Al-Manthar, Ndal Nasser 2, Najah Abu Al 3, Hossam Hassanen Telecommuncatons Research Laboratory School of
More informationImproved SVM in Cloud Computing Information Mining
Internatonal Journal of Grd Dstrbuton Computng Vol.8, No.1 (015), pp.33-40 http://dx.do.org/10.1457/jgdc.015.8.1.04 Improved n Cloud Computng Informaton Mnng Lvshuhong (ZhengDe polytechnc college JangSu
More informationAn Enhanced Super-Resolution System with Improved Image Registration, Automatic Image Selection, and Image Enhancement
An Enhanced Super-Resoluton System wth Improved Image Regstraton, Automatc Image Selecton, and Image Enhancement Yu-Chuan Kuo ( ), Chen-Yu Chen ( ), and Chou-Shann Fuh ( ) Department of Computer Scence
More informationPERRON 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 informationJ. Parallel Distrib. Comput.
J. Parallel Dstrb. Comput. 71 (2011) 62 76 Contents lsts avalable at ScenceDrect J. Parallel Dstrb. Comput. journal homepage: www.elsever.com/locate/jpdc Optmzng server placement n dstrbuted systems n
More informationQuantization 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 informationtaposh_kuet20@yahoo.comcsedchan@cityu.edu.hk rajib_csedept@yahoo.co.uk, alam_shihabul@yahoo.com
G. G. Md. Nawaz Al 1,2, Rajb Chakraborty 2, Md. Shhabul Alam 2 and Edward Chan 1 1 Cty Unversty of Hong Kong, Hong Kong, Chna taposh_kuet20@yahoo.comcsedchan@ctyu.edu.hk 2 Khulna Unversty of Engneerng
More informationSecure Network Coding Over the Integers
Secure Network Codng Over the Integers Rosaro Gennaro Jonathan Katz Hugo Krawczyk Tal Rabn Abstract Network codng has receved sgnfcant attenton n the networkng communty for ts potental to ncrease throughput
More informationSupport 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 information1. Measuring association using correlation and regression
How to measure assocaton I: Correlaton. 1. Measurng assocaton usng correlaton and regresson We often would lke to know how one varable, such as a mother's weght, s related to another varable, such as a
More informationData Broadcast on a Multi-System Heterogeneous Overlayed Wireless Network *
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 24, 819-840 (2008) Data Broadcast on a Mult-System Heterogeneous Overlayed Wreless Network * Department of Computer Scence Natonal Chao Tung Unversty Hsnchu,
More informationProject 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 informationAPPLICATION OF PROBE DATA COLLECTED VIA INFRARED BEACONS TO TRAFFIC MANEGEMENT
APPLICATION OF PROBE DATA COLLECTED VIA INFRARED BEACONS TO TRAFFIC MANEGEMENT Toshhko Oda (1), Kochro Iwaoka (2) (1), (2) Infrastructure Systems Busness Unt, Panasonc System Networks Co., Ltd. Saedo-cho
More informationTime Domain simulation of PD Propagation in XLPE Cables Considering Frequency Dependent Parameters
Internatonal Journal of Smart Grd and Clean Energy Tme Doman smulaton of PD Propagaton n XLPE Cables Consderng Frequency Dependent Parameters We Zhang a, Jan He b, Ln Tan b, Xuejun Lv b, Hong-Je L a *
More informationAn MILP model for planning of batch plants operating in a campaign-mode
An MILP model for plannng of batch plants operatng n a campagn-mode Yanna Fumero Insttuto de Desarrollo y Dseño CONICET UTN yfumero@santafe-concet.gov.ar Gabrela Corsano Insttuto de Desarrollo y Dseño
More informationResearch Article Enhanced Two-Step Method via Relaxed Order of α-satisfactory Degrees for Fuzzy Multiobjective Optimization
Hndaw Publshng Corporaton Mathematcal Problems n Engneerng Artcle ID 867836 pages http://dxdoorg/055/204/867836 Research Artcle Enhanced Two-Step Method va Relaxed Order of α-satsfactory Degrees for Fuzzy
More informationAn Adaptive and Distributed Clustering Scheme for Wireless Sensor Networks
2007 Internatonal Conference on Convergence Informaton Technology An Adaptve and Dstrbuted Clusterng Scheme for Wreless Sensor Networs Xnguo Wang, Xnmng Zhang, Guolang Chen, Shuang Tan Department of Computer
More informationPSYCHOLOGICAL RESEARCH (PYC 304-C) Lecture 12
14 The Ch-squared dstrbuton PSYCHOLOGICAL RESEARCH (PYC 304-C) Lecture 1 If a normal varable X, havng mean µ and varance σ, s standardsed, the new varable Z has a mean 0 and varance 1. When ths standardsed
More informationwhere 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 informationNON-CONSTANT SUM RED-AND-BLACK GAMES WITH BET-DEPENDENT WIN PROBABILITY FUNCTION LAURA PONTIGGIA, University of the Sciences in Philadelphia
To appear n Journal o Appled Probablty June 2007 O-COSTAT SUM RED-AD-BLACK GAMES WITH BET-DEPEDET WI PROBABILITY FUCTIO LAURA POTIGGIA, Unversty o the Scences n Phladelpha Abstract In ths paper we nvestgate
More informationShielding Equations and Buildup Factors Explained
Sheldng Equatons and uldup Factors Explaned Gamma Exposure Fluence Rate Equatons For an explanaton of the fluence rate equatons used n the unshelded and shelded calculatons, vst ths US Health Physcs Socety
More informationTHE APPLICATION OF DATA MINING TECHNIQUES AND MULTIPLE CLASSIFIERS TO MARKETING DECISION
Internatonal Journal of Electronc Busness Management, Vol. 3, No. 4, pp. 30-30 (2005) 30 THE APPLICATION OF DATA MINING TECHNIQUES AND MULTIPLE CLASSIFIERS TO MARKETING DECISION Yu-Mn Chang *, Yu-Cheh
More informationEnergy Efficient Routing in Ad Hoc Disaster Recovery Networks
Energy Effcent Routng n Ad Hoc Dsaster Recovery Networks Gl Zussman and Adran Segall Department of Electrcal Engneerng Technon Israel Insttute of Technology Hafa 32000, Israel {glz@tx, segall@ee}.technon.ac.l
More informationA heuristic task deployment approach for load balancing
Xu Gaochao, Dong Yunmeng, Fu Xaodog, Dng Yan, Lu Peng, Zhao Ja Abstract A heurstc task deployment approach for load balancng Gaochao Xu, Yunmeng Dong, Xaodong Fu, Yan Dng, Peng Lu, Ja Zhao * College of
More informationPRACTICE 1: MUTUAL FUNDS EVALUATION USING MATLAB.
PRACTICE 1: MUTUAL FUNDS EVALUATION USING MATLAB. INDEX 1. Load data usng the Edtor wndow and m-fle 2. Learnng to save results from the Edtor wndow. 3. Computng the Sharpe Rato 4. Obtanng the Treynor Rato
More informationNEURO-FUZZY INFERENCE SYSTEM FOR E-COMMERCE WEBSITE EVALUATION
NEURO-FUZZY INFERENE SYSTEM FOR E-OMMERE WEBSITE EVALUATION Huan Lu, School of Software, Harbn Unversty of Scence and Technology, Harbn, hna Faculty of Appled Mathematcs and omputer Scence, Belarusan State
More informationTHE DISTRIBUTION OF LOAN PORTFOLIO VALUE * Oldrich Alfons Vasicek
HE DISRIBUION OF LOAN PORFOLIO VALUE * Oldrch Alfons Vascek he amount of captal necessary to support a portfolo of debt securtes depends on the probablty dstrbuton of the portfolo loss. Consder a portfolo
More informationResearch Article A Time Scheduling Model of Logistics Service Supply Chain with Mass Customized Logistics Service
Hndaw Publshng Corporaton Dscrete Dynamcs n Nature and Socety Volume 01, Artcle ID 48978, 18 pages do:10.1155/01/48978 Research Artcle A Tme Schedulng Model of Logstcs Servce Supply Chan wth Mass Customzed
More informationImplementation 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 informationn + 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 informationAnalysis of Energy-Conserving Access Protocols for Wireless Identification Networks
From the Proceedngs of Internatonal Conference on Telecommuncaton Systems (ITC-97), March 2-23, 1997. 1 Analyss of Energy-Conservng Access Protocols for Wreless Identfcaton etworks Imrch Chlamtac a, Chara
More informationFisher Markets and Convex Programs
Fsher Markets and Convex Programs Nkhl R. Devanur 1 Introducton Convex programmng dualty s usually stated n ts most general form, wth convex objectve functons and convex constrants. (The book by Boyd and
More informationSimple Interest Loans (Section 5.1) :
Chapter 5 Fnance The frst part of ths revew wll explan the dfferent nterest and nvestment equatons you learned n secton 5.1 through 5.4 of your textbook and go through several examples. The second part
More informationCHOLESTEROL REFERENCE METHOD LABORATORY NETWORK. Sample Stability Protocol
CHOLESTEROL REFERENCE METHOD LABORATORY NETWORK Sample Stablty Protocol Background The Cholesterol Reference Method Laboratory Network (CRMLN) developed certfcaton protocols for total cholesterol, HDL
More informationMining Multiple Large Data Sources
The Internatonal Arab Journal of Informaton Technology, Vol. 7, No. 3, July 2 24 Mnng Multple Large Data Sources Anmesh Adhkar, Pralhad Ramachandrarao 2, Bhanu Prasad 3, and Jhml Adhkar 4 Department of
More informationRisk-based Fatigue Estimate of Deep Water Risers -- Course Project for EM388F: Fracture Mechanics, Spring 2008
Rsk-based Fatgue Estmate of Deep Water Rsers -- Course Project for EM388F: Fracture Mechancs, Sprng 2008 Chen Sh Department of Cvl, Archtectural, and Envronmental Engneerng The Unversty of Texas at Austn
More informationThe University of Texas at Austin. Austin, Texas 78712. December 1987. Abstract. programs in which operations of dierent processes mayoverlap.
Atomc Semantcs of Nonatomc Programs James H. Anderson Mohamed G. Gouda Department of Computer Scences The Unversty of Texas at Austn Austn, Texas 78712 December 1987 Abstract We argue that t s possble,
More informationExtending 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 informationPower-of-Two Policies for Single- Warehouse Multi-Retailer Inventory Systems with Order Frequency Discounts
Power-of-wo Polces for Sngle- Warehouse Mult-Retaler Inventory Systems wth Order Frequency Dscounts José A. Ventura Pennsylvana State Unversty (USA) Yale. Herer echnon Israel Insttute of echnology (Israel)
More information