Machine Translation Classical and Statistical Approaches

Size: px
Start display at page:

Download "Machine Translation Classical and Statistical Approaches"

Transcription

1 Week : Overvie Machie Traslatio Classical ad Statistical Approaches Sessio 6: Statistical MT Itro ( Joas Kuh Uiversität des Saarlades, Saarbrücke The Uiversity of Texas at Austi joask@coli.ui-sb.de Data-drive, statistical approaches to MT The oisy chael model [Bro et al. 990, Kight 999] Laguage modelig Traslatio modelig Word aligmet Phrase aligmet [Koeh et al. 003] Decodig [Koeh 994] Lab exercise: buildig a phrase-based statistical MT system from parallel texts take from the Iteret Evaluatio methods Other uses of ord aligmets [Yarosky et al. 00] DGfS/CL Fall School 005, Ruhr-Uiversität Bochum, September 9-30, 005 Joas Kuh: MT Sessios 6/7: Statistical MT Itro Traslatio ithout uderstadig? Ackoledgemets: Some slides are borroed from Kevi Kight, Uiversity of Souther Califoria, from Coli Cherry, Alberta (see ad from Leila Kosseim ( Traslatio ithout uderstadig Very brief itroductio to probabilities The oisy chael model for traslatio Laguage modelig Traslatio modelig Decodig Traslatio is easy for (biligual people Process: Read the text i Frech Uderstad it Write it do i Eglish Joas Kuh: MT 3 Joas Kuh: MT 4

2 Traslatio ithout uderstadig? Traslatio is easy for (biligual people Process: Read the text i Frech Uderstad it Write it do i Eglish Hard for computers The huma process is ivisible, itagible Oe approach: Rule-based MT Compare eek Problems: Buildig a broad-coverage system is a eormous egieerig challege Addig e laguages/text domais is very costly May disambiguatio decisios caot be made ithout orld koledge/cotextual koledge Joas Kuh: MT 5 Joas Kuh: MT 6 Alterative Approach: Statistical MT Data-Drive Machie Traslatio Go back to Warre Weaver s idea of usig statistical techiques fid the most probable traslatio of a give setece We at to traslate from Frech to Eglish Task: give a Frech setece, hat is the most probable Eglish traslatio? Notatio: Fid E* arg max E E F Ma, this is so borig. Hmm, every time he sees baco, he either types bak or bech but if he sees baco de, he alays types bak, ever bech Traslated documets Joas Kuh: MT 7 Slide from Kevi Kight Joas Kuh: MT 8

3 Cetauri/Arctura [Kight, 997] Exercise: traslate this to Arctura: farok crrrok hihok yorok clok katok ok-yurp Recet Progress i Statistical MT a. ok-voo ororok sprok. b. at-voo bichat dat. a. ok-drubel ok-voo aok plok sprok. 7a. lalok farok ororok lalok sprok izok eemok. 7b. at jjat bichat at dat vat eeat. 8a. lalok brok aok plok ok isistet Wedesday may recurred her trips to Libya tomorro for flyig Cairo 6-4 ( AFP - a official aouced today i the Egyptia lies compay for flyig Tuesday is a compay " isistet for flyig " may resumed a cosideratio of a day Wedesday tomorro her trips to Libya of Security Coucil decisio trace iteratioal the imposed ba commet. Ad said the official " the istitutio set a speech to Miistry of Foreig Affairs of liftig o Libya air, a situatio her receivig replyig are so a trip ill pull to Libya a morig Wedesday ". Egyptair Has Tomorro to Resume Its Flights to Libya Cairo 4-6 (AFP - said a official at the Egyptia Aviatio Compay today that the compay egyptair may resume as of tomorro, Wedesday its flights to Libya after the Iteratioal Security Coucil resolutio to the suspesio of the embargo imposed o Libya. " The official said that the compay had set a letter to the Miistry of Foreig Affairs, iformatio o the liftig of the air embargo o Libya, here it had received a respose, the first take off a trip to Libya o Wedesday morig ". b. at-drubel at-voo pippat rrat dat. 3a. erok sprok izok hihok ghirok. 3b. totat dat arrat vat hilat. 4a. ok-voo aok drok brok jok. 4b. at-voo krat pippat sat lat. 5a. iok farok izok stok. 5b. totat jjat quat cat. 6a. lalok sprok izok jok stok. 6b. at dat krat quat cat. 8b. iat lat pippat rrat at. 9a. iok ok izok katok ok-yurp. 9b. totat at quat oloat at-yurp. 0a. lalok mok ok yorok ghirok clok. 0b. at at gat mat bat hilat. a. lalok ok crrrok hihok yorok zazaok. b. at at arrat mat zazaat. a. lalok rarok ok izok hihok mok. b. at at forat arrat vat gat. 9 Slide from C. Waye, DARPA Joas Kuh: MT 0 Very brief itro to probabilities Usig commo sese, e are pretty good at dealig ith the likelihood of (radom evets Probability fuctios assig a value betee 0 ad to the occurrece of a particular outcome of a radom evet Example: rollig a die / We eed some termiology ad otatio Pop star example Assume you are a photo reporter ad at to take a exclusive picture of a iteratioal pop star ho s o tour i Germay There are rumors that certai cocerts ill get cacelled You at to guess hat route the pop star ill take through Germay Each route has a certai probability Wait at a locatio alog the route ith the highest probability to take the picture Joas Kuh: MT Joas Kuh: MT

4 Probabilities Calculatios ith probabilities Simple probability (Prior probability A You call up the tour maager ad ask hether the cocert i Berli ill be cacelled or ot With 60% probability the cocert ill take place CiB CiB Coditioal probability (Posterior probability A B If the pop star has a cocert i Berli ho likely is it that she ill visit the Reichstagsgebäude? Oe out of four pop stars ho gives a cocert i Berli also visits Reichstagsgebäude Oly 0% of the pop stars ho do t give a cocert i Berli visit the Reichstagsgebäude Rtg CiB 0.5 Rtg CiB Joas Kuh: MT Ho likely is it that the pop star ill sho up at the Reichstag [ What is Rtg ]? All e have are coditioal probabilities for the pop star visitig the Reichstag, so e have to cosider both optios for the precoditio CiB CiB Rtg CiB Joit probability A,B Rtg CiB 0. Rtg, CiB CiB Rtg CiB Rtg, CiB CiB Rtg CiB Sice CiB ad CiB cover the full space of probabilities e get: Rtg Rtg, CiB + Rtg, CiB What s the use of a exact value like this? Compariso ith alterative optios, e.g., FRA_Airport 0.5 Joas Kuh: MT Calculatios ith probabilities Bayes La We just exploited the fact that joit probabilities [i.e., A,B] ca be calculated by multiplyig the prior probability for oe evet ith the coditioal probability for the other evet, give the first evet This is called the chai rule We ca go either ay (because A,B B,A: A,B A B A or A,B B A B So: B A B A B A Divide both sides of the equatio by B : A B B A A B Joas Kuh: MT 5 B A A A B B This is called Bayes La Importace: Ofte, traiig [i.e., statistical parameter estimatio from a sample of radom experimets] for oe of the to coditioal probabilities ca be doe much more reliably tha for the other oe Joas Kuh: MT 6

5 Bayes La Crime Scee Aalogy B A A A B B Whe e are oly lookig for the most likely outcome A* for a evet, give a fixed evet B, the deomiator does t play a role: A* arg max arg max arg max A A A A B B A A B B A A B is a crime scee. A is a perso ho may have committed the crime A B - look at the scee - ho did it? A - ho had a motive? (Profiler B A - could they have doe it? (trasportatio, access to eapos, alibi Some people might have great motives, but o meas - you eed both! Joas Kuh: MT 7 Joas Kuh: MT 8 Back to traslatio Why Bayes rule at all? We at to traslate from Frech to Eglish Task: give a Frech setece, hat is the most probable Eglish traslatio? Notatio: Fid E* arg max E E F With Bayes la e ca search the E that maximizes F E E Fid the Eglish strig E for hich the product of E [laguage model probability] times F E [traslatio model probability E F] is maximal Why ot model E F directly? F E E decompositio allos us to be sloppy E orries about good Eglish: Fluecy F E orries about Frech that matches Eglish: Faithfuless The to ca be traied idepedetly Joas Kuh: MT 9 Joas Kuh: MT 0

6 O voit Jo à la télévisio Fluecy vs. Faithfuless Jo appeared i TV. Appeared o Jo TV. good Eglish? E good match to Frech? F E Note that eve theoretically, it is sometimes impossible to have a traslatio that is maximally faithful to the source laguage, but also fluet i the target laguage I Jo appeared TV. Jo is happy today. Jo appeared o TV. TV appeared o Jo. TV i Jo appeared. Example Japaese: fukaku hasei shite orimasu Fluet traslatio: e apologize Faithful traslatio: e are deeply reflectig (o our past behaviour, ad hat e did rog, ad ho to avoid the problem ext time Jo as ot happy. Table borroed from Jaso Eiser Joas Kuh: MT Joas Kuh: MT The Noisy Chael Model Statistical MT is based o the oisy chael model Developed by Shao to model commuicatio (e.g., over a phoe lie The Noisy Chael Model Noisy chael model i SMT (ex. F E: Assume that the true text is i Eglish But he it as trasmitted over the oisy chael, it someho got corrupted ad came out i Frech i.e. the oisy chael has deformed/corrupted the origial Eglish iput ito Frech So really Frech is a form of oisy Eglish The task is to recover the origial Eglish setece (or to decode the Frech ito Eglish Joas Kuh: MT 3 Joas Kuh: MT 4

7 We eed three thigs (for FE. A Laguage Model of Eglish: E Measures fluecy Probability of a Eglish setece ~ Provides a set of fluet seteces to test for potetial traslatio. A Traslatio Model: F E Measures faithfuless Probability of a (Frech, Eglish pair (give Eglish setece ~Tests if a give fluet setece is a traslatio 3. A Decoder: arg max A effective ad efficiet search techique to fid E* The search space is ifiite ad rather ustructured, so heuristic search has to be applied Where ill e get E? Laguage modelig is a commo task i Natural Laguage Processig Applicatio cotexts (besides MT: Speech recogitio Had-ritig recogitio Augmetative commuicatio systems for the disabled Cotext-sesitive spellig error correctio (see example o ext slide Itroductio i chapter 6 of Jurafsky, D. ad J. H. Marti (000: Speech ad laguage processig: A Itroductio to Natural Laguage Processig, Computatioal Liguistics, ad Speech Recogitio, Upper Saddle River, NJ: Pretice-Hall. Joas Kuh: MT 5 Joas Kuh: MT 6 N-gram laguage models (Quick itro Give a sequece of ords, hat ill be the ext ord? Hard to guess but if e do t demad extremely high accuracy, it is ot that hard Probability of a sequece of ords To closely related problems: Guessig the ext ord Computig the probability of a sequece of ords I d like to make a collect call telephoe iteratioal Joas Kuh: MT 7 Joas Kuh: MT 8

8 Coutig ords i corpora To estimate probabilities, e eed to cout frequecies What do people cout? Word forms Lemmas The type/toke distictio Number of (ord form types: distict ords i a corpus (i.e., the size of the vocabulary Number of (ord form tokes: total umber of ruig ords Coutig ords i corpora Sitchboard corpus (spoke Eglish.4 millio ord form tokes c. 0,000 ord form types Shakespeare s complete ords 884,647 ord form tokes 9,066 ord form types Bro corpus millio ord form tokes 6,805 ord form types (37,85 lemma types Joas Kuh: MT 9 Joas Kuh: MT 30 Estimatig ord probabilities Ho probable is a Eglish ord (form as the ext ord i a sequece? Simplest model: every ord has the same probability of occurrig Assume vocabulary size 00,000 Sigle ord: the probability of fidig is 00,000 Word i a sequece, assumig coditioal idepedece from the cotext... 00,000 Estimatig ord probabilities Sequece of to ords, still assumig that each ord form is equally likely that are coditioally idepedet from each other that are coditioally idepedet from the cotext, 00,000 00,000 0,000,000, Joas Kuh: MT 3 Joas Kuh: MT 3

9 A slightly more complex model A slightly more complex model Still assume that ay ord ca follo ay other ord Take ito accout that differet ord forms occur ith differet frequecies the occurs 69,97 times i the,000,000 tokes of the Bro corpus rabbit occurs times i the Bro corpus Austi occurs 0 times liguist occurs 3 times Joas Kuh: MT 33 Estimatig probabilities based o relative frequecy Sample:,000,000 trials of producig a radom Eglish ord (N,000,000 Relative frequecy of outcome u: f f f f u i the i rabbit i Austi u N i the N i rabbit N i Austi N 69,97,000,000,000, ,000, Joas Kuh: MT 34 Coditioal probability of a ord Relative frequecies are ot a good model for the probability of ords i a give cotext Just the, the hite the.07 rabbit.0000 We should take the previous ords that have occurred ito accout We ill get: rabbit hite > rabbit rabbit, hite P ( rabbit hite hite Joas Kuh: MT 35 Probability of a strig of ords Usig the chai rule of probability: But ho ca e estimate such probabilities? [ ] P (,, 3...,, k k k If e ated to cout the frequecy of every ord appearig after a log sequece of other ords, e ould eed a far too large corpus as a sample Joas Kuh: MT

10 Chai of probabilities Probability of a strig of ords USA Berli/Tegel Frakfurt/M. Flughafe Berli City Köl Hamburg City Potsdam Dresde Approximate the probability We have to form equivalece classes over ord cotexts, so e get a larger sample from hich e estimate probabilities Müche Flughafe Müche City Düsseldorf Stuttgart USA, Ffm, Köl, Berli, Potsdam USA Ffm USA Köl USA, Ffm Berli USA, Ffm, Köl Potsdam USA, Ffm, Köl, Berli Joas Kuh: MT 37 Simple approximatio: look oly at oe precedig ord Joas Kuh: MT 38 Bigram model Approximate rabbit Just the other day I sa a by rabbit a Markov assumptio: predictig a future evet based o a limited ido of past evets Bigrams: first-order Markov model (lookig back oe toke ito the past N-gram models Bigram model: first-order Markov model lookig back oe toke Trigram model: secod-order Markov model lookig back to tokes P N-gram model: N-th order Markov model lookig back N- tokes [... ] N + N + N + ( Joas Kuh: MT 39 Joas Kuh: MT 40

11 Bigram approximatio of strig prob. Bigram laguage model example k k k Simplifyig assumptio: k k k... Joas Kuh: MT 4 3 Resultig equatio (bigram laguage model: Berkeley Restaurat Project (corpus of c. 0,000 seteces Most likely ords to follo eat eat o.6 eat some.06 eat luch.06 eat dier.05 eat at.04 eat a.04 eat Idia.04 eat today.03 eat Thai.03 eat breakfast.03 eat i.0 eat Chiese.0 eat Mexica.0 eat tomorro.0 eat dessert.007 eat British.00 Joas Kuh: MT 4 Bigram probabilities Computig the setece probability <s> I.5 I at.3 at to.65 <s> I d.06 I ould.9 at a.05 <s> Tell.04 I do t.08 at some.04 <s> I m.0 I have.04 at thai.0 to eat.6 British food.60 to have.4 British restaurat.5 to sped.09 British cuisie.0 to be.0 British luch.0 I at to eat British food I < s > at I to at eat to British eat food British Joas Kuh: MT 43 Joas Kuh: MT 44

12 Traiig N-gram models Coutig ad ormalizig Cout occurreces of a bigram (say, eat luch Divide by total cout of bigrams sharig the first ord (i.e., eat for some Joas Kuh: MT 45 Traiig N-gram models Geeral case of N-gram parameter estimatio N + N + N + Relative frequecy Example of Maximum Likelihood Estimatio (MLE techique Joas Kuh: MT 46 Relative frequecy: example Bigram couts from Berkeley Restaurat Project Relative frequecy: example Uigram couts from corpus I at to eat Chiese food luch I at to eat Chiese food luch I 3437 at 5 to 356 eat 938 Chiese 3 food 506 luch 459 Joas Kuh: MT 47 Joas Kuh: MT 48

13 Relative frequecy: example Bigram probabilities (after ormalizig, i.e., through dividig by uigram couts: I at to eat Chiese food luch I at to eat Chiese food luch Laguage modelig: ed of itro Plai relative frequecy estimatio is problematic Uobserved N-grams are assiged zero probability Problematic ith loer-frequecy ords Smoothig techiques reserve some probability mass for uobserved evets Build your o laguage model: CMU Statistical Laguage Modelig Toolkit Joas Kuh: MT 49 Joas Kuh: MT 50 Cetauri/Arctura [Kight, 997] Exercise: traslate this to Arctura: a. ok-voo ororok sprok. b. at-voo bichat dat. a. ok-drubel ok-voo aok plok sprok. b. at-drubel at-voo pippat rrat dat. 3a. erok sprok izok hihok ghirok. 3b. totat dat arrat vat hilat. 4a. ok-voo aok drok brok jok. 4b. at-voo krat pippat sat lat. 5a. iok farok izok stok. 5b. totat jjat quat cat. 6a. lalok sprok izok jok stok. 6b. at dat krat quat cat. farok crrrok hihok yorok clok katok ok-yurp 7a. lalok farok ororok lalok sprok izok eemok. 7b. at jjat bichat at dat vat eeat. 8a. lalok brok aok plok ok. 8b. iat lat pippat rrat at. 9a. iok ok izok katok ok-yurp. 9b. totat at quat oloat at-yurp. 0a. lalok mok ok yorok ghirok clok. 0b. at at gat mat bat hilat. a. lalok ok crrrok hihok yorok zazaok. b. at at arrat mat zazaat. a. lalok rarok ok izok hihok mok. b. at at forat arrat vat gat. 5

IBM Model 1 and the EM Algorithm

IBM Model 1 and the EM Algorithm IBM Model 1 and the EM Algorithm Philipp Koehn 14 September 2017 Lexical Translation 1 How to translate a word look up in dictionary Haus house, building, home, household, shell. Multiple translations

More information

N-Grams and Corpus Linguistics

N-Grams and Corpus Linguistics N-Grams ad Corpus Liguistics Lecture #5 Trasitio Up to this poit e ve mostly bee discussig ords i isolatio No e re sitchig to sequeces of ords Ad e re goig to orry about assigig probabilities biliti to

More information

Lecture 3 Language Modeling with N-Grams

Lecture 3 Language Modeling with N-Grams atural Laguage Processig CS 6320 Lecture 3 Laguage Modelig ith -Grams Istructor: Sada Harabagiu The problem Usig the otio of ord predictio for processig laguage Example: What ord is most likely to follo:

More information

As stated by Laplace, Probability is common sense reduced to calculation.

As stated by Laplace, Probability is common sense reduced to calculation. Note: Hadouts DO NOT replace the book. I most cases, they oly provide a guidelie o topics ad a ituitive feel. The math details will be covered i class, so it is importat to atted class ad also you MUST

More information

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

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

More information

CS 330 Discussion - Probability

CS 330 Discussion - Probability CS 330 Discussio - Probability March 24 2017 1 Fudametals of Probability 11 Radom Variables ad Evets A radom variable X is oe whose value is o-determiistic For example, suppose we flip a coi ad set X =

More information

Shannon s noiseless coding theorem

Shannon s noiseless coding theorem 18.310 lecture otes May 4, 2015 Shao s oiseless codig theorem Lecturer: Michel Goemas I these otes we discuss Shao s oiseless codig theorem, which is oe of the foudig results of the field of iformatio

More information

A. Cat and Mouse Story (1/1) [10 points]

A. Cat and Mouse Story (1/1) [10 points] A. Cat and Mouse Story (1/1) [10 points] Okay, so my cat pombled gwee the trowby, and she pombled gwee the foba. She pombled ippip the foba and pombled gorch the foba, and eventually she pombled ippip

More information

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

CS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 5 CS434a/54a: Patter Recogitio Prof. Olga Veksler Lecture 5 Today Itroductio to parameter estimatio Two methods for parameter estimatio Maimum Likelihood Estimatio Bayesia Estimatio Itroducto Bayesia Decisio

More information

Statistical Pattern Recognition

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

More information

Quiz #2 TEXT SIMILARITY. Class feedback. Class presentations 3/21/11

Quiz #2 TEXT SIMILARITY. Class feedback. Class presentations 3/21/11 Quiz #2 Out of 30 poits High: 28.75 Ave: 23 Will drop lowest quiz I do ot grade based o absolutes TEXT SIMILARITY David Kauchak CS159 Sprig 2011 Class feedback Class presetatios Thaks! Specific commets:

More information

Mixtures of Gaussians and the EM Algorithm

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

More information

Expectation-Maximization Algorithm.

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

More information

What is Probability?

What is Probability? Quatificatio of ucertaity. What is Probability? Mathematical model for thigs that occur radomly. Radom ot haphazard, do t kow what will happe o ay oe experimet, but has a log ru order. The cocept of probability

More information

Discrete Mathematics and Probability Theory Spring 2013 Anant Sahai Lecture 18

Discrete Mathematics and Probability Theory Spring 2013 Anant Sahai Lecture 18 EECS 70 Discrete Mathematics ad Probability Theory Sprig 2013 Aat Sahai Lecture 18 Iferece Oe of the major uses of probability is to provide a systematic framework to perform iferece uder ucertaity. A

More information

Entropies & Information Theory

Entropies & Information Theory Etropies & Iformatio Theory LECTURE I Nilajaa Datta Uiversity of Cambridge,U.K. For more details: see lecture otes (Lecture 1- Lecture 5) o http://www.qi.damtp.cam.ac.uk/ode/223 Quatum Iformatio Theory

More information

15-780: Graduate Artificial Intelligence. Density estimation

15-780: Graduate Artificial Intelligence. Density estimation 5-780: Graduate Artificial Itelligece Desity estimatio Coditioal Probability Tables (CPT) But where do we get them? P(B)=.05 B P(E)=. E P(A B,E) )=.95 P(A B, E) =.85 P(A B,E) )=.5 P(A B, E) =.05 A P(J

More information

Understanding Samples

Understanding Samples 1 Will Moroe CS 109 Samplig ad Bootstrappig Lecture Notes #17 August 2, 2017 Based o a hadout by Chris Piech I this chapter we are goig to talk about statistics calculated o samples from a populatio. We

More information

6.3 Testing Series With Positive Terms

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

More information

CSE 191, Class Note 05: Counting Methods Computer Sci & Eng Dept SUNY Buffalo

CSE 191, Class Note 05: Counting Methods Computer Sci & Eng Dept SUNY Buffalo Coutig Methods CSE 191, Class Note 05: Coutig Methods Computer Sci & Eg Dept SUNY Buffalo c Xi He (Uiversity at Buffalo CSE 191 Discrete Structures 1 / 48 Need for Coutig The problem of coutig the umber

More information

UC Berkeley CS 170: Efficient Algorithms and Intractable Problems Handout 17 Lecturer: David Wagner April 3, Notes 17 for CS 170

UC Berkeley CS 170: Efficient Algorithms and Intractable Problems Handout 17 Lecturer: David Wagner April 3, Notes 17 for CS 170 UC Berkeley CS 170: Efficiet Algorithms ad Itractable Problems Hadout 17 Lecturer: David Wager April 3, 2003 Notes 17 for CS 170 1 The Lempel-Ziv algorithm There is a sese i which the Huffma codig was

More information

CS284A: Representations and Algorithms in Molecular Biology

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

More information

Massachusetts Institute of Technology

Massachusetts Institute of Technology 6.0/6.3: Probabilistic Systems Aalysis (Fall 00) Problem Set 8: Solutios. (a) We cosider a Markov chai with states 0,,, 3,, 5, where state i idicates that there are i shoes available at the frot door i

More information

Quick Review of Probability

Quick Review of Probability Quick Review of Probability Berli Che Departmet of Computer Sciece & Iformatio Egieerig Natioal Taiwa Normal Uiversity Refereces: 1. W. Navidi. Statistics for Egieerig ad Scietists. Chapter 2 & Teachig

More information

SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES

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

More information

Quick Review of Probability

Quick Review of Probability Quick Review of Probability Berli Che Departmet of Computer Sciece & Iformatio Egieerig Natioal Taiwa Normal Uiversity Refereces: 1. W. Navidi. Statistics for Egieerig ad Scietists. Chapter & Teachig Material.

More information

Topic 5: Basics of Probability

Topic 5: Basics of Probability Topic 5: Jue 1, 2011 1 Itroductio Mathematical structures lie Euclidea geometry or algebraic fields are defied by a set of axioms. Mathematical reality is the developed through the itroductio of cocepts

More information

Sequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018

Sequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018 CSE 353 Discrete Computatioal Structures Sprig 08 Sequeces, Mathematical Iductio, ad Recursio (Chapter 5, Epp) Note: some course slides adopted from publisher-provided material Overview May mathematical

More information

Pb ( a ) = measure of the plausibility of proposition b conditional on the information stated in proposition a. & then using P2

Pb ( a ) = measure of the plausibility of proposition b conditional on the information stated in proposition a. & then using P2 Axioms for Probability Logic Pb ( a ) = measure of the plausibility of propositio b coditioal o the iformatio stated i propositio a For propositios a, b ad c: P: Pb ( a) 0 P2: Pb ( a& b ) = P3: Pb ( a)

More information

Lecture 2: April 3, 2013

Lecture 2: April 3, 2013 TTIC/CMSC 350 Mathematical Toolkit Sprig 203 Madhur Tulsiai Lecture 2: April 3, 203 Scribe: Shubhedu Trivedi Coi tosses cotiued We retur to the coi tossig example from the last lecture agai: Example. Give,

More information

Statistical Machine Translation: An Overview

Statistical Machine Translation: An Overview Statistical Machine Translation: An Overview Information Sciences Institute and Department of Computer Science University of Southern California 4676 Admiralty Way, Suite 1001 Marina del Rey, CA 90292

More information

Infinite Sequences and Series

Infinite Sequences and Series Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet

More information

Sequences. Notation. Convergence of a Sequence

Sequences. Notation. Convergence of a Sequence Sequeces A sequece is essetially just a list. Defiitio (Sequece of Real Numbers). A sequece of real umbers is a fuctio Z (, ) R for some real umber. Do t let the descriptio of the domai cofuse you; it

More information

Basics of Probability Theory (for Theory of Computation courses)

Basics of Probability Theory (for Theory of Computation courses) Basics of Probability Theory (for Theory of Computatio courses) Oded Goldreich Departmet of Computer Sciece Weizma Istitute of Sciece Rehovot, Israel. oded.goldreich@weizma.ac.il November 24, 2008 Preface.

More information

Discrete Mathematics for CS Spring 2005 Clancy/Wagner Notes 21. Some Important Distributions

Discrete Mathematics for CS Spring 2005 Clancy/Wagner Notes 21. Some Important Distributions CS 70 Discrete Mathematics for CS Sprig 2005 Clacy/Wager Notes 21 Some Importat Distributios Questio: A biased coi with Heads probability p is tossed repeatedly util the first Head appears. What is the

More information

Vector Quantization: a Limiting Case of EM

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

More information

DS 100: Principles and Techniques of Data Science Date: April 13, Discussion #10

DS 100: Principles and Techniques of Data Science Date: April 13, Discussion #10 DS 00: Priciples ad Techiques of Data Sciece Date: April 3, 208 Name: Hypothesis Testig Discussio #0. Defie these terms below as they relate to hypothesis testig. a) Data Geeratio Model: Solutio: A set

More information

Revision Topic 1: Number and algebra

Revision Topic 1: Number and algebra Revisio Topic : Number ad algebra Chapter : Number Differet types of umbers You eed to kow that there are differet types of umbers ad recogise which group a particular umber belogs to: Type of umber Symbol

More information

Kurskod: TAMS11 Provkod: TENB 21 March 2015, 14:00-18:00. English Version (no Swedish Version)

Kurskod: TAMS11 Provkod: TENB 21 March 2015, 14:00-18:00. English Version (no Swedish Version) Kurskod: TAMS Provkod: TENB 2 March 205, 4:00-8:00 Examier: Xiagfeg Yag (Tel: 070 2234765). Please aswer i ENGLISH if you ca. a. You are allowed to use: a calculator; formel -och tabellsamlig i matematisk

More information

Recursive Algorithms. Recurrences. Recursive Algorithms Analysis

Recursive Algorithms. Recurrences. Recursive Algorithms Analysis Recursive Algorithms Recurreces Computer Sciece & Egieerig 35: Discrete Mathematics Christopher M Bourke cbourke@cseuledu A recursive algorithm is oe i which objects are defied i terms of other objects

More information

Problems from 9th edition of Probability and Statistical Inference by Hogg, Tanis and Zimmerman:

Problems from 9th edition of Probability and Statistical Inference by Hogg, Tanis and Zimmerman: Math 224 Fall 2017 Homework 4 Drew Armstrog Problems from 9th editio of Probability ad Statistical Iferece by Hogg, Tais ad Zimmerma: Sectio 2.3, Exercises 16(a,d),18. Sectio 2.4, Exercises 13, 14. Sectio

More information

Table 12.1: Contingency table. Feature b. 1 N 11 N 12 N 1b 2 N 21 N 22 N 2b. ... a N a1 N a2 N ab

Table 12.1: Contingency table. Feature b. 1 N 11 N 12 N 1b 2 N 21 N 22 N 2b. ... a N a1 N a2 N ab Sectio 12 Tests of idepedece ad homogeeity I this lecture we will cosider a situatio whe our observatios are classified by two differet features ad we would like to test if these features are idepedet

More information

6.867 Machine learning, lecture 7 (Jaakkola) 1

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

More information

CS 270 Algorithms. Oliver Kullmann. Growth of Functions. Divide-and- Conquer Min-Max- Problem. Tutorial. Reading from CLRS for week 2

CS 270 Algorithms. Oliver Kullmann. Growth of Functions. Divide-and- Conquer Min-Max- Problem. Tutorial. Reading from CLRS for week 2 Geeral remarks Week 2 1 Divide ad First we cosider a importat tool for the aalysis of algorithms: Big-Oh. The we itroduce a importat algorithmic paradigm:. We coclude by presetig ad aalysig two examples.

More information

Reliability and Queueing

Reliability and Queueing Copyright 999 Uiversity of Califoria Reliability ad Queueig by David G. Messerschmitt Supplemetary sectio for Uderstadig Networked Applicatios: A First Course, Morga Kaufma, 999. Copyright otice: Permissio

More information

Sequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

Sequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece 1, 1, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet

More information

CEE 522 Autumn Uncertainty Concepts for Geotechnical Engineering

CEE 522 Autumn Uncertainty Concepts for Geotechnical Engineering CEE 5 Autum 005 Ucertaity Cocepts for Geotechical Egieerig Basic Termiology Set A set is a collectio of (mutually exclusive) objects or evets. The sample space is the (collectively exhaustive) collectio

More information

A statistical method to determine sample size to estimate characteristic value of soil parameters

A statistical method to determine sample size to estimate characteristic value of soil parameters A statistical method to determie sample size to estimate characteristic value of soil parameters Y. Hojo, B. Setiawa 2 ad M. Suzuki 3 Abstract Sample size is a importat factor to be cosidered i determiig

More information

Lecture 12: November 13, 2018

Lecture 12: November 13, 2018 Mathematical Toolkit Autum 2018 Lecturer: Madhur Tulsiai Lecture 12: November 13, 2018 1 Radomized polyomial idetity testig We will use our kowledge of coditioal probability to prove the followig lemma,

More information

Discrete Mathematics and Probability Theory Fall 2009 Satish Rao,David Tse Lecture 16. Multiple Random Variables and Applications to Inference

Discrete Mathematics and Probability Theory Fall 2009 Satish Rao,David Tse Lecture 16. Multiple Random Variables and Applications to Inference CS 70 Discrete Mathematics ad Probability Theory Fall 2009 Satish Rao,David Tse Lecture 16 Multiple Radom Variables ad Applicatios to Iferece I may probability problems, we have to deal with multiple r.v.

More information

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

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

More information

EXAMINATIONS OF THE ROYAL STATISTICAL SOCIETY

EXAMINATIONS OF THE ROYAL STATISTICAL SOCIETY EXAMINATIONS OF THE ROYAL STATISTICAL SOCIETY GRADUATE DIPLOMA, 016 MODULE : Statistical Iferece Time allowed: Three hours Cadidates should aswer FIVE questios. All questios carry equal marks. The umber

More information

1 Review of Probability & Statistics

1 Review of Probability & Statistics 1 Review of Probability & Statistics a. I a group of 000 people, it has bee reported that there are: 61 smokers 670 over 5 960 people who imbibe (drik alcohol) 86 smokers who imbibe 90 imbibers over 5

More information

This is an introductory course in Analysis of Variance and Design of Experiments.

This is an introductory course in Analysis of Variance and Design of Experiments. 1 Notes for M 384E, Wedesday, Jauary 21, 2009 (Please ote: I will ot pass out hard-copy class otes i future classes. If there are writte class otes, they will be posted o the web by the ight before class

More information

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

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

More information

Permutations, Combinations, and the Binomial Theorem

Permutations, Combinations, and the Binomial Theorem Permutatios, ombiatios, ad the Biomial Theorem Sectio Permutatios outig methods are used to determie the umber of members of a specific set as well as outcomes of a evet. There are may differet ways to

More information

A quick activity - Central Limit Theorem and Proportions. Lecture 21: Testing Proportions. Results from the GSS. Statistics and the General Population

A quick activity - Central Limit Theorem and Proportions. Lecture 21: Testing Proportions. Results from the GSS. Statistics and the General Population A quick activity - Cetral Limit Theorem ad Proportios Lecture 21: Testig Proportios Statistics 10 Coli Rudel Flip a coi 30 times this is goig to get loud! Record the umber of heads you obtaied ad calculate

More information

Practical Spectral Anaysis (continue) (from Boaz Porat s book) Frequency Measurement

Practical Spectral Anaysis (continue) (from Boaz Porat s book) Frequency Measurement Practical Spectral Aaysis (cotiue) (from Boaz Porat s book) Frequecy Measuremet Oe of the most importat applicatios of the DFT is the measuremet of frequecies of periodic sigals (eg., siusoidal sigals),

More information

A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece,, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet as

More information

CS / MCS 401 Homework 3 grader solutions

CS / MCS 401 Homework 3 grader solutions CS / MCS 401 Homework 3 grader solutios assigmet due July 6, 016 writte by Jāis Lazovskis maximum poits: 33 Some questios from CLRS. Questios marked with a asterisk were ot graded. 1 Use the defiitio of

More information

Topic 1 2: Sequences and Series. A sequence is an ordered list of numbers, e.g. 1, 2, 4, 8, 16, or

Topic 1 2: Sequences and Series. A sequence is an ordered list of numbers, e.g. 1, 2, 4, 8, 16, or Topic : Sequeces ad Series A sequece is a ordered list of umbers, e.g.,,, 8, 6, or,,,.... A series is a sum of the terms of a sequece, e.g. + + + 8 + 6 + or... Sigma Notatio b The otatio f ( k) is shorthad

More information

REPRESENTING MARKOV CHAINS WITH TRANSITION DIAGRAMS

REPRESENTING MARKOV CHAINS WITH TRANSITION DIAGRAMS Joural o Mathematics ad Statistics, 9 (3): 49-54, 3 ISSN 549-36 3 Sciece Publicatios doi:.38/jmssp.3.49.54 Published Olie 9 (3) 3 (http://www.thescipub.com/jmss.toc) REPRESENTING MARKOV CHAINS WITH TRANSITION

More information

1 Generating functions for balls in boxes

1 Generating functions for balls in boxes Math 566 Fall 05 Some otes o geeratig fuctios Give a sequece a 0, a, a,..., a,..., a geeratig fuctio some way of represetig the sequece as a fuctio. There are may ways to do this, with the most commo ways

More information

A widely used display of protein shapes is based on the coordinates of the alpha carbons - - C α

A widely used display of protein shapes is based on the coordinates of the alpha carbons - - C α Nice plottig of proteis: I A widely used display of protei shapes is based o the coordiates of the alpha carbos - - C α -s. The coordiates of the C α -s are coected by a cotiuous curve that roughly follows

More information

Queuing Theory. Basic properties, Markovian models, Networks of queues, General service time distributions, Finite source models, Multiserver queues

Queuing Theory. Basic properties, Markovian models, Networks of queues, General service time distributions, Finite source models, Multiserver queues Queuig Theory Basic properties, Markovia models, Networks of queues, Geeral service time distributios, Fiite source models, Multiserver queues Chapter 8 Kedall s Notatio for Queuig Systems A/B/X/Y/Z: A

More information

Goodness-of-Fit Tests and Categorical Data Analysis (Devore Chapter Fourteen)

Goodness-of-Fit Tests and Categorical Data Analysis (Devore Chapter Fourteen) Goodess-of-Fit Tests ad Categorical Data Aalysis (Devore Chapter Fourtee) MATH-252-01: Probability ad Statistics II Sprig 2019 Cotets 1 Chi-Squared Tests with Kow Probabilities 1 1.1 Chi-Squared Testig................

More information

Lecture 1 Probability and Statistics

Lecture 1 Probability and Statistics Wikipedia: Lecture 1 Probability ad Statistics Bejami Disraeli, British statesma ad literary figure (1804 1881): There are three kids of lies: lies, damed lies, ad statistics. popularized i US by Mark

More information

4.3 Growth Rates of Solutions to Recurrences

4.3 Growth Rates of Solutions to Recurrences 4.3. GROWTH RATES OF SOLUTIONS TO RECURRENCES 81 4.3 Growth Rates of Solutios to Recurreces 4.3.1 Divide ad Coquer Algorithms Oe of the most basic ad powerful algorithmic techiques is divide ad coquer.

More information

Design and Analysis of Algorithms

Design and Analysis of Algorithms Desig ad Aalysis of Algorithms Probabilistic aalysis ad Radomized algorithms Referece: CLRS Chapter 5 Topics: Hirig problem Idicatio radom variables Radomized algorithms Huo Hogwei 1 The hirig problem

More information

Introduction to probability Stochastic Process Queuing systems. TELE4642: Week2

Introduction to probability Stochastic Process Queuing systems. TELE4642: Week2 Itroductio to probability Stochastic Process Queuig systems TELE4642: Week2 Overview Refresher: Probability theory Termiology, defiitio Coditioal probability, idepedece Radom variables ad distributios

More information

The picture in figure 1.1 helps us to see that the area represents the distance traveled. Figure 1: Area represents distance travelled

The picture in figure 1.1 helps us to see that the area represents the distance traveled. Figure 1: Area represents distance travelled 1 Lecture : Area Area ad distace traveled Approximatig area by rectagles Summatio The area uder a parabola 1.1 Area ad distace Suppose we have the followig iformatio about the velocity of a particle, how

More information

Math 113 Exam 3 Practice

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

More information

Introduction to Automata Theory. Reading: Chapter 1

Introduction to Automata Theory. Reading: Chapter 1 Itroductio to Automata Theory Readig: Chapter 1 1 What is Automata Theory? Study of abstract computig devices, or machies Automato = a abstract computig device Note: A device eed ot eve be a physical hardware!

More information

Confidence Intervals for the Population Proportion p

Confidence Intervals for the Population Proportion p Cofidece Itervals for the Populatio Proportio p The cocept of cofidece itervals for the populatio proportio p is the same as the oe for, the samplig distributio of the mea, x. The structure is idetical:

More information

Solution of Final Exam : / Machine Learning

Solution of Final Exam : / Machine Learning Solutio of Fial Exam : 10-701/15-781 Machie Learig Fall 2004 Dec. 12th 2004 Your Adrew ID i capital letters: Your full ame: There are 9 questios. Some of them are easy ad some are more difficult. So, if

More information

September 2012 C1 Note. C1 Notes (Edexcel) Copyright - For AS, A2 notes and IGCSE / GCSE worksheets 1

September 2012 C1 Note. C1 Notes (Edexcel) Copyright   - For AS, A2 notes and IGCSE / GCSE worksheets 1 September 0 s (Edecel) Copyright www.pgmaths.co.uk - For AS, A otes ad IGCSE / GCSE worksheets September 0 Copyright www.pgmaths.co.uk - For AS, A otes ad IGCSE / GCSE worksheets September 0 Copyright

More information

4. Partial Sums and the Central Limit Theorem

4. Partial Sums and the Central Limit Theorem 1 of 10 7/16/2009 6:05 AM Virtual Laboratories > 6. Radom Samples > 1 2 3 4 5 6 7 4. Partial Sums ad the Cetral Limit Theorem The cetral limit theorem ad the law of large umbers are the two fudametal theorems

More information

( ) = is larger than. the variance of X V

( ) = is larger than. the variance of X V Stat 400, sectio 6. Methods of Poit Estimatio otes by Tim Pilachoski A oit estimate of a arameter is a sigle umber that ca be regarded as a sesible value for The selected statistic is called the oit estimator

More information

Math 140 Introductory Statistics

Math 140 Introductory Statistics 8.2 Testig a Proportio Math 1 Itroductory Statistics Professor B. Abrego Lecture 15 Sectios 8.2 People ofte make decisios with data by comparig the results from a sample to some predetermied stadard. These

More information

NOTES ON DISTRIBUTIONS

NOTES ON DISTRIBUTIONS NOTES ON DISTRIBUTIONS MICHAEL N KATEHAKIS Radom Variables Radom variables represet outcomes from radom pheomea They are specified by two objects The rage R of possible values ad the frequecy fx with which

More information

The Maximum-Likelihood Decoding Performance of Error-Correcting Codes

The Maximum-Likelihood Decoding Performance of Error-Correcting Codes The Maximum-Lielihood Decodig Performace of Error-Correctig Codes Hery D. Pfister ECE Departmet Texas A&M Uiversity August 27th, 2007 (rev. 0) November 2st, 203 (rev. ) Performace of Codes. Notatio X,

More information

Probability and MLE.

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

More information

Sets and Probabilistic Models

Sets and Probabilistic Models ets ad Probabilistic Models Berli Che Departmet of Computer ciece & Iformatio Egieerig Natioal Taiwa Normal Uiversity Referece: - D. P. Bertsekas, J. N. Tsitsiklis, Itroductio to Probability, ectios 1.1-1.2

More information

Problem Set 4 Due Oct, 12

Problem Set 4 Due Oct, 12 EE226: Radom Processes i Systems Lecturer: Jea C. Walrad Problem Set 4 Due Oct, 12 Fall 06 GSI: Assae Gueye This problem set essetially reviews detectio theory ad hypothesis testig ad some basic otios

More information

Chapter 10: Power Series

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

More information

Course Outline. Designing Control Systems. Proportional Controller. Amme 3500 : System Dynamics and Control. Root Locus. Dr. Stefan B.

Course Outline. Designing Control Systems. Proportional Controller. Amme 3500 : System Dynamics and Control. Root Locus. Dr. Stefan B. Amme 3500 : System Dyamics ad Cotrol Root Locus Course Outlie Week Date Cotet Assigmet Notes Mar Itroductio 8 Mar Frequecy Domai Modellig 3 5 Mar Trasiet Performace ad the s-plae 4 Mar Block Diagrams Assig

More information

PROBABILITY LOGIC: Part 2

PROBABILITY LOGIC: Part 2 James L Bec 2 July 2005 PROBABILITY LOGIC: Part 2 Axioms for Probability Logic Based o geeral cosideratios, we derived axioms for: Pb ( a ) = measure of the plausibility of propositio b coditioal o the

More information

Sets and Probabilistic Models

Sets and Probabilistic Models ets ad Probabilistic Models Berli Che Departmet of Computer ciece & Iformatio Egieerig Natioal Taiwa Normal iversity Referece: - D. P. Bertsekas, J. N. Tsitsiklis, Itroductio to Probability, ectios 1.1-1.2

More information

Chapter 2 The Monte Carlo Method

Chapter 2 The Monte Carlo Method Chapter 2 The Mote Carlo Method The Mote Carlo Method stads for a broad class of computatioal algorithms that rely o radom sampligs. It is ofte used i physical ad mathematical problems ad is most useful

More information

Lecture 9: September 19

Lecture 9: September 19 36-700: Probability ad Mathematical Statistics I Fall 206 Lecturer: Siva Balakrisha Lecture 9: September 9 9. Review ad Outlie Last class we discussed: Statistical estimatio broadly Pot estimatio Bias-Variace

More information

Discrete Mathematics for CS Spring 2007 Luca Trevisan Lecture 22

Discrete Mathematics for CS Spring 2007 Luca Trevisan Lecture 22 CS 70 Discrete Mathematics for CS Sprig 2007 Luca Trevisa Lecture 22 Aother Importat Distributio The Geometric Distributio Questio: A biased coi with Heads probability p is tossed repeatedly util the first

More information

Sequences, Series, and All That

Sequences, Series, and All That Chapter Te Sequeces, Series, ad All That. Itroductio Suppose we wat to compute a approximatio of the umber e by usig the Taylor polyomial p for f ( x) = e x at a =. This polyomial is easily see to be 3

More information

Seunghee Ye Ma 8: Week 5 Oct 28

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

More information

Fast Consensus Hypothesis Regeneration for Machine Translation

Fast Consensus Hypothesis Regeneration for Machine Translation Fast Cosesus Hypothesis Regeeratio for Machie Traslatio Boxig Che, George Foster ad Rolad Kuh Natioal Research Coucil Caada 283 Alexadre-Taché Boulevard, Gatieau (Québec), Caada J8X 3X7 {Boxig.Che, George.Foster,

More information

Random Variables, Sampling and Estimation

Random Variables, Sampling and Estimation Chapter 1 Radom Variables, Samplig ad Estimatio 1.1 Itroductio This chapter will cover the most importat basic statistical theory you eed i order to uderstad the ecoometric material that will be comig

More information

SDS 321: Introduction to Probability and Statistics

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

More information

P.3 Polynomials and Special products

P.3 Polynomials and Special products Precalc Fall 2016 Sectios P.3, 1.2, 1.3, P.4, 1.4, P.2 (radicals/ratioal expoets), 1.5, 1.6, 1.7, 1.8, 1.1, 2.1, 2.2 I Polyomial defiitio (p. 28) a x + a x +... + a x + a x 1 1 0 1 1 0 a x + a x +... +

More information

Part I: Covers Sequence through Series Comparison Tests

Part I: Covers Sequence through Series Comparison Tests Part I: Covers Sequece through Series Compariso Tests. Give a example of each of the followig: (a) A geometric sequece: (b) A alteratig sequece: (c) A sequece that is bouded, but ot coverget: (d) A sequece

More information

Math 475, Problem Set #12: Answers

Math 475, Problem Set #12: Answers Math 475, Problem Set #12: Aswers A. Chapter 8, problem 12, parts (b) ad (d). (b) S # (, 2) = 2 2, sice, from amog the 2 ways of puttig elemets ito 2 distiguishable boxes, exactly 2 of them result i oe

More information

(ii) Two-permutations of {a, b, c}. Answer. (B) P (3, 3) = 3! (C) 3! = 6, and there are 6 items in (A). ... Answer.

(ii) Two-permutations of {a, b, c}. Answer. (B) P (3, 3) = 3! (C) 3! = 6, and there are 6 items in (A). ... Answer. SOLUTIONS Homewor 5 Due /6/19 Exercise. (a Cosider the set {a, b, c}. For each of the followig, (A list the objects described, (B give a formula that tells you how may you should have listed, ad (C verify

More information