Trade spectra of complete partite graphs

The trade spectrum of a graph G is essentially the set of all integers t for which there is a graph H whose edges can be partitioned into t copies of G in two entirely different ways. In this paper we determine the trade spectrum of complete partite graphs, in all but a few cases.

Factorizations of and by powers of complete graphs

Let K-k(d) denote the Cartesian product of d copies of the complete graph K-k. We prove necessary and sufficient conditions for the existence of a K-k(r)-factorization of K-pn(s), where p is prime and k > 1, n, r and s are positive integers. (C) 2002 Elsevier Science B.V. All rights reserved.

Further decompositions of complete tripartite graphs into 5-cycles

Let K(r,s,t) denote the complete tripartite graph with partite sets of sizes r, s and t, where r less than or equal to s less than or equal to t. Necessary and sufficient conditions are given for decomposability of K(r, s, t) into 5-cycles whenever r, s and t are all even. This extends work done by Mahmoodian and Mirza-khani (Decomposition of complete tripartite graphs into 5-cycles, in: Combinatorics Advances, Kluwer Academic Publishers, Netherlands, 1995, pp. 235-241) and Cavenagh and Billington. (C) 2002 Elsevier Science B.V. All rights reserved.

Strongly regular graphs from differences of quadrics

In this note strongly regular graphs with new parameters are constructed using nested "blown up" quadrics in projective spaces. (C) 2002 Elsevier Science B.V. All rights reserved.

A prostaglandin F2a Analog induces suppressors of the cytokine signalling-3 expression n the corpus luteum of the pregnant rat: A potential new mechanism in luteolysis

PRL and placental lactogen (PL) play key roles in maintaining the rodent corpus luteum through pregnancy. Suppressors of cytokine signaling (SOCS) have been shown to decrease cell sensitivity to cytokines, including PRL, and so here we have addressed the issue of whether luteolysis induced by prostaglandin F-2alpha (PGF(2alpha)) might up-regulate SOCS proteins to inhibit PRL signaling. In d 19 pregnant rats, cloprostenol, a PGF(2alpha) analog, rapidly induced transcripts for SOCS-3 and, to a lesser extent, SOCS-1. We also found increased SOCS-3 protein in the ovary by immunoblot and in the corpus luteum by immunohistochemistry. Increased SOCS-3 expression was preceded by an increase in STAT3 tyrosine phosphorylation 10 min after cloprostenol injection and was maintained for 4 h, as determined by gel shift and immunohistochemistry. Induction of SOCS-3 was accompanied by a sharp decrease in active STAT5, as determined by gel-shift assay and by loss of nuclear localized STAT5. Four hours after cloprostenol administration, the corpus luteum was refractory to stimulation of STAT5 by PRL administration, and this was not due to down-regulation of PRL receptor. Therefore, induction of SOCS-3 by PGF(2alpha) may be an important element in the initiation of luteolysis via rapid suppression of luteotropic support from PL.

On the volume of 4-cycle trades

A 4-cycle trade of volume t corresponds to a simple graph G without isolated vertices, where the edge set can be partitioned into t 4-cycles in at least two different ways such that the two collections of 4-cycles have no 4-cycles in common. The foundation of the trade is v = \V(G)\. This paper determines for which values oft and a there exists a 4-cycle trade of volume t and foundation v.

Predicting cave initiation and propagation

The most widely used method for predicting the onset of continuous caving is Laubscher's caving chart. A detailed examination of this method was undertaken which concluded that it had limitations which may impact on results, particularly when dealing with stronger rock masses that are outside current experience. These limitations relate to inadequate guidelines for adjustment factors to rock mass rating (RMR), concerns about the position on the chart of critical case history data, undocumented changes to the method and an inadequate number of data points to be confident of stability boundaries. A review was undertaken on the application and reliability of a numerical method of assessing cavability. The review highlighted a number of issues, which at this stage, make numerical continuum methods problematic for predicting cavability. This is in particular reference to sensitivity to input parameters that are difficult to determine accurately and mesh dependency. An extended version of the Mathews method for open stope design was developed as an alternative method of predicting the onset of continuous caving. A number of caving case histories were collected and analyzed and a caving boundary delineated statistically on the Mathews stability graph. The definition of the caving boundary was aided by the existence of a large and wide-ranging stability database from non-caving mines. A caving rate model was extrapolated from the extended Mathews stability graph but could only be partially validated due to a lack of reliable data.

The tree cut and merge algorithm for estimation of network reliability

This article presents Monte Carlo techniques for estimating network reliability. For highly reliable networks, techniques based on graph evolution models provide very good performance. However, they are known to have significant simulation cost. An existing hybrid scheme (based on partitioning the time space) is available to speed up the simulations; however, there are difficulties with optimizing the important parameter associated with this scheme. To overcome these difficulties, a new hybrid scheme (based on partitioning the edge set) is proposed in this article. The proposed scheme shows orders of magnitude improvement of performance over the existing techniques in certain classes of network. It also provides reliability bounds with little overhead.

Decompositions of complete graphs into theta graphs with fewer than ten edges

A theta graph is a graph consisting of three pairwise internally disjoint paths with common end points. Methods for decomposing the complete graph K-nu into theta graphs with fewer than ten edges are given.

Winding patterns for actively shielded shim coils with asymmetric target-fields

A method is presented for calculating the currents and winding patterns required to design independent zonal and tesseral shim coils for magnetic resonance imaging. Both actively shielded and unshielded configurations are considered, and the region of interest can be located asymmetrically with respect to the coil's length. Streamline, target-field and Fourier-series methods are utilized. The desired target-field is specified at two cylindrical radii, on and inside a circular conducting cylinder of length 2L and radius a. The specification is over some asymmetric portion pL < z < qL of the coil's length (-1 < p < q < 1). Arbitrary functions are used in the outer sections, -L < z < pL and qL < z < L, to ensure continuity of the magnetic field across the entire length of the coil. The entire field is then periodically extended as a half-range cosine Fourier series about either end of the coil. The resultant Fourier coefficients are then substituted into the Fourier-series expressions for the internal and external magnetic fields, and current densities and stream functions on both the primary coil and shield. A contour plot of the stream function directly gives the required coil winding patterns. Spherical harmonic analysis and shielding analysis on field calculations from a ZX shim coil indicate that example designs and theory are well matched.

Evaluation of encapsulation techniques of probiotics for yoghurt

The health benefits provided by probiotic bacteria have led to their increasing use in fermented and other dairy products. However, their viability in these products is low. Encapsulation has been investigated to protect the bacteria in the product's environment and improve their survival. There are two common encapsulation techniques, namely extrusion and emulsion, to encapsulate the probiotics for their use in the fermented and other dairy products. This review evaluates the merits and limitations of these two techniques, and also discusses the supporting materials and special treatments used in encapsulation processes. (C) 2003 Elsevier Science Ltd. All rights reserved.

Mapping the royal road and other hierarchical functions

In this paper we present a technique for visualising hierarchical and symmetric, multimodal fitness functions that have been investigated in the evolutionary computation literature. The focus of this technique is on landscapes in moderate-dimensional, binary spaces (i.e., fitness functions defined over {0, 1}(n), for n less than or equal to 16). The visualisation approach involves an unfolding of the hyperspace into a two-dimensional graph, whose layout represents the topology of the space using a recursive relationship, and whose shading defines the shape of the cost surface defined on the space. Using this technique we present case-study explorations of three fitness functions: royal road, hierarchical-if-and-only-if (H-IFF), and hierarchically decomposable functions (HDF). The visualisation approach provides an insight into the properties of these functions, particularly with respect to the size and shape of the basins of attraction around each of the local optima.

Avaliação de caracteres agronômicos da cultura do milho mediante a redução do espaçamento entre linhas e aumento da densidade populacional

Atualmente, no Brasil, vem ocorrendo grande adoção da tecnologia de redução do espaçamento entre linhas e aumento da densidade populacional na cultura do milho (Zea mays L.). Objetivando avaliar a influência da variação de espaçamento entre linhas e densidade de plantio da cultura do milho, um experimento foi instalado na fazenda Santa Rita (Araporã-MG). Utilizou-se o delineamento experimental em blocos casualizados, em esquema fatorial 2 x 3, sendo dois espaçamentos, 0,45 e 0,90 m, e três densidades populacionais, 60.000, 75.000 e 90.000 pl ha-1, com quatro repetições, em que cada parcela foi constituída de quatro linhas de 4 m de comprimento. Consideram-se para avaliação as duas linhas centrais, desprezando 0,5 m em ambas as extremidades. Avaliaram-se os seguintes caracteres agronômicos: diâmetro dos colmos, altura de plantas, altura da inserção das espigas, produtividade, peso de 1.000 grãos (g), comprimento de espiga (cm), número de fileiras de grãos por espiga, número de grãos por fileira, e porcentagem de espigas por parcela (%). Observou-se incremento significativo na produtividade da cultura tanto com a redução do espaçamento entre linhas quanto com o aumento da densidade populacional.

GUI Inspection from Source Code Analysis

Graphical user interfaces (GUIs) are critical components of todays software. Given their increased relevance, correctness and usability of GUIs are becoming essential. This paper describes the latest results in the development of our tool to reverse engineer the GUI layer of interactive computing systems. We use static analysis techniques to generate models of the user interface behaviour from source code. Models help in graphical user interface inspection by allowing designers to concentrate on its more important aspects. One particularly type of model that the tool is able to generate is state machines. The paper shows how graph theory can be useful when applied to these models. A number of metrics and algorithms are used in the analysis of aspects of the user interface's quality. The ultimate goal of the tool is to enable analysis of interactive system through GUIs source code inspection.

Program slicing by calculation

Program slicing is a well known family of techniques used to identify code fragments which depend on or are depended upon specific program entities. They are particularly useful in the areas of reverse engineering, program understanding, testing and software maintenance. Most slicing methods, usually oriented towards the imperative or object paradigms, are based on some sort of graph structure representing program dependencies. Slicing techniques amount, therefore, to (sophisticated) graph transversal algorithms. This paper proposes a completely different approach to the slicing problem for functional programs. Instead of extracting program information to build an underlying dependencies’ structure, we resort to standard program calculation strategies, based on the so-called Bird-Meertens formalism. The slicing criterion is specified either as a projection or a hiding function which, once composed with the original program, leads to the identification of the intended slice. Going through a number of examples, the paper suggests this approach may be an interesting, even if not completely general, alternative to slicing functional programs