ECE353: Probability and Random Processes. Lecture 11- Two Random Variables (II)
|
|
- Lindsay Brown
- 5 years ago
- Views:
Transcription
1 ECE353: Probability and Random Processes Lecture 11- Two Random Variables (II) Xiao Fu School of Electrical Engineering and Computer Science Oregon State University
2 Joint CDF Joint CDF: F X,Y (x, y) = P [X x, Y y]. Joint PDF: Implicitly defined as F X,Y (x, y) = x y u= f X,Y (u, v)dudv and thus f X,Y (x, y) = F X,Y (x, y) x y ECE353 Probability and Random Processes X. Fu, School of EECS, Oregon State University 1
3 Joint CDF Note that for a single RV, computing probabilities of events of interest can be done in two ways: P [2 < X 3] = F X (3) F X (2) and P [2 < X 3] = 3 x=2 The case of two RVs: Now we are in a 2-D space! f X (x)dx. ECE353 Probability and Random Processes X. Fu, School of EECS, Oregon State University 2
4 Joint CDF How to compute the probability of B, given F X,Y (x, y)? ECE353 Probability and Random Processes X. Fu, School of EECS, Oregon State University 3
5 Joint CDF How to compute the probability of B, given F X,Y (x, y)? ECE353 Probability and Random Processes X. Fu, School of EECS, Oregon State University 4
6 Joint CDF How to compute the probability of B, given F X,Y (x, y)? ECE353 Probability and Random Processes X. Fu, School of EECS, Oregon State University 5
7 Joint CDF How to compute the probability of B, given F X,Y (x, y)? ECE353 Probability and Random Processes X. Fu, School of EECS, Oregon State University 6
8 Joint CDF How to compute the probability of B, given F X,Y (x, y)? Looks easy? ECE353 Probability and Random Processes X. Fu, School of EECS, Oregon State University 7
9 Joint CDF How to compute the probability of B, given F X,Y (x, y)? ECE353 Probability and Random Processes X. Fu, School of EECS, Oregon State University 8
10 Joint PDF For this case, joint PDF can be very useful: P [(x, y) B] = (x,y) B f X,Y (x, y)dxdy Example: find out P [Y X]. f X,Y (x, y) = { 1, x [0, 1]&y [0, 1] 0, o.w. ECE353 Probability and Random Processes X. Fu, School of EECS, Oregon State University 9
11 What is the event B = {Y X}? Joint PDF Solution: 1 x x=0 y=0 1dydx = 1 x=0 xdx = 1 2 x2 1 0 = 1/2 ECE353 Probability and Random Processes X. Fu, School of EECS, Oregon State University 10
12 Some properties of joint PDF: Properties 1. f X,Y (x, y) 0, x, y. 2. f X,Y (x, y)dxdy = 1(= F X,Y (, ) = P [X x, Y y] = 1). 3. f X,Y (x, y)dx = f Y (y). (Marginalization) Proof: F X,Y (, y) = P [x, Y y] = P [Y y] = F Y (y) F X,Y (, y) = = u= y v= y v= f X,Y (u, v)dvdu = q(v)dv q(y) = df Y (y) dy y v= ( = f Y (y) = u= u= ) f X,Y (u, v)du dv f X,Y (u, y)du ECE353 Probability and Random Processes X. Fu, School of EECS, Oregon State University 11
13 Derived RVs Functions of two random variables, i.e., RVs derived from a pair of RVs, W = g(x, Y ), e.g., W = X + Y 2, W = max{x, Y }, W = min{x, Y }, W = X/Y. General problem of interest: Given P X,Y (x, y), F X,Y (x, y) or f X,Y (x, y) and a mapping g(x, y) w. Find P W (w) or F W (w) or f W (w), whichever is appropriate. Discrete RVs: EASY! P W (w) = (x,y) g(x,y)=w P X,Y (x, y) ECE353 Probability and Random Processes X. Fu, School of EECS, Oregon State University 12
14 Derived RVs Continuous RVs: typically first find the CDF of W F W (w) = P [W w] = (x,y) g(x,y) w f X,Y (x, y)dxdy. in general more complicated; but there are some special cases that are easy. Example: W = max{x, Y }. Given F X,Y (x, y), find F W (w). F W (w) = P [W w] = P [max{x, Y } w] = P [X w, Y w] = F X,Y (w, w). ECE353 Probability and Random Processes X. Fu, School of EECS, Oregon State University 13
15 Derived RVs Example: V = min{x, Y }. Given F X,Y (x, y), find F W (w). F V (v) = P [V v] = P [min{x, Y } v] = P [X v or Y v]. which is hard to compute. However, if we consider 1 F V (v) = P [V v] = P [min{x, Y } v] = P [X v, Y v]. ECE353 Probability and Random Processes X. Fu, School of EECS, Oregon State University 14
16 Derived RVs Example: V = min{x, Y }. 1 F V (v) = P [V v] = P [min{x, Y } v] = P [X v, Y v]. ECE353 Probability and Random Processes X. Fu, School of EECS, Oregon State University 15
17 Derived RVs Example: Roll a pair of independent fair dice, X, Y. Find the PMF of W = X + Y and V = max{x, Y }. Every grid has a probability of 1/36, since we have two independent fair dice (P [X = x, Y = y] = P [X = x]p [Y = y]). ECE353 Probability and Random Processes X. Fu, School of EECS, Oregon State University 16
18 Derived RVs P W (w) = (x,y) x+y=w 1 36, e.g., P W (w) = P [W = 5] = 4/36. Q: what is P W (2)? ECE353 Probability and Random Processes X. Fu, School of EECS, Oregon State University 17
19 Derived RVs What is the PMF of V = max{x, Y }? E.g., P [V = 3] = P [X = 3 or Y 3 X 3 or Y = 3] = 5/36. P [V = 1] = 1/36, P [V = 3] = 5/36, P [V = 6] = 11/36,... increasing! ECE353 Probability and Random Processes X. Fu, School of EECS, Oregon State University 18
Today s outline: pp
Chapter 3 sections We will SKIP a number of sections Random variables and discrete distributions Continuous distributions The cumulative distribution function Bivariate distributions Marginal distributions
More informationProbability Model for 2 RV s
Probability Model for 2 RV s The joint probability mass function of X and Y is P X,Y (x, y) = P [X = x, Y= y] Joint PMF is a rule that for any x and y, gives the probability that X = x and Y= y. 3 Example:
More informationLecture 8: Jointly distributed random variables
Lecture : Jointly distributed random variables Random Vectors and Joint Probability Distributions Definition: Random Vector. An n-dimensional random vector, denoted as Z = (Z, Z,, Z n ), is a function
More informationWill Monroe July 21, with materials by Mehran Sahami and Chris Piech. Joint Distributions
Will Monroe July 1, 017 with materials by Mehran Sahami and Chris Piech Joint Distributions Review: Normal random variable An normal (= Gaussian) random variable is a good approximation to many other distributions.
More informationJoint probability distributions
Joint probability distributions Let X and Y be two discrete rv s defined on the sample space S. The joint probability mass function p(x, y) is p(x, y) = P(X = x, Y = y). Note p(x, y) and x y p(x, y) =
More informationPairs of a random variable
Handout 8 Pairs of a random variable "Always be a little improbable." Oscar Wilde in the previous tutorials we analyzed experiments in which an outcome is one number. we'll start to analyze experiments
More information14.30 Introduction to Statistical Methods in Economics Spring 2009
MIT OpenCourseWare http://ocw.mit.edu 14.30 Introduction to Statistical Methods in Economics Spring 2009 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.
More informationTopic 5 - Joint distributions and the CLT
Topic 5 - Joint distributions and the CLT Joint distributions Calculation of probabilities, mean and variance Expectations of functions based on joint distributions Central Limit Theorem Sampling distributions
More informationRecursive Estimation
Recursive Estimation Raffaello D Andrea Spring 28 Problem Set : Probability Review Last updated: March 6, 28 Notes: Notation: Unless otherwise noted, x, y, and z denote random variables, p x denotes the
More informationThis is a good time to refresh your memory on double-integration. We will be using this skill in the upcoming lectures.
Chapter 5: JOINT PROBABILITY DISTRIBUTIONS Part 1: Sections 5-1.1 to 5-1.4 For both discrete and continuous random variables we will discuss the following... Joint Distributions for two or more r.v. s)
More informationThis is a good time to refresh your memory on double-integration. We will be using this skill in the upcoming lectures.
Chapter 5: JOINT PROBABILITY DISTRIBUTIONS Part 1: Sections 5-1.1 to 5-1.4 For both discrete and continuous random variables we will discuss the following... Joint Distributions (for two or more r.v. s)
More informationCS 112: Computer System Modeling Fundamentals. Prof. Jenn Wortman Vaughan April 21, 2011 Lecture 8
CS 112: Computer System Modeling Fundamentals Prof. Jenn Wortman Vaughan April 21, 2011 Lecture 8 Quiz #2 Reminders & Announcements Homework 2 is due in class on Tuesday be sure to check the posted homework
More informationPage 129 Exercise 5: Suppose that the joint p.d.f. of two random variables X and Y is as follows: { c(x. 0 otherwise. ( 1 = c. = c
Stat Solutions for Homework Set Page 9 Exercise : Suppose that the joint p.d.f. of two random variables X and Y is as follows: { cx fx, y + y for y x, < x < otherwise. Determine a the value of the constant
More informationMultivariate probability distributions
Multivariate probability distributions September, 07 STAT 0 Class Slide Outline of Topics Background Discrete bivariate distribution 3 Continuous bivariate distribution STAT 0 Class Slide Multivariate
More informationlecture 19: monte carlo methods
lecture 19: monte carlo methods STAT 598z: Introduction to computing for statistics Vinayak Rao Department of Statistics, Purdue University April 3, 2019 Monte Carlo integration We want to calculate integrals/summations
More informationLecture 17 - Friday May 8th
Lecture 17 - Friday May 8th jacques@ucsd.edu Key words: Multiple integrals Key concepts: Know how to evaluate multiple integrals 17.1 Multiple Integrals A rectangular parallelepiped in R n is a set of
More informationRendering. A simple X program to illustrate rendering
Rendering A simple X program to illustrate rendering The programs in this directory provide a simple x based application for us to develop some graphics routines. Please notice the following: All points
More informationCSE 21 Math for Algorithms and Systems Analysis. Lecture 14 Review of Random Variables
CSE 21 Math for Algorithms and Systems Analysis Lecture 14 Review of Random Variables Outline Probability spaces DefiniFon of a random variable DistribuFon funcfon of a random variable Expected Value of
More informationLaplace Transform of a Lognormal Random Variable
Approximations of the Laplace Transform of a Lognormal Random Variable Joint work with Søren Asmussen & Jens Ledet Jensen The University of Queensland School of Mathematics and Physics August 1, 2011 Conference
More informationSTATISTICAL LABORATORY, April 30th, 2010 BIVARIATE PROBABILITY DISTRIBUTIONS
STATISTICAL LABORATORY, April 3th, 21 BIVARIATE PROBABILITY DISTRIBUTIONS Mario Romanazzi 1 MULTINOMIAL DISTRIBUTION Ex1 Three players play 1 independent rounds of a game, and each player has probability
More informationRendering. A simple X program to illustrate rendering
Rendering A simple X program to illustrate rendering The programs in this directory provide a simple x based application for us to develop some graphics routines. Please notice the following: All points
More informationMULTI-DIMENSIONAL MONTE CARLO INTEGRATION
CS580: Computer Graphics KAIST School of Computing Chapter 3 MULTI-DIMENSIONAL MONTE CARLO INTEGRATION 2 1 Monte Carlo Integration This describes a simple technique for the numerical evaluation of integrals
More information1. No calculators or other electronic devices are allowed during this exam.
Version A Math 2E Spring 24 Midterm Exam Instructions. No calculators or other electronic devices are allowed during this exam. 2. You may use one page of notes, but no books or other assistance during
More informationIntro to Probability Instructor: Alexandre Bouchard
www.stat.ubc.ca/~bouchard/courses/stat302-sp2017-18/ Intro to Probability Instructor: Aleandre Bouchard Announcements New webwork will be release by end of day today, due one week later. Plan for today
More informationThere are 10 problems, with a total of 150 points possible. (a) Find the tangent plane to the surface S at the point ( 2, 1, 2).
Instructions Answer each of the questions on your own paper, and be sure to show your work so that partial credit can be adequately assessed. Put your name on each page of your paper. You may use a scientific
More informationEECS 126 Probability and Random Processes University of California, Berkeley: Fall 2017 Abhay Parekh and Jean Walrand September 21, 2017.
EECS 126 Probability and Random Processes University of California, Berkeley: Fall 2017 Abhay Parekh and Jean Walrand September 21, 2017 Midterm Exam Last Name First Name SID Rules. You have 80 minutes
More informationLecture 4. Digital Image Enhancement. 1. Principle of image enhancement 2. Spatial domain transformation. Histogram processing
Lecture 4 Digital Image Enhancement 1. Principle of image enhancement 2. Spatial domain transformation Basic intensity it tranfomation ti Histogram processing Principle Objective of Enhancement Image enhancement
More information15.3: Double Integrals over General Regions
15.3: ouble Integrals over General Regions Marius Ionescu November 19, 2012 Marius Ionescu () 15.3: ouble Integrals over General Regions November 19, 2012 1 / 15 ouble Integrals over General Regions Fact
More informationImage Enhancement in Spatial Domain (Chapter 3)
Image Enhancement in Spatial Domain (Chapter 3) Yun Q. Shi shi@njit.edu Fall 11 Mask/Neighborhood Processing ECE643 2 1 Point Processing ECE643 3 Image Negatives S = (L 1) - r (3.2-1) Point processing
More informationExact equations are first order DEs of the form M(x, y) + N(x, y) y' = 0 for which we can find a function f(x, φ(x)) so that
Section 2.6 Exact Equations (ONLY) Key Terms: Exact equations are first order DEs of the form M(x, y) + N(x, y) y' = 0 for which we can find a function f(x, φ(x)) so that The construction of f(x, φ(x))
More informationLecture 09: Continuous RV. Lisa Yan July 16, 2018
Lecture 09: Continuous RV Lisa Yan July 16, 2018 Announcements As of Sunday July 17 2pm, PS3 has been updated (typo in problem 10) Midterm: Practice midterm up in next 24hrs PS4 out on Wednesday SCPD email
More informationSampling and Monte-Carlo Integration
Sampling and Monte-Carlo Integration Sampling and Monte-Carlo Integration Last Time Pixels are samples Sampling theorem Convolution & multiplication Aliasing: spectrum replication Ideal filter And its
More informationStatool User s Manual
Statool User s Manual Prepared by Tuan Cao with Jianzhong Zhang 7/19/04 Statool User s Manual Table of contents Purpose of Statool... 2 Input/Output Files for Statool...3.PDF file...3.cdf file... 3.IDF
More informationPURE MATHEMATICS 212 Multivariable Calculus CONTENTS. Page. 1. Assignment Summary... i 2. Introduction Timetable Assignments...
PURE MATHEMATICS 212 Multivariable Calculus CONTENTS Page 1. Assignment Summary... i 2. Introduction...1 3. Timetable... 3 4. Assignments...5 i PMTH212, Multivariable Calculus Assignment Summary 2009
More informationMa MULTIPLE INTEGRATION
Ma 7 - MULTIPLE INTEGATION emark: The concept of a function of one variable in which y gx may be extended to two or more variables. If z is uniquely determined by values of the variables x and y, thenwesayz
More informationBiostatistics & SAS programming. Kevin Zhang
Biostatistics & SAS programming Kevin Zhang February 27, 2017 Random variables and distributions 1 Data analysis Simulation study Apply existing methodologies to your collected samples, with the hope to
More informationL A TEX Lab 3: advanced concepts
L A TEX Lab 3: advanced concepts Simon Shaw November 20, 205 Lab 3: macros Suppose that you wanted to write many instances of dy dx. In code this is \frac{dy}{dx} But you might still think it is a lot
More informationDeadlocks. Mehdi Kargahi School of ECE University of Tehran Spring 2008
Deadlocks Mehdi Kargahi School of ECE University of Tehran Spring 2008 What is a Deadlock Processes use resources in the following sequence: Request Use Release A number of processes may participate in
More informationMA 174: Multivariable Calculus Final EXAM (practice) NO CALCULATORS, BOOKS, OR PAPERS ARE ALLOWED. Use the back of the test pages for scrap paper.
MA 174: Multivariable alculus Final EXAM (practice) NAME lass Meeting Time: NO ALULATOR, BOOK, OR PAPER ARE ALLOWED. Use the back of the test pages for scrap paper. Points awarded 1. (5 pts). (5 pts).
More informationOpenMP - exercises - Paride Dagna. May 2016
OpenMP - exercises - Paride Dagna May 2016 Hello world! (Fortran) As a beginning activity let s compile and run the Hello program, either in C or in Fortran. The most important lines in Fortran code are
More informationTangent Planes and Linear Approximations
February 21, 2007 Tangent Planes Tangent Planes Let S be a surface with equation z = f (x, y). Tangent Planes Let S be a surface with equation z = f (x, y). Let P(x 0, y 0, z 0 ) be a point on S. Tangent
More informationAnalysis of Probabilistic Cache Related Pre-emption Delays. Rob Davis, Luca Santinelli, Sebastian Altmeyer, Claire Maiza, and Liliana Cucu-Grosjean
Analysis of Probabilistic Cache Related Pre-emption Delays Rob Davis, Luca Santinelli, Sebastian Altmeyer, Claire Maiza, and Liliana Cucu-Grosjean Outline Probabilistic real-time systems System model Random
More information= f (a, b) + (hf x + kf y ) (a,b) +
Chapter 14 Multiple Integrals 1 Double Integrals, Iterated Integrals, Cross-sections 2 Double Integrals over more general regions, Definition, Evaluation of Double Integrals, Properties of Double Integrals
More informationYes, it is non singular. The two codewords are different.
Yes, it is non singular. The two codewords are different. Yes, it is UD. Given a sequence of codewords, first isolate occurrences of 01 (i.e., find all the ones) and then parse the rest into 0's. Remark:
More informationMATH 116 REVIEW PROBLEMS for the FINAL EXAM
MATH 116 REVIEW PROBLEMS for the FINAL EXAM The following questions are taken from old final exams of various calculus courses taught in Bilkent University 1. onsider the line integral (2xy 2 z + y)dx
More informationGray level histograms
#pixels Gray level histograms 3.5 4 x 104 3 Histogram Brain image 2.5 2 1.5 1 0.5 0 0 50 100 150 200 250 gray level Digital Image Processing: Bernd Girod, 2013-2014 Stanford University -- Histograms 1
More informationConstrained Optimization
Constrained Optimization Dudley Cooke Trinity College Dublin Dudley Cooke (Trinity College Dublin) Constrained Optimization 1 / 46 EC2040 Topic 5 - Constrained Optimization Reading 1 Chapters 12.1-12.3
More informationSolution of final examination
of final examination Math 20, pring 201 December 9, 201 Problem 1 Let v(t) (2t e t ) i j + π cos(πt) k be the velocity of a particle with initial position r(0) ( 1, 0, 2). Find the accelaration at the
More informationMultivariate Calculus: Review Problems for Examination Two
Multivariate Calculus: Review Problems for Examination Two Note: Exam Two is on Tuesday, August 16. The coverage is multivariate differential calculus and double integration. You should review the double
More informationMatching under transferable utility
July 11, 2016 Plan of the lectures Today: introductory material. What is optimal transport? What is known? What sort of mathematics is involved? Why should I care? What can I do with it? Applications?
More informationThe main goal of Computer Graphics is to generate 2D images 2D images are continuous 2D functions (or signals)
Motivation The main goal of Computer Graphics is to generate 2D images 2D images are continuous 2D functions (or signals) monochrome f(x,y) or color r(x,y), g(x,y), b(x,y) These functions are represented
More informationLecture 8 Mathematics
CS 491 CAP Intro to Competitive Algorithmic Programming Lecture 8 Mathematics Uttam Thakore University of Illinois at Urbana-Champaign October 14, 2015 Outline Number theory Combinatorics & probability
More informationThe Divergence Theorem
The Divergence Theorem MATH 311, Calculus III J. Robert Buchanan Department of Mathematics Summer 2011 Green s Theorem Revisited Green s Theorem: M(x, y) dx + N(x, y) dy = C R ( N x M ) da y y x Green
More informationTopics. 2D Signal. a b. c d. Bioengineering 280A Principles of Biomedical Imaging. Fall Quarter 2004 Lecture 4 2D Fourier Transforms
Bioengineering 280A Principles of Biomedical Imaging Fall Quarter 2004 Lecture 4 2D Fourier Transforms Topics. 2D Signal Representations 2. 2D Fourier Transform 3. Transform Pairs 4. FT Properties 2D Signal
More informationRecursive Estimation
Recursive Estimatio Raffaello D Adrea Sprig 2 Problem Set: Probability Review Last updated: February 28, 2 Notes: Notatio: Uless otherwise oted, x, y, ad z deote radom variables, f x (x) (or the short
More informationLecture slides for MA2730 Analysis I
Lecture slides for MA2730 Analysis I Simon people.brunel.ac.uk/~icsrsss simon.shaw@brunel.ac.uk College of Engineering, Design and Physical Sciences bicom & Materials and Manufacturing Research Institute
More informationMATH 261 FALL 2000 FINAL EXAM INSTRUCTIONS. 1. This test booklet has 14 pages including this one. There are 25 questions, each worth 8 points.
MATH 261 FALL 2 FINAL EXAM STUDENT NAME - STUDENT ID - RECITATION HOUR - RECITATION INSTRUCTOR INSTRUCTOR - INSTRUCTIONS 1. This test booklet has 14 pages including this one. There are 25 questions, each
More informationParametric Surfaces. Substitution
Calculus Lia Vas Parametric Surfaces. Substitution Recall that a curve in space is given by parametric equations as a function of single parameter t x = x(t) y = y(t) z = z(t). A curve is a one-dimensional
More informationMath 251 Quiz 5 Fall b. Calculate. 2. Sketch the region. Write as one double integral by interchanging the order of integration: 2
Math 251 Quiz 5 Fall 2002 1. a. Calculate 5 1 0 1 x dx dy b. Calculate 1 5 1 0 xdxdy 2. Sketch the region. Write as one double integral by interchanging the order of integration: 0 2 dx 2 x dy f(x,y) +
More informationAdobe Pdf Download For Windows Xp >>>
Adobe Pdf Download For Windows Xp >>> http://shurll.com/aiu5b 1 / 5 2 / 5 About,,,UsSoftonic,,,InfoHelp,,,&,,,SupportJobsCompany,,,NewsLegal,,,InformationCookie,,,PolicyDeve loperssoftonic,,,developer,,,centerupload,,,and,,,manage,,,your,,,softwaresoftware,,,policypartnersa
More informationFIVE YEARS OLD. P r o f e s s o r ikobbins B. Stoeckei ol is s h o w n b y the J u n e 1 pig c r o p
/ K j Y- Y -K Y X Y K K Y Y 5 9-7 j < - 8 X Y Z Q X 9 K Y - K Y X K Y Z Y - x - - - - x - - - - 5 -j - - x K K j 9 x - - q z K K - - K & -«x x - q j? x z Q - 8 - x q - - 5 - K K Q Y - - x \ - x j Y 5 x
More informationMotivation. The main goal of Computer Graphics is to generate 2D images. 2D images are continuous 2D functions (or signals)
Motivation The main goal of Computer Graphics is to generate 2D images 2D images are continuous 2D functions (or signals) monochrome f(x,y) or color r(x,y), g(x,y), b(x,y) These functions are represented
More information14.4: Tangent Planes and Linear Approximations
14.4: Tangent Planes and Linear Approximations Marius Ionescu October 15, 2012 Marius Ionescu () 14.4: Tangent Planes and Linear Approximations October 15, 2012 1 / 13 Tangent Planes Marius Ionescu ()
More informationScribe: Sam Keller (2015), Seth Hildick-Smith (2016), G. Valiant (2017) Date: January 25, 2017
CS 6, Lecture 5 Quicksort Scribe: Sam Keller (05), Seth Hildick-Smith (06), G. Valiant (07) Date: January 5, 07 Introduction Today we ll study another sorting algorithm. Quicksort was invented in 959 by
More informationECE521 Lecture 18 Graphical Models Hidden Markov Models
ECE521 Lecture 18 Graphical Models Hidden Markov Models Outline Graphical models Conditional independence Conditional independence after marginalization Sequence models hidden Markov models 2 Graphical
More informationSection 2.3: Monte Carlo Simulation
Section 2.3: Monte Carlo Simulation Discrete-Event Simulation: A First Course c 2006 Pearson Ed., Inc. 0-13-142917-5 Discrete-Event Simulation: A First Course Section 2.3: Monte Carlo Simulation 1/1 Section
More informationLecture 19. Topics: Chapter 9. Simulation and Design Moving to graphics library Unit Testing 9.5 Other Design Techniques
Lecture 19 Topics: Chapter 9. Simulation and Design Moving to graphics library 9.4.1 Unit Testing 9.5 Other Design Techniques 1 9.4.1 Unit Testing When we finish writing a function (a component of a program)
More informationCalculus IV. Exam 2 November 13, 2003
Name: Section: Calculus IV Math 1 Fall Professor Ben Richert Exam November 1, Please do all your work in this booklet and show all the steps. Calculators and note-cards are not allowed. Problem Possible
More informationChapter 4. Relations & Graphs. 4.1 Relations. Exercises For each of the relations specified below:
Chapter 4 Relations & Graphs 4.1 Relations Definition: Let A and B be sets. A relation from A to B is a subset of A B. When we have a relation from A to A we often call it a relation on A. When we have
More informationOptimization and Simulation
Optimization and Simulation Statistical analysis and bootstrapping Michel Bierlaire Transport and Mobility Laboratory School of Architecture, Civil and Environmental Engineering Ecole Polytechnique Fédérale
More informationMultivariate Calculus Review Problems for Examination Two
Multivariate Calculus Review Problems for Examination Two Note: Exam Two is on Thursday, February 28, class time. The coverage is multivariate differential calculus and double integration: sections 13.3,
More informationCPSC 427: Object-Oriented Programming
CPSC 427: Object-Oriented Programming Michael J. Fischer Lecture 18 November 7, 2016 CPSC 427, Lecture 18 1/19 Demo: Craps Game Polymorphic Derivation (continued) Name Visibility CPSC 427, Lecture 18 2/19
More informationStandard Boolean Forms
Standard Boolean Forms In this section, we develop the idea of standard forms of Boolean expressions. In part, these forms are based on some standard Boolean simplification rules. Standard forms are either
More informationExam 2 is Tue Nov 21. Bring a pencil and a calculator. Discuss similarity to exam1. HW3 is due Tue Dec 5.
Stat 100a: Introduction to Probability. Outline for the day 1. Bivariate and marginal density. 2. CLT. 3. CIs. 4. Sample size calculations. 5. Review for exam 2. Exam 2 is Tue Nov 21. Bring a pencil and
More informationJoint Advanced Student School 2007 Martin Dummer
Sierpiński-Curves Joint Advanced Student School 2007 Martin Dummer Statement of the Problem What is the best way to store a triangle mesh efficiently in memory? The following points are desired : Easy
More informationHistograms. h(r k ) = n k. p(r k )= n k /NM. Histogram: number of times intensity level rk appears in the image
Histograms h(r k ) = n k Histogram: number of times intensity level rk appears in the image p(r k )= n k /NM normalized histogram also a probability of occurence 1 Histogram of Image Intensities Create
More informationExercises: Divergence Theorem and Stokes Theorem
Exercises: ivergence heorem and tokes heorem Problem 1. his exercise allows you to see the main idea behind the proof of the ivergence heorem. uppose that is a closed region in R 3 whose boundary surface
More informationR f da (where da denotes the differential of area dxdy (or dydx)
Math 28H Topics for the second exam (Technically, everything covered on the first exam, plus) Constrained Optimization: Lagrange Multipliers Most optimization problems that arise naturally are not unconstrained;
More informationMATH 54 - LECTURE 10
MATH 54 - LECTURE 10 DAN CRYTSER The Universal Mapping Property First we note that each of the projection mappings π i : j X j X i is continuous when i X i is given the product topology (also if the product
More informationConditional Probability, Random Variables, Loops and Conditionals
Version 4.6.2 The Sage Notebook raazesh.sainudiin Toggle Home Published Log Settings Help Report a Problem Sign out STAT221Week03 last edited on April 04, 2011 02:39 PM by raazesh.sainudiin Save Save &
More informationPlane Curve [Parametric Equation]
Plane Curve [Parametric Equation] Bander Almutairi King Saud University December 1, 2015 Bander Almutairi (King Saud University) Plane Curve [Parametric Equation] December 1, 2015 1 / 8 1 Parametric Equation
More information[Anton, pp , pp ] & [Bourne, pp ]
hapter 3 Integral Theorems [Anton, pp. 1124 1130, pp. 1145 1160] & [Bourne, pp. 195 224] First of all some definitions which we will need in the following: Definition 3.1. (a) A domain (region) is an open
More information2. Solve for x when x < 22. Write your answer in interval notation. 3. Find the distance between the points ( 1, 5) and (4, 3).
Math 6 Practice Problems for Final. Find all real solutions x such that 7 3 x = 5 x 3.. Solve for x when 0 4 3x
More informationCS 2316 Individual Homework 5 Joint Probability Out of 100 points
CS 2316 Individual Homework 5 Joint Probability Out of 100 points Files to submit: 1. HW5.py This is an INDIVIDUAL Assignment: Collaboration at a reasonable level will not result in substantially similar
More informationMATH 52 MIDTERM I APRIL 22, 2009
MATH 52 MIDTERM I APRIL 22, 2009 THIS IS A CLOSED BOOK, CLOSED NOTES EXAM. NO CALCULATORS OR OTHER ELECTRONIC DEVICES ARE PERMITTED. YOU DO NOT NEED TO EVALUATE ANY INTEGRALS IN ANY PROBLEM. THERE ARE
More information1 Overview. 2 Applications of submodular maximization. AM 221: Advanced Optimization Spring 2016
AM : Advanced Optimization Spring 06 Prof. Yaron Singer Lecture 0 April th Overview Last time we saw the problem of Combinatorial Auctions and framed it as a submodular maximization problem under a partition
More informationChapter 5: Joint Probability Distributions and Random
Chapter 5: Joint Probability Distributions and Random Samples Curtis Miller 2018-06-13 Introduction We may naturally inquire about collections of random variables that are related to each other in some
More informationDiscrete Motion Planning
RBE MOTION PLANNING Discrete Motion Planning Jane Li Assistant Professor Mechanical Engineering & Robotics Engineering http://users.wpi.edu/~zli11 Announcement Homework 1 is out Due Date - Feb 1 Updated
More informationLecture 2: Continuous functions
Lecture 2: Continuous functions Rafikul Alam Department of Mathematics IIT Guwahati Continuous functions Task: Analyze continuity of the functions: Case I: f : A R n R Case II: f : A R R n Case III: f
More informationManipulation of Discrete Random Variables in R with discreterv
Manipulation of Discrete Random Variables in R with discreterv Eric Hare, Andreas Buja, Heike Hofmann July 2, 2015 Page 1 of 27 The Problem In statistics education, there is often a large disparity between
More informationLecture 2: 2D Fourier transforms and applications
Lecture 2: 2D Fourier transforms and applications B14 Image Analysis Michaelmas 2017 Dr. M. Fallon Fourier transforms and spatial frequencies in 2D Definition and meaning The Convolution Theorem Applications
More informationRouting Performance Analysis in Delay Tolerant Networks
Routing Performance Analysis in Delay Tolerant Networks Presenter: Hao Liang Main References: [1] G. Resta and P. Santi, A framework for routing performance analysis in delay tolerant networks with application
More information1 Computer arithmetic with unsigned integers
1 Computer arithmetic with unsigned integers All numbers are w-bit unsigned integers unless otherwise noted. A w-bit unsigned integer x can be written out in binary as x x x w 2...x 2 x 1 x 0, where x
More information1 Variations of the Traveling Salesman Problem
Stanford University CS26: Optimization Handout 3 Luca Trevisan January, 20 Lecture 3 In which we prove the equivalence of three versions of the Traveling Salesman Problem, we provide a 2-approximate algorithm,
More informationIterated Integrals. f (x; y) dy dx. p(x) To evaluate a type I integral, we rst evaluate the inner integral Z q(x) f (x; y) dy.
Iterted Integrls Type I Integrls In this section, we begin the study of integrls over regions in the plne. To do so, however, requires tht we exmine the importnt ide of iterted integrls, in which inde
More informationComprehensive Practice Handout MATH 1325 entire semester
1 Comprehensive Practice Handout MATH 1325 entire semester Test 1 material Use the graph of f(x) below to answer the following 6 questions. 7 1. Find the value of lim x + f(x) 2. Find the value of lim
More informationWe use non-bold capital letters for all random variables in these notes, whether they are scalar-, vector-, matrix-, or whatever-valued.
The Bayes Classifier We have been starting to look at the supervised classification problem: we are given data (x i, y i ) for i = 1,..., n, where x i R d, and y i {1,..., K}. In this section, we suppose
More information(c) 0 (d) (a) 27 (b) (e) x 2 3x2
1. Sarah the architect is designing a modern building. The base of the building is the region in the xy-plane bounded by x =, y =, and y = 3 x. The building itself has a height bounded between z = and
More informationDiscrete Mathematics Course Review 3
21-228 Discrete Mathematics Course Review 3 This document contains a list of the important definitions and theorems that have been covered thus far in the course. It is not a complete listing of what has
More informationChanging Variables in Multiple Integrals
Changing Variables in Multiple Integrals 3. Examples and comments; putting in limits. If we write the change of variable formula as (x, y) (8) f(x, y)dx dy = g(u, v) dudv, (u, v) where (x, y) x u x v (9)
More information