Megamodeling is the activity of specifying systems of models and mappings, their properties, and operations over them. The latter functionality is the most important for applications, and megamodels are often used as an abstract workflow language for model processing. To be independent of a particular modeling language, typical megamodels reduce relationships between models to unstructured edge...

Until recently, most data integration techniques involved central components, e.g., global schemas, to enable transparent access to heterogeneous databases. Today, however, with the democratization of tools facilitating knowledge elicitation in machine-processable formats, one cannot rely on global, centralized schemas anymore as knowledge creation and consumption are getting more and more dyna...

Very recently, Agarwal et al. (Fixed Point Theory Appl. 2012:40, 2012) initiated the study of fixed point theorems for mappings satisfying cyclical generalized contractive conditions in complete partial metric spaces. In the present paper, we study some fixed point theorems for a mapping satisfying a cyclical generalized contractive condition based on a pair of altering distance functions in co...

By using a lattice characterization of continuous projections defined on a topological vector space E arising from a dual pair, we determine the automorphism group of their orthomodular poset Proj(E) by means of automorphisms and anti-automorphisms of the lattice L of all closed subspaces of E. A connection between the automorphism group of the ring of all continuous linear mappings defined on ...

Abstract. In this paper, we prove results on n-tupled coincidence as well as n-tupled fixed point in partially ordered complete metric spaces for a pair of weakly contractive compatible mappings whenever n is even, wherein control functions are also employed. Our main theorem improves the corresponding results of Choudhury et al. (Ann. Univ. Ferrara 57: 1-16, 2011). We illustrate our main resul...

neric mapping framework at the schema level to address the problem of schema interoperability Providing a formalism for developing a generic, extensible, and semi-automated mapping A semi-automatic tool for schema mapping. at the University of Washington in Seattle, where he founded the database group. on Clio, the first semi-automatic tool for heterogeneous schema mapping. Keywords: data integ...

and Applied Analysis 3 Proposition 1.7 see 6 . Let X,G be a G-metric space. Then the followings are equivalent. 1 The sequence {xn} is G-Cauchy; 2 For every > 0, there exists k ∈ N such that G xn, xm, xm < , for all n,m ≥ k. Proposition 1.8 see 6 . Let X,G be a G-metric space. Then the function G x, y, z is jointly continuous in all three of its variables. Definition 1.9 see 6 . Let X,G and X′,...

This paper addresses a mathematically sound technique for the orthogonal matrix optimization problem that has broad applications in recent signal processing problems including the independent component analysis. We propose Dual Cayley parametrization technique that can decompose a slightly restricted version of the original problem into a pair of simple constraint-free optimization problems. Th...

*Correspondence: [email protected] Department of Mathematics, Bu-Ali Sina University, Hamedan, Iran Abstract In this paper, we study some fixed point theorems for self-mappings satisfying certain contraction principles on a convex complete metric space. In addition, we investigate some common fixed point theorems for a Banach operator pair under certain generalized contractions on a convex c...

Abstract In this paper, we study the Ishikawa type iteration process with errors, which converges to a common fixed point of a pair of mappings in complete generalized convex metric spaces. Furthermore, we obtain the corresponding results in Banach spaces. Our result improve and generalize a recent result of Khan[S.H. Khan, Common fixed points of two quasi-contractive operators in normed spaces...