Quantitative Detection of Enterotoxigenic Bacteroides fragilis Subtypes Isolated from Children with and without Diarrhea

A rapid real-time PCR ( RT-PCR) approach was developed to detect the bft gene subtypes in Bacteroides fragilis isolated from fecal samples. DNA obtained from diarrhea (110) and nondiarrhea (150) samples was evaluated. Subtype 1 was observed in 9 (8.2%) diarrhea and 7 (4.7%) nondiarrhea samples. Subtype 2 was not detected in any DNA samples, and subtype 3 was observed in only 1 diarrhea sample. The presence of the bft-1 gene did not show any statistically significant differences between the groups of children. This technique could be used to evaluate a possible correlation between disease and the presence of B. fragilis enterotoxin.

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 results of running parallel applications on the InteGrade

The InteGrade middleware intends to exploit the idle time of computing resources in computer laboratories. In this work we investigate the performance of running parallel applications with communication among processors on the InteGrade grid. As costly communication on a grid can be prohibitive, we explore the so-called systolic or wavefront paradigm to design the parallel algorithms in which no global communication is used. To evaluate the InteGrade middleware we considered three parallel algorithms that solve the matrix chain product problem, the 0-1 Knapsack Problem, and the local sequence alignment problem, respectively. We show that these three applications running under the InteGrade middleware and MPI take slightly more time than the same applications running on a cluster with only LAM-MPI support. The results can be considered promising and the time difference between the two is not substantial. The overhead of the InteGrade middleware is acceptable, in view of the benefits obtained to facilitate the use of grid computing by the user. These benefits include job submission, checkpointing, security, job migration, etc. Copyright (C) 2009 John Wiley & Sons, Ltd.

A multi-GPU algorithm for large-scale neuronal networks

Large-scale simulations of parts of the brain using detailed neuronal models to improve our understanding of brain functions are becoming a reality with the usage of supercomputers and large clusters. However, the high acquisition and maintenance cost of these computers, including the physical space, air conditioning, and electrical power, limits the number of simulations of this kind that scientists can perform. Modern commodity graphical cards, based on the CUDA platform, contain graphical processing units (GPUs) composed of hundreds of processors that can simultaneously execute thousands of threads and thus constitute a low-cost solution for many high-performance computing applications. In this work, we present a CUDA algorithm that enables the execution, on multiple GPUs, of simulations of large-scale networks composed of biologically realistic Hodgkin-Huxley neurons. The algorithm represents each neuron as a CUDA thread, which solves the set of coupled differential equations that model each neuron. Communication among neurons located in different GPUs is coordinated by the CPU. We obtained speedups of 40 for the simulation of 200k neurons that received random external input and speedups of 9 for a network with 200k neurons and 20M neuronal connections, in a single computer with two graphic boards with two GPUs each, when compared with a modern quad-core CPU. Copyright (C) 2010 John Wiley & Sons, Ltd.

An all-substrings common subsequence algorithm

Given two strings A and B of lengths n(a) and n(b), n(a) <= n(b), respectively, the all-substrings longest common subsequence (ALCS) problem obtains, for every substring B` of B, the length of the longest string that is a subsequence of both A and B. The ALCS problem has many applications, such as finding approximate tandem repeats in strings, solving the circular alignment of two strings and finding the alignment of one string with several others that have a common substring. We present an algorithm to prepare the basic data structure for ALCS queries that takes O(n(a)n(b)) time and O(n(a) + n(b)) space. After this preparation, it is possible to build that allows any LCS length to be retrieved in constant time. Some trade-offs between the space required and a matrix of size O(n(b)(2)) the querying time are discussed. To our knowledge, this is the first algorithm in the literature for the ALCS problem. (C) 2007 Elsevier B.V. All rights reserved.

Interfacial Electron Transfer Dynamics Following Laser Flash Photolysis of [Ru(bpy)(2)((4,4 `-PO(3)H(2))(2)bpy)](2+) in TiO(2) Nanoparticle Films in Aqueous Environments

Nanosecond laser flash photolysis has been used to investigate injection and back electron transfer from the complex [(Ru-(bpy)(2)(4,4`-(PO(3)H(2))(2)bpy)](2+) surface-bound to TiO(2) (TiO(2)-Ru(II)). The measurements were conducted under conditions appropriate for water oxidation catalysis by known single-site water oxidation catalysts. Systematic variations in average lifetimes for back electron transfer, - were observed with changes in pH, surface coverage, incident excitation intensity, and applied bias. The results were qualitatively consistent with a model involving rate-limiting thermal activation of injected electrons from trap sites to the conduction band or shallow trap sites followed by site-to-site hopping and interfacial electron transfer, TiO(2)(e(-))-Ru(3+) -> TiO(2)-Ru(2+). The appearance of pH-dependent decreases in the efficiency of formation of TiO(2)-Ru(3+) and in incident-photon-to-current efficiencies with the added reductive scavenger hydroquinone point to pH-dependent back electron transfer processes on both the sub-nanosecond and millisecond-microsecond time scales, which could be significant in limiting long-term storage of multiple redox equivalents.