In this paper we consider fuzzy relations compatible with algebraic operations, which are called fuzzy relational morphisms. In particular, we aim our attention to those fuzzy relational morphisms which are uniform fuzzy relations, called uniform fuzzy relational morphisms, and those which are partially uniform F -functions, called fuzzy homomorphisms. Both uniform fuzzy relations and partially...

this paper investigates the stability analysis of fuzzy relational dynamic systems. a new approach is introduced and a set of sufficient conditions is derived which sustains the unique globally asymptotically stable equilibrium point in a first-order fuzzy relational dynamic system with sumproduct fuzzy composition. this approach is also investigated for other types of fuzzy relational composit...

In this article we present several logical schemes. The scheme SubrelstrEx concerns a non empty relational structure A, a set B, and a unary predicate P, and states that: There exists a non empty full strict relational substructure S of A such that for every element x of A holds x is an element of S if and only if P[x] provided the following conditions are met: • P[B], • B ∈ the carrier of A. T...

DEFINITION A relational query language Q is BP-complete if for each relational database D, the set of all relations defined by the queries of Q on D is equal to the set of all first-order definable relations over D. More formally, fix some infinite universe U of atomic data elements. A relational database schema S is a finite set of relation names, each with an associated arity. A relational da...

The following propositions are true: (1) For every sup-semilattice L and for all elements x, y of L holds ⌈⌉L(↑x∩ ↑y) = x ⊔ y. (2) For every semilattice L and for all elements x, y of L holds ⊔ L(↓x∩↓y) = x ⊓ y. (3) Let L be a non empty relational structure and x, y be elements of L. If x is maximal in (the carrier of L) \ ↑y, then ↑x \ {x} = ↑x ∩ ↑y. (4) Let L be a non empty relational structu...

The articles [15], [18], [19], [21], [20], [7], [8], [10], [1], [2], [6], [14], [11], [16], [12], [17], [3], [4], [23], [9], [5], [22], and [13] provide the terminology and notation for this paper. Let L be a relational structure. We introduce L as a synonym of L`. We now state several propositions: (1) For every relational structure L and for all elements x, y of L holds x ¬ y iff xx ­ xy. (2)...

Purpose – The purpose of this paper is to investigate the relationships among suppliers’ trust and commitment, transaction-specific investment, switching cost, and customer involvement within the context of relational governance mechanism and the social exchange theory. Design/methodology/approach – The authors use survey data from 214 Chinese manufacturing firms and employ the structural equat...

There exists a wide set of techniques to perform keyword-based search over relational databases but all of them match the keywords in the users’ queries to elements of the databases to be queried as first step. The matching process is a time-consuming and complex task. So, improving the performance of this task is a key issue to improve the keyword based search on relational data sources. In th...

To manage the complicated data such as recursive elements, multiply namespaces, repeatable structures, extended elements and attributes in the XML Binding documents of distance education technology specifications, and solve the existing P_Schema (Physical XML Schema) cannot map for above complicated data, this paper proposes a new mapping model namely C_Schema (Complex XML Schema) which inherit...

In this paper we describe a new system for the reconstruction of geometric map elements as developed in the Dutch TopSpin-PNEM project ‘Knowledge-based conversion of utility maps’. In the knowledge base map conversion process vectorized map elements coming from an image interpretation system must be reconstructed in a geometrically accurate topographic base map. This is done using a map corresp...