On the construction of m-associate pbib designs II

Some series of m-associate triangular PBIB designs have been constructed. A table of now three associate designs in the range b, v ≦ 100; r, k ≦ 10 with their average efficiencies has been given. These designs with (v, b, r, k) are new in the sense that the existence of two associate PBIB designs (e.f. Clatworthy (1973), John & Turner (1977), Dey (1978)) with these parameters are not known. The constructions presented herein also yield partially balanced weighing designs, nested PBIB designs and PBIB designs for m11111 response exoeriments.     

REDUCED RESIDUE CLASSES CYCLIC PBIB DESIGNS

A new general class of m-class cyclic association scheme is defined for v treatments, where v is a composite number. A simple method of construction of PBIB designs having this association scheme using more than one initial block and some methods using only one initial block are proposed. A complete analysis of this type of PBIB designs is given. Also given is a list of 39 useful PBIB designs of this type having v≤15 and r≤10 and having only three associate classes together with their efficiency factors for all types of comparisons and over all efficiency factors.     

An infinite class of PBIB designs

In this paper, an infinite class of partially balanced incomplete block (PBIB) designs of m+1 associate classes is constructed through the use of a series of row-orthogonal matrices known as partially balanced orthogonal designs (PBOD) of m-associate classes. For the purpose, a series of PBOD is obtained through a method described herein. An infinite class of regular GD designs is also reported.     

Pseudo New Modified Latin Square (NML m (m)) Type PBIB Designs

A New Modified Latin square [NML _i (m)] association scheme with i constraints for v = m ² treatments was introduced by Garg (2008 Garg , D. K. ( 2008 ). New modified Latin square (NMLi) type PBIB designs . J. Math. Syst. Sci. 1 ( 4 ): 83 – 89 . [Google Scholar]). In this article, a new association scheme known as Pseudo New Modified Latin square [Pseudo NML _m (m)] type association scheme is defined. The parameters of Pseudo NML _m (m) association scheme turned out to be parameters of NML _i (m) association scheme by taking i = m in NML _i (m) association scheme. The Pseudo NML _m (m) association scheme will be the usual NML _m (m) association scheme when m is a prime or a prime power. The PBIB designs following Pseudo NML _m (m) association scheme will be called the Pseudo NML _m (m) type PBIB designs. Analysis of Pseudo NML _m (m) designs along with a construction method of these designs is also given in this article.     

Criteria for the validity of Fisher's condition for balanced block designs

A block design is said to satisfy Fisher's condition if the rows of its incidence matrix are linearly independent. In this note, the results of Kageyama and Tsuji (1980, 1984), concerning the validity of Fisher's condition for variance- and combinatorially-balanced block designs, are strengthened by replacing sufficient conditions involved in them by necessary and sufficient conditions.     

On a paper by kageyama and mohan

Kageyama Mohan (1984) have presented three methods of constructing new incomplete block designs from balanced incomplete block designs, They raise questions about the designs which come from each of their methods, These questions are answered, Another series of group divisible designs is derived as a special case of their second method.     

Characterization of Balanced Fractional 3 m Factorial Designs of Resolution III

We consider a fractional 3 ^m factorial design derived from a simple array (SA), which is a balanced array of full strength, where the non negligible factorial effects are the general mean and the linear and quadratic components of the main effect, and m ≥ 2. In this article, we give a necessary and sufficient condition for an SA to be a balanced fractional 3 ^m factorial design of resolution III. Such a design is characterized by the suffixes of indices of an SA.     

Existence Conditions for Balanced Fractional 2m Factorial Designs of Resolution 2l + 1 Derived from Simple Arrays

We consider a fractional 2^m factorial design derived from a simple array (SA) such that the (? + 1)-factor and higher-order interactions are negligible, where 2? ? m. The purpose of this article is to give a necessary and sufficient condition for an SA to be a balanced fractional 2^m factorial design of resolution 2? + 1. Such a design is concretely characterized by the suffixes of the indices of an SA.     

General upper bound for the number of blocks having a given number of treatments common with a given block

The purpose of this paper is systematically to derive the general upper bound for the number of blocks having a given number of treatments common with a given block of certain incomplete block designs. The approach adopted here is based on the spectral decomposition of N′N for the incidence matrix N of a design, where N' is the transpose of the matrix N. This approach will lead us to upper bounds for incomplete block designs, in particular for a large number of partially balanced incomplete block (PBIB) designs, which are not covered with the standard approach (Shah 1964, 1966), Kapadia (1966)) of using well known relations between blocks of the designs and their association schemes. Several results concerning block structure of block designs are also derived from the main theorem. Finally, further generalizations of the main theorem are discussed with some illustrations.     

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.     

Some New Series of Partially Balanced Residual Treatment Effects Designs

Blaisdell and Raghavarao (1980 Blaisdell , E. A. , Raghavarao , D. ( 1980 ). Partially balanced change-over designs based on m-associate class PBIB designs . JRSS B 42 : 334 – 338 . [Google Scholar] 1985 Blaisdell , E. A. , Raghavarao , D. ( 1985 ). Efficiency bounds for partially balanced change-over designs based on m-associate class PBIB designs . JRSS B 47 : 132 – 135 . [Google Scholar]) introduced partially balanced residual treatment effects designs and gave methods of construction of these designs. They also gave efficiencies for the estimated direct and residual elementary treatment contrasts of these designs. In this paper, we construct some new series of partially balanced residual treatment effects designs and also give their efficiencies for the estimated direct and residual elementary treatment contrasts.     

Existence conditions for balanced fractional 3m factorial designs of resolution R({00, 10, 01, 20, 11})

We consider a fractional 3^m factorial design derived from a simple array (SA) such that the non negligible factorial effects are the general mean, the linear and the quadratic components of the main effect, and the linear-by-linear and the linear-by-quadratic components of the two-factor interaction. If these effects are estimable, then a design is said to be of resolution R({00, 10, 01, 20, 11}). In this paper, we give a necessary and sufficient condition for an SA to be a balanced fractional 3^m factorial design of resolution R({00, 10, 01, 20, 11}). Such a design is concretely characterized by the suffixes of the indices of an SA.     

On-Line Process Control using Attributes with Misclassification Errors: An Economical Design for Short-Run Production

On-line process control consists of inspecting a single item for every m (integer and m ≥ 2) produced items. Based on the results of the inspection, it is decided whether the process is in-control (the fraction of conforming items is p ₁; State I) or out-of-control (the fraction of conforming items is p ₂ < p ₁; State II). If the inspected item is non conforming, it is determined that the process is out-of-control, and the production process is stopped for an adjustment; otherwise, production continues. As most designs of on-line process control assume a long-run production, this study can be viewed as an extension because it is concerned with short-run production and the decision regarding the process is subject to misclassification errors. The probabilistic model of the control system employs properties of an ergodic Markov chain to obtain the expression of the average cost of the system per unit produced, which can be minimised as a function of the sampling interval, m. The procedure is illustrated by a numerical example.     

On a class of partially balanced incomplete block designs

Bose and Clatworthy (1955) showed that the parameters of a two-class balanced incomplete block design with λ1=1,λ2=0 and satisfying r <k can be expressed in terms of just three parameters r,k,t. Later Bose (1963) showed that such a design is a partial geometry (r,k,t). Bose, Shrikhande and Singhi (1976) have defined partial geometric designs (r,k,t,c), which reduce to partial geometries when c=0. In this note we prove that any two class partially balanced (PBIB) design with r <k, is a partial geometric design for suitably chosen r,k,t,c and express the parameters of the PBIB design in terms of r,k,t,c and λ2. We also show that such PBIB designs belong to the class of special partially balanced designs (SPBIB) studied by Bridges and Shrikhande (1974).     

Design selection for strong orthogonal arrays

Strong orthogonal arrays (SOAs) were recently introduced and studied as a class of space‐filling designs for computer experiments. An important problem that has not been addressed in the literature is that of design selection for such arrays. In this article, we conduct a systematic investigation into this problem, and we focus on the most useful SOA(n,m,4,2 + )s and SOA(n,m,4,2)s. This article first addresses the problem of design selection for SOAs of strength 2+ by examining their three‐dimensional projections. Both theoretical and computational results are presented. When SOAs of strength 2+ do not exist, we formulate a general framework for the selection of SOAs of strength 2 by looking at their two‐dimensional projections. The approach is fruitful, as it is applicable when SOAs of strength 2+ do not exist and it gives rise to them when they do. The Canadian Journal of Statistics 47: 302–314; 2019 © 2019 Statistical Society of Canada     

m-Associate PBIB designs using Youden-m squares

In this paper, we have proposed a type of arrangement that we call Youden-m square and is similar to the usual Youden square but generates PBIB designs instead of BIB designs when its columns are taken as blocks. We have also discussed its construction methodologies, introduced two new m-associate class association schemes, and also constructed some series of Youden-m square type PBIB designs.     

Reverse Foldovers for Blocked 2 m−k Fractional Factorial Designs

Two-level regular fractional factorial designs are often used in industry as screening designs to help identify early on in an experimental process those experimental or system variables which have significant effects on the process being studied. When the experimental material to be used in the experiment is heterogenous or the experiment must be performed over several well-defined time periods, blocking is often used as a means to improve experimental efficiency by removing the possible effects of heterogenous experimental material or possible time period effects. In a recent article, Li and Jacroux (2007 Li , F. , Jacroux , M. (2007). Optimal foldover plans for blocked 2 ^m?k fractional factorial designs. J. Statsist. Plann. Infer 137:2434–2452. [Google Scholar]) suggested a strategy for constructing optimal follow-up designs for blocked fractional factorial designs using the well-known foldover technique in conjunction with several optimality criteria. In this article, we consider the reverse foldover problem for blocked fractional factorial designs. In particular, given a 2^(m+p)?(p+k) blocked fractional factorial design D, we derive simple sufficient conditions which can be used to determine if there exists a 2^{(m+p?1)?(p?1+k+1)} initial fractional factorial design d which yields D as a foldover combined design as well how to generate all such d. Such information is useful in developing an overall experimental strategy in situations where an experimenter wants an overall blocked fractional factorial design with “desirable” properties but also wants the option of analyzing the observed data at the halfway mark to determine if the significant experimental variables are obvious (and the experiment can be terminated) or if a different path of experimentation should be taken from that initially planned.     

D-optimal weighing designs and optimal chemical balance weighing designs for estimating the total weight

This paper provides D-optimal spring balance designs for estimating individual weights when the number of objects to be weighed in each weighing, B, is fixed. D-optimal chemical balance designs for estimating total weight under both homogeneous and nonhomogeneous error variances are found when the number of objects weighed in each weighing is ≥ B, a fixed number.

We indicate the restriction used in Chacko & Dey(1978) and Kageyama(1988), i.e. that chemical designs X be restricted to designs in which exactly “a” objects are replaced on the left pan and exactly “b” on the right pan in each of the weighings for a, b > 0, is unnecessary.     

A criterion for connectedness in two-associate class PBIB designs

A necessary and sufficient condition, in terms of its parameters, is established for a two-associate-class PBIB design to be connected.     

GEOMETRIC DECAY OF THE STEADY-STATE PROBABILITIES IN A QUASI-BIRTH-AND-DEATH PROCESS WITH A COUNTABLE NUMBER OF PHASES

A sufficient condition is proved for geometric decay of the steady-state probabilities in a quasi-birth-and-death process having a countable number of phases in each level. If there is a positive number η and positive vectors x = (x _i) and y = (y _j ) satisfying some equations and inequalities, the steady-state probability π _mi decays geometrically with rate η in the sense π _mi ～ cη ^m x _i as m → ∞. As an example, the result is applied to a two-queue system with shorter queue discipline.