Replication procedure for grouped Sobol' indices estimation in dependent uncertainty spaces

International audienceThis paper deals with the estimation of grouped Sobol' indices in the case where the dependence inside each group is given by sets of linear ordered constraints. In the framework of independent inputs, the replication method allows to estimate first-order indices with only two designs. Through the use of orthogonal arrays of strength two the replication method can be applied to estimate closed second-order indices. We extend this methodology to estimate first-order and closed second-order grouped Sobol' indices under sets of linear constraints. The construction of the two designs required by the replication method is now based on the simplex geometric structure to handle the constraints within each set. We propose a space filling strategy to construct these designs

A Note on Easy and Efficient Computation of Full Abelian Periods of a Word

Constantinescu and Ilie (Bulletin of the EATCS 89, 167-170, 2006) introduced the idea of an Abelian period with head and tail of a finite word. An Abelian period is called full if both the head and the tail are empty. We present a simple and easy-to-implement $O(n\log\log n)$-time algorithm for computing all the full Abelian periods of a word of length $n$ over a constant-size alphabet. Experiments show that our algorithm significantly outperforms the $O(n)$ algorithm proposed by Kociumaka et al. (Proc. of STACS, 245-256, 2013) for the same problem.Comment: Accepted for publication in Discrete Applied Mathematic

Saint-Nectaire – Église de Saint-Nectaire (choeur)

Identifiant de l'opération archéologique : 2007/182 Date de l'opération : 2007 (SD) Le chœur de l’église de Saint-Nectaire, dégagé en 2006 (BSR 2006, p. 119-121, Arnaud Alexandre), a fait l’objet comme prévu d’une étude approfondie en septembre 2007 par deux agents du service régional de l’archéologie d’Auvergne, accompagnés ponctuellement par quelques bénévoles. L’opération a été limitée à la moitié est du chœur, l’autre moitié étant recouverte d’une chape de mortier (soubassement de l’autel..

Study of cereals flows at local scales: Examples in the Rhône-Alpes région, the Isère département and the SCOT de Grenoble

International audienceThe purpose of this article is to put forward the role applied mathematics and computer science could play in the field of ecological accounting and particularly in that of material flow analysis. It is done based on a detailed study on modeling cereal flows at sub-national scales

Modelling for local scale sustainability and decision-making support: reflections and difficulties

International audienceThis paper is about integrated modelling for decision-making support to sustainability policies at local scales. By "local scales" we mean sub-national scales like cities, employment catchment areas, or slightly larger scales like départements and régions, for France. The goal of this article is to share a certain number of our motivations, outlooks and experiences we acquired via the creation of our research group, which tackles this complex topic. In a first step, we identify three scientific domains that we consider to play a key role in local scale sustainability and for which improvement in available knowledge is crucial. In a second part, we discuss challenges and difficulties one is confronted with when one wants to work on the context considered here

Efficient pattern matching in degenerate strings with the Burrows–Wheeler transform

International audienceA degenerate or indeterminate string on an alphabet Σ is a sequence of non-empty subsets of Σ. Given a degenerate string t of length n, we present a new method based on the Burrows--Wheeler transform for searching for a degenerate pattern of length m in t running in O(mn) time on a constant size alphabet Σ. Furthermore, it is a hybrid pattern-matching technique that works on both regular and degenerate strings. A degenerate string is said to be conservative if its number of non-solid letters is upper-bounded by a fixed positive constant q; in this case we show that the search complexity time is O(qm2). Experimental results show that our method performs well in practice