Robustness of Optimal Chemical Balance Weighing Designs for Estimation of Total Weight

The subject of our study is the chemical balance weighing design in which the errors are correlated and have equal variances. A lower bound for the variance of estimated total weight is obtained and the necessary and sufficient conditions for the attainability of this lower bound are given. Some designs for which the lower bound is attainable are considered.     

On the block structure of proper block designs

In this paper we consider proper block designs and derive an upper bound for the number of blocks which can have a fixed number of symbols common with a given block of the design. To arrive at the desired bound, a generalization of an integer programming theorem due to Bush (1976) is first obtained. The integer programming theorem is then used to derive the main result of this paper. The bound given here is then compared with a similar bound obtained by Kageyama and Tsuji (1977).     

OPTIMUM SINGULAR SPRING BALANCE WEIGHING DESIGNS WITH NON-HOMOGENEITY OF THE VARIANCES OF ERRORS FOR ESTIMATING THE TOTAL WEIGHT

The problem of estimation of the total weight of objects using a singular spring balance weighing design with non-homogeneity of the variances of errors has been dealt with in this paper. Based on a theorem by Katulska (1984) giving a lower bound for the variance of the estimated total weight, a necessary and sufficient condition for this lower bound to be attained is obtained. It is shown that weighing designs for which the the lower bound is attainable, can be constructed from the incidence matrices of (α₁,.,α_t)-resolvable block designs, α-resolvable block designs, singular group divisible designs, and semi-regular group divisible designs.     

ON THE ESTIMATION OF TOTAL WEIGHT IN SINGULAR SPRING BALANCE WEIGHING DESIGNS UNDER THE CO VARIANCE MATRIX OF ERRORS s2G

The problem of the estimation of the linear combination of weights, c′w, in a singular spring balance weighing design when the error structure takes the form E(ee′) =s?²G has been studied. A lower bound for the variance of the estimated linear combination of weights is obtained and a necessary and sufficient condition for this lower bound to be attained is given. The general results are applied to the case of the total of the weights. For a specified form for G, some optimum spring balance weighing designs for the estimated total weight are found.     

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.     

Notes about A-optimal spring balance weighing design

In the paper, the investigation of the A-optimal spring balance weighing design are dealt with under the assumption of normality of errors. The topics are concerned with determining the lower bound of the trace of inverse of information matrix. Moreover, a new method of construction for optimal design is presented.     

Optimal block designs comparing treatments with a control when the errors are correlated

The efficient design of experiments for comparing a control with v new treatments when the data are dependent is investigated. We concentrate on generalized least-squares estimation for a known covariance structure. We consider block sizes k equal to 3 or 4 and approximate designs. This method may lead to exact optimal designs for some v, b, k, but usually will only indicate the structure of an efficient design for any particular v, b, k, and yield an efficiency bound, usually unattainable. The bound and the structure can then be used to investigate efficient finite designs.     

The exact D-optimal first order saturated design with 17 observations

The exact D-optimal first order saturated design with 17 observations is given. The upper bound of the determinant of the information matrix is established and a design attaining this value is constructed. The information matrix is proved to be unique and the optimal design contains the B.I.B. design (16, 16, 6, 6, 2).     

An Introduction to Practical Sequential Inferences via Single-Arm Binary Response Studies Using the binseqtest R Package

We review sequential designs, including group sequential and two-stage designs, for testing or estimating a single binary parameter. We use this simple case to introduce ideas common to many sequential designs, which in this case can be explained without explicitly using stochastic processes. We focus on methods provided by our newly developed R package, binseqtest, which exactly bound the Type I error rate of tests and exactly maintain proper coverage of confidence intervals. Within this framework, we review some allowable practical adaptations of the sequential design. We explore issues such as the following: How should the design be modified if no assessment was made at one of the planned sequential stopping times? How should the parameter be estimated if the study needs to be stopped early? What reasons for stopping early are allowed? How should inferences be made when the study is stopped for crossing the boundary, but later information is collected about responses of subjects that had enrolled before the decision to stop but had not responded by that time? Answers to these questions are demonstrated using basic methods that are available in our binseqtest R package. Supplementary materials for this article are available online.     

Branch and bound algorithms for maximizing expected improvement functions

Deterministic computer simulations are often used as replacement for complex physical experiments. Although less expensive than physical experimentation, computer codes can still be time-consuming to run. An effective strategy for exploring the response surface of the deterministic simulator is the use of an approximation to the computer code, such as a Gaussian process (GP) model, coupled with a sequential sampling strategy for choosing design points that can be used to build the GP model. The ultimate goal of such studies is often the estimation of specific features of interest of the simulator output, such as the maximum, minimum, or a level set (contour). Before approximating such features with the GP model, sufficient runs of the computer simulator must be completed.Sequential designs with an expected improvement (EI) design criterion can yield good estimates of the features with minimal number of runs. The challenge is that the expected improvement function itself is often multimodal and difficult to maximize. We develop branch and bound algorithms for efficiently maximizing the EI function in specific problems, including the simultaneous estimation of a global maximum and minimum, and in the estimation of a contour. These branch and bound algorithms outperform other optimization strategies such as genetic algorithms, and can lead to significantly more accurate estimation of the features of interest.     

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.     

Dose finding when the target dose is on a plateau of a dose–response curve: comparison of fully sequential designs

Consider the problem of estimating a dose with a certain response rate. Many multistage dose‐finding designs for this problem were originally developed for oncology studies where the mean dose–response is strictly increasing in dose. In non‐oncology phase II dose‐finding studies, the dose–response curve often plateaus in the range of interest, and there are several doses with the mean response equal to the target. In this case, it is usually of interest to find the lowest of these doses because higher doses might have higher adverse event rates. It is often desirable to compare the response rate at the estimated target dose with a placebo and/or active control. We investigate which of the several known dose‐finding methods developed for oncology phase I trials is the most suitable when the dose–response curve plateaus. Some of the designs tend to spread the allocation among the doses on the plateau. Others, such as the continual reassessment method and the t‐statistic design, concentrate allocation at one of the doses with the t‐statistic design selecting the lowest dose on the plateau more frequently. Copyright © 2013 John Wiley & Sons, Ltd.     

Optimum spring balance weighing designs for estimating the total weight

The problem of estimation of the total weight or objects using a spring balance weighing design has been deait with in this paper Based on a theorem by Dey and Gupta (1977) giving a lower bound for the variance of the estimated total weight, a necessary and sufficient condition for this lower bound to be attained is obtained. A few special cases where the lower bound is attained are enumerated.     

Construction on non-adaptive hypergeometric group testing desings for identifying at most two defectives

In the literature a systematic method of obtaining a group testing design is not available at present. Weideman and Raghavarao (1987a, b) gave methods for the construction of non - adaptive hypergeometric group testing designs for identifying at most two defectives by using a dual method. In the present investigation we have developed a method of construction of group testing designs from (i) Hypercubic Designs for t ≡ 3 (mod 6) and (ii) Balanced Incomplete Block Designs for t ≡ 1 (mod 6) and t ≡ 3 (mod 6). These constructions are accomplished by the use of dual designs. The designs so constructed satisfy specified properties and attained an optimal bound as discussed by Weidman and Raghavarao (1987a,b). Here it is also shown that the condition for pairwise disjoint sets of BIBD for t ≡ 1 (mod 6) given by Weideman and Raghavarao (1987b) is not true for all such designs.     

Singular weighing designs and estimation of total weight

The problem of estimation of total weight of objects using a singular spring balance weighing design has been studied in this paper. A lower bound of the estimated total weight is obtained and some classes of designs attaining the lower bound are studied.     

Measures of non orthogonality in block designs

Orthogonality is an important concept in block design. Necessary and sufficient condition for a connected block design to be orthogonal is well known. However, when a design is not orthogonal, it is not clear how much it deviates from orthogonality. In this paper, an attempt has been made to first define the measures of or indices to non orthogonality in block design and then to characterize designs possessing minimum non orthogonality indices. It is shown that a Balanced Incomplete Block Design (BIBD) and a Balanced Block Design (BBD), if exist, possess this property.     

Adaptive Estimation of the Integral of Squared Regression Derivatives

A problem of estimating the integral of a squared regression function and of its squared derivatives has been addressed in a number of papers. For the case of a heteroscedastic model where smoothness of the underlying regression function, the design density, and the variance of errors are known, the asymptotically sharp minimax lower bound and a sharp estimator were found in Pastuchova & Khasminski (1989). However, there are apparently no results on the either rate optimal or sharp optimal adaptive, or data-driven, estimation when neither the degree of regression function smoothness nor design density, scale function and distribution of errors are known. After a brief review of main developments in non-parametric estimation of non-linear functionals, we suggest a simple adaptive estimator for the integral of a squared regression function and its derivatives and prove that it is sharp-optimal whenever the estimated derivative is sufficiently smooth.     

Finite sample performance of sequential designs for model identification

Classical regression analysis is usually performed in two steps. In the first step, an appropriate model is identified to describe the data generating process and in the second step, statistical inference is performed in the identified model. An intuitively appealing approach to the design of experiment for these different purposes are sequential strategies, which use parts of the sample for model identification and adapt the design according to the outcome of the identification steps. In this article, we investigate the finite sample properties of two sequential design strategies, which were recently proposed in the literature. A detailed comparison of sequential designs for model discrimination in several regression models is given by means of a simulation study. Some non-sequential designs are also included in the study.     

A Lower Bound for the Wrap-around L2-discrepancy on Combined Designs of Mixed Two- and Three-level Factorials

The objective of this article is to study the issue of employing the uniformity criterion measured by wrap-around L₂-discrepancy to assess the optimal foldover plans. For mixed two- and three-level fractional factorials as the original designs, general foldover plan and combined design under a foldover plan are defined, and the equivalence between any foldover plan and its complementary foldover plan is investigated. A lower bound of wrap-around L₂-discrepancy of combined designs under a general foldover plan is obtained, which can be used as a benchmark for searching optimal foldover plans. Moreover, it also provides a theoretical justification for optimal foldover plans in terms of uniformity criterion.     

Bayesian two-stage optimal design for mixture models

In this paper, a Bayesian two-stage D–D optimal design for mixture experimental models under model uncertainty is developed. A Bayesian D-optimality criterion is used in the first stage to minimize the determinant of the posterior variances of the parameters. The second stage design is then generated according to an optimalityprocedure that collaborates with the improved model from the first stage data. The results show that a Bayesian two-stage D–D-optimal design for mixture experiments under model uncertainty is more efficient than both the Bayesian one-stage D-optimal design and the non-Bayesian one-stage D-optimal design in most situations. Furthermore, simulations are used to obtain a reasonable ratio of the sample sizes between the two stages.