Detection and Estimation Theory

Size: px
Start display at page:

Download "Detection and Estimation Theory"

Transcription

1 ESE 54 Detection nd Estimtion heory Joseph A. O Sullivn Smuel C. Schs Professor Electronic Systems nd Signls Reserch Lbortory Electricl nd Systems Engineering Wshington University Urbuer Hll (Lynd nswers) jo@wustl.edu J. A. O'S. ESE 54, Lecture 5, 4/4/9

2 Announcements Finl Exm My Mke-up clss on Fridy April 4, here Other nnouncements? Questions? J. A. O'S. ESE 54, Lecture 5, 4/4/9

3 Outline: Estimtion i in Rndom Processes Problem definition Scope of coverge this semester Log-likelihood for pproximte rndom process Log-likelihood rtio (motivted by detection theory) Limit s number of terms in pproximtion gets lrge Estimtion theory in rndom processes J. A. O'S. ESE 54, Lecture 5, 4/4/9 3

4 Estimtion heory for Rndom Processes rt () = st (; ) wt (), t, E wtw () ( τ ) = δ ( t τ ), Signl with sclr [ ] prmeter in AWG [ ] onrndom prmeter Rndom prmeter Signl with sclr prmeter in G Signl with multiple prmeters Rndom wveform in presence of noise Vector wveform Stte spce model Continuous-time Klmn filter rt () = st (; ) nt (), t, Entn () ( τ) = Kc(, tτ) δ( t τ), rt () = st (; θ) nt (), t, Entn [ () ( τ) ] = Kc (, t τ) δ( t τ), K () t = lim... kφk() t K k = x () t = F () txt () G () tut (), E utu () ( τ ) = qδ ( t τ ), yt () = Ctxt () () wt () [ ] J. A. O'S. ESE 54, Lecture 5, 4/4/9 4

5 Eti Estimtion heory Concentrte on sclr cse Rndom (MMSE, MAP) nd onrndom (ML) prmeters Crmer-Ro bound determined by Fisher informtion Vector cse Grdients insted of derivtives Fisher informtion mtrix Estimtion of rndom processes not covered this semester Exmple of dely-doppler estimtion J. A. O'S. ESE 54, Lecture 5, 4/4/9 5

6 Estimtion heory: Sclr Prmeter Methodology Use finite pproximtion to the rndom process Find CO set of eigenfunctions for the covrince function for the rndom process Expnd the mesurement using the first eigenfunctions Derive the loglikelihood function for the finite pproximtion ormlize the loglikelihood function using fictionl null hypothesis Let get lrge to get the loglikelihood functionl For the rndom cse, dd the log of the prior Find the mximum (set derivtive or grdient to zero) Evlute performnce (compute Fisher informtion, find Crmer-Ro bound) J. A. O'S. ESE 54, Lecture 5, 4/4/9 6

7 Estimtion heory: Finite i Expnsion for Mesurements If dditive WG, the CO set is rbitrry. Use the signl (given the prmeter) to generte the first (or first few) bsis function(s) to find sufficient sttistic. If not white, use eigenfunctions. Derive loglikelihood function for finite pproximtion. For AWG, the finite pproximtion equls the loglikelihood functionl. rt () = st (; ) wt (), t, E[ wtw () ( τ) ] = δ( t τ), rt ( ) = st ( ; ) nt ( ), t, Entn [ ( ) ( τ) ] = Kc ( t, τ) δ( t τ), λ ckφ k () t = K c (, t τ ) φ k ( τ ) dτ, λ k = λ ck r = r, φ = r( t) φ ( t) dt = s ( ) n k k k k k r = = k k = λk WG Cse: φ ( t) = s( t; ), st ( ; ), s ( t ; ) [ r r r ], ln p( r ) lnλ ( r s ( ) ) ( ) ln pr ( ) = ln π r st ( ; ), st ( ; ), J. A. O'S. ESE 54, Lecture 5, 4/4/9 k k 7

8 Estimtion heory: Finite i Expnsion for Mesurements o derive the loglikelihood functionl, first normlize reltive to fictionl null, noise-only only hypothesis. rt () = st (; ) wt (), t, E[ wtw () ( τ) ] = δ( t τ), H : r() t = w(), t t rt () = st (; ) nt (), t, Entn [ () ( τ) ] = Kc (, tτ) δ( t τ), H : r() t = n(), t t p( r ) ln = ln λk ( rk sk( ) ) ln λk ( rk) p( r H) k = λk k = λk p( r ) ln = r k s k ( ) s k ( ) p ( r H ) k = λk pr ( ) WG Cse: lr ( ) = ln = r st (; ), st (; ) st (; ), st (; ), pr ( H) r = ()(; ), ( ) ()(; ) (; rtstdt lr = rtstdt st ) dt st (; ) dt J. A. O'S. ESE 54, Lecture 5, 4/4/9 White noise cse Colored noise cse White noise cse 8

9 Estimtion heory: Loglikelihood lih Functionl Let the dimension of the pproximtion get lrge. Invoke Mercer s theorem nd the inverse of the covrince function. First order necessry condition for the mximum: set derivtive to. rt ( ) = st ( ; ) nt ( ), t, Entn [ ( ) ( τ) ] = Kc( t, τ) δ( t τ), H : r( t) = n( t), t p( r ) ln = rk sk( ) sk( ) p ( r H ) k = λ k l( r ) = lim rk sk( ) sk( ) = r( t) s( t; ) Q( t, τ ) s k = λk (; τ dtd ) τ Qt (, τ) = [ δ( t τ) ho (, tτ) ] l ( r ) s ( τ; ) = ( rt () st (; )) Qt (, τ) dtdτ J. A. O'S. ESE 54, Lecture 5, 4/4/9 9

10 Estimtion heory: Loglikelihood lih Functionl Let the dimension of the pproximtion get lrge. Invoke Mercer s theorem nd the inverse of the covrince function. First order necessry condition for the mximum: set derivtive to. rt ( ) = st ( ; ) nt ( ), t, Entn [ ( ) ( τ) ] = Kc( t, τ) δ( t τ), H : r( t) = n( t), t p( r ) ln = rk sk( ) sk( ) p ( r H ) k = λ k l( r ) = lim rk sk( ) sk( ) = r( t) s( t; ) Q( t, τ ) s k = λk (; τ dtd ) τ Rndom Prmeter Cse Qt (, τ) = [ δ( t τ) ho (, tτ) ] p( A) lr ( A) = rt ( ) sta ( ; ) Qt (, τ) s( τ; Adtd ) τ ln pa ( ) l ( r ) s ( τ; ) = ( rt () st (; )) Qt (, τ) dtdτ lr ( A) s( τ; A) ln pa ( ) J. A. O'S. ESE 54, Lecture = ( 5, rt () 4/4/9 sta (; )) Qt (, τ) dtdτ A A A

11 Aside: Estimtion of Colored Gussin oise Component he form of the inverse covrince function Q is sum of two terms, one of which inverts the white noise covrince, nd one of which is interpreted s n estimtor-subtrctor [ τ ] n(t) nt () = n() t wt (), t, E n() tn( ) = K(, tτ), c c c c E[ w() t w( τ) ] = δ( t τ) MMSE estimte of the colored noise component nˆ () t E n () t n( u), n( u) c [ ] h o (t,τ) = c Q(t,τ) nˆ () t = h (, t τ) n( τ) dτ c o Qt (, τ ) n( τ ) d τ = nt ( ) ho ( t, ) n ( ) d τ τ τ - ^n c (t) J. A. O'S. ESE 54, Lecture 5, 4/4/9

12 Aside: Estimtion of Colored Gussin oise Component Derivtion of optiml i= estimtor in integrl form. View the derivtion s the limit of derivtion for finite pproximtion. he inverse covrince function is then representble s long s the colored noise covrince function stisfies Mercer s theorem (then h o converges). he result is non-cusl implementtion. Cusl versions (fctoriztions of Q) exist. [ τ ] nt () = nc() t wt (), t, E nc() tnc( ) = Kc(, tτ), E[ w() t w( τ) ] = δ( t τ) Krhunen-Loeve expnsion using colored noise covrince function Kc(, t τ) = λciφi() t φi( τ) ni = n, φi = nci wi, ni, λci λci E[ nci n( u), n( u) ] = E[ nci ni ] = ni λci λci MMSE estimte nˆ () ˆ c t = nciφi() t = φi() t ni i= i= λci nˆ () t = h (, t τ) n( τ) dτ c o o λci = i= λci i t i h (, t τ) φ () φ ( τ) Q(, t τ) n( τ) dτ = n() t ho (, t τ) n( τ) dτ λ ci = λ ci λci J. A. O'S. ESE 54, Lecture 5, 4/4/9

13 Exmple: Pulse Amplitude Modultion Consider both the rt () = Est () wt (), t nonrndom nd rndom cses st () dt=, (, σ ) Answers differ only in scle fctor; SR ( ) = ()() definition vries ML estimte is unbised, vrince /E A l A A E r t s t dt A E σ l ( A ) A = E rtstdt ()() AE = A σ ˆ ML = r()() t s t) dt E Eσ MAP E J. A. O'S. ESE 54, Lecture 5, 4/4/9 ˆ = r()() t s t dt σ E 3

14 Exmple: Pulse Amplitude Modultion Performnce CRLB for nonrndom rt () = Est () wt (), t cse: ML estimte is efficient (unbised nd st () dt=, (, σ ) meets the CRLB) MAP estimte is A efficient l( A) = A E r()() t s t dt A E σ Bound for the rndom cse cn be viewed s l( A) A = E r () t s () t dt AE either reducing the A σ prior vrince or reducing the MSE of l( A) E = the ML estimtor. A σ CRLB =, E J. A. O'S. ESE 54, Lecture 5, 4/4/9 = = σ = E Eσ J E σ Eσ Eσ 4

15 Generl lgussin Cse Performnce CRLB for nonrndom cse is bsed on Fisher informtion. Fisher informtion for the rndom cse includes term from the prior nd n expecttion ti over the prmeter. lr ( A) = rt ( ) sta ( ; ) Qt (, τ) s( τ; Adtd ) τ ln pa ( ) lr ( A) s( τ; A) ln pa ( ) = ( rt () sta (; )) Qt (, τ) dtdτ A A A lr ( A ) sta ( ; ) s ( τ ; A ) E A Q(, t τ) dtdτ = A A A CRLB = s(; t A) s(; τ A) Q(, t τ ) dtd τ AA A st A s A pa J = E Q(, t τ) dtdτ A A A (; ) ( τ; ) ln ( ) ln pa ( ) A J. A. O'S. ESE 54, Lecture 5, 4/4/9 5

Data Assimilation. Alan O Neill Data Assimilation Research Centre University of Reading

Data Assimilation. Alan O Neill Data Assimilation Research Centre University of Reading Dt Assimiltion Aln O Neill Dt Assimiltion Reserch Centre University of Reding Contents Motivtion Univrite sclr dt ssimiltion Multivrite vector dt ssimiltion Optiml Interpoltion BLUE 3d-Vritionl Method

More information

THE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS.

THE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS. THE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS RADON ROSBOROUGH https://intuitiveexplntionscom/picrd-lindelof-theorem/ This document is proof of the existence-uniqueness theorem

More information

Lecture 21: Order statistics

Lecture 21: Order statistics Lecture : Order sttistics Suppose we hve N mesurements of sclr, x i =, N Tke ll mesurements nd sort them into scending order x x x 3 x N Define the mesured running integrl S N (x) = 0 for x < x = i/n for

More information

The final exam will take place on Friday May 11th from 8am 11am in Evans room 60.

The final exam will take place on Friday May 11th from 8am 11am in Evans room 60. Mth 104: finl informtion The finl exm will tke plce on Fridy My 11th from 8m 11m in Evns room 60. The exm will cover ll prts of the course with equl weighting. It will cover Chpters 1 5, 7 15, 17 21, 23

More information

u( t) + K 2 ( ) = 1 t > 0 Analyzing Damped Oscillations Problem (Meador, example 2-18, pp 44-48): Determine the equation of the following graph.

u( t) + K 2 ( ) = 1 t > 0 Analyzing Damped Oscillations Problem (Meador, example 2-18, pp 44-48): Determine the equation of the following graph. nlyzing Dmped Oscilltions Prolem (Medor, exmple 2-18, pp 44-48): Determine the eqution of the following grph. The eqution is ssumed to e of the following form f ( t) = K 1 u( t) + K 2 e!"t sin (#t + $

More information

Review of Gaussian Quadrature method

Review of Gaussian Quadrature method Review of Gussin Qudrture method Nsser M. Asi Spring 006 compiled on Sundy Decemer 1, 017 t 09:1 PM 1 The prolem To find numericl vlue for the integrl of rel vlued function of rel vrile over specific rnge

More information

Detection and Estimation Theory

Detection and Estimation Theory ESE 54 Detection and Estimation heory Joseph A. O Sullivan Samuel C. Sachs Professor Electronic Systems and Signals Research Laboratory Electrical and Systems Engineering Washington University Urbauer

More information

LECTURE NOTE #12 PROF. ALAN YUILLE

LECTURE NOTE #12 PROF. ALAN YUILLE LECTURE NOTE #12 PROF. ALAN YUILLE 1. Clustering, K-mens, nd EM Tsk: set of unlbeled dt D = {x 1,..., x n } Decompose into clsses w 1,..., w M where M is unknown. Lern clss models p(x w)) Discovery of

More information

Continuous Random Variables

Continuous Random Variables STAT/MATH 395 A - PROBABILITY II UW Winter Qurter 217 Néhémy Lim Continuous Rndom Vribles Nottion. The indictor function of set S is rel-vlued function defined by : { 1 if x S 1 S (x) if x S Suppose tht

More information

Linear Mean-square Estimation. Wednesday, November 30, 11

Linear Mean-square Estimation. Wednesday, November 30, 11 Liner Men-squre Estimtion Discrete-time Filtering Let Z(n) desired signl N(n) dditive noise X(n) =Z(n)+N(n) dt/observtions Find the liner men-squre estimtor of Z(n) Ẑ(n) = k= h(n k)x(k) from given set

More information

Maximum Likelihood Estimation for Allele Frequencies. Biostatistics 666

Maximum Likelihood Estimation for Allele Frequencies. Biostatistics 666 Mximum Likelihood Estimtion for Allele Frequencies Biosttistics 666 Previous Series of Lectures: Introduction to Colescent Models Comuttionlly efficient frmework Alterntive to forwrd simultions Amenble

More information

Estimation of Binomial Distribution in the Light of Future Data

Estimation of Binomial Distribution in the Light of Future Data British Journl of Mthemtics & Computer Science 102: 1-7, 2015, Article no.bjmcs.19191 ISSN: 2231-0851 SCIENCEDOMAIN interntionl www.sciencedomin.org Estimtion of Binomil Distribution in the Light of Future

More information

Construction of Gauss Quadrature Rules

Construction of Gauss Quadrature Rules Jim Lmbers MAT 772 Fll Semester 2010-11 Lecture 15 Notes These notes correspond to Sections 10.2 nd 10.3 in the text. Construction of Guss Qudrture Rules Previously, we lerned tht Newton-Cotes qudrture

More information

Discrete Mathematics and Probability Theory Spring 2013 Anant Sahai Lecture 17

Discrete Mathematics and Probability Theory Spring 2013 Anant Sahai Lecture 17 EECS 70 Discrete Mthemtics nd Proility Theory Spring 2013 Annt Shi Lecture 17 I.I.D. Rndom Vriles Estimting the is of coin Question: We wnt to estimte the proportion p of Democrts in the US popultion,

More information

Lecture 19: Continuous Least Squares Approximation

Lecture 19: Continuous Least Squares Approximation Lecture 19: Continuous Lest Squres Approximtion 33 Continuous lest squres pproximtion We begn 31 with the problem of pproximting some f C[, b] with polynomil p P n t the discrete points x, x 1,, x m for

More information

Tutorial 4. b a. h(f) = a b a ln 1. b a dx = ln(b a) nats = log(b a) bits. = ln λ + 1 nats. = log e λ bits. = ln 1 2 ln λ + 1. nats. = ln 2e. bits.

Tutorial 4. b a. h(f) = a b a ln 1. b a dx = ln(b a) nats = log(b a) bits. = ln λ + 1 nats. = log e λ bits. = ln 1 2 ln λ + 1. nats. = ln 2e. bits. Tutoril 4 Exercises on Differentil Entropy. Evlute the differentil entropy h(x) f ln f for the following: () The uniform distribution, f(x) b. (b) The exponentil density, f(x) λe λx, x 0. (c) The Lplce

More information

Quantum Physics II (8.05) Fall 2013 Assignment 2

Quantum Physics II (8.05) Fall 2013 Assignment 2 Quntum Physics II (8.05) Fll 2013 Assignment 2 Msschusetts Institute of Technology Physics Deprtment Due Fridy September 20, 2013 September 13, 2013 3:00 pm Suggested Reding Continued from lst week: 1.

More information

( dg. ) 2 dt. + dt. dt j + dh. + dt. r(t) dt. Comparing this equation with the one listed above for the length of see that

( dg. ) 2 dt. + dt. dt j + dh. + dt. r(t) dt. Comparing this equation with the one listed above for the length of see that Arc Length of Curves in Three Dimensionl Spce If the vector function r(t) f(t) i + g(t) j + h(t) k trces out the curve C s t vries, we cn mesure distnces long C using formul nerly identicl to one tht we

More information

P 3 (x) = f(0) + f (0)x + f (0) 2. x 2 + f (0) . In the problem set, you are asked to show, in general, the n th order term is a n = f (n) (0)

P 3 (x) = f(0) + f (0)x + f (0) 2. x 2 + f (0) . In the problem set, you are asked to show, in general, the n th order term is a n = f (n) (0) 1 Tylor polynomils In Section 3.5, we discussed how to pproximte function f(x) round point in terms of its first derivtive f (x) evluted t, tht is using the liner pproximtion f() + f ()(x ). We clled this

More information

. Double-angle formulas. Your answer should involve trig functions of θ, and not of 2θ. cos(2θ) = sin(2θ) =.

. Double-angle formulas. Your answer should involve trig functions of θ, and not of 2θ. cos(2θ) = sin(2θ) =. Review of some needed Trig Identities for Integrtion Your nswers should be n ngle in RADIANS rccos( 1 2 ) = rccos( - 1 2 ) = rcsin( 1 2 ) = rcsin( - 1 2 ) = Cn you do similr problems? Review of Bsic Concepts

More information

Math 520 Final Exam Topic Outline Sections 1 3 (Xiao/Dumas/Liaw) Spring 2008

Math 520 Final Exam Topic Outline Sections 1 3 (Xiao/Dumas/Liaw) Spring 2008 Mth 520 Finl Exm Topic Outline Sections 1 3 (Xio/Dums/Liw) Spring 2008 The finl exm will be held on Tuesdy, My 13, 2-5pm in 117 McMilln Wht will be covered The finl exm will cover the mteril from ll of

More information

Numerical integration

Numerical integration 2 Numericl integrtion This is pge i Printer: Opque this 2. Introduction Numericl integrtion is problem tht is prt of mny problems in the economics nd econometrics literture. The orgniztion of this chpter

More information

. Double-angle formulas. Your answer should involve trig functions of θ, and not of 2θ. sin 2 (θ) =

. Double-angle formulas. Your answer should involve trig functions of θ, and not of 2θ. sin 2 (θ) = Review of some needed Trig. Identities for Integrtion. Your nswers should be n ngle in RADIANS. rccos( 1 ) = π rccos( - 1 ) = 2π 2 3 2 3 rcsin( 1 ) = π rcsin( - 1 ) = -π 2 6 2 6 Cn you do similr problems?

More information

Numerical Analysis: Trapezoidal and Simpson s Rule

Numerical Analysis: Trapezoidal and Simpson s Rule nd Simpson s Mthemticl question we re interested in numericlly nswering How to we evlute I = f (x) dx? Clculus tells us tht if F(x) is the ntiderivtive of function f (x) on the intervl [, b], then I =

More information

Partial Derivatives. Limits. For a single variable function f (x), the limit lim

Partial Derivatives. Limits. For a single variable function f (x), the limit lim Limits Prtil Derivtives For single vrible function f (x), the limit lim x f (x) exists only if the right-hnd side limit equls to the left-hnd side limit, i.e., lim f (x) = lim f (x). x x + For two vribles

More information

Reinforcement learning II

Reinforcement learning II CS 1675 Introduction to Mchine Lerning Lecture 26 Reinforcement lerning II Milos Huskrecht milos@cs.pitt.edu 5329 Sennott Squre Reinforcement lerning Bsics: Input x Lerner Output Reinforcement r Critic

More information

Discrete Mathematics and Probability Theory Summer 2014 James Cook Note 17

Discrete Mathematics and Probability Theory Summer 2014 James Cook Note 17 CS 70 Discrete Mthemtics nd Proility Theory Summer 2014 Jmes Cook Note 17 I.I.D. Rndom Vriles Estimting the is of coin Question: We wnt to estimte the proportion p of Democrts in the US popultion, y tking

More information

Math& 152 Section Integration by Parts

Math& 152 Section Integration by Parts Mth& 5 Section 7. - Integrtion by Prts Integrtion by prts is rule tht trnsforms the integrl of the product of two functions into other (idelly simpler) integrls. Recll from Clculus I tht given two differentible

More information

Math 20C Multivariable Calculus Lecture 5 1. Lines and planes. Equations of lines (Vector, parametric, and symmetric eqs.). Equations of lines

Math 20C Multivariable Calculus Lecture 5 1. Lines and planes. Equations of lines (Vector, parametric, and symmetric eqs.). Equations of lines Mt 2C Multivrible Clculus Lecture 5 1 Lines nd plnes Slide 1 Equtions of lines (Vector, prmetric, nd symmetric eqs.). Equtions of plnes. Distnce from point to plne. Equtions of lines Slide 2 Definition

More information

Tests for the Ratio of Two Poisson Rates

Tests for the Ratio of Two Poisson Rates Chpter 437 Tests for the Rtio of Two Poisson Rtes Introduction The Poisson probbility lw gives the probbility distribution of the number of events occurring in specified intervl of time or spce. The Poisson

More information

Chapter 5 : Continuous Random Variables

Chapter 5 : Continuous Random Variables STAT/MATH 395 A - PROBABILITY II UW Winter Qurter 216 Néhémy Lim Chpter 5 : Continuous Rndom Vribles Nottions. N {, 1, 2,...}, set of nturl numbers (i.e. ll nonnegtive integers); N {1, 2,...}, set of ll

More information

1 Linear Least Squares

1 Linear Least Squares Lest Squres Pge 1 1 Liner Lest Squres I will try to be consistent in nottion, with n being the number of dt points, nd m < n being the number of prmeters in model function. We re interested in solving

More information

Section 17.2 Line Integrals

Section 17.2 Line Integrals Section 7. Line Integrls Integrting Vector Fields nd Functions long urve In this section we consider the problem of integrting functions, both sclr nd vector (vector fields) long curve in the plne. We

More information

MAC-solutions of the nonexistent solutions of mathematical physics

MAC-solutions of the nonexistent solutions of mathematical physics Proceedings of the 4th WSEAS Interntionl Conference on Finite Differences - Finite Elements - Finite Volumes - Boundry Elements MAC-solutions of the nonexistent solutions of mthemticl physics IGO NEYGEBAUE

More information

Quantum Physics I (8.04) Spring 2016 Assignment 8

Quantum Physics I (8.04) Spring 2016 Assignment 8 Quntum Physics I (8.04) Spring 206 Assignment 8 MIT Physics Deprtment Due Fridy, April 22, 206 April 3, 206 2:00 noon Problem Set 8 Reding: Griffiths, pges 73-76, 8-82 (on scttering sttes). Ohnin, Chpter

More information

New Expansion and Infinite Series

New Expansion and Infinite Series Interntionl Mthemticl Forum, Vol. 9, 204, no. 22, 06-073 HIKARI Ltd, www.m-hikri.com http://dx.doi.org/0.2988/imf.204.4502 New Expnsion nd Infinite Series Diyun Zhng College of Computer Nnjing University

More information

A NOTE ON ESTIMATION OF THE GLOBAL INTENSITY OF A CYCLIC POISSON PROCESS IN THE PRESENCE OF LINEAR TREND

A NOTE ON ESTIMATION OF THE GLOBAL INTENSITY OF A CYCLIC POISSON PROCESS IN THE PRESENCE OF LINEAR TREND A NOTE ON ESTIMATION OF THE GLOBAL INTENSITY OF A CYCLIC POISSON PROCESS IN THE PRESENCE OF LINEAR TREND I WAYAN MANGKU Deprtment of Mthemtics, Fculty of Mthemtics nd Nturl Sciences, Bogor Agriculturl

More information

Student Activity 3: Single Factor ANOVA

Student Activity 3: Single Factor ANOVA MATH 40 Student Activity 3: Single Fctor ANOVA Some Bsic Concepts In designed experiment, two or more tretments, or combintions of tretments, is pplied to experimentl units The number of tretments, whether

More information

Classification Part 4. Model Evaluation

Classification Part 4. Model Evaluation Clssifiction Prt 4 Dr. Snjy Rnk Professor Computer nd Informtion Science nd Engineering University of Florid, Ginesville Model Evlution Metrics for Performnce Evlution How to evlute the performnce of model

More information

Heavy tail and stable distributions

Heavy tail and stable distributions Hevy til nd stle distriutions J.K. Misiewicz Deprtment of Mthemtics nd Informtion Science Technicl University of Wrsw X or its distriution hs hevy til if E(X ) =. X or its distriution hs hevy til of order

More information

Research on Modeling and Compensating Method of Random Drift of MEMS Gyroscope

Research on Modeling and Compensating Method of Random Drift of MEMS Gyroscope 01 4th Interntionl Conference on Signl Processing Systems (ICSPS 01) IPCSIT vol. 58 (01) (01) IACSIT Press, Singpore DOI: 10.7763/IPCSIT.01.V58.9 Reserch on Modeling nd Compensting Method of Rndom Drift

More information

Optimal Experiment Design with Diffuse Prior Information

Optimal Experiment Design with Diffuse Prior Information Optiml Experiment Design with Diffuse Prior Informtion Cristin R. Rojs Grhm C. Goodwin Jmes S. Welsh Arie Feuer Abstrct In system identifiction one lwys ims to lern s much s possible bout system from given

More information

Lecture 3 Gaussian Probability Distribution

Lecture 3 Gaussian Probability Distribution Introduction Lecture 3 Gussin Probbility Distribution Gussin probbility distribution is perhps the most used distribution in ll of science. lso clled bell shped curve or norml distribution Unlike the binomil

More information

Solution for Assignment 1 : Intro to Probability and Statistics, PAC learning

Solution for Assignment 1 : Intro to Probability and Statistics, PAC learning Solution for Assignment 1 : Intro to Probbility nd Sttistics, PAC lerning 10-701/15-781: Mchine Lerning (Fll 004) Due: Sept. 30th 004, Thursdy, Strt of clss Question 1. Bsic Probbility ( 18 pts) 1.1 (

More information

Reversals of Signal-Posterior Monotonicity for Any Bounded Prior

Reversals of Signal-Posterior Monotonicity for Any Bounded Prior Reversls of Signl-Posterior Monotonicity for Any Bounded Prior Christopher P. Chmbers Pul J. Hely Abstrct Pul Milgrom (The Bell Journl of Economics, 12(2): 380 391) showed tht if the strict monotone likelihood

More information

Massachusetts Institute of Technology Quantum Mechanics I (8.04) Spring 2005 Solutions to Problem Set 6

Massachusetts Institute of Technology Quantum Mechanics I (8.04) Spring 2005 Solutions to Problem Set 6 Msschusetts Institute of Technology Quntum Mechnics I (8.) Spring 5 Solutions to Problem Set 6 By Kit Mtn. Prctice with delt functions ( points) The Dirc delt function my be defined s such tht () (b) 3

More information

Recitation 3: More Applications of the Derivative

Recitation 3: More Applications of the Derivative Mth 1c TA: Pdric Brtlett Recittion 3: More Applictions of the Derivtive Week 3 Cltech 2012 1 Rndom Question Question 1 A grph consists of the following: A set V of vertices. A set E of edges where ech

More information

= a. P( X µ X a) σ2 X a 2. = σ2 X

= a. P( X µ X a) σ2 X a 2. = σ2 X Co902 problem sheet, solutions. () (Mrkov inequlity) LetX be continuous, non-negtive rndom vrible (RV) ndpositive constnt. Show tht: P(X ) E[X] Solution: Let p(x) represent the pdf of RVX. Then: E[X] =

More information

Chapter 3. Vector Spaces

Chapter 3. Vector Spaces 3.4 Liner Trnsformtions 1 Chpter 3. Vector Spces 3.4 Liner Trnsformtions Note. We hve lredy studied liner trnsformtions from R n into R m. Now we look t liner trnsformtions from one generl vector spce

More information

Hidden Markov Models

Hidden Markov Models Hidden Mrkov Models Huptseminr Mchine Lerning 18.11.2003 Referent: Nikols Dörfler 1 Overview Mrkov Models Hidden Mrkov Models Types of Hidden Mrkov Models Applictions using HMMs Three centrl problems:

More information

Higher Checklist (Unit 3) Higher Checklist (Unit 3) Vectors

Higher Checklist (Unit 3) Higher Checklist (Unit 3) Vectors Vectors Skill Achieved? Know tht sclr is quntity tht hs only size (no direction) Identify rel-life exmples of sclrs such s, temperture, mss, distnce, time, speed, energy nd electric chrge Know tht vector

More information

AP Calculus AB Unit 4 Assessment

AP Calculus AB Unit 4 Assessment Clss: Dte: 0-04 AP Clulus AB Unit 4 Assessment Multiple Choie Identify the hoie tht best ompletes the sttement or nswers the question. A lultor my NOT be used on this prt of the exm. (6 minutes). The slope

More information

The steps of the hypothesis test

The steps of the hypothesis test ttisticl Methods I (EXT 7005) Pge 78 Mosquito species Time of dy A B C Mid morning 0.0088 5.4900 5.5000 Mid Afternoon.3400 0.0300 0.8700 Dusk 0.600 5.400 3.000 The Chi squre test sttistic is the sum of

More information

CS667 Lecture 6: Monte Carlo Integration 02/10/05

CS667 Lecture 6: Monte Carlo Integration 02/10/05 CS667 Lecture 6: Monte Crlo Integrtion 02/10/05 Venkt Krishnrj Lecturer: Steve Mrschner 1 Ide The min ide of Monte Crlo Integrtion is tht we cn estimte the vlue of n integrl by looking t lrge number of

More information

Normal Distribution. Lecture 6: More Binomial Distribution. Properties of the Unit Normal Distribution. Unit Normal Distribution

Normal Distribution. Lecture 6: More Binomial Distribution. Properties of the Unit Normal Distribution. Unit Normal Distribution Norml Distribution Lecture 6: More Binomil Distribution If X is rndom vrible with norml distribution with men µ nd vrince σ 2, X N (µ, σ 2, then P(X = x = f (x = 1 e 1 (x µ 2 2 σ 2 σ Sttistics 104 Colin

More information

Math Week 5 concepts and homework, due Friday February 10

Math Week 5 concepts and homework, due Friday February 10 Mt 2280-00 Week 5 concepts nd omework, due Fridy Februry 0 Recll tt ll problems re good for seeing if you cn work wit te underlying concepts; tt te underlined problems re to be nded in; nd tt te Fridy

More information

A signalling model of school grades: centralized versus decentralized examinations

A signalling model of school grades: centralized versus decentralized examinations A signlling model of school grdes: centrlized versus decentrlized exmintions Mri De Pol nd Vincenzo Scopp Diprtimento di Economi e Sttistic, Università dell Clbri m.depol@unicl.it; v.scopp@unicl.it 1 The

More information

STRUCTURED COVARIANCE MATRIX ESTIMATION FOR THE RANGE-DEPENDENT PROBLEM IN STAP

STRUCTURED COVARIANCE MATRIX ESTIMATION FOR THE RANGE-DEPENDENT PROBLEM IN STAP STRUCTURED COVARIANCE MATRIX ESTIMATION FOR THE RANGE-DEPENDENT PROBLEM IN STAP Xvier Neyt, Pscl Druyts, nd Mrc Acheroy Dept. of Electricl Engineering Royl Militry Acdemy Brussels, Belgium Xvier.Neyt@rm.c.be

More information

Testing categorized bivariate normality with two-stage. polychoric correlation estimates

Testing categorized bivariate normality with two-stage. polychoric correlation estimates Testing ctegorized bivrite normlity with two-stge polychoric correltion estimtes Albert Mydeu-Olivres Dept. of Psychology University of Brcelon Address correspondence to: Albert Mydeu-Olivres. Fculty of

More information

decoder t the coecient level, s opposed to the bit level, so it is fundmentlly dierent from schemes tht use informtion bout the trnsmitted dt to produ

decoder t the coecient level, s opposed to the bit level, so it is fundmentlly dierent from schemes tht use informtion bout the trnsmitted dt to produ To pper in Proceedings of IEEE Dt Compression Conference 998 Lucent Technologies -- PROPRIETARY Optiml Multiple Description Trnsform Coding of Gussin Vectors Vivek K Goyl Dept. of Elec. Eng. & Comp. Sci.

More information

Estimation on Monotone Partial Functional Linear Regression

Estimation on Monotone Partial Functional Linear Regression A^VÇÚO 1 33 ò 1 4 Ï 217 c 8 Chinese Journl of Applied Probbility nd Sttistics Aug., 217, Vol. 33, No. 4, pp. 433-44 doi: 1.3969/j.issn.11-4268.217.4.8 Estimtion on Monotone Prtil Functionl Liner Regression

More information

CBE 291b - Computation And Optimization For Engineers

CBE 291b - Computation And Optimization For Engineers The University of Western Ontrio Fculty of Engineering Science Deprtment of Chemicl nd Biochemicl Engineering CBE 9b - Computtion And Optimiztion For Engineers Mtlb Project Introduction Prof. A. Jutn Jn

More information

Bootstrap Inference in a Linear Equation Estimated by Instrumental Variables

Bootstrap Inference in a Linear Equation Estimated by Instrumental Variables Bootstrp Inference in Liner Eqution Estimted by Instrumentl Vribles GREQAM Centre de l Vieille Chrité 2 rue de l Chrité 13236 Mrseille cedex 02, Frnce Russell Dvidson emil: RussellDvidson@mcgillc nd Jmes

More information

ECON 331 Lecture Notes: Ch 4 and Ch 5

ECON 331 Lecture Notes: Ch 4 and Ch 5 Mtrix Algebr ECON 33 Lecture Notes: Ch 4 nd Ch 5. Gives us shorthnd wy of writing lrge system of equtions.. Allows us to test for the existnce of solutions to simultneous systems. 3. Allows us to solve

More information

AMATH 731: Applied Functional Analysis Fall Additional notes on Fréchet derivatives

AMATH 731: Applied Functional Analysis Fall Additional notes on Fréchet derivatives AMATH 731: Applied Functionl Anlysis Fll 214 Additionl notes on Fréchet derivtives (To ccompny Section 3.1 of the AMATH 731 Course Notes) Let X,Y be normed liner spces. The Fréchet derivtive of n opertor

More information

PHY4605 Introduction to Quantum Mechanics II Spring 2005 Final exam SOLUTIONS April 22, 2005

PHY4605 Introduction to Quantum Mechanics II Spring 2005 Final exam SOLUTIONS April 22, 2005 . Short Answer. PHY4605 Introduction to Quntum Mechnics II Spring 005 Finl exm SOLUTIONS April, 005 () Write the expression ψ ψ = s n explicit integrl eqution in three dimensions, ssuming tht ψ represents

More information

Part IB Numerical Analysis

Part IB Numerical Analysis Prt IB Numericl Anlysis Theorems with proof Bsed on lectures by G. Moore Notes tken by Dexter Chu Lent 2016 These notes re not endorsed by the lecturers, nd I hve modified them (often significntly) fter

More information

8 Laplace s Method and Local Limit Theorems

8 Laplace s Method and Local Limit Theorems 8 Lplce s Method nd Locl Limit Theorems 8. Fourier Anlysis in Higher DImensions Most of the theorems of Fourier nlysis tht we hve proved hve nturl generliztions to higher dimensions, nd these cn be proved

More information

1B40 Practical Skills

1B40 Practical Skills B40 Prcticl Skills Comining uncertinties from severl quntities error propgtion We usully encounter situtions where the result of n experiment is given in terms of two (or more) quntities. We then need

More information

Section 5.4 Fundamental Theorem of Calculus 2 Lectures. Dr. Abdulla Eid. College of Science. MATHS 101: Calculus 1

Section 5.4 Fundamental Theorem of Calculus 2 Lectures. Dr. Abdulla Eid. College of Science. MATHS 101: Calculus 1 Section 5.4 Fundmentl Theorem of Clculus 2 Lectures College of Science MATHS : Clculus (University of Bhrin) Integrls / 24 Definite Integrl Recll: The integrl is used to find re under the curve over n

More information

1 Probability Density Functions

1 Probability Density Functions Lis Yn CS 9 Continuous Distributions Lecture Notes #9 July 6, 28 Bsed on chpter by Chris Piech So fr, ll rndom vribles we hve seen hve been discrete. In ll the cses we hve seen in CS 9, this ment tht our

More information

7.2 The Definite Integral

7.2 The Definite Integral 7.2 The Definite Integrl the definite integrl In the previous section, it ws found tht if function f is continuous nd nonnegtive, then the re under the grph of f on [, b] is given by F (b) F (), where

More information

ODE: Existence and Uniqueness of a Solution

ODE: Existence and Uniqueness of a Solution Mth 22 Fll 213 Jerry Kzdn ODE: Existence nd Uniqueness of Solution The Fundmentl Theorem of Clculus tells us how to solve the ordinry differentil eqution (ODE) du = f(t) dt with initil condition u() =

More information

Week 10: Riemann integral and its properties

Week 10: Riemann integral and its properties Clculus nd Liner Algebr for Biomedicl Engineering Week 10: Riemnn integrl nd its properties H. Führ, Lehrstuhl A für Mthemtik, RWTH Achen, WS 07 Motivtion: Computing flow from flow rtes 1 We observe the

More information

PHYS 4390: GENERAL RELATIVITY LECTURE 6: TENSOR CALCULUS

PHYS 4390: GENERAL RELATIVITY LECTURE 6: TENSOR CALCULUS PHYS 4390: GENERAL RELATIVITY LECTURE 6: TENSOR CALCULUS To strt on tensor clculus, we need to define differentition on mnifold.a good question to sk is if the prtil derivtive of tensor tensor on mnifold?

More information

Georgia State University. Georgia State University. Jing Wang Georgia State University. Fall

Georgia State University. Georgia State University. Jing Wang Georgia State University. Fall Georgi Stte University ScholrWorks @ Georgi Stte University Mthemtics Disserttions Deprtment of Mthemtics nd Sttistics Fll 12-2016 Functionl Principl Component Anlysis for Discretely Observed Functionl

More information

Best Approximation in the 2-norm

Best Approximation in the 2-norm Jim Lmbers MAT 77 Fll Semester 1-11 Lecture 1 Notes These notes correspond to Sections 9. nd 9.3 in the text. Best Approximtion in the -norm Suppose tht we wish to obtin function f n (x) tht is liner combintion

More information

Driving Cycle Construction of City Road for Hybrid Bus Based on Markov Process Deng Pan1, a, Fengchun Sun1,b*, Hongwen He1, c, Jiankun Peng1, d

Driving Cycle Construction of City Road for Hybrid Bus Based on Markov Process Deng Pan1, a, Fengchun Sun1,b*, Hongwen He1, c, Jiankun Peng1, d Interntionl Industril Informtics nd Computer Engineering Conference (IIICEC 15) Driving Cycle Construction of City Rod for Hybrid Bus Bsed on Mrkov Process Deng Pn1,, Fengchun Sun1,b*, Hongwen He1, c,

More information

Hybrid Digital-Analog Coding for Interference Broadcast Channels

Hybrid Digital-Analog Coding for Interference Broadcast Channels Hybrid Digitl-Anlog Coding for Interference Brodcst Chnnels Ahmd Abou Sleh, Fdy Aljji, nd Wi-Yip Chn Queen s University, ingston, O, 7L 36 Emil: hmd.bou.sleh@queensu.c, fdy@mst.queensu.c, chn@queensu.c

More information

Lecture 14 Numerical integration: advanced topics

Lecture 14 Numerical integration: advanced topics Lecture 14 Numericl integrtion: dvnced topics Weinn E 1,2 nd Tiejun Li 2 1 Deprtment of Mthemtics, Princeton University, weinn@princeton.edu 2 School of Mthemticl Sciences, Peking University, tieli@pku.edu.cn

More information

Lecture 14: Quadrature

Lecture 14: Quadrature Lecture 14: Qudrture This lecture is concerned with the evlution of integrls fx)dx 1) over finite intervl [, b] The integrnd fx) is ssumed to be rel-vlues nd smooth The pproximtion of n integrl by numericl

More information

Topic 6b Finite Difference Approximations

Topic 6b Finite Difference Approximations /8/8 Course Instructor Dr. Rymond C. Rump Oice: A 7 Pone: (95) 747 6958 E Mil: rcrump@utep.edu Topic 6b Finite Dierence Approximtions EE 486/5 Computtionl Metods in EE Outline Wt re inite dierence pproximtions?

More information

Definite integral. Mathematics FRDIS MENDELU

Definite integral. Mathematics FRDIS MENDELU Definite integrl Mthemtics FRDIS MENDELU Simon Fišnrová Brno 1 Motivtion - re under curve Suppose, for simplicity, tht y = f(x) is nonnegtive nd continuous function defined on [, b]. Wht is the re of the

More information

Lecture 8 Characteristic Functions

Lecture 8 Characteristic Functions Lecture 8: Chrcteristic Functions of 9 Course: Theory of Probbility I Term: Fll 203 Instructor: Gordn Zitkovic Lecture 8 Chrcteristic Functions First properties A chrcteristic function is simply the Fourier

More information

Information processing via physical soft body. Supplementary Information

Information processing via physical soft body. Supplementary Information Informtion processing vi physicl soft body Supplementry Informtion Kohei Nkjim 1, Helmut Huser 2, o Li 3, Rolf Pfeifer 4,5 1 he Hkubi Center for Advnced Reserch & Grdute School of Informtics, Kyoto University,

More information

The use of a so called graphing calculator or programmable calculator is not permitted. Simple scientific calculators are allowed.

The use of a so called graphing calculator or programmable calculator is not permitted. Simple scientific calculators are allowed. ERASMUS UNIVERSITY ROTTERDAM Informtion concerning the Entrnce exmintion Mthemtics level 1 for Interntionl Bchelor in Communiction nd Medi Generl informtion Avilble time: 2 hours 30 minutes. The exmintion

More information

The Velocity Factor of an Insulated Two-Wire Transmission Line

The Velocity Factor of an Insulated Two-Wire Transmission Line The Velocity Fctor of n Insulted Two-Wire Trnsmission Line Problem Kirk T. McDonld Joseph Henry Lbortories, Princeton University, Princeton, NJ 08544 Mrch 7, 008 Estimte the velocity fctor F = v/c nd the

More information

Definite integral. Mathematics FRDIS MENDELU. Simona Fišnarová (Mendel University) Definite integral MENDELU 1 / 30

Definite integral. Mathematics FRDIS MENDELU. Simona Fišnarová (Mendel University) Definite integral MENDELU 1 / 30 Definite integrl Mthemtics FRDIS MENDELU Simon Fišnrová (Mendel University) Definite integrl MENDELU / Motivtion - re under curve Suppose, for simplicity, tht y = f(x) is nonnegtive nd continuous function

More information

TABLE OF CONTENTS 3 CHAPTER 1

TABLE OF CONTENTS 3 CHAPTER 1 TABLE OF CONTENTS 3 CHAPTER 1 Set Lnguge & Nottion 3 CHAPTER 2 Functions 3 CHAPTER 3 Qudrtic Functions 4 CHAPTER 4 Indices & Surds 4 CHAPTER 5 Fctors of Polynomils 4 CHAPTER 6 Simultneous Equtions 4 CHAPTER

More information

Best Approximation. Chapter The General Case

Best Approximation. Chapter The General Case Chpter 4 Best Approximtion 4.1 The Generl Cse In the previous chpter, we hve seen how n interpolting polynomil cn be used s n pproximtion to given function. We now wnt to find the best pproximtion to given

More information

ES 111 Mathematical Methods in the Earth Sciences Lecture Outline 1 - Thurs 28th Sept 17 Review of trigonometry and basic calculus

ES 111 Mathematical Methods in the Earth Sciences Lecture Outline 1 - Thurs 28th Sept 17 Review of trigonometry and basic calculus ES 111 Mthemticl Methods in the Erth Sciences Lecture Outline 1 - Thurs 28th Sept 17 Review of trigonometry nd bsic clculus Trigonometry When is it useful? Everywhere! Anything involving coordinte systems

More information

Math 190 Chapter 5 Lecture Notes. Professor Miguel Ornelas

Math 190 Chapter 5 Lecture Notes. Professor Miguel Ornelas Mth 19 Chpter 5 Lecture Notes Professor Miguel Ornels 1 M. Ornels Mth 19 Lecture Notes Section 5.1 Section 5.1 Ares nd Distnce Definition The re A of the region S tht lies under the grph of the continuous

More information

Generalized Fano and non-fano networks

Generalized Fano and non-fano networks Generlized Fno nd non-fno networks Nildri Ds nd Brijesh Kumr Ri Deprtment of Electronics nd Electricl Engineering Indin Institute of Technology Guwhti, Guwhti, Assm, Indi Emil: {d.nildri, bkri}@iitg.ernet.in

More information

1. Gauss-Jacobi quadrature and Legendre polynomials. p(t)w(t)dt, p {p(x 0 ),...p(x n )} p(t)w(t)dt = w k p(x k ),

1. Gauss-Jacobi quadrature and Legendre polynomials. p(t)w(t)dt, p {p(x 0 ),...p(x n )} p(t)w(t)dt = w k p(x k ), 1. Guss-Jcobi qudrture nd Legendre polynomils Simpson s rule for evluting n integrl f(t)dt gives the correct nswer with error of bout O(n 4 ) (with constnt tht depends on f, in prticulr, it depends on

More information

Math 115 ( ) Yum-Tong Siu 1. Lagrange Multipliers and Variational Problems with Constraints. F (x,y,y )dx

Math 115 ( ) Yum-Tong Siu 1. Lagrange Multipliers and Variational Problems with Constraints. F (x,y,y )dx Mth 5 2006-2007) Yum-Tong Siu Lgrnge Multipliers nd Vritionl Problems with Constrints Integrl Constrints. Consider the vritionl problem of finding the extremls for the functionl J[y] = F x,y,y )dx with

More information

Lecture 20: Numerical Integration III

Lecture 20: Numerical Integration III cs4: introduction to numericl nlysis /8/0 Lecture 0: Numericl Integrtion III Instructor: Professor Amos Ron Scribes: Mrk Cowlishw, Yunpeng Li, Nthnel Fillmore For the lst few lectures we hve discussed

More information

4.1. Probability Density Functions

4.1. Probability Density Functions STT 1 4.1-4. 4.1. Proility Density Functions Ojectives. Continuous rndom vrile - vers - discrete rndom vrile. Proility density function. Uniform distriution nd its properties. Expected vlue nd vrince of

More information

Calculus and linear algebra for biomedical engineering Week 11: The Riemann integral and its properties

Calculus and linear algebra for biomedical engineering Week 11: The Riemann integral and its properties Clculus nd liner lgebr for biomedicl engineering Week 11: The Riemnn integrl nd its properties Hrtmut Führ fuehr@mth.rwth-chen.de Lehrstuhl A für Mthemtik, RWTH Achen Jnury 9, 2009 Overview 1 Motivtion:

More information

Multivariate problems and matrix algebra

Multivariate problems and matrix algebra University of Ferrr Stefno Bonnini Multivrite problems nd mtrix lgebr Multivrite problems Multivrite sttisticl nlysis dels with dt contining observtions on two or more chrcteristics (vribles) ech mesured

More information

Stein-Rule Estimation and Generalized Shrinkage Methods for Forecasting Using Many Predictors

Stein-Rule Estimation and Generalized Shrinkage Methods for Forecasting Using Many Predictors Stein-Rule Estimtion nd Generlized Shrinkge Methods for Forecsting Using Mny Predictors Eric Hillebrnd CREATES Arhus University, Denmrk ehillebrnd@cretes.u.dk Te-Hwy Lee University of Cliforni, Riverside

More information