SHAPE OPTIMIZATION OF STRUCTURES BY MODIFIED HARMONY SEARCH
|
|
- Anis Hunter
- 5 years ago
- Views:
Transcription
1 INTERNATIONAL JOURNAL OF OPTIMIZATION IN CIVIL ENGINEERING Int. J. Optm. Cvl Eng., 2011; 3: SHAPE OPTIMIZATION OF STRUCTURES BY MODIFIED HARMONY SEARCH S. Gholzadeh *,, A. Barzegar and Ch. Gheyratmand Department of Cvl Engneerng, Urma Unversty, Urma, Iran ABSTRACT The man am of the present study s to propose a modfed harmony search (MHS) algorthm for sze and shape optmzaton of structures. The standard harmony search (HS) algorthm s conceptualzed usng the muscal process of searchng for a perfect state of the harmony. It uses a stochastc random search nstead of a gradent search. The proposed MHS algorthm s desgned based on eltsm. In fact the MHS s a mult-staged verson of the HS and n each stage a new harmony memory s created usng the nformaton of the prevous stages. Numercal results reveal that the proposed algorthm s a powerful optmzaton technque wth mproved explotaton characterstcs compared wth the standard HS. Receved: 4 October 2011; Accepted: 28 December 2011 KEY WORDS: Shape optmzaton, harmony search algorthm, penalty functons, truss structure 1. INTRODUCTION Structural optmzaton s a crtcal actvty that has receved consderable attenton n the last four decades. Usually, structural optmzaton problems nvolve searchng for the mnmum of the structural weght. Ths mnmum weght desgn s subected to varous constrants on performance measures, such as stresses and dsplacements, and also restrcted by practcal mnmum cross-sectonal areas or dmensons of the structural members or components. Due to consderng these constrants the possblty of trappng n the local optma wll be larger. Optmum shape desgn of structures s one of the challengng research areas of the * Correspondng author: Department of Cvl Engneerng, Urma Unversty, Urma, Iran E-mal address: s.gholzadeh@urma.ac.r
2 486 S. Gholzadeh, A. Barzegar and Ch. Gheyratmand structural optmzaton feld. In ths class of optmzaton problems two types of desgn varables wth dfferent natures, ncludng szng and geometrc varables, are nvolved. The shape optmzaton problem has been dentfed as a more dffcult but more mportant task than pure szng optmzaton, snce potental savngs n materal can be far better mproved than by the latter. Most of the engneerng optmzaton algorthms are based on numercal lnear and nonlnear programmng methods that requre substantal gradent nformaton and usually seek to mprove the soluton n the neghborhood of a startng pont. These algorthms, however, reveal a lmted approach to complcated real-world optmzaton problems. If there s more than one local optmum n the problem, the result may depend on the selecton of an ntal pont, and the obtaned optmal soluton may not necessarly be the global optmum. In the last years, structural optmzaton has been studed by usng dfferent natural phenomena based meta-heurstc algorthms. The most extensvely appled meta-heurstc algorthms are Genetc Algorthm (GA) [1] Ant Colony Optmzaton (ACO) [2], Partcle Swarm Optmzaton (PSO) [3] and etc. In the feld of structural engneerng many successful applcatons of the above mentoned algorthms have been reported n the lterature [4-9]. The popularty of these algorthms s due to ths fact that for mplementaton of the meta-heurstcs the gradent of obectve functon and constrants are not requred. In other words, they use a stochastc random search strategy nstead of a gradent search so that dervatve nformaton s unnecessary. Also they are able to handle both dscrete and contnuous desgn varables and ther computer mplementaton s smple. One of the recent addtons to meta-heurstcs s the Harmony Search (HS) [10] method. The so called HS algorthm was recently developed by Lee and Geem n an analogy wth musc mprovsaton process where musc player mprovse the ptches of ther nstruments to obtan better harmony. Soluton vectors n HS algorthm, s smulated wth harmony n the musc and search plan wth artst ntatve. In comparson wth other meta-heurstcs, HS mposes fewer mathematcal requrements. These features ncrease flexblty of the HS to analyss varous engneerng optmzaton problems [11]. In ths paper, a new mult-stage HS algorthm s proposed for sze and shape optmzaton of structures. Also the exteror penalty functon method (EPFM), due to ts smplcty and ease of mplementaton, s employed n the framework of the sequental unconstraned mnmzaton technque (SUMT) [12] to handle the constrants. The proposed algorthm s denoted as modfed harmony search (MHS) algorthm. Two benchmark structural shape optmzaton problems are solved by the proposed MHS. The numercal results ndcate that the computatonal performance of the proposed MHS s better than that of the HS. 2. FORMULATION OF THE OPTIMIZATION PROBLEM The mathematcal formulaton of structural optmzaton problems toward the desgn varables, the obectve and constrant functons depend on the type of the applcaton. However, all optmzaton problems can be expressed n standard mathematcal terms, whch
3 SHAPE OPTIMIZATION OF STRUCTURES BY MODIFIED HARMONY SEARCH 487 n general form can be stated as follows: Mnmze F(X) Subect to g (X) 0, = 1,..., m l u X X X, = 1,..., n (1) where, X s the vector of desgn varables; F(X) s the obectve functon to be mnmzed; g (X) s the th behavoral constrants; l u X and X are the lower and the upper bounds on a typcal desgn varable X. In ths study, to transform the constraned structural optmzaton problem nto an unconstraned one the EPFM s employed. Penalty functon methods transform the basc optmzaton problem nto alternatve formulatons such that numercal solutons are sought by solvng a sequence of unconstraned mnmzaton problems. The above mentoned constraned optmzaton problem can be converted nto an unconstraned problem by constructng a functon of the followng form: m 2 Φ( X, r ) f ( X ) r [max{0, g ( X )}] (2) p p 1 whereφ, and r p are the pseudo obectve functon, and postve penalty parameter, respectvely. By choosng the mnor values for the penalty parameter, the effect of constrants n pseudo obectve functon decrease and optmzaton processes cause to mnmze obectve functon wth small amount of volated constrants, n the other sde by choosng the hgh value for penalty parameter, the effect of constrants n pseudo obectve functon ncreases and the porton of obectve functon decreases. Vanderplaats recommended that f the unconstraned mnmzaton of the pseudo obectve functon s repeated for a sequence of values of the penalty parameter, r p, the soluton may be brought to converge to that of the orgnal problem. These methods are known as sequental unconstraned mnmzaton technques (SUMT). In the present study, the EPFM s employed n the framework of the SUMT to handle the constrants. 3. MODIFIED HARMONY SEARCH ALGORITHM Harmony s defned as an attractve sound made by two or more notes beng played at the same tme. The new HS meta-heurstc algorthm was derved by adoptng the dea that exstng meta-heurstc algorthms are found n the paradgm of natural phenomena. The HS algorthm parameters that are requred to solve the optmzaton problem are also specfed n ths step: harmony memory sze (number of soluton vectors, labled as HMS), harmony memory consderng rate (HMCR), ptch adustng rate (PAR), an arbtrary dstance bandwdth for contnuous varable (bw) and termnaton crteron (maxmum number of searches). The basc steps of the HS may be mentoned as follows:
4 488 S. Gholzadeh, A. Barzegar and Ch. Gheyratmand Step 1. Intalze algorthm parameters: Specfcaton of each desgn varable, a possble value range n each desgn varable, HMS, HMCR, PAR, and termnaton crteron are ntalzed. Step 2. Intalze harmony memory: The harmony memory (HM) matrx s flled wth randomly generated desgns as the sze of the harmony memory (HMS). Step 3. Improvse a new harmony from the HM: New harmony vectors mprovsed from ether the ntally generated HM or the entre possble range of values. The new harmony mprovsaton progresses based on memory consderatons, ptch adustments, and randomzaton. Here, t s possble to choose the new value usng the HMCR parameter, whch vares between 0 and 1 as follows: ' 1 2 x x,x,...,x ' x ' x X HMS w.p. of HMCR w.p. of (1 HMCR) where the HMCR s the probablty of choosng one value from the sgnfcant values stored n the HM, and (1-HMCR) s the probablty of randomly choosng one practcal value not lmted to those stored n the HM. Every component of the new harmony vector s examned to determne whether t should be ptch-adusted. Ths procedure uses the PAR parameters as follows. (3) Yes No w.p. of PAR w.p. of (1 PAR) (4) The ptch adustng process s performed only after a value s chosen from the HM. The value (1-PAR) sets the rate of dong nothng. A PAR of 0.05 ndcates that the algorthm wll choose a neghborng value wth 5% HMCR probablty. If the ptch adustment appled for a desgn varable then a neghborng value wth the probablty of PAR% HMCR s taken for t as follows: ' x x ( k m) ' x x (5) n whch m s the neghborng ndex; α s the value of bw u(-1,1); bw s an arbtrary dstance bandwdth for the contnuous varable and u(-1,+1) s a unform dstrbuton between -1 and +1. Step 4. Update the Harmony Memory: If the new harmony s better than the worst vector n the HM the new soluton vector s ncluded n the HM and the exstng worst vector s excluded from the HM.
5 SHAPE OPTIMIZATION OF STRUCTURES BY MODIFIED HARMONY SEARCH 489 Step 5. Termnaton Crtera: Steps 3 and 4 are repeated untl the termnaton crteron s satsfed. The termnaton crteron stops the algorthm when the maxmum number of searches s reached. In order to mprove the exploraton ablty of the standard HS, the algorthm s employed n the framework of SUMT to solve the optmzaton problem and the desgn constrants are handled by EPFM. At frst by choosng a mnor r p a HM wth the sze of HMS s ntalzed and the HS s employed to acheve a prelmnary optmzaton task. The found soluton n ths manner may be nfeasble. In the next step, the harmony vectors of new HM are selected from a neghborng regon of the best soluton obtaned n the prevous process. In ths case, the best soluton s drectly transformed to the new HM and the remanng vectors are selected as the random numbers normally dstrbuted about the mentoned best soluton wth the standard devaton of 10% tmes the best soluton. After ntalzng a new HM, another optmzaton process s acheved by HS usng an ncreased r p. Ths procedure s repeated untl the algorthm converges. 4. NUMERICAL EXAMPLE In order to nvestgate the computatonal performance of the proposed MHS algorthm, two examples are presented. For all examples the HS parameters are as: HMS=10, HMCR=0.971, PAR = 0.05 and bw = 0.3. Also the maxmum numbers of teratons n each optmzaton process and the maxmum number of optmzaton processes are lmted to 100 and 5, respectvely (5000 structural analyses). All of the requred computer programs are coded n MATLAB [13] platform bar Truss Ths problem has been nvestgated by Wu and Chow [14], Hwang and He [15], Tang et al. [16] and Raham et al. [17]. The ffteen-bar 2-D truss s shown n Fgure 1. the magntude of the vertcal load s P = 10 kps. The materal densty s 0.1 lb/n 3 and the modulus of elastcty s 10 4 ks. Fgure 1. Ffteen-bar truss
6 490 S. Gholzadeh, A. Barzegar and Ch. Gheyratmand In ths example there are 23 desgn varables ncludng two categores: Szng varables: A, =1,2,,15 and Geometry varables: x 2 = x 6 ; x 3 = x 7 ; y 2 ; y 3 ; y 4 ; y 6 ; y 7 ; y 8. Stress lmtaton for all elements s 25 ks. The sze varables are selected from the followng set: D = { 0.111, 0.141, 0.174, 0.220, 0.270, 0.287, 0.347, 0.440, 0.539, 0.954, 1.081, 1.174, 1.333, 1.488, 1.764, 2.142, 2.697, 2.800, 3.131, 3.565, 3.813, 4.805, 5.952, 6.572, 7.192, 8.525, 9.300, , , , , } (n. 2 ). Also sde constrants for geometry varables are as follows: 100 n. x n.; 220 n. x n.; 100 n. y n.; 100 n. y n.; 50 n. y 4 90 n.; 20 n. y 6 20 n.; 20 n. y 7 20 n.; 20 n. y 8 60 n.; The best results obtaned n ths study are compared wth those of the other works n Table 1. Desgn varables Table 1. Optmal desgn comparson for the 15-bar planner truss Wu and Chow [14] Hwang and He [15] Tang et al. [16] Raham et Present work al. [17] HS MHS A A A A A A A A A A A A A A A x x y y y y y y Best weght (lb) Number of analyses The results demonstrate the computatonal advantages of the MHS wth respect to other algorthms. The geometry of the optmum structure s shown n Fgure 2.
7 SHAPE OPTIMIZATION OF STRUCTURES BY MODIFIED HARMONY SEARCH 491 (a) (b) Fgure 2. (a) Optmum shape of ffteen-bar planar truss (b) geometry of nodes 4 and 8 To assess the computatonal performance of the proposed MHS algorthm, 25 ndependent runs are acheved and the best, worst and mean weghts of lb, lb and lb are obtaned bar truss Ths problem has been nvestgated by Wu and Chow [14], Tang et al. [16] and Raham et al. [17]. The twenty fve-bar truss s consdered as shown n Fgure 3. Fgure 3. Twenty fve-bar space truss The materal densty s 0.1 lb/n 3 and the modulus of elastcty s 10 4 ks. Loadng data s gven n Table 2.
8 492 S. Gholzadeh, A. Barzegar and Ch. Gheyratmand Table 2. Loadng data for twenty fve-bar truss Node F x (kps) F y (kps) F z (kps) There are 13 desgn varables ncludng two categores as follows: Sze varables: A 1 ; A 2 = A 3 = A 4 = A 5 ; A 6 = A 7 = A 8 = A 9 ; A 10 = A 11 ; A 12 = A 13 ; A 14 = A 15 = A 16 = A 17 ; A 18 = A 19 = A 20 = A 21 ; A 22 = A 23 = A 24 = A 25 Geometry varables: x 4 = x 5 = -x 3 = -x 6 ; x 8 = x 9 = -x 7 = -x 10 ; y 3 = y 4 = -y 5 = -y 6 ; y 7 = y 8 = -y 9 = -y 10 ; z 3 = z 4 = z 5 = z 6 Stress lmtaton for all elements s 40 ks also dsplacement constrant n all drectons s 0.35 n. The sze varables are selected from the followng set: D = {0.1, 0.2, 0.3, 0.4, 0.5, 0.6, 0.7, 0.8, 0.9, 1.0, 1.1, 1.2, 1.3, 1.4, 1.5, 1.6, 1.7, 1.8, 1.9, 2.0, 2.1, 2.2, 2.3, 2.4, 2.5, 2.6, 2.8, 3.0, 3.2, 3.4} (n. 2 ). Also sde constrants for geometry varables are as follows: 20 n. x 4 60 n.; 40 n. x 8 80 n.; 40 n. y 4 80 n.; 100 n. y n.; 90 n. z n.; The best results obtaned n ths study are compared wth those of the others n Table 3. Table 3. Optmal desgn comparson for the 25-bar space truss Desgn varables Wu and Chow [14] Tang et al. [16] Raham et al. Present work [17] HS MHS A A A A A A A A X Y Z X Y Best weght (lb) Number of analyses
9 SHAPE OPTIMIZATION OF STRUCTURES BY MODIFIED HARMONY SEARCH 493 The results demonstrate the computatonal advantages of the MHS wth respect to other algorthms. The geometry of the optmum structure s shown n Fgure 4. To assess the computatonal performance of the proposed MHS algorthm, 25 ndependent runs are acheved and the best weght of lb, the worst weght f lb and the mean weght of lb are obtaned. (a) (b) Fgure 4. (a) Optmum shape of truss n (a) y-z plan and (b) x-z plan 5. CONCLUSION The shape optmzaton of truss structures s tackled n ths paper usng an enhanced HS metaheurstc algorthm. In order to mprove the computatonal performance of HS the standard HS algorthm s sequentally utlzed n the framework of SUMT employng EPFM to handle the desgn constrants. The proposed meta-heurstc algorthm s termed as modfed harmony search (MHS) algorthm. Both sze and shape structural optmzaton problems are solved by the proposed algorthm and the results are compared to those of the other researchers. The numercal results ndcate that usng MHS not only better solutons can be found but also a sgnfcant reducton n computatonal effort may be acheved. For more detals, n the case of frst example, the best weght found n the lterature s lb spendng 8000 structural analyses whle n the present paper the best weght of lb s obtaned after 5000 structural analyses. In the case of second example, the weght of the best structure and ts correspondng requred number of analyses reported n the lterature are lb and 8000, respectvely whle these values n the present paper are lb and 5000, respectvely. These results emphasze on the effcency of the proposed MHS algorthm for shape optmzaton of structures.
10 494 S. Gholzadeh, A. Barzegar and Ch. Gheyratmand REFERENCES 1. Holland JH. Adaptaton n Natural and Artfcal Systems. Unversty of Mchgan Press, Ann Arbor, Dorgo M. Optmzaton, learnng and natural algorthms. PhD Thess, Dp. Elettroncae Informazone, Poltecnco d Mlano, Italy, Eberhart RC, Kennedy J. A new optmzer usng partcle swarm theory, In: Proceedngs of the sxth nternatonal symposum on mcro machne and human scence. Nagoya, Japan, pp , Gholzadeh S, Samavat OA. Structural optmzaton by wavelet transforms and neural networks, Appl Math Model 2011; 35: Kaveh A, Kalatar V. Genetc algorthm for dscrete szng optmal desgn of trusses usng the force method, Int J Numer Methods Eng 2002; 55: Gholzadeh S, Fattah F. Seral Integraton of Partcle Swarm and Ant Colony Algorthms for Structural Optmzaton, Asan J Cv Eng 2012; 13: Kaveh A, Talatahar S. An mproved ant colony optmzaton for the desgn of planar steel frames, Eng Struct 2010; 32: Gholzadeh S, Salaegheh E. Optmal desgn of structures for tme hstory loadng by swarm ntellgence and an advanced met model, Comput Meth Appl Mech Eng 2009; 198: Kaveh A, Talatahar S. A hybrd partcle swarm and ant colony optmzaton for desgn of truss structure, Asan J Cv Eng 2008; 9: Lee KS, Geem ZW. A new structural optmzaton method based on the harmony search algorthm, Comput Struct 2004; 82: Omran MGH, Mahdav M. Global-best harmony search, Appl Math Comput 2008; 198: Vanderplaats GN. Numercal Optmzaton Technques for Engneerng Desgn: wth Applcaton. 2nd ed. NewYork: McGraw-Hll, The language of techncal computng, MATLAB, Math Works Inc (2009). 14. Wu SJ, Chow PT. Integrated dscrete and confgureuraton optmzaton of trusses usng genetc algorthms, Comput Struct 1995; 55: Hwang SF, He RS. A hybrd real-parameter genetc algorthm for functon optmzaton, Adv Eng Infor 2006; 20: Tang W, Tong L, Gu Y. Improved genetc algorthm for desgn optmzaton of truss structures wth szng, shape and topology varables, Int J Numer Methods Eng 2005; 62: Raham H, Kaveh A, Gholpour Y. Szng, geometry and topology optmzaton of trusses va force method and genetc algorthm, Eng Struct 2008; 30:
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 informationStructural optimization using artificial bee colony algorithm
2 nd Internatonal Conference on Engneerng Optmzaton September 6-9, 2010, Lsbon, ortugal Structural optmzaton usng artfcal bee colony algorthm Al Hadd 1, Sna Kazemzadeh Azad 2, Saed Kazemzadeh Azad Department
More informationOPTIMIZATION 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 informationProblem 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 informationMeta-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 informationAn 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 informationDetermining 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 informationAn Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices
Internatonal Mathematcal Forum, Vol 7, 2012, no 52, 2549-2554 An Applcaton of the Dulmage-Mendelsohn Decomposton to Sparse Null Space Bases of Full Row Rank Matrces Mostafa Khorramzadeh Department of Mathematcal
More informationTopology 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 informationParallelism 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 informationKent 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 informationStructural Optimization Using OPTIMIZER Program
SprngerLnk - Book Chapter http://www.sprngerlnk.com/content/m28478j4372qh274/?prnt=true ق.ظ 1 of 2 2009/03/12 11:30 Book Chapter large verson Structural Optmzaton Usng OPTIMIZER Program Book III European
More informationReview 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 informationA 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 informationA 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 informationDesign 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 informationA 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 informationEVALUATION 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 informationOPTIMIZATION OF SKELETAL STRUCTURES USING A HYBRIDIZED ANT COLONY-HARMONY SEARCH- GENETIC ALGORITHM *
IJST, Transactons of Cvl Engneerng, Vol. 38, No. C1, pp 1-20 Prnted n The Islamc Republc of Iran, 2014 Shraz Unversty OPTIMIZATION OF SKELETAL STRUCTURES USING A HYBRIDIZED ANT COLONY-HARMONY SEARCH- GENETIC
More informationS1 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 informationSupport 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 informationAn 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 informationSum 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 informationCHAPTER 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 informationStep-3 New Harmony vector, improvised based on the following three mechanisms: (1) random selection, (2) memory consideration, and (3)
Optmal synthess of a Path Generator Lnkage usng Non Conventonal Approach Mr. Monsh P. Wasnk 1, Prof. M. K. Sonpmple 2, Prof. S. K. Undrwade 3 1 M-Tech MED Pryadarshn College of Engneerng, Nagpur 2,3 Mechancal
More informationCluster 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 informationThe 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 informationCourse 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 informationLS-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 informationSmoothing 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 informationActive Contours/Snakes
Actve Contours/Snakes Erkut Erdem Acknowledgement: The sldes are adapted from the sldes prepared by K. Grauman of Unversty of Texas at Austn Fttng: Edges vs. boundares Edges useful sgnal to ndcate occludng
More informationAn 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 informationComparison of Heuristics for Scheduling Independent Tasks on Heterogeneous Distributed Environments
Comparson of Heurstcs for Schedulng Independent Tasks on Heterogeneous Dstrbuted Envronments Hesam Izakan¹, Ath Abraham², Senor Member, IEEE, Václav Snášel³ ¹ Islamc Azad Unversty, Ramsar Branch, Ramsar,
More informationLearning 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 informationGSLM 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 informationOPTIMIZATION OF FUZZY RULE BASES USING CONTINUOUS ANT COLONY SYSTEM
Proceedng of the Frst Internatonal Conference on Modelng, Smulaton and Appled Optmzaton, Sharah, U.A.E. February -3, 005 OPTIMIZATION OF FUZZY RULE BASES USING CONTINUOUS ANT COLONY SYSTEM Had Nobahar
More informationImprovement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration
Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,
More informationComplexity Analysis of Problem-Dimension Using PSO
Proceedngs of the 7th WSEAS Internatonal Conference on Evolutonary Computng, Cavtat, Croata, June -4, 6 (pp45-5) Complexty Analyss of Problem-Dmenson Usng PSO BUTHAINAH S. AL-KAZEMI AND SAMI J. HABIB,
More informationSupport Vector Machines. CS534 - Machine Learning
Support Vector Machnes CS534 - Machne Learnng Perceptron Revsted: Lnear Separators Bnar classfcaton can be veed as the task of separatng classes n feature space: b > 0 b 0 b < 0 f() sgn( b) Lnear Separators
More informationRange images. Range image registration. Examples of sampling patterns. Range images and range surfaces
Range mages For many structured lght scanners, the range data forms a hghly regular pattern known as a range mage. he samplng pattern s determned by the specfc scanner. Range mage regstraton 1 Examples
More information5 The Primal-Dual Method
5 The Prmal-Dual Method Orgnally desgned as a method for solvng lnear programs, where t reduces weghted optmzaton problems to smpler combnatoral ones, the prmal-dual method (PDM) has receved much attenton
More informationAn Accurate Evaluation of Integrals in Convex and Non convex Polygonal Domain by Twelve Node Quadrilateral Finite Element Method
Internatonal Journal of Computatonal and Appled Mathematcs. ISSN 89-4966 Volume, Number (07), pp. 33-4 Research Inda Publcatons http://www.rpublcaton.com An Accurate Evaluaton of Integrals n Convex and
More informationOverview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION
Overvew 2 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION Introducton Mult- Smulator MASIM Theoretcal Work and Smulaton Results Concluson Jay Wagenpfel, Adran Trachte Motvaton and Tasks Basc Setup
More informationCompiler 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 informationAnalysis 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 informationRepeater Insertion for Two-Terminal Nets in Three-Dimensional Integrated Circuits
Repeater Inserton for Two-Termnal Nets n Three-Dmensonal Integrated Crcuts Hu Xu, Vasls F. Pavlds, and Govann De Mchel LSI - EPFL, CH-5, Swtzerland, {hu.xu,vasleos.pavlds,govann.demchel}@epfl.ch Abstract.
More informationSLAM 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 informationA Load-balancing and Energy-aware Clustering Algorithm in Wireless Ad-hoc Networks
A Load-balancng and Energy-aware Clusterng Algorthm n Wreless Ad-hoc Networks Wang Jn, Shu Le, Jnsung Cho, Young-Koo Lee, Sungyoung Lee, Yonl Zhong Department of Computer Engneerng Kyung Hee Unversty,
More informationOptimization Methods: Integer Programming Integer Linear Programming 1. Module 7 Lecture Notes 1. Integer Linear Programming
Optzaton Methods: Integer Prograng Integer Lnear Prograng Module Lecture Notes Integer Lnear Prograng Introducton In all the prevous lectures n lnear prograng dscussed so far, the desgn varables consdered
More informationLoad 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 informationHigh-Boost Mesh Filtering for 3-D Shape Enhancement
Hgh-Boost Mesh Flterng for 3-D Shape Enhancement Hrokazu Yagou Λ Alexander Belyaev y Damng We z Λ y z ; ; Shape Modelng Laboratory, Unversty of Azu, Azu-Wakamatsu 965-8580 Japan y Computer Graphcs Group,
More informationCONFIGURATION 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 informationContent 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 informationCHAPTER 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 informationA Simple and Efficient Goal Programming Model for Computing of Fuzzy Linear Regression Parameters with Considering Outliers
62626262621 Journal of Uncertan Systems Vol.5, No.1, pp.62-71, 211 Onlne at: www.us.org.u A Smple and Effcent Goal Programmng Model for Computng of Fuzzy Lnear Regresson Parameters wth Consderng Outlers
More informationAn 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 informationModule 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 informationNatural Computing. Lecture 13: Particle swarm optimisation INFR /11/2010
Natural Computng Lecture 13: Partcle swarm optmsaton Mchael Herrmann mherrman@nf.ed.ac.uk phone: 0131 6 517177 Informatcs Forum 1.42 INFR09038 5/11/2010 Swarm ntellgence Collectve ntellgence: A super-organsm
More informationA Two-Stage Algorithm for Data Clustering
A Two-Stage Algorthm for Data Clusterng Abdolreza Hatamlou 1 and Salwan Abdullah 2 1 Islamc Azad Unversty, Khoy Branch, Iran 2 Data Mnng and Optmsaton Research Group, Center for Artfcal Intellgence Technology,
More informationK-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 informationClassifier 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 informationQuality 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 informationChinese Word Segmentation based on the Improved Particle Swarm Optimization Neural Networks
Chnese Word Segmentaton based on the Improved Partcle Swarm Optmzaton Neural Networks Ja He Computatonal Intellgence Laboratory School of Computer Scence and Engneerng, UESTC Chengdu, Chna Department of
More informationIntra-Parametric Analysis of a Fuzzy MOLP
Intra-Parametrc Analyss of a Fuzzy MOLP a MIAO-LING WANG a Department of Industral Engneerng and Management a Mnghsn Insttute of Technology and Hsnchu Tawan, ROC b HSIAO-FAN WANG b Insttute of Industral
More informationLobachevsky 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 informationHelsinki 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 informationMIXED INTEGER-DISCRETE-CONTINUOUS OPTIMIZATION BY DIFFERENTIAL EVOLUTION Part 1: the optimization method
MIED INTEGER-DISCRETE-CONTINUOUS OPTIMIZATION BY DIFFERENTIAL EVOLUTION Part : the optmzaton method Joun Lampnen Unversty of Vaasa Department of Informaton Technology and Producton Economcs P. O. Box 700
More informationImproving Classifier Fusion Using Particle Swarm Optimization
Proceedngs of the 7 IEEE Symposum on Computatonal Intellgence n Multcrtera Decson Makng (MCDM 7) Improvng Classfer Fuson Usng Partcle Swarm Optmzaton Kalyan Veeramachanen Dept. of EECS Syracuse Unversty
More informationLECTURE NOTES Duality Theory, Sensitivity Analysis, and Parametric Programming
CEE 60 Davd Rosenberg p. LECTURE NOTES Dualty Theory, Senstvty Analyss, and Parametrc Programmng Learnng Objectves. Revew the prmal LP model formulaton 2. Formulate the Dual Problem of an LP problem (TUES)
More informationA 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 informationClustering Algorithm Combining CPSO with K-Means Chunqin Gu 1, a, Qian Tao 2, b
Internatonal Conference on Advances n Mechancal Engneerng and Industral Informatcs (AMEII 05) Clusterng Algorthm Combnng CPSO wth K-Means Chunqn Gu, a, Qan Tao, b Department of Informaton Scence, Zhongka
More informationA 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 informationSupport Vector Machines
Support Vector Machnes Decson surface s a hyperplane (lne n 2D) n feature space (smlar to the Perceptron) Arguably, the most mportant recent dscovery n machne learnng In a nutshell: map the data to a predetermned
More informationHierarchical clustering for gene expression data analysis
Herarchcal clusterng for gene expresson data analyss Gorgo Valentn e-mal: valentn@ds.unm.t Clusterng of Mcroarray Data. Clusterng of gene expresson profles (rows) => dscovery of co-regulated and functonally
More informationMultiobjective fuzzy optimization method
Buletnul Ştnţfc al nverstăţ "Poltehnca" dn Tmşoara Sera ELECTRONICĂ ş TELECOMNICAŢII TRANSACTIONS on ELECTRONICS and COMMNICATIONS Tom 49(63, Fasccola, 24 Multobjectve fuzzy optmzaton method Gabrel Oltean
More information陳申岳 S-Y. Chen, 2007, Gradient-Based Structural and CFD Global Shape Optimization with SmartDO and the Response Smoothing Technology, Proceeding of
陳申岳 S-Y. Chen, 2007, Gradent-Based Structural and CFD Global Shape Optmzaton wth SmartDO and the Response Smoothng Technology, Proceedng of the 7 th World Congress of Structural and Multdscplnary Optmzaton
More informationMathematics 256 a course in differential equations for engineering students
Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the
More informationMulticriteria Decision Making
Multcrtera Decson Makng Andrés Ramos (Andres.Ramos@comllas.edu) Pedro Sánchez (Pedro.Sanchez@comllas.edu) Sonja Wogrn (Sonja.Wogrn@comllas.edu) Contents 1. Basc concepts 2. Contnuous methods 3. Dscrete
More informationAssembler. Building a Modern Computer From First Principles.
Assembler Buldng a Modern Computer From Frst Prncples www.nand2tetrs.org Elements of Computng Systems, Nsan & Schocken, MIT Press, www.nand2tetrs.org, Chapter 6: Assembler slde Where we are at: Human Thought
More informationSolving two-person zero-sum game by Matlab
Appled Mechancs and Materals Onlne: 2011-02-02 ISSN: 1662-7482, Vols. 50-51, pp 262-265 do:10.4028/www.scentfc.net/amm.50-51.262 2011 Trans Tech Publcatons, Swtzerland Solvng two-person zero-sum game by
More informationThe Research of Support Vector Machine in Agricultural Data Classification
The Research of Support Vector Machne n Agrcultural Data Classfcaton Le Sh, Qguo Duan, Xnmng Ma, Me Weng College of Informaton and Management Scence, HeNan Agrcultural Unversty, Zhengzhou 45000 Chna Zhengzhou
More informationImproving Low Density Parity Check Codes Over the Erasure Channel. The Nelder Mead Downhill Simplex Method. Scott Stransky
Improvng Low Densty Party Check Codes Over the Erasure Channel The Nelder Mead Downhll Smplex Method Scott Stransky Programmng n conjuncton wth: Bors Cukalovc 18.413 Fnal Project Sprng 2004 Page 1 Abstract
More informationStudy of key algorithms in topology optimization
Int J Adv Manuf Technol (2007) 32: 787 796 DOI 101007/s00170-005-0387-0 ORIGINAL ARTICLE Kong-Tan Zuo L-Png Chen Yun-Qng Zhang Jngzhou Yang Study of key algorthms n topology optmzaton Receved: 30 Aprl
More informationParallel Branch and Bound Algorithm - A comparison between serial, OpenMP and MPI implementations
Journal of Physcs: Conference Seres Parallel Branch and Bound Algorthm - A comparson between seral, OpenMP and MPI mplementatons To cte ths artcle: Luco Barreto and Mchael Bauer 2010 J. Phys.: Conf. Ser.
More informationMULTI-OBJECTIVE OPTIMIZATION OF TIME-COST-QUALITY USING MULTI-COLONY ANT ALGORITHM
ASIAN JOURNAL OF CIVIL ENGINEERING (BUILDING AND HOUSING) VOL. 8, NO. 2 (2007) PAGES 113-124 MULTI-OBJECTIVE OPTIMIZATION OF TIME-COST-QUALITY USING MULTI-COLONY ANT ALGORITHM A. Afshar, A. Kaveh and O.R.
More informationSimulation Based Analysis of FAST TCP using OMNET++
Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months
More informationDuality Search: A novel simple and efficient meta-heuristic algorithm. *Mohsen Shahrouzi 1)
Dualty Search: A novel smple and effcent meta-heurstc algorthm *Mohsen Shahrouz 1) 1) Engneerng Department, Kharazm Unversty, Tehran, Iran 1) shahruz@khu.ac.r ABSTRACT In ths artcle a novel meta-heurstc
More informationOptimal Design of Nonlinear Fuzzy Model by Means of Independent Fuzzy Scatter Partition
Optmal Desgn of onlnear Fuzzy Model by Means of Independent Fuzzy Scatter Partton Keon-Jun Park, Hyung-Kl Kang and Yong-Kab Km *, Department of Informaton and Communcaton Engneerng, Wonkwang Unversty,
More informationCHAPTER 3 SEQUENTIAL MINIMAL OPTIMIZATION TRAINED SUPPORT VECTOR CLASSIFIER FOR CANCER PREDICTION
48 CHAPTER 3 SEQUENTIAL MINIMAL OPTIMIZATION TRAINED SUPPORT VECTOR CLASSIFIER FOR CANCER PREDICTION 3.1 INTRODUCTION The raw mcroarray data s bascally an mage wth dfferent colors ndcatng hybrdzaton (Xue
More informationEfficient Load-Balanced IP Routing Scheme Based on Shortest Paths in Hose Model. Eiji Oki May 28, 2009 The University of Electro-Communications
Effcent Loa-Balance IP Routng Scheme Base on Shortest Paths n Hose Moel E Ok May 28, 2009 The Unversty of Electro-Communcatons Ok Lab. Semnar, May 28, 2009 1 Outlne Backgroun on IP routng IP routng strategy
More informationLecture 5: Multilayer Perceptrons
Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented
More informationParallel matrix-vector multiplication
Appendx A Parallel matrx-vector multplcaton The reduced transton matrx of the three-dmensonal cage model for gel electrophoress, descrbed n secton 3.2, becomes excessvely large for polymer lengths more
More informationAdaptive Virtual Support Vector Machine for the Reliability Analysis of High-Dimensional Problems
Proceedngs of the ASME 2 Internatonal Desgn Engneerng Techncal Conferences & Computers and Informaton n Engneerng Conference IDETC/CIE 2 August 29-3, 2, Washngton, D.C., USA DETC2-47538 Adaptve Vrtual
More informationFitting: Deformable contours April 26 th, 2018
4/6/08 Fttng: Deformable contours Aprl 6 th, 08 Yong Jae Lee UC Davs Recap so far: Groupng and Fttng Goal: move from array of pxel values (or flter outputs) to a collecton of regons, objects, and shapes.
More informationCost-efficient deployment of distributed software services
1/30 Cost-effcent deployment of dstrbuted software servces csorba@tem.ntnu.no 2/30 Short ntroducton & contents Cost-effcent deployment of dstrbuted software servces Cost functons Bo-nspred decentralzed
More informationX- Chart Using ANOM Approach
ISSN 1684-8403 Journal of Statstcs Volume 17, 010, pp. 3-3 Abstract X- Chart Usng ANOM Approach Gullapall Chakravarth 1 and Chaluvad Venkateswara Rao Control lmts for ndvdual measurements (X) chart are
More informationBackpropagation: In Search of Performance Parameters
Bacpropagaton: In Search of Performance Parameters ANIL KUMAR ENUMULAPALLY, LINGGUO BU, and KHOSROW KAIKHAH, Ph.D. Computer Scence Department Texas State Unversty-San Marcos San Marcos, TX-78666 USA ae049@txstate.edu,
More informationGeneral Vector Machine. Hong Zhao Department of Physics, Xiamen University
General Vector Machne Hong Zhao (zhaoh@xmu.edu.cn) Department of Physcs, Xamen Unversty The support vector machne (SVM) s an mportant class of learnng machnes for functon approach, pattern recognton, and
More informationStraight Line Detection Based on Particle Swarm Optimization
Sensors & ransducers 013 b IFSA http://www.sensorsportal.com Straght Lne Detecton Based on Partcle Swarm Optmzaton Shengzhou XU, Jun IE College of computer scence, South-Central Unverst for Natonaltes,
More informationLearning-Based Top-N Selection Query Evaluation over Relational Databases
Learnng-Based Top-N Selecton Query Evaluaton over Relatonal Databases Lang Zhu *, Wey Meng ** * School of Mathematcs and Computer Scence, Hebe Unversty, Baodng, Hebe 071002, Chna, zhu@mal.hbu.edu.cn **
More information