Approximately Uniform Random Sampling in Sensor Networks

Recent work in sensor databases has focused extensively on distributed query problems, notably distributed computation of aggregates. Existing methods for computing aggregates broadcast queries to all sensors and use in-network aggregation of responses to minimize messaging costs. In this work, we focus on uniform random sampling across nodes, which can serve both as an alternative building block for aggregation and as an integral component of many other useful randomized algorithms. Prior to our work, the best existing proposals for uniform random sampling of sensors involve contacting all nodes in the network. We propose a practical method which is only approximately uniform, but contacts a number of sensors proportional to the diameter of the network instead of its size. The approximation achieved is tunably close to exact uniform sampling, and only relies on well-known existing primitives, namely geographic routing, distributed computation of Voronoi regions and von Neumann's rejection method. Ultimately, our sampling algorithm has the same worst-case asymptotic cost as routing a point-to-point message, and thus it is asymptotically optimal among request/reply-based sampling methods. We provide experimental results demonstrating the effectiveness of our algorithm on both synthetic and real sensor topologies.

Injectable laminin-functionalized hydrogel for nucleus pulposus regeneration.

Cell delivery to the pathological intervertebral disc (IVD) has significant therapeutic potential for enhancing IVD regeneration. The development of injectable biomaterials that retain delivered cells, promote cell survival, and maintain or promote an NP cell phenotype in vivo remains a significant challenge. Previous studies have demonstrated NP cell - laminin interactions in the nucleus pulposus (NP) region of the IVD that promote cell attachment and biosynthesis. These findings suggest that incorporating laminin ligands into carriers for cell delivery may be beneficial for promoting NP cell survival and phenotype. Here, an injectable, laminin-111 functionalized poly(ethylene glycol) (PEG-LM111) hydrogel was developed as a biomaterial carrier for cell delivery to the IVD. We evaluated the mechanical properties of the PEG-LM111 hydrogel, and its ability to retain delivered cells in the IVD space. Gelation occurred in approximately 20 min without an initiator, with dynamic shear moduli in the range of 0.9-1.4 kPa. Primary NP cell retention in cultured IVD explants was significantly higher over 14 days when cells were delivered within a PEG-LM111 carrier, as compared to cells in liquid suspension. Together, these results suggest this injectable laminin-functionalized biomaterial may be an easy to use carrier for delivering cells to the IVD.

Natural hybridization between genera that diverged from each other approximately 60 million years ago.

A fern from the French Pyrenees-×Cystocarpium roskamianum-is a recently formed intergeneric hybrid between parental lineages that diverged from each other approximately 60 million years ago (mya; 95% highest posterior density: 40.2-76.2 mya). This is an extraordinarily deep hybridization event, roughly akin to an elephant hybridizing with a manatee or a human with a lemur. In the context of other reported deep hybrids, this finding suggests that populations of ferns, and other plants with abiotically mediated fertilization, may evolve reproductive incompatibilities more slowly, perhaps because they lack many of the premating isolation mechanisms that characterize most other groups of organisms. This conclusion implies that major features of Earth's biodiversity-such as the relatively small number of species of ferns compared to those of angiosperms-may be, in part, an indirect by-product of this slower "speciation clock" rather than a direct consequence of adaptive innovations by the more diverse lineages.

Inorganic arsenic contents in rice-based infant foods from Spain, UK, China and USA

Spanish gluten-free rice, cereals with gluten, and pureed baby foods were analysed for total (t-As) and inorganic As (i-As) using ICP-MS and HPLC-ICP-MS, respectively. Besides, pure infant rice from China, USA, UK and Spain were also analysed. The i-As contents were significantly higher in gluten-free rice than in cereals mixtures with gluten, placing infants with celiac disease at high risk. All rice-based products displayed a high i-As content, with values being above 60% of the t-As content and the remainder being dimethylarsinic acid (DMA). Approximately 77% of the pure infant rice samples showed contents below 150 µg kg(-1) (Chinese limit). When daily intake of i-As by infants (4-12 months) was estimated and expressed on a bodyweight basis (µg d(-1) kg(-1)), it was higher in all infants aged 8-12 months than drinking water maximum exposures predicted for adults (assuming 1 L consumption per day for a 10 µg L(-1) standard).

A Programming Model and Runtime System for Significance-Aware Energy-Efficient Computing.

We introduce a task-based programming model and runtime system that exploit the observation that not all parts of a program are equally significant for the accuracy of the end-result, in order to trade off the quality of program outputs for increased energy-efficiency. This is done in a structured and flexible way, allowing for easy exploitation of different points in the quality/energy space, without adversely affecting application performance. The runtime system can apply a number of different policies to decide whether it will execute less-significant tasks accurately or approximately.

The experimental evaluation indicates that our system can achieve an energy reduction of up to 83% compared with a fully accurate execution and up to 35% compared with an approximate version employing loop perforation. At the same time, our approach always results in graceful quality degradation.

The Complexity of Approximately Solving Influence Diagrams

Influence diagrams allow for intuitive and yet precise description of complex situations involving decision making under uncertainty. Unfortunately, most of the problems described by influence diagrams are hard to solve. In this paper we discuss the complexity of approximately solving influence diagrams. We do not assume no-forgetting or regularity, which makes the class of problems we address very broad. Remarkably, we show that when both the treewidth and the cardinality of the variables are bounded the problem admits a fully polynomial-time approximation scheme.