Search results for "Opera"
showing 10 items of 8665 documents
ACTIVE3D: SEMANTIC AND MULTIMEDIA MERGING FOR FACILITY MANAGEMENT
2010
International audience; This paper presents a Semantic Web approach for facility management. This Web-based platform lets geographically dispersed project participants--from facility managers and architects to electricians to plumbers--directly use and exchange project documents in a centralized virtual environment using a simple Web browser. A 3D visualization lets participants move around in the building being designed and obtain information about the objects that compose it. This approach is based on a semantic model called CDMF and IFC 2x3. CDMF improves data management during the lifecycle of a building. Based on graph combinations and the contextual element SystemGraph, our propositio…
Scheduling coupled-tasks with incompatibility constraint: a bin-packing related problem
2014
International audience; We tackle the makespan minimization problem of coupled- tasks in presence of compatibility constraint. In particular, we focus on stretched coupled-tasks, i.e. coupled-tasks having the same sub-tasks execution time and idle time duration. We show the relationship with bin packing problems for some configurations, and study several problems in framework of complexity and approximation for which the topology of the compatibility graph is specific (star, chain, bipartite, . . .).
Pre-processings and Linear-Decomposition Algorithm to Solve the k-Colorability Problem
2004
International audience; We are interested in the graph coloring problem. We studied the effectiveness of some pre-processings that are specific to the k-colorability problem and that promise to reduce the size or the difficulty of the instances. We propose to apply on the reduced graph an exact method based on a linear-decomposition of the graph. We present some experiments performed on literature instances, among which DIMACS library instances.
Tourism-km: A variant of MMKP applied to the tourism domain
2012
International audience; We are interested in an original real-world problem coming from tourism field. We describe a modelling of the problem and propose a first approach that mixes knowledge management and operational research methods. Our algorithms have been implemented in order to produce tourism solutions that are not unique for a given request but that take into account the preferences of the tourist user and provide a personalized solution. We report computational results obtained on real-world instances.
Theoretical Aspects of Scheduling Coupled-Tasks in the Presence of Compatibility Graph
2012
International audience; This paper presents a generalization of the coupled-task sche-duling problem introduced by Shapiro \cite{Shapiro}, where considered tasks are subject to incompatibility constraints depicted by an undirected graph. The motivation of this problem comes from data acquisition and processing in a mono-processor torpedo used for underwater exploration. As we add the compatibility graph, we focus on complexity of the problem, and more precisely on the boundary between $\mathcal{P}$ and $\mathcal{NP}$-completeness when some other input parameters are restricted (e.g. the ratio between the durations of the two sub-tasks composing a task): we adapt the global visualization of …
Stratified Autocalibration of Cameras with Euclidean Image Plane
2020
International audience; This paper tackles the problem of stratified autocalibration of a moving camera with Euclidean image plane (i.e. zero skew and unit aspect ratio) and constant intrinsic parameters. We show that with these assumptions, in addition to the polynomial derived from the so-called modulus constraint, each image pair provides a new quartic polynomial in the unknown plane at infinity. For three or more images, the plane at infinity estimation is stated as a constrained polynomial optimization problem that can efficiently be solved using Lasserre's hierarchy of semidefinite relaxations. The calibration parameters and thus a metric reconstruction are subsequently obtained by so…
Temporal Logic To Query Semantic Graphs Using The Model Checking Method
2012
International audience; Semantic interoperability problems have found their solutions due to the use of languages and techniques from the Semantic Web. The proliferations of ontologies and meta-information have improved the understanding of information and the relevance of search engine responses. However, the construction of semantic graphs is a source of numerous errors of interpretation or modeling, and scalability remains a major problem. The processing of large semantic graphs is a limit to the use of semantics in current information systems. The work presented in this paper is part of a new research at the border of two areas: the semantic web and the model checking. This line of rese…
A note on Hilbert’s weak nullstellensatz
2015
In this article, through a suitable generalization of the well-known notion of spectrum of an element of an arbitrary normed algebra of Operator Theory, it will be possible to give another simple proof of the Hilbert’s Weak Nullstellensatz.
On Gelfand-Mazur Theorem
2015
From a suitable extension of the notion of spectrum drew from normed algebra theory, it will be possible, among other things, to provide some generalizations of the well-known Gelfand-Mazur theorem. In this brief research report, we wish to pursue one of these, as achieved in I,4.