Towards strong security in embedded and pervasive systems: energy and area optimized serial polynomial multipliers in GF(2 k )
|
|
- Ira Reed
- 6 years ago
- Views:
Transcription
1 Towards strong securty n ebedded and pervasve systes: energy and area optzed seral polynoal ultplers n GF( k ) Zoya Dyka, Peter Langendoerfer, Frank Vater and Steffen Peter IHP, I Technologepark 5, D-53 Frankfurt (Oder), Gerany Abstract In ths paper we dscuss a theoretcal approach to do early assessent of the area and power consupton of hardware accelerators for ellptc curve cryptography. For evaluaton we developed several dfferent one clock ultplers as buldng block for the fnal seral ultplers. The forer are evaluated concernng ther effcency n coparson to lterature and the results of our assessent technque are copared wth synthess results. Snce the applcaton areas we are nterested n are ebedded systes, pervasve coputng or wreless sensor networks we nvestgated seral ultplers n order to acheve reduced area and energy consupton copared to the sngle clock ultplers. Our evaluaton clearly shows that our approach provdes good hnts to select well suted pleentaton canddates. Keywords: ECC, GF( k ), polynoal ultplcaton I. INTRODUCTION Ebedded systes and wreless sensor networks have ganed sgnfcant nterest for beng used n crtcal applcaton areas such as ndustral control systes. Relablty and by that securty of those systes s of extreely hgh portance. But, for resource constrant devces the coputatonal effort of strong securty eans, especally when publc key cryptography s used are stll too costly. Durng recent years ellptc curve cryptography has ganed sgnfcant attenton. Ths s due to the fact that t provdes hgher securty than RSA whle consung sgnfcant fewer resources. I.e. ts keys are shorter and the coputatonal overhead s less. But, for resource constrant devces such as ebedded systes or wreless sensor nodes the coputatonal effort when realzed n software s stll too hgh. The alternatve s to pleent ECC operatons as hardware accelerators. The polynoal ultplcaton s costly and often executed when ECC s appled. Thus, t s the functon that has the hghest pact on area and/or energy consupton and by that t s the ost often researched functon for hardware pleentaton of ECC. Fndng the optu hardware accelerator s a te consung and dffcult task. On the one hand t needs to be as sall as possble to reduce producton costs, on the other hand t needs to be as energy effcent as possble snce the target syste s battery powered. One way to prove the hardware pleentaton of ECC s the optzaton of polynoal ultplcaton. There exst several approaches to nze the coplexty of the polynoal ultplcaton []-[8]. A very prosng approach to optze polynoal ultplers s to cobne these ethods [9]. If an optu cobnaton s found ths reduces the area and energy consupton sgnfcantly []. Another eans to reduce the area of ultplers s to prolong the calculaton te,.e. to spend several clock cycles to calculate the polynoal product as a su of partal products [], []. Deternng the ultpler wth the nal energy and/or area consupton s a tedous task especally when several ultplcaton ethods are taken nto account. In ths paper we present a eans to assess the gate coplexty of polynoal ultplers and dscuss ts applcablty usng 5 desgn alternatves as well as synthess results of the ost prosng pleentaton canddates. Our evaluaton shows that the coplexty assessent provdes good results well suted to select fro dfferent desgn choces. The rest of ths paper s structured as follows. In secton II we shortly ntroduce the background of polynoal ultplcaton and our coplexty assessent approach. After that we dscuss and evaluate one clock ultplers that we use later for realzng seral ultplers, and ther theoretcal gate coplexty. Then we nvestgate the resultng seral ultplers and ther gate coplexty. In secton III we evaluate our approach usng data fro the lterature as well as synthess results. The paper closes wth short conclusons. II. POLYNOMIAL MULTIPLIERS A. Defnton of polynoal ultplcaton Frst of all we gve the defnton of polynoal ultplcatons over extended bnary felds GF( k ). k k Let A( a x and B ( b x be eleents fro GF( k ) and f( be the rreducble polynoal of degree k generatng GF( k ). The ultplcaton of the eleents A( and B( s defned as follows: C '( A( B( od f ( C( od f (. () //$3. IEEE
2 The ultplcaton () can be perfored n two steps: the calculaton of the polynoal C( of degree (k-) and reducton of ths polynoal C( to the degree k. In ths paper we concentrate on the optzaton of the frst step of the ultplcaton only,.e. on the polynoal ultplcaton: C ( A( B( k c x, wth c a j bl k> j, k l j+ > l, The sybol n () denotes the Boolean operaton. Eleents of GF( k ) can be (and are usually) represented as k- k bts long bnary nubers: A (. a B. Gate coplexty of polynoal ultplcaton We descrbe the gate coplexty () of polynoal ultplcaton for k-bts operands by the exact nuber of the Boolean operatons # and by the exact nuber of the Boolean operatons #, because only these two operatons are needed to calculate the polynoal product (see ()) and because they are pleented n hardware by an or an gate respectvely. () (# ; ). (3) MM k # In (3) the MM shows the used ultplcaton ethod. The nal area and energy consupton of a ultpler can be calculated based on ts gate coplexty (3) and on the area and the energy consupton of the gates (Area, Area and E, E ) of the appled technology: Area E # # Area + # Area. (4) E + # E We use the followng odel for the average energy n (4): In our odel are consderng two nput and gates only. The energy consupton of the gates depends on ther nput values. If the nput values do not trgger any state change the consued energy s neglgble, otherwse.e. f nput values trgger state changes the consued energy s by far hgher and depend on the logc functon pleented by the gate and on whether the output changes fro zero to one or vce versa. In order to estate the energy consupton of desgn alternatves we use the average energy consupton of and gates (E, E ) whch we calculated fro the energy consupton of the followng four state changes for the IHP.3µ technology: - frst nput s ; second nput s and output changes to - frst nput s ; second nput s and output changes to - frst nput s ; second nput s and output changes to - frst nput s ; second nput s and output changes to. An addtonal challenge when calculatng the energy consupton stes fro the fact that not all gates are always flppng when the polynoal product s calculatng. Ths fact can be taken to account usng a statstcal coeffcent. For exaple, f n average only 5% of all gates are flppng forula (4) can be odfed as follows: E / (# E + # E ). The proble s that the nuber of the flppng gates of the polynoal ultpler depends on both ultplcands,.e. on the nputs. The usng of such statstcal coeffcents n the energy consupton odel of polynoals ultplers ght result n a sgnfcant dfference of the theoretcal and practcal results snce the latter are obtaned for the concrete ultplcand values. We are aware of the fact that our odel only very roughly approxates the real energy consupton but snce we are anly nterested n coparng pleentaton alternatves, and not n predctng concrete energy consupton values, we are convnced that our odel s well suted for assessng pleentaton canddates. There exst any ultplcaton ethods (MM) that can be appled to reduce the coplexty of polynoal ultplers: the classcal and the generalzed Karatsuba MM [] for n>; Karatsuba MM [] for - and Wnograd MM [3] for 3-ter operands, the latter two are the specal cases of the generalzed Karatsuba MM; Montgoery MM for 5-, 6- and 7-ter operands [5]. These approaches segent the ultplcands nto n saller -bts long parts (ters), whch are then ultpled. Of all these MMs the classcal MM requres the bggest nuber of partal ultplcatons. Other MMs lead to a reduced nuber of partal ultplcatons but requre ore -operatons copared to the classcal MM. The gate coplexty of these Karatsuba-lke ultplcaton ethods can be also descrbed usng a slghtly odfed.e. recursve defnton of the gate coplexty: (# MULT ; ) MM k n #, where (5) MM j MM the used MM; #MULT the nuber of partal ultplcatons, and MM j the gate coplexty of partal ultplers. The nuber of partal ultplcatons #MULT and the nuber of gates # depend on the selected ultplcaton ethod MM and on the segentaton n of the operands. The MM j knowledge of the gate coplexty of each partal ultpler as tuple (3) allows calculatng the gate coplexty of full k-bts ultplers. C. One clock ultplers A one clock ultpler, whch pleents the ultplcaton ethod MM and contans #MULT of partal ultplers (see (5)), can calculate the polynoal product n a sngle clock cycle. Each partal ultplcaton can be pleented by any ultplcaton ethod MM j or even by any cobnaton of ultplcaton ethods. Optal cobnatons of dfferent MMs can be deterned algorthcally [9]. In [] we presented the deternaton of area and/or energy optal cobnatons of 8 MMs wth reduced nuber of operatons.
3 In ths paper we descrbe the cobnaton of 3 MMs as descrbed n []. We deterned the area-optal cobnatons of these MMs for the IHP.3µ technology for all lengths of operands up to 6 bts. In order to benchark our results we are usng results fro [] and [9]. Snce these artcles gve the gate coplexty only for operands of a length up to 8 bts we reconstructed the gate coplexty for longer operands.e. up to 6 bts. We calculated the area of ultplers based on the reconstructed gate coplexty usng eq. (4). Fg. shows the calculated area of ultplers for polynoals of a length of up to 6 bts for both approaches used as bencharks and for our approach. The red curve n Fg. depcts the chp-area of ultplers that we calculated based on gate coplexty reconstructed fro []. The black curve depcts results we derved fro [9]. The area consupton of our approach (green curve n Fg.) s 33 per cent saller than the results represented by the red curve and about per cent saller than the results represented by the black curve. synthess of the ultplers apples often a sngle 3-nputs- gate nstead two -nputs- gates, reducng the resultng area and changng the energy consupton. The average devaton of the area of syntheszed ultplers fro the calculated one s about 7 %. The devaton of the energy values s uch larger,.e. approxately 6%. Ths devaton s caused by the followng facts: - not all gates are flppng causng the reducton of the theoretcally deterned energy consupton value - the energy consupton of each gate depends on ts nput values and by that the average value used n the calculaton already devates stronger fro the real values as n the case of the constant area paraeter. To obtan energy consupton values fro Table I we perfored a sequence of ore than ultplcatons usng rando nputs. For each gate of the ultplers ts energy consupton was collected. Based on these values the total power consupton of the ultpler and ts energy consupton per sngle clock cycle (.e. per ndvdual ultplcaton) were deterned. Table II shows the relaton of theoretcally calculated values and synthess results for area and energy for nvestgated ultplers usng the 64-bt partal ultpler as noralzaton value. TABLE II. RELATIONS OF PARAMETERS OF INVESTIGATED MULTIPLIERS Fgure. Calculated area of ultplers for an operand length of up to 6 bts for our approach (green lne) and approaches presented n [] (red lne) and [9] (black lne) respectvely Table I shows the paraeters of the syntheszed polynoal ultplers that we used as -bts partal ultplers n our seral n-bts polynoal ultpler. TABLE I., bts PARTIAL MULTIPLIERS: CALCULATED PARAMETERS SYNTHESIZED VALUES Gate Coplexty Theory area, energy, pj area, Synthess energy, pj 64 64(96 ; 387 ) (35 ; 94 ) (5 ; 3396 ) The area and energy of all syntheszed ultplers are saller than the theoretcal calculated values. Ths can be explaned by the followng fact: the calculaton of the area of ultplers s based on the area of -nputs- and -nputs- gates. In realty each technology provdes also other gate types. For exaple, the IHP.3µ technology [3] has also 3-nputs- gates. The Synopss tools [4], that we use for the, bts area, energy, pj Theory Synthess Theory Synthess D. Seral ultplers All partal products can be calculated seral wthn #MULT clock cycles usng a sngle -bts partal ultpler only (see (5)). Ths reduces the area of the k-bts polynoal ultpler sgnfcantly [], []. In seral ultplers the polynoal product wll be accuulated n output regsters. We explan ths process usng the exaple of the Wnograd MM for 3-ter polynoals,.e. for the case of the segentaton of the operands nto n3 - bts long ters. The ultplcaton forula for ths case s the followng: C ( C 5 C 4 C C C C A A A B B B A B 3 6 ( A B A B ( A A )( B B )) ( A B A B A B ( A A )( B B )) 3 4 ( A B A B ( A A )( B B )) A B Each partal product A B (or j (A A j )(B A j ) ) n (6) s (-)-bts long and can be wrtten as a su of two segents: the (-) ost sgnfcant bts, whch wll be denoted as [] and the reanng -bts denoted as []. (6) by results of [] we denote the data provded for the recursvely appled generalzed Karatsuba MM wth nal nuber of and gates.
4 [ ] + -bts bts bts (7) Eq. (8) s derved fro (6) by applyng (7): C [] C( [ ] [ ] [ ] C3 [] [] [] C 3 [] C4 [] [] [] [] 4 C C5 5 Eq. (8) can also be represented as a table In the rest of ths paper naed as table representaton, (TR), see Table II. The leftost colun shows both segents of the partal products,.e. all [d] and j [d], where d {,}. All other coluns correspond to an ndvdual product segent. If the product segent C s calculated by addng a partal product segent j [d], the cell of the TR wth 'coordnates' ( j [d], C ) s flled wth the sybol. Otherwse the cell s epty. TABLE III. TABLE REPRESENTATION OF 3-TERM-WINOGRAD-MM, INDICATES WHICH PARTIAL PRODUCTS NEED TO BE ADDED TO RETRIEVE C A B [] [] A B [] [] A B [] [] A B [] [] A B [] [] A B [] [] (A A ) (B B ) [] [] (A A ) (B B ) [] [] (A A ) (B B ) [] [] (A A ) (B B ) [] [] (A A ) (B B ) [] [] (A A ) (B B ) [] [] C 5 C 4 C 3 C C C Table III contans 6 dfferent partal products. They can be calculated wthn 6 clock cycles usng a sngle partal ultpler. In ths case only one partal product s avalable at the sae te. For each segent C the su of necessary segents of partal products can be accuulated wthn 6 clock cycles. Fg. shows the structure of the seral ultpler and Table IV shows the correspondng accuulaton plan. Fg. 3 and 4 show the accuulaton unts for dfferent segents of the polynoal products accordng to the accuulaton plan. (8) Clock cycle Fgure. Structure of our seral polynoal ultpler TABLE IV. ACCUMULATION PLAN FOR CALCULATION OF THE POLYNOMIAL PRODUCT ACCORDING TO TABLE II Avalable partal product Accuulaton plan C C []; C C [][]; C C [][]; C 3C 3[] C C []; C C [][]; C 3C 3[][]; C 4C 4[] 3 C C []; C 3C 3[][]; C 4C 4[][]; C 5C 5[] 4 C C []; C C [] 5 C C []; C 3C 3[] 6 C 3C 3[]; C 4C 4[] Fgure 3. The accuulaton unt for C : ths unt contans gates, gates and flp-flops to realze the -bts regster. The structure of the accuulaton unt for C n- s the sae, but the nput value s the (-)-bts long []. Fgure 4. Accuulaton unt for C, <<n-; ths unt contans (+-) gates, (-+) gates and flp-flops to realze the -bts regster. The gate coplexty of the k-bts seral polynoal ultplers can be descrbed accordng to ts structure (see Fg. ) as follows: n n + + Control calculaton Accuulat on unt of nputs for partal unt for C ultpler + (9)
5 The gate coplexty of the control unt s very sall copared to the area of other unts. Therefore (9) can be wrtten for the pleentaton of 33-bts ultplcaton as follows: n + ( 33 ; ( 33 ) ) + (( ) ; ( ) ) + ( ( ) ; ( ) ) + ( n ( n + ) ; n n 3 ) ( n ; ) + + () For the descrbed segentaton of ultplcands nto n3 ters the length of segents n () s equal to 78 bts. Eq. () can also be used for the calculaton of the gate coplexty of other 33-bts seral ultplers, f they have the sae structure. Eq. () doesn t contan the nuber of flp-flops (see Fg. 3 and 4) because each ultpler contans the sae nuber of flp-flops for the output values ndependently of the pleented ultplcaton ethod. III. EVALUATION OF THEORETICAL DATA In ths secton we dscuss the theoretcal perforance paraeters of the ultplers we nvestgated. The executon te of the ultplcaton s an portant paraeter. We nvestgated the seral polynoal ultplers, whch can calculate the polynoal product n less than 3 clock cycles. We calculated the area and energy consupton for the followng MMs usng eq. (): - n-ter Karatsuba MM wth <n 7 - n-ter Wnograd MM wth <n 7 - generalzed n-ter Karatsuba MM wth <n 7 - n-ter Montgoery MM wth 5 n 7 We obtaned the ultplcaton forulae for the n-ter Karatsuba MM n the followng way: we derved the ultplcaton forulae for the 8-ter ultplcands usng the Karatsuba ultplcaton forula recursvely. The expresson for ultplcaton of 8-ter-polynoals contans 7 partal products of -bt long ters of ultplcands. The expresson for the polynoal product of 7-ter long operands can be obtaned fro the expresson for 8-ters long operands by settng the ost sgnfcant ters of both polynoals to zero and so on. We obtaned the n-ter Wnograd MM forulae n the sae way. The seral ultplers have the sae structure (see Fg. ). The gate coplexty of these ultplers does not depend on the appled MM and s approxately the sae usng the sae segentaton and the sae optzed partal ultpler (see eq. ). The area of those ultplers s also approxately the sae. Ther energy consupton depends on the nuber of clock cycles, whch are necessary to accuulate the polynoal product. The nuber of clock cycles s equal to the nuber of partal ultplcatons #MULT of the appled MM (see eq.5) and s gven n table IV for each of the nvestgated MMs and also for the classcal MM. The forer deternes the energy consupton of ultplers,.e. t depends on the appled MM and s shown n Table V for each nvestgated MM. TABLE V. NUMBER OF CLOCKS FOR INVESTIGATED MM Investgated MM Nuber of clocks for the segentaton n n n3 n4 n5 n6 n7 classcal n-ter Karatsuba n-ter Wnograd generalzed n-ter Karatsuba n-ter Montgoery For all nvestgated ultplers we calculated the area and energy consupton usng ther gate coplexty and the gate paraeters of the IHP.3µ technology. In addton we calculated the gate coplexty of the seral ultpler that calculates the product usng the classcal MM. Such a ultpler doesn t contan the unt for calculatng the nputs of the partal ultpler. Also ts accuulaton unts are less coplex than those needed for other MMs (see Fg. 4). We calculate the gate coplexty of the seral classcal ultpler usng (): clas n TM + (n ) MUX + () + ((465 + n) ;(465 + n ) ) Fg. 5 shows the calculated area and energy consupton as a functon of clock cycles requred by each polynoal ultpler for the accuulaton of the product. The red curve shows the energy consupton of all nvestgated ultplers and the green curve shows ther area. The area and energy consupton of the optzed one clock 33-bts ultpler are gven for coparson. Also the seral ultpler presented n [] s shown n Fg.5. Fgure 5. Calculated chp-paraeters of all nvestgated seral polynoal ultplers As selecton crteron for the best ultpler we selected not only the area-power product but also the executon te of the ultplcaton. We deterned canddates for pleentaton: the 6-clock cycles ultpler usng 3-ter- Wnograd MM (36 pj) and the 9-clock cycles ultpler usng 4-ter-Karatsuba MM (3 pj). Note that the area of other -clock ultplers (>9) s argnally saller than the area of the 9-clock cycles ultpler but ther energy consupton, area-power product and calculaton te are uch larger. For coparson, the 9-clock cycles ultpler presented n [] has an areapower product of 37 pj.
6 For the evaluaton of our theoretcal results we syntheszed the 6- and 9-clock cycles seral ultplers for the IHP.3µ technology usng Synopss tools [4]. Addtonally we syntheszed the desgn fro [] as benchark for our practcal results. Table VI shows the area and energy consupton of the syntheszed polynoal ultplers and the chp paraeters of the kp-desgns usng these polynoal ultplers. TABLE VI. PARAMETERS OF SYNTHESIZED DESIGNS Operaton Desgn detals, bts area, Energy 9-clock ultpler (as n []) nj polynoal 9-clock ultpler (ths work) nj ultplcaton 6-clockultpler (ths work) nj usng 9-clock ultpler ( fro []) µj kp usng 9-clock ultpler (ths work) µj usng 6-clock ultpler (ths work) µj The coparson of the chp-paraeters of syntheszed ultplers and kp-desgns reveals: - Applyng the optzed 59-bts partal ultpler nstead of the 64-bt partal ultpler n the 9-clock cycles seral polynoal ultpler reduces the area of the ultpler about 4.4% and at the sae te the energy consupton about 9.5%. - Applyng our seral 6-clock cycles polynoal ultpler nstead of the 9-clock ultpler fro [] reduces the energy consupton of a sngle polynoal ultplcaton about 3.4%. The energy consupton of the full kp-desgns and the executon te of the kp-operaton are reduced about 4% and 8%, respectvely. [4] Sunar, B.: A Generalzed Method for Constructng Subquadratc Coplexty GF( k ) Multplers. IEEE Transactons on Coputers, Vol. 53, Nr. 9, 4, pp: 97-5 [5] Montgoery, P.L.: Fve, Sx, and Seven-Ter Karatsuba-Lke Forulae. IEEE Transactons on Coputers, Vol. 54, Nr. 3, 5, pp: [6] Hanng Fan and M. Anwar Hasan. Coents on Fve, sx, and seventer Karatsuba-lke forulae. IEEE Trans. Coput., 56 (5), 7, pp:76 77 [7] Cenk, M., Koc, C. K., Ozbudak, F.: Polynoal ultplcaton over fnte felds usng feld extensons and nterpolaton, n 9th IEEE Syposu on Coputer Arthetc, IEEE Coputer Socety Press, Portland, Oregon, 9, pp: [8] Oseledets, I.: Iproved n-ter Karatsuba-lke Forulae n GF(). IEEE Transactons on Coputers, Vol. 6, Nr. 8,, pp: -6 [9] J. von zur Gathen and J. Shokrollah: Effcent FPGA-based Karatsuba ultplers for polynoals over F, n Selected Areas n Cryptography (SAC) th Internatonal Workshop, Canada, 5, Revsed Selected Papers, Vol of LNCS, Sprnger-Verlag, 6, pp: [] Dyka, Z., Langendoerfer, P.: Algorthcally deternng the optu polynoal ultpler n GF( k ), extended abstract, WEWORC, avalable at [] Dyka, Z., Langendoerfer, P.: Area effcent hardware pleentaton of ellptc curve cryptography by teratvely applyng Karatsubas ethod, In Proceedngs of the Desgn, Autoaton and Test n Europe (DATE 5), 5, Vol.3, pp: 7-75 [] Peter, S., Langendoerfer, P.: An Effcent Polynoal Multpler GF() and ts Applcaton to ECC Desgns. In Proceedngs of the Desgn, Autoaton and Test n Europe (DATE 7), 7, pp:53-58 [3] Innovatons for Hgh Perforance Mcroelectroncs, [4] Synopss, CONCLUSION In ths paper we have presented a theoretcal approach to do early assessng of the area and power consupton of hardware accelerators for ellptc curve cryptography. We developed one clock ultplers for up to 6 bts long operands usng optal cobnatons of 3 ultplcaton ethods. We have calculated the area and energy consupton of 5 seral polynoal ultplers for the ultplcaton n GF( 33 ) that we use as an exaple. Ths approach can be appled also for the developent of a seral ultpler for other operand length. We used the results to select three ultplers for further evaluaton. These ultplers were syntheszed and the synthess values are gven n the artcle. The coparson of the theoretcal calculated data and the syntheszed values shows that our approach provdes a good and relable eans to do an early assessent for selectng pleentaton canddates well suted for resource constrant, low cost devces such as ebedded systes or wreless sensor nodes. REFERENCES [] Weerskrch, A., Paar, C.: Generalzatons of the Karatsuba Algorth for Effcent Ipleentatons. Report 6/4, Cryptology eprnt Archve, 6, [] Karatsuba, A., Ofan, Y.: Multplcaton of Many-Dgtal Nubers by Autoatc Coputers. Doklady Akad. Nauk SSSR, Vol. 45 (96), pp: Translaton n Physcs-Doklady, 7 (963), pp: [3] Wnograd, S.: Arthetc Coplexty of Coputatons. SIAM, 98
The Parity of the Number of Irreducible Factors for Some Pentanomials
The Party of the Nuber of Irreducble Factors for Soe Pentanoals Wolfra Koepf 1, Ryul K 1 Departent of Matheatcs Unversty of Kassel, Kassel, F. R. Gerany Faculty of Matheatcs and Mechancs K Il Sung Unversty,
More informationExcess Error, Approximation Error, and Estimation Error
E0 370 Statstcal Learnng Theory Lecture 10 Sep 15, 011 Excess Error, Approxaton Error, and Estaton Error Lecturer: Shvan Agarwal Scrbe: Shvan Agarwal 1 Introducton So far, we have consdered the fnte saple
More informationSystem in Weibull Distribution
Internatonal Matheatcal Foru 4 9 no. 9 94-95 Relablty Equvalence Factors of a Seres-Parallel Syste n Webull Dstrbuton M. A. El-Dacese Matheatcs Departent Faculty of Scence Tanta Unversty Tanta Egypt eldacese@yahoo.co
More informationBit-Parallel Word-Serial Multiplier in GF(2 233 ) and Its VLSI Implementation. Dr. M. Ahmadi
Bt-Parallel Word-Seral Multpler n GF(2 233 ) and Its VLSI Implementaton Supervsors: Student: Dr. Huapeng Wu Dr. M. Ahmad Wenka Tang Contents Introducton to Fnte Feld Research Motvatons Proposed Multplers
More informationApplied Mathematics Letters
Appled Matheatcs Letters 2 (2) 46 5 Contents lsts avalable at ScenceDrect Appled Matheatcs Letters journal hoepage: wwwelseverco/locate/al Calculaton of coeffcents of a cardnal B-splne Gradr V Mlovanovć
More information1 Definition of Rademacher Complexity
COS 511: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture #9 Scrbe: Josh Chen March 5, 2013 We ve spent the past few classes provng bounds on the generalzaton error of PAClearnng algorths for the
More informationDesigning Fuzzy Time Series Model Using Generalized Wang s Method and Its application to Forecasting Interest Rate of Bank Indonesia Certificate
The Frst Internatonal Senar on Scence and Technology, Islac Unversty of Indonesa, 4-5 January 009. Desgnng Fuzzy Te Seres odel Usng Generalzed Wang s ethod and Its applcaton to Forecastng Interest Rate
More informationThree Algorithms for Flexible Flow-shop Scheduling
Aercan Journal of Appled Scences 4 (): 887-895 2007 ISSN 546-9239 2007 Scence Publcatons Three Algorths for Flexble Flow-shop Schedulng Tzung-Pe Hong, 2 Pe-Yng Huang, 3 Gwoboa Horng and 3 Chan-Lon Wang
More informationChapter 12 Lyes KADEM [Thermodynamics II] 2007
Chapter 2 Lyes KDEM [Therodynacs II] 2007 Gas Mxtures In ths chapter we wll develop ethods for deternng therodynac propertes of a xture n order to apply the frst law to systes nvolvng xtures. Ths wll be
More informationDenote the function derivatives f(x) in given points. x a b. Using relationships (1.2), polynomials (1.1) are written in the form
SET OF METHODS FO SOUTION THE AUHY POBEM FO STIFF SYSTEMS OF ODINAY DIFFEENTIA EUATIONS AF atypov and YuV Nulchev Insttute of Theoretcal and Appled Mechancs SB AS 639 Novosbrs ussa Introducton A constructon
More informationBAYESIAN CURVE FITTING USING PIECEWISE POLYNOMIALS. Dariusz Biskup
BAYESIAN CURVE FITTING USING PIECEWISE POLYNOMIALS Darusz Bskup 1. Introducton The paper presents a nonparaetrc procedure for estaton of an unknown functon f n the regresson odel y = f x + ε = N. (1) (
More informationAn Optimal Bound for Sum of Square Roots of Special Type of Integers
The Sxth Internatonal Syposu on Operatons Research and Its Applcatons ISORA 06 Xnang, Chna, August 8 12, 2006 Copyrght 2006 ORSC & APORC pp. 206 211 An Optal Bound for Su of Square Roots of Specal Type
More informationCOS 511: Theoretical Machine Learning
COS 5: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture #0 Scrbe: José Sões Ferrera March 06, 203 In the last lecture the concept of Radeacher coplexty was ntroduced, wth the goal of showng that
More informationTime and Space Complexity Reduction of a Cryptanalysis Algorithm
Te and Space Coplexty Reducton of a Cryptanalyss Algorth Mohaad Ghasezadeh Electrcal and Coputer Engneerng Departent, Yazd Unversty, Yazd, Iran.ghasezadeh@yazdun.ac.r Receved: /4/6; Accepted: /5/4 Pages:
More informationSeveral generation methods of multinomial distributed random number Tian Lei 1, a,linxihe 1,b,Zhigang Zhang 1,c
Internatonal Conference on Appled Scence and Engneerng Innovaton (ASEI 205) Several generaton ethods of ultnoal dstrbuted rando nuber Tan Le, a,lnhe,b,zhgang Zhang,c School of Matheatcs and Physcs, USTB,
More informationGalois Field Hardware Architectures for Network Coding
Ashwarya Nagarajan Departent of Electrcal and Coputer Engneerng Unversty of Wsconsn-Madson Wsconsn, USA anagarajan@wsc.edu Galos Feld Hardware Archtectures for Network Codng Mchael J Schulte Departent
More informationGadjah Mada University, Indonesia. Yogyakarta State University, Indonesia Karangmalang Yogyakarta 55281
Reducng Fuzzy Relatons of Fuzzy Te Seres odel Usng QR Factorzaton ethod and Its Applcaton to Forecastng Interest Rate of Bank Indonesa Certfcate Agus aan Abad Subanar Wdodo 3 Sasubar Saleh 4 Ph.D Student
More informationTOPICS MULTIPLIERLESS FILTER DESIGN ELEMENTARY SCHOOL ALGORITHM MULTIPLICATION
1 2 MULTIPLIERLESS FILTER DESIGN Realzaton of flters wthout full-fledged multplers Some sldes based on support materal by W. Wolf for hs book Modern VLSI Desgn, 3 rd edton. Partly based on followng papers:
More informationComputational and Statistical Learning theory Assignment 4
Coputatonal and Statstcal Learnng theory Assgnent 4 Due: March 2nd Eal solutons to : karthk at ttc dot edu Notatons/Defntons Recall the defnton of saple based Radeacher coplexty : [ ] R S F) := E ɛ {±}
More informationWhat is LP? LP is an optimization technique that allocates limited resources among competing activities in the best possible manner.
(C) 998 Gerald B Sheblé, all rghts reserved Lnear Prograng Introducton Contents I. What s LP? II. LP Theor III. The Splex Method IV. Refneents to the Splex Method What s LP? LP s an optzaton technque that
More informationDesign and Performance testing of Arithmetic Operators Library for Cryptographic Applications
IJCSES Internatonal Journal of Coputer Scences and Engneerng Systes, Vol., No.3, July 7 CSES Internatonal c7 ISSN 973-446 Desgn and Perforance testng of Arthetc Operators Lbrary for Cryptographc Applcatons
More information4 Column generation (CG) 4.1 Basics of column generation. 4.2 Applying CG to the Cutting-Stock Problem. Basic Idea of column generation
4 Colun generaton (CG) here are a lot of probles n nteger prograng where even the proble defnton cannot be effcently bounded Specfcally, the nuber of coluns becoes very large herefore, these probles are
More informationPreference and Demand Examples
Dvson of the Huantes and Socal Scences Preference and Deand Exaples KC Border October, 2002 Revsed Noveber 206 These notes show how to use the Lagrange Karush Kuhn Tucker ultpler theores to solve the proble
More informationON THE NUMBER OF PRIMITIVE PYTHAGOREAN QUINTUPLES
Journal of Algebra, Nuber Theory: Advances and Applcatons Volue 3, Nuber, 05, Pages 3-8 ON THE NUMBER OF PRIMITIVE PYTHAGOREAN QUINTUPLES Feldstrasse 45 CH-8004, Zürch Swtzerland e-al: whurlann@bluewn.ch
More informationTheory and Algorithm for SPFD-Based Global Rewiring
Theory and Algorth for SPFD-Based Global Rewrng Jason Cong and Wangnng Long Departent of Coputer Scence, Unversty of Calforna, Los Angeles, CA 995 Abstract In ths paper we present the theory and the algorth
More informationFUZZY MODEL FOR FORECASTING INTEREST RATE OF BANK INDONESIA CERTIFICATE
he 3 rd Internatonal Conference on Quanttatve ethods ISBN 979-989 Used n Econoc and Busness. June 6-8, 00 FUZZY ODEL FOR FORECASING INERES RAE OF BANK INDONESIA CERIFICAE Agus aan Abad, Subanar, Wdodo
More informationXII.3 The EM (Expectation-Maximization) Algorithm
XII.3 The EM (Expectaton-Maxzaton) Algorth Toshnor Munaata 3/7/06 The EM algorth s a technque to deal wth varous types of ncoplete data or hdden varables. It can be appled to a wde range of learnng probles
More informationLECTURE :FACTOR ANALYSIS
LCUR :FACOR ANALYSIS Rta Osadchy Based on Lecture Notes by A. Ng Motvaton Dstrbuton coes fro MoG Have suffcent aount of data: >>n denson Use M to ft Mture of Gaussans nu. of tranng ponts If
More information1 Review From Last Time
COS 5: Foundatons of Machne Learnng Rob Schapre Lecture #8 Scrbe: Monrul I Sharf Aprl 0, 2003 Revew Fro Last Te Last te, we were talkng about how to odel dstrbutons, and we had ths setup: Gven - exaples
More informationNP-Completeness : Proofs
NP-Completeness : Proofs Proof Methods A method to show a decson problem Π NP-complete s as follows. (1) Show Π NP. (2) Choose an NP-complete problem Π. (3) Show Π Π. A method to show an optmzaton problem
More informationSlobodan Lakić. Communicated by R. Van Keer
Serdca Math. J. 21 (1995), 335-344 AN ITERATIVE METHOD FOR THE MATRIX PRINCIPAL n-th ROOT Slobodan Lakć Councated by R. Van Keer In ths paper we gve an teratve ethod to copute the prncpal n-th root and
More informationInternational Journal of Mathematical Archive-9(3), 2018, Available online through ISSN
Internatonal Journal of Matheatcal Archve-9(3), 208, 20-24 Avalable onlne through www.ja.nfo ISSN 2229 5046 CONSTRUCTION OF BALANCED INCOMPLETE BLOCK DESIGNS T. SHEKAR GOUD, JAGAN MOHAN RAO M AND N.CH.
More informationINPUT-OUTPUT PAIRING OF MULTIVARIABLE PREDICTIVE CONTROL
INPUT-OUTPUT PAIRING OF MULTIVARIABLE PREDICTIVE CONTROL Lng-Cong Chen #, Pu Yuan*, Gu-L Zhang* *Unversty of Petroleu, P.O. Box 902 Beng 00083, Chna # GAIN Tech Co., P.O. Box 902ext.79, Beng 00083, Chna
More informationarxiv: v2 [math.co] 3 Sep 2017
On the Approxate Asyptotc Statstcal Independence of the Peranents of 0- Matrces arxv:705.0868v2 ath.co 3 Sep 207 Paul Federbush Departent of Matheatcs Unversty of Mchgan Ann Arbor, MI, 4809-043 Septeber
More informationHandling Overload (G. Buttazzo, Hard Real-Time Systems, Ch. 9) Causes for Overload
PS-663: Real-Te Systes Handlng Overloads Handlng Overload (G Buttazzo, Hard Real-Te Systes, h 9) auses for Overload Bad syste desgn eg poor estaton of worst-case executon tes Sultaneous arrval of unexpected
More informationA New Design of Multiplier using Modified Booth Algorithm and Reversible Gate Logic
Internatonal Journal of Computer Applcatons Technology and Research A New Desgn of Multpler usng Modfed Booth Algorthm and Reversble Gate Logc K.Nagarjun Department of ECE Vardhaman College of Engneerng,
More informationIntroducing Entropy Distributions
Graubner, Schdt & Proske: Proceedngs of the 6 th Internatonal Probablstc Workshop, Darstadt 8 Introducng Entropy Dstrbutons Noel van Erp & Peter van Gelder Structural Hydraulc Engneerng and Probablstc
More informationFinite Vector Space Representations Ross Bannister Data Assimilation Research Centre, Reading, UK Last updated: 2nd August 2003
Fnte Vector Space epresentatons oss Bannster Data Asslaton esearch Centre, eadng, UK ast updated: 2nd August 2003 Contents What s a lnear vector space?......... 1 About ths docuent............ 2 1. Orthogonal
More informationNotes on Frequency Estimation in Data Streams
Notes on Frequency Estmaton n Data Streams In (one of) the data streamng model(s), the data s a sequence of arrvals a 1, a 2,..., a m of the form a j = (, v) where s the dentty of the tem and belongs to
More informationLeast Squares Fitting of Data
Least Squares Fttng of Data Davd Eberly Geoetrc Tools, LLC http://www.geoetrctools.co/ Copyrght c 1998-2014. All Rghts Reserved. Created: July 15, 1999 Last Modfed: February 9, 2008 Contents 1 Lnear Fttng
More informationQuantum Particle Motion in Physical Space
Adv. Studes Theor. Phys., Vol. 8, 014, no. 1, 7-34 HIKARI Ltd, www.-hkar.co http://dx.do.org/10.1988/astp.014.311136 Quantu Partcle Moton n Physcal Space A. Yu. Saarn Dept. of Physcs, Saara State Techncal
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationThe CORDIC method of calculating the exponential function Metoda CORDIC obliczania funkcji eksponencjalnej
TECHNICAL TRANSACTIONS 4/08 ELECTRICAL ENGINEERING DOI: 0.4467/353737XCT.8.059.837 SUBMISSION OF THE FINAL VERSION: 8/3/08 Leond Moroz Departent of Securty of Inforaton Technology, Lvv Polytechnc Natonal
More informationXiangwen Li. March 8th and March 13th, 2001
CS49I Approxaton Algorths The Vertex-Cover Proble Lecture Notes Xangwen L March 8th and March 3th, 00 Absolute Approxaton Gven an optzaton proble P, an algorth A s an approxaton algorth for P f, for an
More informationStructure and Drive Paul A. Jensen Copyright July 20, 2003
Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.
More informationANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U)
Econ 413 Exam 13 H ANSWERS Settet er nndelt 9 deloppgaver, A,B,C, som alle anbefales å telle lkt for å gøre det ltt lettere å stå. Svar er gtt . Unfortunately, there s a prntng error n the hnt of
More informationhalftoning Journal of Electronic Imaging, vol. 11, no. 4, Oct Je-Ho Lee and Jan P. Allebach
olorant-based drect bnary search» halftonng Journal of Electronc Iagng, vol., no. 4, Oct. 22 Je-Ho Lee and Jan P. Allebach School of Electrcal Engneerng & oputer Scence Kyungpook Natonal Unversty Abstract
More informationA Differential Evaluation Markov Chain Monte Carlo algorithm for Bayesian Model Updating M. Sherri a, I. Boulkaibet b, T. Marwala b, M. I.
A Dfferental Evaluaton Markov Chan Monte Carlo algorth for Bayesan Model Updatng M. Sherr a, I. Boulkabet b, T. Marwala b, M. I. Frswell c, a Departent of Mechancal Engneerng Scence, Unversty of Johannesburg,
More informationDetermination of the Confidence Level of PSD Estimation with Given D.O.F. Based on WELCH Algorithm
Internatonal Conference on Inforaton Technology and Manageent Innovaton (ICITMI 05) Deternaton of the Confdence Level of PSD Estaton wth Gven D.O.F. Based on WELCH Algorth Xue-wang Zhu, *, S-jan Zhang
More informationOne-sided finite-difference approximations suitable for use with Richardson extrapolation
Journal of Computatonal Physcs 219 (2006) 13 20 Short note One-sded fnte-dfference approxmatons sutable for use wth Rchardson extrapolaton Kumar Rahul, S.N. Bhattacharyya * Department of Mechancal Engneerng,
More informationSpeeding up Computation of Scalar Multiplication in Elliptic Curve Cryptosystem
H.K. Pathak et. al. / (IJCSE) Internatonal Journal on Computer Scence and Engneerng Speedng up Computaton of Scalar Multplcaton n Ellptc Curve Cryptosystem H. K. Pathak Manju Sangh S.o.S n Computer scence
More informationUncertainty in measurements of power and energy on power networks
Uncertanty n measurements of power and energy on power networks E. Manov, N. Kolev Department of Measurement and Instrumentaton, Techncal Unversty Sofa, bul. Klment Ohrdsk No8, bl., 000 Sofa, Bulgara Tel./fax:
More informationLecture 14: Forces and Stresses
The Nuts and Bolts of Frst-Prncples Smulaton Lecture 14: Forces and Stresses Durham, 6th-13th December 2001 CASTEP Developers Group wth support from the ESF ψ k Network Overvew of Lecture Why bother? Theoretcal
More information2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification
E395 - Pattern Recognton Solutons to Introducton to Pattern Recognton, Chapter : Bayesan pattern classfcaton Preface Ths document s a soluton manual for selected exercses from Introducton to Pattern Recognton
More informationOn Syndrome Decoding of Punctured Reed-Solomon and Gabidulin Codes 1
Ffteenth Internatonal Workshop on Algebrac and Cobnatoral Codng Theory June 18-24, 2016, Albena, Bulgara pp. 35 40 On Syndroe Decodng of Punctured Reed-Soloon and Gabduln Codes 1 Hannes Bartz hannes.bartz@tu.de
More informationStatistical analysis of Accelerated life testing under Weibull distribution based on fuzzy theory
Statstcal analyss of Accelerated lfe testng under Webull dstrbuton based on fuzzy theory Han Xu, Scence & Technology on Relablty & Envronental Engneerng Laboratory, School of Relablty and Syste Engneerng,
More informationThe Impact of the Earth s Movement through the Space on Measuring the Velocity of Light
Journal of Appled Matheatcs and Physcs, 6, 4, 68-78 Publshed Onlne June 6 n ScRes http://wwwscrporg/journal/jap http://dxdoorg/436/jap646 The Ipact of the Earth s Moeent through the Space on Measurng the
More informationOn Pfaff s solution of the Pfaff problem
Zur Pfaff scen Lösung des Pfaff scen Probles Mat. Ann. 7 (880) 53-530. On Pfaff s soluton of te Pfaff proble By A. MAYER n Lepzg Translated by D. H. Delpenc Te way tat Pfaff adopted for te ntegraton of
More informationClock-Gating and Its Application to Low Power Design of Sequential Circuits
Clock-Gatng and Its Applcaton to Low Power Desgn of Sequental Crcuts ng WU Department of Electrcal Engneerng-Systems, Unversty of Southern Calforna Los Angeles, CA 989, USA, Phone: (23)74-448 Massoud PEDRAM
More information,..., k N. , k 2. ,..., k i. The derivative with respect to temperature T is calculated by using the chain rule: & ( (5) dj j dt = "J j. k i.
Suppleentary Materal Dervaton of Eq. 1a. Assue j s a functon of the rate constants for the N coponent reactons: j j (k 1,,..., k,..., k N ( The dervatve wth respect to teperature T s calculated by usng
More informationPulse Coded Modulation
Pulse Coded Modulaton PCM (Pulse Coded Modulaton) s a voce codng technque defned by the ITU-T G.711 standard and t s used n dgtal telephony to encode the voce sgnal. The frst step n the analog to dgtal
More informationOur focus will be on linear systems. A system is linear if it obeys the principle of superposition and homogenity, i.e.
SSTEM MODELLIN In order to solve a control syste proble, the descrptons of the syste and ts coponents ust be put nto a for sutable for analyss and evaluaton. The followng ethods can be used to odel physcal
More informationCHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE
CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng
More informationISSN: ISO 9001:2008 Certified International Journal of Engineering and Innovative Technology (IJEIT) Volume 3, Issue 1, July 2013
ISSN: 2277-375 Constructon of Trend Free Run Orders for Orthogonal rrays Usng Codes bstract: Sometmes when the expermental runs are carred out n a tme order sequence, the response can depend on the run
More informationEXACT TRAVELLING WAVE SOLUTIONS FOR THREE NONLINEAR EVOLUTION EQUATIONS BY A BERNOULLI SUB-ODE METHOD
www.arpapress.co/volues/vol16issue/ijrras_16 10.pdf EXACT TRAVELLING WAVE SOLUTIONS FOR THREE NONLINEAR EVOLUTION EQUATIONS BY A BERNOULLI SUB-ODE METHOD Chengbo Tan & Qnghua Feng * School of Scence, Shandong
More informationPROBABILITY AND STATISTICS Vol. III - Analysis of Variance and Analysis of Covariance - V. Nollau ANALYSIS OF VARIANCE AND ANALYSIS OF COVARIANCE
ANALYSIS OF VARIANCE AND ANALYSIS OF COVARIANCE V. Nollau Insttute of Matheatcal Stochastcs, Techncal Unversty of Dresden, Gerany Keywords: Analyss of varance, least squares ethod, odels wth fxed effects,
More informationRevision: December 13, E Main Suite D Pullman, WA (509) Voice and Fax
.9.1: AC power analyss Reson: Deceber 13, 010 15 E Man Sute D Pullan, WA 99163 (509 334 6306 Voce and Fax Oerew n chapter.9.0, we ntroduced soe basc quanttes relate to delery of power usng snusodal sgnals.
More informationy new = M x old Feature Selection: Linear Transformations Constraint Optimization (insertion)
Feature Selecton: Lnear ransforatons new = M x old Constrant Optzaton (nserton) 3 Proble: Gven an objectve functon f(x) to be optzed and let constrants be gven b h k (x)=c k, ovng constants to the left,
More informationOn the correction of the h-index for career length
1 On the correcton of the h-ndex for career length by L. Egghe Unverstet Hasselt (UHasselt), Campus Depenbeek, Agoralaan, B-3590 Depenbeek, Belgum 1 and Unverstet Antwerpen (UA), IBW, Stadscampus, Venusstraat
More informationCollaborative Filtering Recommendation Algorithm
Vol.141 (GST 2016), pp.199-203 http://dx.do.org/10.14257/astl.2016.141.43 Collaboratve Flterng Recoendaton Algorth Dong Lang Qongta Teachers College, Haou 570100, Chna, 18689851015@163.co Abstract. Ths
More informationFinite Fields and Their Applications
Fnte Felds and Ther Applcatons 5 009 796 807 Contents lsts avalable at ScenceDrect Fnte Felds and Ther Applcatons www.elsever.co/locate/ffa Typcal prtve polynoals over nteger resdue rngs Tan Tan a, Wen-Feng
More informationAN ANALYSIS OF A FRACTAL KINETICS CURVE OF SAVAGEAU
AN ANALYI OF A FRACTAL KINETIC CURE OF AAGEAU by John Maloney and Jack Hedel Departent of Matheatcs Unversty of Nebraska at Oaha Oaha, Nebraska 688 Eal addresses: aloney@unoaha.edu, jhedel@unoaha.edu Runnng
More informationVERIFICATION OF FE MODELS FOR MODEL UPDATING
VERIFICATION OF FE MODELS FOR MODEL UPDATING G. Chen and D. J. Ewns Dynacs Secton, Mechancal Engneerng Departent Iperal College of Scence, Technology and Medcne London SW7 AZ, Unted Kngdo Eal: g.chen@c.ac.uk
More informationThe Synchronous 8th-Order Differential Attack on 12 Rounds of the Block Cipher HyRAL
The Synchronous 8th-Order Dfferental Attack on 12 Rounds of the Block Cpher HyRAL Yasutaka Igarash, Sej Fukushma, and Tomohro Hachno Kagoshma Unversty, Kagoshma, Japan Emal: {garash, fukushma, hachno}@eee.kagoshma-u.ac.jp
More informationPerformance Analysis of V-BLAST with Optimum Power Allocation
Perforance Analyss of V-BLAST wth Optu Power Allocaton Vctora Kostna, Sergey Loyka School of Inforaton Technology and Engneerng, Unversty of Ottawa, 6 Lous Pasteur, Ottawa, Canada, KN 6N5 E-al: sergey.loyka@eee.org
More informationFermi-Dirac statistics
UCC/Physcs/MK/EM/October 8, 205 Fer-Drac statstcs Fer-Drac dstrbuton Matter partcles that are eleentary ostly have a type of angular oentu called spn. hese partcles are known to have a agnetc oent whch
More informationScroll Generation with Inductorless Chua s Circuit and Wien Bridge Oscillator
Latest Trends on Crcuts, Systems and Sgnals Scroll Generaton wth Inductorless Chua s Crcut and Wen Brdge Oscllator Watcharn Jantanate, Peter A. Chayasena, and Sarawut Sutorn * Abstract An nductorless Chua
More informationCOMP th April, 2007 Clement Pang
COMP 540 12 th Aprl, 2007 Cleent Pang Boostng Cobnng weak classers Fts an Addtve Model Is essentally Forward Stagewse Addtve Modelng wth Exponental Loss Loss Functons Classcaton: Msclasscaton, Exponental,
More informationStudy of the possibility of eliminating the Gibbs paradox within the framework of classical thermodynamics *
tudy of the possblty of elnatng the Gbbs paradox wthn the fraework of classcal therodynacs * V. Ihnatovych Departent of Phlosophy, Natonal echncal Unversty of Ukrane Kyv Polytechnc Insttute, Kyv, Ukrane
More informationThe Non-equidistant New Information Optimizing MGM(1,n) Based on a Step by Step Optimum Constructing Background Value
Appl. Math. Inf. Sc. 6 No. 3 745-750 (0) 745 Appled Matheatcs & Inforaton Scences An Internatonal Journal The Non-equdstant New Inforaton Optzng MGM(n) Based on a Step by Step Optu Constructng Background
More informationAlgorithm for reduction of Element Calculus to Element Algebra
Algorth for reducton of Eleent Calculus to Eleent Algebra Introducton M. Manukyan, V. Harutunyan The XML databases currently act defnte nterest aong researchers of databases for the followng reasons: 1.
More informationFormulas for the Determinant
page 224 224 CHAPTER 3 Determnants e t te t e 2t 38 A = e t 2te t e 2t e t te t 2e 2t 39 If 123 A = 345, 456 compute the matrx product A adj(a) What can you conclude about det(a)? For Problems 40 43, use
More informationIdentifying assessor differences in weighting the underlying sensory dimensions EL MOSTAFA QANNARI (1) MICHAEL MEYNERS (2)
Identfyng assessor dfferences n weghtng the underlyng sensory densons EL MOSTAFA QANNARI () MICHAEL MEYNERS (2) () ENITIAA/INRA - Unté de Statstque Applquée à la Caractérsaton des Alents Rue de la Géraudère
More informationEXAMPLES of THEORETICAL PROBLEMS in the COURSE MMV031 HEAT TRANSFER, version 2017
EXAMPLES of THEORETICAL PROBLEMS n the COURSE MMV03 HEAT TRANSFER, verson 207 a) What s eant by sotropc ateral? b) What s eant by hoogeneous ateral? 2 Defne the theral dffusvty and gve the unts for the
More informationChapter 13. Gas Mixtures. Study Guide in PowerPoint. Thermodynamics: An Engineering Approach, 5th edition by Yunus A. Çengel and Michael A.
Chapter 3 Gas Mxtures Study Gude n PowerPont to accopany Therodynacs: An Engneerng Approach, 5th edton by Yunus A. Çengel and Mchael A. Boles The dscussons n ths chapter are restrcted to nonreactve deal-gas
More informationNumerical Heat and Mass Transfer
Master degree n Mechancal Engneerng Numercal Heat and Mass Transfer 06-Fnte-Dfference Method (One-dmensonal, steady state heat conducton) Fausto Arpno f.arpno@uncas.t Introducton Why we use models and
More informationAnalysis of the Magnetomotive Force of a Three-Phase Winding with Concentrated Coils and Different Symmetry Features
Analyss of the Magnetomotve Force of a Three-Phase Wndng wth Concentrated Cols and Dfferent Symmetry Features Deter Gerlng Unversty of Federal Defense Munch, Neubberg, 85579, Germany Emal: Deter.Gerlng@unbw.de
More informationLeast Squares Fitting of Data
Least Squares Fttng of Data Davd Eberly Geoetrc Tools, LLC http://www.geoetrctools.co/ Copyrght c 1998-2015. All Rghts Reserved. Created: July 15, 1999 Last Modfed: January 5, 2015 Contents 1 Lnear Fttng
More informationTemperature. Chapter Heat Engine
Chapter 3 Temperature In prevous chapters of these notes we ntroduced the Prncple of Maxmum ntropy as a technque for estmatng probablty dstrbutons consstent wth constrants. In Chapter 9 we dscussed the
More informationImplicit scaling of linear least squares problems
RAL-TR-98-07 1 Iplct scalng of lnear least squares probles by J. K. Red Abstract We consder the soluton of weghted lnear least squares probles by Householder transforatons wth plct scalng, that s, wth
More informationNUMERICAL DIFFERENTIATION
NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the
More informationSimulated Power of the Discrete Cramér-von Mises Goodness-of-Fit Tests
Smulated of the Cramér-von Mses Goodness-of-Ft Tests Steele, M., Chaselng, J. and 3 Hurst, C. School of Mathematcal and Physcal Scences, James Cook Unversty, Australan School of Envronmental Studes, Grffth
More informationOn the Multicriteria Integer Network Flow Problem
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 5, No 2 Sofa 2005 On the Multcrtera Integer Network Flow Problem Vassl Vasslev, Marana Nkolova, Maryana Vassleva Insttute of
More informationConvexity preserving interpolation by splines of arbitrary degree
Computer Scence Journal of Moldova, vol.18, no.1(52), 2010 Convexty preservng nterpolaton by splnes of arbtrary degree Igor Verlan Abstract In the present paper an algorthm of C 2 nterpolaton of dscrete
More informationPop-Click Noise Detection Using Inter-Frame Correlation for Improved Portable Auditory Sensing
Advanced Scence and Technology Letters, pp.164-168 http://dx.do.org/10.14257/astl.2013 Pop-Clc Nose Detecton Usng Inter-Frame Correlaton for Improved Portable Audtory Sensng Dong Yun Lee, Kwang Myung Jeon,
More informationCryptanalysis of pairing-free certificateless authenticated key agreement protocol
Cryptanalyss of parng-free certfcateless authentcated key agreement protocol Zhan Zhu Chna Shp Development Desgn Center CSDDC Wuhan Chna Emal: zhuzhan0@gmal.com bstract: Recently He et al. [D. He J. Chen
More informationWorst Case Interrupt Response Time Draft, Fall 2007
Worst Case Interrupt esponse Te Draft, Fall 7 Phlp Koopan Carnege Mellon Unversty Copyrght 7, Phlp Koopan eproducton and dssenaton beyond students of CMU ECE 8-348 s prohbted.. Overvew: Interrupt Servce
More informationMultipoint Analysis for Sibling Pairs. Biostatistics 666 Lecture 18
Multpont Analyss for Sblng ars Bostatstcs 666 Lecture 8 revously Lnkage analyss wth pars of ndvduals Non-paraetrc BS Methods Maxu Lkelhood BD Based Method ossble Trangle Constrant AS Methods Covered So
More informationSolving Fuzzy Linear Programming Problem With Fuzzy Relational Equation Constraint
Intern. J. Fuzz Maeatcal Archve Vol., 0, -0 ISSN: 0 (P, 0 0 (onlne Publshed on 0 Septeber 0 www.researchasc.org Internatonal Journal of Solvng Fuzz Lnear Prograng Proble W Fuzz Relatonal Equaton Constrant
More informationAn efficient algorithm for multivariate Maclaurin Newton transformation
Annales UMCS Informatca AI VIII, 2 2008) 5 14 DOI: 10.2478/v10065-008-0020-6 An effcent algorthm for multvarate Maclaurn Newton transformaton Joanna Kapusta Insttute of Mathematcs and Computer Scence,
More information