Search results for "DISTANCE"
showing 10 items of 1009 documents
Best Proximity Point Results in Non-Archimedean Fuzzy Metric Spaces
2013
We consider the problem of finding a best proximity point which achieves the minimum distance between two nonempty sets in a non-Archimedean fuzzy metric space. First we prove the existence and uniqueness of the best proximity point by using di fferent contractive conditions, then we present some examples to support our best proximity point theorems.
A class of label-correcting methods for the K shortest paths problem
2001
In this paper we deal with the problem of finding the first K shortest paths from a single origin node to all other nodes of a directed graph. In particular, we define the necessary and sufficient conditions for a set of distance label vectors, on the basis of which we propose a class of methods which can be viewed as an extension of the generic label-correcting method for solving the classical single-origin all-destinations shortest path problem. The data structure used is characterized by a set of K lists of candidate nodes, and the proposed methods differ in the strategy used to select the node to be extracted at each iteration. The computational results show that: 1. some label-correct…
An extension of the Burrows-Wheeler Transform
2007
AbstractWe describe and highlight a generalization of the Burrows–Wheeler Transform (bwt) to a multiset of words. The extended transformation, denoted by ebwt, is reversible. Moreover, it allows to define a bijection between the words over a finite alphabet A and the finite multisets of conjugacy classes of primitive words in A∗. Besides its mathematical interest, the extended transform can be useful for applications in the context of string processing. In the last part of this paper we illustrate one such application, providing a similarity measure between sequences based on ebwt.
Partial Hausdorff metric and Nadler’s fixed point theorem on partial metric spaces
2012
Abstract In this paper, we introduce the concept of a partial Hausdorff metric. We initiate study of fixed point theory for multi-valued mappings on partial metric space using the partial Hausdorff metric and prove an analogous to the well-known Nadlerʼs fixed point theorem. Moreover, we give a homotopy result as application of our main result.
Transportation cost inequalities on path and loop groups
2005
AbstractLet G be a connected Lie group with the Lie algebra G. The action of Cameron–Martin space H(G) on the path space Pe(G) introduced by L. Gross (Illinois J. Math. 36 (1992) 447) is free. Using this fact, we define the H-distance on Pe(G), which enables us to establish a transportation cost inequality on Pe(G). This method will be generalized to the path space over the loop group Le(G), so that we obtain a transportation cost inequality for heat measures on Le(G).
Scalable Ellipsoidal Classification for Bipartite Quantum States
2008
The Separability Problem is approached from the perspective of Ellipsoidal Classification. A Density Operator of dimension N can be represented as a vector in a real vector space of dimension $N^{2}- 1$, whose components are the projections of the matrix onto some selected basis. We suggest a method to test separability, based on successive optimization programs. First, we find the Minimum Volume Covering Ellipsoid that encloses a particular set of properly vectorized bipartite separable states, and then we compute the Euclidean distance of an arbitrary vectorized bipartite Density Operator to this ellipsoid. If the vectorized Density Operator falls inside the ellipsoid, it is regarded as s…
Efficient algorithm for learning simple regular expressions from noisy examples
1994
We present an efficient algorithm for finding approximate repetitions in a given sequence of characters. First, we define a class of simple regular expressions which are of star-height one and do not contain union operations, and a stochastic mutation process of a given length over a string of characters. Then, assuming that a given string of characters is obtained corrupted by the defined mutation process from some long enough word generated by a simple regular expression, we try to restore the expression. We prove that to within some reasonable accuracy it is always possible if the length of the mutation process is bounded comparing to the length of the example. We provide an algorithm by…
A dual of 4-regular graph forG × C2n
2003
Abstract A graph is said h-decomposable if its edge-set is decomposable into edge-disjoint hamiltonian cycles. Jha [3] conjectured that if G is a non-bipartite h-decomposable graph on even number of vertices, then G × K2 is h-decomposable. We use the notion of dual graph defined in [4], we prove that if G = Q1,2 ⊕ C3,4 is a 4-regular non-bipartite h-decomposable graph and the dual graphs relative to Q1,2 and C3,4 are connected then G × K 2 and G × C 2n are h-decomposable (where C 2n is an even cycle).
Interpolating sequences on uniform algebras
2009
Abstract We consider the problem of whether a given interpolating sequence for a uniform algebra yields linear interpolation. A positive answer is obtained when we deal with dual uniform algebras. Further we prove that if the Carleson generalized condition is sufficient for a sequence to be interpolating on the algebra of bounded analytic functions on the unit ball of c 0 , then it is sufficient for any dual uniform algebra.
Les conditions de vie étudiante en période de confinement : premiers résultats de l’enquête
2020
Etude de l'IREDU, téléchargeable sur https://iredu.u-bourgogne.fr/wp-content/uploads/2020/06/20020.pdf; Le confinement a été pour nombre de Français un bouleversement dans leur quotidien : les pratiques sociales ont dû ainsi s’adapter à cette période d’isolement pour réduire les effets de la crise sanitaire que de très nombreux pays dans le monde ont connu. Cette période, allant du 17 mars au 11 mai 2020, a eu des conséquences importantes sur plusieurs catégories de la population. Les étudiants ont été touchés à plusieurs titres. Les conditions d’études se sont radicalement transformées avec la fermeture en présentiel des établissements d’enseignement supérieur. Si l’enseignement à distance…