Topology design of distributed local area networks can be classified as a hard combinatorial optimization problem. The problem has several conflicting objectives, such as cost, reliability, network delay, and number of hops between source and destination. These desirable features of a network topology can best be expressed in linguistic terms, which is the basis of fuzzy logic. This paper prese...

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.

The backing of the fuzzy ideal is normal ideal in some ring and in same time there fuzzy set whose is not fuzzy ideal and it backing set is ideal, i.e., it crisp is normal ideal. Consequently, in this paper we constructing a fuzziness function which defined on fuzzy sets and assigns membership grade for every fuzzy set whose it backing set are crisp ideal. Now, Let  be collection of all fuzzy s...

In many geographical applications there is a need to model spatial phenomena not simply by sharply bounded objects but rather through vague concepts due to indeterminate boundaries. Spatial database systems and geographical information systems are currently not able to deal with this kind of data. In order to support these applications , for an important kind of vagueness called fuzziness, we p...

It is shown that, for any spatial frame L (i.e., L is a complete lattice generated by the set of all prime elements), both the specialization L-preorder of L-topological spaces introduced by Lai and Zhang [Fuzzy preorder and fuzzy topology, Fuzzy Sets and Systems 157 (2006) 1865–1885] and that of L-fuzzifying topological spaces introduced by Fang and Qiu [Fuzzy orders and fuzzifying topologies,...

After Zadeh pioneering’s paper [15], where the Theory of Fuzzy Sets was introduced, hundreds of examples have been supplied where the nature of uncertainty in the behavior of a given system possesses fuzzy rather than stochastic nature. Non-stationary fuzzy systems described by fuzzy processes look as their natural extension into the time domina. From different viewpoints they were carefully st...

The idea of spherical fuzzy soft set (SFSS) is a new hybrid model (SS) and (SFS). An SFSS approach for information analysis fusion, modeling. We define the concepts spherical-fuzzy-soft-set topology (SFSS-topology) separation axioms. Several characteristics SFSS-topology are investigated related results derived. developed an extended choice value method (CVM) AHP-TOPSIS (analytical hierarchy pr...

In this paper, we dene the concepts of compatibility between twofuzzy subsets on Q, the set of states of a max- min general fuzzy automatonand transitivity in a max-min general fuzzy automaton. We then construct auniform structure on Q, and dene a topology on it. We also dene the conceptof semi-uniform structures on a nonempty set X and construct a semi-uniformstructure on the set of states of ...

After introducing many different types of prefilter convergence, we introduce an universal method to define various notions of compactness using cluster point and convergence of a prefilter and to prove the Tychonoff theorem using characterizations of ultra(maximal) prefilters. : prefilter convergence, universal method, Tychonoff theorem, ultra prefilter, good extension