THE USE OF A CLASS OF FOLDOVER DESIGNS AS SEARCH DESIGNS

It is shown that members of a class of two-level nonorthogonal resolution IV designs with n factors are strongly resolvable search designs when k, the maximum number of two-factor interactions thought possible, equals one; weakly resolvable when k = 2 except when the number of factors is 6; and may not be weakly resolvable when k≥ 3.     

SOME SERIES OF EFFICIENCY BALANCED DESIGNS

Two series of efficiency balanced designs with v*+ 1 treatments have been constructed using balanced incomplete block designs having v* treatments.     

A Method for Analyzing Supersaturated Designs

ABSTRACT

Analyzing supersaturated designs is challenging because the number of experiments is less than the number of factors. In this article we propose a new contrasts based method to analyze supersaturated designs. The method is discussed and explained through some simulation examples. The performance of the method is evaluated using several known designs from the literature.     

SOME PROPERTIES OF A RANDOM LINEAR DIFFERENCE EQUATION1

Some simple conditions are given for the absolute continuity of the limiting distribution of a random linear difference equation. These results are applied to the super-critical Bellman-Harris branching process with immigration. When the coefficients of the difference equation are non-negative and there is no limiting distribution, it is shown that the asymptotic behaviour of the solutions is the same as that of the partial sums of a divergent random power series. A number of limit theorems are given for the latter situation.     

Maximum expected entropy transformed Latin hypercube designs

Existing projection designs (e.g. maximum projection designs) attempt to achieve good space-filling properties in all projections. However, when using a Gaussian process (GP), model-based design criteria such as the entropy criterion is more appropriate. We employ the entropy criterion averaged over a set of projections, called expected entropy criterion (EEC), to generate projection designs. We show that maximum EEC designs are invariant to monotonic transformations of the response, i.e. they are optimal for a wide class of stochastic process models. We also demonstrate that transformation of each column of a Latin hypercube design (LHD) based on a monotonic function can substantially improve the EEC. Two types of input transformations are considered: a quantile function of a symmetric Beta distribution chosen to optimize the EEC, and a nonparametric transformation corresponding to the quantile function of a symmetric density chosen to optimize the EEC. Numerical studies show that the proposed transformations of the LHD are efficient and effective for building robust maximum EEC designs. These designs give projections with markedly higher entropies and lower maximum prediction variances (MPV''s) at the cost of small increases in average prediction variances (APV''s) compared to state-of-the-art space-filling designs over wide ranges of covariance parameter values.     

Split-plot designs with mirror image pairs as sub-plots

In this article we investigate two-level split-plot designs where the sub-plots consist of only two mirror image trials. Assuming third and higher order interactions negligible, we show that these designs divide the estimated effects into two orthogonal sub-spaces, separating sub-plot main effects and sub-plot by whole-plot interactions from the rest. Further we show how to construct split-plot designs of projectivity P≥3. We also introduce a new class of split-plot designs with mirror image pairs constructed from non-geometric Plackett-Burman designs. The design properties of such designs are very appealing with effects of major interest free from full aliasing assuming that 3rd and higher order interactions are negligible.     

A method for analyzing supersaturated designs inspired by control charts

The identification of active effects in supersaturated designs (SSDs) constitutes a problem of considerable interest to both scientists and engineers. The complicated structure of the design matrix renders the analysis of such designs a complicated issue. Although several methods have been proposed so far, a solution to the problem beyond one or two active factors seems to be inadequate. This article presents a heuristic approach for analyzing SSDs using the cumulative sum control chart (CUSUM) under a sure independence screening approach. Simulations are used to investigate the performance of the method comparing the proposed method with other well-known methods from the literature. The results establish the powerfulness of the proposed methodology.     

SOME PROPERTIES OF PROFILE BOOTSTRAP CONFIDENCE INTERVALS

We consider the problem of finding an equi-tailed confidence interval, with coverage probability (1-α), for a scalar parameter θ₀ in the presence of a (possibly infinite dimensional) nuisance parameter ψ₀. It is supposed that the value taken by θ₀ does not restrict the value that ψ₀ may take and vice-versa. Given a sensible estimate ψ_n of ψ₀, profile bootstrap confidence interval for θ₀ is defined to be the exact equi-tailed confidence interval with coverage probability (1-α) assuming that ψ₀=ψ_n. We compare the properties of the profile bootstrap confidence interval and the ordinary bootstrap confidence interval when they are based on studentised and unstudentised quantities. Under mild regularity conditions the profile bootstrap confidence interval is always a subset of the set of allowable values of θ₀ and is transformation-respecting when based on either an unstudentised quantity or a studentised quantity satisfying certain restrictions. As a confidence interval for the autoregressive parameter of an AR(1) process, the profile bootstrap confidence interval has important advantages over the ordinary bootstrap confidence interval based on a studentised quantity.     

A method for constructing supersaturated designs and its Es2 optimality

A lower bound for the Es² value of an arbitrary supersaturated design is derived. A general method for constructing supersaturated designs is proposed and shown to produce designs with n runs and m = k(n — 1) factors that achieve the lower bound for Es² and are thus optimal with respect to the Es² criterion. Within the class of designs given by the construction method, further discrimination can be made by minimizing the pairwise correlations and using the generalized D and A criteria proposed by Wu (1993). Efficient designs of 12, 16, 20 and 24 runs are constructed by following this approach.     

PARAMETER ESTIMATION FOR THE FIXED BLOCK EFFECTS MODEL USING A USUAL DESIGN

ABSTRACT

This paper is devoted to the fixed block effects model analysed with most of the classical designs. First, we find regularities conditions for such designs. Then, we obtain explicitly all the least squares estimators of the model. A particular attention is given to orthogonal blocked designs and their optimal properties.     

A general method of constructing E(s2)-optimal supersaturated designs

There has been much recent interest in supersaturated designs and their application in factor screening experiments. Supersaturated designs have mainly been constructed by using the E ( s ²)-optimality criterion originally proposed by Booth and Cox in 1962. However, until now E ( s ²)-optimal designs have only been established with certainty for n experimental runs when the number of factors m is a multiple of n-1 , and in adjacent cases where m = q ( n -1) + r (| r | 2, q an integer). A method of constructing E ( s ²)-optimal designs is presented which allows a reasonably complete solution to be found for various numbers of runs n including n ,=8 12, 16, 20, 24, 32, 40, 48, 64.     

Markov chain Monte Carlo tests for designed experiments

We consider conditional exact tests of factor effects in designed experiments for discrete response variables. Similarly to the analysis of contingency tables, a Markov chain Monte Carlo method can be used for performing exact tests, when large-sample approximations are poor and the enumeration of the conditional sample space is infeasible. For designed experiments with a single observation for each run, we formulate log-linear or logistic models and consider a connected Markov chain over an appropriate sample space. In particular, we investigate fractional factorial designs with 2^p-q$2^{p-q}$ runs, noting correspondences to the models for 2^p-q$2^{p-q}$ contingency tables.     

A note on generalized binary proper efficiency-balanced block designs

Some methods of construction of generalized binary proper efficiency-balanced block (GB-EB) designs with two different replications are derived and the solution of the unknown designs given by Das and Kageyama (1991) are obtained.     

Comparing search and estimation performances of designs based on a compound criterion

Since the introduction of the search design by Srivastava [Designs for searching non-negligible effects. In: Srivastava, editor. A survey of statistical design and linear models. Amsterdam: North-Holland, Elsevier; 1975. p. 507–519], construction of such designs has been considered by many researchers. The efficient performances of constructed search designs in terms of parameter estimation and search ability of parameters have also been investigated by several authors. They have proposed suitable optimality measures such as DD- and AD-optimality for estimation in the early stage of search design construction. Moreover, since 1990s, some criteria have been developed to evaluate search performance of a design. Although these criteria are useful none of them is able to evaluate both estimation and search efficiency of a design simultaneously. In this paper, we propose dual-task criteria to deal with searching and estimating performances of search designs. These compound criteria are weighted multiplication of estimation and search suitable criteria. They will be used for design comparison and the results will be presented.     

A Bayes Factor for Replications of ANOVA Results

ABSTRACT

With an increasing number of replication studies performed in psychological science, the question of how to evaluate the outcome of a replication attempt deserves careful consideration. Bayesian approaches allow to incorporate uncertainty and prior information into the analysis of the replication attempt by their design. The Replication Bayes factor, introduced by Verhagen and Wagenmakers (2014 Verhagen, J., and Wagenmakers, E.-J. (2014), “Bayesian Tests to Quantify the Result of a Replication Attempt,” Journal of Experimental Psychology: General, 143, 1457–1475. DOI: 10.1037/a0036731.[Crossref], [PubMed], [Web of Science ®] , [Google Scholar]), provides quantitative, relative evidence in favor or against a successful replication. In previous work by Verhagen and Wagenmakers (2014 Verhagen, J., and Wagenmakers, E.-J. (2014), “Bayesian Tests to Quantify the Result of a Replication Attempt,” Journal of Experimental Psychology: General, 143, 1457–1475. DOI: 10.1037/a0036731.[Crossref], [PubMed], [Web of Science ®] , [Google Scholar]), it was limited to the case of t-tests. In this article, the Replication Bayes factor is extended to F-tests in multigroup, fixed-effect ANOVA designs. Simulations and examples are presented to facilitate the understanding and to demonstrate the usefulness of this approach. Finally, the Replication Bayes factor is compared to other Bayesian and frequentist approaches and discussed in the context of replication attempts. R code to calculate Replication Bayes factors and to reproduce the examples in the article is available at https://osf.io/jv39h/.     

A NEW UPPER BOUND FOR THE EFFICIENCY FACTOR OF A BLOCK DESIGN

An upper bound for the efficiency factor of a block design, which in many cases is tighter than those reported by other authors, is derived. The bound is based on a lower bound for E(1/X) in terms of E(X) and var(X) for a random variable X on the unit interval. For the special case of resolvable designs, an improved bound is given which also competes with known bounds for resolvable designs in some cases.     

ON SOME OPTIMALITY PROPERTIES OF FISHER-RAO SCORE FUNCTION IN TESTING AND ESTIMATION

The score function is associated with some optimality features in statistical inference. This review article looks on the central role of the score in testing and estimation. The maximization of the power in testing and the quest for efficiency in estimation lead to score as a guiding principle. In hypothesis testing, the locally most powerful test statistic is the score test or a transformation of it. In estimation, the optimal estimating function is the score. The same link can be made in the case of nuisance parameters: the optimal test function should have maximum correlation with the score of the parameter of primary interest. We complement this result by showing that the same criterion should be satisfied in the estimation problem as well.     

A comparison of random balance and two-stage group screening designs: A case study

In this paper we focus on the problem of supersaturated (fewer runs than factors) screening experiments. We consider two major types of designs which have been proposed in this situ¬ation: random balance and two-stage group screening. We discuss the relative merits and demerits of each strategy. In addition, we compare the performance of these strategies by means of a case study in which 100 factors are screened in 20,42,62, and 84 runs.     

A NEW MEASURE OF ROTATABILITY OF RESPONSE SURFACE DESIGNS

This paper proposes a new measure of rotatability of a response surface design. It is based on a comparison between the design moments of a given design and the design moments of a rotatable design closest to the given design in the least squares sense. This measure is easier to calculate than Khur?s measure. An alternative easier non-geometrical way of deriving Khuri's measure is also presented. Both measures are calculated to illustrate some designs considered by Khuri.