Search results for " Computer science"
showing 10 items of 3983 documents
Estimation algébrique des paramètres intrinsèques d'un signal sinusoïdal biaisé en environnement bruité
2011
The amplitude, frequency and phase of a biased and noisy sinusoidal signal are estimated via algebraic techniques. The methods which are popular today seem unable to obtain a robust estimation of those parameters within a fraction of the signal's period. The e ciency of our approach is illustrated by several computer simulations.
Study of yeast-yeast interactions in fermentative medium
2019
Alcoholic fermentation is the main step for winemaking, mainly performed by the yeast Saccharomyces cerevisiae. But other wine yeasts called non-Saccharomyces may contribute to alcoholic fermentation and improve the wine aroma complexity. The recurrent problem with the use of these non-Saccharomyces yeasts is their trend to die off prematurely during alcoholic fermentation, leading to a lack of their interesting aromatic properties searched in the desired wine. This phenomenon appears to be mainly due to interactions with S. cerevisiae. These interactions are most of the time negatives but remain unclear because of the species and strain specific response. That is why several studies focuse…
Study of mechanical properties and mass transfer of agglomerated cork stoppers for sparkling wine conservation.
2019
The agglomerated cork stopper plays a key role in the preservation of sparkling wines because the gas exchanges (CO2 and O2) between the wine and the external environment depend on the stopper. The objective of this work is to determine the mechanical and barrier properties of agglomerated cork stoppers in order to identify the formulation parameters that can impact these properties, and highlight several critical points, which must be controlled during the process.The characterization of the agglomerated cork structure has revealed a large intergranular porosity, which is greatly reduced when smaller cork granules are used and when the cork is compressed in the bottleneck.The study of the …
Influence of organic matters on the bacterial AsIII oxidation in polluted soils
2014
International audience; The global bacterial AsIII-oxidizing activity tends to decrease As toxicity in soils and its transfer toward underlying aquifers. The influence of different types of organic matters on arsenic speciation by pure strains and soils microflora was determined. Experimental results show that the presence of organic matter has a negative effect on the specific rate of AsIII oxidation by pure strains presenting different metabolisms. In parallel, experiments are performed with various soils from different types of polluted sites: former mining and industrial sites, forest and agricultural soils impacted by mining activities. The effect of yeast extract on the AsIII-oxidizin…
Whole mirror duplication-random loss model and pattern avoiding permutations
2010
International audience; In this paper we study the problem of the whole mirror duplication-random loss model in terms of pattern avoiding permutations. We prove that the class of permutations obtained with this model after a given number p of duplications of the identity is the class of permutations avoiding the alternating permutations of length p2+1. We also compute the number of duplications necessary and sufficient to obtain any permutation of length n. We provide two efficient algorithms to reconstitute a possible scenario of whole mirror duplications from identity to any permutation of length n. One of them uses the well-known binary reflected Gray code (Gray, 1953). Other relative mo…
Topological properties of cellular automata on trees
2012
We prove that there do not exist positively expansive cellular automata defined on the full k-ary tree shift (for k>=2). Moreover, we investigate some topological properties of these automata and their relationships, namely permutivity, surjectivity, preinjectivity, right-closingness and openness.
Scheduling independent stochastic tasks under deadline and budget constraints
2018
This article discusses scheduling strategies for the problem of maximizing the expected number of tasks that can be executed on a cloud platform within a given budget and under a deadline constraint. The execution times of tasks follow independent and identically distributed probability laws. The main questions are how many processors to enroll and whether and when to interrupt tasks that have been executing for some time. We provide complexity results and an asymptotically optimal strategy for the problem instance with discrete probability distributions and without deadline. We extend the latter strategy for the general case with continuous distributions and a deadline and we design an ef…
Probability and algorithmics: a focus on some recent developments
2017
Jean-François Coeurjolly, Adeline Leclercq-Samson Eds.; International audience; This article presents different recent theoretical results illustrating the interactions between probability and algorithmics. These contributions deal with various topics: cellular automata and calculability, variable length Markov chains and persistent random walks, perfect sampling via coupling from the past. All of them involve discrete dynamics on complex random structures.; Cet article présente différents résultats récents de nature théorique illustrant les interactions entre probabilités et algorithmique. Ces contributions traitent de sujets variés : automates cellulaires et calculabilité, chaînes de Mark…
Almost disjoint spanning trees
2016
International audience; In this extended abstract, we only consider connected graphs. Let k ≥ 2 be an integer and T 1 ,. .. , T k be spanning trees in a graph G. A vertex is said to be an inner vertex in a tree T if it has degree at least 2 in T. We denote by I(T) the set of inner vertices of tree T. The spanning trees T 1 ,. .. , T k are completely independent spanning trees if any vertex from G is an inner vertex in at most one tree among T 1 ,. .. , T k and the trees T 1 ,. .. , T k are pairwise edge-disjoint. Completely independent spanning trees were introduced by Hasunuma [4] and then have been studied on different classes of graphs, such as underlying graphs of line graphs [4], maxim…
Recherche d'arbres couvrants complètement indépendants dans des graphes réguliers
2014
International audience; Nous étudions l'existence de $r$ arbres couvrants complètement indépendants dans des graphes $2r$-réguliers et $2r$-connexes, et énonçons des conditions nécessaires à leur existence. Nous déterminons le nombre maximum d'arbres dans les produits cartésiens d'une clique et d'un cycle. Nous montrons que ce nombre n'est pas toujours $r$.