نتایج جستجو برای: fuzzy relational equations
تعداد نتایج: 366336 فیلتر نتایج به سال:
Fuzziness in databases is used to denote uncertain or incomplete data. Relational Databases stress on the nature of the data to be certain. This certainty based data is used as the basis of the normalization approach designed for traditional relational databases. But real world data may not always be certain, thereby making it necessary to design an approach for normalization that deals with fu...
With respect to multiple attribute decision making (MADM) problems in which the attribute values take the form of hesitant fuzzy elements, the traditional grey relational projection (GRP) method is extended to solve multiple attribute decision making problems under hesitant fuzzy environment. Based on the hesitant fuzzy decision matrix provided by decision makers, all feasible alternatives are ...
The work on this paper is an application of fuzzy set theory in relational databases. The authors introduce a new notion of fuzzy functional dependencies (ffd) in relational databases. It is observed that the existing notions of fuzzy functional dependencies (ffd) have a common drawback. Consequently the need for introducing a new type of fuzzy functional dependencies (ffd) is justified, and ex...
in this paper, the concept of canonical representation is proposed to find fuzzy roots of fuzzy polynomial equations. we transform fuzzy polynomial equations to system of crisp polynomial equations, this transformation is perform by using canonical representation based on three parameters value, ambiguity and fuzziness.
This paper presents fuzzy graph rewriting systems with fuzzy relational calculus. In this paper fuzzy graph means crisp set of vetices and fuzzy set of edges. We provide $\mathrm{f}\mathrm{u}\mathrm{z},7,\mathrm{y}$ relational calculus witll Heyting algebra. Formalizing rewriting system of fuzzy graphs it is important to $\mathrm{c}\cdot 1_{1\mathrm{t})\mathrm{t}}.\mathrm{q}\mathrm{C}1$ how to ...
We present a fuzzy version of the notion relational Galois connection between transitive directed graphs (fuzzy T-digraphs) on specific setting in which underlying algebra truth values is complete Heyting algebra. The components such are relations satisfying certain reasonable properties expressed terms so-called full powering. Moreover, we provide necessary and sufficient condition under it po...
in this paper, a new method based on parametric form for approximate solu-tion of fuzzy linear matrix equations (flmes) of the form ax = b; where ais a crisp matrix, b is a fuzzy number matrix and the unknown matrix x one,is presented. then a numerical example is presented to illustrate the proposedmodel.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید