Binary Algorithms For Computing Word-Length Patterns In Two-Level Fractional Factorial Experiments  

Oleh:

Day, Jen-der ; Tsai, Hsien-Tang ; Lo, Shih-Hsiung

Jenis: Article from Proceeding
Dalam koleksi: Asian Network for Quality (ANQ) Congress 2011, Ho Chi Minh City, Vietnam, 27-30 September 2011, page 1-6.
Topik: Geometrical Designs; Word-Length Pattern; Number Representation
Fulltext: TW23.pdf (92.78KB)

Isi artikel

Two-level fractional factorial experiments have been used extensively in many areas such as quality engineering, agriculture, pharmaceutical chemistry, management etc., geometrical designs proposed by Plackett & Burman (1946) are useful tools for planning such experiments. Based on the number representation method proposed by Tsai (1999), two binary algorithms are proposed for computing the completed word-length pattern (WLP) of a geometrical design efficiently. Two cases are considered: (1) for those designs all factors are assigned to all basic columns and some generated columns; (2) for those designs all factors are assigned to arbitrary columns. The use of the proposed algorithms can help to check the equivalent designs with the same WLP’s and to serve as useful tools for a larger scale problem.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali