Risk factors for colonisation of newborn infants during an outbreak of extended-spectrum beta-lactamase-producing Klebsiella pneumoniae in an intermediate-risk neonatal unit

We describe a cross-sectional, survey to identify risk factors for colonisation of neonates by extended-spectrum P-Lactamase (ESBL)-producing Klebsiella pneumoniae. This occurred following exposure to a colonised healthcare worker during an outbreak in an intermediate-risk neonatal. unit. In total, 120 neonates admitted consecutively during a three-month period were screened for ESBL-producing K. pneumoniae by rectal swabbing and 27 were identified as colonised. Multivariate analysis showed colonisation to be independently associated with use of antibiotics and absence of breastfeeding. Previous use of antibiotics presented an odds ratio (OR) of 12.3 [95% confidence interval. (Cl): 3.66-41.2, P < 0.001]. The most commonly used antibiotics were penicillin and amikacin. Breastfeeding was associated with reduced risk for colonisation (OR: 0.22; 95% Cl: 0.05-0.99; P = 0.049). Nine isotates recovered during the first stage of the outbreak and 27 isolates from surveillance cultures were typed thereafter by pulsed-field gel electrophoresis, revealing six different profiles (A-F). Clones A, C, and E were implicated in the first stage of the outbreak, whereas among the 27 strains recovered from surveillance cultures, all six clones were identified. Clone A was also found on the hand of a nursing auxiliary with onychomycosis. We concluded that prior antimicrobial use predisposed to colonisation. The possible role of breastfeeding as a protective factor needs to be further elucidated. Detection of different genotypes of ESBL-producing K. pneumonioe suggests that dissemination of mobile genetic elements bearing the ESBL gene may have been superimposed on the simple dissemination of a clone during the outbreak. (c) 2008 The Hospital Infection Society. Published by Elsevier Ltd. All rights reserved.

Correlation Between Etest (R), Disk Diffusion, and Microdilution Methods for Antifungal Susceptibility Testing of Candida Species From Infection and Colonization

The correlation between the microdilution (MD), Etest (R) (ET), and disk diffusion (DD) methods was determined for amphotericin B, itraconazole and fluconazole. The minimal inhibitory concentration (MIC) of those antifungal agents was established for a total of 70 Candida spp. isolates from colonization and infection. The species distribution was: Candida albicans (n = 27), C. tropicalis (n = 17), C. glabrata (n = 16), C. parapsilosis (n = 8), and C. lusitaniae (n = 2). Non-Candida albicans Candida species showed higher MICs for the three antifungal agents when compared with C. albicans isolates. The overall concordance (based on the MIC value obtained within two dilutions) between the ET and the MD method was 83% for amphotericin B, 63% for itraconazole, and 64% for fluconazole. Considering the breakpoint, the agreement between the DD and MD methods was 71% for itraconazole and 67% for fluconazole. The DD zone diameters are highly reproducible and correlate well with the MD method, making agar-based methods a viable alternative to MD for susceptibility testing. However, data on agar-based tests for itraconazole and amphotericin B are yet scarce. Thus, further research must still be carded out to ensure the standardization to other antifungal agents. J. Clin. Lab. Anal. 23:324-330, 2009. (C) 2009 Wiley-Liss, Inc.

Texture analysis using graphs generated by deterministic partially self-avoiding walks

Texture is one of the most important visual attributes for image analysis. It has been widely used in image analysis and pattern recognition. A partially self-avoiding deterministic walk has recently been proposed as an approach for texture analysis with promising results. This approach uses walkers (called tourists) to exploit the gray scale image contexts in several levels. Here, we present an approach to generate graphs out of the trajectories produced by the tourist walks. The generated graphs embody important characteristics related to tourist transitivity in the image. Computed from these graphs, the statistical position (degree mean) and dispersion (entropy of two vertices with the same degree) measures are used as texture descriptors. A comparison with traditional texture analysis methods is performed to illustrate the high performance of this novel approach. (C) 2011 Elsevier Ltd. All rights reserved.

The Granada ignimbrite: A compound pyroclastic unit and its relationship with Upper Miocene caldera volcanism in the northern Puna

The Granada ignimbrite, an Upper Miocene volcanic unit from the northern Puna, previously has been interpreted as an extensive ignimbrite (>2300 km(2)) associated with eruptions from the Vilama caldera (trap-door event). On the basis of new data, we revise its correlation and redefine the unit as a compound, high aspect ratio ignimbrite, erupted at approximately 9.8 Ma. Calculated volumes (similar to 100 km(3)) are only moderate in comparison with other large volume (>1000 km(3)) ignimbrites that erupted approximately 2-6 m.y. later in the region (e.g. Vilama, Panizos, Atana). Six new volcanic units are recognized from sequences previously correlated with Granada (only one sourced from the same center). Consequently, the area ascribed to the Granada ignimbrite is substantially reduced (630 km(2)), and links to the Vilama caldera are not supported. Transport directions suggest the volcanic source for the Granada ignimbrite corresponds to vents buried under younger (>= 7.9-5 Ma) volcanic rocks of the Abra Granada volcanic complex. Episodes of caldera collapse at some stage of eruption are likely, though their nature and timing cannot be defined from available data. The eruption of the Granada ignimbrite marks the onset of a phase of large volume (caldera-sourced) volcanism in the northern Puna. (C) 2007 Elsevier Ltd. All rights reserved.

Demographic characteristics and prevalence of serologic markers among blood donors who use confidential unit exclusion (CUE) in Sao Paulo, Brazil: implications for modification of CUE polices in Brazil

BACKGROUND: This study evaluated demographic profiles and prevalence of serologic markers among donors who used confidential unit exclusion (CUE) to assess the effectiveness of CUE and guide public policies regarding the use of CUE for enhancing safety versus jeopardizing the blood supply by dropping CUE. STUDY DESIGN AND METHODS: We conducted a cross-sectional analysis of whole blood donations at a large public blood center in Sao Paulo from July 2007 through June 2009, compared demographic data, and confirmed serologic results among donors who used and who have never used CUE (CUE never). RESULTS: There were 265,550 whole blood units collected from 181,418 donors from July 2007 through June 2009. A total of 9658 (3.6%) units were discarded, 2973 (1.1%) because CUE was used at the current donation (CUE now) and 6685 (2.5%) because CUE was used in the past (CUE past). The CUE rate was highest among donors with less than 8 years of education (odds ratio [OR], 2.78; 95% confidence interval [CI], 2.51-3.08). CUE now donations were associated with higher positive infectious disease marker rates than CUE never donations (OR, 1.41; CI, 1.13-1.77), whereas CUE past donations were not (OR, 1.04; CI, 0.75-1.45). CONCLUSION: The CUE process results in a high rate of unit discard. CUE use on an individual donation appears predictive of a high-risk marker-positive donation and, thus, appears to contribute modestly to blood safety. The policy of discarding units from donors who have previously CUE-positive donations does not improve safety and should be discontinued.

Structural matching of 2D electrophoresis gels using deformed graphs

2D electrophoresis is a well-known method for protein separation which is extremely useful in the field of proteomics. Each spot in the image represents a protein accumulation and the goal is to perform a differential analysis between pairs of images to study changes in protein content. It is thus necessary to register two images by finding spot correspondences. Although it may seem a simple task, generally, the manual processing of this kind of images is very cumbersome, especially when strong variations between corresponding sets of spots are expected (e.g. strong non-linear deformations and outliers). In order to solve this problem, this paper proposes a new quadratic assignment formulation together with a correspondence estimation algorithm based on graph matching which takes into account the structural information between the detected spots. Each image is represented by a graph and the task is to find a maximum common subgraph. Successful experimental results using real data are presented, including an extensive comparative performance evaluation with ground-truth data. (C) 2010 Elsevier B.V. All rights reserved.

PARALLEL ALGORITHMS FOR MAXIMAL CLIQUES IN CIRCLE GRAPHS AND UNRESTRICTED DEPTH SEARCH

We present parallel algorithms on the BSP/CGM model, with p processors, to count and generate all the maximal cliques of a circle graph with n vertices and m edges. To count the number of all the maximal cliques, without actually generating them, our algorithm requires O(log p) communication rounds with O(nm/p) local computation time. We also present an algorithm to generate the first maximal clique in O(log p) communication rounds with O(nm/p) local computation, and to generate each one of the subsequent maximal cliques this algorithm requires O(log p) communication rounds with O(m/p) local computation. The maximal cliques generation algorithm is based on generating all maximal paths in a directed acyclic graph, and we present an algorithm for this problem that uses O(log p) communication rounds with O(m/p) local computation for each maximal path. We also show that the presented algorithms can be extended to the CREW PRAM model.

Performance evaluation of routing protocols for MANETs with known connectivity patterns using evolving graphs

The assessment of routing protocols for mobile wireless networks is a difficult task, because of the networks` dynamic behavior and the absence of benchmarks. However, some of these networks, such as intermittent wireless sensors networks, periodic or cyclic networks, and some delay tolerant networks (DTNs), have more predictable dynamics, as the temporal variations in the network topology can be considered as deterministic, which may make them easier to study. Recently, a graph theoretic model-the evolving graphs-was proposed to help capture the dynamic behavior of such networks, in view of the construction of least cost routing and other algorithms. The algorithms and insights obtained through this model are theoretically very efficient and intriguing. However, there is no study about the use of such theoretical results into practical situations. Therefore, the objective of our work is to analyze the applicability of the evolving graph theory in the construction of efficient routing protocols in realistic scenarios. In this paper, we use the NS2 network simulator to first implement an evolving graph based routing protocol, and then to use it as a benchmark when comparing the four major ad hoc routing protocols (AODV, DSR, OLSR and DSDV). Interestingly, our experiments show that evolving graphs have the potential to be an effective and powerful tool in the development and analysis of algorithms for dynamic networks, with predictable dynamics at least. In order to make this model widely applicable, however, some practical issues still have to be addressed and incorporated into the model, like adaptive algorithms. We also discuss such issues in this paper, as a result of our experience.

Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width

Let M = (V, E, A) be a mixed graph with vertex set V, edge set E and arc set A. A cycle cover of M is a family C = {C(1), ... , C(k)} of cycles of M such that each edge/arc of M belongs to at least one cycle in C. The weight of C is Sigma(k)(i=1) vertical bar C(i)vertical bar. The minimum cycle cover problem is the following: given a strongly connected mixed graph M without bridges, find a cycle cover of M with weight as small as possible. The Chinese postman problem is: given a strongly connected mixed graph M, find a minimum length closed walk using all edges and arcs of M. These problems are NP-hard. We show that they can be solved in polynomial time if M has bounded tree-width. (C) 2008 Elsevier B.V. All rights reserved.

Algorithms for Maximum Independent Set in Convex Bipartite Graphs

A bipartite graph G = (V, W, E) is convex if there exists an ordering of the vertices of W such that, for each v. V, the neighbors of v are consecutive in W. We describe both a sequential and a BSP/CGM algorithm to find a maximum independent set in a convex bipartite graph. The sequential algorithm improves over the running time of the previously known algorithm and the BSP/CGM algorithm is a parallel version of the sequential one. The complexity of the algorithms does not depend on |W|.

Packing triangles in low degree graphs and indifference graphs

We consider the problems of finding the maximum number of vertex-disjoint triangles (VTP) and edge-disjoint triangles (ETP) in a simple graph. Both problems are NP-hard. The algorithm with the best approximation ratio known so far for these problems has ratio 3/2 + epsilon, a result that follows from a more general algorithm for set packing obtained by Hurkens and Schrijver [On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems, SIAM J. Discrete Math. 2(1) (1989) 68-72]. We present improvements on the approximation ratio for restricted cases of VTP and ETP that are known to be APX-hard: we give an approximation algorithm for VTP on graphs with maximum degree 4 with ratio slightly less than 1.2, and for ETP on graphs with maximum degree 5 with ratio 4/3. We also present an exact linear-time algorithm for VTP on the class of indifference graphs. (C) 2007 Elsevier B.V. All rights reserved.

Sparse partition universal graphs for graphs of bounded degree

In 1983, Chvatal, Trotter and the two senior authors proved that for any Delta there exists a constant B such that, for any n, any 2-colouring of the edges of the complete graph K(N) with N >= Bn vertices yields a monochromatic copy of any graph H that has n vertices and maximum degree Delta. We prove that the complete graph may be replaced by a sparser graph G that has N vertices and O(N(2-1/Delta)log(1/Delta)N) edges, with N = [B`n] for some constant B` that depends only on Delta. Consequently, the so-called size-Ramsey number of any H with n vertices and maximum degree Delta is O(n(2-1/Delta)log(1/Delta)n) Our approach is based on random graphs; in fact, we show that the classical Erdos-Renyi random graph with the numerical parameters above satisfies a stronger partition property with high probability, namely, that any 2-colouring of its edges contains a monochromatic universal graph for the class of graphs on n vertices and maximum degree Delta. The main tool in our proof is the regularity method, adapted to a suitable sparse setting. The novel ingredient developed here is an embedding strategy that allows one to embed bounded degree graphs of linear order in certain pseudorandom graphs. Crucial to our proof is the fact that regularity is typically inherited at a scale that is much finer than the scale at which it is assumed. (C) 2011 Elsevier Inc. All rights reserved.

Hyperbolic unit groups and quaternion algebras

We classify the quadratic extensions K = Q[root d] and the finite groups G for which the group ring o(K)[G] of G over the ring o(K) of integers of K has the property that the group U(1)(o(K)[G]) of units of augmentation 1 is hyperbolic. We also construct units in the Z-order H(o(K)) of the quaternion algebra H(K) = (-1, -1/K), when it is a division algebra.

Integral group ring of the Suzuki sporadic simple group

Using the Luthar-Passi method, we investigate the classical Zassenhaus conjecture for the normalized unit group of the integral group ring of the Suzuki sporadic simple group Suz. As a consequence, for this group we confirm the Kimmerle`s conjecture on prime graphs.

Hypercentral unit groups and the hyperbolicity of a modular group algebra

We classify groups G such that the unit group U-1 (ZG) is hypercentral. In the second part, we classify groups G whose modular group algebra has hyperbolic unit groups U-1 (KG).