Tracking the Fate of Microbially Sequestered Carbon Dioxide in Soil Organic Matter

The microbial contribution to soil organic matter (SOM) has recently been shown to be much larger than previously thought and thus its role in carbon sequestration may also be underestimated. In this study we employ C-13 ((CO2)-C-13) to assess the potential CO2 sequestration capacity of soil chemoautotrophic bacteria and combine nuclear magnetic resonance (NMR) with stable isotope probing (SIP), techniques that independently make use of the isotopic enrichment of soil microbial biomass. In this way molecular information generated from NMR is linked with identification of microbes responsible for carbon capture. A mathematical model is developed to determine real-time CO2 flux so that net sequestration can be calculated. Twenty-eight groups of bacteria showing close homologies with existing species were identified. Surprisingly, Ralstonia eutropha was the dominant group. Through NMR we observed the formation of lipids, carbohydrates, and proteins produced directly from CO2 utilized by microbial biomass. The component of SOM directly associated with CO2 capture was calculated at 2.86 mg C (89.21 mg kg(-1)) after 48 h. This approach can,differentiate between SOM derived through microbial uptake of CO2 and other SOM constituents and represents a first step in tracking the fate and dynamics of microbial biomass in soil.

Behavioural context of multi-scale species distribution models assessed by radio-tracking

Incorporating ecological processes and animal behaviour into Species Distribution Models (SDMs) is difficult. In species with a central resting or breeding place, there can be conflict between the environmental requirements of the 'central place' and foraging habitat. We apply a multi-scale SDM to examine habitat trade-offs between the central place, roost sites, and foraging habitat in . Myotis nattereri. We validate these derived associations using habitat selection from behavioural observations of radio-tracked bats. A Generalised Linear Model (GLM) of roost occurrence using land cover variables with mixed spatial scales indicated roost occurrence was positively associated with woodland on a fine scale and pasture on a broad scale. Habitat selection of radio-tracked bats mirrored the SDM with bats selecting for woodland in the immediate vicinity of individual roosts but avoiding this habitat in foraging areas, whilst pasture was significantly positively selected for in foraging areas. Using habitat selection derived from radio-tracking enables a multi-scale SDM to be interpreted in a behavioural context. We suggest that the multi-scale SDM of . M. nattereri describes a trade-off between the central place and foraging habitat. Multi-scale methods provide a greater understanding of the ecological processes which determine where species occur and allow integration of behavioural processes into SDMs. The findings have implications when assessing the resource use of a species at a single point in time. Doing so could lead to misinterpretation of habitat requirements as these can change within a short time period depending on specific behaviour, particularly if detectability changes depending on behaviour. © 2011 Gesellschaft für ökologie.

Establishing optimal quantitative-polymerase chain reaction assays for routine diagnosis and tracking of minimal residual disease in JAK2-V617F-associated myeloproliferative neoplasms:a joint European LeukemiaNet/MPN&MPNr-EuroNet (COST action BM0902) study

Reliable detection of JAK2-V617F is critical for accurate diagnosis of myeloproliferative neoplasms (MPNs); in addition, sensitive mutation-specific assays can be applied to monitor disease response. However, there has been no consistent approach to JAK2-V617F detection, with assays varying markedly in performance, affecting clinical utility. Therefore, we established a network of 12 laboratories from seven countries to systematically evaluate nine different DNA-based quantitative PCR (qPCR) assays, including those in widespread clinical use. Seven quality control rounds involving over 21,500 qPCR reactions were undertaken using centrally distributed cell line dilutions and plasmid controls. The two best-performing assays were tested on normal blood samples (n=100) to evaluate assay specificity, followed by analysis of serial samples from 28 patients transplanted for JAK2-V617F-positive disease. The most sensitive assay, which performed consistently across a range of qPCR platforms, predicted outcome following transplant, with the mutant allele detected a median of 22 weeks (range 6-85 weeks) before relapse. Four of seven patients achieved molecular remission following donor lymphocyte infusion, indicative of a graft vs MPN effect. This study has established a robust, reliable assay for sensitive JAK2-V617F detection, suitable for assessing response in clinical trials, predicting outcome and guiding management of patients undergoing allogeneic transplant.

Analysis of Dependence Tracking Algorithms for Task Dataflow Execution

Processor architectures has taken a turn towards many-core processors, which integrate multiple processing cores on a single chip to increase overall performance, and there are no signs that this trend will stop in the near future. Many-core processors are harder to program than multi-core and single-core processors due to the need of writing parallel or concurrent programs with high degrees of parallelism. Moreover, many-cores have to operate in a mode of strong scaling because of memory bandwidth constraints. In strong scaling increasingly finer-grain parallelism must be extracted in order to keep all processing cores busy.

Task dataflow programming models have a high potential to simplify parallel program- ming because they alleviate the programmer from identifying precisely all inter-task de- pendences when writing programs. Instead, the task dataflow runtime system detects and enforces inter-task dependences during execution based on the description of memory each task accesses. The runtime constructs a task dataflow graph that captures all tasks and their dependences. Tasks are scheduled to execute in parallel taking into account dependences specified in the task graph.

Several papers report important overheads for task dataflow systems, which severely limits the scalability and usability of such systems. In this paper we study efficient schemes to manage task graphs and analyze their scalability. We assume a programming model that supports input, output and in/out annotations on task arguments, as well as commutative in/out and reductions. We analyze the structure of task graphs and identify versions and generations as key concepts for efficient management of task graphs. Then, we present three schemes to manage task graphs building on graph representations, hypergraphs and lists. We also consider a fourth edge-less scheme that synchronizes tasks using integers. Analysis using micro-benchmarks shows that the graph representation is not always scalable and that the edge-less scheme introduces least overhead in nearly all situations.