Search results for "data structures"
showing 8 items of 258 documents
Effect of moisture uptake on flax-reinforced composite laminates: influence on dynamic and quasi-static properties
2016
International audience; This study proposes to investigate the effect of moisture uptake on a wide spectrum of mechanical behaviours of unidirectional flax fibre-reinforced epoxy laminates. It includes tensile monotonic and fatigue testing. Results show that UD flax-epoxy composites, whenexposed to hygrothermal conditioning at 70°C and 85% RH, exhibit a diffusion kinetic which follows a one dimensional Fickian behaviour. The mass uptake at equilibrium is approximately 3.3 % and the diffusion coefficient 6.5 10-6 m2.s-1. Water vapour sorption is shown to induce a significant change in the shape of the tensile stress-strain curve. Contrary to all expectations, water saturation does not degrad…
On the suffix automaton with mismatches
2007
International audience; In this paper we focus on the construction of the minimal deterministic finite automaton S_k that recognizes the set of suffixes of a word w up to k errors. We present an algorithm that makes use of S_k in order to accept in an efficient way the language of all suffixes of w up to k errors in every window of size r, where r is the value of the repetition index of w. Moreover, we give some experimental results on some well-known words, like prefixes of Fibonacci and Thue-Morse words, and we make a conjecture on the size of the suffix automaton with mismatches.
A trie-based approach for compacting automata
2004
International audience; We describe a new technique for reducing the number of nodes and symbols in automata based on tries. The technique stems from some results on anti-dictionaries for data compression and does not need to retain the input string, differently from other methods based on compact automata. The net effect is that of obtaining a lighter automaton than the directed acyclic word graph (DAWG) of Blumer et al., as it uses less nodes, still with arcs labeled by single characters.
Utilisation et traitement des données saisies sous EndNote avec des scripts PHP/MySQL
2010
National audience; Cet article présente la façon d’exploiter ou de traiter des données de références bibliographiques saisies ou importées dans EndNote en dehors de leur logiciel natif en utilisant des scripts PHP/MySQL. Deux raisons nous ont amenés à utiliser ce traitement : soit EndNote ne pouvait pas faire des opérations particulières, soit il le pouvait mais de façon trop fastidieuse. Dans ce but nous exposerons dans un premier temps la façon dont les données sont organisées par EndNote, puis la méthode pour les exploiter et enfin nous donnerons quelques exemples d’utilisation.
Abonder une base EndNote avec un formulaire web et un courriel
2011
National audience; Cet article présente une façon originale d’abonder une base EndNote en limitant le nombre d’erreurs et les doubles saisies. Cette procédure permet d’utiliser un canal unique et d’avoir les informations utiles à leur exploitation. La saisie s’effectue via un formulaire disponible sur l’intranet de l’unité, les données sont intégrées dans un fichier XML et envoyées par courriel à la documentaliste avec éventuellement une pièce attachée pour intégration directe à la base avec la fonction import d’EndNote.
Dynamic, Behavior-Based User Profiling Using Semantic Web Technologies in a Big Data Context
2013
pp. 363-372; International audience; The success of shaping the e-society is crucially dependent on how well technology adapts to the needs of each single user. A thorough understanding of one's personality, interests, and social connections facilitate the integration of ICT solutions into one's everyday life. The MindMinings project aims to build an advanced user profile, based on the automatic processing of a user's navigation traces on the Web. Given the various needs underpinned by our goal (e.g. integration of heterogeneous sources and automatic content extraction), we have selected Semantic Web technologies for their capacity to deliver machine-processable information. Indeed, we have…
ON-LINE CONSTRUCTION OF A SMALL AUTOMATON FOR A FINITE SET OF WORDS
2012
In this paper we describe a "light" algorithm for the on-line construction of a small automaton recognising a finite set of words. The algorithm runs in linear time. We carried out good experimental results on real dictionaries, on biological sequences and on the sets of suffixes (resp. factors) of a set of words that shows how our automaton is near to the minimal one. For the suffixes of a text, we propose a modified construction that leads to an even smaller automaton. We moreover construct linear algorithms for the insertion and deletion of a word in a finite set, directly from the constructed automaton.
Computing Subdivision Surface Intersection
2003
Computer surface intersections is fundamental problem in geometric modeling. Any Boolean operation can be seen as an intersection calculation followed by a selection of parts necessary for building the surface of the resulting object. This paper deals with the computing of intersection curveson subdivision surfaces (surfaces generated by the Loop scheme). We present three variants of our algorithm. The first variant calculates this intersection after classification of the object faces into intersecting and non-intersecting pairs of faces. the second variant is based on 1-neighborhood of the intersecting faces. The third variant uses the concept of bipartite graph.