Prunus serotina unleashed: invader dominance after 70 years of forest development

Propagule pressure and disturbance have both been found to facilitate invasion. Therefore, knowledge on the history of introduction and disturbance is vital for understanding an invasion process, and research should focus on areas in which the invasive species has not been deliberately introduced or managed to study unconfounded colonization patterns. Comparing the outcome of such spontaneous colonization processes for different ecosystems might provide a useful framework for setting management priorities for invasive species that enter new, uninvaded areas. We focused on the 70-year spontaneous spread of the invasive tree species Prunus serotina in a pine forest in the Netherlands. To reconstruct the invasion pattern, we combined historical maps, tree ring analysis, spatially explicit tree inventory data, seed density data, and regeneration data for both native and non-native species. Prunus serotina was the only species that showed successful regeneration: the species was present throughout the forest in the tree, shrub, and herb layer. Native species were not able to outgrow the seedling stage. Our data demonstrate that P. serotina is a gap-dependent species with high seed production that builds up a seedling bank. We also compared the results of this study with a similar study on P. serotina colonization in a deciduous forest in Belgium, where P. serotina invasion was not successful. The sharp contrast between the outcomes of the two invasion processes shows the importance of studying an invasive species and the recipient ecosystem jointly and made us raise the hypothesis that herbivore pressure may facilitate P. serotina invasio

The new political economy of healthcare in the European Union: The impact of fiscal governance

We argue that the political economy of health care in the European Union is being changed by the creation of a substantial new apparatus of European fiscal governance. A series of treaties and legal changes since 2008 have given the EU new powers and duties to enforce budgetary austerity in the member states, and this apparatus of fiscal governance has already extended to include detailed and sometimes coercive policy recommendations to member states about the governance of their health care systems. We map the structures of this new fiscal governance and the way it purports to affect health care decisionmaking.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/120416/1/New political economy as accepted.pdfDescription of New political economy as accepted.pdf : Main articl

On the Executability of Interactive Computation

The model of interactive Turing machines (ITMs) has been proposed to characterise which stream translations are interactively computable; the model of reactive Turing machines (RTMs) has been proposed to characterise which behaviours are reactively executable. In this article we provide a comparison of the two models. We show, on the one hand, that the behaviour exhibited by ITMs is reactively executable, and, on the other hand, that the stream translations naturally associated with RTMs are interactively computable. We conclude from these results that the theory of reactive executability subsumes the theory of interactive computability. Inspired by the existing model of ITMs with advice, which provides a model of evolving computation, we also consider RTMs with advice and we establish that a facility of advice considerably upgrades the behavioural expressiveness of RTMs: every countable transition system can be simulated by some RTM with advice up to a fine notion of behavioural equivalence.Comment: 15 pages, 0 figure

Expressiveness modulo Bisimilarity of Regular Expressions with Parallel Composition (Extended Abstract)

The languages accepted by finite automata are precisely the languages denoted by regular expressions. In contrast, finite automata may exhibit behaviours that cannot be described by regular expressions up to bisimilarity. In this paper, we consider extensions of the theory of regular expressions with various forms of parallel composition and study the effect on expressiveness. First we prove that adding pure interleaving to the theory of regular expressions strictly increases its expressiveness up to bisimilarity. Then, we prove that replacing the operation for pure interleaving by ACP-style parallel composition gives a further increase in expressiveness. Finally, we prove that the theory of regular expressions with ACP-style parallel composition and encapsulation is expressive enough to express all finite automata up to bisimilarity. Our results extend the expressiveness results obtained by Bergstra, Bethke and Ponse for process algebras with (the binary variant of) Kleene's star operation.Comment: In Proceedings EXPRESS'10, arXiv:1011.601

First-Order Logic Theorem Proving and Model Building via Approximation and Instantiation

In this paper we consider first-order logic theorem proving and model building via approximation and instantiation. Given a clause set we propose its approximation into a simplified clause set where satisfiability is decidable. The approximation extends the signature and preserves unsatisfiability: if the simplified clause set is satisfiable in some model, so is the original clause set in the same model interpreted in the original signature. A refutation generated by a decision procedure on the simplified clause set can then either be lifted to a refutation in the original clause set, or it guides a refinement excluding the previously found unliftable refutation. This way the approach is refutationally complete. We do not step-wise lift refutations but conflicting cores, finite unsatisfiable clause sets representing at least one refutation. The approach is dual to many existing approaches in the literature because our approximation preserves unsatisfiability

CONCUR Test-Of-Time Award 2020 Announcement

This short article announces the recipients of the CONCUR Test-of-Time Award 2020

Critical behavior at Mott-Anderson transition: a TMT-DMFT perspective

We present a detailed analysis of the critical behavior close to the Mott-Anderson transition. Our findings are based on a combination of numerical and analytical results obtained within the framework of Typical-Medium Theory (TMT-DMFT) - the simplest extension of dynamical mean field theory (DMFT) capable of incorporating Anderson localization effects. By making use of previous scaling studies of Anderson impurity models close to the metal-insulator transition, we solve this problem analytically and reveal the dependence of the critical behavior on the particle-hole symmetry. Our main result is that, for sufficiently strong disorder, the Mott-Anderson transition is characterized by a precisely defined two-fluid behavior, in which only a fraction of the electrons undergo a "site selective" Mott localization; the rest become Anderson-localized quasiparticles.Comment: 4+ pages, 4 figures, v2: minor changes, accepted for publication in Phys. Rev. Let

Decidability of the Monadic Shallow Linear First-Order Fragment with Straight Dismatching Constraints

The monadic shallow linear Horn fragment is well-known to be decidable and has many application, e.g., in security protocol analysis, tree automata, or abstraction refinement. It was a long standing open problem how to extend the fragment to the non-Horn case, preserving decidability, that would, e.g., enable to express non-determinism in protocols. We prove decidability of the non-Horn monadic shallow linear fragment via ordered resolution further extended with dismatching constraints and discuss some applications of the new decidable fragment.Comment: 29 pages, long version of CADE-26 pape

The use of neural network algorithms for the classification of undifferentiated arthritis by synovial histopathology

C