Rowwise Complementary Designs Shao-Wei Cheng Institute of Statistical Science Academia Sinica Taiwan (based on a joint work with a Ph.D student Chien-Yu.

Slides:



Advertisements
Similar presentations
Representing Relations
Advertisements

1 STA 536 – Nonregular Designs: Construction and Properties Chapter 8: Non-regular Designs: Construction and Properties regular designs: 2 kp and 3 kp.
Introduction to Design of Experiments by Dr Brad Morantz
13 May 2009Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Introduction.
ORTHOGONAL ARRAYS APPLICATION TO PSEUDORANDOM NUMBERS GENERATION AND OPTIMIZATION PROBLEMS A.G.Chefranov †‡, T.A.Mazurova ‡, I.D.Sidorov ‡, T.S.Letia 
Fractional Factorial Designs of Experiments
Experimental Design, Response Surface Analysis, and Optimization
Optimal Analyses for 3  n AB Games in the Worst Case Li-Te Huang and Shun-Shii Lin Dept. of Computer Science & Information Engineering, National Taiwan.
Abhishek K. Shrivastava October 2 nd, 2009 Listing Unique Fractional Factorial Designs – II.
MODIFIED SECOND ORDER SLOPE ROTATABLE DESIGNS USING BIBD Prof. B. Re. Victorbabu Department of Statistics Acharya Nagarjuna University Guntur –
Abhishek K. Shrivastava September 25 th, 2009 Listing Unique Fractional Factorial Designs – I.
C++ Programming: Program Design Including Data Structures, Third Edition Chapter 21: Graphs.
Funding Networks Abdullah Sevincer University of Nevada, Reno Department of Computer Science & Engineering.
Clustering short time series gene expression data Jason Ernst, Gerard J. Nau and Ziv Bar-Joseph BIOINFORMATICS, vol
4.I. Definition 4.II. Geometry of Determinants 4.III. Other Formulas Topics: Cramer’s Rule Speed of Calculating Determinants Projective Geometry Chapter.
On Threshold ARCH Models with Gram- Charlier Density Xuan Zhou and W. K. Li Department of Statistics and Actuarial Science,HKU.
Chapter 8 Two-Level Fractional Factorial Designs
Stat Today: Finish Chapter 3; Start Chapter 4 Assignment 3: 3.14 a, b (do normal qq-plots only),c, 3.16, 3.17 Additional questions: 3.14 b (also.
Time-Based Voronoi Diagram Institute of Information Science Academia Sinica, Taipei, Taiwan D. T. Lee Institute of Information Science Academia Sinica,
Variable-Length Codes: Huffman Codes
Hamming Code Rachel Ah Chuen. Basic concepts Networks must be able to transfer data from one device to another with complete accuracy. Data can be corrupted.
Stats & Linear Models.
1 Statistical Analysis Professor Lynne Stokes Department of Statistical Science Lecture 5QF Introduction to Vector and Matrix Operations Needed for the.
Maximum Likelihood Estimation
Wei Wang Xi’an Jiaotong University Generalized Spectral Characterization of Graphs: Revisited Shanghai Conference on Algebraic Combinatorics (SCAC), Shanghai,
Chapter 3: The Fundamentals: Algorithms, the Integers, and Matrices
Chapter 4 Fractional factorial Experiments at two levels
Properties of Relations In many applications to computer science and applied mathematics, we deal with relations on a set A rather than relations from.
Discrete Mathematical Structures (Counting Principles)
Engineering Statistics ENGR 592 Prepared by: Mariam El-Maghraby Date: 26/05/04 Design of Experiments Plackett-Burman Box-Behnken.
Basic Concepts in Number Theory Background for Random Number Generation 1.For any pair of integers n and m, m  0, there exists a unique pair of integers.
1 The General 2 k-p Fractional Factorial Design 2 k-1 = one-half fraction, 2 k-2 = one-quarter fraction, 2 k-3 = one-eighth fraction, …, 2 k-p = 1/ 2 p.
Chapter 5.6 From DeGroot & Schervish. Uniform Distribution.
Mathematical Induction I Lecture 4: Sep 16. This Lecture Last time we have discussed different proof techniques. This time we will focus on probably the.
DEMA, August 12, A design problem 18 runs Five factors.
International Conference on Design of Experiments and Its Applications July 9-13, 2006, Tianjin, P.R. China Sung Hyun Park, Hyuk Joo Kim and Jae-Il.
NUMBER SYSTEMS TWSSP Wednesday. Wednesday Agenda Finish our work with decimal expansions Define irrational numbers Prove the existence of irrationals.
The American University in Cairo Interdisciplinary Engineering Program ENGR 592: Probability & Statistics 2 k Factorial & Central Composite Designs Presented.
Chapter 5 Graphs  the puzzle of the seven bridge in the Königsberg,  on the Pregel.
CHAPTER 17 O PTIMAL D ESIGN FOR E XPERIMENTAL I NPUTS Organization of chapter in ISSO –Background Motivation Finite sample and asymptotic (continuous)
Bayesian Model Robust and Model Discrimination Designs William Li Operations and Management Science Department University of Minnesota (joint work with.
The parity bits of linear block codes are linear combination of the message. Therefore, we can represent the encoder by a linear system described by matrices.
Digital Communications I: Modulation and Coding Course Term Catharina Logothetis Lecture 9.
Earliness and Tardiness Penalties Chapter 5 Elements of Sequencing and Scheduling by Kenneth R. Baker Byung-Hyun Ha R1.
Minimizing Delay in Shared Pipelines Ori Rottenstreich (Technion, Israel) Joint work with Isaac Keslassy (Technion, Israel) Yoram Revah, Aviran Kadosh.
Applications of Using Quaternary Codes to Nonregular Designs Frederick K.H. Phoa Department of Statistics University of California at Los Angeles 07/12/2006.
TFA: A Tunable Finite Automaton for Regular Expression Matching Author: Yang Xu, Junchen Jiang, Rihua Wei, Yang Song and H. Jonathan Chao Publisher: ACM/IEEE.
Copyright © 2005, SAS Institute Inc. All rights reserved. Statistical Discovery. TM From SAS. 1 Minimum Potential Energy Designs Bradley Jones & Christopher.
Advanced Statistics Factor Analysis, I. Introduction Factor analysis is a statistical technique about the relation between: (a)observed variables (X i.
Stats & Summary. The Woodbury Theorem where the inverses.
 A sequence is a list of objects arranged in a specific order.  A sequence in computer science is known as an array. An array hold objects of the same.
1 Finding a decomposition of a graph T into isomorphic copies of a graph G is a classical problem in Combinatorics. The G-decomposition of T is balanced.
2 k factorial designs l Examine the response for all possible combinations of k factors at two levels l Are carried out as replicated or unreplicated experiments.
A Complete Catalog of Geometrically non-isomorphic OA18 Kenny Ye Albert Einstein College of Medicine June 10, 2006, 南開大學.
Properties of Groups Proposition 1: Let (G,  ) be a group. i.The inverse element of any element of G is unique. Remark: In view of i., we may use the.
1 Introduce to the Count Function and Its Applications Chang-Yun Lin Institute of Statistics, NCHU.
1 Chapter 8 Two-level Fractional Factorial Designs.
Prepared By Meri Dedania (AITS) Discrete Mathematics by Meri Dedania Assistant Professor MCA department Atmiya Institute of Technology & Science Yogidham.
A very brief introduction to Matrix (Section 2.7) Definitions Some properties Basic matrix operations Zero-One (Boolean) matrices.
Department of Mathematics National Institute of Technology, Warangal
Eigenvalues and Eigenvectors
CME Analysis: a New Method for Unraveling Aliased Effects in Two-Level Fractional Factorial Experiments C. F. Jeff Wu (Joint work with Heng Su) School.
Based on slides by Y. Peng University of Maryland
Enumerating Distances Using Spanners of Bounded Degree
Design & Analysis of Experiments 8E 2012 Montgomery
I.4 Polyhedral Theory (NW)
Chapter 10 Counting Methods.
I.4 Polyhedral Theory.
Chapter 10 Counting Methods 2012 Pearson Education, Inc.
14 Design of Experiments with Several Factors CHAPTER OUTLINE
Presentation transcript:

Rowwise Complementary Designs Shao-Wei Cheng Institute of Statistical Science Academia Sinica Taiwan (based on a joint work with a Ph.D student Chien-Yu Peng)

Outline Introduction Columnwise and Rowwise Complementary Design Indicator Function Some Properties Isomorphism Generalized Wordlength Pattern and Resolution Minimum Aberration Orthogonality Moment Aberration Uniformity Generalization Summary

(Columnwise) Complementary Design Hadamard matrix number of factors Tang and Wu (1996), Chen and Hedayat (1996) useful when the number of factors in A is large

Rowwise Complementary Design (RCD) full factorial design with r replicates number of factors RCD r = the maximum number of appearances of design points in design run size

Indicator Function Fontana et al. (2000), Ye (2003), Cheng and Ye (2004), Cheng, Li, and Ye (2004), Tang (2001, J-characteristic) Definition Let D be a full factorial design of s factors and A be a subset of D. The indicator function of A is a function F A ( x ) defined on D such that where r x is the number of appearances of the point x in design A.

Let P be the collection of all subset of {1,2, …, s }, then the indicator function can be uniquely represented by where. cor( x I, x J ) = b I  J /b , where I  J=(I  J)\(I  J) (Note: x i 2 = 1)

 A 1 : (regular) FFD, 3=12 and 6=145 F A 1 = (1/4)(1+x 1 x 2 x 3 )(1+x 1 x 4 x 5 x 6 ) = (1/4)(1 + 1*x 1 x 2 x 3 + 1*x 1 x 4 x 5 x 6 + 1*x 2 x 3 x 4 x 5 x 6 ) I=123=1456=23456  A 2 : non-regular OA F A 2 = (1/4)[1 + (1/2)*x 2 x 4 x 6 + (  1/2)*x 2 x 5 x 6 + (1/2)*x 3 x 4 x 6 + (1/2)*x 3 x 5 x 6 + (1/2)*x 1 x 2 x 4 x 6 + (1/2)*x 1 x 2 x 5 x 6 + (  1/2)*x 1 x 3 x 4 x 6 + (1/2)*x 1 x 3 x 5 x 6 + (1)*x 1 x 2 x 3 x 4 x 5 ] b 0 = fractionaliasing (correlation)word Example wordlength = 4

full factorial design Let be the indicator function of, and be the RCD of, then the indicator function of is r = 1 r1r2r3...rkr1r2r3...rk r.rr.r rrr...rrrr...r r.rr.r general case r = max{r 1, …, r k } r  r 1 r  r 2 r  r 3. r  r k Indicator Function and RCD

Let A be a design the indicator function of its RCD is Example

Property 1: Isomorphism Suppose. If and are isomorphic, then and are also isomorphic.

Property 2: Generalized WLP and Resolution Generalized Wordlength Pattern (GWLP, Deng and Tang, 1999) where  i   (b I /b  ) 2 Generalized resolution (Tang and Deng, 1999) # I = i

Theorem Let and be the indicator functions of A and its RCD, then (i) GWLPs of A and its RCD are and, respectively. (ii) the design with larger run size has large generalized resolution and the difference between their generalized resolutions is.

Let A be a design with four factors. GWLP: (0, 1, 2, 0) its RCD GWLP: (0, 1, 2, 0)/9 Example

Property 3: Orthogonality A is an orthogonal array of strength t if and only if its RCD is an orthogonal array of strength t.

Example Cheng (1995) shows that 4-factor, 12-run designs there is only one OA with strength 2 the OA has 11 distinct runs (one run repeats twice) Q: why no OA with 12 distinct runs? 12 distinct runs  the indicator function of its RCD is 1  F A  its RCD has 4 runs, 4 factors the OA  the indicator function of its RCD is 2  F A  its RCD has 20 runs, 4 factors

The minimum aberration criterion is to sequentially minimize GWLP within a class of designs, called search class. Denote the search class of A by and the search class of its RCD by. example: if, then. Property 4: Minimum aberration

Theorem Design A is the MA design in the search class if and only if its RCD is the MA design in the search class S.

Property 5: Moment aberration Xu (2003), based on coding theory Let be the rowwise complementary design of, then its u- th power moment is where and are Stirling numbers of second kind. In particular, and.

Property 6: Uniformity Fang and his colleagues Symmetric L 2 -discrepancy ( SL 2 ) Centered L 2 -discrepancy ( CL 2 ) Wrap-around L 2 -discrepancy ( WL 2 )

Theorem Let A be an n  s two-level factorial design, then the discrepancies of its RCD can be expressed in terms of the discrepancies and GWLP of A as follows

Type I designs full factorial design number of factors Generalization Hadamard matrix

Type II designs full factorial design number of factors Hadamard matrix

Blocked factorial designs blocked indicator function (Cheng, Li, and Ye, 2004) If is a blocked indicator function which has q block factors (i.e., blocks and block size = runs), then the can be regarded as a blocked indicator function with blocks and block size = runs.

Summary propose RCD, useful when run size is large indicator function is a useful framework for studying RCD various relations between a design and its RCD are explored methods that combine the techniques of CCD and RCD can generate more designs