Cohérence des données de bases RDF en évolution constante

National audienc

Somatic embryogenesis from stem nodal sections of grapevine

Indirect somatic embryogenesis was obtained for 11 clones of 6 Vitis vinifera cultivars: Cabernet-Sauvignon, Chardonnay, Gewürztraminer, Grenache, Merlot and Sauvignon, and for the rootstock Fercal [(Vitis berlandieri x Vitis colombard) x (Vitis vinifera x Vitis berlandieri)], starting from vegetative explants of in vitro plantlets. Embryogenic callus was recovered from nodal explants of every tested clone, while leaf explants led to embryogenesis only for the rootstock Fercal. We thus showed that axillary bud microcuttings are valuable explants for inducing somatic embryogenesis in V. vinifera and Fercal. Embryogenic cell lines have been maintained through secondary embryogenesis, and some embryos were converted into whole plantlets. A complete protocol for somatic embryogenesis and plant regeneration was therefore designed, using this very simple method.

Aperçus de recherche : interroger efficacement un ensemble de bases RDF

In the context of information retrieval in the Web of Data, we propose a kind of compact version of a RDF triplestore, that acts as an overview on this base of RDF triples. An overview is not only more compact that the initial triplestore, but also SPARQL can be used on it. An overview is built in such a way that if a SPARQL query on overview has no result, then there is no result too to this query into the initial triplestore. So, querying overviews is a more efficient solution than querying the whole triplestores when the query has often no result from these RDF databases. It is usually the case when a user query triplestores on the web of data. Our solution has been evaluated using RDF bases extracted from DBPedia and queries extracted either from the most common used on DBPedia or because of their resolution complexity

Targeted Linked-Data Extractor

The Linked Data Cloud is too big to be locally manipulated by standard computers and all use-cases doesn’t need to manipulate the whole cloud. To get exactly what is needed for a specific use-case, we need to obtain the specific parts from each bases of the Linked Data Cloud. This paper proposes a method to smartly extract a sub-part of the Linked Data Cloud driving by a list of resources called seeds. This method consist of extracting data starting from seed resources and recursively expanding the extraction to their neighbours

Consistency Evaluation of RDF Data: How Data and Updates are Relevant

Trust and quality maintenance have always been problematic in the Semantic Web RDF bases. Numerous propositions to address these problems of data integration have been made, either based on ontologies or on additional metadata. However ontologies suffer from a adaptation speed slower than the data evolution speed and metadata requires ad-hoc manipulations of data by addition of extra-data. In this article we propose an original approach, based exclusively on data from the base, to evaluate the consistency of a candidate update to a RDF base, and finally to know if this update is relevant to the base. Our approach is inspired by case-based reasoning and uses similarity evaluation and query relaxation methods to compare a candidate update to the data from the base. If the modifications of a candidate update make the target part of the base more similar to other part(s) of the base, then this candidate update is considered consistent with the base and can be applied

L-systems in Geometric Modeling

We show that parametric context-sensitive L-systems with affine geometry interpretation provide a succinct description of some of the most fundamental algorithms of geometric modeling of curves. Examples include the Lane-Riesenfeld algorithm for generating B-splines, the de Casteljau algorithm for generating Bezier curves, and their extensions to rational curves. Our results generalize the previously reported geometric-modeling applications of L-systems, which were limited to subdivision curves.Comment: In Proceedings DCFS 2010, arXiv:1008.127