On the asymptotic distribution of an estimate of the change point in a failure rate

The failure rate r(t) is assumed to have the shape of the"first"part of the"bathtub"model, i.e.r(t) is non-increasing for t<r and is constant for t> r. Asymptotic distribution of one of the estimates proposed earlier has been investigated in this paper. This leads to a test for the hypothesis HQ r<r ₀ vs H :r>r (where TQ > 0). Asymptotic expression for the power of this test under Pitman alternatives is derived. Some simulations are reported.     

Variable selection in partial linear regression with functional covariate

The problem of variable selection is considered in high-dimensional partial linear regression under some model allowing for possibly functional variable. The procedure studied is that of nonconcave-penalized least squares. It is shown the existence of a √n/s_n-consistent estimator for the vector of p_n linear parameters in the model, even when p_n tends to ∞ as the sample size n increases (s_n denotes the number of influential variables). An oracle property is also obtained for the variable selection method, and the nonparametric rate of convergence is stated for the estimator of the nonlinear functional component of the model. Finally, a simulation study illustrates the finite sample size performance of our procedure.     

Precedence tests and Lehmann alternatives

G = F ^k (k > 1); G = 1 − (1−F) ^k (k < 1); G = F ^k (k < 1); and G = 1 − (1−F) ^k (k > 1), where F and G are two continuous cumulative distribution functions. If an optimal precedence test (one with the maximal power) is determined for one of these four classes, the optimal tests for the other classes of alternatives can be derived. Application of this is given using the results of Lin and Sukhatme (1992) who derived the best precedence test for testing the null hypothesis that the lifetimes of two types of items on test have the same distibution. The test has maximum power for fixed κ in the class of alternatives G = 1 − (1−F) ^k , with k < 1. Best precedence tests for the other three classes of Lehmann-type alternatives are derived using their results. Finally, a comparison of precedence tests with Wilcoxon's two-sample test is presented. Received: February 22, 1999; revised version: June 7, 2000     

Bounds on Bivariate Distribution Functions with Given Margins and Known Values at Several Points

Let H(x, y) be a continuous bivariate distribution function with known marginal distribution functions F(x) and G(y). Suppose the values of H are given at several points, H(x _i , y _i ) = θ _i , i = 1, 2,…, n. We first discuss conditions for the existence of a distribution satisfying these conditions, and present a procedure for checking if such a distribution exists. We then consider finding lower and upper bounds for such distributions. These bounds may be used to establish bounds on the values of Spearman's ρ and Kendall's τ. For n = 2, we present necessary and sufficient conditions for existence of such a distribution function and derive best-possible upper and lower bounds for H(x, y). As shown by a counter-example, these bounds need not be proper distribution functions, and we find conditions for these bounds to be (proper) distribution functions. We also present some results for the general case, where the values of H(x, y) are known at more than two points. In view of the simplification in notation, our results are presented in terms of copulas, but they may easily be expressed in terms of distribution functions.     

ON THE NUMBER OF RECORDS NEAR THE MAXIMUM

Recent work has considered properties of the number of observations X_j, independently drawn from a discrete law, which equal the sample maximum X_(n) The natural analogue for continuous laws is the number K_n(a) of observations in the interval (X_(n)–a, X_(n)], where a > 0. This paper derives general expressions for the law, first moment, and probability generating function of K_n(a), mentioning examples where evaluations can be given. It seeks limit laws for n→ and finds a central limit result when a is fixed and the population law has a finite right extremity. Whenever the population law is attracted to an extremal law, a limit theorem can be found by letting a depend on n in an appropriate manner; thus the limit law is geometric when the extremal law is the Gumbel type. With these results, the paper obtains limit laws for ‘top end’ spacings X_(n) - X_(n-j) with j fixed.     

NESTING OPTIMAL MAIN EFFECTS PLANS AND OPTIMAL FOLDOVER DESIGNS

ABSTRACT

Optimal main effects plans (MEPs) and optimal foldover designs can often be performed as a series of nested optimal designs. Then, if the experiment cannot be completed due to time or budget constraints, the fraction already performed may still be an optimal design. We show that the optimal MEP for 4t factors in 4t + 4 points does not contain the optimal MEP for 4t factors in 4t + 2 points nested within it. In general, the optimal MEP for 4t factors in 4t + 4 points does not contain the optimal MEPs for 4t factors in 4t + 1, 4t + 2, or 4t + 3 points and the optimal MEP for 4t + 1 factors in 4t + 4 points does not contain the optimal MEPs for 4t + 1 factors in 4t + 2 or 4t + 3 points. We also show that the runs in an orthogonal design for 4t factors in 4t + 4 points, and the optimal foldover designs obtained by folding, should be performed in a certain sequence in order to avoid the possibility of a singular X'X matrix.     

Profust reliability of linear and circular type F and G systems having two failure criteria under Markov dependency

In this study, the profust reliabilities of (n, f, k): F(G) and < n, f, k > : F(G) systems for Markov dependent components are investigated. Having two failure criteria are the common features of these four systems. The usage of both fuzzy approach and two failure criteria in the same system provides us more realistic approach to evaluate the reliability of more complex systems. The component configurations are examined for both linear and circular sequences and the working principle of systems are studied for both F and G systems. Under all these assumptions, the profust reliabilities of (n, f, k): F(G) and < n, f, k > : F(G) systems are obtained using the distribution of run statistics. Also a new membership function different from the linear membership function which is generally used in the literature is proposed. Some numerical results which allow the comparison of the systems from various perspectives and various figures for both linear and circular type systems are presented. Some special cases (between Markov – iid assumption, conventional – profust reliability) are also considered.     

On the Mean Remaining Strength of the k-Out-of-n:F System with Exchangeable Components

In this article, we consider the mean remaining strength of a k-out-of-n:F system in the stress–strength setup for the exchangeable components. We provide some results for parallel and series systems under this setup, where X₁, X₂, …, X_n are the strengths of the components designed under the common stress. An illustrative example is given for the k-out-of- n:F system using the multivariate FGM distribution.     

Some Asymptotic Formulas for a Brownian Motion With a Regular Variation From a Parabolic Domain

Consider a Brownian motion with a regular variation starting at an interior point of a domain D in R^{d + 1}, d ? 1 and let τ_D denote the first time the Brownian motion exits from D. Estimates with exact constants for the asymptotics of log?P(τ_D > T) are given for T → ∞, depending on the shape of the domain D and the order of the regular variation. Furthermore, the asymptotically equivalence are obtained. The problem is motivated by the early results of Lifshits and Shi, Li in the first exit time, and Karamata in the regular variation. The methods of proof are based on their results and the calculus of variations.     

Computing exact clustering posteriors with subset convolution

ABSTRACT

An exponential-time exact algorithm is provided for the task of clustering n items of data into k clusters. Instead of seeking one partition, posterior probabilities are computed for summary statistics: the number of clusters and pairwise co-occurrence. The method is based on subset convolution and yields the posterior distribution for the number of clusters in O(n3ⁿ) operations or O(n³2ⁿ) using fast subset convolution. Pairwise co-occurrence probabilities are then obtained in O(n³2ⁿ) operations. This is considerably faster than exhaustive enumeration of all partitions.     

Improved bootstrap confidence intervals in certain toxicological experiments

The bootstrap, the jackknife, and classical methods are compared through their confidence intervals for the proportion of affected fetuses in a common type of animal experiment. Specifically, suppose that for the ith of M pregnant animals, there are x _i affected fetuses out of n _i total in the litter. The conditional distribution of x _i given n _i is sometimes modeled as binomial (n _i p _i ), where p _i is a realization from some unknown continuous density. The p _i are not observable and it is of interest in some toxicological experiments to find confidence intervals for E(p). Theory suggests that the proposed parametric bootstrap should produce higher order agreement between the nominal and actual coverage than that exhibited by the usual nonparametric bootstrap. Some simulation results provide additional evidence of this superiority of the modified parametric bootstrap over the jack-knife and classical approaches. The proposed resampling is flexible enough to handle a more general model allowing correlation between p _i and n _i .     

Inverse prediction for heteroscedastic response using mixed models software

Distributions of a response y (height, for example) differ with values of a factor t (such as age). Given a response y_* for a subject of unknown t_*, the objective of inverse prediction is to infer the value of t_* and to provide a defensible confidence set for it. Training data provide values of y observed on subjects at known values of t. Models relating the mean and variance of y to t can be formulated as mixed (fixed and random) models in terms of sets of functions of t, such as polynomial spline functions. A confidence set on t_* can then be had as those hypothetical values of t for which y_* is not detected as an outlier when compared to the model fit to the training data. With nonconstant variance, the p-values for these tests are approximate. This article describes how versatile models for this problem can be formulated in such a way that the computations can be accomplished with widely available software for mixed models, such as SAS PROC MIXED. Coverage probabilities of confidence sets on t_* are illustrated in an example.     

Optimal component test plans for a parallel system based on Type-II censoring

Consider a parallel system with n independent components. Assume that the lifetime of the jth component follows an exponential distribution with a constant but unknown parameter λ_j, 1≤j≤n. We test r_j components of type-j for failure and compute the total time T_j of r_j failures for the jth component. Based on T=(T₁,T₂,…,T_n) and r=(r₁,r₂,…,r_n), we derive optimal reliability test plans which ensure the usual probability requirements on system reliability. Further, we solve the associated nonlinear integer programming problem by a simple enumeration of integers over the feasible range. An algorithm is developed to obtain integer solutions with minimum cost. Finally, some examples have been discussed for various levels of producer’s and consumer’s risk to illustrate the approach. Our optimal plans lead to considerable savings in costs over the available plans in the literature.     

A semiparametric nonlinear mixed model approach to phase I profile monitoring

When process data follow a particular curve in quality control, profile monitoring is suitable and appropriate for assessing process stability. Previous research in profile monitoring focusing on nonlinear parametric (P) modeling, involving both fixed and random-effects, was made under the assumption of an accurate nonlinear model specification. Lately, nonparametric (NP) methods have been used in the profile monitoring context in the absence of an obvious linear P model. This study introduces a novel technique in profile monitoring for any nonlinear and auto-correlated data. Referred to as the nonlinear mixed robust profile monitoring (NMRPM) method, it proposes a semiparametric (SP) approach that combines nonlinear P and NP profile fits for scenarios in which a nonlinear P model is adequate over part of the data but inadequate of the rest. These three methods (P, NP, and NMRPM) account for the auto-correlation within profiles and treats the collection of profiles as a random sample with a common population. During Phase I analysis, a version of Hotelling’s T² statistic is proposed for each approach to identify abnormal profiles based on the estimated random effects and obtain the corresponding control limits. The performance of the NMRPM method is then evaluated using a real data set. Results reveal that the NMRPM method is robust to model misspecification and performs adequately against a correctly specified nonlinear P model. Control charts with the NMRPM method have excellent capability of detecting changes in Phase I data with control limits that are easily computable.     

Pooling operators with the marginalization property

In this paper, we consider the problem of combining a number of opinions which have been expressed as probability measures P₁, …, P_n, over some space. It is shown that a pooling formula which has the marginalization property of McConway (1981) must be of the form T = Σⁿ_i=₁W_i P_i + (1 - Σⁿ_i =₁W_i)Q, where Q is an arbitrary measure and W₁, …, W_n ϵ [—1,1] are weights such that| Σ_J Σ _j w_j | ≤ 1 for every subset J of {1, …, n}. If, in addition, T is required to preserve the independence of arbitrary events A and B whenever these events are independent under each P_i, then either T = P_i for some 1 ≤ i ≤ n or T = Q, in which case Q takes values in {0, l}.     

ON THE PROBABILITY OF BEING MAXIMAL

Let X₁, X₂, … , X_n be independent and identically distributed random variables with a continuous cumulative distribution function F, which belongs to the max‐domain of attraction of the Frechet or Gumbel extreme value distribution. We define the probability of being maximal, D_n , and approximate it. Several previous papers have considered this problem, but only for special cases. The approximations to D_n are very useful for obtaining demand functions from random utility models in the qualitative response models used in social sciences.     

Maximum Likelihood Estimation for Stochastic Differential Equations with Random Effects

Abstract. We consider N independent stochastic processes (X _i (t), t ∈ [0,T _i ]), i=1,…, N, defined by a stochastic differential equation with drift term depending on a random variable φ _i . The distribution of the random effect φ _i depends on unknown parameters which are to be estimated from the continuous observation of the processes X_i. We give the expression of the exact likelihood. When the drift term depends linearly on the random effect φ _i and φ _i has Gaussian distribution, an explicit formula for the likelihood is obtained. We prove that the maximum likelihood estimator is consistent and asymptotically Gaussian, when T _i =T for all i and N tends to infinity. We discuss the case of discrete observations. Estimators are computed on simulated data for several models and show good performances even when the length time interval of observations is not very large.     

A Restricted Subset Selection Rule for Selecting at Least One of the t Best Normal Populations in Terms of Their Means When Their Common Variance is Known,Case II

Consider k( ? 2) normal populations with unknown means μ₁, …, μ_k, and a common known variance σ². Let μ_[1] ? ??? ? μ_[k] denote the ordered μ_i.The populations associated with the t(1 ? t ? k ? 1) largest means are called the t best populations. Hsu and Panchapakesan (2004) proposed and investigated a procedure R_HPfor selecting a non empty subset of the k populations whose size is at most m(1 ? m ? k ? t) so that at least one of the t best populations is included in the selected subset with a minimum guaranteed probability P* whenever μ_{[k ? t + 1]} ? μ_{[k ? t]} ? δ*, where P*?and?δ* are specified in advance of the experiment. This probability requirement is known as the indifference-zone probability requirement. In the present article, we investigate the same procedure R_HP for the same goal as before but when k ? t < m ? k ? 1 so that at least one of the t best populations is included in the selected subset with a minimum guaranteed probability P* whatever be the configuration of the unknown μ_i. The probability requirement in this latter case is termed the subset selection probability requirement. Santner (1976) proposed and investigated a different procedure (R_S) based on samples of size n from each of the populations, considering both cases, 1 ? m ? k ? t and k ? t < m ? k. The special case of t = 1 was earlier studied by Gupta and Santner (1973) and Hsu and Panchapakesan (2002) for their respective procedures.     

Fitting parametric frailty and mixture models under biased sampling

Biased sampling from an underlying distribution with p.d.f. f(t), t>0, implies that observations follow the weighted distribution with p.d.f. f ^w (t)=w(t)f(t)/E[w(T)] for a known weight function w. In particular, the function w(t)=t ^α has important applications, including length-biased sampling (α=1) and area-biased sampling (α=2). We first consider here the maximum likelihood estimation of the parameters of a distribution f(t) under biased sampling from a censored population in a proportional hazards frailty model where a baseline distribution (e.g. Weibull) is mixed with a continuous frailty distribution (e.g. Gamma). A right-censored observation contributes a term proportional to w(t)S(t) to the likelihood; this is not the same as S ^w (t), so the problem of fitting the model does not simply reduce to fitting the weighted distribution. We present results on the distribution of frailty in the weighted distribution and develop an EM algorithm for estimating the parameters of the model in the important Weibull–Gamma case. We also give results for the case where f(t) is a finite mixture distribution. Results are presented for uncensored data and for Type I right censoring. Simulation results are presented, and the methods are illustrated on a set of lifetime data.     

2<Superscript><Emphasis Type="Italic">m</Emphasis></Superscript>4<Superscript>1</Superscript> designs with minimum aberration or weak minimum aberration

For measuring the goodness of 2 ^m 4¹ designs, Wu and Zhang (1993) proposed the minimum aberration (MA) criterion. MA 2 ^m 4¹ designs have been constructed using the idea of complementary designs when the number of two-level factors, m, exceeds n/2, where n is the total number of runs. In this paper, the structures of MA 2 ^m 4¹ designs are obtained when m>5n/16. Based on these structures, some methods are developed for constructing MA 2 ^m 4¹ designs for 5n/16<m<n/2 as well as for n/2≤m<n. When m≤5n/16, there is no general method for constructing MA 2 ^m 4¹ designs. In this case, we obtain lower bounds for A ₃₀ and A ₃₁, where A ₃₀ and A ₃₁ are the numbers of type 0 and type 1 words with length three respectively. And a method for constructing weak minimum aberration (WMA) 2 ^m 4¹ designs (A ₃₀ and A ₃₁ achieving the lower bounds) is demonstrated. Some MA or WMA 2 ^m 4¹ designs with 32 or 64 runs are tabulated for practical use, which supplement the tables in Wu and Zhang (1993), Zhang and Shao (2001) and Mukerjee and Wu (2001).