Abstract. Designs for variety trials with very low replication. How do we allow for variation between the plots? Variety Testing

Size: px
Start display at page:

Download "Abstract. Designs for variety trials with very low replication. How do we allow for variation between the plots? Variety Testing"

Transcription

1 Abstract Designs for variety trials with very low replication R A Bailey University of St Andrews QMUL (emerita) TU Dortmund, June 05 In the early stages of testing new varieties, it is common that there are only small quantities of seed of many new varieties In the UK (and some other countries with centuries of agriculture on the same land) variation within a field can be well represented by a division into blocks Even when that is not the case, subsequent phases (such as testing for milling quality, or evaluation in a laboratory) have natural blocks, such as days or runs of a machine I will discuss how to arrange the varieties in a block design when the average replication is less than two /50 /50 Variety Testing In breeding trials of new varieties, typically there is very little seed of each of the new varieties Traditionally, an experiment has one plot for each new variety and several plots for a well-established control : New Control Total for example, In the last years, Cullis and colleagues in Australia (and independently Bueno and Gilmour) have suggested replacing many occurrences of the the control by double replicates of a small number of new varieties: New New Control Total for example, This is an improvement if there are no blocks How do we allow for variation between the plots? on any given field agricultural operations, at least for centuries, have followed one of two directions, which are usually those of the rows and columns; consequently streaks of fertility, weed infestation, etc, do, in fact, occur predominantly in those two directions R A Fisher, letter to H Jeffreys, 30 May 938 (selected correspondence edited by J H Bennett) (This assumption is dubious for field trials in Australia) If field operations have been primarily in one direction for a long time, then it is reasonable to divide the fields into blocks whose length runs along that direction 3/50 4/50 Blocking in the second phase: an example The milling phase of a wheat variety trial has 4 varieties to be compared Only 0 can be milled in any one day The trial can take place over 8 days, so there are 8 blocks of size 0 There are only 80 4 = 56 experimental units spare for replication How should these be allocated? 8 blocks units 8 units controls varieties in every block 0 single replication Two possible designs for 4 varieties in 8 blocks of 0 8 blocks 8 blocks units 8 units controls varieties in every block 0 single replication 4 units 6 units 56 varieties 68 varieties all replicated twice all single replication 5/50 6/50

2 The problem Linear model, estimation and variance We measure the response Y on each unit in each block If that unit has variety i and block D, then we assume that We are given b blocks of size k We are given v varieties Assume that average replication = r = bk v How should we allocate varieties to blocks? What makes a block design good? Y = τ i + β D + random noise, where the random noise is independently normally distributed with zero mean and constant variance σ We want to estimate all the simple differences τ i τ j Put V ij σ = variance of the best linear unbiased estimator for τ i τ j We want all the V ij to be small 7/50 8/50 Optimality An example with 5n + 0 varieties in 5 blocks of size 4 + n Apart from the constant multiple σ, Put V ij = variance of the BLUE for τ i τ j v V T = v i= j=i+ V ij = sum of variances of variety differences Definition For given values of b (the number of blocks), k (the size of the blocks) and v (the number of varieties), a block design is A-optimal if it minimizes V T 3 4 A A n B B n C C n D D n E E n How do we calculate pairwise variances in a generic design? 9/50 0/50 Levi graph Levi graph: example 3 4 A A n B B n The Levi graph of the block design has C C n one vertex for each variety D D n one vertex for each block E E n one edge for each plot (aka experimental unit), so that the edge for plot ω joins the vertex for the variety on ω to the vertex for the block containing ω /50 B B n A n 5 C A 7 6 C n E n D 0 E D n /50

3 Electrical networks We can consider the Levi graph as an electrical network with a -ohm resistance in each edge Connect a -volt battery between vertices i and j Current flows in the network, according to these rules Ohm s Law: In every edge, voltage drop = current resistance = current Kirchhoff s Voltage Law: The total voltage drop from one vertex to any other vertex is the same whichever path we take from one to the other 3 Kirchhoff s Current Law: At every vertex which is not connected to the battery, the total current coming in is equal to the total current going out Find the total current I from i to j, then use Ohm s Law to define the effective resistance R ij between i and j as /I 3/50 Electrical networks: variance Reminder: V ij = variance of BLUE of τ i τ j for varieties i and j Theorem If R ij is the effective resistance between variety vertices i and j in the Levi graph then R ij = V ij Put: V CD = variance of BLUE of β C β D for blocks C and D, V ic = variance of BLUE of τ i + β C for variety i and block C Theorem If R CD and R ic are the effective resistances between vertices C and D, and between i and C respectively, in the Levi graph then R CD = V CD and R ic = V ic Effective resistances are easy to calculate without matrix inversion if the graph is sparse 4/50 Pairwise resistance (remove A,, E n to get core subdesign Γ) A n A Resistance(A, A ) = B B n 5 C 7 6 C n E n D 0 E D n Resistance(A, B ) = + Resistance(block A, block B) in Γ Resistance(A, 8) = + Resistance(block A, 8) in Γ Resistance(, 8) = Resistance(, 8) in Γ Silly names just for this talk Definition Call a variety a a drone if it has replication ; a queen-bee if it occurs in every block; a worker otherwise Is it better to put all the drones into one block (or a few blocks), or are they better distributed equally among all the blocks? 5/50 6/50 How should we distribute the drones? From now on, distribute drones as equally as possible n drones A rest of graph B If we move all the drones in block B into block A then we reduce nm variances from + R AB to m drones Then we have to remove m non-drones from block A, and this increases the resistance between A and the rest of the graph This increases the variances between these n + m drones and the remaining v n m varieties This more than compensates for the original reduction in variance b blocks k plots v varieties core subdesign Γ n plots bn drones all single replication whole design Whole design has v treatments in b blocks of size k = k + n; the core subdesign Γ has v core varieties in b blocks of size k, where v = v bn (The core varieties may include up to b extra drones) 7/50 8/50

4 Sum of the pairwise variances Sum of variances in whole design if Γ is equi-replicate Theorem (cf Herzberg and Jarrett, 007) If there are n drones in each block of, and the core subdesign Γ has v varieties in b blocks of size k then the sum of the variances of variety differences in where = V T ( ) = bn(bn + v ) + V T + nv BT + n V B, V T = the sum of the variances of variety differences in Γ V B = the sum of the variances of block differences in Γ V BT = the sum of the variances of sums of one treatment and one block in Γ 9/50 V T ( ) = bn(bn + v ) + V T + nv BT + n V B V T = the sum of the variances of variety differences in Γ V B = the sum of the variances of block differences in Γ V BT = the sum of the variances of sums of one treatment and one block in Γ If Γ is equi-replicate with replication r then k b V B b = r v V T v ; V BT = b v V T + v k (b v ), and so V B and V BT are both increasing functions of V T Consequence For a given choice of k, use the core subdesign Γ which minimizes V T 0/50 Sum of variances in whole design if there are many drones An example of this non-intuitive result V T ( ) = bn(bn + v ) + V T + nv BT + n V B V T = the sum of the variances of variety differences in Γ V B = the sum of the variances of block differences in Γ V BT = the sum of the variances of sums of one treatment and one block in Γ Consequence If n is large, we need to focus on reducing V B, so it may be best to increase the number of drones and decrease k (the size of blocks in the core subdesign Γ), so that average replication within Γ is more than If there are 4( + n) varieties in 4 blocks of size 4 + n, the design on the left is A-better than the design on the right if and only if n < n drones 5 6 n drones n drones n drones 3 n + drones 4 n + drones 3 4 n + drones 3 4 n + drones /50 /50 A definite result Theorem (Duals of BIBDs cannot be beaten) Suppose that we are given b blocks of size k, and v varieties For i =,, let design i have core subdesign Γ i with block size k i If Γ is the dual of a balanced incomplete block design and k > k then is worse than on the A criterion, no matter how big v is Design Core subdesign Γ Γ block size in subdesign k > k property of core subdesign dual of BIBD arbitrary then is A-better than An example of the good result If there are 7(3 + n) varieties in 7 blocks of size 6 + n, the design on the left is A-better than the design on the right, for all values of n n drones n drones n drones n drones n drones n drones n drones n + drones 5 7 n + drones 3 6 n + drones n + drones n + drones n + drones n + drones 3/50 4/50

5 Another example of the good result If there are 4n + 6 varieties in 4 blocks of size 3 + n, the design on the left is A-better than the design on the right, for all values of n 3 n drones 4 5 n drones 4 6 n drones n drones n + drones n + drones n + drones n + drones Strategy Given b, v and k, how do we find an A-optimal design for v varieties in b blocks of size k when bk Average replication v b(k ) +? Case b = or b = 3 (very small b) Maximum v for estimability Case v = b(k ) + or v = b(k ) (very large v) Case 3 k 0 b Case 4 < k 0 < b (small k 0 but not Case ) v bk k 0 = k = biggest space per block for non-drones b 5/50 6/50 Case Only blocks, of size k Morgan and Jin (007) showed that the A-optimal designs are those with n drones and q queen bees, where n = n 0 = v k and q = k = k 0 = k n 0 = k v Case continued 3 blocks of size k Using the result about drone-distribution and the nice theorem about duals of BIBDs, RAB has shown that the A-optimal designs are as follows when v is divisible by 3 (and presumably small changes deal with the other cases) There are 3w workers and 3n drones, where 3w = 3k v and n = n 0 = k w and k = k 0 = w 3 4 q A A A 3 A n 3 4 q B B B 3 B n queens drones 4 5 3w 3w A A A 3 A n w 3w B B B 3 B n w 3w C C C 3 C n w copies of design using all pairs from 3 drones 7/50 8/50 Case v = b(k ) + Case continued v = b(k ) This is the maximum number of varieties that can be tested in b blocks of size k with all comparisons estimable Mandal, Shah and Sinha (99), for k =, Dean and co-authors, and Bailey and Cameron (03), for general block size, showed that, no matter how many blocks there are, the A-optimal design has the following form The A-optimal designs were found for all cases by Krafft and Schaefer (997) small k and b increase k if b 5 then increase b A 3 B A A 3 B B A A B B 3 4 C 3 C C C C C 3 A A A 3 A k 4 5 D D D D 3 D D D 3 B B B 3 B k 5 6 E E E E 3 E E E 3 C C C 3 C k D D D 3 D k E E E 3 E k 6 F chain F F F 3 smaller chain F F F 3 G G G 3 queen queen v drones 9/50 Youden and Connor (953) had recommended chain designs 30/50

6 Case v = b(k ) revisited Theorem Consider a design with b blocks of size For s b, let Γ s be the design consisting of a chain of length s, one of whose varieties is in all blocks outside the chain, while all other varieties are drones Then Consequence V B (Γ s ) = 6 [ s3 + bs (6b 4)s + 6b 5b] If b = 3 then V B (Γ ) > V B (Γ 3 ) so there is no need for queens If b = 4 then V B (Γ ) = V B (Γ 4 ) < V B (Γ 3 ), but V T (Γ ) > V T (Γ 4 ) and V BT (Γ ) > V BT (Γ 4 ), so do not use Γ or Γ 3 (no need for queens) 3 If b 5 then V B (Γ ) < V B (Γ 3 ) < < V B (Γ b ), so we need to use smaller chains as v gets larger Case 3 k k 0 b For simplicity, assume that b divides v, so that Then n 0 = v bk b = minimum number of drones per block b(k b + ) v bk b(b ) Let Γ 0 be the design for b(b )/ varieties replicated twice in b blocks of size b in such a way that there is one variety in common to each pair of blocks This is A-optimal for these numbers 3/50 3/50 Case 3 continued k 0 b n 0 = minimal number of drones per block Construction Method put n 0 drones in each block; put in one copy of Γ 0 ; 3 put in as many further copies of Γ 0 as possible (if this uses up all the space, then the nice theorem shows that this is A-optimal); 4 in any remaining space, use a good design for workers with replication (so long as there is at least one copy of Γ 0, it probably doesn t make much difference which one is used) Case 3 Example: b = 8 and k = 5 (so 60 v 9) 60 varieties: all workers (n 0 = 0) one copy of Γ 0 another copy of Γ 0 33/50 34/50 Case 3 Example: b = 8 and k = 5 (so 60 v 9) 76 varieties: 44 workers, 3 drones (n 0 = 4) Case 3 Example: b = 8 and k = 5 (so 60 v 9) 9 varieties: 8 workers, 64 drones (n 0 = 8) A A A 3 A B B B 3 B C C C 3 C D D D 3 D E E E 3 E F F F 3 F G G G 3 G H H H 3 H 4 Γ 0 6 workers drones replication A A A 3 A 4 A 5 A 6 A 7 A B B B 3 B 4 B 5 B 6 B 7 B C C C 3 C 4 C 5 C 6 C 7 C D D D 3 D 4 D 5 D 6 D 7 D E E E 3 E 4 E 5 E 6 E 7 E F F F 3 F 4 F 5 F 6 F 7 F G G G 3 G 4 G 5 G 6 G 7 G H H H 3 H 4 H 5 H 6 H 7 H 8 Γ 0 drones 35/50 36/50

7 Case 3 A bad example: b = 4 and k 0 = 4 Case 4 < k 0 < b v = 4n + 8 and k = 4 + n My strategy gives which is worse than For various values of k i k 0, find the best core subdesign Γ i for v i varieties in b blocks of size k i (For equi-replicate core subdesigns, it is often easier to find the best dual design, which is obtained by interchanging the roles of blocks and varieties) 3 7 A A n B B n C C n D D n Γ 0 drones 3 A A n+ 4 B B n+ 3 4 C C n+ 3 4 D D n+ k = 3 drones rep 3 when n 50 37/50 V T (Γ i ) = the sum of the variances of variety differences in Γ i V B (Γ i ) = the sum of the variances of block differences in Γ i V BT (Γ i ) = the sum of the variances of sums of one treatment and one block in Γ i If there are n i drones in each block then, in the whole design, V T ( ) = bn i (bn i + v i ) + V T(Γ i ) + n i V BT (Γ i ) + n i V B(Γ i ) Use this formula to find the core subdesign which gives the smallest V T ( ) As the number of varieties increases, it becomes more important to choose Γ i with a small value of V B (Γ i ) 38/50 Case 4 continued k 0 = 4 < b, V B (Γ i ) b(b )/ Best design for b blocks known to RAB Γ Γ Γ 3 Γ 4 k i queens, queens, b workers b workers both boring workers (rep ) rep 3 rep b = b = b = b = 9 09 b = 0 b = b = 098 b = 3 07 b = 4 b = As v increases, Γ 3 becomes better than Γ 4 If b 4, then, as v increases, Γ and Γ become better than Γ 3 39/50 Case 4 continued < k 0 < b when b = 8: k 0 = 6 k = k 0 = 6, and 4 varieties, all workers, all replicated twice (One worker for each pair of blocks except for {A, B}, {C, D}, {E, F} and {G, H}) 40/50 Case 4 continued k = 5 and k = 6 when b = 8: k 0 = 5 Case 4 continued k = 5 and k = 6 when b = 8: k 0 = 4 k = 5 k = 6 0 varieties: 8 varieties: 0 workers, no drones 0 workers, 8 drones k = 5 k = 6 4 varieties: 3 varieties: 6 workers, 8 drones 8 workers, 4 drones A 3 4 A 4 A A A B B 3 5 B B B C 9 0 C C C C D D D D D E E E E E F F 6 7 F F F G G 7 8 G G G H 4/ H k = 4 rep = 8 3 H H H 3 k = 3 rep 3 4/50

8 Case 4 continued k = 5 and k = 6 when b = 8: k 0 = 3 Health Warning k = 5 k = 6 8 varieties: 36 varieties: workers, 6 drones workers, 4 drones 3 A A 4 5 B B C C D D 8 0 E E 3 A A A B B B C C C D D D E E E 3 The overall message is that there can be phase changes as the spare capacity for replication (bk v) decreases Therefore it is necessary to compare core subdesigns Γ i with different block size k i Although this overall message is correct, no one has checked the arithmetic in the examples presented, so individual cases may be wrong 5 0 F F 7 G G 3 9 H H 5 0 F F F 3 7 G G G H H H 3 43/50 44/50 Warning for specialists in optimality References: more equal replication The results given are for A-optimality A design is MV-optimal if it minimizes the value of the maximal V ij If v bk k then it is possible to put all the drones in a single block, and the MV-optimal design may have this form A design is D-optimal if it minimizes the volume of the confidence ellipsoid for the vector of fitted values (τ, τ, ) under the assumption of independent identically distributed normal errors The D-optimal designs have core subdesigns with the largest possible value of k (and so the smallest possible number of drones), no matter how large the number of varieties J S S Bueno Filho and S G Gilmour: Planning incomplete block experiments when treatments are genetically related Biometrics, 59, (003), B R Cullis, A B Smith and N E Coombes: On the design of early generation variety trials with correlated data Journal of Agricultural, Biological and Environmental Statistics,, (006), A B Smith, P Lim and B R Cullis: The design and analysis of multi-phase plant breeding experiments Journal of Agricultural Science, 44, (006), /50 46/50 References: Levi graph F W Levi: Finite Geometrical Systems, University of Calcutta, Calcutta, 94 iii + 5 pp N Gaffke: Optimale Versuchsplanung für linear Zwei-Faktor Modelle PhD thesis, Rheinisch-Westfälische Technische Hochschule, Aachen, N Gaffke: D-optimal block designs with at most six varieties, Journal of Statistical Planning and Inference, 6 (98), T Tjur: Block designs and electrical networks, Annals of Statistics, 9 (99), R A Bailey and P J Cameron: Using graphs to find the best block designs In Topics in Structural Graph Theory (eds L W Beineke and R J Wilson), Cambridge University Press, Cambridge, 03, pp 8 37 References: core subdesigns W J Youden and W S Connor: The chain block design Biometrics, 9, (953), 7 40 A M Herzberg and D F Andrews: The robustness of chain block designs and coat-of-mail designs Communications in Statistics Theory and Methods, 7 (978), A M Herzberg and R G Jarrett: A-optimal block designs with additional singly replicated treatments Journal of Applied Statistics, 34 (007), /50 48/50

9 References: few blocks References: (nearly) maximal number of varieties J P Morgan and B Jin: Optimal experimentation in two blocks Journal of Statistical Theory and Practice,, (007), N K Mandal, K R Shah and B K Sinha: Uncertain resources and optimal designs: problems and perspectives Calcutta Statistical Association Bulletin, 40, (99), 67 8 O Krafft and M Schaefer: A-optimal connected block designs with nearly minimal number of observations Journal of Statistical Planning and Inference, 65, (997), /50 50/50

Abstract. Using graphs to find optimal block designs. Problem 1: Factorial design. Conference on Design of Experiments, Tianjin, June 2006

Abstract. Using graphs to find optimal block designs. Problem 1: Factorial design. Conference on Design of Experiments, Tianjin, June 2006 Abstract Ching-Shui Cheng was one of the pioneers of using graph theory to prove results about optimal incomplete-block designs. There are actually two graphs associated with an incomplete-block design,

More information

Combinatorics of optimal designs

Combinatorics of optimal designs Combinatorics of optimal designs R A Bailey and Peter J Cameron pjcameron@qmulacuk British Combinatorial Conference, St Andrews, July 2009 Mathematicians and statisticians There is a very famous joke about

More information

Abstract. A substitute for the non-existent affine plane of order 6. Chapter 1. Outline. Square lattice designs for n 2 treatments in rn blocks of n

Abstract. A substitute for the non-existent affine plane of order 6. Chapter 1. Outline. Square lattice designs for n 2 treatments in rn blocks of n A substitute for the non-existent affine plane of order R. A. Bailey University of St Andrews QMUL (emerita) Algebra and Combinatorics seminar, University of St Andrews, 1 February 018 Joint work with

More information

Abstract. Some history of Latin squares in experiments. A Latin square of order 8. What is a Latin square? A Latin square of order 6

Abstract. Some history of Latin squares in experiments. A Latin square of order 8. What is a Latin square? A Latin square of order 6 Abstract Some history of Latin squares in experiments R. A. ailey University of St Andrews QMUL (emerita) In the s, R. A. isher recommended Latin squares for crop experiments. However, there is evidence

More information

Blocks are formed by grouping EUs in what way? How are experimental units randomized to treatments?

Blocks are formed by grouping EUs in what way? How are experimental units randomized to treatments? VI. Incomplete Block Designs A. Introduction What is the purpose of block designs? Blocks are formed by grouping EUs in what way? How are experimental units randomized to treatments? 550 What if we have

More information

From Rothamsted to Northwick Park: designing experiments to avoid bias and reduce variance

From Rothamsted to Northwick Park: designing experiments to avoid bias and reduce variance 1/53 From Rothamsted to Northwick Park: designing experiments to avoid bias and reduce variance R A Bailey rabailey@qmulacuk North Eastern local group of the Royal Statistical Society, 29 March 2012 A

More information

Use of α-resolvable designs in the construction of two-factor experiments of split-plot type

Use of α-resolvable designs in the construction of two-factor experiments of split-plot type Biometrical Letters Vol. 53 206, No. 2, 05-8 DOI: 0.55/bile-206-0008 Use of α-resolvable designs in the construction of two-factor experiments of split-plot type Kazuhiro Ozawa, Shinji Kuriki 2, Stanisław

More information

BALANCED INCOMPLETE BLOCK DESIGNS

BALANCED INCOMPLETE BLOCK DESIGNS BALANCED INCOMPLETE BLOCK DESIGNS V.K. Sharma I.A.S.R.I., Library Avenue, New Delhi -110012. 1. Introduction In Incomplete block designs, as their name implies, the block size is less than the number of

More information

Construction of Partially Balanced Incomplete Block Designs

Construction of Partially Balanced Incomplete Block Designs International Journal of Statistics and Systems ISS 0973-675 Volume, umber (06), pp. 67-76 Research India Publications http://www.ripublication.com Construction of Partially Balanced Incomplete Block Designs

More information

EE292: Fundamentals of ECE

EE292: Fundamentals of ECE EE292: Fundamentals of ECE Fall 2012 TTh 10:00-11:15 SEB 1242 Lecture 4 120906 http://www.ee.unlv.edu/~b1morris/ee292/ 2 Outline Review Voltage Divider Current Divider Node-Voltage Analysis 3 Network Analysis

More information

COVARIANCE ANALYSIS. Rajender Parsad and V.K. Gupta I.A.S.R.I., Library Avenue, New Delhi

COVARIANCE ANALYSIS. Rajender Parsad and V.K. Gupta I.A.S.R.I., Library Avenue, New Delhi COVARIANCE ANALYSIS Rajender Parsad and V.K. Gupta I.A.S.R.I., Library Avenue, New Delhi - 110 012 1. Introduction It is well known that in designed experiments the ability to detect existing differences

More information

2015 EdExcel A-Level Physics Topic 3. Charge and current

2015 EdExcel A-Level Physics Topic 3. Charge and current 2015 EdExcel A-Level Physics Topic 3 Charge and current 9/17/2018 Electric Charge Atoms consists of Negatively-charged electrons and Positively charged protons. Atoms have the same number of protons and

More information

LINEAR SPACES. Define a linear space to be a near linear space in which any two points are on a line.

LINEAR SPACES. Define a linear space to be a near linear space in which any two points are on a line. LINEAR SPACES Define a linear space to be a near linear space in which any two points are on a line. A linear space is an incidence structure I = (P, L) such that Axiom LS1: any line is incident with at

More information

Areal data. Infant mortality, Auckland NZ districts. Number of plant species in 20cm x 20 cm patches of alpine tundra. Wheat yield

Areal data. Infant mortality, Auckland NZ districts. Number of plant species in 20cm x 20 cm patches of alpine tundra. Wheat yield Areal data Reminder about types of data Geostatistical data: Z(s) exists everyhere, varies continuously Can accommodate sudden changes by a model for the mean E.g., soil ph, two soil types with different

More information

Lecture: Modeling graphs with electrical networks

Lecture: Modeling graphs with electrical networks Stat260/CS294: Spectral Graph Methods Lecture 16-03/17/2015 Lecture: Modeling graphs with electrical networks Lecturer: Michael Mahoney Scribe: Michael Mahoney Warning: these notes are still very rough.

More information

CONSTRUCTION OF REGULAR GRAPH DESIGNS AND ITS GRAPHICAL REPRESENTATION

CONSTRUCTION OF REGULAR GRAPH DESIGNS AND ITS GRAPHICAL REPRESENTATION CHAPTER 3 CONSTRUCTION OF REGULAR GRAPH DESIGNS AND ITS GRAPHICAL REPRESENTATION 3.1 Introduction 3.2 Historical Review 3.3 Preliminary Results 3.4 Construction of RG Designs using a BIB design with b

More information

Lecture 10. Factorial experiments (2-way ANOVA etc)

Lecture 10. Factorial experiments (2-way ANOVA etc) Lecture 10. Factorial experiments (2-way ANOVA etc) Jesper Rydén Matematiska institutionen, Uppsala universitet jesper@math.uu.se Regression and Analysis of Variance autumn 2014 A factorial experiment

More information

Topic 4: Orthogonal Contrasts

Topic 4: Orthogonal Contrasts Topic 4: Orthogonal Contrasts ANOVA is a useful and powerful tool to compare several treatment means. In comparing t treatments, the null hypothesis tested is that the t true means are all equal (H 0 :

More information

Combinatorial Designs: Balanced Incomplete Block Designs

Combinatorial Designs: Balanced Incomplete Block Designs Combinatorial Designs: Balanced Incomplete Block Designs Designs The theory of design of experiments came into being largely through the work of R.A.Fisher and F.Yates in the early 1930's. They were motivated

More information

NUMERICAL MATHEMATICS & COMPUTING 7th Edition

NUMERICAL MATHEMATICS & COMPUTING 7th Edition NUMERICAL MATHEMATICS & COMPUTING 7th Edition Ward Cheney/David Kincaid c UT Austin Engage Learning: Thomson-Brooks/Cole wwwengagecom wwwmautexasedu/cna/nmc6 October 16, 2011 Ward Cheney/David Kincaid

More information

Stanton Graph Decompositions

Stanton Graph Decompositions Stanton Graph Decompositions Hau Chan and Dinesh G. Sarvate Abstract. Stanton graphs S k (in honor of professor Ralph G. Stanton) are defined, and a new graph decomposition problem for Stanton graphs is

More information

Introduction to Design of Experiments

Introduction to Design of Experiments Introduction to Design of Experiments Jean-Marc Vincent and Arnaud Legrand Laboratory ID-IMAG MESCAL Project Universities of Grenoble {Jean-Marc.Vincent,Arnaud.Legrand}@imag.fr November 20, 2011 J.-M.

More information

Stochastic Design Criteria in Linear Models

Stochastic Design Criteria in Linear Models AUSTRIAN JOURNAL OF STATISTICS Volume 34 (2005), Number 2, 211 223 Stochastic Design Criteria in Linear Models Alexander Zaigraev N. Copernicus University, Toruń, Poland Abstract: Within the framework

More information

Kernel Methods. Barnabás Póczos

Kernel Methods. Barnabás Póczos Kernel Methods Barnabás Póczos Outline Quick Introduction Feature space Perceptron in the feature space Kernels Mercer s theorem Finite domain Arbitrary domain Kernel families Constructing new kernels

More information

2.3 Estimating PDFs and PDF Parameters

2.3 Estimating PDFs and PDF Parameters .3 Estimating PDFs and PDF Parameters estimating means - discrete and continuous estimating variance using a known mean estimating variance with an estimated mean estimating a discrete pdf estimating a

More information

CHAPTER-V GENOTYPE-ENVIRONMENT INTERACTION: ANALYSIS FOR NEIGHBOUR EFFECTS

CHAPTER-V GENOTYPE-ENVIRONMENT INTERACTION: ANALYSIS FOR NEIGHBOUR EFFECTS CHAPTER-V GENOTYPE-ENVIRONMENT INTERACTION: ANALYSIS FOR NEIGHBOUR EFFECTS 5.1 Introduction Designs of experiments deal with planning, conducting, analyzing and interpreting tests to evaluate the factors

More information

Laplacian eigenvalues and optimality: II. The Laplacian of a graph. R. A. Bailey and Peter Cameron

Laplacian eigenvalues and optimality: II. The Laplacian of a graph. R. A. Bailey and Peter Cameron Laplacian eigenvalues and optimality: II. The Laplacian of a graph R. A. Bailey and Peter Cameron London Taught Course Centre, June 2012 The Laplacian of a graph This lecture will be about the Laplacian

More information

DEALING WITH MULTIVARIATE OUTCOMES IN STUDIES FOR CAUSAL EFFECTS

DEALING WITH MULTIVARIATE OUTCOMES IN STUDIES FOR CAUSAL EFFECTS DEALING WITH MULTIVARIATE OUTCOMES IN STUDIES FOR CAUSAL EFFECTS Donald B. Rubin Harvard University 1 Oxford Street, 7th Floor Cambridge, MA 02138 USA Tel: 617-495-5496; Fax: 617-496-8057 email: rubin@stat.harvard.edu

More information

Construction of designs for twophase experiments with Tabu search

Construction of designs for twophase experiments with Tabu search Construction of designs for twophase experiments with Tabu search Nha Vo-Thanh In collaboration with Professor Hans-Peter Piepho University of Hohenheim Common bean experiment A breeding program by CIAT

More information

Group Divisible Designs With Two Groups and Block Size Five With Fixed Block Configuration

Group Divisible Designs With Two Groups and Block Size Five With Fixed Block Configuration Group Divisible Designs With Two Groups and Block Size Five With Fixed Block Configuration Spencer P. Hurd Nutan Mishra and Dinesh G. Sarvate Abstract. We present constructions and results about GDDs with

More information

Design Theory Notes 1:

Design Theory Notes 1: ----------------------------------------------------------------------------------------------- Math 6023 Topics in Discrete Math: Design and Graph Theory Fall 2007 ------------------------------------------------------------------------------------------------

More information

Randomized Complete Block Designs

Randomized Complete Block Designs Randomized Complete Block Designs David Allen University of Kentucky February 23, 2016 1 Randomized Complete Block Design There are many situations where it is impossible to use a completely randomized

More information

A General Criterion for Factorial Designs Under Model Uncertainty

A General Criterion for Factorial Designs Under Model Uncertainty A General Criterion for Factorial Designs Under Model Uncertainty Steven Gilmour Queen Mary University of London http://www.maths.qmul.ac.uk/ sgg and Pi-Wen Tsai National Taiwan Normal University Fall

More information

Lab 3: Model based Position Control of a Cart

Lab 3: Model based Position Control of a Cart I. Objective Lab 3: Model based Position Control of a Cart The goal of this lab is to help understand the methodology to design a controller using the given plant dynamics. Specifically, we would do position

More information

Exact optimal designs for weighted least squares analysis with correlated errors

Exact optimal designs for weighted least squares analysis with correlated errors Exact optimal designs for weighted least squares analysis with correlated errors Holger Dette Ruhr-Universität Bochum Fakultät für Mathematik 44780 Bochum, Germany e-mail: holger.dette@rub.de Joachim Kunert

More information

COT 6936: Topics in Algorithms! Giri Narasimhan. ECS 254A / EC 2443; Phone: x3748

COT 6936: Topics in Algorithms! Giri Narasimhan. ECS 254A / EC 2443; Phone: x3748 COT 6936: Topics in Algorithms! Giri Narasimhan ECS 254A / EC 2443; Phone: x3748 giri@cs.fiu.edu https://moodle.cis.fiu.edu/v2.1/course/view.php?id=612 Gaussian Elimination! Solving a system of simultaneous

More information

A stained glass window in Caius Latin squares

A stained glass window in Caius Latin squares stained glass window in aius Latin squares R.. ailey r.a.bailey@qmul.ac.uk G.. Steward lecture, Gonville and aius ollege, ambridge photograph by J. P. Morgan March 0 /5 nd on the opposite side of the hall

More information

Clicker Session Currents, DC Circuits

Clicker Session Currents, DC Circuits Clicker Session Currents, DC Circuits Wires A wire of resistance R is stretched uniformly (keeping its volume constant) until it is twice its original length. What happens to the resistance? 1) it decreases

More information

Abstract. The design key in single- and multi-phase experiments. Introduction of the design key. H. Desmond Patterson

Abstract. The design key in single- and multi-phase experiments. Introduction of the design key. H. Desmond Patterson The design key in single- and multi-phase experiments R. A. Bailey University of St Andrews QMUL (emerita) Biometrics by the Harbour: Meeting of the Australasian Region of the International Biometric Society,

More information

Module 1. Probability

Module 1. Probability Module 1 Probability 1. Introduction In our daily life we come across many processes whose nature cannot be predicted in advance. Such processes are referred to as random processes. The only way to derive

More information

Capacitance, Resistance, DC Circuits

Capacitance, Resistance, DC Circuits This test covers capacitance, electrical current, resistance, emf, electrical power, Ohm s Law, Kirchhoff s Rules, and RC Circuits, with some problems requiring a knowledge of basic calculus. Part I. Multiple

More information

Hadamard and conference matrices

Hadamard and conference matrices Hadamard and conference matrices Peter J. Cameron University of St Andrews & Queen Mary University of London Mathematics Study Group with input from Rosemary Bailey, Katarzyna Filipiak, Joachim Kunert,

More information

Evolutionary Models. Evolutionary Models

Evolutionary Models. Evolutionary Models Edit Operators In standard pairwise alignment, what are the allowed edit operators that transform one sequence into the other? Describe how each of these edit operations are represented on a sequence alignment

More information

Circuit Analysis and Ohm s Law

Circuit Analysis and Ohm s Law Study Unit Circuit Analysis and Ohm s Law By Robert Cecci Circuit analysis is one of the fundamental jobs of an electrician or electronics technician With the knowledge of how voltage, current, and resistance

More information

The Quest of the Perfect Square

The Quest of the Perfect Square Richard Anstee UBC, Vancouver UBC Math Circle, January 26, 2015 Introduction This talk is loosely based on a 1965 paper of W.T. Tutte of the same title. Bill Tutte was first described to me as the King.

More information

Hadamard and conference matrices

Hadamard and conference matrices Hadamard and conference matrices Peter J. Cameron University of St Andrews & Queen Mary University of London Mathematics Study Group with input from Rosemary Bailey, Katarzyna Filipiak, Joachim Kunert,

More information

Sending Quantum Information with Zero Capacity Channels

Sending Quantum Information with Zero Capacity Channels Sending Quantum Information with Zero Capacity Channels Graeme Smith IM Research KITP Quantum Information Science Program November 5, 2009 Joint work with Jon and John Noisy Channel Capacity X N Y p(y

More information

Randomisation, Replication, Response Surfaces. and. Rosemary

Randomisation, Replication, Response Surfaces. and. Rosemary Randomisation, Replication, Response Surfaces and Rosemary 1 A.C. Atkinson a.c.atkinson@lse.ac.uk Department of Statistics London School of Economics London WC2A 2AE, UK One joint publication RAB AND ME

More information

Harris: Quantitative Chemical Analysis, Eight Edition CHAPTER 03: EXPERIMENTAL ERROR

Harris: Quantitative Chemical Analysis, Eight Edition CHAPTER 03: EXPERIMENTAL ERROR Harris: Quantitative Chemical Analysis, Eight Edition CHAPTER 03: EXPERIMENTAL ERROR Chapter 3. Experimental Error -There is error associated with every measurement. -There is no way to measure the true

More information

TECHNICAL WORKING PARTY FOR AGRICULTURAL CROPS. Twenty-Ninth Session Uppsala, Sweden, June 27 to 30, 2000

TECHNICAL WORKING PARTY FOR AGRICULTURAL CROPS. Twenty-Ninth Session Uppsala, Sweden, June 27 to 30, 2000 E TWA/29/17 ORIGINAL: English DATE: June 6, 2000 INTERNATIONAL UNION FOR THE PROTECTION OF NEW VARIETIES OF PLANTS GENEVA TECHNICAL WORKING PARTY FOR AGRICULTURAL CROPS Twenty-Ninth Session Uppsala, Sweden,

More information

Power EP. Thomas Minka Microsoft Research Ltd., Cambridge, UK MSR-TR , October 4, Abstract

Power EP. Thomas Minka Microsoft Research Ltd., Cambridge, UK MSR-TR , October 4, Abstract Power EP Thomas Minka Microsoft Research Ltd., Cambridge, UK MSR-TR-2004-149, October 4, 2004 Abstract This note describes power EP, an etension of Epectation Propagation (EP) that makes the computations

More information

On the single-orbit conjecture for uncoverings-by-bases

On the single-orbit conjecture for uncoverings-by-bases On the single-orbit conjecture for uncoverings-by-bases Robert F. Bailey School of Mathematics and Statistics Carleton University 1125 Colonel By Drive Ottawa, Ontario K1S 5B6 Canada Peter J. Cameron School

More information

Spatial analysis of a designed experiment. Uniformity trials. Blocking

Spatial analysis of a designed experiment. Uniformity trials. Blocking Spatial analysis of a designed experiment RA Fisher s 3 principles of experimental design randomization unbiased estimate of treatment effect replication unbiased estimate of error variance blocking =

More information

Balanced Nested Designs and Balanced n-ary Designs

Balanced Nested Designs and Balanced n-ary Designs Balanced Nested Designs and Balanced n-ary Designs Ryoh Fuji-Hara a, Shinji Kuriki b, Ying Miao a and Satoshi Shinohara c a Institute of Policy and Planning Sciences, University of Tsukuba, Tsukuba, Ibaraki

More information

On Hoffman s celebrated cycling LP example

On Hoffman s celebrated cycling LP example On Hoffman s celebrated cycling LP example Pablo Guerrero-García a, Ángel Santos-Palomo a a Department of Applied Mathematics, University of Málaga, 29071 Málaga, Spain. Sincerely dedicated to Alan J.

More information

Uniform semi-latin squares and their Schur-optimality

Uniform semi-latin squares and their Schur-optimality Uniform semi-latin squares and their Schur-optimality Leonard H. Soicher School of Mathematical Sciences Queen Mary University of London Mile End Road, London E1 4NS, UK L.H.Soicher@qmul.ac.uk September

More information

Lecture 11: Generalized Lovász Local Lemma. Lovász Local Lemma

Lecture 11: Generalized Lovász Local Lemma. Lovász Local Lemma Lecture 11: Generalized Recall We design an experiment with independent random variables X 1,..., X m We define bad events A 1,..., A n where) the bad event A i depends on the variables (X k1,..., X kni

More information

Approximate analysis of covariance in trials in rare diseases, in particular rare cancers

Approximate analysis of covariance in trials in rare diseases, in particular rare cancers Approximate analysis of covariance in trials in rare diseases, in particular rare cancers Stephen Senn (c) Stephen Senn 1 Acknowledgements This work is partly supported by the European Union s 7th Framework

More information

Latin squares: Equivalents and equivalence

Latin squares: Equivalents and equivalence Latin squares: Equivalents and equivalence 1 Introduction This essay describes some mathematical structures equivalent to Latin squares and some notions of equivalence of such structures. According to

More information

Optimal Design of Experiments on Connected Units

Optimal Design of Experiments on Connected Units Optimal Design of Experiments on Connected Units How to use experiments to measure networks better, and how to use networks to make experiments better. Ben M Parker September 07 Ben M Parker DOE for Networks

More information

What is a sex cell? How are sex cells made? How does meiosis help explain Mendel s results?

What is a sex cell? How are sex cells made? How does meiosis help explain Mendel s results? CHAPTER 6 3 Meiosis SECTION Heredity BEFORE YOU READ After you read this section, you should be able to answer these questions: What is a sex cell? How are sex cells made? How does meiosis help explain

More information

Combinatorics of optimal designs

Combinatorics of optimal designs Combinatorics of optimal designs R. A. Bailey and Peter J. Cameron Abstract To a combinatorialist, a design is usually a 2-design or balanced incompleteblock design. However, 2-designs do not necessarily

More information

ON REPLICATION IN DESIGN OF EXPERIMENTS

ON REPLICATION IN DESIGN OF EXPERIMENTS ON REPLICATION IN DESIGN OF EXPERIMENTS Bianca FAGARAS 1), Ingrid KOVACS 1), Anamaria OROS 1), Monica RAFAILA 2), Marina Dana TOPA 1), Manuel HARRANT 2) 1) Technical University of Cluj-Napoca, Str. Baritiu

More information

arxiv: v1 [math.co] 27 Jul 2015

arxiv: v1 [math.co] 27 Jul 2015 Perfect Graeco-Latin balanced incomplete block designs and related designs arxiv:1507.07336v1 [math.co] 27 Jul 2015 Sunanda Bagchi Theoretical Statistics and Mathematics Unit Indian Statistical Institute

More information

Finite arithmetic and Latin squares

Finite arithmetic and Latin squares Finite arithmetic and Latin squares Robin McLean 27th January 2018 Can you imagine a world in which there are only a finite number of numbers?... not simply a world with only a finite number of numerals

More information

Commentary on candidate 3 evidence (Batteries)

Commentary on candidate 3 evidence (Batteries) on candidate 3 evidence (Batteries) The evidence for this candidate has achieved the following s for each section of this course assessment component. 1 Aim An aim that describes clearly the purpose of

More information

Sampling. Where we re heading: Last time. What is the sample? Next week: Lecture Monday. **Lab Tuesday leaving at 11:00 instead of 1:00** Tomorrow:

Sampling. Where we re heading: Last time. What is the sample? Next week: Lecture Monday. **Lab Tuesday leaving at 11:00 instead of 1:00** Tomorrow: Sampling Questions Define: Sampling, statistical inference, statistical vs. biological population, accuracy, precision, bias, random sampling Why do people use sampling techniques in monitoring? How do

More information

SAMPLING IN FIELD EXPERIMENTS

SAMPLING IN FIELD EXPERIMENTS SAMPLING IN FIELD EXPERIMENTS Rajender Parsad I.A.S.R.I., Library Avenue, New Delhi-0 0 rajender@iasri.res.in In field experiments, the plot size for experimentation is selected for achieving a prescribed

More information

Chapter 2 Direct Current Circuits

Chapter 2 Direct Current Circuits Chapter 2 Direct Current Circuits 2.1 Introduction Nowadays, our lives are increasingly dependent upon the availability of devices that make extensive use of electric circuits. The knowledge of the electrical

More information

Every SOMA(n 2, n) is Trojan

Every SOMA(n 2, n) is Trojan Every SOMA(n 2, n) is Trojan John Arhin 1 Marlboro College, PO Box A, 2582 South Road, Marlboro, Vermont, 05344, USA. Abstract A SOMA(k, n) is an n n array A each of whose entries is a k-subset of a knset

More information

4.2 Graphs of Rational Functions

4.2 Graphs of Rational Functions 4.2. Graphs of Rational Functions www.ck12.org 4.2 Graphs of Rational Functions Learning Objectives Compare graphs of inverse variation equations. Graph rational functions. Solve real-world problems using

More information

MYP Curriculum Map Østerbro International School - Sciences

MYP Curriculum Map Østerbro International School - Sciences MYP 1 - TERM 1 TITLE Introduction to science Introduction to Matter MYP OBJECTIVES B1-3 C1-3 D1-3 E1-4 F1-3 ATL SKILLS Communication, Reflection. Transfer CONCEPT STATEMENT (Statement of Inquiry) will

More information

ConcepTest PowerPoints

ConcepTest PowerPoints ConcepTest PowerPoints Chapter 19 Physics: Principles with Applications, 6 th edition Giancoli 2005 Pearson Prentice Hall This work is protected by United States copyright laws and is provided solely for

More information

3.5 Efficiency factors

3.5 Efficiency factors 3.5. EFFICIENCY FACTORS 63 3.5 Efficiency factors For comparison we consider a complete-block design where the variance of each response is σ CBD. In such a design, Λ = rj Θ and k = t, so Equation (3.3)

More information

11 Block Designs. Linear Spaces. Designs. By convention, we shall

11 Block Designs. Linear Spaces. Designs. By convention, we shall 11 Block Designs Linear Spaces In this section we consider incidence structures I = (V, B, ). always let v = V and b = B. By convention, we shall Linear Space: We say that an incidence structure (V, B,

More information

An indicator for the number of clusters using a linear map to simplex structure

An indicator for the number of clusters using a linear map to simplex structure An indicator for the number of clusters using a linear map to simplex structure Marcus Weber, Wasinee Rungsarityotin, and Alexander Schliep Zuse Institute Berlin ZIB Takustraße 7, D-495 Berlin, Germany

More information

Introduction. Chapter 1

Introduction. Chapter 1 Chapter Introduction Many of the fundamental ideas and principles of experimental design were developed by Sir R. A. Fisher at the Rothamsted Experimental Station (Fisher, 926). This agricultural background

More information

Systems of distinct representatives/1

Systems of distinct representatives/1 Systems of distinct representatives 1 SDRs and Hall s Theorem Let (X 1,...,X n ) be a family of subsets of a set A, indexed by the first n natural numbers. (We allow some of the sets to be equal.) A system

More information

Design of Experiment and applications to research

Design of Experiment and applications to research Alma Mater Studiorum Design of Experiment and applications to research Giorgio Olmi, DIN Department University of Bologna, Italy giorgio.olmi@unibo.it OUTLINE Some biographical notes Research topics Applications

More information

8 RESPONSE SURFACE DESIGNS

8 RESPONSE SURFACE DESIGNS 8 RESPONSE SURFACE DESIGNS Desirable Properties of a Response Surface Design 1. It should generate a satisfactory distribution of information throughout the design region. 2. It should ensure that the

More information

Analysis of Variance and Co-variance. By Manza Ramesh

Analysis of Variance and Co-variance. By Manza Ramesh Analysis of Variance and Co-variance By Manza Ramesh Contents Analysis of Variance (ANOVA) What is ANOVA? The Basic Principle of ANOVA ANOVA Technique Setting up Analysis of Variance Table Short-cut Method

More information

Grade 6 Math Circles. Circuits

Grade 6 Math Circles. Circuits Faculty of Mathematics Waterloo, Ontario NL 3G Electricity Grade 6 Math Circles March 8/9, 04 Circuits Centre for Education in Mathematics and Computing Electricity is a type of energy that deals with

More information

Lecture 1 January 18

Lecture 1 January 18 STAT 263/363: Experimental Design Winter 2016/17 Lecture 1 January 18 Lecturer: Art B. Owen Scribe: Julie Zhu Overview Experiments are powerful because you can conclude causality from the results. In most

More information

Getting Started with Communications Engineering

Getting Started with Communications Engineering 1 Linear algebra is the algebra of linear equations: the term linear being used in the same sense as in linear functions, such as: which is the equation of a straight line. y ax c (0.1) Of course, if we

More information

Chapter 14 Stein-Rule Estimation

Chapter 14 Stein-Rule Estimation Chapter 14 Stein-Rule Estimation The ordinary least squares estimation of regression coefficients in linear regression model provides the estimators having minimum variance in the class of linear and unbiased

More information

Optimal Blocking by Minimizing the Maximum Within-Block Distance

Optimal Blocking by Minimizing the Maximum Within-Block Distance Optimal Blocking by Minimizing the Maximum Within-Block Distance Michael J. Higgins Jasjeet Sekhon Princeton University University of California at Berkeley November 14, 2013 For the Kansas State University

More information

Experimental Design and Optimization

Experimental Design and Optimization . Experimental Design Stages a) Identifying the factors which may affect the results of an experiment; b) Designing the experiment so that the effects of uncontrolled factors are minimized; c) Using statistical

More information

QUASI-ORTHOGONAL ARRAYS AND OPTIMAL FRACTIONAL FACTORIAL PLANS

QUASI-ORTHOGONAL ARRAYS AND OPTIMAL FRACTIONAL FACTORIAL PLANS Statistica Sinica 12(2002), 905-916 QUASI-ORTHOGONAL ARRAYS AND OPTIMAL FRACTIONAL FACTORIAL PLANS Kashinath Chatterjee, Ashish Das and Aloke Dey Asutosh College, Calcutta and Indian Statistical Institute,

More information

CONSTRUCTION OF BLOCK DESIGNS WITH NESTED ROWS AND COLUMNS

CONSTRUCTION OF BLOCK DESIGNS WITH NESTED ROWS AND COLUMNS Journal of Research (Science), Bahauddin Zakariya University, Multan, Pakistan. Vol. 8, No., July 7, pp. 67-76 ISSN - CONSTRUCTION OF BLOCK DESIGNS WITH NESTED ROWS AND COLUMNS L. Rasul and I. Iqbal Department

More information

Differential Equations and Linear Algebra Supplementary Notes. Simon J.A. Malham. Department of Mathematics, Heriot-Watt University

Differential Equations and Linear Algebra Supplementary Notes. Simon J.A. Malham. Department of Mathematics, Heriot-Watt University Differential Equations and Linear Algebra Supplementary Notes Simon J.A. Malham Department of Mathematics, Heriot-Watt University Contents Chapter 1. Linear algebraic equations 5 1.1. Gaussian elimination

More information

Definition 2.3. We define addition and multiplication of matrices as follows.

Definition 2.3. We define addition and multiplication of matrices as follows. 14 Chapter 2 Matrices In this chapter, we review matrix algebra from Linear Algebra I, consider row and column operations on matrices, and define the rank of a matrix. Along the way prove that the row

More information

Analysis of Variance and Design of Experiments-II

Analysis of Variance and Design of Experiments-II Analysis of Variance and Design of Experiments-II MODULE - II LECTURE - BALANCED INCOMPLETE BLOCK DESIGN (BIBD) Dr. Shalabh Department of Mathematics & Statistics Indian Institute of Technology Kanpur

More information

Estimation of AUC from 0 to Infinity in Serial Sacrifice Designs

Estimation of AUC from 0 to Infinity in Serial Sacrifice Designs Estimation of AUC from 0 to Infinity in Serial Sacrifice Designs Martin J. Wolfsegger Department of Biostatistics, Baxter AG, Vienna, Austria Thomas Jaki Department of Statistics, University of South Carolina,

More information

Applying block intersection polynomials to study graphs and designs

Applying block intersection polynomials to study graphs and designs Applying block intersection polynomials to study graphs and designs Leonard Soicher Queen Mary University of London CoCoA15, Colorado State University, Fort Collins, July 2015 Leonard Soicher (QMUL) Block

More information

Graph Partitioning Using Random Walks

Graph Partitioning Using Random Walks Graph Partitioning Using Random Walks A Convex Optimization Perspective Lorenzo Orecchia Computer Science Why Spectral Algorithms for Graph Problems in practice? Simple to implement Can exploit very efficient

More information

Selecting the Best Simulated System. Dave Goldsman. Georgia Tech. July 3 4, 2003

Selecting the Best Simulated System. Dave Goldsman. Georgia Tech. July 3 4, 2003 Selecting the Best Simulated System Dave Goldsman Georgia Tech July 3 4, 2003 Barry Nelson 1 Outline of Talk 1. Introduction. Look at procedures to select the... 2. Normal Population with the Largest Mean

More information

Complexity Theory VU , SS The Polynomial Hierarchy. Reinhard Pichler

Complexity Theory VU , SS The Polynomial Hierarchy. Reinhard Pichler Complexity Theory Complexity Theory VU 181.142, SS 2018 6. The Polynomial Hierarchy Reinhard Pichler Institut für Informationssysteme Arbeitsbereich DBAI Technische Universität Wien 15 May, 2018 Reinhard

More information

Outline. Complexity Theory EXACT TSP. The Class DP. Definition. Problem EXACT TSP. Complexity of EXACT TSP. Proposition VU 181.

Outline. Complexity Theory EXACT TSP. The Class DP. Definition. Problem EXACT TSP. Complexity of EXACT TSP. Proposition VU 181. Complexity Theory Complexity Theory Outline Complexity Theory VU 181.142, SS 2018 6. The Polynomial Hierarchy Reinhard Pichler Institut für Informationssysteme Arbeitsbereich DBAI Technische Universität

More information

Math Lecture 4 Limit Laws

Math Lecture 4 Limit Laws Math 1060 Lecture 4 Limit Laws Outline Summary of last lecture Limit laws Motivation Limits of constants and the identity function Limits of sums and differences Limits of products Limits of polynomials

More information