Search results for " Computer science"
showing 10 items of 3983 documents
Investigating a multi-paradigm system for the management of archaeo- logical data : Corpus Lapidum Burgundiae
2013
International audience; Scientific Information Systems (SIS) must move beyond data repositories and closed systems, to allow collaborations among different research disciplines, to include new types of data, to control quality data, and to enable semantic interoperability. Archaeological data include textual information, quantifiable values and measures, sketches, photographies, 3D models, and lots of links among data and historical information sources. DBMS are essential component of SIS nevertheless, existing DBMS including NoSQL DB does not provide enough extensibility and cannot meet all the properties required by a SIS. Our contribution is a multi-paradigm data management system approa…
Publication automatique de données et de métadonnées dans geOrchestra
2018
International audience
Une plateforme haute performance pour l’exploitation des données massives - Application aux données des réseaux sociaux
2019
International audience
Lambda+ Architecture - Un patron d'architecture haute performance pour le traitement des Big Data
2020
International audience
BaGaTel: an ontology driven database to ecodesign food products taking into account their nutritional and sensory qualities
2020
International audience
Modèle tensoriel pour l'entreposage et l'analyse des données des réseaux sociaux Application à l'étude de la viralité sur Twitter
2018
International audience; Dans cet article, nous montrons comment la notion de tenseur permet de construire un modèle multi-paradigmes pour l'entreposage des données sociales. D'un point de vue architecture , cette approche permet de lier différents systèmes de stockage (polystore) et de limiter l'impact des outils ETL réalisant les transformations de modèles pour alimenter différents al-gorithmes d'analyse. Ainsi, le modèle proposé permet d'assurer l'indépendance logique entre les données et les programmes implantant les algorithmes d'analyse. Avec un cas concret ex-trait d'une étude de la viralité sur Twitter durant la période de l'entre deux tours de l'élection présidentielle française de …
Coding Partitions
2007
Motivated by the study of decipherability conditions for codes weaker than Unique Decipherability (UD), we introduce the notion of coding partition. Such a notion generalizes that of UD code and, for codes that are not UD, allows to recover the ''unique decipherability" at the level of the classes of the partition. By tacking into account the natural order between the partitions, we define the characteristic partition of a code X as the finest coding partition of X. This leads to introduce the canonical decomposition of a code in at most one unambiguous component and other (if any) totally ambiguous components. In the case the code is finite, we give an algorithm for computing its canonical…
A Note on Radio Antipodal Colouring of Paths
2005
International audience; The radio antipodal number of a graph G is the smallest integer c such that there exists an assignment f : V (G) -> {1, 2, . . . , c} satisfying |f(u) − f(v)| >= D − d(u, v) for every two distinct vertices u and v of G, where D is the diameter of G. In this note we determine the exact value of the antipodal number of the path, thus answering the conjecture given in [G. Chartrand, D. Erwin, and P. Zhang. Radio antipodal colorings of graphs, Math. Bohem. 127(1):57-69, 2002]. We also show the connections between this colouring and radio labelings.
Grundy coloring for power caterpillars
2003
International audience
Adjacent vertex distinguishing edge-colorings of meshes and hypercubes
2006
International audience