In this paper, we present Gauss-Sidel and successive over relaxation (SOR) iterative methods for finding the approximate solution system of fuzzy Sylvester equations (SFSE), AX + XB = C, where A and B are two m*m crisp matrices, C is an m*m fuzzy matrix and X is an m*m unknown matrix. Finally, the proposed iterative methods are illustrated by solving one example.

In this paper, we first define the notion of a complete general fuzzyautomaton with threshold c and construct an $H_{nu}$- group, as well as commutativehypergroups, on the set of states of a complete general fuzzy automatonwith threshold c. We then define invertible general fuzzy automata, discussthe notions of “homogeneity, “separation, “thresholdness connected, “thresholdnessinner irreducible...

the aim of this paper is to introduce $(l,m)$-fuzzy closurestructure where $l$ and $m$ are strictly two-sided, commutativequantales. firstly, we define $(l,m)$-fuzzy closure spaces and getsome relations between $(l,m)$-double fuzzy topological spaces and$(l,m)$-fuzzy closure spaces. then, we introduce initial$(l,m)$-fuzzy closure structures and we prove that the category$(l,m)$-{bf fc} of $(l,m...

We introduced the notions of fuzzy C e-I(ec, eo) functions and fuzzy completely C e-I(rc, eo) functions via fuzzy e-open sets. Some properties and several characterization of these types of functions are investigated.

In Data mining, Fuzzy clustering algorithms have demonstrated advantage over crisp clustering algorithms in dealing with the challenges posed by large collections of vague and uncertain natural data. This paper reviews concept of fuzzy logic and fuzzy clustering. The classical fuzzy c-means algorithm is presented and its limitations are highlighted. Based on the study of the fuzzy c-means algor...

In Data mining, Fuzzy clustering algorithms have demonstrated advantage over crisp clustering algorithms in dealing with the challenges posed by large collections of vague and uncertain natural data. This paper reviews concept of fuzzy logic and fuzzy clustering. The classical fuzzy c-means algorithm is presented and its limitations are highlighted. Based on the study of the fuzzy c-means algor...

In this paper, an idea of generalized fuzzy c-distance in fuzzy cone metric space is introduced. A common fixed point theorem is established for a pair of self mappings in fuzzy cone metric spaces by using the concept of generalized fuzzy c-distance. 2010 AMS Classification: : 54A40, 03E72

Fuzzy Graphs are having numerous applications in problems like Network analysis, Clustering, Pattern Recognition and Neural Networks. The analysis of properties of fuzzy graphs has facilitated the study of many complicated networks like Internet. In this paper we study the structures of complement of many important fuzzy graphs such as Fuzzy cycles, Blocks etc. The complement of fuzzy graphs wi...

The objective of this paper is to deal with the fuzzy conic program- ming problems. The aim here is to derive weak and strong duality theorems for a general fuzzy conic programming. Toward this end, The convexity-like concept of fuzzy mappings is introduced and then a speci c ordering cone is established based on the parameterized representation of fuzzy numbers. Un- der this setting, duality t...

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 ...