The Convergence Speed of Single- And Multi-Objective Immune Algorithm Based Optimization Problems
|
|
- Percival Ramsey
- 5 years ago
- Views:
Transcription
1 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, 756, Egypt. Sabah M. Ahmed Faculty of Engneerng, Electrcal and Electroncs Engneerng Department, Assut Unversty, Assut, 756, Egypt. Nabl Sabor Faculty of Engneerng, Electrcal and Electroncs Engneerng Department, Assut Unversty, Assut, 756, Egypt. Ahmad F. Al-Aloun Haw Faculty for Engneerng Technology, Communcaton Engneerng Department, Yarmouk Unversty, Irbd, 63, Jordan. Abstract Despte the consderable amount of research related to mmune algorthms and t applcatons n numercal optmzaton, dgtal flters desgn, and data mnng, there s stll lttle work related to ssues as mportant as senstvty analyss, []-[4]. Other aspects, such as convergence speed and parameters adaptaton, have been practcally dsregarded n the current specalzed lterature [7]-[8]. The convergence speed of the mmune algorthm heavly depends on ts man control parameters: populaton sze, replcaton rate, mutaton rate, clonal rate and hypermutaton rate. In ths paper we nvestgate the effect of control parameters varaton on the convergence speed for sngle- and mult-obectve optmzaton problems. Three examples are devoted for ths purpose; namely the desgn of - D recursve dgtal flter, mnmzaton of smple functon, and banana functon. The effect of each parameter on the convergence speed of the IA s studed consderng the other parameters wth fxed values and takng the average of 00 tmes ndependent runs. Then, the concluded rules are appled on some examples ntroduced n [] and [3]. Computatonal results show how to select the mmune algorthm parameters to speedup the algorthm convergence and to obtan the optmal soluton. Sgnal Processng : An Internatonal Journal (SPIJ), Volume (4): Issue (5) 47
2 Keywords: Immune Algorthm, Convergence, Mutaton, Hypermutaton, Populaton Sze, Clonal Selecton.. INTRODUCTION The parameters of the mmune algorthm have a large effect on the convergence speed. These parameters are the populaton sze (p s ) whch estmates the number of ndvduals (antbodes) for each generaton, the mutaton rate (p m ) whch ncreases the dversty n populaton, and the replcaton rate (p r ) whch estmates the number of antbodes chosen from the antbody populaton pool to on the algorthm operatons. Other parameters such as the clonal rate (p c ) whch estmates the number of ndvduals chosen from the antbody populaton pool to on the clonal prolferaton (selecton), as well as the hypermutaton rate (p h ) whch mproves the capabltes of exploraton and explotaton n populaton, have also great effect on the speed of convergence. In spte of the research carred out up to date, there are no general rules on how these parameters can be selected. In lterature []-[] and [3], the mmune parameters are selected by certan values (e.g. p s =00, p r =0.8, p m =0., p c =0.06, p h =0.8) wthout statng the reason for ths selecton. In ths paper we nvestgate the effect of parameters varaton on the convergence speed of the mmune algorthms developed for three dfferent llustratve examples: -D recursve dgtal flter desgn (mult-obectve problem), mnmzaton of smple functon (sngle-obectve problem), and fndng the global mnmum of banana functon. The obtaned results can be used for selectng the values of these parameters for other problems to speed up the convergence. The paper s organzed as follows. Secton descrbes the mmune algorthm behavor. In Secton 3 three llustratve examples are gven to nvestgate the effect of parameters varaton on the convergence speed of the mmune algorthm. Secton 4 dscusses the selecton crtera of these parameters to guarantee the convergence speed. In secton 5, some examples ntroduced n [3] and [] are consdered to demonstrate the effectveness of the selecton of mmune algorthm control parameters. And fnally, Secton 6 offers some conclusons.. IMMUNE ALGORITHMS BEHAVIOR Immune algorthms are randomzed algorthms nspred by mmune functons and prncples observed n nature [0]. Such algorthms begn by generatng populaton pool (chromosome) usng real codng representaton and evaluatng the obectve values. Then, the populaton pool undergoes the algorthm operatons whch wll be descrbed n ths secton. The operatons are repeated at each generaton (gen) untl the termnaton condton s satsfed []-[]. Table () llustrates the man steps of the mmune algorthm [6].. Generaton of Antbody Populaton The antbody populaton s generated ether by usng bnary codng representaton or real codng representaton. In the bnary codng representaton, each varable s encoded as a bnary strng and the resultng strngs are concatenated to form sngle chromosome (antbody) []. However, n the real codng representaton, each antbody s encoded as a vector of floatng pont numbers, wth the same length as the vector of decson varables. Ths representaton s accurate and effcent because t s closest to the real desgn space, and the strng length represents the number of desgn varables.. Selecton for Reproducton The roulette wheel selecton s employed n mmune bases algorthms for chromosomes reproducton. Its basc dea s to determne the selecton probablty for each soluton n proporton wth the ftness value. For soluton wth ftness f, ts probablty p s defned as: Sgnal Processng : An Internatonal Journal (SPIJ), Volume (4): Issue (5) 48
3 p = p f s = And the cumulatve probablty q = = Where, the ftness f p, =,,...,ρ s q for each soluton s calculated as:, =,,..., ρ s f s relaton to the obectve functon value of the th chromosome. () () Gen=; Chrom=Intal_pop(); Whle (termnaton_condton) Evaluuate (Chrom); Chrom_sel=RWS_Selecton(Chrom); Chrom_rep=replcaton(Chrom_sel); Replcaton Chrom_clon=Clonng(Chrom_rep); Chrom_hyper=Hypermutaton(Chrom_clon); Chrom_tot=[ Chrom_rep, Chrom_hyper]; Chrom_chld=Mutaton(Chrom_tot); Evaluuate (Chrom_chld); Chrom=Better_selecton(Chrom, Chrom_chld); generaton gen=gen+; end % The frst generaton % Construct the ntal populaton pool % Obectve functon evaluaton % Roulette wheel selecton % Selecton of better antbodes usng % Clonal operaton % Hypermutaton operaton % Mutaton Operaton % Obectve functon evaluaton % Selecton of better antbodes for next % Increment the number of generatons TABLE (): The Immune Algorthm.3 Replcaton Operaton The replcaton operaton s used to select better antbodes, whch have low obectve values to undergo algorthm operatons. Ths s termed by clonal prolferaton wthn hypermutaton and mutaton operatons..4 Clonal Prolferaton wthn Hypermutaton Based on the bologcal mmune prncples, the selecton of a certan antbody from the antbody populaton pool to on the clonal prolferaton depends on the clonal selecton rate (p c ). Each gene, n a sngle antbody, dependng on the hypermutaton rate (p h ), executes the hypermutaton of convex combnaton. The hypermutaton rate (p h ) has an extremely hgh rate than the mutaton rate to ncrease the antbody dversty. For a gven antbody X = ( X, X,..., X, X, X k,..., X ρ ), f the gene X s determned to execute the hypermutaton and another gene X k s randomly ' ' selected to on n, the resultng offsprng antbody becomes X ( X, X,..., X, X, X ) where the new gene ' ' X s X = ( β ) X + β X k =,, and β [0, ] s a random value. k,..., X ρ.5 Mutaton Operaton Smlar to the hypermutaton mechansm, the mutaton operaton s also derved from the convex set theory [9], where each gene, n a sngle antbody, dependng on the mutaton rate (p m ), executes the mutaton of convex combnaton. Two genes n a sngle soluton are randomly chosen to execute the mutaton of convex combnaton [5]. For a gven antbody X = ( X, X,..., X, X, X k,..., X ρ ), f the genes X and X k are randomly selected for Sgnal Processng : An Internatonal Journal (SPIJ), Volume (4): Issue (5) 49
4 mutaton depend on the mutaton rate (p m ), the resultng offsprng s ' ' ' X = X, X,..., X, X, X. The resultng two genes X and X are calculated as: ( ) X ' = β + k,..., X ρ ' ( ) X β X k and X k = β X + ( β) X k where, β s selected randomly n the range [0, ]. ' ' k (3).6 Selecton Operaton The selecton operaton s generally used to select the better p s antbodes whch have low obectve values as the new antbody populaton of the next generaton. 3. ILLUSTRATIVE EXAMPLES In ths secton three dfferent examples are consdered to nvestgate the effect of parameters varaton on the convergence speed of the mmune algorthm. The frst example smulates the mult-obectve functon problem that has an nfnte set of possble solutons dffcult to fnd [7]. The second example s a sngle-obectve functon problem and t s less dffcult and the thrd example represents the famly of problems wth slow convergence to the global mnmum [6]. Example : Ths example consders the desgn of a second order -D narrow-band recursve LPF wth magntude and group delay specfcatons. The specfed magntude M ω, ω ) s shown n d ( Fgure () [], [5]. Namely, t s gven by Equaton (4) wth the addtonal constant group delay τ τ 5 over the passband ω + ω 0. π and the desgn space s [-3 3]. To solve ths d = = d problem, the frequency samples are taken at ω / π = 0, 0.0,0.04, K, 0., 0.4, K, n the ranges π ω π, and π ω π..0, ( ω, ω ) = 0.5, 0.0, for ω + ω for 0.08π < for ω + ω 0.08π ω + ω > 0.π 0.π M d (4) Example : Ths example consders the optmzaton of the exponental functon shown n Fgure () and descrbed by the followng equaton: y 9 ( x) = a x = 0 Wth the followng desred specfed values Y d (x) at x= [0,,, 3,., 0]. Y d (x) = [ ] (5) Example 3: Ths example consders a Rosenbrock banana functon that descrbed by the followng equaton [6]. Ths functon s often used to test the performance of most optmzaton algorthms [6]. The 9 Sgnal Processng : An Internatonal Journal (SPIJ), Volume (4): Issue (5) 50
5 global mnmum s nsde a long, narrow, parabolc shaped flat valley as shown n Fgure (3). In fact fnd the valley s trval, however the convergence to the global mnmum s dffcult. f ( x, y) = ( x) + 00( y x ) (6) FIGURE : Desred Ampltude Response ( ) M d ω,ω Of The -D Narrow-Band LPF (Example ) Sgnal Processng : An Internatonal Journal (SPIJ), Volume (4): Issue (5) 5
6 FIGURE : Desred Specfcatons of the Functon y ( x) (Example ) FIGURE 3: Rosenbrock Banana Functon (Example 3) Sgnal Processng : An Internatonal Journal (SPIJ), Volume (4): Issue (5) 5
7 4. SENSITIVITY ANALYSIS In ths secton, we examne the effect of parameters varatons on the convergence speed of the mmune algorthm for the three examples descrbed n secton 3. The number of genes (the encodng length L) for each example s defned by the number of unknown coeffcents. For the flter desgn problem, the flter transfer functon s expressed by: H, a00+ a0z+ a0z + a0z+ azz+ azz + a0z + az z+ az z = H0, a 00 ( z z ) = ( + b z+ cz + dzz)( + b z+ cz+ dzz) (7) So, 5 genes can be adusted to approxmate the specfed magntude and group delay. For the smple functon and banana functon problems, the number of genes consdered are 0 and respectvely. 4. Effect of the populaton sze (p s ) The populaton sze (p s ) s defned as the number of antbodes used n each generaton. The varatons n p s can have substantal effect on the convergence speed of mmune algorthm. If the p s s too small, the IA cannot reach to optmal soluton. However, f t s too large, the IA wastes computatonal tme effort on extra obectve values evaluatons. Here, the effect of p s on the convergence speed of the algorthm s studed by takng the average of 00 tmes ndependent runs at each p s value. The value of p s was vared from 0 to 400 wth the other parameters fxed at p r =0.8, p h =0.8, p m =0., and p c =0.06. The effect of populaton sze varatons on number of generatons requred to get the soluton for flter desgn problem, smple functon and banana functon are shown n Fgures (4-6), respectvely. The results llustrated n Fgures (4-6) show that, the speed of convergence can be measured by the number of generatons requred to reach to the optmal chromosome (global soluton). Moreover, t can be notced that the speed of convergence depends not only on the p s but also on the number of genes. Here, the p s after whch optmal chromosome s obtaned s denoted by p s *. Increasng the p s above p s * has nsgnfcant effect on speedng up the convergence. 4. Effect of the Replcaton Rate (p r ) The replcaton rate (p r ) estmates the number of antbodes chosen from the antbody populaton pool to on the algorthm operatons. The effect of p r on the speed of convergence of the IA s studed by takng the average of 00 tmes ndependent runs at each p r value. The value of p r was vared from 0. to wth the other parameters fxed at p s =00 p h =0.8, p m =0., and p c =0.06. The effect of p r varaton on the number of generatons requred to produce the soluton for flter desgn problem, smple functon and banana functon are shown n Fgures (7-9), respectvely. These fgures show that, the hgh values of replcaton rate have a sgnfcant effect on speedng up the convergence, but the computatonal tme ncreases as the p r ncreases. It s also notced that the values of p r greater than p r * have no further effect on speedng up the convergence. Sgnal Processng : An Internatonal Journal (SPIJ), Volume (4): Issue (5) 53
8 FIGURE 4: The Effect of Populaton Sze on the Speed of Convergence of the Flter Desgn Problem. FIGURE 5: The Effect of Populaton Sze on the Speed of Convergence for Smple Functon Mnmzaton Sgnal Processng : An Internatonal Journal (SPIJ), Volume (4): Issue (5) 54
9 Fgure 6: The Effect Of Populaton Sze On The Speed Of Convergence For Fndng The Global Mnmum Of Banana Functon. FIGURE 7: The Effect of Replcaton Rate on the Speed of Convergence for Flter Desgn Problem. Sgnal Processng : An Internatonal Journal (SPIJ), Volume (4): Issue (5) 55
10 FIGURE 8: The Effect of Pr on the Speed of Convergence for Smple Functon Mnmzaton. FIGURE 9: The Effect of Pr on the Speed of Convergence for Fndng the Global Mnmum of Banana Functon. Sgnal Processng : An Internatonal Journal (SPIJ), Volume (4): Issue (5) 56
11 4.3 Effect of the Clonal Selecton Rate (p c ) The clonal selecton rate (p c ) estmates the number of antbodes that can be chosen from the antbody populaton pool to on the clonal prolferaton. The effect of p c on the speed of convergence of the IA s studed by takng the average of 00 tmes ndependent runs at each p c value. The value of p c was vared from 0.0 to wth the other parameters fxed at p s =00, p r =0.8, p h =0.8, and p m =0.. The effect of p c varaton on the number of generatons requred to produce the optmal soluton for flter desgn problem, smple functon and banana functon are shown n Fgures (0-), respectvely. From these fgures, we can conclude that low values of p c (0.05 p c <0.) have sgnfcant effect on speedng up the convergence. It s also notced that the use of hgh values of p c (p c p c *) have an effect of slowng down the convergence. Ths s manly due to the nfeasble selected ndvduals whch oned to the clonal prolferaton. 4.4 Effect of the Hypermutaton Rate (p h ) The hypermutaton rate (p h ) s used to mprove the capabltes of exploraton and explotaton n populaton. The effect of p h on the convergence speed of the IA s evaluated by takng the average of 00 tmes ndependent runs at each p h value. The value of p h was vared from 0.0 to wth the other parameters fxed at p s =00, p r =0.8, p c =0.06, and p m =0.. The effect of hypermutaton varaton on the number of generatons requred to produce the soluton for flter desgn problem, smple functon and banana functon are shown n Fgures (3-5), respectvely. The results gven n Fgures (3-5) show that, the value of p h depends on the problem doman. The values of p h for the three llustratve examples are 0.5, 0.5, and 0.7, respectvely. The p h should be n the range (0.5 p h <) to speed up the convergence of small number of genes problems (example 3) and t s about 0.5 for other ones. FIGURE 0: The Effect of Clonal Rate on the Speed of Convergence for Flter Desgn Problem. Sgnal Processng : An Internatonal Journal (SPIJ), Volume (4): Issue (5) 57
12 FIGURE : The Effect of Clonal Rate on the Speed of Convergence for Smple Functon Mnmzaton. FIGURE : The Effect of Clonal Rate on the Speed of Convergence for Fndng the Global Mnmum of Banana Functon. Sgnal Processng : An Internatonal Journal (SPIJ), Volume (4): Issue (5) 58
13 FIGURE 3: The Effect of Hypermutaton Rate on the Speed of Convergence for Flter Desgn Problem. FIGURE 4: The Effect of Hypermutaton Rate on the Speed of Convergence for Smple Functon Mnmzaton. Sgnal Processng : An Internatonal Journal (SPIJ), Volume (4): Issue (5) 59
14 FIGURE 5: The Effect of Hypermutaton Rate on the Speed of Convergence for Fndng the Global Mnmum of Banana Functon. 4.5 Effect of the Mutaton Rate (p m ) The mutaton rate (p m ) s one of the most senstve mmune algorthm parameters, snce t ncreases the dversty n populaton. The choce of mutaton rate s essentally a tradeoff between conservatsm and exploraton [4]. The effect of p m on the convergence speed of IA s studed by takng the average of 00 tmes ndependent runs at each p m value. The value of p m was vared from 0.0 to wth the other parameters fxed at p s =00, p r =0.8, p c =0.06, and p h =0.8. The effect of mutaton rate varaton on the number of generatons requred to produce the soluton for flter desgn problem, smple functon and banana functon are shown n Fgures (6-8), respectvely. From these fgures, we can conclude that the low values of mutaton rate (p m p m *) have sgnfcant effect on speedng up the convergence. Also, t s notced that to guarantee the convergence speed, the p m should be between / p s and /L, where p s s the populaton sze and L s the encodng strng length. From above studyng, we can conclude that the general heurstcs on IA parameters to guarantee the convergence speed are: ) the populaton sze should be greater than 00; ) the replcaton rate should be hgher than 0.; 3) the clonal rate should be small n the range (0.05 p c <0.); 4) the hypermutaton rate should be hgh n the range (0.5 p h <); and 5) the mutaton rate should be between / p s and /L. Sgnal Processng : An Internatonal Journal (SPIJ), Volume (4): Issue (5) 60
15 FIGURE 6: The Effect of Mutaton Rate on the Speed of Convergence for Flter Desgn Problem (Ps=00 and L=5). Sgnal Processng : An Internatonal Journal (SPIJ), Volume (4): Issue (5) 6
16 FIGURE 7: The Effect of Mutaton Rate on Speed of Convergence for Smple Functon Mnmzaton (Ps=00 and L=0). FIGURE 8: The Effect Of Mutaton Rate On Speed Of Convergence For Fndng The Global Mnmum Of Banana Functon (Ps=00 And L=). Sgnal Processng : An Internatonal Journal (SPIJ), Volume (4): Issue (5) 6
17 5 RESULTS AND DISCUSSION In ths secton, some examples ntroduced n [3] and [] are consdered to llustrate the effect of mmune algorthm parameters on the convergence speed. Example 4: Ths example s consdered n [3] for solvng system dentfcaton problem. It s repeated here to demonstrate the effectveness of the selecton of mmune algorthm control parameters. In ths example, t s requred to approxmate second-order system by frst-order IIR flter. The secondorder system and the flter are descrbed respectvely by the followng transfer functons [3]: z a0 H p ( z ) = and ( z ) =.34z + 0.5z H f (8) b z In Table (), the control parameters selected based on the study descrbed n prevous secton and that used n [3] are gven. Table (3) llustrates the transfer functon, the number of functon evoluton and NMSE of the resultng IIR flter and that s descrbed n [3]. The NMSE s calculated usng the followng equaton: NMSE = N k= Where, M d ( k) and ( k) N ( M( k) M d( k) ) ( M d( k) ) k= M are the magntude responses of the nd order system and that of the desgned flter respectvely calculated at N=000 samplng ponts. IA Parameters The selected parameters based on the above study (9) The selected parameters n [3] Populaton sze Replcaton rate Mutaton rate Clone rate 0.05 Not used n ths method Hypermutaton rate 0.8 Not used n ths method TABLE : The IA Control Parameters Of Examples And IIR flter obtaned usng proposed parameters values z IIR flter obtaned usng parameters values stated n [3] z Transfer Functon H f ( z ) = H ( ) f z = NMSE Number of functon evaluatons to fnd the global optmal soluton TABLE 3: The Transfer Functon, Number Of Functon Evolutons And NMSE Of Both Resultng IIR Flter And IIR Flter Descrbed In [3]. Fgure (9) shows the magntude responses of the second-order system, the resultng IIR flter and IIR flter descrbed n [3]. From Fgure (9) and Table (3), notced that the resultng IIR flter Sgnal Processng : An Internatonal Journal (SPIJ), Volume (4): Issue (5) 63
18 converge to the second-order system after smaller number of obectve functon evaluatons wth smaller NMSE compared to that gven n [3]. So, the good selecton of the IA control parameters speeds up the algorthm convergence. FIGURE 9: The magntude responses of second-order system and IIR flter Example 5: Ths example s also consdered n [3] for solvng system dentfcaton problem. It s requred to approxmate a second order system by IIR flter wth the same order. The system and the flter are descrbed respectvely by the followng transfer functons [3]: H ( z ) = and ( ) z = p.z + 0.6z H f (0) b z Sgnal Processng : An Internatonal Journal (SPIJ), Volume (4): Issue (5) 64 b z Usng the same control parameters of example, the optmal soluton (b = -.966, b = ) s obtaned after 503 obectve functon evaluatons wth MSE=0.393x0-3. However, the soluton n [3] s obtaned after 3000 obectve functon evaluatons wth MSE=0.5x0-3. Example 6: Ths example s consdered n [], for fndng the global soluton of the followng test functon: N N x f 4 = x cos + () 4000 = = The proposed IA s used to solve ths functon wth 30 dmensons (.e. N=30) n soluton space [- 600, 600]. In Table (4), the control parameters selected based on the study descrbed n prevous secton and that used n [] are gven.
19 IA Parameters The selected parameters based on the above study The selected parameters n [] Populaton sze Replcaton rate Mutaton rate Clone rate Hypermutaton rate Table 4: The IA Control Parameters Of Example 3 Usng the proposed IA, the soluton s obtaned after 30 functon evaluatons; however n [] s reached after 5743 functon evaluatons. So, the IA control parameters are havng sgnfcant effect on the convergence speed. 6 CONCLUSIONS In ths paper, general rules on speedng up the convergence of the IA are dscussed. The convergence speed of the IA s mportant ssues and heavly depends on ts man control parameters. In spte of the research carred out up to date, there are no general rules on how the control parameters of the IA can be selected. In lterature []-[3], the choce of these parameters s stll left to the user to be determned statcally pror to the executon of the IA. Here, we nvestgate the effect of the parameters varaton on the convergence speed by adoptng three dfferent obectve optmzaton examples (-D recursve flter desgn, mnmzaton of smple functon, and banana functon). From the studed examples, the followng general heurstcs on mmune algorthm parameters that guarantee the convergence speed are concluded: ) the populaton sze should be greater than 00; ) the replcaton rate should be hgher than 0.; 3) the clonal rate should be small n the range (0.05 p c <0.); 4) the hypermutaton rate should be hgh n the range (0.5 p h <); and 5) the mutaton rate should be between / p s and /L. These heurstcs are appled to study cases solved n [3] and [] to show effect of control parameter selecton on the IA performance. Numercal results show that the good selecton of the control parameters of the IA have sgnfcant effect on the convergence speed of the algorthm. 7 REFERENCES. J. T. Tsa, W. H. Ho, J. H. Chou. Desgn of Two-Dmensonal Recursve Flters by Usng Taguch Immune Algorthm. IET sgnal process, ():0-7, March 008. J. T. Tsa, J. H. Chou. Desgn of Optmal Dgtal IIR Flters by Usng an Improved Immune Algorthm. IEEE Trans. sgnal processng, 54(): , December A. Kalnl, N. Karaboga. "Artfcal mmune algorthm for IIR flters desgn". Engneerng Applcatons of Artfcal Intellgance, 8(8): 99-99, December Alex A. Fretas, Jon Tmms. Revstng the Foundatons of Artfcal Immune Systems for Data Mnng. IEEE Trans. on Evolutonary Compuaton, (4): 5-540, August A. H. Aly, M. M. Fahmy. "Desgn of Two Dmensonal Recursve Dgtal Flters wth Specfed Magntude and Group Delay Characterstcs". IEEE Trans. on Crcuts and Systems, 5(): November Roy Danchck. Accurate numercal partals wth applcatons to optmzaton, Appled mathematcs and computaton, 83(): , December 006 Sgnal Processng : An Internatonal Journal (SPIJ), Volume (4): Issue (5) 65
20 7. M. Vllalobos-Aras, C. A. Coello, O. Hernandez-Lerma. Asymptotc convergence of some metaheurstcs used for multobectve optmzaton. LNCS, Sprnger, 3469: 95-, M. Vllalobos-Aras, C. A. Coello, O. Hernandez-Lerma. Convergence Analyss of a Multobectve Artfcal Immune System Algorthm. In Ncosa et al. (eds) Proc. Int. Conf. Artfcal Immune Systems (ICARIS 004), LNCS, Sprnger, 339: 6-35, M. Bazaraa, J. Jarvs, H. Sheral. "Lnear Programmng and Network Flows". John Wley & Sons, New York (990) 0. V. Cutello, G. Ncosa, M. Romeo, P.S. Olveto. On the convergence of mmune algorthm. IEEE Symposum on Foundatons of Computatonal Intellgence: , Aprl 007. Z. Mchalewz. "Genetc Algorthm and Data Structure". Sprnger-Verlag Berln Hedelberg, 3rd ed. (996). J. T. Tsa,W. Ho,T.K. Lu, J. H. Chou. "Improved mmune algorthm for global numercal optmzaton and ob-shop schedulng problems ". Appled Mathematcs and Computaton, 94(): , December G. Zlong, W. Sun an, Z. Jan. "A novel Immune Evolutonary Algorthm Incorporatng Chaos Optmzaton". Pattern Recognton Letter, 7(): :8, January F. Vafaee, P.C. Nelson. A Genetc Algorthm that Incorporates an Adaptve Mutaton Based on an Evolutonary Model, Internatonal Conference on Machne Learnng and Applcatons, Mam Beach, FL, December K. Kaur, A. Chhabra, G. Sngh. "Heurstcs Based Genetc Algorthm for Schedulng Statc Tasks n Homogeneous Parallel System". Internatonal Journal of Computer Scence and Securty, 4(): 83-98, May M. Abo-Zahhad, S. M. Ahmed, N. Sabor and A. F. Al-Aloun, "Desgn of Two-Dmensonal Recursve Dgtal Flters wth Specfed Magntude and Group Delay Characterstcs usng Taguch-based Immune Algorthm", Int. J. of Sgnal and Imagng Systems Engneerng, vol. 3, no. 3, 00. Sgnal Processng : An Internatonal Journal (SPIJ), Volume (4): Issue (5) 66
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 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 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 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 informationChapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems
Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons
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 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 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 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 informationWinter 2008 CS567 Stochastic Linear/Integer Programming Guest Lecturer: Xu, Huan
Wnter 2008 CS567 Stochastc Lnear/Integer Programmng Guest Lecturer: Xu, Huan Class 2: More Modelng Examples 1 Capacty Expanson Capacty expanson models optmal choces of the tmng and levels of nvestments
More informationUncertainty in measurements of power and energy on power networks
Uncertanty n measurements of power and energy on power networks E. Manov, N. Kolev Department of Measurement and Instrumentaton, Techncal Unversty Sofa, bul. Klment Ohrdsk No8, bl., 000 Sofa, Bulgara Tel./fax:
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 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 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 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 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 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 informationNote 10. Modeling and Simulation of Dynamic Systems
Lecture Notes of ME 475: Introducton to Mechatroncs Note 0 Modelng and Smulaton of Dynamc Systems Department of Mechancal Engneerng, Unversty Of Saskatchewan, 57 Campus Drve, Saskatoon, SK S7N 5A9, Canada
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 informationQueueing Networks II Network Performance
Queueng Networks II Network Performance Davd Tpper Assocate Professor Graduate Telecommuncatons and Networkng Program Unversty of Pttsburgh Sldes 6 Networks of Queues Many communcaton systems must be modeled
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 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 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 informationECE559VV Project Report
ECE559VV Project Report (Supplementary Notes Loc Xuan Bu I. MAX SUM-RATE SCHEDULING: THE UPLINK CASE We have seen (n the presentaton that, for downlnk (broadcast channels, the strategy maxmzng the sum-rate
More informationAppendix B: Resampling Algorithms
407 Appendx B: Resamplng Algorthms A common problem of all partcle flters s the degeneracy of weghts, whch conssts of the unbounded ncrease of the varance of the mportance weghts ω [ ] of the partcles
More informationThe optimal delay of the second test is therefore approximately 210 hours earlier than =2.
THE IEC 61508 FORMULAS 223 The optmal delay of the second test s therefore approxmately 210 hours earler than =2. 8.4 The IEC 61508 Formulas IEC 61508-6 provdes approxmaton formulas for the PF for smple
More informationModule 9. Lecture 6. Duality in Assignment Problems
Module 9 1 Lecture 6 Dualty n Assgnment Problems In ths lecture we attempt to answer few other mportant questons posed n earler lecture for (AP) and see how some of them can be explaned through the concept
More informationVARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES
VARIATION OF CONSTANT SUM CONSTRAINT FOR INTEGER MODEL WITH NON UNIFORM VARIABLES BÂRZĂ, Slvu Faculty of Mathematcs-Informatcs Spru Haret Unversty barza_slvu@yahoo.com Abstract Ths paper wants to contnue
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 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 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 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 informationSuppose that there s a measured wndow of data fff k () ; :::; ff k g of a sze w, measured dscretely wth varable dscretzaton step. It s convenent to pl
RECURSIVE SPLINE INTERPOLATION METHOD FOR REAL TIME ENGINE CONTROL APPLICATIONS A. Stotsky Volvo Car Corporaton Engne Desgn and Development Dept. 97542, HA1N, SE- 405 31 Gothenburg Sweden. Emal: astotsky@volvocars.com
More informationOpen Access Linearization Method of Carrier Catalytic Gas Sensor Characteristics Using High-Order Polynomial
Send Orders for Reprnts to reprnts@benthamscence.ae The Open Automaton and Control Systems Journal, 2015, 7, 415-420 415 Open Access Lnearzaton Method of Carrer Catalytc Gas Sensor Characterstcs Usng Hgh-Order
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 informationLOW BIAS INTEGRATED PATH ESTIMATORS. James M. Calvin
Proceedngs of the 007 Wnter Smulaton Conference S G Henderson, B Bller, M-H Hseh, J Shortle, J D Tew, and R R Barton, eds LOW BIAS INTEGRATED PATH ESTIMATORS James M Calvn Department of Computer Scence
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 informationErrors for Linear Systems
Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch
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 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 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 informationarxiv: v1 [math.co] 12 Sep 2014
arxv:1409.3707v1 [math.co] 12 Sep 2014 On the bnomal sums of Horadam sequence Nazmye Ylmaz and Necat Taskara Department of Mathematcs, Scence Faculty, Selcuk Unversty, 42075, Campus, Konya, Turkey March
More informationCapacitor Placement In Distribution Systems Using Genetic Algorithms and Tabu Search
Capactor Placement In Dstrbuton Systems Usng Genetc Algorthms and Tabu Search J.Nouar M.Gandomar Saveh Azad Unversty,IRAN Abstract: Ths paper presents a new method for determnng capactor placement n dstrbuton
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 informationThe Synchronous 8th-Order Differential Attack on 12 Rounds of the Block Cipher HyRAL
The Synchronous 8th-Order Dfferental Attack on 12 Rounds of the Block Cpher HyRAL Yasutaka Igarash, Sej Fukushma, and Tomohro Hachno Kagoshma Unversty, Kagoshma, Japan Emal: {garash, fukushma, hachno}@eee.kagoshma-u.ac.jp
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 informationGrover s Algorithm + Quantum Zeno Effect + Vaidman
Grover s Algorthm + Quantum Zeno Effect + Vadman CS 294-2 Bomb 10/12/04 Fall 2004 Lecture 11 Grover s algorthm Recall that Grover s algorthm for searchng over a space of sze wors as follows: consder the
More informationCOEFFICIENT DIAGRAM: A NOVEL TOOL IN POLYNOMIAL CONTROLLER DESIGN
Int. J. Chem. Sc.: (4), 04, 645654 ISSN 097768X www.sadgurupublcatons.com COEFFICIENT DIAGRAM: A NOVEL TOOL IN POLYNOMIAL CONTROLLER DESIGN R. GOVINDARASU a, R. PARTHIBAN a and P. K. BHABA b* a Department
More informationA new Approach for Solving Linear Ordinary Differential Equations
, ISSN 974-57X (Onlne), ISSN 974-5718 (Prnt), Vol. ; Issue No. 1; Year 14, Copyrght 13-14 by CESER PUBLICATIONS A new Approach for Solvng Lnear Ordnary Dfferental Equatons Fawz Abdelwahd Department of
More informationA DNA Coding Scheme for Searching Stable Solutions
A DNA odng Scheme for Searchng Stable Solutons Intaek Km, HeSong Lan, and Hwan Il Kang 2 Department of ommuncaton Eng., Myongj Unversty, 449-728, Yongn, South Korea kt@mju.ac.kr, hslan@hotmal.net 2 Department
More informationMMA and GCMMA two methods for nonlinear optimization
MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons
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 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 informationChapter 2 A Class of Robust Solution for Linear Bilevel Programming
Chapter 2 A Class of Robust Soluton for Lnear Blevel Programmng Bo Lu, Bo L and Yan L Abstract Under the way of the centralzed decson-makng, the lnear b-level programmng (BLP) whose coeffcents are supposed
More informationAn Upper Bound on SINR Threshold for Call Admission Control in Multiple-Class CDMA Systems with Imperfect Power-Control
An Upper Bound on SINR Threshold for Call Admsson Control n Multple-Class CDMA Systems wth Imperfect ower-control Mahmoud El-Sayes MacDonald, Dettwler and Assocates td. (MDA) Toronto, Canada melsayes@hotmal.com
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 informationEcon107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)
I. Classcal Assumptons Econ7 Appled Econometrcs Topc 3: Classcal Model (Studenmund, Chapter 4) We have defned OLS and studed some algebrac propertes of OLS. In ths topc we wll study statstcal propertes
More informationFeature Selection: Part 1
CSE 546: Machne Learnng Lecture 5 Feature Selecton: Part 1 Instructor: Sham Kakade 1 Regresson n the hgh dmensonal settng How do we learn when the number of features d s greater than the sample sze n?
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 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 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 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 informationNON-CENTRAL 7-POINT FORMULA IN THE METHOD OF LINES FOR PARABOLIC AND BURGERS' EQUATIONS
IJRRAS 8 (3 September 011 www.arpapress.com/volumes/vol8issue3/ijrras_8_3_08.pdf NON-CENTRAL 7-POINT FORMULA IN THE METHOD OF LINES FOR PARABOLIC AND BURGERS' EQUATIONS H.O. Bakodah Dept. of Mathematc
More informationFinding Dense Subgraphs in G(n, 1/2)
Fndng Dense Subgraphs n Gn, 1/ Atsh Das Sarma 1, Amt Deshpande, and Rav Kannan 1 Georga Insttute of Technology,atsh@cc.gatech.edu Mcrosoft Research-Bangalore,amtdesh,annan@mcrosoft.com Abstract. Fndng
More informationChapter 13: Multiple Regression
Chapter 13: Multple Regresson 13.1 Developng the multple-regresson Model The general model can be descrbed as: It smplfes for two ndependent varables: The sample ft parameter b 0, b 1, and b are used to
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 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 informationTHE EFFECT OF TORSIONAL RIGIDITY BETWEEN ELEMENTS ON FREE VIBRATIONS OF A TELESCOPIC HYDRAULIC CYLINDER SUBJECTED TO EULER S LOAD
Journal of Appled Mathematcs and Computatonal Mechancs 7, 6(3), 7- www.amcm.pcz.pl p-issn 99-9965 DOI:.75/jamcm.7.3. e-issn 353-588 THE EFFECT OF TORSIONAL RIGIDITY BETWEEN ELEMENTS ON FREE VIBRATIONS
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 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 information2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification
E395 - Pattern Recognton Solutons to Introducton to Pattern Recognton, Chapter : Bayesan pattern classfcaton Preface Ths document s a soluton manual for selected exercses from Introducton to Pattern Recognton
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 informationSystem in Weibull Distribution
Internatonal Matheatcal Foru 4 9 no. 9 94-95 Relablty Equvalence Factors of a Seres-Parallel Syste n Webull Dstrbuton M. A. El-Dacese Matheatcs Departent Faculty of Scence Tanta Unversty Tanta Egypt eldacese@yahoo.co
More informationA MULTI-OBJECTIVE APPROACH WITH A RESTART META-HEURISTIC FOR THE LINEAR DYNAMICAL SYSTEMS INVERSE MATHEMATICAL PROBLEM
Internatonal Journal on Informaton Technologes & Securty, 1 (vol.10), 2018 93 A MULTI-OBJECTIVE APPROACH WITH A RESTART META-HEURISTIC FOR THE LINEAR DYNAMICAL SYSTEMS INVERSE MATHEMATICAL PROBLEM 1 Ivan
More informationPhysics 5153 Classical Mechanics. D Alembert s Principle and The Lagrangian-1
P. Guterrez Physcs 5153 Classcal Mechancs D Alembert s Prncple and The Lagrangan 1 Introducton The prncple of vrtual work provdes a method of solvng problems of statc equlbrum wthout havng to consder the
More informationHidden Markov Models
Hdden Markov Models Namrata Vaswan, Iowa State Unversty Aprl 24, 204 Hdden Markov Model Defntons and Examples Defntons:. A hdden Markov model (HMM) refers to a set of hdden states X 0, X,..., X t,...,
More informationEnergy Storage Elements: Capacitors and Inductors
CHAPTER 6 Energy Storage Elements: Capactors and Inductors To ths pont n our study of electronc crcuts, tme has not been mportant. The analyss and desgns we hae performed so far hae been statc, and all
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 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 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 informationCredit Card Pricing and Impact of Adverse Selection
Credt Card Prcng and Impact of Adverse Selecton Bo Huang and Lyn C. Thomas Unversty of Southampton Contents Background Aucton model of credt card solctaton - Errors n probablty of beng Good - Errors n
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 informationA New Refinement of Jacobi Method for Solution of Linear System Equations AX=b
Int J Contemp Math Scences, Vol 3, 28, no 17, 819-827 A New Refnement of Jacob Method for Soluton of Lnear System Equatons AX=b F Naem Dafchah Department of Mathematcs, Faculty of Scences Unversty of Gulan,
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 informationLecture 12: Discrete Laplacian
Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly
More informationReport on Image warping
Report on Image warpng Xuan Ne, Dec. 20, 2004 Ths document summarzed the algorthms of our mage warpng soluton for further study, and there s a detaled descrpton about the mplementaton of these algorthms.
More informationWeek 5: Neural Networks
Week 5: Neural Networks Instructor: Sergey Levne Neural Networks Summary In the prevous lecture, we saw how we can construct neural networks by extendng logstc regresson. Neural networks consst of multple
More informationRegularized Discriminant Analysis for Face Recognition
1 Regularzed Dscrmnant Analyss for Face Recognton Itz Pma, Mayer Aladem Department of Electrcal and Computer Engneerng, Ben-Guron Unversty of the Negev P.O.Box 653, Beer-Sheva, 845, Israel. Abstract Ths
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 information18.1 Introduction and Recap
CS787: Advanced Algorthms Scrbe: Pryananda Shenoy and Shjn Kong Lecturer: Shuch Chawla Topc: Streamng Algorthmscontnued) Date: 0/26/2007 We contnue talng about streamng algorthms n ths lecture, ncludng
More informationGHHAGA for Environmental Systems Optimization
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
More informationIrregular vibrations in multi-mass discrete-continuous systems torsionally deformed
(2) 4 48 Irregular vbratons n mult-mass dscrete-contnuous systems torsonally deformed Abstract In the paper rregular vbratons of dscrete-contnuous systems consstng of an arbtrary number rgd bodes connected
More informationHomework Assignment 3 Due in class, Thursday October 15
Homework Assgnment 3 Due n class, Thursday October 15 SDS 383C Statstcal Modelng I 1 Rdge regresson and Lasso 1. Get the Prostrate cancer data from http://statweb.stanford.edu/~tbs/elemstatlearn/ datasets/prostate.data.
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 informationCHAPTER-5 INFORMATION MEASURE OF FUZZY MATRIX AND FUZZY BINARY RELATION
CAPTER- INFORMATION MEASURE OF FUZZY MATRI AN FUZZY BINARY RELATION Introducton The basc concept of the fuzz matr theor s ver smple and can be appled to socal and natural stuatons A branch of fuzz matr
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 informationSelf-Adaptive Simulated Binary Crossover for Real-Parameter Optimization
Self-Adaptve Smulated Bnary Crossover for Real-Parameter Optmzaton Kalyanmoy Deb Dept. of Mechancal Engneerng Indan Inst. of Tech. Kanpur Kanpur, PIN 20806, Inda deb@tk.ac.n S. Karthk Dept. of Mechancal
More informationOn the Interval Zoro Symmetric Single-step Procedure for Simultaneous Finding of Polynomial Zeros
Appled Mathematcal Scences, Vol. 5, 2011, no. 75, 3693-3706 On the Interval Zoro Symmetrc Sngle-step Procedure for Smultaneous Fndng of Polynomal Zeros S. F. M. Rusl, M. Mons, M. A. Hassan and W. J. Leong
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 informationMULTI-OBJECTIVE OPTIMUM DESIGN OF 3D STRUCTURES UNDER STATIC AND SEISMIC LOADING CONDITIONS
4 th GRACM Congress on Computatonal Mechancs GRACM 2002 Patra, 27-29 June, 2002 GRACM MULTI-OBJECTIVE OPTIMUM DESIGN OF 3D STRUCTURES UNDER STATIC AND SEISMIC LOADING CONDITIONS Manols Papadrakaks, Nkos
More information