Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 27788 for “"designs"”.
-
Designs
Designs is an algorithmic composition for small orchestra. The main compositional process used involves the realization and implementation of various musical algorithms discussed in the book Composition with Pitch-Classes by theorist/composer Robert Morris.
-
Interior designs
NOT AVAILABLE
-
αₙ-Designs
… a broad class of resolvable incomplete block designs for multifactor experiments, called αₙ-designs. A general methodology for their construction is described and is shown to be a natural extension of the method used by Patterson and Williams (1976) in their construction of α-designs. In fact, …
-
Cyclic Designs
Cyclic designs are incomplete block designs consisting of sets of blocks where in each set successive blocks are obtained in a cyclic manner from the first block of the set. It is convenient to label the objects (treatments) by the integers 0, 1, …, n-. Then if for a particular set the first block …
-
Graph designs
… immersioni, colorazioni e metamorfosi di Graph Designs e una applicazione alle reti.
-
Thickly resolvable designs
… of what we now call resolvable pairwise balanced designs, which balance pair coverage of points within blocks while also demanding that the blocks can be grouped in such a way that each group partitions the point-set. Our generalization aims to relax this condition slightly, so that each group of …
-
Composite Box Designs
Until approximately ten years ago, response surfaces were fitted by means which required cumbersome calculational procedures as in multiple regression analyses or much experimentation as in orthogonal polynomials. Dr. G.E.P. Box, presently at the University of Wisconsin, has designed what is called …
-
Imprimitively generated designs
Designs are a type of combinatorial object which uniformly cover all pairs in a base set V with subsets of V known as blocks. One important class of designs are those generated by a permutation group G acting on V and single initial block b subset of V. The most atomic examples of these designs …
-
Constrained optimal designs
… to a particular criterion within the class of designs that achieve at least that minimal quality. This leads to a constrained optimality problem, and takes account of several criteria simultaneously;Several specific constrained criteria are suggested and discussed in detail. The performance and …
-
On graphical designs
… question in the theory of combinatorial designs is to ask what designs can be obtained with a particular automorphism group. This work completely determines all proper Steiner graphical t-wise balanced designs that have the group $S\sb{n}\ wr\ S\sb{r}$ (wreath product) acting on the set …
-
Minimal multidimensional designs
… number of assemblies, minimal multidimensional designs (MMD's) and minimal augmented multidimensional designs (MAMD's). Such designs are incomplete factorials which allow for only some two-factor interactions. An analysis of incomplete factorials with and without interactions is developed from a …
-
Symmetrical complementation designs
The “Symmetrical Complementation Design” which is discussed in this dissertation is intended for those experimental situations where the levels of three factors always sum to the same constant. The levels of the factors, if referred to a common unit of measurement, must be equally spaced. Certain …
-
Change-over designs
… be taken into consideration. A number of various designs have been developed for this purpose. A number of them are presented in this paper and can be summarized as follows: Type I: Balanced for first-order residual effects. For n, the number of treatments, even, any number of Latin squares can be …
-
The Existence of Balanced Tournament Designs and Partitioned Balanced Tournament Designs
A balanced tournament design of order <I>n</I>, BTD(<I>n</I>), defined on a 2<I>n</I>-set<I> V</i>, is an arrangement of the all of the (2<I>n</i>2) distinct unordered pairs of elements of <I>V</I> into an <I>n</I> X (2<I>n</i> - 1) array such that (1) every element of <I>V</i> occurs exactly once …
-
A new class of designs and singly or doubly equivalent designs
… [lambda])-difference sets and ('v, k', [lambda])-designs. In this thesis, we will introduce a new class of difference sets and designs: ('v, k', [[lambda]1, [lambda]2, ... , [lambda]' m']) difference sets and ('v, k', [[lambda] 1, [lambda]2, ... , [lambda]'m'])-designs. We will also introduce the …
-
On properties and constructions of t -designs, lambda -designs and perpendicular arrays
… three types of combinatorial configurations: t-designs, perpendicular arrays, and $\lambda$-designs. On t-designs. Khosrovshahi and Ajoodani-Namini give a new method for extending t-designs with k = t + 1. They obtain a recursive construction for t-designs and for large sets. Here we generalize …
-
Augmenting Definitive Screening Designs
… Some standard and classical response surface designs are $3^k$ Factorial Designs, Central Composite Designs (CCDs), and Box-Behnken Designs (BBDs). They can all be used to fit a second-order polynomial model efficiently and allow for some testing of the model's lack of fit. When performing …
Page 1 of 1390