Phenotype Building Blocks and Geometric Crossover in Structural Optimisation

Size: px
Start display at page:

Download "Phenotype Building Blocks and Geometric Crossover in Structural Optimisation"

Transcription

1 Paper 5 Cvl-Comp Press, 22 Proceedngs of the Eghth Internatonal Conference on Engneerng Computatonal Technology, B.H.V. Toppng, (Edtor), Cvl-Comp Press, Strlngshre, Scotland Phenotype Buldng Blocks and Geometrc Crossover n Structural Optmsaton A. Maher, T. Macquart, D. Safar 2 and M.. Maher 2 School of Computng, Engneerng and Informaton Scences Northumbra Unversty, Newcastle upon Tyne, Unted Kngdom 2 Department of Cvl Engneerng, Shraz Unversty, Iran Abstract Macro or phenotype buldng blocks (PBBs) contan nformaton at phenotype level. PBBs are ether the components of a mult-component system, or dfferent parts of a contnuous system wth dfferent desgn qualtes and/or evaluaton measures. Usng PBBs can lead to enhancement of the search effcency by utlsng problem specfc search operators and heurstcs appled on the PBBs. In order to preserve, propagate and recombne good buldng blocks effcently, buldng blocks should have a low probablty of beng dsrupted by crossover. Therefore, the crossover operaton should be desgned at phenotype level. Geometrc crossover (GCO) s appled on the phenotype rather than the genotype. Identfyng PBBs and usng GCO, partal ftness can be defned and employed to mprove the performance of the search algorthm. Another advantage of usng GCO s as a result of ts ease of applcaton to nonfxed-length and varable-length chromosomes. Varable-length chromosomes are a common feature of topology optmsaton problems when genetc algorthms are employed. GCO can be easly appled to the structural optmsaton problems ncludng, topology optmsaton wthout predefnng a grd. These two advantages have been demonstrated by mplementng GCO n genetc algorthms employed for optmsaton of plane trusses supportng dstrbuted loads, two-dmensonal steel frames and wnd turbne blades. Keywords: geometrc crossover, phenotype buldng block, partal ftness, topology optmsaton, genetc algorthm, structural optmsaton. Introducton The standard explanaton of how genetc algorthms (GAs) operate, s often referred as the buldng block hypothess []. Accordng to ths hypothess, GAs operate by combnng small buldng blocks nto larger buldng blocks. The ntutve dea behnd recombnaton s that combnng features (or buldng blocks) from two good parents wll often produce better chldren.

2 It s well recognsed that the effcency of a genetc algorthm n exploraton and explotaton of the soluton space can be mproved by ncorporatng doman-specfc knowledge nto the algorthm. In many real-world applcatons, the physcs of the problem suggests heurstcs that can be ncorporated nto the search and selecton procedures. Whenever GAs are appled to such problems, knowledge about the doman of applcaton should be consdered n the desgn of the reproducton operators as well as the representaton and selecton. Doman knowledge has been broadly ncorporated n selecton and reproducton operators. Heurstcs or knowledge-augmented operators are talored for ndvdual applcatons. The prme consderaton n defnng these operators s how to mplement heurstcs n a reproducton operator wthout jeopardsng the exploratory nature of the search. 2 Phenotype buldng blocks, partal ftness and geometrc crossover In ths paper, a phenotype buldng block refers to a part of soluton that contans nterpretable nformaton; hence t can be assessed by ts own mert based on a set of measurable assessment crtera. Assessment crtera of a PBB can be a subset of the assessment crtera of the ndvdual tself, or alternatvely, there s at least a known qualtatve relatonshp between the PBB assessment crtera and the ndvdual assessment crtera. A PBB can be a combnaton of components of a mult-component or dscrete system or dfferent parts of a contnuous system. A partal ftness s assgned to each PBB. Partal ftness can be defned usng a nonconflctng subset of the assessment crtera of the PBB. In the context of engneerng desgn problems: f j ( x, y) =, ( j =,, q ), n whch y = { y, y2,..., yq} s the set of desgn qualtes and x = { x, x,..., x p} s the set of desgn varables, the set of assessment crtera refers to the set of desgn qualtes. Desgn qualtes can be treated as objectves or constrants of the correspondng optmsaton problem. In order to preserve, propagate and recombne good buldng blocks effcently, buldng blocks should have a low probablty of beng dsrupted by crossover. Therefore, ether the length of the mportant buldng blocks must be short, or alternatvely the crossover operator must be talored for the problem at hand wsely reducng the probablty of breakng down good buldng blocks. In fact, the former s the Holland s orgnal assumpton that the mportant buldng blocks are of short length, whch s true f segment-based crossover operators such as one- or twopont crossover for btwse bnary strngs s used. Usng unform crossover, on the other hand, makes t dffcult to propagate good buldng blocks once they are found. Usng PBBs to ncorporate doman-knowledge, the crossover operaton should be desgned n such a way that dsrupton of good buldng blocks s avoded once they are found. PBBs are not of short length n genotype space. Therefore, the tradtonal crossover operatons that operate on the genotype are not sutable for combnng the PBBs. Geometrc crossover, on the other hand, s appled on the phenotype (real desgn space) rather than the genotype to avod dsrupton of good buldng blocks. 2

3 Generally, a crossover operator, dependng on the type of the chromosome encodng and the mechansm of the crossover, may lead to one or a combnaton of the followngs: Arthmetc recombnaton of parents, n whch chldren are n an Eucldean dstance of the parents Attrbute swap between parents, n whch the chldren have common attrbutes wth ther parents. A desgn attrbute may be dentfed by one or more desgn varables. Attrbute recombnaton of parents, n whch chldren may have common attrbutes wth ther parents or new attrbutes resulted by mxng the parents attrbutes. Geometrc recombnaton, n whch chldren have common PBBs wth ther parents. Dependng on the type of the buldng blocks, a GCO may lead to arthmetc recombnaton (e.g. new span n the wnd turbne blade example of Secton 4), attrbute swap (e.g. constructng a chld by the axes of one parent and bays of another n the plane frame example of Secton 3), and attrbute recombnaton (e.g. weght of chld n the truss example of Secton 5). The applcaton of GCO s not lmted to the structural optmsaton. Cut and splce s a type of crossover whch s appled on the real desgn space. Ths type of crossover has been employed for pattern recognton and structural optmsaton of atomc clusters problems. Cross et al [2] and later Myers and Hancock [3] appled a smlar concept for pattern recognton problems. They combned the solutons by physcally dvdng the graphs nto two dsjont subgraphs. Ther results show that ther crossover operaton mproves the search convergence speed. More recently, Nazm and Erkoc [4] and Froltsov and euter [5] appled smlar concept n structural optmsaton of atomc clusters. In ther genetc algorthm a new structure s generated by cuttng exstng cluster geometres nto two halves and then recombnng the halves of dfferent confguratons. It should be noted that n none of these works the concept of partal ftness has been used n the process of parent selecton. 3 Applcaton to planner frames Fgure, shows a typcal m n two-dmensonal structural frame made of n c = ( m +) n standard columns and n b = mn standard beams. Each column and beam can be dentfed by an ndex, referrng to ts standard code. Usng an ndexed codng, the chromosome of ths frame can be defned by a strng of length n c + nb. For ths chromosome representaton, beams and columns are genotypes. However, one can defne phenotypes buldng blocks as axs (four columns), bay (four beams) and storey (four columns and three beams). Each of these three PBBs can be assessed based on a subset of the frame assessment crtera (e.g. weght, lateral storey drft, beam deflectons, beam and column maxmum stresses, column crtcal buckng load, etc). Each frame can be made of storeys or combnaton of axes and bays. 3

4 Fgure : A typcal m n plane frame and ts PBBs. Fgure 2: Geometry crossover of the two-dmensonal frame problem usng PBBs: (a) homologous and (b) non-homologous. Fgure 2 shows the PBB exchange n a GCO of the frame of Fgure. Snce there s more than one type of each PBBs, both homologous and non-homologous crossover can be appled to two parent frames. In order to nvestgate the effect of mplementng PBB, partal ftness and GCO n the desgn of frames, one of the desgn case studes of reference [6] s adopted n whch the optmum allowable stress desgn of steel frames subjected to varous loadngs and load combnatons under constrants of AISC ASD specfcaton s 4

5 desred. Desgn varables are the element secton szes from the avalable W shapes of a standard lst. For a steel frame consstng of N members that are collected n N d desgn groups (number of desgn varables), the objectve s to fnd a vector of nteger values I (Eq. ()), representng the sequence numbers of steel sectons assgned to N member groups: d m T I = I, I,..., I ] () [ 2 Nd for mnmzng the weght of the frame, expressed as: W N = d Nt A = j= γ L, (2) j subject to a seres of constrants, as formulated and detaled n [6], on combnaton of axal and flexural stress, column Euler stress, column slenderness rato, shear stress, ductlty, beam deflecton servceablty, storey drft servceablty and constructablty. In Equaton 2, A and γ, respectvely, represent the area and the unt weght of N t stands for the total number of L s the length of the member j whch belongs to group. the steel secton adopted for the member group, members n group and j Fgure 3: Search hstory usng (a) btwse crossover converged at generaton number 2 to.583 and (b) geometrc crossover converged at generaton number 9 to.568 In order to nvestgate the performance of employng GCO, PBB and partal ftness n optmsaton of frames, startng wth the same ntal populaton, two types of crossover s used: () GCO wth partal ftness PF = weght for all types of PBBs, and () conventonal btwse crossover. Fgure 3 shows the search hstores for the two runs. Evdently, when usng GCO, the search converges faster (generaton number 9 versus 4) to a better soluton (penalsed objectve functon of.568 versus.583). 5

6 4 Applcaton to wnd turbne blades Aerodynamc desgn of wnd turbne blades ncludes optmsaton of the topology of the blade. Parameters such as rotor radus and the span-wse dstrbutons of the chord length, pretwst and aerofols defne the topology of the blade and are treated as desgn varables. A wde range of parameters construct the set of desgn qualtes (objectves/constrants). Normally, the average annual power yeld or the power coeffcent at the desgn wnd speed are treated as optmsaton objectves, whle constrants are appled on the aerodynamc loads, blade nternal forces, blade weght, fatgue lfe, etc. Hub Inner secton Outer secton Tp Structural demand Aerodynamc demand Chord Chord n Pretwst Pretwst n Aerofol Aerofol n Blade span Genotype chromosome Inner secton Outer secton Phenotype buldng blocks Fgure 4: Wnd turbne blade and ts PBBs Fgure 4 shows a wnd turbne blade. Usng n desgn (precson) ponts for the dstrbuted desgn varables (chord length, pretwst and the aerofol code), the total number of desgn varables wll be3 n +. Employng a mxed real-number/ndexed encodng, each ndvdual can be defned by a chromosome of length3 n +. The assessment crtera for the blade can be defned as the weght of the blade, maxmum flap stress and the average power producton correspondng to a gven wnd probablty densty functon. Blade s a contnuous structure, but ts nner and outer sectons have dfferent functons and can be defned as two PBBs. The outer secton of the blade s aerodynamcally more effcent. That s, the power s mostly produced by the outer secton of the blade. Whlst the nner secton experences greatest nternal forces and the desgn s drven based on the structural demand. Snce the nner and outer sectons have dfferent functons they can be assessed separately. The nner secton can be assessed based on, for example, the maxmum flap stress or the weght of the blade, whle the outer secton can be assessed based on the produced average power. In contrast to the frame example, there s no sharp boundary between the wnd turbne blade PBBs. 6

7 The genotype chromosome s a strng of real numbers as well as ndexes, as shown n Fgure 5.a. The desgn varables can be ether dstrbuted (chord, pretwst, aerofol thckness and aerofol code) or sngle value (blade span). The desgn varables can also be categorsed as ether contnuous (blade span, chord, pretwst and aerofol thckness) or dscrete (aerofol code). Fgure 5.b demonstrates the GCO, assumng that parents P and P 2, respectvely, have better performance n terms of desgn qualtes correspondng to the nner and outer segments of the blade. The cut pont s a randomly selected real number between and the span of the blade. Snce there s only one of each type of PBBs, only homologous crossover s possble. Dstrbuted desgn varables (n desgn ponts per each dstrbuted desgn varables dstrbuted from hub to tp) Sngle desgn varables (a) Chord Pretwst Aerofol code Span Dscrete desgn varable Contnuous (real number) desgn varable Parents genotype chromosome P: better performance n terms of desgn qualtes correspondng to the nner segment Hub Tp P2: better desgn qualtes correspondng to outer segment (b) Chord (P) Chord (P2) Pretwst (P) Pretwst (P2) Af code (P) Af code (P2) Span new Chld genotype chromosome: Geometrc crossover Fgure 5: Wnd turbne blade (a) Genotype chromosome, (b) GCO Havng the radal coordnate normalsed by span length ( r = r / span ), the cut pont s a randomly selected precson pont r. The cut dvdes each parent blade nto two parts. The dstrbuted desgn varables of the chld blades are formed by those of the left and rght hand sdes of each parent blade. A repar operaton s also requred to retan the contnuty of the dstrbuted desgn varable. Fgure 6 llustrates the process of formng a dstrbuted desgn varable (here the pretwst dstrbuton β ) of a chld from a par of parents. The repared pretwst s c 7

8 obtaned by multplyng the unrepared pretwst by the left and rght multplers M ( r L ) and M ( r ). [ ( r )] [ β ( r )] M ( r ) f r r P L c β = (3) C, [ β ( r )] M ( r ) f r < r P2 c where, subscrpts C, P, P2 and stand for chld, parent, parent 2 and repared, respectvely. M ( r L ) and M ( r ) are the left and rght segments of a multpler curve. The multpler curve for chld s a lnear curve between at r = and [ β, c ] C, [ β, c ] P [ β ], c C, at the cut pont; and [ β, c ] P2 Fgure 6.c. The pretwst at the cut pont at the cut pont r and at r = as shown n c rc s denoted by β, c. The repared pretwst at the cut pont s a combnaton of the left and rght values proportonal to the length of the left and rght segments respectvely. That s, the repar process has less effect on the segment wth longer length. Pre-Twst (deg) (a) Parent Parent cut pont r Pre-Twst (deg) (b) Chld before repar Chld after repar r Multpler (c) r Fgure 6: Pretwst formaton of a chld blade; chld s formed based on the left segment of parent and the rght segment of parent 2. 8

9 Sngle value desgn varables, for example the blade span of chld,, s the combnaton of those of parent blades n a weghtng sense. chld rc parent + ( rc ) parent 2 = (4) Interchangng ndces and 2 n the above equatons, the second chld wll be formed. In order to nvestgate the performance of employng GCO, PBB and partal ftness n optmsaton of wnd turbne blades, blade of AWT27, a 2-bladed stall regulated wnd turbne, s selected to be optmsed for the pretwst and chord dstrbutons. An ntal populaton of sze s generated randomly. Blades of the ntal populaton have the same span and aerofol dstrbuton as the baselne. Usng the same ntal populaton, two types of crossover s used: () GCO wth partal ftnesses PF = Pav for the outer secton and PF2 = weght for the nner secton; and () arthmetc crossover. For GCO the pretwst of the produced chld s obtaned by [ ( r )] [ ϕ( r )] P M ( ) L r f r rc ϕ C =, (5) [ ϕ( r )] P M ( r ) f r < r 2 c n whch, ϕ represents pretwst β and chord c. In the case of arthmetc crossover the pretwst and chord dstrbutons of the chld s gven by: ϕ chld = λϕ (6) parent + λ) ( ϕ parent 2 n whch, agan,ϕ represents pretwst β and chord c and λ s a random number. In performng arthmetc crossover, a roulette wheel constructed based on the ftness ftness = Pav s employed, whle n the case of GCO, two roulette wheels are constructed based on the partal ftnesses defned above. These roulette wheels are employed to select the parents. Startng wth the same ntal populaton, 2 crossover operatons of each type s carred out. esults presented n Fgure 7 show an mprovement of.6% n the average power of the populaton when GCO s used versus an mprovement of 8.6% when arthmetc crossover s used. esults also show that the populaton qualty n terms of the weght mproves slghtly more when usng GCO (2.2% versus.7%). 9

10 Fgure 7: Percent mprovement n the qualtes of the populaton: geometrc versus arthmetc crossover 5 Applcaton to trusses supportng dstrbuted loads Fgure 8 shows a two dmensonal truss, constructed of a strng of trangular panels and subjected to a dstrbuted load q (x). The topology of ths truss, ncludng the number of panels, s to be optmsed wth the objectve of mnmsng the weght of the truss, subject to a constrant on the load converson expedency (LCE), a parameter defned based on the structural propertes of the load doman [7]. Assumng that members are made of the same materal and that ther cross sectonal areas are proportonal to ther nternal forces, mnmsaton of the weght of the truss s equvalent to mnmsng the objectve functon h, defned as subject to the constrant h = m l = ( X ) P ( X ) ; {,2,...,m} (7) LCE LCE c (8) where, LCEc s the smallest permssble LCE, l and P ( P ) represent the length and the nternal force of member respectvely and m s the number of members n the truss. In the case of zero members ( P = ), P wll be replaced wth the smallest nternal force n the truss members. In the above equaton X = { n, x j, y j }, ( j {,2,...,n} ), stands for the vector of desgn varables, parameter n s the total number of nodes, and x j and y j are the coordnates of node j respectvely. More detals on the formulaton of the problem can be found n reference [7]. Usng a mxed nteger-real number encodng, the genotype chromosome of ths truss wll have a varable length of 2n 3, where n s the total number of nodes.

11 y q(x) Dstrbuted Load h /2 ght secton h /2 Left secton x Free node Load-bearng node Support node n x l Truss Doman l h x n-2 y y n-2 Genotype chromosome Left secton ght secton Phenotype buldng blocks Fgure 8: Plane truss and ts PBBs In the frst two examples, the PBBs were ether, confguratonally, easy to dentfy as n the case of the frame or had dfferent functons as n the case of the wnd turbne blade. However, none of these condtons are necessarly requred to be vald for PBBs. Ths truss can be vewed as a dscrete system smlar to the frame example. However, snce t s to be optmsed for the topology, t does not have a fxed topology through optmsaton process. As the PBBs are fxed, the bggest possble PBB s a trangular panel. Obvously, the smaller the PBB, the closer t becomes to the genotype form. Ths s not algned wth the orgnal phlosophy behnd usng PBBs for ncorporatng knowledge nto the search process. An alternatve approach s to treat the truss as a contnuous system smlar to the wnd turbne blade. In ths way each truss can be defned based on two PBBs: ts left and rght sectons. In the wnd turbne blade problem, the phonotype buldng blocks are dentfed based on ther dfferent functons and have dfferent assessment crtera. However, n the truss problem, the functons of the left and rght sectons of the truss are the same; hence, ther assessment crtera wll be the same.

12 n x x n-2 y y n-2 (a) Parent P genotype chromosome; length= 2n 3 m x x m-2 y y m-2 Parent P2 genotype chromosome; length= 2m 3 (b) r=p+q x x r-2 y y r-2 Chld genotype chromosome (p nodes of parent P are located n the left hand sde of the cut pont and q nodes of parent P2 are located n the rght hand sde of the cut pont) Parent Cut pont l x (c) Chld x Parent Parents and chld load-bearng node strngs Fgure 9: Plane truss (a) parents genotype chromosome, (b) chld genotype chromosome after GCO, (c) llustratve example showng the change n the number of panels due to GCO (only the x-coordnate of the load-bearng nodes s shown) l l x The GCO of the truss problem s llustrated n Fgure 9. Fgures 9.a and 9.b show the genotype chromosome of two parents and the offsprng made by a GCO operaton. A geometrc cut dvdes each parent truss nto two parts. Assumng that the left secton of parent P s better than the left secton of parent P 2 and the rght secton of parent 2 s better than the rght secton of parent, the left secton of the frst parent s combned wth the rght secton of the second parent to form a chld truss. A repar operaton also mght be requred at the cut pont to make the chld truss knematcally stable. The locaton of the cut pont and the topology of the parents nfluence the topology of the offsprng. Generally, the length of these three chromosomes can be dfferent. That s, the offsprng can have a dfferent topology from ts parents. The length of the offsprng chromosome s r = p + q, where p and q are the number of nodes on the left secton of the frst parent and the rght secton of the second parent, respectvely. Fgure 9.c shows the x-coordnate of the loadbearng nodes of two parents and ther offsprng. Ths fgure llustrates how two chromosomes wth dfferent lengths are combned and make a new chromosome wth a dfferent length. 2

13 Fgure shows the search hstores of the above optmsaton problem once usng GCO and once applyng conventonal arthmetc crossover. Evdently, employng GCO and partal ftness mproves the search convergence rate. The ftness s defned as the product of the recprocal of the weght of the truss and a penalty functon: The penalty functon p s defned as: ftness = p (9) h LCE LCE p = mn, LCEc LCE () where, LCE s the mnmum possble value for LCE. The partal ftnesses used for the left and rght hand sdes of the truss are defned as the recprocal of the weght of the left and rght hand sdes of the truss respectvely. Fgure : Search hstores n the qualtes of the populaton: geometrc versus arthmetc crossover 6 Concluson By dentfyng PBBs and usng GCO, partal ftness can be defned and employed to mprove the performance of the search algorthm. It s shown that these concepts can be appled to a wde range of structural optmsaton problems wth dfferent characterstcs. These concepts can be appled to both, dscrete and contnuous structures. PBBs may or may not have sharp boundares. PBB can be defned as a combnaton of genotype buldng blocks of a dscrete system or t can be dentfed based on dfferent functons of dfferent segments of a contnuous system. Partal ftness can be defned based on ether the ndvdual assessment crtera or some new assessment crtera. There s no restrcton on the type of the desgn varables 3

14 nvolved n the problem (ndexed, real value, nteger, dstrbuted, sngle value, contnuous and dscrete). Another advantage of usng GCO s due to ts ease of applcaton to non-fxed-length and varable-length chromosomes. Varable-length chromosomes are a common feature of topology optmsaton problems when usng genetc algorthms. Hence, GCO can be easly appled to structural optmsaton problems ncludng topology optmsaton wthout predefnng a grd. eferences [] Handbook of Evolutonary Computaton Edted by Thomas Baeck, D.B Fogel, Z Mchalewcz, Taylor & Francs, 2 [2] A.D.J. Cross,.C. Wlson and E.. Hancock, Inexact Graph Matchng Usng Genetc Search, Pattern ecognton, 3(6), , 997. [3]. Myers, E.. Hancock, Least-commtment graph matchng wth genetc algorthms, Pattern ecognton, 34, , 2. [4] N. Nazm Dugan, S. Erkoc, Genetc algorthm Monte Carlo hybrd geometry optmzaton method for atomc clusters, Computatonal Materals Scence, 45, 27 32, 29. [5] V.A. Froltsov, K. euter, obustness of cut and splce genetc algorthms n the structural optmzaton of atomc clusters, Chemcal Physcs Letters, 473, , 29. [6] D. Safar, M.. Maher and A. Maher, Optmum Desgn of Steel Frames Usng a Multple-Deme GA wth Improved eproducton Operators, Constructonal Steel esearch, 67 (8), , 2. [7] A. Maher and M.. Maher, A robust Method for Integrated Desgn of Trusses Supportng Dstrbuted Loads, Engneerng Structures, 4, , 22. 4

Meta-heuristics for Multidimensional Knapsack Problems

Meta-heuristics for Multidimensional Knapsack Problems 2012 4th Internatonal Conference on Computer Research and Development IPCSIT vol.39 (2012) (2012) IACSIT Press, Sngapore Meta-heurstcs for Multdmensonal Knapsack Problems Zhbao Man + Computer Scence Department,

More information

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation 17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 An Iteratve Soluton Approach to Process Plant Layout usng Mxed

More information

An Optimal Algorithm for Prufer Codes *

An Optimal Algorithm for Prufer Codes * J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,

More information

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Parallelism for Nested Loops with Non-uniform and Flow Dependences Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr

More information

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique //00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy

More information

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009. Farrukh Jabeen Algorthms 51 Assgnment #2 Due Date: June 15, 29. Assgnment # 2 Chapter 3 Dscrete Fourer Transforms Implement the FFT for the DFT. Descrbed n sectons 3.1 and 3.2. Delverables: 1. Concse descrpton

More information

Smoothing Spline ANOVA for variable screening

Smoothing Spline ANOVA for variable screening Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory

More information

Design of Structure Optimization with APDL

Design of Structure Optimization with APDL Desgn of Structure Optmzaton wth APDL Yanyun School of Cvl Engneerng and Archtecture, East Chna Jaotong Unversty Nanchang 330013 Chna Abstract In ths paper, the desgn process of structure optmzaton wth

More information

A New Approach For the Ranking of Fuzzy Sets With Different Heights

A New Approach For the Ranking of Fuzzy Sets With Different Heights New pproach For the ankng of Fuzzy Sets Wth Dfferent Heghts Pushpnder Sngh School of Mathematcs Computer pplcatons Thapar Unversty, Patala-7 00 Inda pushpndersnl@gmalcom STCT ankng of fuzzy sets plays

More information

Hermite Splines in Lie Groups as Products of Geodesics

Hermite Splines in Lie Groups as Products of Geodesics Hermte Splnes n Le Groups as Products of Geodescs Ethan Eade Updated May 28, 2017 1 Introducton 1.1 Goal Ths document defnes a curve n the Le group G parametrzed by tme and by structural parameters n the

More information

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty

More information

NGPM -- A NSGA-II Program in Matlab

NGPM -- A NSGA-II Program in Matlab Verson 1.4 LIN Song Aerospace Structural Dynamcs Research Laboratory College of Astronautcs, Northwestern Polytechncal Unversty, Chna Emal: lsssswc@163.com 2011-07-26 Contents Contents... 1. Introducton...

More information

A New Token Allocation Algorithm for TCP Traffic in Diffserv Network

A New Token Allocation Algorithm for TCP Traffic in Diffserv Network A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network S. Sudha and N. Ammasagounden Natonal Insttute of Technology, Truchrappall,

More information

Support Vector Machines

Support Vector Machines /9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.

More information

Performance Evaluation of Information Retrieval Systems

Performance Evaluation of Information Retrieval Systems Why System Evaluaton? Performance Evaluaton of Informaton Retreval Systems Many sldes n ths secton are adapted from Prof. Joydeep Ghosh (UT ECE) who n turn adapted them from Prof. Dk Lee (Unv. of Scence

More information

Machine Learning: Algorithms and Applications

Machine Learning: Algorithms and Applications 14/05/1 Machne Learnng: Algorthms and Applcatons Florano Zn Free Unversty of Bozen-Bolzano Faculty of Computer Scence Academc Year 011-01 Lecture 10: 14 May 01 Unsupervsed Learnng cont Sldes courtesy of

More information

Tsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance

Tsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance Tsnghua Unversty at TAC 2009: Summarzng Mult-documents by Informaton Dstance Chong Long, Mnle Huang, Xaoyan Zhu State Key Laboratory of Intellgent Technology and Systems, Tsnghua Natonal Laboratory for

More information

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields 17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and

More information

OPTIMIZATION OF SKELETAL STRUCTURES USING IMPROVED GENETIC ALGORITHM BASED ON PROPOSED SAMPLING SEARCH SPACE IDEA

OPTIMIZATION OF SKELETAL STRUCTURES USING IMPROVED GENETIC ALGORITHM BASED ON PROPOSED SAMPLING SEARCH SPACE IDEA INTERNATIONAL JOURNAL OF OPTIMIZATION IN CIVIL ENGINEERING Int. J. Optm. Cvl Eng., 2018; 8(3): 415-432 OPTIMIZATION OF SKELETAL STRUCTURES USING IMPROVED GENETIC ALGORITHM BASED ON PROPOSED SAMPLING SEARCH

More information

The Codesign Challenge

The Codesign Challenge ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.

More information

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices Steps for Computng the Dssmlarty, Entropy, Herfndahl-Hrschman and Accessblty (Gravty wth Competton) Indces I. Dssmlarty Index Measurement: The followng formula can be used to measure the evenness between

More information

On the Virtues of Parameterized Uniform Crossover

On the Virtues of Parameterized Uniform Crossover On the Vrtues of Parameterzed Unform Crossover Wllam M. Spears Naval Research aboratory Washngton, D.C. 20375 USA spears@ac.nrl.navy.ml Kenneth A. De Jong George Mason Unversty Farfax, VA 22030 USA kdejong@ac.gmu.edu

More information

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges

More information

Topology Design using LS-TaSC Version 2 and LS-DYNA

Topology Design using LS-TaSC Version 2 and LS-DYNA Topology Desgn usng LS-TaSC Verson 2 and LS-DYNA Wllem Roux Lvermore Software Technology Corporaton, Lvermore, CA, USA Abstract Ths paper gves an overvew of LS-TaSC verson 2, a topology optmzaton tool

More information

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Proceedngs of the Wnter Smulaton Conference M E Kuhl, N M Steger, F B Armstrong, and J A Jones, eds A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Mark W Brantley Chun-Hung

More information

SciFed Journal of Telecommunication Single Fitness Function to Optimize Energy using Genetic Algorithms for Wireless Sensor Network

SciFed Journal of Telecommunication Single Fitness Function to Optimize Energy using Genetic Algorithms for Wireless Sensor Network Ismal Abdullah,, 2017, 1:1 ScFed Journal of Telecommuncaton Research Artcle Open Access Sngle Ftness Functon to Optmze Energy usng Genetc Algorthms for Wreless Sensor Network *1 Ismal Abdullah, 2 Kald

More information

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide Lobachevsky State Unversty of Nzhn Novgorod Polyhedron Quck Start Gude Nzhn Novgorod 2016 Contents Specfcaton of Polyhedron software... 3 Theoretcal background... 4 1. Interface of Polyhedron... 6 1.1.

More information

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,

More information

Accounting for the Use of Different Length Scale Factors in x, y and z Directions

Accounting for the Use of Different Length Scale Factors in x, y and z Directions 1 Accountng for the Use of Dfferent Length Scale Factors n x, y and z Drectons Taha Soch (taha.soch@kcl.ac.uk) Imagng Scences & Bomedcal Engneerng, Kng s College London, The Rayne Insttute, St Thomas Hosptal,

More information

Kent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming

Kent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming CS 4/560 Desgn and Analyss of Algorthms Kent State Unversty Dept. of Math & Computer Scence LECT-6 Dynamc Programmng 2 Dynamc Programmng Dynamc Programmng, lke the dvde-and-conquer method, solves problems

More information

LS-TaSC Version 2.1. Willem Roux Livermore Software Technology Corporation, Livermore, CA, USA. Abstract

LS-TaSC Version 2.1. Willem Roux Livermore Software Technology Corporation, Livermore, CA, USA. Abstract 12 th Internatonal LS-DYNA Users Conference Optmzaton(1) LS-TaSC Verson 2.1 Wllem Roux Lvermore Software Technology Corporaton, Lvermore, CA, USA Abstract Ths paper gves an overvew of LS-TaSC verson 2.1,

More information

Conditional Speculative Decimal Addition*

Conditional Speculative Decimal Addition* Condtonal Speculatve Decmal Addton Alvaro Vazquez and Elsardo Antelo Dep. of Electronc and Computer Engneerng Unv. of Santago de Compostela, Span Ths work was supported n part by Xunta de Galca under grant

More information

An Efficient Genetic Algorithm with Fuzzy c-means Clustering for Traveling Salesman Problem

An Efficient Genetic Algorithm with Fuzzy c-means Clustering for Traveling Salesman Problem An Effcent Genetc Algorthm wth Fuzzy c-means Clusterng for Travelng Salesman Problem Jong-Won Yoon and Sung-Bae Cho Dept. of Computer Scence Yonse Unversty Seoul, Korea jwyoon@sclab.yonse.ac.r, sbcho@cs.yonse.ac.r

More information

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana

More information

Analysis of Continuous Beams in General

Analysis of Continuous Beams in General Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,

More information

An Efficient Genetic Algorithm Based Approach for the Minimum Graph Bisection Problem

An Efficient Genetic Algorithm Based Approach for the Minimum Graph Bisection Problem 118 An Effcent Genetc Algorthm Based Approach for the Mnmum Graph Bsecton Problem Zh-Qang Chen, Rong-Long WAG and Kozo OKAZAKI Faculty of Engneerng, Unversty of Fuku, Bunkyo 3-9-1,Fuku-sh, Japan 910-8507

More information

Load Balancing for Hex-Cell Interconnection Network

Load Balancing for Hex-Cell Interconnection Network Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,

More information

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour 6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the

More information

Review of approximation techniques

Review of approximation techniques CHAPTER 2 Revew of appromaton technques 2. Introducton Optmzaton problems n engneerng desgn are characterzed by the followng assocated features: the objectve functon and constrants are mplct functons evaluated

More information

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques

More information

Outline. Type of Machine Learning. Examples of Application. Unsupervised Learning

Outline. Type of Machine Learning. Examples of Application. Unsupervised Learning Outlne Artfcal Intellgence and ts applcatons Lecture 8 Unsupervsed Learnng Professor Danel Yeung danyeung@eee.org Dr. Patrck Chan patrckchan@eee.org South Chna Unversty of Technology, Chna Introducton

More information

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points; Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features

More information

Imperialist Competitive Algorithm with Variable Parameters to Determine the Global Minimum of Functions with Several Arguments

Imperialist Competitive Algorithm with Variable Parameters to Determine the Global Minimum of Functions with Several Arguments Fourth Internatonal Conference Modellng and Development of Intellgent Systems October 8 - November, 05 Lucan Blaga Unversty Sbu - Romana Imperalst Compettve Algorthm wth Varable Parameters to Determne

More information

Programming in Fortran 90 : 2017/2018

Programming in Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Exercse 1 : Evaluaton of functon dependng on nput Wrte a program who evaluate the functon f (x,y) for any two user specfed values

More information

Cluster Analysis of Electrical Behavior

Cluster Analysis of Electrical Behavior Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School

More information

Unsupervised Learning

Unsupervised Learning Pattern Recognton Lecture 8 Outlne Introducton Unsupervsed Learnng Parametrc VS Non-Parametrc Approach Mxture of Denstes Maxmum-Lkelhood Estmates Clusterng Prof. Danel Yeung School of Computer Scence and

More information

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1) Secton 1.2 Subsets and the Boolean operatons on sets If every element of the set A s an element of the set B, we say that A s a subset of B, or that A s contaned n B, or that B contans A, and we wrte A

More information

Electrical analysis of light-weight, triangular weave reflector antennas

Electrical analysis of light-weight, triangular weave reflector antennas Electrcal analyss of lght-weght, trangular weave reflector antennas Knud Pontoppdan TICRA Laederstraede 34 DK-121 Copenhagen K Denmark Emal: kp@tcra.com INTRODUCTION The new lght-weght reflector antenna

More information

An Entropy-Based Approach to Integrated Information Needs Assessment

An Entropy-Based Approach to Integrated Information Needs Assessment Dstrbuton Statement A: Approved for publc release; dstrbuton s unlmted. An Entropy-Based Approach to ntegrated nformaton Needs Assessment June 8, 2004 Wllam J. Farrell Lockheed Martn Advanced Technology

More information

CHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION

CHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION 24 CHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION The present chapter proposes an IPSO approach for multprocessor task schedulng problem wth two classfcatons, namely, statc ndependent tasks and

More information

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster

More information

A GENETIC ALGORITHM FOR PROCESS SCHEDULING IN DISTRIBUTED OPERATING SYSTEMS CONSIDERING LOAD BALANCING

A GENETIC ALGORITHM FOR PROCESS SCHEDULING IN DISTRIBUTED OPERATING SYSTEMS CONSIDERING LOAD BALANCING A GENETIC ALGORITHM FOR PROCESS SCHEDULING IN DISTRIBUTED OPERATING SYSTEMS CONSIDERING LOAD BALANCING M. Nkravan and M. H. Kashan Department of Electrcal Computer Islamc Azad Unversty, Shahrar Shahreqods

More information

Determining the Optimal Bandwidth Based on Multi-criterion Fusion

Determining the Optimal Bandwidth Based on Multi-criterion Fusion Proceedngs of 01 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 5 (01) (01) IACSIT Press, Sngapore Determnng the Optmal Bandwdth Based on Mult-crteron Fuson Ha-L Lang 1+, Xan-Mn

More information

A Facet Generation Procedure. for solving 0/1 integer programs

A Facet Generation Procedure. for solving 0/1 integer programs A Facet Generaton Procedure for solvng 0/ nteger programs by Gyana R. Parja IBM Corporaton, Poughkeepse, NY 260 Radu Gaddov Emery Worldwde Arlnes, Vandala, Oho 45377 and Wlbert E. Wlhelm Teas A&M Unversty,

More information

TN348: Openlab Module - Colocalization

TN348: Openlab Module - Colocalization TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages

More information

CHAPTER 4 OPTIMIZATION TECHNIQUES

CHAPTER 4 OPTIMIZATION TECHNIQUES 48 CHAPTER 4 OPTIMIZATION TECHNIQUES 4.1 INTRODUCTION Unfortunately no sngle optmzaton algorthm exsts that can be appled effcently to all types of problems. The method chosen for any partcular case wll

More information

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,

More information

Type-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data

Type-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data Malaysan Journal of Mathematcal Scences 11(S) Aprl : 35 46 (2017) Specal Issue: The 2nd Internatonal Conference and Workshop on Mathematcal Analyss (ICWOMA 2016) MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES

More information

F Geometric Mean Graphs

F Geometric Mean Graphs Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 2 (December 2015), pp. 937-952 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) F Geometrc Mean Graphs A.

More information

Analysis of 3D Cracks in an Arbitrary Geometry with Weld Residual Stress

Analysis of 3D Cracks in an Arbitrary Geometry with Weld Residual Stress Analyss of 3D Cracks n an Arbtrary Geometry wth Weld Resdual Stress Greg Thorwald, Ph.D. Ted L. Anderson, Ph.D. Structural Relablty Technology, Boulder, CO Abstract Materals contanng flaws lke nclusons

More information

Shape Optimization of Shear-type Hysteretic Steel Damper for Building Frames using FEM-Analysis and Heuristic Approach

Shape Optimization of Shear-type Hysteretic Steel Damper for Building Frames using FEM-Analysis and Heuristic Approach The Seventh Chna-Japan-Korea Jont Symposum on Optmzaton of Structural and Mechancal Systems Huangshan, June, 18-21, 2012, Chna Shape Optmzaton of Shear-type Hysteretc Steel Damper for Buldng Frames usng

More information

A Binarization Algorithm specialized on Document Images and Photos

A Binarization Algorithm specialized on Document Images and Photos A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a

More information

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr) Helsnk Unversty Of Technology, Systems Analyss Laboratory Mat-2.08 Independent research projects n appled mathematcs (3 cr) "! #$&% Antt Laukkanen 506 R ajlaukka@cc.hut.f 2 Introducton...3 2 Multattrbute

More information

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth

More information

Module Management Tool in Software Development Organizations

Module Management Tool in Software Development Organizations Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,

More information

Learning the Kernel Parameters in Kernel Minimum Distance Classifier

Learning the Kernel Parameters in Kernel Minimum Distance Classifier Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department

More information

K-means and Hierarchical Clustering

K-means and Hierarchical Clustering Note to other teachers and users of these sldes. Andrew would be delghted f you found ths source materal useful n gvng your own lectures. Feel free to use these sldes verbatm, or to modfy them to ft your

More information

A Topology-aware Random Walk

A Topology-aware Random Walk A Topology-aware Random Walk Inkwan Yu, Rchard Newman Dept. of CISE, Unversty of Florda, Ganesvlle, Florda, USA Abstract When a graph can be decomposed nto clusters of well connected subgraphs, t s possble

More information

PARETO BAYESIAN OPTIMIZATION ALGORITHM FOR THE MULTIOBJECTIVE 0/1 KNAPSACK PROBLEM

PARETO BAYESIAN OPTIMIZATION ALGORITHM FOR THE MULTIOBJECTIVE 0/1 KNAPSACK PROBLEM PARETO BAYESIAN OPTIMIZATION ALGORITHM FOR THE MULTIOBJECTIVE 0/ KNAPSACK PROBLEM Josef Schwarz Jří Očenáše Brno Unversty of Technology Faculty of Engneerng and Computer Scence Department of Computer Scence

More information

Classification / Regression Support Vector Machines

Classification / Regression Support Vector Machines Classfcaton / Regresson Support Vector Machnes Jeff Howbert Introducton to Machne Learnng Wnter 04 Topcs SVM classfers for lnearly separable classes SVM classfers for non-lnearly separable classes SVM

More information

Classifier Selection Based on Data Complexity Measures *

Classifier Selection Based on Data Complexity Measures * Classfer Selecton Based on Data Complexty Measures * Edth Hernández-Reyes, J.A. Carrasco-Ochoa, and J.Fco. Martínez-Trndad Natonal Insttute for Astrophyscs, Optcs and Electroncs, Lus Enrque Erro No.1 Sta.

More information

A Hybrid Genetic Algorithm for Routing Optimization in IP Networks Utilizing Bandwidth and Delay Metrics

A Hybrid Genetic Algorithm for Routing Optimization in IP Networks Utilizing Bandwidth and Delay Metrics A Hybrd Genetc Algorthm for Routng Optmzaton n IP Networks Utlzng Bandwdth and Delay Metrcs Anton Redl Insttute of Communcaton Networks, Munch Unversty of Technology, Arcsstr. 21, 80290 Munch, Germany

More information

TPL-Aware Displacement-driven Detailed Placement Refinement with Coloring Constraints

TPL-Aware Displacement-driven Detailed Placement Refinement with Coloring Constraints TPL-ware Dsplacement-drven Detaled Placement Refnement wth Colorng Constrants Tao Ln Iowa State Unversty tln@astate.edu Chrs Chu Iowa State Unversty cnchu@astate.edu BSTRCT To mnmze the effect of process

More information

Some Advanced SPC Tools 1. Cumulative Sum Control (Cusum) Chart For the data shown in Table 9-1, the x chart can be generated.

Some Advanced SPC Tools 1. Cumulative Sum Control (Cusum) Chart For the data shown in Table 9-1, the x chart can be generated. Some Advanced SP Tools 1. umulatve Sum ontrol (usum) hart For the data shown n Table 9-1, the x chart can be generated. However, the shft taken place at sample #21 s not apparent. 92 For ths set samples,

More information

TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z.

TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z. TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS Muradalyev AZ Azerbajan Scentfc-Research and Desgn-Prospectng Insttute of Energetc AZ1012, Ave HZardab-94 E-mal:aydn_murad@yahoocom Importance of

More information

A Method to Improve Routing and Determining the Shortest Traveling Pathway between PADs in the Automatic Drilling of PCBs Based on Genetic Algorithm

A Method to Improve Routing and Determining the Shortest Traveling Pathway between PADs in the Automatic Drilling of PCBs Based on Genetic Algorithm A Method to Improve Routng and Determnng the Shortest Travelng Pathway between PADs n the Automatc Drllng of PCBs Based on Genetc Algorthm A.R. MohammadnaOranj 1 A. Khademzadeh 2 A. Jall Iran 3 H. Ebrahman

More information

Parallel Numerics. 1 Preconditioning & Iterative Solvers (From 2016)

Parallel Numerics. 1 Preconditioning & Iterative Solvers (From 2016) Technsche Unverstät München WSe 6/7 Insttut für Informatk Prof. Dr. Thomas Huckle Dpl.-Math. Benjamn Uekermann Parallel Numercs Exercse : Prevous Exam Questons Precondtonng & Iteratve Solvers (From 6)

More information

S1 Note. Basis functions.

S1 Note. Basis functions. S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type

More information

Feature Reduction and Selection

Feature Reduction and Selection Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components

More information

GSLM Operations Research II Fall 13/14

GSLM Operations Research II Fall 13/14 GSLM 58 Operatons Research II Fall /4 6. Separable Programmng Consder a general NLP mn f(x) s.t. g j (x) b j j =. m. Defnton 6.. The NLP s a separable program f ts objectve functon and all constrants are

More information

Constructing Minimum Connected Dominating Set: Algorithmic approach

Constructing Minimum Connected Dominating Set: Algorithmic approach Constructng Mnmum Connected Domnatng Set: Algorthmc approach G.N. Puroht and Usha Sharma Centre for Mathematcal Scences, Banasthal Unversty, Rajasthan 304022 usha.sharma94@yahoo.com Abstract: Connected

More information

CONFIGURATION OPTIMIZATION OF TRUSSES USING A MULTI HEURISTIC BASED SEARCH METHOD

CONFIGURATION OPTIMIZATION OF TRUSSES USING A MULTI HEURISTIC BASED SEARCH METHOD INTERNATIONAL JOURNAL OF OPTIMIZATION IN CIVIL ENGINEERING Int. J. Optm. Cvl Eng., 2013; 3(1): 151-178 CONFIGURATION OPTIMIZATION OF TRUSSES USING A MULTI HEURISTIC BASED SEARCH METHOD A. Kaveh 1,*,, V.R.

More information

2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements

2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements Module 3: Element Propertes Lecture : Lagrange and Serendpty Elements 5 In last lecture note, the nterpolaton functons are derved on the bass of assumed polynomal from Pascal s trangle for the fled varable.

More information

Maximum Variance Combined with Adaptive Genetic Algorithm for Infrared Image Segmentation

Maximum Variance Combined with Adaptive Genetic Algorithm for Infrared Image Segmentation Internatonal Conference on Logstcs Engneerng, Management and Computer Scence (LEMCS 5) Maxmum Varance Combned wth Adaptve Genetc Algorthm for Infrared Image Segmentaton Huxuan Fu College of Automaton Harbn

More information

EVALUATION OF THE PERFORMANCES OF ARTIFICIAL BEE COLONY AND INVASIVE WEED OPTIMIZATION ALGORITHMS ON THE MODIFIED BENCHMARK FUNCTIONS

EVALUATION OF THE PERFORMANCES OF ARTIFICIAL BEE COLONY AND INVASIVE WEED OPTIMIZATION ALGORITHMS ON THE MODIFIED BENCHMARK FUNCTIONS Academc Research Internatonal ISS-L: 3-9553, ISS: 3-9944 Vol., o. 3, May 0 EVALUATIO OF THE PERFORMACES OF ARTIFICIAL BEE COLOY AD IVASIVE WEED OPTIMIZATIO ALGORITHMS O THE MODIFIED BECHMARK FUCTIOS Dlay

More information

SHAPE OPTIMIZATION OF STRUCTURES BY MODIFIED HARMONY SEARCH

SHAPE OPTIMIZATION OF STRUCTURES BY MODIFIED HARMONY SEARCH INTERNATIONAL JOURNAL OF OPTIMIZATION IN CIVIL ENGINEERING Int. J. Optm. Cvl Eng., 2011; 3:485-494 SHAPE OPTIMIZATION OF STRUCTURES BY MODIFIED HARMONY SEARCH S. Gholzadeh *,, A. Barzegar and Ch. Gheyratmand

More information

Quality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation

Quality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation Intellgent Informaton Management, 013, 5, 191-195 Publshed Onlne November 013 (http://www.scrp.org/journal/m) http://dx.do.org/10.36/m.013.5601 Qualty Improvement Algorthm for Tetrahedral Mesh Based on

More information

Cable optimization of a long span cable stayed bridge in La Coruña (Spain)

Cable optimization of a long span cable stayed bridge in La Coruña (Spain) Computer Aded Optmum Desgn n Engneerng XI 107 Cable optmzaton of a long span cable stayed brdge n La Coruña (Span) A. Baldomr & S. Hernández School of Cvl Engneerng, Unversty of Coruña, La Coruña, Span

More information

Yuan Xu School of automation, Northwestern Polytechnical University, Xian , China. Huifeng Xue. Ailong Liu*

Yuan Xu School of automation, Northwestern Polytechnical University, Xian , China. Huifeng Xue. Ailong Liu* Rev. Téc. Ing. Unv. Zula. Vol. 39, Nº 7, 80-86, 2016 do:10.21311/001.39.7.10 A Parallel Genetc Algorthm for the Verfyng Smulaton of the Performance Prototype Yuan Xu School of automaton, Northwestern Polytechncal

More information

Query Clustering Using a Hybrid Query Similarity Measure

Query Clustering Using a Hybrid Query Similarity Measure Query clusterng usng a hybrd query smlarty measure Fu. L., Goh, D.H., & Foo, S. (2004). WSEAS Transacton on Computers, 3(3), 700-705. Query Clusterng Usng a Hybrd Query Smlarty Measure Ln Fu, Don Hoe-Lan

More information

Sequential search. Building Java Programs Chapter 13. Sequential search. Sequential search

Sequential search. Building Java Programs Chapter 13. Sequential search. Sequential search Sequental search Buldng Java Programs Chapter 13 Searchng and Sortng sequental search: Locates a target value n an array/lst by examnng each element from start to fnsh. How many elements wll t need to

More information

PHYSICS-ENHANCED L-SYSTEMS

PHYSICS-ENHANCED L-SYSTEMS PHYSICS-ENHANCED L-SYSTEMS Hansrud Noser 1, Stephan Rudolph 2, Peter Stuck 1 1 Department of Informatcs Unversty of Zurch, Wnterthurerstr. 190 CH-8057 Zurch Swtzerland noser(stuck)@f.unzh.ch, http://www.f.unzh.ch/~noser(~stuck)

More information

Load-Balanced Anycast Routing

Load-Balanced Anycast Routing Load-Balanced Anycast Routng Chng-Yu Ln, Jung-Hua Lo, and Sy-Yen Kuo Department of Electrcal Engneerng atonal Tawan Unversty, Tape, Tawan sykuo@cc.ee.ntu.edu.tw Abstract For fault-tolerance and load-balance

More information

Sum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints

Sum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints Australan Journal of Basc and Appled Scences, 2(4): 1204-1208, 2008 ISSN 1991-8178 Sum of Lnear and Fractonal Multobjectve Programmng Problem under Fuzzy Rules Constrants 1 2 Sanjay Jan and Kalash Lachhwan

More information

ELEC 377 Operating Systems. Week 6 Class 3

ELEC 377 Operating Systems. Week 6 Class 3 ELEC 377 Operatng Systems Week 6 Class 3 Last Class Memory Management Memory Pagng Pagng Structure ELEC 377 Operatng Systems Today Pagng Szes Vrtual Memory Concept Demand Pagng ELEC 377 Operatng Systems

More information

Data Representation in Digital Design, a Single Conversion Equation and a Formal Languages Approach

Data Representation in Digital Design, a Single Conversion Equation and a Formal Languages Approach Data Representaton n Dgtal Desgn, a Sngle Converson Equaton and a Formal Languages Approach Hassan Farhat Unversty of Nebraska at Omaha Abstract- In the study of data representaton n dgtal desgn and computer

More information

A fault tree analysis strategy using binary decision diagrams

A fault tree analysis strategy using binary decision diagrams Loughborough Unversty Insttutonal Repostory A fault tree analyss strategy usng bnary decson dagrams Ths tem was submtted to Loughborough Unversty's Insttutonal Repostory by the/an author. Addtonal Informaton:

More information

Study on Fuzzy Models of Wind Turbine Power Curve

Study on Fuzzy Models of Wind Turbine Power Curve Proceedngs of the 006 IASME/WSEAS Internatonal Conference on Energy & Envronmental Systems, Chalkda, Greece, May 8-0, 006 (pp-7) Study on Fuzzy Models of Wnd Turbne Power Curve SHU-CHEN WANG PEI-HWA HUANG

More information

Related-Mode Attacks on CTR Encryption Mode

Related-Mode Attacks on CTR Encryption Mode Internatonal Journal of Network Securty, Vol.4, No.3, PP.282 287, May 2007 282 Related-Mode Attacks on CTR Encrypton Mode Dayn Wang, Dongda Ln, and Wenlng Wu (Correspondng author: Dayn Wang) Key Laboratory

More information

An Optimization Approach for Path Synthesis of Four-bar Grashof Mechanisms

An Optimization Approach for Path Synthesis of Four-bar Grashof Mechanisms 5 th Natonal Conference on Machnes and Mechansms NaCoMM0-44 An Optmzaton Approach for Path Synthess of Four-bar Grashof Mechansms A.S.M.Alhajj, J.Srnvas Abstract Ths paper presents an optmzaton scheme

More information