Solved Problems. (a) (b) (c) Figure P4.1 Simple Classification Problems First we draw a line between each set of dark and light data points.


 Marjorie Jordan
 1 years ago
 Views:
Transcription
1 Solved Problems Solved Problems P Solve the three simle classification roblems shown in Figure P by drawing a decision boundary Find weight and bias values that result in singleneuron ercetrons with the chosen decision boundaries (a) (b) (c) Figure P Simle Classification Problems First we draw a line between each set of dark and light data oints (a) (b) (c) The next ste is to find the weights and biases The weight vectors must be orthogonal to the decision boundaries and ointing in the direction of oints to be classified as (the dark oints) The weight vectors can have any length we like w w (a) (b) (c) w Here is one set of choices for the weight vectors: (a) w T (b) w T (c) w T 
2 Percetron Learning Rule Now we find the bias values for each ercetron by icking a oint on the decision boundary and satisfying Eq (5) b b w T w T This gives us the following three biases: (a) b (b) b (c) b 6 We can now check our solution against the original oints Here we test the first network on the inut vector T a hardlim( w T b) hardlim hardlim( 6)» ans We can use MATLAB to automate the testing rocess and to try new oints Here the first network is used to classify a oint that was not in the original roblem w[ ]; b ; a hardlim(w*[;]b) a P Convert the classification roblem defined below into an equivalent roblem definition consisting of inequalities constraining weight and bias values t t 3 t 3 t Each target t i indicates whether or not the net inut in resonse to i must be less than or greater than or equal to For examle since is we t 
3 Solved Problems know that the net inut corresonding to to Thus we get the following inequality: must be greater than or equal Alying the same rocedure to the inut/target airs for { t } { 3 t 3 } and { t } results in the following set of inequalities W b b w w w b w w w w b () i b ( ii) b < ( iii) b < ( iv) Solving a set of inequalities is more difficult than solving a set of equalities One added comlexity is that there are often an infinite number of solutions (just as there are often an infinite number of linear decision boundaries that can solve a linearly searable classification roblem) However because of the simlicity of this roblem we can solve it by grahing the solution saces defined by the inequalities Note that w only aears in inequalities (ii) and (iv) and w only aears in inequalities (i) and (iii) We can lot each air of inequalities with two grahs ii w w iv b iii i b Any weight and bias values that fall in both dark gray regions will solve the classification roblem Here is one such solution: W 3 b 33
4 Percetron Learning Rule P3 We have a classification roblem with four classes of inut vector The four classes are class : class : 3 class 3: 5 6 class : 7 8 Design a ercetron network to solve this roblem To solve a roblem with four classes of inut vector we will need a ercetron with at least two neurons since an Sneuron ercetron can categorize S classes The twoneuron ercetron is shown in Figure P Inut Hard Limit Layer x W x b x n Figure P TwoNeuron Percetron LetÕs begin by dislaying the inut vectors as in Figure P3 The light circles indicate class vectors the light squares indicate class vectors the dark circles indicate class 3 vectors and the dark squares indicate class vectors A twoneuron ercetron creates two decision boundaries Therefore to divide the inut sace into the four categories we need to have one decision boundary divide the four classes into two sets of two The remaining boundary must then isolate each class Two such boundaries are illustrated in Figure P We now know that our atterns are linearly searable x a hardlim (W b) a x 
5 Solved Problems 3 Figure P3 Inut Vectors for Problem P3 3 Figure P Tentative Decision Boundaries for Problem P3 The weight vectors should be orthogonal to the decision boundaries and should oint toward the regions where the neuron oututs are The next ste is to decide which side of each boundary should roduce a One choice is illustrated in Figure P5 where the shaded areas reresent oututs of The darkest shading indicates that both neuron oututs are Note that this solution corresonds to target values of class : t t class : t 3 t class 3: t 5 t 6 class : t 7 t 8 We can now select the weight vectors: 5
6 Percetron Learning Rule w 3 and w Note that the lengths of the weight vectors is not imortant only their directions They must be orthogonal to the decision boundaries Now we can calculate the bias by icking a oint on a boundary and satisfying Eq (5): b w T 3 b w T 3 In matrix form we have Figure P5 Decision Regions for Problem P3 W wt 3 and b wt which comletes our design P Solve the following classification roblem with the ercetron rule Aly each inut vector in order for as many reetitions as it takes to ensure that the roblem is solved Draw a grah of the roblem only after you have found a solution 6
7 Solved Problems t t 3 t 3 t Use the initial weights and bias: W( ) b( ) We start by calculating the ercetronõs outut a using the initial weights and bias for the first inut vector a hardlim( W( ) b( ) ) hardlim hardlim( ) The outut a does not equal the target value t so we use the ercetron rule to find new weights and biases based on the error e t a T W( ) W( ) e ( ) b( ) b( ) e ( ) We now aly the second inut vector bias using the udated weights and a hardlim( W( ) b( ) ) hardlim hardlim( ) This time the outut a is equal to the target t Alication of the ercetron rule will not result in any changes W( ) W( ) b( ) b( ) We now aly the third inut vector 7
8 Percetron Learning Rule a hardlim( W( ) 3 b( ) ) hardlim hardlim( ) The outut in resonse to inut vector 3 is equal to the target t 3 so there will be no changes W( 3) W( ) b( 3) b( ) We now move on to the last inut vector a hardlim( W( 3) b( 3) ) hardlim hardlim( ) This time the outut a does not equal the aroriate target t The ercetron rule will result in a new set of values for W and b e t a T W( ) W( 3) e ( ) 3 b( ) b( 3) e We now must check the first vector again This time the outut a is equal to the associated target t a hardlim( W( ) b( ) ) hardlim 3 hardlim( 8) Therefore there are no changes W( 5) W( ) b( 5) b( ) The second resentation of of weight and bias values results in an error and therefore a new set 8
9 Solved Problems a hardlim( W( 5) b( 5) ) hardlim 3 hardlim( ) Here are those new values: e t a T W( 6) W( 5) e 3 ( ) 3 b( 6) b( 5) e Cycling through each inut vector once more results in no errors a hardlim( W( 6) 3 b( 6) ) hardlim 3 t 3 a hardlim( W( 6) b( 6) ) hardlim 3 t a hardlim( W( 6) b( 6) ) hardlim 3 t a hardlim( W( 6) b( 6) ) hardlim 3 t Therefore the algorithm has converged The final solution is: W 3 b Now we can grah the training data and the decision boundary of the solution The decision boundary is given by n W b w w b 3 To find the intercet of the decision boundary set : b if 3 3 w To find the intercet set : b if w 9
10 Percetron Learning Rule The resulting decision boundary is illustrated in Figure P6 W Figure P6 Decision Boundary for Problem P Note that the decision boundary falls across one of the training vectors This is accetable given the roblem definition since the hard limit function returns when given an inut of and the target for the vector in question is indeed P5 Consider again the fourclass decision roblem that we introduced in Problem P3 Train a ercetron network to solve this roblem using the ercetron learning rule If we use the same target vectors that we introduced in Problem P3 the training set will be: t t 3 t 3 t LetÕs begin the algorithm with the following initial weights and biases: The first iteration is 5 t 5 7 t 7 W( ) 8 t 8 b( ) 6 t 6 a hardlim ( W( ) b( ) ) hardlim ( ) 3
11 Solved Problems e t a T W( ) W( ) e b( ) b( ) e The second iteration is a hardlim ( W( ) b( ) ) hardlim ( ) e t a T W( ) W( ) e b( ) b( ) e The third iteration is a hardlim ( W( ) 3 b( ) ) hardlim ( ) e t 3 a T W( 3) W( ) e 33
12 Percetron Learning Rule b( 3) b( ) e Iterations four through eight roduce no changes in the weights W( 8) W( 7) W( 6) W( 5) W( ) W( 3) b( 8) b( 7) b( 6) b( 5) b( ) b( 3) The ninth iteration roduces a hardlim ( W( 8) b( 8) ) hardlim ( ) e t a T W( 9) W( 8) e b( 9) b( 8) e At this oint the algorithm has converged since all inut atterns will be correctly classified The final decision boundaries are dislayed in Figure P7 Comare this result with the network we designed in Problem P3 3 Figure P7 Final Decision Boundaries for Problem P53
13 Percetron Learning Rule Exercises E Consider the classification roblem defined below: t t 3 t 3 5 t 5 t i Draw a diagram of the singleneuron ercetron you would use to solve this roblem How many inuts are required? ii Draw a grah of the data oints labeled according to their targets Is this roblem solvable with the network you defined in art (i)? Why or why not? E Consider the classification roblem defined below t t 3 t 3 t i Design a singleneuron ercetron to solve this roblem Design the network grahically by choosing weight vectors that are orthogonal to the decision boundaries» ans ii Test your solution with all four inut vectors iii Classify the following inut vectors with your solution You can either erform the calculations manually or with MATLAB iv Which of the vectors in art (iii) will always be classified the same way regardless of the solution values for W and b? Which may vary deending on the solution? Why? E3 Solve the classification roblem in Exercise E by solving inequalities (as in Problem P) and reeat arts (ii) and (iii) with the new solution (The solution is more difficult than Problem P since you canõt isolate the weights and biases in a airwise manner) 36
14 Exercises E Solve the classification roblem in Exercise E by alying the ercetron rule to the following initial arameters and reeat arts (ii) and (iii) with the new solution W( ) b( ) E5 Prove mathematically (not grahically) that the following roblem is unsolvable for a twoinut/singleneuron ercetron t t 3 t 3 t (Hint: start by rewriting the inut/target requirements as inequalities that constrain the weight and bias values) a hardlims (n) n W b E6 The symmetric hard limit function is sometimes used in ercetron networks instead of the hard limit function Target values are then taken from the set [ ] instead of [ ] i Write a simle exression that mas numbers in the ordered set [ ] into the ordered set [ ] Write the exression that erforms the inverse maing ii Consider two singleneuron ercetrons with the same weight and bias values The first network uses the hard limit function ([ ] values) and the second network uses the symmetric hard limit function If the two networks are given the same inut and udated with the ercetron learning rule will their weights continue to have the same value? iii If the changes to the weights of the two neurons are different how do they differ? Why? iv Given initial weight and bias values for a standard hard limit ercetron create a method for initializing a symmetric hard limit ercetron so that the two neurons will always resond identically when trained on identical data» ans E7 The vectors in the ordered set defined below were obtained by measuring the weight and ear lengths of toy rabbits and bears in the Fuzzy Wuzzy Animal Factory The target values indicate whether the resective inut vector was taken from a rabbit () or a bear () The first element of the inut vector is the weight of the toy and the second element is the ear length t t 3 t 3 t
15 Percetron Learning Rule 3 5 t t 6 7 t 7 8 t 8 i Use MATLAB to initialize and train a network to solve this ÒracticalÓ roblem ii Use MATLAB to test the resulting weight and bias values against the inut vectors iii Alter the inut vectors to ensure that the decision boundary of any solution will not intersect one of the original inut vectors (ie to ensure only robust solutions are found) Then retrain the network E8 Consider again the fourcategory classification roblem described in Problems P3 and P5 Suose that we change the inut vector to 3 3» ans i Is the roblem still linearly searable? Demonstrate your answer grahically ii Use MATLAB and to initialize and train a network to solve this roblem Exlain your results iii If 3 is changed to 3 5 is the roblem linearly searable? iv With the 3 from (iii) use MATLAB to initialize and train a network to solve this roblem Exlain your results E9 One variation of the ercetron learning rule is W new W old αe T b new b old αe where α is called the learning rate Prove convergence of this algorithm Does the roof require a limit on the learning rate? Exlain 38
Radial Basis Function Networks: Algorithms
Radial Basis Function Networks: Algorithms Introduction to Neural Networks : Lecture 13 John A. Bullinaria, 2004 1. The RBF Maing 2. The RBF Network Architecture 3. Comutational Power of RBF Networks 4.
More informationMultilayer Perceptron Neural Network (MLPs) For Analyzing the Properties of Jordan Oil Shale
World Alied Sciences Journal 5 (5): 546552, 2008 ISSN 18184952 IDOSI Publications, 2008 Multilayer Percetron Neural Network (MLPs) For Analyzing the Proerties of Jordan Oil Shale 1 Jamal M. Nazzal, 2
More informationMachine Learning: Homework 4
10601 Machine Learning: Homework 4 Due 5.m. Monday, February 16, 2015 Instructions Late homework olicy: Homework is worth full credit if submitted before the due date, half credit during the next 48 hours,
More informationRecent Developments in Multilayer Perceptron Neural Networks
Recent Develoments in Multilayer Percetron eural etworks Walter H. Delashmit Lockheed Martin Missiles and Fire Control Dallas, Texas 75265 walter.delashmit@lmco.com walter.delashmit@verizon.net Michael
More informationAn Improved Calibration Method for a Chopped Pyrgeometer
96 JOURNAL OF ATMOSPHERIC AND OCEANIC TECHNOLOGY VOLUME 17 An Imroved Calibration Method for a Choed Pyrgeometer FRIEDRICH FERGG OtoLab, Ingenieurbüro, Munich, Germany PETER WENDLING Deutsches Forschungszentrum
More informationCSC Neural Networks. Perceptron Learning Rule
CSC 302 1.5 Neural Networks Perceptron Learning Rule 1 Objectives Determining the weight matrix and bias for perceptron networks with many inputs. Explaining what a learning rule is. Developing the perceptron
More informationMetrics Performance Evaluation: Application to Face Recognition
Metrics Performance Evaluation: Alication to Face Recognition Naser Zaeri, Abeer AlSadeq, and Abdallah Cherri Electrical Engineering Det., Kuwait University, P.O. Box 5969, Safat 6, Kuwait {zaery, abeer,
More informationUncorrelated Multilinear Principal Component Analysis for Unsupervised Multilinear Subspace Learning
TNN2009P1186.R2 1 Uncorrelated Multilinear Princial Comonent Analysis for Unsuervised Multilinear Subsace Learning Haiing Lu, K. N. Plataniotis and A. N. Venetsanooulos The Edward S. Rogers Sr. Deartment
More information4. Score normalization technical details We now discuss the technical details of the score normalization method.
SMT SCORING SYSTEM This document describes the scoring system for the Stanford Math Tournament We begin by giving an overview of the changes to scoring and a nontechnical descrition of the scoring rules
More informationCorrespondence Between FractalWavelet. Transforms and Iterated Function Systems. With Grey Level Maps. F. Mendivil and E.R.
1 Corresondence Between FractalWavelet Transforms and Iterated Function Systems With Grey Level Mas F. Mendivil and E.R. Vrscay Deartment of Alied Mathematics Faculty of Mathematics University of Waterloo
More informationCHAPTER 5 STATISTICAL INFERENCE. 1.0 Hypothesis Testing. 2.0 Decision Errors. 3.0 How a Hypothesis is Tested. 4.0 Test for Goodness of Fit
Chater 5 Statistical Inference 69 CHAPTER 5 STATISTICAL INFERENCE.0 Hyothesis Testing.0 Decision Errors 3.0 How a Hyothesis is Tested 4.0 Test for Goodness of Fit 5.0 Inferences about Two Means It ain't
More informationRevision: Neural Network
Revision: Neural Network Exercise 1 Tell whether each of the following statements is true or false by checking the appropriate box. Statement True False a) A perceptron is guaranteed to perfectly learn
More informationGSOE9210 Engineering Decisions
GSOE9 Engineering Decisions Problem Set 5. Consider the river roblem described in lectures: f f V B A B + (a) For =, what is the sloe of the Bayes indifference line through A? (b) Draw the Bayes indifference
More information1 Properties of Spherical Harmonics
Proerties of Sherical Harmonics. Reetition In the lecture the sherical harmonics Y m were introduced as the eigenfunctions of angular momentum oerators lˆz and lˆ2 in sherical coordinates. We found that
More informationState Estimation with ARMarkov Models
Deartment of Mechanical and Aerosace Engineering Technical Reort No. 3046, October 1998. Princeton University, Princeton, NJ. State Estimation with ARMarkov Models Ryoung K. Lim 1 Columbia University,
More informationUse of Transformations and the Repeated Statement in PROC GLM in SAS Ed Stanek
Use of Transformations and the Reeated Statement in PROC GLM in SAS Ed Stanek Introduction We describe how the Reeated Statement in PROC GLM in SAS transforms the data to rovide tests of hyotheses of interest.
More informationNumerical Methods for Particle Tracing in Vector Fields
OnLine Visualization Notes Numerical Methods for Particle Tracing in Vector Fields Kenneth I. Joy Visualization and Grahics Research Laboratory Deartment of Comuter Science University of California, Davis
More informationBayesian Spatially Varying Coefficient Models in the Presence of Collinearity
Bayesian Satially Varying Coefficient Models in the Presence of Collinearity David C. Wheeler 1, Catherine A. Calder 1 he Ohio State University 1 Abstract he belief that relationshis between exlanatory
More informationHotelling s Two Sample T 2
Chater 600 Hotelling s Two Samle T Introduction This module calculates ower for the Hotelling s twogrou, Tsquared (T) test statistic. Hotelling s T is an extension of the univariate twosamle ttest
More informationProbability Estimates for Multiclass Classification by Pairwise Coupling
Probability Estimates for Multiclass Classification by Pairwise Couling TingFan Wu ChihJen Lin Deartment of Comuter Science National Taiwan University Taiei 06, Taiwan Ruby C. Weng Deartment of Statistics
More informationChapter 7 Rational and Irrational Numbers
Chater 7 Rational and Irrational Numbers In this chater we first review the real line model for numbers, as discussed in Chater 2 of seventh grade, by recalling how the integers and then the rational numbers
More informationute measures of uncertainty called standard errors for these b j estimates and the resulting forecasts if certain conditions are satis ed. Note the e
Regression with Time Series Errors David A. Dickey, North Carolina State University Abstract: The basic assumtions of regression are reviewed. Grahical and statistical methods for checking the assumtions
More informationIntroduction to MVC. least common denominator of all nonidenticalzero minors of all order of G(s). Example: The minor of order 2: 1 2 ( s 1)
Introduction to MVC DefinitionProerness and strictly roerness A system G(s) is roer if all its elements { gij ( s)} are roer, and strictly roer if all its elements are strictly roer. DefinitionCausal
More informationResearch of PMU Optimal Placement in Power Systems
Proceedings of the 5th WSEAS/IASME Int. Conf. on SYSTEMS THEORY and SCIENTIFIC COMPUTATION, Malta, Setember 1517, 2005 (3843) Research of PMU Otimal Placement in Power Systems TIANTIAN CAI, QIAN AI
More informationAnalysis of some entrance probabilities for killed birthdeath processes
Analysis of some entrance robabilities for killed birthdeath rocesses Master s Thesis O.J.G. van der Velde Suervisor: Dr. F.M. Sieksma July 5, 207 Mathematical Institute, Leiden University Contents Introduction
More informationNUMERICAL AND THEORETICAL INVESTIGATIONS ON DETONATION INERT CONFINEMENT INTERACTIONS
NUMERICAL AND THEORETICAL INVESTIGATIONS ON DETONATION INERT CONFINEMENT INTERACTIONS Tariq D. Aslam and John B. Bdzil Los Alamos National Laboratory Los Alamos, NM 87545 hone: 1556671367, fax: 1556676372
More informationLilian Markenzon 1, Nair Maria Maia de Abreu 2* and Luciana Lee 3
Pesquisa Oeracional (2013) 33(1): 123132 2013 Brazilian Oerations Research Society Printed version ISSN 01017438 / Online version ISSN 16785142 www.scielo.br/oe SOME RESULTS ABOUT THE CONNECTIVITY OF
More informationChater Matrix Norms and Singular Value Decomosition Introduction In this lecture, we introduce the notion of a norm for matrices The singular value de
Lectures on Dynamic Systems and Control Mohammed Dahleh Munther A Dahleh George Verghese Deartment of Electrical Engineering and Comuter Science Massachuasetts Institute of Technology c Chater Matrix Norms
More informationChapter 10. Classical Fourier Series
Math 344, Male ab Manual Chater : Classical Fourier Series Real and Comle Chater. Classical Fourier Series Fourier Series in PS K, Classical Fourier Series in PS K, are aroimations obtained using orthogonal
More informationAnalysis of execution time for parallel algorithm to dertmine if it is worth the effort to code and debug in parallel
Performance Analysis Introduction Analysis of execution time for arallel algorithm to dertmine if it is worth the effort to code and debug in arallel Understanding barriers to high erformance and redict
More informationDETC2003/DAC AN EFFICIENT ALGORITHM FOR CONSTRUCTING OPTIMAL DESIGN OF COMPUTER EXPERIMENTS
Proceedings of DETC 03 ASME 003 Design Engineering Technical Conferences and Comuters and Information in Engineering Conference Chicago, Illinois USA, Setember 6, 003 DETC003/DAC48760 AN EFFICIENT ALGORITHM
More informationFuzzy Automata Induction using Construction Method
Journal of Mathematics and Statistics 2 (2): 3954, 26 ISSN 15493644 26 Science Publications Fuzzy Automata Induction using Construction Method 1,2 Mo Zhi Wen and 2 Wan Min 1 Center of Intelligent Control
More informationFor q 0; 1; : : : ; `? 1, we have m 0; 1; : : : ; q? 1. The set fh j(x) : j 0; 1; ; : : : ; `? 1g forms a basis for the tness functions dened on the i
Comuting with Haar Functions Sami Khuri Deartment of Mathematics and Comuter Science San Jose State University One Washington Square San Jose, CA 95190103, USA khuri@juiter.sjsu.edu Fax: (40)94500 Keywords:
More informationThe Noise Power Ratio  Theory and ADC Testing
The Noise Power Ratio  Theory and ADC Testing FH Irons, KJ Riley, and DM Hummels Abstract This aer develos theory behind the noise ower ratio (NPR) testing of ADCs. A midriser formulation is used for
More informationNotes on Instrumental Variables Methods
Notes on Instrumental Variables Methods Michele Pellizzari IGIERBocconi, IZA and frdb 1 The Instrumental Variable Estimator Instrumental variable estimation is the classical solution to the roblem of
More informationAlgebraic Parameter Estimation of Damped Exponentials
Algebraic Parameter Estimation of Damed Exonentials Aline Neves, Maria Miranda, Mamadou Mbou To cite this version: Aline Neves, Maria Miranda, Mamadou Mbou Algebraic Parameter Estimation of Damed Exonentials
More informationSection 0.10: Complex Numbers from Precalculus Prerequisites a.k.a. Chapter 0 by Carl Stitz, PhD, and Jeff Zeager, PhD, is available under a Creative
Section 0.0: Comlex Numbers from Precalculus Prerequisites a.k.a. Chater 0 by Carl Stitz, PhD, and Jeff Zeager, PhD, is available under a Creative Commons AttributionNonCommercialShareAlike.0 license.
More informationOn WaldType Optimal Stopping for Brownian Motion
J Al Probab Vol 34, No 1, 1997, (6673) Prerint Ser No 1, 1994, Math Inst Aarhus On WaldTye Otimal Stoing for Brownian Motion S RAVRSN and PSKIR The solution is resented to all otimal stoing roblems of
More informationEffects of Mud Properties, Hole size, Drill String Tripping Speed and Configurations on Swab and Surge Pressure Magnitude during Drilling Operations
International Journal of Petroleum Science and Technology ISSN 0973638 Volume 6, Number (01),. 14315 Research India Publications htt://www.riublication.com/ijst.htm Effects of Mud Proerties, Hole size,
More informationME 375 System Modeling and Analysis. Homework 11 Solution. Out: 18 November 2011 Due: 30 November 2011 = + +
Out: 8 November Due: 3 November Problem : You are given the following system: Gs () =. s + s+ a) Using Lalace and Inverse Lalace, calculate the unit ste resonse of this system (assume zero initial conditions).
More informationFurther differentiation and integration
7 Toic Further differentiation and integration Contents. evision exercise................................... 8. Introduction...................................... 9. Differentiation of sin x and cos x..........................
More information16.2. Infinite Series. Introduction. Prerequisites. Learning Outcomes
Infinite Series 6.2 Introduction We extend the concet of a finite series, met in Section 6., to the situation in which the number of terms increase without bound. We define what is meant by an infinite
More informationKnuthMorrisPratt Algorithm
KnuthMorrisPratt Algorithm The roblem of tring Matching Given a string, the roblem of string matching deals with finding whether a attern occurs in and if does occur then returning osition in where occurs.
More informationCHAPTERII Control Charts for Fraction Nonconforming using mofm Runs Rules
CHAPTERII Control Charts for Fraction Nonconforming using mofm Runs Rules. Introduction: The is widely used in industry to monitor the number of fraction nonconforming units. A nonconforming unit is
More informationThe vast amount of sequence data collected over the past two
Local grah alignment and motif search in biological networks Johannes Berg and Michael Lässig Institut für Theoretische Physik, Universität zu Köln, Zülicherstrasse 77, 50937 Cologne, Germany Edited by
More informationA Parallel Algorithm for Minimization of Finite Automata
A Parallel Algorithm for Minimization of Finite Automata B. Ravikumar X. Xiong Deartment of Comuter Science University of Rhode Island Kingston, RI 02881 Email: fravi,xiongg@cs.uri.edu Abstract In this
More informationTests for Two Proportions in a Stratified Design (Cochran/MantelHaenszel Test)
Chater 225 Tests for Two Proortions in a Stratified Design (Cochran/MantelHaenszel Test) Introduction In a stratified design, the subects are selected from two or more strata which are formed from imortant
More informationInfinite Number of Twin Primes
dvances in Pure Mathematics, 06, 6, 9597 htt://wwwscirorg/journal/am ISSN Online: 6008 ISSN Print: 60068 Infinite Number of Twin Primes S N Baibeov, Durmagambetov LN Gumilyov Eurasian National University,
More informationPositive decomposition of transfer functions with multiple poles
Positive decomosition of transfer functions with multile oles Béla Nagy 1, Máté Matolcsi 2, and Márta Szilvási 1 Deartment of Analysis, Technical University of Budaest (BME), H1111, Budaest, Egry J. u.
More information8.7 Associated and Nonassociated Flow Rules
8.7 Associated and Nonassociated Flow Rules Recall the LevyMises flow rule, Eqn. 8.4., d ds (8.7.) The lastic multilier can be determined from the hardening rule. Given the hardening rule one can more
More informationMath 4400/6400 Homework #8 solutions. 1. Let P be an odd integer (not necessarily prime). Show that modulo 2,
MATH 4400 roblems. Math 4400/6400 Homework # solutions 1. Let P be an odd integer not necessarily rime. Show that modulo, { P 1 0 if P 1, 7 mod, 1 if P 3, mod. Proof. Suose that P 1 mod. Then we can write
More informationA NetworkFlow Based Cell Sizing Algorithm
A NetworFlow Based Cell Sizing Algorithm Huan Ren and Shantanu Dutt Det. of ECE, University of IllinoisChicago Abstract We roose a networ flow based algorithm for the areaconstrained timingdriven discrete
More informationAnalysis of MultiHop Emergency Message Propagation in Vehicular Ad Hoc Networks
Analysis of MultiHo Emergency Message Proagation in Vehicular Ad Hoc Networks ABSTRACT Vehicular Ad Hoc Networks (VANETs) are attracting the attention of researchers, industry, and governments for their
More informationFE FORMULATIONS FOR PLASTICITY
G These slides are designed based on the book: Finite Elements in Plasticity Theory and Practice, D.R.J. Owen and E. Hinton, 1970, Pineridge Press Ltd., Swansea, UK. 1 Course Content: A INTRODUCTION AND
More informationBayesian Networks Practice
Bayesian Networks Practice Part 2 20160317 ByoungHee Kim, SeongHo Son Biointelligence Lab, CSE, Seoul National University Agenda Probabilistic Inference in Bayesian networks Probability basics Dsearation
More information0.6 Factoring 73. As always, the reader is encouraged to multiply out (3
0.6 Factoring 7 5. The G.C.F. of the terms in 81 16t is just 1 so there is nothing of substance to factor out from both terms. With just a difference of two terms, we are limited to fitting this olynomial
More informationABSTRACT MODEL REPAIR
Logical Methods in Comuter Science Vol. 11(3:11)2015,. 1 43 www.lmcsonline.org Submitted Jul. 2, 2014 Published Se. 17, 2015 ABSTRACT MODEL REPAIR GEORGE CHATZIELEFTHERIOU a, BORZOO BONAKDARPOUR b, PANAGIOTIS
More informationMeasuring center and spread for density curves. Calculating probabilities using the standard Normal Table (CIS Chapter 8, p 105 mainly p114)
Objectives 1.3 Density curves and Normal distributions Density curves Measuring center and sread for density curves Normal distributions The 689599.7 (Emirical) rule Standardizing observations Calculating
More informationDistribution of winners in truel games
Distribution of winners in truel games R. Toral and P. Amengual Instituto Mediterráneo de Estudios Avanzados (IMEDEA) CSICUIB Ed. Mateu Orfila, Camus UIB E7122 Palma de Mallorca SPAIN Abstract. In this
More information16.2. Infinite Series. Introduction. Prerequisites. Learning Outcomes
Infinite Series 6. Introduction We extend the concet of a finite series, met in section, to the situation in which the number of terms increase without bound. We define what is meant by an infinite series
More informationWave Drift Force in a TwoLayer Fluid of Finite Depth
Wave Drift Force in a TwoLayer Fluid of Finite Deth Masashi Kashiwagi Research Institute for Alied Mechanics, Kyushu University, Jaan Abstract Based on the momentum and energy conservation rinciles, a
More informationVarious Proofs for the Decrease Monotonicity of the Schatten s Power Norm, Various Families of R n Norms and Some Open Problems
Int. J. Oen Problems Comt. Math., Vol. 3, No. 2, June 2010 ISSN 19986262; Coyright c ICSRS Publication, 2010 www.icsrs.org Various Proofs for the Decrease Monotonicity of the Schatten s Power Norm, Various
More informationESTIMATION OF THE OUTPUT DEVIATION NORM FOR UNCERTAIN, DISCRETETIME NONLINEAR SYSTEMS IN A STATE DEPENDENT FORM
Int. J. Al. Math. Comut. Sci. 2007 Vol. 17 No. 4 505 513 DOI: 10.2478/v100060070042z ESTIMATION OF THE OUTPUT DEVIATION NORM FOR UNCERTAIN DISCRETETIME NONLINEAR SYSTEMS IN A STATE DEPENDENT FORM PRZEMYSŁAW
More informationPhase velocity and group velocity (c) Zhengqing Yun,
Phase velocity and grou velocity (c) Zhengqing Yun, 20112012 Objective: Observe the difference between hase and grou velocity; understand that the grou velocity can be less than, equal to, and greater
More informationA M,ETHOD OF MEASURING THE RESISTIVITY AND HALL' COEFFICIENT ON LAMELLAE OF ARBITRARY SHAPE
'. ' 220 HILlS TECHNICAL REVIEW VOLUME 20 A M,ETHOD OF MEASURING THE RESISTIVITY AND HALL' COEFFICIENT ON LAMELLAE OF ARBITRARY SHAE 621.317.331:538.632.083 Resistivity and Hallcoefficient measurements
More informationActual exergy intake to perform the same task
CHAPER : PRINCIPLES OF ENERGY CONSERVAION INRODUCION Energy conservation rinciles are based on thermodynamics If we look into the simle and most direct statement of the first law of thermodynamics, we
More informationCybernetic Interpretation of the Riemann Zeta Function
Cybernetic Interretation of the Riemann Zeta Function Petr Klán, Det. of System Analysis, University of Economics in Prague, Czech Reublic, etr.klan@vse.cz arxiv:602.05507v [cs.sy] 2 Feb 206 Abstract:
More informationNodevoltage method using virtual current sources technique for special cases
Nodeoltage method using irtual current sources technique for secial cases George E. Chatzarakis and Marina D. Tortoreli Electrical and Electronics Engineering Deartments, School of Pedagogical and Technological
More informationChemical Kinetics and Equilibrium  An Overview  Key
Chemical Kinetics and Equilibrium  An Overview  Key The following questions are designed to give you an overview of the toics of chemical kinetics and chemical equilibrium. Although not comrehensive,
More informationImplementation and Validation of Finite Volume C++ Codes for Plane Stress Analysis
CST0 191 October, 011, Krabi Imlementation and Validation of Finite Volume C++ Codes for Plane Stress Analysis Chakrit Suvanjumrat and Ekachai Chaichanasiri* Deartment of Mechanical Engineering, Faculty
More informationOutline. EECS150  Digital Design Lecture 26 Error Correction Codes, Linear Feedback Shift Registers (LFSRs) Simple Error Detection Coding
Outline EECS150  Digital Design Lecture 26 Error Correction Codes, Linear Feedback Shift Registers (LFSRs) Error detection using arity Hamming code for error detection/correction Linear Feedback Shift
More informationABSTRACT MODEL REPAIR
ABSTRACT MODEL REPAIR GEORGE CHATZIELEFTHERIOU a, BORZOO BONAKDARPOUR b, PANAGIOTIS KATSAROS c, AND SCOTT A. SMOLKA d a Deartment of Informatics, Aristotle University of Thessaloniki, 54124 Thessaloniki,
More informationOil Temperature Control System PID Controller Algorithm Analysis Research on Sliding Gear Reducer
Key Engineering Materials Online: 20140811 SSN: 16629795, Vol. 621, 357364 doi:10.4028/www.scientific.net/kem.621.357 2014 rans ech Publications, Switzerland Oil emerature Control System PD Controller
More informationAn Ant Colony Optimization Approach to the Probabilistic Traveling Salesman Problem
An Ant Colony Otimization Aroach to the Probabilistic Traveling Salesman Problem Leonora Bianchi 1, Luca Maria Gambardella 1, and Marco Dorigo 2 1 IDSIA, Strada Cantonale Galleria 2, CH6928 Manno, Switzerland
More informationA ClosedForm Solution to the Minimum V 2
Celestial Mechanics and Dynamical Astronomy manuscrit No. (will be inserted by the editor) Martín Avendaño Daniele Mortari A ClosedForm Solution to the Minimum V tot Lambert s Problem Received: Month
More informationExercise 2: Equivalence of the first two definitions for a differentiable function. is a convex combination of
March 07 Mathematical Foundations John Riley Module Marginal analysis and single variable calculus 6 Eercises Eercise : Alternative definitions of a concave function (a) For and that 0, and conve combination
More informationarxiv: v4 [math.st] 3 Jun 2016
Electronic Journal of Statistics ISSN: 19357524 arxiv: math.pr/0000000 Bayesian Estimation Under Informative Samling Terrance D. Savitsky and Daniell Toth 2 Massachusetts Ave. N.E, Washington, D.C. 20212
More informationChapter 10. Supplemental Text Material
Chater 1. Sulemental Tet Material S11. The Covariance Matri of the Regression Coefficients In Section 13 of the tetbook, we show that the least squares estimator of β in the linear regression model y=
More informationMATHEMATICAL MODELLING OF THE WIRELESS COMMUNICATION NETWORK
Comuter Modelling and ew Technologies, 5, Vol.9, o., 339 Transort and Telecommunication Institute, Lomonosov, LV9, Riga, Latvia MATHEMATICAL MODELLIG OF THE WIRELESS COMMUICATIO ETWORK M. KOPEETSK Deartment
More informationAR PROCESSES AND SOURCES CAN BE RECONSTRUCTED FROM. Radu Balan, Alexander Jourjine, Justinian Rosca. Siemens Corporation Research
AR PROCESSES AND SOURCES CAN BE RECONSTRUCTED FROM DEGENERATE MIXTURES Radu Balan, Alexander Jourjine, Justinian Rosca Siemens Cororation Research 7 College Road East Princeton, NJ 8 fradu,jourjine,roscag@scr.siemens.com
More informationqary Symmetric Channel for Large q
ListMessage Passing Achieves Caacity on the qary Symmetric Channel for Large q Fan Zhang and Henry D Pfister Deartment of Electrical and Comuter Engineering, Texas A&M University {fanzhang,hfister}@tamuedu
More informationALTERNATIVE SOLUTION TO THE QUARTIC EQUATION by Farid A. Chouery 1, P.E. 2006, All rights reserved
ALTERNATIVE SOLUTION TO THE QUARTIC EQUATION b Farid A. Chouer, P.E. 006, All rights reserved Abstract A new method to obtain a closed form solution of the fourth order olnomial equation is roosed in this
More informationChapter 13 Variable Selection and Model Building
Chater 3 Variable Selection and Model Building The comlete regsion analysis deends on the exlanatory variables ent in the model. It is understood in the regsion analysis that only correct and imortant
More informationMeasuring center and spread for density curves. Calculating probabilities using the standard Normal Table (CIS Chapter 8, p 105 mainly p114)
Objectives Density curves Measuring center and sread for density curves Normal distributions The 689599.7 (Emirical) rule Standardizing observations Calculating robabilities using the standard Normal
More informationTHE FIRST LAW OF THERMODYNAMICS
THE FIRST LA OF THERMODYNAMIS 9 9 (a) IDENTIFY and SET UP: The ressure is constant and the volume increases (b) = d Figure 9 Since is constant, = d = ( ) The diagram is sketched in Figure 9 The roblem
More informationMultiOperation MultiMachine Scheduling
MultiOeration MultiMachine Scheduling Weizhen Mao he College of William and Mary, Williamsburg VA 3185, USA Abstract. In the multioeration scheduling that arises in industrial engineering, each job
More information1 More General von Neumann Measurements [10 Points]
Ph5c Sring 07 Prof. Sean Carroll seancarroll@gmail.com Homework  3 Solutions Assigned TA: Thom Bohdanowicz thom@caltech.edu Due: 5:00m, 5/03/07 More General von Neumann Measurements [0 Points] Recall
More informationEvaluating Circuit Reliability Under Probabilistic GateLevel Fault Models
Evaluating Circuit Reliability Under Probabilistic GateLevel Fault Models Ketan N. Patel, Igor L. Markov and John P. Hayes University of Michigan, Ann Arbor 481092122 {knatel,imarkov,jhayes}@eecs.umich.edu
More information7.2 Inference for comparing means of two populations where the samples are independent
Objectives 7.2 Inference for comaring means of two oulations where the samles are indeendent Twosamle t significance test (we give three examles) Twosamle t confidence interval htt://onlinestatbook.com/2/tests_of_means/difference_means.ht
More informationAdaptive Protection Algorithm for Overcurrent Relay in Distribution System with DG
J Electr Eng Technol Vol. 8, No. 5: 10021011, 2013 htt://dx.doi.org/10.5370/jeet.2013.8.5.1002 SSN(Print) 19750102 SSN(Online) 20937423 Adative Protection Algorithm for Overcurrent Relay in Distribution
More informationTopic 30 Notes Jeremy Orloff
Toic 30 Notes Jeremy Orloff 30 Alications to oulation biology 30.1 Modeling examles 30.1.1 Volterra redatorrey model The Volterra redatorrey system models the oulations of two secies with a redatorrey
More informationA compression line for soils with evolving particle and pore size distributions due to particle crushing
Russell, A. R. (2011) Géotechnique Letters 1, 5 9, htt://dx.doi.org/10.1680/geolett.10.00003 A comression line for soils with evolving article and ore size distributions due to article crushing A. R. RUSSELL*
More informationThe Binomial Approach for Probability of Detection
Vol. No. (Mar 5)  The ejournal of Nondestructive Testing  ISSN 45494 www.ndt.net/?id=7498 The Binomial Aroach for of Detection Carlos Correia Gruo Endalloy C.A.  Caracas  Venezuela www.endalloy.net
More informationHomework Solution 4 for APPM4/5560 Markov Processes
Homework Solution 4 for APPM4/556 Markov Processes 9.Reflecting random walk on the line. Consider the oints,,, 4 to be marked on a straight line. Let X n be a Markov chain that moves to the right with
More informationHiggs Modeling using EXPER and Weak Fusion. by Woody Stanford (c) 2016 Stanford Systems.
iggs Modeling using EXPER and Weak Fusion by Woody Stanford (c) 2016 Stanford Systems. Introduction The EXPER roject, even though its original findings were inconclusive has lead to various ideas as to
More informationBy Evan Chen OTIS, Internal Use
Solutions Notes for DNYNTCONSTRUCT Evan Chen January 17, 018 1 Solution Notes to TSTST 015/5 Let ϕ(n) denote the number of ositive integers less than n that are relatively rime to n. Prove that there
More informationA construction of bent functions from plateaued functions
A construction of bent functions from lateaued functions Ayça Çeşmelioğlu, Wilfried Meidl Sabancı University, MDBF, Orhanlı, 34956 Tuzla, İstanbul, Turkey. Abstract In this resentation, a technique for
More informationCompletely Randomized Design
CHAPTER 4 Comletely Randomized Design 4.1 Descrition of the Design Chaters 1 to 3 introduced some basic concets and statistical tools that are used in exerimental design. In this and the following chaters,
More informationProvided by the author(s) and University College Dublin Library in accordance with ublisher olicies. Please cite the ublished version when available. Title Low Comlexity Stochastic OtimizationBased Model
More informationDialectical Theory for MultiAgent Assumptionbased Planning
Dialectical Theory for MultiAgent Assumtionbased Planning Damien Pellier, Humbert Fiorino Laboratoire Leibniz, 46 avenue Félix Viallet F38000 Grenboble, France {Damien.Pellier,Humbert.Fiorino}.imag.fr
More information