Homework Answers
Add Answer to:
5 Multiplication Rule Consider a parallel system, that is, a system of n machines in which...
10. A manager is responsible for n machines. In any given period, the probability that exactly...
10. A manager is responsible for n machines. In any given period, the probability that exactly k machines will break down is Tk> 0 (πΟΤ π1+π2+ π,-1), where k is any whole number between 0 and n: k=0, 1, 2, , n. The Tk are "true" probabilities but are known only to the manager. The manager must report these probabilities to the control authority. In the absence of any re ward or penalty, he might report some wrong probabilities Po,...
10. A manager is responsible for n machines. In any given period, the probability that exactly...
10. A manager is responsible for n machines. In any given period, the probability that exactly k machines will break down is Tk> 0 (πΟΤ π1+π2+ π,-1), where k is any whole number between 0 and n: k=0, 1, 2, , n. The Tk are "true" probabilities but are known only to the manager. The manager must report these probabilities to the control authority. In the absence of any re ward or penalty, he might report some wrong probabilities Po,...
Problem 5. Indicator variables S points possible (graded) Consider a sequence of n 1 independent tosses...
Problem 5. Indicator variables S points possible (graded) Consider a sequence of n 1 independent tosses of a biased coin, at times k = 0,1,2,...,n On each toss, the probability of Heads is p, and the probability of Tails is 1 -p {1,2,.., at time for E resulted in Tails and the toss at time - 1 resulted in A reward of one unit is given if the toss at time Heads. Otherwise, no reward is given at time Let...
The Acme Machine Shop has five machines that periodically break down and require service. The average...
The Acme Machine Shop has five machines that periodically break down and require service. The average time between breakdowns for any one machine is 4 days, distributed according to an exponential distribution. The average time to repair a machine is 1 day, distributed according to an exponential distribution. One mechanic repairs the machines in the order in which they break down. Use q.xls. a. Determine the probability that the mechanic is idle. (Hint: Pn is given in q.xls, and is...
Q5. Consider a Markov chain {Xn|n ≥ 0} with state space S = {0, 1, ·...
Q5. Consider a Markov chain {Xn|n ≥ 0} with state space S = {0, 1, · · · } and transition matrix (pij ). Find (in terms QA for appropriate A) P{ max 0≤k≤n Xk ≤ m|X0 = i} . Q6. (Flexible Manufacturing System). Consider a machine which can produce three types of parts. Let Xn denote the state of the machine in the nth time period [n, n + 1) which takes values in {0, 1, 2, 3}. Here...
4. Reliability of Systems - Take n components to have failure times Ti, T2, ..., Tn...
4. Reliability of Systems - Take n components to have failure times Ti, T2, ..., Tn If we construct a complex system out of these distribution of the failure time T of the entire svstem in terms of the distributions of Ti, T2, ..., Tn. There are two basic networks. In a series hookup, the system fails as soon as any one of the components fails. Hence T - min(T1, T2, ...,Tn). In a parallel hookup the system is operational...
Problem 6. Consider the n independent trails in Problem 5. Let On be the probability that...
Problem 6. Consider the n independent trails in Problem 5. Let On be the probability that there is no three consecutive successes in n trails. (1). Show that limn+cQn = 0 (2). Show that Qn = (1 - pQn-1 + p(1 - pQn-2 + p (1 - p)Qn-3 for n 3 (Hint: condition on the first failure). Problem 5. Suppose we do n independent trails that each has a probability P E (0,1) to result in success. Let Pn be...
(1 point) Consider a system with one component that is subject to failure, and suppose that...
(1 point) Consider a system with one component that is subject to failure, and suppose that we have 100 copies of the component. Suppose further that the lifespan of each copy is an independent exponential random variable with mean 25 days, and that we replace the component with a new copy immediately when it fails (a) Approximate the probability that the system is still working after 3125 days. Probability (b) Now, suppose that the time to replace the component is...
5. A field is a set F containing 0 and 1 that is an abelian group under addition, and (upon removing 0) Common examp...
5. A field is a set F containing 0 and 1 that is an abelian group under addition, and (upon removing 0) Common examples of fields are abelian group under multiplication, for which the distributative law holds. an Q, R, and C. There is a unique finite field Fg of order q= p for every prime p and positive integer k. For all other q E N, there is no finite field of order g. For each of the fields...
1. (3 marks) An airline reservation system has a single computer, which breaks down on any given ...
1. (3 marks) An airline reservation system has a single computer, which breaks down on any given day with probability p. It takes 2 days to restore a failed computer to normal service Form a Markov chain by taking as states the pairs (x, y), where x is the number of machines in operation condition at the end of a day and y ls 1 if a day's labor has been expended on a machine, and 0 otherwise. a) (1...
10. A manager is responsible for n machines. In any given period, the probability that exactly k machines will break down is Tk> 0 (πΟΤ π1+π2+ π,-1), where k is any whole number between 0 and n: k=0, 1, 2, , n. The Tk are "true" probabilities but are known only to the manager. The manager must report these probabilities to the control authority. In the absence of any re ward or penalty, he might report some wrong probabilities Po,...
10. A manager is responsible for n machines. In any given period, the probability that exactly k machines will break down is Tk> 0 (πΟΤ π1+π2+ π,-1), where k is any whole number between 0 and n: k=0, 1, 2, , n. The Tk are "true" probabilities but are known only to the manager. The manager must report these probabilities to the control authority. In the absence of any re ward or penalty, he might report some wrong probabilities Po,...
Problem 5. Indicator variables S points possible (graded) Consider a sequence of n 1 independent tosses of a biased coin, at times k = 0,1,2,...,n On each toss, the probability of Heads is p, and the probability of Tails is 1 -p {1,2,.., at time for E resulted in Tails and the toss at time - 1 resulted in A reward of one unit is given if the toss at time Heads. Otherwise, no reward is given at time Let...
4. Reliability of Systems - Take n components to have failure times Ti, T2, ..., Tn If we construct a complex system out of these distribution of the failure time T of the entire svstem in terms of the distributions of Ti, T2, ..., Tn. There are two basic networks. In a series hookup, the system fails as soon as any one of the components fails. Hence T - min(T1, T2, ...,Tn). In a parallel hookup the system is operational...
Problem 6. Consider the n independent trails in Problem 5. Let On be the probability that there is no three consecutive successes in n trails. (1). Show that limn+cQn = 0 (2). Show that Qn = (1 - pQn-1 + p(1 - pQn-2 + p (1 - p)Qn-3 for n 3 (Hint: condition on the first failure). Problem 5. Suppose we do n independent trails that each has a probability P E (0,1) to result in success. Let Pn be...
(1 point) Consider a system with one component that is subject to failure, and suppose that we have 100 copies of the component. Suppose further that the lifespan of each copy is an independent exponential random variable with mean 25 days, and that we replace the component with a new copy immediately when it fails (a) Approximate the probability that the system is still working after 3125 days. Probability (b) Now, suppose that the time to replace the component is...
5. A field is a set F containing 0 and 1 that is an abelian group under addition, and (upon removing 0) Common examples of fields are abelian group under multiplication, for which the distributative law holds. an Q, R, and C. There is a unique finite field Fg of order q= p for every prime p and positive integer k. For all other q E N, there is no finite field of order g. For each of the fields...
1. (3 marks) An airline reservation system has a single computer, which breaks down on any given day with probability p. It takes 2 days to restore a failed computer to normal service Form a Markov chain by taking as states the pairs (x, y), where x is the number of machines in operation condition at the end of a day and y ls 1 if a day's labor has been expended on a machine, and 0 otherwise. a) (1...
Most questions answered within 3 hours.
-
Where is the error in this code sequence?
String s1 = "Hello";
String s2 = "ello";...
asked 10 months ago -
Financial data for Joel de Paris, Inc., for last year
follow:
Joel de Paris, Inc.
Balance...
asked 10 months ago -
Consider this reaction:
Al2(SO4)3 (aq)+ BaCl3
(aq) Al2Cl6 (aq)- +
3BaSO4(s) . What is the...
asked 10 months ago -
Suppose that Savneet is considering increasing her
recent random sample from 20 car rentals to 40...
asked 10 months ago -
Trucks arrive at an unloading terminal at an average rate of 120
per hour.
Trucks arrive...
asked 10 months ago -
Why are methanol and ethanol completely soluble in water while
octanol is not very little soluble....
asked 10 months ago -
A facilities manager at a university reads in a research report
that the mean amount of...
asked 10 months ago -
When the CuSO4 is rehydrated by adding water to the anhydrous
compound, is this an endothermic...
asked 10 months ago -
A ray of sunlight is passing from diamond into crown glass; the
angle of incidence is...
asked 10 months ago -
A block of mass 0.249 kg is placed on top of a light, vertical
spring of...
asked 10 months ago -
how do the kidneys compensate in the presences of acidosis
a) trigger hyperventilate
b) reserve acid...
asked 10 months ago -
Question 501 pts
The rental rate of capital to the firm increases. Which of the
following...
asked 10 months ago