Probability and Stochastic Processes: A Friendly Introduction for Electrical and Computer Engineers Roy D. Yates and David J.
|
|
- Avice Merritt
- 5 years ago
- Views:
Transcription
1 Probability and Stochastic Processes: A Friendly Introduction for Electrical and oputer Engineers Roy D. Yates and David J. Goodan Proble Solutions : Yates and Goodan, and Proble 1..3 The saple space is S A K A K A K A K The event H is the set H A K Proble The saple space of the experient is S LF BF LW BW Fro the proble stateent, we know that P LF 0, P BF 0 and P BW 0. This iplies P LW The questions can be answered using Theore 1.. (a) The probability that a progra is slow is PW P LW P BW (b) The probability that a progra is big is P B P BF P BW (c) The probability that a progra is slow or big is PW B PW P B P BW Proble It is tepting to use the following proof: Since S and φ are utually exclusive, and since S S φ, Since P S 1, we ust have P φ 0. 1 P S φ P S P φ 1
2 The above proof used the property that for utually exclusive sets A 1 and A, P A 1 A P A 1 P A The proble is that this property is a consequence of the three axios, and thus ust be proven. For a proof that uses just the three axios, let A 1 be an arbitrary set and for n 3, let A n φ. Since A 1 A i, we can use Axio 3 to write P A 1 P A i P A 1 P A By subtracting P A 1 fro both sides, the fact that A P φ P A i 0 n 3 P A i i 3 φ perits us to write By Axio 1, P A i 0 for all i. Thus, n 3 P A i 0. This iplies P φ 0. Since Axio 1 requires P φ 0, we ust have P φ 0. Proble Following the hint, we define the set of events A i such that, A i B i and for i, A i φ. By construction, B i A i. Axio 3 then iplies P B i P A i P A i For i, P A i 0, yielding P B i P A i P B i Proble Theore 1.7 requires a proof fro which we can check which axios are used. However, the proble is soewhat hard because there ay still be a sipler proof that uses fewer axios. Still, the proof of each part will need Theore 1.4 which we now prove. For the utually exclusive events B 1 B, let A i B i for and let A i φ for i. In that case, by Axio 3, P B 1 B B P A 1 A! 1 P A i i Now, we use Axio 3 again on A A " 1 to write! 1 P B i P A i P A i i P A i P A A " 1 P B i
3 Thus, we have used just Axio 3 to prove Theore 1.4: P B 1 B # B P B i % ' % (a) To show P φ 0, let B 1 S and let B φ. Thus by Theore 1.4 P S P B 1 B P B 1 P B P S P φ Thus, P φ 0. Note that this proof uses only Theore 1.4 which uses only Axio 3. (b) Using Theore 1.4 with B 1 A and B A c, we have P S P A A c P A$ P A c Since, Axio says P S 1, P A c 1 P A. This proof uses Axios and 3. (c) By Theore 1., we can write both A and B as unions of disjoint events: A &% AB'( AB c B &% AB' A c B' Now we apply Theore 1.4 to write P A P AB P AB c P B P AB P A c B We can rewrite these facts as P AB c P A$ P AB P A c B P B$ P AB (1) Note that so far we have used only Axio 3. Finally, we observe that A the union of utually exclusive events B can be written as Once again, using Theore 1.4, we have A B &% AB' % AB c ' % A c B' P A B P AB P AB c P A c B () Substituting the results of Equation 1 into Equation yields P A B P AB$ P A P AB P B P AB which copletes the proof. Note that this clai required only Axio 3. (d) Observe that since A ) B, we can write B as the disjoint union B A % A c B'. By Theore 1.4 (which uses Axio 3), P B P A$ P A c B By Axio 1, P A c B 0, hich iplies P A P B. This proof uses Axios 1 and 3. 3
4 Proble 1..6 The proble stateent yields the obvious facts that P L 0 16 and P H The words 10% of the ticks that had either Lye disease or HGE carried both diseases can be written as (a) Since LH ) L H, P LH L H 0 10 P LH * % L H'+ P LH L H P L H P LH P L H 0 10 Thus, Since P L 0 16 and P H 0 10, P LH 0 10P L H 0 10 % P L P H P LH,' P LH 0 10 % ' (b) The conditional probability that a tick has Lye disease given that it has HGE is P L H P LH P H 0 36 Proble (a) For any events A and B, we can write the law of total probability in the for of P A P AB P AB c Since A and B are independent, P AB P A P B. This iplies Thus A and B c are independent. P AB c P A P A P B P A % 1 P B-' P A P B c (b) Proving that A c and B are independent is not really necessary. Since A and B are arbitrary labels, it is really the sae clai as in part (a). That is, siply reversing the labels of A and B proves the clai. Alternatively, one can construct exactly the sae proof as in part (a) with the labels A and B reversed. (c) To prove that A c and B c are independent, we apply the result of part (a) to the sets A and B c. Since we know fro part (a) that A and B c are independent, part (b) says that A c and B c are independent. 4
5 > > > > Proble In the Venn diagra at right, assue the saple space has area 1 corresponding to probability 1. As drawn, A, B, and each have area 1. 3 and thus probability The three way intersection AB has zero probability, iplying A, B, and are not utually independent since ;: P AB 0 / P A P B P However, AB, B, and A each has area As a result, each pair of events is independent since P AB P A P B P B P B P P A P A P Proble 1.7. The P H is the probability that a person who has HIV tests negative for the disease. This is referred to as a false-negative result. The case where a person who does not have HIV but tests positive for the disease, is called a false-positive result and has probability P H c. Since the test is correct 99% of the tie, P H P H c 0 01 Now the probability that a person who has tested positive for HIV actually has the disease is P H < P H P = P H P H$ P H c We can use Bayes forula to evaluate these joint probabilities. P H < P H P H P H P H P H c P H c % 0 99' % 0 000' % 0 99' % 0 000'( % 0 01' % ' Thus, even though the test is correct 99% of the tie, the probability that a rando person who tests positive actually has HIV is less than 0.0. The reason this probability is so low is that the a priori probability that a person has HIV is very sall. Proble The tree for this experient is 1? > > A 1 1? B 1 A A A A1? 4A A H 1 T 3? 4 1 B 3? 4 B B B B B 1? 4 H 1 T 1 A A A A 3? 4A A H T 1? B 3? 4 B B H B B B 1? 4 T A A A A 1? 4A A H T 3? B 1? 4 B B H B B B 3? 4 T A 1 H 1 H 3? 3 A 1 H 1 T 1? 3 A 1 T 1 H 9? 3 A 1 T 1 T 3? 3 B 1 H 1 H 3? 3 B 1 H 1 T 9? 3 B 1 T 1 H 1? 3 B 1 T 1 T 3? 3
6 The event H 1 H that heads occurs on both flips has probability The probability of H 1 is Siilarly, P H 1 H P A 1 H 1 H $ P B 1 H 1 H 6. 3 P H 1 P A 1 H 1 H P A 1 H 1 T P B 1 H 1 H P B 1 H 1 T 1. P H P A 1 H 1 H P A 1 T 1 H P B 1 H 1 H P B 1 T 1 H 1. Thus P H 1 H =/ P H 1 P H, iplying H 1 and H are not independent. This result should not be surprising since if the first flip is heads, it is likely that coin B was picked first. In this case, the second flip is less likely to be heads since it becoes ore likely that the second coin flipped was coin A. Proble What our design ust specify is the nuber of boxes on the ticket, and the nuber of specially arked boxes. Suppose each ticket has n boxes and k specially arked boxes. Note that when k 0, a winning ticket will still have k unscratched boxes with the special ark. A ticket is a winner if each tie a box is scratched off, the box has the special ark. Assuing the boxes are scratched off randoly, the first box scratched off has the ark with probability % k'. n since there are k arked boxes out of n boxes. Moreover, if the first scratched box has the ark, then there are 4 k arked boxes out of n 1 reaining boxes. ontinuing this arguent, the probability that a ticket is a winner is k 4 k 3 k k 1 k % k '! % n '! p n n 1 n n 3 n 4 k!n! By careful choice of n and k, we can choose p close to For exaple, soe possible choices are n k p Probably, a gaecard with N 14 boxes and k 7 shaded boxes would be quite reasonable. Proble (a) There are 3 group 1 kickers and 6 group kickers. Using G i to denote that a group i kicker was chosen, we have P G P G. 3 In addition, the proble stateent tells us that P K G 1 1. P K G 1. 3 obining these facts using the Law of Total Probability yields P K P K G 1 P G 1 P K G P G &% 1. ' % 1. 3'( % 1. 3' %. 3'
7 (b) To solve this part, we need to identify the groups fro which the first and second kicker were chosen. Let c i indicate whether a kicker was chosen fro group i and let i j indicate that the first kicker was chosen fro group i and he second kicker fro group j. The experient to choose the kickers is described by the saple tree: A A A A 3? 9A A c 1 B B B B B B 6? 9 c A A A A? 8 A A c 1 c 6? 8 B 3? 8 B B c B 1 B B? 8 c 11 1? 1 1 1? 4 1 1? 4? 1 Since a kicker fro group 1 akes a kick with probability 1. while a kicker fro group akes a kick with probability 1. 3, P K 1 K 11 &% 1. ' P K 1 K 1 D% 1. ' % 1. 3' P K 1 K 1 &% 1. 3' % 1. ' P K 1 K D% 1. 3' By the law of total probability, P K 1 K P K 1 K 11 P 11 P K 1 K 1 P 1 P K 1 K 1 P 1 P K 1 K P It should be apparent that P K 1 P K fro part (a). Syetry should also ake it clear that P K 1 P K since for any ordering of two kickers, the reverse ordering is equally likely. If this is not clear, we derive this result by calculating P K i j and using the law of total probability to calculate P K. By the law of total probability, P K P K P K 1 1. P K 1. 3 P K P K 11 P 11 P K 1 P 1 P K 1 P 1 P K P We observe that K 1 and K are not independent since P K 1 K 1 96 / P K 1 P K
8 Note that and % 7. 18' are close but not exactly the sae. The reason K 1 and K are dependent is that if the first kicker is successful, then it is ore likely that kicker is fro group 1. This akes it ore likely that the second kicker is fro group and is thus ore likely to iss. (c) Once a kicker is chosen, each of the 10 field goals is an independent trial. If the kicker is fro group 1, then the success probability is 1.. If the kicker is fro group, the success probability is Out of 10 kicks, there are isses iff there are successful kicks. Given the type of kicker chosen, the probability of isses is P M G 1 10 % 1. ' % 1. ' P M G 10 % 1. 3' %. 3' We use the Law of Total Probability to find P M P M G 1 P G 1 P M G P G 10 % 1. 3' % 1. ' 10 %. 3' % 1. 3' %. 3' 8
Bayes Theorem & Diagnostic Tests Screening Tests
Bayes heore & Diagnostic ests Screening ests Box contains 2 red balls and blue ball Box 2 contains red ball and 3 blue balls A coin is tossed. If Head turns up a ball is drawn fro Box, and if ail turns
More informationLecture 21 Principle of Inclusion and Exclusion
Lecture 21 Principle of Inclusion and Exclusion Holden Lee and Yoni Miller 5/6/11 1 Introduction and first exaples We start off with an exaple Exaple 11: At Sunnydale High School there are 28 students
More information16 Independence Definitions Potential Pitfall Alternative Formulation. mcs-ftl 2010/9/8 0:40 page 431 #437
cs-ftl 010/9/8 0:40 page 431 #437 16 Independence 16.1 efinitions Suppose that we flip two fair coins siultaneously on opposite sides of a roo. Intuitively, the way one coin lands does not affect the way
More informationThe Weierstrass Approximation Theorem
36 The Weierstrass Approxiation Theore Recall that the fundaental idea underlying the construction of the real nubers is approxiation by the sipler rational nubers. Firstly, nubers are often deterined
More informationA := A i : {A i } S. is an algebra. The same object is obtained when the union in required to be disjoint.
59 6. ABSTRACT MEASURE THEORY Having developed the Lebesgue integral with respect to the general easures, we now have a general concept with few specific exaples to actually test it on. Indeed, so far
More informationKey Concepts. Key Concepts. Event Relations. Event Relations
Probability and Probability Distributions Event Relations S B B Event Relations The intersection of two events, and B, is the event that both and B occur when the experient is perfored. We write B. S Event
More informationWhat is Probability? (again)
INRODUCTION TO ROBBILITY Basic Concepts and Definitions n experient is any process that generates well-defined outcoes. Experient: Record an age Experient: Toss a die Experient: Record an opinion yes,
More information13.2 Fully Polynomial Randomized Approximation Scheme for Permanent of Random 0-1 Matrices
CS71 Randoness & Coputation Spring 018 Instructor: Alistair Sinclair Lecture 13: February 7 Disclaier: These notes have not been subjected to the usual scrutiny accorded to foral publications. They ay
More information1 Generalization bounds based on Rademacher complexity
COS 5: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #0 Scribe: Suqi Liu March 07, 08 Last tie we started proving this very general result about how quickly the epirical average converges
More informationSolutions of some selected problems of Homework 4
Solutions of soe selected probles of Hoework 4 Sangchul Lee May 7, 2018 Proble 1 Let there be light A professor has two light bulbs in his garage. When both are burned out, they are replaced, and the next
More informationIn this chapter, we consider several graph-theoretic and probabilistic models
THREE ONE GRAPH-THEORETIC AND STATISTICAL MODELS 3.1 INTRODUCTION In this chapter, we consider several graph-theoretic and probabilistic odels for a social network, which we do under different assuptions
More informationPolygonal Designs: Existence and Construction
Polygonal Designs: Existence and Construction John Hegean Departent of Matheatics, Stanford University, Stanford, CA 9405 Jeff Langford Departent of Matheatics, Drake University, Des Moines, IA 5011 G
More informationA1. Find all ordered pairs (a, b) of positive integers for which 1 a + 1 b = 3
A. Find all ordered pairs a, b) of positive integers for which a + b = 3 08. Answer. The six ordered pairs are 009, 08), 08, 009), 009 337, 674) = 35043, 674), 009 346, 673) = 3584, 673), 674, 009 337)
More informationCSE525: Randomized Algorithms and Probabilistic Analysis May 16, Lecture 13
CSE55: Randoied Algoriths and obabilistic Analysis May 6, Lecture Lecturer: Anna Karlin Scribe: Noah Siegel, Jonathan Shi Rando walks and Markov chains This lecture discusses Markov chains, which capture
More informationHandout 7. and Pr [M(x) = χ L (x) M(x) =? ] = 1.
Notes on Coplexity Theory Last updated: October, 2005 Jonathan Katz Handout 7 1 More on Randoized Coplexity Classes Reinder: so far we have seen RP,coRP, and BPP. We introduce two ore tie-bounded randoized
More informationE0 370 Statistical Learning Theory Lecture 6 (Aug 30, 2011) Margin Analysis
E0 370 tatistical Learning Theory Lecture 6 (Aug 30, 20) Margin Analysis Lecturer: hivani Agarwal cribe: Narasihan R Introduction In the last few lectures we have seen how to obtain high confidence bounds
More information1 Proof of learning bounds
COS 511: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #4 Scribe: Akshay Mittal February 13, 2013 1 Proof of learning bounds For intuition of the following theore, suppose there exists a
More informationMidterm 1 Sample Solution
Midter 1 Saple Solution NOTE: Throughout the exa a siple graph is an undirected, unweighted graph with no ultiple edges (i.e., no exact repeats of the sae edge) and no self-loops (i.e., no edges fro a
More informationReading from Young & Freedman: For this topic, read the introduction to chapter 25 and sections 25.1 to 25.3 & 25.6.
PHY10 Electricity Topic 6 (Lectures 9 & 10) Electric Current and Resistance n this topic, we will cover: 1) Current in a conductor ) Resistivity 3) Resistance 4) Oh s Law 5) The Drude Model of conduction
More informationFinite fields. and we ve used it in various examples and homework problems. In these notes I will introduce more finite fields
Finite fields I talked in class about the field with two eleents F 2 = {, } and we ve used it in various eaples and hoework probles. In these notes I will introduce ore finite fields F p = {,,...,p } for
More informationCurious Bounds for Floor Function Sums
1 47 6 11 Journal of Integer Sequences, Vol. 1 (018), Article 18.1.8 Curious Bounds for Floor Function Sus Thotsaporn Thanatipanonda and Elaine Wong 1 Science Division Mahidol University International
More informationCourse Notes for EE227C (Spring 2018): Convex Optimization and Approximation
Course Notes for EE7C (Spring 018: Convex Optiization and Approxiation Instructor: Moritz Hardt Eail: hardt+ee7c@berkeley.edu Graduate Instructor: Max Sichowitz Eail: sichow+ee7c@berkeley.edu October 15,
More informationTactics Box 2.1 Interpreting Position-versus-Time Graphs
1D kineatic Retake Assignent Due: 4:32p on Friday, October 31, 2014 You will receive no credit for ites you coplete after the assignent is due. Grading Policy Tactics Box 2.1 Interpreting Position-versus-Tie
More informationProbability and Stochastic Processes
Probability and Stochastic Processes A Friendly Introduction for Electrical and Computer Engineers Third Edition INSTRUCTOR S SOLUTION MANUAL Roy D. Yates, David J. Goodman, David Famolari September 8,
More informationlecture 37: Linear Multistep Methods: Absolute Stability, Part I lecture 38: Linear Multistep Methods: Absolute Stability, Part II
lecture 37: Linear Multistep Methods: Absolute Stability, Part I lecture 3: Linear Multistep Methods: Absolute Stability, Part II 5.7 Linear ultistep ethods: absolute stability At this point, it ay well
More information1 Bounding the Margin
COS 511: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #12 Scribe: Jian Min Si March 14, 2013 1 Bounding the Margin We are continuing the proof of a bound on the generalization error of AdaBoost
More information4 = (0.02) 3 13, = 0.25 because = 25. Simi-
Theore. Let b and be integers greater than. If = (. a a 2 a i ) b,then for any t N, in base (b + t), the fraction has the digital representation = (. a a 2 a i ) b+t, where a i = a i + tk i with k i =
More information12 th Annual Johns Hopkins Math Tournament Saturday, February 19, 2011 Power Round-Poles and Polars
1 th Annual Johns Hopkins Math Tournaent Saturday, February 19, 011 Power Round-Poles and Polars 1. Definition and Basic Properties 1. Note that the unit circles are not necessary in the solutions. They
More informationLecture 21. Interior Point Methods Setup and Algorithm
Lecture 21 Interior Point Methods In 1984, Kararkar introduced a new weakly polynoial tie algorith for solving LPs [Kar84a], [Kar84b]. His algorith was theoretically faster than the ellipsoid ethod and
More informationQuantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search
Quantu algoriths (CO 781, Winter 2008) Prof Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search ow we begin to discuss applications of quantu walks to search algoriths
More informationPhysics Chapter 6. Momentum and Its Conservation
Physics Chapter 6 Moentu and Its Conservation Linear Moentu The velocity and ass of an object deterine what is needed to change its otion. Linear Moentu (ρ) is the product of ass and velocity ρ =v Unit
More informationA Simple Regression Problem
A Siple Regression Proble R. M. Castro March 23, 2 In this brief note a siple regression proble will be introduced, illustrating clearly the bias-variance tradeoff. Let Y i f(x i ) + W i, i,..., n, where
More informationChapter 6 1-D Continuous Groups
Chapter 6 1-D Continuous Groups Continuous groups consist of group eleents labelled by one or ore continuous variables, say a 1, a 2,, a r, where each variable has a well- defined range. This chapter explores:
More informationAcyclic Colorings of Directed Graphs
Acyclic Colorings of Directed Graphs Noah Golowich Septeber 9, 014 arxiv:1409.7535v1 [ath.co] 6 Sep 014 Abstract The acyclic chroatic nuber of a directed graph D, denoted χ A (D), is the iniu positive
More informationNB1140: Physics 1A - Classical mechanics and Thermodynamics Problem set 2 - Forces and energy Week 2: November 2016
NB1140: Physics 1A - Classical echanics and Therodynaics Proble set 2 - Forces and energy Week 2: 21-25 Noveber 2016 Proble 1. Why force is transitted uniforly through a assless string, a assless spring,
More informationCongruences and Modular Arithmetic
Congruenes and Modular Aritheti 6-17-2016 a is ongruent to b od n eans that n a b. Notation: a = b (od n). Congruene od n is an equivalene relation. Hene, ongruenes have any of the sae properties as ordinary
More informationChapter 5, Conceptual Questions
Chapter 5, Conceptual Questions 5.1. Two forces are present, tension T in the cable and gravitational force 5.. F G as seen in the figure. Four forces act on the block: the push of the spring F, sp gravitational
More informationQuestion 1. [14 Marks]
6 Question 1. [14 Marks] R r T! A string is attached to the dru (radius r) of a spool (radius R) as shown in side and end views here. (A spool is device for storing string, thread etc.) A tension T is
More informationRevealed Preference and Stochastic Demand Correspondence: A Unified Theory
Revealed Preference and Stochastic Deand Correspondence: A Unified Theory Indraneel Dasgupta School of Econoics, University of Nottingha, Nottingha NG7 2RD, UK. E-ail: indraneel.dasgupta@nottingha.ac.uk
More informationThe Lagrangian Method vs. other methods (COMPARATIVE EXAMPLE)
The Lagrangian ethod vs. other ethods () This aterial written by Jozef HANC, jozef.hanc@tuke.sk Technical University, Kosice, Slovakia For Edwin Taylor s website http://www.eftaylor.co/ 6 January 003 The
More informationNote-A-Rific: Mechanical
Note-A-Rific: Mechanical Kinetic You ve probably heard of inetic energy in previous courses using the following definition and forula Any object that is oving has inetic energy. E ½ v 2 E inetic energy
More informationOn the Navier Stokes equations
On the Navier Stokes equations Daniel Thoas Hayes April 26, 2018 The proble on the existence and soothness of the Navier Stokes equations is resolved. 1. Proble description The Navier Stokes equations
More informationma x = -bv x + F rod.
Notes on Dynaical Systes Dynaics is the study of change. The priary ingredients of a dynaical syste are its state and its rule of change (also soeties called the dynaic). Dynaical systes can be continuous
More informationComputational and Statistical Learning Theory
Coputational and Statistical Learning Theory TTIC 31120 Prof. Nati Srebro Lecture 2: PAC Learning and VC Theory I Fro Adversarial Online to Statistical Three reasons to ove fro worst-case deterinistic
More informationSoft Computing Techniques Help Assign Weights to Different Factors in Vulnerability Analysis
Soft Coputing Techniques Help Assign Weights to Different Factors in Vulnerability Analysis Beverly Rivera 1,2, Irbis Gallegos 1, and Vladik Kreinovich 2 1 Regional Cyber and Energy Security Center RCES
More informationThe degree of a typical vertex in generalized random intersection graph models
Discrete Matheatics 306 006 15 165 www.elsevier.co/locate/disc The degree of a typical vertex in generalized rando intersection graph odels Jerzy Jaworski a, Michał Karoński a, Dudley Stark b a Departent
More informationLesson 24: Newton's Second Law (Motion)
Lesson 24: Newton's Second Law (Motion) To really appreciate Newton s Laws, it soeties helps to see how they build on each other. The First Law describes what will happen if there is no net force. The
More informationE0 370 Statistical Learning Theory Lecture 5 (Aug 25, 2011)
E0 370 Statistical Learning Theory Lecture 5 Aug 5, 0 Covering Nubers, Pseudo-Diension, and Fat-Shattering Diension Lecturer: Shivani Agarwal Scribe: Shivani Agarwal Introduction So far we have seen how
More information2 Q 10. Likewise, in case of multiple particles, the corresponding density in 2 must be averaged over all
Lecture 6 Introduction to kinetic theory of plasa waves Introduction to kinetic theory So far we have been odeling plasa dynaics using fluid equations. The assuption has been that the pressure can be either
More informationyields m 1 m 2 q 2 = (m 1 + m 2 )(m 1 q m 2 q 2 2 ). Thus the total kinetic energy is T 1 +T 2 = 1 m 1m 2
1 I iediately have 1 q 1 = f( q )q/ q and q = f( q )q/ q. Multiplying these equations by and 1 (respectively) and then subtracting, I get 1 ( q 1 q ) = ( + 1 )f( q )q/ q. The desired equation follows after
More informationLower Bounds for Quantized Matrix Completion
Lower Bounds for Quantized Matrix Copletion Mary Wootters and Yaniv Plan Departent of Matheatics University of Michigan Ann Arbor, MI Eail: wootters, yplan}@uich.edu Mark A. Davenport School of Elec. &
More information#A52 INTEGERS 10 (2010), COMBINATORIAL INTERPRETATIONS OF BINOMIAL COEFFICIENT ANALOGUES RELATED TO LUCAS SEQUENCES
#A5 INTEGERS 10 (010), 697-703 COMBINATORIAL INTERPRETATIONS OF BINOMIAL COEFFICIENT ANALOGUES RELATED TO LUCAS SEQUENCES Bruce E Sagan 1 Departent of Matheatics, Michigan State University, East Lansing,
More informationInfinitely Many Trees Have Non-Sperner Subtree Poset
Order (2007 24:133 138 DOI 10.1007/s11083-007-9064-2 Infinitely Many Trees Have Non-Sperner Subtree Poset Andrew Vince Hua Wang Received: 3 April 2007 / Accepted: 25 August 2007 / Published online: 2 October
More informationUnderstanding Machine Learning Solution Manual
Understanding Machine Learning Solution Manual Written by Alon Gonen Edited by Dana Rubinstein Noveber 17, 2014 2 Gentle Start 1. Given S = ((x i, y i )), define the ultivariate polynoial p S (x) = i []:y
More informationRevealed Preference with Stochastic Demand Correspondence
Revealed Preference with Stochastic Deand Correspondence Indraneel Dasgupta School of Econoics, University of Nottingha, Nottingha NG7 2RD, UK. E-ail: indraneel.dasgupta@nottingha.ac.uk Prasanta K. Pattanaik
More informationSequence Analysis, WS 14/15, D. Huson & R. Neher (this part by D. Huson) February 5,
Sequence Analysis, WS 14/15, D. Huson & R. Neher (this part by D. Huson) February 5, 2015 31 11 Motif Finding Sources for this section: Rouchka, 1997, A Brief Overview of Gibbs Sapling. J. Buhler, M. Topa:
More informationSolutions 1. Introduction to Coding Theory - Spring 2010 Solutions 1. Exercise 1.1. See Examples 1.2 and 1.11 in the course notes.
Solutions 1 Exercise 1.1. See Exaples 1.2 and 1.11 in the course notes. Exercise 1.2. Observe that the Haing distance of two vectors is the iniu nuber of bit flips required to transfor one into the other.
More informationMath Reviews classifications (2000): Primary 54F05; Secondary 54D20, 54D65
The Monotone Lindelöf Property and Separability in Ordered Spaces by H. Bennett, Texas Tech University, Lubbock, TX 79409 D. Lutzer, College of Willia and Mary, Williasburg, VA 23187-8795 M. Matveev, Irvine,
More informationIntelligent Systems: Reasoning and Recognition. Perceptrons and Support Vector Machines
Intelligent Systes: Reasoning and Recognition Jaes L. Crowley osig 1 Winter Seester 2018 Lesson 6 27 February 2018 Outline Perceptrons and Support Vector achines Notation...2 Linear odels...3 Lines, Planes
More informationIntroduction to Discrete Optimization
Prof. Friedrich Eisenbrand Martin Nieeier Due Date: March 9 9 Discussions: March 9 Introduction to Discrete Optiization Spring 9 s Exercise Consider a school district with I neighborhoods J schools and
More information1 Proving the Fundamental Theorem of Statistical Learning
THEORETICAL MACHINE LEARNING COS 5 LECTURE #7 APRIL 5, 6 LECTURER: ELAD HAZAN NAME: FERMI MA ANDDANIEL SUO oving te Fundaental Teore of Statistical Learning In tis section, we prove te following: Teore.
More informationa a a a a a a m a b a b
Algebra / Trig Final Exa Study Guide (Fall Seester) Moncada/Dunphy Inforation About the Final Exa The final exa is cuulative, covering Appendix A (A.1-A.5) and Chapter 1. All probles will be ultiple choice
More informationarxiv: v1 [cs.ds] 17 Mar 2016
Tight Bounds for Single-Pass Streaing Coplexity of the Set Cover Proble Sepehr Assadi Sanjeev Khanna Yang Li Abstract arxiv:1603.05715v1 [cs.ds] 17 Mar 2016 We resolve the space coplexity of single-pass
More information3.3 Variational Characterization of Singular Values
3.3. Variational Characterization of Singular Values 61 3.3 Variational Characterization of Singular Values Since the singular values are square roots of the eigenvalues of the Heritian atrices A A and
More informationBirthday Paradox Calculations and Approximation
Birthday Paradox Calculations and Approxiation Joshua E. Hill InfoGard Laboratories -March- v. Birthday Proble In the birthday proble, we have a group of n randoly selected people. If we assue that birthdays
More informationComputational and Statistical Learning Theory
Coputational and Statistical Learning Theory Proble sets 5 and 6 Due: Noveber th Please send your solutions to learning-subissions@ttic.edu Notations/Definitions Recall the definition of saple based Radeacher
More informationI. Understand get a conceptual grasp of the problem
MASSACHUSETTS INSTITUTE OF TECHNOLOGY Departent o Physics Physics 81T Fall Ter 4 Class Proble 1: Solution Proble 1 A car is driving at a constant but unknown velocity,, on a straightaway A otorcycle is
More informationCombining Classifiers
Cobining Classifiers Generic ethods of generating and cobining ultiple classifiers Bagging Boosting References: Duda, Hart & Stork, pg 475-480. Hastie, Tibsharini, Friedan, pg 246-256 and Chapter 10. http://www.boosting.org/
More informationPoisson processes and their properties
Poisson processes and their properties Poisson processes. collection {N(t) : t [, )} of rando variable indexed by tie t is called a continuous-tie stochastic process, Furtherore, we call N(t) a Poisson
More information1 Identical Parallel Machines
FB3: Matheatik/Inforatik Dr. Syaantak Das Winter 2017/18 Optiizing under Uncertainty Lecture Notes 3: Scheduling to Miniize Makespan In any standard scheduling proble, we are given a set of jobs J = {j
More informationarxiv: v1 [math.nt] 14 Sep 2014
ROTATION REMAINDERS P. JAMESON GRABER, WASHINGTON AND LEE UNIVERSITY 08 arxiv:1409.411v1 [ath.nt] 14 Sep 014 Abstract. We study properties of an array of nubers, called the triangle, in which each row
More informationPrerequisites. We recall: Theorem 2 A subset of a countably innite set is countable.
Prerequisites 1 Set Theory We recall the basic facts about countable and uncountable sets, union and intersection of sets and iages and preiages of functions. 1.1 Countable and uncountable sets We can
More informationEgyptian Mathematics Problem Set
(Send corrections to cbruni@uwaterloo.ca) Egyptian Matheatics Proble Set (i) Use the Egyptian area of a circle A = (8d/9) 2 to copute the areas of the following circles with given diaeter. d = 2. d = 3
More informationA Note on Scheduling Tall/Small Multiprocessor Tasks with Unit Processing Time to Minimize Maximum Tardiness
A Note on Scheduling Tall/Sall Multiprocessor Tasks with Unit Processing Tie to Miniize Maxiu Tardiness Philippe Baptiste and Baruch Schieber IBM T.J. Watson Research Center P.O. Box 218, Yorktown Heights,
More informationSexually Transmitted Diseases VMED 5180 September 27, 2016
Sexually Transitted Diseases VMED 518 Septeber 27, 216 Introduction Two sexually-transitted disease (STD) odels are presented below. The irst is a susceptibleinectious-susceptible (SIS) odel (Figure 1)
More informationBiostatistics Department Technical Report
Biostatistics Departent Technical Report BST006-00 Estiation of Prevalence by Pool Screening With Equal Sized Pools and a egative Binoial Sapling Model Charles R. Katholi, Ph.D. Eeritus Professor Departent
More informationQuadratic Equations. Save My Exams! The Home of Revision For more awesome GCSE and A level resources, visit us at
Quadratic Equations Mark Schee 1 Level A LEVEL Ea Board Edecel GCE Subject Matheatics Module Core 1 Topic Algebra and Functions Sub-Topic Quadratic Equations Booklet Mark Schee 1 Tie Allowed: Score: Percentage:
More informationTHE AVERAGE NORM OF POLYNOMIALS OF FIXED HEIGHT
THE AVERAGE NORM OF POLYNOMIALS OF FIXED HEIGHT PETER BORWEIN AND KWOK-KWONG STEPHEN CHOI Abstract. Let n be any integer and ( n ) X F n : a i z i : a i, ± i be the set of all polynoials of height and
More informationPY /005 Practice Test 1, 2004 Feb. 10
PY 205-004/005 Practice Test 1, 2004 Feb. 10 Print nae Lab section I have neither given nor received unauthorized aid on this test. Sign ature: When you turn in the test (including forula page) you ust
More informationPoly-Bernoulli Numbers and Eulerian Numbers
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 21 (2018, Article 18.6.1 Poly-Bernoulli Nubers and Eulerian Nubers Beáta Bényi Faculty of Water Sciences National University of Public Service H-1441
More informationImproved Guarantees for Agnostic Learning of Disjunctions
Iproved Guarantees for Agnostic Learning of Disjunctions Pranjal Awasthi Carnegie Mellon University pawasthi@cs.cu.edu Avri Blu Carnegie Mellon University avri@cs.cu.edu Or Sheffet Carnegie Mellon University
More informationBootstrapping Dependent Data
Bootstrapping Dependent Data One of the key issues confronting bootstrap resapling approxiations is how to deal with dependent data. Consider a sequence fx t g n t= of dependent rando variables. Clearly
More informationWhen Short Runs Beat Long Runs
When Short Runs Beat Long Runs Sean Luke George Mason University http://www.cs.gu.edu/ sean/ Abstract What will yield the best results: doing one run n generations long or doing runs n/ generations long
More informationPHY 171. Lecture 14. (February 16, 2012)
PHY 171 Lecture 14 (February 16, 212) In the last lecture, we looked at a quantitative connection between acroscopic and icroscopic quantities by deriving an expression for pressure based on the assuptions
More information3.8 Three Types of Convergence
3.8 Three Types of Convergence 3.8 Three Types of Convergence 93 Suppose that we are given a sequence functions {f k } k N on a set X and another function f on X. What does it ean for f k to converge to
More informationProbability Distributions
Probability Distributions In Chapter, we ephasized the central role played by probability theory in the solution of pattern recognition probles. We turn now to an exploration of soe particular exaples
More informationMULTIPLAYER ROCK-PAPER-SCISSORS
MULTIPLAYER ROCK-PAPER-SCISSORS CHARLOTTE ATEN Contents 1. Introduction 1 2. RPS Magas 3 3. Ites as a Function of Players and Vice Versa 5 4. Algebraic Properties of RPS Magas 6 References 6 1. Introduction
More informationEstimating Parameters for a Gaussian pdf
Pattern Recognition and achine Learning Jaes L. Crowley ENSIAG 3 IS First Seester 00/0 Lesson 5 7 Noveber 00 Contents Estiating Paraeters for a Gaussian pdf Notation... The Pattern Recognition Proble...3
More information15 Newton s Laws #2: Kinds of Forces, Creating Free Body Diagrams
Chapter 15 ewton s Laws #2: inds of s, Creating ree Body Diagras 15 ewton s Laws #2: inds of s, Creating ree Body Diagras re is no force of otion acting on an object. Once you have the force or forces
More informationList Scheduling and LPT Oliver Braun (09/05/2017)
List Scheduling and LPT Oliver Braun (09/05/207) We investigate the classical scheduling proble P ax where a set of n independent jobs has to be processed on 2 parallel and identical processors (achines)
More informationGraphical Models in Local, Asymmetric Multi-Agent Markov Decision Processes
Graphical Models in Local, Asyetric Multi-Agent Markov Decision Processes Ditri Dolgov and Edund Durfee Departent of Electrical Engineering and Coputer Science University of Michigan Ann Arbor, MI 48109
More informationSOLVING LITERAL EQUATIONS. Bundle 1: Safety & Process Skills
SOLVING LITERAL EQUATIONS Bundle 1: Safety & Process Skills Solving Literal Equations An equation is a atheatical sentence with an equal sign. The solution of an equation is a value for a variable that
More informationBipartite subgraphs and the smallest eigenvalue
Bipartite subgraphs and the sallest eigenvalue Noga Alon Benny Sudaov Abstract Two results dealing with the relation between the sallest eigenvalue of a graph and its bipartite subgraphs are obtained.
More informationC na (1) a=l. c = CO + Clm + CZ TWO-STAGE SAMPLE DESIGN WITH SMALL CLUSTERS. 1. Introduction
TWO-STGE SMPLE DESIGN WITH SMLL CLUSTERS Robert G. Clark and David G. Steel School of Matheatics and pplied Statistics, University of Wollongong, NSW 5 ustralia. (robert.clark@abs.gov.au) Key Words: saple
More informationBloom Filters. filters: A survey, Internet Mathematics, vol. 1 no. 4, pp , 2004.
Bloo Filters References A. Broder and M. Mitzenacher, Network applications of Bloo filters: A survey, Internet Matheatics, vol. 1 no. 4, pp. 485-509, 2004. Li Fan, Pei Cao, Jussara Aleida, Andrei Broder,
More informationTHE SUPER CATALAN NUMBERS S(m, m + s) FOR s 3 AND SOME INTEGER FACTORIAL RATIOS. 1. Introduction. = (2n)!
THE SUPER CATALAN NUMBERS S(, + s FOR s 3 AND SOME INTEGER FACTORIAL RATIOS XIN CHEN AND JANE WANG Abstract. We give a cobinatorial interpretation for the super Catalan nuber S(, + s for s 3 using lattice
More informationApproximation in Stochastic Scheduling: The Power of LP-Based Priority Policies
Approxiation in Stochastic Scheduling: The Power of -Based Priority Policies Rolf Möhring, Andreas Schulz, Marc Uetz Setting (A P p stoch, r E( w and (B P p stoch E( w We will assue that the processing
More informationDSPACE(n)? = NSPACE(n): A Degree Theoretic Characterization
DSPACE(n)? = NSPACE(n): A Degree Theoretic Characterization Manindra Agrawal Departent of Coputer Science and Engineering Indian Institute of Technology, Kanpur 208016, INDIA eail: anindra@iitk.ernet.in
More informatione-companion ONLY AVAILABLE IN ELECTRONIC FORM
OPERATIONS RESEARCH doi 10.1287/opre.1070.0427ec pp. ec1 ec5 e-copanion ONLY AVAILABLE IN ELECTRONIC FORM infors 07 INFORMS Electronic Copanion A Learning Approach for Interactive Marketing to a Custoer
More informationSupplement to: Subsampling Methods for Persistent Homology
Suppleent to: Subsapling Methods for Persistent Hoology A. Technical results In this section, we present soe technical results that will be used to prove the ain theores. First, we expand the notation
More information