The Apollo ATCA Platform

We have developed a novel and generic open-source platform - Apollo - which simplifies the design of custom Advanced Telecommunications Computing Architecture (ATCA) blades by factoring the design into generic infrastructure and application-specific parts. The Apollo "Service Module" provides the required ATCA Intelligent Platform Management Controller, power entry and conditioning, a powerful system-on-module (SoM) computer, and flexible clock and communications infrastructure. The Apollo "Command Module" is customized for each application and typically includes two large field-programmable gate arrays, several hundred optical fiber interfaces operating at speeds up to 28 Gbps, memories, and other supporting infrastructure. The command and service module boards can be operated together or independently on the bench without need for an ATCA shelf.Comment: Submitted to the Proceedings for TWEPP 201

PubMed related articles: a probabilistic topic-based model for content similarity

<p>Abstract</p> <p>Background</p> <p>We present a probabilistic topic-based model for content similarity called <it>pmra </it>that underlies the related article search feature in PubMed. Whether or not a document is about a particular topic is computed from term frequencies, modeled as Poisson distributions. Unlike previous probabilistic retrieval models, we do not attempt to estimate relevance–but rather our focus is "relatedness", the probability that a user would want to examine a particular document given known interest in another. We also describe a novel technique for estimating parameters that does not require human relevance judgments; instead, the process is based on the existence of MeSH ^®in MEDLINE ^®.</p> <p>Results</p> <p>The <it>pmra </it>retrieval model was compared against <it>bm25</it>, a competitive probabilistic model that shares theoretical similarities. Experiments using the test collection from the TREC 2005 genomics track shows a small but statistically significant improvement of <it>pmra </it>over <it>bm25 </it>in terms of precision.</p> <p>Conclusion</p> <p>Our experiments suggest that the <it>pmra </it>model provides an effective ranking algorithm for related article search.</p

Explanatory pluralism in the medical sciences: theory and practice

Explanatory pluralism is the view that the best form and level of explanation depends on the kind of question one seeks to answer by the explanation, and that in order to answer all questions in the best way possible, we need more than one form and level of explanation. In the first part of this article, we argue that explanatory pluralism holds for the medical sciences, at least in theory. However, in the second part of the article we show that medical research and practice is actually not fully and truly explanatory pluralist yet. Although the literature demonstrates a slowly growing interest in non-reductive explanations in medicine, the dominant approach in medicine is still methodologically reductionist. This implies that non-reductive explanations often do not get the attention they deserve. We argue that the field of medicine could benefit greatly by reconsidering its reductive tendencies and becoming fully and truly explanatory pluralist. Nonetheless, trying to achieve the right balance in the search for and application of reductive and non-reductive explanations will in any case be a difficult exercise

Integrative Network Biology: Graph Prototyping for Co-Expression Cancer Networks

Network-based analysis has been proven useful in biologically-oriented areas, e.g., to explore the dynamics and complexity of biological networks. Investigating a set of networks allows deriving general knowledge about the underlying topological and functional properties. The integrative analysis of networks typically combines networks from different studies that investigate the same or similar research questions. In order to perform an integrative analysis it is often necessary to compare the properties of matching edges across the data set. This identification of common edges is often burdensome and computational intensive. Here, we present an approach that is different from inferring a new network based on common features. Instead, we select one network as a graph prototype, which then represents a set of comparable network objects, as it has the least average distance to all other networks in the same set. We demonstrate the usefulness of the graph prototyping approach on a set of prostate cancer networks and a set of corresponding benign networks. We further show that the distances within the cancer group and the benign group are statistically different depending on the utilized distance measure