The extended metamorphosis of a complete bipartite design into a cycle system

A K-t,K-t-design of order n is an edge-disjoint decomposition of K-n into copies of K-t,K-t. When t is odd, an extended metamorphosis of a K-t,K-t-design of order n into a 2t-cycle system of order n is obtained by taking (t - 1)/2 edge-disjoint cycles of length 2t from each K-t,K-t block, and rearranging all the remaining 1-factors in each K-t,K-t block into further 2t-cycles. The 'extended' refers to the fact that as many subgraphs isomorphic to a 2t-cycle as possible are removed from each K-t,K-t block, rather than merely one subgraph. In this paper an extended metamorphosis of a K-t,K-t-design of order congruent to 1 (mod 4t(2)) into a 2t-cycle system of the same order is given for all odd t > 3. A metamorphosis of a 2-fold K-t,K-t-design of any order congruent to 1 (mod 4t(2)) into a 2t-cycle system of the same order is also given, for all odd t > 3. (The case t = 3 appeared in Ars Combin. 64 (2002) 65-80.) When t is even, the graph K-t,K-t is easily seen to contain t/2 edge-disjoint cycles of length 2t, and so the metamorphosis in that case is straightforward. (C) 2004 Elsevier B.V. All rights reserved.

Variance-balanced designs under interference for dependent observations

It is shown that variance-balanced designs can be obtained from Type I orthogonal arrays for many general models with two kinds of treatment effects, including ones for interference, with general dependence structures. These designs can be used to obtain optimal and efficient designs. Some examples and design comparisons are given. (C) 2002 Elsevier B.V. All rights reserved.

On the forced matching numbers of bipartite graphs

Let G be a graph that admits a perfect matching. A forcing set for a perfect matching M of G is a subset S of M, such that S is contained in no other perfect matching of G. This notion has arisen in the study of finding resonance structures of a given molecule in chemistry. Similar concepts have been studied for block designs and graph colorings under the name defining set, and for Latin squares under the name critical set. There is some study of forcing sets of hexagonal systems in the context of chemistry, but only a few other classes of graphs have been considered. For the hypercubes Q(n), it turns out to be a very interesting notion which includes many challenging problems. In this paper we study the computational complexity of finding the forcing number of graphs, and we give some results on the possible values of forcing number for different matchings of the hypercube Q(n). Also we show an application to critical sets in back circulant Latin rectangles. (C) 2003 Elsevier B.V. All rights reserved.

A laboratory experiment, based on the maillard reaction, conducted as a project in introductory statistics

A simple laboratory experiment, based on the Maillard reaction, served as a project in Introductory Statistics for undergraduates in Food Science and Technology. By using the principles of randomization and replication and reflecting on the sources of variation in the experimental data, students reinforced the statistical concepts and techniques introduced to them in lectures before the experiment. The experiment was run simultaneously by several student groups, using the same materials. Comparing the results of their analyses of variance, students became aware of the difference between P values and significance levels in making statistical decisions. In the experiment, the complete randomized design was applied; however, it is easy to adjust the experiment to teach students simple regression and randomized block designs.

Existence of complementary pairs of proportionally balanced designs

Proportionally balanced designs (pi BDs) were introduced by Gray and Matters in response to a need for the allocation of markers of the Queensland Core Skills Test to have a certain property. Subsequent papers extended the theoretical results relating to such designs and provided further instances and general constructions. This work focused on designs comprising blocks of precisely two sizes, and when each variety occurs with one of precisely two possible frequencies. Two designs based on the set V of varieties are complementary if, whenever B is a block of one, then its complement with regard to the set V is a block of the other. Here we present necessary conditions for the existence of complementary pairs of such pi BDs and provide lists of some restricted parameter sets satisfying these necessary conditions. The lists are arranged according to the number of blocks. We demonstrate that not all of these parameter sets give rise to designs. However we establish by construction of the sets of blocks that, for every feasible number of blocks less than or equal to 100, with the possible exception of 63, there exists at least one pair of complementary pi BDs. We also investigate the conditions under which the complementary design can be isomorphic to the original design, and again provide a list of feasible parameters for pairs of such designs with at most 400 blocks.

Embedding a restricted class of partial K-4-designs

Given a partial K-4-design (X, P), if x is an element of X is a vertex which occurs in exactly one block of P, then call x a free vertex. In this paper, a technique is described for obtaining a cubic embedding of any partial K-4-design with the property that every block in the partial design contains at least two free vertices.

Interface adaptor logic: A new model for interfacing peripherals in IP based designs

The introduction of standard on-chip buses has eased integration and boosted the production of IP functional cores. However, once an IP is bus specific retargeting to a different bus is time-consuming and tedious, and this reduces the reusability of the bus-specific IP. As new bus standards are introduced and different interconnection methods are proposed, this problem increases. Many solutions have been proposed, however these solutions either limit the IP block performance or are restricted to a particular platform. A new concept is presented that can connect IP blocks to a wide variety of interface architectures with low overhead. This is achieved through the use a special interface adaptor logic layer.