Applications of Sequence Classifiers. Learning Sequence Classifiers. Simple Model - Markov Chains. Markov models (Markov Chains)

Size: px
Start display at page:

Download "Applications of Sequence Classifiers. Learning Sequence Classifiers. Simple Model - Markov Chains. Markov models (Markov Chains)"

Transcription

1 Learnng Sequence Classfers pplcans f Sequence Classfers Oulne pplcans f sequence classfcan ag f wrds, n-grams, and relaed mdels Markv mdels Hdden Markv mdels Hgher rder Markv mdels Varans n Hdden Markv Mdels pplcans Speech recgnn Naural language prcessng e prcessng Gesure recgnn lgcal sequence analyss gene denfcan pren classfcan 4/0/003 Cm S 573 Machne Learnng Sprng 003. Cpyrgh Vasan Hnavar 4/0/003 Cm S 573 Machne Learnng Sprng 003. Cpyrgh Vasan Hnavar ag f wrds, n-grams and relaed mdels ag f wrds, n-grams and relaed mdels Map arbrary lengh sequences fed lengh feaure represenans ag f wrds represen sequences by feaure vecrs wh as many cmpnens as here are wrds n he vcabulary n-grams shr subsequences f n leers Ignre relave rderng f wrds r n-grams alng he sequence ca chased he muse and muse chased he ca have dencal bag f wrds represenans Fed lengh feaure represenans make pssble apply machne learnng mehds ha wrk wh feaure-based represenans Feaures Gven (as n he case f wrds Englsh vcabulary) Dscvered frm daa cmpue sascs f ccurrence f n-grams n daa If varable lengh n-grams are allwed, need ake n accun pssble verlaps Cmpuan f n-gram frequences can be made effcen usng dynamc prgrammng f a srng appears k mes n a pece f e, any subsrng f he srng appears a leas k mes n he e 4/0/003 Cm S 573 Machne Learnng Sprng 003. Cpyrgh Vasan Hnavar 3 4/0/003 Cm S 573 Machne Learnng Sprng 003. Cpyrgh Vasan Hnavar 4 Markv mdels (Markv Chans) Markv mdel s a prbablsc mdel f symbl sequences n whch he prbably f he curren even s depends nly n he mmedaely precedng even. Cnsder a sequence f randm varables,,, N. hnk f he subscrps as ndcang wrd psn n a senence r a leer psn n a sequence Recall ha a randm varable s a funcn In he case f senences made f wrds, he range f he randm varables s he vcabulary f he language. In he case f DN sequences, he randm varables ake n values frm a 4-leer alphabe {, C, G, } Smple Mdel - Markv Chans Markv Prpery: he sae f he sysem a me + nly depends n he sae f he sysem a me P[ + P[ + + +, ] - -,...,, ] 4/0/003 Cm S 573 Machne Learnng Sprng 003. Cpyrgh Vasan Hnavar 5 4/0/003 Cm S 573 Machne Learnng Sprng 003. Cpyrgh Vasan Hnavar 6

2 Markv chans he fac ha subscrp appears n bh he and he n s a b abusve f nan. I mgh be beer wre: P ( s, s,..., s ) where { v... v } Range ( ) s In wha fllws, we wll abuse nan L Markv Chans Sanary -- Prbables are ndependen f when he prcess s sanary. P[ ] a + hs means ha f sysem s n sae, he prbably ha he sysem wll ransn sae s p regardless f he value f 4/0/003 Cm S 573 Machne Learnng Sprng 003. Cpyrgh Vasan Hnavar 7 4/0/003 Cm S 573 Machne Learnng Sprng 003. Cpyrgh Vasan Hnavar Descrbng a Markv Chan he fundamenal quesns Markv chan can be descrbed by he ransn mar and nal sae prbables Q: a ) + q ), K, ) ) ) ) q P ( K (, ) + Lkelhd Gven a mdel µ (,Q), hw can we effcenly cmpue he lkelhd f an bservan P ( µ )? Fr any sae sequence (,, ): (,..., ) q a a La P 3 Learnng Gven a se f bservan sequences, and a generc mdel, hw can we esmae he parameers ha defne he bes mdel descrbe he daa? Use sandard esman mehds mamum lkelhd r ayesan esmaes dscussed earler n he curse 4/0/003 Cm S 573 Machne Learnng Sprng 003. Cpyrgh Vasan Hnavar 4/0/003 Cm S 573 Machne Learnng Sprng 003. Cpyrgh Vasan Hnavar 0 Smple Eample f a Markv mdel Weaher ranng day ran mrrw a rr 4 ranng day n ran mrrw a rn 6 n ranng day ran mrrw a nr n ranng day n ran mrrw a rr 4/0/003 Cm S 573 Machne Learnng Sprng 003. Cpyrgh Vasan Hnavar Smple Eample f a Markv mdel Q 7 Ne ha bh he ransn mar and he nal sae mar are Schasc Marces (rws sum ) Ne ha n general, he ransn prbables beween w saes need n be symmerc ( a a ) and he prbably f ransn frm a sae self ( a ) need n be zer 4/0/003 Cm S 573 Machne Learnng Sprng 003. Cpyrgh Vasan Hnavar

3 ypes f Markv mdels Ergdc mdels Ergdc mdel - Srngly cnneced dreced pah wh psve prbables frm each sae each sae (bu n necessarly a cmplee dreced graph). ha s, fr all, a >0; a >0 ypes f Mdels LR mdels Lef--Rgh (LR) mdel -- Inde f sae nndecreasng wh me 4/0/003 Cm S 573 Machne Learnng Sprng 003. Cpyrgh Vasan Hnavar 3 4/0/003 Cm S 573 Machne Learnng Sprng 003. Cpyrgh Vasan Hnavar 4 Markv mdels wh absrbng saes each play Gambler wns $ wh prbably p r Gambler lses $ wh prbably -p Game ends when gambler ges brke, r gans a frune f $00 -- h $0 and $00 are absrbng saes p p p p 0 N- N -p -p -p -p Sar (0$) 4/0/003 Cm S 573 Machne Learnng Sprng 003. Cpyrgh Vasan Hnavar 5 Cke vs. Peps Gven ha a persn s las cla purchase was Cke, here s a 0% chance ha her ne cla purchase wll als be Cke. If a persn s las cla purchase was Peps, here s an 0% chance ha her ne cla purchase wll als be Peps. cke peps 4/0/003 Cm S 573 Machne Learnng Sprng 003. Cpyrgh Vasan Hnavar 6 Cke vs. Peps Gven ha a persn s currenly a Peps purchaser, wha s he prbably ha she wll purchase Cke w purchases frm nw? he ransn mar s: (Crrespndng ne purchase ahead) /0/003 Cm S 573 Machne Learnng Sprng 003. Cpyrgh Vasan Hnavar 7 3 Cke vs. Peps Gven ha a persn s currenly a Cke drnker, wha s he prbably ha she wll purchase Peps hree purchases frm nw? /0/003 Cm S 573 Machne Learnng Sprng 003. Cpyrgh Vasan Hnavar

4 Cke vs. Peps ssume each persn makes ne cla purchase per week. Suppse 60% f all peple nw drnk Cke, and 40% drnk Peps. Wha fracn f peple wll be drnkng Cke hree weeks frm nw? Le (q 0,q )(6,4) be he nal prbables. We wll dene Cke by 0 and Peps by We wan fnd 3 0) ( 3) ( 3) ( 3) 3 0) qa0 q0a00 + qq /0/003 Cm S 573 Machne Learnng Sprng 003. Cpyrgh Vasan Hnavar a 00 Hdden Markv Mdels In many scenars saes cann be drecly bserved. We need an eensn -- Hdden Markv Mdels a a a 33 a 44 a a 3 a 34 b b b 4 b 3 b + b + b 3 + b 4, 4 b + b + b 3 + b 4, ec. 3 Observans a are sae ransn prbables. b k are bservan (upu) prbables. 4/0/003 Cm S 573 Machne Learnng Sprng 003. Cpyrgh Vasan Hnavar 0 Eample: Dshnes Casn Wha s an HMM? Wha s hdden n hs mdel? Sae sequences Yu are allwed see he ucme f a de rll Yu d n knw whch ucmes were baned by a far de and whch ucmes were baned by a laded de 4/0/003 Cm S 573 Machne Learnng Sprng 003. Cpyrgh Vasan Hnavar Green crcles are hdden saes Each hdden sae s dependen nly n he prevus sae: Markv prcess he pas s ndependen f he fuure gven he presen. 4/0/003 Cm S 573 Machne Learnng Sprng 003. Cpyrgh Vasan Hnavar Wha s an HMM? Specfyng HMM O O O Purple ndes are bserved saes Each bserved sae s dependen nly n he crrespndng hdden sae 4/0/003 Cm S 573 Machne Learnng Sprng 003. Cpyrgh Vasan Hnavar 3 {,O,,, } Π {π } ι are he nal sae prbables {a } are he sae ransn prbables {b k } are he bservan sae prbables 4/0/003 Cm S 573 Machne Learnng Sprng 003. Cpyrgh Vasan Hnavar 4

5 Fundamenal prblems Cn-ssng Eample Sar al / / / al /4 Far laded / 3/4 head head Lkelhd Cmpue he prbably f a gven bservan sequence gven a mdel Decdng Gven an bservan sequence, and a mdel, cmpue he ms lkely hdden sae sequence Learnng Gven an bservan sequence and se f pssble mdels, whch mdel ms clsely fs he daa? 4/0/003 Cm S 573 Machne Learnng Sprng 003. Cpyrgh Vasan Hnavar 5 L sses Far/Laded L- L O O O O L- OL Head/al Query: wha are he ms lkely values n he -ndes generae he gven daa? 4/0/003 Cm S 573 Machne Learnng Sprng 003. Cpyrgh Vasan Hnavar 6 Prbably f an Observan Sequence Prbably f an bservan sequence Gven an bservan sequence and a mdel, cmpue he prbably f he bservan sequence O (,..., ), µ (,, Π) Cmpue O µ ) 4/0/003 Cm S 573 Machne Learnng Sprng 003. Cpyrgh Vasan Hnavar 7 P... b ( O, µ ) b b - + µ ) π a a... a 3 P ( O, µ ) O, µ ) µ ) P ( O µ ) O, µ ) µ ) 4/0/003 Cm S 573 Machne Learnng Sprng 003. Cpyrgh Vasan Hnavar Prbably f an Observan Sequence Prbably f an bservan sequence O µ ) π b Π a b {... } 4/0/003 Cm S 573 Machne Learnng Sprng 003. Cpyrgh Vasan Hnavar Specal srucure gves us an effcen slun usng dynamc prgrammng. Inun Prbably f he frs bservans s he same fr all pssble + lengh sae sequences. Defne: α ( )..., µ ) 4/0/003 Cm S 573 Machne Learnng Sprng 003. Cpyrgh Vasan Hnavar 30

6 Frward Prcedure Frward Prcedure α ( +) P (... P (... P (... P (..., , ) ) P ( ) P ( ) P ( ) + + ) P ( ) 4/0/003 Cm S 573 Machne Learnng Sprng 003. Cpyrgh Vasan Hnavar 3 + )... N... N... N... N...,,..., , ) α ( ) a b ) ) ) ) ) ) ) 4/0/003 Cm S 573 Machne Learnng Sprng 003. Cpyrgh Vasan Hnavar 3 ackward Prcedure Sequence prbably β ( + ) - + β ( )... ) β ( ) a b β ( + )... N 4/0/003 Cm S 573 Machne Learnng Sprng 003. Cpyrgh Vasan Hnavar 33 Prbably f he res f he saes gven he frs sae N O µ ) α ( ) N N - + O µ ) π β () O µ ) α ( ) β ( ) Frward Prcedure ackward Prcedure Cmbnan 4/0/003 Cm S 573 Machne Learnng Sprng 003. Cpyrgh Vasan Hnavar 34 he ms prbable Sae Sequence Verb lgrhm Fnd he sae sequence ha bes eplans he bservans Verb algrhm argma O) 4/0/003 Cm S 573 Machne Learnng Sprng 003. Cpyrgh Vasan Hnavar 35 δ ( ) ma...,...,..., ) he sae sequence whch mamzes he prbably f seeng he bservans me -, landng n sae, and seeng he bservan a me 4/0/003 Cm S 573 Machne Learnng Sprng 003. Cpyrgh Vasan Hnavar 36

7 Verb lgrhm Verb lgrhm δ ( ) ma...,..., δ... ( + ) maδ ( ) ab +, ) ψ ( + ) arg maδ ( ) ab + 4/0/003 Cm S 573 Machne Learnng Sprng 003. Cpyrgh Vasan Hnavar 37 Recursve Cmpuan ˆ ˆ arg maδ ( ) ψ ( ) ^ + + ˆ ) arg maδ ( ) Cmpue he ms lkely sae sequence by wrkng backwards 4/0/003 Cm S 573 Machne Learnng Sprng 003. Cpyrgh Vasan Hnavar 3 Learnng HMM Parameer Esman Parameer Esman: aum-welch r Frward- ackward - + Gven an bservan sequence, fnd he mdel ha s ms lkely prduce ha sequence. Gven a mdel and bservan sequence, updae he mdel parameers beer f he bservans. 4/0/003 Cm S 573 Machne Learnng Sprng 003. Cpyrgh Vasan Hnavar 3 p - + α ( ) ab β ( + ) α ( ) β ( ) + (, ) m m... N γ ( ) m p (, )... N beng n sae 4/0/003 Cm S 573 Machne Learnng Sprng 003. Cpyrgh Vasan Hnavar 40 Prbably f raversng an arc Prbably f aˆ Parameer Esman: aum-welch lgrhm ˆ p (, ) γ ( ) γ ( ) - + { : k } bk 4/0/003 Cm γ S 573 Machne Learnng Sprng 003. Cpyrgh mdel Vasan parameers. ( ) Hnavar 4 π ˆ γ () Nw we can cmpue he new esmaes f he HMM Parameer esman n pracce Sparseness f daa requres Smhng (as n Naïve ayes) gve suable nnzer prbably unseen bservans Dman specfc rcks Feaure decmpsn (capalzed?, number?, ec. n e prcessng) gves a beer esmae Shrnkage allws plng f esmaes ver mulple saes f same ype Well desgned (r learned) HMM plgy 4/0/003 Cm S 573 Machne Learnng Sprng 003. Cpyrgh Vasan Hnavar 4

Natural Language Processing NLP Hidden Markov Models. Razvan C. Bunescu School of Electrical Engineering and Computer Science

Natural Language Processing NLP Hidden Markov Models. Razvan C. Bunescu School of Electrical Engineering and Computer Science Naural Language rcessng NL 6840 Hdden Markv Mdels Razvan C. Bunescu Schl f Elecrcal Engneerng and Cmpuer Scence bunescu@h.edu Srucured Daa Fr many applcans he..d. assumpn des n hld: pels n mages f real

More information

Dishonest casino as an HMM

Dishonest casino as an HMM Dshnes casn as an HMM N = 2, ={F,L} M=2, O = {h,} A = F B= [. F L F L 0.95 0.0 0] h 0.5 0. L 0.05 0.90 0.5 0.9 c Deva ubramanan, 2009 63 A generave mdel fr CpG slands There are w hdden saes: CpG and nn-cpg.

More information

Outline. Probabilistic Model Learning. Probabilistic Model Learning. Probabilistic Model for Time-series Data: Hidden Markov Model

Outline. Probabilistic Model Learning. Probabilistic Model Learning. Probabilistic Model for Time-series Data: Hidden Markov Model Probablsc Model for Tme-seres Daa: Hdden Markov Model Hrosh Mamsuka Bonformacs Cener Kyoo Unversy Oulne Three Problems for probablsc models n machne learnng. Compung lkelhood 2. Learnng 3. Parsng (predcon

More information

Discrete Markov Process. Introduction. Example: Balls and Urns. Stochastic Automaton. INTRODUCTION TO Machine Learning 3rd Edition

Discrete Markov Process. Introduction. Example: Balls and Urns. Stochastic Automaton. INTRODUCTION TO Machine Learning 3rd Edition EHEM ALPAYDI he MI Press, 04 Lecure Sldes for IRODUCIO O Machne Learnng 3rd Edon alpaydn@boun.edu.r hp://www.cmpe.boun.edu.r/~ehem/ml3e Sldes from exboo resource page. Slghly eded and wh addonal examples

More information

Variable Forgetting Factor Recursive Total Least Squares Algorithm for FIR Adaptive filtering

Variable Forgetting Factor Recursive Total Least Squares Algorithm for FIR Adaptive filtering 01 Inernanal Cnference n Elecrncs Engneerng and Infrmacs (ICEEI 01) IPCSI vl 49 (01) (01) IACSI Press Sngapre DOI: 107763/IPCSI01V4931 Varable Frgeng Facr Recursve al Leas Squares Algrhm fr FIR Adapve

More information

Lecture Slides for INTRODUCTION TO. Machine Learning. ETHEM ALPAYDIN The MIT Press,

Lecture Slides for INTRODUCTION TO. Machine Learning. ETHEM ALPAYDIN The MIT Press, Lecure Sldes for INTRDUCTIN T Machne Learnng ETHEM ALAYDIN The MIT ress, 2004 alpaydn@boun.edu.r hp://www.cmpe.boun.edu.r/~ehem/2ml CHATER 3: Hdden Marov Models Inroducon Modelng dependences n npu; no

More information

Hidden Markov Models Following a lecture by Andrew W. Moore Carnegie Mellon University

Hidden Markov Models Following a lecture by Andrew W. Moore Carnegie Mellon University Hdden Markov Models Followng a lecure by Andrew W. Moore Carnege Mellon Unversy www.cs.cmu.edu/~awm/uorals A Markov Sysem Has N saes, called s, s 2.. s N s 2 There are dscree meseps, 0,, s s 3 N 3 0 Hdden

More information

Introduction ( Week 1-2) Course introduction A brief introduction to molecular biology A brief introduction to sequence comparison Part I: Algorithms

Introduction ( Week 1-2) Course introduction A brief introduction to molecular biology A brief introduction to sequence comparison Part I: Algorithms Course organzaon Inroducon Wee -2) Course nroducon A bref nroducon o molecular bology A bref nroducon o sequence comparson Par I: Algorhms for Sequence Analyss Wee 3-8) Chaper -3, Models and heores» Probably

More information

Physics 20 Lesson 9H Rotational Kinematics

Physics 20 Lesson 9H Rotational Kinematics Phyc 0 Len 9H Ranal Knemac In Len 1 9 we learned abu lnear mn knemac and he relanhp beween dplacemen, velcy, acceleran and me. In h len we wll learn abu ranal knemac. The man derence beween he w ype mn

More information

In the complete model, these slopes are ANALYSIS OF VARIANCE FOR THE COMPLETE TWO-WAY MODEL. (! i+1 -! i ) + [(!") i+1,q - [(!

In the complete model, these slopes are ANALYSIS OF VARIANCE FOR THE COMPLETE TWO-WAY MODEL. (! i+1 -! i ) + [(!) i+1,q - [(! ANALYSIS OF VARIANCE FOR THE COMPLETE TWO-WAY MODEL The frs hng o es n wo-way ANOVA: Is here neracon? "No neracon" means: The man effecs model would f. Ths n urn means: In he neracon plo (wh A on he horzonal

More information

The Components of Vector B. The Components of Vector B. Vector Components. Component Method of Vector Addition. Vector Components

The Components of Vector B. The Components of Vector B. Vector Components. Component Method of Vector Addition. Vector Components Upcming eens in PY05 Due ASAP: PY05 prees n WebCT. Submiing i ges yu pin ward yur 5-pin Lecure grade. Please ake i seriusly, bu wha cuns is wheher r n yu submi i, n wheher yu ge hings righ r wrng. Due

More information

( ) () we define the interaction representation by the unitary transformation () = ()

( ) () we define the interaction representation by the unitary transformation () = () Hgher Order Perurbaon Theory Mchael Fowler 3/7/6 The neracon Represenaon Recall ha n he frs par of hs course sequence, we dscussed he chrödnger and Hesenberg represenaons of quanum mechancs here n he chrödnger

More information

THE PREDICTION OF COMPETITIVE ENVIRONMENT IN BUSINESS

THE PREDICTION OF COMPETITIVE ENVIRONMENT IN BUSINESS THE PREICTION OF COMPETITIVE ENVIRONMENT IN BUSINESS INTROUCTION The wo dmensonal paral dfferenal equaons of second order can be used for he smulaon of compeve envronmen n busness The arcle presens he

More information

Optimal Control. Lecture. Prof. Daniela Iacoviello

Optimal Control. Lecture. Prof. Daniela Iacoviello Opmal Cnrl Lecure Pr. Danela Iacvell Gradng Prjec + ral eam Eample prjec: Read a paper n an pmal cnrl prblem 1 Sudy: backgrund mvans mdel pmal cnrl slun resuls 2 Smulans Yu mus gve me al leas en days bere

More information

CS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 4

CS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 4 CS434a/54a: Paern Recognon Prof. Olga Veksler Lecure 4 Oulne Normal Random Varable Properes Dscrmnan funcons Why Normal Random Varables? Analycally racable Works well when observaon comes form a corruped

More information

Ordinary Differential Equations in Neuroscience with Matlab examples. Aim 1- Gain understanding of how to set up and solve ODE s

Ordinary Differential Equations in Neuroscience with Matlab examples. Aim 1- Gain understanding of how to set up and solve ODE s Ordnary Dfferenal Equaons n Neuroscence wh Malab eamples. Am - Gan undersandng of how o se up and solve ODE s Am Undersand how o se up an solve a smple eample of he Hebb rule n D Our goal a end of class

More information

( ) [ ] MAP Decision Rule

( ) [ ] MAP Decision Rule Announcemens Bayes Decson Theory wh Normal Dsrbuons HW0 due oday HW o be assgned soon Proec descrpon posed Bomercs CSE 90 Lecure 4 CSE90, Sprng 04 CSE90, Sprng 04 Key Probables 4 ω class label X feaure

More information

R th is the Thevenin equivalent at the capacitor terminals.

R th is the Thevenin equivalent at the capacitor terminals. Chaper 7, Slun. Applyng KV Fg. 7.. d 0 C - Takng he derae f each erm, d 0 C d d d r C Inegrang, () ln I 0 - () I 0 e - C C () () r - I 0 e - () V 0 e C C Chaper 7, Slun. h C where h s he Theenn equalen

More information

Brace-Gatarek-Musiela model

Brace-Gatarek-Musiela model Chaper 34 Brace-Gaarek-Musiela mdel 34. Review f HJM under risk-neural IP where f ( T Frward rae a ime fr brrwing a ime T df ( T ( T ( T d + ( T dw ( ( T The ineres rae is r( f (. The bnd prices saisfy

More information

Graduate Macroeconomics 2 Problem set 5. - Solutions

Graduate Macroeconomics 2 Problem set 5. - Solutions Graduae Macroeconomcs 2 Problem se. - Soluons Queson 1 To answer hs queson we need he frms frs order condons and he equaon ha deermnes he number of frms n equlbrum. The frms frs order condons are: F K

More information

This document is downloaded from DR-NTU, Nanyang Technological University Library, Singapore.

This document is downloaded from DR-NTU, Nanyang Technological University Library, Singapore. Ths documen s downloaded from DR-NTU, Nanyang Technologcal Unversy Lbrary, Sngapore. Tle A smplfed verb machng algorhm for word paron n vsual speech processng( Acceped verson ) Auhor(s) Foo, Say We; Yong,

More information

Advanced Machine Learning & Perception

Advanced Machine Learning & Perception Advanced Machne Learnng & Percepon Insrucor: Tony Jebara SVM Feaure & Kernel Selecon SVM Eensons Feaure Selecon (Flerng and Wrappng) SVM Feaure Selecon SVM Kernel Selecon SVM Eensons Classfcaon Feaure/Kernel

More information

Comb Filters. Comb Filters

Comb Filters. Comb Filters The smple flers dscussed so far are characered eher by a sngle passband and/or a sngle sopband There are applcaons where flers wh mulple passbands and sopbands are requred Thecomb fler s an example of

More information

CHAPTER 10: LINEAR DISCRIMINATION

CHAPTER 10: LINEAR DISCRIMINATION CHAPER : LINEAR DISCRIMINAION Dscrmnan-based Classfcaon 3 In classfcaon h K classes (C,C,, C k ) We defned dscrmnan funcon g j (), j=,,,k hen gven an es eample, e chose (predced) s class label as C f g

More information

5.1 Angles and Their Measure

5.1 Angles and Their Measure 5. Angles and Their Measure Secin 5. Nes Page This secin will cver hw angles are drawn and als arc lengh and rains. We will use (hea) represen an angle s measuremen. In he figure belw i describes hw yu

More information

V.Abramov - FURTHER ANALYSIS OF CONFIDENCE INTERVALS FOR LARGE CLIENT/SERVER COMPUTER NETWORKS

V.Abramov - FURTHER ANALYSIS OF CONFIDENCE INTERVALS FOR LARGE CLIENT/SERVER COMPUTER NETWORKS R&RATA # Vol.) 8, March FURTHER AALYSIS OF COFIDECE ITERVALS FOR LARGE CLIET/SERVER COMPUTER ETWORKS Vyacheslav Abramov School of Mahemacal Scences, Monash Unversy, Buldng 8, Level 4, Clayon Campus, Wellngon

More information

Energy Storage Devices

Energy Storage Devices Energy Srage Deces Objece f ecure Descrbe The cnsrucn f an nducr Hw energy s sred n an nducr The elecrcal prperes f an nducr Relanshp beween lage, curren, and nducance; pwer; and energy Equalen nducance

More information

Department of Economics University of Toronto

Department of Economics University of Toronto Deparmen of Economcs Unversy of Torono ECO408F M.A. Economercs Lecure Noes on Heeroskedascy Heeroskedascy o Ths lecure nvolves lookng a modfcaons we need o make o deal wh he regresson model when some of

More information

Mechanics Physics 151

Mechanics Physics 151 Mechancs Physcs 5 Lecure 0 Canoncal Transformaons (Chaper 9) Wha We Dd Las Tme Hamlon s Prncple n he Hamlonan formalsm Dervaon was smple δi δ Addonal end-pon consrans pq H( q, p, ) d 0 δ q ( ) δq ( ) δ

More information

10.7 Temperature-dependent Viscoelastic Materials

10.7 Temperature-dependent Viscoelastic Materials Secin.7.7 Temperaure-dependen Viscelasic Maerials Many maerials, fr example plymeric maerials, have a respnse which is srngly emperaure-dependen. Temperaure effecs can be incrpraed in he hery discussed

More information

Chapter 2 Linear Mo on

Chapter 2 Linear Mo on Chper Lner M n .1 Aerge Velcy The erge elcy prcle s dened s The erge elcy depends nly n he nl nd he nl psns he prcle. Ths mens h prcle srs rm pn nd reurn bck he sme pn, s dsplcemen, nd s s erge elcy s

More information

Solution in semi infinite diffusion couples (error function analysis)

Solution in semi infinite diffusion couples (error function analysis) Soluon n sem nfne dffuson couples (error funcon analyss) Le us consder now he sem nfne dffuson couple of wo blocks wh concenraon of and I means ha, n a A- bnary sysem, s bondng beween wo blocks made of

More information

Rheological Models. In this section, a number of one-dimensional linear viscoelastic models are discussed.

Rheological Models. In this section, a number of one-dimensional linear viscoelastic models are discussed. helgcal Mdels In hs secn, a number f ne-dmensnal lnear vscelasc mdels are dscussed..3. Mechancal (rhelgcal) mdels The wrd vscelasc s derved frm he wrds "vscus" + "elasc"; a vscelasc maeral exhbs bh vscus

More information

(,,, ) (,,, ). In addition, there are three other consumers, -2, -1, and 0. Consumer -2 has the utility function

(,,, ) (,,, ). In addition, there are three other consumers, -2, -1, and 0. Consumer -2 has the utility function MACROECONOMIC THEORY T J KEHOE ECON 87 SPRING 5 PROBLEM SET # Conder an overlappng generaon economy le ha n queon 5 on problem e n whch conumer lve for perod The uly funcon of he conumer born n perod,

More information

MACHINE LEARNING. Learning Bayesian networks

MACHINE LEARNING. Learning Bayesian networks Iowa Sae Unversy MACHINE LEARNING Vasan Honavar Bonformacs and Compuaonal Bology Program Cener for Compuaonal Inellgence, Learnng, & Dscovery Iowa Sae Unversy honavar@cs.asae.edu www.cs.asae.edu/~honavar/

More information

Lecture VI Regression

Lecture VI Regression Lecure VI Regresson (Lnear Mehods for Regresson) Conens: Lnear Mehods for Regresson Leas Squares, Gauss Markov heorem Recursve Leas Squares Lecure VI: MLSC - Dr. Sehu Vjayakumar Lnear Regresson Model M

More information

Big Data Analytics! Special Topics for Computer Science CSE CSE Mar 31

Big Data Analytics! Special Topics for Computer Science CSE CSE Mar 31 Bg Data Analytcs! Specal Tpcs fr Cmputer Scence CSE 4095-001 CSE 5095-005! Mar 31 Fe Wang Asscate Prfessr Department f Cmputer Scence and Engneerng fe_wang@ucnn.edu Intrductn t Deep Learnng Perceptrn In

More information

CHAPTER 5: MULTIVARIATE METHODS

CHAPTER 5: MULTIVARIATE METHODS CHAPER 5: MULIVARIAE MEHODS Mulvarae Daa 3 Mulple measuremens (sensors) npus/feaures/arbues: -varae N nsances/observaons/eamples Each row s an eample Each column represens a feaure X a b correspons o he

More information

Hidden Markov Models

Hidden Markov Models 11-755 Machne Learnng for Sgnal Processng Hdden Markov Models Class 15. 12 Oc 2010 1 Admnsrva HW2 due Tuesday Is everyone on he projecs page? Where are your projec proposals? 2 Recap: Wha s an HMM Probablsc

More information

, t 1. Transitions - this one was easy, but in general the hardest part is choosing the which variables are state and control variables

, t 1. Transitions - this one was easy, but in general the hardest part is choosing the which variables are state and control variables Opmal Conrol Why Use I - verss calcls of varaons, opmal conrol More generaly More convenen wh consrans (e.g., can p consrans on he dervaves More nsghs no problem (a leas more apparen han hrogh calcls of

More information

Relative controllability of nonlinear systems with delays in control

Relative controllability of nonlinear systems with delays in control Relave conrollably o nonlnear sysems wh delays n conrol Jerzy Klamka Insue o Conrol Engneerng, Slesan Techncal Unversy, 44- Glwce, Poland. phone/ax : 48 32 37227, {jklamka}@a.polsl.glwce.pl Keywor: Conrollably.

More information

Let s treat the problem of the response of a system to an applied external force. Again,

Let s treat the problem of the response of a system to an applied external force. Again, Page 33 QUANTUM LNEAR RESPONSE FUNCTON Le s rea he problem of he response of a sysem o an appled exernal force. Agan, H() H f () A H + V () Exernal agen acng on nernal varable Hamlonan for equlbrum sysem

More information

DEEP UNFOLDING FOR MULTICHANNEL SOURCE SEPARATION SUPPLEMENTARY MATERIAL

DEEP UNFOLDING FOR MULTICHANNEL SOURCE SEPARATION SUPPLEMENTARY MATERIAL DEEP UNFOLDING FOR MULTICHANNEL SOURCE SEPARATION SUPPLEMENTARY MATERIAL Sco Wsdom, John Hershey 2, Jonahan Le Roux 2, and Shnj Waanabe 2 Deparmen o Elecrcal Engneerng, Unversy o Washngon, Seale, WA, USA

More information

. The geometric multiplicity is dim[ker( λi. number of linearly independent eigenvectors associated with this eigenvalue.

. The geometric multiplicity is dim[ker( λi. number of linearly independent eigenvectors associated with this eigenvalue. Lnear Algebra Lecure # Noes We connue wh he dscusson of egenvalues, egenvecors, and dagonalzably of marces We wan o know, n parcular wha condons wll assure ha a marx can be dagonalzed and wha he obsrucons

More information

Variants of Pegasos. December 11, 2009

Variants of Pegasos. December 11, 2009 Inroducon Varans of Pegasos SooWoong Ryu bshboy@sanford.edu December, 009 Youngsoo Cho yc344@sanford.edu Developng a new SVM algorhm s ongong research opc. Among many exng SVM algorhms, we wll focus on

More information

Kinematics Review Outline

Kinematics Review Outline Kinemaics Review Ouline 1.1.0 Vecrs and Scalars 1.1 One Dimensinal Kinemaics Vecrs have magniude and direcin lacemen; velciy; accelerain sign indicaes direcin + is nrh; eas; up; he righ - is suh; wes;

More information

Scattering at an Interface: Oblique Incidence

Scattering at an Interface: Oblique Incidence Course Insrucor Dr. Raymond C. Rumpf Offce: A 337 Phone: (915) 747 6958 E Mal: rcrumpf@uep.edu EE 4347 Appled Elecromagnecs Topc 3g Scaerng a an Inerface: Oblque Incdence Scaerng These Oblque noes may

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 15 10/30/2013. Ito integral for simple processes

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 15 10/30/2013. Ito integral for simple processes MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.65/15.7J Fall 13 Lecure 15 1/3/13 I inegral fr simple prcesses Cnen. 1. Simple prcesses. I ismery. Firs 3 seps in cnsrucing I inegral fr general prcesses 1 I inegral

More information

John Geweke a and Gianni Amisano b a Departments of Economics and Statistics, University of Iowa, USA b European Central Bank, Frankfurt, Germany

John Geweke a and Gianni Amisano b a Departments of Economics and Statistics, University of Iowa, USA b European Central Bank, Frankfurt, Germany Herarchcal Markov Normal Mxure models wh Applcaons o Fnancal Asse Reurns Appendx: Proofs of Theorems and Condonal Poseror Dsrbuons John Geweke a and Gann Amsano b a Deparmens of Economcs and Sascs, Unversy

More information

Robust and Accurate Cancer Classification with Gene Expression Profiling

Robust and Accurate Cancer Classification with Gene Expression Profiling Robus and Accurae Cancer Classfcaon wh Gene Expresson Proflng (Compuaonal ysems Bology, 2005) Auhor: Hafeng L, Keshu Zhang, ao Jang Oulne Background LDA (lnear dscrmnan analyss) and small sample sze problem

More information

[ ] 2. [ ]3 + (Δx i + Δx i 1 ) / 2. Δx i-1 Δx i Δx i+1. TPG4160 Reservoir Simulation 2018 Lecture note 3. page 1 of 5

[ ] 2. [ ]3 + (Δx i + Δx i 1 ) / 2. Δx i-1 Δx i Δx i+1. TPG4160 Reservoir Simulation 2018 Lecture note 3. page 1 of 5 TPG460 Reservor Smulaon 08 page of 5 DISCRETIZATIO OF THE FOW EQUATIOS As we already have seen, fne dfference appromaons of he paral dervaves appearng n he flow equaons may be obaned from Taylor seres

More information

Normal Random Variable and its discriminant functions

Normal Random Variable and its discriminant functions Noral Rando Varable and s dscrnan funcons Oulne Noral Rando Varable Properes Dscrnan funcons Why Noral Rando Varables? Analycally racable Works well when observaon coes for a corruped snle prooype 3 The

More information

Convection and conduction and lumped models

Convection and conduction and lumped models MIT Hea ranfer Dynamc mdel 4.3./SG nvecn and cndcn and lmped mdel. Hea cnvecn If we have a rface wh he emperare and a rrndng fld wh he emperare a where a hgher han we have a hea flw a Φ h [W] () where

More information

CHAPTER 7: CLUSTERING

CHAPTER 7: CLUSTERING CHAPTER 7: CLUSTERING Semparamerc Densy Esmaon 3 Paramerc: Assume a snge mode for p ( C ) (Chapers 4 and 5) Semparamerc: p ( C ) s a mure of denses Mupe possbe epanaons/prooypes: Dfferen handwrng syes,

More information

Physics Courseware Physics I Constant Acceleration

Physics Courseware Physics I Constant Acceleration Physics Curseware Physics I Cnsan Accelerain Equains fr cnsan accelerain in dimensin x + a + a + ax + x Prblem.- In he 00-m race an ahlee acceleraes unifrmly frm res his p speed f 0m/s in he firs x5m as

More information

Notes on the stability of dynamic systems and the use of Eigen Values.

Notes on the stability of dynamic systems and the use of Eigen Values. Noes on he sabl of dnamc ssems and he use of Egen Values. Source: Macro II course noes, Dr. Davd Bessler s Tme Seres course noes, zarads (999) Ineremporal Macroeconomcs chaper 4 & Techncal ppend, and Hamlon

More information

Lecture 6: Learning for Control (Generalised Linear Regression)

Lecture 6: Learning for Control (Generalised Linear Regression) Lecure 6: Learnng for Conrol (Generalsed Lnear Regresson) Conens: Lnear Mehods for Regresson Leas Squares, Gauss Markov heorem Recursve Leas Squares Lecure 6: RLSC - Prof. Sehu Vjayakumar Lnear Regresson

More information

CHAPTER 2: Supervised Learning

CHAPTER 2: Supervised Learning HATER 2: Supervsed Learnng Learnng a lass from Eamples lass of a famly car redcon: Is car a famly car? Knowledge eracon: Wha do people epec from a famly car? Oupu: osve (+) and negave ( ) eamples Inpu

More information

( t) Outline of program: BGC1: Survival and event history analysis Oslo, March-May Recapitulation. The additive regression model

( t) Outline of program: BGC1: Survival and event history analysis Oslo, March-May Recapitulation. The additive regression model BGC1: Survval and even hsory analyss Oslo, March-May 212 Monday May 7h and Tuesday May 8h The addve regresson model Ørnulf Borgan Deparmen of Mahemacs Unversy of Oslo Oulne of program: Recapulaon Counng

More information

Displacement, Velocity, and Acceleration. (WHERE and WHEN?)

Displacement, Velocity, and Acceleration. (WHERE and WHEN?) Dsplacemen, Velocy, and Acceleraon (WHERE and WHEN?) Mah resources Append A n your book! Symbols and meanng Algebra Geomery (olumes, ec.) Trgonomery Append A Logarhms Remnder You wll do well n hs class

More information

Machine Learning 4771

Machine Learning 4771 ony Jebara, Columbia Universiy achine Learning 4771 Insrucor: ony Jebara ony Jebara, Columbia Universiy opic 20 Hs wih Evidence H Collec H Evaluae H Disribue H Decode H Parameer Learning via JA & E ony

More information

AP Physics 1 MC Practice Kinematics 1D

AP Physics 1 MC Practice Kinematics 1D AP Physics 1 MC Pracice Kinemaics 1D Quesins 1 3 relae w bjecs ha sar a x = 0 a = 0 and mve in ne dimensin independenly f ne anher. Graphs, f he velciy f each bjec versus ime are shwn belw Objec A Objec

More information

21.9 Magnetic Materials

21.9 Magnetic Materials 21.9 Magneic Maerials The inrinsic spin and rbial min f elecrns gives rise he magneic prperies f maerials è elecrn spin and rbis ac as iny curren lps. In ferrmagneic maerials grups f 10 16-10 19 neighbring

More information

2015 Sectional Physics Exam Solution Set

2015 Sectional Physics Exam Solution Set . Crrec answer: D Ne: [quan] denes: uns quan WYSE cadec Challenge 05 Secnal Phscs Ea SOLUTION SET / / / / rce lengh lengh rce enu ass lengh e a) / ass ass b) energ c) wrk lengh e pwer energ e d) (crrec

More information

. The geometric multiplicity is dim[ker( λi. A )], i.e. the number of linearly independent eigenvectors associated with this eigenvalue.

. The geometric multiplicity is dim[ker( λi. A )], i.e. the number of linearly independent eigenvectors associated with this eigenvalue. Mah E-b Lecure #0 Noes We connue wh he dscusson of egenvalues, egenvecors, and dagonalzably of marces We wan o know, n parcular wha condons wll assure ha a marx can be dagonalzed and wha he obsrucons are

More information

UNIVERSITAT AUTÒNOMA DE BARCELONA MARCH 2017 EXAMINATION

UNIVERSITAT AUTÒNOMA DE BARCELONA MARCH 2017 EXAMINATION INTERNATIONAL TRADE T. J. KEHOE UNIVERSITAT AUTÒNOMA DE BARCELONA MARCH 27 EXAMINATION Please answer wo of he hree quesons. You can consul class noes, workng papers, and arcles whle you are workng on he

More information

Chapters 2 Kinematics. Position, Distance, Displacement

Chapters 2 Kinematics. Position, Distance, Displacement Chapers Knemacs Poson, Dsance, Dsplacemen Mechancs: Knemacs and Dynamcs. Knemacs deals wh moon, bu s no concerned wh he cause o moon. Dynamcs deals wh he relaonshp beween orce and moon. The word dsplacemen

More information

Lecture 13: Markov Chain Monte Carlo. Gibbs sampling

Lecture 13: Markov Chain Monte Carlo. Gibbs sampling Lecture 13: Markv hain Mnte arl Gibbs sampling Gibbs sampling Markv chains 1 Recall: Apprximate inference using samples Main idea: we generate samples frm ur Bayes net, then cmpute prbabilities using (weighted)

More information

Mechanics Physics 151

Mechanics Physics 151 Mechancs Physcs 5 Lecure 9 Hamlonan Equaons of Moon (Chaper 8) Wha We Dd Las Tme Consruced Hamlonan formalsm H ( q, p, ) = q p L( q, q, ) H p = q H q = p H = L Equvalen o Lagrangan formalsm Smpler, bu

More information

Data Analysis, Statistics, Machine Learning

Data Analysis, Statistics, Machine Learning Data Analysis, Statistics, Machine Learning Leland Wilkinsn Adjunct Prfessr UIC Cmputer Science Chief Scien

More information

i-clicker Question lim Physics 123 Lecture 2 1 Dimensional Motion x 1 x 2 v is not constant in time v = v(t) acceleration lim Review:

i-clicker Question lim Physics 123 Lecture 2 1 Dimensional Motion x 1 x 2 v is not constant in time v = v(t) acceleration lim Review: Reiew: Physics 13 Lecure 1 Dimensinal Min Displacemen: Dx = x - x 1 (If Dx < 0, he displacemen ecr pins he lef.) Aerage elciy: (N he same as aerage speed) a slpe = a x x 1 1 Dx D x 1 x Crrecin: Calculus

More information

Mechanics Physics 151

Mechanics Physics 151 Mechancs Physcs 5 Lecure 9 Hamlonan Equaons of Moon (Chaper 8) Wha We Dd Las Tme Consruced Hamlonan formalsm Hqp (,,) = qp Lqq (,,) H p = q H q = p H L = Equvalen o Lagrangan formalsm Smpler, bu wce as

More information

The Simple Linear Regression Model: Theory

The Simple Linear Regression Model: Theory Chapter 3 The mple Lear Regress Mdel: Ther 3. The mdel 3.. The data bservats respse varable eplaatr varable : : Plttg the data.. Fgure 3.: Dsplag the cable data csdered b Che at al (993). There are 79

More information

Clustering (Bishop ch 9)

Clustering (Bishop ch 9) Cluserng (Bshop ch 9) Reference: Daa Mnng by Margare Dunham (a slde source) 1 Cluserng Cluserng s unsupervsed learnng, here are no class labels Wan o fnd groups of smlar nsances Ofen use a dsance measure

More information

A Demand System for Input Factors when there are Technological Changes in Production

A Demand System for Input Factors when there are Technological Changes in Production A Demand Syem for Inpu Facor when here are Technologcal Change n Producon Movaon Due o (e.g.) echnologcal change here mgh no be a aonary relaonhp for he co hare of each npu facor. When emang demand yem

More information

Speaker Adaptation Techniques For Continuous Speech Using Medium and Small Adaptation Data Sets. Constantinos Boulis

Speaker Adaptation Techniques For Continuous Speech Using Medium and Small Adaptation Data Sets. Constantinos Boulis Speaker Adapaion Techniques For Coninuous Speech Using Medium and Small Adapaion Daa Ses Consaninos Boulis Ouline of he Presenaion Inroducion o he speaker adapaion problem Maximum Likelihood Sochasic Transformaions

More information

J i-1 i. J i i+1. Numerical integration of the diffusion equation (I) Finite difference method. Spatial Discretization. Internal nodes.

J i-1 i. J i i+1. Numerical integration of the diffusion equation (I) Finite difference method. Spatial Discretization. Internal nodes. umercal negraon of he dffuson equaon (I) Fne dfference mehod. Spaal screaon. Inernal nodes. R L V For hermal conducon le s dscree he spaal doman no small fne spans, =,,: Balance of parcles for an nernal

More information

Experiment 6: STUDY OF A POSITION CONTROL SERVOMECHANISM

Experiment 6: STUDY OF A POSITION CONTROL SERVOMECHANISM Expermen 6: STUDY OF A POSITION CONTROL SERVOMECHANISM 1. Objecves Ths expermen prvdes he suden wh hands-n experence f he peran f a small servmechansm. Ths sysem wll be used fr mre cmplex wrk laer n he

More information

SPH3U1 Lesson 06 Kinematics

SPH3U1 Lesson 06 Kinematics PROJECTILE MOTION LEARNING GOALS Students will: Describe the mtin f an bject thrwn at arbitrary angles thrugh the air. Describe the hrizntal and vertical mtins f a prjectile. Slve prjectile mtin prblems.

More information

On One Analytic Method of. Constructing Program Controls

On One Analytic Method of. Constructing Program Controls Appled Mahemacal Scences, Vol. 9, 05, no. 8, 409-407 HIKARI Ld, www.m-hkar.com hp://dx.do.org/0.988/ams.05.54349 On One Analyc Mehod of Consrucng Program Conrols A. N. Kvko, S. V. Chsyakov and Yu. E. Balyna

More information

} Often, when learning, we deal with uncertainty:

} Often, when learning, we deal with uncertainty: Uncertanty and Learnng } Often, when learnng, we deal wth uncertanty: } Incomplete data sets, wth mssng nformaton } Nosy data sets, wth unrelable nformaton } Stochastcty: causes and effects related non-determnstcally

More information

MARKOV CHAIN AND HIDDEN MARKOV MODEL

MARKOV CHAIN AND HIDDEN MARKOV MODEL MARKOV CHAIN AND HIDDEN MARKOV MODEL JIAN ZHANG JIANZHAN@STAT.PURDUE.EDU Markov chan and hdden Markov mode are probaby the smpest modes whch can be used to mode sequenta data,.e. data sampes whch are not

More information

Wp/Lmin. Wn/Lmin 2.5V

Wp/Lmin. Wn/Lmin 2.5V UNIVERITY OF CALIFORNIA Cllege f Engneerng Department f Electrcal Engneerng and Cmputer cences Andre Vladmrescu Hmewrk #7 EEC Due Frday, Aprl 8 th, pm @ 0 Cry Prblem #.5V Wp/Lmn 0.0V Wp/Lmn n ut Wn/Lmn.5V

More information

Bayes rule for a classification problem INF Discriminant functions for the normal density. Euclidean distance. Mahalanobis distance

Bayes rule for a classification problem INF Discriminant functions for the normal density. Euclidean distance. Mahalanobis distance INF 43 3.. Repeon Anne Solberg (anne@f.uo.no Bayes rule for a classfcaon problem Suppose we have J, =,...J classes. s he class label for a pxel, and x s he observed feaure vecor. We can use Bayes rule

More information

Including the ordinary differential of distance with time as velocity makes a system of ordinary differential equations.

Including the ordinary differential of distance with time as velocity makes a system of ordinary differential equations. Soluons o Ordnary Derenal Equaons An ordnary derenal equaon has only one ndependen varable. A sysem o ordnary derenal equaons consss o several derenal equaons each wh he same ndependen varable. An eample

More information

Expectation Maximization Mixture Models HMMs

Expectation Maximization Mixture Models HMMs -755 Machne Learnng for Sgnal Processng Mture Models HMMs Class 9. 2 Sep 200 Learnng Dstrbutons for Data Problem: Gven a collecton of eamples from some data, estmate ts dstrbuton Basc deas of Mamum Lelhood

More information

Econ107 Applied Econometrics Topic 5: Specification: Choosing Independent Variables (Studenmund, Chapter 6)

Econ107 Applied Econometrics Topic 5: Specification: Choosing Independent Variables (Studenmund, Chapter 6) Econ7 Appled Economercs Topc 5: Specfcaon: Choosng Independen Varables (Sudenmund, Chaper 6 Specfcaon errors ha we wll deal wh: wrong ndependen varable; wrong funconal form. Ths lecure deals wh wrong ndependen

More information

Advanced time-series analysis (University of Lund, Economic History Department)

Advanced time-series analysis (University of Lund, Economic History Department) Advanced me-seres analss (Unvers of Lund, Economc Hsor Dearmen) 3 Jan-3 Februar and 6-3 March Lecure 4 Economerc echnues for saonar seres : Unvarae sochasc models wh Box- Jenns mehodolog, smle forecasng

More information

Lecture 11 SVM cont

Lecture 11 SVM cont Lecure SVM con. 0 008 Wha we have done so far We have esalshed ha we wan o fnd a lnear decson oundary whose margn s he larges We know how o measure he margn of a lnear decson oundary Tha s: he mnmum geomerc

More information

Lecture 3: Resistive forces, and Energy

Lecture 3: Resistive forces, and Energy Lecure 3: Resisive frces, and Energy Las ie we fund he velciy f a prjecile ving wih air resisance: g g vx ( ) = vx, e vy ( ) = + v + e One re inegrain gives us he psiin as a funcin f ie: dx dy g g = vx,

More information

Estimation of Gene Expression

Estimation of Gene Expression AS-74.4330 Genmc Cnrl ewrs, Semnar Repr, Fall 005 Esman f Gene Expressn Ren Vrrans Helsn Unversy f Technlgy, Cnrl Engneerng Labrary Emal: ren.vrrans@hu.f Suden ID: 5406J Absrac The mcrarray echnlgy has

More information

Lecture 2 L n i e n a e r a M od o e d l e s

Lecture 2 L n i e n a e r a M od o e d l e s Lecure Lnear Models Las lecure You have learned abou ha s machne learnng Supervsed learnng Unsupervsed learnng Renforcemen learnng You have seen an eample learnng problem and he general process ha one

More information

Chapter 6 : Gibbs Free Energy

Chapter 6 : Gibbs Free Energy Wnter 01 Chem 54: ntrductry hermdynamcs Chapter 6 : Gbbs Free Energy... 64 Defntn f G, A... 64 Mawell Relatns... 65 Gbbs Free Energy G(,) (ure substances)... 67 Gbbs Free Energy fr Mtures... 68 ΔG f deal

More information

THE DEA METHOD IN ECONOMICAL EFFICIENCY ANALYSIS (MICRO-LEVEL).

THE DEA METHOD IN ECONOMICAL EFFICIENCY ANALYSIS (MICRO-LEVEL). Prceedngs f he h WSEAS Inernanal Cnference n APPLIED AHEAICS, Dallas, exas, USA, arch 22-24, 27 3 HE DEA EHOD I ECOOICAL EFFICIECY AALYSIS (ICRO-LEVEL). ks E. asaks, WSEAS A.I. helgu 7-23 5773, Zgraphu,

More information

F-Tests and Analysis of Variance (ANOVA) in the Simple Linear Regression Model. 1. Introduction

F-Tests and Analysis of Variance (ANOVA) in the Simple Linear Regression Model. 1. Introduction ECOOMICS 35* -- OTE 9 ECO 35* -- OTE 9 F-Tess and Analyss of Varance (AOVA n he Smple Lnear Regresson Model Inroducon The smple lnear regresson model s gven by he followng populaon regresson equaon, or

More information

An introduction to Support Vector Machine

An introduction to Support Vector Machine An nroducon o Suppor Vecor Machne 報告者 : 黃立德 References: Smon Haykn, "Neural Neworks: a comprehensve foundaon, second edon, 999, Chaper 2,6 Nello Chrsann, John Shawe-Tayer, An Inroducon o Suppor Vecor Machnes,

More information

Volatility Interpolation

Volatility Interpolation Volaly Inerpolaon Prelmnary Verson March 00 Jesper Andreasen and Bran Huge Danse Mares, Copenhagen wan.daddy@danseban.com brno@danseban.com Elecronc copy avalable a: hp://ssrn.com/absrac=69497 Inro Local

More information

WebAssign HW Due 11:59PM Tuesday Clicker Information

WebAssign HW Due 11:59PM Tuesday Clicker Information WebAssgn HW Due 11:59PM Tuesday Clcker Inormaon Remnder: 90% aemp, 10% correc answer Clcker answers wll be a end o class sldes (onlne). Some days we wll do a lo o quesons, and ew ohers Each day o clcker

More information

Foundations of State Estimation Part II

Foundations of State Estimation Part II Foundaons of Sae Esmaon Par II Tocs: Hdden Markov Models Parcle Flers Addonal readng: L.R. Rabner, A uoral on hdden Markov models," Proceedngs of he IEEE, vol. 77,. 57-86, 989. Sequenal Mone Carlo Mehods

More information

1 Convex Optimization

1 Convex Optimization Convex Optmzaton We wll consder convex optmzaton problems. Namely, mnmzaton problems where the objectve s convex (we assume no constrants for now). Such problems often arse n machne learnng. For example,

More information