Moments for a ratio of correlated gamma variates

This paper considers the finite integral moments for the ratio, R = X/Y, where X and Y re correlated gamma distributed variables. An analytical and numerical comparison is given for two classes of underlying bivariate gamma distributions. It is shown that the two bivariate gamma structures provide indentical experessions for the mth unadjussted moment, E(R^m), if and only if either of the following conditions hold : 1) X and Y are uncorrelated of 2) m=1. A numerical evaluation is performed to determine the extent that the two methods differ whenever the variables are correlated     

Bayesian prediction bounds for the pareto lifetime model

Suppose that the length of time in years for which a business operates until failure has a Pareto distribution. Let x₁ ≤ x₂ x₃ ≤…≤z_k denote the survival lifetimes of the first k of a random sample of n businesses. Bayesian predictions are to be made on the ordered failure times of t h e remaining (n-k) businesses, using the conditional probability density function. Examples are given to illustrate our results.     

On shrinkage m-estimators of location parameters

For a general class of continuous ( and marginally symmetric ) inultivariate distributions, based on suitable M-statistics ( involving bounded but possibly discontinuous score generating functions), shrinkage estimators of location are considered. These estimators are based on the James-Stein type rule and incorporates the idea of preliminary test estimation too. The main emphasis is laid on the study of asymptotic tdistributional ) risk properties of these est-innators, and asymptotic tin-) adraissibility results are also studied under fairly general regularity conditions.     

COMPARATIVE CALIBRATION WITH SUBGROUPS

The main object of this paper is to consider structural comparative calibration models under the assumption that the unknown quantity being measured is not identically distributed for all units. We consider the situation where the mean of the unknown quantity being measured is different within subgroups of the population. Method of moments and maximum likelihood estimators are considered for estimating the parameters in the model. Large sample inference is facilitated by the derivation of the asymptotic variances. An application to a data set which indeed motivated the consideration of such general model and was obtained by measuring the heights of a group of trees with five different instruments is considered.     

OPTIMAL SOFTWARE RELEASE POLICY BASED ON MARKOVIAN PERFECT DEBUGGING MODEL

In this paper we consider a Markovian perfect debugging model for which the software failure is caused by two types of faults, one which is easily detected and the other which is difficult to detect. When a failure occurs, a perfect debugging is immediately performed and consequently one fault is reduced from fault contents. We also treat the debugging time as a variable to develop a new debugging model. Based on the perfect debugging model, we propose an optimal software release policy that satisfies the requirements for both software reliability and expected number of faults which are required to achieve before releasing the software. Several measures, including the distribution of first passage time to the specified number of removed faults, are also obtained using the proposed debugging model.     

GENERALIZED SIGNED-RANK ESTIMATORS FOR AUTOREGRESSION PARAMETERS

ABSTRACT

A new class of weighted signed-rank-based estimates for estimating the parameter vector of an autoregressive time series is considered. The Wilcoxon signed-rank estimate and the GR-estimates of Terpstra et al. (GR-Estimates for an Autoregressive Time Series. Statistics and Probability Letters 2001, 51, 165–172; Generalized Rank Estimates for an Autoregressive Time Series: A U-Statistic Approach. Statistical Inference for Stochastic Processes 2001, 4, 155–179) can be viewed as special cases of the so-called GSR-estimates. Asymptotic linearity properties are derived for the GSR-estimates. Based on these properties, and a symmetry assumption, the GSR-estimates are shown to be asymptotically normal at rate n ^1/2. The theory of U-Statistics along with a characterization of weak dependence that is inherent in stationary AR(p) models are the primary tools used to obtain the results. Tests of hypotheses as well as standard errors for confidence interval procedures can be based on such results. An efficiency study indicates that, for an appropriately chosen set of weights, the GSR-estimate is more efficient than the GR-estimate. Furthermore, the GSR-estimate has an added advantage in that an intercept term can be estimated simultaneously; unlike the GR-estimate. Two examples and a small simulation study are used to illustrate the computational and robust aspects of the GSR-estimates.     

LIMIT THEOREMS FOR ASYMPTOTICALLY MINIMAX ESTIMATION OF A DISTRIBUTION WITH INCREASING FAILURE RATE UNDER A RANDOM MIXED CENSORSHIP/TRUNCATION MODEL

ABSTRACT

The search for optimal non-parametric estimates of the cumulative distribution and hazard functions under order constraints inspired at least two earlier classic papers in mathematical statistics: those of Kiefer and Wolfowitz[1] Kiefer, J. and Wolfowitz, J. 1976. Asymptotically Minimax Estimation of Concave and Convex Distribution Functions. Z. Wahrsch. Verw. Gebiete, 34: 73–85. [Crossref], [Web of Science ®] , [Google Scholar] and Grenander[2] Grenander, U. 1956. On the Theory of Mortality Measurement. Part II. Scand. Aktuarietidskrift J., 39: 125–153.  [Google Scholar] respectively. In both cases, either the greatest convex minorant or the least concave majorant played a fundamental role. Based on Kiefer and Wolfowitz's work, Wang3-4 Wang, J.L. 1986. Asymptotically Minimax Estimators for Distributions with Increasing Failure Rate. Ann. Statist., 14: 1113–1131. Wang, J.L. 1987. Estimators of a Distribution Function with Increasing Failure Rate Average. J. Statist. Plann. Inference, 16: 415–427.   found asymptotically minimax estimates of the distribution function F and its cumulative hazard function Λ in the class of all increasing failure rate (IFR) and all increasing failure rate average (IFRA) distributions. In this paper, we will prove limit theorems which extend Wang's asymptotic results to the mixed censorship/truncation model as well as provide some other relevant results. The methods are illustrated on the Channing House data, originally analysed by Hyde.5-6 Hyde, J. 1977. Testing Survival Under Right Censoring and Left Truncation. Biometrika, 64: 225–230. Hyde, J. 1980. “Survival Analysis with Incomplete Observations”. In Biostatistics Casebook 31–46. New York: Wiley Series in Probability and Mathematical Statistics: Applied Probability and Statistics.       

SOJOURN TIMES IN NON-HOMOGENEOUS QBD PROCESSES WITH PROCESSOR SHARING

We study sojourn times of customers in a processor sharing queue with a service rate that varies over time, depending on the number of customers and on the state of a random environment. An explicit expression is derived for the Laplace–Stieltjes transform of the sojourn time conditional on the state upon arrival and the amount of work brought into the system. Particular attention is paid to the conditional mean sojourn time of a customer as a function of his required amount of work, and we establish the existence of an asymptote as the amount of work tends to infinity. The method of random time change is then extended to include the possibility of a varying service rate. By means of this method, we explain the well-established proportionality between the conditional mean sojourn time and required amount of work in processor sharing queues without random environment. Based on numerical experiments, we propose an approximation for the conditional mean sojourn time. Although first presented for exponentially distributed service requirements, the analysis is shown to extend to phase-type services. The service discipline of discriminatory processor sharing is also shown to fall within the framework.     

First-exit times for compound poisson processes for some types of positive and negative jumps

We consider the one-sided and the two-sided first-exit problem for a compound Poisson process with linear deterministic decrease between positive and negative jumps. This process (X(t)) _t≥0 occurs as the workload process of a single-server queueing system with random workload removal, which we denote by M/G _u /G _d /1, where G _u (G _d ) stands for the distribution of the upward (downward) jumps; other applications are to cash management, dams, and several related fields. Under various conditions on G _u and G _d (assuming e.g. that one of them is hyperexponential, Erlang or Coxian), we derive the joint distribution of τ _y =inf{t≥0|X(t)?(0,y)}, y>0, and X(τ _y ) as well as that of T=inf{t≥0|X(t)≤0} and X(T). We also determine the distribution of sup{X(t)|0≤t≤T}.     

Polynomial Factorization for Servers with Semi-Markovian Workload: Performance and Numerical Aspects of a Verified Solution Technique

Abstract

We investigate polynomial factorization as a classical analysis method for servers with semi-Markov arrival and service processes. The modeling approach is directly applicable to queueing systems and servers in production lines and telecommunication networks, where the flexibility in adaptation to autocorrelated processes is essential.

Although the method offers a compact form of the solution with favourable computation time complexity enabling to consider large state spaces and system equations of high degree, numerical stability is not guaranteed for this approach. Therefore we apply interval arithmetic in order to get verified results for the workload distributions, or otherwise to indicate that the precision of the computation has to be improved. The paper gives an overview of numerical and performance aspects of factorization in comparison to alternative methods.