Journal of the Korean Statistical Society

  • 제9권2호
  • /
  • Pages.126-134
  • /
  • 1980
  • /
  • 1226-3192(pISSN)
  • /
  • 2005-2863(eISSN)
한국통계학회 (The Korean Statistical Society)
권호 표지

On the Srivastava's Theorem for the search design.

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

초록

In this paper, Srivastava's Theorem for the search design is considered, with additional assumptions, to the $3^n$ parallel flats fractions. It is also expressed in terms of ACPM.

키워드

참고문헌

  1. Communications in Statistics v.A8 no.9 Resolution IV fractional factorial designs for the general symmetric factorial Anderson,D.A.;A.M.Thomas
  2. Unpublished Ph. D. thesis, University of Wyoming Parallel flats fractions for the $3^n$ factorial Mardekian,J.
  3. A Survey of Statistical Design and Linear Models Designs for searching nonnegligible effects Srivastava,J.N.;J.N.Srivastava(ed.)
  4. Contribution to Applied Statistics Some further theory of search linear models Srivastava,J.N.;W.J.Ziegler(ed.)
  5. Unpublished Ph. D. thesis, University of Wyoming Parallel Flats Search Designs for the $3^n$ Factorial Um.J.K.
  6. The Journal of the Korean Statistical Society v.IX no.1 Alias Component Permutation Matrices for the $3^n$ Parallel Fractional Factorial Design Srivastava,J.N.