Given two classifications, or lightweight ontologies, we compute the minimal mapping, namely the subset of all possible correspondences, called mapping elements, between them such that i) all the others can be computed from them in time linear in the size of the input ontologies, and ii) none of them can be dropped without losing property i). In this paper we provide a formal definition of mini...

In this paper, we prove strong convergence results for a modified Mann iterative process for a new class of I- nearly weak uniformly L-Lipschitzian mappings in a real Banach space. The class of I-nearly weak uniformly L-Lipschitzian mappings is an interesting generalization of the class of nearly weak uniformly L-Lipschitzian mappings which inturn is a generalization of the class of nearly unif...

Abstract. Viscosity method also called elliptic regularization, provide an efficient approach to a large number of problems coming from different branches of mathematical and physical sciences. One of the recent trend in the iterative construction of fixed point of nonlinear mappings is to use viscosity approximation method. In this paper we propose implicit and explicit viscosity method (VAM) ...

The author devised in [Math. USSR–Izv. 31 (1988) 481– 501] a procedure that reduces the problem of classifying systems of forms and linear mappings to the problem of classifying systems of linear mappings. We give a brief exposition of this method, review results that were obtained by using this method (and were published mainly in Russian), and give examples of classification problems that can...

The promise of the Web of Linked Data is to enable client applications to discover new data sources by following RDF links at run-time and to smoothly integrate data from these sources. Linked Data sources use different vocabularies to describe the same type of objects. It is also common practice to mix terms from different widely used vocabularies with proprietary terms. Thus Linked Data appli...

In this paper our aim is to introduce a new class of procedure, the Uniformly Asymptotically Regular-class of procedures (UAR-precedures), showing some examples of procedures as for finite family of mappings, as for infinite family of mappings. Then by a UAR-procedure we prove the convergence of an implicit iterative method and of an explicit iterative method to the unique solution of a variati...

The shrinking projection method has gained more and more attention as a powerful tool for the approximation of a fixed point of nonlinear mappings. In this paper, we introduce a new shrinking projection method for the approximation of fixed points of a family of pseudocontractive mappings in a Hilbert space. Using this method, we also deal with the problem of finding a common zero of a family o...

The goal of this study is to provide a new explicit iterative process method approach for solving maximal monotone(M.M )operators in Hilbert spaces utilizing finite family different types mappings as( nonexpansive mappings,resolvent and projection mappings. findings given research strengthen extend key previous the literature. Then, various structural conditions space variational inequality pro...

This paper introduces a new averaged algorithm for finding a common fixed point of a countably infinite family of generalized k-strictly pseudocontractive multi-valued mappings. The new iterative sequence introduced is proved to be an approximating fixed point sequence for common fixed points of a countably infinite family of this class of mappings. Furthermore, under some mild assumptions, str...

In this paper, we first introduce a monotone mapping and its resolvent in general metric spaces.Then, we give two new iterative methods  by combining the resolvent method with Halpern's iterative method and viscosity approximation method for  finding a fixed point of monotone mappings and a solution of variational inequalities. We prove convergence theorems of the proposed iterations  in ...