Similarity retrieval is an important paradigm for searching in environments where exact match has little meaning. Moreover, in order to enlarge the set of data types for which the similarity search can efficiently be performed, the notion of mathematical metric space provides a useful abstraction for similarity. In this paper we consider the problem of organizing and searching large data-sets f...

i.p.s. hypergroups are canonical hypergroups such that$[forall(a,x),a+xni x]Longrightarrow[a+x=x].$i.p.s. hypergroups were investigated in [1], [2], [3], [4] and it was proved thatif the order is less than 9, they are strongly canonical (see [13]). In this paperwe obtain the sequences of fuzzy sets and of join spaces determined (see [8])by all i.p.s. hypergroups of order seven. For the meaning ...

this paper continues the study of the connection between hyper- groups and fuzzy sets, investigating the length of the sequence of join spaces associated with a hypergroup. the classes of complete hypergroups and of 1-hypergroups are considered and analyzed in this context. finally, we give a method to construct a nite hypergroup with the strong fuzzy grade equal to a given natural number

ÐCurrent data repositories include a variety of data types, including audio, images, and time series. State-of-the-art techniques for indexing such data and doing query processing rely on a transformation of data elements into points in a multidimensional feature space. Indexing and query processing then take place in the feature space. In this paper, we study algorithms for finding relationshi...

Similarity join in distance spaces constrained by the metric postulates is the necessary complement of more famous similarity range and the nearest neighbor search primitives. However, the quadratic computational complexity of similarity joins prevents from applications on large data collections. We present the eD-Index, an extension of D-index, and we study an application of the eDIndex to imp...

In this paper it has been studied the sequence of membership functions and of join spaces (see [7]), determined by a class of 1–hypergroups which are not complete (see [2]).

In ZigBee, the router capable devices have restriction to accept a number of devices as children devices. A router capable device can not allow any new device to join as a child device if it reaches to the maximum capacity of children or depth limit. According to ZigBee specification each device has a permanent 64-bit MAC address. If a device joins a ZigBee network, it receives a short 16-bit M...

Hypergraph is a generalization of graph in which an edge can join any number vertices. used for combinatorial structures generalize graphs. In this research work, the notion hypergraphical metric spaces introduced, generalizes many existing spaces. Some fixed point theorems are studied corresponding To show authenticity established nontrivial examples and applications also provided.