Journal of the Korean Statistical Society

  • 제13권2호
  • /
  • Pages.114-120
  • /
  • 1984
  • /
  • 1226-3192(pISSN)
  • /
  • 2005-2863(eISSN)
한국통계학회 (The Korean Statistical Society)
권호 표지

Properties of Detection Matrix and Parallel Flats fraction for $3^n$ Search Design+

  • Um, Jung-Koog (Department of Computer Science, Sogang University, Seoul 121)
  • 발행 : 1984.12.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

A parallel flats fraction for the $3^n$ design is defined as union of flats ${t}At=c_i(mod 3)}, i=1,2,\cdots, f$ and is symbolically written as At=C where A is rank r. The A matrix partitions the effects into n+1 alias sets where $u=(3^{n-r}-1)/2. For each alias set the f flats produce an ACPM from which a detection matrix is constructed. The set of all possible parallel flats fraction C can be partitioned into equivalence classes. In this paper, we develop some properties of a detection matrix and C.

키워드

참고문헌

  1. Polyas theory of counting, Applied Combinatorial Mathematics De Bruijn,N.G.
  2. Representations of permutation groups Kerber,A.
  3. Designs for searching nonnegligible effects, A Survey of Statistical Design and Linear Models, Srivastava,J.N.;J.N.Srivastava(ed,)
  4. Some further theory of search linear models, Contributions to Applied Statistics Srivastava,J.N;Ziegler(ed.);Birkhauser;Basel;Stuttgert
  5. Notes on parallel flats fractions, Srivastava,J.N
  6. Journal of the Korean Statistical Society v.9 no.1 ACPM for the 3ⁿ parallel flats fractional factorial design Um.J.K.
  7. Journal of the Korean Statistical Society v.10 Number of equivalence classes of a parallel flats fraction for the 3ⁿ factorial design. Um.J.K.
  8. Journal of the Korean Statistical Society v.12 no.2 A detection matrix for 3ⁿ search design, Um.J.K.