Some mixed orthogonal arrays obtained by orthogonal projection matrices

The method of orthogonal decomposition of projection matrices is used to construct mixed orthogonal arrays of strength two. Several series of tight orthogonal arrays are constructed by using difference schemes. This method is also used to obtain some new 72-run, 100-run, and 108-run orthogonal arrays.     

Invariance of generalized wordlength patterns

The generalized wordlength pattern (GWLP) introduced by Xu and Wu [2001. Generalized minimum aberration for asymmetrical fractional factorial designs. Ann. Statist. 29, 1066–1077] for an arbitrary fractional factorial design allows one to extend the use of the minimum aberration criterion to such designs. Ai and Zhang [2004. Projection justification of generalized minimum aberration for asymmetrical fractional factorial designs. Metrika 60, 279–285] defined the J$J$-characteristics of a design and showed that they uniquely determine the design. While both the GWLP and the J$J$-characteristics require indexing the levels of each factor by a cyclic group, we see that the definitions carry over with appropriate changes if instead one uses an arbitrary abelian group. This means that the original definitions rest on an arbitrary choice of group structure. We show that the GWLP of a design is independent of this choice, but that the J$J$-characteristics are not. We briefly discuss some implications of these results.     

A general family of univariate stochastic orders

In this paper we introduce and study a family of univariate stochastic orders parameterized by a function h  . The usual stochastic order _?st${?}_{\mathrm{st}}$, and the total time on test transform order _?ttt${?}_{\mathrm{ttt}}$, are special cases of this new family. We study some properties of the new family, and we give some applications of it in actuarial science, reliability theory, and statistics.     

Run orders for efficient two level experimental plans with minimum factor level changes robust to time trends

In this paper we construct run orders of orthogonal arrays with 12≤n≤28$12\le n\le 28$ runs and 4≤q≤6$4\le q\le 6$ factors that minimize the number of level changes of each factor. The corresponding orthogonal arrays can estimate a model with all main effects and their two factor interactions with the highest efficiency and also provide estimates of all main effects that are independent of linear and quadratic time (or position) trends. Some alternative efficient run orders are also presented when the estimation of two factor interactions is of experimental interest.     

A survey and evaluation of methods for determination of combinatorial equivalence of factorial designs

Equivalent factorial designs have identical statistical properties for estimation of factorial contrasts and for model fitting. Non-equivalent designs, however, may have the same statistical properties under one particular model but different properties under a different model. In this paper, we describe known methods for the determination of equivalence or non-equivalence of two-level factorial designs, whether they be regular factorial designs, non-regular orthogonal arrays, or have no particular structure. In addition, we evaluate a number of potential fast screening methods for detecting non-equivalence of designs. Although the paper concentrates mainly on symmetric designs with factors at two levels, we also evaluate methods of determining combinatorial equivalence and non-equivalence of three-level designs and indicate extensions to larger numbers of levels and to asymmetric designs.     

The use of an identity in Anderson for multivariate multiple testing

Consider the model where there are I$I$ independent multivariate normal treatment populations with p×1$p\times 1$ mean vectors _μi${\mathit{\mu }}_i$, i=1,…,I$i=1,\dots ,I$, and covariance matrix Σ$\Sigma$. Independently the (I+1)$(I+1)$st population corresponds to a control and it too is multivariate normal with mean vector _μI+1${\mathit{\mu }}_{I+1}$ and covariance matrix Σ$\Sigma$. Now consider the following two multiple testing problems.     

Confounded row–column designs

Confounded row–column designs for factorial experiments are considered and a simple method of construction using the classical method of confounding is described. Partially confounded designs are also studied and a method for generating Rao's (1946) designs is presented.     

A construction for generalized hadamard matrices

We prove that if p^r and p^r ? 1 are both prime powers then there is a generalized Hadamard matrix of order p^r(p^r ? 1) with elements from the elementary abelian group Z_p x?x Z_p. This result was motivated by results of Rajkundia on BIBD's. This result is then used to produce p^r ? 1 mutually orthogonal F-squares F(p^r(p^r ? 1); p^r ? 1).     

On equality of ordinary least squares estimator,best linear unbiased estimator and best linear unbiased predictor in the general linear model

The equality of ordinary least squares estimator (OLSE), best linear unbiased estimator (BLUE) and best linear unbiased predictor (BLUP) in the general linear model with new observations is investigated through matrix rank method, some new necessary and sufficient conditions are given.     

Ordered ranked set samples and applications to inference

Ranked set sampling (RSS) was first proposed by McIntyre [1952. A method for unbiased selective sampling, using ranked sets. Australian J. Agricultural Res. 3, 385–390] as an effective way to estimate the unknown population mean. Chuiv and Sinha [1998. On some aspects of ranked set sampling in parametric estimation. In: Balakrishnan, N., Rao, C.R. (Eds.), Handbook of Statistics, vol. 17. Elsevier, Amsterdam, pp. 337–377] and Chen et al. [2004. Ranked Set Sampling—Theory and Application. Lecture Notes in Statistics, vol. 176. Springer, New York] have provided excellent surveys of RSS and various inferential results based on RSS. In this paper, we use the idea of order statistics from independent and non-identically distributed (INID) random variables to propose ordered ranked set sampling (ORSS) and then develop optimal linear inference based on ORSS. We determine the best linear unbiased estimators based on ORSS (BLUE-ORSS) and show that they are more efficient than BLUE-RSS for the two-parameter exponential, normal and logistic distributions. Although this is not the case for the one-parameter exponential distribution, the relative efficiency of the BLUE-ORSS (to BLUE-RSS) is very close to 1. Furthermore, we compare both BLUE-ORSS and BLUE-RSS with the BLUE based on order statistics from a simple random sample (BLUE-OS). We show that BLUE-ORSS is uniformly better than BLUE-OS, while BLUE-RSS is not as efficient as BLUE-OS for small sample sizes (n<5$n<5$).     

A construction for generalized hadamard matrices GH(4q, EA(q))

We give a construction for a generalized Hadamard matrix GH(4q, EA(q)) as a 4 × 4 matrix of q × q blocks, for q an odd prime power other than 3 or 5. Each block is a GH(q, EA(q)) and certain combinations of 4 blocks form GH(2q, EA(q)) matrices. Hence a GH(4q, EA(q)) matrix exists for every prime power q.     

A note on replacement policy comparisons from NBUC lifetime of the unit

Age and block replacement policies are commonly used in order to reduce the number of in-service failures when the systems are functioning indefinitely. In reliability theory, the lifetime of a system can be modeled by means of the NBUC aging class that is characterized throughout comparisons of the residual lives in the sense of the icx order. The purpose of this paper is to establish stochastic comparisons between the age (block) replacement policy and a renewal process with no planned replacements when the lifetime of the unit is NBUC. Supported by Ministerio de Ciencia y Tecnología under grant BFM2000-0362     

Extremal limit theorems for observations separated by random power law waiting times

This paper develops extreme value theory for random observations separated by random waiting times whose exceedence probability falls off like a power law. In the case where the waiting times between observations have an infinite mean, a limit theorem is established, where the limit is comprised of an extremal process whose time index is randomized according to the non-Markovian hitting time process for a stable subordinator. The resulting limit distributions are shown to be solutions of fractional differential equations, where the order of the fractional time derivative coincides with the power law index of the waiting time. The probability that the limit process remains below a threshold is also computed. For waiting times with finite mean but infinite variance, a two-scale argument yields a fundamentally different limit process. The resulting limit is an extremal process whose time index is randomized according to the first passage time of a positively skewed stable Lévy motion with positive drift. This two-scale limit provides a second-order correction to the usual limit behavior.     

Stochastic comparisons of multivariate frailty models

A multivariate frailty model in which survival function depends on baseline distributions of components and the frailty random variable is considered. Since misspecification in choice of frailty distribution and/or baseline distribution may affect the distribution of multivariate frailty model, using theory of stochastic orders, we compare multivariate frailty models arising from different choices of frailty distribution.     

Universal admissibility in second order asymptotics

Some sufficient conditions for an estimator to be universally second order admissible are derived. Those sufficient conditions consist of the elementary integrals with respect to the Fisher information and the limits of some functions characterized by the dealt statistical model, and thus can be checked with comparative ease. In location model and scale model, the sufficient condition for the linear estimator with respect to the maximum likelihood estimator (MLE) to be universally second order admissible is given. Furthermore, a guide for classifying any estimator into either the universal admissibility or the non-universal admissibility is proposed.     

D–optimality of a class of saturated main–effect plans and allied results

This paper applies the theory of unimodular matrices to prove that all saturated main effect plans of an s₁ × s₂ factorial are equivalent from the point of view of D–optimality and are hence all D–optimal. The A– and E–optimal plans in this context have also been derived. An application in sequential experimentation has been considered     

Long run variance estimation and robust regression testing using sharp origin kernels with no truncation

A new family of kernels is suggested for use in long run variance (LRV) estimation and robust regression testing. The kernels are constructed by taking powers of the Bartlett kernel and are intended to be used with no truncation (or bandwidth) parameter. As the power parameter (ρ)$(\rho )$ increases, the kernels become very sharp at the origin and increasingly downweight values away from the origin, thereby achieving effects similar to a bandwidth parameter. Sharp origin kernels can be used in regression testing in much the same way as conventional kernels with no truncation, as suggested in the work of Kiefer and Vogelsang [2002a, Heteroskedasticity-autocorrelation robust testing using bandwidth equal to sample size. Econometric Theory 18, 1350–1366, 2002b, Heteroskedasticity-autocorrelation robust standard errors using the Bartlett kernel without truncation, Econometrica 70, 2093–2095] Analysis and simulations indicate that sharp origin kernels lead to tests with improved size properties relative to conventional tests and better power properties than other tests using Bartlett and other conventional kernels without truncation.     

Waiting time distributions for a run with additional constraints

This paper proposes a method for obtaining the exact probability of occurrence of the first success run of specified length with the additional constraint that at every trial until the occurrence of the first success run the number of successes up to the trial exceeds that of failures. For the sake of the additional constraint, the problem cannot be solved by the usual method of conditional probability generating functions. An idea of a kind of truncation is introduced and studied in order to solve the problem. Concrete methods for obtaining the probability in the cases of Bernoulli trials and time-homogeneous {0,1}$\{0,1\}$-valued Markov dependent trials are given. As an application of the results, a modification of the start-up demonstration test is studied. Numerical examples which illustrate the feasibility of the results are also given.