HMM-Based Semantic Learning for a Mobile Robot

Size: px
Start display at page:

Download "HMM-Based Semantic Learning for a Mobile Robot"

Transcription

1 HMM-Based Sematic Learig for a Mobile Robot Kevi Squire Laguage Acquisitio ad Robotics Group Uiversity of Illiois at Urbaa-Champaig Adviser: Stephe E. Leviso

2 Laguage Learig Kevi Squire Licol Laboratory Iterview, 6 Jue 2005 p.1

3 Laguage Learig... by Robot! Kevi Squire Licol Laboratory Iterview, 6 Jue 2005 p.2

4 Philosophy of Laguage Acquisitio Fudametal Ideas: The Laguage Egie is primarily sematic, ot sytactic. There is o such thig as a disembodied mid. Laguage ad meaig is acquired through iteractio with the real world. Sesory-motor fuctio is essetial for huma-like cogitio. Metal processes are largely based o associative memory ad learig. Kevi Squire Licol Laboratory Iterview, 6 Jue 2005 p.3

5 Ph.D. Backgroud ad Research 1. Ifrastructure Developmet Hardware Software 2. Research Sematic Learig HMM Cascade Model Kevi Squire Licol Laboratory Iterview, 6 Jue 2005 p.4

6 Ph.D. Backgroud ad Research 1. Ifrastructure Developmet Hardware Software 2. Research Sematic Learig HMM Cascade Model Kevi Squire Licol Laboratory Iterview, 6 Jue 2005 p.4

7 Robot Hardware Kevi Squire Licol Laboratory Iterview, 6 Jue 2005 p.5

8 Robot Hardware Modificatios: Added cameras microphoes o-board computer wireless trasmitter Miscellaeous structural chages Replaced power supply, rewired to supply power to all compoets Istalled Liux Kevi Squire Licol Laboratory Iterview, 6 Jue 2005 p.6

9 Robot Hardware Modificatios: Added cameras microphoes o-board computer wireless trasmitter Miscellaeous structural chages Replaced power supply, rewired to supply power to all compoets Istalled Liux Kevi Squire Licol Laboratory Iterview, 6 Jue 2005 p.6

10 Robot Hardware Modificatios: Added cameras microphoes o-board computer wireless trasmitter Miscellaeous structural chages Replaced power supply, rewired to supply power to all compoets Istalled Liux Kevi Squire Licol Laboratory Iterview, 6 Jue 2005 p.6

11 Distributed Commuicatios Kevi Squire Licol Laboratory Iterview, 6 Jue 2005 p.7

12 Distributed Computig Framework Illy (robot) full (old) fillig Audio Rig Buffer full Soud Source Locatio (Sik) full etwork Audio Source (Remote) Hal (workstatio) Audio Source (Soud Card) Audio Server (Sik) fillig etwork Audio Server (Sik) full Audio Rig Buffer full full (old) Speech Recogitio (Sik) Kevi Squire Licol Laboratory Iterview, 6 Jue 2005 p.8

13 Distributed Computig Framework Allowed the itegratio of: Soud source localizatio (D. Li) Visio based avigatio & learig (W. Zhu) Speech recogitio (Q. Liu/R.S. Li) Simple workig memory (K. Squire) Next steps: Cetralized cotroller (M. McClai) Sematic learig (K. Squire) Kevi Squire Licol Laboratory Iterview, 6 Jue 2005 p.9

14 Ph.D. Backgroud ad Research 1. Ifrastructure Developmet Hardware Software 2. Research Sematic Learig HMM Cascade Model Kevi Squire Licol Laboratory Iterview, 6 Jue 2005 p.10

15 Ph.D. Backgroud ad Research 1. Ifrastructure Developmet Hardware Software 2. Research Sematic Learig HMM Cascade Model Kevi Squire Licol Laboratory Iterview, 6 Jue 2005 p.10

16 Cogitive Framework Outside World Sesory System Proprioceptive Feedback Motor System Noetic System Somatic System Kevi Squire Licol Laboratory Iterview, 6 Jue 2005 p.11

17 Associative Learig ad Memory Outside World Sesory System Proprioceptive Feedback Motor System Noetic System Somatic System Associative Memory Workig Memory Noetic System Kevi Squire Licol Laboratory Iterview, 6 Jue 2005 p.12

18 Associative Learig ad Memory Associative Memory Workig Memory Noetic System Associative Memory Procedural Memory Sematic Memory Episodic Memory Kevi Squire Licol Laboratory Iterview, 6 Jue 2005 p.13

19 Sematic Memory Associative (Log term) Memory Procedural Memory Sematic Memory Episodic Memory to Workig Memory Sematic Memory Cocept Model Visual Model Auditory Model Sesory Iputs Kevi Squire Licol Laboratory Iterview, 6 Jue 2005 p.14

20 Cocepts Cocept of Apple Other kowledge: facts, stories, experieces, etc. "Apple" * cruch * Cocept: abstract symbol associated with symbolic represetatios i the various seses Kevi Squire Licol Laboratory Iterview, 6 Jue 2005 p.15

21 Sematic Memory to Workig Memory Sematic Memory Cocept Model Visual Model Auditory Model Sesory Iputs Kevi Squire Licol Laboratory Iterview, 6 Jue 2005 p.16

22 Cascade of HMMs to Workig Memory ^ x co Sematic Memory Cocept Model ϕ^ co ϕ^ Visual Model Auditory Model = ϕ^ vis ^ x vis co ^ vis ^aud y ={x, x } ϕ^ aud x^ aud Sesory Iputs y vis y aud Kevi Squire Licol Laboratory Iterview, 6 Jue 2005 p.17

23 Hidde Markov Models (HMMs) S1 S2 S3 0.2 Kevi Squire Licol Laboratory Iterview, 6 Jue 2005 p.18

24 Hidde Markov Models (HMMs) S1 S2 S Kevi Squire Licol Laboratory Iterview, 6 Jue 2005 p.18

25 Hidde Markov Models (HMMs) 0.1 S S S3 0.6 Kevi Squire Licol Laboratory Iterview, 6 Jue 2005 p.18

26 Hidde Markov Models (HMMs) 0.1 S S S3 0.6 Kevi Squire Licol Laboratory Iterview, 6 Jue 2005 p.18

27 Maximum-Likelihood Estimatio (1) Traditioal methods (Baum-Welch reestimatio): Let p (y 1,..., y ; ϕ) be the likelihood of observatios (y 1,..., y ) give HMM ϕ. Maximize p (y 1,..., y ; ϕ) by solvig ϕ p (y 1,..., y ; ϕ) = 0. Implemeted as a Expectatio-Maximizatio (EM) procedure. Requires all of (y 1,..., y ) be available. Kevi Squire Licol Laboratory Iterview, 6 Jue 2005 p.19

28 Maximum-Likelihood Estimatio (2) Recursive (stochastic gradiet) procedure (LeGlad ad Mevel): Rewrite p (y 1,..., y ; ϕ) as a sum log p (y 1,..., y ; ϕ) = log b(y k ; ϕ) u k (ϕ) k=1 where b i (y k ; ϕ) = p(y k x k = i) u ki (ϕ) = Pr(x k = i y 1,..., y k 1 ). Update parameters ϕ at time + 1 with ϕ = ϕ + ε ( ϕ log b(y +1 ; ϕ) u +1 (ϕ) ) Kevi Squire Licol Laboratory Iterview, 6 Jue 2005 p.20

29 Cascade of HMMs ^ x co ϕ^ co ϕ^ ϕ^ vis ^ x vis co ^ vis ^aud y ={x, x } ϕ^ aud x^ aud y vis y aud Kevi Squire Licol Laboratory Iterview, 6 Jue 2005 p.21

30 Sematic Learig Simulatio Cocept Model Cocept Model Visual Model Auditory Model Visual Model Auditory Model "Apple" Kevi Squire Licol Laboratory Iterview, 6 Jue 2005 p.22

31 Sematic Learig Simulatio "Apple" Kevi Squire Licol Laboratory Iterview, 6 Jue 2005 p.22

32 Simulatio Model Topology ϕ _ boy ϕ c c ϕ^ robot ϕ^_ y = x c,1 ^ v c,2 y x ^v ^ c ^v y ={x, x ^ a } x ^a v ϕ a λ ϕ^v ϕ^a v y = y vis y a y vis y aud a = y y vis ϕ vis Kevi Squire Licol Laboratory Iterview, 6 Jue 2005 p.23

33 Simulatio Results Maximum Likelihood Classificatio Viterbi Classificatio ˆϕ a 90.1%(3.7%) 89.9%(4.2%) ˆϕ v 97.9%(1.6%) 99.1%(2.4%) ˆϕ c 98.4%(1.1%) 98.8%(1.1%) Average classificatio accuracy for the leared models over 50 rus. The umber i parethesis is the stadard deviatio. Kevi Squire Licol Laboratory Iterview, 6 Jue 2005 p.24

34 Robot Implemetatio The robot should: Recogize visual iputs Recogize auditory iputs Lear cocepts Kevi Squire Licol Laboratory Iterview, 6 Jue 2005 p.25

35 Cascade of HMMs as a Associative Memory Cascade Model: ^ x co ϕ^ co ϕ^ ϕ^ vis ^ x vis co ^ vis ^aud y ={x, x } ϕ^ aud x^ aud y vis y aud Kevi Squire Licol Laboratory Iterview, 6 Jue 2005 p.26

36 Cascade of HMMs as a Associative Memory Auditory-oly Classificatio: ^ x co ϕ^ co ϕ^ ϕ^ vis x^ vis co ^ aud y = x ϕ^ aud ^ x aud y vis y aud Kevi Squire Licol Laboratory Iterview, 6 Jue 2005 p.26

37 Cascade of HMMs as a Associative Memory Visual-oly Classificatio: ^ x co ϕ^ co ϕ^ ϕ^ vis ^ x vis co ^ vis y = x ϕ^ aud x^ aud y vis y aud Kevi Squire Licol Laboratory Iterview, 6 Jue 2005 p.26

38 Cascade of HMMs as a Associative Memory Audio-Visual Learig: ^ x co ϕ^ co ϕ^ ϕ^ vis ^ x vis co ^ vis ^aud y ={x, x } ϕ^ aud x^ aud y vis y aud Kevi Squire Licol Laboratory Iterview, 6 Jue 2005 p.26

39 Robot Demostratio Visual Objects: Words: cat dog red ball gree ball ball aimal Cocepts: cat dog red ball gree ball ball aimal Kevi Squire Licol Laboratory Iterview, 6 Jue 2005 p.27

40 Robotic Cotroller speech: "illy"/ tur toward soud / explore 1 Explore visible object object far/ approach object lear object ukow speech/ beep 6 Iteract hear kow object/ search for object silece (timeout) timeout expired/ beep / ru ito object lost object 2 Foud Object object ear 3 Lear Name speech/ repeat & lear foud desired object/ say ame 7 Search 5 Play 2 silece (timeout) foud othig or wrog object/ explore / pick up object 4 Play 1 Kevi Squire Licol Laboratory Iterview, 6 Jue 2005 p.28

41 Video Kevi Squire Licol Laboratory Iterview, 6 Jue 2005 p.29

42 Coclusio 1. Built a platform upo which to coduct laguage acquisitio research. 2. Proposed a geeral model of sematic cocept learig. 3. Successfully implemeted this model i a real robot usig a cascade of HMMs. Kevi Squire Licol Laboratory Iterview, 6 Jue 2005 p.30

43 Future Directios/Iterests 1. Grow/shrik models (combie/split states) as appropriate (e.g., use miimum descriptio legth (MDL) or related measures). 2. Apply associative learig to spatial/actio iformatio, other modalities. 3. Study setece comprehesio (e.g., combie sytactic ad sematic iformatio). 4. Icorporate reiforcemet ito curret usupervised traiig scheme. Kevi Squire Licol Laboratory Iterview, 6 Jue 2005 p.31

44 Questios? Kevi Squire Licol Laboratory Iterview, 6 Jue 2005 p.32

45 Robot Visual HMM Iitializatio: Kmeas o labeled data Olie Learig with RMLE ϕ^ obj S1 S2 ^ obj x S3 Features: Color histogram Momet Height/width ratio ~ obj y Fixed umber of classes y obj Kevi Squire Licol Laboratory Iterview, 6 Jue 2005 p.33

46 Robot Auditory Model 3 State HMM States: Silece, Voiced, Uvoiced Features: 3 log-area ratios + log-eergy + voicig Olie update with RMLE possible ^ word x ϕ^ word S1 S2 S3 ~ word y Word Recogizer Features: histogram of audio states + word legth Ca distiguish some words Iitial traiig offlie with RMLE ϕ^ aud aud {y } ^aud {x } Kevi Squire Licol Laboratory Iterview, 6 Jue 2005 p.34

47 Robot Cocept HMM 6 State Discrete HMM Observatios: states of Visual ad Auditory models S1 S2 S3 Iitialized offlie Olie update with RMLE Kevi Squire Licol Laboratory Iterview, 6 Jue 2005 p.35

48 RMLE Covergece (1) Coditios for RMLE Covergece: The trasitio probability matrix A(ϕ ) is aperiodic ad irreducible. The mappig ϕ A(ϕ) is twice differetiable with bouded first ad secod derivatives ad Lipschitz cotiuous secod derivative. The mappig ϕ b(y k ; ϕ) is three times differetiable, ad the fuctio b(y k ; θ) is cotiuous o R for every θ Θ. Alterately, for y k draw from a fiite alphabet, the mappig ϕ b(y k ; ϕ) is twice differetiable with bouded first ad secod derivatives ad Lipschitz cotiuous secod derivative. Kevi Squire Licol Laboratory Iterview, 6 Jue 2005 p.36

49 RMLE Covergece (2) Coditios for RMLE Covergece: Uder P ϕ, the exteded Markov chai {X, Y, u (ϕ), w (ϕ)} is geometrically ergodic (see LeGlad ad Mevel, 96). Because of this geometric ergodicity, the iitial values of u 0 (ϕ) ad w 0 (ϕ) are forgotte expoetially fast. Kevi Squire Licol Laboratory Iterview, 6 Jue 2005 p.37

50 MPEG Video Kevi Squire Licol Laboratory Iterview, 6 Jue 2005 p.38

Expectation-Maximization Algorithm.

Expectation-Maximization Algorithm. Expectatio-Maximizatio Algorithm. Petr Pošík Czech Techical Uiversity i Prague Faculty of Electrical Egieerig Dept. of Cyberetics MLE 2 Likelihood.........................................................................................................

More information

The Expectation-Maximization (EM) Algorithm

The Expectation-Maximization (EM) Algorithm The Expectatio-Maximizatio (EM) Algorithm Readig Assigmets T. Mitchell, Machie Learig, McGraw-Hill, 997 (sectio 6.2, hard copy). S. Gog et al. Dyamic Visio: From Images to Face Recogitio, Imperial College

More information

6.3 Testing Series With Positive Terms

6.3 Testing Series With Positive Terms 6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial

More information

Chapter 12 EM algorithms The Expectation-Maximization (EM) algorithm is a maximum likelihood method for models that have hidden variables eg. Gaussian

Chapter 12 EM algorithms The Expectation-Maximization (EM) algorithm is a maximum likelihood method for models that have hidden variables eg. Gaussian Chapter 2 EM algorithms The Expectatio-Maximizatio (EM) algorithm is a maximum likelihood method for models that have hidde variables eg. Gaussia Mixture Models (GMMs), Liear Dyamic Systems (LDSs) ad Hidde

More information

Statistical Pattern Recognition

Statistical Pattern Recognition Statistical Patter Recogitio Classificatio: No-Parametric Modelig Hamid R. Rabiee Jafar Muhammadi Sprig 2014 http://ce.sharif.edu/courses/92-93/2/ce725-2/ Ageda Parametric Modelig No-Parametric Modelig

More information

Vector Quantization: a Limiting Case of EM

Vector Quantization: a Limiting Case of EM . Itroductio & defiitios Assume that you are give a data set X = { x j }, j { 2,,, }, of d -dimesioal vectors. The vector quatizatio (VQ) problem requires that we fid a set of prototype vectors Z = { z

More information

EE / EEE SAMPLE STUDY MATERIAL. GATE, IES & PSUs Signal System. Electrical Engineering. Postal Correspondence Course

EE / EEE SAMPLE STUDY MATERIAL. GATE, IES & PSUs Signal System. Electrical Engineering. Postal Correspondence Course Sigal-EE Postal Correspodece Course 1 SAMPLE STUDY MATERIAL Electrical Egieerig EE / EEE Postal Correspodece Course GATE, IES & PSUs Sigal System Sigal-EE Postal Correspodece Course CONTENTS 1. SIGNAL

More information

System Diagnostics using Kalman Filter Estimation Error

System Diagnostics using Kalman Filter Estimation Error System Diagostics usig Kalma Filter Estimatio Error Prof. Seugchul Lee, Seugtae Park, Heechag Kim, Hyusuk Huh ICMR2015 (11/25/2015) Machie Health Diagostics Desig Desig DNA + + Blue Prit phagocytes lymphocytes

More information

Week 1, Lecture 2. Neural Network Basics. Announcements: HW 1 Due on 10/8 Data sets for HW 1 are online Project selection 10/11. Suggested reading :

Week 1, Lecture 2. Neural Network Basics. Announcements: HW 1 Due on 10/8 Data sets for HW 1 are online Project selection 10/11. Suggested reading : ME 537: Learig-Based Cotrol Week 1, Lecture 2 Neural Network Basics Aoucemets: HW 1 Due o 10/8 Data sets for HW 1 are olie Proect selectio 10/11 Suggested readig : NN survey paper (Zhag Chap 1, 2 ad Sectios

More information

Machine Learning Theory (CS 6783)

Machine Learning Theory (CS 6783) Machie Learig Theory (CS 6783) Lecture 2 : Learig Frameworks, Examples Settig up learig problems. X : istace space or iput space Examples: Computer Visio: Raw M N image vectorized X = 0, 255 M N, SIFT

More information

Statistical Inference (Chapter 10) Statistical inference = learn about a population based on the information provided by a sample.

Statistical Inference (Chapter 10) Statistical inference = learn about a population based on the information provided by a sample. Statistical Iferece (Chapter 10) Statistical iferece = lear about a populatio based o the iformatio provided by a sample. Populatio: The set of all values of a radom variable X of iterest. Characterized

More information

ME 539, Fall 2008: Learning-Based Control

ME 539, Fall 2008: Learning-Based Control ME 539, Fall 2008: Learig-Based Cotrol Neural Network Basics 10/1/2008 & 10/6/2008 Uiversity Orego State Neural Network Basics Questios??? Aoucemet: Homework 1 has bee posted Due Friday 10/10/08 at oo

More information

Algorithms for Clustering

Algorithms for Clustering CR2: Statistical Learig & Applicatios Algorithms for Clusterig Lecturer: J. Salmo Scribe: A. Alcolei Settig: give a data set X R p where is the umber of observatio ad p is the umber of features, we wat

More information

Teaching Mathematics Concepts via Computer Algebra Systems

Teaching Mathematics Concepts via Computer Algebra Systems Iteratioal Joural of Mathematics ad Statistics Ivetio (IJMSI) E-ISSN: 4767 P-ISSN: - 4759 Volume 4 Issue 7 September. 6 PP-- Teachig Mathematics Cocepts via Computer Algebra Systems Osama Ajami Rashaw,

More information

Clustering. CM226: Machine Learning for Bioinformatics. Fall Sriram Sankararaman Acknowledgments: Fei Sha, Ameet Talwalkar.

Clustering. CM226: Machine Learning for Bioinformatics. Fall Sriram Sankararaman Acknowledgments: Fei Sha, Ameet Talwalkar. Clusterig CM226: Machie Learig for Bioiformatics. Fall 216 Sriram Sakararama Ackowledgmets: Fei Sha, Ameet Talwalkar Clusterig 1 / 42 Admiistratio HW 1 due o Moday. Email/post o CCLE if you have questios.

More information

Lecture 2: Monte Carlo Simulation

Lecture 2: Monte Carlo Simulation STAT/Q SCI 43: Itroductio to Resamplig ethods Sprig 27 Istructor: Ye-Chi Che Lecture 2: ote Carlo Simulatio 2 ote Carlo Itegratio Assume we wat to evaluate the followig itegratio: e x3 dx What ca we do?

More information

1.010 Uncertainty in Engineering Fall 2008

1.010 Uncertainty in Engineering Fall 2008 MIT OpeCourseWare http://ocw.mit.edu.00 Ucertaity i Egieerig Fall 2008 For iformatio about citig these materials or our Terms of Use, visit: http://ocw.mit.edu.terms. .00 - Brief Notes # 9 Poit ad Iterval

More information

ECE 8527: Introduction to Machine Learning and Pattern Recognition Midterm # 1. Vaishali Amin Fall, 2015

ECE 8527: Introduction to Machine Learning and Pattern Recognition Midterm # 1. Vaishali Amin Fall, 2015 ECE 8527: Itroductio to Machie Learig ad Patter Recogitio Midterm # 1 Vaishali Ami Fall, 2015 tue39624@temple.edu Problem No. 1: Cosider a two-class discrete distributio problem: ω 1 :{[0,0], [2,0], [2,2],

More information

Deep Neural Networks CMSC 422 MARINE CARPUAT. Deep learning slides credit: Vlad Morariu

Deep Neural Networks CMSC 422 MARINE CARPUAT. Deep learning slides credit: Vlad Morariu Deep Neural Networks CMSC 422 MARINE CARPUAT marie@cs.umd.edu Deep learig slides credit: Vlad Morariu Traiig (Deep) Neural Networks Computatioal graphs Improvemets to gradiet descet Stochastic gradiet

More information

MATHEMATICS. The assessment objectives of the Compulsory Part are to test the candidates :

MATHEMATICS. The assessment objectives of the Compulsory Part are to test the candidates : MATHEMATICS INTRODUCTION The public assessmet of this subject is based o the Curriculum ad Assessmet Guide (Secodary 4 6) Mathematics joitly prepared by the Curriculum Developmet Coucil ad the Hog Kog

More information

Pattern recognition systems Laboratory 10 Linear Classifiers and the Perceptron Algorithm

Pattern recognition systems Laboratory 10 Linear Classifiers and the Perceptron Algorithm Patter recogitio systems Laboratory 10 Liear Classifiers ad the Perceptro Algorithm 1. Objectives his laboratory sessio presets the perceptro learig algorithm for the liear classifier. We will apply gradiet

More information

Math 113 Exam 3 Practice

Math 113 Exam 3 Practice Math Exam Practice Exam will cover.-.9. This sheet has three sectios. The first sectio will remid you about techiques ad formulas that you should kow. The secod gives a umber of practice questios for you

More information

Lecture 10: Universal coding and prediction

Lecture 10: Universal coding and prediction 0-704: Iformatio Processig ad Learig Sprig 0 Lecture 0: Uiversal codig ad predictio Lecturer: Aarti Sigh Scribes: Georg M. Goerg Disclaimer: These otes have ot bee subjected to the usual scrutiy reserved

More information

Outline. Linear regression. Regularization functions. Polynomial curve fitting. Stochastic gradient descent for regression. MLE for regression

Outline. Linear regression. Regularization functions. Polynomial curve fitting. Stochastic gradient descent for regression. MLE for regression REGRESSION 1 Outlie Liear regressio Regularizatio fuctios Polyomial curve fittig Stochastic gradiet descet for regressio MLE for regressio Step-wise forward regressio Regressio methods Statistical techiques

More information

Artificial Intelligence Based Automatic Generation of

Artificial Intelligence Based Automatic Generation of Artificial Itelligece Based Automatic Geeratio of Etertaiig Gamig Egies Dr. Zahid Halim Faculty of Computer Sciece ad Egieerig Ghulam Ishaq Kha Istitute of Egieerig Scieces ad Techology, Topi zahid.halim@giki.edu.pk

More information

t distribution [34] : used to test a mean against an hypothesized value (H 0 : µ = µ 0 ) or the difference

t distribution [34] : used to test a mean against an hypothesized value (H 0 : µ = µ 0 ) or the difference EXST30 Backgroud material Page From the textbook The Statistical Sleuth Mea [0]: I your text the word mea deotes a populatio mea (µ) while the work average deotes a sample average ( ). Variace [0]: The

More information

Mixtures of Gaussians and the EM Algorithm

Mixtures of Gaussians and the EM Algorithm Mixtures of Gaussias ad the EM Algorithm CSE 6363 Machie Learig Vassilis Athitsos Computer Sciece ad Egieerig Departmet Uiversity of Texas at Arligto 1 Gaussias A popular way to estimate probability desity

More information

Pattern recognition systems Lab 10 Linear Classifiers and the Perceptron Algorithm

Pattern recognition systems Lab 10 Linear Classifiers and the Perceptron Algorithm Patter recogitio systems Lab 10 Liear Classifiers ad the Perceptro Algorithm 1. Objectives his lab sessio presets the perceptro learig algorithm for the liear classifier. We will apply gradiet descet ad

More information

Finite Difference Derivations for Spreadsheet Modeling John C. Walton Modified: November 15, 2007 jcw

Finite Difference Derivations for Spreadsheet Modeling John C. Walton Modified: November 15, 2007 jcw Fiite Differece Derivatios for Spreadsheet Modelig Joh C. Walto Modified: November 15, 2007 jcw Figure 1. Suset with 11 swas o Little Platte Lake, Michiga. Page 1 Modificatio Date: November 15, 2007 Review

More information

6.867 Machine learning, lecture 7 (Jaakkola) 1

6.867 Machine learning, lecture 7 (Jaakkola) 1 6.867 Machie learig, lecture 7 (Jaakkola) 1 Lecture topics: Kerel form of liear regressio Kerels, examples, costructio, properties Liear regressio ad kerels Cosider a slightly simpler model where we omit

More information

An Introduction to Randomized Algorithms

An Introduction to Randomized Algorithms A Itroductio to Radomized Algorithms The focus of this lecture is to study a radomized algorithm for quick sort, aalyze it usig probabilistic recurrece relatios, ad also provide more geeral tools for aalysis

More information

Binary classification, Part 1

Binary classification, Part 1 Biary classificatio, Part 1 Maxim Ragisky September 25, 2014 The problem of biary classificatio ca be stated as follows. We have a radom couple Z = (X,Y ), where X R d is called the feature vector ad Y

More information

Ω ). Then the following inequality takes place:

Ω ). Then the following inequality takes place: Lecture 8 Lemma 5. Let f : R R be a cotiuously differetiable covex fuctio. Choose a costat δ > ad cosider the subset Ωδ = { R f δ } R. Let Ωδ ad assume that f < δ, i.e., is ot o the boudary of f = δ, i.e.,

More information

Estimating Confidence Interval of Mean Using. Classical, Bayesian, and Bootstrap Approaches

Estimating Confidence Interval of Mean Using. Classical, Bayesian, and Bootstrap Approaches Iteratioal Joural of Mathematical Aalysis Vol. 8, 2014, o. 48, 2375-2383 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijma.2014.49287 Estimatig Cofidece Iterval of Mea Usig Classical, Bayesia,

More information

Information Theory and Statistics Lecture 4: Lempel-Ziv code

Information Theory and Statistics Lecture 4: Lempel-Ziv code Iformatio Theory ad Statistics Lecture 4: Lempel-Ziv code Łukasz Dębowski ldebowsk@ipipa.waw.pl Ph. D. Programme 203/204 Etropy rate is the limitig compressio rate Theorem For a statioary process (X i)

More information

Additional Notes on Power Series

Additional Notes on Power Series Additioal Notes o Power Series Mauela Girotti MATH 37-0 Advaced Calculus of oe variable Cotets Quick recall 2 Abel s Theorem 2 3 Differetiatio ad Itegratio of Power series 4 Quick recall We recall here

More information

Kinetics of Complex Reactions

Kinetics of Complex Reactions Kietics of Complex Reactios by Flick Colema Departmet of Chemistry Wellesley College Wellesley MA 28 wcolema@wellesley.edu Copyright Flick Colema 996. All rights reserved. You are welcome to use this documet

More information

Internal Information Representation and Processing

Internal Information Representation and Processing Iteral Iformatio Represetatio ad Processig CSCE 16 - Fudametals of Computer Sciece Dr. Awad Khalil Computer Sciece & Egieerig Departmet The America Uiversity i Cairo Decimal Number System We are used to

More information

CS284A: Representations and Algorithms in Molecular Biology

CS284A: Representations and Algorithms in Molecular Biology CS284A: Represetatios ad Algorithms i Molecular Biology Scribe Notes o Lectures 3 & 4: Motif Discovery via Eumeratio & Motif Represetatio Usig Positio Weight Matrix Joshua Gervi Based o presetatios by

More information

Asymptotic Coupling and Its Applications in Information Theory

Asymptotic Coupling and Its Applications in Information Theory Asymptotic Couplig ad Its Applicatios i Iformatio Theory Vicet Y. F. Ta Joit Work with Lei Yu Departmet of Electrical ad Computer Egieerig, Departmet of Mathematics, Natioal Uiversity of Sigapore IMS-APRM

More information

MATHEMATICAL SCIENCES PAPER-II

MATHEMATICAL SCIENCES PAPER-II MATHEMATICAL SCIENCES PAPER-II. Let {x } ad {y } be two sequeces of real umbers. Prove or disprove each of the statemets :. If {x y } coverges, ad if {y } is coverget, the {x } is coverget.. {x + y } coverges

More information

8 : Learning Partially Observed GM: the EM algorithm

8 : Learning Partially Observed GM: the EM algorithm 10-708: Probabilistic Graphical Models, Sprig 2015 8 : Learig Partially Observed GM: the EM algorithm Lecturer: Eric P. Xig Scribes: Auric Qiao, Hao Zhag, Big Liu 1 Itroductio Two fudametal questios i

More information

Math 113 Exam 4 Practice

Math 113 Exam 4 Practice Math Exam 4 Practice Exam 4 will cover.-.. This sheet has three sectios. The first sectio will remid you about techiques ad formulas that you should kow. The secod gives a umber of practice questios for

More information

E. Incorrect! Plug n = 1, 2, 3, & 4 into the general term formula. n =, then the first four terms are found by

E. Incorrect! Plug n = 1, 2, 3, & 4 into the general term formula. n =, then the first four terms are found by Calculus II - Problem Solvig Drill 8: Sequeces, Series, ad Covergece Questio No. of 0. Fid the first four terms of the sequece whose geeral term is give by a ( ) : Questio #0 (A) (B) (C) (D) (E) 8,,, 4

More information

Model of Computation and Runtime Analysis

Model of Computation and Runtime Analysis Model of Computatio ad Rutime Aalysis Model of Computatio Model of Computatio Specifies Set of operatios Cost of operatios (ot ecessarily time) Examples Turig Machie Radom Access Machie (RAM) PRAM Map

More information

Machine Learning.

Machine Learning. 10-701 Machie Learig http://www.cs.cmu.edu/~epxig/class/10701-15f/ Orgaizatioal ifo All up-to-date ifo is o the course web page (follow liks from my page). Istructors - Eric Xig - Ziv Bar-Joseph TAs: See

More information

SRC Technical Note June 17, Tight Thresholds for The Pure Literal Rule. Michael Mitzenmacher. d i g i t a l

SRC Technical Note June 17, Tight Thresholds for The Pure Literal Rule. Michael Mitzenmacher. d i g i t a l SRC Techical Note 1997-011 Jue 17, 1997 Tight Thresholds for The Pure Literal Rule Michael Mitzemacher d i g i t a l Systems Research Ceter 130 Lytto Aveue Palo Alto, Califoria 94301 http://www.research.digital.com/src/

More information

1 of 7 7/16/2009 6:06 AM Virtual Laboratories > 6. Radom Samples > 1 2 3 4 5 6 7 6. Order Statistics Defiitios Suppose agai that we have a basic radom experimet, ad that X is a real-valued radom variable

More information

Probability and Information Theory for Language Modeling. Statistical Linguistics. Statistical Linguistics: Adult Monolingual Speaker

Probability and Information Theory for Language Modeling. Statistical Linguistics. Statistical Linguistics: Adult Monolingual Speaker Probability ad Iformatio Theory for Laguage Modelig Statistical vs. Symbolic NLP Elemetary Probability Theory Laguage Modelig Iformatio Theory Statistical Liguistics Statistical approaches are clearly

More information

24.1 Confidence Intervals and Margins of Error

24.1 Confidence Intervals and Margins of Error 24.1 Cofidece Itervals ad Margis of Error Essetial Questio: How do you calculate a cofidece iterval ad a margi of error for a populatio proportio or populatio mea? Resource Locker Explore Idetifyig Likely

More information

R. van Zyl 1, A.J. van der Merwe 2. Quintiles International, University of the Free State

R. van Zyl 1, A.J. van der Merwe 2. Quintiles International, University of the Free State Bayesia Cotrol Charts for the Two-parameter Expoetial Distributio if the Locatio Parameter Ca Take o Ay Value Betwee Mius Iity ad Plus Iity R. va Zyl, A.J. va der Merwe 2 Quitiles Iteratioal, ruaavz@gmail.com

More information

Model of Computation and Runtime Analysis

Model of Computation and Runtime Analysis Model of Computatio ad Rutime Aalysis Model of Computatio Model of Computatio Specifies Set of operatios Cost of operatios (ot ecessarily time) Examples Turig Machie Radom Access Machie (RAM) PRAM Map

More information

Mathematical Description of Discrete-Time Signals. 9/10/16 M. J. Roberts - All Rights Reserved 1

Mathematical Description of Discrete-Time Signals. 9/10/16 M. J. Roberts - All Rights Reserved 1 Mathematical Descriptio of Discrete-Time Sigals 9/10/16 M. J. Roberts - All Rights Reserved 1 Samplig ad Discrete Time Samplig is the acquisitio of the values of a cotiuous-time sigal at discrete poits

More information

10-701/ Machine Learning Mid-term Exam Solution

10-701/ Machine Learning Mid-term Exam Solution 0-70/5-78 Machie Learig Mid-term Exam Solutio Your Name: Your Adrew ID: True or False (Give oe setece explaatio) (20%). (F) For a cotiuous radom variable x ad its probability distributio fuctio p(x), it

More information

http://www.xelca.l/articles/ufo_ladigsbaa_houte.aspx imulatio Output aalysis 3/4/06 This lecture Output: A simulatio determies the value of some performace measures, e.g. productio per hour, average queue

More information

Olli Simula T / Chapter 1 3. Olli Simula T / Chapter 1 5

Olli Simula T / Chapter 1 3. Olli Simula T / Chapter 1 5 Sigals ad Systems Sigals ad Systems Sigals are variables that carry iformatio Systemstake sigals as iputs ad produce sigals as outputs The course deals with the passage of sigals through systems T-6.4

More information

EECS564 Estimation, Filtering, and Detection Hwk 2 Solns. Winter p θ (z) = (2θz + 1 θ), 0 z 1

EECS564 Estimation, Filtering, and Detection Hwk 2 Solns. Winter p θ (z) = (2θz + 1 θ), 0 z 1 EECS564 Estimatio, Filterig, ad Detectio Hwk 2 Sols. Witer 25 4. Let Z be a sigle observatio havig desity fuctio where. p (z) = (2z + ), z (a) Assumig that is a oradom parameter, fid ad plot the maximum

More information

Lecture 6 Chi Square Distribution (χ 2 ) and Least Squares Fitting

Lecture 6 Chi Square Distribution (χ 2 ) and Least Squares Fitting Lecture 6 Chi Square Distributio (χ ) ad Least Squares Fittig Chi Square Distributio (χ ) Suppose: We have a set of measuremets {x 1, x, x }. We kow the true value of each x i (x t1, x t, x t ). We would

More information

On Thresholds for Robust Goodness-of-Fit Tests

On Thresholds for Robust Goodness-of-Fit Tests O Thresholds for Robust Goodess-of-Fit Tests Jayakrisha Uikrisha, Sea Mey, ad Veugopal V. Veeravalli Dept. of Electrical ad Computer Egieerig Coordiated Sciece Laboratory Uiversity of Illiois at Urbaa-Champaig

More information

11 Hidden Markov Models

11 Hidden Markov Models Hidde Markov Models Hidde Markov Models are a popular machie learig approach i bioiformatics. Machie learig algorithms are preseted with traiig data, which are used to derive importat isights about the

More information

Information Theory Tutorial Communication over Channels with memory. Chi Zhang Department of Electrical Engineering University of Notre Dame

Information Theory Tutorial Communication over Channels with memory. Chi Zhang Department of Electrical Engineering University of Notre Dame Iformatio Theory Tutorial Commuicatio over Chaels with memory Chi Zhag Departmet of Electrical Egieerig Uiversity of Notre Dame Abstract A geeral capacity formula C = sup I(; Y ), which is correct for

More information

CSE 527, Additional notes on MLE & EM

CSE 527, Additional notes on MLE & EM CSE 57 Lecture Notes: MLE & EM CSE 57, Additioal otes o MLE & EM Based o earlier otes by C. Grat & M. Narasimha Itroductio Last lecture we bega a examiatio of model based clusterig. This lecture will be

More information

Quantum Simulation: Solving Schrödinger Equation on a Quantum Computer

Quantum Simulation: Solving Schrödinger Equation on a Quantum Computer Purdue Uiversity Purdue e-pubs Birc Poster Sessios Birc Naotechology Ceter 4-14-008 Quatum Simulatio: Solvig Schrödiger Equatio o a Quatum Computer Hefeg Wag Purdue Uiversity, wag10@purdue.edu Sabre Kais

More information

Exam II Covers. STA 291 Lecture 19. Exam II Next Tuesday 5-7pm Memorial Hall (Same place as exam I) Makeup Exam 7:15pm 9:15pm Location CB 234

Exam II Covers. STA 291 Lecture 19. Exam II Next Tuesday 5-7pm Memorial Hall (Same place as exam I) Makeup Exam 7:15pm 9:15pm Location CB 234 STA 291 Lecture 19 Exam II Next Tuesday 5-7pm Memorial Hall (Same place as exam I) Makeup Exam 7:15pm 9:15pm Locatio CB 234 STA 291 - Lecture 19 1 Exam II Covers Chapter 9 10.1; 10.2; 10.3; 10.4; 10.6

More information

Lecture 33: Bootstrap

Lecture 33: Bootstrap Lecture 33: ootstrap Motivatio To evaluate ad compare differet estimators, we eed cosistet estimators of variaces or asymptotic variaces of estimators. This is also importat for hypothesis testig ad cofidece

More information

Probability and MLE.

Probability and MLE. 10-701 Probability ad MLE http://www.cs.cmu.edu/~pradeepr/701 (brief) itro to probability Basic otatios Radom variable - referrig to a elemet / evet whose status is ukow: A = it will rai tomorrow Domai

More information

Digital Signal Processing, Fall 2006

Digital Signal Processing, Fall 2006 Digital Sigal Processig, Fall 26 Lecture 1: Itroductio, Discrete-time sigals ad systems Zheg-Hua Ta Departmet of Electroic Systems Aalborg Uiversity, Demark zt@kom.aau.dk 1 Part I: Itroductio Itroductio

More information

Pixel Recurrent Neural Networks

Pixel Recurrent Neural Networks Pixel Recurret Neural Networks Aa ro va de Oord, Nal Kalchbreer, Koray Kavukcuoglu Google DeepMid August 2016 Preseter - Neha M Example problem (completig a image) Give the first half of the image, create

More information

Introduction to Computational Molecular Biology. Gibbs Sampling

Introduction to Computational Molecular Biology. Gibbs Sampling 18.417 Itroductio to Computatioal Molecular Biology Lecture 19: November 16, 2004 Scribe: Tushara C. Karuarata Lecturer: Ross Lippert Editor: Tushara C. Karuarata Gibbs Samplig Itroductio Let s first recall

More information

Lecture 6 Chi Square Distribution (χ 2 ) and Least Squares Fitting

Lecture 6 Chi Square Distribution (χ 2 ) and Least Squares Fitting Lecture 6 Chi Square Distributio (χ ) ad Least Squares Fittig Chi Square Distributio (χ ) Suppose: We have a set of measuremets {x 1, x, x }. We kow the true value of each x i (x t1, x t, x t ). We would

More information

SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES

SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES Read Sectio 1.5 (pages 5 9) Overview I Sectio 1.5 we lear to work with summatio otatio ad formulas. We will also itroduce a brief overview of sequeces,

More information

Properties and Hypothesis Testing

Properties and Hypothesis Testing Chapter 3 Properties ad Hypothesis Testig 3.1 Types of data The regressio techiques developed i previous chapters ca be applied to three differet kids of data. 1. Cross-sectioal data. 2. Time series data.

More information

AP CALCULUS BC 2014 SCORING GUIDELINES

AP CALCULUS BC 2014 SCORING GUIDELINES AP CALCULUS BC 04 SCORING GUIDELINES Questio 6 + The Taylor series for a fuctio f about x = is give by ( ) ( x ) ad coverges to f( x ) for = x < R, where R is the radius of covergece of the Taylor series.

More information

An alternating series is a series where the signs alternate. Generally (but not always) there is a factor of the form ( 1) n + 1

An alternating series is a series where the signs alternate. Generally (but not always) there is a factor of the form ( 1) n + 1 Calculus II - Problem Solvig Drill 20: Alteratig Series, Ratio ad Root Tests Questio No. of 0 Istructios: () Read the problem ad aswer choices carefully (2) Work the problems o paper as eeded (3) Pick

More information

SOME THEORY AND PRACTICE OF STATISTICS by Howard G. Tucker

SOME THEORY AND PRACTICE OF STATISTICS by Howard G. Tucker SOME THEORY AND PRACTICE OF STATISTICS by Howard G. Tucker CHAPTER 9. POINT ESTIMATION 9. Covergece i Probability. The bases of poit estimatio have already bee laid out i previous chapters. I chapter 5

More information

Markov Decision Processes

Markov Decision Processes Markov Decisio Processes Defiitios; Statioary policies; Value improvemet algorithm, Policy improvemet algorithm, ad liear programmig for discouted cost ad average cost criteria. Markov Decisio Processes

More information

Signals & Systems Chapter3

Signals & Systems Chapter3 Sigals & Systems Chapter3 1.2 Discrete-Time (D-T) Sigals Electroic systems do most of the processig of a sigal usig a computer. A computer ca t directly process a C-T sigal but istead eeds a stream of

More information

Multilayer perceptrons

Multilayer perceptrons Multilayer perceptros If traiig set is ot liearly separable, a etwork of McCulloch-Pitts uits ca give a solutio If o loop exists i etwork, called a feedforward etwork (else, recurret etwork) A two-layer

More information

ECE-S352 Introduction to Digital Signal Processing Lecture 3A Direct Solution of Difference Equations

ECE-S352 Introduction to Digital Signal Processing Lecture 3A Direct Solution of Difference Equations ECE-S352 Itroductio to Digital Sigal Processig Lecture 3A Direct Solutio of Differece Equatios Discrete Time Systems Described by Differece Equatios Uit impulse (sample) respose h() of a DT system allows

More information

SDS 321: Introduction to Probability and Statistics

SDS 321: Introduction to Probability and Statistics SDS 321: Itroductio to Probability ad Statistics Lecture 23: Cotiuous radom variables- Iequalities, CLT Puramrita Sarkar Departmet of Statistics ad Data Sciece The Uiversity of Texas at Austi www.cs.cmu.edu/

More information

Building an NMR Quantum Computer

Building an NMR Quantum Computer Buildig a NMR Quatum Computer Spi, the Ster-Gerlach Experimet, ad the Bloch Sphere Kevi Youg Berkeley Ceter for Quatum Iformatio ad Computatio, Uiversity of Califoria, Berkeley, CA 9470 Scalable ad Secure

More information

ECE 901 Lecture 12: Complexity Regularization and the Squared Loss

ECE 901 Lecture 12: Complexity Regularization and the Squared Loss ECE 90 Lecture : Complexity Regularizatio ad the Squared Loss R. Nowak 5/7/009 I the previous lectures we made use of the Cheroff/Hoeffdig bouds for our aalysis of classifier errors. Hoeffdig s iequality

More information

Lecture 7: Fourier Series and Complex Power Series

Lecture 7: Fourier Series and Complex Power Series Math 1d Istructor: Padraic Bartlett Lecture 7: Fourier Series ad Complex Power Series Week 7 Caltech 013 1 Fourier Series 1.1 Defiitios ad Motivatio Defiitio 1.1. A Fourier series is a series of fuctios

More information

Applications of Two Dimensional Fractional Mellin Transform

Applications of Two Dimensional Fractional Mellin Transform Iteratioal Joural of Scietific ad Iovative Mathematical Research (IJSIMR) Volume 2 Issue 9 September 2014 PP 794-799 ISSN 2347-307X (Prit) & ISSN 2347-3142 (Olie) www.arcjourals.org Applicatios of Two

More information

Computing the maximum likelihood estimates: concentrated likelihood, EM-algorithm. Dmitry Pavlyuk

Computing the maximum likelihood estimates: concentrated likelihood, EM-algorithm. Dmitry Pavlyuk Computig the maximum likelihood estimates: cocetrated likelihood, EM-algorithm Dmitry Pavlyuk The Mathematical Semiar, Trasport ad Telecommuicatio Istitute, Riga, 13.05.2016 Presetatio outlie 1. Basics

More information

Mathematical Statistics - MS

Mathematical Statistics - MS Paper Specific Istructios. The examiatio is of hours duratio. There are a total of 60 questios carryig 00 marks. The etire paper is divided ito three sectios, A, B ad C. All sectios are compulsory. Questios

More information

Electricity consumption forecasting method based on MPSO-BP neural network model Youshan Zhang 1, 2,a, Liangdong Guo2, b,qi Li 3, c and Junhui Li2, d

Electricity consumption forecasting method based on MPSO-BP neural network model Youshan Zhang 1, 2,a, Liangdong Guo2, b,qi Li 3, c and Junhui Li2, d 4th Iteratioal Coferece o Electrical & Electroics Egieerig ad Computer Sciece (ICEEECS 2016) Electricity cosumptio forecastig method based o eural etwork model Yousha Zhag 1, 2,a, Liagdog Guo2, b,qi Li

More information

ENGI 4421 Confidence Intervals (Two Samples) Page 12-01

ENGI 4421 Confidence Intervals (Two Samples) Page 12-01 ENGI 44 Cofidece Itervals (Two Samples) Page -0 Two Sample Cofidece Iterval for a Differece i Populatio Meas [Navidi sectios 5.4-5.7; Devore chapter 9] From the cetral limit theorem, we kow that, for sufficietly

More information

Seunghee Ye Ma 8: Week 5 Oct 28

Seunghee Ye Ma 8: Week 5 Oct 28 Week 5 Summary I Sectio, we go over the Mea Value Theorem ad its applicatios. I Sectio 2, we will recap what we have covered so far this term. Topics Page Mea Value Theorem. Applicatios of the Mea Value

More information

Online Convex Optimization in the Bandit Setting: Gradient Descent Without a Gradient. -Avinash Atreya Feb

Online Convex Optimization in the Bandit Setting: Gradient Descent Without a Gradient. -Avinash Atreya Feb Olie Covex Optimizatio i the Badit Settig: Gradiet Descet Without a Gradiet -Aviash Atreya Feb 9 2011 Outlie Itroductio The Problem Example Backgroud Notatio Results Oe Poit Estimate Mai Theorem Extesios

More information

Machine Learning Brett Bernstein

Machine Learning Brett Bernstein Machie Learig Brett Berstei Week 2 Lecture: Cocept Check Exercises Starred problems are optioal. Excess Risk Decompositio 1. Let X = Y = {1, 2,..., 10}, A = {1,..., 10, 11} ad suppose the data distributio

More information

Carleton College, Winter 2017 Math 121, Practice Final Prof. Jones. Note: the exam will have a section of true-false questions, like the one below.

Carleton College, Winter 2017 Math 121, Practice Final Prof. Jones. Note: the exam will have a section of true-false questions, like the one below. Carleto College, Witer 207 Math 2, Practice Fial Prof. Joes Note: the exam will have a sectio of true-false questios, like the oe below.. True or False. Briefly explai your aswer. A icorrectly justified

More information

PRACTICE PROBLEMS FOR THE FINAL

PRACTICE PROBLEMS FOR THE FINAL PRACTICE PROBLEMS FOR THE FINAL Math 36Q Fall 25 Professor Hoh Below is a list of practice questios for the Fial Exam. I would suggest also goig over the practice problems ad exams for Exam ad Exam 2 to

More information

Chapter 10: Power Series

Chapter 10: Power Series Chapter : Power Series 57 Chapter Overview: Power Series The reaso series are part of a Calculus course is that there are fuctios which caot be itegrated. All power series, though, ca be itegrated because

More information

Linear time invariant systems

Linear time invariant systems Liear time ivariat systems Alejadro Ribeiro Dept. of Electrical ad Systems Egieerig Uiversity of Pesylvaia aribeiro@seas.upe.edu http://www.seas.upe.edu/users/~aribeiro/ February 25, 2016 Sigal ad Iformatio

More information

Discrete-Time Signals and Systems. Discrete-Time Signals and Systems. Signal Symmetry. Elementary Discrete-Time Signals.

Discrete-Time Signals and Systems. Discrete-Time Signals and Systems. Signal Symmetry. Elementary Discrete-Time Signals. Discrete-ime Sigals ad Systems Discrete-ime Sigals ad Systems Dr. Deepa Kudur Uiversity of oroto Referece: Sectios. -.5 of Joh G. Proakis ad Dimitris G. Maolakis, Digital Sigal Processig: Priciples, Algorithms,

More information

MATH 320: Probability and Statistics 9. Estimation and Testing of Parameters. Readings: Pruim, Chapter 4

MATH 320: Probability and Statistics 9. Estimation and Testing of Parameters. Readings: Pruim, Chapter 4 MATH 30: Probability ad Statistics 9. Estimatio ad Testig of Parameters Estimatio ad Testig of Parameters We have bee dealig situatios i which we have full kowledge of the distributio of a radom variable.

More information

Jacob Hays Amit Pillay James DeFelice 4.1, 4.2, 4.3

Jacob Hays Amit Pillay James DeFelice 4.1, 4.2, 4.3 No-Parametric Techiques Jacob Hays Amit Pillay James DeFelice 4.1, 4.2, 4.3 Parametric vs. No-Parametric Parametric Based o Fuctios (e.g Normal Distributio) Uimodal Oly oe peak Ulikely real data cofies

More information

Using the IML Procedure to Examine the Efficacy of a New Control Charting Technique

Using the IML Procedure to Examine the Efficacy of a New Control Charting Technique Paper 2894-2018 Usig the IML Procedure to Examie the Efficacy of a New Cotrol Chartig Techique Austi Brow, M.S., Uiversity of Norther Colorado; Bryce Whitehead, M.S., Uiversity of Norther Colorado ABSTRACT

More information