OnePC: A portable software for parallel genetic algorithms used in optimization problems
|
|
- Ophelia Cross
- 5 years ago
- Views:
Transcription
1 OePC: A portable software for parallel geetic algorithms used i optimizatio problems Ioais G. Tsoulos, Departmet of Computer Egieerig, School of Applied Techology Techological educatioal istitute of Epirus, Greece Abstract OePC is a software etirely writte i ANSI C++ usig the QT library to be portable. The software implemets parallel geetic algorithms that are based to a ovel algorithm to tackle the global optimizatio problem. The proposed algorithm cotais a ehaced stoppig rule ad a periodical applicatio of a local search procedure. Also, the software cotais a script laguage to assist the programmers. The article itroduces the software ad the uderlyig algorithm as well as some experimetal results. Idex Terms : Geetic algorithms, Global optimizatio, Parallel Computig, Programmig tool I. INTRODUCTION The commo problem of estimatig the global miimum of a multi - dimesioal fuctio is give as x = arg mi f x x S wheres is a subset of R ad is defied by: S = a 1, b 1 a 2, b 2 a, b This problem appears i may scietific areas such as [1]-[2], chemistry [3]-[4], ecoomics [5] etc. Oe commo techique to tackle this is the aturally ispired method of geetic algorithms [6]. Geetic algorithms have bee used i a may fields [7]-[9] ad they have may advatages such as: Adaptatio i every problem Requiremet for the objective fuctio oly ad ot for gradiet fuctios They ca be parallelized easily The most frequet model for parallel geetic algorithms is the server - cliet model, such as the so called Islad model [10]-[11], where cliets ru a a local geetic algorithm ad the server collects iformatio from the cliets ad occasioally distributes iformatio to them, such as the best discovered miimum.the proposed software amed OePC implemets a cliet - server model for parallel geetic algorithms with some advaced features such as: 1. A modified stoppig rule. This termiatio rule has bee proposed also i a recet work [12] ad it is geeral eough to be adapted i ay geetic algorithm. 2. A periodical applicatio of a local search procedure. 3. Exchage of best chromosomes betwee cliets. The proposed software has bee writte etirely i ANSI C++ usig the Qt library freely available from i order to be portable i ay operatig system. The rest of this article has as follows: i sectio II a detailed descriptio of the method is give, i sectio III full documetatio of the software is provided, i sectio IV some experimets that outlie the usability of the software are listed ad fially i sectio V some coclusios are preseted accompaied with some guidelies for future research. II. METHOD DESCRIPTION A. Server algorithm The machie deoted as server is resposible to gather from cliet machies the correspodig best discovered values. The algorithm executed o server is outlied below. Iitalizatio Step 1. Setg m = 2. Set N, the umber of cliets Check Step 1. If all cliets have fiished the a. Reportg m as the global miimum b. Termiate 2. Edif Loop Step 1. For i=1...n Do a. Obtai the miimum g i from the cliet i b. If g i < g m the g m = g i 2. EdFor 3. GotoCheck Step 78
2 B. Cliet algorithm O each cliet a geetic algorithm with the termiatio rule described i [12] accompaied with a additioal local search operator is applied. The steps of the algorithm are give below: 1. Iitializatio Step a. Set iter=0, where iter is the curret umber of geeratios b. SetN c the umber of chromosomes c. Iitialize chromosomes X i, i = 1,, N c d. Set IMAX as the maximum umber of allowed geeratios e. Set p s as the selectio rate ad p m as the mutatio rate. Both rates are i rage [0,1]. f. Set f l = as the best discovered fitess. g. Set L I the umber of geeratios that should pass before the local search procedure is applied. h. Set L C the umber of chromosomes that will participate i local search procedure. 2. Termiatio Check. At every geeratio the variace σ (iter ) of f l is calculated. If there was o improvemet of the geetic algorithm for a umber of geeratios, the the algorithm should termiate. The stoppig rule has as follows: σ iter σ last 2 OR iter > IMAX (3) Where last deotes the geeratio umber where f l was produced iitially. If the above equatio is true thegoto Step Fitess calculatio. Calculate the fitess f i of every chromosome of the populatio. 4. Geetic operators. a. Selectio procedure. The chromosomes are sorted i descedig order accordig to their fitess value. The first 1 p s N c chromosomes are trasferred to the ext geeratio. The rest of the chromosomes are substituted by offsprigs created through crossover procedure: For every offsprig two chromosomes (parets) are selected from the old populatio usig touramet selectio. The procedure of touramet selectio has as follows:a set of N>1 radomly selected chromosomes is produced ad the chromosome with the best fitess value i this set is selected ad the others are discarded. Havig selected the parets, the offsprigs x ad y are produced accordig to the equatios x i = a i x i + 1 a i x i ad y i = a i y i + 1 a i y i where a i are radom umber i the rage [-0.5,1.5] as suggested i [13]. b. Mutatio procedure. Mutatethe offsprigs produced durig crossover with probabilityp m. Suppose that the elemet i of a give chromosome x is deoted as x i. The ew elemet x i is calculated with a equatio borrowed from the popular PSO optimizatio method [14]: x i = c 1 r 1 x i b x i + c 2 r 2 x i l x i All Rights Reserved 2017 IJARCSEE where c 1 ad c 2 are two positive costats (acceleratio coefficiets), r 1 ad r 2 are radom umbers i the rage [0,1], the vector x b is a copy of the best so far positio of chromosome x ad x l is the best discovered chromosome so far. c. Replacethe p s N c worst chromosomes i the populatio with the offsprigs created by the geetic operators. 5. Set iter=iter+1 6. Local Search Step a. If iters mod L I =0 the i. Select radomly L C chromosomes from the geetic populatio ad create the set L S from these chromosomes. ii. For every chromosome X i L S 1. Select radomly aother chromosome Y from the populatio 2. Create a offsprig of X i ad Y. Deote this chromosome as Z 3. Obtai the fitess f(z) of the chromosome Z 4. If f z < f x i the X i = Z iii. EdFor b. Edif 7. Obtaithe best value i the populatio, deoted asf l for the correspodig chromosome x l. 8. Sed x l, f l to the server machie. 9. Goto step Sed x l, f l to the server machie. 11. Termiate. III. SOFTWARE DOCUMENTATION I this sectio a detailed descriptio of the mai parts of the software is provided. More detailed iformatio about the software that icludes some screeshots ca be foud i the URL Also a last copy of the software is provided i A. User provided fuctios The user should code the objective fuctio i C++. The C++ files should have the followig commad before ay fuctio i the file exter C ad the lie after them. The user should supply the followig fuctios: 1. getdimesio().it is a iteger fuctio which returs the dimesio of the objective fuctio. 2. getleftmargi(left).it is a iteger fuctio which returs the dimesio of the objective fuctio. 79
3 3. getrightmargi(right).it is a iteger fuctio which returs the dimesio of the objective fuctio. 4. fumi(x). It is a iteger fuctio which returs the dimesio of the objective fuctio. As a example cosider the Rastrigi fuctio: f x 1, x 2 = x x 2 2 cos 18x 1 cos 18x 2 The code for this objective fuctio is show i Fig. 1 Also the user may optioally provide the followig fuctios: 1. void iit(qjsoobject params). This fuctio iitializes the objective problem ad it is ot madatory. I params parameter user stores some useful parameters for the problem. The user should use the iclude directive #iclude <QJsoObject> at the begiig of the file. As a example cosider the iitializatio fuctio for the problem of eergy potetial show i Fig. 2, where some critical parameters of the objective fuctio are iitialized through the iit() fuctio. 2. double doe(double *x). This fuctio should be called at the ed of optimizatio. The double parameter x is the vector of global miimum discovered by the optimizatio process. The fuctio should retur the fial value of the objective fuctio. It is useful whe a local optimizatio algorithm is required at the ed of the optimizatio of i the eural etwork case, where the eural etwork should be applied to the test set. The objective problem is writte i ANSI C++ ad it should build as a shared library. The use ca use ay programmig tool to achieve that, but the best choice is to use Qt build eviromet for that. The project file is used i Qt programmig eviromet to build the associated project. I our case is used to build the optimizatio fuctio. A example for buildig the potetial optimizatio fuctio is illustrated i Fig 3. B. The program OePCServer Istallatio The user should issue the followig commads to build the program OePC Cliet (uder some Uix machie): 1. Dowload the code (OePcCliet.tar.gz) 2. guzip OePcCliet.tar.gz 3. tar xfv OePcCliet.tar 4. cd OePcCliet 5. qmake. 6. make User Iterface The graphical iterface of the program is writte etirely i Qt ad it cotais for mai tabs: 1. Ifo tab. The tab cotais iformatio about the machie ruig the server. The most importat iformatio from this tab is the IP of the server ad the port where it is ruig. This iformatio should be used by the cliets that wat to coect to geetic server. Also, the user ca load OeScript programs usig the butto LOAD SCRIPT. 2. Cliets tab. This is the tab where the user ca start the parallel geetic algorithm by pressig the butto Ru Experimet. This butto seds o every cliet the objective fuctio. The fuctio will be set i the correspodig format of every cliet depedig of the ruig operatig system. Afterwards each cliet starts the geetic algorithm. The Cliets tab displays also the followig iformatio for every cliet: a. Name of the cliet b. Operatig system of the cliet c. Status of the cliet (ruig, waitig, termiated, paused) d. Discovered global miimum from the cliet 3. Problems tab. The iformatio about the stored objective problems is outlied i this tab. This iformatio is stored i a sqlite3 database amed gaserver.db3 i the same folder with the ruig server. The user ca load compiled objective problems i shared library format from the hard disk ad he ca also chage or add parameters to the objective problem through the relevat dialog. 4. Messages tab. This tab displays debug iformatio for every cliet as well as about the status of the ruig server. C. The program OePCCliet Istallatio The user should issue the followig commads to build the program OePC Cliet (uder some Uix machie): 1. Dowload the code (OePcCliet.tar.gz) 2. guzip OePcCliet.tar.gz 3. tar xfv OePcCliet.tar 4. cd OePcCliet 5. qmake. 6. make User iterface The graphical applicatio is writte etirely i Qt i order to be portable. Nevertheless, the user ca start the cliet i commad lie mode by startig the executable with the commad lie gui=o. The graphical applicatio is orgaized i three tabs: 1. Coectio tab. I this tab the user should supply the ip of the server i the Host textfield as well as the ruig port. Without this iformatio the cliet caot coect to the server. Also, the user ca provide a ame for the cliet i order to distict them from other ruig cliets. 2. Ru tab. Uder Ru tab the user ca modify some of the most critical parameters of the geetic algorithm such as chromosomes, geeratios etc. Also, the user ca moitor the progress of the geetic algorithm durig the executio of the algorithm. 3. Messages tab. Some debug iformatio is displayed i this tab. Commad lie optios The user ca use commad lie argumets for the applicatio. 1. geeratios=g. The iteger value g specifies the maximum umber of geeratios allowed for the geetic algorithm. The default value is chromosomes=c. The iteger value c specifies the amout of chromosomes used i the geetic 80
4 populatio. The default value for this parameter is selectiorate=s. The double parameter s determies the selectio rate for the geetic algorithm. The default value is 0.90 (90%), which meas that 90% of the populatio will be copied itact to the ext geeratio. 4. mutatiorate=m. The double parameter m determies the mutatio rate used i geetic algorithm. The default value is 0.05 (5%). 5. serverip=s. The strig parameter s specifies the ip server of the OePC server. 6. serverport=p. The iteger parameter p specifies the port of the OePC server. 7. gui=b. The boolea value b ca specifies if gui will be used for the cliet. If b is yes or true the gui will be used otherwise it will ot. 8. seed=s. The iteger parameter s specifies the seed for the radom geerator. 9. machieame=ame. The strig parameter ame specifies the ame of the cliet that will be displayed uder tab Cliets i OePC server. 10. parallelchromosomes=c. The iteger parameter c specifies the umber of chromosomes that will be exchaged betwee this cliet ad the other cliets i the parallel populatio. The default value for this parameter is localsearchchromosomes=c. The iteger parameter c specifies the amout of chromosomes that will take part ito local search step of the geetic algorithm. The default value for this # iclude <math.h> exter "C" itgetdimesio() retur 2; void getleftmargi(double *x) x[0]=-1; x[1]=-1; void getrightmargi(double *x) x[0]=1; x[1]=1; double fumi(double *x) retur x[0]*x[0]+x[1]*x[1]-cos(18.0*x[0]) -cos(18.0*x[1]); Figure 1. The Rastrigi fuctio. All Rights Reserved 2017 IJARCSEE parameter is localsearchgeeratios=g. The iteger parameter g specifies the amout of geeratios that will be executed before the local search step of the geetic algorithm. The default value for this parameter is 50. D. The laguage OeScript The laguage OeScript ca be used to simplify the executio of a series of problems i OePC without the iterferece of the programmer. The commads ca be writte usig capital or lowercase letters. For the time beig the laguage has a simple set of commads which are: 1. SET PROBLEM ame. Sets the curret problem to ame. 2. SET PARAMETER paramname paramvalue. Chage the value of the parameter paramname to paramvalue. 3. RUN. Executes the curret problem usig the attached cliets. 4. PRINT FILE. Prit the curret global miimum to file FILE. As a example of a script i OeScript cosider the program listed i Fig. 4 used to set the objective problem to SINU. double potetialepsilo=1.0; double potetialsigma=1.0; itatoms=10; ittolmiiters=2001; QStrigoutputfile="potetial.txt"; double *xx=null; double *yy=null; double *zz=null; void iit(qjsoobjectobj) if(obj.cotais("atoms")) atoms= obj["atoms"].tostrig().toit(); if(obj.cotais("tolmiiters")) tolmiiters= obj["tolmiiters"].tostrig().toit(); if(obj.cotais("outputfile")) outputfile= obj["outputfile"].tostrig(); xx=ew double[atoms]; yy =ew double[atoms]; zz =ew double[atoms]; Figure 2. Iitializatio fuctio of Potetial problem. 81
5 QT -= gui TARGET = potetial TEMPLATE = lib DEFINES += POTENTIAL_LIBRARY SOURCES += potetial.cpp tolmi.cc HEADERS += potetial.hpotetial_global.h uix SET target.path PROBLEM = /usr/lib siu SET INSTALLS PARAMETER += target dimesio 16 RUN Figure 3. Project file to build the potetial PRINT /home/user/log_siu16.txt objective fuctio. Figure 4. Project file to build the potetial objective fuctio. IV. EXPERIMENTS The method was tested o some test fuctios from the relevat literature as well as o the Leard Joes potetial problem. The results are compared agaist the well-kow software for parallel computatio called GALib-mpi[18]. The experimets were performed 30 times usig differet seed for the radom geerator each time ad averages were take. The umber of chromosomes was set to 200 ad the maximum umber of allowed geeratios was set to A. Experimets o Test Fuctio The followig test fuctios were used i the experimets: 1. Gkls. f(x)=gkls(x,,w) is a fuctio with w local miima described i [19], x 1,1, [2,100]. I the coducted experimets the cases of =2,3,4 with 50 local miima were used. 2. Test2. The fuctio is give by 1 2 i=1 x 4 i 16x 2 i + 5x i with x [ 5,5]. The fuctio has 2 local miima i the specified rage. I the coducted experimets the cases of =5,6,7 was cosidered. 3. Siusoidal. The fuctio f(x) is give by 2.5 i=1 si x i z + i=1 si 5 x i z with 0 x i π ad z = π. The global miimum is The Chemical Equilibrium.The problem is described i [15] ad it is described by the followig set of equatios: x 1 x 2 + x 1 3x 5 = 0 2x 1 x 2 + x 1 + x 2 x R 8 x 2 Rx 5 + 2R 10 x R 7 x 2 x 3 + R 9 x 2 x 4 = 0 2x 2 x R 5 x 2 3 8x 5 + R 6 x 3 + R 7 x 2 x 3 = 0 R 9 x 2 x 4 + 2x Rx 5 = 0 x 1 x R 10 x x 2 x R 8 x 2 + R 5 x x R 6 x 3 + R 7 x 2 x 3 + R 9 x 2 x 4 = 0 where R = 10 R 5 = R 6 = R 7 = R 8 = R 9 = R 10 = The correspodig objective fuctio is the summatio of the absolute values of all equatios i the system i.e. f i (x) i=1 The global miimum is The Kiematic Applicatio. This fuctio is described i [15] for the iverse positio problem for a six revolute joit problem i mechaics. The problem is provided as a system of equatios: x 2 2 i + x i+1 = 0 a 1i x 1 x 3 + a 2i x 1 x 4 + a 3i x 2 x 3 + a 4i x 2 x 4 + a 5i x 2 x 7 + a 6i x 5 x 8 + a 7i x 6 x 7 + a 8i x 6 x 8 + a 9i x 1 + a 10i x 2 + a 11i x 3 + a 12i x 4 + a 13i x 5 + a 14i x 6 + a 15i x 7 + a 16i x 8 + a 17i = 0 Where 1 i 4 ad the table a ij is a = The correspodig objective fuctio is the summatio of the absolute values of all equatios i the system i.e. f i (x) i=1 The global miimum is The Combustio Applicatio. This problem is also described i [15] as a series of equatios: x 2 + 2x 6 + 2x 9 x = 0 x 3 + x = 0 x 1 + x 3 + 2x 5 + 2x 8 + x 9 + x = 0 x 4 + 2x = x 5 x 1 = x 6 2x 2 = x 7 x 4 = x 8 x 1 x 3 = x 9 x 1 x 2 = x 10 x 1 x 2 = 0 82
6 Agai, the correspodig objective fuctio is the summatio of the absolute values of all equatios i the system i.e. f i (x) i=1 The global miimum is 0. The results from the applicatios of OePC ad Galib to the problems above are preseted i TableI for two processors, i TableII for four processors ad i TableIII for eight processors. The cells deote average umber of geeratios ad the figures i paretheses deote the fractio of rus that located the global miimum ad were ot trapped i oe of the local miima. Absece of this fractio deotes 100% success i locatig the global miimum. I all tables the colum FUNCTION deotes the fuctio ame, the colum GAlib deotes the results from the applicatio of GALIB ad the colum ONEPC deotes the results from the applicatio of the proposed software. As we ca deduce from the experimetal results the proposed software seems to require lower umber of geeratios tha GAlib to discover the global miimum. Also the fractio of rus that discovered the global miimum is higher tha GAlib. B. The case of Leard Joes Potetial The molecular coformatio correspodig to the global miimum of the eergy of N atoms iteractig via the Leard-Joes potetial [16] is used as a test case here. The fuctio to be miimized is give by: V LJ r = 4ε σ σ r r The fuctio is miimized firstly with OePC ad afterwards the local search procedure Tolmi (a BFGS variat of Powell [17]) is used to ehace the detected miimum. Success rates of discoverig the global miimum by GAlib are preseted i TableIV ad success rates obtaied by the proposed method are preseted i Table V. Agai i most cases the fractio of rus that discovered the global miimum is higher tha GAlib. 12 V. CONCLUSIONS A portable software for global optimizatio was itroduced with the followig features: 1. It ca be istalled i most operatig systems. 2. There is o eed for parallel libraries such as OpeMPI[20]. 3. The system cotiues to work eve if some of the odes have lost coectio. 4. The cliets ca operate with or without GUI. 5. The user ca cotrol the iitializatio parameters of the objective problems through the iit() procedure. 6. The server ca use a script laguage to cotrol the optimizatio procedure Future research may iclude: 1. Additioal commads for the script laguage of the server. 2. More advaced stoppig rules. 6 Table IExperimetal results usig two processors for a series of optimizatio problems PROBLEM GaLib OePC GKLS GKLS (0.30) (0.77) GKLS (0.93) (0.80) SINU SINU (0.90) SINU (0.17) (0.17) TEST2N TEST2N TEST2N TEST2N (0.93) CHEMICAL (0.93) KINEMATIC COMBUSTION Table IIExperimetal results usig four processors for a series of optimizatio problems PROBLEM GaLib OePC GKLS GKLS (0.33) (0.90) GKLS (0.90) SINU (0.90) SINU (0.90) SINU (0.23) 72.29(0.30) TEST2N TEST2N (0.97) TEST2N (0.90) TEST2N (0.70) CHEMICAL KINEMATIC COMBUSTION Table IIIExperimetal results usig eight processors for a series of optimizatio problems PROBLEM GaLib OePC GKLS GKLS (0.) GKLS (0.83) SINU (0.93) SINU (0.87) SINU (0.23) 55.38(0.67) TEST2N TEST2N (0.97) TEST2N (0.93) TEST2N (0.73) CHEMICAL All Rights Reserved 2017 IJARCSEE 83
7 KIMEMATIC COMBUSTION Table IVSuccess rate results for the Potetial problem with GaLib NATOMS C2 C4 C % 100% 100% 6 27% 37% 50% 7 70% 73% 97% 8 93% 100% 100% 9 63% 87% 93% 10 53% 73% 97% 12 63% 83% 93% Glover (eds.), New ideas i Optimizatio, McGraw-Hill, Cambridge, UK, pp , 1999 [15] C. Grosa ad A. Abraham. A ew approach for solvig oliear equatios systems. IEEE Trasactios o Systems, Ma, ad Cyberetics Part A: Systems ad Humas vol.38, pp , [16] J.E. Leard-Joes, O the Determiatio of Molecular Fields, Proc. R. Soc. Lod. A, vol. 106: pp , [17] M.J.D Powell, A Tolerat Algorithm for Liearly Costraied Optimizatio Calculatios, Mathematical Programmig vol. 45, pp 547, 1989 [18] M. WALL GAlib: A C++ library of geetic algorithm compoets. Mechaical Egieerig Departmet, Massachusetts Istitute of Techology 87: pp.54, [19] M. Gaviao, D.E. Ksasov, D. Lera ad Y.D. Sergeyev, Software for geeratio of classes of test fuctios with kow local ad global miima for global optimizatio, ACM Tras. Math. Softw. Vol. 29, pp , [20] R. L. Graham, T. S. Woodall ad J. M. Squyres, Ope MPI: A Flexible High Performace MPI, Parallel Processig ad Applied Mathematics Volume 3911 of the series Lecture Notes i Computer Sciece, pp , Table VSuccess rate results for the Potetial problem with OePC NATOMS C2 C4 C % 100% 100% 6 100% 100% 100% 7 80% 100% 100% 8 60% 80% 100% 9 70% 100% 100% 10 % 80% 90% % 100% 100% REFERENCES [1] P. O. Yapo, H. V. Gupta ad S. Sorooshia, Multi-objective global optimizatio for hydrologic models, Joural of Hydrologyvol 204, pp , [2] Q. Dua, S. Sorooshia ad V. Gupta, Effective ad efficiet global optimizatio for coceptual raifall-ruoff models, Water Resources Researchvol 28, pp , [3] D. J. Wales ad H. A. Scheraga, Global Optimizatio of Clusters, Crystals, ad Biomolecules, Sciece vol27, pp , [4] P.M. Pardalos, D. Shalloway ad G. Xue, Optimizatio methods for computig global miima of ocovex potetial eergy fuctios, Joural of Global Optimizatio vol. 4, pp , [5] Zwe-Lee Gaig, Particle swarm optimizatio to solvig the ecoomic dispatch cosiderig the geerator costraits, IEEE Trasactios o Power Systems vol. 18, pp , [6] D.E. Goldberg ad J. H. Hollad, Geetic Algorithms ad Machie Learig, Machie Learig vol. 3, pp , [7] J.J. Grefestette, R. Gopal, B. J. Rosmaita ad D. Va Gucht, Geetic Algorithms for the Travelig Salesma Problem, I: Proceedigs of the 1st Iteratioal Coferece o Geetic Algorithms, pp , Lawrece Erlbaum Associates, [8] P. Kaelo ad M.M. Ali, Itegrated crossover rules i real coded geetic algorithms, Europea Joural of Operatioal Research vol. 176, pp , [9] T. Prasad ad N. Park, Multiobjective Geetic Algorithms for Desig of Water Distributio Networks, J. Water Resour. Pla. Maage. vol. 130, pp , [10] A. L. Corcora ad R. L. Waiwright, A parallel islad model geetic algorithm for the multiprocessor schedulig problem, SAC '94 Proceedigs of the 1994 ACM symposium o Applied computig, pp , [11] D. Whitley, S. Raa ad R. B. Heckedor, Islad model geetic algorithms ad liearly separable problems, Evolutioary Computig Volume 1305 of the series Lecture Notes i Computer Sciece, pp , [12] I.G. Tsoulos, Modificatios of real code geetic algorithm for global optimizatio, Applied Mathematics ad Computatio vol. 203, pp , [13] Z. Michaelewicz, Geetic Algorithms + Data Structures = Evolutio Programs. Spriger - Verlag, [14] J. Keedy ad R.C. Eberhart, The particle swarm: social adaptatio i iformatio processig systems, i: D. Core, M. Dorigo ad F. 84
ISSN (Print) Research Article. *Corresponding author Nengfa Hu
Scholars Joural of Egieerig ad Techology (SJET) Sch. J. Eg. Tech., 2016; 4(5):249-253 Scholars Academic ad Scietific Publisher (A Iteratioal Publisher for Academic ad Scietific Resources) www.saspublisher.com
More informationAn Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem
A Improved Shuffled Frog-Leapig Algorithm for Kapsack Problem Zhoufag Li, Ya Zhou, ad Peg Cheg School of Iformatio Sciece ad Egieerig Hea Uiversity of Techology ZhegZhou, Chia lzhf1978@126.com Abstract.
More informationOnes Assignment Method for Solving Traveling Salesman Problem
Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:
More informationAlgorithms for Disk Covering Problems with the Most Points
Algorithms for Disk Coverig Problems with the Most Poits Bi Xiao Departmet of Computig Hog Kog Polytechic Uiversity Hug Hom, Kowloo, Hog Kog csbxiao@comp.polyu.edu.hk Qigfeg Zhuge, Yi He, Zili Shao, Edwi
More informationAN OPTIMIZATION NETWORK FOR MATRIX INVERSION
397 AN OPTIMIZATION NETWORK FOR MATRIX INVERSION Ju-Seog Jag, S~ Youg Lee, ad Sag-Yug Shi Korea Advaced Istitute of Sciece ad Techology, P.O. Box 150, Cheogryag, Seoul, Korea ABSTRACT Iverse matrix calculatio
More information6.854J / J Advanced Algorithms Fall 2008
MIT OpeCourseWare http://ocw.mit.edu 6.854J / 18.415J Advaced Algorithms Fall 2008 For iformatio about citig these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.415/6.854 Advaced Algorithms
More informationPseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance
Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Pseudocode ( 1.1) High-level descriptio of a algorithm More structured
More informationAvid Interplay Bundle
Avid Iterplay Budle Versio 2.5 Cofigurator ReadMe Overview This documet provides a overview of Iterplay Budle v2.5 ad describes how to ru the Iterplay Budle cofiguratio tool. Iterplay Budle v2.5 refers
More informationAdaptive Resource Allocation for Electric Environmental Pollution through the Control Network
Available olie at www.sciecedirect.com Eergy Procedia 6 (202) 60 64 202 Iteratioal Coferece o Future Eergy, Eviromet, ad Materials Adaptive Resource Allocatio for Electric Evirometal Pollutio through the
More informationAn Estimation of Distribution Algorithm for solving the Knapsack problem
Vol.4,No.5, 214 Published olie: May 25, 214 DOI: 1.7321/jscse.v4.5.1 A Estimatio of Distributio Algorithm for solvig the Kapsack problem 1 Ricardo Pérez, 2 S. Jös, 3 Arturo Herádez, 4 Carlos A. Ochoa *1,
More informationPerformance Comparisons of PSO based Clustering
Performace Comparisos of PSO based Clusterig Suresh Chadra Satapathy, 2 Guaidhi Pradha, 3 Sabyasachi Pattai, 4 JVR Murthy, 5 PVGD Prasad Reddy Ail Neeruoda Istitute of Techology ad Scieces, Sagivalas,Vishaapatam
More informationCopyright 2016 Ramez Elmasri and Shamkant B. Navathe
Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 19 Query Optimizatio Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Itroductio Query optimizatio Coducted by a query optimizer i a DBMS Goal:
More informationLecturers: Sanjam Garg and Prasad Raghavendra Feb 21, Midterm 1 Solutions
U.C. Berkeley CS170 : Algorithms Midterm 1 Solutios Lecturers: Sajam Garg ad Prasad Raghavedra Feb 1, 017 Midterm 1 Solutios 1. (4 poits) For the directed graph below, fid all the strogly coected compoets
More informationCSC 220: Computer Organization Unit 11 Basic Computer Organization and Design
College of Computer ad Iformatio Scieces Departmet of Computer Sciece CSC 220: Computer Orgaizatio Uit 11 Basic Computer Orgaizatio ad Desig 1 For the rest of the semester, we ll focus o computer architecture:
More informationChapter 1. Introduction to Computers and C++ Programming. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 1 Itroductio to Computers ad C++ Programmig Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 1.1 Computer Systems 1.2 Programmig ad Problem Solvig 1.3 Itroductio to C++ 1.4 Testig
More informationLecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming
Lecture Notes 6 Itroductio to algorithm aalysis CSS 501 Data Structures ad Object-Orieted Programmig Readig for this lecture: Carrao, Chapter 10 To be covered i this lecture: Itroductio to algorithm aalysis
More informationA Study on the Performance of Cholesky-Factorization using MPI
A Study o the Performace of Cholesky-Factorizatio usig MPI Ha S. Kim Scott B. Bade Departmet of Computer Sciece ad Egieerig Uiversity of Califoria Sa Diego {hskim, bade}@cs.ucsd.edu Abstract Cholesky-factorizatio
More informationBaan Tools User Management
Baa Tools User Maagemet Module Procedure UP008A US Documetiformatio Documet Documet code : UP008A US Documet group : User Documetatio Documet title : User Maagemet Applicatio/Package : Baa Tools Editio
More informationOne advantage that SONAR has over any other music-sequencing product I ve worked
*gajedra* D:/Thomso_Learig_Projects/Garrigus_163132/z_productio/z_3B2_3D_files/Garrigus_163132_ch17.3d, 14/11/08/16:26:39, 16:26, page: 647 17 CAL 101 Oe advatage that SONAR has over ay other music-sequecig
More informationAnalysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis
Itro to Algorithm Aalysis Aalysis Metrics Slides. Table of Cotets. Aalysis Metrics 3. Exact Aalysis Rules 4. Simple Summatio 5. Summatio Formulas 6. Order of Magitude 7. Big-O otatio 8. Big-O Theorems
More informationECE4050 Data Structures and Algorithms. Lecture 6: Searching
ECE4050 Data Structures ad Algorithms Lecture 6: Searchig 1 Search Give: Distict keys k 1, k 2,, k ad collectio L of records of the form (k 1, I 1 ), (k 2, I 2 ),, (k, I ) where I j is the iformatio associated
More informationEFFECT OF QUERY FORMATION ON WEB SEARCH ENGINE RESULTS
Iteratioal Joural o Natural Laguage Computig (IJNLC) Vol. 2, No., February 203 EFFECT OF QUERY FORMATION ON WEB SEARCH ENGINE RESULTS Raj Kishor Bisht ad Ila Pat Bisht 2 Departmet of Computer Sciece &
More informationAPPLICATION NOTE PACE1750AE BUILT-IN FUNCTIONS
APPLICATION NOTE PACE175AE BUILT-IN UNCTIONS About This Note This applicatio brief is iteded to explai ad demostrate the use of the special fuctios that are built ito the PACE175AE processor. These powerful
More information3D Model Retrieval Method Based on Sample Prediction
20 Iteratioal Coferece o Computer Commuicatio ad Maagemet Proc.of CSIT vol.5 (20) (20) IACSIT Press, Sigapore 3D Model Retrieval Method Based o Sample Predictio Qigche Zhag, Ya Tag* School of Computer
More informationHeuristic Approaches for Solving the Multidimensional Knapsack Problem (MKP)
Heuristic Approaches for Solvig the Multidimesioal Kapsack Problem (MKP) R. PARRA-HERNANDEZ N. DIMOPOULOS Departmet of Electrical ad Computer Eg. Uiversity of Victoria Victoria, B.C. CANADA Abstract: -
More informationCIS 121 Data Structures and Algorithms with Java Spring Stacks, Queues, and Heaps Monday, February 18 / Tuesday, February 19
CIS Data Structures ad Algorithms with Java Sprig 09 Stacks, Queues, ad Heaps Moday, February 8 / Tuesday, February 9 Stacks ad Queues Recall the stack ad queue ADTs (abstract data types from lecture.
More informationBASED ON ITERATIVE ERROR-CORRECTION
A COHPARISO OF CRYPTAALYTIC PRICIPLES BASED O ITERATIVE ERROR-CORRECTIO Miodrag J. MihaljeviC ad Jova Dj. GoliC Istitute of Applied Mathematics ad Electroics. Belgrade School of Electrical Egieerig. Uiversity
More informationData Structures and Algorithms. Analysis of Algorithms
Data Structures ad Algorithms Aalysis of Algorithms Outlie Ruig time Pseudo-code Big-oh otatio Big-theta otatio Big-omega otatio Asymptotic algorithm aalysis Aalysis of Algorithms Iput Algorithm Output
More informationHADOOP: A NEW APPROACH FOR DOCUMENT CLUSTERING
Y.K. Patil* Iteratioal Joural of Advaced Research i ISSN: 2278-6244 IT ad Egieerig Impact Factor: 4.54 HADOOP: A NEW APPROACH FOR DOCUMENT CLUSTERING Prof. V.S. Nadedkar** Abstract: Documet clusterig is
More informationProbabilistic Fuzzy Time Series Method Based on Artificial Neural Network
America Joural of Itelliget Systems 206, 6(2): 42-47 DOI: 0.5923/j.ajis.2060602.02 Probabilistic Fuzzy Time Series Method Based o Artificial Neural Network Erol Egrioglu,*, Ere Bas, Cagdas Haka Aladag
More informationAn Algorithm to Solve Multi-Objective Assignment. Problem Using Interactive Fuzzy. Goal Programming Approach
It. J. Cotemp. Math. Scieces, Vol. 6, 0, o. 34, 65-66 A Algorm to Solve Multi-Objective Assigmet Problem Usig Iteractive Fuzzy Goal Programmig Approach P. K. De ad Bharti Yadav Departmet of Mathematics
More informationTask scenarios Outline. Scenarios in Knowledge Extraction. Proposed Framework for Scenario to Design Diagram Transformation
6-0-0 Kowledge Trasformatio from Task Scearios to View-based Desig Diagrams Nima Dezhkam Kamra Sartipi {dezhka, sartipi}@mcmaster.ca Departmet of Computig ad Software McMaster Uiversity CANADA SEKE 08
More informationBayesian approach to reliability modelling for a probability of failure on demand parameter
Bayesia approach to reliability modellig for a probability of failure o demad parameter BÖRCSÖK J., SCHAEFER S. Departmet of Computer Architecture ad System Programmig Uiversity Kassel, Wilhelmshöher Allee
More informationA Note on Least-norm Solution of Global WireWarping
A Note o Least-orm Solutio of Global WireWarpig Charlie C. L. Wag Departmet of Mechaical ad Automatio Egieerig The Chiese Uiversity of Hog Kog Shati, N.T., Hog Kog E-mail: cwag@mae.cuhk.edu.hk Abstract
More informationSolving Fuzzy Assignment Problem Using Fourier Elimination Method
Global Joural of Pure ad Applied Mathematics. ISSN 0973-768 Volume 3, Number 2 (207), pp. 453-462 Research Idia Publicatios http://www.ripublicatio.com Solvig Fuzzy Assigmet Problem Usig Fourier Elimiatio
More informationChapter 9. Pointers and Dynamic Arrays. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 9 Poiters ad Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 9.1 Poiters 9.2 Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Slide 9-3
More informationConsider the following population data for the state of California. Year Population
Assigmets for Bradie Fall 2016 for Chapter 5 Assigmet sheet for Sectios 5.1, 5.3, 5.5, 5.6, 5.7, 5.8 Read Pages 341-349 Exercises for Sectio 5.1 Lagrage Iterpolatio #1, #4, #7, #13, #14 For #1 use MATLAB
More informationLoad balanced Parallel Prime Number Generator with Sieve of Eratosthenes on Cluster Computers *
Load balaced Parallel Prime umber Geerator with Sieve of Eratosthees o luster omputers * Soowook Hwag*, Kyusik hug**, ad Dogseug Kim* *Departmet of Electrical Egieerig Korea Uiversity Seoul, -, Rep. of
More informationPattern Recognition Systems Lab 1 Least Mean Squares
Patter Recogitio Systems Lab 1 Least Mea Squares 1. Objectives This laboratory work itroduces the OpeCV-based framework used throughout the course. I this assigmet a lie is fitted to a set of poits usig
More informationRunning Time. Analysis of Algorithms. Experimental Studies. Limitations of Experiments
Ruig Time Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects. The
More informationRedundancy Allocation for Series Parallel Systems with Multiple Constraints and Sensitivity Analysis
IOSR Joural of Egieerig Redudacy Allocatio for Series Parallel Systems with Multiple Costraits ad Sesitivity Aalysis S. V. Suresh Babu, D.Maheswar 2, G. Ragaath 3 Y.Viaya Kumar d G.Sakaraiah e (Mechaical
More informationOntology-based Decision Support System with Analytic Hierarchy Process for Tour Package Selection
2017 Asia-Pacific Egieerig ad Techology Coferece (APETC 2017) ISBN: 978-1-60595-443-1 Otology-based Decisio Support System with Aalytic Hierarchy Process for Tour Pacage Selectio Tie-We Sug, Chia-Jug Lee,
More informationRunning Time ( 3.1) Analysis of Algorithms. Experimental Studies. Limitations of Experiments
Ruig Time ( 3.1) Aalysis of Algorithms Iput Algorithm Output A algorithm is a step- by- step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects.
More informationAnalysis of Algorithms
Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Ruig Time Most algorithms trasform iput objects ito output objects. The
More informationVariance as a Stopping Criterion for Genetic Algorithms with Elitist Model
Fudameta Iformaticae 120 (2012) 145 164 145 DOI 10.3233/FI-2012-754 IOS Press Variace as a Stoppig Criterio for Geetic Algorithms with Elitist Model Diabadhu Bhadari, C. A. Murthy, Sakar K. Pal Ceter for
More informationSOFTWARE usually does not work alone. It must have
Proceedigs of the 203 Federated Coferece o Computer Sciece ad Iformatio Systems pp. 343 348 A method for selectig eviromets for software compatibility testig Łukasz Pobereżik AGH Uiversity of Sciece ad
More informationLecture 18. Optimization in n dimensions
Lecture 8 Optimizatio i dimesios Itroductio We ow cosider the problem of miimizig a sigle scalar fuctio of variables, f x, where x=[ x, x,, x ]T. The D case ca be visualized as fidig the lowest poit of
More informationA SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON
A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON Roberto Lopez ad Eugeio Oñate Iteratioal Ceter for Numerical Methods i Egieerig (CIMNE) Edificio C1, Gra Capitá s/, 08034 Barceloa, Spai ABSTRACT I this work
More informationCopyright 2016 Ramez Elmasri and Shamkant B. Navathe
Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 18 Strategies for Query Processig Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Itroductio DBMS techiques to process a query Scaer idetifies
More informationPython Programming: An Introduction to Computer Science
Pytho Programmig: A Itroductio to Computer Sciece Chapter 1 Computers ad Programs 1 Objectives To uderstad the respective roles of hardware ad software i a computig system. To lear what computer scietists
More informationMałgorzata Sterna. Mateusz Cicheński, Mateusz Jarus, Michał Miszkiewicz, Jarosław Szymczak
Małgorzata Stera Mateusz Cicheński, Mateusz Jarus, Michał Miszkiewicz, Jarosław Szymczak Istitute of Computig Sciece Pozań Uiversity of Techology Pozań - Polad Scope of the Talk Problem defiitio MP Formulatio
More informationCS200: Hash Tables. Prichard Ch CS200 - Hash Tables 1
CS200: Hash Tables Prichard Ch. 13.2 CS200 - Hash Tables 1 Table Implemetatios: average cases Search Add Remove Sorted array-based Usorted array-based Balaced Search Trees O(log ) O() O() O() O(1) O()
More informationNew Fuzzy Color Clustering Algorithm Based on hsl Similarity
IFSA-EUSFLAT 009 New Fuzzy Color Clusterig Algorithm Based o hsl Similarity Vasile Ptracu Departmet of Iformatics Techology Tarom Compay Bucharest Romaia Email: patrascu.v@gmail.com Abstract I this paper
More informationSoftware development of components for complex signal analysis on the example of adaptive recursive estimation methods.
Software developmet of compoets for complex sigal aalysis o the example of adaptive recursive estimatio methods. SIMON BOYMANN, RALPH MASCHOTTA, SILKE LEHMANN, DUNJA STEUER Istitute of Biomedical Egieerig
More informationBAAN IVc/BaanERP. Conversion Guide Oracle7 to Oracle8
BAAN IVc/BaaERP A publicatio of: Baa Developmet B.V. P.O.Box 143 3770 AC Bareveld The Netherlads Prited i the Netherlads Baa Developmet B.V. 1999. All rights reserved. The iformatio i this documet is subject
More informationFuzzy Rule Selection by Data Mining Criteria and Genetic Algorithms
Fuzzy Rule Selectio by Data Miig Criteria ad Geetic Algorithms Hisao Ishibuchi Dept. of Idustrial Egieerig Osaka Prefecture Uiversity 1-1 Gakue-cho, Sakai, Osaka 599-8531, JAPAN E-mail: hisaoi@ie.osakafu-u.ac.jp
More informationDescriptive Statistics Summary Lists
Chapter 209 Descriptive Statistics Summary Lists Itroductio This procedure is used to summarize cotiuous data. Large volumes of such data may be easily summarized i statistical lists of meas, couts, stadard
More informationCS 111: Program Design I Lecture 15: Objects, Pandas, Modules. Robert H. Sloan & Richard Warner University of Illinois at Chicago October 13, 2016
CS 111: Program Desig I Lecture 15: Objects, Padas, Modules Robert H. Sloa & Richard Warer Uiversity of Illiois at Chicago October 13, 2016 OBJECTS AND DOT NOTATION Objects (Implicit i Chapter 2, Variables,
More informationAccuracy Improvement in Camera Calibration
Accuracy Improvemet i Camera Calibratio FaJie L Qi Zag ad Reihard Klette CITR, Computer Sciece Departmet The Uiversity of Aucklad Tamaki Campus, Aucklad, New Zealad fli006, qza001@ec.aucklad.ac.z r.klette@aucklad.ac.z
More information. Written in factored form it is easy to see that the roots are 2, 2, i,
CMPS A Itroductio to Programmig Programmig Assigmet 4 I this assigmet you will write a java program that determies the real roots of a polyomial that lie withi a specified rage. Recall that the roots (or
More informationOPTIMAL SEQUENCE OF HOLE-MAKING OPERATIONS USING PARTICLE SWARM OPTIMISATION AND SHUFFLED FROG LEAPING ALGORITHM
Egieerig Review, Vol. 36, Issue, 187-196, 016. 187 OPTIMAL SEQUENCE OF HOLE-MAKING OPERATIONS USING PARTICLE SWARM OPTIMISATION AND SHUFFLED FROG LEAPING ALGORITHM Amol M. Dalavi 1* - Padmakar J. Pawar
More informationGPUMP: a Multiple-Precision Integer Library for GPUs
GPUMP: a Multiple-Precisio Iteger Library for GPUs Kaiyog Zhao ad Xiaowe Chu Departmet of Computer Sciece, Hog Kog Baptist Uiversity Hog Kog, P. R. Chia Email: {kyzhao, chxw}@comp.hkbu.edu.hk Abstract
More informationIntroduction. Nature-Inspired Computing. Terminology. Problem Types. Constraint Satisfaction Problems - CSP. Free Optimization Problem - FOP
Nature-Ispired Computig Hadlig Costraits Dr. Şima Uyar September 2006 Itroductio may practical problems are costraied ot all combiatios of variable values represet valid solutios feasible solutios ifeasible
More informationCS : Programming for Non-Majors, Summer 2007 Programming Project #3: Two Little Calculations Due by 12:00pm (noon) Wednesday June
CS 1313 010: Programmig for No-Majors, Summer 2007 Programmig Project #3: Two Little Calculatios Due by 12:00pm (oo) Wedesday Jue 27 2007 This third assigmet will give you experiece writig programs that
More informationCSE 111 Bio: Program Design I Lecture 17: software development, list methods
CSE 111 Bio: Program Desig I Lecture 17: software developmet, list methods Robert H. Sloa(CS) & Rachel Poretsky(Bio) Uiversity of Illiois, Chicago October 19, 2017 NESTED LOOPS: REVIEW Geerate times table
More informationStructuring Redundancy for Fault Tolerance. CSE 598D: Fault Tolerant Software
Structurig Redudacy for Fault Tolerace CSE 598D: Fault Tolerat Software What do we wat to achieve? Versios Damage Assessmet Versio 1 Error Detectio Iputs Versio 2 Voter Outputs State Restoratio Cotiued
More informationA Parallel DFA Minimization Algorithm
A Parallel DFA Miimizatio Algorithm Ambuj Tewari, Utkarsh Srivastava, ad P. Gupta Departmet of Computer Sciece & Egieerig Idia Istitute of Techology Kapur Kapur 208 016,INDIA pg@iitk.ac.i Abstract. I this
More informationA New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method
A ew Morphological 3D Shape Decompositio: Grayscale Iterframe Iterpolatio Method D.. Vizireau Politehica Uiversity Bucharest, Romaia ae@comm.pub.ro R. M. Udrea Politehica Uiversity Bucharest, Romaia mihea@comm.pub.ro
More informationOperating System Concepts. Operating System Concepts
Chapter 4: Mass-Storage Systems Logical Disk Structure Logical Disk Structure Disk Schedulig Disk Maagemet RAID Structure Disk drives are addressed as large -dimesioal arrays of logical blocks, where the
More informationMemetic Algorithm: Hybridization of Hill Climbing with Selection Operator
Iteratioal Joural of Soft Computig ad Egieerig (IJSCE) ISSN: 2231-2307, Volume-3, Issue-2, May 2013 Memetic Algorithm: Hybridizatio of Hill Climbig with Selectio Operator Rakesh Kumar, Sajay Tyagi, Maju
More informationProject 2.5 Improved Euler Implementation
Project 2.5 Improved Euler Implemetatio Figure 2.5.10 i the text lists TI-85 ad BASIC programs implemetig the improved Euler method to approximate the solutio of the iitial value problem dy dx = x+ y,
More informationElementary Educational Computer
Chapter 5 Elemetary Educatioal Computer. Geeral structure of the Elemetary Educatioal Computer (EEC) The EEC coforms to the 5 uits structure defied by vo Neuma's model (.) All uits are preseted i a simplified
More informationUNIVERSITY OF MORATUWA
UNIVERSITY OF MORATUWA FACULTY OF ENGINEERING DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING B.Sc. Egieerig 2014 Itake Semester 2 Examiatio CS2052 COMPUTER ARCHITECTURE Time allowed: 2 Hours Jauary 2016
More informationA Novel Approach to Solve Multiple Traveling Salesmen Problem by Genetic Algorithm
A Novel Approach to Solve Multiple Travelig Salesme Problem by Geetic Algorithm Adrás Király, Jáos Aboyi Uiversity of Paoia, Departmet of Process Egieerig, P.O. Box 58. Veszprém H-8200, HUNGARY, e-mail:
More informationIMP: Superposer Integrated Morphometrics Package Superposition Tool
IMP: Superposer Itegrated Morphometrics Package Superpositio Tool Programmig by: David Lieber ( 03) Caisius College 200 Mai St. Buffalo, NY 4208 Cocept by: H. David Sheets, Dept. of Physics, Caisius College
More informationChapter 3 Classification of FFT Processor Algorithms
Chapter Classificatio of FFT Processor Algorithms The computatioal complexity of the Discrete Fourier trasform (DFT) is very high. It requires () 2 complex multiplicatios ad () complex additios [5]. As
More informationMorgan Kaufmann Publishers 26 February, COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 5.
Morga Kaufma Publishers 26 February, 208 COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter 5 Virtual Memory Review: The Memory Hierarchy Take advatage of the priciple
More informationCS 111 Green: Program Design I Lecture 27: Speed (cont.); parting thoughts
CS 111 Gree: Program Desig I Lecture 27: Speed (cot.); partig thoughts By Nascarkig - Ow work, CC BY-SA 4.0, https://commos.wikimedia.org/w/idex.php?curid=38671041 Robert H. Sloa (CS) & Rachel Poretsky
More informationLecture 1: Introduction and Strassen s Algorithm
5-750: Graduate Algorithms Jauary 7, 08 Lecture : Itroductio ad Strasse s Algorithm Lecturer: Gary Miller Scribe: Robert Parker Itroductio Machie models I this class, we will primarily use the Radom Access
More information10/23/18. File class in Java. Scanner reminder. Files. Opening a file for reading. Scanner reminder. File Input and Output
File class i Java File Iput ad Output TOPICS File Iput Exceptio Hadlig File Output Programmers refer to iput/output as "I/O". The File class represets files as objects. The class is defied i the java.io
More informationQuorum Based Data Replication in Grid Environment
Quorum Based Data Replicatio i Grid Eviromet Rohaya Latip, Hamidah Ibrahim, Mohamed Othma, Md Nasir Sulaima, ad Azizol Abdullah Faculty of Computer Sciece ad Iformatio Techology, Uiversiti Putra Malaysia
More informationCS 111: Program Design I Lecture 15: Modules, Pandas again. Robert H. Sloan & Richard Warner University of Illinois at Chicago March 8, 2018
CS 111: Program Desig I Lecture 15: Modules, Padas agai Robert H. Sloa & Richard Warer Uiversity of Illiois at Chicago March 8, 2018 PYTHON STANDARD LIBRARY & BEYOND: MODULES Extedig Pytho Every moder
More informationSorting in Linear Time. Data Structures and Algorithms Andrei Bulatov
Sortig i Liear Time Data Structures ad Algorithms Adrei Bulatov Algorithms Sortig i Liear Time 7-2 Compariso Sorts The oly test that all the algorithms we have cosidered so far is compariso The oly iformatio
More informationEvolutionary Hybrid Genetic-Firefly Algorithm for Global Optimization
Iteratioal Joural of Computatioal Egieerig & Maagemet, Vol. 6 Issue, May ISSN (Olie): -789 www..org Evolutioary Hybrid Geetic-Firefly Algorithm for Global Optimizatio 7 Shaik Farook, P. Sagameswara Raju
More informationCSC165H1 Worksheet: Tutorial 8 Algorithm analysis (SOLUTIONS)
CSC165H1, Witer 018 Learig Objectives By the ed of this worksheet, you will: Aalyse the ruig time of fuctios cotaiig ested loops. 1. Nested loop variatios. Each of the followig fuctios takes as iput a
More informationReversible Realization of Quaternary Decoder, Multiplexer, and Demultiplexer Circuits
Egieerig Letters, :, EL Reversible Realizatio of Quaterary Decoder, Multiplexer, ad Demultiplexer Circuits Mozammel H.. Kha, Member, ENG bstract quaterary reversible circuit is more compact tha the correspodig
More informationNew HSL Distance Based Colour Clustering Algorithm
The 4th Midwest Artificial Itelligece ad Cogitive Scieces Coferece (MAICS 03 pp 85-9 New Albay Idiaa USA April 3-4 03 New HSL Distace Based Colour Clusterig Algorithm Vasile Patrascu Departemet of Iformatics
More informationHow do we evaluate algorithms?
F2 Readig referece: chapter 2 + slides Algorithm complexity Big O ad big Ω To calculate ruig time Aalysis of recursive Algorithms Next time: Litterature: slides mostly The first Algorithm desig methods:
More informationDynamic Programming and Curve Fitting Based Road Boundary Detection
Dyamic Programmig ad Curve Fittig Based Road Boudary Detectio SHYAM PRASAD ADHIKARI, HYONGSUK KIM, Divisio of Electroics ad Iformatio Egieerig Chobuk Natioal Uiversity 664-4 Ga Deokji-Dog Jeoju-City Jeobuk
More informationFREQUENCY ESTIMATION OF INTERNET PACKET STREAMS WITH LIMITED SPACE: UPPER AND LOWER BOUNDS
FREQUENCY ESTIMATION OF INTERNET PACKET STREAMS WITH LIMITED SPACE: UPPER AND LOWER BOUNDS Prosejit Bose Evagelos Kraakis Pat Mori Yihui Tag School of Computer Sciece, Carleto Uiversity {jit,kraakis,mori,y
More informationResearch Article Genetic Programming for Automating the Development of Data Management Algorithms in Information Technology Systems
Advaces i Software Egieerig Volume 2012, Article ID 893701, 14 pages doi:10.1155/2012/893701 Research Article Geetic Programmig for Automatig the Developmet of Data Maagemet Algorithms i Iformatio Techology
More informationWeb OS Switch Software
Web OS Switch Software BBI Quick Guide Nortel Networks Part Number: 213164, Revisio A, July 2000 50 Great Oaks Boulevard Sa Jose, Califoria 95119 408-360-5500 Mai 408-360-5501 Fax www.orteletworks.com
More informationAPPLICATION NOTE. Automated Gain Flattening. 1. Experimental Setup. Scope and Overview
APPLICATION NOTE Automated Gai Flatteig Scope ad Overview A flat optical power spectrum is essetial for optical telecommuicatio sigals. This stems from a eed to balace the chael powers across large distaces.
More informationMOTIF XF Extension Owner s Manual
MOTIF XF Extesio Ower s Maual Table of Cotets About MOTIF XF Extesio...2 What Extesio ca do...2 Auto settig of Audio Driver... 2 Auto settigs of Remote Device... 2 Project templates with Iput/ Output Bus
More informationBOOLEAN 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 informationThe University of Adelaide, School of Computer Science 22 November Computer Architecture. A Quantitative Approach, Sixth Edition.
Computer Architecture A Quatitative Approach, Sixth Editio Chapter 2 Memory Hierarchy Desig 1 Itroductio Programmers wat ulimited amouts of memory with low latecy Fast memory techology is more expesive
More informationVISUALSLX AN OPEN USER SHELL FOR HIGH-PERFORMANCE MODELING AND SIMULATION. Thomas Wiedemann
Proceedigs of the 2000 Witer Simulatio Coferece J. A. Joies, R. R. Barto, K. Kag, ad P. A. Fishwick, eds. VISUALSLX AN OPEN USER SHELL FOR HIGH-PERFORMANCE MODELING AND SIMULATION Thomas Wiedema Techical
More informationOptimization of Multiple Input Single Output Fuzzy Membership Functions Using Clonal Selection Algorithm
Optimizatio of Multiple Iput Sigle Output Fuzzy Membership Fuctios Usig Cloal Selectio Algorithm AYŞE MERVE ACILAR, AHMET ARSLAN Computer Egieerig Departmet Selcuk Uiversity Selcuk Uiversity, Eg.-Arch.
More informationBEA WebLogic XML/Non-XML Translator
BEA WebLogic XML/No-XML Traslator A Compoet of BEA WebLogic Itegratio Plug-I Guide BEA WebLogic XML/No-XML Traslator Release 2.0 Documet Editio 2.0 July 2001 Copyright Copyright 2001 BEA Systems, Ic. All
More informationCourse Site: Copyright 2012, Elsevier Inc. All rights reserved.
Course Site: http://cc.sjtu.edu.c/g2s/site/aca.html 1 Computer Architecture A Quatitative Approach, Fifth Editio Chapter 2 Memory Hierarchy Desig 2 Outlie Memory Hierarchy Cache Desig Basic Cache Optimizatios
More information