Optimization of Multiple Input Single Output Fuzzy Membership Functions Using Clonal Selection Algorithm

Size: px
Start display at page:

Download "Optimization of Multiple Input Single Output Fuzzy Membership Functions Using Clonal Selection Algorithm"

Transcription

1 Optimizatio of Multiple Iput Sigle Output Fuzzy Membership Fuctios Usig Cloal Selectio Algorithm AYŞE MERVE ACILAR, AHMET ARSLAN Computer Egieerig Departmet Selcuk Uiversity Selcuk Uiversity, Eg.-Arch. Fac. Computer Eg Koya TURKIYE Abstract: - A cloal selectio algorithm (CLONALG) ispires from Cloal Selectio Priciple used to explai the basic features of a adaptive immue respose to a atigeic stimulus. I this study, a ew method is proposed for optimizatio of the Multiple Iput Sigle Output (MISO) fuzzy membership fuctios usig CLONALG. The most appropriate placemet of membership fuctios with respect to fuzzy variables ca be determied usig our method for a fuzzy system whose rules table ad shape of membership fuctios were give previously. Also, how the membership fuctios compute as a parameter optimizatio problem usig CLONALG is descried for MISO fuzzy system o a illustrative example. Key-Words: - Multiple Iput Sigle Output Fuzzy Membership Fuctios, Optimizatio, Cloal Selectio Algorithm. Itroductio Fuzzy logic is used to solve a lot of problems related wide rage of area because of providig flexible solutios. Desigig fuzzy system cotais fuzzy sets which are de-fied by rule table ad membership fuctios. Whe the fuzzy sets have bee established, how best to determie the membership fuctio is the first questio that has to be tackled. For most fuzzy logic cotrol problems, the membership fuctios are assumed to be liear ad usually triagular i shape. So, the issues to be determied are the parameters that defie the triagles. Because of this, the membership optimizatio problem ca be reduced to parameter optimizatio problem. These parameters are usually based o the cotrol egieer's experiece ad/or are geerated automatically. To improve behavior of this parameter optimizatio problem some methods such as geetic algorithms (GA), self-orgaizig feature maps (SOFM), tabu search (TS) etc. ca be used. GA was used by Karr [] i determiatio of membership fuctios. Karr applies GA to desig of fuzzy logic cotroller (FLC) for the cart pole problem. Meredith et al. [2] have applied GA to the fie tuig of membership fuctios i a FLC for a helicopter. Lee ad Takagi [3] also tackle the cart problem. They take a holistic approach by usig GA to desig the whole system. Cheg et al. [4] have chose the im-age threshold via miimizig the measure of fuzziess. For selectig the badwidth of fuzzy membership fuctios, they use peak locatios which are chose from the histogram usig the peak selectio criterio. Bağiş [5] presets a method for the determiatio of the membership fuctios based o the use of Tabu Search algorithm. Cerrada et al. [6] proposed a approach permits icorporate the temporal behavior of the sys-tem variables ito the fuzzy membership fuctios. Simo [7] employed H state estimatio theory for the membership fuctio parameter optimizatio. He made some modificatios o the H filter with additio of state costraits so that the resultig membership fuctios are sum ormal. Yag ad Bose [8] described a method for geeratig a fuzzy membership fuctios with usupervised learig usig self-orgaizig feature map. They applied this method to patter recogitio. I our previous work, a ew method was proposed to determie the membership fuctios of a sigle iput ad output fuzzy system whose shape was triagular [9]. The suggested method is relevat for ay membership fuctio whose mathematical model is kow. The method focused o fidig the optimum values of the parameter of this membership fuctio model. This problem solved usig a artificial immue system algorithm: CLONALG. This algorithm is ispired from Cloal Selectio Priciple used to explai the basic features of a adaptive immue respose to a atigeic stimulus. I this study, we optimized the multiple iputsigle output (MISO) fuzzy system whose rule base is complete usig the adaptatio of the method metioed above. This paper is orgaized as follow. I Sectio 2, CLONALG are explaied. I Sectio 3, how the MISO membership fuctios is optimized usig CLONALG o a illustrative example. The experimetal results ad the ISSN: ISBN:

2 discussio of them have bee give i Sectio 4. Fially, i Sectio 5, we preset our coclusios. 2 Cloal Selectio Priciple &CLONALG Cloal selectio is the theory used to explai the basic properties of a adaptive immue respose to a atigeic stimulus. It establish the idea that oly those cells capable of recogizig a atigeic stimulus will proliferate ad differetiate ito effectors cells, thus beig selected agaist those that do ot. Maily features of the cloal selectio priciple are affiity proportioal reproductio ad mutatio. The higher affiity, the higher umber of offsprig geerated. The mutatio suffered by each immue cell durig reproductio is iversely proportioal to the affiity of the cell receptor with the atige. The stadard geetic algorithm does t accout for these immue properties [0]. De Castro& Vo Zube proposed a Cloal selectio algorithm amed CLONALG, to fulfill these basic processes ivolved i cloal selectio priciple. CLONALG will be iitially proposed to perform machie-learig ad patter recogitio tasks, ad the adapted to be applied to optimizatio problems []. The algorithm of the CLONALG for the optimizatio task is give below.. Geerate j atibodies radomly. 2. Repeat a predetermied umber of times: a. Determie the affiity of each atibody (Ab). This affiity correspods to the evaluatio of the objective fuctio. b. Select the highest affiity atibodies. c. The selected atibodies will be cloed proportioally to their affiities, geeratig a repertory C of cloes: the higher affiity the higher umber of cloes ad vice versa. d. The cloes from C are subject to hypermutatio process iversely proportioal to their atigeic affiity. The higher affiity, the smaller mutatio, ad vice versa. e. Determie the affiity of the mutated cloes C. f. From this set C of cloes ad atibodies, select the j highest affiity cloes to compose the ew atibodies populatio. g. Replace the d lowest affiity atibodies by ew idividuals geerated at radom. 3. Ed repeat [2]. illustrative example. I our example we have a fuzzy system with two iputs ad oe output whose shapes are triagular ad each of them cosist of three membership fuctios. They are deoted x, x2 ad y, respectively. The rages of the variables x, x2 ad y are [0,7], [0,80] ad [0,50]. Each of them use low, medium, high liguistic terms. I this case, the liguistic rules are as follows: Rule : If x is low ad x2 is high the y is medium. Rule 2: If x is medium ad x2 is low the y is low. Rule 3: If x is medium ad x2 is medium the y is medium. Rule 4: If x is medium ad x2 is high the y is high. Rule 5: If x is high the y is high. Some referece values must be measured beforehad for this system. These are the output values obtaied correspodig to specific iput values. : If x= ad x2=80 the y=20. 2: If x=3 ad x2=20 the y=6. 3: If x=4 ad x2=50 the y=26. 4: If x=5 ad x2= 80 the y=36. 5: If x=7 ad x2= 60 the y=40. The membership fuctios of fuzzy system for iput ad output variables will be as show i Fig.. 3 Computatio of the MISO membership fuctios usig CLONALG I this sectio, we described how the membership fuctios compute as a parameter optimizatio problem usig CLONALG for MISO fuzzy system o a Fig.: A sample membership fuctios for the MISO fuzzy system Expected from a CLONALG is to fid the base legths of right triagles ad itersectio poits of triagles ISSN: ISBN:

3 correspodig to the referece data. Its secod goal is to obtai the output values correspodig to all the appropriate iput values amog defiite rages of system. If the base legth of each membership fuctio is represeted by 6-bit, the maximum value each base ca take is 2 7 =28. The domai itervals for iput ad output variables are [0, 7], [0, 80] ad [0, 50], respectively. The base values are reflected uder these values. This is formulated as follows: d X i = X + *( X X ) mi L () i (2 ) maxi mii L is the legth of related variable (i this case, it is Atibody- Ab ) i bits, d is the decimal value of this variable, X mi is the miimum value of regio to be trasformed, ad X max is the maximum value of this regio, the X i is the trasformed figure of that variable. The affiity fuctio of this procedure is calculated as follows: Affiity = MaxError TotalError (2) TotalError = ( y CLONALGi y i ) i = [( y y ) ( y y )] (3) MaxError = max ; CLONALGi mi max CLONALGi (4) 2 these two membership fuctios are ANDed, outputs are determied from lower grades of membership fuctios, but if two membership fuctios are ORed, outputs are determied from higher grades of membership fuctios. If there is more tha oe membership fuctio itersectig with these give iputs, the the formulatio which is give i Eq.5 is used for acquirig the output value. y * = ( yi )* yi μ( yi ) μ (5) This example is described i Fig. 2. The give values are show as xi ad x2i. xi has itersected with low ad medium ad x2i has itersected with medium ad high. Firstly, the grades of membership are determied for each membership fuctio from the Fig.2. The the rules which are triggered accordig to these values are detected. I our example first, third ad fourth rules are triggered. For the first rule µ low is 0.7 ad µ medium is 0.4. where y i is the output of i th referece iput; y CLONALGi obtaied by CLONALG, is output for i th referece iput, ad is the umber of iput-output data pairs give.. The aim is to approximate the TotalError to zero as close as possible. Be cause of that affiity fuctio is coverted to MaxError-TotalError, i this way; miimizatio process is also coverted to maximizatio process. I order to prevet affiity fuctio from gettig egative values, the maximum umber 5628 is used ad this umber is also maximum error at the same time. How this umber acquired has bee showed i the below. max[(y CLONALGi -y mi );(y max - y CLONALGi )] 2 Error max[(20-0);(50-20)] 2 = max[(6-0);(50-6)] 2 = max[(26-0);(50-26)] 2 = max[(36-0);(50-36)] 2 = max[(40-0);(50-40)] 2 = max[(y CLONALGi -y mi );(y max - y CLONALGi )] Let solve a example for uderstadig how the output value has bee computed regardig to give base values. The base values are take 2 for x ad 45 for x2. Firstly the membership fuctios must be foud for these variables. The, it is explored if two membership fuctios ca be put i a rule or ot. If they ca, the grades of membership fuctios are calculated ad aalyzed to determie if the rule cotais AND or OR. If Fig.2: Fidig the appropriate outputs of CLONALG for give values for the MISO fuzzy system We choose the µ medium =0.4 because the rule ivolves AND. The same process has repeated for third ad fourth rule. I the third rule µ medium =0.2 ad i the forth rule µ high =0.2 are take. The acquired outputs correspodig to rules are 8, 6 ad 23, respectively. We defuzzificate the output value usig equatio 5 ad obtaied 8.75 as result. ISSN: ISBN:

4 4 Experimetal Results I this sectio, CLONALG used to optimize the MISO fuzzy membership fuctios is implemeted by Matlab 7. R4. After 25 iteratio completed, the idividual whose affiity is maximum has bee accepted as optimal solutio. The affiity value accepted as the optimum solutio is ad its membership fuctio shape is depicted i Fig. 3. For showig the results were t obtaied by coicidetally, 20 differet groups were geerated. A group cosisted of 0 differet iitial populatios ad a populatio cosisted of 0 Ab idividuals. The algorithm was set to ru for 25 geeratios o each populatio i the groups, respectively. The the maximum affiities values of each group are depicted i the Fig Max. Affiity Values Group No Fig.5: The maximum affiity values of each groups Results are compared group by group. As show i the figure, at least oe Ab coverged to the optimum solutio i each group. Tha it was straightforward to say the CLONALG represeted a good performace while fidig the optimum base distace of a fuzzy membership fuctios. Fig.3: The membership fuctio shape of the optimal solutio for the MISO fuzzy system Affiity Geeratio No Fig.4: The affiity values of CLONALG accordig to geeratio umber of a populatio The affiity values of algorithms accordig to geeratio umber of a populatio are give i the Fig. 4. As see from Fig. 4, CLONALG coverged to optimum solutio quickly because of the cloig ad hyper mutatio processes. Also, it provided the stability of the affiity values. 5 Coclusio The most appropriate placemet of membership fuctios with respect to fuzzy variables ca be foud for a fuzzy system whose rules table ad shape of membership fuctios were give previously. There are o restrictios for shape of membership fuctios. They ca be geerally used but it ca be mathematical fuctio whose model is kow. The, the issues to be determied are the parameters that defie the model. Because of this, the membership optimizatio problem ca be reduced to parameter optimizatio problem. How the membership fuctios compute as a parameter optimizatio problem usig CLONALG is descried for Multiple Iput Sigle Output (MISO) fuzzy system i this work. CLONALG used to optimize the fuzzy membership fuctios was implemeted by Matlab 7. R4. Firstly, 20 differet groups were geerated for showig the results were t obtaied by coicidetally. A group cosisted of 0 differet iitial populatios ad a populatio cosisted of 0 Ab idividuals. The algorithms were set to ru for 25 geeratios o each populatio i the groups, respectively. The the acquired results are examied. It was see that, at least oe idividual Ab coverged to the optimum solutio i each ISSN: ISBN:

5 group. As well, it could be said that accordig to results, CLONALG coverged to optimum solutio quickly because of the ow cloig ad hyper mutatio mechaisms. Also, the stability of the affiity values was provided by the CLONALG algorithm. Tha it was straightforward to say the CLONALG represeted a good performace while fidig the optimum base distace of a fuzzy membership fuctios of a MISO fuzzy system. Issue o Artificial Immue Systems, Vol.6, No.3, 2002, pp [2]N. C. Cortes, D.T. Perez, C.A. Coello, Hadlig Costraits i Global Optimizatio Usig a Artificial Immue System, Lecture Notes i Computer Sciece Vol. 3627,Spriger-Verlag,Berli Heidelberg, 2005, pp Ackowledgemets: The authors ackowledge the support of this study provided by Selçuk Uiversity Scietific Research Projects. The authors have also thaked to TUBITAK for their support of this study. Refereces: []C.L.Karr, Desig of a Adaptive Fuzzy Cotroller Usig a Geetic Algorithm, Proc. of the 4th Itl. Cof. o Geetic Algorithms, 99. [2]D.L. Meredith, C.L. Karr, K. Krisha Kumar, The Use of Geetic Algorithms i The Desig of Fuzzy Logic Cotrollers, 3rd Workshop o Neural Network WNN'92, 992. [3]M.A. Lee, H. Takagi, Itegratig Desig Stages of Fuzzy Systems Usig Geetic Algorithms, 2d IEEE Itl. Cof. o Fuzzy Systems, 993. [4]H.D. Cheg, Y.M. Lui, Automatic Badwidth Selectio of Fuzzy Membership Fuctios, Iformatio Scieces, Vol.03, 997, pp.-27. [5]A. Bağiş, Determiig Fuzzy Membership Fuctios with Tabu Search a Applicatio to Cotrol, Fuzzy Sets ad Systems,Vol. 39, 2003, pp [6]M. Cerrada, J. Aguilar, E. Colia, A. Titli, Dyamical Membership Fuctios: a Approach for Adaptive Fuzzy Modelig, Fuzzy Sets ad Systems, Vol , pp [7]D. Simo, H Estimatio for Fuzzy Membership Fuctio Optimizatio, Iteratioal Joural of Approximate Reasoig, Vol.40, 2005, pp [8]Yag, N.K. Bose, Geeratig Fuzzy Membership Fuctio with Self-Orgaizig Feature Map, Patter Recogitio Letters, Vol.27, 2006, pp [9]A.M. Sakiroglu, A. Arsla, Cloal Selectio Priciple for Fuzzy Membership Fuctio Optimizatio, Lecture Notes i Computer Sciece,Vol.443, Spriger-Verlag,Berli Heidelberg, 2007,pp [0]L.N de Castro, J.I. Timmis, Artificial Immue Systems: A New Computatioal Itelligece Approach, Spriger -Verlag, Lodo, 2002, 357 pages. []L.N de Castro, J.V. Zube, Learig ad Optimizatio Usig Cloal Selectio Priciple, IEEE Trasactio o Evolutioary Computatio, Special ISSN: ISBN:

Ones Assignment Method for Solving Traveling Salesman Problem

Ones Assignment Method for Solving Traveling Salesman Problem Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:

More information

Fuzzy Rule Selection by Data Mining Criteria and Genetic Algorithms

Fuzzy Rule Selection by Data Mining Criteria and Genetic Algorithms Fuzzy Rule Selectio by Data Miig Criteria ad Geetic Algorithms Hisao Ishibuchi Dept. of Idustrial Egieerig Osaka Prefecture Uiversity 1-1 Gakue-cho, Sakai, Osaka 599-8531, JAPAN E-mail: hisaoi@ie.osakafu-u.ac.jp

More information

3D Model Retrieval Method Based on Sample Prediction

3D Model Retrieval Method Based on Sample Prediction 20 Iteratioal Coferece o Computer Commuicatio ad Maagemet Proc.of CSIT vol.5 (20) (20) IACSIT Press, Sigapore 3D Model Retrieval Method Based o Sample Predictio Qigche Zhag, Ya Tag* School of Computer

More information

Cubic Polynomial Curves with a Shape Parameter

Cubic Polynomial Curves with a Shape Parameter roceedigs of the th WSEAS Iteratioal Coferece o Robotics Cotrol ad Maufacturig Techology Hagzhou Chia April -8 00 (pp5-70) Cubic olyomial Curves with a Shape arameter MO GUOLIANG ZHAO YANAN Iformatio ad

More information

ISSN (Print) Research Article. *Corresponding author Nengfa Hu

ISSN (Print) Research Article. *Corresponding author Nengfa Hu Scholars Joural of Egieerig ad Techology (SJET) Sch. J. Eg. Tech., 2016; 4(5):249-253 Scholars Academic ad Scietific Publisher (A Iteratioal Publisher for Academic ad Scietific Resources) www.saspublisher.com

More information

An Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem

An Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem A Improved Shuffled Frog-Leapig Algorithm for Kapsack Problem Zhoufag Li, Ya Zhou, ad Peg Cheg School of Iformatio Sciece ad Egieerig Hea Uiversity of Techology ZhegZhou, Chia lzhf1978@126.com Abstract.

More information

Solving Fuzzy Assignment Problem Using Fourier Elimination Method

Solving Fuzzy Assignment Problem Using Fourier Elimination Method Global Joural of Pure ad Applied Mathematics. ISSN 0973-768 Volume 3, Number 2 (207), pp. 453-462 Research Idia Publicatios http://www.ripublicatio.com Solvig Fuzzy Assigmet Problem Usig Fourier Elimiatio

More information

Małgorzata Sterna. Mateusz Cicheński, Mateusz Jarus, Michał Miszkiewicz, Jarosław Szymczak

Małgorzata Sterna. Mateusz Cicheński, Mateusz Jarus, Michał Miszkiewicz, Jarosław Szymczak Małgorzata Stera Mateusz Cicheński, Mateusz Jarus, Michał Miszkiewicz, Jarosław Szymczak Istitute of Computig Sciece Pozań Uiversity of Techology Pozań - Polad Scope of the Talk Problem defiitio MP Formulatio

More information

Euclidean Distance Based Feature Selection for Fault Detection Prediction Model in Semiconductor Manufacturing Process

Euclidean Distance Based Feature Selection for Fault Detection Prediction Model in Semiconductor Manufacturing Process Vol.133 (Iformatio Techology ad Computer Sciece 016), pp.85-89 http://dx.doi.org/10.1457/astl.016. Euclidea Distace Based Feature Selectio for Fault Detectio Predictio Model i Semicoductor Maufacturig

More information

Dynamic Programming and Curve Fitting Based Road Boundary Detection

Dynamic Programming and Curve Fitting Based Road Boundary Detection Dyamic Programmig ad Curve Fittig Based Road Boudary Detectio SHYAM PRASAD ADHIKARI, HYONGSUK KIM, Divisio of Electroics ad Iformatio Egieerig Chobuk Natioal Uiversity 664-4 Ga Deokji-Dog Jeoju-City Jeobuk

More information

Improving Template Based Spike Detection

Improving Template Based Spike Detection Improvig Template Based Spike Detectio Kirk Smith, Member - IEEE Portlad State Uiversity petra@ee.pdx.edu Abstract Template matchig algorithms like SSE, Covolutio ad Maximum Likelihood are well kow for

More information

Optimum Solution of Quadratic Programming Problem: By Wolfe s Modified Simplex Method

Optimum Solution of Quadratic Programming Problem: By Wolfe s Modified Simplex Method Volume VI, Issue III, March 7 ISSN 78-5 Optimum Solutio of Quadratic Programmig Problem: By Wolfe s Modified Simple Method Kalpaa Lokhade, P. G. Khot & N. W. Khobragade, Departmet of Mathematics, MJP Educatioal

More information

BASED ON ITERATIVE ERROR-CORRECTION

BASED ON ITERATIVE ERROR-CORRECTION A COHPARISO OF CRYPTAALYTIC PRICIPLES BASED O ITERATIVE ERROR-CORRECTIO Miodrag J. MihaljeviC ad Jova Dj. GoliC Istitute of Applied Mathematics ad Electroics. Belgrade School of Electrical Egieerig. Uiversity

More information

ANN WHICH COVERS MLP AND RBF

ANN WHICH COVERS MLP AND RBF ANN WHICH COVERS MLP AND RBF Josef Boští, Jaromír Kual Faculty of Nuclear Scieces ad Physical Egieerig, CTU i Prague Departmet of Software Egieerig Abstract Two basic types of artificial eural etwors Multi

More information

An Estimation of Distribution Algorithm for solving the Knapsack problem

An Estimation of Distribution Algorithm for solving the Knapsack problem Vol.4,No.5, 214 Published olie: May 25, 214 DOI: 1.7321/jscse.v4.5.1 A Estimatio of Distributio Algorithm for solvig the Kapsack problem 1 Ricardo Pérez, 2 S. Jös, 3 Arturo Herádez, 4 Carlos A. Ochoa *1,

More information

arxiv: v2 [cs.ds] 24 Mar 2018

arxiv: v2 [cs.ds] 24 Mar 2018 Similar Elemets ad Metric Labelig o Complete Graphs arxiv:1803.08037v [cs.ds] 4 Mar 018 Pedro F. Felzeszwalb Brow Uiversity Providece, RI, USA pff@brow.edu March 8, 018 We cosider a problem that ivolves

More information

A Note on Least-norm Solution of Global WireWarping

A Note on Least-norm Solution of Global WireWarping A Note o Least-orm Solutio of Global WireWarpig Charlie C. L. Wag Departmet of Mechaical ad Automatio Egieerig The Chiese Uiversity of Hog Kog Shati, N.T., Hog Kog E-mail: cwag@mae.cuhk.edu.hk Abstract

More information

Probabilistic Fuzzy Time Series Method Based on Artificial Neural Network

Probabilistic Fuzzy Time Series Method Based on Artificial Neural Network America Joural of Itelliget Systems 206, 6(2): 42-47 DOI: 0.5923/j.ajis.2060602.02 Probabilistic Fuzzy Time Series Method Based o Artificial Neural Network Erol Egrioglu,*, Ere Bas, Cagdas Haka Aladag

More information

Improvement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation

Improvement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation Improvemet of the Orthogoal Code Covolutio Capabilities Usig FPGA Implemetatio Naima Kaabouch, Member, IEEE, Apara Dhirde, Member, IEEE, Saleh Faruque, Member, IEEE Departmet of Electrical Egieerig, Uiversity

More information

Introduction. Nature-Inspired Computing. Terminology. Problem Types. Constraint Satisfaction Problems - CSP. Free Optimization Problem - FOP

Introduction. Nature-Inspired Computing. Terminology. Problem Types. Constraint Satisfaction Problems - CSP. Free Optimization Problem - FOP Nature-Ispired Computig Hadlig Costraits Dr. Şima Uyar September 2006 Itroductio may practical problems are costraied ot all combiatios of variable values represet valid solutios feasible solutios ifeasible

More information

The Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana

The Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana The Closest Lie to a Data Set i the Plae David Gurey Southeaster Louisiaa Uiversity Hammod, Louisiaa ABSTRACT This paper looks at three differet measures of distace betwee a lie ad a data set i the plae:

More information

Fuzzy Membership Function Optimization for System Identification Using an Extended Kalman Filter

Fuzzy Membership Function Optimization for System Identification Using an Extended Kalman Filter Fuzzy Membership Fuctio Optimizatio for System Idetificatio Usig a Eteded Kalma Filter Srikira Kosaam ad Da Simo Clevelad State Uiversity NAFIPS Coferece Jue 4, 2006 Embedded Cotrol Systems Research Lab

More information

A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON

A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON Roberto Lopez ad Eugeio Oñate Iteratioal Ceter for Numerical Methods i Egieerig (CIMNE) Edificio C1, Gra Capitá s/, 08034 Barceloa, Spai ABSTRACT I this work

More information

Heuristic Approaches for Solving the Multidimensional Knapsack Problem (MKP)

Heuristic Approaches for Solving the Multidimensional Knapsack Problem (MKP) Heuristic Approaches for Solvig the Multidimesioal Kapsack Problem (MKP) R. PARRA-HERNANDEZ N. DIMOPOULOS Departmet of Electrical ad Computer Eg. Uiversity of Victoria Victoria, B.C. CANADA Abstract: -

More information

Evaluation of Support Vector Machine Kernels for Detecting Network Anomalies

Evaluation of Support Vector Machine Kernels for Detecting Network Anomalies Evaluatio of Support Vector Machie Kerels for Detectig Network Aomalies Prera Batta, Maider Sigh, Zhida Li, Qigye Dig, ad Ljiljaa Trajković Commuicatio Networks Laboratory http://www.esc.sfu.ca/~ljilja/cl/

More information

An Algorithm to Solve Multi-Objective Assignment. Problem Using Interactive Fuzzy. Goal Programming Approach

An Algorithm to Solve Multi-Objective Assignment. Problem Using Interactive Fuzzy. Goal Programming Approach It. J. Cotemp. Math. Scieces, Vol. 6, 0, o. 34, 65-66 A Algorm to Solve Multi-Objective Assigmet Problem Usig Iteractive Fuzzy Goal Programmig Approach P. K. De ad Bharti Yadav Departmet of Mathematics

More information

Adaptive Resource Allocation for Electric Environmental Pollution through the Control Network

Adaptive Resource Allocation for Electric Environmental Pollution through the Control Network Available olie at www.sciecedirect.com Eergy Procedia 6 (202) 60 64 202 Iteratioal Coferece o Future Eergy, Eviromet, ad Materials Adaptive Resource Allocatio for Electric Evirometal Pollutio through the

More information

Criterion in selecting the clustering algorithm in Radial Basis Functional Link Nets

Criterion in selecting the clustering algorithm in Radial Basis Functional Link Nets WSEAS TRANSACTIONS o SYSTEMS Ag Sau Loog, Og Hog Choo, Low Heg Chi Criterio i selectig the clusterig algorithm i Radial Basis Fuctioal Lik Nets ANG SAU LOONG 1, ONG HONG CHOON 2 & LOW HENG CHIN 3 Departmet

More information

Image Segmentation EEE 508

Image Segmentation EEE 508 Image Segmetatio Objective: to determie (etract) object boudaries. It is a process of partitioig a image ito distict regios by groupig together eighborig piels based o some predefied similarity criterio.

More information

Variance as a Stopping Criterion for Genetic Algorithms with Elitist Model

Variance as a Stopping Criterion for Genetic Algorithms with Elitist Model Fudameta Iformaticae 120 (2012) 145 164 145 DOI 10.3233/FI-2012-754 IOS Press Variace as a Stoppig Criterio for Geetic Algorithms with Elitist Model Diabadhu Bhadari, C. A. Murthy, Sakar K. Pal Ceter for

More information

condition w i B i S maximum u i

condition w i B i S maximum u i ecture 10 Dyamic Programmig 10.1 Kapsack Problem November 1, 2004 ecturer: Kamal Jai Notes: Tobias Holgers We are give a set of items U = {a 1, a 2,..., a }. Each item has a weight w i Z + ad a utility

More information

Performance Plus Software Parameter Definitions

Performance Plus Software Parameter Definitions Performace Plus+ Software Parameter Defiitios/ Performace Plus Software Parameter Defiitios Chapma Techical Note-TG-5 paramete.doc ev-0-03 Performace Plus+ Software Parameter Defiitios/2 Backgroud ad Defiitios

More information

Image Analysis. Segmentation by Fitting a Model

Image Analysis. Segmentation by Fitting a Model Image Aalysis Segmetatio by Fittig a Model Christophoros Nikou cikou@cs.uoi.gr Images take from: D. Forsyth ad J. Poce. Computer Visio: A Moder Approach, Pretice Hall, 2003. Computer Visio course by Svetlaa

More information

A New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method

A New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method A ew Morphological 3D Shape Decompositio: Grayscale Iterframe Iterpolatio Method D.. Vizireau Politehica Uiversity Bucharest, Romaia ae@comm.pub.ro R. M. Udrea Politehica Uiversity Bucharest, Romaia mihea@comm.pub.ro

More information

New Fuzzy Color Clustering Algorithm Based on hsl Similarity

New Fuzzy Color Clustering Algorithm Based on hsl Similarity IFSA-EUSFLAT 009 New Fuzzy Color Clusterig Algorithm Based o hsl Similarity Vasile Ptracu Departmet of Iformatics Techology Tarom Compay Bucharest Romaia Email: patrascu.v@gmail.com Abstract I this paper

More information

A Parallel DFA Minimization Algorithm

A Parallel DFA Minimization Algorithm A Parallel DFA Miimizatio Algorithm Ambuj Tewari, Utkarsh Srivastava, ad P. Gupta Departmet of Computer Sciece & Egieerig Idia Istitute of Techology Kapur Kapur 208 016,INDIA pg@iitk.ac.i Abstract. I this

More information

Using a Dynamic Interval Type-2 Fuzzy Interpolation Method to Improve Modeless Robots Calibrations

Using a Dynamic Interval Type-2 Fuzzy Interpolation Method to Improve Modeless Robots Calibrations Joural of Cotrol Sciece ad Egieerig 3 (25) 9-7 doi:.7265/2328-223/25.3. D DAVID PUBLISHING Usig a Dyamic Iterval Type-2 Fuzzy Iterpolatio Method to Improve Modeless Robots Calibratios Yig Bai ad Dali Wag

More information

Continuous Ant Colony System and Tabu Search Algorithms Hybridized for Global Minimization of Continuous Multi-minima Functions

Continuous Ant Colony System and Tabu Search Algorithms Hybridized for Global Minimization of Continuous Multi-minima Functions Cotiuous At Coloy System ad Tabu Search Algorithms Hybridized for Global Miimizatio of Cotiuous Multi-miima Fuctios Akbar Karimi Departmet of Aerospace Egieerig, Sharif Uiversity of Techology, P.O. Box:

More information

A Novel Approach to Solve Multiple Traveling Salesmen Problem by Genetic Algorithm

A Novel Approach to Solve Multiple Traveling Salesmen Problem by Genetic Algorithm A Novel Approach to Solve Multiple Travelig Salesme Problem by Geetic Algorithm Adrás Király, Jáos Aboyi Uiversity of Paoia, Departmet of Process Egieerig, P.O. Box 58. Veszprém H-8200, HUNGARY, e-mail:

More information

Bezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only

Bezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only Edited: Yeh-Liag Hsu (998--; recommeded: Yeh-Liag Hsu (--9; last updated: Yeh-Liag Hsu (9--7. Note: This is the course material for ME55 Geometric modelig ad computer graphics, Yua Ze Uiversity. art of

More information

Primitive polynomials selection method for pseudo-random number generator

Primitive polynomials selection method for pseudo-random number generator Joural of hysics: Coferece Series AER OEN ACCESS rimitive polyomials selectio method for pseudo-radom umber geerator To cite this article: I V Aiki ad Kh Alajjar 08 J. hys.: Cof. Ser. 944 0003 View the

More information

Evaluation of Different Fitness Functions for the Evolutionary Testing of an Autonomous Parking System

Evaluation of Different Fitness Functions for the Evolutionary Testing of an Autonomous Parking System Evaluatio of Differet Fitess Fuctios for the Evolutioary Testig of a Autoomous Parkig System Joachim Wegeer 1 ad Oliver Bühler 2 1 DaimlerChrysler AG, Research ad Techology, Alt-Moabit 96 a, D-10559 Berli,

More information

BOOLEAN MATHEMATICS: GENERAL THEORY

BOOLEAN MATHEMATICS: GENERAL THEORY CHAPTER 3 BOOLEAN MATHEMATICS: GENERAL THEORY 3.1 ISOMORPHIC PROPERTIES The ame Boolea Arithmetic was chose because it was discovered that literal Boolea Algebra could have a isomorphic umerical aspect.

More information

LU Decomposition Method

LU Decomposition Method SOLUTION OF SIMULTANEOUS LINEAR EQUATIONS LU Decompositio Method Jamie Traha, Autar Kaw, Kevi Marti Uiversity of South Florida Uited States of America kaw@eg.usf.edu http://umericalmethods.eg.usf.edu Itroductio

More information

Lecture 18. Optimization in n dimensions

Lecture 18. Optimization in n dimensions Lecture 8 Optimizatio i dimesios Itroductio We ow cosider the problem of miimizig a sigle scalar fuctio of variables, f x, where x=[ x, x,, x ]T. The D case ca be visualized as fidig the lowest poit of

More information

Project 2.5 Improved Euler Implementation

Project 2.5 Improved Euler Implementation Project 2.5 Improved Euler Implemetatio Figure 2.5.10 i the text lists TI-85 ad BASIC programs implemetig the improved Euler method to approximate the solutio of the iitial value problem dy dx = x+ y,

More information

9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence

9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence _9.qxd // : AM Page Chapter 9 Sequeces, Series, ad Probability 9. Sequeces ad Series What you should lear Use sequece otatio to write the terms of sequeces. Use factorial otatio. Use summatio otatio to

More information

Parameter Tuning of Evolutionary Algorithms: Generalist vs. Specialist

Parameter Tuning of Evolutionary Algorithms: Generalist vs. Specialist Parameter Tuig of Evolutioary Algorithms: Geeralist vs. Specialist S.K. Smit ad A.E. Eibe Vrije Uiversiteit Amsterdam The Netherlads {sksmit,gusz}@cs.vu.l http://mobat.sourceforge.et Abstract. Fidig appropriate

More information

Exact Minimum Lower Bound Algorithm for Traveling Salesman Problem

Exact Minimum Lower Bound Algorithm for Traveling Salesman Problem Exact Miimum Lower Boud Algorithm for Travelig Salesma Problem Mohamed Eleiche GeoTiba Systems mohamed.eleiche@gmail.com Abstract The miimum-travel-cost algorithm is a dyamic programmig algorithm to compute

More information

Data-Driven Nonlinear Hebbian Learning Method for Fuzzy Cognitive Maps

Data-Driven Nonlinear Hebbian Learning Method for Fuzzy Cognitive Maps Data-Drive Noliear Hebbia Learig Method for Fuzzy Cogitive Maps Wociech Stach, Lukasz Kurga, ad Witold Pedrycz Abstract Fuzzy Cogitive Maps (FCMs) are a coveiet tool for modelig of dyamic systems by meas

More information

Algorithms for Disk Covering Problems with the Most Points

Algorithms for Disk Covering Problems with the Most Points Algorithms for Disk Coverig Problems with the Most Poits Bi Xiao Departmet of Computig Hog Kog Polytechic Uiversity Hug Hom, Kowloo, Hog Kog csbxiao@comp.polyu.edu.hk Qigfeg Zhuge, Yi He, Zili Shao, Edwi

More information

Arithmetic Sequences

Arithmetic Sequences . Arithmetic Sequeces COMMON CORE Learig Stadards HSF-IF.A. HSF-BF.A.1a HSF-BF.A. HSF-LE.A. Essetial Questio How ca you use a arithmetic sequece to describe a patter? A arithmetic sequece is a ordered

More information

Chapter 1. Introduction to Computers and C++ Programming. Copyright 2015 Pearson Education, Ltd.. All rights reserved.

Chapter 1. Introduction to Computers and C++ Programming. Copyright 2015 Pearson Education, Ltd.. All rights reserved. Chapter 1 Itroductio to Computers ad C++ Programmig Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 1.1 Computer Systems 1.2 Programmig ad Problem Solvig 1.3 Itroductio to C++ 1.4 Testig

More information

Neutrosophic Linear Programming Problems

Neutrosophic Linear Programming Problems Neutrosophic Operatioal Research I Neutrosophic Liear Programmig Problems Abdel-Nasser Hussia Mai Mohamed Mohamed Abdel-Baset 3 Floreti Smaradache 4 Departmet of Iformatio System, Faculty of Computers

More information

Pattern Recognition Systems Lab 1 Least Mean Squares

Pattern Recognition Systems Lab 1 Least Mean Squares Patter Recogitio Systems Lab 1 Least Mea Squares 1. Objectives This laboratory work itroduces the OpeCV-based framework used throughout the course. I this assigmet a lie is fitted to a set of poits usig

More information

Redundancy Allocation for Series Parallel Systems with Multiple Constraints and Sensitivity Analysis

Redundancy Allocation for Series Parallel Systems with Multiple Constraints and Sensitivity Analysis IOSR Joural of Egieerig Redudacy Allocatio for Series Parallel Systems with Multiple Costraits ad Sesitivity Aalysis S. V. Suresh Babu, D.Maheswar 2, G. Ragaath 3 Y.Viaya Kumar d G.Sakaraiah e (Mechaical

More information

Optimization for framework design of new product introduction management system Ma Ying, Wu Hongcui

Optimization for framework design of new product introduction management system Ma Ying, Wu Hongcui 2d Iteratioal Coferece o Electrical, Computer Egieerig ad Electroics (ICECEE 2015) Optimizatio for framework desig of ew product itroductio maagemet system Ma Yig, Wu Hogcui Tiaji Electroic Iformatio Vocatioal

More information

A METHOD OF GENERATING RULES FOR A KERNEL FUZZY CLASSIFIER

A METHOD OF GENERATING RULES FOR A KERNEL FUZZY CLASSIFIER Proceedigs of the Sixth Iteratioal Coferece o Machie Learig ad Cyberetics, Hog Kog, 9- August 7 A METHOD OF GENERATING RULES FOR A KERNEL FUZZY CLASSIFIER AI-MIN YANG,, XIN-GUANG LI, LING-MIN JIANG,YONG-MEI

More information

New Results on Energy of Graphs of Small Order

New Results on Energy of Graphs of Small Order Global Joural of Pure ad Applied Mathematics. ISSN 0973-1768 Volume 13, Number 7 (2017), pp. 2837-2848 Research Idia Publicatios http://www.ripublicatio.com New Results o Eergy of Graphs of Small Order

More information

Optimal Mapped Mesh on the Circle

Optimal Mapped Mesh on the Circle Koferece ANSYS 009 Optimal Mapped Mesh o the Circle doc. Ig. Jaroslav Štigler, Ph.D. Bro Uiversity of Techology, aculty of Mechaical gieerig, ergy Istitut, Abstract: This paper brigs out some ideas ad

More information

Markov Chain Model of HomePlug CSMA MAC for Determining Optimal Fixed Contention Window Size

Markov Chain Model of HomePlug CSMA MAC for Determining Optimal Fixed Contention Window Size Markov Chai Model of HomePlug CSMA MAC for Determiig Optimal Fixed Cotetio Widow Size Eva Krimiger * ad Haiph Latchma Dept. of Electrical ad Computer Egieerig, Uiversity of Florida, Gaiesville, FL, USA

More information

An Efficient Algorithm for Graph Bisection of Triangularizations

An Efficient Algorithm for Graph Bisection of Triangularizations A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045 Oe Brookigs Drive St. Louis, Missouri 63130-4899, USA jaegerg@cse.wustl.edu

More information

The golden search method: Question 1

The golden search method: Question 1 1. Golde Sectio Search for the Mode of a Fuctio The golde search method: Questio 1 Suppose the last pair of poits at which we have a fuctio evaluatio is x(), y(). The accordig to the method, If f(x())

More information

Performance Comparisons of PSO based Clustering

Performance Comparisons of PSO based Clustering Performace Comparisos of PSO based Clusterig Suresh Chadra Satapathy, 2 Guaidhi Pradha, 3 Sabyasachi Pattai, 4 JVR Murthy, 5 PVGD Prasad Reddy Ail Neeruoda Istitute of Techology ad Scieces, Sagivalas,Vishaapatam

More information

Computational Geometry

Computational Geometry Computatioal Geometry Chapter 4 Liear programmig Duality Smallest eclosig disk O the Ageda Liear Programmig Slides courtesy of Craig Gotsma 4. 4. Liear Programmig - Example Defie: (amout amout cosumed

More information

Designing a learning system

Designing a learning system CS 75 Machie Learig Lecture Desigig a learig system Milos Hauskrecht milos@cs.pitt.edu 539 Seott Square, x-5 people.cs.pitt.edu/~milos/courses/cs75/ Admiistrivia No homework assigmet this week Please try

More information

Parabolic Path to a Best Best-Fit Line:

Parabolic Path to a Best Best-Fit Line: Studet Activity : Fidig the Least Squares Regressio Lie By Explorig the Relatioship betwee Slope ad Residuals Objective: How does oe determie a best best-fit lie for a set of data? Eyeballig it may be

More information

UNIVERSITY OF MORATUWA

UNIVERSITY OF MORATUWA UNIVERSITY OF MORATUWA FACULTY OF ENGINEERING DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING B.Sc. Egieerig 2014 Itake Semester 2 Examiatio CS2052 COMPUTER ARCHITECTURE Time allowed: 2 Hours Jauary 2016

More information

CSCI 5090/7090- Machine Learning. Spring Mehdi Allahyari Georgia Southern University

CSCI 5090/7090- Machine Learning. Spring Mehdi Allahyari Georgia Southern University CSCI 5090/7090- Machie Learig Sprig 018 Mehdi Allahyari Georgia Souther Uiversity Clusterig (slides borrowed from Tom Mitchell, Maria Floria Balca, Ali Borji, Ke Che) 1 Clusterig, Iformal Goals Goal: Automatically

More information

Recursive Procedures. How can you model the relationship between consecutive terms of a sequence?

Recursive Procedures. How can you model the relationship between consecutive terms of a sequence? 6. Recursive Procedures I Sectio 6.1, you used fuctio otatio to write a explicit formula to determie the value of ay term i a Sometimes it is easier to calculate oe term i a sequece usig the previous terms.

More information

A Study on the Performance of Cholesky-Factorization using MPI

A Study on the Performance of Cholesky-Factorization using MPI A Study o the Performace of Cholesky-Factorizatio usig MPI Ha S. Kim Scott B. Bade Departmet of Computer Sciece ad Egieerig Uiversity of Califoria Sa Diego {hskim, bade}@cs.ucsd.edu Abstract Cholesky-factorizatio

More information

Fuzzy Minimal Solution of Dual Fully Fuzzy Matrix Equations

Fuzzy Minimal Solution of Dual Fully Fuzzy Matrix Equations Iteratioal Coferece o Applied Mathematics, Simulatio ad Modellig (AMSM 2016) Fuzzy Miimal Solutio of Dual Fully Fuzzy Matrix Equatios Dequa Shag1 ad Xiaobi Guo2,* 1 Sciece Courses eachig Departmet, Gasu

More information

Morgan Kaufmann Publishers 26 February, COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 5

Morgan Kaufmann Publishers 26 February, COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 5 Morga Kaufma Publishers 26 February, 28 COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter 5 Set-Associative Cache Architecture Performace Summary Whe CPU performace icreases:

More information

Math 10C Long Range Plans

Math 10C Long Range Plans Math 10C Log Rage Plas Uits: Evaluatio: Homework, projects ad assigmets 10% Uit Tests. 70% Fial Examiatio.. 20% Ay Uit Test may be rewritte for a higher mark. If the retest mark is higher, that mark will

More information

Harris Corner Detection Algorithm at Sub-pixel Level and Its Application Yuanfeng Han a, Peijiang Chen b * and Tian Meng c

Harris Corner Detection Algorithm at Sub-pixel Level and Its Application Yuanfeng Han a, Peijiang Chen b * and Tian Meng c Iteratioal Coferece o Computatioal Sciece ad Egieerig (ICCSE 015) Harris Corer Detectio Algorithm at Sub-pixel Level ad Its Applicatio Yuafeg Ha a, Peijiag Che b * ad Tia Meg c School of Automobile, Liyi

More information

Digital Microfluidic Biochips Online Fault Detection Route Optimization Scheme Chuan-pei XU and Tong-zhou ZHAO *

Digital Microfluidic Biochips Online Fault Detection Route Optimization Scheme Chuan-pei XU and Tong-zhou ZHAO * 2018 Iteratioal Coferece o Commuicatio, Network ad Artificial Itelligece (CNAI 2018) ISBN: 978-1-60595-065-5 Digital Microfluidic Biochips Olie Fault Detectio Route Optimizatio Scheme Chua-pei XU ad Tog-zhou

More information

Assignment and Travelling Salesman Problems with Coefficients as LR Fuzzy Parameters

Assignment and Travelling Salesman Problems with Coefficients as LR Fuzzy Parameters Iteratioal Joural of Applied Sciece ad Egieerig., 3: 557 Assigmet ad Travellig Salesma Problems with Coefficiets as Fuzzy Parameters Amit Kumar ad Aila Gupta * School of Mathematics ad Computer Applicatios,

More information

Creating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA

Creating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA Creatig Exact Bezier Represetatios of CST Shapes David D. Marshall Califoria Polytechic State Uiversity, Sa Luis Obispo, CA 93407-035, USA The paper presets a method of expressig CST shapes pioeered by

More information

Pruning and Summarizing the Discovered Time Series Association Rules from Mechanical Sensor Data Qing YANG1,a,*, Shao-Yu WANG1,b, Ting-Ting ZHANG2,c

Pruning and Summarizing the Discovered Time Series Association Rules from Mechanical Sensor Data Qing YANG1,a,*, Shao-Yu WANG1,b, Ting-Ting ZHANG2,c Advaces i Egieerig Research (AER), volume 131 3rd Aual Iteratioal Coferece o Electroics, Electrical Egieerig ad Iformatio Sciece (EEEIS 2017) Pruig ad Summarizig the Discovered Time Series Associatio Rules

More information

performance to the performance they can experience when they use the services from a xed location.

performance to the performance they can experience when they use the services from a xed location. I the Proceedigs of The First Aual Iteratioal Coferece o Mobile Computig ad Networkig (MobiCom 9) November -, 99, Berkeley, Califoria USA Performace Compariso of Mobile Support Strategies Rieko Kadobayashi

More information

Multi Attributes Approach for Tourist Trips Design

Multi Attributes Approach for Tourist Trips Design Multi Attributes Approach for Tourist Trips Desig Ilaria Baffo 1, Pasquale Caroteuto 2, Atoella Petrillo 3, Fabio De Felice 4 1 Idustrial Egieerig School (DEIM) - Uiversity of Tuscia, Italy ilaria.baffo@uitus.it

More information

HADOOP: A NEW APPROACH FOR DOCUMENT CLUSTERING

HADOOP: A NEW APPROACH FOR DOCUMENT CLUSTERING Y.K. Patil* Iteratioal Joural of Advaced Research i ISSN: 2278-6244 IT ad Egieerig Impact Factor: 4.54 HADOOP: A NEW APPROACH FOR DOCUMENT CLUSTERING Prof. V.S. Nadedkar** Abstract: Documet clusterig is

More information

An Efficient Algorithm for Graph Bisection of Triangularizations

An Efficient Algorithm for Graph Bisection of Triangularizations Applied Mathematical Scieces, Vol. 1, 2007, o. 25, 1203-1215 A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045, Oe

More information

Accuracy Improvement in Camera Calibration

Accuracy Improvement in Camera Calibration Accuracy Improvemet i Camera Calibratio FaJie L Qi Zag ad Reihard Klette CITR, Computer Sciece Departmet The Uiversity of Aucklad Tamaki Campus, Aucklad, New Zealad fli006, qza001@ec.aucklad.ac.z r.klette@aucklad.ac.z

More information

Cluster Analysis. Andrew Kusiak Intelligent Systems Laboratory

Cluster Analysis. Andrew Kusiak Intelligent Systems Laboratory Cluster Aalysis Adrew Kusiak Itelliget Systems Laboratory 2139 Seamas Ceter The Uiversity of Iowa Iowa City, Iowa 52242-1527 adrew-kusiak@uiowa.edu http://www.icae.uiowa.edu/~akusiak Two geeric modes of

More information

Neuro Fuzzy Model for Human Face Expression Recognition

Neuro Fuzzy Model for Human Face Expression Recognition IOSR Joural of Computer Egieerig (IOSRJCE) ISSN : 2278-0661 Volume 1, Issue 2 (May-Jue 2012), PP 01-06 Neuro Fuzzy Model for Huma Face Expressio Recogitio Mr. Mayur S. Burage 1, Prof. S. V. Dhopte 2 1

More information

AN OPTIMIZATION NETWORK FOR MATRIX INVERSION

AN OPTIMIZATION NETWORK FOR MATRIX INVERSION 397 AN OPTIMIZATION NETWORK FOR MATRIX INVERSION Ju-Seog Jag, S~ Youg Lee, ad Sag-Yug Shi Korea Advaced Istitute of Sciece ad Techology, P.O. Box 150, Cheogryag, Seoul, Korea ABSTRACT Iverse matrix calculatio

More information

Classification of binary vectors by using DSC distance to minimize stochastic complexity

Classification of binary vectors by using DSC distance to minimize stochastic complexity Patter Recogitio Letters 24 (2003) 65 73 www.elsevier.com/locate/patrec Classificatio of biary vectors by usig DSC distace to miimize stochastic complexity Pasi Fr ati *, Matao Xu, Ismo K arkk aie Departmet

More information

4.3 Modeling with Arithmetic Sequences

4.3 Modeling with Arithmetic Sequences Name Class Date 4.3 Modelig with Arithmetic Sequeces Essetial Questio: How ca you solve real-world problems usig arithmetic sequeces? Resource Locker Explore Iterpretig Models of Arithmetic Sequeces You

More information

1. SWITCHING FUNDAMENTALS

1. SWITCHING FUNDAMENTALS . SWITCING FUNDMENTLS Switchig is the provisio of a o-demad coectio betwee two ed poits. Two distict switchig techiques are employed i commuicatio etwors-- circuit switchig ad pacet switchig. Circuit switchig

More information

Memetic Algorithm: Hybridization of Hill Climbing with Selection Operator

Memetic Algorithm: Hybridization of Hill Climbing with Selection Operator Iteratioal Joural of Soft Computig ad Egieerig (IJSCE) ISSN: 2231-2307, Volume-3, Issue-2, May 2013 Memetic Algorithm: Hybridizatio of Hill Climbig with Selectio Operator Rakesh Kumar, Sajay Tyagi, Maju

More information

Evolutionary Hybrid Genetic-Firefly Algorithm for Global Optimization

Evolutionary Hybrid Genetic-Firefly Algorithm for Global Optimization Iteratioal Joural of Computatioal Egieerig & Maagemet, Vol. 6 Issue, May ISSN (Olie): -789 www..org Evolutioary Hybrid Geetic-Firefly Algorithm for Global Optimizatio 7 Shaik Farook, P. Sagameswara Raju

More information

Theory of Fuzzy Soft Matrix and its Multi Criteria in Decision Making Based on Three Basic t-norm Operators

Theory of Fuzzy Soft Matrix and its Multi Criteria in Decision Making Based on Three Basic t-norm Operators Theory of Fuzzy Soft Matrix ad its Multi Criteria i Decisio Makig Based o Three Basic t-norm Operators Md. Jalilul Islam Modal 1, Dr. Tapa Kumar Roy 2 Research Scholar, Dept. of Mathematics, BESUS, Howrah-711103,

More information

On Infinite Groups that are Isomorphic to its Proper Infinite Subgroup. Jaymar Talledo Balihon. Abstract

On Infinite Groups that are Isomorphic to its Proper Infinite Subgroup. Jaymar Talledo Balihon. Abstract O Ifiite Groups that are Isomorphic to its Proper Ifiite Subgroup Jaymar Talledo Baliho Abstract Two groups are isomorphic if there exists a isomorphism betwee them Lagrage Theorem states that the order

More information

Parallel Polygon Approximation Algorithm Targeted at Reconfigurable Multi-Ring Hardware

Parallel Polygon Approximation Algorithm Targeted at Reconfigurable Multi-Ring Hardware Parallel Polygo Approximatio Algorithm Targeted at Recofigurable Multi-Rig Hardware M. Arif Wai* ad Hamid R. Arabia** *Califoria State Uiversity Bakersfield, Califoria, USA **Uiversity of Georgia, Georgia,

More information

Fuzzy Linear Regression Analysis

Fuzzy Linear Regression Analysis 12th IFAC Coferece o Programmable Devices ad Embedded Systems The Iteratioal Federatio of Automatic Cotrol September 25-27, 2013. Fuzzy Liear Regressio Aalysis Jaa Nowaková Miroslav Pokorý VŠB-Techical

More information

An Integrated Matching and Partitioning Problem with Applications in Intermodal Transport

An Integrated Matching and Partitioning Problem with Applications in Intermodal Transport 2015 IEEE Symposium Series o Computatioal Itelligece A Itegrated Matchig ad Partitioig Problem with Applicatios i Itermodal Trasport Erwi Pesch, Domiik Kress, Sebastia Meiswikel Uiversity of Siege Deptartmet

More information

Our second algorithm. Comp 135 Machine Learning Computer Science Tufts University. Decision Trees. Decision Trees. Decision Trees.

Our second algorithm. Comp 135 Machine Learning Computer Science Tufts University. Decision Trees. Decision Trees. Decision Trees. Comp 135 Machie Learig Computer Sciece Tufts Uiversity Fall 2017 Roi Khardo Some of these slides were adapted from previous slides by Carla Brodley Our secod algorithm Let s look at a simple dataset for

More information

Mining from Quantitative Data with Linguistic Minimum Supports and Confidences

Mining from Quantitative Data with Linguistic Minimum Supports and Confidences Miig from Quatitative Data with Liguistic Miimum Supports ad Cofideces Tzug-Pei Hog, Mig-Jer Chiag ad Shyue-Liag Wag Departmet of Electrical Egieerig Natioal Uiversity of Kaohsiug Kaohsiug, 8, Taiwa, R.O.C.

More information

Bayesian approach to reliability modelling for a probability of failure on demand parameter

Bayesian approach to reliability modelling for a probability of failure on demand parameter Bayesia approach to reliability modellig for a probability of failure o demad parameter BÖRCSÖK J., SCHAEFER S. Departmet of Computer Architecture ad System Programmig Uiversity Kassel, Wilhelmshöher Allee

More information