COMBINATORIAL METHOD OF POLYNOMIAL EXPANSION OF SYMMETRIC BOOLEAN FUNCTIONS

Size: px
Start display at page:

Download "COMBINATORIAL METHOD OF POLYNOMIAL EXPANSION OF SYMMETRIC BOOLEAN FUNCTIONS"

Transcription

1 COMBINATORIAL MTHOD O POLYNOMIAL XPANSION O SYMMTRIC BOOLAN UNCTIONS Dala A. Gorodecky The Uted Isttute of Iformatcs Prolems of Natoal Academy of Sceces of Belarus, Msk,, Belarus, dala.gorodecky@gmal.com. Astract A ovel polyomal expaso method of symmetrc Boolea fuctos s descred. The method s effcet for symmetrc Boolea fucto wth small set of valued umers ad has the lear complexty for elemetary symmetrc Boolea fuctos, whle the complexty of the kow methods for ths class of fuctos s quadratc. The proposed method s ased o the cosequece of the comatoral Lucas theorem. Keywords: polyomal expaso, symmetrc Boolea fucto, carrer vector, reduced Zhegalk spectrum, complexty. Itroducto The polyomal expaso s amog the most complex tasks of the dscrete mathematcs. The polyomal expaso ca e used to defe the ffty-ffty dstruto of ad the Stehaus tragle, to sythesze modular summators, to fd a algerac mmuty cryptography ad to solve varous theoretcal prolems ad practcal applcatos. Because of hgh computatoal complexty of geerato of the polyomal for a artrary Boolea fucto the uversal methods of the polyomal expaso are ot effectve. Therefore the methods of geerato of expasos for varous classes of Boolea fuctos are more effectve. Oe of these classes s symmetrc Boolea fuctos (SB). It s kow may methods of the polyomal expaso of SB. Oe of the most effectve methods s the traseut tragle method []. It has the complexty O. The kow methods have the redudat computatos,.e. the termedate computatos should e produced to geerate the polyomal expaso. The artcle represets the method of the polyomal expaso wth the complexty O partcular cases. The method could e appled to solve the task of polyomal expaso, as well as the reverse task,.e. represetato of the fucto descred y the polyomal. The method s ased o the cosequece of the comatoral Lucas theorem, sce t s referred as the comatoral method.. Ma deftos A artrary Boolea fucto X of the varales, where X x x..., wth uchaged value after swappg ay couple of varales a, a a,..., x ad,, x, x, where j ad, j,,...,, s called SB. SB of the varales s charactersed y the set of valued umers A a, a,..., a r. The fucto s equal f ad oly f the set of varales x, x,..., x has exactly a umers of s, where a, r ad r. These SBs are referred r a as. If r, the a fucto X s called elemetary SB (SB). There s oe-to-oe correspodece etwee SB a, a a,..., r ad j ts ary code,,..., the carrer vector [] (or the reduced truth vector [3]), where the th etry

2 s a value of the fucto wth the umers of s, where f ad oly f the s the valued umer of the SB. The followg formula s true for a artrary SB : X X X. I other words,. () Postve polarty Reed-Muller polyomal (all varales are ucomplemeted) s called as Zhegalk polyomal ad s referred as P. SB of the varales s called the polyomal-uate SB (PUSB or homogeeous SB [4]), f the Zhegalk polyomal form P cotas rak products wth the postve lterals, where. Ths fucto referred as, x x... x, xx... xx... x x,... xx... x.. Hece t follows I geeral case, the polyomal form P of SB X P x x... x xx... xx... xx... xx... x, where,,..., follows ca e represeted as:, s the reduced Zhegalk (Reed-Muller) spectrum of SB. It X X. () rom the other had PUSB of the varales s charactersed y the set of polyomal B,...,. The j th etry of the reduced Zhegalk spectrum umers..., q,,, s equal f ad oly f, where j q ad q. If q, the a fucto j s called the elemetary PUSB (PUSB). The artcle provdes the method of the trasformato of the reduced truth vector the reduced spectrum a a,,..., a r.,.e.,,..., q to,,..., q 3. Comatoral method of geerato of the carrer vector to a a, ad ackwards,.e., a,..., r to The comatoral method of the geeratg of the reduced truth vector,,..., q a a a reduced spectrum,,..., r s proposed elow. 3.. Geerato of the carrer vector ad the

3 The process of the geeratg of the carrer vector demostrated o the example. of the PUSB could e xample. Let s assume that t s ecessary to get the carrer vector,,..., the PUSB X X. rom the codto t follows that,,,,,, ad x x x 3 x x4 x x 5 x x x x 3 x x4 x x 5 x x x 3 x 4 x 3 x 5 x 3 x x 4 x 5 x 4 x x 5 x for Note, that umer of the colum s equal to the umer of factors the colum whch are. The polyomal P cotas 5 cluded the polyomal of the fucto X rak products. To geerate the carrer vector,,,,, defed wth the followg argumets, where, : assumg the cotas 3 4 5, the th etry should e. But t s mpossle, ecause the polyomal (3) of X does t cota term. I ths case ad therefore ; assumg the cotas. Accordg to the defto of the SB polyomal (3) s equal for x ad x x3... x. But t s mpossle. I ths case ad therefore ; assumg the cotas polyomal (3) s equal for x. Accordg to the defto of the SB x ad x x x x. Thus the oly factor from the x x3 x 4 x5 x frst colum of the polyomal (3) s equal. I ths case ad therefore ; assumg 3 the cotas. Accordg to the defto of the SB polyomal (3) s equal for x ad. Thus the factors from the frst ad secod colums of the polyomal (3) are equal. Sce the umer of the uty compoets s the odd umer, the ths case ad therefore ; assumg 4 the 4 cotas (3). Accordg to the defto of the SB polyomal (3) s equal for x x x3 x4 ad x 5 x. Sce the factors from the frst, secod ad thrd colums of the polyomal (3) are equal, the the umer of the uty compoets s the eve umer. I ths case ad therefore ; assumg 5 the cotas Accordg to the defto of the SB polyomal (3) s equal for x x x3 x4 x5 ad x. Sce the factors from the frst, secod, thrd ad fourth colums of the polyomal (3) are equal, the the umer of the uty compoets s the eve umer. I ths case ad therefore ; 5 3

4 assumg the cotas 3. Accordg to the defto of the SB polyomal (3) s equal for x x x3 x4 x5 x. Sce the factors from all colums of the polyomal (3) are equal, thr the umer of the uty compoets s the odd umer. I ths case ad therefore. As the result the carrer vector of the PUSB 3 s,,,,,, ad P. It s worth to pay atteto to the fact that the value of the polyomal depeds oly o the party umer of uty factors. The reasog used the example may e summarzed wth the theorem. Theorem. The th etry x, x,..., x s calculated y usg the formula: of the carrer vector,..., of the PUSB,, f mod ; (4) otherwse, where,. Proof. Let s cosder three cases of relatos ad. The frst case where. The the umer of the uty terms s less the the rak products ad (see the frst ad secod cases of the example ). Therefore. just oe The secod case where rak term of the PUSB the example ). I ths case. fucto The thrd case where,.e. x x... x ad x x... x. Thus s equal ad x x x P... (see the thrd case of,.e. x x... x... x ad x... x. Thus the s represeted y the polyomal x x... x xx... xx... x x... x x... xx... P P s determed y eve-odd of. Thus, f mod ; otherwse. The statemet of the theorem s proved. As a result of Theorem the carrer vector of the PUSB followg form x. Sce the value of, f mod ; I ths case otherwse. correspods to the,,...,,,,...,. (5)

5 Cosequece of the Lucas theorem s helpful for calculato usg the formula (4). It determes the eve-odd of the umer ad as follows. Theorem. (Cosequece of the Lucas theorem) [5]. The umer mod each t of s o more tha the same t of, where decmal represetato. Note, that the ary legth,..., ad,,..., s defed as log ad log respectvely. xample. Let s defe eve-odd of the umer usg Theorem ad assumg ad for two cases a) ad ) 5. log,,, ad The legth of s 4, the 4, 3 a) log, the, ; ) 5 3, the,. log 3, or the case a) the ary represetatos ad are comparale ad satsfy the codto of Theorem, as pctured gure a). or the case ) the ary represetatos of ad are ot comparale ad do ot satsfy the codto of Theorem, as pctured gure ). 4 3 a) ) gure. Defto of eve-odd of the umers a) ; ) 5 As a result, the case a) the umer s the odd ad thus mod ; the case ) the umer s the eve ad thus mod. 5 5 Let's geerate the carrer vector for the fucto aove example usg Theorem ad Theorem.. xample 3. Let s assume that t s ecessary to geerate rom the codto t follows,,,,,,, ad,,,,, Accordg to the formula (5) 3 4 5, 3 4, 5, ot volved the comparso satsfed the codto of Theorem does ot satsfy the codto of Theorem Therefore, order to fd, the eve-odd order of the Bomal coeffcets 3 4 5,,, respectvely should e defed. rom the Theorem they could e defed as show o fgure.

6 The fgure s aalogous to represetato as follows: 3 3 ; ; 5 ;. As the result the carrer vector s,,,,,, ad 3 P. The procedure of calculatg of the etres of the carrer vector usg cosequece of the Lucas theorem s called comatoral methods mod mod mod mod ot volved the comparso does ot satsfy the codto of Theorem satsfy the codto of Theorem gure. Defto of eve-odd of the umers 3.. Geerato of the carrer vector q,,..., 3 4 5,,, The comatoral method of geeratg of the carrer vector for the PUSB x x,..., x ca e geeralzed for a artrary PUSB,...,,,,...,, q PUSB q x, x,..., x wth the followg theorem. Theorem 3. The q,,..., th etry q of the carrer vector,,...,..., s calculated wth the followg formula:,, of the, f... mod ; q () otherwse, where,. Note, that for j s meagless, where j, q, therefore let s assume j for j. j The proof of Theorem 3 follows from Theorem. xample 4. Let s assume that t s ecessary to geerate rom the codto t follows,,,,,,,,,,.. Accordg to the formula (5) t follows ad. Thus,,,,,,,,, , 3 4 5

7 Accordg to the formula () ad Theorem t s easy to defe, 7, 8, 9 ad as show o the fgure mod mod mod mod mod mod mod mod mod mod mod mod mod mod 9 mod ot volved the comparso does ot satsfy the codto of Theorem mod satsfy the codto of Theorem gure 3. Calculatg of the, 7, 8, 9, The fgure 3 s aalogous to represetato as follows: mod 5 ; 7 7 mod mod mod 5 7 for 7 ;

8 mod mod mod mod mod mod mod mod ; mod mod mod mod Thus ad. As the result the carrer vector of the PUSB s,,,,,,,,,, ad P. 4. Geerato of the reduced spectrum q,,..., a a a The comatoral method of the geerato of the carrer vector,,..., r a a a,,..., r a, a,..., ar, where a a To solve the task of the geeratg of the reduced spectrum, a,..., r appled to the geerato of the reduced spectrum Theorem 3 ca e adapted to the two followg forms. Theorem 4. The th etry a a ca e s the SB. of the reduced spectrum,..., x, x,..., x s calculated wth the followg formula: where SB a,. Theorem 5. The th etry a a a,,..., r s calculated wth the followg formula: where a,. Note, that ad a j. a r a, a,..., Theorem ad of the PUSB,, f mod ; a (7) otherwse, a, a ar of the reduced spectrum,...,,..., of the,, f... mod ; a a ar (8) otherwse, a j for a j s meagless, where j, r, therefore let s assume of the SB Accordg to Theorem 4 ad Theorem 5 the reduced spectrum,..., a r correspods to the followg form,

9 ,,...,,, a,...,. (9) a a The example of the applcato of Theorem 5 wll e cosdered.,3 xample 5. Let s geerate the reduced spectrum. 7,3 rom the codto t follows the carrer vector s 7,,,,,,, the formula (9) t follows,,3 ad,,,,,, , 7. Accordg to Accordg to the formula (8) ad Theorem 5 t s easy to defe 3, 4, 5, ad 7 as show elow: 3 3 mod 3 mod mod mod 3 mod mod 4 ; 5 5 mod 3 mod mod 5 mod 3 mod mod 7 7 mod 3 mod mod 7,3 As the result the reduced spectrum of the fucto 7,,,,,,, ad P, The complexty of the comatoral method,3 7 s The complexty of the proposed method ca e defed as the umer of the ary a operatos XOR (or OR) ad s referred S for the PUSB (or SB ) ad S for the PUSB,,..., a, a,..., a q r (or SB ). The postve relatoshp of two ary vectors s x, x,..., x y, y y t t,...,, f x y, where, t. I ths way to defe the relatoshp x y the followg codto should e satsfed t t x y. () Therefore accordg to the codto of Theorem the complexty (the umer of operatos mod s log. rom Theorem t follows ()) of the computato of the umer the complexty of the computato of the carrer vector,..., s, S log. () rom Theorem 3 t follows the complexty of the computato of the carrer vector q,,...,,..., s,

10 S log log... log log q q 3... q q q log q log log. log a a The complexty of the calculato of ad, a,..., ar ad () respectvely.. Dscusso () ca e calculated wth () There are some effectve methods to solve the task of polyomal expaso,.e. geeratg a, a,..., ar,..., ad the reverse task of geeratg of the of the reduced spectrum,,,..., r carrer vector,...,,. Oe of these methods s the traseut tragle method. It was orgally proposed y V.P. Supru for SB []. The the method was geeralzed for artrary Boolea fuctos []. The traseut tragle method s the most effectve method for polyomal expaso of the SB x x,..., ad has the complexty, x O. The traseut tragle form s geerated from the upper ase to the ottom usg the XORoperato (see example ). Thus the umer of XOR-operatos defes the complexty S T of the traseut tragle method ad s S T. (3) There s the example of the mplemetato of the traseut tragle method for geeratg of the carrer vector,,...,. xample. Let s assume the reduced spectrum,,,,,,. I order to geerate the traseut tragle method wll e used. rom the codto the upper ase of the tragle wll,,,,,, the form as follow:,.e. ad ad t takes Accordg to the traseut tragle method the left sde of the tragle correspods to the,,,,,,. Therefore 3. reduced carrer vector ad t s equal to

11 Usg the formula (3) the complexty of the computato of the wth the traseut tragle method s S T 5. O the other sde, to complexty of performg the same task usg the comatoral method, accordg to the formula () ad as show example 3, s S 8. rstly let s compare the complexty S (formula ()) of the comatoral method proposed the artcle ad the complexty S T (formula (3)) of the traseut tragle method for a a SB (or ). The llustrato of the comparso of S ad S T s show o the gure 4. As t ca e see at fgure 4 the comatoral method for PUSB has the lear complexty. The proposed method ca provde te tmes more effcecy for 8 varales comparso wth the traseut tragle method. The complexty of the comatoral method (formula ()) s calculated for the worst case,.e. for the PUSB, where. The complexty of the comatoral method comparso wth the complexty of the traseut tragle method for,,..., r PUSB, where r, strogly depeds o umers cluded the set of the polyomal umers. As a result, the tale demostrates the threshold of the effcecy of the comatoral method comparso wth the traseut tragle method. gure 4. The comparso of the complexty S The secod colum cotas of the power set of the polyomal the comatoral method ad the complexty S T of umers B for whch the the traseut tragle method complexty S ad S T s approxmately equal. The thrd colum cotas the set of the polyomal umers B for whch the complextes of oth methods are the same. Ay other set of the polyomal umers B provdes a lower complexty of the comatoral method for the umer of the varales specfed the frst colum. The fourth colum shows the rato of the set of the polyomal umers to all varales specfed the frst colum. Two rght colums show the comparale complextes of the comatoral ad the traseut tragle methods.

12 Tale The effcecy of the comatoral method ad the traseut tragle method Numer of the varales that the fucto,,..., r Numer r of the polyomal umers,..., for, r Set of the polyomal umers B,...,, r Percetage of the umer r of the varales, % Complexty of the comatoral method, depeds o S S T 3 {,3,4 } { 4,...,8 } { 4,...,9} { 8,..., 4} {,..., 8} 75 9 {,...,4} {,...,5} {,...,} {,...,7} {,...,8} { 3,...,57} { 4,..., 7} { 8,...,3} { 5,...,39} { 5,...,753} Coclusos S Complexty of the traseut tragle method, S The comatoral method s a ew method of geeratg of the carrer vector q,,..., a a a ad the reduced spectrum q,,..., of SB,.e. polyomal expaso of SB. The proposed method s the lear complexty ad the complexty of the kow methods (for example, traseut tragle method) s quadratc for PUSB (or SB). The comatoral method provdes hgh effcecy for small umer of varales for PUSB (or SB). Refereces [] V.P. Supru Polyomal xpresso of Symmetrc Boolea uctos, Sovet Joural of Computer ad Systems Scece, Vol. 3,, Nov.-Dec. 985, p (traslato from Izv. Adad. SSSR, Tekhcheskaa Keretka, 985, 4, p. 3-7). [] J.T. Butler, G.W. Dueck, S.N. Yaushkevch, V.P. Shmerko O the use of traseut tragle to sythess fxed-polarty Reed-Muller expasos, Proceedgs of the Reed-Muller Workshop 9, May 3-4, 9, Naha. Okawa, Japa, p. 9-. [3] T. Sasao, J.T. Butler The egefucto of the Reed-Muller trasformato, Proceedgs Reed-Muller 7 Workshop, May, 7, Oslo, Norway. [4] A. Braeke, B. Preeel O the Algerac Immuty of Symmetrc Boolea uctos, Progress Cryptology INDOCRYPT 5, Lecture Notes Computer Scece, Vol. 3797, 5, p [5] A. Gravlle Arthmetc Propertes of Bomal Coeffcets I: Bomal coeffcets modulo prme powers, Caada Mathematcal Socety Coferece Proceedgs, 997, p [] V.P. Supru Tale Method for Polyomal Decomposto of Boolea uctos, Keretka,, 987, p. -7 ( Russa). T

Bezier curves. 1. Defining a Bezier curve. A closed Bezier curve can simply be generated by closing its characteristic polygon

Bezier curves. 1. Defining a Bezier curve. A closed Bezier curve can simply be generated by closing its characteristic polygon Curve represetato Copyrght@, YZU Optmal Desg Laboratory. All rghts reserved. Last updated: Yeh-Lag Hsu (--). Note: Ths s the course materal for ME55 Geometrc modelg ad computer graphcs, Yua Ze Uversty.

More information

Eight Solved and Eight Open Problems in Elementary Geometry

Eight Solved and Eight Open Problems in Elementary Geometry Eght Solved ad Eght Ope Problems Elemetary Geometry Floret Smaradache Math & Scece Departmet Uversty of New Mexco, Gallup, US I ths paper we revew eght prevous proposed ad solved problems of elemetary

More information

Area and Power Efficient Modulo 2^n+1 Multiplier

Area and Power Efficient Modulo 2^n+1 Multiplier Iteratoal Joural of Moder Egeerg Research (IJMER) www.jmer.com Vol.3, Issue.3, May-Jue. 013 pp-137-1376 ISSN: 49-6645 Area ad Power Effcet Modulo ^+1 Multpler K. Ptambar Patra, 1 Saket Shrvastava, Sehlata

More information

Nine Solved and Nine Open Problems in Elementary Geometry

Nine Solved and Nine Open Problems in Elementary Geometry Ne Solved ad Ne Ope Problems Elemetary Geometry Floret Smaradache Math & Scece Departmet Uversty of New Mexco, Gallup, US I ths paper we revew e prevous proposed ad solved problems of elemetary D geometry

More information

For all questions, answer choice E) NOTA" means none of the above answers is correct. A) 50,500 B) 500,000 C) 500,500 D) 1,001,000 E) NOTA

For all questions, answer choice E) NOTA means none of the above answers is correct. A) 50,500 B) 500,000 C) 500,500 D) 1,001,000 E) NOTA For all questos, aswer choce " meas oe of the above aswers s correct.. What s the sum of the frst 000 postve tegers? A) 50,500 B) 500,000 C) 500,500 D),00,000. What s the sum of the tegers betwee 00 ad

More information

Eight Solved and Eight Open Problems in Elementary Geometry

Eight Solved and Eight Open Problems in Elementary Geometry Eght Solved ad Eght Ope Problems Elemetary Geometry Floret Smaradache Math & Scece Departmet Uversty of New Mexco, Gallup, US I ths paper we revew eght prevous proposed ad solved problems of elemetary

More information

1-D matrix method. U 4 transmitted. incident U 2. reflected U 1 U 5 U 3 L 2 L 3 L 4. EE 439 matrix method 1

1-D matrix method. U 4 transmitted. incident U 2. reflected U 1 U 5 U 3 L 2 L 3 L 4. EE 439 matrix method 1 -D matrx method We ca expad the smple plae-wave scatterg for -D examples that we ve see to a more versatle matrx approach that ca be used to hadle may terestg -D problems. The basc dea s that we ca break

More information

APR 1965 Aggregation Methodology

APR 1965 Aggregation Methodology Sa Joaqu Valley Ar Polluto Cotrol Dstrct APR 1965 Aggregato Methodology Approved By: Sged Date: March 3, 2016 Araud Marjollet, Drector of Permt Servces Backgroud Health rsk modelg ad the collecto of emssos

More information

Vertex Odd Divisor Cordial Labeling of Graphs

Vertex Odd Divisor Cordial Labeling of Graphs IJISET - Iteratoal Joural of Iovatve Scece, Egeerg & Techology, Vol. Issue 0, October 0. www.jset.com Vertex Odd Dvsor Cordal Labelg of Graphs ISSN 48 68 A. Muthaya ad P. Pugaleth Assstat Professor, P.G.

More information

On a Sufficient and Necessary Condition for Graph Coloring

On a Sufficient and Necessary Condition for Graph Coloring Ope Joural of Dscrete Matheatcs, 04, 4, -5 Publshed Ole Jauary 04 (http://wwwscrporg/joural/ojd) http://dxdoorg/0436/ojd04400 O a Suffcet ad Necessary Codto for raph Colorg Maodog Ye Departet of Matheatcs,

More information

AT MOST EDGE 3 - SUM CORDIAL LABELING FOR SOME GRAPHS THE STANDARD

AT MOST EDGE 3 - SUM CORDIAL LABELING FOR SOME GRAPHS THE STANDARD Iteratoal Joural o Research Egeerg ad Appled Sceces IJREAS) Avalable ole at http://euroasapub.org/ourals.php Vol. x Issue x, July 6, pp. 86~96 ISSNO): 49-395, ISSNP) : 349-655 Impact Factor: 6.573 Thomso

More information

A PROCEDURE FOR SOLVING INTEGER BILEVEL LINEAR PROGRAMMING PROBLEMS

A PROCEDURE FOR SOLVING INTEGER BILEVEL LINEAR PROGRAMMING PROBLEMS ISSN: 39-8753 Iteratoal Joural of Iovatve Research Scece, Egeerg ad Techology A ISO 397: 7 Certfed Orgazato) Vol. 3, Issue, Jauary 4 A PROCEDURE FOR SOLVING INTEGER BILEVEL LINEAR PROGRAMMING PROBLEMS

More information

Cubic fuzzy H-ideals in BF-Algebras

Cubic fuzzy H-ideals in BF-Algebras OSR Joural of Mathematcs (OSR-JM) e-ssn: 78-578 p-ssn: 39-765X Volume ssue 5 Ver (Sep - Oct06) PP 9-96 wwwosrjouralsorg Cubc fuzzy H-deals F-lgebras Satyaarayaa Esraa Mohammed Waas ad U du Madhav 3 Departmet

More information

Biconnected Components

Biconnected Components Presetato for use wth the textbook, Algorthm Desg ad Applcatos, by M. T. Goodrch ad R. Tamassa, Wley, 2015 Bcoected Compoets SEA PVD ORD FCO SNA MIA 2015 Goodrch ad Tamassa Bcoectvty 1 Applcato: Networkg

More information

Some Results on Vertex Equitable Labeling

Some Results on Vertex Equitable Labeling Ope Joural of Dscrete Mathematcs, 0,, 5-57 http://dxdoorg/0436/odm0009 Publshed Ole Aprl 0 (http://wwwscrporg/oural/odm) Some Results o Vertex Equtable Labelg P Jeyath, A Maheswar Research Cetre, Departmet

More information

Office Hours. COS 341 Discrete Math. Office Hours. Homework 8. Currently, my office hours are on Friday, from 2:30 to 3:30.

Office Hours. COS 341 Discrete Math. Office Hours. Homework 8. Currently, my office hours are on Friday, from 2:30 to 3:30. Oce Hours Curretly, my oce hours are o Frday, rom :30 to 3:30. COS 31 Dscrete Math 1 Oce Hours Curretly, my oce hours are o Frday, rom :30 to 3:30. Nobody seems to care. Chage oce hours? Tuesday, 8 PM

More information

A Cordic-based Architecture for High Performance Decimal Calculations

A Cordic-based Architecture for High Performance Decimal Calculations A Cordc-ased Archtecture for Hgh Performace Decmal Calculatos Jose L. Sachez, Atoo Jmeo, Hgo Mora, Jeromo Mora, Fracsco Puol Computer Techology Departmet Uversty of Alcate Alcate, Spa Emal: sachez@dtc.ua.es,

More information

Point Estimation-III: General Methods for Obtaining Estimators

Point Estimation-III: General Methods for Obtaining Estimators Pot Estmato-III: Geeral Methods for Obtag Estmators RECAP 0.-0.6 Data: Radom Sample from a Populato of terest o Real valued measuremets: o Assumpto (Hopefully Reasoable) o Model: Specfed Probablty Dstrbuto

More information

From Math to Efficient Hardware. James C. Hoe Department of ECE Carnegie Mellon University

From Math to Efficient Hardware. James C. Hoe Department of ECE Carnegie Mellon University FFT Compler: From Math to Effcet Hardware James C. Hoe Departmet of ECE Carege Mello Uversty jot wor wth Peter A. Mlder, Fraz Frachett, ad Marus Pueschel the SPIRAL project wth support from NSF ACR-3493,

More information

Machine Learning: Algorithms and Applications

Machine Learning: Algorithms and Applications /03/ Mache Learg: Algorthms ad Applcatos Florao Z Free Uversty of Boze-Bolzao Faculty of Computer Scece Academc Year 0-0 Lecture 3: th March 0 Naïve Bayes classfer ( Problem defto A trag set X, where each

More information

A Type of Variation of Hamilton Path Problem with Applications

A Type of Variation of Hamilton Path Problem with Applications Edth Cowa Uersty Research Ole ECU Publcatos Pre. 20 2008 A Type of Varato of Hamlto Path Problem wth Applcatos Jta Xao Edth Cowa Uersty Ju Wag Wezhou Uersty, Zhejag, Cha 0.09/ICYCS.2008.470 Ths artcle

More information

International Mathematical Forum, 1, 2006, no. 31, ON JONES POLYNOMIALS OF GRAPHS OF TORUS KNOTS K (2, q ) Tamer UGUR, Abdullah KOPUZLU

International Mathematical Forum, 1, 2006, no. 31, ON JONES POLYNOMIALS OF GRAPHS OF TORUS KNOTS K (2, q ) Tamer UGUR, Abdullah KOPUZLU Iteratoal Mathematcal Forum,, 6, o., 57-54 ON JONES POLYNOMIALS OF RAPHS OF TORUS KNOTS K (, q ) Tamer UUR, Abdullah KOPUZLU Atatürk Uverst Scece Facult Dept. of. Math. 54 Erzurum, Turkey tugur@atau.edu.tr

More information

COMPARISON OF PARAMETERIZATION METHODS USED FOR B-SPLINE CURVE INTERPOLATION

COMPARISON OF PARAMETERIZATION METHODS USED FOR B-SPLINE CURVE INTERPOLATION Europea Joural of Techc COMPARISON OF PARAMETERIZATION METHODS USED FOR B-SPLINE CURVE INTERPOLATION Sıtı ÖZTÜRK, Cegz BALTA, Melh KUNCAN 2* Kocael Üverstes, Mühedsl Faültes, Eletro ve Haberleşme Mühedslğ

More information

A Comparison of Univariate Smoothing Models: Application to Heart Rate Data Marcus Beal, Member, IEEE

A Comparison of Univariate Smoothing Models: Application to Heart Rate Data Marcus Beal, Member, IEEE A Comparso of Uvarate Smoothg Models: Applcato to Heart Rate Data Marcus Beal, Member, IEEE E-mal: bealm@pdx.edu Abstract There are a umber of uvarate smoothg models that ca be appled to a varety of olear

More information

LP: example of formulations

LP: example of formulations LP: eample of formulatos Three classcal decso problems OR: Trasportato problem Product-m problem Producto plag problem Operatos Research Massmo Paolucc DIBRIS Uversty of Geova Trasportato problem The decso

More information

NEURO FUZZY MODELING OF CONTROL SYSTEMS

NEURO FUZZY MODELING OF CONTROL SYSTEMS NEURO FUZZY MODELING OF CONTROL SYSTEMS Efré Gorrosteta, Carlos Pedraza Cetro de Igeería y Desarrollo Idustral CIDESI, Av Pe de La Cuesta 70. Des. Sa Pablo. Querétaro, Qro, Méxco gorrosteta@teso.mx pedraza@cdes.mx

More information

FEATURE SELECTION ON COMBINATIONS FOR EFFICIENT LEARNING FROM IMAGES. Rong Xiao, Lei Zhang, and Hong-Jiang Zhang

FEATURE SELECTION ON COMBINATIONS FOR EFFICIENT LEARNING FROM IMAGES. Rong Xiao, Lei Zhang, and Hong-Jiang Zhang FEATURE SELECTION ON COMBINATIONS FOR EFFICIENT LEARNING FROM IMAGES Rog Xao, Le Zhag, ad Hog-Jag Zhag Mcrosoft Research Asa, Bejg 100080, P.R. Cha {t-rxao, lezhag, hjzhag}@mcrosoft.com ABSTRACT Due to

More information

COMSC 2613 Summer 2000

COMSC 2613 Summer 2000 Programmg II Fal Exam COMSC 63 Summer Istructos: Name:. Prt your ame the space provded Studet Id:. Prt your studet detfer the space Secto: provded. Date: 3. Prt the secto umber of the secto whch you are

More information

Preventing Information Leakage in C Applications Using RBAC-Based Model

Preventing Information Leakage in C Applications Using RBAC-Based Model Proceedgs of the 5th WSEAS It. Cof. o Software Egeerg Parallel ad Dstrbuted Systems Madrd Spa February 5-7 2006 (pp69-73) Prevetg Iformato Leakage C Applcatos Usg RBAC-Based Model SHIH-CHIEN CHOU Departmet

More information

Speeding- Up Fractal Image Compression Using Entropy Technique

Speeding- Up Fractal Image Compression Using Entropy Technique Avalable Ole at www.jcsmc.com Iteratoal Joural of Computer Scece ad Moble Computg A Mothly Joural of Computer Scece ad Iformato Techology ISSN 2320 088X IMPACT FACTOR: 5.258 IJCSMC, Vol. 5, Issue. 4, Aprl

More information

A Comparison of Heuristics for Scheduling Spatial Clusters to Reduce I/O Cost in Spatial Join Processing

A Comparison of Heuristics for Scheduling Spatial Clusters to Reduce I/O Cost in Spatial Join Processing Edth Cowa Uversty Research Ole ECU Publcatos Pre. 20 2006 A Comparso of Heurstcs for Schedulg Spatal Clusters to Reduce I/O Cost Spatal Jo Processg Jta Xao Edth Cowa Uversty 0.09/ICMLC.2006.258779 Ths

More information

Face Recognition using Supervised & Unsupervised Techniques

Face Recognition using Supervised & Unsupervised Techniques Natoal Uversty of Sgapore EE5907-Patter recogto-2 NAIONAL UNIVERSIY OF SINGAPORE EE5907 Patter Recogto Project Part-2 Face Recogto usg Supervsed & Usupervsed echques SUBMIED BY: SUDEN NAME: harapa Reddy

More information

A MapReduce-Based Multiple Flow Direction Runoff Simulation

A MapReduce-Based Multiple Flow Direction Runoff Simulation A MapReduce-Based Multple Flow Drecto Ruoff Smulato Ahmed Sdahmed ad Gyozo Gdofalv GeoIformatcs, Urba lag ad Evromet, KTH Drottg Krstas väg 30 100 44 Stockholm Telephoe: +46-8-790 8709 Emal:{sdahmed, gyozo}@

More information

Weighting Cache Replace Algorithm for Storage System

Weighting Cache Replace Algorithm for Storage System Weghtg Cache Replace Algorthm for Storage System Yhu Luo 2 Chagsheg Xe 2 Chegfeg Zhag 2 School of mathematcs ad Computer Scece, Hube Uversty, Wuha 430062, P.R. Cha 2 Natoal Storage System Laboratory, School

More information

A hybrid method using FAHP and TOPSIS for project selection Xuan Lia, Jiang Jiangb and Su Deng c

A hybrid method using FAHP and TOPSIS for project selection Xuan Lia, Jiang Jiangb and Su Deng c 5th Iteratoal Coferece o Computer Sceces ad Automato Egeerg (ICCSAE 205) A hybrd method usg FAHP ad TOPSIS for project selecto Xua La, Jag Jagb ad Su Deg c College of Iformato System ad Maagemet, Natoal

More information

A Web Mining Based Network Personalized Learning System Hua PANG1, a, Jian YU1, Long WANG2, b

A Web Mining Based Network Personalized Learning System Hua PANG1, a, Jian YU1, Long WANG2, b 3rd Iteratoal Coferece o Machery, Materals ad Iformato Techology Applcatos (ICMMITA 05) A Web Mg Based Network Persoalzed Learg System Hua PANG, a, Ja YU, Log WANG, b College of Educato Techology, Sheyag

More information

Exploring Wireless Sensor Network Configurations for Prolonging Network Lifetime

Exploring Wireless Sensor Network Configurations for Prolonging Network Lifetime 60 IJCSNS Iteratoal Joural of Computer Scece ad Network Securty, VOL7 No8, August 007 Explorg Wreless Sesor Network Cofguratos for Prologg Network Lfetme Zh Zha ad Yuhua Che, Departmet of Electrcal ad

More information

Workflow- Based Shape Optimization of Airfoils and Blades using Chained Bezier Curves

Workflow- Based Shape Optimization of Airfoils and Blades using Chained Bezier Curves Workflow- Based Shape Optmzato of Arfols ad Blades usg Chaed Bezer Curves Igor Pehec, Damr Vuča, Želja Loza Faculty of Electrcal Egeerg, Mechacal Egeerg ad Naval Archtecture FESB, Uversty of Splt, Croata

More information

Journal of Chemical and Pharmaceutical Research, 2015, 7(3): Research Article

Journal of Chemical and Pharmaceutical Research, 2015, 7(3): Research Article Avalable ole www.ocpr.com Joural of Chemcal ad Pharmaceutcal Research, 2015, 73):476-481 Research Artcle ISSN : 0975-7384 CODENUSA) : JCPRC5 Research o cocept smlarty calculato method based o sematc grd

More information

Blind Steganalysis for Digital Images using Support Vector Machine Method

Blind Steganalysis for Digital Images using Support Vector Machine Method 06 Iteratoal Symposum o Electrocs ad Smart Devces (ISESD) November 9-30, 06 Bld Stegaalyss for Dgtal Images usg Support Vector Mache Method Marcelus Hery Meor School of Electrcal Egeerg ad Iformatcs Badug

More information

Evaluation of Node and Link Importance Based on Network Topology and Traffic Information DU Xun-Wei, LIU Jun, GUO Wei

Evaluation of Node and Link Importance Based on Network Topology and Traffic Information DU Xun-Wei, LIU Jun, GUO Wei Advaced Materals Research Submtted: 2014-08-29 ISSN: 1662-8985, Vols. 1049-1050, pp 1765-1770 Accepted: 2014-09-01 do:10.4028/www.scetfc.et/amr.1049-1050.1765 Ole: 2014-10-10 2014 Tras Tech Publcatos,

More information

Optimal Allocation of Complex Equipment System Maintainability

Optimal Allocation of Complex Equipment System Maintainability Optmal Allocato of Complex Equpmet System ataablty X Re Graduate School, Natoal Defese Uversty, Bejg, 100091, Cha edcal Protecto Laboratory, Naval edcal Research Isttute, Shagha, 200433, Cha Emal:rexs841013@163.com

More information

PERSPECTIVES OF THE USE OF GENETIC ALGORITHMS IN CRYPTANALYSIS

PERSPECTIVES OF THE USE OF GENETIC ALGORITHMS IN CRYPTANALYSIS PERSPECTIVES OF THE USE OF GENETIC ALGORITHMS IN CRYPTANALYSIS Lal Besela Sokhum State Uversty, Poltkovskaa str., Tbls, Georga Abstract Moder cryptosystems aalyss s a complex task, the soluto of whch s

More information

Chapter 3 Descriptive Statistics Numerical Summaries

Chapter 3 Descriptive Statistics Numerical Summaries Secto 3.1 Chapter 3 Descrptve Statstcs umercal Summares Measures of Cetral Tedecy 1. Mea (Also called the Arthmetc Mea) The mea of a data set s the sum of the observatos dvded by the umber of observatos.

More information

Enumerating XML Data for Dynamic Updating

Enumerating XML Data for Dynamic Updating Eumeratg XML Data for Dyamc Updatg Lau Ho Kt ad Vcet Ng Departmet of Computg, The Hog Kog Polytechc Uversty, Hug Hom, Kowloo, Hog Kog cstyg@comp.polyu.edu.h Abstract I ths paper, a ew mappg model, called

More information

Greater Knowledge Extraction Based on Fuzzy Logic And GKPFCM Clustering Algorithm

Greater Knowledge Extraction Based on Fuzzy Logic And GKPFCM Clustering Algorithm 6th WSEAS It. Coferece o Computatoal Itellgece, Ma-Mache Systems ad Cyberetcs, Teerfe, Spa, December 14-16, 2007 47 Greater Kowledge Extracto Based o uzzy Logc Ad GKPCM Clusterg Algorthm BEJAMÍ OJEDA-MAGAÑA

More information

Keywords: complete graph, coloursignlesslaplacian matrix, coloursignlesslaplacian energy of a graph.

Keywords: complete graph, coloursignlesslaplacian matrix, coloursignlesslaplacian energy of a graph. Amerca Iteratoal Joural of Research Scece, Techology, Egeerg & Mathematcs Avalable ole at http://www.asr.et ISSN (Prt): 38-3491, ISSN (Ole): 38-3580, ISSN (CD-ROM): 38-369 AIJRSTEM s a refereed, dexed,

More information

Application of Genetic Algorithm for Computing a Global 3D Scene Exploration

Application of Genetic Algorithm for Computing a Global 3D Scene Exploration Joural of Software Egeerg ad Applcatos, 2011, 4, 253-258 do:10.4236/jsea.2011.44028 Publshed Ole Aprl 2011 (http://www.scrp.org/joural/jsea) 253 Applcato of Geetc Algorthm for Computg a Global 3D Scee

More information

EDGE- ODD Gracefulness of the Tripartite Graph

EDGE- ODD Gracefulness of the Tripartite Graph EDGE- ODD Graceuless o the Trpartte Graph C. Vmala, A. Saskala, K. Ruba 3, Asso. Pro, Departmet o Mathematcs, Peryar Maamma Uversty, Vallam, Thajavur Post.. Taml Nadu, Ida. 3 M. Phl Scholar, Departmet

More information

Fitting. We ve learned how to detect edges, corners, blobs. Now what? We would like to form a. compact representation of

Fitting. We ve learned how to detect edges, corners, blobs. Now what? We would like to form a. compact representation of Fttg Fttg We ve leared how to detect edges, corers, blobs. Now what? We would lke to form a hgher-level, h l more compact represetato of the features the mage b groupg multple features accordg to a smple

More information

Process Quality Evaluation based on Maximum Entropy Principle. Yuhong Wang, Chuanliang Zhang, Wei Dai a and Yu Zhao

Process Quality Evaluation based on Maximum Entropy Principle. Yuhong Wang, Chuanliang Zhang, Wei Dai a and Yu Zhao Appled Mechacs ad Materals Submtted: 204-08-26 ISSN: 662-7482, Vols. 668-669, pp 625-628 Accepted: 204-09-02 do:0.4028/www.scetfc.et/amm.668-669.625 Ole: 204-0-08 204 Tras Tech Publcatos, Swtzerlad Process

More information

Probabilistic properties of topologies of finite metric spaces minimal fillings.

Probabilistic properties of topologies of finite metric spaces minimal fillings. arxv:308.656v [math.mg] Aug 03 Probablstc propertes of topologes of fte metrc spaces mmal fllgs. Vsevolod Salkov Abstract I ths work we provde a way to troduce a probablty measure o the space of mmal fllgs

More information

ANALYSIS OF VARIANCE WITH PARETO DATA

ANALYSIS OF VARIANCE WITH PARETO DATA Proceedgs of the th Aual Coferece of Asa Pacfc Decso Sceces Isttute Hog Kog, Jue -8, 006, pp. 599-609. ANALYSIS OF VARIANCE WITH PARETO DATA Lakhaa Watthaacheewakul Departmet of Mathematcs ad Statstcs,

More information

Denoising Algorithm Using Adaptive Block Based Singular Value Decomposition Filtering

Denoising Algorithm Using Adaptive Block Based Singular Value Decomposition Filtering Advaces Computer Scece Deosg Algorthm Usg Adaptve Block Based Sgular Value Decomposto Flterg SOMKAIT UDOMHUNSAKUL Departmet of Egeerg ad Archtecture Rajamagala Uversty of Techology Suvarabhum 7/ Suaya,

More information

DEEP (Displacement Estimation Error Back-Propagation) Method for Cascaded ViSPs (Visually Servoed Paired Structured Light Systems)

DEEP (Displacement Estimation Error Back-Propagation) Method for Cascaded ViSPs (Visually Servoed Paired Structured Light Systems) DEEP (Dsplacemet Estmato Error Back-Propagato) Method for Cascaded VSPs (Vsually Servoed Pared Structured Lght Systems) Haem Jeo 1), Jae-Uk Sh 2), Wachoel Myeog 3), Yougja Km 4), ad *Hyu Myug 5) 1), 3),

More information

Multi Decryption Key Agreement in Dynamic Peer Group

Multi Decryption Key Agreement in Dynamic Peer Group 07 d Iteratoal oferece o omputer, etwork Securty ad ommucato Egeerg (SE 07) ISB: 978--60595-439-4 ult Decrypto Key Agreemet Dyamc Peer Group Ja ZHOU, ad L-ya SU School of aagemet Scece ad Egeer, Ahu Uversty

More information

Effects of Exterior Orientation Elements on Direct Georeferencing in POS-Supported Aerial Photogrammetry

Effects of Exterior Orientation Elements on Direct Georeferencing in POS-Supported Aerial Photogrammetry Proceedgs of the 8th Iteratoal mposum o patal Accurac Assessmet atural Resources ad Evrometal ceces hagha P. R. Cha Jue 5-7 008 pp. 30-36 Effects of Eteror Oretato Elemets o Drect Georeferecg PO-upported

More information

QUADRATURE POINTS ON POLYHEDRAL ELEMENTS

QUADRATURE POINTS ON POLYHEDRAL ELEMENTS QUADRATURE POINTS ON POLYHEDRAL ELEMENTS Tobas Pck, Peter Mlbradt 2 ABSTRACT The method of the fte elemets s a flexble umerc procedure both for terpolato ad approxmato of the solutos of partal dfferetal

More information

Differentiated Service of Streaming Media Playback Technology

Differentiated Service of Streaming Media Playback Technology Iteratoal Coferece o Advaced Iformato ad Commucato Techology for Educato (ICAICTE 2013) Dfferetated Servce of Streamg Meda Playback Techology CHENG Z-ao 1 MENG Bo 1 WANG Da-hua 1 ZHAO Yue 1 1 Iformatzato

More information

A Genetic K-means Clustering Algorithm Applied to Gene Expression Data

A Genetic K-means Clustering Algorithm Applied to Gene Expression Data A Geetc K-meas Clusterg Algorthm Appled to Gee Expresso Data Fag-Xag Wu, W. J. Zhag, ad Athoy J. Kusal Dvso of Bomedcal Egeerg, Uversty of Sasatchewa, Sasatoo, S S7N 5A9, CANADA faw34@mal.usas.ca, zhagc@egr.usas.ca

More information

Region Matching by Optimal Fuzzy Dissimilarity

Region Matching by Optimal Fuzzy Dissimilarity Rego Matchg by Optmal Fuzzy Dssmlarty Zhaggu Zeg, Ala Fu ad Hog Ya School of Electrcal ad formato Egeerg The Uversty of Sydey Phoe: +6--935-6659 Fax: +6--935-3847 Emal: zzeg@ee.usyd.edu.au Abstract: Ths

More information

Managing Moving Objects on Dynamic Transportation Networks

Managing Moving Objects on Dynamic Transportation Networks Maagg Movg Objects o Dyamc Trasportato Networks Zhmg Dg Ralf Hartmut Gütg Praktsche Iformatk IV, Feruverstät Hage, D-58084 Hage, Germay {zhmg.dg, rhg}@feru-hage.de Abstract Oe of the key research ssues

More information

Using Linear-threshold Algorithms to Combine Multi-class Sub-experts

Using Linear-threshold Algorithms to Combine Multi-class Sub-experts Usg Lear-threshold Algorthms to Combe Mult-class Sub-experts Chrs Mesterharm MESTERHA@CS.RUTGERS.EDU Rutgers Computer Scece Departmet 110 Frelghuyse Road Pscataway, NJ 08854 USA Abstract We preset a ew

More information

Transistor/Gate Sizing Optimization

Transistor/Gate Sizing Optimization Trasstor/Gate Szg Optmzato Gve: Logc etwork wth or wthout cell lbrary Fd: Optmal sze for each trasstor/gate to mmze area or power, both uder delay costrat Statc szg: based o tmg aalyss ad cosder all paths

More information

ChEn 475 Statistical Analysis of Regression Lesson 1. The Need for Statistical Analysis of Regression

ChEn 475 Statistical Analysis of Regression Lesson 1. The Need for Statistical Analysis of Regression Statstcal-Regresso_hadout.xmcd Statstcal Aalss of Regresso ChE 475 Statstcal Aalss of Regresso Lesso. The Need for Statstcal Aalss of Regresso What do ou do wth dvdual expermetal data pots? How are the

More information

Method to reduce the effect of miagrafic and sensory noise with isolating the isoline on ECG signal

Method to reduce the effect of miagrafic and sensory noise with isolating the isoline on ECG signal MATEC Web of Cofereces 1, 05017 (017 DTS-017 DOI: 10.1051/mateccof/017105017 Method to reduce the effect of marafc ad sesory ose wth solat the sole o ECG sal Evey Semeshchev 1,*, Dmtry Cheryshov 1, Ilya

More information

Clustering documents with vector space model using n-grams

Clustering documents with vector space model using n-grams Clusterg documets wth vector space model usg -grams Klas Skogmar, d97ksk@efd.lth.se Joha Olsso, d97jo@efd.lth.se Lud Isttute of Techology Supervsed by: Perre Nugues, Perre.Nugues@cs.lth.se Abstract Ths

More information

An Enhanced Local Covering Approach for Minimization of Multiple-Valued Input Binary-Valued Output Functions

An Enhanced Local Covering Approach for Minimization of Multiple-Valued Input Binary-Valued Output Functions Proceedgs of the 10th WSEAS Iteratoal Coferece o COMPUTERS, Voulagme, Athes, Greece, July 13-15, 2006 (pp63-68) A Ehaced Local Coverg Approach for Mmzato of Multple-Valued Iput Bary-Valued Output Fuctos

More information

NUMERICAL INTEGRATION BY GENETIC ALGORITHMS. Vladimir Morozenko, Irina Pleshkova

NUMERICAL INTEGRATION BY GENETIC ALGORITHMS. Vladimir Morozenko, Irina Pleshkova 5 Iteratoal Joural Iformato Theores ad Applcatos, Vol., Number 3, 3 NUMERICAL INTEGRATION BY GENETIC ALGORITHMS Vladmr Morozeko, Ira Pleshkova Abstract: It s show that geetc algorthms ca be used successfully

More information

Classification Web Pages By Using User Web Navigation Matrix By Mementic Algorithm

Classification Web Pages By Using User Web Navigation Matrix By Mementic Algorithm Classfcato Web Pages By Usg User Web Navgato Matrx By Memetc Algorthm 1 Parvaeh roustae 2 Mehd sadegh zadeh 1 Studet of Computer Egeerg Software EgeergDepartmet of ComputerEgeerg, Bushehr brach,

More information

Approximation of Curves Contained on the Surface by Freed-Forward Neural Networks

Approximation of Curves Contained on the Surface by Freed-Forward Neural Networks Appromato of Curves Cotaed o the Surface by Freed-Forward Neural Networks Zheghua Zhou ad Jawe Zhao Departmet of formato ad mathematcs Sceces Cha Jlag Uversty, Hagzhou, 3008, Cha zzhzjw003@63.com Abstract.

More information

New Fuzzy Integral for the Unit Maneuver in RTS Game

New Fuzzy Integral for the Unit Maneuver in RTS Game New Fuzzy Itegral for the Ut Maeuver RTS Game Peter Hu Fug Ng, YgJe L, ad Smo Ch Keug Shu Departmet of Computg, The Hog Kog Polytechc Uversty, Hog Kog {cshfg,csyjl,csckshu}@comp.polyu.edu.hk Abstract.

More information

MATHEMATICAL PROGRAMMING MODEL OF THE CRITICAL CHAIN METHOD

MATHEMATICAL PROGRAMMING MODEL OF THE CRITICAL CHAIN METHOD MATHEMATICAL PROGRAMMING MODEL OF THE CRITICAL CHAIN METHOD TOMÁŠ ŠUBRT, PAVLÍNA LANGROVÁ CUA, SLOVAKIA Abstract Curretly there s creasgly dcated that most of classcal project maagemet methods s ot sutable

More information

Signal Classification Method Based on Support Vector Machine and High-Order Cumulants

Signal Classification Method Based on Support Vector Machine and High-Order Cumulants Wreless Sesor Network,,, 48-5 do:.46/ws..7 Publshed Ole Jauary (http://www.scrp.org/joural/ws/). Sgal Classfcato Method Based o Support Vector Mache ad Hgh-Order Cumulats Abstract X ZHOU, Yg WU, B YANG

More information

Research on Circular Target Center Detection Algorithm Based on Morphological Algorithm and Subpixel Method

Research on Circular Target Center Detection Algorithm Based on Morphological Algorithm and Subpixel Method Research o Crcular Target Ceter Detecto Algorthm Based o Morphologcal Algorthm ad Subpxel Method Yu Le 1, Ma HuZhu 1, ad Yag Wezhou 1 1 College of Iformato ad Commucato Egeerg, Harb Egeerg Uversty, Harb

More information

Constructive Semi-Supervised Classification Algorithm and Its Implement in Data Mining

Constructive Semi-Supervised Classification Algorithm and Its Implement in Data Mining Costructve Sem-Supervsed Classfcato Algorthm ad Its Implemet Data Mg Arvd Sgh Chadel, Arua Twar, ad Naredra S. Chaudhar Departmet of Computer Egg. Shr GS Ist of Tech.& Sc. SGSITS, 3, Par Road, Idore (M.P.)

More information

A New Approach for Reconstructed B-spline Surface Approximating to Scattered Data Points. Xian-guo CHENG

A New Approach for Reconstructed B-spline Surface Approximating to Scattered Data Points. Xian-guo CHENG 2016 Iteratoal Coferece o Computer, Mechatrocs ad Electroc Egeerg (CMEE 2016 ISBN: 978-1-60595-406-6 A New Approach for Recostructed B-sple Surface Approxmatg to Scattered Data Pots Xa-guo CHENG Ngbo Uversty

More information

Constructing Scalable 3D Animated Model by Deformation Sensitive Simplification

Constructing Scalable 3D Animated Model by Deformation Sensitive Simplification Costructg Scalable 3D Amated Model by Deformato Seste Smplfcato Sheg-Yao Cho Natoal Tawa Uersty e@cmlab.cse.tu.edu.tw Bg-Yu Che Natoal Tawa Uersty rob@tu.edu.tw ABSTRACT To date, more hgh resoluto amated

More information

Descriptive Statistics: Measures of Center

Descriptive Statistics: Measures of Center Secto 2.3 Descrptve Statstcs: Measures of Ceter Frequec dstrbutos are helpful provdg formato about categorcal data, but wth umercal data we ma wat more formato. Statstc: s a umercal measure calculated

More information

PRIVATE set intersection (PSI) is a cryptographic protocol that

PRIVATE set intersection (PSI) is a cryptographic protocol that Effcet Delegated Prvate Set Itersecto o Outsourced Prvate Datasets Ayd Abad, Sotros Terzs, Roberto Metere, Chagyu Dog Abstract Prvate set tersecto (PSI) s a essetal cryptographc protocol that has may real

More information

Mode-based temporal filtering for in-band wavelet video coding with spatial scalability

Mode-based temporal filtering for in-band wavelet video coding with spatial scalability Mode-based temporal flterg for -bad wavelet vdeo codg wth spatal scalablty ogdog Zhag a*, Jzheg Xu b, Feg Wu b, Weju Zhag a, ogka Xog a a Image Commucato Isttute, Shagha Jao Tog Uversty, Shagha b Mcrosoft

More information

Software reliability is defined as the probability of failure

Software reliability is defined as the probability of failure Evolutoary Regresso Predcto for Software Cumulatve Falure Modelg: a comparatve study M. Beaddy, M. Wakrm & S. Aljahdal 2 : Dept. of Math. & Ifo. Equpe MMS, Ib Zohr Uversty Morocco. beaddym@yahoo.fr 2:

More information

Clustering Algorithm for High Dimensional Data Stream over Sliding Windows

Clustering Algorithm for High Dimensional Data Stream over Sliding Windows 2011 Iteratoal Jot Coferece of IEEE TrustCom-11/IEEE ICESS-11/FCST-11 Clusterg Algorthm for Hgh Dmesoal Data Stream over Sldg Wdows Weguo Lu, Ja OuYag School of Iformato Scece ad Egeerg, Cetral South Uversty,

More information

CS 2710 Foundations of AI Lecture 22. Machine learning. Machine Learning

CS 2710 Foundations of AI Lecture 22. Machine learning. Machine Learning CS 7 Foudatos of AI Lecture Mache learg Mlos Hauskrecht mlos@cs.ptt.edu 539 Seott Square Mache Learg The feld of mache learg studes the desg of computer programs (agets) capable of learg from past eperece

More information

An Efficient Approach to Mining Frequent Itemsets on Data Streams

An Efficient Approach to Mining Frequent Itemsets on Data Streams A Effcet Approach to Mg Frequet Itemsets o Data Streams Sara Asar, ad Mohammad Had Sadredd Abstract The creasg mportace of data stream arsg a wde rage of advaced applcatos has led to the extesve study

More information

A New Newton s Method with Diagonal Jacobian Approximation for Systems of Nonlinear Equations

A New Newton s Method with Diagonal Jacobian Approximation for Systems of Nonlinear Equations Joural of Mathematcs ad Statstcs 6 (3): 46-5, ISSN 549-3644 Scece Publcatos A New Newto s Method wth Dagoal Jacoba Appromato for Systems of Nolear Equatos M.Y. Wazr, W.J. Leog, M.A. Hassa ad M. Mos Departmet

More information

A Novel Optimization Algorithm for Adaptive Simplex Method with Application to High Dimensional Functions

A Novel Optimization Algorithm for Adaptive Simplex Method with Application to High Dimensional Functions A Novel Optmzato Algorthm for Adaptve Smplex Method th Applcato to Hgh Dmesoal Fuctos ZuoYg LIU, XaWe LUO 2 Southest Uversty Chogqg 402460, Cha, zuyglu@alyu.com 2 Southest Uversty Chogqg 402460, Cha, xael@su.edu.c.

More information

APPLICATION OF CLUSTERING METHODS IN BANK S PROPENSITY MODEL

APPLICATION OF CLUSTERING METHODS IN BANK S PROPENSITY MODEL APPLICATION OF CLUSTERING METHODS IN BANK S PROPENSITY MODEL Sergej Srota Haa Řezaková Abstract Bak s propesty models are beg developed for busess support. They should help to choose clets wth a hgher

More information

Effective Steganalysis Based on Statistical Moments of Wavelet Characteristic Function

Effective Steganalysis Based on Statistical Moments of Wavelet Characteristic Function Effectve Stegaalyss Based o Statstcal Momets of Wavelet Characterstc Fucto Yu Q. Sh 1, Guorog Xua, Chegyu Yag, Jaog Gao, Zhepg Zhag, Peq Cha, Deku Zou 1, Chuhua Che 1, We Che 1 1 New Jersey Isttute of

More information

Using The ACO Algorithm in Image Segmentation for Optimal Thresholding 陳香伶財務金融系

Using The ACO Algorithm in Image Segmentation for Optimal Thresholding 陳香伶財務金融系 教專研 95P- Usg The ACO Algorthm Image Segmetato for Optmal Thresholdg Abstract Usg The ACO Algorthm Image Segmetato for Optmal Thresholdg 陳香伶財務金融系 Despte the fact that the problem of thresholdg has bee qute

More information

Airline Fleet Routing and Flight Scheduling under Market Competitions. Tang and Ming-Chei

Airline Fleet Routing and Flight Scheduling under Market Competitions. Tang and Ming-Chei Arle Fleet Routg ad Flght Schedulg uder Market Compettos Shagyao Ya, Ch-Hu Tag ad Mg-Che Lee Departmet of Cvl Egeerg, Natoal Cetral Uversty 3/12/2009 Itroducto Lterature revew The model Soluto method Numercal

More information

WEB PAGE CLASSIFIERS FOR TOPICAL CRAWLER

WEB PAGE CLASSIFIERS FOR TOPICAL CRAWLER 244 WEB PAGE CLASSIFIERS FOR TOPICAL CRAWLER Dw H. Wdyatoro, Masayu L. Khodra, Paramta * School of Iformatcs ad Electrcal Egeerg - Isttut Tekolog Badug Jl. Gaesha 0 Badug Telephoe 62 22 250835 emal : dw@f.tb.ac.d,

More information

Beijing University of Technology, Beijing , China; Beijing University of Technology, Beijing , China;

Beijing University of Technology, Beijing , China; Beijing University of Technology, Beijing , China; d Iteratoal Coferece o Machery, Materals Egeerg, Chemcal Egeerg ad Botechology (MMECEB 5) Research of error detecto ad compesato of CNC mache tools based o laser terferometer Yuemg Zhag, a, Xuxu Chu, b

More information

Theoretical Computer Science

Theoretical Computer Science Theoretcal Computer Scece 40 009 949 957 Cotets lsts avalable at SceceDrect Theoretcal Computer Scece joural homepage: www.elsever.com/locate/tcs Improved approxmato bouds for edge domatg set dese graphs

More information

Mamdani Fuzzy Logic Controller with Mobile Agents for Matching

Mamdani Fuzzy Logic Controller with Mobile Agents for Matching RECENT DVNCES NEURL NETWORKS, FUZZY SYSTEMS & EVOLUTIONRY COMPUTING Mamda Fuzzy Logc Cotroller wth Moble gets for Matchg ION INCU, CLUDIU-IONUT POPIRLN Departmet of Computer Scece Uversty of Craova 3.

More information

Review Statistics review 1: Presenting and summarising data Elise Whitley* and Jonathan Ball

Review Statistics review 1: Presenting and summarising data Elise Whitley* and Jonathan Ball Crtcal Care February Vol 6 No Whtley ad Ball Revew Statstcs revew : Presetg ad summarsg data Else Whtley* ad Joatha Ball *Lecturer Medcal Statstcs, Uversty of Brstol, Brstol, UK Lecturer Itesve Care Medce,

More information

BOOLEAN MATHEMATICS: GENERAL THEORY

BOOLEAN MATHEMATICS: GENERAL THEORY CHAPTER 3 BOOLEAN MATHEMATICS: GENERAL THEORY 3.1 ISOMORPHIC PROPERTIES The ame Boolea Arithmetic was chose because it was discovered that literal Boolea Algebra could have a isomorphic umerical aspect.

More information

A NOVEL ADAPTIVE FUZZY INFERENCE SYSTEM FOR MOBILE ROBOT NAVIGATION

A NOVEL ADAPTIVE FUZZY INFERENCE SYSTEM FOR MOBILE ROBOT NAVIGATION A NOVEL ADAPTIVE FUZZY INFERENCE SYSTEM FOR MOBILE ROBOT NAVIGATION J. HOSSEN, S. SAYEED, 3 A. HUDAYA, 4 M. F. A. ABDULLAH, 5 I. YUSOF Faculty of Egeerg ad Techology (FET), Multmeda Uversty (MMU), Malaysa,,3,4,5

More information

Reliable Surface Extraction from Point-Clouds using Scanner-Dependent Parameters

Reliable Surface Extraction from Point-Clouds using Scanner-Dependent Parameters 1 Relable Surface Extracto from Pot-Clouds usg Scaer-Depedet Parameters Hrosh Masuda 1, Ichro Taaka 2, ad Masakazu Eomoto 3 1 The Uversty of Tokyo, masuda@sys.t.u-tokyo.ac.jp 2 Tokyo Dek Uversty, taaka@cck.deda.ac.jp

More information

Network Security Evaluation Based on Variable Weight Fuzzy Cloud Model

Network Security Evaluation Based on Variable Weight Fuzzy Cloud Model 207 2 d Iteratoal Coferece o Computer Scece ad Techology (CST 207) ISBN: 978--60595-46-5 Networ Securty Evaluato Based o Varable Weght Fuzzy Cloud Model Yag JIANG a*, Cheg-ha LI, Zh-peg LI ad Mg-ca SUN

More information