A family of perfect factorisations of complete bipartite graphs

A 1-factorisation of a graph is perfect if the union of any two of its 1-factors is a Hamiltonian cycle. Let n = p(2) for an odd prime p. We construct a family of (p-1)/2 non-isomorphic perfect 1-factorisations of K-n,K-n. Equivalently, we construct pan-Hamiltonian Latin squares of order n. A Latin square is pan-Hamiltoilian if the permutation defined by any row relative to any other row is a single Cycle. (C) 2002 Elsevier Science (USA).

C4-saturated bipartite graphs

Let H be a graph. A graph G is said to be H-free if it contains no subgraph isomorphic to H. A graph G is said to be an H-saturated subgraph of a graph K if G is an H-free subgraph of K with the property that for any edge e is an element of E(K)\E(G), G boolean OR {e} is not H-free. We present some general results on K-s,K-t-saturated subgraphs of the complete bipartite graph K-m,K-n and study the problem of finding, for all possible values of q, a C-4-saturated subgraph of K., having precisely q edges. (C) 2002 Elsevier Science B.V. All rights reserved.

Polarization vision and its role in biological signaling

Visual pigments, the molecules in photoreceptors that initiate the process of vision, are inherently dichroic, differentially absorbing light according to its axis of polarization. Many animals have taken advantage of this property to build receptor systems capable of analyzing the polarization of incoming light, as polarized light is abundant in natural scenes (commonly being produced by scattering or reflection). Such polarization sensitivity has long been associated with behavioral tasks like orientation or navigation. However, only recently have we become aware that it can be incorporated into a high-level visual perception akin to color vision, permitting segmentation of a viewed scene into regions that differ in their polarization. By analogy to color vision, we call this capacity polarization vision. It is apparently used for tasks like those that color vision specializes in: contrast enhancement, camouflage breaking, object recognition, and signal detection and discrimination. While color is very useful in terrestrial or shallow-water environments, it is an unreliable cue deeper in water due to the spectral modification of light as it travels through water of various depths or of varying optical quality. Here, polarization vision has special utility and consequently has evolved in numerous marine species, as well as at least one terrestrial animal. In this review, we consider recent findings concerning polarization vision and its significance in biological signaling.

A comparative study of similarity measures for manufacturing cell formation

We introduced a spectral clustering algorithm based on the bipartite graph model for the Manufacturing Cell Formation problem in [Oliveira S, Ribeiro JFF, Seok SC. A spectral clustering algorithm for manufacturing cell formation. Computers and Industrial Engineering. 2007 [submitted for publication]]. It constructs two similarity matrices; one for parts and one for machines. The algorithm executes a spectral clustering algorithm on each separately to find families of parts and cells of machines. The similarity measure in the approach utilized limited information between parts and between machines. This paper reviews several well-known similarity measures which have been used for Group Technology. Computational clustering results are compared by various performance measures. (C) 2008 The Society of Manufacturing Engineers. Published by Elsevier Ltd. All rights reserved.

A spectral clustering algorithm for manufacturing cell formation

A graph clustering algorithm constructs groups of closely related parts and machines separately. After they are matched for the least intercell moves, a refining process runs on the initial cell formation to decrease the number of intercell moves. A simple modification of this main approach can deal with some practical constraints, such as the popular constraint of bounding the maximum number of machines in a cell. Our approach makes a big improvement in the computational time. More importantly, improvement is seen in the number of intercell moves when the computational results were compared with best known solutions from the literature. (C) 2009 Elsevier Ltd. All rights reserved.

Characterization of temperature dependent and substrate-binding cleft movements in Bacillus circulans family 11 xylanase: A molecular dynamics investigation

Background: Xylanases (EC 3.2.1.8) hydrolyze xylan, one of the most abundant plant polysaccharides found in nature, and have many potential applications in biotechnology. Methods: Molecular dynamics simulations were used to investigate the effects of temperature between 298 to 338 K and xylobiose binding on residues located in the substrate-binding cleft of the family 11 xylanase from Bacillus circulans (BcX). Results: In the absence of xylobiose the BcX exhibits temperature dependent movement of the thumb region which adopts an open conformation exposing the active site at the optimum catalytic temperature (328 K). In the presence of substrate, the thumb region restricts access to the active site at all temperatures, and this conformation is maintained by substrate/protein hydrogen bonds involving active site residues, including hydrogen bonds between Tyr69 and the 2` hydroxyl group of the substrate. Substrate access to the active site is regulated by temperature dependent motions that are restricted to the thumb region, and the BcX/substrate complex is stabilized by extensive intermolecular hydrogen bonding with residues in the active site. General significance: These results call for a revision of both the ""hinge-bending"" model for the activity of group 11 xylanases, and the role of Tyr69 in the catalytic mechanism. (C) 2009 Elsevier B.V. All rights reserved.

Political Parties and Governors as Determinants of Legislative Behavior in Brazil`s Chamber of Deputies, 1988-2006

This article examines the relative importance of regional and national forces in shaping the behavior of Brazilian legislators at the national level. A widely held view is that national legislators respond to state pressures in making decisions, rather than pressures from the national government. Governors not only can influence national debates but also can determine outcomes by exerting control over their states` legislative delegations. This article examines a dataset of all roll-call votes in the Chamber of Deputies between 1989 and 2006 to isolate and evaluate the impact of local pressures on legislative voting. Spanning the terms of five presidents and five different congresses, the data show that the local influence is weaker than the national on the voting decisions of individual legislators and the voting cohesion of state delegations. Alternative institutional resources allow the central government to counteract the centrifugal pressures of federalism and other institutional influences.

Trade spectrum of K4-e

A K-4 - e trade consists of two disjoint decompositions of some simple graph H into copies of K-4 - e. The number of vertices of H is referred to as the foundation of the trade, while the number of copies of K-4 - e in each of the decompositions is called the volume of the trade. We determine the values of v and s for which there exists a K-4 - e trade of volume s and foundation v.

A family of perfect hashing methods

Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algorithms for generating order preserving minimal perfect hash functions. We show that almost all members of the family construct space and time optimal order preserving minimal perfect hash functions, and we identify the one with minimum constants. Members of the family generate a hash function in two steps. First a special kind of function into an r-graph is computed probabilistically. Then this function is refined deterministically to a minimal perfect hash function. We give strong theoretical evidence that the first step uses linear random time. The second step runs in linear deterministic time. The family not only has theoretical importance, but also offers the fastest known method for generating perfect hash functions.

On the spectrum for K_{m+2}/K_m designs

The spectrum problem for the decomposition of K-n into copies of the graph K_{m+2}\K_m is solved for n = 0 or 1 (mod 2m + 1). (C) 1997 John Wiley & Sons, Inc.

Multifocal Renal Allograft Biopsy: Impact on Therapeutic Decisions

Objective. There are no data to support the suggestion that samples removed from one segment of the transplanted kidney are representative of the whole graft. The aim of this study was to compare the histological differences between biopsies obtained from different portions of the renal allograft and their impact on treatment recommendations. Patients and Methods. Two hundred percutaneous biopsies were performed on kidney allografts and samples were collected from the upper and lower poles (100 kidneys). All samples were randomized and blindly reviewed. We obtained the discordance rates between the poles for the grading of acute rejection and for the diagnosis of nephrotoxicity due to immunosuppression. We also checked if the differences found were sufficient to call for different clinical recommendations. These values were compared with the intrapathologist variation rates. Results. In 70 kidneys adequate sampling was obtained from both poles. The diagnosis of acute rejection were made in 1.7. The discordance rate between the upper and lower poles was 82.3% (kappa = 0.34), higher than the intrapathologist variation (P =.002). Nephrotoxicity was found in 14 kidneys. The discordance rate between the upper and lower poles was 28.6% (kappa = 0.88), with no difference compared with the intrapathologist variation. In 14 of the 70 kidneys (25.7%), discordances between poles had impact on clinical recommendations, most of these cases due to different gradings of acute rejection (78%). This number was higher than the intrapathologist variation (P =.04). Conclusions. The histopathological changes in the kidney allograft are not always homogeneous. This heterogeneity may affect the therapeutic recommendations.

d-cube decompositions of K-n/K-m

Necessary conditions on n, m and d are given for the existence of an edge-disjoint decomposition of K-n\K-m into copies of the graph of a d-dimensional cube. Sufficiency is shown when d = 3 and, in some cases, when d = 2(t). We settle the problem of embedding 3-cube decompositions of K-m into 3-cube decompositions of K-n; where n greater than or equal to m.

Preaortic Iliac Confluence (Marsupial Vena Cava): Report of 4 Cases

Congenital anomalies of the inferior vena cava (IVC) call represent a difficult for abdominal surgeries, and the radiologist must be aware even of the less common of these anatomical variations. Preaortic iliac venous confluence, also known as marsupial vena cava, is a rare congenital anomaly of the development of the IVC in which the IVC or the left common iliac vein is located anterior to the aortic bifurcation or the right common iliac artery. We report 4 cases of marsupial vena cava detected on multidetector computed tomography examinations in asymptomatic patients and discuss that this congenital anomaly can be recognized more frequently with the use of this new technique based on thinner images.

Supporting contexts in program refinement

A program can be refined either by transforming the whole program or by refining one of its components. The refinement of a component is, for the main part, independent of the remainder of the program. However, refinement of a component can depend on the context of the component for information about the variables that are in scope and what their types are. The refinement can also take advantage of additional information, such as any precondition the component can assume. The aim of this paper is to introduce a technique, which we call program window inference, to handle such contextual information during derivations in the refinement calculus. The idea is borrowed from a technique, called window inference, for handling context in theorem proving. Window inference is the primary proof paradigm of the Ergo proof editor. This tool has been extended to mechanize refinement using program window inference. (C) 1997 Elsevier Science B.V.