We consider fuzzy stochastic programming problems with a crisp objective function and linear constraints whose coefficients are fuzzy random variables, in particular of type L-R. To solve this type of problems, we formulate deterministic counterparts of chance-constrained programming with fuzzy stochastic coefficients, by combining constraints on probability of satisfying constraints, as well a...

the error of inertial navigation systems increase versus time, therefore for achieving higher accuracy specially in long time navigations we have to use an aiding system. global positioning system is the best aiding system in this case. in this paper we first simulate a gps and ins; then simulate tightly integration and finally review adaptation method of kalman filtering a fuzzy adaptive kalma...

Many of the new fuzzy structures with complete MV-algebras as value sets, such hesitant, intuitionistic, neutrosophic, or soft can be transformed into one type set values in special algebras, called AMV-algebras. The category AMV-algebras is isomorphic to pairs (R,R∗) commutative semirings and corresponding sets are (R,R∗)-fuzzy sets. We use this theory define relations, lower upper approximati...

In this note, we study an approximation property of regular fuzzy neural network(RFNN). It is shown that any fuzzy-valued measurable function can be approximated by the four-layer RFNN in the sense of fuzzy integral norm for the finite sub-additive fuzzy measure on R.

This paper considers a biobjective transportation problem with various fuzzy objective functions coefficients. Fuzzy coefficients can be of different types such as triangular, trapezoidal, (semi) $L-R$, or flat (semi) $L-R$ fuzzy numbers. First, we convert the problem to a parametric interval biobjective transportation problem using $gamma$-cuts of fuzzy coefficients. Then, we consider a fix $g...

ـــــ In [25], we introduce the notion of r-fuzzy neighborhood filters in smooth topological spaces in sense of Gähler [10], and used it to define and study separation axioms , = , , . Here we continue our study of the axioms of separation in smooth topological spaces. Therefore, we introduce the notion of r-fuzzy neighborhood filter at a set. Then by using this notion we define and study separ...

Chaudhari S. R. ,Komejwar D. D. , On Fuzzy Pushdown Automata and their covering , International Journal of Computer Applications Vol. 46(8),2012 pp 27-33 Comon H. ,Dauchet M. ,Gilleron R. ,Jacquemard F. , Lugiez D. ,Loding C. ,Tison S. , and Tommasi M. , Tree Automata: techniques and apllications. (2007) Lee E. T. Fuzzy tree automata and syntactic pattern recognition, IEEE Trans Pattern Anal Ma...

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

Wafer quolify munagemenf of0 river sysrem is addressed i n n fizzy andprobobilisric framework. Two ryper of uneerfoinry, namely randomness and vagueness. ore rreared simrrlfonmii.dy in the monogemmf problem. A.fuzzy-ser-bo.~ed dqfinifion rhaf is a more general case offhe existing crisp-set-based dqfmirion of low w l e r qualify is infroduced. The evenr of low wafer qu01it)i af r? check-poinr in...

Though the transitive closure of a reflexive and symmetric fuzzy relation R is unique and there are several algorithms to calculate it, there can be many transitive openings (maximal T -indistinguishability operators among the ones smaller than or equal to R). This paper presents a method to calculate transitive openings of a reflexive and symmetric fuzzy relation R. It is worth noticing that a...