Quasiperiodicity and non-computability in tilings

We study tilings of the plane that combine strong properties of different nature: combinatorial and algorithmic. We prove existence of a tile set that accepts only quasiperiodic and non-recursive tilings. Our construction is based on the fixed point construction; we improve this general technique and make it enforce the property of local regularity of tilings needed for quasiperiodicity. We prove also a stronger result: any effectively closed set can be recursively transformed into a tile set so that the Turing degrees of the resulted tilings consists exactly of the upper cone based on the Turing degrees of the later.Comment: v3: the version accepted to MFCS 201

Formalising the Continuous/Discrete Modeling Step

Formally capturing the transition from a continuous model to a discrete model is investigated using model based refinement techniques. A very simple model for stopping (eg. of a train) is developed in both the continuous and discrete domains. The difference between the two is quantified using generic results from ODE theory, and these estimates can be compared with the exact solutions. Such results do not fit well into a conventional model based refinement framework; however they can be accommodated into a model based retrenchment. The retrenchment is described, and the way it can interface to refinement development on both the continuous and discrete sides is outlined. The approach is compared to what can be achieved using hybrid systems techniques.Comment: In Proceedings Refine 2011, arXiv:1106.348

Sex differences in condition dependence of natal dispersal in a large herbivore: dispersal propensity and distance are decoupled

International audienceEvolution should favour plasticity in dispersal decisions in response to spatial heterogeneity in social and environmental contexts. Sex differences in individual optimization of dispersal decisions are poorly documented in mammals, because species where both sexes commonly disperse are rare. To elucidate the sex-specific drivers governing dispersal, we investigated sex differences in condition dependence in the propensity and distance of natal dispersal in one such species, the roe deer, using fine-scale monitoring of 146 GPS-collared juveniles in an intensively monitored population in southwest France. Dispersal propensity increased with body mass in males such that 36% of light individuals dispersed, whereas 62% of heavy individuals did so, but there was no evidence for condition dependence in dispersal propensity among females. By contrast, dispersal distance increased with body mass at a similar rate in both sexes such that heavy dispersers travelled around twice as far as light dispersers. Sex differences in the strength of condition-dependent dispersal may result from different selection pressures acting on the behaviour of males and females. We suggest that females disperse prior to habitat saturation being reached, likely in relation to the risk of inbreeding. By contrast, natal dispersal in males is likely governed by competitive exclusion through male–male competition for breeding opportunities in this strongly territorial mammal. Our study is, to our knowledge, a first demonstration that condition dependence in dispersal propensity and dispersal distance may be decoupled, indicating contrasting selection pressures drive the behavioural decisions of whether or not to leave the natal range, and where to settle

Trakhtenbrot's Theorem in Coq, A Constructive Approach to Finite Model Theory

We study finite first-order satisfiability (FSAT) in the constructive setting of dependent type theory. Employing synthetic accounts of enumerability and decidability, we give a full classification of FSAT depending on the first-order signature of non-logical symbols. On the one hand, our development focuses on Trakhtenbrot's theorem, stating that FSAT is undecidable as soon as the signature contains an at least binary relation symbol. Our proof proceeds by a many-one reduction chain starting from the Post correspondence problem. On the other hand, we establish the decidability of FSAT for monadic first-order logic, i.e. where the signature only contains at most unary function and relation symbols, as well as the enumerability of FSAT for arbitrary enumerable signatures. All our results are mechanised in the framework of a growing Coq library of synthetic undecidability proofs

Dendritic cell generation and CD4+CD25HIGHFOXP3+ regulatory T cells in human head and neck carcinoma during Radio-chemotherapy

<p>Abstract</p> <p>Background</p> <p>Regulatory T cells (Treg) and dendritic cells (DC) play an important role in tumor immunity and immune escape. However, their interplay and the effects of anti-cancer therapy on the human immune system are largely unknown.</p> <p>Methods</p> <p>For DC generation, CD14⁺monocytes were enriched by immunomagnetic selection from peripheral blood of advanced head and neck squamous cell carcinoma (HNSCC) patients and differentiated into immature DC using GM-SCF and IL-4. DC maturation was induced by addition of TNFα. The frequency of CD4⁺CD25^highF0XP3⁺Treg in HNSCC patients was analyzed before and after radio-chemotherapy (RCT) by four-color flow cytometry.</p> <p>Results</p> <p>In HNSCC patients, the frequency of Treg (0.33 ± 0.06%) was significantly (p = 0.001) increased compared to healthy controls (0.11 ± 0.02%), whereas RCT had variable effects on the Treg frequency inducing its increase in some patients and decrease in others. After six days in culture, monocytes of all patients had differentiated into immature DC. However, DC maturation indicated by CD83 up-regulation (70.7 ± 5.5%) was successful only in a subgroup of patients and correlated well with lower frequencies of peripheral blood Treg in those patients.</p> <p>Conclusion</p> <p>The frequency of regulatory T cells is elevated in HNSCC patients and may be modulated by RCT. Monocyte-derived DC in HNSCC patients show a maturation deficiency ex vivo. Those preliminary data may have an impact on multimodality clinical trials integrating cellular immune modulation in patients with advanced HNSCC.</p

Site Fidelity in Space Use by Spider Monkeys (Ateles geoffroyi) in the Yucatan Peninsula, Mexico

Animal home ranges may vary little in their size and location in the short term but nevertheless show more variability in the long term. We evaluated the degree of site fidelity of two groups of spider monkeys (Ateles geoffroyi) over a 10- and 13-year period, respectively, in the northeastern Yucatan peninsula, Mexico. We used the Local Convex Hull method to estimate yearly home ranges and core areas (defined as the 60% probability contour) for the two groups. Home ranges varied from 7.7 to 49.6 ha and core areas varied from 3.1 to 9.2 ha. We evaluated the degree of site fidelity by quantifying the number of years in which different areas were used as either home ranges or core areas. Large tracts were used only as home ranges and only for a few years, whereas small areas were used as either core area or home range for the duration of the study. The sum of the yearly core areas coincided partially with the yearly home ranges, indicating that home ranges contain areas used intermittently. Home ranges, and especially core areas, contained a higher proportion of mature forest than the larger study site as a whole. Across years and only in one group, the size of core areas was positively correlated with the proportion of adult males in the group, while the size of home ranges was positively correlated with both the proportion of males and the number of tree species included in the diet. Our findings suggest that spider monkey home ranges are the result of a combination of long-term site fidelity and year-to-year use variation to enable exploration of new resources

Mobile Air Quality Studies (MAQS) - an international project

Due to an increasing awareness of the potential hazardousness of air pollutants, new laws, rules and guidelines have recently been implemented globally. In this respect, numerous studies have addressed traffic-related exposure to particulate matter using stationary technology so far. By contrast, only few studies used the advanced technology of mobile exposure analysis. The Mobile Air Quality Study (MAQS) addresses the issue of air pollutant exposure by combining advanced high-granularity spatial-temporal analysis with vehicle-mounted, person-mounted and roadside sensors. The MAQS-platform will be used by international collaborators in order 1) to assess air pollutant exposure in relation to road structure, 2) to assess air pollutant exposure in relation to traffic density, 3) to assess air pollutant exposure in relation to weather conditions, 4) to compare exposure within vehicles between front and back seat (children) positions, and 5) to evaluate "traffic zone"- exposure in relation to non-"traffic zone"-exposure. Primarily, the MAQS-platform will focus on particulate matter. With the establishment of advanced mobile analysis tools, it is planed to extend the analysis to other pollutants including including NO2, SO2, nanoparticles, and ozone

Mechanized semantics for the Clight subset of the C language

This article presents the formal semantics of a large subset of the C language called Clight. Clight includes pointer arithmetic, "struct" and "union" types, C loops and structured "switch" statements. Clight is the source language of the CompCert verified compiler. The formal semantics of Clight is a big-step operational semantics that observes both terminating and diverging executions and produces traces of input/output events. The formal semantics of Clight is mechanized using the Coq proof assistant. In addition to the semantics of Clight, this article describes its integration in the CompCert verified compiler and several ways by which the semantics was validated.Comment: Journal of Automated Reasoning (2009

Trakhtenbrot’s Theorem in Coq: A Constructive Approach to Finite Model Theory

International audienceWe study finite first-order satisfiability (FSAT) in the constructive setting of dependent type theory. Employing synthetic accounts of enumerability and decidability, we give a full classification of FSAT depending on the first-order signature of non-logical symbols. On the one hand, our development focuses on Trakhtenbrot's theorem, stating that FSAT is undecidable as soon as the signature contains an at least binary relation symbol. Our proof proceeds by a many-one reduction chain starting from the Post correspondence problem. On the other hand, we establish the decidability of FSAT for monadic first-order logic, i.e. where the signature only contains at most unary function and relation symbols, as well as the enumerability of FSAT for arbitrary enumerable signatures. All our results are mechanised in the framework of a growing Coq library of synthetic undecidability proofs

How to Win First-Order Safety Games

First-order (FO) transition systems have recently attracted attention for the verification of parametric systems such as network protocols, software-defined networks or multi-agent workflows like conference management systems. Functional correctness or noninterference of these systems have conveniently been formulated as safety or hypersafety properties, respectively. In this article, we take the step from verification to synthesis---tackling the question whether it is possible to automatically synthesize predicates to enforce safety or hypersafety properties like noninterference. For that, we generalize FO transition systems to FO safety games. For FO games with monadic predicates only, we provide a complete classification into decidable and undecidable cases. For games with non-monadic predicates, we concentrate on universal first-order invariants, since these are sufficient to express a large class of properties---for example noninterference. We identify a non-trivial sub-class where invariants can be proven inductive and FO winning strategies be effectively constructed. We also show how the extraction of weakest FO winning strategies can be reduced to SO quantifier elimination itself. We demonstrate the usefulness of our approach by automatically synthesizing nontrivial FO specifications of messages in a leader election protocol as well as for paper assignment in a conference management system to exclude unappreciated disclosure of reports