Search results for "Dean"

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…

On the structure of the ultradistributions of Beurling type

2008

Let O be a nonempty open set of the k-dimensional euclidean space Rk. In this paper, we give a structure theorem on the ultradistributions of Beurling type in O. Also, other structure results on certain ultradistributions are obtained, in terms of complex Borel measures in O.

Semi-compatible and reciprocally continuous maps in weak non-Archimedean Menger PM-spaces

2012

In this paper, we introduce semi-compatible maps and reciprocally continuous maps in weak non-Archimedean PM-spaces and establish a common fixed point theorem for such maps. Moreover, we show that, in the context of reciprocal continuity, the notions of compatibility and semi-compatibility of maps become equivalent. Our result generalizes several fixed point theorems in the sense that all maps involved in the theorem can be discontinuous even at the common fixed point.

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…

General measure theory

1995

Some dissenting views on the transitivity of individual preference

1990

(1) The transitivity property is not a necessary condition for the rationality of all individual preference relations. (2) A weakened definition of the transitivity is not necessarily relevant. (3) The non-transitivity of fuzzy preference relations is not inconsistent with a fuzzy total preorder structure on the set of alternatives.

Density theorems for Hausdorff and packing measures

1995

Fixed point theory for cyclic weak ϕ-contraction in fuzzy metric spaces

2012

In this paper, we introduce cyclic weak $\phi-$contractions in fuzzy metric spaces and utilize the same to prove some results on existence and uniqueness of fixed point in fuzzy metric spaces. Some related results are also proved besides furnishing illustrative examples.

The Spanning Tree based Approach for Solving the Shortest Path Problem in Social Graphs

2016

Nowadays there are many social media sites with a very large number of users. Users of social media sites and relationships between them can be modelled as a graph. Such graphs can be analysed using methods from social network analysis (SNA). Many measures used in SNA rely on computation of shortest paths between nodes of a graph. There are many shortest path algorithms, but the majority of them suits only for small graphs, or work only with road network graphs that are fundamentally different from social graphs. This paper describes an efficient shortest path searching algorithm suitable for large social graphs. The described algorithm extends the Atlas algorithm. The proposed algorithm so…