A-Optimal Spring Balance Weighing Designs Under Some Conditions

In this article, the estimation problem of individual weights of objects in spring balance weighing design using the criterion of A-optimality is discussed. It is assumed that the measurement errors have different variances. The lowest bound of the trace of the dispersion matrix is obtained and the conditions when this lowest bound is achieved are given. A new construction method of an A-optimal design is presented.     

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.     

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.     

Recent developments in D-optimal designs

In the paper, some issues concerned with the determining spring balance weighing designs satisfying the criterion of D-optimality under the assumption measurement errors are uncorrelated and they have the same variances are discussed. In addition, highly D-efficient spring balance weighing designs are also considered. Some conditions under which any spring balance weighing design is regular D-optimal or highly D-efficient are proved. What is more, new construction methods of regular D-optimal and highly D-efficient spring balance weighing designs are presented.     

Linear Integer Programming Approach to Construction of Balanced Incomplete Block Designs

This article proposes a linear integer programming-based algorithm to construct balanced incomplete block designs. Working of the algorithm is illustrated with the help of an example. The algorithm is able to generate balanced incomplete block designs very fast in most of the cases. The performance of the proposed algorithm is compared with other algorithms proposed in the literature. It is demonstrated that the proposed algorithm is competitive with the existing algorithms.     

Constructions of Nested Pairwise Efficiency and Variance Balanced Designs

ABSTRACT

Nested pairwise efficiency and variance balanced designs form a new class of block designs. In this article, two methods of constructing such designs from a symmetric balanced incomplete block design are proposed with some illustrations.     

Super-simple group divisible designs with block size 4 and index 9

A design is said to be super-simple if the intersection of any two blocks has at most two elements. In statistical planning of experiments, super-simple designs are the ones providing samples with maximum intersection as small as possible. Super-simple GDDs are useful in constructing super-simple BIBDs. The existence of super-simple (4,λ)‐GDDs has been determined for λ=2-6. In this paper, we investigate the existence of a super-simple (4,9)-GDD of group type g^u and show that such a design exists if and only if u≥4, g(u−2)≥18 and u(u−1)g²≡0 (mod 4).     

The Construction of Optimal Imcomplete Block Designs When Observations Within a Block are Correlated

An algorithmic method is described for the construction of optimal incomplete block designs when a known correlation structure is assumed for observations from plots in the same block. The method is applicable to a wide class of designs and correlation structures. Some examples are given to illustrate the procedure.     

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.     

Construction of Balanced Incomplete Block Designs Using Cyclic Shifts

Balanced incomplete block designs (BIBDs) play important role in design of experiments, especially in field experiments. These designs ensure that treatments are compared with equal precision. Several methods are available in the literature to construct BIBDs but in this article some infinite series of these designs are presented by method of cyclic shifts. This method expresses some standard properties of a design just through examining the sets of shifts rather than studying the whole design.     

E-optimal design in irregular BIBD settings

When the necessary conditions for a BIBD are satisfied, but no BIBD exists, there is no simple answer for the optimal design problem. This paper identifies the E-optimal information matrices for any such irregular BIBD setting when the number of treatments is no larger than 100. A- and D-optimal designs are typically not E-optimal. An E-optimal design for 15 treatments in 21 blocks of size 5 is found.     

Balanced treatment incomplete block designs through integer programming

An algorithm is presented to construct balanced treatment incomplete block (BTIB) designs using a linear integer programming approach. Construction of BTIB designs using the proposed approach is illustrated with an example. A list of efficient BTIB designs for 2 ? v ? 12, v + 1 ? b ? 50, 2 ? k ? min(10, v), r ? 10, r₀ ? 20 is provided. The proposed algorithm is implemented as part of an R package.     

On use of symmetrical balanced incomplete block design in construction of sampling design realising pre-assigned sets of inclusion probabilities of first two orders.

Gupta, Nigam and Kumar (1982) proposed a sampling scheme using certain combinatorial properties of balanced incomplete block design (BIBD) which realises first order inclusion probabilities proportional to measure of size(IPPS). Here their results have been extended by presenting samplng schemes realising pre-assigned sets of inclusion probabilities of first two orders.     

Hypercubic designs and applications

In this paper we develop relatively easy methods for constructing hypercubic designs from symmetrical factorial experiments for t=v ^m treatments with v=2, 3. The proposed methods are easy to use and are flexible in terms of choice of possible block sizes.     

BALANCED ARRAYS AND WEIGHING DESIGNS

Dey (19711, Saha (1975), Kageyama & Saha (1983) and others have shown how optimum chemical balance weighing designs can be constructed from the incidence matrices of balanced incomplete block (BIB) designs. In this paper, it is shown that weighing designs can be constructed from some suitably chosen two-symbol balanced arrays of strength two, which need not always be incidence matrices of BIB designs. The findings lead us to construct new optimum chemical balance weighing designs from incidence matrices of BIB designs.     

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).     

Optimal block designs for double cross experiments

ABSTRACT

This paper presents systematic methods of construction of optimal block designs for a double cross experiments for both even and odd values of “p” parental lines. The both even and odd values of designs are derived by using initial block of unreduced balanced incomplete block designs and initial block of row–column designs given by Bose et al. (1953 Bose, R.C., Shrikhande, S.S., Bhattacharya, K.N. (1953). On the construction of group divisible incomplete block design. Ann. Math. Stat. 24:167–195.[Crossref] , [Google Scholar]) and Gupta and Choi (1998 Gupta, S., Choi, K.C. (1998). Optimal row-column designs for complete diallel crosses. Commun. Stat. Theory Methods 27(11):2827–2835.[Taylor & Francis Online], [Web of Science ®] , [Google Scholar]), respectively. In this attempt we have found some new universally optimal block designs for double cross experiments.     

The Use of Balanced Incomplete Block Designs in Designing Randomized Response Surveys

This paper investigates the block total response method proposed by Raghavarao and Federer for providing accurate estimates of the base rates of sensitive characteristics during surveys. It determines the best balanced incomplete block design to use to estimate the base rates for three, four, five and six sensitive attributes respectively, given a maximum total number of 13 questions. The estimates obtained from this method have smaller variance than estimates obtained using the similar, but more popular, unmatched count technique.     

On Combining Information in Generally Balanced Nested Block Designs

Explicit formulae for analyzing an experiment carried out in a nested block design having the general balance property of some desirable pattern are presented. They follow from a randomization-derived mixed model, decomposed into stratum submodels. Attention is confined here to the combined analysis allowing the information from different strata to be joined together. This article is an extension of some results presented in Caliński and Kageyama (2000 Caliński , T. , Kageyama , S. ( 2000 ). Block Designs: A Randomization Approach, vol. I: Analysis . Lecture Notes in Statistics , vol. 150. New York : Springer .[Crossref] , [Google Scholar]), where the theory underlying the considered analysis is given.     

On the construction of a class of efficient row-column designs

In this paper a method for the construction of a class of row-column designs with good statistical properties and high efficiency is presented. The class of designs produced is shown to exhibit balance, orthogonality and adjusted orthogonality. The efficiencies of these designs are investigated in detail, and they are shown to be very high, and possibly maximal in some cases.