| Interim Scientific Report, Grant AFOSR-81-0122, 1 June 1983 - 31 May 1984, |
20 JUL 1984 |
|
| Authors:
R. E. Barlow; CALIFORNIA UNIV BERKELEY OPERATIONS RESEARCH CENTER
|
 | The report summarizes research during this period supported by the grant. Topics covered include system reliability, determining sample size for life test experiments, data extractions procedures, and acceptance sampline procedures. Abstracts of papers written during this period are included. (Author) |
|
| Some Results on the Overall Reliability of Undirected Graphs. |
FEB 1981 |
|
| Authors:
A. Satyanarayana; Mark K. Chang; Zohel S. Khalil; CALIFORNIA UNIV BERKELEY OPERATIONS RESEARCH CENTER
|
| A probabilistic graph consists of vertices and links that fail with some known probabilities. For such a graph, overall reliability is the probability that there exists communication between all vertex-pairs. In this paper, some useful results are presented to simplify the overall reliability computation of an undirected graph when the failure events of the links are statistically independent. (Author) |
|
| Scoring Rules and the Inevitability of Probability. |
JAN 1981 |
27 pages |
| Authors:
Dennis V. Lindley; CALIFORNIA UNIV BERKELEY OPERATIONS RESEARCH CENTER
|
 | Let a person express his uncertainty about an event E, conditional upon an event F, by a number x and let him be given, as a result, a score which depends on x and the truth or falsity of E when F is true. It is shown that if the scores are additive for different events and if the person chooses admissible values only, then there exists a known transform ... |
|
| Conditionally Increasing Processes. |
NOV 1980 |
|
| Authors:
Zvi Schechner; CALIFORNIA UNIV BERKELEY OPERATIONS RESEARCH CENTER
|
| The conditional distribution of X(t) given sup X(u) < a where u varies from 0 to t of certain processes is studied. We use it to prove the IFR property of k-out-of-n systems and certain shock models and other processes. (Author) |
|
| On the Consecutive k-of-n System. |
NOV 1980 |
|
| Authors:
Cyrus Derman; Gerald J. Lieberman; Sheldon M. Ross; CALIFORNIA UNIV BERKELEY OPERATIONS RESEARCH CENTER
|
| We consider the consecutive k-of-n system in which there are n components linearly ordered. Each component either functions or fails and the system is said to be failed if any k consecutive components are failed. Let r(p) = r(p(1), ..., p(n)) denote the probability that the system does not fail given that the components are independent, component i functions with probability p(i), i = 1, ..., n. The function r(p) ... |
|
| A Functional Inequality, with Applications to Production Theory. |
OCT 1980 |
|
| Authors:
King-Tim Mak; CALIFORNIA UNIV BERKELEY OPERATIONS RESEARCH CENTER
|
| A functional inequality is used in the formulation of a regularity condition on the scaling of production. This functional inequality is characterized and then applied to: deduce a law of diminishing return; and derive a bound on the growth of an open economy. (Author) |
|
| Substitutes and Complements in Network Flow Problems. |
OCT 1980 |
|
| Authors:
David Gale; Themistocles Politof; CALIFORNIA UNIV BERKELEY OPERATIONS RESEARCH CENTER
|
| If f is a function of several variables, one calls a pair of variables substitutes (complements) if the change of the value of the function when both variables are increased is at most (at least) equal to the sum of the changes when each is increased separately. We here consider the case where f is the value of a maximum weight circulation on a network and the variables are the ... |
|
| Approaches to Inverse Linear Regression. Revision. |
OCT 1980 |
|
| Authors:
R. Avenhaus; E. Hoepfinger; W. S. Jewell; CALIFORNIA UNIV BERKELEY OPERATIONS RESEARCH CENTER
|
| Many measurement problems can be formulated as follows: First, a certain linear relationship between two variables is to be estimated by using pairs of input and output data; thereafter, the value of an unknown input variable is to be estimated given an observation of the corresponding output variable. This problem is often referred to as inverse regression or discrimination. In this paper first non-Bayesian approaches to the problem, thereafter the ... |
|
| Load Sharing Models and Their Life Distributions. |
SEP 1980 |
|
| Authors:
Zvi Schechner; CALIFORNIA UNIV BERKELEY OPERATIONS RESEARCH CENTER
|
| An N-component parallel system is subjected to a known load program. As time passes, components fail in a random manner which depends on their individual load histories. At any time t, the surviving components share the total load according to some rule. The system's lifetime distribution is studied under various breakdown rules. Under the linear breakdown rule it is shown that if the load program is increasing the system lifetime ... |
|
| Life Distribution Models and Incomplete Data. |
SEP 1980 |
|
| Authors:
Richard E. Barlow; Frank Proschan; CALIFORNIA UNIV BERKELEY OPERATIONS RESEARCH CENTER
|
| This report represents the second chapter of a book in preparation on inference and data analysis in reliability and life testing. The point of view adopted differs from that of most books on the subject in the following basic respect: Prior information available to the reliability analyst is utilized fully in a formal statistical fashion. Experience accumulated in helping engineers, quality assurance managers, scientists, biostatisticians, and others who must make ... |
|
| Availability of Series Systems with Components Subject to Various Shut-Off Rules. |
JUN 1980 |
|
| Authors:
Zohel S. Khalil; CALIFORNIA UNIV BERKELEY OPERATIONS RESEARCH CENTER
|
| In this report we consider different shut-off rules for series systems performance. We calculate limiting system availability under various shut-off rules. In particular, availability results for 2 and 3 unit systems with all failure and repair distributions exponential are extended to systems of arbitrary size. Consider a series of system of n components. System failure in such systems coincides with component failure. However, in many systems components can still be ... |
|
Reports by Corporate Author
