USING MODIFIED FUZZY PARTICLE SWARM OPTIMIZATION ALGORITHM FOR PARAMETER ESTIMATION OF SURGE ARRESTERS MODELS

Size: px
Start display at page:

Download "USING MODIFIED FUZZY PARTICLE SWARM OPTIMIZATION ALGORITHM FOR PARAMETER ESTIMATION OF SURGE ARRESTERS MODELS"

Transcription

1 Internatonal Journal of Innovatve Computng, Informaton and Control ICIC Internatonal c 2012 ISSN Volume 8, Number 1(B), January 2012 pp USING MODIFIED FUZZY PARTICLE SWARM OPTIMIZATION ALGORITHM FOR PARAMETER ESTIMATION OF SURGE ARRESTERS MODELS Mehd Nafar 1, Gevork B. Gharehpetan 2 and Taher Nknam 3 1 Department of Electrcal Engneerng Scence and Research Branch Islamc Azad Unversty Tehran, Iran m.nafar@srbau.ac.r 2 Electrcal Engneerng Department Amrkabr Unversty of Technology Tehran, Iran grptan@aut.ac.r 3 Department of Electrcal and Electronc Engneerng Shraz Unversty of Technology Shraz, Iran nknam@sutech.ac.r Receved September 2010; revsed January 2011 Abstract. Accurate modelng and parameters dentfcaton of Metal Oxde Surge Arrester (MOSA) are very mportant for arrester allocaton, systems relablty and nsulaton coordnaton studes. Several models wth acceptable accuracy have been proposed to descrbe ths behavor. It should be mentoned that the estmaton of nonlnear elements of MOSAs s very mportant for all models. In ths paper, a new method, whch s the combnaton of Fuzzy Partcle Swarm Optmzaton (FPSO) and Ant Colony Optmzaton (ACO) methods, s proposed to estmate the parameters of MOSA models. The proposed method s named Modfed Fuzzy Partcle Swarm Optmzaton (MFPSO). In the proposed algorthm, to overcome the drawback of the PSO algorthm (convergence to local optma), the nerta weght s tuned by usng fuzzy rules. Also, to mprove the global search capablty and prevent the convergence to local mnma, ACO algorthm s combned to proposed FPSO algorthm. The transent models of MOSA have been smulated by usng ATP-EMTP. The results of smulatons have been appled to the program, whch s based on MFPSO method and can determne the ftness and parameters of dfferent models. The valdty and the accuracy of the estmated parameters are assessed by comparng the predcted resdual voltage wth the expermental results. Also, Usng proposed algorthm, dfferent surge arrester models and V-I characterstcs determnaton methods have been compared. Keywords: Surge arrester models, PSO, ACO, Fuzzy rules, Parameter estmaton 1. Introducton. MOSAs are wdely used as protectve devces aganst lghtnng and swtchng over-voltages. Accurate modelng and smulaton of ther dynamc characterstcs s very mportant for arrester allocaton, systems relablty and nsulaton coordnaton studes [1-7]. For swtchng surge studes, MOSAs can be modeled by ther nonlnear V -I characterstcs [1,2]. However, such a presentaton would not be approprate for fast front transent and lghtnng surge studes. Because the MOSA shows dynamc characterstcs such that the voltage across the surge arrester ncreases as the tme-to-crest of the arrester current decreases and the voltage of arrester reaches a peak before the arrester 567

2 568 M. NAFAR, G. B. GHAREHPETIAN AND T. NIKNAM current peaks [6]. Typcally, the resdual voltage of an mpulse current havng a front tme equal to 1 µs s 8-12% hgher than that predcted for an mpulse current havng a front tme equal to 8 µs. The resdual voltage of a longer tme-to-crest between 45 and 60 µs, s 2-4% lower than that of a 8 µs current mpulse [6]. In order to reproduce the MOSA dynamc characterstcs, many studes have been focused on modelng and smulaton of MOSAs [1-6]. In [1], a dynamc model has been presented by IEEE, whch s based on database for fast mpulse currents (tme-to-crest of µs). The IEEE model has been smplfed and changed to other models by other researchers [2,3]. The man problem of these models s essentally ther parameters calculaton and estmaton [1-7]. It should be noted that the determnaton of nonlnear resstors of MOSA s very mportant for the proposed models. These resstors could be presented by voltage-current tables gven n [1]. Also, the voltage-current characterstc of a nonlnear resstor could be presented by an exponental equaton [6]. In ths paper, the combnaton of algorthms has been proposed to determne the best parameters for MOSAs models. One of the evolutonary algorthms that have shown great potental and good perspectve for the soluton of varous optmzaton problems s Partcle Swarm Optmzaton (PSO) [8]. The PSO algorthm was developed through smulaton of a smplfed socal system such as socal behavor of brds flockng or fsh schoolng [8]. PSO has been found to be robust n solvng contnuous nonlnear optmzaton problems. However, the performance of the standard PSO greatly depends on ts parameters, such as nerta weght, cogntve and the socal parameters, and t often suffers from the problem of beng trapped n the local optma. Eben et al. [11] descrbed two ways of defnng the parameter values: adaptve parameter control and self-adaptve parameter control. In the former, the parameter values change accordng to a heurstc rule that takes feedback from the current search state, whle n the latter, the parameters of the meta-heurstc are ncorporated nto the representaton of the soluton. Thus, the parameter values evolve together wth the solutons of the populaton. In ths paper, an adaptve parameter control s used for nerta weght usng a fuzzy logcal controller. Also, n order to avod trappng n local optma, Ant Colony Optmzaton (ACO) algorthm s combned to Fuzzy PSO (FPSO) to explore the search space much more effcently. Usng the proposed algorthm and lnkng the MATLAB and EMTP programs, parameters of MOSA models are estmated. Based on the estmated parameters, the models have been smulated and then the results of smulatons have been compared wth the expermental results. The results show the ablty of the proposed algorthm n determnng the surge arrester parameters. Also, usng proposed algorthm, dfferent surge arrester models and V -I characterstcs determnaton methods have been compared. The man contrbutons of ths paper are as follows: () Present a new method for parameters estmaton of all surge arrester models wthout the need for the formulaton, equaton and nformaton on the surge arrester dmensons. () Present a new modfed evolutonary optmzaton algorthm based on PSO and ACO algorthms and fuzzy rules. () Apply the proposed optmzaton algorthm on parameter estmaton of surge arrester problem by usng a new method for lnkng the MATLAB and EMTP programs. 2. Surge Arresters Modelng. The transent models of MOSAs are necessary for nsulaton coordnaton and relablty studes of power systems. Several surge arrester models have been proposed to descrbe the transent behavor of surge arresters [1-3]. In ths paper, transent models are nvestgated n the followng text. The model, shown n Fgure 1, has been suggested by IEEE WG group [1]. As t s shown n ths fgure, the nonlnear V -I characterstcs has been modeled by two

3 USING MODIFIED FPSO ALGORITHM FOR PARAMETER ESTIMATION 569 nonlnear resstors A 0 and A 1 whch are separated by a RL low pass flter. The calculaton of parameters of ths model has been presented n [4]. It s based on the estmated heght of the arrester column, the number of columns of MO dsks and Table 1. Table 1. V -I characterstcs for A 0 and A 1 (V 10 s the dscharge voltage (n kv) for a 10 ka, 8/20 µs current) Current Voltage (per unt of V 10 ) (ka) A 0 A Fgure 1. IEEE model The model, shown n Fgure 2, has been proposed by Pncet [2]. calculaton procedure for ths model has been presented n [2]. The parameters Fgure 2. Pncet model In [3], Fernandez et al. have presented another model whch s based on IEEE model too. Ths model s shown n Fgure 3. An teratve tral and error procedure has been proposed n [3], to determne the model parameters.

4 570 M. NAFAR, G. B. GHAREHPETIAN AND T. NIKNAM Fgure 3. Fernandez model The dentfcaton of nonlnear parts of MOSAs s mportant for the proposed models. The voltage-current characterstcs of a nonlnear resstor can be drectly expressed by Equaton (1) [6]. I = p (V/V ref) q (1) where p and q are constant values, V and I are voltage and current of surge arrester, respectvely, and V ref s an arbtrary reference voltage. For the models based on IEEE model, the ntal nonlnear V -I characterstcs values of A 0 and A 1 could be determned by Table 1 [1,4-6]. The procedures mentoned above, do not always result n the best parameters, but they can provde a good estmaton (a startng pont) [1-6]. It should be noted that these methods are lmted to mentoned models. In recent years, several researches have been presented for estmatng the parameters of all models [5,6]. A numercal method has been proposed for dentfyng the parameters of three suggested models n [5]. Ths method s based on comparson of the smulaton results of resdual voltages and the results derved from 8/20 µs expermental measurements [5]. In ths method, parameters of surge arrester models are estmated by mnmzng the followng objectve functon: F = T 0 W (t) [V (t, x) V m(t)] 2 dt (2) where F s sum of the quadratc error, T s duraton of appled mpulse current sgnal, V (t, x) s the estmated resdual voltage obtaned from smulaton results, V m(t) s the measured voltage, x s the state varable vector (surge arrester model parameters) and W (t) s the weghtng functon, derved from numercal expermentaton. In ths method, the non-lnear resstances have been presented by pecewse functons and consequently a lnearzaton has been adopted. The problem of optmzaton has been solved n two stages wth an am of avodng possble numercal oscllatons of the predcted voltage. In ths paper, a new method based on heurstc algorthms s suggested to estmate the best parameters of MOSAs models. Proposed method s general and can be appled to all surge arrester models. Unlke exstng procedures, equaton or formulaton and nformaton on the surge arrester dmensons are not necessary. Also, the applcaton of the weghtng functon s not necessary n suggested method and the non-lnear resstors can be represented based on Equaton (1) or based on Table 1. Also, usng proposed algorthm, nonlnear characterstcs of surge arrester are estmated va Equaton (1) and then they are compared wth the results of the IEEE method (usng Table 1). 3. Objectve Functon. The ATP-EMTP software has been used as the smulaton tool. The 8/20 µs mpulse current s appled to the smulated models of surge arresters. The smulated resdual voltage of each model s compared wth the expermental data obtaned

5 USING MODIFIED FPSO ALGORITHM FOR PARAMETER ESTIMATION 571 from [7]. The comparson method s based on Equaton (3), as follows: F = T 0 [V (t, x) V m(t)] 2 dt (3) Ths objectve functon can be rewrtten n the dscrete form, as follows: F = N [V (j t, x) V m (j t)] 2 t (4) j=1 where N s the number of dscrete ponts and the t = T/N s computaton tme step. The parameters of surge arrester Models ( x), determned by proposed algorthm n MATLAB, are mported to the EMTP. In ths paper, the smulaton s carred out by usng the 10 ka, 8/20 µs mpulse current. The chosen step tme n smulaton s 0.5 µs. So, the resdual voltage vector of each model (V (t, x)) s determned by EMTP and then s compared wth the measured voltage vector (V m(t)). The objectve functon s evaluated and mnmzed by usng the proposed algorthm and the best parameters of surge arrester models ( x) are estmated. 4. Algorthm of Optmzaton ACO algorthm. Snce ants are blnd nsects, whch lve together, they fnd the shortest path from the nest to the food wth the ad of pheromone. A chemcal materal deposted by the ants, pheromone serves as a crtcal communcaton faclty among ants whch help them n ther path recognton. Pheromone ntensty deposted by ants determnes the shortest path n ther way to food. Generally, the state transton probablty to select the next path can be expressed, as follows: (τ j ) γ 2 (1/L j ) γ 1 P j = (5) NA (τ j ) γ 2 (1/L j ) γ 1 j=1,j After choosng the next path, updatng the tral ntensty of pheromone s as: τ j (k + 1) = ρτ j (k) + τ j (6) where τ j s the ntensty of pheromone between the nodes j and, L j s the length of path between the nodes j and, γ 1 s the control parameter for determnng the weght of tral ntensty, γ 2 s the control parameter for determnng the weght of the length of path, NA s the number of ants, ρ s a coeffcent such that (1 ρ) represents evaporaton of tral between tme k and k + 1 and τ j s the amount of pheromone tral added to τ j by ants Standard PSO algorthm. PSO s a populaton based stochastc optmzaton algorthm, nspred by socal behavor of brd flockng or fsh schoolng, developed by Eberhart and Kennedy. It s a useful technque to solve many optmzaton problems [8-10]. PSO shares many smlartes wth evolutonary computaton technques such as Genetc Algorthms (GA). The system s ntalzed by a populaton of random solutons and searches for optma by updatng generatons. However, unlke GA, PSO has no evoluton operators such as crossover and mutaton. In PSO algorthm, the potental

6 572 M. NAFAR, G. B. GHAREHPETIAN AND T. NIKNAM solutons, called partcles, fly through the problem space by followng the current optmum partcles. Equaton (7) could descrbe the content of ths concept. ( ) ( ) V (t+1) = ω.v (t) + c 1.rand 1 (.). P best X (t) + c 2.rand 2 (.). Gbest X (t) (7) X (t+1) = X (t) + V (t+1) where rand 1 (.) and rand 2 (.) are random number between 0 and 1, Pbest s best prevously recorded experence of the th partcle, Gbest s best partcle among the entre populaton and the constants c 1 and c 2 are weghtng coeffcents of the stochastc acceleraton terms whch stmulate each partcle towards Pbest and Gbest postons. Low values allow partcles to go far from the target regon [13,14]. The coeffcents c 1 and c 2 are often set to 2.0 accordng to prevous experences [8-10]. The approprate selecton of nerta weght ω n Equaton (7) provdes a proper global and local search as t s essental to mnmze teraton average to acheve a suffcent optmal soluton. Approxmately the coeffcent ω often decreases lnearly from 0.9 to 0.4 durng a run. Generally, Equaton (8) could present the nerta weght ω as follows: ω (t+1) ωmax ωmn = ωmax t (8) t max where ω max and ω mn are maxmum and mnmum of the nerta weght, respectvely, and t max s maxmum number of teratons Fuzzy adaptve nerta weght factor. In PSO, the search process s a nonlnear and dynamc procedure. Therefore, when the envronment tself s dynamcally changed over the tme, the optmzaton algorthm should be able to adapt dynamcally to the changng envronment. The change of the partcle s stuaton s drectly correlated to the nerta weght. Proper choce of the nerta weght ω provdes a balance between global and local optmum ponts [10]. Several methods have been appled to handle the nerta weght durng the progresson of the optmzaton process. Constant nerta weght, lnearly decreasng nerta weght and random nerta weght are some examples [12,13]. In ths paper, a fuzzy IF/THEN rules s used to adaptvely control the nerta weght of PSO. Four steps are taken to create the fuzzy system: fuzzfcaton, fuzzy rules, fuzzy reasonng and defuzzfcaton. These steps are descrbed n the followng subsectons. (1) Fuzzfcaton. The fuzzfcaton comprses the process of transformng crsp values nto grades of membershp for lngustc terms of fuzzy sets [14]. For each nput and output selected varable, two or more membershp functons are descrbed. Normally, they are three but can be more. In ths paper, among a set of membershp functons, left-trangle, trangle and rght trangle membershp functons are used for every nput and output as shown n Fgure 4. All the membershps of nput are presented n three lngustc levels; S, M and L for small, medum and large, respectvely n Table 2. The output varable has been presented n three fuzzy sets of lngustc values; NE (negatve), ZE (zero) and PE (postve) wth assocated membershp functons, as shown n Fgure 4 [12]. (2) Fuzzy rules. The fuzzy rules are a seres of IF-THEN statements. These statements are usually derved by an expert to acheve optmum results. In ths paper, the Mamdan-type fuzzy rules have been used to evaluate the condtonal statements that comprse fuzzy logc. For example: f (NFV s L) and (ω s M) THEN ( ω s ZE), where NFV s normalzed ftness value and NFV s an nput varable between 0 and 1. The fuzzy rules of Table 2 are used to select the nerta weght correcton ( ω). Each rule represents a mappng from the nput space to the output space. (3) Fuzzy reasonng. In ths paper, Mamdan s fuzzy nference method s used to map the nputs to the outputs. The AND operator s used for the combnaton of membershp

7 USING MODIFIED FPSO ALGORITHM FOR PARAMETER ESTIMATION 573 (a) (b) (c) Fgure 4. Membershp functons of nputs and outputs: (a) NFV, (b) ω and (c) ω Table 2. Fuzzy rules for varatons of nerta weght ω NFV ω S M L S ZE NE NE M PE ZE NE L PE ZE NE values for each fred rule to generate the membershp values for the fuzzy sets of output varables n the consequent part of the rule. Snce there may be several rules fred n the rule sets for some fuzzy sets of the output varables there may be dfferent membershp values obtaned from dfferent fred rules. To obtan a better nerta weght under the fuzzy system, the current best performance evaluaton and current nerta weght are selected as nputs varables; where as the output varable s the change n the nerta weght. The NFV s used as an nput varable between 0 and 1, and s defned as: NF V = F V F V mn (9) F V max F V mn In the frst teraton, the calculated value of F V may be selected as F V mn for the next teratons. In Equaton (9), F V max s the worst soluton for the mnmzaton process. Typcal nerta weght value s n range of Both postve and negatve correctons lmts are requred for the nerta weght. Therefore, a range of [ ] has been chosen for the nerta weght correcton. ω t+1 = ω t + ω (10) In order to choose an approprate representatve value as the fnal output (crsp values), defuzzfcaton must be done. It wll be llustrated at a later pont. (4) Defuzzfcaton. In order to obtan a crsp value, the output must be defuzzyfed. For defuzzfcaton of every nput and output, the method of centrod (center-of-sums) has been used for the membershp functons as shown n Fgure Proposed MFPSO algorthm. The PSO method should be consdered as a useful method, whch s powerful enough to handle varous knds of nonlnear optmzaton problems. Nevertheless, t may be trapped nto local optma, f over a number of teratons, global best and local best postons are equal to the poston of the partcle. Recently, numerous deas have been used to overcome ths drawback usng other global optmzaton algorthms such as Evolutonary Programmng (EP), Genetc Algorthm (GA) or

8 574 M. NAFAR, G. B. GHAREHPETIAN AND T. NIKNAM Smulated Annealng (SA) along wth the PSO [9]. The performance of the standard PSO greatly depends on ts parameters, such as nerta weght, cogntve and the socal parameters, and t often suffers from the problem of beng trapped n the local optma. In ths paper, an adaptve parameter control s used for nerta weght by usng a fuzzy logcal controller. Also, n order to avod trappng n local optma, ACO algorthm s combned to FPSO to explore the search space much more effcently. Ths new algorthm proposes the applcaton of the ntellgent decson-makng structure of ACO algorthm to the APSO algorthm such that a unque global best poston s obtaned for each partcle. However, t uses random selecton procedure of ACO algorthm to determne dfferent global best postons of each dstnct agent. Ths algorthm, called Modfed Fuzzy Partcle Swarm Optmzaton (MFPSO) s used to mnmze the cost functon of the surge arrester parameters estmaton problem. The proposed MFPSO algorthm has the followng steps: Step 1: Generate the ntal populaton and ntal velocty. The ntal populaton and ntal velocty of each partcle are randomly generated, as follows: x 1 P opulaton = x 2..., x = [x ] 1 n (11) x NSwarm x = rand(.) (x max x mn V 1 V elocty = V 2... V NSwarm ) + x mn, V = [v ] 1 n (12) v = rand(.) (v max v mn ) + v mn where N Swarm s the number of the swarms, n s the number of the state varable, x max and x mn are the maxmum and mnmum of th state varable, respectvely and v max and v mn are the maxmum and mnmum velocty of th state varable. Step 2: Generate the ntal tral ntensty. In ths ntalzaton phase, t s assumed that the tral ntensty between each par of swarms s the same and s generated, as follows: T ral Intensty = [τ j ] NSwarm N Swarm, τ j = τ 0 (13) where τ 0 s the ntal tral ntensty. Step 3: Couplng to EMTP. The surge arrester model s smulated by EMTP usng the gven data (parameters). Then, the smulaton results are transferred to the MFPSO-based developed program to calculate the objectve functon. Step 4: Calculate the objectve functon. The objectve functon (.e., Equaton (4)) s calculated for each ndvdual by usng the smulaton results obtaned n Step 3. Step 5: Sort the ntal populaton. In ths step, the ntal populaton s sorted n ascendng order consderng the value of the objectve functon of each ndvdual. Step 6: Select the best global poston. The ndvdual that has the mnmum value of the objectve functon s selected as the best global poston (.e., Gbest). Step 7: Select the best local poston. The best local poston (Pbest) s selected for each ndvdual.

9 USING MODIFIED FPSO ALGORITHM FOR PARAMETER ESTIMATION 575 Step 8: Update the parameters. In ths algorthm, the proper choce of nerta weght, ω, s updated by the fuzzy rules. Step 9: Select the th ndvdual. The th ndvdual s selected and neghbors of ths partcle should be dynamcally defned as follows: S = x j x x j 2D 0 1 ( ) at, j (14) 1 exp where D 0 s the ntal neghborhood radus and a s the parameter used to tune the neghborhood radus. Step 10: Calculate the next poston for the th ndvdual. There are two approaches to calculate the next poston, as follows: Approach A) f S {}, where {} stands for the null set In ths case, the transton probabltes between x and each ndvdual n S are calculated by the followng equaton: t max [P robablty] = [P 1, P 2,..., P,M ] 1 M, P j = (τ j) γ 2 (1/L j ) γ 1, L M j = (τ j ) γ 2 (1/L j ) γ 1 j=1 1 F (x ) F (x j ) (15) Then, the cumulatve probabltes are calculated as follows: [Cumulatve probablty] = [C 1, C 2,..., C M ] 1 M C 1 = P 1, C 2 = C 1 + P 2,..., C j = C j 1 + P j,..., C M = C M 1 + P M (16) where M s the number of members n S and C j s the cumulatve probablty for the j th ndvdual n S. The roulette wheel s used for the stochastc selecton of the best global poston, as follows: A number between 0 and 1 s randomly generated and s compared wth the calculated cumulatve probabltes. The frst term of the cumulatve probabltes (C j ), whch s greater than the generated number, s selected and the assocated poston s consdered as the best global poston. Then, the th partcle s moved accordng to followng rules, f x j s selected as the best: V (t+1) x (t+1) ( ) = ω.v (t) + c 1.rand 1 ( ). P best x (t) ( ) + c 2.rand 2 ( ). x j x (t) = x (t) + V (t+1) (17) The presumed pheromone level between X and X j s updated n the next stage: τ j (t + 1) = ρ.τ j (t) + P j (18) Approach B) f S = {}, whch means there s not any ndvdual n partcle s neghborhood.

10 576 M. NAFAR, G. B. GHAREHPETIAN AND T. NIKNAM In ths case, the th partcle s moved accordng to the followng rules: ( ) V (t+1) = ω.v (t) + c 1.rand 1 ( ). P best x (t) ( ) + c 2.rand 2 ( ). Gbest x (t) x (t+1) = x (t) + V (t+1) Then, the tral ntensty s updated as follows: (19) τ j (t + 1) = ρ.τ j (t) + r; 0.1 r 0.5 (20) where ndex j represents the best partcle ndex n the group. The modfed poston for the th ndvdual s checked wth ts lmt. Step 11: If all ndvduals have been selected, go to the next step, otherwse, = + 1 and go back to Step 5. Step 12: Check the termnaton crtera. If the current teraton number reaches the predetermned maxmum teraton number, the search procedures should be stopped; otherwse the ntal populaton s replaced by the new populaton of swarms and then the algorthm goes back to Step 3. The last Gbest s the soluton of the problem. 5. Lnk between EMTP and MATLAB. Both ATP-EMTP and MATLAB are currently avalable on popular computer for engneerng applcatons. It could be sad that the best optmzaton algorthms can be easly developed n MATLAB and transent models of power system elements can be smulated by ATP-EMTP. To use the ablty of both soft wares, a lnk between these programs s necessary. In [16], several technques for lnk between EMTP and MATLAB have been presented, where MATLAB functons can be called n EMTP. However, n ths paper, ATP fles have been called as an nput fle of MATLAB. Ths approach s much easer than the other one. The surge arrester parameters have been estmated by usng MFPSO algorthm developed n MATLAB and the surge arrester models have been smulated by EMTP [15]. A FORTRAN code fle (ATP fle) has been developed for each EMTP Smulaton fle. By usng nput/output functons of MATLAB, ATP fle can be called n MATLAB and can be modfed. So, the surge arrester parameters can be modfed accordng to MFPSO outputs. Usng SYSTEM command, the modfed ATP fle can be run n MATLAB. After runnng the ATP fle, a LIS fle s generated whch contans the smulaton outputs of surge arrester models are n ths fle. Then, usng nput/output functon, LIS fle could be opened n MATLAB and the resdual voltage of smulaton could be returned to MFPSO algorthm n MATLAB. Ths procedure can be repeated. 6. Parameter Estmaton of Surge Arrester Models. The surge arrester models have been smulated by ATP-EMTP. Equaton (1) can be used to determne V -I characterstc of A 0 and A 1 n MOSA models. In ths equaton, three parameters (p, q and V reff ) must be dentfed for each nonlnear resstor. Accordng to data gven n Table 1, V -I characterstcs of A 0 and A 1 can also be determned. In ths case, the frst step of the smulaton s multplyng the per unt values of voltages by V 10 and then the coeffcents (V reff ) of A 0 and A 1 are selected such that the smulated voltage and the expermental results are approached. So, n ths case, a V reff must be determned for each nonlnear element. In ths secton, MOSAs parameters models (lnear and nonlnear parameters) have been estmated by the suggested algorthm for models of [1-3]. The surge arrester parameters, estmated by MFPSO algorthm n MATLAB, are mported to the EMTP.

11 USING MODIFIED FPSO ALGORITHM FOR PARAMETER ESTIMATION 577 The smulaton s carred out usng the 10 ka, 8/20 µs mpulse current. Durng optmzaton, the resdual voltage of each model s determned by EMTP and then t s transferred to MFPSO algorthm n MATLAB to evaluate the ftness functon. Ths procedure contnues untl the optmal soluton s determned for parameters of that model. The resdual voltage of smulatons s compared to the expermental data gven on [7]. The estmated parameters of all models, determned usng Equaton (1) and the expermental data of [7], are lsted n Table 3. A comparson among expermental and the smulated resdual voltage obtaned by estmated parameters of the models of [1-3] based on Equaton (1) s shown n Fgure 5. Fgure 5. Comparson between measured and smulated results based on Equaton (1) Table 3. Estmated parameters (usng Equaton (1)) parameter Model of [1] Model of [2] Model of [3] R 0 (Ω) R 1 (Ω) L 0 (µh) L 1 (µh) C (nf ) p q p q V reff 0 [V ] V reff 1 [V ] Accordng to the results of [7], the nonlnear V -I characterstcs of A 0 and A 1 for the models of [1-3] have been estmated by usng the data of Table 1. The results have been lsted n Table 4. The resdual voltages determned by estmated surge arrester models and measured by [7] have been shown n Fgure 6.

12 578 M. NAFAR, G. B. GHAREHPETIAN AND T. NIKNAM Table 4. Estmated parameters (usng data of Table 1) parameter Model of [1] Model of [2] Model of [3] R 0 (Ω) R 1 (Ω) L 0 (µh) L 1 (µh) C (nf ) V reff 0 [V ] V reff 1 [V ] Fgure 6. Comparson between measured and smulated results based on Table 1 Comparng Fgures 5 and 6, t can be seen that V -I characterstcs of nonlnear parts of all surge arrester models can be determned by both methods. As t can be seen n ths fgure, the smulaton results have a good agreement wth the expermental data. As t could be seen n these fgures, for IEEE model, the result obtaned by Equaton (1) s more accurate than the IEEE method, especally for the end part of the curve. It should be sad that both methods are accurate enough for nsulaton coordnaton studes. However, the model accordng to Equaton (1) can determne the energy absorpton of surge arrester better than the IEEE method. For the Pncet model, both methods are accurate enough but for the Fernandez model, the model based on Equaton (1) has a better agreement wth expermental data. It should be noted that, usng proposed method, parameters of all surge arrester models could be properly estmated. 7. Error Analyss. In [7], measurements were performed to get the response of surge arrester block for two types of mpulse currents. These currents are steep front wave mpulse (1/2 µs) and standard mpulse (8/20 µs) mpulse currents. The peak values of mpulse currents were changed n each mpulse test. The peak values of measured resdual voltages of arrester block for these mpulses are presented n Tables 5 and 6. In ths secton, usng these expermental data, the ablty of the proposed method to estmate the parameters of surge arrester models and the ablty of models to smulate

13 USING MODIFIED FPSO ALGORITHM FOR PARAMETER ESTIMATION 579 the arrester dynamc behavor are presented. The models of [1-3], have been smulated n EMTP based on the estmated parameters of Tables 3 and 4. The current peak values n smulaton are 2.5 ka, 5 ka and 10 ka and the selected rse and fall tmes are 1/2 µs and 8/20 µs. The 1/2 µs mpulse current has been appled to the models and the smulaton results have been used to determne the error by the followng equaton: Error% = V sm V meas V meas 100 (21) where V sm and V meas are the peak values of smulated and measured resdual voltage, respectvely. The results of ths calculaton have been presented n Table 5. The same smulatons and calculatons have been repeated for 8/20 µs mpulses. The results are presented n Table 6. In these tables, P.C. and P.V. stand for peak of mpulse current and peak of measured resdual voltage, respectvely. Accordng to the results of these tables, the followng ponts could be drawn: The surge arrester models based on the data of table1 are more accurate n comparson wth the models based on Equaton (1); All surge arrester models smulate the dynamc behavor of MOSA properly; The suggested procedure can be appled to all surge arrester models and; The proposed algorthm (MFPSO) s a powerful tool for dentfyng parameters of all surge arrester models. Table 5. Comparson between measured and smulated results P.C. = 2.58 ka P.V. = 7.46 kv P.C. = 5.04 ka P.V. = 7.97 kv P.C. = ka P.V. = 8.62 kv 1/2 µs mpulse current Models Based on Equaton (1) Based on data of Table 1 Peak of Resdual Error % Peak of Resdual Error % IEEE Fernandeze Pncet IEEE Fernandeze Pncet IEEE Fernandeze Pncet Conclusons. In ths paper, a new algorthm based on the combnaton of Fuzzy partcle swarm optmzaton (FPSO) and ant colony optmzaton (ACO) has been proposed to mprove the performance of PSO algorthm. In ths proposed algorthm, known as MFPSO, to overcome the problem of the premature convergence observed n many applcatons of PSO, the nerta weght has been tuned by usng fuzzy rules. Also, to mprove the global search capablty and prevent the convergence to local mnma, ACO algorthm has been combned to proposed FPSO algorthm. A new method based on the MFPSO algorthm, and lnkng the MATLAB and EMTP programs has been proposed to estmate the parameters of MOSA models. Usng the proposed algorthm, the parameters are estmated based on the MOSA resdual voltage measurements. Also, usng MFPSO algorthm, a comparatve study among dfferent methods of the surge arrester nonlnear V -I characterstcs modelng has been conducted n ths paper. It s show that the result obtaned by usng Equaton (1) s more accurate for energy absorpton studes of surge

14 580 M. NAFAR, G. B. GHAREHPETIAN AND T. NIKNAM Table 6. Comparson between measured and smulated results P.C. = 2.50 ka P.V. = 7.01 kv P.C. = 5.01 ka P.V. = 7.49 kv P.C. = ka P.V. = 8.08 kv 8/20 µs mpulse current Models Based on Equaton (1) Based on data of Table 1 Peak of Resdual Error % Peak of Resdual Error % IEEE Fernandeze Pncet IEEE Fernandeze Pncet IEEE Fernandeze Pncet arrester. However, the IEEE method (for V -I characterstcs determnaton) s more accurate for nsulaton coordnaton studes. Also, t s shown that the estmated parameters of all models n the smulaton results are n a good agreement wth the resdual voltage measurements. It should be noted that the prevous studes were lmted to specal models but the proposed algorthm s general and comparng wth other algorthms, t can be easly mplemented and ts convergence speed s consderable. Acknowledgment. Ths work s partally supported by Islamc Azad Unversty, Scence and Research Branch, Tehran, Iran. The authors also gratefully acknowledge the helpful comments and suggestons of the revewers, whch have mproved the presentaton. REFERENCES [1] IEEE WG , Modelng of metal oxde surge arrester, IEEE Trans. on Power Delvery, vol.7, pp , [2] P. Pncet and M. Gannetton, A smplfed model for znc oxde surge arresters, IEEE Trans. on Power Delvery, vol.14, pp , [3] F. Fernandez and R. Daz, Metal oxde surge arrester model for fast transent smulaton, Proc. of the Internatonal Conference on Power System Transents, pp , [4] J. A. Martnez and D. W. Durbak, Parameter determnaton for modelng systems transents Part V: Surge arrester, IEEE Trans. on Power Delvery, vol.20, no.3, pp , [5] H. J. L, S. Brlasekaran and S. S. Cho, A parameter dentfcaton technque for metal-oxde surge arrester models, IEEE Trans. on Power Delvery, vol.17, no.3, pp , [6] M. Nafar, G. B. Gharehpetan and T. Nknam, A new parameter estmaton algorthm for metal oxde surge arrester, Journal of Electrc Power Components and Systems, vol.39, no.7, pp , [7] I. Km, T. Funabash, H. Sasak and T. Hagwara, Study of ZnO arrester model for steep front wave, IEEE Trans. on Power Delvery, vol.11, pp , [8] J. Kennedy and R. Eberhart, Partcle swarm optmzaton, IEEE Internatonal Conf. on Neural Networks, pp , [9] Z.-L. Gang, Partcle swarm optmzaton to solvng the economc dspatch consderng the generator constrants, IEEE Trans. on Power System, vol.18, pp , [10] Y. Sh and R. Eberhart, A modfed partcle swarm optmzer, Proc. of the IEEE World Congress on Computatonal Intellgence, pp.69-73, [11] A. E. Eben, R. Hnterdng and Z. Mchalewcz, Parameter control n evolutonary algorthms, IEEE Transactons on Evolutonary Computaton, vol.3, pp , [12] P. Bajpa and S. N. Sngh, Fuzzy adaptve partcle swarm optmzaton for bddng strategy n unform prce spot market, IEEE Trans. on Power System, vol.22, pp , 2007.

15 USING MODIFIED FPSO ALGORITHM FOR PARAMETER ESTIMATION 581 [13] C. C. Chu, M. J.-J. Wu, Y.-T. Tsa, N.-H. Chu, M. S.-H. Ho and H.-J. Shyu, Constran-based partcle swarm optmzaton (CBPSO) for call center schedulng, Internatonal Journal of Innovatve Computng, Informaton and Control, vol.5, no.12(a), pp , [14] T. Wang, Y. Chen and S. Tong, Fuzzy mproved nterpolatve reasonng methods for the sparse fuzzy rule, ICIC Express Letters, vol.3, no.3(a), pp , [15] Canadan/Amercan EMTP User Group, Alternatve Transents Program Rule Book, European EMTP Center, Leuven, Belgum, [16] J. Mahseredjan, G. Benmouyal and X. Lombard, A lnk between EMTP and MATLAB for userdefned modelng, IEEE Trans. on Power Delvery, vol.13, no.2, pp , 1998.

A novel parameter estimation method for metal oxide surge arrester models

A novel parameter estimation method for metal oxide surge arrester models Sādhanā Vol. 36, Part 6, December 2011, pp. 941 961. c Indan Academy of Scences A novel parameter estmaton method for metal oxde surge arrester models MEHDI NAFAR 1,, GEVORK B GHAREHPETIAN 2 and TAHER

More information

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization

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

More information

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS

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

More information

CHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION

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

More information

Training ANFIS Structure with Modified PSO Algorithm

Training ANFIS Structure with Modified PSO Algorithm Proceedngs of the 5th Medterranean Conference on Control & Automaton, July 7-9, 007, Athens - Greece T4-003 Tranng ANFIS Structure wth Modfed PSO Algorthm V.Seyd Ghomsheh *, M. Alyar Shoorehdel **, M.

More information

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

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

More information

OPTIMIZATION OF FUZZY RULE BASES USING CONTINUOUS ANT COLONY SYSTEM

OPTIMIZATION OF FUZZY RULE BASES USING CONTINUOUS ANT COLONY SYSTEM Proceedng of the Frst Internatonal Conference on Modelng, Smulaton and Appled Optmzaton, Sharah, U.A.E. February -3, 005 OPTIMIZATION OF FUZZY RULE BASES USING CONTINUOUS ANT COLONY SYSTEM Had Nobahar

More information

Determining the Optimal Bandwidth Based on Multi-criterion Fusion

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

More information

Clustering Algorithm Combining CPSO with K-Means Chunqin Gu 1, a, Qian Tao 2, b

Clustering Algorithm Combining CPSO with K-Means Chunqin Gu 1, a, Qian Tao 2, b Internatonal Conference on Advances n Mechancal Engneerng and Industral Informatcs (AMEII 05) Clusterng Algorthm Combnng CPSO wth K-Means Chunqn Gu, a, Qan Tao, b Department of Informaton Scence, Zhongka

More information

Learning the Kernel Parameters in Kernel Minimum Distance Classifier

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

More information

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

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

More information

An Optimal Algorithm for Prufer Codes *

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

More information

Parallelism for Nested Loops with Non-uniform and Flow Dependences

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

More information

Optimal Design of Nonlinear Fuzzy Model by Means of Independent Fuzzy Scatter Partition

Optimal Design of Nonlinear Fuzzy Model by Means of Independent Fuzzy Scatter Partition Optmal Desgn of onlnear Fuzzy Model by Means of Independent Fuzzy Scatter Partton Keon-Jun Park, Hyung-Kl Kang and Yong-Kab Km *, Department of Informaton and Communcaton Engneerng, Wonkwang Unversty,

More information

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices Internatonal Mathematcal Forum, Vol 7, 2012, no 52, 2549-2554 An Applcaton of the Dulmage-Mendelsohn Decomposton to Sparse Null Space Bases of Full Row Rank Matrces Mostafa Khorramzadeh Department of Mathematcal

More information

GA-Based Learning Algorithms to Identify Fuzzy Rules for Fuzzy Neural Networks

GA-Based Learning Algorithms to Identify Fuzzy Rules for Fuzzy Neural Networks Seventh Internatonal Conference on Intellgent Systems Desgn and Applcatons GA-Based Learnng Algorthms to Identfy Fuzzy Rules for Fuzzy Neural Networks K Almejall, K Dahal, Member IEEE, and A Hossan, Member

More information

A Binarization Algorithm specialized on Document Images and Photos

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

More information

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

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

More information

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

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

More information

CHAPTER 4 OPTIMIZATION TECHNIQUES

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

More information

EECS 730 Introduction to Bioinformatics Sequence Alignment. Luke Huan Electrical Engineering and Computer Science

EECS 730 Introduction to Bioinformatics Sequence Alignment. Luke Huan Electrical Engineering and Computer Science EECS 730 Introducton to Bonformatcs Sequence Algnment Luke Huan Electrcal Engneerng and Computer Scence http://people.eecs.ku.edu/~huan/ HMM Π s a set of states Transton Probabltes a kl Pr( l 1 k Probablty

More information

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

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

More information

Smoothing Spline ANOVA for variable screening

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

More information

A Novel Deluge Swarm Algorithm for Optimization Problems

A Novel Deluge Swarm Algorithm for Optimization Problems A Novel eluge Swarm Algorthm for Optmzaton Problems Anahta Samad,* - Mohammad Reza Meybod Scence and Research Branch, Islamc Azad Unversty, Qazvn, Iran Soft Computng Laboratory, Computer Engneerng and

More information

Optimizing SVR using Local Best PSO for Software Effort Estimation

Optimizing SVR using Local Best PSO for Software Effort Estimation Journal of Informaton Technology and Computer Scence Volume 1, Number 1, 2016, pp. 28 37 Journal Homepage: www.jtecs.ub.ac.d Optmzng SVR usng Local Best PSO for Software Effort Estmaton Dnda Novtasar 1,

More information

S1 Note. Basis functions.

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

More information

Review of approximation techniques

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

More information

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

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

More information

X- Chart Using ANOM Approach

X- Chart Using ANOM Approach ISSN 1684-8403 Journal of Statstcs Volume 17, 010, pp. 3-3 Abstract X- Chart Usng ANOM Approach Gullapall Chakravarth 1 and Chaluvad Venkateswara Rao Control lmts for ndvdual measurements (X) chart are

More information

A New Token Allocation Algorithm for TCP Traffic in Diffserv Network

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

More information

Network Intrusion Detection Based on PSO-SVM

Network Intrusion Detection Based on PSO-SVM TELKOMNIKA Indonesan Journal of Electrcal Engneerng Vol.1, No., February 014, pp. 150 ~ 1508 DOI: http://dx.do.org/10.11591/telkomnka.v1.386 150 Network Intruson Detecton Based on PSO-SVM Changsheng Xang*

More information

Support Vector Machines

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

More information

Tuning of Fuzzy Inference Systems Through Unconstrained Optimization Techniques

Tuning of Fuzzy Inference Systems Through Unconstrained Optimization Techniques Tunng of Fuzzy Inference Systems Through Unconstraned Optmzaton Technques ROGERIO ANDRADE FLAUZINO, IVAN NUNES DA SILVA Department of Electrcal Engneerng State Unversty of São Paulo UNESP CP 473, CEP 733-36,

More information

Estimation of Image Corruption Inverse Function and Image Restoration Using a PSObased

Estimation of Image Corruption Inverse Function and Image Restoration Using a PSObased Internatonal Journal of Vdeo& Image Processng and Network Securty IJVIPNS-IJENS Vol:10 No:06 1 Estmaton of Image Corrupton Inverse Functon and Image Restoraton Usng a PSObased Algorthm M. Pourmahmood,

More information

Using Particle Swarm Optimization for Enhancing the Hierarchical Cell Relay Routing Protocol

Using Particle Swarm Optimization for Enhancing the Hierarchical Cell Relay Routing Protocol 2012 Thrd Internatonal Conference on Networkng and Computng Usng Partcle Swarm Optmzaton for Enhancng the Herarchcal Cell Relay Routng Protocol Hung-Y Ch Department of Electrcal Engneerng Natonal Sun Yat-Sen

More information

Simulation Based Analysis of FAST TCP using OMNET++

Simulation Based Analysis of FAST TCP using OMNET++ Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months

More information

K-means Optimization Clustering Algorithm Based on Hybrid PSO/GA Optimization and CS validity index

K-means Optimization Clustering Algorithm Based on Hybrid PSO/GA Optimization and CS validity index Orgnal Artcle Prnt ISSN: 3-6379 Onlne ISSN: 3-595X DOI: 0.7354/jss/07/33 K-means Optmzaton Clusterng Algorthm Based on Hybrd PSO/GA Optmzaton and CS valdty ndex K Jahanbn *, F Rahmanan, H Rezae 3, Y Farhang

More information

Complexity Analysis of Problem-Dimension Using PSO

Complexity Analysis of Problem-Dimension Using PSO Proceedngs of the 7th WSEAS Internatonal Conference on Evolutonary Computng, Cavtat, Croata, June -4, 6 (pp45-5) Complexty Analyss of Problem-Dmenson Usng PSO BUTHAINAH S. AL-KAZEMI AND SAMI J. HABIB,

More information

Load Balancing for Hex-Cell Interconnection Network

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

More information

THE PATH PLANNING ALGORITHM AND SIMULATION FOR MOBILE ROBOT

THE PATH PLANNING ALGORITHM AND SIMULATION FOR MOBILE ROBOT Journal of Theoretcal and Appled Informaton Technology 30 th Aprl 013. Vol. 50 No.3 005-013 JATIT & LLS. All rghts reserved. ISSN: 199-8645 www.jatt.org E-ISSN: 1817-3195 THE PATH PLANNING ALGORITHM AND

More information

Comparison of Heuristics for Scheduling Independent Tasks on Heterogeneous Distributed Environments

Comparison of Heuristics for Scheduling Independent Tasks on Heterogeneous Distributed Environments Comparson of Heurstcs for Schedulng Independent Tasks on Heterogeneous Dstrbuted Envronments Hesam Izakan¹, Ath Abraham², Senor Member, IEEE, Václav Snášel³ ¹ Islamc Azad Unversty, Ramsar Branch, Ramsar,

More information

Application of Improved Fish Swarm Algorithm in Cloud Computing Resource Scheduling

Application of Improved Fish Swarm Algorithm in Cloud Computing Resource Scheduling , pp.40-45 http://dx.do.org/10.14257/astl.2017.143.08 Applcaton of Improved Fsh Swarm Algorthm n Cloud Computng Resource Schedulng Yu Lu, Fangtao Lu School of Informaton Engneerng, Chongqng Vocatonal Insttute

More information

Analysis of Particle Swarm Optimization and Genetic Algorithm based on Task Scheduling in Cloud Computing Environment

Analysis of Particle Swarm Optimization and Genetic Algorithm based on Task Scheduling in Cloud Computing Environment Analyss of Partcle Swarm Optmzaton and Genetc Algorthm based on Tas Schedulng n Cloud Computng Envronment Frederc Nzanywayngoma School of Computer and Communcaton Engneerng Unversty of Scence and Technology

More information

Cluster Analysis of Electrical Behavior

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

More information

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

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

More information

Overview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION

Overview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION Overvew 2 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION Introducton Mult- Smulator MASIM Theoretcal Work and Smulaton Results Concluson Jay Wagenpfel, Adran Trachte Motvaton and Tasks Basc Setup

More information

(1) The control processes are too complex to analyze by conventional quantitative techniques.

(1) The control processes are too complex to analyze by conventional quantitative techniques. Chapter 0 Fuzzy Control and Fuzzy Expert Systems The fuzzy logc controller (FLC) s ntroduced n ths chapter. After ntroducng the archtecture of the FLC, we study ts components step by step and suggest a

More information

Novel Fuzzy logic Based Edge Detection Technique

Novel Fuzzy logic Based Edge Detection Technique Novel Fuzzy logc Based Edge Detecton Technque Aborsade, D.O Department of Electroncs Engneerng, adoke Akntola Unversty of Tech., Ogbomoso. Oyo-state. doaborsade@yahoo.com Abstract Ths paper s based on

More information

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

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

More information

A Saturation Binary Neural Network for Crossbar Switching Problem

A Saturation Binary Neural Network for Crossbar Switching Problem A Saturaton Bnary Neural Network for Crossbar Swtchng Problem Cu Zhang 1, L-Qng Zhao 2, and Rong-Long Wang 2 1 Department of Autocontrol, Laonng Insttute of Scence and Technology, Benx, Chna bxlkyzhangcu@163.com

More information

Structural optimization using artificial bee colony algorithm

Structural optimization using artificial bee colony algorithm 2 nd Internatonal Conference on Engneerng Optmzaton September 6-9, 2010, Lsbon, ortugal Structural optmzaton usng artfcal bee colony algorthm Al Hadd 1, Sna Kazemzadeh Azad 2, Saed Kazemzadeh Azad Department

More information

Solving two-person zero-sum game by Matlab

Solving two-person zero-sum game by Matlab Appled Mechancs and Materals Onlne: 2011-02-02 ISSN: 1662-7482, Vols. 50-51, pp 262-265 do:10.4028/www.scentfc.net/amm.50-51.262 2011 Trans Tech Publcatons, Swtzerland Solvng two-person zero-sum game by

More information

Maximum Variance Combined with Adaptive Genetic Algorithm for Infrared Image Segmentation

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

More information

SHAPE OPTIMIZATION OF STRUCTURES BY MODIFIED HARMONY SEARCH

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

More information

A hybrid sequential approach for data clustering using K-Means and particle swarm optimization algorithm

A hybrid sequential approach for data clustering using K-Means and particle swarm optimization algorithm MultCraft Internatonal Journal of Engneerng, Scence and Technology Vol., No. 6, 00, pp. 67-76 INTERNATIONAL JOURNAL OF ENGINEERING, SCIENCE AND TECHNOLOGY www.jest-ng.com 00 MultCraft Lmted. All rghts

More information

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

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

More information

A Simple and Efficient Goal Programming Model for Computing of Fuzzy Linear Regression Parameters with Considering Outliers

A Simple and Efficient Goal Programming Model for Computing of Fuzzy Linear Regression Parameters with Considering Outliers 62626262621 Journal of Uncertan Systems Vol.5, No.1, pp.62-71, 211 Onlne at: www.us.org.u A Smple and Effcent Goal Programmng Model for Computng of Fuzzy Lnear Regresson Parameters wth Consderng Outlers

More information

An Entropy-Based Approach to Integrated Information Needs Assessment

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

More information

Natural Computing. Lecture 13: Particle swarm optimisation INFR /11/2010

Natural Computing. Lecture 13: Particle swarm optimisation INFR /11/2010 Natural Computng Lecture 13: Partcle swarm optmsaton Mchael Herrmann mherrman@nf.ed.ac.uk phone: 0131 6 517177 Informatcs Forum 1.42 INFR09038 5/11/2010 Swarm ntellgence Collectve ntellgence: A super-organsm

More information

Load-Balanced Anycast Routing

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

More information

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS

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

More information

OPTIMIZATION OF PROCESS PARAMETERS USING AHP AND TOPSIS WHEN TURNING AISI 1040 STEEL WITH COATED TOOLS

OPTIMIZATION OF PROCESS PARAMETERS USING AHP AND TOPSIS WHEN TURNING AISI 1040 STEEL WITH COATED TOOLS Internatonal Journal of Mechancal Engneerng and Technology (IJMET) Volume 7, Issue 6, November December 2016, pp.483 492, Artcle ID: IJMET_07_06_047 Avalable onlne at http://www.aeme.com/jmet/ssues.asp?jtype=ijmet&vtype=7&itype=6

More information

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

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

More information

Speech enhancement is a challenging problem

Speech enhancement is a challenging problem Journal of Advances n Computer Engneerng and Technology, () 5 A New Shuffled Sub-swarm Partcle Swarm Optmzaton Algorthm for Speech Enhancement Masoud Geravanchzadeh, Sna Ghalam Osgoue Receved (-9-) Accepted

More information

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

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

More information

Multi-objective Design Optimization of MCM Placement

Multi-objective Design Optimization of MCM Placement Proceedngs of the 5th WSEAS Int. Conf. on Instrumentaton, Measurement, Crcuts and Systems, Hangzhou, Chna, Aprl 6-8, 26 (pp56-6) Mult-objectve Desgn Optmzaton of MCM Placement Chng-Ma Ko ab, Yu-Jung Huang

More information

An Image Fusion Approach Based on Segmentation Region

An Image Fusion Approach Based on Segmentation Region Rong Wang, L-Qun Gao, Shu Yang, Yu-Hua Cha, and Yan-Chun Lu An Image Fuson Approach Based On Segmentaton Regon An Image Fuson Approach Based on Segmentaton Regon Rong Wang, L-Qun Gao, Shu Yang 3, Yu-Hua

More information

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,

More information

Meta-heuristics for Multidimensional Knapsack Problems

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

More information

Support Vector Machines

Support Vector Machines Support Vector Machnes Decson surface s a hyperplane (lne n 2D) n feature space (smlar to the Perceptron) Arguably, the most mportant recent dscovery n machne learnng In a nutshell: map the data to a predetermned

More information

Combining Cellular Automata and Particle Swarm Optimization for Edge Detection

Combining Cellular Automata and Particle Swarm Optimization for Edge Detection Combnng Cellular Automata and Partcle Swarm Optmzaton for Edge Detecton Safa Djemame Ferhat Abbes Unversty Sétf, Algera Mohamed Batouche Mentour Unversty Constantne, Algera ABSTRACT Cellular Automata can

More information

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters Proper Choce of Data Used for the Estmaton of Datum Transformaton Parameters Hakan S. KUTOGLU, Turkey Key words: Coordnate systems; transformaton; estmaton, relablty. SUMMARY Advances n technologes and

More information

High-Boost Mesh Filtering for 3-D Shape Enhancement

High-Boost Mesh Filtering for 3-D Shape Enhancement Hgh-Boost Mesh Flterng for 3-D Shape Enhancement Hrokazu Yagou Λ Alexander Belyaev y Damng We z Λ y z ; ; Shape Modelng Laboratory, Unversty of Azu, Azu-Wakamatsu 965-8580 Japan y Computer Graphcs Group,

More information

An Influence of the Noise on the Imaging Algorithm in the Electrical Impedance Tomography *

An Influence of the Noise on the Imaging Algorithm in the Electrical Impedance Tomography * Open Journal of Bophyscs, 3, 3, 7- http://dx.do.org/.436/ojbphy.3.347 Publshed Onlne October 3 (http://www.scrp.org/journal/ojbphy) An Influence of the Nose on the Imagng Algorthm n the Electrcal Impedance

More information

Repeater Insertion for Two-Terminal Nets in Three-Dimensional Integrated Circuits

Repeater Insertion for Two-Terminal Nets in Three-Dimensional Integrated Circuits Repeater Inserton for Two-Termnal Nets n Three-Dmensonal Integrated Crcuts Hu Xu, Vasls F. Pavlds, and Govann De Mchel LSI - EPFL, CH-5, Swtzerland, {hu.xu,vasleos.pavlds,govann.demchel}@epfl.ch Abstract.

More information

Analysis of Continuous Beams in General

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

More information

An Improved Particle Swarm Optimization for Feature Selection

An Improved Particle Swarm Optimization for Feature Selection Journal of Bonc Engneerng 8 (20)?????? An Improved Partcle Swarm Optmzaton for Feature Selecton Yuannng Lu,2, Gang Wang,2, Hulng Chen,2, Hao Dong,2, Xaodong Zhu,2, Sujng Wang,2 Abstract. College of Computer

More information

A soft computing approach for modeling of severity of faults in software systems

A soft computing approach for modeling of severity of faults in software systems Internatonal Journal of Physcal Scences Vol. 5 (), pp. 074-085, February, 010 Avalable onlne at http://www.academcjournals.org/ijps ISSN 199-1950 010 Academc Journals Full Length Research Paper A soft

More information

The Research of Support Vector Machine in Agricultural Data Classification

The Research of Support Vector Machine in Agricultural Data Classification The Research of Support Vector Machne n Agrcultural Data Classfcaton Le Sh, Qguo Duan, Xnmng Ma, Me Weng College of Informaton and Management Scence, HeNan Agrcultural Unversty, Zhengzhou 45000 Chna Zhengzhou

More information

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

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

More information

A New Hybrid Method Based on Improved Particle Swarm Optimization, Ant Colony Algorithm and HMM for Web Information Extraction

A New Hybrid Method Based on Improved Particle Swarm Optimization, Ant Colony Algorithm and HMM for Web Information Extraction A New Hybrd Method Based on Improved Partcle Swarm Optmzaton, Ant Colony Algorthm and HMM for Web Informaton Extracton Rong LI, Hong-bn WANG Department of Computer, Xnzhou Teachers Unversty, Xnzhou, Chna

More information

Study on Fuzzy Models of Wind Turbine Power Curve

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

More information

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

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

More information

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

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

More information

Quality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation

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

More information

GSLM Operations Research II Fall 13/14

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

More information

Classifier Swarms for Human Detection in Infrared Imagery

Classifier Swarms for Human Detection in Infrared Imagery Classfer Swarms for Human Detecton n Infrared Imagery Yur Owechko, Swarup Medasan, and Narayan Srnvasa HRL Laboratores, LLC 3011 Malbu Canyon Road, Malbu, CA 90265 {owechko, smedasan, nsrnvasa}@hrl.com

More information

Genetic Tuning of Fuzzy Logic Controller for a Flexible-Link Manipulator

Genetic Tuning of Fuzzy Logic Controller for a Flexible-Link Manipulator Genetc Tunng of Fuzzy Logc Controller for a Flexble-Lnk Manpulator Lnda Zhxa Sh Mohamed B. Traba Department of Mechancal Unversty of Nevada, Las Vegas Department of Mechancal Engneerng Las Vegas, NV 89154-407

More information

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

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

More information

Classification / Regression Support Vector Machines

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

More information

Structural Optimization Using OPTIMIZER Program

Structural Optimization Using OPTIMIZER Program SprngerLnk - Book Chapter http://www.sprngerlnk.com/content/m28478j4372qh274/?prnt=true ق.ظ 1 of 2 2009/03/12 11:30 Book Chapter large verson Structural Optmzaton Usng OPTIMIZER Program Book III European

More information

Hierarchical clustering for gene expression data analysis

Hierarchical clustering for gene expression data analysis Herarchcal clusterng for gene expresson data analyss Gorgo Valentn e-mal: valentn@ds.unm.t Clusterng of Mcroarray Data. Clusterng of gene expresson profles (rows) => dscovery of co-regulated and functonally

More information

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

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

More information

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

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

More information

Design of Structure Optimization with APDL

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

More information

Programming in Fortran 90 : 2017/2018

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

More information

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

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

More information

IMPROVEMENT of MULTIPLE ROUTING BASED on FUZZY CLUSTERING and PSO ALGORITHM IN WSNS TO REDUCE ENERGY CONSUMPTION

IMPROVEMENT of MULTIPLE ROUTING BASED on FUZZY CLUSTERING and PSO ALGORITHM IN WSNS TO REDUCE ENERGY CONSUMPTION IMPROVEMENT of MULTIPLE ROUTING BASED on FUZZY CLUSTERING and PSO ALGORITHM IN WSNS TO REDUCE ENERGY CONSUMPTION Gholamreza Farahan Department of Electrcal Engneerng and Informaton Technology, Iranan Research

More information

Unsupervised Learning

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

More information

An Improved Neural Network Algorithm for Classifying the Transmission Line Faults

An Improved Neural Network Algorithm for Classifying the Transmission Line Faults 1 An Improved Neural Network Algorthm for Classfyng the Transmsson Lne Faults S. Vaslc, Student Member, IEEE, M. Kezunovc, Fellow, IEEE Abstract--Ths study ntroduces a new concept of artfcal ntellgence

More information