Lecture 09: Continuous RV. Lisa Yan July 16, 2018
|
|
- Stephen Bruce
- 5 years ago
- Views:
Transcription
1 Lecture 09: Continuous RV Lisa Yan July 16, 2018
2 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 out later today 2
3 Counting successes vs counting time until success Counting # of successes 1. Start and finish experiment. 2. Review and count successes. 1 trial: Ber(p) Amount of time until success 1. Start experiment. 2. Once success is observed, finish the experiment. Geo(p) 1 success N trials: Bin(n,p) NegBin(r,p) r successes Duration of time: Poi(l) Today s lecture 3
4 Balls, Urns, and Supreme Court Supreme Court case: Berghuis v. Smith If a group is underrepresented in a jury pool, how do you tell? Article by Erin Miller Friday, January 22, 2010 Thanks to (former CS109er) Josh Falk for this article Justice Breyer [Stanford Alum] opened the questioning by invoking the binomial theorem. He hypothesized a scenario involving an urn with a thousand balls, and sixty are red, and nine hundred forty are black, and then you select them at random twelve at a time. According to Justice Breyer and the binomial theorem, if the red balls were black jurors then you would expect something like a third to a half of juries would have at least one black person on them. Justice Scalia s rejoinder: We don t have any urns here. 4
5 Balls, Urns, and Supreme Court If a group is underrepresented in a jury pool, how do you tell? Urn with 1000 balls, 60 red, 940 black. Select 12 at a time. What is P( 1 black person in a 12-person jury)? Solution: Note: Ball draws not independent (draw without replacement) Recall: HypGeo == combinatorics/equally likely outcomes P(draw 1 red ball) = 1 P(draw 12 black balls) P(draw 12 black balls) = "# $% / $### $% Approximate using Binomial: Assume P(red ball) = 60/1000 (with replacement) Define X = # red balls drawn out of 12, X ~ Bin(12, 60/1000 = 0.06) P(X 1) = 1 P(X = 0)» =
6 Goals for today Continuous RV Probability Density Functions (PDFs) Cumulative Distribution Functions (CDFs) Uniform Random Variable Exponential Random Variable 6
7 From Discrete to Continuous So far, everything has been discrete: Finite or countably infinite values (e.g., integers) Values are binary or represent a count How many But not everything random in this world is discrete Continous random variables have (uncountably) infinite values Height (cm), weight (lbs), time (seconds), etc. How much The general TL;DR is replace b x=a p(x) " a bf(x)dx with 7
8 Continuous Random Variables X is a Continuous Random Variable if there is a function (#) 0 for x such that: % & ( ) = +. (#) /#, is a Probability Density Function (PDF) if: % ( = +. # /# = 1 1 The cumulative distribution function (CDF) of X is then: 3. & = +. # /# 1, - 8
9 Probability Density Functions is a Probability Density Function (PDF) if: " % = ' ) *) = 1 ( ()) is not a probability It is a density (probability/units of X) Meaningless without a subinterval over X. ". % / = ' ()) *) 9
10 random.random() random.random() in Python: Let X = random.random(). 1. P(X = 0.6) 2. P(X < 0.6) 3. P(X 0.6) 4. P(X > 0.6) 5. P(0.4 < X < 0.6) = 0 = 0.6 = 0.6 = = 0.4 =
11 PDFs (continuous) vs PMFs (discrete) Recall the PMF (discrete X): But for PDF (continuous X): + " = $ % = ", ' $ % = " =. / For continuous 0 and small e: $ " 4 5 % " = /9 : ; / /< : ; 0, 1, >0(") ()*, ( = 1 0, 1, = 0 P(X = a) for continuous X is meaningless $ % = 1 $ % = 2 >0 1 >0 2 = 0(1) 0(2) Ratio of probabilities is still meaningful 11
12 Cumulative Distribution Functions For a continuous random variable X, the CDF is: " = $ % < " = $ % " = ( +, -, ) Density + (PDF) is derivative of CDF : + " = - -" (") * 12
13 random.random() random.random() in Python: Let X = random.random(). 1. Draw the PDF of X. 2. Draw the CDF of X. 13
14 A simple example Let X be a continuous RV with PDF: " # = % & 4# 2#* if 0 # 2 0 otherwise 1. What is C? 1 = / 3 03 " # 1# = / Support of PDF 4 * " # 1# = / 4 * -. = / # 1# = 1 0 & 4# 2# * 1# = & 2# * #7 4 * = & 8 9: 7 2. What is P(X > 1)? P X > 1 = / 9 3 C > 7 = 1 à C = 7 > " # 1# = / 9 * 3 8 4# 2#* 1# = 3 8 = à P(X > 1) = 9 * 2# * 2 * 5 3 #7 9 Picture checks out 14
15 Expectation and Variance Discrete RV: Continuous RV: " = $ & ' ( & % )(") = $ )(&) ' ( & % ", = $ &, ' ( & % Both continuous and discrete RVs: " =. )(") =. ", =. 0 /0 0 /0 0 /0 3" + 5 = 3 " + 5 Var(") = (" ["]) < = " < (["]) < Var(3" + 5) = 3 < Var(") &1 ( & 2& )(&)1 ( & 2& &, 1 ( & 2& 16
16 Linearly increasing density 2# if 0 # 1 " # = % 0 otherwise " # 1. E[X] *, +, 2. Var(X) = * # " #.# = *, +, / 0 # 6 " #.# = * # " #.# = * / / 0 0 # 6 " #.# = * Var 5 = = # 2#.# = 1 6 / = #3 / = # 2 3 # 6 2 2#.# = #8 / =
17 Break Attendance: tinyurl.com/cs109summer
18 Uniform Random Variable Uniform RV, X: X ~ Unif(a, b) 1 if $ *, ( " # $ = &( * 0 otherwise ; : =. 0 /0 $ " # $ 2$ =. 3 4 $ 1 ( * 2$ = 1 ( * 1 5 = 1 ( * 1 2 (7 * 7 = 1 2 ( + * ( * ( * 4 2 $7 3 = 1 2 * + ( E : = 1 2 * + ( Var : = ( *
19 Uniformly fun Let X ~ Unif(0, 20). 0. Draw the PDF of X. 1. P(X < 6)? 2. P(4 < X < 17)? ) 1 " # < 6 = ' ( = 6 20 = 3 10 " 4 < # < 17 = ' : ;< 1 20 Let X ~ Unif(a,b). What is P(a X b), where a a b b? = = " 0 < # < 1 = ' = =
20 Riding the Marguerite Bus Suppose the Marguerite bus stops at the Gates building at 15-minute intervals (2:00, 2:15, 2:30, etc.). Passenger arrives at stop uniformly b/t 2:00-2:30pm. X ~ Unif(0, 30) 1. P(passenger waits < 5 minutes for bus)? " 10 < & < 15 + " 25 < & < 30 = -./ / 1 2. P(passenger waits > 14 minutes for bus)? " 0 < & < 1 + " 15 < & < = - / = = 1 3 = = :00pm Must arrive: 2:10-2:15 2:25-2:30 2:00pm 2:15pm 2:30pm Must arrive: 2:00-2:01 2:15-2:16 2:15pm 21
21 Small Calculus Review Product rule for derivatives: " # $ = " # $ + " # $ Derivative and integral of exponential: ' ( ) '* Written another way: (fg) = f g + f g ', = +, '* +,. = +, Integration by parts: /. # 0 =. # 0 / 0 #. 22
22 Exponential Random Variable Exponential RV, X: X ~ Exp(l) " # $ = & '()*+ if $ 0 0 otherwise. / = 1 λ Var(/) = 1 λ 7 CDF (where a 0): 8 # 9 = : / 9 = < = > '( )*+?$ = ' 1 ' ()*+ = = 1 ( )*> ( )* = = 1 ( )*> 1 8 # 9 = 1 ( )*> 23
23 Expectation of the Exponential < = < Given that " # = %& '() for # 0, show:, - = 1 λ 1. Don t panic, think happy thoughts 2. Integration by parts: find u, v, du, dv 3. Substitute (a.k.a plug and chug ) Solution: 0 = # 12 = %& '() 1# 10 = 1# 2 = & '() f #%& '() 1# = = = #& '() & '() 1# f, - = #& '() & '() 1# = #& '() 8 : 6 7 & '() ; E, - = : ; = 0 : ; 0 0 : ; 24
24 PSA: The CDF is nice For a continuous random variable X, the CDF is: " = $ % < " = $ % " = ( +, -, ) If you learn how to use cumulative distribution functions, you can avoid integrals. For continuous X: P(X < a) = P(X a) = F(a) Consequently, P(X > a) = P(X a) = 1 F(a) Cool fact (if " <. and +, is continuous): P(a < X < b) = F(b) F(a) 1 * Proof:. " = ) +, -, ) +, -, * 1 * 1 Proof= ) +, -, + * +, -, ) +, -, = * +, -, * 25
25 Website visits X ~ Exp(l ): ) * + = 1 "./0 Suppose a visitor to your website leaves after X minutes. On average, visitors leave the site after 5 minutes. The length of stay, X, is exponentially distributed. 1. P(X > 10)? 2. P(10 < X < 20)? Solution: Define: X ~ Exp(l), where l = 1/E[X] = 1/5 1. P(X > 10)? 2. P(10 < X < 20)? = 1 F(10) = 1 (1 " 10(1/5) ) = " = F(20) F(10) = (1 " 4 ) (1 " 2 )
26 Discrete RV analogs to Continuous RVs Discrete PMF Die rolling, p(x) = 1/6, X {1,,6} Continuous PDF X ~ Unif(a, b ), X [",#] $ % (') X ~ Geo(p), X {1, 2, } ' X ~ Exp(l ), X [0, ) f (x) x 27
CS 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 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 informationChapter 6: Simulation Using Spread-Sheets (Excel)
Chapter 6: Simulation Using Spread-Sheets (Excel) Refer to Reading Assignments 1 Simulation Using Spread-Sheets (Excel) OBJECTIVES To be able to Generate random numbers within a spreadsheet environment.
More informationProbability Models.S4 Simulating Random Variables
Operations Research Models and Methods Paul A. Jensen and Jonathan F. Bard Probability Models.S4 Simulating Random Variables In the fashion of the last several sections, we will often create probability
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 information4.7 Approximate Integration
4.7 Approximate Integration Some anti-derivatives are difficult to impossible to find. For example, 1 0 e x2 dx or 1 1 1 + x3 dx We came across this situation back in calculus I when we introduced the
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 informationRandom Number Generators
1/17 Random Number Generators Professor Karl Sigman Columbia University Department of IEOR New York City USA 2/17 Introduction Your computer generates" numbers U 1, U 2, U 3,... that are considered independent
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 informationChapter 6 Normal Probability Distributions
Chapter 6 Normal Probability Distributions 6-1 Review and Preview 6-2 The Standard Normal Distribution 6-3 Applications of Normal Distributions 6-4 Sampling Distributions and Estimators 6-5 The Central
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 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 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 informationToday 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 informationMAT137 Calculus! Lecture 31
MAT137 Calculus! Lecture 31 Today: Next: Integration Methods: Integration Methods: Trig. Functions (v. 9.10-9.12) Rational Functions Trig. Substitution (v. 9.13-9.15) (v. 9.16-9.17) Integration by Parts
More informationProbability and Statistics for Final Year Engineering Students
Probability and Statistics for Final Year Engineering Students By Yoni Nazarathy, Last Updated: April 11, 2011. Lecture 1: Introduction and Basic Terms Welcome to the course, time table, assessment, etc..
More informationMidterm 2. Friday, August 2, 5:10pm 7:10pm CS 70: Discrete Mathematics and Probability Theory, Summer 2013
Midterm 2 Friday, August 2, 5:10pm 7:10pm CS 70: Discrete Mathematics and Probability Theory, Summer 2013 Your name Your student ID # Your section # This exam has 5 questions and a total of 100 points.
More informationWhat We ll Do... Random
What We ll Do... Random- number generation Random Number Generation Generating random variates Nonstationary Poisson processes Variance reduction Sequential sampling Designing and executing simulation
More informationCalculus I Review Handout 1.3 Introduction to Calculus - Limits. by Kevin M. Chevalier
Calculus I Review Handout 1.3 Introduction to Calculus - Limits by Kevin M. Chevalier We are now going to dive into Calculus I as we take a look at the it process. While precalculus covered more static
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 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 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 information% Close all figure windows % Start figure window
CS1112 Fall 2016 Project 3 Part A Due Monday 10/3 at 11pm You must work either on your own or with one partner. If you work with a partner, you must first register as a group in CMS and then submit your
More informationDiscrete Mathematics and Probability Theory Spring 2017 Rao Midterm 2
CS 70 Discrete Mathematics and Probability Theory Spring 2017 Rao Midterm 2 PRINT Your Name:, (last) SIGN Your Name: (first) PRINT Your Student ID: WRITE THE NAME OF your exam room: Name of the person
More informationNumerical Integration
Lecture 12: Numerical Integration (with a focus on Monte Carlo integration) Computer Graphics CMU 15-462/15-662, Fall 2015 Review: fundamental theorem of calculus Z b f(x)dx = F (b) F (a) a f(x) = d dx
More informationTHREE LECTURES ON BASIC TOPOLOGY. 1. Basic notions.
THREE LECTURES ON BASIC TOPOLOGY PHILIP FOTH 1. Basic notions. Let X be a set. To make a topological space out of X, one must specify a collection T of subsets of X, which are said to be open subsets of
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 informationCOMPUTER SCIENCE LARGE PRACTICAL.
COMPUTER SCIENCE LARGE PRACTICAL Page 45 of 100 SURVEY RESULTS Approx. 1/5 of class responded; statistically significant? The majority of you have substantial experience in Java, and all have at least
More informationCS103 Handout 13 Fall 2012 May 4, 2012 Problem Set 5
CS103 Handout 13 Fall 2012 May 4, 2012 Problem Set 5 This fifth problem set explores the regular languages, their properties, and their limits. This will be your first foray into computability theory,
More informationNOTES: ALGEBRA FUNCTION NOTATION
STARTER: 1. Graph f by completing the table. f, y -1 0 1 4 5 NOTES: ALGEBRA 4.1 FUNCTION NOTATION y. Graph f 4 4 f 4 4, y --5-4 - - -1 0 1 y A Brief Review of Function Notation We will be using function
More informationComputer Organization and Levels of Abstraction
Computer Organization and Levels of Abstraction Announcements Today: PS 7 Lab 8: Sound Lab tonight bring machines and headphones! PA 7 Tomorrow: Lab 9 Friday: PS8 Today (Short) Floating point review Boolean
More informationCS2351 Data Structures. Lecture 5: Sorting in Linear Time
CS2351 Data Structures Lecture 5: Sorting in Linear Time 1 About this lecture Sorting algorithms we studied so far Insertion, Selection, Merge, Quicksort determine sorted order by comparison We will look
More informationIntroduction to Mobile Robotics Bayes Filter Particle Filter and Monte Carlo Localization. Wolfram Burgard
Introduction to Mobile Robotics Bayes Filter Particle Filter and Monte Carlo Localization Wolfram Burgard 1 Motivation Recall: Discrete filter Discretize the continuous state space High memory complexity
More informationCalculus Chapter 1 Limits. Section 1.2 Limits
Calculus Chapter 1 Limits Section 1.2 Limits Limit Facts part 1 1. The answer to a limit is a y-value. 2. The limit tells you to look at a certain x value. 3. If the x value is defined (in the domain),
More informationIntroduction to Cryptology. Lecture 2
Introduction to Cryptology Lecture 2 Announcements Access to Canvas? 2 nd Edition vs. 1 st Edition HW1 due on Tuesday, 2/7 Discrete Math Readings/Quizzes on Canvas due on Tuesday, 2/14 Agenda Last time:
More informationHow convincing is our Halting Problem proof? Lecture 36: Modeling Computing. Solutions. DrScheme. What is a model? Modeling Computation
Lecture 6: Modeling Computing How convincing is our Halting Problem proof? define contradict-halts x if halts? contradict-halts loop-forever t contradicts-halts cannot exist. Everything we used to make
More informationCS103 Handout 14 Winter February 8, 2013 Problem Set 5
CS103 Handout 14 Winter 2012-2013 February 8, 2013 Problem Set 5 This fifth problem set explores the regular languages, their properties, and their limits. This will be your first foray into computability
More informationThe Size of the Cantor Set
The Size of the Cantor Set Washington University Math Circle November 6, 2016 In mathematics, a set is a collection of things called elements. For example, {1, 2, 3, 4}, {a,b,c,...,z}, and {cat, dog, chicken}
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 informationCOT 6405 Introduction to Theory of Algorithms
COT 6405 Introduction to Theory of Algorithms Topic 10. Linear Time Sorting 10/5/2016 2 How fast can we sort? The sorting algorithms we learned so far Insertion Sort, Merge Sort, Heap Sort, and Quicksort
More informationDistributions of Continuous Data
C H A P T ER Distributions of Continuous Data New cars and trucks sold in the United States average about 28 highway miles per gallon (mpg) in 2010, up from about 24 mpg in 2004. Some of the improvement
More information(Refer Slide Time: 02.06)
Data Structures and Algorithms Dr. Naveen Garg Department of Computer Science and Engineering Indian Institute of Technology, Delhi Lecture 27 Depth First Search (DFS) Today we are going to be talking
More informationChapter 3. Bootstrap. 3.1 Introduction. 3.2 The general idea
Chapter 3 Bootstrap 3.1 Introduction The estimation of parameters in probability distributions is a basic problem in statistics that one tends to encounter already during the very first course on the subject.
More informationToday. Lecture 4: Last time. The EM algorithm. We examine clustering in a little more detail; we went over it a somewhat quickly last time
Today Lecture 4: We examine clustering in a little more detail; we went over it a somewhat quickly last time The CAD data will return and give us an opportunity to work with curves (!) We then examine
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 informationMonte Carlo Integration
Lecture 11: Monte Carlo Integration Computer Graphics and Imaging UC Berkeley CS184/284A, Spring 2016 Reminder: Quadrature-Based Numerical Integration f(x) Z b a f(x)dx x 0 = a x 1 x 2 x 3 x 4 = b E.g.
More informationPractical 2: Using Minitab (not assessed, for practice only!)
Practical 2: Using Minitab (not assessed, for practice only!) Instructions 1. Read through the instructions below for Accessing Minitab. 2. Work through all of the exercises on this handout. If you need
More informationMITOCW watch?v=4dj1oguwtem
MITOCW watch?v=4dj1oguwtem PROFESSOR: So it's time to examine uncountable sets. And that's what we're going to do in this segment. So Cantor's question was, are all sets the same size? And he gives a definitive
More informationMath in Focus Vocabulary. Kindergarten
Math in Focus Vocabulary Kindergarten Chapter Word Definition 1 one 1 * 1 two 2 * * 1 three 3 * * * 1 four 4 * * * * 1 five 5 * * * * * 1 same things that have a common property 1 different things that
More informationSIMULATION OF A SINGLE-SERVER QUEUEING SYSTEM
SIMULATION OF A SINGLE-SERVER QUEUEING SYSTEM Will show how to simulate a specific version of the single-server queuing system Though simple, it contains many features found in all simulation models 1-
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 informationIntroduction to Sets and Logic (MATH 1190)
Introduction to Sets and Logic () Instructor: Email: shenlili@yorku.ca Department of Mathematics and Statistics York University Dec 4, 2014 Outline 1 2 3 4 Definition A relation R from a set A to a set
More informationMaterial from Recitation 1
Material from Recitation 1 Darcey Riley Frank Ferraro January 18, 2011 1 Introduction In CSC 280 we will be formalizing computation, i.e. we will be creating precise mathematical models for describing
More informationTracking Computer Vision Spring 2018, Lecture 24
Tracking http://www.cs.cmu.edu/~16385/ 16-385 Computer Vision Spring 2018, Lecture 24 Course announcements Homework 6 has been posted and is due on April 20 th. - Any questions about the homework? - How
More informationBulgarian Math Olympiads with a Challenge Twist
Bulgarian Math Olympiads with a Challenge Twist by Zvezdelina Stankova Berkeley Math Circle Beginners Group September 0, 03 Tasks throughout this session. Harder versions of problems from last time appear
More informationAP Calculus. Slide 1 / 213 Slide 2 / 213. Slide 3 / 213. Slide 4 / 213. Slide 4 (Answer) / 213 Slide 5 / 213. Derivatives. Derivatives Exploration
Slide 1 / 213 Slide 2 / 213 AP Calculus Derivatives 2015-11-03 www.njctl.org Slide 3 / 213 Table of Contents Slide 4 / 213 Rate of Change Slope of a Curve (Instantaneous ROC) Derivative Rules: Power, Constant,
More informationMATH : EXAM 3 INFO/LOGISTICS/ADVICE
MATH 3342-004: EXAM 3 INFO/LOGISTICS/ADVICE INFO: WHEN: Friday (04/22) at 10:00am DURATION: 50 mins PROBLEM COUNT: Appropriate for a 50-min exam BONUS COUNT: At least one TOPICS CANDIDATE FOR THE EXAM:
More informationProfessor Stephen Sekula
Monte Carlo Techniques Professor Stephen Sekula Guest Lecture PHYS 4321/7305 What are Monte Carlo Techniques? Computational algorithms that rely on repeated random sampling in order to obtain numerical
More informationSource of Slides: Introduction to Automata Theory, Languages, and Computation By John E. Hopcroft, Rajeev Motwani and Jeffrey D.
Source of Slides: Introduction to Automata Theory, Languages, and Computation By John E. Hopcroft, Rajeev Motwani and Jeffrey D. Ullman And Introduction to Languages and The by J. C. Martin Basic Mathematical
More informationAnti-aliasing and Monte Carlo Path Tracing. Brian Curless CSE 557 Autumn 2017
Anti-aliasing and Monte Carlo Path Tracing Brian Curless CSE 557 Autumn 2017 1 Reading Required: Marschner and Shirley, Section 13.4 (online handout) Pharr, Jakob, and Humphreys, Physically Based Ray Tracing:
More informationOutline for Today. How can we speed up operations that work on integer data? A simple data structure for ordered dictionaries.
van Emde Boas Trees Outline for Today Data Structures on Integers How can we speed up operations that work on integer data? Tiered Bitvectors A simple data structure for ordered dictionaries. van Emde
More informationTopology 550A Homework 3, Week 3 (Corrections: February 22, 2012)
Topology 550A Homework 3, Week 3 (Corrections: February 22, 2012) Michael Tagare De Guzman January 31, 2012 4A. The Sorgenfrey Line The following material concerns the Sorgenfrey line, E, introduced in
More informationPackage simed. November 27, 2017
Version 1.0.3 Title Simulation Education Author Barry Lawson, Larry Leemis Package simed November 27, 2017 Maintainer Barry Lawson Imports graphics, grdevices, methods, stats, utils
More informationA Quick Introduction to R
Math 4501 Fall 2012 A Quick Introduction to R The point of these few pages is to give you a quick introduction to the possible uses of the free software R in statistical analysis. I will only expect you
More informationLecture 11. Lecture 11: External Sorting
Lecture 11 Lecture 11: External Sorting Lecture 11 Announcements 1. Midterm Review: This Friday! 2. Project Part #2 is out. Implement CLOCK! 3. Midterm Material: Everything up to Buffer management. 1.
More informationAlgorithms. Appendix B. B.1 Matrix Algorithms. Matrix/Matrix multiplication. Vector/Matrix multiplication. This appendix is about algorithms.
Appendix B Algorithms This appendix is about algorithms. B.1 Matrix Algorithms When describing algorithms for manipulating matrices, we will use the notation x[i] for the i-th element of a vector (row
More informationCS 237 Fall 2018, Homework 08 Solution
CS 237 Fall 2018, Homework 08 Solution Due date: Thursday November 8th at 11:59 pm (10% off if up to 24 hours late) via Gradescope General Instructions Please complete this notebook by filling in solutions
More informationMA651 Topology. Lecture 4. Topological spaces 2
MA651 Topology. Lecture 4. Topological spaces 2 This text is based on the following books: Linear Algebra and Analysis by Marc Zamansky Topology by James Dugundgji Fundamental concepts of topology by Peter
More informationAnti-aliasing and Monte Carlo Path Tracing
Reading Required: Anti-aliasing and Monte Carlo Path Tracing Brian Curless CSE 557 Autumn 2017 Marschner and Shirley, Section 13.4 (online handout) Pharr, Jakob, and Humphreys, Physically Based Ray Tracing:
More informationLecture 4: examples of topological spaces, coarser and finer topologies, bases and closed sets
Lecture 4: examples of topological spaces, coarser and finer topologies, bases and closed sets Saul Glasman 14 September 2016 Let s give the definition of an open subset of R. Definition 1. Let U R. We
More informationLecture 27: Review. Reading: All chapters in ISLR. STATS 202: Data mining and analysis. December 6, 2017
Lecture 27: Review Reading: All chapters in ISLR. STATS 202: Data mining and analysis December 6, 2017 1 / 16 Final exam: Announcements Tuesday, December 12, 8:30-11:30 am, in the following rooms: Last
More informationLecture 3: Recursion; Structural Induction
15-150 Lecture 3: Recursion; Structural Induction Lecture by Dan Licata January 24, 2012 Today, we are going to talk about one of the most important ideas in functional programming, structural recursion
More informationUCSD CSE 21, Spring 2014 [Section B00] Mathematics for Algorithm and System Analysis
UCSD CSE 21, Spring 2014 [Section B00] Mathematics for Algorithm and System Analysis Lecture 11 Class URL: http://vlsicad.ucsd.edu/courses/cse21-s14/ Lecture 11 Notes Goals for this week (Tuesday) Linearity
More informationCSC 261/461 Database Systems Lecture 21 and 22. Spring 2017 MW 3:25 pm 4:40 pm January 18 May 3 Dewey 1101
CSC 261/461 Database Systems Lecture 21 and 22 Spring 2017 MW 3:25 pm 4:40 pm January 18 May 3 Dewey 1101 Announcements Project 3 (MongoDB): Due on: 04/12 Work on Term Project and Project 1 The last (mini)
More informationComputational Methods. Randomness and Monte Carlo Methods
Computational Methods Randomness and Monte Carlo Methods Manfred Huber 2010 1 Randomness and Monte Carlo Methods Introducing randomness in an algorithm can lead to improved efficiencies Random sampling
More informationIntroduction to Machine Learning
Introduction to Machine Learning Brown University CSCI 1950-F, Spring 2012 Prof. Erik Sudderth Lecture 2: Probability: Discrete Random Variables Classification: Validation & Model Selection Many figures
More informationCS510 \ Lecture Ariel Stolerman
CS510 \ Lecture02 2012-10-03 1 Ariel Stolerman Midterm Evan will email about that after the lecture, at least 2 lectures from now. The exam will be given in a regular PDF (not an online form). We will
More information1 Overview, Models of Computation, Brent s Theorem
CME 323: Distributed Algorithms and Optimization, Spring 2017 http://stanford.edu/~rezab/dao. Instructor: Reza Zadeh, Matroid and Stanford. Lecture 1, 4/3/2017. Scribed by Andreas Santucci. 1 Overview,
More information2 The Fractional Chromatic Gap
C 1 11 2 The Fractional Chromatic Gap As previously noted, for any finite graph. This result follows from the strong duality of linear programs. Since there is no such duality result for infinite linear
More informationWeek 9: Planar and non-planar graphs. 7 and 9 November, 2018
(1/27) MA284 : Discrete Mathematics Week 9: Planar and non-planar graphs http://www.maths.nuigalway.ie/ niall/ma284/ 7 and 9 November, 2018 1 Planar graphs and Euler s formula 2 Non-planar graphs K 5 K
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 informationLAB #2: SAMPLING, SAMPLING DISTRIBUTIONS, AND THE CLT
NAVAL POSTGRADUATE SCHOOL LAB #2: SAMPLING, SAMPLING DISTRIBUTIONS, AND THE CLT Statistics (OA3102) Lab #2: Sampling, Sampling Distributions, and the Central Limit Theorem Goal: Use R to demonstrate sampling
More informationLectures on Challenging Mathematics. Integrated Mathematics 3. Idea Math. Algebra (part 2) Summer Internal Use
Lectures on Challenging Mathematics c Copyright 2008 2018 Integrated Mathematics 3 Algebra (part 2) Summer 2018 Zuming Feng Phillips Exeter Academy and IDEA Math zfeng@exeteredu Copyright c 2008 2018 IDEA
More informationPoint-Set Topology 1. TOPOLOGICAL SPACES AND CONTINUOUS FUNCTIONS
Point-Set Topology 1. TOPOLOGICAL SPACES AND CONTINUOUS FUNCTIONS Definition 1.1. Let X be a set and T a subset of the power set P(X) of X. Then T is a topology on X if and only if all of the following
More informationSolving Linear Recurrence Relations (8.2)
EECS 203 Spring 2016 Lecture 18 Page 1 of 10 Review: Recurrence relations (Chapter 8) Last time we started in on recurrence relations. In computer science, one of the primary reasons we look at solving
More informationMonte Carlo Integration
Lab 18 Monte Carlo Integration Lab Objective: Implement Monte Carlo integration to estimate integrals. Use Monte Carlo Integration to calculate the integral of the joint normal distribution. Some multivariable
More informationChapter 1 Introduction to Statistics
Corresponds to ELEMENTARY STATISTICS USING THE TI 83/84 PLUS CALCULATOR 3rd ed. Lecture Slides Elementary Statistics Eleventh Edition and the Triola Statistics Series by Mario F. Triola Chapter 1 Introduction
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 informationMidterm CSE 21 Spring 2012
Signature Name Student ID Midterm CSE 21 Spring 2012 Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 _ (20 points) _ (15 points) _ (13 points) _ (23 points) _ (10 points) _ (8 points) Total _ (89 points) (84
More informationINTRODUCTION TO TOPOLOGY
INTRODUCTION TO TOPOLOGY MARTINA ROVELLI These notes are an outline of the topics covered in class, and are not substitutive of the lectures, where (most) proofs are provided and examples are discussed
More informationComputer Applications for Engineers ET 601
Computer Applications for Engineers ET 601 Asst. Prof. Dr. Prapun Suksompong prapun@siit.tu.ac.th Random Variables 1 Office Hours: (BKD 3601-7) Wednesday 9:30-11:30 Wednesday 16:00-17:00 Thursday 14:40-16:00
More informationLecture 13. Math 22 Summer 2017 July 17, 2017
Lecture 13 Math 22 Summer 2017 July 17, 2017 Reminders/Announcements Midterm 1 Wednesday, July 19, Kemeny 008, 6pm-8pm Please respond to email if you have a conflict with this time! Kate is moving her
More informationMonte Carlo Techniques. Professor Stephen Sekula Guest Lecture PHY 4321/7305 Sep. 3, 2014
Monte Carlo Techniques Professor Stephen Sekula Guest Lecture PHY 431/7305 Sep. 3, 014 What are Monte Carlo Techniques? Computational algorithms that rely on repeated random sampling in order to obtain
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 informationCS302 Topic: Simulation, Part II
CS302 Topic: Simulation, Part II Thursday, Oct. 6, 200 Gone out Here is a computer simulation of your dinner Announcements Lab 4 (Stock Reports); due this Friday, Oct. Lab (Algorithm Analysis) now available;
More informationLecture 12. Lecture 12: The IO Model & External Sorting
Lecture 12 Lecture 12: The IO Model & External Sorting Announcements Announcements 1. Thank you for the great feedback (post coming soon)! 2. Educational goals: 1. Tech changes, principles change more
More informationand F is an antiderivative of f
THE EVALUATION OF DEFINITE INTEGRALS Prepared by Ingrid Stewart, Ph.D., College of Southern Nevada Please Send Questions Comments to ingrid.stewart@csn.edu. Thank you! We have finally reached a point,
More informationCS144: Intro to Computer Networks Homework 1 Scan and submit your solution online. Due Friday January 30, 4pm
CS144: Intro to Computer Networks Homework 1 Scan and submit your solution online. Due Friday January 30, 2015 @ 4pm Your Name: Answers SUNet ID: root @stanford.edu Check if you would like exam routed
More informationCPSC 536N: Randomized Algorithms Term 2. Lecture 5
CPSC 536N: Randomized Algorithms 2011-12 Term 2 Prof. Nick Harvey Lecture 5 University of British Columbia In this lecture we continue to discuss applications of randomized algorithms in computer networking.
More informationLast week: Breadth-First Search
1 Last week: Breadth-First Search Set L i = [] for i=1,,n L 0 = {w}, where w is the start node For i = 0,, n-1: For u in L i : For each v which is a neighbor of u: If v isn t yet visited: - mark v as visited,
More information