A fixed point theorem for Meir-Keeler contractions in ordered metric spaces

[EN] The purpose of this paper is to present some fixed point theorems for Meir-Keeler contractions in a complete metric space endowed with a partial order. MSC: 47H10.

Slicing the metric space to provide quick indexing of complex data in the main memory

Searching in a dataset for elements that are similar to a given query element is a core problem in applications that manage complex data, and has been aided by metric access methods (MAMs). A growing number of applications require indices that must be built faster and repeatedly, also providing faster response for similarity queries. The increase in the main memory capacity and its lowering costs also motivate using memory-based MAMs. In this paper. we propose the Onion-tree, a new and robust dynamic memory-based MAM that slices the metric space into disjoint subspaces to provide quick indexing of complex data. It introduces three major characteristics: (i) a partitioning method that controls the number of disjoint subspaces generated at each node; (ii) a replacement technique that can change the leaf node pivots in insertion operations; and (iii) range and k-NN extended query algorithms to support the new partitioning method, including a new visit order of the subspaces in k-NN queries. Performance tests with both real-world and synthetic datasets showed that the Onion-tree is very compact. Comparisons of the Onion-tree with the MM-tree and a memory-based version of the Slim-tree showed that the Onion-tree was always faster to build the index. The experiments also showed that the Onion-tree significantly improved range and k-NN query processing performance and was the most efficient MAM, followed by the MM-tree, which in turn outperformed the Slim-tree in almost all the tests. (C) 2010 Elsevier B.V. All rights reserved.

Contractive-like mapping principles in ordered metric spaces and application to ordinary differential equations

[EN] The purpose of this paper is to present a fixed point theorem for generalized contractions in partially ordered complete metric spaces. We also present an application to first-order ordinary differential equations.

Every N-Dimensional Separable Metric Space Contains a Totally Disconnected (n-1)-Dimensional Subset with no True Quasi-Components

Владимир Тодоров, Петър Стоев - Тази бележка съдържа елементарна конструкция на множество с указаните в заглавието свойства. Да отбележим в допълнение, че така полученото множество остава напълно несвързано дори и след като се допълни с краен брой елементи.

Regrouping metric-space search index for search engine size adaptation

This work contributes to the development of search engines that self-adapt their size in response to fluctuations in workload. Deploying a search engine in an Infrastructure as a Service (IaaS) cloud facilitates allocating or deallocating computational resources to or from the engine. In this paper, we focus on the problem of regrouping the metric-space search index when the number of virtual machines used to run the search engine is modified to reflect changes in workload. We propose an algorithm for incrementally adjusting the index to fit the varying number of virtual machines. We tested its performance using a custom-build prototype search engine deployed in the Amazon EC2 cloud, while calibrating the results to compensate for the performance fluctuations of the platform. Our experiments show that, when compared with computing the index from scratch, the incremental algorithm speeds up the index computation 2–10 times while maintaining a similar search performance.

Weak and Semi Compatible Maps in Probabilistic Metric Space Using Implicit Relation

2000 Mathematics Subject Classification: 54H25, 47H10.

Self-adapting parallel metric-space search engine for variable query loads

This research focuses on automatically adapting a search engine size in response to fluctuations in query workload. Deploying a search engine in an Infrastructure as a Service (IaaS) cloud facilitates allocating or deallocating computer resources to or from the engine. Our solution is to contribute an adaptive search engine that will repeatedly re-evaluate its load and, when appropriate, switch over to a dierent number of active processors. We focus on three aspects and break them out into three sub-problems as follows: Continually determining the Number of Processors (CNP), New Grouping Problem (NGP) and Regrouping Order Problem (ROP). CNP means that (in the light of the changes in the query workload in the search engine) there is a problem of determining the ideal number of processors p active at any given time to use in the search engine and we call this problem CNP. NGP happens when changes in the number of processors are determined and it must also be determined which groups of search data will be distributed across the processors. ROP is how to redistribute this data onto processors while keeping the engine responsive and while also minimising the switchover time and the incurred network load. We propose solutions for these sub-problems. For NGP we propose an algorithm for incrementally adjusting the index to t the varying number of virtual machines. For ROP we present an ecient method for redistributing data among processors while keeping the search engine responsive. Regarding the solution for CNP, we propose an algorithm determining the new size of the search engine by re-evaluating its load. We tested the solution performance using a custom-build prototype search engine deployed in the Amazon EC2 cloud. Our experiments show that when we compare our NGP solution with computing the index from scratch, the incremental algorithm speeds up the index computation 2{10 times while maintaining a similar search performance. The chosen redistribution method is 25% to 50% faster than other methods and reduces the network load around by 30%. For CNP we present a deterministic algorithm that shows a good ability to determine a new size of search engine. When combined, these algorithms give an adapting algorithm that is able to adjust the search engine size with a variable workload.

Análise de estabilidade de sistemas dinâmicos híbridos e descontínuos modelados por semigrupos:

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Fixed point theorems of upper semicontinuous multivalued mappings with applications in hyperconvex metric spaces

In the present paper, we establish two fixed point theorems for upper semicontinuous multivalued mappings in hyperconvex metric spaces and apply these to study coincidence point problems and minimax problems. (C) 2002 Elsevier Science (USA). All rights reserved.

On the boundedness on inhomogeneous Lipschitz spaces of fractional integrals, singular integrals and hypersingular integrals associated to non-doubling measures on metric spaces

In this paper we prove T1 type necessary and sufficient conditions for the boundedness on inhomogeneous Lipschitz spaces of fractional integrals and singular integrals defined on a measure metric space whose measure satisfies a n-dimensional growth. We also show that hypersingular integrals are bounded on these spaces.

Quantum metric spaces as a model for pregeometry

A new arena for the dynamics of spacetime is proposed, in which the basic quantum variable is the two-point distance on a metric space. The scaling dimension (that is, the Kolmogorov capacity) in the neighborhood of each point then defines in a natural way a local concept of dimension. We study our model in the region of parameter space in which the resulting spacetime is not too different from a smooth manifold.

Quantum metric spaces as a model for pregeometry

A new arena for the dynamics of spacetime is proposed, in which the basic quantum variable is the two-point distance on a metric space. The scaling dimension (that is, the Kolmogorov capacity) in the neighborhood of each point then defines in a natural way a local concept of dimension. We study our model in the region of parameter space in which the resulting spacetime is not too different from a smooth manifold.

Stability of gradient semigroups under perturbations

In this paper we prove that gradient-like semigroups (in the sense of Carvalho and Langa (2009 J. Diff. Eqns 246 2646-68)) are gradient semigroups (possess a Lyapunov function). This is primarily done to provide conditions under which gradient semigroups, in a general metric space, are stable under perturbation exploiting the known fact (see Carvalho and Langa (2009 J. Diff. Eqns 246 2646-68)) that gradient-like semigroups are stable under perturbation. The results presented here were motivated by the work carried out in Conley (1978 Isolated Invariant Sets and the Morse Index (CBMS Regional Conference Series in Mathematics vol 38) (RI: American Mathematical Society Providence)) for groups in compact metric spaces (see also Rybakowski (1987 The Homotopy Index and Partial Differential Equations (Universitext) (Berlin: Springer)) for the Morse decomposition of an invariant set for a semigroup on a compact metric space).