Several query mapping algorithms have been proposed to translate XML queries into SQL queries for a schema-based relational XML storage. However, existing query mapping algorithms only support single-valued mapping schemes, in which each XML element type is mapped to exactly one relation, and do not support multi-valued mapping schemes, in which each XML element type can be mapped to multiple r...

Elastic solutions applicable to single underground openings usually suffer from geometry related simplification. Most tunnel shapes possess two axes of symmetry while a wide range of geometries used in tunneling practice involve only one symmetry axis. D-shape or horse-shoe shape tunnels and others with arched roof and floor are examples of the later category (one symmetry axis). In the present...

It is well-known that the performance of acoustic-to-articulatory inversion improves by smoothing the articulatory trajectories estimated using Gaussian mixture model (GMM) mapping (denoted by GMM + Smoothing). GMM + Smoothing also provides similar performance with GMM mapping using dynamic features, which integrates smoothing directly in the mapping criterion. Due to the separation between smo...

let $x$ be a reflexive banach space, $t:xto x$ be a nonexpansive mapping with $c=fix(t)neqemptyset$ and $f:xto x$ be $delta$-strongly accretive and $lambda$- strictly pseudocotractive with $delta+lambda>1$. in this paper, we present modified hybrid steepest-descent methods, involving sequential errors and functional errors with functions admitting a center, which generate convergent sequences t...

Weaving models are used in the model driven engineering (MDE) community for various application scenarios related to model mappings. However, an analysis of its suitability for specification of heterogeneous schema mappings reveals that weaving models lack support for mapping rules and, therefore, cannot prevent mapping specifications which are semantically meaningless, wrong or disallowed. Thi...

To solve the load imbalance problem of a solution-adaptive finite element application program on a distributed memory multicomputer, nodes of a refined finite element graph can be remapped to processors or load of a refined finite element graph can be redistributed based on the current load of each processor. For the former case, remapping can be performed by some fast mapping algorithms. For t...

A cooperative game with transferable utilities, or simply a TU-game, describes a situation in which players can obtain certain payo®s by cooperation. A solution mapping for these games is a mapping which assigns to every game a set of payo® distributions over the players in the game. Well-known solution mappings are the Core and the Weber set. In this paper we consider the mapping assigning to ...

An approach to solving a complementarity problem entails regular-izing/perturbing the problem by adding to the given mapping another mapping multiplied by a small positive parameter. We study properties of the limit point of the solution to the regularized problem. We also derive local error bounds on the distance from the solution to its limit point, expressed in terms of the regularization pa...

For a maximal monotone operator T in a Banach space an iterative solution of 0 ∈ Tx has been found through weak and strong convergence of resolvents of these operators. Identity mapping in the definition of resolvents has been replaced by the duality mapping. Solution after finite steps has also been established.