CS626 Speech, Web and natural Language Processing End Sem
|
|
- Hope Eaton
- 5 years ago
- Views:
Transcription
1 CS626 Speech, Web and naural Language Proceng End Sem Dae: 14/11/14 Tme: 9.30AM-12.30PM (no book, lecure noe allowed, bu ONLY wo page of any nformaon you deem f; clary and precon are very mporan; read he queon compleely) 1. a. Suppoe a naural language generaon yem generang a enence wh N word. I neceary o place he word n correc ynax order. The machne ued a Hopfeld Ne. Aume a noon of dance beween every par of word ha a funcon of he par dmlary (whch gven). Wha hould he archecure of he Hopfeld Ne be? In how many ep wll he Ne produce an orderng of he word (gve he wor cae complexy)? Prove. (3+2+4=9) The nework hould be a Marx of ze N 2, where here are N word and N poon. Each word can occur a only 1 poon and each poon can have only 1 word. Hence, he number of neuron N 2. Each of he N 2 neuron have an nerconnecng wegh. There are no elf-connecon, and all connecon are ymmerc (.e., W = 0 for all, and W = W ). IMP: no cred for gvng expreon mlar o he ravelng aleman problem. Irrelevan. The Energy of a Hopfeld Nework wh M node : M 1 M E w x x Suppoe he maxmum abolue value of he wegh n he nework W max and ha of mnmum value be W mn. 1 Then he upper bound on he energy E max= W max M ( M 1). 2 1 The lower bound E mn= W max M ( M 1). 2 The gap n energy O(M 2 ). Now can be hown ha a each frng or nhbng of neuron he decreae n energy M 1 w 1 x. If no 0, he mnmum ep ze, W mn. Th happen when w cancel one anoher, leavng only one wegh.
2 Hence, he nework hould ablze n O(M 2 ) ep. For he curren problem, he complexy O(N 4 ). b. In a Rerced Bolzmann Machne, prove ha he probably of ae ( macro probably ) and probably of frng of conuen neuron ( mcro probably ) are conen wh one anoher. Your anwer hould have boh forward and backward proof n he form of Macro Mcro and Mcro Macro. (4+4=8) 2. a. If a funcon F(X) lower bounded by anoher funcon G(X), wha condon() mu be afed o ha maxmzng G(X) uffce o fnd he maxma of F(X)? Th mean, one lookng for ha value X max of X ha maxmze G(X), becaue ha alo maxmze F(X). Of coure, X max may no necearly gve he global maxmum. (2) F(X)-G(X) hould be monoonc n he neghbourhood of he maxma. b. Eablh he relaon beween E(F(X)) and F(E(X)), where E denoe expecaon. (2) For a funcon F o be convex n R, E[F(X)] >= F(E[X]). If F concave, E[F(X)] <= F(E[X]) Proof: For dcree cae: E[F(X)] = F(x ). P (x ) = F(x ). λ where λ = 1 For connuou cae: E[F(X)] = F(x). P (x) = F(x). λ(x) where λ(x) = 1 Applyng Jenen nequaly F(x ). λ >= F( λ x ) = F(E(X)) QED (Gudelne: Whle he queon ak o eablh he relaonhp beween E(F(X)) and F(E(X)), paral mark have been gven o uden aumng convexy and ragh away ung Jenen nequaly). c. Argue wh rgour why uffcen o maxmze he lower bound on LL(X; θ) n order o fnd he be θ, where X he oberved daa and θ he parameer of he log lkelhood expreon LL. The lower bound E Z(LL(X, Z; θ)) whch he expecaon of LL(X, Z; θ) (Z he hdden varable).
3 Th queon wa aked n he quz, for whch nobody go he anwer compleely afacorly, and I wa omewha lenen n evaluang he anwer. (5) Commen: There a uoral by Sean Borman hp:// You have been gven 2 mark for gvng ha proof. However, ha NOT wan looked for n he anwer. You have o ufy WHY akng argmax over P(X;θ)-P(X;θ n) work! 3. Th queon on HMM and PCFG, and wan you o buld he heory of he laer from he former: a. Enumerae all he mlare beween HMM and PCFG (ae, ranon, obervaon, nal ae). (3) Oberved equence n HMM gven enence for parng 2. Sae equence of HMM pare ree 3. Model of HMM grammar of he PCFG 4. Sar ae of HMM S of grammar wk 5. Tranon n HMM Producon rule w k wk 6. Probable P ) = P ). P( w ) Probably of producon rule P( A B) ( ( k b. A wa done n he cla, for an HMM ranng ung Baum Welch Algorhm: M-ep E-ep Wk P( C( 0, n1 Wk P( S 0, n1 W ) ) 0, n T A l0 m0 ) n( Wk ) Wm l ) Wk, S where he quany of ulmae nere probably of ranng from any ae S o anoher ae S on a ymbol w k. 0, n1, w 0, n )
4 Gve wo mlar expreon for PCFG. You have o deduce he expreon for PCFG, rcly analogcally, mananng correpondence wh HMM a every ep. (5) M-ep (2.5 mark) P( ) T l0 ) l ) where = coun of me producon rule occurrng l ) = coun of me producon rule arng wh ymbol occur {2 mark f E-ep wrong} E-ep (2.5 mark) l ) = P( T S) n( T, T, S).e., Probably of pare ree number of me he producon rule appled. where T = pare ree for enence S 4. a. Defne chwa, ouchng on why chwa deleon a problem for peech proceng and ranleraon. Example are a mu. (2+2=4) A chwa hor a vowel ound aached wh every cononan by defaul. In Indo-Aryan language, a chwa may be deleed a ome place. Example of chwa deleon: (a) harka : The chwa afer r and are dropped n order o produce he correc pronuncaon. (b) agarba : In h cae, he chwa only afer r dropped. (c) Naman : he chwa afer he la n dropped. Schwa deleon a problem for ranleraon becaue may lead o ambguou ranleraon. For example, कमल may be ranleraed a Kamala or Kamal. On he oher hand, कमल may be ranleraed a Kamalaa or Kamlaa. A ranleraor whch underand chwa deleon wll underand ha he chwa a he end ha been dropped n cae of Kamal and chooe ha pellng, whle he chwa a he end of m ha been dropped n cae of Kamlaa and chooe ha pellng. For a peech proceng yem ha conver peech o ex, pronuncaon need o be appropraely rancrbed o ex and hence, mu handle chwa deleon. The problem ge
5 compounded epecally f your yem am o handle mullngual peech proceng becaue of lnguc dvergence uch a, n Dravdan language, he chwa a he end of a word no dropped (a n Aruna ). b. Gve a rule baed formulaon of chwa deleon, ha, a decon yem o decde f he chwa hould be deleed or no. Gve he Algorhm. (4) Aumpon: Th algorhm gve a rule baed formulaon for chwa deleon n cae of Hnd. Correpondng algorhm for oher language may be wren. Inpu: A ere of un n a word, w0, w1 wm Oupu: A vecor of lengh equal o number of un n he word. 0, 1, m. The vecor value can be one among 0, 1, 2. 0 ndcae deleed chwa, 1 ndcae chwa preen and 2 ndcae a ound apar from chwa (ay, a maaraa). The vecor ndcae he deleon decon. Algorhm: 1) Inalzaon: 0 = 1. m = 0. 2) From w=wm o w1: (rgh o lef cannng) 2a) If w end wh a maaraa (dependen vowel), e =2. 2b) Ele If (+1) = 0/2 or w(+1) a compound word, /* Te cae: m n Kamlaa. w n Dpaawl v/ ba n Agarba. */ Se =1. 2c) Ele If (+1)=1, Se = 0. /* Te cae: ga n Agarba */ 3) If w0 conan dependen vowel, 0=2. 4) Reurn. c. Gve a probablc formulaon for he ame problem. Gve he Algorhm for ranng and eng (called decodng). (4) We propoe a rgh-o-lef algorhm ha decde whch chwa canddae n a word can be deleed. Formulaon: The daa requred for h yem con of maaraa equence Inpu: Vecor m of lengh M. m a Boolean vecor whch ndcae wheher a word poon conan a maaraa or no. Example, gala 000, kamaal 010 and dpaawlee 1101.
6 Oupu: Vecor of lengh M. Value n are 0 or 1. 0: Schwa deleed, 1: Schwa no deleed. T* = argmax P(T m) = argmax P(m T).P(T) = argmax P(m ) P( ( 1)) Tranng: Learn probable ued n he above equaon ung an annoaed corpu. Decodng: Deermne a be value for T* ung an approprae algorhm. The fr erm ndcae an emon probably for a maaraa gven a chwa. (In cae of Hnd, P(m=rue =1)=1). The econd erm ndcae a ranon probably. Th model he alernang chwa requremen a depced n he rule-baed algorhm above). d. Suppoe you are gven yllabfed word a daa, lke he followng Lou <S>Lo</S> <S>u</S> Gve a probablc formulaon of he ak of yllabfyng a new word. Gve he algorhm for ranng and eng (called decodng) (4) For he npu characer equence C and canddae yllabfed repreenaon S he be poble repreenaon gven a S = argmax P(S C) = argmax P(C S)P(S) Bu gven S, C compleely deermned; hence P(C S) = 1. S = argmax P(S) Technque o compue P(S): Dcrmnave approach: P(S) = exp (c + Where, w f (S) ) f -> A feaure funcon ha ake a canddae yllabfed repreenaon and compue he feaure aocaed wh yllabfcaon (for e.g. Lengh of he word, number of vowel/cononan, feaure relaed o Sonory prncple ec). The feaure compuaon echnque have o be provded by he uer. w, c -> Model parameer
7 Tranng: For each example n he ranng corpu, he feaure are compued. The probable of he yllable are known ung corpu ac. Ung hee nformaon, he model parameer are compued. Decodng: For a new word, for each canddae yllabfcaon, he probably of he canddae obaned by compung he feaure. The canddae havng he hghe probably wn. A Verb lke algorhm work. (Gudelne: Only paral mark have been gven for no arng from he ab-no.e. he lkelhood expreon). =Paper end=
(,,, ) (,,, ). 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 informationOutline. 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 informationLecture 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 informationA 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 informationA. Inventory model. Why are we interested in it? What do we really study in such cases.
Some general yem model.. Inenory model. Why are we nereed n? Wha do we really udy n uch cae. General raegy of machng wo dmlar procee, ay, machng a fa proce wh a low one. We need an nenory or a buffer or
More informationChapter 6: AC Circuits
Chaper 6: AC Crcus Chaper 6: Oulne Phasors and he AC Seady Sae AC Crcus A sable, lnear crcu operang n he seady sae wh snusodal excaon (.e., snusodal seady sae. Complee response forced response naural response.
More informationLecture 11: Stereo and Surface Estimation
Lecure : Sereo and Surface Emaon When camera poon have been deermned, ung rucure from moon, we would lke o compue a dene urface model of he cene. In h lecure we wll udy he o called Sereo Problem, where
More informationSolution 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 informationDiscrete 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( ) [ ] 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 informationMatrix reconstruction with the local max norm
Marx reconrucon wh he local max norm Rna oygel Deparmen of Sac Sanford Unvery rnafb@anfordedu Nahan Srebro Toyoa Technologcal Inue a Chcago na@cedu Rulan Salakhudnov Dep of Sac and Dep of Compuer Scence
More informationSpeech, NLP and the Web
peech NL ad he Web uhpak Bhaacharyya CE Dep. IIT Bombay Lecure 38: Uuperved learg HMM CFG; Baum Welch lecure 37 wa o cogve NL by Abh Mhra Baum Welch uhpak Bhaacharyya roblem HMM arg emac ar of peech Taggg
More information6.302 Feedback Systems Recitation : Phase-locked Loops Prof. Joel L. Dawson
6.32 Feedback Syem Phae-locked loop are a foundaional building block for analog circui deign, paricularly for communicaion circui. They provide a good example yem for hi cla becaue hey are an excellen
More informationIntroduction ( 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 informationAn 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 informationGraduate 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 informationClustering (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 informationRandomized Perfect Bipartite Matching
Inenive Algorihm Lecure 24 Randomized Perfec Biparie Maching Lecurer: Daniel A. Spielman April 9, 208 24. Inroducion We explain a randomized algorihm by Ahih Goel, Michael Kapralov and Sanjeev Khanna for
More informationMultiple Failures. Diverse Routing for Maximizing Survivability. Maximum Survivability Models. Minimum-Color (SRLG) Diverse Routing
Mulple Falure Dvere Roung for Maxmzng Survvably One-falure aumpon n prevou work Mulple falure Hard o provde 100% proecon Maxmum urvvably Maxmum Survvably Model Mnmum-Color (SRLG) Dvere Roung Each lnk ha
More informationCS434a/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 informationMultiple Regressions and Correlation Analysis
Mulple Regreon and Correlaon Analy Chaper 4 McGraw-Hll/Irwn Copyrgh 2 y The McGraw-Hll Compane, Inc. All rgh reerved. GOALS. Decre he relaonhp eween everal ndependen varale and a dependen varale ung mulple
More information( ) () 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 informationJohn 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 informationControl Systems. Mathematical Modeling of Control Systems.
Conrol Syem Mahemacal Modelng of Conrol Syem chbum@eoulech.ac.kr Oulne Mahemacal model and model ype. Tranfer funcon model Syem pole and zero Chbum Lee -Seoulech Conrol Syem Mahemacal Model Model are key
More informationLinear Response Theory: The connection between QFT and experiments
Phys540.nb 39 3 Lnear Response Theory: The connecon beween QFT and expermens 3.1. Basc conceps and deas Q: ow do we measure he conducvy of a meal? A: we frs nroduce a weak elecrc feld E, and hen measure
More informationH = d d q 1 d d q N d d p 1 d d p N exp
8333: Sacal Mechanc I roblem Se # 7 Soluon Fall 3 Canoncal Enemble Non-harmonc Ga: The Hamlonan for a ga of N non neracng parcle n a d dmenonal box ha he form H A p a The paron funcon gven by ZN T d d
More informationFTCS Solution to the Heat Equation
FTCS Soluon o he Hea Equaon ME 448/548 Noes Gerald Reckenwald Porland Sae Unversy Deparmen of Mechancal Engneerng gerry@pdxedu ME 448/548: FTCS Soluon o he Hea Equaon Overvew Use he forward fne d erence
More informationEcon107 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 informationHEAT CONDUCTION PROBLEM IN A TWO-LAYERED HOLLOW CYLINDER BY USING THE GREEN S FUNCTION METHOD
Journal of Appled Mahemacs and Compuaonal Mechancs 3, (), 45-5 HEAT CONDUCTION PROBLEM IN A TWO-LAYERED HOLLOW CYLINDER BY USING THE GREEN S FUNCTION METHOD Sansław Kukla, Urszula Sedlecka Insue of Mahemacs,
More informationLecture 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 informationCooling of a hot metal forging. , dt dt
Tranen Conducon Uneady Analy - Lumped Thermal Capacy Model Performed when; Hea ranfer whn a yem produced a unform emperaure drbuon n he yem (mall emperaure graden). The emperaure change whn he yem condered
More informationNotes 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 informationWiH Wei He
Sysem Idenfcaon of onlnear Sae-Space Space Baery odels WH We He wehe@calce.umd.edu Advsor: Dr. Chaochao Chen Deparmen of echancal Engneerng Unversy of aryland, College Par 1 Unversy of aryland Bacground
More informationTHE 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 informationOrdinary 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 informationDishonest 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 informationA Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window
A Deermnsc Algorhm for Summarzng Asynchronous Sreams over a Sldng ndow Cosas Busch Rensselaer Polyechnc Insue Srkana Trhapura Iowa Sae Unversy Oulne of Talk Inroducon Algorhm Analyss Tme C Daa sream: 3
More informationIntroduction to Boosting
Inroducon o Boosng Cynha Rudn PACM, Prnceon Unversy Advsors Ingrd Daubeches and Rober Schapre Say you have a daabase of news arcles, +, +, -, -, +, +, -, -, +, +, -, -, +, +, -, + where arcles are labeled
More informationThis 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 informationJanuary Examinations 2012
Page of 5 EC79 January Examnaons No. of Pages: 5 No. of Quesons: 8 Subjec ECONOMICS (POSTGRADUATE) Tle of Paper EC79 QUANTITATIVE METHODS FOR BUSINESS AND FINANCE Tme Allowed Two Hours ( hours) Insrucons
More informationOnline Supplement for Dynamic Multi-Technology. Production-Inventory Problem with Emissions Trading
Onlne Supplemen for Dynamc Mul-Technology Producon-Invenory Problem wh Emssons Tradng by We Zhang Zhongsheng Hua Yu Xa and Baofeng Huo Proof of Lemma For any ( qr ) Θ s easy o verfy ha he lnear programmng
More informationProblem Set If all directed edges in a network have distinct capacities, then there is a unique maximum flow.
CSE 202: Deign and Analyi of Algorihm Winer 2013 Problem Se 3 Inrucor: Kamalika Chaudhuri Due on: Tue. Feb 26, 2013 Inrucion For your proof, you may ue any lower bound, algorihm or daa rucure from he ex
More informationHidden 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 informationVariants 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 informationIn 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 informationCHAPTER 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 informationCS344: Introduction to Artificial Intelligence
C344: Iroduco o Arfcal Iellgece Puhpa Bhaacharyya CE Dep. IIT Bombay Lecure 3 3 32 33: Forward ad bacward; Baum elch 9 h ad 2 March ad 2 d Aprl 203 Lecure 27 28 29 were o EM; dae 2 h March o 8 h March
More information2/20/2013. EE 101 Midterm 2 Review
//3 EE Mderm eew //3 Volage-mplfer Model The npu ressance s he equalen ressance see when lookng no he npu ermnals of he amplfer. o s he oupu ressance. I causes he oupu olage o decrease as he load ressance
More informationPHYSICS 151 Notes for Online Lecture #4
PHYSICS 5 Noe for Online Lecure #4 Acceleraion The ga pedal in a car i alo called an acceleraor becaue preing i allow you o change your elociy. Acceleraion i how fa he elociy change. So if you ar fro re
More informationOn 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 informationUNIVERSITAT 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 informationNormal 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 informationAdvanced 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 informationA Nonlinear ILC Schemes for Nonlinear Dynamic Systems To Improve Convergence Speed
IJCSI Inernaonal Journal of Compuer Scence Iue, Vol. 9, Iue 3, No, ay ISSN (Onlne): 694-84 www.ijcsi.org 8 A Nonlnear ILC Scheme for Nonlnear Dynamc Syem o Improve Convergence Speed Hoen Babaee, Alreza
More informationLecture 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 informationDensity Matrix Description of NMR BCMB/CHEM 8190
Densy Marx Descrpon of NMR BCMBCHEM 89 Operaors n Marx Noaon Alernae approach o second order specra: ask abou x magnezaon nsead of energes and ranson probables. If we say wh one bass se, properes vary
More informationComb 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 informationLearning Objectives. Self Organization Map. Hamming Distance(1/5) Introduction. Hamming Distance(3/5) Hamming Distance(2/5) 15/04/2015
/4/ Learnng Objecves Self Organzaon Map Learnng whou Exaples. Inroducon. MAXNET 3. Cluserng 4. Feaure Map. Self-organzng Feaure Map 6. Concluson 38 Inroducon. Learnng whou exaples. Daa are npu o he syse
More information, the. L and the L. x x. max. i n. It is easy to show that these two norms satisfy the following relation: x x n x = (17.3) max
ecure 8 7. Sabiliy Analyi For an n dimenional vecor R n, he and he vecor norm are defined a: = T = i n i (7.) I i eay o how ha hee wo norm aify he following relaion: n (7.) If a vecor i ime-dependen, hen
More informationNational Exams December 2015 NOTES: 04-BS-13, Biology. 3 hours duration
Naonal Exams December 205 04-BS-3 Bology 3 hours duraon NOTES: f doub exss as o he nerpreaon of any queson he canddae s urged o subm wh he answer paper a clear saemen of any assumpons made 2 Ths s a CLOSED
More informationAlgorithmic Discrete Mathematics 6. Exercise Sheet
Algorihmic Dicree Mahemaic. Exercie Shee Deparmen of Mahemaic SS 0 PD Dr. Ulf Lorenz 7. and 8. Juni 0 Dipl.-Mah. David Meffer Verion of June, 0 Groupwork Exercie G (Heap-Sor) Ue Heap-Sor wih a min-heap
More informationHidden 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 informationMaximum Likelihood Estimation
Mau Lkelhood aon Beln Chen Depaen of Copue Scence & Infoaon ngneeng aonal Tawan oal Unvey Refeence:. he Alpaydn, Inoducon o Machne Leanng, Chape 4, MIT Pe, 4 Saple Sac and Populaon Paaee A Scheac Depcon
More information2.1 Constitutive Theory
Secon.. Consuve Theory.. Consuve Equaons Governng Equaons The equaons governng he behavour of maerals are (n he spaal form) dρ v & ρ + ρdv v = + ρ = Conservaon of Mass (..a) d x σ j dv dvσ + b = ρ v& +
More informationScattering 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 informationEECE 301 Signals & Systems Prof. Mark Fowler
EECE 31 Signal & Syem Prof. Mark Fowler Noe Se #27 C-T Syem: Laplace Tranform Power Tool for yem analyi Reading Aignmen: Secion 6.1 6.3 of Kamen and Heck 1/18 Coure Flow Diagram The arrow here how concepual
More informationThe Residual Graph. 11 Augmenting Path Algorithms. Augmenting Path Algorithm. Augmenting Path Algorithm
Augmening Pah Algorihm Greedy-algorihm: ar wih f (e) = everywhere find an - pah wih f (e) < c(e) on every edge augmen flow along he pah repea a long a poible The Reidual Graph From he graph G = (V, E,
More informationDensity Matrix Description of NMR BCMB/CHEM 8190
Densy Marx Descrpon of NMR BCMBCHEM 89 Operaors n Marx Noaon If we say wh one bass se, properes vary only because of changes n he coeffcens weghng each bass se funcon x = h< Ix > - hs s how we calculae
More informationAlgorithms and Data Structures 2011/12 Week 9 Solutions (Tues 15th - Fri 18th Nov)
Algorihm and Daa Srucure 2011/ Week Soluion (Tue 15h - Fri 18h No) 1. Queion: e are gien 11/16 / 15/20 8/13 0/ 1/ / 11/1 / / To queion: (a) Find a pair of ube X, Y V uch ha f(x, Y) = f(v X, Y). (b) Find
More informationExample: MOSFET Amplifier Distortion
4/25/2011 Example MSFET Amplfer Dsoron 1/9 Example: MSFET Amplfer Dsoron Recall hs crcu from a prevous handou: ( ) = I ( ) D D d 15.0 V RD = 5K v ( ) = V v ( ) D o v( ) - K = 2 0.25 ma/v V = 2.0 V 40V.
More information5.2 GRAPHICAL VELOCITY ANALYSIS Polygon Method
ME 352 GRHICL VELCITY NLYSIS 52 GRHICL VELCITY NLYSIS olygon Mehod Velociy analyi form he hear of kinemaic and dynamic of mechanical yem Velociy analyi i uually performed following a poiion analyi; ie,
More informationDiscussion Session 2 Constant Acceleration/Relative Motion Week 03
PHYS 100 Dicuion Seion Conan Acceleraion/Relaive Moion Week 03 The Plan Today you will work wih your group explore he idea of reference frame (i.e. relaive moion) and moion wih conan acceleraion. You ll
More informationChapter 4. Neural Networks Based on Competition
Chaper 4. Neural Neworks Based on Compeon Compeon s mporan for NN Compeon beween neurons has been observed n bologcal nerve sysems Compeon s mporan n solvng many problems To classfy an npu paern _1 no
More information7.6 Disjoint Paths. 7. Network Flow Applications. Edge Disjoint Paths. Edge Disjoint Paths
. Nework Flow Applcaon. Djon Pah Algorhm Degn by Éva Tardo and Jon Klenberg Copyrgh Addon Weley Slde by Kevn Wayne Algorhm Degn by Éva Tardo and Jon Klenberg Copyrgh Addon Weley Slde by Kevn Wayne Edge
More informationRobustness Experiments with Two Variance Components
Naonal Insue of Sandards and Technology (NIST) Informaon Technology Laboraory (ITL) Sascal Engneerng Dvson (SED) Robusness Expermens wh Two Varance Componens by Ana Ivelsse Avlés avles@ns.gov Conference
More informationAppendix H: Rarefaction and extrapolation of Hill numbers for incidence data
Anne Chao Ncholas J Goell C seh lzabeh L ander K Ma Rober K Colwell and Aaron M llson 03 Rarefacon and erapolaon wh ll numbers: a framewor for samplng and esmaon n speces dversy sudes cology Monographs
More informationPhysics 240: Worksheet 16 Name
Phyic 4: Workhee 16 Nae Non-unifor circular oion Each of hee proble involve non-unifor circular oion wih a conan α. (1) Obain each of he equaion of oion for non-unifor circular oion under a conan acceleraion,
More informationChapter 5 Signal-Space Analysis
Chaper 5 Sgnal-Space Analy Sgnal pace analy provde a mahemacally elegan and hghly nghful ool for he udy of daa ranmon. 5. Inroducon o Sacal model for a genec dgal communcaon yem n eage ource: A pror probable
More informationCS286.2 Lecture 14: Quantum de Finetti Theorems II
CS286.2 Lecure 14: Quanum de Fne Theorems II Scrbe: Mara Okounkova 1 Saemen of he heorem Recall he las saemen of he quanum de Fne heorem from he prevous lecure. Theorem 1 Quanum de Fne). Le ρ Dens C 2
More informationL N O Q. l q l q. I. A General Case. l q RANDOM LAGRANGE MULTIPLIERS AND TRANSVERSALITY. Econ. 511b Spring 1998 C. Sims
Econ. 511b Sprng 1998 C. Sm RAD AGRAGE UPERS AD RASVERSAY agrange mulpler mehod are andard fare n elemenary calculu coure, and hey play a cenral role n economc applcaon of calculu becaue hey ofen urn ou
More informationELIMINATION OF DOMINATED STRATEGIES AND INESSENTIAL PLAYERS
OPERATIONS RESEARCH AND DECISIONS No. 1 215 DOI: 1.5277/ord1513 Mamoru KANEKO 1 Shuge LIU 1 ELIMINATION OF DOMINATED STRATEGIES AND INESSENTIAL PLAYERS We udy he proce, called he IEDI proce, of eraed elmnaon
More informationSSRG International Journal of Thermal Engineering (SSRG-IJTE) Volume 4 Issue 1 January to April 2018
SSRG Inernaonal Journal of Thermal Engneerng (SSRG-IJTE) Volume 4 Iue 1 January o Aprl 18 Opmal Conrol for a Drbued Parameer Syem wh Tme-Delay, Non-Lnear Ung he Numercal Mehod. Applcaon o One- Sded Hea
More informationA Phrase Table Filtering Model Based on Binary Classification for Uyghur-Chinese Machine Translation
2780 JOURNAL OF COMPUTERS, VOL. 9, NO. 12, DECEMBER 2014 A Phrae Table Flerng Model Baed on Bnary Clafcaon for Uyghur-Chnee Machne Tranlaon Chenggang M 1, 2, Yang Yang 1,*, X Zhou 1, Le Wang 1, Xao L 1
More informationDigital Speech Processing Lecture 20. The Hidden Markov Model (HMM)
Dgal Speech Processng Lecure 20 The Hdden Markov Model (HMM) Lecure Oulne Theory of Markov Models dscree Markov processes hdden Markov processes Soluons o he Three Basc Problems of HMM s compuaon of observaon
More informationThe Residual Graph. 12 Augmenting Path Algorithms. Augmenting Path Algorithm. Augmenting Path Algorithm
Augmening Pah Algorihm Greedy-algorihm: ar wih f (e) = everywhere find an - pah wih f (e) < c(e) on every edge augmen flow along he pah repea a long a poible The Reidual Graph From he graph G = (V, E,
More informationV.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 informationu(t) Figure 1. Open loop control system
Open loop conrol v cloed loop feedbac conrol The nex wo figure preen he rucure of open loop and feedbac conrol yem Figure how an open loop conrol yem whoe funcion i o caue he oupu y o follow he reference
More informationCS 268: Packet Scheduling
Pace Schedulng Decde when and wha pace o send on oupu ln - Usually mplemened a oupu nerface CS 68: Pace Schedulng flow Ion Soca March 9, 004 Classfer flow flow n Buffer managemen Scheduler soca@cs.bereley.edu
More informationCONTROL SYSTEMS. Chapter 10 : State Space Response
CONTROL SYSTEMS Chaper : Sae Space Repone GATE Objecive & Numerical Type Soluion Queion 5 [GATE EE 99 IIT-Bombay : Mark] Conider a econd order yem whoe ae pace repreenaion i of he form A Bu. If () (),
More informationLecture 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[ ] 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 information10. A.C CIRCUITS. Theoretically current grows to maximum value after infinite time. But practically it grows to maximum after 5τ. Decay of current :
. A. IUITS Synopss : GOWTH OF UNT IN IUIT : d. When swch S s closed a =; = d. A me, curren = e 3. The consan / has dmensons of me and s called he nducve me consan ( τ ) of he crcu. 4. = τ; =.63, n one
More informationEP2200 Queuing theory and teletraffic systems. 3rd lecture Markov chains Birth-death process - Poisson process. Viktoria Fodor KTH EES
EP Queung heory and eleraffc sysems 3rd lecure Marov chans Brh-deah rocess - Posson rocess Vora Fodor KTH EES Oulne for oday Marov rocesses Connuous-me Marov-chans Grah and marx reresenaon Transen and
More informationMechanics 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 informationLet 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 informationJ 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 informationBayes 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 informationMechanics 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 informationPhysics 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 informationTesting a new idea to solve the P = NP problem with mathematical induction
Tesng a new dea o solve he P = NP problem wh mahemacal nducon Bacground P and NP are wo classes (ses) of languages n Compuer Scence An open problem s wheher P = NP Ths paper ess a new dea o compare he
More information