GHHAGA for Environmental Systems Optimization
|
|
- Dayna Chandler
- 5 years ago
- Views:
Transcription
1 GHHAGA for Envronmental Systems Optmzaton X. H. Yang *, Z. F. Yang, and Z. Y. Shen State Key Laboratory of Water Envronment Smulaton, School of Envronment, Beng Normal Unversty, Beng 00875, Chna Key Laboratory for Water and Sedment Scences Mnstry of Educaton, School of Envronment, Beng Normal Unversty, Beng 00875, Chna ABSTRACT. The global optmzaton of complcated nonlnear systems s mathematcally ntractable and such an optmzaton extensvely exsts n scence and engneerng. Once an obectve functon has many local extreme ponts, the tradtonal optmzaton methods may not obtan the global optmzaton effcently. A genetc algorthm (GA) based on the genetc evoluton of a speces provdes a robust procedure to explore broad and promsng regons of solutons and to avod beng trapped at the local optmzaton. However, the computatonal amount s very large. To reduce computatons and to mprove the computatonal accuracy, a method based on the two-pont crossover and two-pont mutaton of the hybrd acceleratng genetc algorthm wth Hooke-Jeeves searchng operator s developed for systems optmzaton. Wth the shrnkng of searchng range, the method gradually drects to optmal result by the excellent ndvduals obtaned by Gray code genetc algorthm embeddng wth Hooke-Jeeves searchng operator and Hooke-Jeeves algorthm. The effcency of the new algorthm s verfed by applcaton of several test functons. The comparson of our GA wth sx other algorthms s presented. Ths algorthm overcomes the Hammng-clff phenomena n other exstng genetc methods, and t s very effcent for the gven envronmental systems optmzaton. Key words: Genetc algorthm, Gray code, Hooke-Jeeves algorthm, Global optmzaton, Envronmental systems * Correspondng author: yxh@sohu.com 转载
2 . Introducton The global optmzaton of complcated nonlnear systems s ntractable mathematcally and such an optmzaton extensvely exsts n scence and engneerng. Fndng the mnmum of a nonlnear functon of one varable, wthout any constrans, can be challengng, too. A severe dffculty arses f the functon n queston has many purely local mnma, because what one really wants s a global mnmum pont (Davd et al., 003). Once an obectve functon has many local extreme ponts, the tradtonal optmzaton methods may not obtan the global optmzaton effcently. A genetc algorthm (GA) based on the genetc evoluton of a speces was proposed by Holland (Holland 975). The detaled genetc algorthm and mplementaton were gven by Goldberg (Goldberg 989). De Jong showed that the standard bnary-encoded GA (SGA) could consttute an nterestng alternatve to perform the global optmzaton of a functon dependng on several contnuous varables (Jong, 975; Andre et al., 00). Ths algorthm provdes a robust procedure to explore broad and promsng regons of solutons, and to avod beng trapped at the local optmzaton (e.g.,yang et al.,004; Leung et al., 00). Expermental results show that GAs can solve a lot of dffcult problems (Bessaou et al., 00) through an approprate choce of representaton patterns of elements of the search space and operators. However, the computatonal amount s very large and premature convergence phenomena exst n SGA. To reduce computatons and mprove the computng precson, the bnary-encoded acceleratng genetc algorthm, real-encoded genetc algorthm and nteger-encoded genetc algorthm were developed (Jn et al., 000; Jankow et al., 99; Renders et al., 996). However, these genetc algorthms cannot be effectvely appled for the global optmzaton of contnuous varable n complcated nonlnear systems. The Hammng dstance between two closest ntegers n bnary code s very large. For nstance, ntegers 63 and 64 are expressed by the 00 and n bnary code, respectvely. All of the codes must be changed f we turn 63 nto 64 n bnary code. Ths operaton depresses the effcency of the genetc algorthms. Ths phenomenon s termed the Hammng clff. To solve the above Hammng clff problem, SGA was mproved wth gray encodng of parameters (e.g., Andre et al., 00; Yang et al., 003). The ntegers 63 and 64 are expressed by and n Gray code, respectvely. The Gray-encoded genetc algorthm (GGA) can partly overcome the Hammng clff of bnary code (Zhong et al., 00). But the Gray-encoded genetc algorthm needs approprate operators, and the mathematcal theory of ths algorthm has not been developed at
3 present. It was found that ths algorthm stll needs a large amount of computaton (Yang, 00). So GGA should be mproved and developed. In ths paper, a Gray-encoded, Hooke-Jeeves (Hooke et al., 96), hybrd acceleratng genetc algorthm (GHHAGA) s presented to reduce computatons and to mprove the computatonal precson. Ths approach wll be appled to fve nonlnear functons for verfcaton and two envronmental systems optmzaton.. The Descrptons of GHHAGA The GHHAGA starts wth an ntal populaton of n ndvduals : each ndvdual s composed of Gray code, respectvely assocated wth the varables of the obectve functon at hand. Then evoluton starts and genetc operatons are consttuted. The reproducton operators are appled to ths populaton; offsprng are created from parents. The new populaton s consttuted n selectng the best ndvduals. After two-pont crossover and two-pont mutaton, the new ndvduals are created. And output of the best pont s further found by the Hooke-Jeeves algorthm (Hooke et al., 96) around the above best ndvdual (pont). The new best pont nsde the offsprng wll be nserted to replace the worst one n the prevous phase. Repeat the above genetc operatons untl the evoluton tmes Q s met. The new ntervals are gotten from the varable ranges of n s -excellent ndvduals by Q -tmes of the Hooke-Jeeves evoluton, and then the whole process back to the Gray-encodng. Fnally, the most excellent chromosome currently s the optmum soluton of GHHAGA... Steps of GHHAGA Consder the followng nonlnear optmzaton problem: mn f ( x, x,, x n ) () s.t. where x { x, =,,..., } a p = n p, functon and f 0. x b, for =,,, p Steps of GHHAGA are gven as follows. Step. Gray encodng. n, x s a varable to be optmzed, f s an obectve 3
4 An e-bt Gray varable s used to represent one varable x. The nteger of the e Gray varable ranges from 0 to, and t can be mapped lnearly to the varable range a, b ]. The th varable range s the nterval a, b ], and then each nterval s [ [ e dvded nto sub- ntervals: x = a + I Δx () e where Δx = ( b a ) /( ). The Gray code array of the th varable s denoted by the grd ponts of { d, k) k,,..., e} ( = (Yang et al., 003): I e e m ( d(, k)), (3) m= k= m = Step. Generatng ntal father populaton. Intally, the chromosomes are generated at random n Gray-encoded genetc algorthm, and n-chromosomes n father populaton are: I e ( ) = nt( u(, ) ) for =,,..., n p ; =,,..., n, (4) where u (, ) s unformty random number, u(, ) [0,], I () s searchng locaton, nt ( ) s an nteger functon. From Eq.(3), the n-correspondng chromosomes are d (, k, ) for =,,..., n p ; k =,,..., e; =,,..., n. To cover homogeneously the whole soluton space and to avod the rsk of havng too much ndvduals n the same regon, a large unformty random populaton s selected n ths algorthm. Step 3. ftness evaluaton. The ftness functon F() of th chromosome s defned: F ( ) = [ f ( )] + (5) 0. Step 4. Selecton. The chromosomes n the ntal father populaton are selected by a known probablty p s () as s n p ( ) = F( ) / F( ), (6) = Such two groups of n -chromosomes are selected by the above probabltes. 4
5 Step 5. Two-pont crossover. For two-pont crossover, two crossng ponts are randomly chosen, and two ndvduals d(, k, ), d (, k, ) are gotten by the crossng probablty p c. In order to enhance the dversty of populaton, the crossng probablty s set as Step 6. Two-pont mutaton. p c =. For two-pont mutaton, two mutatng ponts are randomly chosen, and a new offsprng d 3 (, k, ) can be computed by a mutatng probablty p m (Yang et al., 003). Step 7. Hooke-Jeeves evoluton. The Hooke-Jeeves algorthm s a useful, local descent algorthm, whch does not make use of the obectve functon dervatves (Hooke et al., 96). The best pont n the prevous phase becomes a new ntal soluton n the Hooke-Jeeves algorthm, and then a new best pont s obtaned by ths Hooke-Jeeves algorthm. The new best pont nsde the offsprng wll be nserted to replace the worst one n the prevous phase. Repeat step3 to step 7 untl the evoluton tmes Q or termnaton crtera s met. Step 8. Acceleratng cycle. The varable ranges of n s -excellent ndvduals obtaned by Q -tmes of the Hooke-Jeeves evoluton become the new ranges of the varables, and then the whole process back to the Gray-encodng. The computaton process s over untl the obectve functon value gets to an expected value, or algorthm runnng tmes gets to the desgn T tmes. Heren, the most excellent chromosome currently s the optmum soluton of GHHAGA. A pseudo code of GHHAGA s gven n Fgure. ================================================ Begn For t=0 to T (acceleraton cycle tmes t) t t Gve varable nterval [ a, b ] Gray encodng q=0 Intalze populaton Pop(q,t) Whle (q Q) do (evoluton tmes q) For = to n do Evaluate ftness of Pop (q,t) 5
6 Endfor For = to n do Select operaton to Pop(q,t) Endfor For = to n do Two-pont crossover operaton to Pop(q,t) Endfor For = to n do Two-pont Mutaton operaton to Pop(q,t) Endfor Hooke-Jeeves evoluton Endwhle t+ t+ Get new varable nterval [ a, b ] from the varable ranges of n s -excellent ndvduals n Pop (,t), Pop (,t),, Pop (Q,t) Endfor End ================================================= Fg.. Pseudo code for GHHAGA.. GHHAGA Theory We now turn to the analyss of the behavor of our algorthm when t s appled to problem (). The GHHAGA s convergent (Yang, 00). The global optmzaton of the GHHAGA s not only accurate but also stable. Let the Hooke-Jeeves evoluton tmes be Q, the number of excellent ndvduals be n s,the number of optmzed varable be p and the tmes of acceleratng cycle be T, the probablty p 0 of Qns excellent ndvduals surround the optmum pont s p0 ( ) pt =. The GHHAGA s global convergence wth probablty p 0 = when n p =0, t=5, n s =0, Q=5; n p =30, t=0, n s =0, Q=5, etc. 6
7 3. Expermentaton 3.. Crtera Three man crtera are very mportant when tryng to determne the performances of an algorthm: convergence, speed and robustness (Andre et al., 00). The parameters of the GHHAGA are selected as follows: The length e =0, populaton sze n = 300, the number of excellent ndvduals n = 0, the tmes of Hooke-Jeeves evoluton Q=5, the crossover probablty p c =.0 s, the mutaton probablty p =0.5,and the tmes of Hooke-Jeeves searchng m 300. m The global optmzaton of fve test functons (Andre et al., 00) s accomplshed by usng the followng methods: Standard bnary-encoded GA (SGA) (Andre et al., 00) and GHHAGA. To compare wth the global optmzaton ablty of the above algorthms obectvely, one of the three followng termnaton crtera s used for ensurng the optmzaton precson and avodng algorthm nvaldaton. Crtera one: The relatve error E rel between the result f lg calculated by the a o algorthm and the optmum value f exact of each test functon s used each tme f t s possble: E rel = fa lg o f f exact exact (7) Crtera two: When the optmum value s 0, t s no longer possble to use ths expresson, so we calculate the absolute error E abs as follows: E abs = f f (8) a lg o exact Here we let the absolute error or relatve error n neghbor generatons be less than or equal 0 -. Crtera three: The total computaton number for the functons s less than or equal Expermentaton and Result To test our GHHAGA, the followng fve analytcal test functons were used. 7
8 Goldprce: f ( x, y) = [ + ( x + y + ) (9 4x + 3x 4y + 6xy + 3y [30 + (x 3y) (8 3x + x + 48y 36xy + 7y where x, y )] )] Hartman : f ( x) = 4 c exp[ 6 = = a ( x p ) ] where 0 x, for =,,6 wth x=(x,,x 3 ), p = p,..., p ), a = ( a,..., a ) ( 6 6 a c p Hosc45: f ( x) = 0 = n! x where x = x,..., x ), and 0 x,n=0 ( 0 Brown : 3 0( x x + ) f ( x) = [ ( x 3)] + [0 ( x 3) ( x x+ ) + e ] J J where J={,3,...,9}, x 4,for 0 and x = x,..., x ] [ 0 T F5n: 9 f x) = 0. sn (3π x ) + [( x ) = ( + sn (3πx + ))] + 0.( x0 ) [ + sn (πx )] ( 0 where 0 x 0,for 0 and x = x,..., x ] [ 0 T 8
9 Ths set of classcal test functons, very often used n the lterature (Andre et al., 00;Bessaou et al., 00), ncludes some functons havng the followng features: Contnuous/dscontnuous; Convex/non-convex; Unmodal/multmodal; Quadratc/non-quadratc; Low dmenson/hgh dmenson. The effcency of the algorthm s quantfed by: The rate of success; The number of evaluatons of the obectve functon; The error between the calculated soluton and the global optmum value of the functon. Because of the stochastc nature of GAs, the dscusson of results derved from one sngle executon of the algorthm s meanngless (Bessaou et al., 00). So all results reported n ths secton are obtaned by averagng the results from 00 executons per functon. The computaton results of the fve nonlnear test functons are gven n Table wth the GHHAGA. It s obvously observed that the GHHAGA s the best one both n effcency (see success rate and number of evaluaton of the functons n Table ) and n accuracy (see mnmum found n Table ) compared wth exstng algorthms. The results gven n Table show that the global optmum value can be gotten for the fve test functons and the Hammng clff phenomena are avoded n GHHAGA. Table. Results wth the SGA (Andre et al., 00) and the GHHAGA Name of the Theoretcal Mnmum found Number of evaluaton of Success rate % functons mnmum the functons SGA GHHAGA SGA GHHAGA SGA GHHAGA Goldprce Hartman Hosc Brown
10 F5n We have performed a comparson of our GA wth sx other methods lsted n Table : pure random search (PRS) ( Anderssen et al., 97), multstart (MS) (Rnnoy et al., 987), smulated dffuson (SD) (Aluff et al., 985), smulated annealng (SA) (Andre et al., 00), tabu search (TS) (Cvovc et al., 995) and bnary-encoded genetc algorthm (GA) (Andre et al., 00). The effcency was qualfed by use of the number of functon evaluatons to fnd the global optmum. Each program was stopped as soon as the relatve error between the best pont found and the known global optmum was less than %. The number of functon evaluatons used by the varous algorthms to optmze test functons s lsted n Table. The results of our GA are satsfed (see the numbers of functon evaluatons n Table ). In addton, our results were the average outcome of 00 ndependent runs; for some publshed methods, the tmes of runs was equal to 4 or unspecfed (Andre et al., 00). Table. Number of functon evaluatons on global optmzaton of two functons wth the seven dfferent methods Method Name The number of functon evaluaton Goldprce Hartman PRS Pure random search MS Multstart SD Smulated dffuson SA Smulated annealng TS Tabu search GA Bnary-encoded genetc algorthm GHHAGA Gray-encoded, Hooke-Jeeves, acceleratng hybrd genetc algorthm 0
11 4. Applcaton Example. The wastewater treatment cost tme seres as a dynamcal system optmzaton s consdered to satsfy at y( t) = A K /( + be ) (9), where y (t) s the computed value of wastewater treatment cost n the tth year, unt: 0 4 US$. A, K, b, a are optmzaton parameters. The observaton data can be seen lterature (Jn, 000). Ths obectve functon s as follows: h = n = ( y( t ) y ), (0) where y s the observaton value of the wastewater treatment cost n the t th year, unt: 0 4 US$, n s the total number of observaton data. The least resdual square sum h s wth GHHAGA. GHHAGA runs second for optmzaton of ths model only. The computatonal results of the above model are gven n Table 3. For the GHHAGA, the evaluaton number of the obectve functon s 400. For adaptve acceleratng genetc algorthm (AAGA) (Yang, 00), the evoluton number s For bnary-encoded acceleratng genetc algorthm (BAGA) (Jn, 000), the evoluton number s The comparson of the above methods can be observed n Table 3. The results of our GHHAGA are satsfyng both n effcency and n accuracy. Table 3. The calculatng result wth several methods for the dynamcal optmzaton problem Method Evaluaton Parameters number for h A K b a Least mean square sum h Intal nterval 0 [500,700] [00,300] [5, 8] [0, ] GHHAGA AAGA BAGA Example. The forecast problem of the sedment concentraton n Gongzu reservor as a system optmzaton s consdered to satsfy
12 u s ( t) = c + t () cx( t) + cx( t) c3x( ) where u s (t) s the smulated value of the sedment concentraton n Gongzu reservor n the tth year, Qn ( t) Qup ( t) x( t) =, Q up (t) s the runoff of upstream reservor and 000 Q n (t) s the nflow nto Gongzu reservor n the tth year, c 0, c, c, c3 are optmzaton parameters. The observaton data can be seen n Jn s lterature (Jn, 000). The amount of the sedment concentraton nto Gongzu reservor s one of the most mportant elements n decdng the runnng of the Gongzu reservor. The obectve functon s gven as follows: mn f = n = [( us u ) ( u + ) + ψ ( us )], () u and 0, us 0 ψ ( us ) = (3) 500, us < 0 where u and u s are the observaton value and the smulated value of the sedment concentraton n Gongzu reservor n the t th year, respectvely; n s the number of observaton data; ψ u ) s a penalty functon. ( s The obectve functon f s wth GHHAGA. For the GHHAGA, the evaluaton number of the obectve functon s 800. For bnary-encoded acceleratng genetc algorthm (BAGA) (Jn, 000), the evaluaton number of the obectve functon s 0500, and the obectve functon f s 33.. The result of GHHAGA s gven n Table 4. From Table 4, we can conclude that our GHHAGA s hghly effectve n optmzaton. From above two examples, we fnd that the number of obectve functon of GHHAGA s less than those obtaned by the other GAs technque. The precson of GHHAGA has been mproved by Gray encodng. The convergence of GHHAGA has also been consderably mproved by provdng new ntal nterval nformaton n acceleratng cycle. And ts computatonal amount s very small. Ths GHHAGA has overcome the Hammng-clff phenomena n exstng genetc methods.
13 Table 4. The calculatng result for the sedment concentraton n Gongzu reservor wth GHHAGA Evaluaton Number for f Parameters c 0 c c c 3 Obectve functon f 0 [-5, 5] [-5, 5] [-5, 5] [-5, 5] Conclusons In ths paper, a new method, GHHAGA s proposed to solve the nonlnear optmzaton problems. The correspondng global convergence of the new genetc algorthm s analyzed. Because the steps of Gray-encodng, Hooke-Jeeves hybrd searchng operator and acceleratng cycle are adopted, the effcency and accuracy of the new algorthm are very hgh compared to exstng algorthms. GHHAGA has been appled to fve nonlnear test functons and two envronmental systems optmzaton. Based on the comparsons and the applcaton, the proposed algorthm shows good performances for contnuous varable optmzaton of nonlnear systems. It overcomes the Hammng-clff phenomena n other exstng genetc methods. Our avenue for the future s adaptng the algorthm to perform a mult-obectve optmzaton for envronmental systems. Acknowledgement. Ths work was supported by Foundaton tem: Natonal Key Proect for Basc Research, No. 003CB4504. References Davd, K. and Ward, C. (003). Numercal analyss: mathematcs of scentfc computng. Chna Machne. Holland, J.H. (975). Adaptaton n natural and artfcal systems. Unversty of Mchgan. Goldberg, D, E. (989). Genetc algorthms: search, optmzaton and machne learnng. Addson-Wesley. Jong, D. (975). An analyss of the behavor of a class of genetc adaptve systems. Ph.D. Dssertaton, Unversty of Mchgan, Ann Arbor, MI.,USA. Andre, J., Sarry, P. and Dognon, T. (00). An mprovement of the standard genetc algorthm fghtng premature convergence n contnuous optmzaton. Advances 3
14 n Engneerng Software. 3, Bessaou, M., Sarry, P.(00). A new tool n electrostatcs usng a really-coded multpopulaton genetc algorthm tuned through analytcal test problem. Advances n Engneerng Software. 3, Yang, X.H., Yang, Z.F., Shen, Z.Y. and L, J.Q.(004). An deal nterval method of mult-obectve decson-makng for comprehensve assessment of water resources renewablty. Scence n Chna seres E-engneerng & materals scence. 47 (Suppl. S), Leung, Y. W. and Wang, Y. P. (00). An orthogonal genetc algorthm wth quantzaton for global numercal optmzaton, IEEE Trans, On Evolutonary Computaton. 5(), Jankow, C. Z. and Mchalewcz, Z. (99). An expermental comparson of bnary and floatng pont representaton n genetc algorthms. Proceedngs of the Fourth Internatonal Conference on Genetc Algorthms, San Francsco, pp Renders, J. M. and Flasse, S. P. (996). Hybrd methods usng genetc algorthms for global optmzaton. IEEE Trans Systems, Man Cybernetcs part B: Cybernetcs. 6(), Yang, L. N., We, G. M., Guo, K. and Luo, J. S. (003). Applcaton genetc algorthms wth ntal group floatng for mxed nteger nonlnear programmng. Computng technques for geophyscal and geochemcal exploraton. 5(3), Yang, X. H.,Lu, G. H.,Yang, Z. F. and L, J. Q. (003). Gray codng based acceleratng genetc algorthm and ts theory. Theory and Practce for System Engneer. 3(3), Zhong, M. and Sun, S. D. (00). Genetc algorthms: theory and applcatons. Beng Defense Industry. Yang, X. H. (00). Study on Parameter Optmzaton Algorthm and ts Applcaton n Hydrologcal Model. Ph.D. Dssertaton, School of Water Resources and Envronment, Hoha Unversty, Nanng, Chna. Hooke, R. and Jeeves, T. A. (96). Drect search soluton of numercal and statstcal problems. J. Ass. Comput. Mach.. 8, -9. Anderssen, R. S., Jennngs, L.S. and Ryan, D. M. (97). Optmzaton. Unversty of Queensland. Rnnoy, K. and Tmmer, G.T. (987). Stochastc global optmzaton methods. Mathematcal Programmng. 39,
15 Aluff, P. F., Pars, V and Zlll, F. (985). Global optmzaton and stochastc dfferental equatons. J. Opt. Theor. Appl.. 47, -6. Jn, J. L., Dng, J. (000). Genetc algorthm and ts applcatons to water scence. Schuan: Schuan unversty. Cvovc, D. and Klnowsk, J. (995). Taboo search: an approach to the multple mnma problem. Scence. 67,
The Study of Teaching-learning-based Optimization Algorithm
Advanced Scence and Technology Letters Vol. (AST 06), pp.05- http://dx.do.org/0.57/astl.06. The Study of Teachng-learnng-based Optmzaton Algorthm u Sun, Yan fu, Lele Kong, Haolang Q,, Helongang Insttute
More informationChapter 2 Real-Coded Adaptive Range Genetic Algorithm
Chapter Real-Coded Adaptve Range Genetc Algorthm.. Introducton Fndng a global optmum n the contnuous doman s challengng for Genetc Algorthms (GAs. Tradtonal GAs use the bnary representaton that evenly
More informationA New Evolutionary Computation Based Approach for Learning Bayesian Network
Avalable onlne at www.scencedrect.com Proceda Engneerng 15 (2011) 4026 4030 Advanced n Control Engneerng and Informaton Scence A New Evolutonary Computaton Based Approach for Learnng Bayesan Network Yungang
More informationMarkov Chain Monte Carlo Lecture 6
where (x 1,..., x N ) X N, N s called the populaton sze, f(x) f (x) for at least one {1, 2,..., N}, and those dfferent from f(x) are called the tral dstrbutons n terms of mportance samplng. Dfferent ways
More informationUsing Immune Genetic Algorithm to Optimize BP Neural Network and Its Application Peng-fei LIU1,Qun-tai SHEN1 and Jun ZHI2,*
Advances n Computer Scence Research (ACRS), volume 54 Internatonal Conference on Computer Networks and Communcaton Technology (CNCT206) Usng Immune Genetc Algorthm to Optmze BP Neural Network and Its Applcaton
More informationSpeeding up Computation of Scalar Multiplication in Elliptic Curve Cryptosystem
H.K. Pathak et. al. / (IJCSE) Internatonal Journal on Computer Scence and Engneerng Speedng up Computaton of Scalar Multplcaton n Ellptc Curve Cryptosystem H. K. Pathak Manju Sangh S.o.S n Computer scence
More informationDesign and Optimization of Fuzzy Controller for Inverse Pendulum System Using Genetic Algorithm
Desgn and Optmzaton of Fuzzy Controller for Inverse Pendulum System Usng Genetc Algorthm H. Mehraban A. Ashoor Unversty of Tehran Unversty of Tehran h.mehraban@ece.ut.ac.r a.ashoor@ece.ut.ac.r Abstract:
More informationComparison of the Population Variance Estimators. of 2-Parameter Exponential Distribution Based on. Multiple Criteria Decision Making Method
Appled Mathematcal Scences, Vol. 7, 0, no. 47, 07-0 HIARI Ltd, www.m-hkar.com Comparson of the Populaton Varance Estmators of -Parameter Exponental Dstrbuton Based on Multple Crtera Decson Makng Method
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationThe Convergence Speed of Single- And Multi-Objective Immune Algorithm Based Optimization Problems
The Convergence Speed of Sngle- And Mult-Obectve Immune Algorthm Based Optmzaton Problems Mohammed Abo-Zahhad Faculty of Engneerng, Electrcal and Electroncs Engneerng Department, Assut Unversty, Assut,
More informationVQ widely used in coding speech, image, and video
at Scalar quantzers are specal cases of vector quantzers (VQ): they are constraned to look at one sample at a tme (memoryless) VQ does not have such constrant better RD perfomance expected Source codng
More informationParticle Swarm Optimization with Adaptive Mutation in Local Best of Particles
1 Internatonal Congress on Informatcs, Envronment, Energy and Applcatons-IEEA 1 IPCSIT vol.38 (1) (1) IACSIT Press, Sngapore Partcle Swarm Optmzaton wth Adaptve Mutaton n Local Best of Partcles Nanda ulal
More informationMulti-Robot Formation Control Based on Leader-Follower Optimized by the IGA
IOSR Journal of Computer Engneerng (IOSR-JCE e-issn: 2278-0661,p-ISSN: 2278-8727, Volume 19, Issue 1, Ver. III (Jan.-Feb. 2017, PP 08-13 www.osrjournals.org Mult-Robot Formaton Control Based on Leader-Follower
More informationSolving of Single-objective Problems based on a Modified Multiple-crossover Genetic Algorithm: Test Function Study
Internatonal Conference on Systems, Sgnal Processng and Electroncs Engneerng (ICSSEE'0 December 6-7, 0 Duba (UAE Solvng of Sngle-objectve Problems based on a Modfed Multple-crossover Genetc Algorthm: Test
More informationA Bayes Algorithm for the Multitask Pattern Recognition Problem Direct Approach
A Bayes Algorthm for the Multtask Pattern Recognton Problem Drect Approach Edward Puchala Wroclaw Unversty of Technology, Char of Systems and Computer etworks, Wybrzeze Wyspanskego 7, 50-370 Wroclaw, Poland
More informationComputing Correlated Equilibria in Multi-Player Games
Computng Correlated Equlbra n Mult-Player Games Chrstos H. Papadmtrou Presented by Zhanxang Huang December 7th, 2005 1 The Author Dr. Chrstos H. Papadmtrou CS professor at UC Berkley (taught at Harvard,
More informationA PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS
HCMC Unversty of Pedagogy Thong Nguyen Huu et al. A PROBABILITY-DRIVEN SEARCH ALGORITHM FOR SOLVING MULTI-OBJECTIVE OPTIMIZATION PROBLEMS Thong Nguyen Huu and Hao Tran Van Department of mathematcs-nformaton,
More informationOperating conditions of a mine fan under conditions of variable resistance
Paper No. 11 ISMS 216 Operatng condtons of a mne fan under condtons of varable resstance Zhang Ynghua a, Chen L a, b, Huang Zhan a, *, Gao Yukun a a State Key Laboratory of Hgh-Effcent Mnng and Safety
More informationCHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE
CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng
More informationInteractive Bi-Level Multi-Objective Integer. Non-linear Programming Problem
Appled Mathematcal Scences Vol 5 0 no 65 3 33 Interactve B-Level Mult-Objectve Integer Non-lnear Programmng Problem O E Emam Department of Informaton Systems aculty of Computer Scence and nformaton Helwan
More informationUsing T.O.M to Estimate Parameter of distributions that have not Single Exponential Family
IOSR Journal of Mathematcs IOSR-JM) ISSN: 2278-5728. Volume 3, Issue 3 Sep-Oct. 202), PP 44-48 www.osrjournals.org Usng T.O.M to Estmate Parameter of dstrbutons that have not Sngle Exponental Famly Jubran
More informationMarkov Chain Monte Carlo (MCMC), Gibbs Sampling, Metropolis Algorithms, and Simulated Annealing Bioinformatics Course Supplement
Markov Chan Monte Carlo MCMC, Gbbs Samplng, Metropols Algorthms, and Smulated Annealng 2001 Bonformatcs Course Supplement SNU Bontellgence Lab http://bsnuackr/ Outlne! Markov Chan Monte Carlo MCMC! Metropols-Hastngs
More informationCOMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
Avalable onlne at http://sck.org J. Math. Comput. Sc. 3 (3), No., 6-3 ISSN: 97-537 COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
More informationAn improved multi-objective evolutionary algorithm based on point of reference
IOP Conference Seres: Materals Scence and Engneerng PAPER OPEN ACCESS An mproved mult-objectve evolutonary algorthm based on pont of reference To cte ths artcle: Boy Zhang et al 08 IOP Conf. Ser.: Mater.
More informationDETERMINATION OF TEMPERATURE DISTRIBUTION FOR ANNULAR FINS WITH TEMPERATURE DEPENDENT THERMAL CONDUCTIVITY BY HPM
Ganj, Z. Z., et al.: Determnaton of Temperature Dstrbuton for S111 DETERMINATION OF TEMPERATURE DISTRIBUTION FOR ANNULAR FINS WITH TEMPERATURE DEPENDENT THERMAL CONDUCTIVITY BY HPM by Davood Domr GANJI
More informationDifferential Evolution Algorithm with a Modified Archiving-based Adaptive Tradeoff Model for Optimal Power Flow
1 Dfferental Evoluton Algorthm wth a Modfed Archvng-based Adaptve Tradeoff Model for Optmal Power Flow 2 Outlne Search Engne Constrant Handlng Technque Test Cases and Statstcal Results 3 Roots of Dfferental
More informationarxiv: v1 [math.oc] 3 Aug 2010
arxv:1008.0549v1 math.oc] 3 Aug 2010 Test Problems n Optmzaton Xn-She Yang Department of Engneerng, Unversty of Cambrdge, Cambrdge CB2 1PZ, UK Abstract Test functons are mportant to valdate new optmzaton
More informationThin-Walled Structures Group
Thn-Walled Structures Group JOHNS HOPKINS UNIVERSITY RESEARCH REPORT Towards optmzaton of CFS beam-column ndustry sectons TWG-RR02-12 Y. Shfferaw July 2012 1 Ths report was prepared ndependently, but was
More informationKernel Methods and SVMs Extension
Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general
More informationGeneralized Linear Methods
Generalzed Lnear Methods 1 Introducton In the Ensemble Methods the general dea s that usng a combnaton of several weak learner one could make a better learner. More formally, assume that we have a set
More informationSolving Nonlinear Differential Equations by a Neural Network Method
Solvng Nonlnear Dfferental Equatons by a Neural Network Method Luce P. Aarts and Peter Van der Veer Delft Unversty of Technology, Faculty of Cvlengneerng and Geoscences, Secton of Cvlengneerng Informatcs,
More informationConstrained Evolutionary Programming Approaches to Power System Economic Dispatch
Proceedngs of the 6th WSEAS Int. Conf. on EVOLUTIONARY COMPUTING, Lsbon, Portugal, June 16-18, 2005 (pp160-166) Constraned Evolutonary Programmng Approaches to Power System Economc Dspatch K. Shant Swarup
More informationAn Improved Clustering Based Genetic Algorithm for Solving Complex NP Problems
Journal of Computer Scence 7 (7): 1033-1037, 2011 ISSN 1549-3636 2011 Scence Publcatons An Improved Clusterng Based Genetc Algorthm for Solvng Complex NP Problems 1 R. Svaraj and 2 T. Ravchandran 1 Department
More informationAnnexes. EC.1. Cycle-base move illustration. EC.2. Problem Instances
ec Annexes Ths Annex frst llustrates a cycle-based move n the dynamc-block generaton tabu search. It then dsplays the characterstcs of the nstance sets, followed by detaled results of the parametercalbraton
More informationEEE 241: Linear Systems
EEE : Lnear Systems Summary #: Backpropagaton BACKPROPAGATION The perceptron rule as well as the Wdrow Hoff learnng were desgned to tran sngle layer networks. They suffer from the same dsadvantage: they
More informationNUMERICAL DIFFERENTIATION
NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the
More informationCHAPTER 2 MULTI-OBJECTIVE GENETIC ALGORITHM (MOGA) FOR OPTIMAL POWER FLOW PROBLEM INCLUDING VOLTAGE STABILITY
26 CHAPTER 2 MULTI-OBJECTIVE GENETIC ALGORITHM (MOGA) FOR OPTIMAL POWER FLOW PROBLEM INCLUDING VOLTAGE STABILITY 2.1 INTRODUCTION Voltage stablty enhancement s an mportant tas n power system operaton.
More informationFUZZY GOAL PROGRAMMING VS ORDINARY FUZZY PROGRAMMING APPROACH FOR MULTI OBJECTIVE PROGRAMMING PROBLEM
Internatonal Conference on Ceramcs, Bkaner, Inda Internatonal Journal of Modern Physcs: Conference Seres Vol. 22 (2013) 757 761 World Scentfc Publshng Company DOI: 10.1142/S2010194513010982 FUZZY GOAL
More informationEEL 6266 Power System Operation and Control. Chapter 3 Economic Dispatch Using Dynamic Programming
EEL 6266 Power System Operaton and Control Chapter 3 Economc Dspatch Usng Dynamc Programmng Pecewse Lnear Cost Functons Common practce many utltes prefer to represent ther generator cost functons as sngle-
More informationLecture Notes on Linear Regression
Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume
More informationThe Two-scale Finite Element Errors Analysis for One Class of Thermoelastic Problem in Periodic Composites
7 Asa-Pacfc Engneerng Technology Conference (APETC 7) ISBN: 978--6595-443- The Two-scale Fnte Element Errors Analyss for One Class of Thermoelastc Problem n Perodc Compostes Xaoun Deng Mngxang Deng ABSTRACT
More informationApplication of B-Spline to Numerical Solution of a System of Singularly Perturbed Problems
Mathematca Aeterna, Vol. 1, 011, no. 06, 405 415 Applcaton of B-Splne to Numercal Soluton of a System of Sngularly Perturbed Problems Yogesh Gupta Department of Mathematcs Unted College of Engneerng &
More informationUsing the estimated penetrances to determine the range of the underlying genetic model in casecontrol
Georgetown Unversty From the SelectedWorks of Mark J Meyer 8 Usng the estmated penetrances to determne the range of the underlyng genetc model n casecontrol desgn Mark J Meyer Neal Jeffres Gang Zheng Avalable
More informationOn the Multicriteria Integer Network Flow Problem
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 5, No 2 Sofa 2005 On the Multcrtera Integer Network Flow Problem Vassl Vasslev, Marana Nkolova, Maryana Vassleva Insttute of
More informationx = , so that calculated
Stat 4, secton Sngle Factor ANOVA notes by Tm Plachowsk n chapter 8 we conducted hypothess tests n whch we compared a sngle sample s mean or proporton to some hypotheszed value Chapter 9 expanded ths to
More informationChapter Newton s Method
Chapter 9. Newton s Method After readng ths chapter, you should be able to:. Understand how Newton s method s dfferent from the Golden Secton Search method. Understand how Newton s method works 3. Solve
More informationAn Extended Hybrid Genetic Algorithm for Exploring a Large Search Space
2nd Internatonal Conference on Autonomous Robots and Agents Abstract An Extended Hybrd Genetc Algorthm for Explorng a Large Search Space Hong Zhang and Masum Ishkawa Graduate School of L.S.S.E., Kyushu
More informationAn adaptive SMC scheme for ABC. Bayesian Computation (ABC)
An adaptve SMC scheme for Approxmate Bayesan Computaton (ABC) (ont work wth Prof. Mke West) Department of Statstcal Scence - Duke Unversty Aprl/2011 Approxmate Bayesan Computaton (ABC) Problems n whch
More informationGlobal Optimization Using Hybrid Approach
Tng-Yu Chen, Y Lang Cheng Global Optmzaton Usng Hybrd Approach TING-YU CHEN, YI LIANG CHENG Department of Mechancal Engneerng Natonal Chung Hsng Unversty 0 Kuo Kuang Road Tachung, Tawan 07 tyc@dragon.nchu.edu.tw
More informationChapter - 2. Distribution System Power Flow Analysis
Chapter - 2 Dstrbuton System Power Flow Analyss CHAPTER - 2 Radal Dstrbuton System Load Flow 2.1 Introducton Load flow s an mportant tool [66] for analyzng electrcal power system network performance. Load
More informationEconomic dispatch solution using efficient heuristic search approach
Leonardo Journal of Scences Economc dspatch soluton usng effcent heurstc search approach Samr SAYAH QUERE Laboratory, Faculty of Technology, Electrcal Engneerng Department, Ferhat Abbas Unversty, Setf
More informationThe Minimum Universal Cost Flow in an Infeasible Flow Network
Journal of Scences, Islamc Republc of Iran 17(2): 175-180 (2006) Unversty of Tehran, ISSN 1016-1104 http://jscencesutacr The Mnmum Unversal Cost Flow n an Infeasble Flow Network H Saleh Fathabad * M Bagheran
More informationA Hybrid Variational Iteration Method for Blasius Equation
Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 1 (June 2015), pp. 223-229 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) A Hybrd Varatonal Iteraton Method
More informationDERIVATION OF THE PROBABILITY PLOT CORRELATION COEFFICIENT TEST STATISTICS FOR THE GENERALIZED LOGISTIC DISTRIBUTION
Internatonal Worshop ADVANCES IN STATISTICAL HYDROLOGY May 3-5, Taormna, Italy DERIVATION OF THE PROBABILITY PLOT CORRELATION COEFFICIENT TEST STATISTICS FOR THE GENERALIZED LOGISTIC DISTRIBUTION by Sooyoung
More informationIV. Performance Optimization
IV. Performance Optmzaton A. Steepest descent algorthm defnton how to set up bounds on learnng rate mnmzaton n a lne (varyng learnng rate) momentum learnng examples B. Newton s method defnton Gauss-Newton
More informationFuzzy Boundaries of Sample Selection Model
Proceedngs of the 9th WSES Internatonal Conference on ppled Mathematcs, Istanbul, Turkey, May 7-9, 006 (pp309-34) Fuzzy Boundares of Sample Selecton Model L. MUHMD SFIIH, NTON BDULBSH KMIL, M. T. BU OSMN
More informationUncertain Models for Bed Allocation
www.ccsenet.org/ghs Global Journal of Health Scence Vol., No. ; October 00 Uncertan Models for Bed Allocaton Lng Gao (Correspondng author) College of Scence, Guln Unversty of Technology Box 733, Guln 54004,
More informationSelf-adaptive Differential Evolution Algorithm for Constrained Real-Parameter Optimization
26 IEEE Congress on Evolutonary Computaton Sheraton Vancouver Wall Centre Hotel, Vancouver, BC, Canada July 16-21, 26 Self-adaptve Dfferental Evoluton Algorthm for Constraned Real-Parameter Optmzaton V.
More informationEntropy Generation Minimization of Pin Fin Heat Sinks by Means of Metaheuristic Methods
Indan Journal of Scence and Technology Entropy Generaton Mnmzaton of Pn Fn Heat Snks by Means of Metaheurstc Methods Amr Jafary Moghaddam * and Syfollah Saedodn Department of Mechancal Engneerng, Semnan
More informationNumerical Heat and Mass Transfer
Master degree n Mechancal Engneerng Numercal Heat and Mass Transfer 06-Fnte-Dfference Method (One-dmensonal, steady state heat conducton) Fausto Arpno f.arpno@uncas.t Introducton Why we use models and
More informationTHE ROBUSTNESS OF GENETIC ALGORITHMS IN SOLVING UNCONSTRAINED BUILDING OPTIMIZATION PROBLEMS
Nnth Internatonal IBPSA Conference Montréal, Canada August 5-8, 2005 THE ROBUSTNESS OF GENETIC ALGORITHMS IN SOLVING UNCONSTRAINED BUILDING OPTIMIZATION PROBLEMS Jonathan Wrght, and Al Alajm Department
More informationCONTRAST ENHANCEMENT FOR MIMIMUM MEAN BRIGHTNESS ERROR FROM HISTOGRAM PARTITIONING INTRODUCTION
CONTRAST ENHANCEMENT FOR MIMIMUM MEAN BRIGHTNESS ERROR FROM HISTOGRAM PARTITIONING N. Phanthuna 1,2, F. Cheevasuvt 2 and S. Chtwong 2 1 Department of Electrcal Engneerng, Faculty of Engneerng Rajamangala
More informationCurve Fitting with the Least Square Method
WIKI Document Number 5 Interpolaton wth Least Squares Curve Fttng wth the Least Square Method Mattheu Bultelle Department of Bo-Engneerng Imperal College, London Context We wsh to model the postve feedback
More informationA Hybrid Co-evolutionary Particle Swarm Optimization Algorithm for Solving Constrained Engineering Design Problems
JOURNL OF COMPUERS VOL 5 NO 6 JUNE 00 965 Hybrd Co-evolutonary Partcle Optmzaton lgorthm for Solvng Constraned Engneerng Desgn Problems Yongquan Zhou Shengyu Pe College of Mathematcs and Computer Scence
More informationCalculation of time complexity (3%)
Problem 1. (30%) Calculaton of tme complexty (3%) Gven n ctes, usng exhaust search to see every result takes O(n!). Calculaton of tme needed to solve the problem (2%) 40 ctes:40! dfferent tours 40 add
More informationLecture 5 Decoding Binary BCH Codes
Lecture 5 Decodng Bnary BCH Codes In ths class, we wll ntroduce dfferent methods for decodng BCH codes 51 Decodng the [15, 7, 5] 2 -BCH Code Consder the [15, 7, 5] 2 -code C we ntroduced n the last lecture
More informationLecture 12: Classification
Lecture : Classfcaton g Dscrmnant functons g The optmal Bayes classfer g Quadratc classfers g Eucldean and Mahalanobs metrcs g K Nearest Neghbor Classfers Intellgent Sensor Systems Rcardo Guterrez-Osuna
More informationA LINEAR PROGRAM TO COMPARE MULTIPLE GROSS CREDIT LOSS FORECASTS. Dr. Derald E. Wentzien, Wesley College, (302) ,
A LINEAR PROGRAM TO COMPARE MULTIPLE GROSS CREDIT LOSS FORECASTS Dr. Derald E. Wentzen, Wesley College, (302) 736-2574, wentzde@wesley.edu ABSTRACT A lnear programmng model s developed and used to compare
More informationOne-sided finite-difference approximations suitable for use with Richardson extrapolation
Journal of Computatonal Physcs 219 (2006) 13 20 Short note One-sded fnte-dfference approxmatons sutable for use wth Rchardson extrapolaton Kumar Rahul, S.N. Bhattacharyya * Department of Mechancal Engneerng,
More informationTOPICS MULTIPLIERLESS FILTER DESIGN ELEMENTARY SCHOOL ALGORITHM MULTIPLICATION
1 2 MULTIPLIERLESS FILTER DESIGN Realzaton of flters wthout full-fledged multplers Some sldes based on support materal by W. Wolf for hs book Modern VLSI Desgn, 3 rd edton. Partly based on followng papers:
More informationSome modelling aspects for the Matlab implementation of MMA
Some modellng aspects for the Matlab mplementaton of MMA Krster Svanberg krlle@math.kth.se Optmzaton and Systems Theory Department of Mathematcs KTH, SE 10044 Stockholm September 2004 1. Consdered optmzaton
More informationJournal of Universal Computer Science, vol. 1, no. 7 (1995), submitted: 15/12/94, accepted: 26/6/95, appeared: 28/7/95 Springer Pub. Co.
Journal of Unversal Computer Scence, vol. 1, no. 7 (1995), 469-483 submtted: 15/12/94, accepted: 26/6/95, appeared: 28/7/95 Sprnger Pub. Co. Round-o error propagaton n the soluton of the heat equaton by
More informationHigh resolution entropy stable scheme for shallow water equations
Internatonal Symposum on Computers & Informatcs (ISCI 05) Hgh resoluton entropy stable scheme for shallow water equatons Xaohan Cheng,a, Yufeng Ne,b, Department of Appled Mathematcs, Northwestern Polytechncal
More informationOn an Extension of Stochastic Approximation EM Algorithm for Incomplete Data Problems. Vahid Tadayon 1
On an Extenson of Stochastc Approxmaton EM Algorthm for Incomplete Data Problems Vahd Tadayon Abstract: The Stochastc Approxmaton EM (SAEM algorthm, a varant stochastc approxmaton of EM, s a versatle tool
More informationSOLVING CAPACITATED VEHICLE ROUTING PROBLEMS WITH TIME WINDOWS BY GOAL PROGRAMMING APPROACH
Proceedngs of IICMA 2013 Research Topc, pp. xx-xx. SOLVIG CAPACITATED VEHICLE ROUTIG PROBLEMS WITH TIME WIDOWS BY GOAL PROGRAMMIG APPROACH ATMII DHORURI 1, EMIUGROHO RATA SARI 2, AD DWI LESTARI 3 1Department
More informationrisk and uncertainty assessment
Optmal forecastng of atmospherc qualty n ndustral regons: rsk and uncertanty assessment Vladmr Penenko Insttute of Computatonal Mathematcs and Mathematcal Geophyscs SD RAS Goal Development of theoretcal
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationTHEORY OF GENETIC ALGORITHMS WITH α-selection. André Neubauer
THEORY OF GENETIC ALGORITHMS WITH α-selection André Neubauer Informaton Processng Systems Lab Münster Unversty of Appled Scences Stegerwaldstraße 39, D-48565 Stenfurt, Germany Emal: andre.neubauer@fh-muenster.de
More informationDifference Equations
Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1
More informationA stochastic algorithm for function minimization
A stochastc algorthm for functon mnmzaton DONGCAI SU School of Communcatons, Jln Unversty, Changchun, Jln 3002, Chna E-mal: suntree452@gmal.com JUNWEI DONG Bradley Department of Electrcal & Computer Engneerng,
More informationMicrowave Diversity Imaging Compression Using Bioinspired
Mcrowave Dversty Imagng Compresson Usng Bonspred Neural Networks Youwe Yuan 1, Yong L 1, Wele Xu 1, Janghong Yu * 1 School of Computer Scence and Technology, Hangzhou Danz Unversty, Hangzhou, Zhejang,
More informationSimulated Power of the Discrete Cramér-von Mises Goodness-of-Fit Tests
Smulated of the Cramér-von Mses Goodness-of-Ft Tests Steele, M., Chaselng, J. and 3 Hurst, C. School of Mathematcal and Physcal Scences, James Cook Unversty, Australan School of Envronmental Studes, Grffth
More informationHYBRID FUZZY MULTI-OBJECTIVE EVOLUTIONARY ALGORITHM: A NOVEL PARETO-OPTIMIZATION TECHNIQUE
Internatonal Journal of Fuzzy Logc Systems (IJFLS) Vol.2, No., February 22 HYBRID FUZZY MULTI-OBJECTIVE EVOLUTIONARY ALGORITHM: A NOVEL PARETO-OPTIMIZATION TECHNIQUE Amt Saraswat and Ashsh San 2 Department
More informationA Genetic-Algorithm-Based Approach to UAV Path Planning Problem
A Genetc-Algorm-Based Approach to UAV Pa Plannng Problem XIAO-GUAG GAO 1 XIAO-WEI FU 2 and DA-QIG CHE 3 1 2 School of Electronc and Informaton orwestern Polytechncal Unversty X An 710072 CHIA 3 Dept of
More informationA New Algorithm for Finding a Fuzzy Optimal. Solution for Fuzzy Transportation Problems
Appled Mathematcal Scences, Vol. 4, 200, no. 2, 79-90 A New Algorthm for Fndng a Fuzzy Optmal Soluton for Fuzzy Transportaton Problems P. Pandan and G. Nataraan Department of Mathematcs, School of Scence
More informationQuantum-Evolutionary Algorithms: A SW-HW approach
Proceedngs of the 5th WSEAS Int. Conf. on COMPUTATIONAL INTELLIGENCE, MAN-MACHINE SYSTEMS AND CYBERNETICS, Vence, Italy, November 0-, 006 333 Quantum-Evolutonary Algorthms: A SW-HW approach D. PORTO, A.
More informationLINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity
LINEAR REGRESSION ANALYSIS MODULE IX Lecture - 30 Multcollnearty Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur 2 Remedes for multcollnearty Varous technques have
More informationAn Adaptive Learning Particle Swarm Optimizer for Function Optimization
An Adaptve Learnng Partcle Swarm Optmzer for Functon Optmzaton Changhe L and Shengxang Yang Abstract Tradtonal partcle swarm optmzaton (PSO) suffers from the premature convergence problem, whch usually
More informationComplex Numbers Alpha, Round 1 Test #123
Complex Numbers Alpha, Round Test #3. Wrte your 6-dgt ID# n the I.D. NUMBER grd, left-justfed, and bubble. Check that each column has only one number darkened.. In the EXAM NO. grd, wrte the 3-dgt Test
More informationPolynomial Regression Models
LINEAR REGRESSION ANALYSIS MODULE XII Lecture - 6 Polynomal Regresson Models Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur Test of sgnfcance To test the sgnfcance
More informationTAIL BOUNDS FOR SUMS OF GEOMETRIC AND EXPONENTIAL VARIABLES
TAIL BOUNDS FOR SUMS OF GEOMETRIC AND EXPONENTIAL VARIABLES SVANTE JANSON Abstract. We gve explct bounds for the tal probabltes for sums of ndependent geometrc or exponental varables, possbly wth dfferent
More informationA Network Intrusion Detection Method Based on Improved K-means Algorithm
Advanced Scence and Technology Letters, pp.429-433 http://dx.do.org/10.14257/astl.2014.53.89 A Network Intruson Detecton Method Based on Improved K-means Algorthm Meng Gao 1,1, Nhong Wang 1, 1 Informaton
More informationSOLVING NON-LINEAR SYSTEMS BY NEWTON s METHOD USING SPREADSHEET EXCEL Tay Kim Gaik Universiti Tun Hussein Onn Malaysia
SOLVING NON-LINEAR SYSTEMS BY NEWTON s METHOD USING SPREADSHEET EXCEL Tay Km Gak Unverst Tun Hussen Onn Malaysa Kek Se Long Unverst Tun Hussen Onn Malaysa Rosmla Abdul-Kahar
More informationOptimum Design of Steel Frames Considering Uncertainty of Parameters
9 th World Congress on Structural and Multdscplnary Optmzaton June 13-17, 211, Shzuoka, Japan Optmum Desgn of Steel Frames Consderng ncertanty of Parameters Masahko Katsura 1, Makoto Ohsak 2 1 Hroshma
More informationSupport Vector Machines. Vibhav Gogate The University of Texas at dallas
Support Vector Machnes Vbhav Gogate he Unversty of exas at dallas What We have Learned So Far? 1. Decson rees. Naïve Bayes 3. Lnear Regresson 4. Logstc Regresson 5. Perceptron 6. Neural networks 7. K-Nearest
More informationThe Exact Formulation of the Inverse of the Tridiagonal Matrix for Solving the 1D Poisson Equation with the Finite Difference Method
Journal of Electromagnetc Analyss and Applcatons, 04, 6, 0-08 Publshed Onlne September 04 n ScRes. http://www.scrp.org/journal/jemaa http://dx.do.org/0.46/jemaa.04.6000 The Exact Formulaton of the Inverse
More informationA Study on Improved Cockroach Swarm Optimization Algorithm
A Study on Improved Cockroach Swarm Optmzaton Algorthm 1 epartment of Computer Scence and Engneerng, Huaan Vocatonal College of Informaton Technology,Huaan 223003, Chna College of Computer and Informaton,
More informationA New Quantum Behaved Particle Swarm Optimization
A New Quantum Behaved Partcle Swarm Optmzaton Mlle Pant Department of Paper Technology IIT Roorkee, Saharanpur Inda mllfpt@tr.ernet.n Radha Thangaraj Department of Paper Technology IIT Roorkee, Saharanpur
More informationGlobal Sensitivity. Tuesday 20 th February, 2018
Global Senstvty Tuesday 2 th February, 28 ) Local Senstvty Most senstvty analyses [] are based on local estmates of senstvty, typcally by expandng the response n a Taylor seres about some specfc values
More informationA Multi-modulus Blind Equalization Algorithm Based on Memetic Algorithm Guo Yecai 1, 2, a, Wu Xing 1, Zhang Miaoqing 1
Internatonal Conference on Materals Engneerng and Informaton Technology Applcatons (MEITA 1) A Mult-modulus Blnd Equalzaton Algorthm Based on Memetc Algorthm Guo Yeca 1,, a, Wu Xng 1, Zhang Maoqng 1 1
More information