Incidental ingestion of household dust is an important arsenic (As) exposure pathway for children. However, compared to soils, assessment of As relative bioavailability (RBA) in household dust is limited. In this study, As-RBA in 12 household dust samples (7–38 mg kg(–1)) was measured using an in vivo mouse model and compared to As bioaccessibility determined using 4 assays [Solubility Bioacces...

Due to the sink node crucial position, its location privacy is becoming one of the major issues in wireless sensor networks (WSNs) which requires ultimate protection. Particularly, the WSNs successfulness is endanger as the wireless transmission nodes are susceptive to illicit tracing and detection. While privacy of the message can be ensured through encryption content, this paper formalizes a ...

The paper presents the results of the qualitative and quantitative determination of scopoletin (SLT) in Physalis alkekengi and Solanum dulcamara (Solanaceae) by highperformance liquid chromatography tandem mass spectrometry (HPLC/MS). The plant samples were harvested around Iasi on July 2007, July 2008, August-September 2009. Scopoletin was extracted from dried leaves by two methods: with metha...

This paper is the first part of an ongoing project aimed at providing a local minimality criterion, based on a second variation approach, for the triple point configurations of the Mumford-Shah functional.

We prove an ε-regularity theorem at the endpoint of connected arcs for 2-dimensional Mumford-Shah minimizers. In particular we show that, if in a given ball Br(x) the jump set of a given MumfordShah minimizer is sufficiently close, in the Hausdorff distance, to a radius of Br(x), then in a smaller ball the jump set is a connected arc which terminates at some interior point y0 and it is C 1,α up...

We prove higher integrability for the gradient of local minimizers of the Mumford-Shah energy functional, providing a positive answer to a conjecture of De Giorgi [5].

In this paper, we present a task scheduling heuristic, based on a parallel genetic algorithm (PGA). The algorithm schedules parallel programs, represented as directed acyclic graphs (DAGs), onto multi-processor systems with dynamic interconnection networks (DIN). It combines PGA with list scheduling approach and takes into account inter-processor communication cost, link contention in the DIN a...