Research has investigated mappings among data sources under two perspectives. On one side, there are studiesof practical tools for schema mapping generation; these focus on algorithms to generate mappings based on visualspecifications provided by users. On the other side, we have theoretical researches about data exchange. These studyhow to generate a solution – i.e., a target insta...

We show how to continuously map a texture onto a 3D triangle mesh when some of the mesh vertices are constrained to have given (u,v) coordinates. This problem arises frequently in interactive texture mapping applications and, to the best of our knowledge, a complete and efficient solution is not available. Our techniques always guarantee a solution by introducing extra (Steiner) vertices in the...

The advent of high-throughput sequencing technologies constituted a major advance in genomic studies, offering new prospects in a wide range of applications. We propose a rigorous and flexible algorithmic solution to mapping SOLiD color-space reads to a reference genome. The solution relies on an advanced method of seed design that uses a faithful probabilistic model of read matches and, on the...

Data Flow is a natural paradigm representing distributed programs able to express data and control dependencies between composing nodes. Our work concentrates on periodic Data-Flow programs having Hard Real-Time constraints. We propose a model and a string-based representation for a relevant class of Data-Flow programs and present a two-phase algorithm able to compute a schedule for a given set...

The computation of periodic orbits of nonlinear mappings or dynamical systems can be achieved by applying a root-finding method. To determine a periodic solution, an initial guess should be located within a proper area of the mapping or a surface of section of the phase space of the dynamical system. In the case of Newton or Newton-like methods these areas are the basins of convergence correspo...

The percolation probability for directed, compact percolation near a damp wall, which interpolates between the previously examined cases, is derived exactly. We find that the critical exponent β = 2 in common with the dry wall, rather than the value previously found in the wet wall and bulk cases. The solution is found via a mapping to a particular model of directed walks. We evaluate the exact...

This paper proposes an ontology mapping based framerowk that allows searching for web resources using multiple ontologies. The proposed solution uses a mapping ontology that is a part of a recent Semantic Web initiative called the Simple Knowledge Organization System (SKOS). On top of that, we propose the search algorithm that takes arguments from one ontology and generates queries compliant wi...

We first introduce the iterative procedure to approximate a common element of the fixed-point set of two quasinonexpansive mappings and the solution set of the system of mixed equilibrium problem SMEP in a real Hilbert space. Next, we prove the weak convergence for the given iterative scheme under certain assumptions. Finally, we apply our results to approximate a common element of the set of c...

This paper presents fast and robust per-sample correct shadows for WebGL platform. The algorithm is based on silhouette shadow volumes and it rivals the standard shadow mapping performance. Our performance is usually superior when compared with high resolution shadow maps. Moreover, it does not suffer from a number of artefacts of shadow mapping and always provides per-pixel correct results. We...

Most automotive applications today consist of a set of interacting tasks. These applications are implemented on a distributed architecture consisting of several ECUs connected by buses. Although algorithms are designer to be robust, several communication flows between tasks should be designed in such a way that there is no loss of data. Furthermore, safety critical applications depend on correc...