Search results for " Computer"
showing 10 items of 6910 documents
Systèmes d'Information Scientifique : des modèles conceptuels aux annotations sémantiques Application au domaine de l'archéologie et des sciences du …
2013
Les Systèmes d'Information Scientifique (SIS) sont des Systèmes d'Information (SI) dont le but est de produire de la connaissance et non pas de gérer ou contrôler une activité de production de biens ou de services comme les SI d'entreprise. Les SIS se caractérisent par des domaines de recherche fortement collaboratifs impliquant des équipes pluridisciplinaires et le plus souvent géographiquement éloignées, ils manipulent des données aux structures très variables dans le temps qui vont au-delà de la simple hétérogénéité : nuages de points issus de scanner 3D, modèles numériques de terrain, cartographie, publications, données issues de spectromètre de masse ou de technique de thermoluminescen…
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.
Visually Induced Motion Sickness on the Horizon
2020
Visually induced motion sickness is an unpleasant but common side-effect of many simulations and VR-applications. We investigated whether an earth-fixed reference frame provided in the simulation is able to reduce motion sickness. To do so, we created a moving starfield that did not contain any indicators of the spatial orientation of the observer. As the observer was simulated to move through the randomly oscillating starfield, a time-to-contact task had to be carried out. Two colored stars on collision course with each other had to be spotted, then they disappeared and the time of their collision had to be judged. Eye-movements, task performance, and motion sickness were recorded. This co…
The Quantified Athlete: Associations of Wearables for High School Athletes
2018
The adoption of wearable technology in competitive sports can be an advantage to performance and training. Athletes who use personalised data to quantify their performances with the possibilities of sharing with others may use wearables to reinforce the athletic identity. Despite these changes, few studies have actually examined the associations between wearables and developing athletes in their quest for professional sports. Student athletes (n = 437, age = 17y) still in high schools completed a web-based survey about their professional aspirations, athletic identity, and the association with wearables. Wearables were measured by ownership and usage of apps, fitness trackers, or sports wat…
The 1-way on-line coupled atmospheric chemistry model system MECO(n) – Part 2: On-line coupling with the Multi-Model-Driver (MMD)
2012
A new, highly flexible model system for the seamless dynamical down-scaling of meteorological and chemical processes from the global to the meso-γ scale is presented. A global model and a cascade of an arbitrary number of limited-area model instances run concurrently in the same parallel environment, in which the coarser grained instances provide the boundary data for the finer grained instances. Thus, disk-space intensive and time consuming intermediate and pre-processing steps are entirely avoided and the time interpolation errors of common off-line nesting approaches are minimised. More specifically, the regional model COSMO of the German Weather Service (DWD) is nested on-line into the …
Le développement des médias sociaux. Proposition d'un modèle de diffusion intégrant les externalités de réseau dans un cadre concurrentiel
2011
International audience; La fréquentation des médias sociaux est très concentrée. L’intérêt de ce type de sites résidant dans la richesse du contenu élaboré par les participants, ce phénomène peut être en partie expliqué par les externalités de réseau. Afin de démontrer cet effet dans un cadre concurrentiel, cette recherche propose un modèle de diffusion intégrant le principe de l’attachement préférentiel issu des recherches en réseaux complexes. Ce modèle est analysé au travers d’une simulation et appliqué à 51 médias sociaux dans trois secteurs différents. Les résultats montrent que l’ajout de l’effet d’attraction menée par la taille relative du réseau social explique mieux la diffusion qu…
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.
Colorimetric Characterization of a Positive Film Scanner Using an Extremely Reduced Training Data Set
2011
International audience; In this work, we address the problem of having an accurate colorimetric characterization of a scanner for traditional posi- tive film in order to guarantee the accuracy of the color informa- tion during the digitization of a movie. The scanning of a posi- tive film is not an usual task, however it can happen for cultural heritage purpose. Art-movies, are often created and stored as positive-film in museums. One of the problems one can face for a colorimetric characterization is to have a reasonable number of measurements from an item. In this work we succeeded in having a reasonable accuracy with just a few number of measurement (typically 4 to 7 ∆Ea∗b units with 2 t…
The b-chromatic number of power graphs
2003
The b-chromatic number of a graph G is defined as the maximum number k of colors that can be used to color the vertices of G, such that we obtain a proper coloring and each color i, with 1 ≤ i≤ k, has at least one representant x_i adjacent to a vertex of every color j, 1 ≤ j ≠ i ≤ k. In this paper, we discuss the b-chromatic number of some power graphs. We give the exact value of the b-chromatic number of power paths and power complete binary trees, and we bound the b-chromatic number of power cycles.
Community-based method for extracting backbones
2022
Networks are an adequate representation for modeling and analyzing a great variety of complex systems. However, understanding networks with millions of nodes and billions of connections can be pretty challenging due to memory and time constraints. Therefore, selecting the relevant nodes and edges of these large-scale networks while preserving their core information is a major issue. In most cases, the so-called backbone extraction methods are based either on coarse-graining or filtering approaches. Coarse-graining techniques reduce the network size by gathering similar nodes into super-nodes, while filter-based methods eliminate nodes or edges according to a statistical property. In this wo…