3 Pages

hwk3

Course: MA 623, Fall 2009
School: Stevens
Rating:
 
 
 
 
 

Word Count: 695

Document Preview

3 Ma623 Homework Stochastic Processes due Tuesday March 24 2009 For this assignment please do the following problems from the pages 229237 (ch 5) of your textbook: page 229 ex. 6, page 230 ex. 8 (alternating renewal process), page 230 ex. 2, page 232 ex. 12. In addition do the following exercises: (1) Consider a single-server bank (a bank with only one oce) in which potential customers arrive at a Poisson rate ....

Register Now

Unformatted Document Excerpt

Coursehero >> New Jersey >> Stevens >> MA 623

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
3 Ma623 Homework Stochastic Processes due Tuesday March 24 2009 For this assignment please do the following problems from the pages 229237 (ch 5) of your textbook: page 229 ex. 6, page 230 ex. 8 (alternating renewal process), page 230 ex. 2, page 232 ex. 12. In addition do the following exercises: (1) Consider a single-server bank (a bank with only one oce) in which potential customers arrive at a Poisson rate . However, an arrival only enters the bank if the server is free when he or she arrives. Let G denote the service distribution. (a) At what rate do customers enter the bank? (b) What fraction of potential customers enter the bank? (c) What fraction of the time is the server busy? Simulation part Now let us try and use simulation to solve this problem. Assume that = 2 customers per minute, and that G = U nif orm[0, 1]. Use software to generate the Poisson process of the arrivals and the times of the service (the blackout periods). Now calculate the new arrival process. (d) Using the elementary renewal theorem you were able to calculate in part (a) the average rate of the new process when t is large. Now use simulation to do the same thing. Use t = 10, 000 minutes and as many repetitions as you think necessary. (e) Again using the simulation answer parts (b) and (c). Use the same value for t as above. (f) Calculate using the theory the answers for the particular case considered in the simulation for your specic values of and G. Then record and give the order of dierence between the theoretical values and the simulation. 1 (2) Trucks arrive at a UPS station according to a renewal process with U (0, 1) (in hours) interarrival times. All packages waiting at that station are instantly loaded as soon as a truck arrives. Packages arrive at the UPS station according to a Poisson process with rate 4/hour. Calculate: t lim P{NO packages at the station at time t} (3) A fair six sided die has sides: 10, 15, 25, 40, 45, 75. Let Sn be the sum of the rst n rolls and N (t) the number of times the die was rolled before reaching the total t. (a) Calculate: P(Sn = 2, 678, 495 for some n) (b) The 95th percentile of N (2, 678, 495) (4) A critical component of the next space shuttle to Europa (the Jupiter satellite) has an operating lifetime that is exponentially distributed with mean 1 year (ship time). As soon as a component fails it is replaced by a new one having statistically identical properties. It is known that the one-way travel to Europa lasts exactly 2 years. What is the smallest number of components that the shuttle should stock if it wishes that probability of having an inoperable unit caused by failures exceeding the spare inventory throughout the time of the voyage to be less than 0.02? (5) A certain type network switch has two states: 0=OFF and 1=OPERATIONAL. In state 0 there is no data owing through the switch. The component remains in state 0 a random amount of time that is exponentially distributed with rate and then moves to state 1. The time in state 1 is exponentially distributed with rate , after which the switch returns to state 0. The causes of the existence of state 0 may be malevolent hackers, mechanical, and electrical failure etc. One of the CS internet connections (call it CSIC) has two of these switches (denoted A and B), connected in parallel. That means that in order for the CSIC to function at least one of the switches A or B must be operating. The two switches have the following parameters: 2 Switch A B Operating failure rate A = 0.01 B = 0.002 Repair rate A = 0.1 B = 0.01 Assume that the two switches operate independently of each other. (a) In the long run what fraction of time is the internet connection (CSIC) down? (b) Once the CSIC is down what is the mean duration time prior to returning to operation? (c) Dene a cycle as the time between the instant that the CSIC enters the down state and the next such instant. Find the mean duration of such a cycle. (d) What is the mean duration between failures? Please note that replacing simulation results for theoretical answers is possible. It will earn you credit but only partial credit. 3
Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

Stevens - MA - 623
Math 623 Stochastic ProcessesJanuary 20, 2009Instructor: Ionut Florescu Office: Kidde 227 Email: ifloresc@stevens.edu Phone: (201) 216-5452 Office hours: M 4:00pm -6:00pm and by appt. Course webpage: http:/www.math.stevens.edu/ifloresc/Teaching/20
Stevens - MA - 222
MA222. Schedule for the Spring 2008 semester.Lecture Jan 14 week 1 Jan 21 week 1.5 Jan 28 week 2.5 Feb 4 week 3.5 Feb 11 week 4.5 Feb 18 week 5 Feb 25 week 6 Mar 3 week 7 Mar 10 week 8 Mar 17 week Mar 24 week 9 Mar 31 week
Stevens - CS - 535
CS 535: Posisition analysis, hedgingG. KamberovStevens Institute of Technology Summary: We will discuss how to create and hedge different positions. We will discuss delta, gamma, and vega hedging.Position types: neutral, bearish, bullishPosition
Stevens - CS - 639
Well, Papa can you multiply triplets?http:/www-groups.dcs.st-and.ac.uk/~history/Mathematicians/Hamilton.htmlAnd here there dawned on me the notion that we must admit, in some sense, a fourth dimension of space for the purpose of calculating with
Stevens - ME - 345
Professor Frank Fisher Introduction to Computer Aided Engineering: SolidWorks and COSMOSXPRESS "Plate with a hole problem" Tutorial written by Jerry Dutreuil Last updated: August 22, 2007 Software versions used in the tutorial : - SolidWorks 2006 SP4
Stevens - ME - 345
NCSU ASME Technical Sessions Spring 2001, Fall 2001, Spring 2002 Simulink: a Graphical Tool for Dynamic System SimulationG. D. Buckner Department of Mechanical and Aerospace Engineering North Carolina State UniversitySimulink Tutorial G.D. Buckner
LSU - B - 32751
Staff Report No. 2007-01January 2007LOUISIANA RICE SHARE RENT EVALUATION MODELMichael E. Salassi1 Department of Agricultural Economics and AgribusinessThe Louisiana Rice Share Rent Evaluation Model was developed to assist rice producers in the
Minnesota - ME - 3331
A First Course in Thermodynamics 2006 F. A. Kulacki Description of chemically reacting systems Reaction chemistryStoichiometryA First Course in Thermodynamics 2006 F. A. Kulackideniifed smetsys gniitcaer yllllaciimehC den fed smetsys gn tca
Minnesota - MATH - 1271
Minnesota - MATH - 4606
Pittsburgh - IS - 2820
Agenda Trust negotiation frameworksIntroduction TrustBuilder Trust-X Laboratory assignment #2IPSec review IPSec connections and configuration requirements Assignment descriptionTrust Negotiation FrameworksIntroductionTrust Establis
Pittsburgh - IS - 2150
IS 2150 / TEL 2810 Introduction to SecurityJames Joshi Associate Professor SIS Professor,Lecture 1 August 26, 20081ContactInstructor: James B. D. Joshi706A, IS Building Phone: 412 624 9982 412-624-9982 E-mail: jjoshi@mail.sis.pitt.edu Web: h
Maryland - MATH - 406
Math 406 Section 0101 Exam 2 Solutions 1. If x is the number of beetles then we must have x 1 mod 10 x 6 mod 7 x 2 mod 3We then have M1 = 21, M2 = 30, M3 = 70 and M = 210. We solve 30y2 1 mod 7 to get y2 4 mod 7. We solve 21y1 1 mod 10 to get
Stevens - CS - 510
q xx x Y~r Y~x&1 q rYr Y~sYr Yr Yrr r%k} qr~}ro r r r r r qr u y u u r ~Y &xI&xIC&~Y ~ & C zu z y}v { y wvu t r sc~7(@&k7xs&Y&x1x%{~x|Ezxsq p xp o1akisp $d p lnml
Pittsburgh - IS - 2610
INFSCI 2610 Data Structures Homework 3 Due: Tuesday, Feb 17, 20041. For the following tree write the output of Inorder, Preorder and Postorder traversal [15]ABECDFIGH2. Read the recursive and non-recursive versions of the Preord
Pittsburgh - IS - 0020
INFSCI 0020 Program Design and Software ToolsHomework 2Due: Friday, Monday, May 28, 2004 1. Selection Sort (Read Exercise 4.31) Write two functions IterSort and RecSort that implement the selection sort algorithm described in 4.31. Function IterSor
Pittsburgh - IS - 0020
INFSCI 0020 Program Design and Software ToolsHomework 2Due: Before Midnight, Jan 28, 2005 1. Palindromes (Exercise 4.32) [Points: 30] Write a recursive function testPalindrome that returns true if the string stored in the array is a palindrome, and
Pittsburgh - IS - 0020
1IS 0020Program Design and Software ToolsIntroductiontoC+ProgrammingLecture2 FunctionsandArrays Jan13,2004 2003 Prentice Hall, Inc. All rights reserved.2ProgramComponentsinC+ Modules: functions and classes Programs use new and prepackage
Pittsburgh - CS - 2710
CS 2710 Foundations of AI Lecture 17Inference in Bayesian belief networksMilos Hauskrecht milos@cs.pitt.edu 5329 Sennott SquareCS 2710 Foundations of AIModeling uncertainty with probabilities Knowledge based system era (70s early 80s) Exten
Pittsburgh - CS - 441
Discrete Structures for Computer ScienceCS 0441 Fall 2004Lecture meeting time: MWF (2 2:50pm) Classroom: M.W.F. (129-VICTO Victoria Building) Recitations: W. (3 3:50pm) in 111-VICTO. F.(3 3:50pm) in 116-VICTO. Instructor: Office: Office Hours
Pittsburgh - CS - 449
CS449 - Introduction to Systems Software Fall 2006 LAB Assignment IIIExercise I: What happens when you try to compile and run the following program? #include <stdio.h> int soccer(int, int); int main() { int x = 3, y = 4; int s = soccer(x, y); print
Pittsburgh - IS - 2420
FEATURES AND UNIFICATION S -> NP VP Only if number of NP & VP are equal FEATURE STRUCTURESFEATURE1 VALUE1 FEATURE2 VALUE2 . . . FEATUREn VALUEnCAT NUMBER PERSONNP SG 3CAT AGREEMENTNP NUMBER PERSON SG 3reentrant featuresCAT HEADS AGREEM
LSU - NR - 51775
THE NEWSLETTER OF THE ST. TAMMANY MASTER GARDENERS ASSOCIATIONTHE GARDENGOERVolume 11, Issue 6 June 2008Hi Everyone, The fast paced season is upon us. The weeds grow overnight and I sit at the table staring at my first big almost ripe tomato. I
Minnesota - STAT - 3411
Section 5.3Probability PlotsProbability plots are used to Decide if data potentially follow some distribution Approximate parameter values can be estimated from the slope and x intercept o These can even be used if some of the data have not yet
Minnesota - PSY - 1001
Special Code 0 22 504 514 777 808 910 1123 1127 1202 1216 1218 1236 1236 1313 1337 1789 1829 1833 2108 2121 2305 2486 2667 2929 3055 3311 3411 3440 3698 3838 4022 4489 4759 4986 5257 5382 5430 5450 5492 5527 5952 6002 6102 6665 6761 7024 7273 7282 75
Pittsburgh - ENGR - 2696
BioE 2696/ECE 2695 Control Theory in Neuroscience Solution to HW 2Problem 1 Solution: (a)(b)k 2 = 30 / 29, k3 = 89 /145 f (t ) = - 30 30 -2t 89 -2t + e cos(5t ) + e sin(5t ). 29 29 145Problem 2 Solution: (a)(b)1Problem 3 Solution:Prob
CSB-SJU - ECONOMICS - 333
Department of Economics College of Saint Benedict | Saint John's UniversitySpring Semester 2009 Louis JohnstonEconomics 333 Assignment #4 Due Date: Thursday, January 22This assignment is focuses on how economists measure real GDP across countrie
CSB-SJU - ECONOMICS - 111
Department of Economics College of Saint Benedict | Saint John's UniversitySpring Semester 2009 Louis JohnstonEconomics 111 Assignment #11 Due Date: Wednesday, February 18This assignment will help you understand the basic supply and demand model
CSB-SJU - ECONOMICS - 111
Department of Economics College of Saint Benedict | Saint John's UniversitySpring Semester 2009 Louis JohnstonEconomics 111 Assignment #13 Due Date: Wednesday, March 11This assignment will help you understand how economists measure profit and ho
CSB-SJU - ECONOMICS - 111
Department of Economics College of Saint Benedict | Saint John's UniversitySpring Semester 2009 Louis JohnstonEconomics 111 Assignment #8 Due Date: Friday, February 6This assignment extends our discussion of economic growth and introduces you to
CSB-SJU - ECONOMICS - 364
Department of Economics College of Saint Benedict | Saint John's UniversityFall Semester 2008 Louis JohnstonEconomics 364 Assignment #11 Due Date: Thursday, October 231. 2. 3. 4. Read pp. 141-150 of Auerbach and Kotlikoff and review your class n
CSB-SJU - ECONOMICS - 364
Department of Economics College of Saint Benedict | Saint John's UniversityFall Semester 2008 Louis JohnstonEconomics 364 Assignment #10 Due Date: Wednesday, October 151. 2. 3. 4. Read Chapter 4 of Auerbach and Kotlikoff. Pay particular attentio
CSB-SJU - ECONOMICS - 333
Department of Economics College of Saint Benedict | Saint John's UniversitySpring Semester 2009 Louis JohnstonEconomics 333 Assignment #9 Due Date: Friday, February 131. Review sections 6.1 and 6.2 in Jones and your class notes from Wednesday, F
Pittsburgh - ENGR - 2696
BioE 2696/ECE 2695 Control Theory in Neuroscience Solution to HW 1 Problem 1 Solution: TProblem 2 Solution: (a) X[0] = 96, X[31] = 96, X[k] = 0 for 0<k<31. (b) X[0] = 6, X[k] = 0 for 0<k<6.Problem 3 Solution:1Problem 4 Solution:23
Minnesota - ECON - 3101
Homework Assignment 3 Econ 3101, Section 004 Due October 11, in class The maximum score is 100. SCORE =SU M OF P OINT S 129 100.1. (30) Solve, using Lagrangians where applicable, the following problems for income and substitution eects. Depict t
Pittsburgh - SIS - 1792
The Networked Semantic Desktop, Stefan Decker DERI, NUIG, Ireland stefan@deri.ie , AbstractWe present our vision of a new group collaboration infrastructure, the Networked Semantic Desktop, drawing from co-evolving research in the Semantic Web, Pee
Pittsburgh - EXP - 1792
The Networked Semantic Desktop, Stefan Decker DERI, NUIG, Ireland stefan@deri.ie , AbstractWe present our vision of a new group collaboration infrastructure, the Networked Semantic Desktop, drawing from co-evolving research in the Semantic Web, Pee
Pittsburgh - CS - 110
Introduction to UnixBasic commands, email and text editingCopyright: CS110-Novacky-Khalifa, University of Pittsburgh1How to connect to unix? Start the Telnet or SSH Client programs. Enter unixs or unixs.cis.pitt.edu for the Host, then click
Pittsburgh - IS - 2150
IS2150/TEL2810 IntroductiontoSecurityJamesJoshi AssistantProfessor,SISLecture11 Nov15,2007NetworkSecurity, Authentication, Identity 1ObjectivesUnderstand/explaintheissuesrelated to,andutilizethetechniquesSecurityatdifferentlevelsofOSImo
CSB-SJU - CS - 130
Input Textboxes Input BoxesDifferent than textboxesX = Inputbox("prompt message", "title message")Good for small amount of input (form full of textboxes is not nice) The input is assigned to variable X when the use hits OKA = Input
CSB-SJU - CS - 130
Loops Counting down from N to 1 in assembly we used JUMP statements to repeat previous instructions thus loopingREAD LOOP: WRITE SUB decrement JPOS LOOP HALT decrement :1Do Loops Stopping/looping condition but not sure how many iterations goo
CSB-SJU - CS - 130
MatchandStopSearchIf Array(POS) = SearchValue Then WillfindFIRSTmatch UseBooleanvariabletodenotewhetheramatchhasbeenfoundornotMatchandStopSearchReadanarrayof75runnernamesandarrayof 75runnertimesfromafileandsearchfora specificnameinputth
CSB-SJU - CS - 130
MultipleFormsWevebeendesigningprojectswithsingleforms Veryeasytoaddnewformstoyourprojectifneeded Aformtoloaddatafromafileintoanarray Aformtosearchforentriesinthearray AformtosortthearrayanddisplayitsortedDifferentbackgroundsanddesigns Ho
CSB-SJU - CS - 130
CSCI 130 VISUAL BASIC PROJECT REQUIREMENTS.You are to design and complete a Visual Basic programming project of your choice either individually or in pairs. The project should not be trivially small and should include some computational significance
CSB-SJU - CSCI - 230
Unified Modeling LanguageChapter 2 (JIA)EBook StoreAllows customers to search and shop for books, music CDs, and computer software thru the Web Provides information about the titles it carries to help customers make purchases Other functional
CSB-SJU - CSCI - 310
The Pep/8 virtual machine-CSCI310Log on to your Science>Pep8 Linux account go to Applications>CSBSJU>ComputerUnfortunately, the authors of the Pep/8 do not seem to have written a users' manual. Perhaps they thought it would be self-explanatory? Th
CSB-SJU - CSCI - 230
CSCI-230 Exam I Guideline: Dr. Imad Rahal Intro Difference between program and software Challenges in software engineering Desirable software qualities Software development process & Software engineering models: Waterfall vs. Iterative Software Dev
CSB-SJU - CSCI - 230
Use Cases & Use Case DiagramsUniversity SystemStudents, faculty and admins Students: Login and get grades Faculty: Login, view student roster, & enter grades for a student roster Admins: Login and verify gradesUniversity SystemUse Cas
CSB-SJU - CSCI - 230
IntroductiontoCSCI230: SoftwareDevelopmentChapter1(JIA)IntroductionPurchasing/developingsoftwarehasbecome thelargestsingleexpenditureforcompaniesWhybother?Thecostofmaintainingandupgrading occupiesthelargestportionofthiscost Softwarecos
CSB-SJU - CSCI - 230
UnifiedModelingLanguageChapter2(JIA)Aggregation&Composition Specialformofassociationthatrepresentshasaor partofrelationships Usedtodistinguishthewholefromthepart Composition(partscantexistontheirown)isa strongerformofaggregation(partscanexist
CSB-SJU - CSCI - 230
LinuxChapters 1 & 2 (ALBING)LinuxProvides an incredible array of tools Unix separated OS commands from OS itself "Kernel" of necessary functionality Rest are executable programs hosted outside the OS which could be changed by users with
CSB-SJU - CSCI - 310
CSCI-310 Assignment II1. Solve problem 3.20 page 138.(a) 0 1110 0110 NZVC=0000 (b) 0 0001 1010 NZVC=0001 (c) 0 0110 1111 NZVC=0011 (d) 1 0101 1011 NZVC=1001 (e) 1 0000 0110 NZVC=1010 (f ) 1 1100 1110 NZVC=10002. Solve problem 3.21 (part e only) p
CSB-SJU - CSCI - 310
CSCI-310 Assignment IIISolve the following problems:1. Solve problem 4.2 (all parts) page 183. 2. Solve problem 4.6 (all parts) page 184. 3. Determine the output of EACH of the following Pep/8 machine language programs. The left column in each part
CSB-SJU - CS - 150
Lab 1: Using LinuxObjectives _ __to become familiar with the Mandrake/KDE environment. to learn how to create and traverse directory structures. to use a text editor to create files.A. Using the DesktopThe screen setup you have on the Linu
Pittsburgh - MATH - 0280
Math 0280 Introduction to Matrices and Linear AlgebraExploration Assignment #1 (Linear Systems)Acknowledgment The MATLAB assignments for Math 0280 were developed by Jonathan Rubin with the help of Matthew Badger SCHEDULE: The first exploration ass
Pittsburgh - IS - 0020
INFSCI 0020 Program Design and Software Tools Homework 5 Due July 12 Total points: 200Part 1This assignment involves Using the code from the book and making some modifications and/or additions. Using a very useful Standard Library Class VectorE
Pittsburgh - MATH - 0230
gf b f v b g r v b 4x b e x gq c 00b ` q c 00b ` q c 00b ` Y a0E X Y UX p Y ( Xe&I$dI)0) ! E & E 1 #F4s x d c 20b f g Y f Fv b DX f g b DX Y b e f v f v b e r sf b d f e b 45f x e b g r v b 4x x h f v y5wh r f e h f h
Minnesota - CHEM - 3502
Chem 3502/4502Physical Chemistry II (Quantum Mechanics) Fall Semester 2006 Christopher J. Cramer Lecture 5, January 27, 20063 CreditsSolved Homework (Homework for grading is also due today) We are told that the probability of a random variable
Adams State - CHEM - 131
General Chemistry Lab Review for Lab Exam One Spring 2009 This lab exam will take place in the laboratory and will consist of both a written and a practical portion. During the lab exam, you may use your calculator and your lab notebook. You will
LSU - PHYS - 2101
Week 11: OscillationsPhys 2101 Fall 2005 Luis LehnerSome Fluid problemsA spherical helium-filled balloon has radius R=12m. Its mass is m=196kg. What maximum load M can the balloon support while it floats at an altitude at which the helium has den
Minnesota - CSCI - 5103
Lecture Notes 13 File SystemsAnand TripathiCSci 5103Long-term Information Storage1. Must store large amounts of data 2. Information stored must survive the termination of the process using it 3. Multiple processes must be able to access the info