نتایج جستجو برای: strictly pseudo contraction mapping
تعداد نتایج: 334811 فیلتر نتایج به سال:
The problem of dataset imbalance has raised a wide concern in many machine learning areas, but not non-intrusive load monitoring, or disaggregation. In this study, pictorial evaluation method is proposed to representation the class distribution datasets. We colored Karnaugh maps according quantities different variables combination offer visual impact whole dataset. After utilizing on public and...
In the Pseudo-Multiple-Exposure-Based Tone Fusion with Local Region Adjustment [1], it introduces a framework for inverse tone mapping which uses only one Low Dynamic Range (LDR) image to evaluate High Dynamic Range (HDR) image. First, map LDR image to HDR images using S curve. By changing the parameters of S curve, we can get different EV scenes. Then, segment the image into four different lum...
We consider the pseudo-Anosov elements of the mapping class group of a surface of genus g that fix a rank k subgroup of the first homology of the surface. We show that the smallest entropy among these is comparable to (k + 1)/g. This interpolates between results of Penner and of Farb and the second and third authors, who treated the cases of k = 0 and k = 2g, respectively, and answers a questio...
Certain generalized Banach's contraction mapping principles on metric spaces are unified and/or extended to Hausdorff uniform spaces. Also given are some relationships between the set of all cluster points of the Picard iterates and the set of all fixed points for the mapping. These are obtained by assuming that the latter set is nonempty and by considering certain "quasi"-contractive condition...
The pseudo-spin symmetry is reviewed. A mapping that produces the separation of the total angular momentum into pseudoorbital and pseudo-spin degrees of freedom is discussed, together with the analytic transformations that take us from the normal parity space to the eigenstates of a pseudo-oscillator with one quanta less. The manyparticle version of the unitary transformation to the pseudo-SU(3...
A pseudo-Boolean function (pBf) is a mapping from f0; 1gn to the real numbers. It is known that pseudo-Boolean functions have polynomial representations, and it was recently shown that they also have disjunctive normal forms (DNFs). In this paper we relate the DNF syntax of the classes of monotone, quadratic and Horn pBfs to their characteristic inequalities.
Mapping data to parallel computers aims at minimizing the execution time of the associated application. However, it can take an unacceptable amount of time in comparison with the execution time of the application if the size of the problem is large. In this article, first we motivate the case for graph contraction as a means for reducing the problem size. We restrict our discussion to applicati...
In this paper, we introduce a modified Mann iterative process for strictly pseudo-contractive mappings and obtain a strong convergence theorem in the framework of q-uniformly smooth Banach spaces. Our results improve and extend the recent ones announced by (Kim and Xu 2005), (Xu 2004) and some others.
The probabilistic metric space as one of the important generalization of metric space was introduced by K. Menger in 1942. In this paper, we briefly discuss the historical developments of contraction mappings in probabilistic metric space with some fixed point results.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید