The notion of smooth biproximity space  where $delta_1,delta_2$ are gradation proximities defined by Ghanim et al. [10]. In this paper, we show every smooth biproximity space $(X,delta_1,delta_2)$ induces a supra smooth proximity space $delta_{12}$ finer than $delta_1$ and $delta_2$. We study the relationship between $(X,delta_{12})$ and the $FP^*$-separation axioms which had been introduced by...

in this paper, we investigate the l-fuzzy proximities and the relationships betweenl-fuzzy topologies, l-fuzzy topogenous order and l-fuzzy uniformity. first, we show that the category of-fuzzy topological spaces can be embedded in the category of l-fuzzy quasi-proximity spaces as a coreective full subcategory. second, we show that the category of l -fuzzy proximity spaces is isomorphic to the ...

In this article we survey the existence of best proximity points for a class of non-self mappings which‎ satisfy a particular nonexpansiveness condition. In this way, we improve and extend a main result of Abkar and Gabeleh [‎A‎. ‎Abkar‎, ‎M‎. ‎Gabeleh‎, Best proximity points of non-self mappings‎, ‎Top‎, ‎21, (2013)‎, ‎287-295]‎ which guarantees the existence of best proximity points for nonex...

In this paper, we introduce some new classes of proximal contraction mappings and establish  best proximity point theorems for such kinds of mappings in a non-Archimedean fuzzy metric space. As consequences of these results, we deduce certain new best proximity and fixed point theorems in partially ordered non-Archimedean fuzzy metric spaces. Moreover, we present an example to illustrate the us...

This paper is concerned with the best proximity pair problem in Hilbert spaces. Given two subsets $A$ and $B$ of a Hilbert space $H$ and the set-valued maps $F:A o 2^ B$ and $G:A_0 o 2^{A_0}$, where $A_0={xin A: |x-y|=d(A,B)~~~mbox{for some}~~~ yin B}$, best proximity pair theorems provide sufficient conditions that ensure the existence of an $x_0in A$ such that $$d(G(x_0),F(x_0))=d(A,B).$$

‎In this paper‎, ‎first we introduce the notion of $frac{1}{2}$-modular metric spaces and weak $(alpha,Theta)$-$omega$-contractions in this spaces and we establish some results of best proximity points‎. ‎Finally‎, ‎as consequences of these theorems‎, ‎we derive best proximity point theorems in modular metric spaces endowed with a graph and in partially ordered metric spaces‎. ‎We present an ex...

Over the past decade, a variety of expressive linguistic query languages have been developed. The most scalable of these have been implemented on top of an existing database engine. However, with the arrival of efficient, wide-coverage parsers, it is feasible to parse text on a scale that is several orders of magnitude larger. We show that the existing database approach will not scale up, and s...

Many pattern recognition tasks can modeled as proximity searching. From nearest neighbor classification to multimedia databases the common task is to quickly find all the elements close to a given query. This task can be accomplished very easily by sequentially examining all the elements in the collection, but turns to be impractical in two situations: when the distance used to compare elements...

This paper describes a method for establishing ad hoc and infrastructuremode wireless network connections based on physical proximity. Users can easily establish secure wireless connections between two digital devices by putting them in close proximity to each other and pressing the connection button. The devices ”identify” each other by measuring each other’s signal strength. We designed a set...

The concept of similarity is used as the basis for many data exploration and data mining tasks. Nearest Neighbor (NN) queries identify the most similar items, or in terms of distance the closest points to a query point. Similarity is traditionally characterized using a distance function between multi-dimensional feature vectors. However, when the data is high-dimensional, traditional distance f...