LAI determination in dune vegetation: a comparison of different techniques

Research was conducted in the nature reserve De Westhoek (De Panne, Belgium) in order to determine leaf-area-index (LAI) in different dune vegetation types by both direct (destructively) and indirect optical measurements. The destructive LAI determination was conducted in herbaceous and shrub vegetation types. It was found that the LAI of herbaceous vegetation ranges between 0.87 and 4.60 and the LAI of shrub vegetation between 2.25 and 3.58. Ground-based optical determination of LAI was only conducted in the shrub vegetation, by means of the SunScan (Delta-T Devices Ltd, Cambridge, UK). This indirect LAI method systematically overestimated direct LAI. Another applied optical method is the hemispherical photography (Nikon Coolpix 5000 camera). Airborne remote sensing data are used to establish a relationship between direct LAI and some vegetation indices. Based on the above established relationship a map of the horizontal LAI distribution in the nature reserve De Westhoek will be produced

Qualitative Analysis of Partially-observable Markov Decision Processes

We study observation-based strategies for partially-observable Markov decision processes (POMDPs) with omega-regular objectives. An observation-based strategy relies on partial information about the history of a play, namely, on the past sequence of observations. We consider the qualitative analysis problem: given a POMDP with an omega-regular objective, whether there is an observation-based strategy to achieve the objective with probability~1 (almost-sure winning), or with positive probability (positive winning). Our main results are twofold. First, we present a complete picture of the computational complexity of the qualitative analysis of POMDP s with parity objectives (a canonical form to express omega-regular objectives) and its subclasses. Our contribution consists in establishing several upper and lower bounds that were not known in literature. Second, we present optimal bounds (matching upper and lower bounds) on the memory required by pure and randomized observation-based strategies for the qualitative analysis of POMDP s with parity objectives and its subclasses

The Mps1 Kinase Modulates the Recruitment and Activity of Cnn1CENP-T at Saccharomyces cerevisiae Kinetochores

Kinetochores are conserved protein complexes that bind the replicated chromosomes to the mitotic spindle and then direct their segregation. To better comprehend Saccharomyces cerevisiae kinetochore function, we dissected the phospho-regulated dynamic interaction between conserved kinetochore protein Cnn1CENP-T, the centromere region, and the Ndc80 complex through the cell cycle. Cnn1 localizes to kinetochores at basal levels from G1 through metaphase but accumulates abruptly at anaphase onset. How Cnn1 is recruited and which activities regulate its dynamic localization are unclear. We show that Cnn1 harbors two kinetochore-localization activities: a C-terminal histone-fold domain (HFD) that associates with the centromere region and a N-terminal Spc24/Spc25 interaction sequence that mediates linkage to the microtubule-binding Ndc80 complex. We demonstrate that the established Ndc80 binding site in the N terminus of Cnn1, Cnn160–84, should be extended with flanking residues, Cnn125–91, to allow near maximal binding affinity to Ndc80. Cnn1 localization was proposed to depend on Mps1 kinase activity at Cnn1–S74, based on in vitro experiments demonstrating the Cnn1–Ndc80 complex interaction. We demonstrate that from G1 through metaphase, Cnn1 localizes via both its HFD and N-terminal Spc24/Spc25 interaction sequence, and deletion or mutation of either region results in anomalous Cnn1 kinetochore levels. At anaphase onset (when Mps1 activity decreases) Cnn1 becomes enriched mainly via the N-terminal Spc24/Spc25 interaction sequence. In sum, we provide the first in vivo evidence of Cnn1 preanaphase linkages with the kinetochore and enrichment of the linkages during anaphase

Antichain Algorithms for Finite Automata

We present a general theory that exploits simulation relations on transition systems to obtain antichain algorithms for solving the reachability and repeated reachability problems. Antichains are more succinct than the sets of states manipulated by the traditional fixpoint algorithms. The theory justifies the correctness of the antichain algorithms, and applications such as the universality problem for finite automata illustrate efficiency improvements. Finally, we show that new and provably better antichain algorithms can be obtained for the emptiness problem of alternating automata over finite and infinite words

Mightyl: A compositional translation from mitl to timed automata

Metric Interval Temporal Logic (MITL) was first proposed in the early 1990s as a specification formalism for real-time systems. Apart from its appealing intuitive syntax, there are also theoretical evidences that make MITL a prime real-time counterpart of Linear Temporal Logic (LTL). Unfortunately, the tool support for MITL verification is still lacking to this day. In this paper, we propose a new construction from MITL to timed automata via very-weak one-clock alternating timed automata. Our construction subsumes the well-known construction from LTL to Büchi automata by Gastin and Oddoux and yet has the additional benefits of being compositional and integrating easily with existing tools. We implement the construction in our new tool MightyL and report on experiments using Uppaal and LTSmin as back-ends

Practical Automated Partial Verification of Multi-Paradigm Real-Time Models

This article introduces a fully automated verification technique that permits to analyze real-time systems described using a continuous notion of time and a mixture of operational (i.e., automata-based) and descriptive (i.e., logic-based) formalisms. The technique relies on the reduction, under reasonable assumptions, of the continuous-time verification problem to its discrete-time counterpart. This reconciles in a viable and effective way the dense/discrete and operational/descriptive dichotomies that are often encountered in practice when it comes to specifying and analyzing complex critical systems. The article investigates the applicability of the technique through a significant example centered on a communication protocol. More precisely, concurrent runs of the protocol are formalized by parallel instances of a Timed Automaton, while the synchronization rules between these instances are specified through Metric Temporal Logic formulas, thus creating a multi-paradigm model. Verification tests run on this model using a bounded validity checker implementing the technique show consistent results and interesting performances.Comment: 33 pages; fixed a few typos and added data to Table

Structural and Functional Dissection of Mif2p, a Conserved DNA-binding Kinetochore Protein

Mif2p is the budding-yeast orthologue of the mammalian centromere-binding protein CENP-C. We have mapped domains of Saccharomyces cerevisiae Mif2p and studied the phenotyptic consequences of their deletion. Using chromatin immunoprecipitation (ChIP) and electrophoretic mobility shift assays, we have further shown that Mif2p binds in the CDEIII region of the budding-yeast centromere, probably in close spatial association with Ndc10p. Moreover, ChIP experiments show that Mif2p recruits to yeast kinetochores a substantial subset of inner and outer kinetochore proteins, but not the Ndc80 or Spc105 complexes. We have determined the crystal structure of the C-terminal, dimerization domain of Mif2p. It has a "cupin" fold, extremely similar both in polypeptide chain conformation and in dimer geometry to the dimerization domain of a bacterial transcription factor. The Mif2p dimer seems to be part of an enhanceosome-like structure that nucleates kinetochore assembly in budding yeast.Molecular and Cellular Biolog

Aspects of calculating first-order reversal curve distributions

Accepted versio

Robust Model-Checking of Linear-Time Properties in Timed Automata

International audienceFormal verification of timed systems is well understood, but their \emphimplementation is still challenging. Recent works by Raskin \emphet al. have brought out a model of parameterized timed automata that can be used to prove \emphimplementability of timed systems for safety properties. We define here a more general notion of robust model-checking for linear-time properties, which consists in verifying whether a property still holds even if the transitions are slightly delayed or expedited. We provide PSPACE algorithms for the robust model-checking of Büchi-like and LTL properties. We also verify bounded-response-time properties