Distorting symmetric designs

A simple replacement approach is used to construct new symmetric and affine designs from projective or affine spaces. This is used to construct symmetric designs with a given automorphism group, to study GMW designs, and to construct new affine designs whose automorphism group fixes a point and has just two point- and block-orbits.      

Modular product design and product support

A modular design for a product or system can be an effective approach to support of the product if total replacement and repair times can be reduced by modular replacement. On the other hand, modular designs may involve higher costs of replacement and inventory holding. Cost models are developed for the evaluation of a modular design, and the distinction between integrated modules and replaceable subassemblies is discussed. Numerical examples are given to illustrate the tradeoffs to be made.     

A pseudo-empirical log-likelihood estimator using scrambled responses

In this paper, we propose an empirical log-likelihood estimator for estimating the population mean of a sensitive variable in the presence of an auxiliary variable. A new concept of conditional mean squared error of the empirical likelihood estimator is introduced. The proposed method is valid for simple random and without replacement sampling (SRSWOR) and could easily be extended for complex survey designs. The relative efficiency of the proposed pseudo-empirical log-likelihood estimator with respect to the usual, and to a recent estimator due to Diana and Perri (2009b), has been investigated through a simulation study.     

An Information-theoretic Approach to the Effective Usage of Auxiliary Information from Survey Data

In this paper, we propose an information-theoretic approach to the effective usage of auxiliary information from survey data, which is suitable for both simple and complex survey data. Our estimator under simple random sampling without replacement will be consistent and asymptotically normal. We show that the resulting estimates have smaller asymptotic variances than the usual estimates which do not use auxiliary information. For more complex survey designs, the resulting estimator is in essence asymptotically equivalent to a pseudo empirical likelihood estimator. Results of a limited simulation study show that the proposed estimators perform well among a number of competitors.     

Economic and economic-statistical design of a chi-square chart for CBM

In this paper, the economic and economic-statistical design of a χ² chart for a maintenance application is considered. The machine deterioration process is described by a three-state continuous time Markov chain. The machine state is unobservable, except for the failure state. To avoid costly failures, the system is monitored by a χ² chart. The observation process stochastically related to the machine condition is assumed to be multivariate, normally distributed. When the chart signals, full inspection is performed to determine the actual machine condition. The system can be preventively replaced at a sampling epoch and must be replaced upon failure; preventive replacement costs less than failure replacement. The objective is to find the optimal control chart parameters that minimize the long-run average maintenance cost per unit time. For the economic-statistical design, an additional constraint guaranteeing the occurrence of the true alarm signal on the chart before failure with given probability is considered. For both designs, the objective function is derived using renewal theory.     

Uniform supersaturated design and its construction

Supersaturated designs are factorial designs in which the number of main effects is greater than the number of experimental runs. In this paper, a discrete discrepancy is proposed as a measure of uniformity for supersaturated designs, and a lower bound of this discrepancy is obtained as a benchmark of design uniformity. A construction method for uniform supersaturated designs via resolvable balanced incomplete block designs is also presented along with the investigation of properties of the resulting designs. The construction method shows a strong link between these two different kinds of designs     

混水平均匀设计的构造

我们用离散偏差来度量部分因子设计的均匀性,本文的目的在于寻找一些构造混水平均匀设计的方法,这些方法比文献中已有的方法更简单且计算成本更低.我们得到了离散偏差的一个下界,如果一个U 型设计的离散偏差值达到这个下界,那么该设计是—个均匀设计.我们建立了均匀设计与组合设计理论中一致可分解设计之间的联系.通过一致可分解设计,我们提出了一些构造均匀设计的新方法,同时也给出了许多均匀设计存在的无穷类.     

Quaternion orthogonal designs from complex companion designs

The success of applying generalized complex orthogonal designs as space-time block codes recently motivated the definition of quaternion orthogonal designs as potential building blocks for space-time-polarization block codes. This paper offers techniques for constructing quaternion orthogonal designs via combinations of specially chosen complex orthogonal designs. One technique is used to build quaternion orthogonal designs on complex variables for any even number of columns. A second related technique is applied to maximum rate complex orthogonal designs to generate an infinite family of quaternion orthogonal designs on complex variables such that the resulting designs have no zero entries. This second technique is also used to generate an infinite family of quaternion orthogonal designs defined over quaternion variables that display a regular redundancy. The proposed constructions are theoretically important because they provide the first known direct techniques for building infinite families of orthogonal designs over quaternion variables for any number of columns.     

一类正交空间填充设计的构造

空间填充设计在计算机试验中应用十分广泛,当拟合回归模型时,正交的空间填充设计保证了因子效应估计的独立性.基于广义正交设计,文章给出了构造二阶正交拉丁超立方体设计和列正交设计的方法,新构造的设计不仅满足任意两列之间相互正交,还能保证每一列与任一列元素平方组成的列以及任两列元素相乘组成的列都正交.当某些正交的空间填充设计不存在时,具有较小相关系数的近似正交设计可作为替代设计使用.设计构造的灵活性为计算机试验在实践中的广泛应用提供了必要的支持.     

One-dimensional nested maximin designs

The design of computer experiments is an important step in black-box evaluation and optimization processes. When dealing with multiple black-box functions the need often arises to construct designs for all black boxes jointly, instead of individually. These so-called nested designs are particularly useful as training and test sets for fitting and validating metamodels, respectively. Furthermore, nested designs can be used to deal with linking parameters and sequential evaluations. In this paper, we introduce one-dimensional nested maximin designs. We show how to nest two designs optimally and develop a heuristic to nest three and four designs. These nested maximin designs can be downloaded from the website . Furthermore, it is proven that the loss in space-fillingness, with respect to traditional maximin designs, is at most 14.64 and 19.21%, when nesting two and three designs, respectively.     

Some results on resolvable incomplete block designs

This paper is concerned with the uniformity of a certain kind of resolvable incomplete block (RIB for simplicity) design which is called the PRIB design here. A sufficient and necessary condition is obtained, under which a PRIB design is the most uniform in the sense of a discrete discrepancy measure, and the uniform PRIB design is shown to be connected. A construction method for such designs via a kind of U-type designs is proposed, and an existence result of these designs is given. This method sets up an important bridge between PRIB designs and U-type designs.     

Constructions for resolvable and related designs

Methods are given for constructing block designs, using resolvable designs. These constructions yield methods for generating resolvable and affine designs and also affine designs with affine duals. The latter are transversal designs or semi-regular group divisible designs with ₁=0 whose duals are also designs of the same type and parameters. The paper is a survey of some old and some recent constructions.     

正交设计的最新发展和应用-回归分析在正交设计的应用

正交设计有许多新发展,本系列讲座介绍其中的一些便于应用的结果,共有四部份：回归分析在正交设计中的应用,均匀正交设计,正交设计的Ｄ－最优性,以及正交设计的投影性质。本讲强调回归分析用于正交设计的建模、估计、减少参数数目方面的应用     

Multiplicative designs I: The normal and reducible cases

Multiplicative designs, square designs with a rank one intersection pattern, are investigated. In particular we determine all designs for which some incidence matrix is reducible and we show if some incidence matrix is normal the design must be uniform with three families of exceptions. Some new designs are constructed.     

Theory of optimal blocking for fractional factorial split-plot designs

The issue of optimal blocking for fractional factorial split-plot (FFSP) designs is considered under the two criteria of minimum aberration and maximum estimation capacity. The criteria of minimum secondary aberration (MSA) and maximum secondary estimation capacity (MSEC) are developed for discriminating among rival nonisomorphic blcoked FFSP designs. A general rule for identifying MSA or MSEC blocked FFSP designs through their blocked consulting designs is established.     

Construction of Sudoku designs and Sudoku-based uniform designs

In this paper, an easy and effective construction method of Sudoku designs with any order is provided based on the right shift operator. Based on the constructed Sudoku designs, a class of Sudoku-based uniform designs is constructed. Moreover, the properties of the constructed Sudoku designs and Sudoku-based uniform designs are investigated, it is shown that both the constructed Sudoku designs and Sudoku-based uniform designs are uniform designs in terms of discrete discrepancy.     

An effective algorithm for generation of factorial designs with generalized minimum aberration

Fractional factorial designs are popular and widely used for industrial experiments. Generalized minimum aberration is an important criterion recently proposed for both regular and non-regular designs. This paper provides a formal optimization treatment on optimal designs with generalized minimum aberration. New lower bounds and optimality results are developed for resolution-III designs. Based on these results, an effective computer search algorithm is provided for sub-design selection, and new optimal designs are reported.     

CONSTRUCTING UNIFORM DESIGNS WITH TWO- OR THREE-LEVEL

When the number of runs is large, to search for uniform designs in the sense of low-discrepancy is an NP hard problem. The number of runs of most of the available uniform designs is small (≤50). In this article, the authors employ a kind of the so-called Hamming distance method to construct uniform designs with two- or three-level such that some resulting uniform designs have a large number of runs. Several infinite classes for the existence of uniform designs with the same Hamming distances between any distinct rows are also obtained simultaneously. Two measures of uniformity, the centered L2-discrepancy (CD, for short) and wrap-around L2-discrepancy (WD, for short), are employed.     

Construction of optimal supersaturated designs by the packing method

A supersaturated design is essentially a factorial design with the equal occurrence of levels property and no fully aliased factors in which the number of main effects is greater than the number of runs. It has received much recent interest because of its potential in factor screening experiments. A packing design is an important object in combinatorial design theory. In this paper, a strong link between the two apparently unrelated kinds of designs is shown. Several criteria for comparing supersaturated designs are proposed, their properties and connections with other existing criteria are discussed. A combinatorial approach, called the packing method, for constructing optimal supersaturated designs is presented, and properties of the resulting designs are also investigated. Comparisons between the new designs and other existing designs are given, which show that our construction method and the newly constructed designs have good properties.     

Superpure digraph designs

A digraph design is a decomposition of a complete (symmetric) digraph into copies of pre‐specified digraphs. Well‐known examples for digraph designs are Mendelsohn designs, directed designs or orthogonal directed covers. A digraph design is superpure if any two of the subdigraphs in the decomposition have no more than two vertices in common. We give an asymptotic existence theorem for superpure digraph designs, which is a variation of an earlier result of Lamken and Wilson J Combin Theory Ser A 89: 149–200, 2000. As an immediate consequence, we obtain new results for supersimple designs and pure perfect Mendelsohn designs. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 239–255, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10013