LECTURE 16. Readings: Section 5.1. Lecture outline. Random processes Definition of the Bernoulli process Basic properties of the Bernoulli process
|
|
|
- Prosper Gallagher
- 7 years ago
- Views:
Transcription
1 LECTURE 16 Readings: Section 5.1 Lecture outline Random processes Definition of the Bernoulli process Basic properties of the Bernoulli process Number of successes Distribution of interarrival times The time of the success
2 Random Processes: Motivation Sequence of random variables: Examples: Arrival example: Arrival of people to a bank. Queuing example: Length of a line at a bank. Gambler s ruin: The probability of an outcome is a function of the probability of other outcomes (Markov Chains). Engineering example: Signal corrupted with noise.
3 The Bernoulli Process A sequence of independent Bernoulli trials. At each trial: T T T H T T T H H T T T T T H T H T T H $ $ $ $ $ $ Examples: Sequence of ups and downs of the Dow Jones. Sequence of lottery wins/losses. Arrivals (each second) to a bank.
4 Number of successes in time slots (Binomial) Mean: Variance:
5 Interarrival Times : number of trials until first success (inclusive). (Geometric) Memoryless property. Mean: Variance:
6 Fresh Start and Memoryless Properties Fresh Start Given n, the future sequence is a also a Bernoulli process and is independent of the past. Memorylessness Suppose we observe the process for n times and no success occurred. Then the pmf of the remaining time for arrival is geometric.
7 Time of the Arrival : number of trials until success (inclusive). : kth interarrival time It follows that:
8 Time of the Arrival : number of trials until success (inclusive). Mean: Variance: (Pascal)
9 LECTURE 17 Readings: Start Section 5.2 Lecture outline Review of the Bernoulli process Definition of the Poisson process Basic properties of the Poisson process Distribution of the number of arrivals Distribution of the interarrival time Distribution of the arrival time
10 The Bernoulli Process: Review Discrete time; success probability in each slot =. PMF of number of arrivals in time slots: Binomial PMF of interarrival time: PMF of time to arrival: Memorylessness Geometric Pascal What about continuous arrival times? Example: arrival to a bank.
11 The Poisson Process: Definition Let = Assumptions: Probability of arrivals in an interval of duration. Number of arrivals in disjoint time intervals are independent. For VERY small, we have: = arrival rate of the process.
12 From Bernoulli to Poisson (1) Bernoulli: Arrival prob. in each time slot = Poisson: Arrival probability in each -interval = Let and : Number of arrivals in a -interval = Number of successes in time slots (Binomial)
13 From Bernoulli to Poisson (2) Number of arrivals in a -interval as = (Binomial) (reorder terms) (Poisson)
14 PMF of Number of Arrivals : number of arrivals in a -interval, thus: (Poisson) Mean: Variance: Transform:
15 Example You get according to a Poisson process, at a rate of = 0.4 messages per hour. You check your every thirty minutes. Prob. of no new messages = Prob. of one new message =
16 Interarrival Time : time of the arrival. First order interarrival time: (Exponential) Why:
17 Interarrival Time Fresh Start Property: The time of the next arrival is independent from the past. Memoryless property: Suppose we observe the process for T seconds and no success occurred. Then the density of the remaining time for arrival is exponential. Example: You start checking your . How long will you wait, in average, until you receive your next ?
18 Time of Arrival : time of the arrival. : kth interarrival time It follows that:
19 Time of Arrival : time of the arrival. (Erlang) of order
20 Bernoulli vs. Poisson Times of Arrival Arrival Rate PMF of Number of Arrivals PMF of Interarrival Time PMF of Arrival Time Bernoulli Discrete /per trial Binomial Geometric Pascal Poisson Continuous /unit time Poisson Exponential Erlang
21 LECTURE 18 Readings: Finish Section 5.2 Lecture outline Review of the Poisson process Properties Adding Poisson Processes Splitting Poisson Processes Examples
22 The Poisson Process: Review Number of arrivals in disjoint time intervals are independent, = arrival rate (for very small ) (Poisson) Interarrival times (k =1): Time to the arrival: (Exponential) (Erlang)
23 Example: Poisson Catches Catching fish according to Poisson. Fish for two hours, but if there s no catch, continue until the first one.
24 Example: Poisson Catches Catching fish according to Poisson. Fish for two hours, but if there s no catch, continue until the first one.
25 Adding (Merging) Poisson Processes Sum of independent Poisson random variables is Poisson. Sum of independent Poisson processes is Poisson. Red light flashes Green light flashes Some light flashes What is the probability that the next arrival comes from the first process?
26 Splitting of Poisson Processes Each message is routed along the first stream with probability, and along the second stream with probability. Routing of different messages are independent. traffic leaving MIT Server USA Foreign Each output stream is Poisson.
27 Example: Filter (1) You have incoming from two sources: valid , and spam. We assume both to be Poisson. Your receive, on average, 2 valid s per hour, and 1 spam every 5 hours. Valid Spam Total incoming rate = Incoming Probability that a received is spam =
28 Example: Filter (2) You install a spam filter, that filters out spam correctly 80% of the time, but also identifies a valid as spam 5% of the time. Valid Spam Folder Inbox Spam Inbox rate = Spam folder rate =
29 Example: Filter (3) Valid Spam Folder Inbox Spam Probability that an in the inbox is spam = Probability that an in the spam folder is valid = Every how often should you check your spam folder, to find one valid , on average?
Tenth Problem Assignment
EECS 40 Due on April 6, 007 PROBLEM (8 points) Dave is taking a multiple-choice exam. You may assume that the number of questions is infinite. Simultaneously, but independently, his conscious and subconscious
The Exponential Distribution
21 The Exponential Distribution From Discrete-Time to Continuous-Time: In Chapter 6 of the text we will be considering Markov processes in continuous time. In a sense, we already have a very good understanding
Master s Theory Exam Spring 2006
Spring 2006 This exam contains 7 questions. You should attempt them all. Each question is divided into parts to help lead you through the material. You should attempt to complete as much of each problem
2WB05 Simulation Lecture 8: Generating random variables
2WB05 Simulation Lecture 8: Generating random variables Marko Boon http://www.win.tue.nl/courses/2wb05 January 7, 2013 Outline 2/36 1. How do we generate random variables? 2. Fitting distributions Generating
M/M/1 and M/M/m Queueing Systems
M/M/ and M/M/m Queueing Systems M. Veeraraghavan; March 20, 2004. Preliminaries. Kendall s notation: G/G/n/k queue G: General - can be any distribution. First letter: Arrival process; M: memoryless - exponential
Math 370/408, Spring 2008 Prof. A.J. Hildebrand. Actuarial Exam Practice Problem Set 2 Solutions
Math 70/408, Spring 2008 Prof. A.J. Hildebrand Actuarial Exam Practice Problem Set 2 Solutions About this problem set: These are problems from Course /P actuarial exams that I have collected over the years,
Queuing Theory. Long Term Averages. Assumptions. Interesting Values. Queuing Model
Queuing Theory Queuing Theory Queuing theory is the mathematics of waiting lines. It is extremely useful in predicting and evaluating system performance. Queuing theory has been used for operations research.
Chapter 3: DISCRETE RANDOM VARIABLES AND PROBABILITY DISTRIBUTIONS. Part 3: Discrete Uniform Distribution Binomial Distribution
Chapter 3: DISCRETE RANDOM VARIABLES AND PROBABILITY DISTRIBUTIONS Part 3: Discrete Uniform Distribution Binomial Distribution Sections 3-5, 3-6 Special discrete random variable distributions we will cover
Notes on Continuous Random Variables
Notes on Continuous Random Variables Continuous random variables are random quantities that are measured on a continuous scale. They can usually take on any value over some interval, which distinguishes
ECE302 Spring 2006 HW4 Solutions February 6, 2006 1
ECE302 Spring 2006 HW4 Solutions February 6, 2006 1 Solutions to HW4 Note: Most of these solutions were generated by R. D. Yates and D. J. Goodman, the authors of our textbook. I have added comments in
Homework 4 - KEY. Jeff Brenion. June 16, 2004. Note: Many problems can be solved in more than one way; we present only a single solution here.
Homework 4 - KEY Jeff Brenion June 16, 2004 Note: Many problems can be solved in more than one way; we present only a single solution here. 1 Problem 2-1 Since there can be anywhere from 0 to 4 aces, the
e.g. arrival of a customer to a service station or breakdown of a component in some system.
Poisson process Events occur at random instants of time at an average rate of λ events per second. e.g. arrival of a customer to a service station or breakdown of a component in some system. Let N(t) be
Process simulation. Enn Õunapuu enn.ounapuu@ttu.ee
Process simulation Enn Õunapuu enn.ounapuu@ttu.ee Content Problem How? Example Simulation Definition Modeling and simulation functionality allows for preexecution what-if modeling and simulation. Postexecution
FEGYVERNEKI SÁNDOR, PROBABILITY THEORY AND MATHEmATICAL
FEGYVERNEKI SÁNDOR, PROBABILITY THEORY AND MATHEmATICAL STATIsTICs 4 IV. RANDOm VECTORs 1. JOINTLY DIsTRIBUTED RANDOm VARIABLEs If are two rom variables defined on the same sample space we define the joint
Introduction to Probability
Introduction to Probability EE 179, Lecture 15, Handout #24 Probability theory gives a mathematical characterization for experiments with random outcomes. coin toss life of lightbulb binary data sequence
STAT 315: HOW TO CHOOSE A DISTRIBUTION FOR A RANDOM VARIABLE
STAT 315: HOW TO CHOOSE A DISTRIBUTION FOR A RANDOM VARIABLE TROY BUTLER 1. Random variables and distributions We are often presented with descriptions of problems involving some level of uncertainty about
Practice Problems #4
Practice Problems #4 PRACTICE PROBLEMS FOR HOMEWORK 4 (1) Read section 2.5 of the text. (2) Solve the practice problems below. (3) Open Homework Assignment #4, solve the problems, and submit multiple-choice
Load Balancing and Switch Scheduling
EE384Y Project Final Report Load Balancing and Switch Scheduling Xiangheng Liu Department of Electrical Engineering Stanford University, Stanford CA 94305 Email: liuxh@systems.stanford.edu Abstract Load
Manufacturing Systems Modeling and Analysis
Guy L. Curry Richard M. Feldman Manufacturing Systems Modeling and Analysis 4y Springer 1 Basic Probability Review 1 1.1 Basic Definitions 1 1.2 Random Variables and Distribution Functions 4 1.3 Mean and
Important Probability Distributions OPRE 6301
Important Probability Distributions OPRE 6301 Important Distributions... Certain probability distributions occur with such regularity in real-life applications that they have been given their own names.
ECE302 Spring 2006 HW3 Solutions February 2, 2006 1
ECE302 Spring 2006 HW3 Solutions February 2, 2006 1 Solutions to HW3 Note: Most of these solutions were generated by R. D. Yates and D. J. Goodman, the authors of our textbook. I have added comments in
6.2. Discrete Probability Distributions
6.2. Discrete Probability Distributions Discrete Uniform distribution (diskreetti tasajakauma) A random variable X follows the dicrete uniform distribution on the interval [a, a+1,..., b], if it may attain
Exponential Distribution
Exponential Distribution Definition: Exponential distribution with parameter λ: { λe λx x 0 f(x) = 0 x < 0 The cdf: F(x) = x Mean E(X) = 1/λ. f(x)dx = Moment generating function: φ(t) = E[e tx ] = { 1
Probability density function : An arbitrary continuous random variable X is similarly described by its probability density function f x = f X
Week 6 notes : Continuous random variables and their probability densities WEEK 6 page 1 uniform, normal, gamma, exponential,chi-squared distributions, normal approx'n to the binomial Uniform [,1] random
Chapter 5. Random variables
Random variables random variable numerical variable whose value is the outcome of some probabilistic experiment; we use uppercase letters, like X, to denote such a variable and lowercase letters, like
Math 461 Fall 2006 Test 2 Solutions
Math 461 Fall 2006 Test 2 Solutions Total points: 100. Do all questions. Explain all answers. No notes, books, or electronic devices. 1. [105+5 points] Assume X Exponential(λ). Justify the following two
Resource Provisioning and Network Traffic
Resource Provisioning and Network Traffic Network engineering: Feedback traffic control closed-loop control ( adaptive ) small time scale: msec mainly by end systems e.g., congestion control Resource provisioning
UNIT 2 QUEUING THEORY
UNIT 2 QUEUING THEORY LESSON 24 Learning Objective: Apply formulae to find solution that will predict the behaviour of the single server model II. Apply formulae to find solution that will predict the
Math 431 An Introduction to Probability. Final Exam Solutions
Math 43 An Introduction to Probability Final Eam Solutions. A continuous random variable X has cdf a for 0, F () = for 0 <
by Dimitri P. Bertsekas and John N. Tsitsiklis Last updated: October 8, 2002
INTRODUCTION TO PROBABILITY by Dimitri P. Bertsekas and John N. Tsitsiklis CHAPTER 5: ADDITIONAL PROBLEMS Last updated: October 8, 2002 Problems marked with [D] are from Fundamentals of Applied Probability,
6.263/16.37: Lectures 5 & 6 Introduction to Queueing Theory
6.263/16.37: Lectures 5 & 6 Introduction to Queueing Theory Massachusetts Institute of Technology Slide 1 Packet Switched Networks Messages broken into Packets that are routed To their destination PS PS
Network Design Performance Evaluation, and Simulation #6
Network Design Performance Evaluation, and Simulation #6 1 Network Design Problem Goal Given QoS metric, e.g., Average delay Loss probability Characterization of the traffic, e.g., Average interarrival
Chapter 5 Discrete Probability Distribution. Learning objectives
Chapter 5 Discrete Probability Distribution Slide 1 Learning objectives 1. Understand random variables and probability distributions. 1.1. Distinguish discrete and continuous random variables. 2. Able
Chapter 1. Introduction
Chapter 1 Introduction 1.1. Motivation Network performance analysis, and the underlying queueing theory, was born at the beginning of the 20th Century when two Scandinavian engineers, Erlang 1 and Engset
2. Discrete random variables
2. Discrete random variables Statistics and probability: 2-1 If the chance outcome of the experiment is a number, it is called a random variable. Discrete random variable: the possible outcomes can be
CHAPTER 3 CALL CENTER QUEUING MODEL WITH LOGNORMAL SERVICE TIME DISTRIBUTION
31 CHAPTER 3 CALL CENTER QUEUING MODEL WITH LOGNORMAL SERVICE TIME DISTRIBUTION 3.1 INTRODUCTION In this chapter, construction of queuing model with non-exponential service time distribution, performance
Section 6.1 Discrete Random variables Probability Distribution
Section 6.1 Discrete Random variables Probability Distribution Definitions a) Random variable is a variable whose values are determined by chance. b) Discrete Probability distribution consists of the values
CHAPTER 6: Continuous Uniform Distribution: 6.1. Definition: The density function of the continuous random variable X on the interval [A, B] is.
![CHAPTER 6: Continuous Uniform Distribution: 6.1. Definition: The density function of the continuous random variable X on the interval [A, B] is.](/thumbs/40/21160284.jpg "CHAPTER 6: Continuous Uniform Distribution: 6.1. Definition: The density function of the continuous random variable X on the interval [A, B] is.")
Some Continuous Probability Distributions CHAPTER 6: Continuous Uniform Distribution: 6. Definition: The density function of the continuous random variable X on the interval [A, B] is B A A x B f(x; A,
Random variables, probability distributions, binomial random variable
Week 4 lecture notes. WEEK 4 page 1 Random variables, probability distributions, binomial random variable Eample 1 : Consider the eperiment of flipping a fair coin three times. The number of tails that
Math 370, Spring 2008 Prof. A.J. Hildebrand. Practice Test 1 Solutions
Math 70, Spring 008 Prof. A.J. Hildebrand Practice Test Solutions About this test. This is a practice test made up of a random collection of 5 problems from past Course /P actuarial exams. Most of the
EXAM 3, FALL 003 Please note: On a one-time basis, the CAS is releasing annotated solutions to Fall 003 Examination 3 as a study aid to candidates. It is anticipated that for future sittings, only the
TEST 2 STUDY GUIDE. 1. Consider the data shown below.
2006 by The Arizona Board of Regents for The University of Arizona All rights reserved Business Mathematics I TEST 2 STUDY GUIDE 1 Consider the data shown below (a) Fill in the Frequency and Relative Frequency
Introduction to Queueing Theory and Stochastic Teletraffic Models
Introduction to Queueing Theory and Stochastic Teletraffic Models Moshe Zukerman EE Department, City University of Hong Kong Copyright M. Zukerman c 2000 2015 Preface The aim of this textbook is to provide
Setting up Junk Email Filters By Louise Ryan, NW District IT Expert
The email servers on campus are no longer set up to filter junk emails from your inbox. If you are getting a significant number of junk emails in your inbox you can set up your own filters in Outlook.
Name: Math 29 Probability. Practice Second Midterm Exam 1. 1. Show all work. You may receive partial credit for partially completed problems.
Name: Math 29 Probability Practice Second Midterm Exam 1 Instructions: 1. Show all work. You may receive partial credit for partially completed problems. 2. You may use calculators and a one-sided sheet
Point Biserial Correlation Tests
Chapter 807 Point Biserial Correlation Tests Introduction The point biserial correlation coefficient (ρ in this chapter) is the product-moment correlation calculated between a continuous random variable
AE64 TELECOMMUNICATION SWITCHING SYSTEMS
Q2. a. Draw the schematic of a 1000 line strowger switching system and explain how subscribers get connected. Ans: (Page: 61 of Text book 1 and 56 of Text book 2) b. Explain the various design parameters
Waiting Times Chapter 7
Waiting Times Chapter 7 1 Learning Objectives Interarrival and Service Times and their variability Obtaining the average time spent in the queue Pooling of server capacities Priority rules Where are the
What is Statistics? Lecture 1. Introduction and probability review. Idea of parametric inference
0. 1. Introduction and probability review 1.1. What is Statistics? What is Statistics? Lecture 1. Introduction and probability review There are many definitions: I will use A set of principle and procedures
Sampling Distributions
Sampling Distributions You have seen probability distributions of various types. The normal distribution is an example of a continuous distribution that is often used for quantitative measures such as
Chapter 9 Monté Carlo Simulation
MGS 3100 Business Analysis Chapter 9 Monté Carlo What Is? A model/process used to duplicate or mimic the real system Types of Models Physical simulation Computer simulation When to Use (Computer) Models?
STT315 Chapter 4 Random Variables & Probability Distributions KM. Chapter 4.5, 6, 8 Probability Distributions for Continuous Random Variables
Chapter 4.5, 6, 8 Probability Distributions for Continuous Random Variables Discrete vs. continuous random variables Examples of continuous distributions o Uniform o Exponential o Normal Recall: A random
Statistics 100A Homework 4 Solutions
Problem 1 For a discrete random variable X, Statistics 100A Homework 4 Solutions Ryan Rosario Note that all of the problems below as you to prove the statement. We are proving the properties of epectation
Queuing Theory II 2006 Samuel L. Baker
QUEUING THEORY II 1 More complex queues: Multiple Server Single Stage Queue Queuing Theory II 2006 Samuel L. Baker Assignment 8 is on page 7. Assignment 8A is on page 10. -- meaning that we have one line
1.5 / 1 -- Communication Networks II (Görg) -- www.comnets.uni-bremen.de. 1.5 Transforms
.5 / -- Communication Networks II (Görg) -- www.comnets.uni-bremen.de.5 Transforms Using different summation and integral transformations pmf, pdf and cdf/ccdf can be transformed in such a way, that even
5. Continuous Random Variables
5. Continuous Random Variables Continuous random variables can take any value in an interval. They are used to model physical characteristics such as time, length, position, etc. Examples (i) Let X be
1. Repetition probability theory and transforms
1. Repetition probability theory and transforms 1.1. A prisoner is kept in a cell with three doors. Through one of them he can get out of the prison. The other one leads to a tunnel: through this he is
Lecture 7: Continuous Random Variables
Lecture 7: Continuous Random Variables 21 September 2005 1 Our First Continuous Random Variable The back of the lecture hall is roughly 10 meters across. Suppose it were exactly 10 meters, and consider
6.041/6.431 Spring 2008 Quiz 2 Wednesday, April 16, 7:30-9:30 PM. SOLUTIONS
6.4/6.43 Spring 28 Quiz 2 Wednesday, April 6, 7:3-9:3 PM. SOLUTIONS Name: Recitation Instructor: TA: 6.4/6.43: Question Part Score Out of 3 all 36 2 a 4 b 5 c 5 d 8 e 5 f 6 3 a 4 b 6 c 6 d 6 e 6 Total
STAT 360 Probability and Statistics. Fall 2012
STAT 360 Probability and Statistics Fall 2012 1) General information: Crosslisted course offered as STAT 360, MATH 360 Semester: Fall 2012, Aug 20--Dec 07 Course name: Probability and Statistics Number
Statistics I for QBIC. Contents and Objectives. Chapters 1 7. Revised: August 2013
Statistics I for QBIC Text Book: Biostatistics, 10 th edition, by Daniel & Cross Contents and Objectives Chapters 1 7 Revised: August 2013 Chapter 1: Nature of Statistics (sections 1.1-1.6) Objectives
uation of a Poisson Process for Emergency Care
QUEUEING THEORY WITH APPLICATIONS AND SPECIAL CONSIDERATION TO EMERGENCY CARE JAMES KEESLING. Introduction Much that is essential in modern life would not be possible without queueing theory. All communication
4 The M/M/1 queue. 4.1 Time-dependent behaviour
4 The M/M/1 queue In this chapter we will analyze the model with exponential interarrival times with mean 1/λ, exponential service times with mean 1/µ and a single server. Customers are served in order
Fourth Problem Assignment
EECS 401 Due on Feb 2, 2007 PROBLEM 1 (25 points) Joe and Helen each know that the a priori probability that her mother will be home on any given night is 0.6. However, Helen can determine her mother s
Midterm Exam #1 Instructions:
Public Affairs 818 Professor: Geoffrey L. Wallace October 9 th, 008 Midterm Exam #1 Instructions: You have 10 minutes to complete the examination and there are 6 questions worth a total of 10 points. The
Stat 515 Midterm Examination II April 6, 2010 (9:30 a.m. - 10:45 a.m.)
Name: Stat 515 Midterm Examination II April 6, 2010 (9:30 a.m. - 10:45 a.m.) The total score is 100 points. Instructions: There are six questions. Each one is worth 20 points. TA will grade the best five
Simple Queuing Theory Tools You Can Use in Healthcare
Simple Queuing Theory Tools You Can Use in Healthcare Jeff Johnson Management Engineering Project Director North Colorado Medical Center Abstract Much has been written about queuing theory and its powerful
QNAT. A Graphical Queuing Network Analysis Tool for General Open and Closed Queuing Networks. Sanjay K. Bose
QNAT A Graphical Queuing Network Analysis Tool for General Open and Closed Queuing Networks Sanjay K. Bose QNAT developed at - Dept. Elect. Engg., I.I.T., Kanpur, INDIA by - Sanjay K. Bose skb@ieee.org
Lecture Notes 1. Brief Review of Basic Probability
Probability Review Lecture Notes Brief Review of Basic Probability I assume you know basic probability. Chapters -3 are a review. I will assume you have read and understood Chapters -3. Here is a very
SPARE PARTS INVENTORY SYSTEMS UNDER AN INCREASING FAILURE RATE DEMAND INTERVAL DISTRIBUTION
SPARE PARS INVENORY SYSEMS UNDER AN INCREASING FAILURE RAE DEMAND INERVAL DISRIBUION Safa Saidane 1, M. Zied Babai 2, M. Salah Aguir 3, Ouajdi Korbaa 4 1 National School of Computer Sciences (unisia),
Sums of Independent Random Variables
Chapter 7 Sums of Independent Random Variables 7.1 Sums of Discrete Random Variables In this chapter we turn to the important question of determining the distribution of a sum of independent random variables
3.4. The Binomial Probability Distribution. Copyright Cengage Learning. All rights reserved.
3.4 The Binomial Probability Distribution Copyright Cengage Learning. All rights reserved. The Binomial Probability Distribution There are many experiments that conform either exactly or approximately
Queueing Systems. Ivo Adan and Jacques Resing
Queueing Systems Ivo Adan and Jacques Resing Department of Mathematics and Computing Science Eindhoven University of Technology P.O. Box 513, 5600 MB Eindhoven, The Netherlands March 26, 2015 Contents
Exploratory Data Analysis
Exploratory Data Analysis Johannes Schauer johannes.schauer@tugraz.at Institute of Statistics Graz University of Technology Steyrergasse 17/IV, 8010 Graz www.statistics.tugraz.at February 12, 2008 Introduction
Lectures on Stochastic Processes. William G. Faris
Lectures on Stochastic Processes William G. Faris November 8, 2001 2 Contents 1 Random walk 7 1.1 Symmetric simple random walk................... 7 1.2 Simple random walk......................... 9 1.3
IEOR 6711: Stochastic Models, I Fall 2012, Professor Whitt, Final Exam SOLUTIONS
IEOR 6711: Stochastic Models, I Fall 2012, Professor Whitt, Final Exam SOLUTIONS There are four questions, each with several parts. 1. Customers Coming to an Automatic Teller Machine (ATM) (30 points)
Analysis of a Production/Inventory System with Multiple Retailers
Analysis of a Production/Inventory System with Multiple Retailers Ann M. Noblesse 1, Robert N. Boute 1,2, Marc R. Lambrecht 1, Benny Van Houdt 3 1 Research Center for Operations Management, University
Internet Dial-Up Traffic Modelling
NTS 5, Fifteenth Nordic Teletraffic Seminar Lund, Sweden, August 4, Internet Dial-Up Traffic Modelling Villy B. Iversen Arne J. Glenstrup Jens Rasmussen Abstract This paper deals with analysis and modelling
0 x = 0.30 x = 1.10 x = 3.05 x = 4.15 x = 6 0.4 x = 12. f(x) =
. A mail-order computer business has si telephone lines. Let X denote the number of lines in use at a specified time. Suppose the pmf of X is as given in the accompanying table. 0 2 3 4 5 6 p(.0.5.20.25.20.06.04
ANALYZING NETWORK TRAFFIC FOR MALICIOUS ACTIVITY
CANADIAN APPLIED MATHEMATICS QUARTERLY Volume 12, Number 4, Winter 2004 ANALYZING NETWORK TRAFFIC FOR MALICIOUS ACTIVITY SURREY KIM, 1 SONG LI, 2 HONGWEI LONG 3 AND RANDALL PYKE Based on work carried out
Chapter 5. Discrete Probability Distributions
Chapter 5. Discrete Probability Distributions Chapter Problem: Did Mendel s result from plant hybridization experiments contradicts his theory? 1. Mendel s theory says that when there are two inheritable
Institute of Actuaries of India Subject CT3 Probability and Mathematical Statistics
Institute of Actuaries of India Subject CT3 Probability and Mathematical Statistics For 2015 Examinations Aim The aim of the Probability and Mathematical Statistics subject is to provide a grounding in
Session 10. Laboratory Works
Session 10 Laboratory Works Adding-in the data analysis tool pack to excel Statistical analysis such as descriptive statistics and regression requires the Excel Data Analysis add-in. The default configuration
2 Binomial, Poisson, Normal Distribution
2 Binomial, Poisson, Normal Distribution Binomial Distribution ): We are interested in the number of times an event A occurs in n independent trials. In each trial the event A has the same probability
Selecting the Right Distribution in @RISK
Selecting the Right Distribution in @RISK October 2009 By Michael Rees mrees@palisade.com Michael Rees Professional Experience» 20 years Strategy consultant Equity analyst Independent consultant» Palisade
Overview of Monte Carlo Simulation, Probability Review and Introduction to Matlab
Monte Carlo Simulation: IEOR E4703 Fall 2004 c 2004 by Martin Haugh Overview of Monte Carlo Simulation, Probability Review and Introduction to Matlab 1 Overview of Monte Carlo Simulation 1.1 Why use simulation?
Midterm Exam #1 Instructions:
Public Affairs 818 Professor: Geoffrey L. Wallace October 9 th, 008 Midterm Exam #1 Instructions: You have 10 minutes to complete the examination and there are 6 questions worth a total of 10 points. The
Aachen Summer Simulation Seminar 2014
Aachen Summer Simulation Seminar 2014 Lecture 07 Input Modelling + Experimentation + Output Analysis Peer-Olaf Siebers pos@cs.nott.ac.uk Motivation 1. Input modelling Improve the understanding about how
WHERE DOES THE 10% CONDITION COME FROM?
1 WHERE DOES THE 10% CONDITION COME FROM? The text has mentioned The 10% Condition (at least) twice so far: p. 407 Bernoulli trials must be independent. If that assumption is violated, it is still okay
Web Server Software Architectures
Web Server Software Architectures Author: Daniel A. Menascé Presenter: Noshaba Bakht Web Site performance and scalability 1.workload characteristics. 2.security mechanisms. 3. Web cluster architectures.
Unit 4 The Bernoulli and Binomial Distributions
PubHlth 540 4. Bernoulli and Binomial Page 1 of 19 Unit 4 The Bernoulli and Binomial Distributions Topic 1. Review What is a Discrete Probability Distribution... 2. Statistical Expectation.. 3. The Population
HSR HOCHSCHULE FÜR TECHNIK RA PPERSW I L
1 An Introduction into Modelling and Simulation Prof. Dr.-Ing. Andreas Rinkel af&e andreas.rinkel@hsr.ch Tel.: +41 (0) 55 2224928 Mobil: +41 (0) 79 3320562 Goal After the whole lecture you: will have an
TEACHING SIMULATION WITH SPREADSHEETS
TEACHING SIMULATION WITH SPREADSHEETS Jelena Pecherska and Yuri Merkuryev Deptartment of Modelling and Simulation Riga Technical University 1, Kalku Street, LV-1658 Riga, Latvia E-mail: merkur@itl.rtu.lv,
For a partition B 1,..., B n, where B i B j = for i. A = (A B 1 ) (A B 2 ),..., (A B n ) and thus. P (A) = P (A B i ) = P (A B i )P (B i )
Probability Review 15.075 Cynthia Rudin A probability space, defined by Kolmogorov (1903-1987) consists of: A set of outcomes S, e.g., for the roll of a die, S = {1, 2, 3, 4, 5, 6}, 1 1 2 1 6 for the roll
Statistics 100A Homework 4 Solutions
Chapter 4 Statistics 00A Homework 4 Solutions Ryan Rosario 39. A ball is drawn from an urn containing 3 white and 3 black balls. After the ball is drawn, it is then replaced and another ball is drawn.
**BEGINNING OF EXAMINATION**
Fall 2002 Society of Actuaries **BEGINNING OF EXAMINATION** 1. Given: The survival function s x sbxg = 1, 0 x < 1 x d i { }, where s x = 1 e / 100, 1 x < 45. = s x 0, 4.5 x Calculate µ b4g. (A) 0.45 (B)
Random Variate Generation (Part 3)
Random Variate Generation (Part 3) Dr.Çağatay ÜNDEĞER Öğretim Görevlisi Bilkent Üniversitesi Bilgisayar Mühendisliği Bölümü &... e-mail : cagatay@undeger.com cagatay@cs.bilkent.edu.tr Bilgisayar Mühendisliği
How To Understand And Solve A Linear Programming Problem
At the end of the lesson, you should be able to: Chapter 2: Systems of Linear Equations and Matrices: 2.1: Solutions of Linear Systems by the Echelon Method Define linear systems, unique solution, inconsistent,
Binomial lattice model for stock prices
Copyright c 2007 by Karl Sigman Binomial lattice model for stock prices Here we model the price of a stock in discrete time by a Markov chain of the recursive form S n+ S n Y n+, n 0, where the {Y i }
Basic Multiplexing models. Computer Networks - Vassilis Tsaoussidis
Basic Multiplexing models? Supermarket?? Computer Networks - Vassilis Tsaoussidis Schedule Where does statistical multiplexing differ from TDM and FDM Why are buffers necessary - what is their tradeoff,