PERSPECTIVES OF THE USE OF GENETIC ALGORITHMS IN CRYPTANALYSIS
|
|
- Elmer Barker
- 5 years ago
- Views:
Transcription
1 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 estmated to exceed the volume of cryptaalyst real opportutes. Evolutoary algorthms, amely geetc algorthms, have a opportuty to dramatcally reduce the umber of assumptos. Merkle - Hellma cryptosystem s a publc key cpher, whch s based o the famous kapsak task. Splma was frst,who used a geetc algorthm to break the cpher, the a scetst has expaded ts work ths drecto. I these works carred out kow-platext attack. Yet there s the Shamr s polyomal-tme algorthm, whch the successfully breakable Merkle - Hellma system, fds the secret key va the publc key. Despte the fact that the Shamr s algorthm s polyomal-tme, for breakg a real system eed to perform a large amout of computato. The paper ams to demostrate the advatages of the use of geetc algorthms for cryptoaalyss compared wth other methods. Drectly the publc key cryptalgorthms cases, where we ca fds the secret key va the publc key. I ths sese, we have created two separate ad dfferet from the other algorthms algorthm (the geetc lbrares) have mplemeted ths algorthm attack Merkle - Hellma cryptosystem. The obtaed results allow us to coclude that the use of geetc algorthms for cryptaalyss s effectve ad what we have descrbed a algorthm for fdg the secret key s much faster tha the Shamr s algorthm. IdexTerms: geetc algorthms, cryptosystem, the system Merkley-Hellma cryptaalys. I. INTRODUCTION Merkley - Hellma Cryptosystem s a publc-key cpher based o the well-kowproblem kapsack []. Splma frst used a geetc algorthm to crack ths code [2]. Severalother researchers [3,4,5] have expaded the work ths drecto cocetratg maly o thetal parameters of geetc algorthms. At the same tme, all these papers, thsproblem s solved by fdg the decrypto of the cphertext wthout the secret key.we put the problem of computg the secret key from the publc key usg the attacks based o the kow platext usg a geetc algorthm. The results of such a attack ca be compared wth the results of the attack algorthm A. Shamr [6] verfes whether such approach provdes a real advatage. II. DENTIFIER MERKLEY - HELMAN A. The problem of the kapsack. Kapsack problem ca be formally stated as follows. Da backpack volume ad a set of objects, each wth a volume of Our goal s to fd a subset of the set for whch the equalty V = x a 56
2 where x {0, }, for all I geeral, the presece of such a subset requres exhaustve search, whose complexty s O(2 ), however, there s a specal case whe the problem s elemetary solved. B. The calculato of the publc key from the prvate kay. The algorthm Merkley - Hellma as a secret key takes codto j sequece, where each > a a j j= For ths sequece, there s a algorthm that solves the problem of the kapsack ad complexty, whch s a polyomal of (or rather lear). The publc key of the prvato, prepared by the followg trasformato. Choose a umber m, whch satsfes the codto m > a ad the umber, where, ad elemets of the publc key s calculated by the formula: b ta (mod m). C. Ecrypto ad decrypto. Message s coverted to a bt sequece ad dvded by bts. Calculate the sum of. s, s2,... sl formula = s j = x b, j blocks. Each block cotas exactly where aj s the - the elemet of the block of the ope test. s, s2,... sl ad there s a amout - cphertext. To decrypt each sum s multpled by modulo ad the problem s solved by usg a kapsack creasg over sequece for each. III SHAMIR ALGORITHM Shamr broke Merkl-Hellma algorthm whch showed that t s ot ecessary to search for t couple ad the exact over creasg sequece, whch has bee ecrypted. It s eough to fd a ad a par of over creasg sequece, whch s derved from the sequece, va followg formula a = b t (mod m). Shamr attack us kapsack system algorthm whch cossts of two parts. To a whole umber, for whch the codto s satsfed, the value for some s located these fuctos mmum terval. After accumulatg a certa umber of pots, algorthm s lookg for par va Dophate approxmato method, whch may ope the key to to calculate the secret key. IV. GENETIC ALGORITHMS Geetc algorthm based o the mechasm of atural selecto. It was frstly proposed by Hollad 975. The algorthm starts wth a radom selecto of caddates solutos (aalogues 57
3 of chromosomes), represeted bary strgs. By applyg geetc operators of selecto, crossover ad mutato to each geerato of caddates solutos to get a ew geerato of caddates solutos. Thus, these rows are a ew geerato average better tha the prevous (depedg o the choce of the target, or as ofte referred to, a ftess fucto).the most mportat advatage s the ablty of geetc algorthms parallel to the realzatos of the process of fdg a soluto that sgfcatly reduces the attack. IV. ALGORITHM Our method of attack s qute dfferet from the methods used the above metoed works. Besdes, we created a geetc algorthm qute dfferet from other geetc algorthms (dfferet the selecto crtero ad crossover process). Our geetc algorthm s descrbed fle geetc2.h created by us. I geetc class of the fle four fuctos are descrbed: the ftess fucto (bool ftess(vector<populatca>&v)), the crossover fucto (vod crossover (vector<populatca>&v)), the mutato fucto (vod ftess(vector<populatca>&v)) ad the selecto fucto (vod selektca(vector<populatca>&v)). a) The ftess fucto determes the extreme crease each member (soluto-caddate) of the populato trasmtted to t. The ftess value of the soluto-caddate the sequece s equal to the quatty of the extremely creasg members. b) The selecto fucto chooses the selecto-caddates, whch the most fulfll the ftess fucto,.e. ther ftess values are hgher tha those of others. I case the populato sze s Lwe choose oly L/5 soluto-caddates. Exactly these soluto-caddates form ew geeratos. c) The crossover fucto receves the populato of the soluto-caddates. From ths populato we choose soluto-caddates wth t ad t2 umbers pars by meas of a radom geerator takg to accout that t ad t2 do ot cocde wth each other ad the used par s ot repeated. Each soluto-caddate s dvded two parts (at the mdpot). d) The mutato fucto chages oe byte of each soluto-caddate. We choose the dex by the radom geerator ad chage the relevat bt,.e. f the bt value s zero t s chaged, ad o the cotrary, f t s, the t s chaged zero. Our goal s, usg the above descrbed algorthm, to fd such (u,m) par, by whch we wll be able to fd the extremely creasg sequece by the followg formula: b = au(mod m), whereu=t - (3) The algorthm s realzed o C++ laguage base. It cossts of the preparato ad ma parts. I the preparato part the formato-to-be-trasmtted s cphered by the Merkle-Hellma algorthm. We took { b, b2,... b} extremely creasg sequece, m module root ad selected t multpler, by meas of whch we calculated ope key a = b t(mod m) ad cphered the formato-to-be-trasmtted by the formula (3). The workg chart of the ma algorthms s as follows:. The tal populato s represeted by m root, whch s talzed by radom geerator (t s represeted bary system). The sze of each member (soluto-caddate) of the populato s d*, where s equal to the legth of the ope key ad d=2. The soluto-caddates are trasformed to bary system. 2. Lke the Shamr algorthm we take the frst four members of the ope key ad calculate the verse of t multpler by m root u = p * m / a, where u = t, <= p <= a, 0 <= < 4. Thus, we receve the populato all probable multplers. We set lmts for selectg u multpler. Besdes (u,m)=ad u<m, u multpler multpled by the thrd member of the 58
4 ope key must exceed m root. By addg ths lmt we reduce the soluto-caddates of u multpler,.e. make the algorthm more purposeful. We fd the relevat closed key by (3) formula for all probable caddates of (u,m)par. 3. We determe the crtero for selecto by the ftess fucto. I ths case the crtero for selecto s the extreme crease the closed key obtaed as a result of the fourth phase. I case the sequece s extremely creasg,.e. the value of the ftess fucto s less tha, we pass to the followg phase. 4. By meas of the crossover fucto we carry out the crossover operato for the chose soluto-caddates. 5. For the receved soluto-caddates the secod, thrd ad fourth phases are repeated. I case the ftess fucto of ay soluto-caddate s equal to, t meas the desred result s obtaed ad the program stops fuctog. Otherwse, we pass to the followg phase. 6. The selecto fucto chooses the L/5 (L s the sze of the tal populato)umber soluto-caddates, the ftess fuctos of whch are hgher. 7. We have dcated that the process wll repeat 0 tmes. If ths process s repeated, 0 tmes ad we do t get the desred result, oly ths case we use a mutato, or chage the fucto of the gee, ad the repeat the 2d, 3rd ad 4th steps. Whe We get the desred results, we stop workg. But tests showed that o f the mutatos feature s ot eeded, ad the hybrdzato of a maxmum of 5 tmes usg we get the desred result table shows the results of the expermets. Kkey legth Populato sze The umber of expermets carred out Repeatg the average umber of geetc operators (crossover operato) Average executo tme st st st st Accordg to the expermet results t s obvous that by the use of geetc algorthms the Merkle-Hellma cryptosystem s cracked qute quckly. Cosequetly, we may coclude that use of geetc algorthms wll be useful for cryptaalyss of other asymmetrc cryptosystems as well. REFERENCES [] S Merkle R.C., Hellma M.E. Hddg formato ad sgatures trapdoor Kapsak, IEEE Tras. Iform. Theory, IT-24 (978), pp [2] Spllma R. Cryptaalyss of Kapsack cphers usg geetc algorthms. Cryptologra, October, 993. [3] Yasee, Sahasrabuddhe. A Geetc Algorthm for cryptaalyss of Chor Rvest Kapsack Publc key cryptosystem, Thrd teratoal coferece o computatoal tellgece ad multmeda applcatos, 999. [4] Garg P., Shastr A. A Improved Cryptaalytc Attack o Kapsack Cpher usg Geetc Algorthm. Iteratoal Joural of Iformato Techology 3:
5 [5] Muthureguatha R., Vekatarama D., Rajasekara P. Cryptaalyss of Kapsack Cher Usg Parrallel Evolutoary Computg. Iteratoal Joural of Recet Treds Egeerg, Vol., No, May [6] Shamr A. A Polomal-Tme Algorthm for Breakg the Basc Merkle-Hellma Cryptosystem. IEEE Trasactos o Iformato Theory Vol., IT-30, No5, september 984, pp Artcle receved:
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 informationCracking of the Merkle Hellman Cryptosystem Using Genetic Algorithm
Crackng of the Merkle Hellman Cryptosystem Usng Genetc Algorthm Zurab Kochladze 1 * & Lal Besela 2 1 Ivane Javakhshvl Tbls State Unversty, 1, I.Chavchavadze av 1, 0128, Tbls, Georga 2 Sokhum State Unversty,
More informationArea 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 information1-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 informationSoftware 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 informationNUMERICAL 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 informationA 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 informationBlind 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 informationFitting. 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 informationPoint 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 informationAn Improved Fuzzy C-Means Clustering Algorithm Based on Potential Field
07 d Iteratoal Coferece o Advaces Maagemet Egeerg ad Iformato Techology (AMEIT 07) ISBN: 978--60595-457-8 A Improved Fuzzy C-Meas Clusterg Algorthm Based o Potetal Feld Yua-hag HAO, Zhu-chao YU *, X GAO
More informationA genetic procedure used to train RFB neural networks
A geetc procedure used to tra RFB eural etworks Costat-Iula VIZITIU Commucatos ad Electroc Systems Departmet Mltary Techcal Academy George Cosbuc Aveue 8-83 5 th Dstrct Bucharest ROMANIA vc@mta.ro http://www.mta.ro
More informationFor 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 informationDescriptive 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 informationFace 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 informationMINIMIZATION OF THE VALUE OF DAVIES-BOULDIN INDEX
MIIMIZATIO OF THE VALUE OF DAVIES-BOULDI IDEX ISMO ÄRÄIE ad PASI FRÄTI Departmet of Computer Scece, Uversty of Joesuu Box, FI-800 Joesuu, FILAD ABSTRACT We study the clusterg problem whe usg Daves-Bould
More informationBezier 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 informationDifferentiated 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 informationOptimization of Light Switching Pattern on Large Scale using Genetic Algorithm
Optmzato of Lght Swtchg Patter o Large Scale usg Geetc Algorthm Pryaka Sambyal, Pawaesh Abrol 2, Parvee Lehaa 3,2 Departmet of Computer Scece & IT 3 Departmet of Electrocs Uversty of Jammu, Jammu, J&K,
More informationCOMSC 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 informationMATHEMATICAL 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 informationWorkflow- 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 informationMachine 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 informationExploring 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 informationClustering 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 informationA Proposed Encoding and Hiding Text in an Image by using Fractal Image Compression
Dr. Fadhl Salma Abed / Iteratoal Joural o Computer Scece ad Egeerg (IJCSE) A Proposed Ecodg ad Hdg Text a Image by usg Fractal Image Compresso Dr. Fadhl Salma Abed Lecturer Uversty Techcal Isttute of Kalar
More informationCOMBINATORIAL METHOD OF POLYNOMIAL EXPANSION OF SYMMETRIC BOOLEAN FUNCTIONS
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.
More informationA 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 informationProcess 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 informationNEURO 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 informationA 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 informationChEn 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 informationOn 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 informationLP: 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 informationA 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 informationCS 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 informationApplication 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 informationUsing 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 informationImproved MOPSO Algorithm Based on Map-Reduce Model in Cloud Resource Scheduling
Improved MOPSO Algorthm Based o Map-Reduce Model Cloud Resource Schedulg Heg-We ZHANG, Ka NIU *, J-Dog WANG, Na WANG Zhegzhou Isttute of Iformato Scece ad Techology, Zhegzhou 45000, Cha State Key Laboratory
More informationA 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 informationEight 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 informationANALYSIS 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 informationSignal 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 informationBeijing 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 informationInternational 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 informationDelay based Duplicate Transmission Avoid (DDA) Coordination Scheme for Opportunistic routing
Delay based Duplcate Trasmsso Avod (DDA) Coordato Scheme for Opportustc routg Ng L, Studet Member IEEE, Jose-Fera Martez-Ortega, Vcete Heradez Daz Abstract-Sce the packet s trasmtted to a set of relayg
More informationResearch Article Mechanism of Immune System Based Multipath Fault Tolerant Routing Algorithm for Wireless Sensor Networks
Hdaw Publshg Corporato Iteratoal Joural of Dstrbuted Sesor Networks Volume 2013, Artcle ID 514182, 13 pages http://dx.do.org/10.1155/2013/514182 Research Artcle Mechasm of Immue System Based Multpath Fault
More informationFEATURE 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 informationEvaluation 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 informationPrediction Method of Network Security Situation Based on GA- LSSVM Time Series Analysis
AMSE JOURNALS-AMSE IIETA publcato-07-seres: Advaces B; Vol. 60; N ; pp 37-390 Submtted Mar. 05 07; Revsed May 5 07; Accepted Ju. 0 07 Predcto Method of Network Securty Stuato Based o GA- LSSVM Tme Seres
More informationData Structures and Algorithms(2)
Mg Zhag Data Structures ad Algorthms Data Structures ad Algorthms(2) Istructor: Mg Zhag Textbook Authors: Mg Zhag, Tegjao Wag ad Haya Zhao Hgher Educato Press, 2008.6 (the "Eleveth Fve-Year" atoal plag
More informationChapter 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 informationPreventing 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 informationMulti 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 informationPerformance Impact of Load Balancers on Server Farms
erformace Impact of Load Balacers o Server Farms Ypg Dg BMC Software Server Farms have gaed popularty for provdg scalable ad relable computg / Web servces. A load balacer plays a key role ths archtecture,
More informationParallel Ant Colony for Nonlinear Function Optimization with Graphics Hardware Acceleration
Proceedgs of the 009 IEEE Iteratoal Coferece o Systems Ma ad Cyberetcs Sa Atoo TX USA - October 009 Parallel At Coloy for Nolear Fucto Optmzato wth Graphcs Hardware Accelerato Wehag Zhu Departmet of Idustral
More informationSpeeding- 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 informationDesigning a learning system
CS 75 Mache Leafrg Lecture 3 Desgg a learg system Mlos Hauskrecht mlos@cs.ptt.edu 539 Seott Square, x4-8845 people.cs.ptt.edu/~mlos/courses/cs75/ Homeork assgmet Homeork assgmet ll be out today To parts:
More informationA 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 informationWeighting 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 informationAN IMPROVED TEXT CLASSIFICATION METHOD BASED ON GINI INDEX
Joural of Theoretcal ad Appled Iformato Techology 30 th September 0. Vol. 43 No. 005-0 JATIT & LLS. All rghts reserved. ISSN: 99-8645 www.jatt.org E-ISSN: 87-395 AN IMPROVED TEXT CLASSIFICATION METHOD
More informationCOMPARISON 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 informationOffice 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 informationHardware/Software partitioning approach for embedded system design based on Genetic Algorithm
Iteratoal Joural of Scetfc Research & Egeerg Techology (IJSET ISSN: 2356-5608, Vol.3, ssue 3 Copyrght IPCO-205-pp.20-25 Hardware/Software parttog approach for embedded system desg based o Geetc Algorthm
More informationNew 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 informationClassification 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 informationA 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 informationA New Hybrid Audio Classification Algorithm Based on SVM Weight Factor and Euclidean Distance
Proceedgs of the 2007 WSEAS Iteratoal Coferece o Computer Egeerg ad Applcatos, Gold Coast, Australa, Jauary 7-9, 2007 52 A New Hybrd Audo Classfcato Algorthm Based o SVM Weght Factor ad Eucldea Dstace
More informationMarcus Gallagher School of Information Technology and Electrical Engineering The University of Queensland QLD 4072, Australia
O the Importace of Dversty Mateace Estmato of Dstrbuto Algorthms Bo Yua School of Iformato Techology ad Electrcal Egeerg The Uversty of Queeslad QLD 4072, Australa +6-7-3365636 boyua@tee.uq.edu.au Marcus
More informationSVM Classification Method Based Marginal Points of Representative Sample Sets
P P College P P College P Iteratoal Joural of Iformato Techology Vol. No. 9 005 SVM Classfcato Method Based Margal Pots of Represetatve Sample Sets Wecag ZhaoP P, Guagrog JP P, Ru NaP P, ad Che FegP of
More informationA 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 informationFuzzy ID3 Decision Tree Approach for Network Reliability Estimation
IJCSI Iteratoal Joural of Computer Scece Issues, Vol. 9, Issue 1, o 1, Jauary 2012 ISS (Ole): 1694-0814 www.ijcsi.org 446 Fuzzy ID3 Decso Tree Approach for etwor Relablty Estmato A. Ashaumar Sgh 1, Momtaz
More informationReconstruction of Orthogonal Polygonal Lines
Recostructo of Orthogoal Polygoal Les Alexader Grbov ad Eugee Bodasky Evrometal System Research Isttute (ESRI) 380 New ork St. Redlads CA 9373-800 USA {agrbov ebodasky}@esr.com Abstract. A orthogoal polygoal
More informationUnsupervised Discretization Using Kernel Density Estimation
Usupervsed Dscretzato Usg Kerel Desty Estmato Maregle Bba, Floraa Esposto, Stefao Ferll, Ncola D Mauro, Teresa M.A Basle Departmet of Computer Scece, Uversty of Bar Va Oraboa 4, 7025 Bar, Italy {bba,esposto,ferll,dm,basle}@d.uba.t
More informationJournal 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 informationA Novel Spectrum Sensing for Cognitive Radio Networks with Noise Uncertainty
Ths artcle has bee accepted for publcato a future ssue of ths joural, but has ot bee fully edted. Cotet may chage pror to fal publcato. Ctato formato: DOI.9/TVT.6.596789, IEEE Trasactos o Vehcular Techology
More informationAdvanced mixing audio streams for heterogeneous computer systems in telecommunications
Advaced mxg audo streams for heterogeeous computer systems telecommucatos A.A. Kolpakov, Ju.A. Kropotov Murom sttute (brach) VlSU, Orlovskaya st., 3, 6064, Murom, Vladmr rego, Russa Abstract Ths paper
More informationAPPLICATION 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 informationA 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 informationMethod 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 informationGrid Resource Discovery Algorithm Based on Distance
966 JOURNAL OF SOFTWARE, OL. 9, NO., NOEMBER 4 Grd Resource Dscovery Algorthm Based o Dstace Zhogpg Zhag,, Log He, Chao Zhag The School of Iformato Scece ad Egeerg, Yasha Uversty, Qhuagdao, Hebe, 664,
More informationEight 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 informationSALAM A. ISMAEEL Computer Man College for Computer Studies, Khartoum / Sudan
AAPTIVE HYBRI-WAVELET ETHO FOR GPS/ SYSTE INTEGRATION SALA A. ISAEEL Computer a College for Computer Studes, Khartoum / Suda salam.smaeel@gmal.com ABSTRACT I ths paper, a techque for estmato a global postog
More informationA NEW CRYPTOSYSTEM BASED ON POLYALPHABETIC SUBSTITUTION SCHEME WITH MULTIPLE NUMBER OF VIGENERE TABLE
A EW CRYPTOSYSTEM BASED O POLYALPHABETIC SUBSTITUTIO SCHEME WITH MULTIPLE UMBER OF VIGEERE TABLE RAJU S KARTHA, 2 VARGHESE PAUL School of Computer Scece, Mahatma Gadh Uversty, Kottayam, Kerala, 2 Departmet
More informationSoftware Clustering Techniques and the Use of Combined Algorithm
Software Clusterg Techques ad the Use of Combed Algorthm M. Saeed, O. Maqbool, H.A. Babr, S.Z. Hassa, S.M. Sarwar Computer Scece Departmet Lahore Uversty of Maagemet Sceces DHA Lahore, Paksta oaza@lums.edu.pk
More informationProf. Feng Liu. Winter /24/2019
Prof. Feg Lu Wter 209 http://www.cs.pd.edu/~flu/courses/cs40/ 0/24/209 Last Tme Feature detecto 2 Toda Feature matchg Fttg The followg sldes are largel from Prof. S. Lazebk 3 Wh etract features? Motvato:
More informationMultithreaded implementation and performance of a modified artificial fish swarm algorithm for unconstrained optimization
Multthreaded mplemetato ad performace of a modfed artfcal fsh swarm algorthm for ucostraed optmzato Mla Tuba, Nebojsa Baca, ad Nadezda Staarevc Abstract Artfcal fsh swarm (AFS) algorthm s oe of the latest
More informationAn Ensemble Multi-Label Feature Selection Algorithm Based on Information Entropy
The Iteratoal Arab Joural of Iformato Techology, Vol., No. 4, July 204 379 A Esemble Mult-Label Feature Selecto Algorthm Based o Iformato Etropy Shg L, Zheha Zhag, ad Jaq Dua School of Computer Scece,
More informationComparison Studies on Classification for Remote Sensing Image Based on Data Mining Method
Hag Xao ad Xub Zhag Comparso Studes o Classfcato for Remote Sesg Image Based o Data Mg Method Hag XIAO 1, Xub ZHANG 1 1: School of Electroc, Iformato ad Electrcal Egeerg Shagha Jaotog Uversty No. 1954,
More informationUsing 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 informationA 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 informationPRIVATE 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 informationNonparametric Comparison of Two Dynamic Parameter Setting Methods in a Meta-Heuristic Approach
Noparametrc Comparso of Two Dyamc Parameter Settg Methods a Meta-Heurstc Approach Seyhu HEPDOGAN, Ph.D. Departmet of Idustral Egeerg ad Maagemet Systems, Uversty of Cetral Florda Orlado, Florda 32816,
More informationNine 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 informationITEM ToolKit Technical Support Notes
ITEM ToolKt Notes Fault Tree Mathematcs Revew, Ic. 2875 Mchelle Drve Sute 300 Irve, CA 92606 Phoe: +1.240.297.4442 Fax: +1.240.297.4429 http://www.itemsoft.com Page 1 of 15 6/1/2016 Copyrght, Ic., All
More informationSummary of Curve Smoothing Technology Development
RESEARCH ARTICLE Summary of Curve Smoothg Techology Developmet Wu Yze,ZhagXu,Jag Mgyag (College of Mechacal Egeerg, Shagha Uversty of Egeerg Scece, Shagha, Cha) Abstract: Wth the cotuous developmet of
More informationPattern Extraction, Classification and Comparison Between Attribute Selection Measures
Subrata Pramak et al. / (IJCSIT) Iteratoal Joural of Computer Scece ad Iformato Techoes, Vol. 1 (5), 010, 371-375 Patter Extracto, Classfcato ad Comparso Betwee ttrbute Selecto Measures Subrata Pramak,
More informationCubic 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 informationA Framework for Block-Based Timing Sensitivity Analysis
39.3 Framework for Block-Based Tmg Sestvty alyss Sajay V. Kumar Chadramoul V. Kashyap Sach S. Sapatekar Uversty of Mesota Itel Corporato Uversty of Mesota Meapols MN 55455 Hllsboro OR 973 Meapols MN 55455
More informationFrom 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