Fuzzy Linear Regression Analysis

Size: px
Start display at page:

Download "Fuzzy Linear Regression Analysis"

Transcription

1 12th IFAC Coferece o Programmable Devices ad Embedded Systems The Iteratioal Federatio of Automatic Cotrol September 25-27, Fuzzy Liear Regressio Aalysis Jaa Nowaková Miroslav Pokorý VŠB-Techical Uiversity of Ostrava, Faculty of Electrical Egieerig ad Computer Sciece, Departmet of Cyberetics ad Biomedical Egieerig, 17. listopadu 15/2172, Ostrava Poruba, Czech Republic ( aa.owakova@vsb.cz). VŠB-Techical Uiversity of Ostrava, Faculty of Electrical Egieerig ad Computer Sciece, Departmet of Cyberetics ad Biomedical Egieerig, 17. listopadu 15/2172, Ostrava Poruba, Czech Republic ( miroslav.pokory@vsb.cz). Abstract: The theoretical backgroud for abstract formalizatio of vague pheomeo of the complex systems is fuzzy set theory. I the paper vague data as specialized fuzzy sets - fuzzy umbers are defied ad it is described a fuzzy liear regressio model as a fuzzy fuctio with fuzzy umbers as vague parameters. Iterval ad fuzzy regressio techologies are discussed, the liear fuzzy regressio model is proposed. To idetify fuzzy regressio coefficiets of model geetic algorithm is applied. The umerical example is preseted ad the possibility area of vague model is illustrated. Keywords: Regressio model, o-specificity, iterval model, vagueess, fuzzy model, fuzzy umber, geetic algorithms, possibility area. 1. INTRODUCTION Regressio models are used i egieerig practice wherever there is a eed to reflect more idepedet variables together with the effects of other umeasured disturbaces ad iflueces Bardossy (1990), Shapiro (2006). I classical regressio, we assume that the relatioship betwee depedet variables ad idepedet variables of the model is well-defied ad sharp. I the real world, however, hampered by the fact that this relatioship is more or less o-specific ad vague. This is particularly true whe modellig complex systems which are difficult to defie, difficult to measure or i cases where it is icorporated ito the huma elemet Shapiro (2006). The theoretical backgroud for abstract formalizatio of vague pheomeo of complex systems is fuzzy set theory Novák (1990). I the paper vague data as specialized fuzzy sets - fuzzy umbers are defied ad a fuzzy liear regressio model as a fuzzy fuctio with fuzzy umbers as vague parameters is described. 2. FUZZY REGRESION ANALYSIS Liear regressio model of ivestigated system Shapiro (2006) is give by a liear combiatio of values of its iput variables Y (x ) = A 0 + A 1 x A x. (1) This work has bee supported by Proect SP2013/168, Methods of Acquisitio ad Trasmissio of Data i Distributed Systems, of the Studet Grat System, VŠB - Techical Uiversity of Ostrava. Covetioal regressio model is based o the assumptio that the system characteristic is defied by sharp, precise ad deviatios betwee observed ad estimated values of the depedet variables are the result of errors of observatio. However, the statistical regressio models based o priciples of probability theory are correct oly if a umber of precoditios is met Pokorý (1993), Shapiro (2006). The most commo practical problems are a small umber of observatios, the sample is too small, we ca ot guaratee a ormal distributio of error, difficult to defie the relatioship (vagueess) betwee the iput ad output variables. These problems do ot occur whe the creatio of regressios utilize possibility theory ad regressio depedece is idetify as a fuzzy fuctio. The origi of the deviatio betwee the observed ad estimated values of the depedet variables may ot be sigificat extet caused by poor local variables of system structure. These variatios ca be caused by i ot very sharp ature of the system parameters. Such fuzzy pheomeo must also be reflected i fuzziess of the correspodig parameters of the model. If we cosider the fuzzificatio of regressio model, we ca cosider two cases (but which are ot mutually exclusive). First of all, we cosider that the iput data are crisp ad ucertai is i the defiitio of the model. I this case, the vagueess is reflected by fuzzy ature of the regressio coefficiets as model parameters. I the secod case, we ca cosider the system as a well-defied ad /2013 IFAC / CZ

2 The idetermiate ature of fuzzy regressio model is represeted by the estimated fuzzy output values Ỹ (x ) ad the fuzzy regressio coefficiets à i the form of specialized fuzzy sets - fuzzy umbers. Shape of fuzzy liear regressio model Buckley (2008), Heshmaty (1985), Taaka (1982) is give by Ỹ (x ) = Ã0 + Ã1x Ãx = Ã.x (3) where x is a trasposed colum vector x = (x 1, x 2,..., x ) ad à is a parameter vector whose elemets are fuzzy umbers. I the fuzzy regressio fuctio à is the multidimesioal fuzzy set (fuzzy relatio) as the Cartesia product of fuzzy sets of fuzzy parameters à = Ã0 Ã1... à (4) with membership fuctio i the form Fig. 1. Oe-dimesioal liear iterval regressio model fuzzy character have the measured data. The the carrier of ucertaity of the model are vague iput data. The paper aalyzes the situatio where both cases are applied. 2.1 Iterval Liear Regressio Model The first step i creatig a blurred regressio model is the work Buckley (1990), who developed the techology of iterval regressio models... Y (x ) = A A... 1 x A... x. (2) Where Y... (x ) is the estimated value of the output variable as a closed umerical iterval represetig the ucertaity of the o-specific system ad... A are the regressio coefficiets of the model agai i the form of vague closed umerical itervals. To idetify the itervals of regressio coefficiets the method of liear programmig used i Kacprzyk (1992), for algebraic calculatios with iterval umbers simple iterval arithmetic is developed Moore (1979). Example of a oe-dimesioal liear iterval regressio model is show i Figure (1). 2.2 Fuzzy Liear Regressio Model The ext step i the developmet of idetermiate regressio model is the developmet of models of vague, usig the formalizatio of ucertaity rather tha umerical itervals usig the fuzzy itervals. Regressio models reflect the vagueess of the modelled systems are called fuzzy regressio models Kacprzyk (1992), Poleshchuk (2012), Shapiro (2006). The idetermiate ature of fuzzy regressio model is represeted by the estimated fuzzy output values Ỹ (x ) ad the fuzzy regressio coefficiets à i the form of specialized fuzzy sets - fuzzy umbers. Shape of fuzzy liear regressio model Buckley (2008), Heshmaty (1985), Taaka (1982) is give by The ext step i the developmet of idetermiate regressio model is the developmet of models of vague, usig the formalizatio of ucertaity rather tha umerical itervals usig the fuzzy itervals. Regressio models reflectig the vagueess of the modelled systems are called fuzzy regressio models Kacprzyk (1992), Poleshchuk (2012), Shapiro (2006). µã (a) = {µãi (a)}, a = (a 1, a 2,..., a ). (5) The shape of the membership fuctio of fuzzy umbers output value of fuzzy liear regressio model (1) is calculated by Zadeh s extesioal priciple Novák (1990) i the form µ γ (y) = µã (a) ; {a t = y} = 0, a at =y (6) 0 ; elsewhere. Membership fuctio µãi (a i ) is approximated i the form of triagular fuzzy umbers Ghorsray (1997), Novák (1990) µãi (a i ) = 1 α i a i c i ; α i c i a i α i + c i, 0 ; elsewhere, where α i is the mea value (core) of fuzzy umber Ãi ad c i is half of the width of the carrier bearig Ãi = {α i, c i }. The term of membership fuctios for the output fuzzy sets (3) ca be writte i the form Kacprzyk (1992) µ γ (y) = 1 y α.x c i x i ; α.x c i x i y α.x + + c i x i, 0 ; elsewhere, 2.3 Idetificatio of Fuzzy Liear Regressio Model Fitess of liear regressio fuzzy model to the give data is measured through the Bass-Kwakeraakss idex H see Figure 2. I the procedure of model idetificatio the optimizatio procedure miimizes the vagueess of global fuzzy fuctio through the miimizatio of sum of fuzzy regressio coefficiets vagueess uder coditio (7) (8) mi J = mi c i (9) h H, = 1, 2,..., m. (10) 246

3 Fig. 2. Adequacy of liear regressio fuzzy model The fitess of estimated value to sampled value is doe usig α cut ad α level set at the fitess h = H (see Fig. 2) Y 0,H = Y 0,H, Y 0,H, =, Y 0,H. (11) We assume the good estimatio of output value uder the coditio is fulfilled max y {µ γ 0 (y) µ γ (y)} = Cos (Ỹ 0, Ỹ ) H. (12) The relatio (12) is satisfied uder the coditio (Fig. 2) Boudary of itervals Y Y 0, = 1, 2,..., m, Y 0 Y, = 1, 2,..., m. (13), = 1, 2,..., m we ca express = (1 H) c i x i + α T x, = (1 H) c i x i + α T x. (14) Next we ca set the optimizatio problem for usig of geetic algorithm (1) miimizatio of fuzzy model vagueess mi J = mi c i, i = 1, 2,...,, = 1, 2,..., m, (2) subect to α T x + (1 H) c i x i y 0 + (1 H) y 0, α T x + (1 H) c i x i y 0 + (1 H) y 0. c i 0. (15) (16) Quatificatio of models vagueess is formalized by calculatig fuzzy itervals of fuzzy umbers estimated output values Ỹ (x). Width of fuzzy umbers carriers are the iterval i which the values of the output variables may lie with a defied grade of membership. O Figure 3 is graphically illustrated the course of a oe-dimesioal fuzzy liear regressio fuctio together with the appropriate possibility area of estimated fuzzy output Ỹ. Fig. 3. Oe-dimesioal fuzzy liear regressio model 3. USAGE OF GENETIC ALGORITHM As it was metioed the classical used method of liear programmig for idetificatio of fuzzy regressio coefficiets was substituted by usig of geetic algorithm (GA). The idetificatio of fuzzy regressio coefficiets à 0, Ã1,..., Ã, where Ãi = {α i, c i }, was divided ito two tasks (1) the idetificatio of the mea value (core) α i of fuzzy umber Ãi ad (2) the idetificatio of c i as a half of the width of the carrier bearig Ãi = {α i, c i }. The tasks are solved by usig geetic algorithm i series. First the idetificatio of α i ad the the idetificatio of c i are doe. The sharp observed values y 0 are fuzzificated y 0 = ay 0, (17) where a 0.02; 0.1 or aother value, but the value of a is defied by the expert. The the fuzzy observed value is defied as Ỹ 0 = {y 0, y 0 }, (18) ad the estimated fuzzy value Ỹ aalogously Ỹ = {y, y }. (19) 3.1 Idetificatio of the Mea Value (Core) α i For the idetificatio of the mea value (core) α i of fuzzy umber Ãi the miimizatio of fitess fuctio mi J 1 = mi 1 J J =1 by geetic algorithm is used. [y 0 (x ) y (x )] 2, (20) 3.2 Idetificatio of the Half of the Width of the Carrier Bearig c i For the idetificatio of c i as a half of the width of the carrier bearig Ãi the miimizatio of fitess fuctio (9) 247

4 Fig. 4. Course of GA covergece mi J 2 = mi c i (21) by geetic algorithm with three costraits (16) is used. 4. CASE STUDY For provig of efficiecy of proposed method, the two dimesioal liear fuctio i form Y 0 = x x 2 (22) was chose. The set of Y 0 with te members usig (22) was created. For creatig the set of Y 0 the values of x 1 ad x 2 were chose radomly from the stadard uiform distributio o the ope iterval (0, 1) but multiplied by radom iteger. For fuzzificatio of observed value a = 0.1 was used. The the miimizatio of fitess fuctio J 1 (20) by embedded fuctio of geetic algorithm i Optimtool i Matlab eviromet was used. The parameters of GA were elected as populatio type - double vector populatio size scalig fuctio - rak selectio - stochastic uiform mutatio fuctio - costrait depedet crossover fuctio - scattered migratio - forward stop criterio - o chages i fitess fuctio The shape of covergece of values of miimizatio of fitess fuctio J 1 is depicted i Figure (4). The outputs of the miimizatio by described GA are the estimated values of the mea values (cores) α 0, α 1 ad α 2 of Ã0, Ã1 ad Ã2. The ext step was to determie the c 0, c 1 ad c 2 of Ã0, Ã1 ad Ã2. For this task the miimizatio of fitess fuctio J 2 (21) by GA was used with the same parameters as i task of determiig of α i. As we ow have the complete iformatio to assemble the estimated fuzzy umbers Ã0, Ã1 ad Ã2 we ca defie Fig. 5. Possibility area of two-dimesioal fuzzy regressio model Y (y, y ) = Ã0 (α 0, c 0 )+Ã1 (α 1, c 1 ) x 1 +Ã2 (α 2, c 2 ) x 2, y = α 0 +α 1 x 1 +α 2 x 2, y = c 0 +c 1 x 1 +c 2 x 2. (23) With kowledge of (23) we are able to create the surfaces, which are defied as the upper ad lower boudary Y = y + y, Y = y y (24). The area betwee the created lower ad upper surface boudary could be called possibility area. For chose liear regressio fuctio (22) the determied possibility area is show i Figure (5). 5. CONCLUSION Abstract mathematical models of complex systems are ofte ot very adequate because they do ot accurately reflect the atural ucertaity ad vagueess of the real world. The suitable theoretical backgroud for abstract formalizatio of vague pheomeo of complex systems is fuzzy set theory. I the paper vague data as specialized fuzzy sets - fuzzy umbers are defied ad it is described a fuzzy liear regressio model as a fuzzy fuctio with fuzzy umbers as vague parameters. Iterval ad fuzzy regressio techology are discussed, the liear fuzzy regressio model is proposed. To idetify fuzzy regressio coefficiets of model istead of commoly used liear programmig method C etitav (2013) the effective geetic algorithm is applied Goldberg (1989). The two-dimesioal umerical example is preseted ad the possibility area of vague model is graphically illustrated. Next research will be focused o developmet of fuzzy o-liear regressio model with fuzzy output value Pokorý (1993) to have possibility to ivestigate ad model vague o-liear systems. ACKNOWLEDGEMENTS This work has bee supported by Proect SP2013/168, Methods of Acquisitio ad Trasmissio of Data i Distributed Systems, of the Studet Grat System, VŠB - Techical Uiversity of Ostrava. 248

5 REFERENCES A. Bardossy. Note o fuzzy regressio. Fuzzy Sets ad Systems, volume 37, pages 65-75, J.J. Buckley, L.J. Jowers. Fuzzy Liear Regressio I. Studies i Fuzziess ad Soft Computig, volume 22, ISBN Spriger, B. C etitav, F. Özdemir. LP Methods for Fuzzy Regressio ad a New Approach. E.Krause, Ed. I Syergies of Soft Computig ad Statistics for Itelliget Data Aalysis, volume 22, ISBN Spriger, S. Ghorsray. Fuzzy liear regressio aalysis by symmetric fuzzy umbxer coefficiets. IEEE Iteratioal Coferece o Egieerig Systems INES97, 1997, ISBN D. Goldberg. Geetic Algorithms i Search, Optimizatio ad Machie Learig. ISBN Readig, MA: Addiso-Wesley Professioal, B. Heshmaty, A. Kadel. Fuzzy Liear Regressio ad Its Applicatio to Forecastig i Ucertai Eviromet. Fuzzy Sets ad Systems, volume 15, pages H. Ishibushi, H. Taaka. Idetificatios of Fuzzy Parameters by Iterval Regressio Model. Electroics ad Commuicatios i Japa, 73:volume 12, pages J. Kacprzyk, M. Fedrizzi (Ed.). Fuzzy Regressio Aalysis. Studies i Fuzziess ad Soft Computig, ISBN-13: Publisher: Physica-Verlag HD, R.E. Moore. Methods ad Applicatios of Iterval Aalysis. SIAM (Society for Idustrial ad Applied Mathematics) Philadelphia, V. Novák. Fuzzy možiy a eich aplikace (i Czech). Studies i Fuzziess ad Soft Computig, ISBN SNTL Praha, O. Poleshchuk,E. Komarov. A fuzzy liear regressio model for iterval type-2 fuzzy sets. NAFIPS 2012, ISBN Fuzzy Iformatio Processig Society, M. Pokorý. Fuzzy elieárí regresí aalýza. Doctoral Thesis (i Czech) VUT Bro, FEL, Bro, A.F. Shapiro. Fuzzy regressio models. I research-clearig-house/2006/auary/arch06v401- ii.pdf, ( ). H. Taaka, S. Ueima, K. Asai. Liear regressio aalysis with fuzzy model. IEEE Trasactios ad Systems, Ma ad Cyberetics, 12:6,

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

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

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

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

EM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS

EM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS EM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS I this uit of the course we ivestigate fittig a straight lie to measured (x, y) data pairs. The equatio we wat to fit

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

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

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

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

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

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

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

New HSL Distance Based Colour Clustering Algorithm

New HSL Distance Based Colour Clustering Algorithm The 4th Midwest Artificial Itelligece ad Cogitive Scieces Coferece (MAICS 03 pp 85-9 New Albay Idiaa USA April 3-4 03 New HSL Distace Based Colour Clusterig Algorithm Vasile Patrascu Departemet of Iformatics

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

IMP: Superposer Integrated Morphometrics Package Superposition Tool

IMP: Superposer Integrated Morphometrics Package Superposition Tool IMP: Superposer Itegrated Morphometrics Package Superpositio Tool Programmig by: David Lieber ( 03) Caisius College 200 Mai St. Buffalo, NY 4208 Cocept by: H. David Sheets, Dept. of Physics, Caisius College

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

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

Force Network Analysis using Complementary Energy

Force Network Analysis using Complementary Energy orce Network Aalysis usig Complemetary Eergy Adrew BORGART Assistat Professor Delft Uiversity of Techology Delft, The Netherlads A.Borgart@tudelft.l Yaick LIEM Studet Delft Uiversity of Techology Delft,

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

Polynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0

Polynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0 Polyomial Fuctios ad Models 1 Learig Objectives 1. Idetify polyomial fuctios ad their degree 2. Graph polyomial fuctios usig trasformatios 3. Idetify the real zeros of a polyomial fuctio ad their multiplicity

More information

Administrative UNSUPERVISED LEARNING. Unsupervised learning. Supervised learning 11/25/13. Final project. No office hours today

Administrative UNSUPERVISED LEARNING. Unsupervised learning. Supervised learning 11/25/13. Final project. No office hours today Admiistrative Fial project No office hours today UNSUPERVISED LEARNING David Kauchak CS 451 Fall 2013 Supervised learig Usupervised learig label label 1 label 3 model/ predictor label 4 label 5 Supervised

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

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

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

CSC 220: Computer Organization Unit 11 Basic Computer Organization and Design

CSC 220: Computer Organization Unit 11 Basic Computer Organization and Design College of Computer ad Iformatio Scieces Departmet of Computer Sciece CSC 220: Computer Orgaizatio Uit 11 Basic Computer Orgaizatio ad Desig 1 For the rest of the semester, we ll focus o computer architecture:

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

Protected points in ordered trees

Protected points in ordered trees Applied Mathematics Letters 008 56 50 www.elsevier.com/locate/aml Protected poits i ordered trees Gi-Sag Cheo a, Louis W. Shapiro b, a Departmet of Mathematics, Sugkyukwa Uiversity, Suwo 440-746, Republic

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

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

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

Assignment Problems with fuzzy costs using Ones Assignment Method

Assignment Problems with fuzzy costs using Ones Assignment Method IOSR Joural of Mathematics (IOSR-JM) e-issn: 8-8, p-issn: 9-6. Volume, Issue Ver. V (Sep. - Oct.06), PP 8-89 www.iosrjourals.org Assigmet Problems with fuzzy costs usig Oes Assigmet Method S.Vimala, S.Krisha

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

Analysis of Server Resource Consumption of Meteorological Satellite Application System Based on Contour Curve

Analysis of Server Resource Consumption of Meteorological Satellite Application System Based on Contour Curve Advaces i Computer, Sigals ad Systems (2018) 2: 19-25 Clausius Scietific Press, Caada Aalysis of Server Resource Cosumptio of Meteorological Satellite Applicatio System Based o Cotour Curve Xiagag Zhao

More information

Elementary Educational Computer

Elementary Educational Computer Chapter 5 Elemetary Educatioal Computer. Geeral structure of the Elemetary Educatioal Computer (EEC) The EEC coforms to the 5 uits structure defied by vo Neuma's model (.) All uits are preseted i a simplified

More information

The identification of key quality characteristics based on FAHP

The identification of key quality characteristics based on FAHP Iteratioal Joural of Research i Egieerig ad Sciece (IJRES ISSN (Olie: 2320-9364, ISSN (Prit: 2320-9356 Volume 3 Issue 6 ǁ Jue 2015 ǁ PP.01-07 The idetificatio of ey quality characteristics based o FAHP

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

Extending The Sleuth Kit and its Underlying Model for Pooled Storage File System Forensic Analysis

Extending The Sleuth Kit and its Underlying Model for Pooled Storage File System Forensic Analysis Extedig The Sleuth Kit ad its Uderlyig Model for Pooled File System Foresic Aalysis Frauhofer Istitute for Commuicatio, Iformatio Processig ad Ergoomics Ja-Niclas Hilgert* Marti Lambertz Daiel Plohma ja-iclas.hilgert@fkie.frauhofer.de

More information

CIS 121 Data Structures and Algorithms with Java Fall Big-Oh Notation Tuesday, September 5 (Make-up Friday, September 8)

CIS 121 Data Structures and Algorithms with Java Fall Big-Oh Notation Tuesday, September 5 (Make-up Friday, September 8) CIS 11 Data Structures ad Algorithms with Java Fall 017 Big-Oh Notatio Tuesday, September 5 (Make-up Friday, September 8) Learig Goals Review Big-Oh ad lear big/small omega/theta otatios Practice solvig

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

Lecture 2: Spectra of Graphs

Lecture 2: Spectra of Graphs Spectral Graph Theory ad Applicatios WS 20/202 Lecture 2: Spectra of Graphs Lecturer: Thomas Sauerwald & He Su Our goal is to use the properties of the adjacecy/laplacia matrix of graphs to first uderstad

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

Chapter 9. Pointers and Dynamic Arrays. Copyright 2015 Pearson Education, Ltd.. All rights reserved.

Chapter 9. Pointers and Dynamic Arrays. Copyright 2015 Pearson Education, Ltd.. All rights reserved. Chapter 9 Poiters ad Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 9.1 Poiters 9.2 Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Slide 9-3

More information

SAMPLE VERSUS POPULATION. Population - consists of all possible measurements that can be made on a particular item or procedure.

SAMPLE VERSUS POPULATION. Population - consists of all possible measurements that can be made on a particular item or procedure. SAMPLE VERSUS POPULATION Populatio - cosists of all possible measuremets that ca be made o a particular item or procedure. Ofte a populatio has a ifiite umber of data elemets Geerally expese to determie

More information

DETECTION OF LANDSLIDE BLOCK BOUNDARIES BY MEANS OF AN AFFINE COORDINATE TRANSFORMATION

DETECTION OF LANDSLIDE BLOCK BOUNDARIES BY MEANS OF AN AFFINE COORDINATE TRANSFORMATION Proceedigs, 11 th FIG Symposium o Deformatio Measuremets, Satorii, Greece, 2003. DETECTION OF LANDSLIDE BLOCK BOUNDARIES BY MEANS OF AN AFFINE COORDINATE TRANSFORMATION Michaela Haberler, Heribert Kahme

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

Data Structures and Algorithms. Analysis of Algorithms

Data Structures and Algorithms. Analysis of Algorithms Data Structures ad Algorithms Aalysis of Algorithms Outlie Ruig time Pseudo-code Big-oh otatio Big-theta otatio Big-omega otatio Asymptotic algorithm aalysis Aalysis of Algorithms Iput Algorithm Output

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

Lower Bounds for Sorting

Lower Bounds for Sorting Liear Sortig Topics Covered: Lower Bouds for Sortig Coutig Sort Radix Sort Bucket Sort Lower Bouds for Sortig Compariso vs. o-compariso sortig Decisio tree model Worst case lower boud Compariso Sortig

More information

Sorting in Linear Time. Data Structures and Algorithms Andrei Bulatov

Sorting in Linear Time. Data Structures and Algorithms Andrei Bulatov Sortig i Liear Time Data Structures ad Algorithms Adrei Bulatov Algorithms Sortig i Liear Time 7-2 Compariso Sorts The oly test that all the algorithms we have cosidered so far is compariso The oly iformatio

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

Kernel Smoothing Function and Choosing Bandwidth for Non-Parametric Regression Methods 1

Kernel Smoothing Function and Choosing Bandwidth for Non-Parametric Regression Methods 1 Ozea Joural of Applied Scieces (), 009 Ozea Joural of Applied Scieces (), 009 ISSN 943-49 009 Ozea Publicatio Kerel Smoothig Fuctio ad Choosig Badwidth for No-Parametric Regressio Methods Murat Kayri 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

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

MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fitting)

MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fitting) MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fittig) I this chapter, we will eamie some methods of aalysis ad data processig; data obtaied as a result of a give

More information

Pseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance

Pseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Pseudocode ( 1.1) High-level descriptio of a algorithm More structured

More information

SOFTWARE usually does not work alone. It must have

SOFTWARE usually does not work alone. It must have Proceedigs of the 203 Federated Coferece o Computer Sciece ad Iformatio Systems pp. 343 348 A method for selectig eviromets for software compatibility testig Łukasz Pobereżik AGH Uiversity of Sciece ad

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

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

Evaluation of Fuzzy Quantities by Distance Method and its Application in Environmental Maps

Evaluation of Fuzzy Quantities by Distance Method and its Application in Environmental Maps Joural of pplied Sciece ad griculture, 8(3): 94-99, 23 ISSN 86-92 Evaluatio of Fuzzy Quatities by Distace Method ad its pplicatio i Evirometal Maps Saeifard ad L Talebi Departmet of pplied Mathematics,

More information

Chapter 5. Functions for All Subtasks. Copyright 2015 Pearson Education, Ltd.. All rights reserved.

Chapter 5. Functions for All Subtasks. Copyright 2015 Pearson Education, Ltd.. All rights reserved. Chapter 5 Fuctios for All Subtasks Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 5.1 void Fuctios 5.2 Call-By-Referece Parameters 5.3 Usig Procedural Abstractio 5.4 Testig ad Debuggig

More information

1 Enterprise Modeler

1 Enterprise Modeler 1 Eterprise Modeler Itroductio I BaaERP, a Busiess Cotrol Model ad a Eterprise Structure Model for multi-site cofiguratios are itroduced. Eterprise Structure Model Busiess Cotrol Models Busiess Fuctio

More information

Descriptive Statistics Summary Lists

Descriptive Statistics Summary Lists Chapter 209 Descriptive Statistics Summary Lists Itroductio This procedure is used to summarize cotiuous data. Large volumes of such data may be easily summarized i statistical lists of meas, couts, stadard

More information

ENGI 4421 Probability and Statistics Faculty of Engineering and Applied Science Problem Set 1 Descriptive Statistics

ENGI 4421 Probability and Statistics Faculty of Engineering and Applied Science Problem Set 1 Descriptive Statistics ENGI 44 Probability ad Statistics Faculty of Egieerig ad Applied Sciece Problem Set Descriptive Statistics. If, i the set of values {,, 3, 4, 5, 6, 7 } a error causes the value 5 to be replaced by 50,

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

Analysis of Algorithms

Analysis of Algorithms Aalysis of Algorithms Ruig Time of a algorithm Ruig Time Upper Bouds Lower Bouds Examples Mathematical facts Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite

More information

Reversible Realization of Quaternary Decoder, Multiplexer, and Demultiplexer Circuits

Reversible Realization of Quaternary Decoder, Multiplexer, and Demultiplexer Circuits Egieerig Letters, :, EL Reversible Realizatio of Quaterary Decoder, Multiplexer, ad Demultiplexer Circuits Mozammel H.. Kha, Member, ENG bstract quaterary reversible circuit is more compact tha the correspodig

More information

ANALYSIS OF RATIONAL FUNCTION DEPENDENCY TO THE HEIGHT DISTRIBUTION OF GROUND CONTROL POINTS IN GEOMETRIC CORRECTION OF AERIAL AND SATELLITE IMAGES

ANALYSIS OF RATIONAL FUNCTION DEPENDENCY TO THE HEIGHT DISTRIBUTION OF GROUND CONTROL POINTS IN GEOMETRIC CORRECTION OF AERIAL AND SATELLITE IMAGES ANALSIS OF RATIONAL FUNCTION DEPENDENC TO THE HEIGHT DISTRIBUTION OF GROUND CONTROL POINTS IN GEOMETRIC CORRECTION OF AERIAL AND SATELLITE IMAGES M. Hosseii, Departmet of Geomatics Egieerig, Faculty of

More information

Python Programming: An Introduction to Computer Science

Python Programming: An Introduction to Computer Science Pytho Programmig: A Itroductio to Computer Sciece Chapter 1 Computers ad Programs 1 Objectives To uderstad the respective roles of hardware ad software i a computig system. To lear what computer scietists

More information

SD vs. SD + One of the most important uses of sample statistics is to estimate the corresponding population parameters.

SD vs. SD + One of the most important uses of sample statistics is to estimate the corresponding population parameters. SD vs. SD + Oe of the most importat uses of sample statistics is to estimate the correspodig populatio parameters. The mea of a represetative sample is a good estimate of the mea of the populatio that

More information

Lecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming

Lecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming Lecture Notes 6 Itroductio to algorithm aalysis CSS 501 Data Structures ad Object-Orieted Programmig Readig for this lecture: Carrao, Chapter 10 To be covered i this lecture: Itroductio to algorithm aalysis

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

THIN LAYER ORIENTED MAGNETOSTATIC CALCULATION MODULE FOR ELMER FEM, BASED ON THE METHOD OF THE MOMENTS. Roman Szewczyk

THIN LAYER ORIENTED MAGNETOSTATIC CALCULATION MODULE FOR ELMER FEM, BASED ON THE METHOD OF THE MOMENTS. Roman Szewczyk THIN LAYER ORIENTED MAGNETOSTATIC CALCULATION MODULE FOR ELMER FEM, BASED ON THE METHOD OF THE MOMENTS Roma Szewczyk Istitute of Metrology ad Biomedical Egieerig, Warsaw Uiversity of Techology E-mail:

More information

Optimization of Extrusion Blow Molding Using Soft Computing and Taguchi Method

Optimization of Extrusion Blow Molding Using Soft Computing and Taguchi Method Preseted i the 6 th Iteratioal Coferece o Computer Supported Cooperative Workshop i Desig / The 1 st Iteratioal Worksop o Multidispliary Desig Optimizato, July 1-14, 001, Lodo, ON, Caada Optimizatio of

More information

Data Analysis. Concepts and Techniques. Chapter 2. Chapter 2: Getting to Know Your Data. Data Objects and Attribute Types

Data Analysis. Concepts and Techniques. Chapter 2. Chapter 2: Getting to Know Your Data. Data Objects and Attribute Types Data Aalysis Cocepts ad Techiques Chapter 2 1 Chapter 2: Gettig to Kow Your Data Data Objects ad Attribute Types Basic Statistical Descriptios of Data Data Visualizatio Measurig Data Similarity ad Dissimilarity

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

What are we going to learn? CSC Data Structures Analysis of Algorithms. Overview. Algorithm, and Inputs

What are we going to learn? CSC Data Structures Analysis of Algorithms. Overview. Algorithm, and Inputs What are we goig to lear? CSC316-003 Data Structures Aalysis of Algorithms Computer Sciece North Carolia State Uiversity Need to say that some algorithms are better tha others Criteria for evaluatio Structure

More information

The isoperimetric problem on the hypercube

The isoperimetric problem on the hypercube The isoperimetric problem o the hypercube Prepared by: Steve Butler November 2, 2005 1 The isoperimetric problem We will cosider the -dimesioal hypercube Q Recall that the hypercube Q is a graph whose

More information

Lecture 1: Introduction and Strassen s Algorithm

Lecture 1: Introduction and Strassen s Algorithm 5-750: Graduate Algorithms Jauary 7, 08 Lecture : Itroductio ad Strasse s Algorithm Lecturer: Gary Miller Scribe: Robert Parker Itroductio Machie models I this class, we will primarily use the Radom Access

More information

ECE4050 Data Structures and Algorithms. Lecture 6: Searching

ECE4050 Data Structures and Algorithms. Lecture 6: Searching ECE4050 Data Structures ad Algorithms Lecture 6: Searchig 1 Search Give: Distict keys k 1, k 2,, k ad collectio L of records of the form (k 1, I 1 ), (k 2, I 2 ),, (k, I ) where I j is the iformatio associated

More information

Outline and Reading. Analysis of Algorithms. Running Time. Experimental Studies. Limitations of Experiments. Theoretical Analysis

Outline and Reading. Analysis of Algorithms. Running Time. Experimental Studies. Limitations of Experiments. Theoretical Analysis Outlie ad Readig Aalysis of Algorithms Iput Algorithm Output Ruig time ( 3.) Pseudo-code ( 3.2) Coutig primitive operatios ( 3.3-3.) Asymptotic otatio ( 3.6) Asymptotic aalysis ( 3.7) Case study Aalysis

More information

Mobile terminal 3D image reconstruction program development based on Android Lin Qinhua

Mobile terminal 3D image reconstruction program development based on Android Lin Qinhua Iteratioal Coferece o Automatio, Mechaical Cotrol ad Computatioal Egieerig (AMCCE 05) Mobile termial 3D image recostructio program developmet based o Adroid Li Qihua Sichua Iformatio Techology College

More information

A Method for Solving Balanced Intuitionistic Fuzzy Assignment Problem

A Method for Solving Balanced Intuitionistic Fuzzy Assignment Problem P. Sethil Kumar et al t. Joural of Egieerig Research ad Applicatios SSN : 2248-9622, Vol. 4, ssue 3( Versio 1), March 2014, pp.897-903 RESEARCH ARTCLE OPEN ACCESS A Method for Solvig Balaced tuitioistic

More information

Running Time. Analysis of Algorithms. Experimental Studies. Limitations of Experiments

Running Time. Analysis of Algorithms. Experimental Studies. Limitations of Experiments Ruig Time Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects. The

More information

Wavelet Transform. CSE 490 G Introduction to Data Compression Winter Wavelet Transformed Barbara (Enhanced) Wavelet Transformed Barbara (Actual)

Wavelet Transform. CSE 490 G Introduction to Data Compression Winter Wavelet Transformed Barbara (Enhanced) Wavelet Transformed Barbara (Actual) Wavelet Trasform CSE 49 G Itroductio to Data Compressio Witer 6 Wavelet Trasform Codig PACW Wavelet Trasform A family of atios that filters the data ito low resolutio data plus detail data high pass filter

More information

Journal of Chemical and Pharmaceutical Research, 2013, 5(12): Research Article

Journal of Chemical and Pharmaceutical Research, 2013, 5(12): Research Article Available olie www.jocpr.com Joural of Chemical ad Pharmaceutical Research, 2013, 5(12):745-749 Research Article ISSN : 0975-7384 CODEN(USA) : JCPRC5 K-meas algorithm i the optimal iitial cetroids based

More information

South Slave Divisional Education Council. Math 10C

South Slave Divisional Education Council. Math 10C South Slave Divisioal Educatio Coucil Math 10C Curriculum Package February 2012 12 Strad: Measuremet Geeral Outcome: Develop spatial sese ad proportioal reasoig It is expected that studets will: 1. Solve

More information

BAYESIAN WITH FULL CONDITIONAL POSTERIOR DISTRIBUTION APPROACH FOR SOLUTION OF COMPLEX MODELS. Pudji Ismartini

BAYESIAN WITH FULL CONDITIONAL POSTERIOR DISTRIBUTION APPROACH FOR SOLUTION OF COMPLEX MODELS. Pudji Ismartini Proceedig of Iteratioal Coferece O Research, Implemetatio Ad Educatio Of Mathematics Ad Scieces 014, Yogyakarta State Uiversity, 18-0 May 014 BAYESIAN WIH FULL CONDIIONAL POSERIOR DISRIBUION APPROACH FOR

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

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

Eigenimages. Digital Image Processing: Bernd Girod, 2013 Stanford University -- Eigenimages 1

Eigenimages. Digital Image Processing: Bernd Girod, 2013 Stanford University -- Eigenimages 1 Eigeimages Uitary trasforms Karhue-Loève trasform ad eigeimages Sirovich ad Kirby method Eigefaces for geder recogitio Fisher liear discrimat aalysis Fisherimages ad varyig illumiatio Fisherfaces vs. eigefaces

More information

Running Time ( 3.1) Analysis of Algorithms. Experimental Studies. Limitations of Experiments

Running Time ( 3.1) Analysis of Algorithms. Experimental Studies. Limitations of Experiments Ruig Time ( 3.1) Aalysis of Algorithms Iput Algorithm Output A algorithm is a step- by- step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects.

More information

Analysis of Algorithms

Analysis of Algorithms Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Ruig Time Most algorithms trasform iput objects ito output objects. The

More information

Design Optimization Using Soft Computing Techniques For Extrusion Blow Molding Processes

Design Optimization Using Soft Computing Techniques For Extrusion Blow Molding Processes Desig Optimizatio Usig Soft Computig Techiques For Extrusio Blow Moldig Processes Desig Optimizatio Usig Soft Computig Techiques For Extrusio Blow Moldig Processes Jyh-Cheg Yu*, Tsug-Re Hug ad Jyh-Yeog

More information

DATA MINING II - 1DL460

DATA MINING II - 1DL460 DATA MINING II - 1DL460 Sprig 2017 A secod course i data miig http://www.it.uu.se/edu/course/homepage/ifoutv2/vt17/ Kjell Orsbor Uppsala Database Laboratory Departmet of Iformatio Techology, Uppsala Uiversity,

More information

Intrusion Detection Method Using Protocol Classification and Rough Set Based Support Vector Machine

Intrusion Detection Method Using Protocol Classification and Rough Set Based Support Vector Machine Computer ad formatio Sciece trusio Detectio Method Usig Protocol Classificatio ad Rough Set Based Support Vector Machie Xuyi Re College of Computer Sciece, Najig Uiversity of Post & Telecommuicatios Najig

More information

Algorithms Chapter 3 Growth of Functions

Algorithms Chapter 3 Growth of Functions Algorithms Chapter 3 Growth of Fuctios Istructor: Chig Chi Li 林清池助理教授 chigchi.li@gmail.com Departmet of Computer Sciece ad Egieerig Natioal Taiwa Ocea Uiversity Outlie Asymptotic otatio Stadard otatios

More information

Analysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis

Analysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis Itro to Algorithm Aalysis Aalysis Metrics Slides. Table of Cotets. Aalysis Metrics 3. Exact Aalysis Rules 4. Simple Summatio 5. Summatio Formulas 6. Order of Magitude 7. Big-O otatio 8. Big-O Theorems

More information

Normal Distributions

Normal Distributions Normal Distributios Stacey Hacock Look at these three differet data sets Each histogram is overlaid with a curve : A B C A) Weights (g) of ewly bor lab rat pups B) Mea aual temperatures ( F ) i A Arbor,

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

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