A robust process capability index

The existing process capability indices (PCI's) assume that the distribution of the process being investigated is normal. For non-normal distributions, PCI's become unreliable in that PCI's may indicate the process is capable when in fact it is not. In this paper, we propose a new index which can be applied to any distribution. The proposed indexC_f:, is directly related to the probability of non-conformance of the process. For a given random sample, the estimation of C_f boils down to estimating non-parametrically the tail probabilities of an unknown distribution. The approach discussed in this paper is based on the works by Pickands (1975) and Smith (1987). We also discuss the construction of bootstrap confidence intervals of C_f: based on the so-called accelerated bias correction method (BC _a:). Several simulations are carried out to demonstrate the flexibility and applicability of C_f:. Two real life data sets are analyzed using the proposed index.     

Small sample properties of parameter estimation in the dirichlet distribution

A numerically feasible algorithm is proposed for maximum likelihood estimation of the parameters of the Dirichlet distribution. The performance of the proposed method is compared with the method of moments using bias ratio and squared errors by Monte Carlo simulation. For these criteria, it is found that even in small samples maximum likelihood estimation has advantages over the method of moments.     

Random sampling from the watson distribution

An envelope-rejection method is used to generate random variates from the Watson distribution. The method is compact and is competitive with, if not superior to, the existing sampling algorithms. For the girdle form of the Watson distribution, a faster algorithm is proposed. As a result, Johnson's sampling algorithm for the Bingham distribution is improved.     

Tables to Facilitate Fitting Tadikamalla and Johnson's LB Distributions

This paper is concerned with estimating the parameters of Tadikamalla-Johnson's L_B distribution using the first four moments. Tables of the parameters of the L_B distribution are given for selected values of skewness (0.0(0.05) 1.0(0.1)2.0) and corresponding available values of kurtosis at intervals of 0.2. The construction and use of these tables is explained with a numerical example.     

Combining Univariate Tests for Multivariate Location Problem

In this article, three methods of combining dependent univariate tests are studied. The Bahadur approximate efficiencies are derived under the asymptotic normal assumption. These procedures are applied to the multivariate location problem and compared with two Hotelling-type tests. A Monte Carlo study indicates that in certain cases the powers of the combination methods are much better than Hotelling's T ² and other multivariate nonparametric tests.     

A Bivariate Distribution for the Reliability Analysis of Failure Data in Presence of a Forewarning or Primer Event

This article presents a bivariate distribution for analyzing the failure data of mechanical and electrical components in presence of a forewarning or primer event whose occurrence denotes the inception of the failure mechanism that will cause the component failure after an additional random time. The characteristics of the proposed distribution are discussed and several point estimators of parameters are illustrated and compared, in case of complete sampling, via a large Monte Carlo simulation study. Confidence intervals based on asymptotic results are derived, as well as procedures are given for testing the independence between the occurrence time of the forewarning event and the additional time to failure. Numerical applications based on failure data of cable insulation specimens and of two-component parallel systems are illustrated.     

On the Alias Method for Generating Random Variables from a Discrete Distribution

The alias method of Walker is a clever, new, fast method for generating random variables from an arbitrary, specified discrete distribution. A simple probabilistic proof is given, in terms of mixtures, that the method works for any discrete distribution with a finite number of outcomes. A more efficient version of the table-generating portion of the method is described. Finally, a brief discussion on efficiency of the method is given. We believe that the generality, speed, and simplicity of the method make it attractive for use in generating discrete random variables.     

A Spectral Method for a Nonpreemptive Priority BMAP/G/1 QUEUE

Abstract

In this paper we consider a nonpreemptive priority queue with two priority classes of customers. Customers arrive according to a batch Markovian arrival process (BMAP). In order to calculate the boundary vectors we propose a spectral method based on zeros of the determinant of a matrix function and the corresponding eigenvectors. It is proved that there are M zeros in a set Ω, where M is the size of the state space of the underlying Markov process. The zeros are calculated by the Durand-Kerner method, and the stationary joint probability of the numbers of customers of classes 1 and 2 at departures is derived by the inversion of the two-dimensional Fourier transform. For a numerical example, the stationary probability is calculated.     

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.