The robustness of the systemwise breusch-godfrey autocorrelation test for non-normal distributed error terms

Using Monte Carlo methods, the properties of systemwise generalisations of the Breusch-Godfrey test for autocorrelated errors are studied in situations when the error terms follow either normal or non-normal distributions, and when these errors follow either AR(1) or MA(1) processes. Edgerton and Shukur (1999) studied the properties of the test using normally distributed error terms and when these errors follow an AR(1) process. When the errors follow a non-normal distribution, the performances of the tests deteriorate especially when the tails are very heavy. The performances of the tests become better (as in the case when the errors are generated by the normal distribution) when the errors are less heavy tailed.     

Transient Analysis of Large Markov Models with Absorbing States Using Regenerative Randomization

ABSTRACT

In this article, we develop a new method, called regenerative randomization, for the transient analysis of continuous time Markov models with absorbing states. The method has the same good properties as standard randomization: numerical stability, well-controlled computation error, and ability to specify the computation error in advance. The method has a benign behavior for large t and is significantly less costly than standard randomization for large enough models and large enough t. For a class of models, class C, including typical failure/repair reliability models with exponential failure and repair time distributions and repair in every state with failed components, stronger theoretical results are available assessing the efficiency of the method in terms of “visible” model characteristics. A large example belonging to that class is used to illustrate the performance of the method and to show that it can indeed be much faster than standard randomization.     

Reliability estimation based on ranked set sampling

In this paper we consider the problem of estimating the reliability of an exponential component based on a Ranked Set Sample (RSS) of size n. Given the first r observations of that sample, 1≤r≤n, we construct an unbiased estimator for this reliability and we show that these n unbiased estimators are the only ones in a certain class of estimators. The variances of some of these estimators are compared. By viewing the observations of the RSS of size n as the lifetimes of n independent k-out-of-n systems, 1≤k≤n, we are able to utilize known properties of these systems in conjunction with the powerful tools of majorization and Schur functions to derive our results.     

Are the Order Statistics Ordered? A Survey of Recent Results

The distributions of coherent systems with components with exchangeable lifetimes can be represented as mixtures of distributions of order statistics (k-out-of-n systems) from possibly dependent samples by using the concept of the signature of Samaniego (1985 Samaniego , F. ( 1985 ). On closure of the IFR class under formation of coherent systems . IEEE Trans. Reliabil. R-34 : 69 – 72 .[Crossref], [Web of Science ®] , [Google Scholar]). This representation, together with Rychlik's (1993 Rychlik , T. ( 1993 ). Bounds for expectation of L-estimates for dependent samples . Statistics 24 : 1 – 7 .[Taylor & Francis Online] , [Google Scholar]) results, can be used to obtain sharp bounds on the distribution (or the reliability) function and on the expected lifetime of the system. Also, this representation can be used to determine the asymptotic behavior of the hazard rate of the system when the order statistics are ordered in the hazard rate order. Moreover, the lifetime distributions of coherent systems (and in particular, of order statistics) can also be represented as generalized mixtures (that is, mixtures with some negative weights) of distributions of series system lifetimes by using the concept of the minimal signature defined by Navarro et al. (2007a Navarro , J. , Ruiz , J. M. , Sandoval , C. J. ( 2007a ). Properties of coherent systems with dependent components . Commun. Statist. Theory Methods 36 : 175 – 191 .[Taylor & Francis Online], [Web of Science ®] , [Google Scholar]). This representation can also be used to determine the final behavior of the hazard rate of the system through the behavior of the hazard rate of the series systems. In particular, it can be used to show that the order statistics are, under some conditions, asymptotically hazard rate ordered. However, in general, this result is not true, that is, the order statistics need not be hazard rate ordered.     

Bathtub distributions: a review

Bathtub distributions are characterized by bathtub failure rate functions . These are possibly more realisitic models than the monotone failure rate models . A systematic account of such distributions is not available and this review aims to give such an account . We give some easily verifiable conditions to check the bathtub property of a distribution along with methods to construct such distributions . We also discuss some stochastic and reliablity mechanisms which lead to bathtub distributions. These include mixtures ( stochastic failure rate models ) , series system , stochastic differential equation models and so on. We also review inference on bathtub distributions. The paper concludes with a rather exhaustive list of bathtub distributions.     

RELIABILITY PROPERTIES OF SERIES AND PARALLEL SYSTEMS FROM BIVARIATE EXPONENTIAL MODELS

ABSTRACT

In this paper we study the classification of the generalized mixtures of two or three exponential distributions, in the ILR and DLR classes, and consequently in the IFR and DFR classes. We apply these results to classify the aging of the series and parallel systems, in accord with some common bivariate exponential models of their components.     

Workload Process,Waiting Times,and Sojourn Times in a Discrete Time MMAP[K]/SM[K]/1/FCFS Queue

Abstract

In this paper, we study the total workload process and waiting times in a queueing system with multiple types of customers and a first-come-first-served service discipline. An M/G/1 type Markov chain, which is closely related to the total workload in the queueing system, is constructed. A method is developed for computing the steady state distribution of that Markov chain. Using that steady state distribution, the distributions of total workload, batch waiting times, and waiting times of individual types of customers are obtained. Compared to the GI/M/1 and QBD approaches for waiting times and sojourn times in discrete time queues, the dimension of the matrix blocks involved in the M/G/1 approach can be significantly smaller.     

The True Cost-of-Living Index With Changing Preferences

This article investigates the theoretical and empirical properties of a true cost-of-living index under conditions of changing preferences. A family of true indexes is defined based on the notion of the current utility function. A particular index, based on the previous period's utility level, is then defined. Given this definition, a true cost-of-living index is computed based on a quadratic expenditure system estimated with quarterly data from 1960–1981. For empirical purposes, changes in preferences are represented by the linear habit formation hypothesis. This index is then compared with Paasche and Laspeyres indexes. The true cost-of-living index grows somewhat faster than either the Paasche or Laspeyres index. It also displays considerably more variability.     

Applications of schur theory to reliability inference for k of n systems

The results of Hoeffding (1956), Pledger and Proschan (1971), Gleser (1975) and Boland and Proschan (1983) are used to obtain Buehler (1957) 1-α lower confidence limits for the reliability of k of n systems of independent components when the subsystem data have equal sample sizes and the observed failures satisfy certain conditions. To the best of our knowledge, for k ≠ 1 or n, this is the first time the exact optimal lower confidence limits for system reliability have been given. The observed failure vectors are a generalization of key test results for k of n systems, k ≠ n (Soms (1984) and Winterbottom (1974)). Two examples applying the above theory are also given.