A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON
|
|
- Drusilla Garrison
- 5 years ago
- Views:
Transcription
1 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/, Barceloa, Spai ABSTRACT I this work we costruct a software model for the multilayer perceptro eural etwork. The whole process is carried out i the Uified Modelig Laguage (UML), which provides a formal framework for the modelig of software systems. The fial implemetatio, called Flood, has bee writte i the C++ Programmig Laguage ad placed uder the GNU Lesser Geeral Public Licese. KEYWORDS eural etworks, multilayer perpeptro, software egieerig, uified modelig laguage, C++ programmig laguage 1. INTRODUCTION The multilayer perceptro is a cetral model of eural etwork, which has foud a wide rage of applicatios. Two of the mai learig tasks for the multilayer perceptro are fuctio regressio ad patter recogitio. Both problems ca be formulated as data modelig problems. The fuctio regressio problem ca be regarded as the problem of approximatig a fuctio from a iput-target data set (Bishop 1995). The targets are a specificatio of what the output respose to the iputs should be. The task of patter recogitio (or classificatio) ca be stated as the process whereby a received patter, characterized by a distict set of features, is assiged to oe of a prescribed umber of classes (Bishop 1995). A patter recogitio problem ca be solved by approximatig a fuctio from iput-target data, where the iputs iclude a set of features which characterize a patter, ad the targets specify the class that each patter belogs to. Here we model a software implemetatio for the multilayer perceptro. The modelig process is carried out i the Uified Modelig Laguage (UML). The fial implemetatio, called Flood, provides a comprehesive C++ class library for the solutio of fuctio regressio ad patter recogitio problems (Lopez 2007). Flood has bee released as the ope source GNU Lesser Geeral Public Licese. 2. THE MULTILAYER PERCEPTRON Here we preset a theory of the multilayer perceptro from the perspective of fuctioal aalysis ad variatioal calculus. Withi this theory, a multilayer perceptro is described by four cocepts: a euro model, the perceptro, a etwork architecture, the feed-forward, ad associated objective fuctioals ad traiig algorithms. A euro model is the basic iformatio processig uit i a eural etwork. The perceptro is the characteristic euro model i the multilayer perceptro (Bishop 1995). It computes a et iput sigal u as a fuctio h of the iput sigals x ad the free parameters (b,w). The et iput sigal is the subjected to a activatio fuctio g to produce a output sigal y. Two of the most used activatio fuctios are the sigmoid fuctio, g(u) = tah(u), ad the liear fuctio, g(u) = u. 464
2 IADIS Iteratioal Coferece Applied Computig 2007 Mathematically, a perceptro euro model spas a parameterized fuctio space V from a iput X R to a output Y R (Lopez & Oñate 2006). The fuctio space V is parameterized by the free parameters of the euro (b,w), ad therefore the dimesio V is 1+. The elemets of the fuctio space spaed by a perceptro are of the form y: R R x a y(x;b,w) Although a sigle perceptro ca perform certai simple tasks, the power of eural computatio comes from coectig may euros i a etwork architecture. The architecture of a eural etwork refers to the umber of euros, their arragemet ad coectivity. The characteristic etwork architecture i the multilayer perceptro is the so called feed-forward architecture (Bishop 1995). A feed-forward architecture typically cosists o a iput layer of sesorial odes, oe or more hidde layers of euros, ad a output layer of euros. Commuicatio proceeds layer by layer from the iput layer via the hidde layers up to the output layer. I this way, a multilayer perceptro is a feed-forward etwork architecture of perceptro euro models. I a similar way as it happes with a sigle perceptro, a multilayer perceptro spas a parameterized m fuctio space V from a iput X R to a output Y R (Lopez & Oñate 2006). Elemets of V are parameterized by the free parameters i the etwork, which ca be grouped together i a s -dimesioal free parameter vector α. The dimesio of the fuctio space V is therefore s. The elemets of the fuctio space spaed by a multilayer perceptro are of the form m y: R R x a y(x; α) A multilayer perceptro with as few as oe hidde layer of sigmoid euros ad a output layer of liear euros provides a geeral framework for approximatig ay fuctio from oe fiite dimesioal space to aother up to ay desired degree of accuracy, provided sufficietly may hidde euros are available. I this sese, multilayer perceptro etworks are a class of uiversal approximators (Horik et al 1989). The objective fuctioal defies the task that the etwork is required to accomplish ad provides a measure of the quality of the represetatio that it is required to lear. A objective fuctioal for the multilayer perceptro is of the form F: V R y(x; α) a F[y(x; α)] The learig problem for the multilayer perceptro ca the be formulated i terms of the miimizatio of a objective fuctioal of the fuctio space spaed by the eural etwork (Lopez & Oñate 2006). Oe of the most commo objective fuctioals used i fuctio regressio ad patter recogitio is the sum squared error (SSE), which is measured o a iput-target data set (Bishop 1995). There are several variat objective fuctioals of the sum squared error. Two of the most used are the mea squared error (MSE) ad the root mea squared error (RMSE). O the other had, the objective fuctioal, F[y(x; α )], has a objective fuctio associated, f( α ), which is defied as a fuctio of the free parameters i the etwork, s f: R R α a f( α) The miimum or maximum value of the objective fuctioal is achieved for a vector of free parameters at which the objective fuctio takes o a miimum or maximum value, respectively. Therefore, the learig problem for the multilayer perceptro, formulated as a variatioal problem, ca be reduced to a fuctio optimizatio problem (Lopez & Oñate 2006). The traiig algorithm is etrusted to solve the reduced fuctio optimizatio problem, by adjustig the free parameters i the etwork so as to optimize the objective fuctio. More specifically, the traiig * algorithm searches i a s -dimesioal space for a parameter vector α at which the objective fuctio f takes a maximum or a miimum value. The tasks of maximizatio ad miimizatio are trivially related to each other, sice maximizatio of f( α ) is equivalet to miimizatio of f( α ), ad vice versa. O the other 465
3 had, a miimum ca be either a global miimum, the smallest value of the fuctio over its etire rage, or a local miimum, the smallest value of the fuctio withi some local eighborhood. Traiig algorithms might require iformatio from the objective fuctio oly, the gradiet vector of the objective fuctio or the Hessia matrix of the objective fuctio. These methods, i tur, ca perform either global or local optimizatio. Zero-order traiig algorithms make use of the objective fuctio oly. The most sigificat zero-order traiig algorithms are stochastic, which ivolve radomess i the optimizatio process. Typical examples are evolutioary algorithms (Fogel 1994), which are global optimizatio methods. First-order traiig algorithms use the objective fuctio ad its gradiet vector. Examples of these are gradiet descet, cojugate gradiet or quasi-newto methods (Bishop 1995). They are all local optimizatio methods. Secod-order traiig algorithms make use of the objective fuctio, its gradiet vector ad its Hessia matrix. A example is the Newto's method (Bishop 1995), which is a local optimizatio method. 3. THE SOFTWARE MODEL The Uified Modelig Laguage (UML) is a geeral purpose visual modelig laguage that is used to specify, visualize, costruct, ad documet the artifacts of a software system (Rumbaugh et al 1999). UML class diagrams show the classes of the system, their iterrelatioships ad the attributes ad operatios of the classes. I order to costruct a software model for the multilayer perceptro, we follow a top-dow developmet. This approach to the problem begis at the highest coceptual level ad works dow to the details. I this way, to create ad evolve a coceptual class diagram for the multilayer perceptro, we iteratively model (i) classes, (ii) associatios, (iii) derived classes ad (iv) attributes ad operatios. I object-orieted modelig cocepts are represeted by meas of classes. Therefore, a prime task is to idetify the mai cocepts (or classes) of the problem domai. I UML class diagrams, classes are depicted as boxes (Rumbaugh et al 1999). I this work, we have see that the multilayer perceptro is characterized by a euro model, a etwork architecture, ad associated objective fuctioals ad traiig algorithms. The characterizatio i classes of these four cocepts for the multilayer perceptro is as follows: -Perceptro: The class which represets the cocept of perceptro euro model is called Perceptro. -Multilayer perceptro: The class represetig the cocept of multilayer perceptro etwork architecture is called MultilayerPerceptro. -Objective fuctioal: The class which represets the cocept of objective fuctioal for a multilayer perceptro is called ObjectiveFuctioal. -Traiig algorithm: The class represetig the cocept of traiig algorithm for a multilayer perceptro is called TraiigAlgorithm. Oce idetified the mai cocepts i the model it is ecessary to aggregate the associatios amog them. A associatio is a relatioship betwee two cocepts which poits some sigificative or iterestig iformatio (Rumbaugh et al 1999). The appropriate associatios are ext idetified to be icluded to the UML class diagram of the system: -Perceptro Multilayer perceptro: A multilayer perceptro is built by perceptros. -Multilayer perceptro - Objective fuctioal: A multilayer perceptro has assiged a objective fuctioal. -Objective fuctioal - Traiig algorithm: A objective fuctioal is improved by a traiig algorithm. I object-orieted programmig, some classes are desiged oly as a paret from which sub-classes may be derived, but which is ot itself suitable for istatiatio. This is said to be a abstract class, as opposed to a cocrete class, which is suitable to be istatiated. The derived class cotais all the features of the base class, but may have ew features added or redefie existig features (Rumbaugh et al 1999). Associatios betwee a base class a a derived class are of the kid is a. The ext task is the to establish which classes are abstract ad to derive the ecessary cocrete classes to be added to the system. Let us the examie the classes we have so far: -Perceptro: The class Perceptro is abstract, because it does ot represet ay cocrete euro model, sice it must be assiged a specific activatio fuctio. O the other had, a multilayer perceptro with a sigmoid hidde layer ad a liear output layer meets the uiversal approximatio theorem (Horik et al 466
4 IADIS Iteratioal Coferece Applied Computig ). Therefore, cocrete classes for the sigmoid ad liear perceptros must be derived. These are called SigmoidPerceptro ad LiearPerceptro, respectively. -Multilayer perceptro: The class MultilayerPerceptro is a cocrete class ad is itself suitable for istatiatio. -Objective fuctioal: The class ObjectiveFuctioal is abstract, because it does ot represet a cocrete objective fuctioal for the multilayer perceptro. Three objective fuctioals which are very used i fuctio regressio ad patter recogitio are the sum squared error, the mea squared error ad the root mea squared error. Therefore we derive the classes SumSquaredError, MeaSquaredError ad RootMeaSquaredError. It is always possible to derive ew objective fuctioals for the multilayer perceptro at ay time ad iclude them i the system. -Traiig algorithm: The class TraiigAlgorithm is abstract, because it does ot represet a cocrete traiig algorithm for the multilayer perceptro. Here we derive the classes GradietDescet, CojugateGradiet, NewtoMethod, QuasiNewtoMethod ad EvolutioaryAlgorithm to represet the cocepts of gradiet descet, cojugate gradiet, Newto s method, quasi-newto method ad evolutioary algorithm, respectively. As before, it is always possible to derive ay ew traiig algorithm for the multilayer perceptro to be added to the system. A attribute is a amed value or relatioship that exists for all or some istaces of a class. A operatio is a procedure associated with a class (Rumbaugh et al 1999). I UML class diagrams, classes are depicted as boxes with three sectios: the top oe idicates the ame of the class, the oe i the middle lists the attributes of the class, ad the bottom oe lists the operatios. Oly the mai attributes ad operatios for the most importat classes i the system are ext idetified to be icluded to the UML class diagram: -Perceptro: The mai attribute of a perceptro is the umber of iputs. The mai operatio it performs is to get the output sigal for a give set of iput sigals. -Multilayer perceptro: The mai attributes of a multilayer perceptro are the umber of iputs, the umber of hidde euros ad the umber of outputs. The mai operatio it performs is to get the set outputs for a give set of iputs. -Objective fuctioal: The mai attribute of a objective fuctioal is a relatioship to a multilayer perceptro, implemeted i C++ as a poiter to a multilayer perceptro object (Stroustrup 2000). The sum squared error, mea squared error ad root mea squared error classes also cotai a relatioship to a iput target data set, implemeted i C++ as a poiter to a iput target data set object. The mai operatio it performs is to obtai the evaluatio of a multilayer perceptro. -Traiig algorithm: The mai attribute of a traiig algorithm is a relatioship to a objective fuctioal for a multilayer perceptro. I C++ this is implemeted as a poiter to a objective fuctioal object (Stroustrup 2000). The mai operatio it performs is to trai a multilayer perceptro. Figure 1 shows a simplified UML class diagram for the Flood library with all the base classes, derived classes, associatios, attributes ad operatios icluded (Lopez 2007). Figure 1. The UML class diagram of Flood. 467
5 4. CONCLUSIONS A software model for the multilayer perceptro has bee costructed followig a top-dow developmet. The whole process has bee carried out i the Uified Modelig Laguage (UML) ad the fial implemetatio has bee writte i the C++ Programmig Laguage. The result is a comprehesive C++ class library for the solutio of fuctio regressio ad patter recogitio problems, called Flood ad released uder a ope source licese. REFERENCES Bishop, C., Neural Networks for Patter Recogitio. Oxford Uiversity Press. Fogel, D.B., A itroductio to simulated evolutioary optimizatio. I IEEE Trasactios o Neural Networks, Vol. 5, No. 1, pp Horik, K. et al, Multilayer feedforward etworks are uiversal approximators. I Neural Networks, Vol. 2, No. 5, pp Lopez, R. ad Oñate, E., A Variatioal Formulatio for the Multilayer Perceptro. Proceedigs of the 16th Iteratioal Coferece o Artificial Neural Networks. Athes, Greece, Vol 1, pp Lopez, R., Flood: A Ope Source Neural Networks C++ Library, Rumbaugh, J. et al, The Uified Modelig Laguage Referece Maual. Addiso Wesley. Stroustrup, B., The C++ Programmig Laguage. Addiso Wesley. 468
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 informationOnes 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 informationLecture 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 informationPattern 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 informationarxiv: 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 informationPython 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 informationBOOLEAN 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. Written in factored form it is easy to see that the roots are 2, 2, i,
CMPS A Itroductio to Programmig Programmig Assigmet 4 I this assigmet you will write a java program that determies the real roots of a polyomial that lie withi a specified rage. Recall that the roots (or
More informationcondition 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 informationPolynomial 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 informationA 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 informationElementary 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 informationA 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Τεχνολογία Λογισμικού
ΕΘΝΙΚΟ ΜΕΤΣΟΒΙΟ ΠΟΛΥΤΕΧΝΕΙΟ Σχολή Ηλεκτρολόγων Μηχανικών και Μηχανικών Υπολογιστών Τεχνολογία Λογισμικού, 7ο/9ο εξάμηνο 2018-2019 Τεχνολογία Λογισμικού Ν.Παπασπύρου, Αν.Καθ. ΣΗΜΜΥ, ickie@softlab.tua,gr
More informationExact 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 informationGoals of the Lecture UML Implementation Diagrams
Goals of the Lecture UML Implemetatio Diagrams Object-Orieted Aalysis ad Desig - Fall 1998 Preset UML Diagrams useful for implemetatio Provide examples Next Lecture Ð A variety of topics o mappig from
More informationGoals of this Lecture Activity Diagram Example
Goals of this Lecture Activity Diagram Example Object-Orieted Aalysis ad Desig - Fall 998 Preset a example activity diagram Ð Relate to requiremets, use cases, ad class diagrams Also, respod to a questio
More informationNeural Networks A Model of Boolean Functions
Neural Networks A Model of Boolea Fuctios Berd Steibach, Roma Kohut Freiberg Uiversity of Miig ad Techology Istitute of Computer Sciece D-09596 Freiberg, Germay e-mails: steib@iformatik.tu-freiberg.de
More informationThe Magma Database file formats
The Magma Database file formats Adrew Gaylard, Bret Pikey, ad Mart-Mari Breedt Johaesburg, South Africa 15th May 2006 1 Summary Magma is a ope-source object database created by Chris Muller, of Kasas City,
More informationAdministrative 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 information1 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 informationComputers and Scientific Thinking
Computers ad Scietific Thikig David Reed, Creighto Uiversity Chapter 15 JavaScript Strigs 1 Strigs as Objects so far, your iteractive Web pages have maipulated strigs i simple ways use text box to iput
More informationCluster 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 informationCSC 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 informationOutline. Research Definition. Motivation. Foundation of Reverse Engineering. Dynamic Analysis and Design Pattern Detection in Java Programs
Dyamic Aalysis ad Desig Patter Detectio i Java Programs Outlie Lei Hu Kamra Sartipi {hul4, sartipi}@mcmasterca Departmet of Computig ad Software McMaster Uiversity Caada Motivatio Research Problem Defiitio
More informationBOOLEAN DIFFERENTIATION EQUATIONS APPLICABLE IN RECONFIGURABLE COMPUTATIONAL MEDIUM
MATEC Web of Cofereces 79, 01014 (016) DOI: 10.1051/ mateccof/0167901014 T 016 BOOLEAN DIFFERENTIATION EQUATIONS APPLICABLE IN RECONFIGURABLE COMPUTATIONAL MEDIUM Staislav Shidlovskiy 1, 1 Natioal Research
More informationChapter 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 informationParabolic 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 informationCHAPTER IV: GRAPH THEORY. Section 1: Introduction to Graphs
CHAPTER IV: GRAPH THEORY Sectio : Itroductio to Graphs Sice this class is called Number-Theoretic ad Discrete Structures, it would be a crime to oly focus o umber theory regardless how woderful those topics
More informationEvaluation scheme for Tracking in AMI
A M I C o m m u i c a t i o A U G M E N T E D M U L T I - P A R T Y I N T E R A C T I O N http://www.amiproject.org/ Evaluatio scheme for Trackig i AMI S. Schreiber a D. Gatica-Perez b AMI WP4 Trackig:
More informationIMP: 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 informationSoftware development of components for complex signal analysis on the example of adaptive recursive estimation methods.
Software developmet of compoets for complex sigal aalysis o the example of adaptive recursive estimatio methods. SIMON BOYMANN, RALPH MASCHOTTA, SILKE LEHMANN, DUNJA STEUER Istitute of Biomedical Egieerig
More informationECE4050 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 informationFREQUENCY ESTIMATION OF INTERNET PACKET STREAMS WITH LIMITED SPACE: UPPER AND LOWER BOUNDS
FREQUENCY ESTIMATION OF INTERNET PACKET STREAMS WITH LIMITED SPACE: UPPER AND LOWER BOUNDS Prosejit Bose Evagelos Kraakis Pat Mori Yihui Tag School of Computer Sciece, Carleto Uiversity {jit,kraakis,mori,y
More informationA new algorithm to build feed forward neural networks.
A ew algorithm to build feed forward eural etworks. Amit Thombre Cetre of Excellece, Software Techologies ad Kowledge Maagemet, Tech Mahidra, Pue, Idia Abstract The paper presets a ew algorithm to build
More information9.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 informationDesigning 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 informationLecture 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 informationBaan Finance Financial Statements
Baa Fiace Fiacial Statemets Module Procedure UP041A US Documetiformatio Documet Documet code : UP041A US Documet group : User Documetatio Documet title : Fiacial Statemets Applicatio/Package : Baa Fiace
More information1 Graph Sparsfication
CME 305: Discrete Mathematics ad Algorithms 1 Graph Sparsficatio I this sectio we discuss the approximatio of a graph G(V, E) by a sparse graph H(V, F ) o the same vertex set. I particular, we cosider
More informationImage 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 informationCopyright 2016 Ramez Elmasri and Shamkant B. Navathe
Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 18 Strategies for Query Processig Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Itroductio DBMS techiques to process a query Scaer idetifies
More informationChapter 10. Defining Classes. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 10 Defiig Classes Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 10.1 Structures 10.2 Classes 10.3 Abstract Data Types 10.4 Itroductio to Iheritace Copyright 2015 Pearso Educatio,
More informationCreating 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 informationChapter 11. Friends, Overloaded Operators, and Arrays in Classes. Copyright 2014 Pearson Addison-Wesley. All rights reserved.
Chapter 11 Frieds, Overloaded Operators, ad Arrays i Classes Copyright 2014 Pearso Addiso-Wesley. All rights reserved. Overview 11.1 Fried Fuctios 11.2 Overloadig Operators 11.3 Arrays ad Classes 11.4
More informationAdaptive 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 informationMATHEMATICAL 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 informationIntrusion Detection using Fuzzy Clustering and Artificial Neural Network
Itrusio Detectio usig Fuzzy Clusterig ad Artificial Neural Network Shraddha Suraa Research Scholar, Departmet of Computer Egieerig, Vishwakarma Istitute of Techology, Pue Idia shraddha.suraa@gmail.com
More informationCounting the Number of Minimum Roman Dominating Functions of a Graph
Coutig the Number of Miimum Roma Domiatig Fuctios of a Graph SHI ZHENG ad KOH KHEE MENG, Natioal Uiversity of Sigapore We provide two algorithms coutig the umber of miimum Roma domiatig fuctios of a graph
More informationAN 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 informationKeywords Software Architecture, Object-oriented metrics, Reliability, Reusability, Coupling evaluator, Cohesion, efficiency
Volume 3, Issue 9, September 2013 ISSN: 2277 128X Iteratioal Joural of Advaced Research i Computer Sciece ad Software Egieerig Research Paper Available olie at: www.ijarcsse.com Couplig Evaluator to Ehace
More informationHow do we evaluate algorithms?
F2 Readig referece: chapter 2 + slides Algorithm complexity Big O ad big Ω To calculate ruig time Aalysis of recursive Algorithms Next time: Litterature: slides mostly The first Algorithm desig methods:
More informationAnalysis 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 informationText Summarization using Neural Network Theory
Iteratioal Joural of Computer Systems (ISSN: 2394-065), Volume 03 Issue 07, July, 206 Available at http://www.ijcsolie.com/ Simra Kaur Jolly, Wg Cdr Ail Chopra 2 Departmet of CSE, Ligayas Uiversity, Faridabad
More informationCIS 121 Data Structures and Algorithms with Java Spring Stacks, Queues, and Heaps Monday, February 18 / Tuesday, February 19
CIS Data Structures ad Algorithms with Java Sprig 09 Stacks, Queues, ad Heaps Moday, February 8 / Tuesday, February 9 Stacks ad Queues Recall the stack ad queue ADTs (abstract data types from lecture.
More informationEMPIRICAL ANALYSIS OF FAULT PREDICATION TECHNIQUES FOR IMPROVING SOFTWARE PROCESS CONTROL
Iteratioal Joural of Iformatio Techology ad Kowledge Maagemet July-December 2012, Volume 5, No. 2, pp. 371-375 EMPIRICAL ANALYSIS OF FAULT PREDICATION TECHNIQUES FOR IMPROVING SOFTWARE PROCESS CONTROL
More informationΤεχνολογία Λογισμικού
ΕΘΝΙΚΟ ΜΕΤΣΟΒΙΟ ΠΟΛΥΤΕΧΝΕΙΟ Σχολή Ηλεκτρολόγων Μηχανικών και Μηχανικών Υπολογιστών Τεχνολογία Λογισμικού, 7ο/9ο εξάμηνο 2018-2019 Τεχνολογία Λογισμικού Ν.Παπασπύρου, Αν.Καθ. ΣΗΜΜΥ, ickie@softlab.tua,gr
More informationAlgorithms 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 informationPerformance 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 informationLecture 5. Counting Sort / Radix Sort
Lecture 5. Coutig Sort / Radix Sort T. H. Corme, C. E. Leiserso ad R. L. Rivest Itroductio to Algorithms, 3rd Editio, MIT Press, 2009 Sugkyukwa Uiversity Hyuseug Choo choo@skku.edu Copyright 2000-2018
More informationPruning 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 information3D 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 informationForce 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 informationCSC165H1 Worksheet: Tutorial 8 Algorithm analysis (SOLUTIONS)
CSC165H1, Witer 018 Learig Objectives By the ed of this worksheet, you will: Aalyse the ruig time of fuctios cotaiig ested loops. 1. Nested loop variatios. Each of the followig fuctios takes as iput a
More informationEmpirical Validate C&K Suite for Predict Fault-Proneness of Object-Oriented Classes Developed Using Fuzzy Logic.
Empirical Validate C&K Suite for Predict Fault-Proeess of Object-Orieted Classes Developed Usig Fuzzy Logic. Mohammad Amro 1, Moataz Ahmed 1, Kaaa Faisal 2 1 Iformatio ad Computer Sciece Departmet, Kig
More informationGlobal Support Guide. Verizon WIreless. For the BlackBerry 8830 World Edition Smartphone and the Motorola Z6c
Verizo WIreless Global Support Guide For the BlackBerry 8830 World Editio Smartphoe ad the Motorola Z6c For complete iformatio o global services, please refer to verizowireless.com/vzglobal. Whether i
More informationCOP4020 Programming Languages. Functional Programming Prof. Robert van Engelen
COP4020 Programmig Laguages Fuctioal Programmig Prof. Robert va Egele Overview What is fuctioal programmig? Historical origis of fuctioal programmig Fuctioal programmig today Cocepts of fuctioal programmig
More informationProbabilistic 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 informationAn 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 informationSolving 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 informationChapter 3 Classification of FFT Processor Algorithms
Chapter Classificatio of FFT Processor Algorithms The computatioal complexity of the Discrete Fourier trasform (DFT) is very high. It requires () 2 complex multiplicatios ad () complex additios [5]. As
More informationFuzzy 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 informationGPUMP: a Multiple-Precision Integer Library for GPUs
GPUMP: a Multiple-Precisio Iteger Library for GPUs Kaiyog Zhao ad Xiaowe Chu Departmet of Computer Sciece, Hog Kog Baptist Uiversity Hog Kog, P. R. Chia Email: {kyzhao, chxw}@comp.hkbu.edu.hk Abstract
More informationData 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 informationMath 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 informationTechnology, Covenant University, Ota, Ogun State, Nigeria. 2
Iteratioal Joural of Egieerig & Techology IJET-IJENS Vol:4 No: 5 Implemetatio of Efficiet Multilayer Perceptro ANN Neuros o Field Programmable Gate Array Chip Emmauel ADETIBA*, F.A. IBIKUNLE 2, S.A. DARAMOLA
More informationNew 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 informationImprovement 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 informationTask scenarios Outline. Scenarios in Knowledge Extraction. Proposed Framework for Scenario to Design Diagram Transformation
6-0-0 Kowledge Trasformatio from Task Scearios to View-based Desig Diagrams Nima Dezhkam Kamra Sartipi {dezhka, sartipi}@mcmaster.ca Departmet of Computig ad Software McMaster Uiversity CANADA SEKE 08
More informationOctahedral Graph Scaling
Octahedral Graph Scalig Peter Russell Jauary 1, 2015 Abstract There is presetly o strog iterpretatio for the otio of -vertex graph scalig. This paper presets a ew defiitio for the term i the cotext of
More informationCIS 121 Data Structures and Algorithms with Java Spring Stacks and Queues Monday, February 12 / Tuesday, February 13
CIS Data Structures ad Algorithms with Java Sprig 08 Stacks ad Queues Moday, February / Tuesday, February Learig Goals Durig this lab, you will: Review stacks ad queues. Lear amortized ruig time aalysis
More informationCopyright 2016 Ramez Elmasri and Shamkant B. Navathe
Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 26 Ehaced Data Models: Itroductio to Active, Temporal, Spatial, Multimedia, ad Deductive Databases Copyright 2016 Ramez Elmasri ad Shamkat B.
More informationSouth 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 informationCriterion 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 informationx x 2 x Iput layer = quatity of classificatio mode X T = traspositio matrix The core of such coditioal probability estimatig method is calculatig the
COMPARATIVE RESEARCHES ON PROBABILISTIC NEURAL NETWORKS AND MULTI-LAYER PERCEPTRON NETWORKS FOR REMOTE SENSING IMAGE SEGMENTATION Liu Gag a, b, * a School of Electroic Iformatio, Wuha Uiversity, 430079,
More informationText Feature Selection based on Feature Dispersion Degree and Feature Concentration Degree
Available olie at www.ijpe-olie.com vol. 13, o. 7, November 017, pp. 1159-1164 DOI: 10.3940/ijpe.17.07.p19.11591164 Text Feature Selectio based o Feature Dispersio Degree ad Feature Cocetratio Degree Zhifeg
More informationBig-O Analysis. Asymptotics
Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses
More informationRedundancy 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 informationChapter 4 Threads. Operating Systems: Internals and Design Principles. Ninth Edition By William Stallings
Operatig Systems: Iterals ad Desig Priciples Chapter 4 Threads Nith Editio By William Stalligs Processes ad Threads Resource Owership Process icludes a virtual address space to hold the process image The
More informationc-dominating Sets for Families of Graphs
c-domiatig Sets for Families of Graphs Kelsie Syder Mathematics Uiversity of Mary Washigto April 6, 011 1 Abstract The topic of domiatio i graphs has a rich history, begiig with chess ethusiasts i the
More informationBezier 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 informationMOTIF XF Extension Owner s Manual
MOTIF XF Extesio Ower s Maual Table of Cotets About MOTIF XF Extesio...2 What Extesio ca do...2 Auto settig of Audio Driver... 2 Auto settigs of Remote Device... 2 Project templates with Iput/ Output Bus
More informationA Semi- Non-Negative Matrix Factorization and Principal Component Analysis Unified Framework for Data Clustering
A Semi- No-Negative Matrix Factorizatio ad Pricipal Compoet Aalysis Uified Framework for Data Clusterig V.Yuvaraj, N.SivaKumar Assistat Professor, Departmet of Computer Sciece, K.S.G college of Arts ad
More informationINTERSECTION CORDIAL LABELING OF GRAPHS
INTERSECTION CORDIAL LABELING OF GRAPHS G Meea, K Nagaraja Departmet of Mathematics, PSR Egieerig College, Sivakasi- 66 4, Virudhuagar(Dist) Tamil Nadu, INDIA meeag9@yahoocoi Departmet of Mathematics,
More informationAn Anomaly Detection Method Based On Deep Learning
Sed Orders for Reprits to reprits@bethamsciece.ae 734 The Ope Automatio ad Cotrol Systems Joural, 05, 7, 734-739 A Aomaly Detectio Method Based O Deep Learig Ope Access Hog-li Deg *, Tao yag ad Jiag-i
More informationAn Effort Estimation by UML Points in the Early Stage of Software Development
A Effort Estimatio by UML Poits i the Early Stage of Software Developmet SagEu Kim Departmet of Computer Sciece Texas A&M Uiversity College Statio, TX USA William Lively Departmet of Computer Sciece Texas
More informationImproving 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 informationEigenimages. 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 informationNew 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 informationAppendix A. Use of Operators in ARPS
A Appedix A. Use of Operators i ARPS The methodology for solvig the equatios of hydrodyamics i either differetial or itegral form usig grid-poit techiques (fiite differece, fiite volume, fiite elemet)
More information