A novel parameter estimation method for metal oxide surge arrester models

Size: px
Start display at page:

Download "A novel parameter estimation method for metal oxide surge arrester models"

Transcription

1 Sādhanā Vol. 36, Part 6, December 2011, pp 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 NIKNAM 1 1 Department of Electrcal Engneerng, Marvdasht Branch, Islamc Azad Unversty, Marvdasht, Iran 2 Electrcal Engneerng Department, Amrkabr Unversty of Technology, Tehran, Iran e-mal: mnafar@mau.ac.r MS receved 9 September 2010; revsed 12 January 2011; accepted 12 May 2011 Abstract. Accurate modellng and exact determnaton of Metal Oxde (MO) surge arrester parameters are very mportant for arrester allocaton, nsulaton coordnaton studes and systems relablty calculatons. In ths paper, a new technque, whch s the combnaton of Adaptve Partcle Swarm Optmzaton (APSO) and Ant Colony Optmzaton (ACO) algorthms and lnkng the MATLAB and EMTP, s proposed to estmate the parameters of MO surge arrester models. The proposed algorthm s named Modfed Adaptve Partcle Swarm Optmzaton (MAPSO). 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 and the cogntve and the socal parameters are self-adaptvely adjusted. Also, to mprove the global search capablty and prevent the convergence to local mnma, ACO algorthm s combned to the proposed APSO algorthm. The transent models of MO surge arrester have been smulated by usng ATP-EMTP. The results of smulatons have been appled to the program, whch s based on MAPSO algorthm and can determne the ftness and parameters of dfferent models. The valdty and the accuracy of estmated parameters of surge arrester models are assessed by comparng the predcted resdual voltage wth expermental results. Keywords. EMTP. Metal oxde surge arrester models; PSO; ACO; parameter estmaton; 1. Introducton Metal oxde (MO) surge arresters are wdely used as protectve devces aganst swtchng and lghtnng over-voltages n power systems. The proper nonlnear voltage-current characterstcs, For correspondence 941

2 942 Mehd Nafar et al gnorable power losses, hgh level relablty n the operaton tme, hgh speed response to the over-voltages and long lfe tme are some advantages of MO surge arresters. Accurate modellng and smulaton of ther dynamc characterstcs are very mportant for arrester allocaton, systems relablty and nsulaton coordnaton studes (IEEE WG 1992; Pncet & Gannetton 1999; Martnez & Durbak 2005). For swtchng over voltages studes, the surge arresters can be represented by ther nonlnear V-I characterstcs. However, such a presentaton would not be sutable for fast front transent and lghtnng surge studes. Because the MO surge arrester exhbts 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 current peaks (IEEE WG 1992). Typcally, the resdual voltage for an mpulse current havng a front tme equal to 1 μs s 8 12% hgher than that of predcted for an mpulse current havng a front tme equal to 8 μs. The resdual voltage for longer tme-to-crests between 45 and 60 μs, s 2 4% lower than that of a 8 μs current mpulse (Martnez & Durbak 2005). In order to reproduce the MO surge arrester dynamc characterstcs mentoned prevously, a lot of researches have been done on modellng and smulaton of MO surge arresters (Martnez & Durbak 2005). A dynamc model has been presented based on the data base of (IEEE WG 1992) for fast mpulse currents (tme-to-crest of μs). To estmate the model parameters, an teratve tral and error procedure has been proposed, whch matches the peak of dscharge voltage obtaned wth 8/20 μs mpulse current. The startng values for the parameters determnaton process, has been determned by consderng the heght and the number of column of the arrester, for fve lnear elements, and two V -I curves for the nonlnear elements. Ths method s usually tme consumng and only applcable to the IEEE model (Martnez & Durbak 2005). The IEEE model was changed and smplfed to other models by researchers (Pncet & Gannetton 1999; Fernandez & Daz 2001; Popov et al 2002). The man problem of proposed models s essentally ther parameters calculaton and estmaton (L et al 2002; Znk et al 2005). Numercal method has been proposed for estmatng the parameters of the surge arrester models n (L et al 2002). Ths method s based on comparng resdual voltages of smulaton and expermental results. The measurement of the resdual voltage when a 8/20 μs mpulse current s appled to the arrester s the start pont of ths method (L et al 2002). In ths paper, an adaptve parameter control s used for nerta weght by usng a fuzzy logcal controller and the cogntve and the socal parameters are self-adaptvely evaluated. Also, n order to avod trappng n local optma, Ant Colony Optmzaton (ACO) algorthm s combned to Adaptve PSO (APSO) to explore the search space much more effcently. Usng the proposed algorthm and lnkng the MATLAB and EMTP programs, parameters of MO surge arrester models are dentfed. The estmated parameters of models are verfed by comparng the results of smulatons by EMTP (EMTP Role Book 1997) wth the expermental results. The results show the ablty of the proposed algorthm n estmatng the surge arrester parameters. 2. Surge arrester models In ths paper, dynamc models of surge arresters are nvestgated n the followng paragraphs. The IEEE WG group proposed the model of fgure 1, ncludng the nonlnear resstances A 0 and A 1, whch are separated by a RL low pass flter (IEEE WG 1992). The parameters calculaton procedure of ths model has been presented n (Martnez & Durbak 2005). It s based on the estmated heght of the arrester, the number of columns of MO dsks and the curves shown n fgure 2.

3 A novel parameter estmaton method for metal oxde surge arrester models 943 Fgure 1. IEEE model. The model, shown n fgure 3, has been proposed by Pncet Ganetton (Pncet & Gannetton 1999). Ths model s based on IEEE model wth some dfferences. In ths model the resstance R 0 stablzes the numercal oscllatons. The nonlnear resstors A 0 and A 1 can be estmated by usng curves shown n fgure 2. The calculaton procedure of nductances for ths model has been presented n (Pncet & Gannetton 1999). Fernandez & Daz (2001) have presented other model whch s based on IEEE model too. Ths model s shown n fgure 4. In Fernandez Daz model, the rato I 0 to I 1 s assumed to be remaned constant all over the voltage range of ther protecton characterstcs where I 0 and I 1 are the currents followng A 0 and A 1 respectvely and the voltage percentage ncreasng of the nput termnal depends only on the nductance L 1. The detals of the calculaton procedure of ths model have been presented n (Fernandez & Daz 2001). The model, shown n fgure 5, has been proposed by Popov for swtchng studes (Popov et al 2002). To estmate the parameters of ths model, an teratve tral and error procedure has been proposed n (Popov et al 2002). Above mentoned procedures do not always result n the best parameters, but these procedures can provde a good estmaton (a startng pont) (L et al 2002). It should be mentoned that these procedures and ther applcatons are lmted to mentoned models. Fgure 2. Nonlnear characterstcs of A 0 and A 1.

4 944 Mehd Nafar et al Fgure 3. Pncet Ganetton model. In recent years, dfferent researches have been presented for determnng the parameters of all arrester models (L et al 2002; Znk et al 2005). A numercal method was proposed for estmatng the parameters of the three suggested models n (L et al 2002). Ths technque s based on comparson of the smulaton results of resdual voltages and the results derved from 8/20 μs expermental measurements (L et al 2002). In ths method, surge arrester parameters are estmated by mnmzng the followng objectve functon: E = T 0 W (t)[v (t, x) Vm(t)] 2 dt, (1) where E s the sum of the quadratc error, T s the duraton of njected mpulse current sgnal, V (t, x) s the predcted resdual voltage obtaned from smulaton results, V m (t) s the measured resdual voltage, x s the state varable vector (parameters of surge arrester model) and W (t) s the weghtng functon, derved from numercal expermentaton. It can take the followng form for dfferent models: ( πt W (t) = cos 3T + π ) ( ) 6 πt W (t) = cos 2T W (t) = 1.0. (2) In ths method, the non-lnear resstances have presented by pece-wse 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 smulated voltage. In ths paper, a new technque based on heurstc algorthms s proposed to estmate the best parameters of surge arresters models. Proposed method s general and can be appled to all surge arrester models. Unlke exstng methods, formulaton or equaton and nformaton on the MO surge arrester dmensons are not necessary. Also, the applcaton of the weghtng functon s not necessary n the proposed method and the non-lnear resstances can be presented by an Fgure 4. Fernandez Daz model.

5 A novel parameter estmaton method for metal oxde surge arrester models 945 Fgure 5. Popov model. exponental voltage current characterstc, as expressed by the equaton (3) (Znk et al 2005) ( ) V q I = p, (3) V ref 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. 3. Objectve functon In ths paper, the ATP-EMTP software s used as a smulaton tool. The 10 ka, 8/20 μs current s appled to the smulated models of surge arresters. The resdual voltage of each model s compared to the expermental results obtaned from (Schmdt et al 1989;Km et al 1996; Hnrchsen 2001) and the parameters of surge arrester models can be estmated by mnmzng the followng equaton: E = T 0 [V (t, x) Vm(t)] 2 dt. (4) Ths objectve functon s smlar to the objectve functon proposed n (L et al 2002). Only n (L et al 2002) an addtonal term (weghtng functon) has been consdered to ncrease the convergence speed. In proposed MAPSO method, the applcaton of the weghtng functon s not necessary. Usually, the measured resdual voltage s a dscrete functon. Accordngly, the objectve functon (4) can be rewrtten as follows: E = N [V ( j t, x) V m ( j t)] 2 t, (5) j=1 where N s the number of dscrete ponts and the t = T / N s the tme nterval.

6 946 Mehd Nafar et al 4. Optmzaton procedure 4.1 ACO algorthm Ants are nsects whch lve together. Beng blnd, they fnd the shortest path from nest to food usng the pheromone. Pheromone, a chemcal materal deposted by the ants, serves as a crtcal communcaton faclty among ants whch help them n ther path recognton. Densty of pheromone deposted by ants, determnes the shortest path of ther ways to food (Nknam et al 2005). Generally, the state transton probablty to select the next path could be expressed, as follows: P j = NA j=1, j = (τ j ) γ 2(1/L j ) γ 1 (τ j ) γ 2(1/L j ) γ 1. (6) After choosng the next path, updatng the tral densty of pheromone s by the followng equaton: τ j (k + 1) = ρτ j (k) + τ j, (7) 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 + 1and τ j s the amount of pheromone tral added to τ j by ants. 4.2 PSO algorthm PSO s a populaton based stochastc optmzaton algorthm developed by Eberhart and Kennedy, nspred by socal behavour of brd flockng or fsh schoolng. It s a useful technque to solve many optmzaton problems (Kennedy & Eberhart 1995; Eberhart & Sh 2001; Gang 2003; Park 2005). PSO shares many smlartes wth evolutonary computaton technques such as Genetc Algorthms (GA). The system s ntalzed wth 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 solutons, called partcles, fly through the problem space by followng the current optmum partcles. Equaton (8) could descrbe the content of ths concept. Vel (t+1) = ω.vel (t) + c 1.rand 1 (.).(Pbest X (t) + c 2.rand 2 (.).(Gbest X (t) ) X (t+1) = X (t) + Vel (t+1), (8) where Vel t s velocty of the th partcle, rand 1 (.) and rand 2 (.) are random numbers between 0 and 1, Pbest s best prevous experence of the th partcle that recorded and Gbest s best partcle among the entre populaton. The constants c 1 and c 2 are postve weghtng coeffcents of the stochastc acceleraton terms whch stmulate each partcle towards Pbest and Gbest postons. Low values allow partcles to

7 A novel parameter estmaton method for metal oxde surge arrester models 947 go far from the target regon and hgh values result n abrupt movements toward, or backward the target regon. The nerta weght ω presents the degree of the partcles momentum. The approprate selecton of nerta weght ω n (8) 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. 4.3 Adaptve PSO As gven n equaton (8), three parameters ω, c 1 and c 2 have great nfluence on the PSO algorthm performance and control the behavour and effcacy of the PSO algorthm. The nerta weght ω s used to control the mpact of the prevous hstory of veloctes on the current velocty. Proper choce of the ω provdes a balance between global and local optmum ponts (Nknam et al 2010). The factors c 1 and c 2 determne the effect of the personal best Pbest, j and global best Gbest. Snce c 1 represents how much the partcle trusts ts own hstorcal experence, t s called cogntve parameter. On the other hand, c 2 represents the socal nfluence that pushes the swarm to converge to the current globally best regon, and s called socal parameter. Also, on each dmenson, partcle veloctes are lmted to mnmum and maxmum veloctes, whch are userdefned parameters as follows: Vel j,mn Vel t+1 j Vel j,max. (9) To control excessve roamng of partcles outsde the search space, usually, Vel j,mn s assumed as Vel j,max.ifvel j,max s too hgh, partcles may fly past good solutons. If Vel j,max s too small, partcles may not explore suffcently beyond local solutons. In many experences wth PSO, Vel j,max was often set at 10 20% of the dynamc range on each dmenson. The approprate choce of control parameters s very mportant for the success n ths type of evolutonary algorthms. In Arumugam & Rao (2008) have descrbed two ways of modfyng the parameter control; adaptve parameter control and self-adaptve parameter control. Adaptve parameter control, takes place when there s some form of feedback from the search that s used to determne the drecton and/or magntude of the change to the strategy parameter. In ths method, the parameter change (accordng to a heurstc rule) takes feedback from the current search state. The nformaton of current state s usually the current teraton of the search, the operator s performance, and/or the dversty of the populaton. For example, n (Eberhart & Kennedy 1995; Arumugam & Rao 2008), lnearly decreasng nerta over the generatons s used as adaptve nerta weght control and n (Nknam et al 2010) a fuzzy logcal controller has been used. Whle n self-adaptve parameter control, the parameters of the meta-heurstc are ncorporated nto the representaton of the soluton. Thus, the values of the parameters evolve together wth the solutons of the populaton. In ths paper, a fuzzy-adaptve parameter control for the nerta weght s used. Also, the other parameters of the evoluton varables, are nvestgated, n order to self adaptvely control them. 4.3a 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.

8 948 Mehd Nafar et al Fgure 6. Membershp functons of nputs and outputs; (a)nfv,(b) ω and (c) ω. 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 (Nknam et al 2010). In ths paper, a fuzzy IF/THEN rules are 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. 4.3b Fuzzfcaton: The fuzzfcaton comprses the process of transformng crsp values nto grades of membershp for lngustc terms of fuzzy sets. For each nput and output varable selected, 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 6. All the membershps of nput are presented n three lngustc levels; S, M, and L for small, medum, Table 1. Fuzzy rules for varatons of nerta weght. ω ω S M L NFV S ZE NE NE M PE ZE NE L PE ZE NE

9 A novel parameter estmaton method for metal oxde surge arrester models 949 and large, respectvely n table 1. 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 6 (Nknam et al 2010). 4.3c 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 1 are used to select the nerta weght correcton ( ω). Each rule represents a mappng from the nput space to the output space. 4.3d 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 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 varable, 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: NFV = FV FV mn. (10) FV max FV mn In the frst teraton, the calculated value of FV may be as FV mn for the next teratons. In equaton (10), FV max s the worst soluton to the mnmzaton process. Typcal nerta weght value s 0.4 ω 0.9. 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 + ω. (11) 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.3e 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 shown n fgure Self-adaptve parameter control In order to obtan a self-adaptve parameter control, the parameters must be encoded wthn the soluton of the problem. A self-adaptve control of c 1, c 2 and V max s consdered to avod the cumbersome task of frst localzng and then fne-tunng these three parameters. Approprate tunng of c 1 and c 2 n equaton (8) may mprove effcency, accelerate the search process and reduce the rsk of settlng n one of the local mnma. A study of these acceleraton parameters s gven for PSO n (Kennedy 1999). As default values, c 1 = c 2 = 2 were proposed, but next researches ndcated that alternatve confguratons, dependng on the applcaton, may produce superor performance. Recent work has been shown that t mght be even better to select a larger

10 950 Mehd Nafar et al cogntve parameter, c 1, than a socal parameter, c 2, wth constrant c 1 + c 2 4. In (Arumugam & Rao 2008), t s suggested that the acceleraton coeffcents should nether set to a constant value nor set as a lnearly decreasng tme varyng functon. Instead, these parameters are defned as a functon of local best and global best values of the ftness functon of a mnmzaton problem. In ths paper, the acceleraton coeffcents and the clampng velocty are nether set to a constant value (lke n standard PSO) nor set as a tme varyng functon (lke n adaptve PSO varants). Instead they are ncorporated nto the optmzaton problem, as explaned below. The parameters of partcle wll be allowed to self-adapt by usng the same process used by PSO gven by equatons (8). To ths end, these three parameters are consdered as three new varables that are added wth poston vectors Xj. In general, f N g s the dmenson of the problem and p s the number of self-adaptng parameters, the new poston vector for partcle j wll be, as fallows: X new j =[x j,1, x j,2,..., x j,ng, x j,ng+1,..., x j,ng+p ]. (12) It s obvous that the frst N g varables correspond to the real poston vector of the partcle n the search space, whle the last p varables for ts personal acceleraton constants and velocty lmt. Obvously, these self-adaptng parameters do not enter the ftness functon but are manpulated usng the same mxed ndvdual socal learnng paradgm as the one used n PSO. Also, dmenson of Vel j and Pbest, j, whch represent the velocty and best poston so far for partcle j, respectvely, ncrease as follows: V new j = [v j,1,v j,2,..., v j,ng,v j,ng+1,..., x j,ng+p ], (13) Pbest, new j = [P best,1, P best,2,..., P best,ng, P best,ng+1,..., P best,ng+p ]. (14) Usng equaton (8), each partcle would be addtonally endowed wth the ablty of adaptng ts parameters by amng at both the parameters t had when t got ts best poston n the past and the parameters of the leader, whch managed to brng ths best partcle to ts advantaged poston. 5. Proposed MAPSO 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 Smulated Annealng (SA) along wth the PSO (Gang 2003; Park 2005). 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 and the cogntve and the socal parameters are self-adaptvely evaluated. Also, n order to avod trappng n local optma, ACO algorthm s combned to APSO 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 Adaptve Partcle Swarm Optmzaton (MAPSO) s used to mnmze

11 A novel parameter estmaton method for metal oxde surge arrester models 951 the cost functon of the surge arrester parameters estmaton problem. The proposed MAPSO 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 Populaton = X 2... X NSwarm X = [x,1, x,2,..., x,ng, x,ng+1,..., x,ng+p ] x, j = rand(.) (x max j x mn j ) + x mn j j = 1, 2,..., (Ng + p); = 1, 2,..., N swarm ; p = 3, (15) Velocty = Vel 1 Vel 2... Vel NSwarm Vel = [vel,1,vel,2,..., vel,ng,vel,ng+1,..., vel,ng+p] = rand(.) (vel max j vel mn j ) + vel mn j j = 1, 2,..., (Ng + p); = 1, 2,..., N swarm ; p = 3, (16) vel, j where N swarm s the number of the swarms, Ng s the number of the state varable, x max s the maxmum of th state varable, x mn s the mnmum of th state varable, v max s the maxmum velocty of th state varable and v mn s the 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: Tral_Intensty =[τ j ] NSwarm N Swarm τ j = τ 0, (17) 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 MAPSO-based developed program to calculate the objectve functon. Step 4: Calculate the objectve functon The objectve functon (.e., equaton (5)) s calculated for each ndvdual by usng the smulaton results obtaned n the step 3. (Only the frst Ng varables enter the ftness functon.) 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.

12 952 Mehd Nafar et al Step 6: Select the best global poston The surge arrester parameters n addtonal self-adaptve parameters are represented the poston of partcle n the swarm. 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. Step 8: Update the parameters In ths algorthm, the proper choce of nerta weght, ω, s updated by the fuzzy rules and the other parameters are tunng by self-adaptve parameters. Step 9: Select the th ndvdual The th ndvdual s selected and neghbours of ths partcle should be dynamcally defned as follows: S = x j x x j 2D0 1 1 exp ( ) at t max, = j, (18) where, D 0 s the ntal neghbourhood radus and a s the parameter used to tune the neghbourhood 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: [ Probablty ] = [P 1, P 2,..., P,M ] 1 M P j = (τ j) γ 2(1/L j ) γ 1 M (τ j ) γ 2(1/L j ) γ 1 L j = j=1 1 F(x ) F(x j ). (19) Then the cumulatve probabltes are calculated as follows: where C 1 C 2 [Cumulatve probablty] =[C 1, C 2,..., C M ] 1 M, = P 1 = C 1 + P 2... C j = C j 1 + P j... C M = C M 1 + P M, (20)

13 A novel parameter estmaton method for metal oxde surge arrester models 953 where, M s the number of members n S and Cj 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 compared wth the calculated cumulatve probabltes. The frst term of the cumulatve probabltes (Cj), 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: Vel (t+1) x (t+1) = ω.vel (t) + c 1.rand 1 ( ).(Pbest x (t) + c 2.rand 2 ( ).(x j x (t) = x (t) + Vel (t+1). The presumed pheromone level between X and Xj s updated n the next stage: ) ) (21) τ j (t + 1) = ρ.τ j (t) + P j. (22) Approach B) f S = {}, whch means there s not any ndvdual n partcle s neghbourhood. In ths case, the th partcle s moved accordng to the followng rules: Vel (t+1) = ω.vel (t) + c 1.rand 1 ( ).(Pbest x (t) ) + c 2.rand 2 ( ).(Gbest x (t) x (t+1) = x (t) + Vel (t+1). Then, the tral ntensty s updated, as follows: ) (23) τ j (t + 1) = ρ.τ j (t) + r; 0.1 r 0.5, (24) 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 wth the new populaton of swarms and then the algorthm goes back to step 3. Step 13: ThelastGbest s the soluton of the problem. 6. Lnkng EMTP wth MAPSO algorthm n MATLAB Both EMTP and MATLAB are currently avalable on popular computer for electrcal engneerng applcatons. It can be sad that the best optmzaton methods can be easly developed n

14 954 Mehd Nafar et al MATLAB and transent models of power system equpments can be smulated by EMTP. To use the ablty of both software, a lnk between these programs s necessary. In Mahseredjan et al (1998), several technques for lnkng EMTP wth MATLAB are presented, where MATLAB functons can be called as EMTP. But, n ths paper, ATP fle s called as an nput fle of MAT- LAB. Ths approach s much easer than the other one. The parameters of surge arrester models have been determned by usng MAPSO algorthm developed n MATLAB and the surge arrester models have been smulated by EMTP. A FORTRAN code fle (ATP fle) s developed for each EMTP Smulaton fle. By usng nput/output functons of MATLAB, ATP fle can be called n Fgure 7. Lnk between MATLAB and EMTP n the proposed method.

15 A novel parameter estmaton method for metal oxde surge arrester models 955 Table 2. Estmated parameters based on expermental results of (Schmdt et al 1989). Parameter IEEE Model Pncet Model Fernandez Model Popov Model R 0 ( ) R 1 ( ) L 0 (μh) L 1 (μh) C(nF) p q p q Vreff 0 [V ] Vreff 1 [V ] MATLAB and can be modfed. So, the surge arrester parameters can be modfed accordng to MAPSO outputs. Usng SYSTEM command, the modfed ATP fle can be run n MATLAB. After runnng the ATP fle, a LIS fle s generated. The smulaton outputs of surge arrester models (for example, resdual voltage) are n ths fle. Then, usng nput/output functon, LIS fle can be opened n MATLAB and the resdual voltage of smulaton can be returned to MAPSO algorthm n MATLAB. Ths procedure has been shown n the fgure Parameter determnaton of surge arrester models In ths secton, the proposed method s used to estmate parameters of the transent models of MO surge arresters. The surge arrester models have been smulated by EMTP. The surge arrester parameters, determned by MAPSO algorthm n MATLAB, are mported to the EMTP. The smulaton s performed by usng the (10 ka, 8/20 μs) mpulse current. Durng optmzaton, the resdual voltage of the model s determned by EMTP and then t s transferred to MAPSO algorthm n MATLAB to evaluate the ftness functon. Ths procedure contnues untl the optmal soluton has been determned for parameters. The resdual voltage of smulatons has been compared wth the expermental data of from references (Schmdt et al 1989; Km et al 1996; Table 3. Estmated parameters based on expermental results of Km et al (1996). Parameter IEEE Model Pncet Model Fernandez Model Popov Model R 0 ( ) R 1 ( ) L 0 (μh) L 1 (μh) C(nF) p q p q Vreff 0 [V ] Vreff 1 [V ]

16 956 Mehd Nafar et al Table 4. Estmated parameters based on expermental results of Hnrchsen (2001). Parameter IEEE Model Pncet Model Fernandez Model Popov Model R 0 ( ) R 1 ( ) L 0 (μh) L 1 (μh) C(nF) p q p q Vreff 0 [V ] Vreff 1 [V ] Hnrchsen 2001). The expermental data of the arresters used n ths paper have been lsted n table 8. The estmated parameters of dfferent surge arrester models, whch have been determned by usng the expermental data of (Schmdt et al 1989; Km et al 1996; Hnrchsen 2001), are lsted n tables 2 4. A comparson among expermental and the smulated resdual voltage obtaned by estmated parameters of the models of (IEEE WG 1992; Pncet & Gannetton 1999; Fernandez & Daz 2001; Popov et al 2002) s presented n fgures Fgure 8. Comparson of resdual voltage determned by estmated models and measured by Schmdt et al (1989).

17 A novel parameter estmaton method for metal oxde surge arrester models 957 Fgure 9. Comparson of resdual voltage determned by estmated models and measured by Km et al (1996). It s obvous from these fgures that the smulaton of models usng the estmated parameters results n resdual voltages whch have a good agreement wth the expermental data. It should be noted that, usng proposed algorthm, parameters of all models can be properly estmated. 8. Error analyss In ths secton, by usng the expermental data obtaned from (Km et al 1996), the ablty of the proposed method to dentfy the parameters of surge arrester models and the ablty of models to smulate the arrester dynamc behavour are presented. Surge arresters have dynamc characterstcs n whch rsng rate of resdual voltage depend on the tme to crest and peak value of current. These characterstcs become mportant n consderng the nsulaton coordnaton studes. In ths secton, the models of (IEEE WG 1992; Pncet & Gannetton 1999; Fernandez & Daz 2001; Popov et al 2002), have been compared based on the estmated parameters of table 3. The mpulse current peak values are 2.5 ka, 5 ka and 10 ka and the selected rse and fall tmes are 1/2 μs, 4/10 μs and 8/20 μs. The 1/2 μs mpulse current has been appled to the surge arrester models and the smulaton results have been used to determne the error by the followng equaton: Error% = VR sm VR meas VR meas 100, (25)

18 958 Mehd Nafar et al Fgure 10. Comparson of resdual voltage determned by estmated models and measured by Hnrchsen (2001). Table 5. Comparson between smulated results and expermental results of Km et al (1996). 1/2 μs mpulse current Models Peak of resdual Error% voltage (kv) P.C. = 2.58 ka IEEE P.V. = 7.46 kv Fernandez Pncet Popov P.C. = 5.04 ka IEEE P.V. = 7.97 kv Fernandez Pncet Popov P.C. = ka IEEE P.V. = 8.62 kv Fernandez Pncet Popov

19 A novel parameter estmaton method for metal oxde surge arrester models 959 Table 6. Comparson between smulated results and expermental results of Km et al (1996). 1/2 μs mpulse current Models Peak of resdual Error% voltage (kv) P.C. = 2.95 ka IEEE P.V. = 7.26 kv Fernandez Pncet Popov P.C. = 4.98 ka IEEE P.V. = 7.62 kv Fernandez Pncet Popov P.C. = ka IEEE P.V. = 8.22 kv Fernandez Pncet Popov where VR sm and VR meas are the smulated and measured values, respectvely. The result of ths calculaton has been presented n table 5. The same smulatons and calculatons have been repeated for 4/10 μs and 8/20 μs currents. The results are presented n tables 6 and 7, respectvely. 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 can be drawn: The Popov model can not smulate dynamcs behavour of MO surge arresters properly. Because ths model s a very smplfed verson of the IEEE model, and also, ths model has been proposed for swtchng studes (Popov et al 2002). Table 7. Comparson between smulated results and expermental results of Km et al (1996). 1/2 μs mpulse current Models Peak of resdual Error% voltage (kv) P.C. = 2.50 ka IEEE P.V. = 7.01 kv Fernandez Pncet Popov P.C. = 5.01 ka IEEE P.V. = 7.49 kv Fernandez Pncet Popov P.C. = ka IEEE P.V. = 8.08 kv Fernandez Pncet Popov

20 960 Mehd Nafar et al Table 8. Expermental data of (Schmdt et al 1989; Km et al 1996; Hnrchsen 2001). Tme (μs) Expermental data of Expermental data of Expermental data of (Schmdt et al 1989) (kv) (Km et al 1996) (kv) (Hnrchsen 2001) (kv) The Error n IEEE model and Pncet model ncreases when the peak of the mpulse current decreases. Models of (IEEE WG 1992; Pncet & Gannetton 1999; Fernandez & Daz 2001) smulate the dynamc behavour of surge arresters properly. The proposed algorthm (MAPSO) can be appled to all models. The proposed algorthm s a powerful tool to estmate parameters of MO surge arrester models. 9. Concluson In ths paper a new method, based on APSO and ACO algorthms has been proposed by lnkng the MATLAB and EMTP. Usng ths method t s possble to determne the parameters of dfferent surge arrester models. In ths method, the proposed optmzaton algorthm known as MAPSO can be mplemented easly and the parameters of surge arrester models are estmated based on the MO surge arrester resdual voltage measurements. The proposed method has been appled to dfferent models of surge arresters. It s shown that the estmated parameters of all surge arrester models lead to smulaton results whch are n agreement wth the resdual voltage measurements. It should be mentoned that the prevous studes were lmted to specal models but the proposed method s general and can be appled to all exstng models. References Arumugam M S, Rao M V C 2008 On the mproved performances of the partcle swarm optmzaton algorthms wth adaptve parameters, cross-over operators and root mean square (RMS) varants for computng optmal control of a class of hybrd systems. Appled Soft Comp. 8(1):

21 A novel parameter estmaton method for metal oxde surge arrester models 961 Canadan/Amercan EMTP User Group 1987 Alternatve Transents Program Rule Book, Leuven, Belgum Eberhart R, Kennedy J 1995 A new optmzer usng partcle swarm theory. Proc. of the Sxth Internatonal Symposum on Mcro Machne and Human Scence, IEEE Servce Center, Pscataway, NJ, pp Eberhart R, Sh Y 2001 Partcle swarm optmzaton: development, applcaton and resources. IEEE Cong. on Evol. Comp. 1: Fernandez F, Daz R 2001 Metal oxde surge arrester model for fast transent smulatons. The Int. Conf. on Power System Transents IPAT 01, Ro De Janero, Brazl Gang Z L 2003 Partcle swarm optmzaton to solvng the economc dspatch consderng the generator constrants. IEEE Trans. Power Syst. 18(3): Hnrchsen V 2001 Metal Oxde Surge Arrester Fundamentals. Handbook on Hgh Voltage Metal Oxde Surge Arrester, SIEMENS AG, Berln, July IEEE Workng Group Modelng of metal oxde surge arresters. IEEE Trans. Power Delv. 7(1): Kennedy J 1999 Small worlds and mega-mnds: effects of neghborhood topology on partcle swarm performance. Proc. of Cong. Evol. Comput. IEEE Press 3: Kennedy J, Eberhart R 1995 Partcle swarm optmzaton. IEEE Int. Conf. on Neural Networks. Perth, Australa, pp Km I, Funabash T, Sasak H, Hagwara T, Kobayash M 1996 Study of ZnO arrester model for steep front wave. IEEE Trans. Power Delv. 11(2): L H J, Brlasekaran S, Cho S S 2002 A parameter dentfcaton technque for metal-oxde surge arrester models. IEEE Trans. Power Delv. 17(3): Mahseredjan J, Benmouyal G, Lombard X 1998 A Lnk between EMTP and MATLAB for user-defned modelng. IEEE Trans. Power Delv. 13(2): Martnez J A, Durbak D W 2005 Parameter determnaton for modelng systems transents-part V: Surge arrester. IEEE Trans. Power Delv. 20(3): Nknam T, Doagou Mojarrad H, Nayerpour M 2010 A new fuzzy adaptve partcle swarm optmzaton for non-smooth economc dspatch. Energy 35(4): Nknam T, Ranjbar A M, Shran A R 2005 A new approach for dstrbuton state estmaton based on ant colony algorthm wth regard to dstrbuted generaton. Journal of Intellgent Fuzzy System 16(2): Park J B 2005 A partcle swarm optmzaton for economc dspatch wth nonsmooth cost functon. IEEE Trans. Power Syst. 20(1): Pncet P, Gannetton M 1999 A smplfed model for znc oxde surge arresters. IEEE Trans. Power Delv. 14(2): Popov M, Van der Slus L, Paap G C 2002 Applcaton of a new surge arrester model n protecton studes concernng swtchng surges. IEEE Power Eng. Rev. 22(9): Schmdt W, Meppelnk J, Rchter B, Fester K 1989 Behavor of metal oxde surge arrester blocks to fast transent. IEEE Trans. Power Delv. 4(1): Znk B, Babuder M, Muhr M, Ztnk M, Thottapplll R 2005 Numercal modelng of metal oxde varstor. Proc. of the XIVth Int. Symposum on Hgh Voltage Engneerng, Tsnghua Unversty, Bejng, Chna, pp

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

USING MODIFIED FUZZY PARTICLE SWARM OPTIMIZATION ALGORITHM FOR PARAMETER ESTIMATION OF SURGE ARRESTERS MODELS Internatonal Journal of Innovatve Computng, Informaton and Control ICIC Internatonal c 2012 ISSN 1349-4198 Volume 8, Number 1(B), January 2012 pp. 567 581 USING MODIFIED FUZZY PARTICLE SWARM OPTIMIZATION

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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 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

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

Machine Learning 9. week

Machine Learning 9. week Machne Learnng 9. week Mappng Concept Radal Bass Functons (RBF) RBF Networks 1 Mappng It s probably the best scenaro for the classfcaton of two dataset s to separate them lnearly. As you see n the below

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

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

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

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

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

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

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

Wishing you all a Total Quality New Year!

Wishing you all a Total Quality New Year! Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma

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

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

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

(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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Classifier Selection Based on Data Complexity Measures *

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

More information

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

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

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

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

Backpropagation: In Search of Performance Parameters

Backpropagation: In Search of Performance Parameters Bacpropagaton: In Search of Performance Parameters ANIL KUMAR ENUMULAPALLY, LINGGUO BU, and KHOSROW KAIKHAH, Ph.D. Computer Scence Department Texas State Unversty-San Marcos San Marcos, TX-78666 USA ae049@txstate.edu,

More 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

Performance Evaluation of an ANFIS Based Power System Stabilizer Applied in Multi-Machine Power Systems

Performance Evaluation of an ANFIS Based Power System Stabilizer Applied in Multi-Machine Power Systems Performance Evaluaton of an ANFIS Based Power System Stablzer Appled n Mult-Machne Power Systems A. A GHARAVEISI 1,2 A.DARABI 3 M. MONADI 4 A. KHAJEH-ZADEH 5 M. RASHIDI-NEJAD 1,2,5 1. Shahd Bahonar Unversty

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

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

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

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

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

BioTechnology. An Indian Journal FULL PAPER. Trade Science Inc.

BioTechnology. An Indian Journal FULL PAPER. Trade Science Inc. [Type text] [Type text] [Type text] ISSN : 0974-74 Volume 0 Issue BoTechnology 04 An Indan Journal FULL PAPER BTAIJ 0() 04 [684-689] Revew on Chna s sports ndustry fnancng market based on market -orented

More information

Analysis on the Workspace of Six-degrees-of-freedom Industrial Robot Based on AutoCAD

Analysis on the Workspace of Six-degrees-of-freedom Industrial Robot Based on AutoCAD Analyss on the Workspace of Sx-degrees-of-freedom Industral Robot Based on AutoCAD Jn-quan L 1, Ru Zhang 1,a, Fang Cu 1, Q Guan 1 and Yang Zhang 1 1 School of Automaton, Bejng Unversty of Posts and Telecommuncatons,

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

Optimizing Document Scoring for Query Retrieval

Optimizing Document Scoring for Query Retrieval Optmzng Document Scorng for Query Retreval Brent Ellwen baellwe@cs.stanford.edu Abstract The goal of ths project was to automate the process of tunng a document query engne. Specfcally, I used machne learnng

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

3. CR parameters and Multi-Objective Fitness Function

3. CR parameters and Multi-Objective Fitness Function 3 CR parameters and Mult-objectve Ftness Functon 41 3. CR parameters and Mult-Objectve Ftness Functon 3.1. Introducton Cogntve rados dynamcally confgure the wreless communcaton system, whch takes beneft

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

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

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

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

Cost-efficient deployment of distributed software services

Cost-efficient deployment of distributed software services 1/30 Cost-effcent deployment of dstrbuted software servces csorba@tem.ntnu.no 2/30 Short ntroducton & contents Cost-effcent deployment of dstrbuted software servces Cost functons Bo-nspred decentralzed

More 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

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

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

A Two-Stage Algorithm for Data Clustering

A Two-Stage Algorithm for Data Clustering A Two-Stage Algorthm for Data Clusterng Abdolreza Hatamlou 1 and Salwan Abdullah 2 1 Islamc Azad Unversty, Khoy Branch, Iran 2 Data Mnng and Optmsaton Research Group, Center for Artfcal Intellgence Technology,

More information

A generalized multiobjective particle swarm optimization solver for spreadsheet models: application to water quality

A generalized multiobjective particle swarm optimization solver for spreadsheet models: application to water quality Hydrology Days 2006 A generalzed multobjectve partcle swarm optmzaton solver for spreadsheet models: applcaton to water qualty Alexandre M. Baltar 1 Water Resources Plannng and Management Dvson, Dept.

More information

The Codesign Challenge

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

More information

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

A Unified Framework for Semantics and Feature Based Relevance Feedback in Image Retrieval Systems

A Unified Framework for Semantics and Feature Based Relevance Feedback in Image Retrieval Systems A Unfed Framework for Semantcs and Feature Based Relevance Feedback n Image Retreval Systems Ye Lu *, Chunhu Hu 2, Xngquan Zhu 3*, HongJang Zhang 2, Qang Yang * School of Computng Scence Smon Fraser Unversty

More information

CS 534: Computer Vision Model Fitting

CS 534: Computer Vision Model Fitting CS 534: Computer Vson Model Fttng Sprng 004 Ahmed Elgammal Dept of Computer Scence CS 534 Model Fttng - 1 Outlnes Model fttng s mportant Least-squares fttng Maxmum lkelhood estmaton MAP estmaton Robust

More information

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

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

More information

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

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

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

More information

NGPM -- A NSGA-II Program in Matlab

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

More information

User Authentication Based On Behavioral Mouse Dynamics Biometrics

User Authentication Based On Behavioral Mouse Dynamics Biometrics User Authentcaton Based On Behavoral Mouse Dynamcs Bometrcs Chee-Hyung Yoon Danel Donghyun Km Department of Computer Scence Department of Computer Scence Stanford Unversty Stanford Unversty Stanford, CA

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

A Time-driven Data Placement Strategy for a Scientific Workflow Combining Edge Computing and Cloud Computing

A Time-driven Data Placement Strategy for a Scientific Workflow Combining Edge Computing and Cloud Computing > REPLACE THIS LINE WITH YOUR PAPER IDENTIFICATION NUMBER (DOUBLE-CLICK HERE TO EDIT) < 1 A Tme-drven Data Placement Strategy for a Scentfc Workflow Combnng Edge Computng and Cloud Computng Bng Ln, Fangnng

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

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