Rough set approximations of Pawlak [15] are sometimes generalized by using similarities between objects rather than elementary sets. In practical applications, both knowledge about properties of objects and knowledge of similarity between objects can be incomplete and inconsistent. The aim of this paper is to define set approximations when all sets, and their approximations, as well as similari...

A fuzzy binary track correlation algorithm and a fuzzy classical assignment algorithm are proposed for distributed multisensor data fusion in this paper. First, the corresponding composition of fuzzy element sets and selection of membership function are discussed. And then, dynamic assignment of weight vectors and multi-valency processing methods are designed. Finally, a fuzzy binary track corr...

The fuzzy representation of the edges has been widely studied in different works. Generally, for each pixel, the authors use membership degrees linearly proportional to the magnitude of the gradient at that position of the image. This would be equivalent to using a triangular membership functions on the gradient magnitude. In this work we study the use of parametric functions in the transformat...

We show that any p-selective and self-reducible set is in P. As the converse is also true, we obtain a new characterization of the class P. A generalization and several consequences of this theorem are discussed. Among other consequences, we show that under reasonable assumptions auto-reducibility and self-reducibility diier on NP, and that there are non-p-T-mitotic sets in NP.

A membership service is used in a distributed system to maintain information about which sites are functioning and which have failed at any given time. Such services have proven to be fundamental for constructing distributed applications, with many example services and algorithms deened in the literature. Despite these eeorts, however, little has been done on examining the abstract properties i...

Scientific applications and databases rarely interoperate easily. That is, scientific researchers who use computers expend significant time and effort writing special procedures to use their program with someone else’s data, or their data with someone else’s programs. These problems are exacerbated in modern computing environments, which consist of multiple computers of possibly different types...

The Ideal Membership Problem is as follows: given f0, f1, . . . , fm ∈ K[x1, . . . , xn], is f0 ∈ 〈f1, . . . , fm〉, where 〈f1, . . . , fm〉 denotes the ideal generated by the fi? An equivalent formulation is: are there q1, . . . , qm ∈ K[x1, . . . , xn] such that f0 = ∑m i=1 qifi? We will solve this question by using Gröbner bases. That is, a Gröbner basis is a “nice” representation of an ideal,...

Many distributed protocols explicitly depend on membership information, such as the identity or number of sites that are currently part of the system. Given this importance, several mechanisms have been proposed over the past decades to handle membership information, but most of them do not scale well in largeand highlydynamic systems. In this paper we advocate the use of “membership-oblivious”...