ON SOME METHODS OF CONSTRUCTION OF BLOCK DESIGNS
|
|
- Cynthia Ellis
- 5 years ago
- Views:
Transcription
1 ON SOME METHODS OF CONSTRUCTION OF BLOCK DESIGNS NURNABI MEHERUL ALAM M.Sc. (Agricultural Statistics), Roll No. I.A.S.R.I, Library Avenue, New Delhi- Chairperson: Dr. P.K. Batra Abstract: Block designs are useful in experiments requiring elimination of heterogeneity in one direction. A block design is said to be incomplete if it contains at least one block that does not have full set of treatments. The most commonly used block designs are Balanced Incomplete Block (BIB) design and Partially Balanced Incomplete Block (PBIB) designs. Many research workers have contributed to the construction of these designs. Many series of BIB designs have been constructed using finite geometries, method of symmetrically repeated differences, using Hadamard matrices etc. BIB designs and their properties can be used to obtain many new series of BIB and PBIB designs. Some methods of construction of BIB and PBIB designs using existing series of BIB designs would be described. Key words: Block Design, BIB design, PBIB design, Dual of Block Design, Block Section, Block Intersection, Complementary Design.. Introduction Block designs are useful in experiments requiring elimination of heterogeneity in one direction. The most commonly used block design in agricultural experimentation is the Randomized Complete Block (RCB) design, where entire experimental material is divided into homogenous groups called blocks and the treatments are allotted randomly to experimental units within blocks. In this design, every treatment occurs exactly once in each block. If the experiment involves large number of treatments so that it becomes difficult to have large blocks and preserve homogenous condition within each block, then incomplete block designs are used. An incomplete block design is one in which all the treatments do not occur in at least one block. Many incomplete block designs have been obtained keeping in view the ease of analysis and also their constructions. Construction of incomplete block designs having patterns admitting simplified analysis and possessing desirable statistical property was priority of research workers in this field. Many research workers notably Bose and Shimamoto (), Yates (), Das (), Shrikhande (), Dey (), Nigam et al. (), Kageyama () etc have contributed to the construction of important classes of block designs like Balanced Incomplete Block (BIB) design, Partially Balanced Incomplete Block (PBIB) design etc. The main advantage of these designs is the ease in analysis and interpretation of result. Many methods of construction of such designs are available using standard mathematical theories like- Galois field, projective geometries etc. Some methods are also available in the literature, which can fruitfully be used to construct new designs from the existing designs. Commonly used such methods are - block section, block intersection, complementary design, dual of block designs etc. Here, some methods in the construction of block designs, particularly BIB design and PBIB design would be discussed.
2 . Block Designs Block design D (v, b, r, k) is an arrangement of v treatments in b bocks in such a way that th th the i treatment occurs n times in j block. The v x b matrix ij N ( ( n ij ) ) (i,..., v; j,..., b) is called the incidence matrix of the design. Further N b r and N v k where r r, r,...,r ) is v x vector of treatment replications ( v and k k, k,..., k ) is b x vector of block sizes. Further r k n, the total ( b number of experimental units. A design is said to be binary if k j s are equal and equi-replicate if all r s are equal. If n i ij v b i j i j n ij or, proper if all i, j then the block design is said to be a complete block design and if for at least one i, j (i,..., v; j,..., b), then the block design is said to be an incomplete block design.. Model for Block Design Following is the general, additive, fixed effects model for a block design D(v, b, r, k): Y μ+ Δ τ + D β + e where E(e) and dispersion matrix D ( e ) σ I, Δ observation vs. treatment n incidence matrix, D observation vs. block incidence matrix, μ general mean effect, τ the column vector of treatment effects and β column vector of block effects. Using the principle of ordinary least squares, the reduced normal equations for estimating the linear functions of treatment effects are given by n ij where Cτ Q, Q T NK B denotes the vector of adjusted treatment totals and C R NK N is the coefficient matrix and is also known as Fisher s information matrix for estimating the treatment effects. It is a non-negative definite v x v symmetric matrix with row sum and column sum zero. R diagonal matrix of replications, K diagonal matrix of block sizes, T column vector of treatment totals. τˆ C Q C is a generalized inverse of C. A block design is said to be connected iff Rank ( C) v or C has v- non-zero eigen values. The analysis of variance of general block design is as follows: Source of Variation Degrees of Freedom Treatment v- Replication r- Error (r-)(v-) Total rv-
3 BIB and PBIB designs defined below are an important class of incomplete block designs. Balanced Incomplete Block Design: A BIB design is an arrangement of v treatments into b blocks such that (i) each block contains k (<v) distinct treatments, (ii) each treatment appears in r blocks, (iii) every pair of treatments appears together in λ blocks where v, b, r, k, λ are the parameters of the BIB design. Partially Balanced Incomplete Block Design: Given an association scheme with m classes ( m ), a PBIB design based on the association scheme is defined as arrangement of v treatments in b blocks, such that (i) each block contains k (< v ) distinct treatments, (ii) each treatment appears in r blocks, (iii) if the treatments α and β are mutually i th associates in the association scheme, then α and β occur together in λ i blocks, where the integer λ i does not depend on the pair (α, β) so long as they are mutually i th associates, i,,,m. Further not all λ s are equal. i Construction of BIB and PBIB have drawn attention of many research workers. Many methods in literature include the one where use of existing block design is made. These methods would be discussed in sequence.. Methods of Construction of Block Designs BIB designs and PBIB designs are important class of block designs and many research workers have contributed in the construction of different series of designs belonging to these classes. BIB designs are useful in varietial trials wherein it is of interest to make all elementary comparisons with equal precisions. Some of the methods of construction of these classes of block designs are based on mathematical developments in finite geometries, symmetricaliy repeated differences, Hadamard matrices etc. While few are based on using existing series of designs and their properties. The methods based on use of existing designs are discussed here.. Residual Design or Block Section A residual design of a block design D(v, b, r, k, N) is obtained by deleting any one block of the design and from the remaining b blocks deleting all those treatments, which appear in the deleted block and renumbering the treatments from,..., v k. The design so obtained is called residual design and the procedure is called the block section. Result.: The residual design of a symmetric BIB design D(v b, r k, λ) is a BIB design with parameters v v k, b b, r r, k k λ, λ λ. Example.: Consider a symmetric BIB design as given below with parameters v b, r k, λ. The residual design is obtained by deleting say the third block i.e. (,, ) and the treatments occurring in the block from other bocks. (Rows indicate block)
4 / / / / / / / / / The design obtained is as follows: Renumbering the treatments like the final design is which is again a BIB design with parameters (v, b, r, k, λ ).. Block Intersection or Derived Design Derived design from a block design D(v, b, r, k, N) is obtained by deleting any one block of the design and from the remaining b blocks deleting all those treatments, which do not appear in the deleted block and renumbering the treatments from,..., k. Result.: The derived design of a symmetric BIB design with parameters v b, r k, λ is a BIB design with parameters v k, b b, r r, k λ, λ λ. Example.: Consider a symmetric BIB design with v b, r k, λ. Deleting the fourth block and retaining the treatments appearing in the deleted block in the remaining blocks, a derived design is obtained.
5 / / / / / / / / / / / / / / / / Renumbering the treatments the final design with v, b, r, k, λ is as follows:. Complementary Design Given a design D with parameters v, b, r, k, N, another design called the complementary design D is obtained in which corresponding to each block of design D, a block of design D is formed by taking only those treatments, which are not appearing in the blocks of D. Alternatively, in the incidence matrix N of the design D, replacing s by and s by, the incidence matrix N of complementary design D is obtained. Result.: Complementary design of a BIB design ( v, b, r, k, λ) is a BIB design with parameters v v, b b, r b r, k v k, λ b r + λ. Example.: BIB design with parameters v, b, r, k, λ and its complementary design with parameters v, b, r, k, λ is given below:
6 Original design Complementary design The incidence matrix of BIB design is N Now replacing s by and s by in the incidence matrix, the incidence matrix of the complementary design N is as follows: N
7 Result.: The complementary of a Group Divisible (GD) PBIB design with parameters v, b, r, k,, λ is also a GD design with same association scheme and with parameters v v, b b, r b r, k v k, λ b r + λ, λ b + λ. λ r Example.: Consider a PBIB design with v, b, r, k, λ, λ. The complementary is also a PBIB design with parameters as, b, r, k, λ, λ v Original design Complementary design The association scheme in both the cases is as follows: For treatment, treatment is first associate that appears λ times in the original design and λ times in the complementary design. Remaining treatments are second associates of treatment that appear λ time in the original design and λ times in the complementary design. Result.: Complementary design of any equireplicate proper block design is also an equireplicate proper block design.. Construction by Deleting Blocks Containing a Particular Treatment Consider a BIB design D with parameters v, b, r, k, λ, then by deleting all those blocks containing a particular treatment, a GD design with parameters v v, b b r, r r, k k, λ, λ, m r, n k is obtained. Example.: BIB design with parameters v, b, r, k, λ is as follows:
8 Selecting treatment and deleting the blocks containing treatment, the resultant design is obtained. The above design is a GD design with parameters v, b, r, k, λ, λ, m, n and the association scheme is obtained from the deleted blocks after deleting treatment. Result.: Consider a symmetric BIB design with v n(n ) / + b, r n k, λ. Omitting all the blocks containing a particular treatment from this design, a triangular design with v n(n ) /, b (n )(n ) /, r n, k n, λ, λ is obtained. Example.: Consider the following BIB design with v b, r k, λ :
9 Deleting blocks containing treatment, the following triangular design is obtained: ` The parameters of this design are v, b, r, k, λ, λ. The arrangements of the treatments of the association scheme is. Replacement Method Consider a BIB design with parameters v, b, r, k, λ. In this design if each treatment is replaced by a group of s distinct treatments (s is constant), the resultant design is PBIB design with GD association scheme. The parameters of the resulting design are vs, b b, r r, k ks, λ r, λ λ, m v, n s. v Example.: Consider the following BIB design with v, b, r, k, λ :
10 Replacing each treatment by a group of two treatments i.e. s as follows: the resultant design becomes which is a PBIB design with parameters v, b, r, k, λ, λ with the following GD association scheme Result.: Consider a BIB design D with parameters v s, b, r, k, λ. Let the i-th treatment be replaced by the treatments in the i-th row of an association scheme with v s. Similarly i-th treatment is replaced by the treatments in the i-th column of association scheme, then a PBIB design with L association scheme with parameters L v s, b b, r r, k sk, λ r + λ, λ λ L is obtained. Example.: Consider the BIB design with parameters v b, k r, λ.
11 Let s. The L scheme on v treatments can be displayed as The design so obtained with, b, r, k, λ, λ is v. Dual Designs If N is an incidence matrix of a design D, then the design D, which has N as its incidence matrix, is said to be the dual design of D. Given a block designs D, by inter changing blocks and treatments, a new design D called the dual of the original design D is obtained. If the original design has parameters v, b, r, k then the dual design will have parameters v b, b v, r k, k r. Dualization of known designs sometimes yields new designs and sometimes known designs. Corresponding to any incomplete block design there is a dual design. If any incomplete block design can be used for experimentation, then its dual design can also be used for the same purpose without any fresh difficulty for the analysis of the block design. Given two designs D and E, one may be interested to know whether the design E can be the dual of D. For this purpose, we must necessarily have the number of treatments of D to be equal to the number of blocks in E, and the number of replications of D to be equal to the block size in E. Further if N is the incidence matrix of D and N is the incidence matrix of E, then the non zero characteristic roots along with their multiplicities should be the same for N N and N N. Example.: A BIB design with parameters (,,,, ) is as follows:
12 Further, N According to the definition of the dual design of D, D has the incidence matrix as the transpose of N i.e. N is given by N So the dual design obtained is
13 which is a PBIB design with, b, r, k, λ, λ. v Result.: Dual of a symmetric BIB design is also a symmetric BIB design with same parameters. Example.: Consider a symmetric BIB design with parameters (,,,, ) with N As the matrix is symmetric its transpose is same as same. N. So the resultant dual design is the Result.: If D is BIB design with parameters v, b, r, k, λ, then its dual D is a two associate-class PBIB design with GD association scheme and parameters as v b, b v, r k, k r, λ, λ, m r, n b r, p r + (k, k p. ) Example.: Consider a BIB design with parameters v, b, r, k, λ given as follows: Its dual design is
14 which is a PBIB design with parameters v, b, r, k, λ, λ and association scheme as where two treatments are first associate if they belong to the same row, otherwise they are second associates. r r Result.: If D is a BIB design with parameters v, b, r, k r, λ, then its dual design D is a PBIB design with the parameters v b, b v, r k, k r, λ, λ, p r-,. Example.: Consider the following BIB design with v, b, r, k, λ : p Here
15 N N So the dual design becomes which is PBIB design with parameters,, k, r, b, v λ λ follow the triangular association scheme. The arrangement of treatments in the association scheme is:. Conclusions Many mathematical theories like projective geometries, Galois theory, method of finite differences, Hadamard matrices have been used to construct various series of BIB designs.
16 Symmetrical BIB designs have property that any two blocks have λ treatments in common and the same has been used for construction of series of BIB and PBIB designs. Duals of BIB designs have also enriched the availability of series of BIB and PBIB designs. Many classes of designs like Reinforced designs, efficiency balanced designs, linked block designs have also been constructed using existing designs. Thus it is concluded that use of existing designs has been helpful in enriching the availability of block designs for experimentation. References Bose, R.C. and Shimamoto, T. (). Classification and analysis of PBIB designs with two associate classes. Journal of the American Statistical Association,, -. Das, M.N. and Kulkarni, G.A. (). Incomplete block designs for bio-assays. Biometrics,, -. Dey, A. (). A note on balanced designs. Sankhya, B,, -. Dey, A. (). Theory of block design, Wiley Eastren Limited. Kageyama, S. (). On properties of efficiency balanced designs. Communication in Statistics, A (), -. Nigam, A.K, Puri, P.D, Gupta, V.K. (). Characterizations and analysis of block designs. Wiley Eastren Limited. Raghavarao, D. (). Duals of partially balanced incomplete block designs and some non-existence theorems. Annals of Mathematical Statistics,, -. Shrikhande, S.S. (). On duals of some balanced incomplete block designs. Biometrics,, -. Shrikhande, S.S. and Bhagwandas (). Duals of incomplete block designs. Journal of the Indian Statistical Association,, -. Yates, F. (). A new method of arranging variety trials involving a large number of varieties. J. Agric. Sci.,, -.
ON THE CONSTRUCTION OF ORTHOGONAL ARRAYS
Hacettepe Journal of Mathematics and Statistics Volume 31 (2002), 45 51 ON THE CONSTRUCTION OF ORTHOGONAL ARRAYS Hülya Bayrak and Aslıhan Alhan Received 04. 10. 2001 Abstract In this study, the geometric
More informationSTATISTICAL PACKAGE FOR AUGMENTED DESIGNS (SPAD)
STATISTICAL PACKAGE FOR AUGMENTED DESIGNS (SPAD) RAJENDER PARSAD, ABHISHEK RATHORE AND V.K. GUPTA Indian Agricultural Statistics Research Institute Library Avenue, New Delhi-110 012 rajender@iasri.res.in
More informationTHE SHRIKHANDE GRAPH. 1. Introduction
THE SHRIKHANDE GRAPH RYAN M. PEDERSEN Abstract. In 959 S.S. Shrikhande wrote a paper concerning L 2 association schemes []. Out of this paper arose a strongly regular graph with parameters (6, 6, 2, 2)
More informationDefinition. Given a (v,k,λ)- BIBD, (X,B), a set of disjoint blocks of B which partition X is called a parallel class.
Resolvable BIBDs Definition Given a (v,k,λ)- BIBD, (X,B), a set of disjoint blocks of B which partition X is called a parallel class. A partition of B into parallel classes (there must be r of them) is
More informationMultiple View Geometry in Computer Vision
Multiple View Geometry in Computer Vision Prasanna Sahoo Department of Mathematics University of Louisville 1 Projective 3D Geometry (Back to Chapter 2) Lecture 6 2 Singular Value Decomposition Given a
More informationREGULAR GRAPHS OF GIVEN GIRTH. Contents
REGULAR GRAPHS OF GIVEN GIRTH BROOKE ULLERY Contents 1. Introduction This paper gives an introduction to the area of graph theory dealing with properties of regular graphs of given girth. A large portion
More informationGeneralized trace ratio optimization and applications
Generalized trace ratio optimization and applications Mohammed Bellalij, Saïd Hanafi, Rita Macedo and Raca Todosijevic University of Valenciennes, France PGMO Days, 2-4 October 2013 ENSTA ParisTech PGMO
More informationTAGUCHI TECHNIQUES FOR 2 k FRACTIONAL FACTORIAL EXPERIMENTS
Hacettepe Journal of Mathematics and Statistics Volume 4 (200), 8 9 TAGUCHI TECHNIQUES FOR 2 k FRACTIONAL FACTORIAL EXPERIMENTS Nazan Danacıoğlu and F.Zehra Muluk Received 0: 0: 200 : Accepted 14: 06:
More informationCHAPTER 3 FUZZY RELATION and COMPOSITION
CHAPTER 3 FUZZY RELATION and COMPOSITION The concept of fuzzy set as a generalization of crisp set has been introduced in the previous chapter. Relations between elements of crisp sets can be extended
More informationVertex Magic Total Labelings of Complete Graphs 1
Vertex Magic Total Labelings of Complete Graphs 1 Krishnappa. H. K. and Kishore Kothapalli and V. Ch. Venkaiah Centre for Security, Theory, and Algorithmic Research International Institute of Information
More informationOn the construction of nested orthogonal arrays
isid/ms/2010/06 September 10, 2010 http://wwwisidacin/ statmath/eprints On the construction of nested orthogonal arrays Aloke Dey Indian Statistical Institute, Delhi Centre 7, SJSS Marg, New Delhi 110
More informationChapter 18 out of 37 from Discrete Mathematics for Neophytes: Number Theory, Probability, Algorithms, and Other Stuff by J. M. Cargal.
Chapter 8 out of 7 from Discrete Mathematics for Neophytes: Number Theory, Probability, Algorithms, and Other Stuff by J. M. Cargal 8 Matrices Definitions and Basic Operations Matrix algebra is also known
More informationON THE STRONGLY REGULAR GRAPH OF PARAMETERS
ON THE STRONGLY REGULAR GRAPH OF PARAMETERS (99, 14, 1, 2) SUZY LOU AND MAX MURIN Abstract. In an attempt to find a strongly regular graph of parameters (99, 14, 1, 2) or to disprove its existence, we
More informationInterpolation is a basic tool used extensively in tasks such as zooming, shrinking, rotating, and geometric corrections.
Image Interpolation 48 Interpolation is a basic tool used extensively in tasks such as zooming, shrinking, rotating, and geometric corrections. Fundamentally, interpolation is the process of using known
More informationRelational Database: The Relational Data Model; Operations on Database Relations
Relational Database: The Relational Data Model; Operations on Database Relations Greg Plaxton Theory in Programming Practice, Spring 2005 Department of Computer Science University of Texas at Austin Overview
More informationDM545 Linear and Integer Programming. Lecture 2. The Simplex Method. Marco Chiarandini
DM545 Linear and Integer Programming Lecture 2 The Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline 1. 2. 3. 4. Standard Form Basic Feasible Solutions
More informationOrdinary Differential Equation (ODE)
Ordinary Differential Equation (ODE) INTRODUCTION: Ordinary Differential Equations play an important role in different branches of science and technology In the practical field of application problems
More informationINTRODUCTION TO CLUSTER ALGEBRAS
INTRODUCTION TO CLUSTER ALGEBRAS NAN LI (MIT) Cluster algebras are a class of commutative ring, introduced in 000 by Fomin and Zelevinsky, originally to study Lusztig s dual canonical basis and total positivity.
More informationMa/CS 6b Class 13: Counting Spanning Trees
Ma/CS 6b Class 13: Counting Spanning Trees By Adam Sheffer Reminder: Spanning Trees A spanning tree is a tree that contains all of the vertices of the graph. A graph can contain many distinct spanning
More informationSCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics. Numbers & Number Systems
SCHOOL OF ENGINEERING & BUILT ENVIRONMENT Mathematics Numbers & Number Systems Introduction Numbers and Their Properties Multiples and Factors The Division Algorithm Prime and Composite Numbers Prime Factors
More informationLecture 5: Matrices. Dheeraj Kumar Singh 07CS1004 Teacher: Prof. Niloy Ganguly Department of Computer Science and Engineering IIT Kharagpur
Lecture 5: Matrices Dheeraj Kumar Singh 07CS1004 Teacher: Prof. Niloy Ganguly Department of Computer Science and Engineering IIT Kharagpur 29 th July, 2008 Types of Matrices Matrix Addition and Multiplication
More informationCS6702 GRAPH THEORY AND APPLICATIONS 2 MARKS QUESTIONS AND ANSWERS
CS6702 GRAPH THEORY AND APPLICATIONS 2 MARKS QUESTIONS AND ANSWERS 1 UNIT I INTRODUCTION CS6702 GRAPH THEORY AND APPLICATIONS 2 MARKS QUESTIONS AND ANSWERS 1. Define Graph. A graph G = (V, E) consists
More informationProblem Set 3. MATH 778C, Spring 2009, Austin Mohr (with John Boozer) April 15, 2009
Problem Set 3 MATH 778C, Spring 2009, Austin Mohr (with John Boozer) April 15, 2009 1. Show directly that P 1 (s) P 1 (t) for all t s. Proof. Given G, let H s be a subgraph of G on s vertices such that
More informationModified Procedure to Solve Fuzzy Transshipment Problem by using Trapezoidal Fuzzy number.
International Journal of Mathematics and Statistics Invention (IJMSI) E-ISSN: 2321 4767 P-ISSN: 2321-4759 Volume 4 Issue 6 August. 216 PP-3-34 Modified Procedure to Solve Fuzzy Transshipment Problem by
More informationRandom strongly regular graphs?
Graphs with 3 vertices Random strongly regular graphs? Peter J Cameron School of Mathematical Sciences Queen Mary, University of London London E1 NS, U.K. p.j.cameron@qmul.ac.uk COMB01, Barcelona, 1 September
More information4 Integer Linear Programming (ILP)
TDA6/DIT37 DISCRETE OPTIMIZATION 17 PERIOD 3 WEEK III 4 Integer Linear Programg (ILP) 14 An integer linear program, ILP for short, has the same form as a linear program (LP). The only difference is that
More informationLecture 3A: Generalized associahedra
Lecture 3A: Generalized associahedra Nathan Reading NC State University Cluster Algebras and Cluster Combinatorics MSRI Summer Graduate Workshop, August 2011 Introduction Associahedron and cyclohedron
More informationA graph is finite if its vertex set and edge set are finite. We call a graph with just one vertex trivial and all other graphs nontrivial.
2301-670 Graph theory 1.1 What is a graph? 1 st semester 2550 1 1.1. What is a graph? 1.1.2. Definition. A graph G is a triple (V(G), E(G), ψ G ) consisting of V(G) of vertices, a set E(G), disjoint from
More informationAnnotated multitree output
Annotated multitree output A simplified version of the two high-threshold (2HT) model, applied to two experimental conditions, is used as an example to illustrate the output provided by multitree (version
More informationAlgebraic Graph Theory- Adjacency Matrix and Spectrum
Algebraic Graph Theory- Adjacency Matrix and Spectrum Michael Levet December 24, 2013 Introduction This tutorial will introduce the adjacency matrix, as well as spectral graph theory. For those familiar
More informationLecture 2 September 3
EE 381V: Large Scale Optimization Fall 2012 Lecture 2 September 3 Lecturer: Caramanis & Sanghavi Scribe: Hongbo Si, Qiaoyang Ye 2.1 Overview of the last Lecture The focus of the last lecture was to give
More information1.2 Numerical Solutions of Flow Problems
1.2 Numerical Solutions of Flow Problems DIFFERENTIAL EQUATIONS OF MOTION FOR A SIMPLIFIED FLOW PROBLEM Continuity equation for incompressible flow: 0 Momentum (Navier-Stokes) equations for a Newtonian
More informationMathematics. 2.1 Introduction: Graphs as Matrices Adjacency Matrix: Undirected Graphs, Directed Graphs, Weighted Graphs CHAPTER 2
CHAPTER Mathematics 8 9 10 11 1 1 1 1 1 1 18 19 0 1.1 Introduction: Graphs as Matrices This chapter describes the mathematics in the GraphBLAS standard. The GraphBLAS define a narrow set of mathematical
More informationUNCLASSIFIED , DEFENSE DOCUMENTATION CENTER FOR SCIENTIFIC AND TECHNICAL INFC,;MATION STATION. ALEXANDRIA. VIRGINIA UNCLASSIFIED
UNCLASSIFIED,419599 AD DEFENSE DOCUMENTATION CENTER FOR SCIENTIFIC AND TECHNICAL INFC,;MATION CAMERON STATION. ALEXANDRIA. VIRGINIA UNCLASSIFIED smazo: Vem gweainat or other drwidnu, spt. ttions or other
More informationTitle Edge-minimal graphs of exponent 2
Provided by the author(s) and NUI Galway in accordance with publisher policies. Please cite the published version when available. Title Edge-minimal graphs of exponent 2 Author(s) O'Mahony, Olga Publication
More informationRecall the expression for the minimum significant difference (w) used in the Tukey fixed-range method for means separation:
Topic 11. Unbalanced Designs [ST&D section 9.6, page 219; chapter 18] 11.1 Definition of missing data Accidents often result in loss of data. Crops are destroyed in some plots, plants and animals die,
More informationCS473-Algorithms I. Lecture 13-A. Graphs. Cevdet Aykanat - Bilkent University Computer Engineering Department
CS473-Algorithms I Lecture 3-A Graphs Graphs A directed graph (or digraph) G is a pair (V, E), where V is a finite set, and E is a binary relation on V The set V: Vertex set of G The set E: Edge set of
More informationVARIANTS OF THE SIMPLEX METHOD
C H A P T E R 6 VARIANTS OF THE SIMPLEX METHOD By a variant of the Simplex Method (in this chapter) we mean an algorithm consisting of a sequence of pivot steps in the primal system using alternative rules
More informationUniform edge-c-colorings of the Archimedean Tilings
Discrete & Computational Geometry manuscript No. (will be inserted by the editor) Uniform edge-c-colorings of the Archimedean Tilings Laura Asaro John Hyde Melanie Jensen Casey Mann Tyler Schroeder Received:
More informationIntroduction to Mathematical Programming IE406. Lecture 16. Dr. Ted Ralphs
Introduction to Mathematical Programming IE406 Lecture 16 Dr. Ted Ralphs IE406 Lecture 16 1 Reading for This Lecture Bertsimas 7.1-7.3 IE406 Lecture 16 2 Network Flow Problems Networks are used to model
More informationRandom Permutations, Random Sudoku Matrices and Randomized Algorithms
Random Permutations, Random Sudoku Matrices and Randomized Algorithms arxiv:1312.0192v1 [math.co] 1 Dec 2013 Krasimir Yordzhev Faculty of Mathematics and Natural Sciences South-West University, Blagoevgrad,
More informationVertex Magic Total Labelings of Complete Graphs
AKCE J. Graphs. Combin., 6, No. 1 (2009), pp. 143-154 Vertex Magic Total Labelings of Complete Graphs H. K. Krishnappa, Kishore Kothapalli and V. Ch. Venkaiah Center for Security, Theory, and Algorithmic
More informationStructured System Theory
Appendix C Structured System Theory Linear systems are often studied from an algebraic perspective, based on the rank of certain matrices. While such tests are easy to derive from the mathematical model,
More informationOn the maximum rank of completions of entry pattern matrices
Linear Algebra and its Applications 525 (2017) 1 19 Contents lists available at ScienceDirect Linear Algebra and its Applications wwwelseviercom/locate/laa On the maximum rank of completions of entry pattern
More informationLATIN SQUARES AND TRANSVERSAL DESIGNS
LATIN SQUARES AND TRANSVERSAL DESIGNS *Shirin Babaei Department of Mathematics, University of Zanjan, Zanjan, Iran *Author for Correspondence ABSTRACT We employ a new construction to show that if and if
More informationOn Rainbow Cycles in Edge Colored Complete Graphs. S. Akbari, O. Etesami, H. Mahini, M. Mahmoody. Abstract
On Rainbow Cycles in Edge Colored Complete Graphs S. Akbari, O. Etesami, H. Mahini, M. Mahmoody Abstract In this paper we consider optimal edge colored complete graphs. We show that in any optimal edge
More informationLATIN SQUARES AND THEIR APPLICATION TO THE FEASIBLE SET FOR ASSIGNMENT PROBLEMS
LATIN SQUARES AND THEIR APPLICATION TO THE FEASIBLE SET FOR ASSIGNMENT PROBLEMS TIMOTHY L. VIS Abstract. A significant problem in finite optimization is the assignment problem. In essence, the assignment
More informationDiscrete Mathematics Course Review 3
21-228 Discrete Mathematics Course Review 3 This document contains a list of the important definitions and theorems that have been covered thus far in the course. It is not a complete listing of what has
More informationGraphs and Network Flows IE411. Lecture 21. Dr. Ted Ralphs
Graphs and Network Flows IE411 Lecture 21 Dr. Ted Ralphs IE411 Lecture 21 1 Combinatorial Optimization and Network Flows In general, most combinatorial optimization and integer programming problems are
More informationChapter 4. Relations & Graphs. 4.1 Relations. Exercises For each of the relations specified below:
Chapter 4 Relations & Graphs 4.1 Relations Definition: Let A and B be sets. A relation from A to B is a subset of A B. When we have a relation from A to A we often call it a relation on A. When we have
More information1 Maximum Degrees of Iterated Line Graphs
1 Maximum Degrees of Iterated Line Graphs Note. All graphs in this section are simple. Problem 1. A simple graph G is promising if and only if G is not terminal. 1.1 Lemmas Notation. We denote the line
More informationAlex Schaefer. April 9, 2017
Department of Mathematics Binghamton University April 9, 2017 Outline 1 Introduction 2 Cycle Vector Space 3 Permutability 4 A Characterization Introduction Outline 1 Introduction 2 Cycle Vector Space 3
More informationEqui-sized, Homogeneous Partitioning
Equi-sized, Homogeneous Partitioning Frank Klawonn and Frank Höppner 2 Department of Computer Science University of Applied Sciences Braunschweig /Wolfenbüttel Salzdahlumer Str 46/48 38302 Wolfenbüttel,
More informationAN APPROXIMATE INVENTORY MODEL BASED ON DIMENSIONAL ANALYSIS. Victoria University, Wellington, New Zealand
AN APPROXIMATE INVENTORY MODEL BASED ON DIMENSIONAL ANALYSIS by G. A. VIGNAUX and Sudha JAIN Victoria University, Wellington, New Zealand Published in Asia-Pacific Journal of Operational Research, Vol
More informationAdvanced Operations Research Techniques IE316. Quiz 1 Review. Dr. Ted Ralphs
Advanced Operations Research Techniques IE316 Quiz 1 Review Dr. Ted Ralphs IE316 Quiz 1 Review 1 Reading for The Quiz Material covered in detail in lecture. 1.1, 1.4, 2.1-2.6, 3.1-3.3, 3.5 Background material
More informationMLR Institute of Technology
Course Name : Engineering Optimization Course Code : 56021 Class : III Year Branch : Aeronautical Engineering Year : 2014-15 Course Faculty : Mr Vamsi Krishna Chowduru, Assistant Professor Course Objective
More informationMathematical and Algorithmic Foundations Linear Programming and Matchings
Adavnced Algorithms Lectures Mathematical and Algorithmic Foundations Linear Programming and Matchings Paul G. Spirakis Department of Computer Science University of Patras and Liverpool Paul G. Spirakis
More informationThe Travelling Salesman Problem. in Fuzzy Membership Functions 1. Abstract
Chapter 7 The Travelling Salesman Problem in Fuzzy Membership Functions 1 Abstract In this chapter, the fuzzification of travelling salesman problem in the way of trapezoidal fuzzy membership functions
More informationOne-mode Additive Clustering of Multiway Data
One-mode Additive Clustering of Multiway Data Dirk Depril and Iven Van Mechelen KULeuven Tiensestraat 103 3000 Leuven, Belgium (e-mail: dirk.depril@psy.kuleuven.ac.be iven.vanmechelen@psy.kuleuven.ac.be)
More informationEpipolar Geometry and the Essential Matrix
Epipolar Geometry and the Essential Matrix Carlo Tomasi The epipolar geometry of a pair of cameras expresses the fundamental relationship between any two corresponding points in the two image planes, and
More informationFuzzy multi objective linear programming problem with imprecise aspiration level and parameters
An International Journal of Optimization and Control: Theories & Applications Vol.5, No.2, pp.81-86 (2015) c IJOCTA ISSN:2146-0957 eissn:2146-5703 DOI:10.11121/ijocta.01.2015.00210 http://www.ijocta.com
More informationIterative Algorithms I: Elementary Iterative Methods and the Conjugate Gradient Algorithms
Iterative Algorithms I: Elementary Iterative Methods and the Conjugate Gradient Algorithms By:- Nitin Kamra Indian Institute of Technology, Delhi Advisor:- Prof. Ulrich Reude 1. Introduction to Linear
More informationnag anova random (g04bbc)
g04 Analysis of Variance g04bbc 1. Purpose nag anova random (g04bbc) nag anova random (g04bbc) computes the analysis of variance and treatment means and standard errors for a randomized block or completely
More informationA Method for Construction of Orthogonal Arrays 1
Eighth International Workshop on Optimal Codes and Related Topics July 10-14, 2017, Sofia, Bulgaria pp. 49-54 A Method for Construction of Orthogonal Arrays 1 Iliya Bouyukliev iliyab@math.bas.bg Institute
More informationUnlabeled equivalence for matroids representable over finite fields
Unlabeled equivalence for matroids representable over finite fields November 16, 2012 S. R. Kingan Department of Mathematics Brooklyn College, City University of New York 2900 Bedford Avenue Brooklyn,
More informationWinning Positions in Simplicial Nim
Winning Positions in Simplicial Nim David Horrocks Department of Mathematics and Statistics University of Prince Edward Island Charlottetown, Prince Edward Island, Canada, C1A 4P3 dhorrocks@upei.ca Submitted:
More informationSECONDARY DRAFT SYLLABUS. 2. Representation of functions. 3. Types of functions. 4. Composition of functions (two and three)
et et et CLASS IX Topic :Set Language et et 1. Describing and representing sets SECONDARY DRAFT SYLLABUS Able to describe a set in Descriptive, Set- builder and roster forms and through Venn diagram. Use
More informationAn Introduction to Graph Theory
An Introduction to Graph Theory CIS008-2 Logic and Foundations of Mathematics David Goodwin david.goodwin@perisic.com 12:00, Friday 17 th February 2012 Outline 1 Graphs 2 Paths and cycles 3 Graphs and
More informationMATH 423 Linear Algebra II Lecture 17: Reduced row echelon form (continued). Determinant of a matrix.
MATH 423 Linear Algebra II Lecture 17: Reduced row echelon form (continued). Determinant of a matrix. Row echelon form A matrix is said to be in the row echelon form if the leading entries shift to the
More informationGraph Theory S 1 I 2 I 1 S 2 I 1 I 2
Graph Theory S I I S S I I S Graphs Definition A graph G is a pair consisting of a vertex set V (G), and an edge set E(G) ( ) V (G). x and y are the endpoints of edge e = {x, y}. They are called adjacent
More informationMATH3016: OPTIMIZATION
MATH3016: OPTIMIZATION Lecturer: Dr Huifu Xu School of Mathematics University of Southampton Highfield SO17 1BJ Southampton Email: h.xu@soton.ac.uk 1 Introduction What is optimization? Optimization is
More informationin this web service Cambridge University Press
978-0-51-85748- - Switching and Finite Automata Theory, Third Edition Part 1 Preliminaries 978-0-51-85748- - Switching and Finite Automata Theory, Third Edition CHAPTER 1 Number systems and codes This
More informationIntroduction to Graph Theory
Introduction to Graph Theory George Voutsadakis 1 1 Mathematics and Computer Science Lake Superior State University LSSU Math 351 George Voutsadakis (LSSU) Introduction to Graph Theory August 2018 1 /
More informationAVERAGE D-DISTANCE BETWEEN VERTICES OF A GRAPH
italian journal of pure and applied mathematics n. 33 2014 (293 298) 293 AVERAGE D-DISTANCE BETWEEN VERTICES OF A GRAPH D. Reddy Babu Department of Mathematics Koneru Lakshmaiah Education Foundation (K.L.
More informationIntroduction to Mathematical Programming IE406. Lecture 20. Dr. Ted Ralphs
Introduction to Mathematical Programming IE406 Lecture 20 Dr. Ted Ralphs IE406 Lecture 20 1 Reading for This Lecture Bertsimas Sections 10.1, 11.4 IE406 Lecture 20 2 Integer Linear Programming An integer
More information4. Simplicial Complexes and Simplicial Homology
MATH41071/MATH61071 Algebraic topology Autumn Semester 2017 2018 4. Simplicial Complexes and Simplicial Homology Geometric simplicial complexes 4.1 Definition. A finite subset { v 0, v 1,..., v r } R n
More information1. Represent each of these relations on {1, 2, 3} with a matrix (with the elements of this set listed in increasing order).
Exercises Exercises 1. Represent each of these relations on {1, 2, 3} with a matrix (with the elements of this set listed in increasing order). a) {(1, 1), (1, 2), (1, 3)} b) {(1, 2), (2, 1), (2, 2), (3,
More informationInformation Granulation and Approximation in a Decision-theoretic Model of Rough Sets
Information Granulation and Approximation in a Decision-theoretic Model of Rough Sets Y.Y. Yao Department of Computer Science University of Regina Regina, Saskatchewan Canada S4S 0A2 E-mail: yyao@cs.uregina.ca
More informationConic Duality. yyye
Conic Linear Optimization and Appl. MS&E314 Lecture Note #02 1 Conic Duality Yinyu Ye Department of Management Science and Engineering Stanford University Stanford, CA 94305, U.S.A. http://www.stanford.edu/
More informationTherefore, after becoming familiar with the Matrix Method, you will be able to solve a system of two linear equations in four different ways.
Grade 9 IGCSE A1: Chapter 9 Matrices and Transformations Materials Needed: Straightedge, Graph Paper Exercise 1: Matrix Operations Matrices are used in Linear Algebra to solve systems of linear equations.
More informationCHAPTER 3 DEVELOPMENT OF HEURISTICS AND ALGORITHMS
CHAPTER 3 DEVELOPMENT OF HEURISTICS AND ALGORITHMS 3.1 INTRODUCTION In this chapter, two new algorithms will be developed and presented, one using the Pascal s triangle method, and the other one to find
More informationExtending partial projective planes
Extending partial projective planes J. B. Nation In honor of my colleagues, Ralph Freese and Bill Lampe Abstract. This note discusses a computational method for constructing finite projective planes. Mathematics
More informationClassification with Diffuse or Incomplete Information
Classification with Diffuse or Incomplete Information AMAURY CABALLERO, KANG YEN Florida International University Abstract. In many different fields like finance, business, pattern recognition, communication
More informationA.1 Numbers, Sets and Arithmetic
522 APPENDIX A. MATHEMATICS FOUNDATIONS A.1 Numbers, Sets and Arithmetic Numbers started as a conceptual way to quantify count objects. Later, numbers were used to measure quantities that were extensive,
More informationParallel and perspective projections such as used in representing 3d images.
Chapter 5 Rotations and projections In this chapter we discuss Rotations Parallel and perspective projections such as used in representing 3d images. Using coordinates and matrices, parallel projections
More informationCS388C: Combinatorics and Graph Theory
CS388C: Combinatorics and Graph Theory David Zuckerman Review Sheet 2003 TA: Ned Dimitrov updated: September 19, 2007 These are some of the concepts we assume in the class. If you have never learned them
More informationInterval-Vector Polytopes
Interval-Vector Polytopes Jessica De Silva Gabriel Dorfsman-Hopkins California State University, Stanislaus Dartmouth College Joseph Pruitt California State University, Long Beach July 28, 2012 Abstract
More informationGenerating (n,2) De Bruijn Sequences with Some Balance and Uniformity Properties. Abstract
Generating (n,) De Bruijn Sequences with Some Balance and Uniformity Properties Yi-Chih Hsieh, Han-Suk Sohn, and Dennis L. Bricker Department of Industrial Management, National Huwei Institute of Technology,
More informationShort on camera geometry and camera calibration
Short on camera geometry and camera calibration Maria Magnusson, maria.magnusson@liu.se Computer Vision Laboratory, Department of Electrical Engineering, Linköping University, Sweden Report No: LiTH-ISY-R-3070
More informationChapter 4. Triangular Sum Labeling
Chapter 4 Triangular Sum Labeling 32 Chapter 4. Triangular Sum Graphs 33 4.1 Introduction This chapter is focused on triangular sum labeling of graphs. As every graph is not a triangular sum graph it is
More informationPart 4. Decomposition Algorithms Dantzig-Wolf Decomposition Algorithm
In the name of God Part 4. 4.1. Dantzig-Wolf Decomposition Algorithm Spring 2010 Instructor: Dr. Masoud Yaghini Introduction Introduction Real world linear programs having thousands of rows and columns.
More informationMany situations may be graphically summarized by marking down a finite set of points
Chapter 4 Graphs She must be seen to be appreciated. Old Saint Pauls Book I, W. H. AINSWORTH Many situations may be graphically summarized by marking down a finite set of points and drawing lines between
More informationThe Matrix-Tree Theorem and Its Applications to Complete and Complete Bipartite Graphs
The Matrix-Tree Theorem and Its Applications to Complete and Complete Bipartite Graphs Frankie Smith Nebraska Wesleyan University fsmith@nebrwesleyan.edu May 11, 2015 Abstract We will look at how to represent
More informationParameterization of triangular meshes
Parameterization of triangular meshes Michael S. Floater November 10, 2009 Triangular meshes are often used to represent surfaces, at least initially, one reason being that meshes are relatively easy to
More informationOn JAM of Triangular Fuzzy Number Matrices
117 On JAM of Triangular Fuzzy Number Matrices C.Jaisankar 1 and R.Durgadevi 2 Department of Mathematics, A. V. C. College (Autonomous), Mannampandal 609305, India ABSTRACT The fuzzy set theory has been
More informationMAT 3271: Selected Solutions to the Assignment 6
Chapter 2: Major Exercises MAT 3271: Selected Solutions to the Assignment 6 1. Since a projective plan is a model of incidence geometry, Incidence Axioms 1-3 and Propositions 2.1-2.5 (which follow logically
More informationLecture notes on Transportation and Assignment Problem (BBE (H) QTM paper of Delhi University)
Transportation and Assignment Problems The transportation model is a special class of linear programs. It received this name because many of its applications involve determining how to optimally transport
More informationConvex Optimization. 2. Convex Sets. Prof. Ying Cui. Department of Electrical Engineering Shanghai Jiao Tong University. SJTU Ying Cui 1 / 33
Convex Optimization 2. Convex Sets Prof. Ying Cui Department of Electrical Engineering Shanghai Jiao Tong University 2018 SJTU Ying Cui 1 / 33 Outline Affine and convex sets Some important examples Operations
More informationIMO Training 2010 Double Counting Victoria Krakovna. Double Counting. Victoria Krakovna
Double Counting Victoria Krakovna vkrakovna@gmail.com 1 Introduction In many combinatorics problems, it is useful to count a quantity in two ways. Let s start with a simple example. Example 1. (Iran 2010
More informationHAAR HUNGARIAN ALGORITHM TO SOLVE FUZZY ASSIGNMENT PROBLEM
Inter national Journal of Pure and Applied Mathematics Volume 113 No. 7 2017, 58 66 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu HAAR HUNGARIAN
More information