Multilayer perceptron with local constraint as an emerging method in spatial data analysis

The use of Geographic Information Systems has revolutionalized the handling and the visualization of geo-referenced data and has underlined the critic role of spatial analysis. The usual tools for such a purpose are geostatistics which are widely used in Earth science. Geostatistics are based upon several hypothesis which are not always verified in practice. On the other hand, Artificial Neural Network (ANN) a priori can be used without special assumptions and are known to be flexible. This paper proposes to discuss the application of ANN in the case of the interpolation of a geo-referenced variable.

When solving 22-7 is much more difficult than 99-12.

We describe the case of a 69-year-old professor of mathematics (GV) who was examined 2 years after left-hemispheric capsular-thalamic haemorrhage. GV showed disproportionate impairment in subtractions requiring borrowing (22 - 7). For large subtraction problems without borrowing (99 - 12) performance was almost flawless. Subtractions with borrowing mostly relied on inadequate attempts to invert subtractions into the corresponding additions (22 - 7 = x as 7 + x = 22). The hypothesis is advanced that difficulty in the inhibitory components of attention tasks (Stroop test, go-no-go task) might be the responsible factor of his calculation impairment. A deficit in subtractions with borrowing might be related to left-hemispheric damage involving thalamo-cortical connections.

Comparison of human chromosome 21 conserved nongenic sequences (CNGs) with the mouse and dog genomes shows that their selective constraint is independent of their genic environment.

The analysis of conservation between the human and mouse genomes resulted in the identification of a large number of conserved nongenic sequences (CNGs). The functional significance of this nongenic conservation remains unknown, however. The availability of the sequence of a third mammalian genome, the dog, allows for a large-scale analysis of evolutionary attributes of CNGs in mammals. We have aligned 1638 previously identified CNGs and 976 conserved exons (CODs) from human chromosome 21 (Hsa21) with their orthologous sequences in mouse and dog. Attributes of selective constraint, such as sequence conservation, clustering, and direction of substitutions were compared between CNGs and CODs, showing a clear distinction between the two classes. We subsequently performed a chromosome-wide analysis of CNGs by correlating selective constraint metrics with their position on the chromosome and relative to their distance from genes. We found that CNGs appear to be randomly arranged in intergenic regions, with no bias to be closer or farther from genes. Moreover, conservation and clustering of substitutions of CNGs appear to be completely independent of their distance from genes. These results suggest that the majority of CNGs are not typical of previously described regulatory elements in terms of their location. We propose models for a global role of CNGs in genome function and regulation, through long-distance cis or trans chromosomal interactions.

Solving ambiguities in contig assembly of Idiomarina loihiensis L2TR chromosome by in silico analyses.

Nucleotide composition analyses of bacterial genomes such as cumulative GC skew highlight the atypical, strongly asymmetric architecture of the recently published chromosome of Idiomarina loihiensis L2TR, suggesting that an inversion of a 600-kb chromosomal segment occurred. The presence of 3.4-kb inverted repeated sequences at the borders of the putative rearrangement supports this hypothesis. Reverting in silico this segment restores (1) a symmetric chromosome architecture; (2) the co-orientation of transcription of all rRNA operons with DNA replication; and (3) a better conservation of gene order between this chromosome and other gamma-proteobacterial ones. Finally, long-range PCRs encompassing the ends of the 600-kb segment reveal the existence of the reverted configuration but not of the published one. This demonstrates how cumulative nucleotide-skew analyses can validate genome assemblies.

Constraint and cost of oxidative stress on reproduction: correlative evidence in laboratory mice and review of the literature.

ABSTRACT: BACKGROUND: One central concept in evolutionary ecology is that current and residual reproductive values are negatively linked by the so-called cost of reproduction. Previous studies examining the nature of this cost suggested a possible involvement of oxidative stress resulting from the imbalance between pro- and anti-oxidant processes. Still, data remain conflictory probably because, although oxidative damage increases during reproduction, high systemic levels of oxidative stress might also constrain parental investment in reproduction. Here, we investigated variation in oxidative balance (i.e. oxidative damage and antioxidant defences) over the course of reproduction by comparing female laboratory mice rearing or not pups. RESULTS: A significant increase in oxidative damage over time was only observed in females caring for offspring, whereas antioxidant defences increased over time regardless of reproductive status. Interestingly, oxidative damage measured prior to reproduction was negatively associated with litter size at birth (constraint), whereas damage measured after reproduction was positively related to litter size at weaning (cost). CONCLUSIONS: Globally, our correlative results and the review of literature describing the links between reproduction and oxidative stress underline the importance of timing/dynamics when studying and interpreting oxidative balance in relation to reproduction. Our study highlights the duality (constraint and cost) of oxidative stress in life-history trade-offs, thus supporting the theory that oxidative stress plays a key role in life-history evolution.

Estimating parameters for generalized mass action models using constraint propagation.

As modern molecular biology moves towards the analysis of biological systems as opposed to their individual components, the need for appropriate mathematical and computational techniques for understanding the dynamics and structure of such systems is becoming more pressing. For example, the modeling of biochemical systems using ordinary differential equations (ODEs) based on high-throughput, time-dense profiles is becoming more common-place, which is necessitating the development of improved techniques to estimate model parameters from such data. Due to the high dimensionality of this estimation problem, straight-forward optimization strategies rarely produce correct parameter values, and hence current methods tend to utilize genetic/evolutionary algorithms to perform non-linear parameter fitting. Here, we describe a completely deterministic approach, which is based on interval analysis. This allows us to examine entire sets of parameters, and thus to exhaust the global search within a finite number of steps. In particular, we show how our method may be applied to a generic class of ODEs used for modeling biochemical systems called Generalized Mass Action Models (GMAs). In addition, we show that for GMAs our method is amenable to the technique in interval arithmetic called constraint propagation, which allows great improvement of its efficiency. To illustrate the applicability of our method we apply it to some networks of biochemical reactions appearing in the literature, showing in particular that, in addition to estimating system parameters in the absence of noise, our method may also be used to recover the topology of these networks.

On solving fair exchange and related distributed problems in Byzantine environments

Abstract The solvability of the problem of fair exchange in a synchronous system subject to Byzantine failures is investigated in this work. The fair exchange problem arises when a group of processes are required to exchange digital items in a fair manner, which means that either each process obtains the item it was expecting or no process obtains any information on, the inputs of others. After introducing a novel specification of fair exchange that clearly separates safety and liveness, we give an overview of the difficulty of solving such a problem in the context of a fully-connected topology. On one hand, we show that no solution to fair exchange exists in the absence of an identified process that every process can trust a priori; on the other, a well-known solution to fair exchange relying on a trusted third party is recalled. These two results lead us to complete our system model with a flexible representation of the notion of trust. We then show that fair exchange is solvable if and only if a connectivity condition, named the reachable majority condition, is satisfied. The necessity of the condition is proven by an impossibility result and its sufficiency by presenting a general solution to fair exchange relying on a set of trusted processes. The focus is then turned towards a specific network topology in order to provide a fully decentralized, yet realistic, solution to fair exchange. The general solution mentioned above is optimized by reducing the computational load assumed by trusted processes as far as possible. Accordingly, our fair exchange protocol relies on trusted tamperproof modules that have limited communication abilities and are only required in key steps of the algorithm. This modular solution is then implemented in the context of a pedagogical application developed for illustrating and apprehending the complexity of fair exchange. This application, which also includes the implementation of a wide range of Byzantine behaviors, allows executions of the algorithm to be set up and monitored through a graphical display. Surprisingly, some of our results on fair exchange seem contradictory with those found in the literature of secure multiparty computation, a problem from the field of modern cryptography, although the two problems have much in common. Both problems are closely related to the notion of trusted third party, but their approaches and descriptions differ greatly. By introducing a common specification framework, a comparison is proposed in order to clarify their differences and the possible origins of the confusion between them. This leads us to introduce the problem of generalized fair computation, a generalization of fair exchange. Finally, a solution to this new problem is given by generalizing our modular solution to fair exchange

Early childhood constraint therapy for sensory/motor impairment in cerebral palsy: a randomised clinical trial protocol.

INTRODUCTION: Cerebral palsy (CP) is the most common physical disability in childhood. It is a disorder resulting from sensory and motor impairments due to perinatal brain injury, with lifetime consequences that range from poor adaptive and social function to communication and emotional disturbances. Infants with CP have a fundamental disadvantage in recovering motor function: they do not receive accurate sensory feedback from their movements, leading to developmental disregard. Constraint-induced movement therapy (CIMT) is one of the few effective neurorehabilitative strategies shown to improve upper extremity motor function in adults and older children with CP, potentially overcoming developmental disregard. METHODS AND ANALYSIS: This study is a randomised controlled trial of children 12-24 months corrected age studying the effectiveness of CIMT combined with motor and sensory-motor interventions. The study population will comprise 72 children with CP and 144 typically developing children for a total of N=216 children. All children with CP, regardless of group allocation will continue with their standard of care occupational and physical therapy throughout the study. The research material collected will be in the form of data from high-density array event-related potential scan, standardised assessment scores and motion analysis scores. ETHICS AND DISSEMINATION: The study protocol was approved by the Institutional Review Board. The findings of the trial will be disseminated through peer-reviewed journals and scientific conferences. TRIAL REGISTRATION NUMBER: NCT02567630.