The effect of visual impairment on quality of life of children aged 3-16 years

Background: It is well known that visual impairment (VI) has a detrimental effect on Quality of Life (QoL) in adults. Little is known about the effects of VI in childhood. Aims: To evaluate the effects of VI on QoL of children. To the authors’ knowledge, this is the first study containing a comparison arm for children with VI. Methods: QoL in children with VI (n¼24, age 10.1362.89, 18 male, 6 female) was compared with an age-matched comparison group (n¼24, age 9.8362.81, 18 male, 6 female) using the Low Vision Quality of Life Questionnaire. Factors (distance and near visual acuity and age) that could be used as predictors of QoL were assessed. These were measured with standard clinical tests. Results: Children with VI had significantly lower QoL scores than the comparison group (p<0.001), resulting in a 35.6% reduction in total QoL score. QoL scores in children with VI were correlated with distance and near visual acuity (p<0.05). 38% of the variance could be predicted by these factors and age. Conclusions: Consideration of the effects of this reduced QoL must be made. Further studies are needed to establish the benefit to QoL of different habilitation strategies

Voronoi-Based Compact Image Descriptors: Efficient Region-of-Interest Retrieval With VLAD and Deep-Learning-Based Descriptors

We investigate the problem of image retrieval based on visual queries when the latter comprise arbitrary regionsof- interest (ROI) rather than entire images. Our proposal is a compact image descriptor that combines the state-of-the-art in content-based descriptor extraction with a multi-level, Voronoibased spatial partitioning of each dataset image. The proposed multi-level Voronoi-based encoding uses a spatial hierarchical K-means over interest-point locations, and computes a contentbased descriptor over each cell. In order to reduce the matching complexity with minimal or no sacrifice in retrieval performance: (i) we utilize the tree structure of the spatial hierarchical Kmeans to perform a top-to-bottom pruning for local similarity maxima; (ii) we propose a new image similarity score that combines relevant information from all partition levels into a single measure for similarity; (iii) we combine our proposal with a novel and efficient approach for optimal bit allocation within quantized descriptor representations. By deriving both a Voronoi-based VLAD descriptor (termed as Fast-VVLAD) and a Voronoi-based deep convolutional neural network (CNN) descriptor (termed as Fast-VDCNN), we demonstrate that our Voronoi-based framework is agnostic to the descriptor basis, and can easily be slotted into existing frameworks. Via a range of ROI queries in two standard datasets, it is shown that the Voronoibased descriptors achieve comparable or higher mean Average Precision against conventional grid-based spatial search, while offering more than two-fold reduction in complexity. Finally, beyond ROI queries, we show that Voronoi partitioning improves the geometric invariance of compact CNN descriptors, thereby resulting in competitive performance to the current state-of-theart on whole image retrieval

A reduced semantics for deciding trace equivalence using constraint systems

Many privacy-type properties of security protocols can be modelled using trace equivalence properties in suitable process algebras. It has been shown that such properties can be decided for interesting classes of finite processes (i.e., without replication) by means of symbolic execution and constraint solving. However, this does not suffice to obtain practical tools. Current prototypes suffer from a classical combinatorial explosion problem caused by the exploration of many interleavings in the behaviour of processes. M\"odersheim et al. have tackled this problem for reachability properties using partial order reduction techniques. We revisit their work, generalize it and adapt it for equivalence checking. We obtain an optimization in the form of a reduced symbolic semantics that eliminates redundant interleavings on the fly.Comment: Accepted for publication at POST'1

Model Checking Concurrent Programs with Nondeterminism and Randomization

For concurrent probabilistic programs having process-level nondeterminism, it is often necessary to restrict the class of schedulers that resolve nondeterminism to obtain sound and precise model checking algorithms. In this paper, we introduce two classes of schedulers called view consistent and locally Markovian schedulers and consider the model checking problem of concurrent, probabilistic programs under these alternate semantics. Specifically, given a B"{u}chi automaton $Spec$, a threshold $x$ in $[0,1]$, and a concurrent program $P$, the model checking problem asks if the measure of computations of $P$ that satisfy $Spec$ is at least $x$, under all view consistent (or locally Markovian) schedulers. We give precise complexity results for the model checking problem (for different classes of B"{u}chi automata specifications) and contrast it with the complexity under the standard semantics that considers all schedulers

Qualitative Analysis of Partially-observable Markov Decision Processes

We study observation-based strategies for partially-observable Markov decision processes (POMDPs) with omega-regular objectives. An observation-based strategy relies on partial information about the history of a play, namely, on the past sequence of observations. We consider the qualitative analysis problem: given a POMDP with an omega-regular objective, whether there is an observation-based strategy to achieve the objective with probability~1 (almost-sure winning), or with positive probability (positive winning). Our main results are twofold. First, we present a complete picture of the computational complexity of the qualitative analysis of POMDP s with parity objectives (a canonical form to express omega-regular objectives) and its subclasses. Our contribution consists in establishing several upper and lower bounds that were not known in literature. Second, we present optimal bounds (matching upper and lower bounds) on the memory required by pure and randomized observation-based strategies for the qualitative analysis of POMDP s with parity objectives and its subclasses

Reachability for dynamic parametric processes

In a dynamic parametric process every subprocess may spawn arbitrarily many, identical child processes, that may communicate either over global variables, or over local variables that are shared with their parent. We show that reachability for dynamic parametric processes is decidable under mild assumptions. These assumptions are e.g. met if individual processes are realized by pushdown systems, or even higher-order pushdown systems. We also provide algorithms for subclasses of pushdown dynamic parametric processes, with complexity ranging between NP and DEXPTIME.Comment: 31 page

Flow cytometric DNA ploidy analysis of ovarian granulosa cell tumors

Abstract The nuclear DNA content of 50 ovarian tumors initially diagnosed as granulosa cell tumors was measured by flow cytometry using paraffin-embedded archival material. The follow-up period of the patients ranged from 4 months to 19 years. Thirty-eight tumors were diploid or near-diploid, while 5 were aneuploid. DNA profiles of 7 tumors could not be evaluated. All 50 tumors were immunohistochemically tested for expression of intermediate filament proteins vimentin and cytokeratin and epithelial membrane antigen. The cells of all but 3 tumors expressed vimentin. These 3 vimentin-negative tumors were positive for cytokeratin and epithelial membrane antigen. They were highly aneuploid and though originally diagnosed as granulosa cell tumors, most likely represent undifferentiated carcinomas. Hence, only 2 typical granulosa cell tumors were aneuploid. In addition, frozen tissue samples from 9 of 10 granulosa cell tumors showed a DNA diploid content. Our results indicate that granulosa cell tumors tend to be diploid or have only minor ploidy abnormalities which is in line with their relatively benign character. An undifferentiated carcinoma should be considered in the differential diagnosis of tumors with a high DNA index

Natural organic matter in sedimentary basins and its relation to arsenic in anoxic ground water: the example of West Bengal and its worldwide implications

In order to investigate the mechanism of As release to anoxic ground water in alluvial aquifers, the authors sampled ground waters from 3 piezometer nests, 79 shallow (80 m) wells, in an area 750 m by 450 m, just north of Barasat, near Kolkata (Calcutta), in southern West Bengal. High concentrations of As (200-1180 mug L-1) are accompanied by high concentrations of Fe (3-13.7 mgL(-1)) and PO4 (1-6.5 mg L-1). Ground water that is rich in Mn (1-5.3 mg L-1) contains <50 mug L-1 of As. The composition of shallow ground water varies at the 100-m scale laterally and the metre-scale vertically, with vertical gradients in As concentration reaching 200 mug L-1 m(-1). The As is supplied by reductive dissolution of FeOOH and release of the sorbed As to solution. The process is driven by natural organic matter in peaty strata both within the aquifer sands and in the overlying confining unit. In well waters, thermotolerant coliforms, a proxy for faecal contamination, are not present in high numbers (<10 cfu/100 ml in 85% of wells) showing that faecally-derived organic matter does not enter the aquifer, does not drive reduction of FeOOH, and so does not release As to ground water.Arsenic concentrations are high (much greater than50 mug L-1) where reduction of FeOOH is complete and its entire load of sorbed As is released to solution, at which point the aquifer sediments become grey in colour as FeOOH vanishes. Where reduction is incomplete, the sediments are brown in colour and resorption of As to residual FeOOH keeps As concentrations below 10 mug L-1 in the presence of dissolved Fe. Sorbed As released by reduction of Mn oxides does not increase As in ground water because the As resorbs to FeOOH. High concentrations of As are common in alluvial aquifers of the Bengal Basin arise because Himalayan erosion supplies immature sediments, with low surface-loadings of FeOOH on mineral grains, to a depositional environment that is rich in organic mater so that complete reduction of FeOOH is common. (C) 2004 Published by Elsevier Ltd

Limits on Flavor Changing Neutral Currents in D^0 Meson Decays

Using the CLEO II detector at the Cornell Electron Storage Ring, we have searched for flavor changing neutral currents and lepton family number violations in D^0 meson decays. The upper limits on the branching fractions for D^0→ℓ^+ℓ^- and D^0→X^0ℓ^+ℓ^- are in the range 10^(-5) to 10^(-4), where X^0 can be a π^0, K_s^0, η, ρ^0, ω, K̅^(*0), or φ meson, and the ℓ^+ℓ^- pair can be e^+e^-, μ^+μ^-, or e^±μ^∓. Although these limits are above the theoretical predictions, most are new or an order of magnitude lower than previous limits