Lineated valley fill (LVF) and lobate debris aprons (LDA) in the Deuteronilus Mensae northern dichotomy boundary region, Mars: Constraints on the extent, age and episodicity of Amazonian glacial events a r t i c l e i n f o a b s t r a c t In order to assess the nature, degradational processes and history of the dichotomy boundary on Mars, we conducted a detailed morphological analysis of a 70,...

We prove a complexity dichotomy theorem for counting weighted Boolean CSP modulo k for any positive integer k > 1. This generalizes a theorem by Faben for the unweighted setting. In the weighted setting, there are new interesting tractable problems. We first prove a dichotomy theorem for the finite field case where k is a prime. It turns out that the dichotomy theorem for the finite field is ve...

We study retarded parabolic non{autonomous evolution equations whose coeecients converge as t ! 1 such that the autonomous problem in the limit has an exponential dichotomy. Then the non{autonomous problem inherits the exponential dichotomy and the solution of the inhomogeneous equation tends to the stationary solution at innnity. We use a generalized characteristic equation to deduce the expon...

McDonald et al (2005) investigated the Kraepelinian dichotomy of psychosis using brain imaging. They reported distinct grey matter volumetric deficits in patients with schizophrenia and those with psychotic bipolar I disorder but common white matter abnormalities in the two disorders. Kraepelin distinguished dementia praecox and manic–depressive psychosis on the basis of symptomatology, course ...

In ontology-based data access (OBDA), ontologies are used as an interface for querying instance data. Since in typical applications the size of the data is much larger than the size of the ontology and query, data complexity is the most important complexity measure. In this paper, we propose a new method for investigating data complexity in OBDA: instead of classifying whole logics according to...

The “Fibonacci Dichotomy” of Kaiser and Klazar [15] was one of the first general results on the enumeration of permutation classes. It states that if there are fewer permutations of length n in a permutation class than the nth Fibonacci number, for any n, then the enumeration of the class is given by a polynomial for sufficiently large n. Since the Fibonacci Dichotomy was established for permut...

The G0-dichotomy due to Kechris, Solecki and Todorčević characterizes the analytic relations having a Borel-measurable countable coloring. We give a version of the G0-dichotomy for Σ 0 ξ-measurable countable colorings when ξ ≤ 3. A Σ 0 ξ-measurable countable coloring gives a covering of the diagonal consisting of countably many Σξ squares. This leads to the study of countable unions of Σξ recta...