Galois connection in crisp binary relations has proved to be useful for several applications in computer science. Unfortunately, data is not always presented as a crisp binary relation but may be composed of fuzzy values, thus forming a fuzzy binary relation. This paper aims at defining the notion of fuzzy galois connection corresponding to a fuzzy binary relation in two steps: firstly by defin...

In class, we’ve been talking about the integers, which we’ve denoted Z. We started off talking about equality in Z, but then moved on to talking about congruences, which is a weaker notion. This handout explains how “congruence modulo n” is something called an equivalence relation, and we can use it to construct a set Z/nZ that’s a “quotient” of Z. The key point is that a congruence modulo n in...

We consider reduction in the synchronous π-calculus with replication, without sums. Usual definitions of reduction in the π-calculus use a closure w.r.t. structural congruence of processes. In this paper we operationalize structural congruence by providing a reduction relation for piprocesses which also performs necessary structural conversions explicitly by rewrite rules. As we show, a subset ...

the purpose of this study has been concretized in terms of impact of mobileadvertising on the purchase decision of the consumer and aimed to answer toresearch questions: which is the underlying structure of criteria in mobileadvertising? and which criteria are important for consumers in evaluatingmobile advertising? a sample of consumers in taiwan was surveyed and usingfuzzy judgment to determi...

This section define a level subring or level ideals obtain a set of necessary and sufficient condition for the equality of two ideals and characterizes field in terms of its fuzzy ideals. It also presents a procedure to construct a fuzzy subrings (fuzzy ideals) from any given ascending chain of subring ideal. We prove that the lattice of fuzzy congruence of group G (respectively ring R) is isom...

The aim of this work is to study an essential property in the framework of fuzzy preference structures, which is the transitivity. In particular, we discuss the relationship between the transitivity of a fuzzy large preference relation R and the transitivity of the fuzzy strict preference relation P obtained from R when every pair of elements can be compared. We consider some of the most import...

Ontology is the basis of sharing and reusing knowledge on the Semantic Web, and ontology-based semantic retrieval is a hotspot of current research. Fuzzy ontology is an extension of domain ontology for solving the uncertainty problems. To represent fuzzy knowledge more effectively, this paper presents a new series of fuzzy ontology models that consists of fuzzy domain ontology and fuzzy linguis...

The notion of “similarity” as defined in this paper is essentially a generalization of the notion of equivalence. In the same vein, a fuzzy ordering is a generalization of the concept of ordering. For example, the relation x *y (x is much larger than y) is a fuzzy linear ordering in the set of real numbers. More concretely, a similarity relation, S, is a fuzzy relation which is reflexive, symme...

In this paper, we present a generalization of the relational data model based on paraconsistent intuitionistic fuzzy sets. Our data model is capable of manipulating incomplete as well as inconsistent information. Fuzzy relation or intuitionistic fuzzy relation can only handle incomplete information. Associated with each relation are two membership functions one is called truth-membership functi...

In this paper, we present a new method for fuzzy query processing for document retrieval based on extended fuzzy concept networks. In an extended fuzzy concept network, there are four kinds of fuzzy relationships between concepts, i.e., fuzzy positive association, fuzzy negative association, fuzzy generalization, and fuzzy specialization. An extended fuzzy concept network can be modeled by a re...