Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 12

Size: px
Start display at page:

Download "Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 12"

Transcription

1 EECS 70 Discrete Mathematics ad Probability Theory Sprig 204 Aat Sahai Note 2 Probability Examples Based o Coutig We will ow look at examples of radom experimets ad their correspodig sample spaces, alog with possible probability spaces ad evets. As we do so, we ll add a couple more tools to our repertoire: () Stirlig s Approximatio; ad (2) How to combie multiple idepedet experimets ito a sigle probability space. Fair Coi Flippig ad Stirlig s Approximatio Suppose we have a ubiased coi, ad our experimet cosists of flippig the coi 4 times. The sample space Ω cosists of the sixtee possible sequeces of H s ad T s. For a fair coi, the probabilities are assiged uiformly; the probability of each sample poit is 6. Cosider evet A 2 : the evet that there are exactly two heads. The probability of ay particular outcome with two heads (such as HT HT ) is 6. So the key is to cout A 2. How may such outcomes are there? There are ( 4 2) 6 ways of choosig the positios of the heads, ad these choices completely specify the sequece. So Pr[A 2 ] More geerally, if we flip the coi times, we get a sample space Ω of cardiality 2. The sample poits are all possible sequeces of H s ad T s. Now cosider the evet A r that we get exactly r H s whe we flip the coi times. This evet cosists of exactly ( ) r sample poits. Each has probability 2. So the probability of this evet, P[A r ] ( r) 2. It is iterestig to observe that as gets larger, the deomiator above gets larger expoetially i. But the umber of differet A r is just + ad so grows oly liearly with. So how does the probability distribute itself across the differet A r? That is what the fair coi tossig examples were showig you experimetally i the first probability lecture ote. But to get a aalytic grasp o what is goig o, we re goig to have to fid a way to traslate from the world of factorials (that we see i the umerator ( r) ) ad the world of expoetials (that we see i the deomiator). The key tool for doig this is the famous Stirlig s Approximatio:! 2π( e ). () I practice, this is a very good approximatio. (Plot it to see this!) It is also very surprisig at first glace. To uderstad somethig as simple as factorial which just ivolves the multiplicatio of wholesome itegers i order we eed to ivoke three irratioal umbers 2,π,e that seem to come from owhere. Why should multiplyig umbers i order have aythig to do with the legth of a diagoal of a square, the ratio of the circumferece of a circle to its diameter, ad the base of atural logarithms?!? This kid of likage across very differet areas is a part of the deep beauty of mathematics. EECS 70, Sprig 204, Note 2

2 We ca use Stirlig s approximatio to get a better ituitive hadle o ( r). To help us simplify, let s defie q r. ( ) r! r!( r)! 2π( e ) 2πr( r e )r 2π( r)( r e ) r (3) 2π r( r)r r ( r) r (4) 2π q( q)(q) q (( q)) ( q) (5) 2π q( q)q q ( q) ( q) (6) ( 2π q( q) q q ( q) ( q) ) (7) Notice that last term is actually somethig expoetial i. For example, plug i q 2 ad you will get 2. (q) q ( q) ( q) This gives us the curious observatio that about 2 π of all possible -legth biary strigs have exactly the same umber of zeros ad oes. Or i the laguage of probability, that is the approximate chace of gettig exactly the same umber of heads ad tails whe tossig a large (eve) umber of cois. Could this have somethig to do with what we had observed earlier experimetally i a sequece of coi tosses? We ll see later i the course. Card Shufflig The radom experimet cosists of shufflig a deck of cards. Ω is equal to the set of the 52! permutatios of the deck. The probability space is uiform. Note that we re really talkig about a idealized mathematical model of shufflig here; i real life, there will always be a bit of bias i our shufflig. However, the mathematical model is close eough to be useful. Poker Hads Here s aother experimet: shufflig a deck of cards ad dealig a poker had. I this case, S is the set of 52 cards ad our sample space Ω {all possible poker hads}, which correspods to choosig k 5 objects without replacemet from a set of size 52 where order does ot matter. Hece, as we saw i the previous Note, Ω ( ) , 598, 960. Sice the deck is assumed to be radomly shuffled, the probability of each outcome is equally likely ad we are therefore dealig with a uiform probability space. Let A be the evet that the poker had is a flush. [For those who are ot (yet) addicted to gamblig, a flush is a had i which all cards have the same suit, say Hearts.] Sice the probability space is uiform, computig Pr[A] reduces to simply computig A, or the umber of poker hads which are flushes. There are 3 cards i each suit, so the umber of flushes i each suit is ( ) ( 3 5. The total umber of flushes is therefore 4 3 ) 5. The we have Pr[had is a flush] 4 (3 ) 5 ) ( ! 5! 47! 5! 8! 52! (2) EECS 70, Sprig 204, Note 2 2

3 As a exercise, you should compare to what the Stirlig s approximatio would yield for the above exact calculatio. Balls ad Bis I this experimet, we will throw 20 (labeled) balls ito 0 (labeled) bis. Assume that each ball is equally likely to lad i ay bi, regardless of what happes to the other balls. If you wish to uderstad this situatio i terms of samplig a sequece of k elemets from a set S of cardiality : here the set S cosists of the 0 bis, ad we are samplig with replacemet k 20 times. The order of samplig matters, sice the balls are labeled. The sample space Ω is equal to {(b,b 2,...,b 20 ) : b i 0}, where the compoet b i deotes the bi i which ball i lads. The cardiality of the sample space, Ω, is equal to each elemet b i i the sequece has 0 possible choices, ad there are 20 elemets i the sequece. More geerally, if we throw m balls ito bis, we have a sample space of size m. The probability space is uiform; as we said earlier, each ball is equally likely to lad i ay bi. Let A be the evet that bi is empty. Sice the probability space is uiform, we simply eed to cout how may outcomes have this property. This is exactly the umber of ways all 20 balls ca fall ito the remaiig ie bis, which is Hece, Pr[A] 920 ( ) Let B be the evet that bi cotais at least oe ball. This evet is the complemet Ā of A, i.e., it cosists of precisely those sample poits which are ot i A. So Pr[B] Pr[A].88. More geerally, if we throw m balls ito bis, we have: ( ) m ( Pr[bi is empty] m. ) As we shall see, balls ad bis is aother probability space that shows up very ofte i EECS: for example, we ca thik of it as modelig a load balacig scheme, i which each job is set to a radom processor. It is also a more geeral model for problems we have previously cosidered. For example, flippig a fair coi 3 times is a special case i which the umber of balls (m) is 3 ad the umber of bis () is 2. Rollig two dice (a example i the previous lecture otes) is a special case i which m 2 ad 6. Birthday Paradox The birthday paradox is a remarkable pheomeo that examies the chaces that two people i a group have the same birthday. It is a paradox ot because of a logical cotradictio, but because it goes agaist ituitio. For ease of calculatio, we take the umber of days i a year to be 365. The U {,...,365}, ad the radom experimet cosists of drawig a sample of elemets from U, where the elemets are the birth dates of people i a group. The Ω 365. This is because each sample poit is a sequece of possible birthdays for people; so there are poits i the sequece ad each poit has 365 possible values. Let A be the evet that at least two people have the same birthday. If we wat to determie Pr[A], it might be simpler to istead compute the probability of the complemet of A, Pr[Ā]. Ā is the evet that o two people have the same birthday. Sice Pr[A] Pr[Ā], we ca the easily compute Pr[A]. We are agai workig i a uiform probability space, so we just eed to determie Ā. Equivaletly, we are computig the umber of ways there are for o two people to have the same birthday. There are 365 choices for the first perso, 364 for the secod,..., choices for the th perso, for a total of EECS 70, Sprig 204, Note 2 3

4 (365 + ). Note that this is simply a applicatio of the first rule of coutig; we are samplig without replacemet ad the order matters. Thus we have Pr[Ā] Ā Ω (365 +) 365. The Pr[A] (365 +) 365. This allows us to compute Pr[A] as a fuctio of the umber of people,. Of course, as icreases Pr[A] icreases. I fact, with 23 people you should be willig to bet that at least two people do have the same birthday, sice the Pr[A] is larger tha 50%! For 60 people, Pr[A] is over 99%. This is a somewhat surprisig aspect of the ature of radom fluctuatios. We will study the egieerig impacts of this later whe we thik about load balacig ad hash tables. Ufair cois ad how to combie experimets ito a sigle probability space Suppose that istead of a fair coi, we have a coi of bias p, ad our experimet cosists of flippig the coi 4 times. The sample space Ω still cosists of the sixtee possible sequeces of H s ad T s. However, the probability space depeds o p. If p 2 the probabilities are assiged uiformly; the probability of each sample poit is 6. What if the coi comes up heads with probability 2 3 ad tails with probability 3 (i.e. the bias is p 2 3 )? The the probabilities of differet outcomes are differet. For example, Pr[HHHH] , while Pr[T T HH] [Note: We have cheerfully multiplied probabilities here; But why is this allowed? It is ot always OK!] The multiplicatio here ca be justified i terms of uiform probabilities by thikig of the uderlyig experimet as rollig a fair three-sided die istead. We say H whe the die comes up or 2 ad say T whe the die comes up 3. I that case, there are a grad total of possible die-roll sequeces. Ad the 6 above comes from the differet outcomes that all get labeled HHHH. The same argumet works for justifyig the calculatio of TTHH s probability. What we are doig here is arguig what the 2 3 probability of heads meas. I geeral, whe we take make a ew uified probability space out of two completely idepedet ad separate experimets (these are experimets that caot ifluece each other i ay way), the the ew outcomes are pairs of outcomes. So the ew sample space Ω Ω Ω 2 usig set theoretic otatio for the set of all pairs where the first elemet is from Ω ad the secod is from Ω 2. The rule for evaluatig the probability of the idividual outcomes ω (ω,ω 2 ) is just Pr[ω] Pr [ω ] Pr 2 [ω 2 ]. This is geeralized i the atural way to lists loger tha two. For the ufair cois here, we are lookig at 4-tuples. What type of evets ca we cosider i this settig? Let evet S be the evet that all four coi tosses are the same. The S {HHHH,T T T T }. HHHH has probability ( 2 3 )4 ad T T T T has probability ( 3 )4. Thus, Pr[S] Pr[HHHH] + Pr[T T T T ] ( 2 3 )4 + ( 3 ) Next, cosider the evet A 2 : the evet that there are exactly two heads. We had see this oe earlier i the fair coi settig. This time, the probability of ay particular outcome with two heads (such as HT HT ) is ( 2 3 )2 ( 3 )2. Notice that the order of the heads does t matter i doig this calculatio. This is because real multiplicatio commutes. Oce agai, the key is to cout A 2. There are ( 4 2) 6 ways of choosig the positios of the heads, ad so Pr[A 2 ] 6( 2 3 )2 ( 3 ) More geerally, if we flip the biased coi times, we get a sample space Ω of cardiality 2. This is the same as the fair coi toss case. If the coi has bias p, ad if we cosider ay sequece of coi flips with exactly r H s, the the probability of this sequece is p r ( p) r. As before, we ca cosider the evet A r that we get exactly r H s whe we flip the coi times. This evet EECS 70, Sprig 204, Note 2 4

5 cosists of exactly ( ) r sample poits ad so the probability of this evet, P[Ar ] ( r) p r ( p) r. We ca use our earlier Stirlig s approximatio-based calculatio to shed some light o what this is like. As before, let q r. P[A r ] ( ) p r ( p) r r ( 2π q( q) q q ( q) ( q) ) (p q ( p) q ) (9) ) (0) ( ( p 2π q( q) q )q ( p q )( q) It is very iterestig to observe what happes whe p q above. I that case, Stirlig s approximatio says that the probability of gettig this outcome is like. 2π p( p) Biased coi-tossig sequeces show up i may cotexts: for example, they might model the behavior of trials of a faulty system, which fails each time with probability p. (8) Coditioal Probability Examples With coutig available to us, we ca cosider some more simple examples that deal with coditioal probability. Card Dealig What is the probability that, whe dealig 2 cards ad the first card is kow to be a ace, the secod card is also a ace? Let B be the evet that the first card is a ace, ad let A be the evet that the secod card is a ace. Note that P[A] P[B] 3. To compute Pr[A B], we eed to figure out Pr[A B]. This is the probability that both cards are aces. Note that there are 52 5 sample poits i the sample space, sice each sample poit is a sequece of two cards. A sample poit is i A B if both cards are aces. This ca happe i ways. Sice each sample poit is equally likely, Pr[A B] The probability of evet B, drawig a ace i the first trial, is Therefore, Pr[A B] Pr[A B] 3 Pr[B] 5. Note that this says that if the first card is a ace, it makes it less likely that the secod card is also a ace. Balls ad Bis Revisited Imagie we have two bis cotaiig black ad white balls, ad further suppose that we wated to kow what is the chace that we picked Bi give that we picked a white ball, i.e., Pr[Bi ]. Assume that we are ubiased whe choosig a bi so that each bi is chose with probability 2. EECS 70, Sprig 204, Note 2 5

6 A wrog approach is to say that the aswer is clearly 2 3, sice we kow there are a total of three white balls, two of which are i bi. However, this picture is misleadig because the bis have equal weight". Istead, what we should do is appropriately scale each sample poit as the followig picture shows: This images shows that the sample space Ω is equal to the uio of the evets cotaied i bi (A ) ad bi 2(A 2 ), so Ω A A 2. This is NOT the same as viewig this as two idepedet experimets. We get either somethig from bi or somethig from bi 2. We do t get oe from each. We ca use the defiitio of coditioal probability to see that Pr[Bi ] Let us try to achieve this probability usig Bayes rule. To apply Bayes rule, we eed to compute Pr[ Bi ], Pr[Bi ] ad Pr[ ]. Pr[ Bi ] is the chace that we pick a white ball give that we picked bi, which is 2 5. Pr[ Bi ] is 2 as give i the descriptio of the problem. Fially, Pr[ ] ca be computed usig the Total Probability rule: Pr[ ] Pr[ Bi ] Pr[Bi ] + Pr[ Bi 2] Pr[Bi 2] Observe that we ca apply the Total Probability rule here because Pr[ Bi ] is the complemet of Pr[ Bi 2]. Fially, if we plug the above values ito Bayes rule we obtai the probability that we picked bi give that we picked a white ball: Pr[Bi ] All we have doe above is combied Bayes rule ad the Total Probability rule. We could have equivaletly applied Bayes rule directly. Notice here that we were able to do the calculatio without beig very precise about what the uderlyig probability space is. This is ofte the case whe dealig with coditioal probability, but it is good to be able to precisely defie what outcomes are if you eed to. Here, the most atural choice of the uderylig sample space is to cosider the compositio of three idepedet ad distict experimets. Tossig a fair coi. Pickig somethig from Bi. Ad pickig somethig from Bi 2. If we further view each of the balls as beig distict, this is a uiform probability space i which each of the 20 possible outcomes EECS 70, Sprig 204, Note 2 6

7 Summary The examples above illustrate the importace of doig probability calculatios systematically, rather tha just ituitively." Recall the key steps i all our calculatios: What is the sample space (i.e., the experimet ad its set of possible outcomes)? What is the probability of each outcome (sample poit)? What is the evet we are iterested i (i.e., which subset of the sample space)? Fially, compute the probability of the evet by addig up the probabilities of the sample poits iside it. Wheever you meet a probability problem, you should always go back to these basics to avoid potetial pitfalls. Eve experieced researchers make mistakes whe they forget to do this witess may erroeous proofs, submitted by mathematicias to ewspapers at the time, of the fact that the switchig strategy i the Moty Hall problem does ot improve the odds. has probability If we istead view balls oly i terms of their color, the there are oly possibilities ad they are ot all equally likely. EECS 70, Sprig 204, Note 2 7

Discrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Note 13

Discrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Note 13 CS 70 Discrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Note 13 Introduction to Discrete Probability In the last note we considered the probabilistic experiment where we flipped a

More information

7. Counting Measure. Definitions and Basic Properties

7. Counting Measure. Definitions and Basic Properties Virtual Laboratories > 0. Foudatios > 1 2 3 4 5 6 7 8 9 7. Coutig Measure Defiitios ad Basic Properties Suppose that S is a fiite set. If A S the the cardiality of A is the umber of elemets i A, ad is

More information

Combinatorics. Chapter Permutations. Reading questions. Counting Problems. Counting Technique: The Product Rule

Combinatorics. Chapter Permutations. Reading questions. Counting Problems. Counting Technique: The Product Rule Chapter 3 Combiatorics 3.1 Permutatios Readig questios 1. Defie what a permutatio is i your ow words. 2. What is a fixed poit i a permutatio? 3. What do we assume about mutual disjoitedess whe creatig

More information

8. Combinatorial Structures

8. Combinatorial Structures Virtual Laboratories > 0. Foudatios > 1 2 3 4 5 6 7 8 9 8. Combiatorial Structures The purpose of this sectio is to study several combiatorial structures that are of basic importace i probability. Permutatios

More information

}, how many different strings of length n 1 exist? }, how many different strings of length n 2 exist that contain at least one a 1

}, how many different strings of length n 1 exist? }, how many different strings of length n 2 exist that contain at least one a 1 1. [5] Give sets A ad B, each of cardiality 1, how may fuctios map A i a oe-tooe fashio oto B? 2. [5] a. Give the set of r symbols { a 1, a 2,..., a r }, how may differet strigs of legth 1 exist? [5]b.

More information

Permutation Enumeration

Permutation Enumeration RMT 2012 Power Roud Rubric February 18, 2012 Permutatio Eumeratio 1 (a List all permutatios of {1, 2, 3} (b Give a expressio for the umber of permutatios of {1, 2, 3,, } i terms of Compute the umber for

More information

The topic for the third and final major portion of the course is Probability. We will aim to make sense of statements such as the following:

The topic for the third and final major portion of the course is Probability. We will aim to make sense of statements such as the following: CS 70 Discrete Mathematics for CS Spring 2006 Vazirani Lecture 17 Introduction to Probability The topic for the third and final major portion of the course is Probability. We will aim to make sense of

More information

1. The chance of getting a flush in a 5-card poker hand is about 2 in 1000.

1. The chance of getting a flush in a 5-card poker hand is about 2 in 1000. CS 70 Discrete Mathematics for CS Spring 2008 David Wagner Note 15 Introduction to Discrete Probability Probability theory has its origins in gambling analyzing card games, dice, roulette wheels. Today

More information

lecture notes September 2, Sequential Choice

lecture notes September 2, Sequential Choice 18.310 lecture otes September 2, 2013 Sequetial Choice Lecturer: Michel Goemas 1 A game Cosider the followig game. I have 100 blak cards. I write dow 100 differet umbers o the cards; I ca choose ay umbers

More information

The next several lectures will be concerned with probability theory. We will aim to make sense of statements such as the following:

The next several lectures will be concerned with probability theory. We will aim to make sense of statements such as the following: CS 70 Discrete Mathematics for CS Fall 2004 Rao Lecture 14 Introduction to Probability The next several lectures will be concerned with probability theory. We will aim to make sense of statements such

More information

We often find the probability of an event by counting the number of elements in a simple sample space.

We often find the probability of an event by counting the number of elements in a simple sample space. outig Methods We ofte fid the probability of a evet by coutig the umber of elemets i a simple sample space. Basic methods of coutig are: Permutatios ombiatios Permutatio A arragemet of objects i a defiite

More information

Logarithms APPENDIX IV. 265 Appendix

Logarithms APPENDIX IV. 265 Appendix APPENDIX IV Logarithms Sometimes, a umerical expressio may ivolve multiplicatio, divisio or ratioal powers of large umbers. For such calculatios, logarithms are very useful. They help us i makig difficult

More information

Unit 5: Estimating with Confidence

Unit 5: Estimating with Confidence Uit 5: Estimatig with Cofidece Sectio 8.2 The Practice of Statistics, 4 th editio For AP* STARNES, YATES, MOORE Uit 5 Estimatig with Cofidece 8.1 8.2 8.3 Cofidece Itervals: The Basics Estimatig a Populatio

More information

Summary of Random Variable Concepts April 19, 2000

Summary of Random Variable Concepts April 19, 2000 Summary of Radom Variable Cocepts April 9, 2000 his is a list of importat cocepts we have covered, rather tha a review that derives or explais them. he first ad primary viewpoit: A radom process is a idexed

More information

2. There are n letter and n addressed envelopes. The probability that all the letters are not kept in the right envelope, is. (c)

2. There are n letter and n addressed envelopes. The probability that all the letters are not kept in the right envelope, is. (c) PAGE # CHAPTER EXERCISE I. A sigle letter is selected at radom from the word PROBABILITY. The probability that the selected letter is a vowel is / / / 0. There are letter ad addressed evelopes. The probability

More information

Ch 9 Sequences, Series, and Probability

Ch 9 Sequences, Series, and Probability Ch 9 Sequeces, Series, ad Probability Have you ever bee to a casio ad played blackjack? It is the oly game i the casio that you ca wi based o the Law of large umbers. I the early 1990s a group of math

More information

THE LUCAS TRIANGLE RECOUNTED. Arthur T. Benjamin Dept. of Mathematics, Harvey Mudd College, Claremont, CA Introduction

THE LUCAS TRIANGLE RECOUNTED. Arthur T. Benjamin Dept. of Mathematics, Harvey Mudd College, Claremont, CA Introduction THE LUCAS TRIANLE RECOUNTED Arthur T Bejami Dept of Mathematics, Harvey Mudd College, Claremot, CA 91711 bejami@hmcedu 1 Itroductio I 2], Neville Robbis explores may properties of the Lucas triagle, a

More information

CS3203 #5. 6/9/04 Janak J Parekh

CS3203 #5. 6/9/04 Janak J Parekh CS3203 #5 6/9/04 Jaak J Parekh Admiistrivia Exam o Moday All slides should be up We ll try ad have solutios for HWs #1 ad #2 out by Friday I kow the HW is due o the same day; ot much I ca do, uless you

More information

Roberto s Notes on Infinite Series Chapter 1: Series Section 2. Infinite series

Roberto s Notes on Infinite Series Chapter 1: Series Section 2. Infinite series Roberto s Notes o Ifiite Series Chapter : Series Sectio Ifiite series What you eed to ow already: What sequeces are. Basic termiology ad otatio for sequeces. What you ca lear here: What a ifiite series

More information

1. How many possible ways are there to form five-letter words using only the letters A H? How many such words consist of five distinct letters?

1. How many possible ways are there to form five-letter words using only the letters A H? How many such words consist of five distinct letters? COMBINATORICS EXERCISES Stepha Wager 1. How may possible ways are there to form five-letter words usig oly the letters A H? How may such words cosist of five distict letters? 2. How may differet umber

More information

AS Exercise A: The multiplication principle. Probability using permutations and combinations. Multiplication principle. Example.

AS Exercise A: The multiplication principle. Probability using permutations and combinations. Multiplication principle. Example. Probability usig permutatios ad combiatios Multiplicatio priciple If A ca be doe i ways, ad B ca be doe i m ways, the A followed by B ca be doe i m ways. 1. A die ad a coi are throw together. How may results

More information

Combinatorics and probability

Combinatorics and probability Departmet of Mathematics Ma 3/03 KC Border Itroductio to Probability ad Statistics Witer 208 Lecture 3: Combiatorics ad probability Relevat textboo passages: Pitma [2]: Sectios.5.6, pp. 7 77; Appedix,

More information

x y z HD(x, y) + HD(y, z) HD(x, z)

x y z HD(x, y) + HD(y, z) HD(x, z) Massachusetts Istitute of Techology Departmet of Electrical Egieerig ad Computer Sciece 6.02 Solutios to Chapter 5 Updated: February 16, 2012 Please sed iformatio about errors or omissios to hari; questios

More information

PERMUTATION AND COMBINATION

PERMUTATION AND COMBINATION MPC 1 PERMUTATION AND COMBINATION Syllabus : Fudametal priciples of coutig; Permutatio as a arragemet ad combiatio as selectio, Meaig of P(, r) ad C(, r). Simple applicatios. Permutatios are arragemets

More information

PERMUTATIONS AND COMBINATIONS

PERMUTATIONS AND COMBINATIONS www.sakshieducatio.com PERMUTATIONS AND COMBINATIONS OBJECTIVE PROBLEMS. There are parcels ad 5 post-offices. I how may differet ways the registratio of parcel ca be made 5 (a) 0 (b) 5 (c) 5 (d) 5. I how

More information

Chapter (6) Discrete Probability Distributions Examples

Chapter (6) Discrete Probability Distributions Examples hapter () Discrete robability Distributios Eamples Eample () Two balaced dice are rolled. Let X be the sum of the two dice. Obtai the probability distributio of X. Solutio Whe the two balaced dice are

More information

Counting on r-fibonacci Numbers

Counting on r-fibonacci Numbers Claremot Colleges Scholarship @ Claremot All HMC Faculty Publicatios ad Research HMC Faculty Scholarship 5-1-2015 Coutig o r-fiboacci Numbers Arthur Bejami Harvey Mudd College Curtis Heberle Harvey Mudd

More information

arxiv: v2 [math.co] 15 Oct 2018

arxiv: v2 [math.co] 15 Oct 2018 THE 21 CARD TRICK AND IT GENERALIZATION DIBYAJYOTI DEB arxiv:1809.04072v2 [math.co] 15 Oct 2018 Abstract. The 21 card trick is well kow. It was recetly show i a episode of the popular YouTube chael Numberphile.

More information

Shuffling. Shahrzad Haddadan. March 7, 2013

Shuffling. Shahrzad Haddadan. March 7, 2013 Shufflig Shahrzad Haddada March 7, 2013 Abstract I this paper we will talk about two well-kow shufflig methods, the Top to Radom ad the Riffle Shuffle. We are iterested i the umber of shuffles that will

More information

Shuffling Cards. D.J.W. Telkamp. Utrecht University Mathematics Bachelor s Thesis. Supervised by Dr. K. Dajani

Shuffling Cards. D.J.W. Telkamp. Utrecht University Mathematics Bachelor s Thesis. Supervised by Dr. K. Dajani Shufflig Cards Utrecht Uiversity Mathematics Bachelor s Thesis D.J.W. Telkamp Supervised by Dr. K. Dajai Jue 3, 207 Cotets Itroductio 2 2 Prerequisites 2 2. Problems with the variatio distace................

More information

PERMUTATIONS AND COMBINATIONS

PERMUTATIONS AND COMBINATIONS Chapter 7 PERMUTATIONS AND COMBINATIONS Every body of discovery is mathematical i form because there is o other guidace we ca have DARWIN 7.1 Itroductio Suppose you have a suitcase with a umber lock. The

More information

Counting and Probability CMSC 250

Counting and Probability CMSC 250 Coutig ad Probabilit CMSC 50 1 Coutig Coutig elemets i a list: how ma itegers i the list from 1 to 10? how ma itegers i the list from m to? assumig m CMSC 50 How Ma i a List? How ma positive three-digit

More information

On the Number of Permutations on n Objects with. greatest cycle length

On the Number of Permutations on n Objects with. greatest cycle length Ž. ADVANCES IN APPLIED MATHEMATICS 0, 9807 998 ARTICLE NO. AM970567 O the Number of Permutatios o Obects with Greatest Cycle Legth k Solomo W. Golomb ad Peter Gaal Commuicatio Scieces Istitute, Uiersity

More information

APPLICATION NOTE UNDERSTANDING EFFECTIVE BITS

APPLICATION NOTE UNDERSTANDING EFFECTIVE BITS APPLICATION NOTE AN95091 INTRODUCTION UNDERSTANDING EFFECTIVE BITS Toy Girard, Sigatec, Desig ad Applicatios Egieer Oe criteria ofte used to evaluate a Aalog to Digital Coverter (ADC) or data acquisitio

More information

AMC AMS AMR ACS ACR ASR MSR MCR MCS CRS

AMC AMS AMR ACS ACR ASR MSR MCR MCS CRS Sectio 6.5: Combiatios Example Recall our five frieds, Ala, Cassie, Maggie, Seth ad Roger from the example at the begiig of the previous sectio. The have wo tickets for a cocert i Chicago ad everybody

More information

Table Of Contents Blues Turnarounds

Table Of Contents Blues Turnarounds Table Of Cotets Blues Turarouds Turaroud #1 Turaroud # Turaroud # Turaroud # Turaroud # Turaroud # Turaroud # Turaroud # Turaroud # Blues Turarouds Blues Soloig Masterclass Week 1 Steve Stie A Blues Turaroud

More information

A generalization of Eulerian numbers via rook placements

A generalization of Eulerian numbers via rook placements A geeralizatio of Euleria umbers via rook placemets Esther Baaia Steve Butler Christopher Cox Jeffrey Davis Jacob Ladgraf Scarlitte Poce Abstract We cosider a geeralizatio of Euleria umbers which cout

More information

CHAPTER 5 A NEAR-LOSSLESS RUN-LENGTH CODER

CHAPTER 5 A NEAR-LOSSLESS RUN-LENGTH CODER 95 CHAPTER 5 A NEAR-LOSSLESS RUN-LENGTH CODER 5.1 GENERAL Ru-legth codig is a lossless image compressio techique, which produces modest compressio ratios. Oe way of icreasig the compressio ratio of a ru-legth

More information

13 Legislative Bargaining

13 Legislative Bargaining 1 Legislative Bargaiig Oe of the most popular legislative models is a model due to Baro & Ferejoh (1989). The model has bee used i applicatios where the role of committees have bee studies, how the legislative

More information

X-Bar and S-Squared Charts

X-Bar and S-Squared Charts STATGRAPHICS Rev. 7/4/009 X-Bar ad S-Squared Charts Summary The X-Bar ad S-Squared Charts procedure creates cotrol charts for a sigle umeric variable where the data have bee collected i subgroups. It creates

More information

AMC AMS AMR ACS ACR ASR MSR MCR MCS CRS

AMC AMS AMR ACS ACR ASR MSR MCR MCS CRS Sectio 6.5: Combiatios Example Recall our five frieds, Ala, Cassie, Maggie, Seth ad Roger from the example at the begiig of the previous sectio. The have wo tickets for a cocert i Chicago ad everybody

More information

COMBINATORICS 2. Recall, in the previous lesson, we looked at Taxicabs machines, which always took the shortest path home

COMBINATORICS 2. Recall, in the previous lesson, we looked at Taxicabs machines, which always took the shortest path home COMBINATORICS BEGINNER CIRCLE 1/0/013 1. ADVANCE TAXICABS Recall, i the previous lesso, we looked at Taxicabs machies, which always took the shortest path home taxipath We couted the umber of ways that

More information

General Model :Algorithms in the Real World. Applications. Block Codes

General Model :Algorithms in the Real World. Applications. Block Codes Geeral Model 5-853:Algorithms i the Real World Error Correctig Codes I Overview Hammig Codes Liear Codes 5-853 Page message (m) coder codeword (c) oisy chael decoder codeword (c ) message or error Errors

More information

You Think You ve Got Problems? Marc Brodie Associate Professor of Mathematics, WJU

You Think You ve Got Problems? Marc Brodie Associate Professor of Mathematics, WJU You Thik You ve Got Problems? Marc Brodie Associate Professor of Mathematics, WJU Itroductio. My life, like that of ay other s, has its share of problems. I cosider myself fortuate, however, to have more

More information

Math 140 Introductory Statistics

Math 140 Introductory Statistics 6. Probability Distributio from Data Math Itroductory Statistics Professor Silvia Ferádez Chapter 6 Based o the book Statistics i Actio by A. Watkis, R. Scheaffer, ad G. Cobb. We have three ways of specifyig

More information

BOUNDS FOR OUT DEGREE EQUITABLE DOMINATION NUMBERS IN GRAPHS

BOUNDS FOR OUT DEGREE EQUITABLE DOMINATION NUMBERS IN GRAPHS BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN 2303-4874 (p), ISSN (o) 2303-4955 www.imvibl.org/bulletin Vol. 3(2013), 149-154 Former BULLETIN OF THE SOCIETY OF MATHEMATICIANS BANJA

More information

CCD Image Processing: Issues & Solutions

CCD Image Processing: Issues & Solutions CCD Image Processig: Issues & Solutios Correctio of Raw Image with Bias, Dark, Flat Images Raw File r x, y [ ] Dark Frame d[ x, y] Flat Field Image f [ xy, ] r[ x, y] d[ x, y] Raw Dark f [ xy, ] bxy [,

More information

COLLEGE ALGEBRA LECTURES Copyrights and Author: Kevin Pinegar

COLLEGE ALGEBRA LECTURES Copyrights and Author: Kevin Pinegar OLLEGE ALGEBRA LETURES opyrights ad Author: Kevi iegar 8.3 Advaced outig Techiques: ermutatios Ad ombiatios Factorial Notatio Before we ca discuss permutatio ad combiatio formulas we must itroduce factorial

More information

On Parity based Divide and Conquer Recursive Functions

On Parity based Divide and Conquer Recursive Functions O Parity based Divide ad Coquer Recursive Fuctios Sug-Hyu Cha Abstract The parity based divide ad coquer recursio trees are itroduced where the sizes of the tree do ot grow mootoically as grows. These

More information

Single Bit DACs in a Nutshell. Part I DAC Basics

Single Bit DACs in a Nutshell. Part I DAC Basics Sigle Bit DACs i a Nutshell Part I DAC Basics By Dave Va Ess, Pricipal Applicatio Egieer, Cypress Semicoductor May embedded applicatios require geeratig aalog outputs uder digital cotrol. It may be a DC

More information

Massachusetts Institute of Technology Dept. of Electrical Engineering and Computer Science Fall Semester, Introduction to EECS 2.

Massachusetts Institute of Technology Dept. of Electrical Engineering and Computer Science Fall Semester, Introduction to EECS 2. Massachusetts Istitute of Techology Dept. of Electrical Egieerig ad Computer Sciece Fall Semester, 006 6.08 Itroductio to EECS Prelab Exercises Pre-Lab#3 Modulatio, demodulatio, ad filterig are itegral

More information

Grade 6 Math Review Unit 3(Chapter 1) Answer Key

Grade 6 Math Review Unit 3(Chapter 1) Answer Key Grade 6 Math Review Uit (Chapter 1) Aswer Key 1. A) A pottery makig class charges a registratio fee of $25.00. For each item of pottery you make you pay a additioal $5.00. Write a expressio to represet

More information

Intermediate Information Structures

Intermediate Information Structures Modified from Maria s lectures CPSC 335 Itermediate Iformatio Structures LECTURE 11 Compressio ad Huffma Codig Jo Roke Computer Sciece Uiversity of Calgary Caada Lecture Overview Codes ad Optimal Codes

More information

POWERS OF 3RD ORDER MAGIC SQUARES

POWERS OF 3RD ORDER MAGIC SQUARES Fuzzy Sets, Rough Sets ad Multivalued Operatios ad Applicatios, Vol. 4, No. 1, (Jauary-Jue 01): 37 43 Iteratioal Sciece Press POWERS OF 3RD ORDER MAGIC SQUARES Sreerajii K.S. 1 ad V. Madhukar Mallayya

More information

Discrete Random Variables: Joint PMFs, Conditioning and Independence

Discrete Random Variables: Joint PMFs, Conditioning and Independence Discrete Radom Variables: Joit MFs Coditioig ad Ideedece Berli Che Deartmet of Comuter Sciece & Iformatio gieerig Natioal Taiwa Normal Uiversit Referece: - D.. Bertsekas J. N. Tsitsiklis Itroductio to

More information

Counting III. Today we ll briefly review some facts you dervied in recitation on Friday and then turn to some applications of counting.

Counting III. Today we ll briefly review some facts you dervied in recitation on Friday and then turn to some applications of counting. 6.04/18.06J Mathematics for Computer Sciece April 5, 005 Srii Devadas ad Eric Lehma Lecture Notes Coutig III Today we ll briefly review some facts you dervied i recitatio o Friday ad the tur to some applicatios

More information

Application of Improved Genetic Algorithm to Two-side Assembly Line Balancing

Application of Improved Genetic Algorithm to Two-side Assembly Line Balancing 206 3 rd Iteratioal Coferece o Mechaical, Idustrial, ad Maufacturig Egieerig (MIME 206) ISBN: 978--60595-33-7 Applicatio of Improved Geetic Algorithm to Two-side Assembly Lie Balacig Ximi Zhag, Qia Wag,

More information

BOTTLENECK BRANCH MARKING FOR NOISE CONSOLIDATION

BOTTLENECK BRANCH MARKING FOR NOISE CONSOLIDATION BOTTLENECK BRANCH MARKING FOR NOISE CONSOLIDATION IN MULTICAST NETWORKS Jordi Ros, Wei K. Tsai ad Mahadeve Iyer Departmet of Electrical ad Computer Egieerig Uiversity of Califoria, Irvie, CA 92697 {jros,

More information

A SELECTIVE POINTER FORWARDING STRATEGY FOR LOCATION TRACKING IN PERSONAL COMMUNICATION SYSTEMS

A SELECTIVE POINTER FORWARDING STRATEGY FOR LOCATION TRACKING IN PERSONAL COMMUNICATION SYSTEMS A SELETIVE POINTE FOWADING STATEGY FO LOATION TAKING IN PESONAL OUNIATION SYSTES Seo G. hag ad hae Y. Lee Departmet of Idustrial Egieerig, KAIST 373-, Kusug-Dog, Taejo, Korea, 305-70 cylee@heuristic.kaist.ac.kr

More information

PRACTICAL FILTER DESIGN & IMPLEMENTATION LAB

PRACTICAL FILTER DESIGN & IMPLEMENTATION LAB 1 of 7 PRACTICAL FILTER DESIGN & IMPLEMENTATION LAB BEFORE YOU BEGIN PREREQUISITE LABS Itroductio to Oscilloscope Itroductio to Arbitrary/Fuctio Geerator EXPECTED KNOWLEDGE Uderstadig of LTI systems. Laplace

More information

15 min/ Fall in New England

15 min/ Fall in New England 5 mi/ 0+ -4 Fall i New Eglad Before witer makes its appearace, a particularly warm fall bathes the forest i a golde shimmer. Durig the Idia Summer, New Eglad blossoms oe last time. Treetops are ablaze

More information

Efficient Feedback-Based Scheduling Policies for Chunked Network Codes over Networks with Loss and Delay

Efficient Feedback-Based Scheduling Policies for Chunked Network Codes over Networks with Loss and Delay Efficiet Feedback-Based Schedulig Policies for Chuked Network Codes over Networks with Loss ad Delay Aoosheh Heidarzadeh ad Amir H. Baihashemi Departmet of Systems ad Computer Egieerig, Carleto Uiversity,

More information

3. Error Correcting Codes

3. Error Correcting Codes 3. Error Correctig Codes Refereces V. Bhargava, Forward Error Correctio Schemes for Digital Commuicatios, IEEE Commuicatios Magazie, Vol 21 No1 11 19, Jauary 1983 Mischa Schwartz, Iformatio Trasmissio

More information

Mathematical Explorations of Card Tricks

Mathematical Explorations of Card Tricks Joh Carroll Uiversity Carroll Collected Seior Hoors Projects Theses, Essays, ad Seior Hoors Projects Sprig 2015 Mathematical Exploratios of Card Tricks Timothy R. Weeks Joh Carroll Uiversity, tweeks15@jcu.edu

More information

A Math Learning Center publication adapted and arranged by. EUGENE MAIER and LARRY LINNEN

A Math Learning Center publication adapted and arranged by. EUGENE MAIER and LARRY LINNEN A Math Learig Ceter publicatio adapted ad arraged by EUGENE MAIER ad LARRY LINNEN ALGEBRA THROUGH VISUAL PATTERNS, VOLUME 1 A Math Learig Ceter Resource Copyright 2005, 2004 by The Math Learig Ceter, PO

More information

Speak up Ask questions Find the facts Evaluate your choices Read the label and follow directions

Speak up Ask questions Find the facts Evaluate your choices Read the label and follow directions Whe it comes to usig medicie, it is importat to kow that o medicie is completely safe. The U.S. Food ad Drug Admiistratio (FDA) judges a drug to be safe eough to approve whe the beefits of the medicie

More information

Laboratory Exercise 3: Dynamic System Response Laboratory Handout AME 250: Fundamentals of Measurements and Data Analysis

Laboratory Exercise 3: Dynamic System Response Laboratory Handout AME 250: Fundamentals of Measurements and Data Analysis Laboratory Exercise 3: Dyamic System Respose Laboratory Hadout AME 50: Fudametals of Measuremets ad Data Aalysis Prepared by: Matthew Beigto Date exercises to be performed: Deliverables: Part I 1) Usig

More information

Department of Electrical and Computer Engineering, Cornell University. ECE 3150: Microelectronics. Spring Due on April 26, 2018 at 7:00 PM

Department of Electrical and Computer Engineering, Cornell University. ECE 3150: Microelectronics. Spring Due on April 26, 2018 at 7:00 PM Departmet of Electrical ad omputer Egieerig, orell Uiersity EE 350: Microelectroics Sprig 08 Homework 0 Due o April 6, 08 at 7:00 PM Suggested Readigs: a) Lecture otes Importat Notes: ) MAKE SURE THAT

More information

arxiv:math/ v2 [math.pr] 14 Mar 2006

arxiv:math/ v2 [math.pr] 14 Mar 2006 The Aals of Applied Probability 2006, Vol. 16, No. 1, 231 243 DOI: 10.1214/105051605000000692 c Istitute of Mathematical Statistics, 2006 arxiv:math/0501401v2 [math.pr] 14 Mar 2006 THE OVERHAND SHUFFLE

More information

Chapter 2: Probability

Chapter 2: Probability hapter : roaility A {FF}, B {MM}, {MF, FM, MM} The, A B 0/, B {MM}, B {MF, FM}, A B {FF,MM}, A, B a A B A B c A B d A B A B 4 a 8 hapter : roaility 9 5 a A B A B A B B A A B A B B A B B B A A c A B A B

More information

Fingerprint Classification Based on Directional Image Constructed Using Wavelet Transform Domains

Fingerprint Classification Based on Directional Image Constructed Using Wavelet Transform Domains 7 Figerprit Classificatio Based o Directioal Image Costructed Usig Wavelet Trasform Domais Musa Mohd Mokji, Syed Abd. Rahma Syed Abu Bakar, Zuwairie Ibrahim 3 Departmet of Microelectroic ad Computer Egieerig

More information

Procedia - Social and Behavioral Sciences 128 ( 2014 ) EPC-TKS 2013

Procedia - Social and Behavioral Sciences 128 ( 2014 ) EPC-TKS 2013 Available olie at www.sciecedirect.com ScieceDirect Procedia - Social ad Behavioral Scieces 18 ( 014 ) 399 405 EPC-TKS 013 Iductive derivatio of formulae by a computer Sava Grozdev a *, Veseli Nekov b

More information

Making sure metrics are meaningful

Making sure metrics are meaningful Makig sure metrics are meaigful Some thigs are quatifiable, but ot very useful CPU performace: MHz is ot the same as performace Cameras: Mega-Pixels is ot the same as quality Cosistet ad quatifiable metrics

More information

Join a Professional Association

Join a Professional Association Joi a Professioal Associatio 1. The secret job resource: professioal orgaizatios. You may ot kow this, but the career field you re i, or plaig to work i i the future, probably has at least oe professioal

More information

ON THE FUNDAMENTAL RELATIONSHIP BETWEEN THE ACHIEVABLE CAPACITY AND DELAY IN MOBILE WIRELESS NETWORKS

ON THE FUNDAMENTAL RELATIONSHIP BETWEEN THE ACHIEVABLE CAPACITY AND DELAY IN MOBILE WIRELESS NETWORKS Chapter ON THE FUNDAMENTAL RELATIONSHIP BETWEEN THE ACHIEVABLE CAPACITY AND DELAY IN MOBILE WIRELESS NETWORKS Xiaoju Li ad Ness B. Shroff School of Electrical ad Computer Egieerig, Purdue Uiversity West

More information

5 Quick Steps to Social Media Marketing

5 Quick Steps to Social Media Marketing 5 Quick Steps to Social Media Marketig Here's a simple guide to creatig goals, choosig what to post, ad trackig progress with cofidece. May of us dive ito social media marketig with high hopes to watch

More information

AC : USING ELLIPTIC INTEGRALS AND FUNCTIONS TO STUDY LARGE-AMPLITUDE OSCILLATIONS OF A PENDULUM

AC : USING ELLIPTIC INTEGRALS AND FUNCTIONS TO STUDY LARGE-AMPLITUDE OSCILLATIONS OF A PENDULUM AC 007-7: USING ELLIPTIC INTEGRALS AND FUNCTIONS TO STUDY LARGE-AMPLITUDE OSCILLATIONS OF A PENDULUM Josue Njock-Libii, Idiaa Uiversity-Purdue Uiversity-Fort Waye Josué Njock Libii is Associate Professor

More information

CS 201: Adversary arguments. This handout presents two lower bounds for selection problems using adversary arguments ëknu73,

CS 201: Adversary arguments. This handout presents two lower bounds for selection problems using adversary arguments ëknu73, CS 01 Schlag Jauary 6, 1999 Witer `99 CS 01: Adversary argumets This hadout presets two lower bouds for selectio problems usig adversary argumets ëku73, HS78, FG76ë. I these proofs a imagiary adversary

More information

Using Color Histograms to Recognize People in Real Time Visual Surveillance

Using Color Histograms to Recognize People in Real Time Visual Surveillance Usig Color Histograms to Recogize People i Real Time Visual Surveillace DANIEL WOJTASZEK, ROBERT LAGANIERE S.I.T.E. Uiversity of Ottawa, Ottawa, Otario CANADA daielw@site.uottawa.ca, lagaier@site.uottawa.ca

More information

VIII. Shell-Voicings

VIII. Shell-Voicings VIII. Shell-Voicigs A. The Cocept The 5th (ad ofte the root as well) ca be omitted from most 7th-chords. Ratioale: Most chords have perfect 5ths. The P5th is also preset as the rd partial i the overtoe

More information

A New Space-Repetition Code Based on One Bit Feedback Compared to Alamouti Space-Time Code

A New Space-Repetition Code Based on One Bit Feedback Compared to Alamouti Space-Time Code Proceedigs of the 4th WSEAS It. Coferece o Electromagetics, Wireless ad Optical Commuicatios, Veice, Italy, November 0-, 006 107 A New Space-Repetitio Code Based o Oe Bit Feedback Compared to Alamouti

More information

The Institute of Chartered Accountants of Sri Lanka

The Institute of Chartered Accountants of Sri Lanka The Istitute of Chartered Accoutats of Sri Laka Postgraduate Diploma i Busiess ad Fiace Quatitative Techiques for Busiess Hadout 02:Presetatio ad Aalysis of data Presetatio of Data The Stem ad Leaf Display

More information

PROJECT #2 GENERIC ROBOT SIMULATOR

PROJECT #2 GENERIC ROBOT SIMULATOR Uiversity of Missouri-Columbia Departmet of Electrical ad Computer Egieerig ECE 7330 Itroductio to Mechatroics ad Robotic Visio Fall, 2010 PROJECT #2 GENERIC ROBOT SIMULATOR Luis Alberto Rivera Estrada

More information

Spread Spectrum Signal for Digital Communications

Spread Spectrum Signal for Digital Communications Wireless Iformatio Trasmissio System Lab. Spread Spectrum Sigal for Digital Commuicatios Istitute of Commuicatios Egieerig Natioal Su Yat-se Uiversity Spread Spectrum Commuicatios Defiitio: The trasmitted

More information

A New Design of Log-Periodic Dipole Array (LPDA) Antenna

A New Design of Log-Periodic Dipole Array (LPDA) Antenna Joural of Commuicatio Egieerig, Vol., No., Ja.-Jue 0 67 A New Desig of Log-Periodic Dipole Array (LPDA) Atea Javad Ghalibafa, Seyed Mohammad Hashemi, ad Seyed Hassa Sedighy Departmet of Electrical Egieerig,

More information

Probability II. Overview. A Closer Look at Events The Probability of an Event. Dr Tom Ilvento Department of Food and Resource Economics

Probability II. Overview. A Closer Look at Events The Probability of an Event. Dr Tom Ilvento Department of Food and Resource Economics Oveview Pobability II D Tom Ilveto Depatmet of Food ad Resouce Ecoomics We will cotiue ou jouey though pobability This ivolves Moe tems!!! Defiig Evets Ways to lay out the sample space I will also give

More information

Compression Programs. Compression Outline. Multimedia. Lossless vs. Lossy. Encoding/Decoding. Analysis of Algorithms

Compression Programs. Compression Outline. Multimedia. Lossless vs. Lossy. Encoding/Decoding. Analysis of Algorithms Aalysis of Algorithms Compressio Programs File Compressio: Gzip, Bzip Archivers :Arc, Pkzip, Wirar, File Systems: NTFS Piyush Kumar (Lecture 5: Compressio) Welcome to 453 Source: Guy E. Blelloch, Emad,

More information

A Novel Three Value Logic for Computing Purposes

A Novel Three Value Logic for Computing Purposes Iteratioal Joural o Iormatio ad Electroics Egieerig, Vol. 3, No. 4, July 23 A Novel Three Value Logic or Computig Purposes Ali Soltai ad Saeed Mohammadi Abstract The aim o this article is to suggest a

More information

信號與系統 Signals and Systems

信號與系統 Signals and Systems Sprig 2 信號與系統 Sigals ad Systems Chapter SS- Sigals ad Systems Feg-Li Lia NTU-EE Feb Ju Figures ad images used i these lecture otes are adopted from Sigals & Systems by Ala V. Oppeheim ad Ala S. Willsky,

More information

Wavelength Band Switching in Multigranular Optical WDM Networks

Wavelength Band Switching in Multigranular Optical WDM Networks Wavelegth Bad Switchig i Multigraular Optical WDM Networks Vishal Aad Collaborators X. Cao,, Dr. Y. Xiog ad Dr. C. Qiao LANDER, CSE Departmet, SUNY at Buffalo ~1~ Vishal Aad Outlie λ The Problem with preset

More information

ADSP ADSP ADSP ADSP. Advanced Digital Signal Processing (18-792) Spring Fall Semester, Department of Electrical and Computer Engineering

ADSP ADSP ADSP ADSP. Advanced Digital Signal Processing (18-792) Spring Fall Semester, Department of Electrical and Computer Engineering ADSP ADSP ADSP ADSP Advaced Digital Sigal Processig (8-79) Sprig Fall Semester, 7 Departmet of Electrical ad Computer Egieerig OTES O RADOM PROCESSES I. Itroductio Radom processes are at the heart of most

More information

信號與系統 Signals and Systems

信號與系統 Signals and Systems Sprig 24 信號與系統 Sigals ad Systems Chapter SS- Sigals ad Systems Feg-Li Lia NTU-EE Feb4 Ju4 Figures ad images used i these lecture otes are adopted from Sigals & Systems by Ala V. Oppeheim ad Ala S. Willsky,

More information

Extra Practice 1. Name Date. Lesson 1.1: Patterns in Division

Extra Practice 1. Name Date. Lesson 1.1: Patterns in Division Master 1.22 Extra Practice 1 Lesso 1.1: Patters i Divisio 1. Which umbers are divisible by 4? By 5? How do you kow? a) 90 b) 134 c) 395 d) 1724 e) 30 f) 560 g) 3015 h) 74 i) 748 2. Write a 5-digit umber

More information

The Fundamental Capacity-Delay Tradeoff in Large Mobile Ad Hoc Networks

The Fundamental Capacity-Delay Tradeoff in Large Mobile Ad Hoc Networks The Fudametal Capacity-Delay Tradeoff i Large Mobile Ad Hoc Networks Xiaoju Li ad Ness B. Shroff School of Electrical ad Computer Egieerig, Purdue Uiversity West Lafayette, IN 47907, U.S.A. {lix, shroff}@ec.purdue.edu

More information

H2 Mathematics Pure Mathematics Section A Comprehensive Checklist of Concepts and Skills by Mr Wee Wen Shih. Visit: wenshih.wordpress.

H2 Mathematics Pure Mathematics Section A Comprehensive Checklist of Concepts and Skills by Mr Wee Wen Shih. Visit: wenshih.wordpress. H2 Mathematics Pure Mathematics Sectio A Comprehesive Checklist of Cocepts ad Skills by Mr Wee We Shih Visit: weshih.wordpress.com Updated: Ja 2010 Syllabus topic 1: Fuctios ad graphs 1.1 Checklist o Fuctios

More information

The Eye. Objectives: Introduction. PHY 192 The Eye 1

The Eye. Objectives: Introduction. PHY 192 The Eye 1 PHY 92 The Eye The Eye Objectives: Describe the basic process of image formatio by the huma eye ad how it ca be simulated i the laboratory. Kow what measuremets are ecessary to quatitatively diagose ear-sightedess

More information

HOW BAD RECEIVER COORDINATES CAN AFFECT GPS TIMING

HOW BAD RECEIVER COORDINATES CAN AFFECT GPS TIMING HOW BAD RECEIVER COORDINATES CAN AFFECT GPS TIMING H. Chadsey U.S. Naval Observatory Washigto, D.C. 2392 Abstract May sources of error are possible whe GPS is used for time comparisos. Some of these mo

More information

Design of FPGA- Based SPWM Single Phase Full-Bridge Inverter

Design of FPGA- Based SPWM Single Phase Full-Bridge Inverter Desig of FPGA- Based SPWM Sigle Phase Full-Bridge Iverter Afarulrazi Abu Bakar 1, *,Md Zarafi Ahmad 1 ad Farrah Salwai Abdullah 1 1 Faculty of Electrical ad Electroic Egieerig, UTHM *Email:afarul@uthm.edu.my

More information

Data Mining the Online Encyclopedia of Integer Sequences for New Identities Hieu Nguyen

Data Mining the Online Encyclopedia of Integer Sequences for New Identities Hieu Nguyen Slide 1 of 18 Data Miig the Olie Ecyclopedia of Iteger Sequeces for New Idetities Hieu Nguye Rowa Uiversity MAA-NJ Sectio Sprig Meetig March 31, 2012 2 MAA-NJ Sprig Meetig Data Miig OEIS.b ü Ackowledgemets

More information

4. INTERSYMBOL INTERFERENCE

4. INTERSYMBOL INTERFERENCE DATA COMMUNICATIONS 59 4. INTERSYMBOL INTERFERENCE 4.1 OBJECT The effects of restricted badwidth i basebad data trasmissio will be studied. Measuremets relative to itersymbol iterferece, usig the eye patter

More information