Search results for "Information System"
showing 10 items of 2404 documents
An Ontology-Based Approach for the Reconstruction and Analysis of Digital Incidents Timelines
2015
International audience; Due to the democratisation of new technologies, computer forensics investigators have to deal with volumes of data which are becoming increasingly large and heterogeneous. Indeed, in a single machine, hundred of events occur per minute, produced and logged by the operating system and various software. Therefore, the identification of evidence, and more generally, the reconstruction of past events is a tedious and time-consuming task for the investigators. Our work aims at reconstructing and analysing automatically the events related to a digital incident, while respecting legal requirements. To tackle those three main problems (volume, heterogeneity and legal require…
Ontology-based Integration of Web Navigation for Dynamic User Profiling
2015
The development of technology for handling information on a Big Data-scale is a buzzing topic of current research. Indeed, improved techniques for knowledge discovery are crucial for scientific and economic exploitation of large-scale raw data. In research collaboration with an industrial actor, we explore the applicability of ontology-based knowledge extraction and representation for today's biggest source of large-scale data, the Web. The goal is to develop a profiling application, based on the implicit information that every user leaves while navigating the online, with the goal to identify and model preferences and interests in a detailed user profile. This includes the identification o…
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…
Adding Semantic Extension to Wikis for Enhancing Cultural Heritage Applications
2011
International audience; Wikis are appropriate systems for community-authored content. In the past few years, they show that are particularly suitable for collaborative works in cultural heritage. In this paper, we highlight how wikis can be relevant solutions for building cooperative applications in domains characterized by a rapid evolution of knowledge. We will point out the capabilities of semantic extension to provide better quality of content, to improve searching, to support complex queries and finally to carry out di fferent type of users. We describe the CARE project and explain the conceptual modeling approach. We detail the architecture of WikiBridge, a semantic wiki which allows …
Query-preserving watermarking of relational databases and XML documents
2011
Watermarking allows robust and unobtrusive insertion of information in a digital document. During the last few years, techniques have been proposed for watermarking relational databases or Xml documents, where information insertion must preserve a specific measure on data (for example the mean and variance of numerical attributes). In this article we investigate the problem of watermarking databases or Xml while preserving a set of parametric queries in a specified language, up to an acceptable distortion. We first show that unrestricted databases can not be watermarked while preserving trivial parametric queries. We then exhibit query languages and classes of structures that allow guarante…
Presentations of constrained systems with unconstrained positions
2005
International audience; We give a polynomial-time construction of the set of sequences that satisfy a finite-memory constraint defined by a finite list of forbidden blocks, with a specified set of bit positions unconstrained. Such a construction can be used to build modulation/error-correction codes (ECC codes) like the ones defined by the Immink-Wijngaarden scheme in which certain bit positions are reserved for ECC parity. We give a lineartime construction of a finite-state presentation of a constrained system defined by a periodic list of forbidden blocks. These systems, called periodic-finite-type systems, were introduced by Moision and Siegel. Finally, we present a linear-time algorithm for con…
Semantic Trajectory Modeling for Dynamic Built Environments
2017
This paper presents a data model to capture moving and changing objects in the context of dynamic built environment. Building elements are subject to change which represents semantic trajectories crossing trajectories of users. These semantic trajectories in dynamics built environment permit to capture fine-grained activities and behaviors of users and objects. The data model is based on ontology and description logics to capture logic constraints on semantic trajectories.
Semantic Mappings in Description Logics for Spatio-temporal Database Schema Integration
2005
International audience; The interoperability problem arises in heterogeneous systems where different data sources coexist and there is a need for meaningful information sharing. One of the most representive realms of diversity of data representation is the spatio-temporal domain. Spatio-temporal data are most often described according to multiple and greatly diverse perceptions or viewpoints, using different terms and with heterogeneous levels of detail. Reconciling this heterogeneity to build a fully integrated database is known to be a complex and currently unresolved problem, and few formal approaches exist for the integration of spatio-temporal databases. The paper discusses the interope…
XA2C Framework for XML Alteration/Adaptation
2010
XML has crossed the borders of software engineering and has spread to other areas such as e-commerce, identification, information storage, instant messaging and others. It is used to communicate crucial data over these domains. Thus, allowing non-expert programmers to manipulate and control their XML data is essential. In the literature, this issue has been dealt with from 3 perspectives: (i) XML alteration/adaptation techniques requiring a certain level of expertise to be implemented and are not unified yet, (ii) mashups, which are not formally defined yet and are not specific to XML data, and (iii) XML-oriented visual languages based on structural transformations and data extraction mainl…
Temporal Semantic Centrality for the Analysis of Communication Networks
2012
National audience; De nos jours, la compréhension des communautés en ligne devient un enjeu majeur du Web. Dans cet article nous proposons une nouvelle mesure, la Probabilité de Propagation Sémantique (SPP), qui caractérise la capacité de l'utilisateur à propager un concept sémantique à d'autres utilisateurs, d'une manière rapide et ciblée. La sémantique des messages est analysée selon une ontologie donnée. Nous utilisons cette mesure pour obtenir la Centralité Sémantique Temporelle (TSC) d'un utilisateur dans une communauté. Nous proposons et évaluons une expérimentation de cette mesure, en utilisant une ontologie et des données réelles issues du Web.