Orthogonally blocked mixture component–amount designs via projections of F-squares

Orthogonal block designs for Scheffé’s quadratic model have been considered previously by Draper et al. (1993), John (1984), Lewis et al. (1994) and Prescott, Draper, Dean, and Lewis (1993). Prescott and Draper (2004) obtained mixture component–amount designs via projections of standard mixture designs, viz., the simplex-lattice, the simplex-centroid and the orthogonally blocked mixture designs based on latin squares. Aggarwal, Singh, Sarin, and Husain (2009) considered the case of components assuming equal volume fractions and obtained mixture designs in orthogonal blocks using F-squares. In this paper, we construct orthogonal blocks of two and three mixture component–amount blends by projecting the class of four component mixture designs presented by Aggarwal et al. (2009).     

Multi - sample test of equal gamma distribution scale parameters in presence of unknown common shape parameter

Shiue and Bain proposed an approximate F statistic for testing equality of two gamma distribution scale parameters in presence of a common and unknown shape parameter. By generalizing Shiue and Bain's statistic we develop a new statistic for testing equality of L >= 2 gamma distribution scale parameters. We derive the distribution of the new statistic ESP for L = 2 and equal sample size situation. For other situations distribution of ESP is not known and test based on the ESP statistic has to be performed by using simulated critical values. We also derive a C(α) statistic CML and develop a likelihood ratio statistic, LR, two modified likelihood ratio statistics M and MLB and a quadratic statistic Q. The distribution of each of the statistics CML, LR, M, MLB and Q is asymptotically chi-square with L - 1 degrees of freedom. We then conducted a monte-carlo simulation study to compare the perfor- mance of the statistics ESP, LR, M, MLB, CML and Q in terms of size and power. The statistics LR, M, MLB and Q are in general liberal and do not show power advantage over other statistics. The statistic CML, based on its asymptotic chi-square distribution, in general, holds nominal level well. It is most powerful or nearly most powerful in most situations and is simple to use. Hence, we recommend the statistic CML for use in general. For better power the statistic ESP, based on its empirical distribution, is recommended for the special situation for which there is evidence in the data that λ₁ < … < λ_L and n₁ < … < n_L, where λ₁ …, λ_L are the scale parameters and n₁,…, n_L are the sample sizes.     

Mixture designs for five components in orthogonal blocks

The methods developed by John and Draper et al. of partitioning the blends (runs) of four mixture components into two or more orthogonal blocks when fitting quadratic models are extended to mixtures of five components. The characteristics of Latin squares of side five are used to derive rules for reliably and quickly obtaining designs with specific properties. The designs also produce orthogonal blocks when higher order models are fitted.     

Some series of proper generalized neighbor designs

Neighbor balanced designs are used to remove the neighbor effects but most of these designs require a large number of blocks. To neutralize the neighbor effects in such situations, GN₂-designs are most desirable. This article deals with the (i) refinement of some series of GN₂-designs constructed by Zafaryab et al. (2010) and (ii) construction of some new series of GN₂-designs in circular blocks of equal size.     

Weighted L1-estimates for the First-order Bifurcating Autoregressive Model

We developed robust estimators that minimize a weighted L₁ norm for the first-order bifurcating autoregressive model. When all of the weights are fixed, our estimate is an L₁ estimate that is robust against outlying points in the response space and more efficient than the least squares estimate for heavy-tailed error distributions. When the weights are random and depend on the points in the factor space, the weighted L₁ estimate is robust against outlying points in the factor space. Simulated and artificial examples are presented. The behavior of the proposed estimate is modeled through a Monte Carlo study.     

Note on Draper and Lin's article “capacity considerations for two-level fractional factorial designs”

In Table 4 of Draper and Lin (1990) the authors present eleven 2^{k − p}_R designs for which doubt is expressed as to whether they are saturated. This note removes doubt on nine of these designs indicating that they are indeed saturated. Some observations are made in terms of the resolution of a design for the remaining two designs among the 11. The conclusions are derived by properly interpreting an updated table of binary linear codes of Verhoeff (1987).     

Order statistics from trivariate normal and -distributions in terms of generalized skew-normal and skew- distributions

We consider here a generalization of the skew-normal distribution, GSN(λ₁,λ₂,ρ), defined through a standard bivariate normal distribution with correlation ρ, which is a special case of the unified multivariate skew-normal distribution studied recently by Arellano-Valle and Azzalini [2006. On the unification of families of skew-normal distributions. Scand. J. Statist. 33, 561–574]. We then present some simple and useful properties of this distribution and also derive its moment generating function in an explicit form. Next, we show that distributions of order statistics from the trivariate normal distribution are mixtures of these generalized skew-normal distributions; thence, using the established properties of the generalized skew-normal distribution, we derive the moment generating functions of order statistics, and also present expressions for means and variances of these order statistics.Next, we introduce a generalized skew-t_ν distribution, which is a special case of the unified multivariate skew-elliptical distribution presented by Arellano-Valle and Azzalini [2006. On the unification of families of skew-normal distributions. Scand. J. Statist. 33, 561–574] and is in fact a three-parameter generalization of Azzalini and Capitanio's [2003. Distributions generated by perturbation of symmetry with emphasis on a multivariate skew t distribution. J. Roy. Statist. Soc. Ser. B 65, 367–389] univariate skew-t_ν form. We then use the relationship between the generalized skew-normal and skew-t_ν distributions to discuss some properties of generalized skew-t_ν as well as distributions of order statistics from bivariate and trivariate t_ν distributions. We show that these distributions of order statistics are indeed mixtures of generalized skew-t_ν distributions, and then use this property to derive explicit expressions for means and variances of these order statistics.     

Least-squares estimation of distribution functions in johnson's translation system

To summarize a set of data by a distribution function in Johnson's translation system, we use a least-squares approach to parameter estimation wherein we seek to minimize the distance between the vector of "uniformized" oeder statistics and the corresponding vector of expected values. We use the software package FITTRI to apply this technique to three problems arising respectively in medicine, applied statistics, and civil engineering. Compared to traditional methods of distribution fitting based on moment matching, percentile matchingL ₁ estimation, and L _? estimation, the least-squares technique is seen to yield fits of similar accuracy and to converge more rapidly and reliably to a set of acceptable parametre estimates.     

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.     

Goodness of fit tests for the multiple logistic regression model

Several test statistics are proposed for the purpose of assessing the goodness of fit of the multiple logistic regression model. The test statistics are obtained by applying a chi-square test for a contingency table in which the expected frequencies are determined using two different grouping strategies and two different sets of distributional assumptions. The null distributions of these statistics are examined by applying the theory for chi-square tests of Moore Spruill (1975) and through computer simulations. All statistics are shown to have a chi-square distribution or a distribution which can be well approximated by a chi-square. The degrees of freedom are shown to depend on the particular statistic and the distributional assumptions.

The power of each of the proposed statistics is examined for the normal, linear, and exponential alternative models using computer simulations.     

Minimum and Maximum Information Censoring Plans in Progressive Censoring

Expressions for the entropy, the Kullback-Leibler information, and the I _α-information are established for distributions of progressively Type-II censored order statistics. These results are used to identify minimum and maximum information censoring plans. In particular, we find minimum and maximum entropy plans for DFR, exponential, Pareto, reflected power, and Weibull distributions. The results for Kullback-Leibler and I _α-information hold for any continuous distribution.     

A program to calculate bootstrap confidence intervals for the process capability index Cpk

Franklin and Wasserman (1991) introduced the use of Bootstrap sampling procedures for deriving nonparametric confidence intervals for the process capability index, C_pk, which are applicable for instances when at least twenty data points are available. This represents a significant reduction in the usually recommended sample requirement of 100 observations (see Gunther 1989). To facilitate and encourage the use of these procedures. a FORTRAN program is provided for computation of confidence intervals for C_pk. Three methods are provided for this calculation including the standard method, the percentile confidence interval, and the biased - corrected percentile confidence interval.     

On the Markov property of order statistics

The order statistics from a sample of size n≥3 from a discrete distribution form a Markov chain if and only if the parent distribution is supported by one or two points. More generally, a necessary and sufficient condition for the order statistics to form a Markov chain for (n≥3) is that there does not exist any atom x₀ of the parent distribution F satisfying F(x₀-)>0 and F(x₀)<1. To derive this result a formula for the joint distribution of order statistics is proved, which is of an interest on its own. Many exponential characterizations implicitly assume the Markov property. The corresponding putative geometric characterizations cannot then be reasonably expected to obtain. Some illustrative geometric characterizations are discussed.     

Conditions for D A -Maximin Marginal Designs for Generalized Linear Mixed Models to be Uniform

Optimal design theory deals with the assessment of the optimal joint distribution of all independent variables prior to data collection. In many practical situations, however, covariates are involved for which the distribution is not previously determined. The optimal design problem may then be reformulated in terms of finding the optimal marginal distribution for a specific set of variables. In general, the optimal solution may depend on the unknown (conditional) distribution of the covariates. This article discusses the D _A -maximin procedure to account for the uncertain distribution of the covariates. Sufficient conditions will be given under which the uniform design of a subset of independent discrete variables is D _A -maximin. The sufficient conditions are formulated for Generalized Linear Mixed Models with an arbitrary number of quantitative and qualitative independent variables and random effects.     

Eine bemerkung zur stetigkeit zufälliger felder

In the paper a sequence of bounded regions containing n independent identically and uniformly on D_n distributed points is considered. It is assumed that the d–dimensional volume v(D_n) is asymptotically proportional to n. Under these conditions it is shown that the number of pairs of points within a distance r>0 of each other is asymptotically normally distributed. For proving this among other things a lemma of BOLTHAUSEN is used, whereas even strong estimates for U–statistics are insufficient. The obtained result is applied for testing the hypothesis of randomness     

On uniformly distributed random points in an n-Ball

Consider a set of r+1 independently and identically and uniformly distributed random points X₀, X₁,…,X_r in RⁿThese points determine almost surely via their convex hull a unique r-simplex in R^e This article deals with the exact density of the r-content of this random r-simplex when the points are such that p of them are in the interior and r+l?p of them are on the surface of a unit n-ball. This problem is transformed into a distribution problem connected with multivariate test statistics. Various possible representations of the exact density in the general case, are also pointed out.     

Some results on bootstrap prediction intervals

We investigate the construction of a BC_a-type bootstrap procedure for setting approximate prediction intervals for an efficient estimator θ_m of a scalar parameter θ, based on a future sample of size m. The results are also extended to nonparametric situations, which can be used to form bootstrap prediction intervals for a large class of statistics. These intervals are transformation-respecting and range-preserving. The asymptotic performance of our procedure is assessed by allowing both the past and future sample sizes to tend to infinity. The resulting intervals are then shown to be second-order correct and second-order accurate. These second-order properties are established in terms of min(m, n), and not the past sample size n alone.     

SOME LAW OF THE ITERATED LOGARITHM TYPE RESULTS FOR THE EMPIRICAL PROCESS

We consider Z^±_n= sup_{0< t ≤ 1/2}2 U^±_n (t)/(t(1- t))^1/2, where + and -denote the positive and negative parts respectively of the sample paths of the empirical process U_n. U^±_n and U_n are seen to behave rather differently, which is tied to the asymmetry of the binomial distribution, or to the asymmetry of the distribution of small order statistics. Csáki (1975) showed that log Z^±_n/log₂n is the appropriate normalization for a law of the iterated logarithm (LIL) for Z^±_n we show that Z^-_n/(2 log₂n)^1/2 is the appropriate normalization for Z^-_n. Csörgö & Révész (1975) posed the question: if we replace the sup over (0,1/2) above, by -the sup over [a_n, 1-a_n] where a_n→0, how fast can a_n→0 and still have |Z_n|/(2 log₂n)^1/2 maintain a finite lim sup a.s.? This question is answered herein. The techniques developed are then used in Section 4 to give an interesting new proof of the upper class half of a result of Chung (1949) for |U_n(t)|. The proofs draw heavily on James (1975); two basic inequalities of that paper are strengthened to their potential, and are felt to be of independent interest.     

Estimation of the derivative of a density and related functions

Let Y₁,…,Y _n, (Y₁ <Y₂<…<Y _n) be the order statistics of a random sample from a distribution F with density f on the realline. This paper gives a class of estimators of the derivativef'(x) of the density f at points x for which f has

a continuoussecond derivative. These estimators are based on spacings inthe order statistics Y_j+kn -y _j j = 1,…,n-k_n,k_n<n.     

Output-sensitive algorithms for Tukey depth and related problems

The Tukey depth (Proceedings of the International Congress of Mathematicians, vol. 2, pp. 523–531, 1975) of a point p with respect to a finite set S of points is the minimum number of elements of S contained in any closed halfspace that contains p. Algorithms for computing the Tukey depth of a point in various dimensions are considered. The running times of these algorithms depend on the value of the output, making them suited to situations, such as outlier removal, where the value of the output is typically small. This research was partly funded by the NSERC Canada.