(b) By independence, the probability that the string 1011 is received correctly is

Size: px
Start display at page:

Download "(b) By independence, the probability that the string 1011 is received correctly is"

Transcription

1 Soluto to Problem (a) Let A be the evet that a 0 s trasmtted. Usg the total probablty theorem, the desred probablty s P(A)(1 ɛ ( 0)+ 1 P(A) ) (1 ɛ 1)=p(1 ɛ 0)+(1 p)(1 ɛ 1). (b) By depedece, the probablty that the strg 1011 s receved correctly s (1 ɛ 0)(1 ɛ 1) 3. (c) I order for a 0 to be decoded correctly, the receved strg must be 000, 001, 010, or 100. Gve that the strg trasmtted was 000, the probablty of recevg 000 s (1 ɛ 0) 3, ad the probablty of each of the strgs 001, 010, ad 100 s ɛ 0(1 ɛ 0) 2. Thus, the probablty of correct decodg s 3ɛ 0(1 ɛ 0) 2 +(1 ɛ 0) 3. (d) Whe the symbol s 0, the probabltes of correct decodg wth ad wthout the scheme of part (c) are 3ɛ 0(1 ɛ 0) 2 +(1 ɛ 0) 3 ad 1 ɛ 0, respectvely. Thus, the probablty s mproved wth the scheme of part (c) f or whch s equvalet to ɛ 0 < 1/2. (e) Usg Bayes rule, we have 3ɛ 0(1 ɛ 0) 2 +(1 ɛ 0) 3 > (1 ɛ 0), P(0 101) = (1 ɛ 0)(1 + 2ɛ 0) > 1, P(0)P(101 0) P(0)P(101 0) + P(1)P(101 1). The probabltes eeded the above formula are P(0) = p, P(1) = 1 p, P(101 0) = ɛ 2 0(1 ɛ 0), P(101 1) = ɛ 1(1 ɛ 1) 2. Soluto to Problem The aswer to ths problem s ot uque ad depeds o the assumptos we make o the reproductve strategy of the kg s parets. Suppose that the kg s parets had decded to have exactly two chldre ad the stopped. There are four possble ad equally lkely outcomes, amely BB, GG, BG, ad GB (B stads for boy ad G stads for grl ). Gve that at least oe chld was a boy (the kg), the outcome GG s elmated ad we are left wth three equally lkely outcomes (BB, BG, ad GB). The probablty that the sblg s male (the codtoal probablty of BB) s 1/3. Suppose o the other had that the kg s parets had decded to have chldre utl they would have a male chld. I that case, the kg s the secod chld, ad the sblg s female, wth certaty. 11

2 Soluto to Problem Flp the co twce. If the outcome s heads-tals, choose the opera. f the outcome s tals-heads, choose the moves. Otherwse, repeat the process, utl a decso ca be made. Let A k be the evet that a decso was made at the kth roud. Codtoal o the evet A k, the two choces are equally lkely, ad we have 1 P(opera) = P(opera A k )P(A k )= 2 P(A k)= 1 2. k=1 We have used here the property P(A k=0 k) = 1, whch s true as log as P(heads) > 0 ad P(tals) > 0. Soluto to Problem The system may be vewed as a seres coecto of three subsystems, deoted 1, 2, ad 3 Fg the text. The probablty that the etre system s operatoal s p 1p 2p 3, where p s the probablty that subsystem s operatoal. Usg the formulas for the probablty of success of a seres or a parallel system gve Example 1.24, we have k=1 p 1 = p, p 3 =1 (1 p) 2, ad p 2 =1 (1 p) ( 1 p ( 1 (1 p) 3)). Soluto to Problem Let A be the evet that exactly compoets are operatoal. The probablty that the system s operatoal s the probablty of the uo A, ad sce the A are dsjot, t s equal to P(A )= p(), where p() are the bomal probabltes. Thus, the probablty of a operatoal system s p (1 p). Soluto to Problem (a) Let A deote the evet that the cty expereces a black-out. Sce the power plats fal depedet of each other, we have P(A) = p. (b) There wll be a black-out f ether all or ay 1 power plats fal. These two evets are dsjot, so we ca calculate the probablty P(A) of a black-out by addg ther probabltes: ( ) P(A) = p + (1 p ) p j. =1 =1 12 =1 j

3 Here, (1 p ) pj s the probablty that 1 plats have faled ad plat s the j oe that has ot faled. Soluto to Problem The probablty that k 1 voce users ad k 2 data users smultaeously eed to be coected s p 1(k 1)p 2(k 2), where p 1(k 1)adp 2(k 2) are the correspodg bomal probabltes, gve by p (k )= ( k ) p k (1 p) k, =1, 2. The probablty that more users wat to use the system tha the system ca accommodate s the sum of all products p 1(k 1)p 2(k 2)ask 1 ad k 2 rage over all possble values whose total bt rate requremet k 1r 1+k 2r 2 exceeds the capacty c of the system. Thus, the desred probablty s p 1(k 1)p 2(k 2). {(k 1,k 2 ) k 1 r 1 +k 2 r 2 >c, k 1 1,k 2 2 } Soluto to Problem We have p T = P(at least 6 out of the 8 remag holes are wo by Tels), p W = P(at least 4 out of the 8 remag holes are wo by Wedy). Usg the bomal formulas, p T = 8 k=6 8 p k (1 p) 8 k, p W = k 8 k=4 8 (1 p) k p 8 k. k The amout of moey that Tels should get s 10 p T /(p T + p W ) dollars. Soluto to Problem Let the evet A be the evet that the professor teaches her class, ad let B be the evet that the weather s bad. We have ad Therefore, P(A) =P(B) P(A) =P(B)P(A B)+P(B c )P(A B c ), P(A B) = P(A B c )= p b(1 p b ), p g(1 p g). p b(1 p b ) + ( 1 P(B) ) 13 p g(1 p g).

4 ot a kg s 47/51. We cotue smlarly utl the 12th card. The probablty that the 12th card s ot a kg, gve that oe of the precedg 11 was a kg, s 37/41. (There are = 41 cards left, ad = 37 of them are ot kgs.) Fally, the codtoal probablty that the 13th card s a kg s 4/40. The desred probablty s Soluto to Problem Suppose we label the classes A, B, adc. The probablty that Joe ad Jae wll both be class A s the umber of possble combatos for class A that volve both Joe ad Jae, dvded by the total umber of combatos for class A. Therefore, ths probablty s Sce there are three classes, the probablty that Joe ad Jae ed up the same class s A much smpler soluto s as follows. We place Joe oe class. Regardg Jae, there are 89 possble slots, ad oly 29 of them place her the same class as Joe. Thus, the aswer s 29/89, whch turs out to agree wth the aswer obtaed earler. Soluto to Problem (a) Sce the cars are all dstct, there are 20! ways to le them up. (b) To fd the probablty that the cars wll be parked so that they alterate, we cout the umber of favorable outcomes, ad dvde by the total umber of possble outcomes foud part (a). We cout the followg maer. We frst arrage the US cars a ordered sequece (permutato). We ca do ths 10! ways, sce there are 10 dstct cars. Smlarly, arrage the foreg cars a ordered sequece, whch ca also be doe 10! ways. Fally, terleave the two sequeces. Ths ca be doe two dfferet ways, sce we ca let the frst car be ether US-made or foreg. Thus, we have a total of 2 10! 10! possbltes, ad the desred probablty s 2 10! 10!. 20! Note that we could have solved the secod part of the problem by eglectg the fact that the cars are dstct. Suppose the foreg cars are dstgushable, ad also that the US cars are dstgushable. Out of the 20 avalable spaces, we eed to choose 10 spaces whch to place the US cars, ad thus there are ( 20 10) possble outcomes. Out of these outcomes, there are oly two whch the cars alterate, depedg o 17

5 from a l-letter alphabet s equal to l 1 l!. w 1 Soluto to Problem (a) The sample space cossts of all ways of drawg 7 elemets out of a 52-elemet set, so t cotas 52 7 possble outcomes. Let us cout those outcomes that volve exactly 3 aces. We are free to select ay 3 out of the 4 aces, ad ay 4 out of the 48 remag cards, for a total of ( 4 48 ) 3)( 4 choces. Thus, 4 48 P(7 cards clude exactly 3 aces) = (b) Proceedg smlar to part (a), we obta P(7 cards clude exactly 2 kgs) = (c) If A ad B stad for the evets parts (a) ad (b), respectvely, we are lookg for P(A B) =P(A) +P(B) P(A B). The evet A B (havgexactly3aces ad exactly 2 kgs) ca occur by choosg 3 out of the 4 avalable aces, 2 out of the 4 avalable ) kgs, ad 2 more cards out of the remag 44. Thus, ths evet cossts of dstct outcomes. Hece, ( 4 )( 4 )( P(7 cards clude 3 aces ad/or 2 kgs) = Soluto to Problem Clearly f > m,or > k,orm > 100 k, the probablty must be zero. If m, k, adm 100 k, the we ca fd the probablty that the test drve foud of the 100 cars defectve by coutg the total umber of sze m subsets, ad the the umber of sze m subsets that cota lemos. Clearly, there are 100 m dfferet subsets of sze m. To cout the umber of sze m subsets wth lemos, we frst choose lemos from the k avalable lemos, ad the choose m good cars from the 100 k avalable good cars. Thus, the umber of ways to choose a subset of sze m from 100 cars, ad get lemos, s k 100 k, m 19

6 ad the desred probablty s k 100 k m. 100 m Soluto to Problem The sze of the sample space s the umber of dfferet ways that 52 objects ca be dvded 4 groups of 13, ad s gve by the multomal formula 52! 13! 13! 13! 13!. There are 4! dfferet ways of dstrbutg the 4 aces to the 4 players, ad there are 48! 12! 12! 12! 12! dfferet ways of dvdg the remag 48 cards to 4 groups of 12. Thus, the desred probablty s 48! 4! 12! 12! 12! 12!. 52! 13! 13! 13! 13! A alteratve soluto ca be obtaed by cosderg a dfferet, but probablstcally equvalet method of dealg the cards. Each player has 13 slots, each oe of whch s to receve oe card. Istead of shufflg the deck, we place the 4 aces at the top, ad start dealg the cards oe at a tme, wth each free slot beg equally lkely to receve the ext card. For the evet of terest to occur, the frst ace ca go aywhere; the secod ca go to ay oe of the 39 slots (out of the 51 avalable) that correspod to players that do ot yet have a ace; the thrd ca go to ay oe of the 26 slots (out of the 50 avalable) that correspod to the two players that do ot yet have a ace; ad fally, the fourth, ca go to ay oe of the 13 slots (out of the 49 avalable) that correspod to the oly player who does ot yet have a ace. Thus, the desred probablty s By smplfyg our prevous aswer, t ca be checked that t s the same as the oe obtaed here, thus corroboratg the tutve fact that the two dfferet ways of dealg the cards are probablstcally equvalet. 20

7

8 clear all, close all; load sequeces varble load sequece1.mat; sequece1 = test_sequece; p_1 = sum ( 1 == cov ( 1 /1 * [1 ], sequece1 ) ) / legth(sequece1); p_2 = sum ( 1 == cov ( 1 / 2 * [1 1 ], sequece1 ) ) /legth(sequece1); p_3 = sum ( 1 == cov ( 1 / 3 * [1 1 1 ], sequece1 ) ) / legth(sequece1); p_4 = sum ( 1 == cov ( 1 / 4 * [ ], sequece1 ) ) / legth(sequece1); p_5 = sum ( 1 == cov ( 1 / 5 * [ ], sequece1 ) ) / legth(sequece1); Probablty_sequece1=[p_1;p_2;p_3;p_4;p_5]; load sequece2.mat; sequece2 = test_sequece; p_1 = sum ( 1 == cov ( 1 /1 * [1 ], sequece2 ) ) / legth(sequece2); p_2 = sum ( 1 == cov ( 1 / 2 * [1 1 ], sequece2 ) ) /legth(sequece2); p_3 = sum ( 1 == cov ( 1 / 3 * [1 1 1 ], sequece2 ) ) / legth(sequece2); p_4 = sum ( 1 == cov ( 1 / 4 * [ ], sequece2 ) ) / legth(sequece2); p_5 = sum ( 1 == cov ( 1 / 5 * [ ], sequece2 ) ) / legth(sequece2); Probablty_sequece2=[p_1;p_2;p_3;p_4;p_5]; load sequece3.mat; sequece3 = test_sequece; p_1 = sum ( 1 == cov ( 1 /1 * [1 ], sequece3 ) ) / legth(sequece3); p_2 = sum ( 1 == cov ( 1 / 2 * [1 1 ], sequece3 ) ) /legth(sequece3); p_3 = sum ( 1 == cov ( 1 / 3 * [1 1 1 ], sequece3 ) ) / legth(sequece3); p_4 = sum ( 1 == cov ( 1 / 4 * [ ], sequece3 ) ) / legth(sequece3); p_5 = sum ( 1 == cov ( 1 / 5 * [ ], sequece3 ) ) / legth(sequece3); Probablty_sequece3=[p_1;p_2;p_3;p_4;p_5]; load sequece4.mat; sequece4 = test_sequece; p_1 = sum ( 1 == cov ( 1 /1 * [1 ], sequece4 ) ) / legth(sequece4); p_2 = sum ( 1 == cov ( 1 / 2 * [1 1 ], sequece4 ) ) /legth(sequece4); p_3 = sum ( 1 == cov ( 1 / 3 * [1 1 1 ], sequece4 ) ) / legth(sequece4); p_4 = sum ( 1 == cov ( 1 / 4 * [ ], sequece4 ) ) / legth(sequece4); p_5 = sum ( 1 == cov ( 1 / 5 * [ ], sequece4 ) ) / legth(sequece4); Probablty_sequece4=[p_1;p_2;p_3;p_4;p_5]; load sequece5.mat; sequece5 = test_sequece; p_1 = sum ( 1 == cov ( 1 /1 * [1 ], sequece5 ) ) / legth(sequece5); p_2 = sum ( 1 == cov ( 1 / 2 * [1 1 ], sequece5 ) ) /legth(sequece5); p_3 = sum ( 1 == cov ( 1 / 3 * [1 1 1 ], sequece5 ) ) / legth(sequece5); p_4 = sum ( 1 == cov ( 1 / 4 * [ ], sequece5 ) ) / legth(sequece5); p_5 = sum ( 1 == cov ( 1 / 5 * [ ], sequece5 ) ) / legth(sequece5);

9 Probablty_sequece5=[p_1;p_2;p_3;p_4;p_5]; load sequece6.mat; sequece6 = test_sequece; p_1 = sum ( 1 == cov ( 1 /1 * [1 ], sequece6 ) ) / legth(sequece6); p_2 = sum ( 1 == cov ( 1 / 2 * [1 1 ], sequece6 ) ) /legth(sequece6); p_3 = sum ( 1 == cov ( 1 / 3 * [1 1 1 ], sequece6 ) ) / legth(sequece6); p_4 = sum ( 1 == cov ( 1 / 4 * [ ], sequece6 ) ) / legth(sequece6); p_5 = sum ( 1 == cov ( 1 / 5 * [ ], sequece6 ) ) / legth(sequece6); Probablty_sequece6=[p_1;p_2;p_3;p_4;p_5]; Result=[Probablty_sequece1 Probablty_sequece2 Probablty_sequece3 Probablty_sequ

2. Independence and Bernoulli Trials

2. Independence and Bernoulli Trials . Ideedece ad Beroull Trals Ideedece: Evets ad B are deedet f B B. - It s easy to show that, B deedet mles, B;, B are all deedet ars. For examle, ad so that B or B B B B B φ,.e., ad B are deedet evets.,

More information

1 Onto functions and bijections Applications to Counting

1 Onto functions and bijections Applications to Counting 1 Oto fuctos ad bectos Applcatos to Coutg Now we move o to a ew topc. Defto 1.1 (Surecto. A fucto f : A B s sad to be surectve or oto f for each b B there s some a A so that f(a B. What are examples of

More information

Lecture 1. (Part II) The number of ways of partitioning n distinct objects into k distinct groups containing n 1,

Lecture 1. (Part II) The number of ways of partitioning n distinct objects into k distinct groups containing n 1, Lecture (Part II) Materals Covered Ths Lecture: Chapter 2 (2.6 --- 2.0) The umber of ways of parttog dstct obects to dstct groups cotag, 2,, obects, respectvely, where each obect appears exactly oe group

More information

CHAPTER 4 RADICAL EXPRESSIONS

CHAPTER 4 RADICAL EXPRESSIONS 6 CHAPTER RADICAL EXPRESSIONS. The th Root of a Real Number A real umber a s called the th root of a real umber b f Thus, for example: s a square root of sce. s also a square root of sce ( ). s a cube

More information

Discrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand DIS 10b

Discrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand DIS 10b CS 70 Dscrete Mathematcs ad Probablty Theory Fall 206 Sesha ad Walrad DIS 0b. Wll I Get My Package? Seaky delvery guy of some compay s out delverg packages to customers. Not oly does he had a radom package

More information

Mu Sequences/Series Solutions National Convention 2014

Mu Sequences/Series Solutions National Convention 2014 Mu Sequeces/Seres Solutos Natoal Coveto 04 C 6 E A 6C A 6 B B 7 A D 7 D C 7 A B 8 A B 8 A C 8 E 4 B 9 B 4 E 9 B 4 C 9 E C 0 A A 0 D B 0 C C Usg basc propertes of arthmetc sequeces, we fd a ad bm m We eed

More information

THE ROYAL STATISTICAL SOCIETY GRADUATE DIPLOMA

THE ROYAL STATISTICAL SOCIETY GRADUATE DIPLOMA THE ROYAL STATISTICAL SOCIETY 3 EXAMINATIONS SOLUTIONS GRADUATE DIPLOMA PAPER I STATISTICAL THEORY & METHODS The Socety provdes these solutos to assst caddates preparg for the examatos future years ad

More information

CHAPTER VI Statistical Analysis of Experimental Data

CHAPTER VI Statistical Analysis of Experimental Data Chapter VI Statstcal Aalyss of Expermetal Data CHAPTER VI Statstcal Aalyss of Expermetal Data Measuremets do ot lead to a uque value. Ths s a result of the multtude of errors (maly radom errors) that ca

More information

Homework 1: Solutions Sid Banerjee Problem 1: (Practice with Asymptotic Notation) ORIE 4520: Stochastics at Scale Fall 2015

Homework 1: Solutions Sid Banerjee Problem 1: (Practice with Asymptotic Notation) ORIE 4520: Stochastics at Scale Fall 2015 Fall 05 Homework : Solutos Problem : (Practce wth Asymptotc Notato) A essetal requremet for uderstadg scalg behavor s comfort wth asymptotc (or bg-o ) otato. I ths problem, you wll prove some basc facts

More information

MA 524 Homework 6 Solutions

MA 524 Homework 6 Solutions MA 524 Homework 6 Solutos. Sce S(, s the umber of ways to partto [] to k oempty blocks, ad c(, s the umber of ways to partto to k oempty blocks ad also the arrage each block to a cycle, we must have S(,

More information

2.28 The Wall Street Journal is probably referring to the average number of cubes used per glass measured for some population that they have chosen.

2.28 The Wall Street Journal is probably referring to the average number of cubes used per glass measured for some population that they have chosen. .5 x 54.5 a. x 7. 786 7 b. The raked observatos are: 7.4, 7.5, 7.7, 7.8, 7.9, 8.0, 8.. Sce the sample sze 7 s odd, the meda s the (+)/ 4 th raked observato, or meda 7.8 c. The cosumer would more lkely

More information

Chapter 1 Counting Methods

Chapter 1 Counting Methods AlbertLudwgs Uversty Freburg Isttute of Empral Researh ad Eoometrs Dr. Sevtap Kestel Mathematal Statsts - Wter 2008 Chapter Coutg Methods Am s to determe how may dfferet possbltes there are a gve stuato.

More information

The Mathematical Appendix

The Mathematical Appendix The Mathematcal Appedx Defto A: If ( Λ, Ω, where ( λ λ λ whch the probablty dstrbutos,,..., Defto A. uppose that ( Λ,,..., s a expermet type, the σ-algebra o λ λ λ are defed s deoted by ( (,,...,, σ Ω.

More information

PTAS for Bin-Packing

PTAS for Bin-Packing CS 663: Patter Matchg Algorthms Scrbe: Che Jag /9/00. Itroducto PTAS for B-Packg The B-Packg problem s NP-hard. If we use approxmato algorthms, the B-Packg problem could be solved polyomal tme. For example,

More information

STATISTICAL PROPERTIES OF LEAST SQUARES ESTIMATORS. x, where. = y - ˆ " 1

STATISTICAL PROPERTIES OF LEAST SQUARES ESTIMATORS. x, where. = y - ˆ  1 STATISTICAL PROPERTIES OF LEAST SQUARES ESTIMATORS Recall Assumpto E(Y x) η 0 + η x (lear codtoal mea fucto) Data (x, y ), (x 2, y 2 ),, (x, y ) Least squares estmator ˆ E (Y x) ˆ " 0 + ˆ " x, where ˆ

More information

Chapter 9 Jordan Block Matrices

Chapter 9 Jordan Block Matrices Chapter 9 Jorda Block atrces I ths chapter we wll solve the followg problem. Gve a lear operator T fd a bass R of F such that the matrx R (T) s as smple as possble. f course smple s a matter of taste.

More information

Probability is common sense reduced to calculation. Laplace

Probability is common sense reduced to calculation. Laplace Probablty s commo sese reduced to calculato. Laplace Our ma objectve ths lesso s to develop the art of descrbg ucertaty terms of probablstc models, as well as the skll of probablstc reasog (ferece). The

More information

Chapter 3 Sampling For Proportions and Percentages

Chapter 3 Sampling For Proportions and Percentages Chapter 3 Samplg For Proportos ad Percetages I may stuatos, the characterstc uder study o whch the observatos are collected are qualtatve ature For example, the resposes of customers may marketg surveys

More information

Lecture 9: Tolerant Testing

Lecture 9: Tolerant Testing Lecture 9: Tolerat Testg Dael Kae Scrbe: Sakeerth Rao Aprl 4, 07 Abstract I ths lecture we prove a quas lear lower boud o the umber of samples eeded to do tolerat testg for L dstace. Tolerat Testg We have

More information

For combinatorial problems we might need to generate all permutations, combinations, or subsets of a set.

For combinatorial problems we might need to generate all permutations, combinations, or subsets of a set. Addtoal Decrease ad Coquer Algorthms For combatoral problems we mght eed to geerate all permutatos, combatos, or subsets of a set. Geeratg Permutatos If we have a set f elemets: { a 1, a 2, a 3, a } the

More information

Pseudo-random Functions

Pseudo-random Functions Pseudo-radom Fuctos Debdeep Mukhopadhyay IIT Kharagpur We have see the costructo of PRG (pseudo-radom geerators) beg costructed from ay oe-way fuctos. Now we shall cosder a related cocept: Pseudo-radom

More information

{ }{ ( )} (, ) = ( ) ( ) ( ) Chapter 14 Exercises in Sampling Theory. Exercise 1 (Simple random sampling): Solution:

{ }{ ( )} (, ) = ( ) ( ) ( ) Chapter 14 Exercises in Sampling Theory. Exercise 1 (Simple random sampling): Solution: Chapter 4 Exercses Samplg Theory Exercse (Smple radom samplg: Let there be two correlated radom varables X ad A sample of sze s draw from a populato by smple radom samplg wthout replacemet The observed

More information

18.413: Error Correcting Codes Lab March 2, Lecture 8

18.413: Error Correcting Codes Lab March 2, Lecture 8 18.413: Error Correctg Codes Lab March 2, 2004 Lecturer: Dael A. Spelma Lecture 8 8.1 Vector Spaces A set C {0, 1} s a vector space f for x all C ad y C, x + y C, where we take addto to be compoet wse

More information

we have the probability for a given event to occur equals 1 the event will not occur. probability that

we have the probability for a given event to occur equals 1 the event will not occur. probability that 76 Chapter 6 Buckets & Balls Suppose you walk to a room wth people. How may people do there eed to be the room before you bet that there are two people wth the same brthday? Of course f there were a thousad

More information

Random Variables and Probability Distributions

Random Variables and Probability Distributions Radom Varables ad Probablty Dstrbutos * If X : S R s a dscrete radom varable wth rage {x, x, x 3,. } the r = P (X = xr ) = * Let X : S R be a dscrete radom varable wth rage {x, x, x 3,.}.If x r P(X = x

More information

Chapter 4 Multiple Random Variables

Chapter 4 Multiple Random Variables Revew for the prevous lecture: Theorems ad Examples: How to obta the pmf (pdf) of U = g (, Y) ad V = g (, Y) Chapter 4 Multple Radom Varables Chapter 44 Herarchcal Models ad Mxture Dstrbutos Examples:

More information

Introduction to Probability

Introduction to Probability Itroducto to Probablty Nader H Bshouty Departmet of Computer Scece Techo 32000 Israel e-mal: bshouty@cstechoacl 1 Combatorcs 11 Smple Rules I Combatorcs The rule of sum says that the umber of ways to choose

More information

Lecture 9. Some Useful Discrete Distributions. Some Useful Discrete Distributions. The observations generated by different experiments have

Lecture 9. Some Useful Discrete Distributions. Some Useful Discrete Distributions. The observations generated by different experiments have NM 7 Lecture 9 Some Useful Dscrete Dstrbutos Some Useful Dscrete Dstrbutos The observatos geerated by dfferet eermets have the same geeral tye of behavor. Cosequetly, radom varables assocated wth these

More information

Bayes (Naïve or not) Classifiers: Generative Approach

Bayes (Naïve or not) Classifiers: Generative Approach Logstc regresso Bayes (Naïve or ot) Classfers: Geeratve Approach What do we mea by Geeratve approach: Lear p(y), p(x y) ad the apply bayes rule to compute p(y x) for makg predctos Ths s essetally makg

More information

Bounds on the expected entropy and KL-divergence of sampled multinomial distributions. Brandon C. Roy

Bounds on the expected entropy and KL-divergence of sampled multinomial distributions. Brandon C. Roy Bouds o the expected etropy ad KL-dvergece of sampled multomal dstrbutos Brado C. Roy bcroy@meda.mt.edu Orgal: May 18, 2011 Revsed: Jue 6, 2011 Abstract Iformato theoretc quattes calculated from a sampled

More information

Investigation of Partially Conditional RP Model with Response Error. Ed Stanek

Investigation of Partially Conditional RP Model with Response Error. Ed Stanek Partally Codtoal Radom Permutato Model 7- vestgato of Partally Codtoal RP Model wth Respose Error TRODUCTO Ed Staek We explore the predctor that wll result a smple radom sample wth respose error whe a

More information

Chapter 11 Systematic Sampling

Chapter 11 Systematic Sampling Chapter stematc amplg The sstematc samplg techue s operatoall more coveet tha the smple radom samplg. It also esures at the same tme that each ut has eual probablt of cluso the sample. I ths method of

More information

Chapter 5 Properties of a Random Sample

Chapter 5 Properties of a Random Sample Lecture 6 o BST 63: Statstcal Theory I Ku Zhag, /0/008 Revew for the prevous lecture Cocepts: t-dstrbuto, F-dstrbuto Theorems: Dstrbutos of sample mea ad sample varace, relatoshp betwee sample mea ad sample

More information

Class 13,14 June 17, 19, 2015

Class 13,14 June 17, 19, 2015 Class 3,4 Jue 7, 9, 05 Pla for Class3,4:. Samplg dstrbuto of sample mea. The Cetral Lmt Theorem (CLT). Cofdece terval for ukow mea.. Samplg Dstrbuto for Sample mea. Methods used are based o CLT ( Cetral

More information

Feature Selection: Part 2. 1 Greedy Algorithms (continued from the last lecture)

Feature Selection: Part 2. 1 Greedy Algorithms (continued from the last lecture) CSE 546: Mache Learg Lecture 6 Feature Selecto: Part 2 Istructor: Sham Kakade Greedy Algorthms (cotued from the last lecture) There are varety of greedy algorthms ad umerous amg covetos for these algorthms.

More information

9 U-STATISTICS. Eh =(m!) 1 Eh(X (1),..., X (m ) ) i.i.d

9 U-STATISTICS. Eh =(m!) 1 Eh(X (1),..., X (m ) ) i.i.d 9 U-STATISTICS Suppose,,..., are P P..d. wth CDF F. Our goal s to estmate the expectato t (P)=Eh(,,..., m ). Note that ths expectato requres more tha oe cotrast to E, E, or Eh( ). Oe example s E or P((,

More information

1. Overview of basic probability

1. Overview of basic probability 13.42 Desg Prcples for Ocea Vehcles Prof. A.H. Techet Sprg 2005 1. Overvew of basc probablty Emprcally, probablty ca be defed as the umber of favorable outcomes dvded by the total umber of outcomes, other

More information

A Primer on Summation Notation George H Olson, Ph. D. Doctoral Program in Educational Leadership Appalachian State University Spring 2010

A Primer on Summation Notation George H Olson, Ph. D. Doctoral Program in Educational Leadership Appalachian State University Spring 2010 Summato Operator A Prmer o Summato otato George H Olso Ph D Doctoral Program Educatoal Leadershp Appalacha State Uversty Sprg 00 The summato operator ( ) {Greek letter captal sgma} s a structo to sum over

More information

Introduction to local (nonparametric) density estimation. methods

Introduction to local (nonparametric) density estimation. methods Itroducto to local (oparametrc) desty estmato methods A slecture by Yu Lu for ECE 66 Sprg 014 1. Itroducto Ths slecture troduces two local desty estmato methods whch are Parze desty estmato ad k-earest

More information

THE ROYAL STATISTICAL SOCIETY 2016 EXAMINATIONS SOLUTIONS HIGHER CERTIFICATE MODULE 5

THE ROYAL STATISTICAL SOCIETY 2016 EXAMINATIONS SOLUTIONS HIGHER CERTIFICATE MODULE 5 THE ROYAL STATISTICAL SOCIETY 06 EAMINATIONS SOLUTIONS HIGHER CERTIFICATE MODULE 5 The Socety s provdg these solutos to assst cadtes preparg for the examatos 07. The solutos are teded as learg ads ad should

More information

Non-uniform Turán-type problems

Non-uniform Turán-type problems Joural of Combatoral Theory, Seres A 111 2005 106 110 wwwelsevercomlocatecta No-uform Turá-type problems DhruvMubay 1, Y Zhao 2 Departmet of Mathematcs, Statstcs, ad Computer Scece, Uversty of Illos at

More information

SPECIAL CONSIDERATIONS FOR VOLUMETRIC Z-TEST FOR PROPORTIONS

SPECIAL CONSIDERATIONS FOR VOLUMETRIC Z-TEST FOR PROPORTIONS SPECIAL CONSIDERAIONS FOR VOLUMERIC Z-ES FOR PROPORIONS Oe s stctve reacto to the questo of whether two percetages are sgfcatly dfferet from each other s to treat them as f they were proportos whch the

More information

Pseudo-random Functions. PRG vs PRF

Pseudo-random Functions. PRG vs PRF Pseudo-radom Fuctos Debdeep Muhopadhyay IIT Kharagpur PRG vs PRF We have see the costructo of PRG (pseudo-radom geerators) beg costructed from ay oe-way fuctos. Now we shall cosder a related cocept: Pseudo-radom

More information

f f... f 1 n n (ii) Median : It is the value of the middle-most observation(s).

f f... f 1 n n (ii) Median : It is the value of the middle-most observation(s). CHAPTER STATISTICS Pots to Remember :. Facts or fgures, collected wth a defte pupose, are called Data.. Statstcs s the area of study dealg wth the collecto, presetato, aalyss ad terpretato of data.. The

More information

Chapter 4 (Part 1): Non-Parametric Classification (Sections ) Pattern Classification 4.3) Announcements

Chapter 4 (Part 1): Non-Parametric Classification (Sections ) Pattern Classification 4.3) Announcements Aoucemets No-Parametrc Desty Estmato Techques HW assged Most of ths lecture was o the blacboard. These sldes cover the same materal as preseted DHS Bometrcs CSE 90-a Lecture 7 CSE90a Fall 06 CSE90a Fall

More information

The Occupancy and Coupon Collector problems

The Occupancy and Coupon Collector problems Chapter 4 The Occupacy ad Coupo Collector problems By Sarel Har-Peled, Jauary 9, 08 4 Prelmares [ Defto 4 Varace ad Stadard Devato For a radom varable X, let V E [ X [ µ X deote the varace of X, where

More information

CS286.2 Lecture 4: Dinur s Proof of the PCP Theorem

CS286.2 Lecture 4: Dinur s Proof of the PCP Theorem CS86. Lecture 4: Dur s Proof of the PCP Theorem Scrbe: Thom Bohdaowcz Prevously, we have prove a weak verso of the PCP theorem: NP PCP 1,1/ (r = poly, q = O(1)). Wth ths result we have the desred costat

More information

å 1 13 Practice Final Examination Solutions - = CS109 Dec 5, 2018

å 1 13 Practice Final Examination Solutions - = CS109 Dec 5, 2018 Chrs Pech Fal Practce CS09 Dec 5, 08 Practce Fal Examato Solutos. Aswer: 4/5 8/7. There are multle ways to obta ths aswer; here are two: The frst commo method s to sum over all ossbltes for the rak of

More information

The number of observed cases The number of parameters. ith case of the dichotomous dependent variable. the ith case of the jth parameter

The number of observed cases The number of parameters. ith case of the dichotomous dependent variable. the ith case of the jth parameter LOGISTIC REGRESSION Notato Model Logstc regresso regresses a dchotomous depedet varable o a set of depedet varables. Several methods are mplemeted for selectg the depedet varables. The followg otato s

More information

THE ROYAL STATISTICAL SOCIETY HIGHER CERTIFICATE

THE ROYAL STATISTICAL SOCIETY HIGHER CERTIFICATE THE ROYAL STATISTICAL SOCIETY 00 EXAMINATIONS SOLUTIONS HIGHER CERTIFICATE PAPER I STATISTICAL THEORY The Socety provdes these solutos to assst caddates preparg for the examatos future years ad for the

More information

ρ < 1 be five real numbers. The

ρ < 1 be five real numbers. The Lecture o BST 63: Statstcal Theory I Ku Zhag, /0/006 Revew for the prevous lecture Deftos: covarace, correlato Examples: How to calculate covarace ad correlato Theorems: propertes of correlato ad covarace

More information

means the first term, a2 means the term, etc. Infinite Sequences: follow the same pattern forever.

means the first term, a2 means the term, etc. Infinite Sequences: follow the same pattern forever. 9.4 Sequeces ad Seres Pre Calculus 9.4 SEQUENCES AND SERIES Learg Targets:. Wrte the terms of a explctly defed sequece.. Wrte the terms of a recursvely defed sequece. 3. Determe whether a sequece s arthmetc,

More information

Special Instructions / Useful Data

Special Instructions / Useful Data JAM 6 Set of all real umbers P A..d. B, p Posso Specal Istructos / Useful Data x,, :,,, x x Probablty of a evet A Idepedetly ad detcally dstrbuted Bomal dstrbuto wth parameters ad p Posso dstrbuto wth

More information

STA 105-M BASIC STATISTICS (This is a multiple choice paper.)

STA 105-M BASIC STATISTICS (This is a multiple choice paper.) DCDM BUSINESS SCHOOL September Mock Eamatos STA 0-M BASIC STATISTICS (Ths s a multple choce paper.) Tme: hours 0 mutes INSTRUCTIONS TO CANDIDATES Do ot ope ths questo paper utl you have bee told to do

More information

Lecture 2 - What are component and system reliability and how it can be improved?

Lecture 2 - What are component and system reliability and how it can be improved? Lecture 2 - What are compoet ad system relablty ad how t ca be mproved? Relablty s a measure of the qualty of the product over the log ru. The cocept of relablty s a exteded tme perod over whch the expected

More information

Lecture 3 Probability review (cont d)

Lecture 3 Probability review (cont d) STATS 00: Itroducto to Statstcal Iferece Autum 06 Lecture 3 Probablty revew (cot d) 3. Jot dstrbutos If radom varables X,..., X k are depedet, the ther dstrbuto may be specfed by specfyg the dvdual dstrbuto

More information

Evaluating Polynomials

Evaluating Polynomials Uverst of Nebraska - Lcol DgtalCommos@Uverst of Nebraska - Lcol MAT Exam Expostor Papers Math the Mddle Isttute Partershp 7-7 Evaluatg Polomals Thomas J. Harrgto Uverst of Nebraska-Lcol Follow ths ad addtoal

More information

Algorithms Design & Analysis. Hash Tables

Algorithms Design & Analysis. Hash Tables Algorthms Desg & Aalyss Hash Tables Recap Lower boud Order statstcs 2 Today s topcs Drect-accessble table Hash tables Hash fuctos Uversal hashg Perfect Hashg Ope addressg 3 Symbol-table problem Symbol

More information

MEASURES OF DISPERSION

MEASURES OF DISPERSION MEASURES OF DISPERSION Measure of Cetral Tedecy: Measures of Cetral Tedecy ad Dsperso ) Mathematcal Average: a) Arthmetc mea (A.M.) b) Geometrc mea (G.M.) c) Harmoc mea (H.M.) ) Averages of Posto: a) Meda

More information

MATH 371 Homework assignment 1 August 29, 2013

MATH 371 Homework assignment 1 August 29, 2013 MATH 371 Homework assgmet 1 August 29, 2013 1. Prove that f a subset S Z has a smallest elemet the t s uque ( other words, f x s a smallest elemet of S ad y s also a smallest elemet of S the x y). We kow

More information

ENGI 4421 Joint Probability Distributions Page Joint Probability Distributions [Navidi sections 2.5 and 2.6; Devore sections

ENGI 4421 Joint Probability Distributions Page Joint Probability Distributions [Navidi sections 2.5 and 2.6; Devore sections ENGI 441 Jot Probablty Dstrbutos Page 7-01 Jot Probablty Dstrbutos [Navd sectos.5 ad.6; Devore sectos 5.1-5.] The jot probablty mass fucto of two dscrete radom quattes, s, P ad p x y x y The margal probablty

More information

Outline. Point Pattern Analysis Part I. Revisit IRP/CSR

Outline. Point Pattern Analysis Part I. Revisit IRP/CSR Pot Patter Aalyss Part I Outle Revst IRP/CSR, frst- ad secod order effects What s pot patter aalyss (PPA)? Desty-based pot patter measures Dstace-based pot patter measures Revst IRP/CSR Equal probablty:

More information

Lecture Notes Types of economic variables

Lecture Notes Types of economic variables Lecture Notes 3 1. Types of ecoomc varables () Cotuous varable takes o a cotuum the sample space, such as all pots o a le or all real umbers Example: GDP, Polluto cocetrato, etc. () Dscrete varables fte

More information

Chapter -2 Simple Random Sampling

Chapter -2 Simple Random Sampling Chapter - Smple Radom Samplg Smple radom samplg (SRS) s a method of selecto of a sample comprsg of umber of samplg uts out of the populato havg umber of samplg uts such that every samplg ut has a equal

More information

Chapter 13, Part A Analysis of Variance and Experimental Design. Introduction to Analysis of Variance. Introduction to Analysis of Variance

Chapter 13, Part A Analysis of Variance and Experimental Design. Introduction to Analysis of Variance. Introduction to Analysis of Variance Chapter, Part A Aalyss of Varace ad Epermetal Desg Itroducto to Aalyss of Varace Aalyss of Varace: Testg for the Equalty of Populato Meas Multple Comparso Procedures Itroducto to Aalyss of Varace Aalyss

More information

Runtime analysis RLS on OneMax. Heuristic Optimization

Runtime analysis RLS on OneMax. Heuristic Optimization Lecture 6 Rutme aalyss RLS o OeMax trals of {,, },, l ( + ɛ) l ( ɛ)( ) l Algorthm Egeerg Group Hasso Platter Isttute, Uversty of Potsdam 9 May T, We wat to rgorously uderstad ths behavor 9 May / Rutme

More information

Summary of the lecture in Biostatistics

Summary of the lecture in Biostatistics Summary of the lecture Bostatstcs Probablty Desty Fucto For a cotuos radom varable, a probablty desty fucto s a fucto such that: 0 dx a b) b a dx A probablty desty fucto provdes a smple descrpto of the

More information

Estimation of Stress- Strength Reliability model using finite mixture of exponential distributions

Estimation of Stress- Strength Reliability model using finite mixture of exponential distributions Iteratoal Joural of Computatoal Egeerg Research Vol, 0 Issue, Estmato of Stress- Stregth Relablty model usg fte mxture of expoetal dstrbutos K.Sadhya, T.S.Umamaheswar Departmet of Mathematcs, Lal Bhadur

More information

NATIONAL SENIOR CERTIFICATE GRADE 11

NATIONAL SENIOR CERTIFICATE GRADE 11 NATIONAL SENIOR CERTIFICATE GRADE MATHEMATICS P EXEMPLAR 007 MARKS: 50 TIME: 3 hours Ths questo paper cossts of 9 pages, a sheet of graph paper ad a -page formula sheet. Mathematcs/P INSTRUCTIONS AND INFORMATION

More information

Chapter -2 Simple Random Sampling

Chapter -2 Simple Random Sampling Chapter - Smple Radom Samplg Smple radom samplg (SRS) s a method of selecto of a sample comprsg of umber of samplg uts out of the populato havg umber of samplg uts such that every samplg ut has a equal

More information

Logistic regression (continued)

Logistic regression (continued) STAT562 page 138 Logstc regresso (cotued) Suppose we ow cosder more complex models to descrbe the relatoshp betwee a categorcal respose varable (Y) that takes o two (2) possble outcomes ad a set of p explaatory

More information

7. Joint Distributions

7. Joint Distributions 7. Jot Dstrbutos Chrs Pech ad Mehra Saham Ma 2017 Ofte ou wll work o problems where there are several radom varables (ofte teractg wth oe aother. We are gog to start to formall look at how those teractos

More information

Functions of Random Variables

Functions of Random Variables Fuctos of Radom Varables Chapter Fve Fuctos of Radom Varables 5. Itroducto A geeral egeerg aalyss model s show Fg. 5.. The model output (respose) cotas the performaces of a system or product, such as weght,

More information

X X X E[ ] E X E X. is the ()m n where the ( i,)th. j element is the mean of the ( i,)th., then

X X X E[ ] E X E X. is the ()m n where the ( i,)th. j element is the mean of the ( i,)th., then Secto 5 Vectors of Radom Varables Whe workg wth several radom varables,,..., to arrage them vector form x, t s ofte coveet We ca the make use of matrx algebra to help us orgaze ad mapulate large umbers

More information

The TDT. (Transmission Disequilibrium Test) (Qualitative and quantitative traits) D M D 1 M 1 D 2 M 2 M 2D1 M 1

The TDT. (Transmission Disequilibrium Test) (Qualitative and quantitative traits) D M D 1 M 1 D 2 M 2 M 2D1 M 1 The TDT (Trasmsso Dsequlbrum Test) (Qualtatve ad quattatve trats) Our am s to test for lkage (ad maybe ad/or assocato) betwee a dsease locus D ad a marker locus M. We kow where (.e. o what chromosome,

More information

Econometric Methods. Review of Estimation

Econometric Methods. Review of Estimation Ecoometrc Methods Revew of Estmato Estmatg the populato mea Radom samplg Pot ad terval estmators Lear estmators Ubased estmators Lear Ubased Estmators (LUEs) Effcecy (mmum varace) ad Best Lear Ubased Estmators

More information

DYNAMIC PROGRAMMING. Dynamic Programming. Costs. Prototype example. Solving the problem. Formulation

DYNAMIC PROGRAMMING. Dynamic Programming. Costs. Prototype example. Solving the problem. Formulation DYNAMIC PROGRAMMING Dyamc Programmg It s a useful mathematcal techque for makg a sequece of terrelated decsos. Systematc procedure for determg the optmal combato of decsos. There s o stadard mathematcal

More information

ENGI 4421 Propagation of Error Page 8-01

ENGI 4421 Propagation of Error Page 8-01 ENGI 441 Propagato of Error Page 8-01 Propagato of Error [Navd Chapter 3; ot Devore] Ay realstc measuremet procedure cotas error. Ay calculatos based o that measuremet wll therefore also cota a error.

More information

22 Nonparametric Methods.

22 Nonparametric Methods. 22 oparametrc Methods. I parametrc models oe assumes apror that the dstrbutos have a specfc form wth oe or more ukow parameters ad oe tres to fd the best or atleast reasoably effcet procedures that aswer

More information

Lebesgue Measure of Generalized Cantor Set

Lebesgue Measure of Generalized Cantor Set Aals of Pure ad Appled Mathematcs Vol., No.,, -8 ISSN: -8X P), -888ole) Publshed o 8 May www.researchmathsc.org Aals of Lebesgue Measure of Geeralzed ator Set Md. Jahurul Islam ad Md. Shahdul Islam Departmet

More information

Random Variables. ECE 313 Probability with Engineering Applications Lecture 8 Professor Ravi K. Iyer University of Illinois

Random Variables. ECE 313 Probability with Engineering Applications Lecture 8 Professor Ravi K. Iyer University of Illinois Radom Varables ECE 313 Probablty wth Egeerg Alcatos Lecture 8 Professor Rav K. Iyer Uversty of Illos Iyer - Lecture 8 ECE 313 Fall 013 Today s Tocs Revew o Radom Varables Cumulatve Dstrbuto Fucto (CDF

More information

Rademacher Complexity. Examples

Rademacher Complexity. Examples Algorthmc Foudatos of Learg Lecture 3 Rademacher Complexty. Examples Lecturer: Patrck Rebesch Verso: October 16th 018 3.1 Itroducto I the last lecture we troduced the oto of Rademacher complexty ad showed

More information

A tighter lower bound on the circuit size of the hardest Boolean functions

A tighter lower bound on the circuit size of the hardest Boolean functions Electroc Colloquum o Computatoal Complexty, Report No. 86 2011) A tghter lower boud o the crcut sze of the hardest Boolea fuctos Masak Yamamoto Abstract I [IPL2005], Fradse ad Mlterse mproved bouds o the

More information

Section 2:00 ~ 2:50 pm Thursday in Maryland 202 Sep. 29, 2005

Section 2:00 ~ 2:50 pm Thursday in Maryland 202 Sep. 29, 2005 Seto 2:00 ~ 2:50 pm Thursday Marylad 202 Sep. 29, 2005. Homework assgmets set ad 2 revews: Set : P. A box otas 3 marbles, red, gree, ad blue. Cosder a expermet that ossts of takg marble from the box, the

More information

D KL (P Q) := p i ln p i q i

D KL (P Q) := p i ln p i q i Cheroff-Bouds 1 The Geeral Boud Let P 1,, m ) ad Q q 1,, q m ) be two dstrbutos o m elemets, e,, q 0, for 1,, m, ad m 1 m 1 q 1 The Kullback-Lebler dvergece or relatve etroy of P ad Q s defed as m D KL

More information

CIS 800/002 The Algorithmic Foundations of Data Privacy October 13, Lecture 9. Database Update Algorithms: Multiplicative Weights

CIS 800/002 The Algorithmic Foundations of Data Privacy October 13, Lecture 9. Database Update Algorithms: Multiplicative Weights CIS 800/002 The Algorthmc Foudatos of Data Prvacy October 13, 2011 Lecturer: Aaro Roth Lecture 9 Scrbe: Aaro Roth Database Update Algorthms: Multplcatve Weghts We ll recall aga) some deftos from last tme:

More information

AN UPPER BOUND FOR THE PERMANENT VERSUS DETERMINANT PROBLEM BRUNO GRENET

AN UPPER BOUND FOR THE PERMANENT VERSUS DETERMINANT PROBLEM BRUNO GRENET AN UPPER BOUND FOR THE PERMANENT VERSUS DETERMINANT PROBLEM BRUNO GRENET Abstract. The Permaet versus Determat problem s the followg: Gve a matrx X of determates over a feld of characterstc dfferet from

More information

UNIT 4 SOME OTHER SAMPLING SCHEMES

UNIT 4 SOME OTHER SAMPLING SCHEMES UIT 4 SOE OTHER SAPLIG SCHEES Some Other Samplg Schemes Structure 4. Itroducto Objectves 4. Itroducto to Systematc Samplg 4.3 ethods of Systematc Samplg Lear Systematc Samplg Crcular Systematc Samplg Advatages

More information

1. The weight of six Golden Retrievers is 66, 61, 70, 67, 92 and 66 pounds. The weight of six Labrador Retrievers is 54, 60, 72, 78, 84 and 67.

1. The weight of six Golden Retrievers is 66, 61, 70, 67, 92 and 66 pounds. The weight of six Labrador Retrievers is 54, 60, 72, 78, 84 and 67. Ecoomcs 3 Itroducto to Ecoometrcs Sprg 004 Professor Dobk Name Studet ID Frst Mdterm Exam You must aswer all the questos. The exam s closed book ad closed otes. You may use your calculators but please

More information

2006 Jamie Trahan, Autar Kaw, Kevin Martin University of South Florida United States of America

2006 Jamie Trahan, Autar Kaw, Kevin Martin University of South Florida United States of America SOLUTION OF SYSTEMS OF SIMULTANEOUS LINEAR EQUATIONS Gauss-Sedel Method 006 Jame Traha, Autar Kaw, Kev Mart Uversty of South Florda Uted States of Amerca kaw@eg.usf.edu Itroducto Ths worksheet demostrates

More information

Unsupervised Learning and Other Neural Networks

Unsupervised Learning and Other Neural Networks CSE 53 Soft Computg NOT PART OF THE FINAL Usupervsed Learg ad Other Neural Networs Itroducto Mture Destes ad Idetfablty ML Estmates Applcato to Normal Mtures Other Neural Networs Itroducto Prevously, all

More information

8.1 Hashing Algorithms

8.1 Hashing Algorithms CS787: Advaced Algorthms Scrbe: Mayak Maheshwar, Chrs Hrchs Lecturer: Shuch Chawla Topc: Hashg ad NP-Completeess Date: September 21 2007 Prevously we looked at applcatos of radomzed algorthms, ad bega

More information

Lecture 3. Sampling, sampling distributions, and parameter estimation

Lecture 3. Sampling, sampling distributions, and parameter estimation Lecture 3 Samplg, samplg dstrbutos, ad parameter estmato Samplg Defto Populato s defed as the collecto of all the possble observatos of terest. The collecto of observatos we take from the populato s called

More information

ELEMENTARY PROBLEMS AND SOLUTIONS

ELEMENTARY PROBLEMS AND SOLUTIONS ELEMENTARY PROBLEMS AND SOLUTIONS EDITED BY So L. BASIN, SYLVANIA ELECTRONIC SYSTEMS, MT. VIEW, CALIF. Sed all commucatos regardg Elemetary Problems Solutos to S e L 8 Bas, 946 Rose Ave., Redwood Cty,

More information

The Selection Problem - Variable Size Decrease/Conquer (Practice with algorithm analysis)

The Selection Problem - Variable Size Decrease/Conquer (Practice with algorithm analysis) We have covered: Selecto, Iserto, Mergesort, Bubblesort, Heapsort Next: Selecto the Qucksort The Selecto Problem - Varable Sze Decrease/Coquer (Practce wth algorthm aalyss) Cosder the problem of fdg the

More information

Packing of graphs with small product of sizes

Packing of graphs with small product of sizes Joural of Combatoral Theory, Seres B 98 (008) 4 45 www.elsever.com/locate/jctb Note Packg of graphs wth small product of szes Alexadr V. Kostochka a,b,,gexyu c, a Departmet of Mathematcs, Uversty of Illos,

More information

1. A real number x is represented approximately by , and we are told that the relative error is 0.1 %. What is x? Note: There are two answers.

1. A real number x is represented approximately by , and we are told that the relative error is 0.1 %. What is x? Note: There are two answers. PROBLEMS A real umber s represeted appromately by 63, ad we are told that the relatve error s % What s? Note: There are two aswers Ht : Recall that % relatve error s What s the relatve error volved roudg

More information

Lecture 7. Confidence Intervals and Hypothesis Tests in the Simple CLR Model

Lecture 7. Confidence Intervals and Hypothesis Tests in the Simple CLR Model Lecture 7. Cofdece Itervals ad Hypothess Tests the Smple CLR Model I lecture 6 we troduced the Classcal Lear Regresso (CLR) model that s the radom expermet of whch the data Y,,, K, are the outcomes. The

More information

9.1 Introduction to the probit and logit models

9.1 Introduction to the probit and logit models EC3000 Ecoometrcs Lecture 9 Probt & Logt Aalss 9. Itroducto to the probt ad logt models 9. The logt model 9.3 The probt model Appedx 9. Itroducto to the probt ad logt models These models are used regressos

More information

hp calculators HP 30S Statistics Averages and Standard Deviations Average and Standard Deviation Practice Finding Averages and Standard Deviations

hp calculators HP 30S Statistics Averages and Standard Deviations Average and Standard Deviation Practice Finding Averages and Standard Deviations HP 30S Statstcs Averages ad Stadard Devatos Average ad Stadard Devato Practce Fdg Averages ad Stadard Devatos HP 30S Statstcs Averages ad Stadard Devatos Average ad stadard devato The HP 30S provdes several

More information