Spatio-temporal impact of climate change on the groundwater system

Given the importance of groundwater for food production and drinking water supply, but also for the survival of groundwater dependent terrestrial ecosystems (GWDTEs) it is essential to assess the impact of climate change on this freshwater resource. In this paper we study with high temporal and spatial resolution the impact of 28 climate change scenarios on the groundwater system of a lowland catchment in Belgium. Our results show for the scenario period 2070–2101 compared with the reference period 1960– 1991, a change in annual groundwater recharge between −20% and +7%. On average annual groundwater recharge decreases 7%. In most scenarios the recharge increases during winter but decreases during summer. The altered recharge patterns cause the groundwater level to decrease significantly from September to January. On average the groundwater level decreases about 7 cm with a standard deviation between the scenarios of 5 cm. Groundwater levels in interfluves and upstream areas are more sensitive to climate change than groundwater levels in the river valley. Groundwater discharge to GWDTEs is expected to decrease during late summer and autumn as much as 10%, though the discharge remains at reference-period level during winter and early spring. As GWDTEs are strongly influenced by temporal dynamics of the groundwater system, close monitoring of groundwater and implementation of adaptive management measures are required to prevent ecological loss

Understanding variation in prospective poor decoders: A person-centred approach from kindergarten to Grade 2

In the present study, we aimed to clarify variation in prospective poor decoders by studying the development of their word decoding skills during the first 1½ years of formal reading education and their unique pre-reading profiles before the onset of formal reading education. Using structural equation modelling and a factorial mixed model analysis of variance (ANOVA), we found autoregression and growth in the word decoding efficiency of prospective poor decoders (n = 90) and matched prospective adequate decoders (n = 90) in first and second grade. However, the gap between the two groups widened over time. Next, we zoomed in on the group of poor decoders by retrospectively studying their individual variation regarding cognitive and linguistic pre-reading skills. Using latent profile analysis, we found three distinct pre-reading profiles: (1) Poor PA, Letter Knowledge, RAN, and Verbal STM; (2) Poor PA and Letter Knowledge; and (3) Poor RAN. Together, these findings suggest that reading difficulties emerge at the intersection of multiple risk factors which can be detected in kindergarten, and that these reading problems persist throughout early reading education

Using Flow Specifications of Parameterized Cache Coherence Protocols for Verifying Deadlock Freedom

We consider the problem of verifying deadlock freedom for symmetric cache coherence protocols. In particular, we focus on a specific form of deadlock which is useful for the cache coherence protocol domain and consistent with the internal definition of deadlock in the Murphi model checker: we refer to this deadlock as a system- wide deadlock (s-deadlock). In s-deadlock, the entire system gets blocked and is unable to make any transition. Cache coherence protocols consist of N symmetric cache agents, where N is an unbounded parameter; thus the verification of s-deadlock freedom is naturally a parameterized verification problem. Parametrized verification techniques work by using sound abstractions to reduce the unbounded model to a bounded model. Efficient abstractions which work well for industrial scale protocols typically bound the model by replacing the state of most of the agents by an abstract environment, while keeping just one or two agents as is. However, leveraging such efficient abstractions becomes a challenge for s-deadlock: a violation of s-deadlock is a state in which the transitions of all of the unbounded number of agents cannot occur and so a simple abstraction like the one above will not preserve this violation. In this work we address this challenge by presenting a technique which leverages high-level information about the protocols, in the form of message sequence dia- grams referred to as flows, for constructing invariants that are collectively stronger than s-deadlock. Efficient abstractions can be constructed to verify these invariants. We successfully verify the German and Flash protocols using our technique

Inheritance of Temporal Logic Properties

Abstract. Inheritance is one of the key features for the success of object-oriented languages. Inheritance (or specialisation) supports incremental design and re-use of already written specifications or programs. In a for-mal approach to system design the interest does not only lie in re-use of class definitions but also in re-use of correctness proofs. If a provably correct class is specialised we like to know those correctness properties which are preserved in the subclass. This can avoid re-verification of already proven properties and may thus substantially reduce the verifi-cation effort. In this paper we study the question of inheritance of correctness prop-erties in the context of state-based formalisms, using a temporal logic (CTL) to formalise requirements on classes. Given a superclass and its specialised subclass we develop a technique for computing the set of for-mulas which are preserved in the subclass. For specialisation we allow addition of attributes, modification of existing as well as extension with new methods.

Space, state-building and the hydraulic mission: crafting the Mozambican State

This article explores the role of large-scale water infrastructure in the formation of states in sub-Saharan Africa. We examine this through a focus on government agents and their shifting hydro-developmental visions of the state in colonial and post-colonial Mozambique. Over time, the focus, underlying principles, and goals of the hydraulic mission shifted, triggered by contextual factors and historical developments within and outside the country. We identify the making of three hydraulic paradigms, fostering different imaginaries of ‘the state’ and social and spatial engineering of the territory: the ‘Estado Novo’ (1930 - 1974), the socialist post-independence state-space (1974 - 1987) and the neoliberal state (1987 - present). We then conclude by discussing how the shifting discursive justifications for infrastructure projects consolidate different state projects and link these to material re-patterning of hydrosocial territories, showing that whilst promoted as a rupture with the past, emerging projects tend to reaffirm, rather than redistribute, power and water within the country

Concurrent hypermethylation of DNMT1, MGMT and EGFR genes in progression of gliomas

<p>Abstract</p> <p>Background</p> <p>Gliomas are the most common neoplasm of the brain. High-grade gliomas often resist treatment even with aggressive surgical resection and adjuvant radiation and chemotherapy. Despite the combined treatment, they frequently recur with the same or higher-grade histology. Genetic instability is commonly associated with inactivation of the normal DNA repair function and tumour suppressor genes as well as activation of oncogenes resulting from alterations of promoter hypermethylation, but the molecular mechanisms of the histological and clinical progression of gliomas are still poorly understood.</p> <p>Methods</p> <p>This study involved longitudinal analysis samples of primary and recurrent gliomas to determine whether the progression of low- and high-grade gliomas is associated with the promoter methylation of the DNMT1, MGMT and EGFR genes by PCR-based restriction enzyme assay. Epigenetic inactivation of these three important glioma-associated genes was analyzed in paired biopsy samples from 18 patients with tumour recurrence.</p> <p>Results</p> <p>The methylation analysis of the CpG sites in the DNA methyltransferase (DNMT1) promoter revealed a total of 6 hypermethylations (6/18), the methylguanine-DNA methyltransferase (MGMT) promoter revealed a total of 10 hypermethylations (10/18) and the epithelial grow factor receptor (EGFR) promoter revealed a total of 12 (12/18) hypermethylations respectively in recurrent gliomas. The results demonstrated that DNMT1 promoter hypermethylation does not occur in low-grade gliomas, it was mainly observed in secondary glioblastomas. Additionally, the MGMT and EGFR promoter was hypermethylated in both low-and high-grade GLs and their corresponding histological transformed GLs.</p> <p>Conclusion</p> <p>This study has provided further evidence that the histological transformation and progression of gliomas may be associated with the inactivation of the EGFR and MGMT genes. It seems that EGFR and MGMT promoter hypermethylations are early events in the clonal evolution of gliomas and this gene inactivation has proved to be stable even in tumour recurrence. However, the DNMT hypermethylation is a late part of glioma progression.</p> <p>Virtual slides</p> <p>The virtual slide(s) for this article can be found here: <url>http://www.diagnosticpathology.diagnomx.eu/vs/1935054011612460</url></p

A Grassmann integral equation

The present study introduces and investigates a new type of equation which is called Grassmann integral equation in analogy to integral equations studied in real analysis. A Grassmann integral equation is an equation which involves Grassmann integrations and which is to be obeyed by an unknown function over a (finite-dimensional) Grassmann algebra G_m. A particular type of Grassmann integral equations is explicitly studied for certain low-dimensional Grassmann algebras. The choice of the equation under investigation is motivated by the effective action formalism of (lattice) quantum field theory. In a very general setting, for the Grassmann algebras G_2n, n = 2,3,4, the finite-dimensional analogues of the generating functionals of the Green functions are worked out explicitly by solving a coupled system of nonlinear matrix equations. Finally, by imposing the condition G[{\bar\Psi},{\Psi}] = G_0[{\lambda\bar\Psi}, {\lambda\Psi}] + const., 0<\lambda\in R (\bar\Psi_k, \Psi_k, k=1,...,n, are the generators of the Grassmann algebra G_2n), between the finite-dimensional analogues G_0 and G of the (``classical'') action and effective action functionals, respectively, a special Grassmann integral equation is being established and solved which also is equivalent to a coupled system of nonlinear matrix equations. If \lambda \not= 1, solutions to this Grassmann integral equation exist for n=2 (and consequently, also for any even value of n, specifically, for n=4) but not for n=3. If \lambda=1, the considered Grassmann integral equation has always a solution which corresponds to a Gaussian integral, but remarkably in the case n=4 a further solution is found which corresponds to a non-Gaussian integral. The investigation sheds light on the structures to be met for Grassmann algebras G_2n with arbitrarily chosen n.Comment: 58 pages LaTeX (v2: mainly, minor updates and corrections to the reference section; v3: references [4], [17]-[21], [39], [46], [49]-[54], [61], [64], [139] added

SMT-Based False Positive Elimination in Static Program Analysis

Static program analysis for bug detection in large C/C++ projects typically uses a high-level abstraction of the original program under investigation. As a result, so-called false positives are often inevitable, i.e., warnings that are not true bugs. In this work we present a novel abstraction refinement approach to automatically investigate and eliminate such false positives. Central to our approach is to view static analysis as a model checking problem, to iteratively compute infeasible sub-paths of infeasible paths using SMT solvers, and refine our models by adding observer automata to exclude such paths. Based on this new framework we present an implementation of the approach into the static analyzer Goanna and discuss a number of real-life experiments on larger C code projects, demonstrating that we were able to remove most false positives automatically