Fang, K.T., Tang, Y. and Yin, J.X. (2005) Resolvable Partially Pairwise Balanced Designs and Their Applications in Computer Experiments. Utilitas Mathematica, 70, 141-157.

has been cited by the following article:

• TITLE: U-Type Designs via New Generalized Partially Balanced Incomplete Block Designs with m = 4, 5 and 7 Associated Classes

  AUTHORS: Imane Rezgui, Zebida Gheribi-Aoulmi, Hervé Monod

  KEYWORDS: Association Scheme, Combinatory Method (s), Resolvable Partially Balanced Incomplete Block Design, U-Type Design

  JOURNAL NAME: Applied Mathematics, Vol.6 No.2, February 4, 2015

  ABSTRACT: The traditional combinatorial designs can be used as basic designs for constructing designs of computer experiments which have been used successfully till now in various domains such as engineering, pharmaceutical industry, etc. In this paper, a new series of generalized partially balanced incomplete blocks PBIB designs with m associated classes (m = 4, 5 and 7) based on new generalized association schemes with number of treatments v arranged in w arrays of n rows and l columns (w ≥ 2, n ≥ 2, l ≥ 2) is defined. Some construction methods of these new PBIB are given and their parameters are specified using the Combinatory Method (s). For n or l even and s divisor of n or l, the obtained PBIB designs are resolvable PBIB designs. So the Fang RBIBD method is applied to obtain a series of particular U-type designs U (wnl;) (r is the repetition number of each treatment in our resolvable PBIB design).