In this paper, a TSK-type recurrent fuzzy network (TRFN) structure is proposed. The proposal calls for a design of TRFN by either neural network or genetic algorithms depending on the learning environment. Set forth first is a recurrent fuzzy network which develops from a series of recurrent fuzzy if–then rules with TSK-type consequent parts. The recurrent property comes from feeding the intern...

In order to investigate the influence of sulfur coated seeds in SCS (a moisture absorbent polymer layer on seeds) on physiological traits of cotton, a field experiment was conducted in completely randomized design with factorial arrangement with 3 replications. Three planting date included early (E), optimum (O), and delayed (D) planting time. Seed coating priming treatments consisted of F (fuz...

Let X denote a locally compact metric space and φ : X → X be a continuous map. In the 1970s L. Zadeh presented an extension principle, helping us to fuzzify the dynamical system (X, φ), i.e., to obtain a map Φ for the space of fuzzy sets on X. We extend an idea mentioned in [P. Diamond, A. Pokrovskii, Chaos, entropy and a generalized extension principle, Fuzzy Sets and Systems 61 (1994)] and we...

We show that the 2-parameter Podles sphere is a q-fuzzy sphere precisely interpolating between the fuzzy sphere as quotient of the angular momentum algebra U(su2) and the standard q-sphere Cq [S] as subalgebra of the quantum group Cq [SU2]. Whereas the classical sphere as CP 1 can be defined as the algebra generated by the matrix entries of a projector e with trace(e) = 1, the fuzzy-sphere is d...

Granular representation of experimental data D is defined as a transformation A G(Y) where A are information granules in the space of input data D and G(Y) is a family of information granules in the output space. In this paper, we propose an alternative to the granular representation method based on the use of possibility and necessity measure and the solution of fuzzy relational equations. The...

Let G = (V,E) be the IFG and D be set of vertices, then D is said to be Intuitionistic point set dominating set of G if for every S⊆ VD there exists a node d ∈ D such that the Intuitionistic fuzzy sub graph < S∪{d} > induced by S∪{d} is a connected Intuitionistic fuzzy graph. In this paper we study some results on Intuitionistic Point set dominating set and its number of IFGs. Also we establish...

In this paper, we present equivalent characterizations of L-closure systems on lower bounded complete L-ordered sets and complete L-lattices, respectively. These results demonstrate the feasibility of notion of fuzzy closure system developed in our previous work (L.-K. Guo, G.-Q. Zhang, Q.-G. Li: Fuzzy closure systems on L-ordered sets. Math. Log. Quart. 57 (3) (2011), 281-291.). Also we develo...

Given a graph G with nonnegative node labels w, a multiset of stable sets S1, . . . , Sk ⊆ V (G) such that each vertex v ∈ V (G) is contained in w(v) many of these stable sets is called a weighted coloring. The weighted coloring number χw(G) is the smallest k such that there exist stable sets as above. We provide a polynomial time combinatorial algorithm that computes the weighted coloring numb...

Keywords--Fuzzy numbers, Convexity, Preinvexity, Generalized convexity, Fuzzy mappings. 1. I N T R O D U C T I O N Let R n deno te t he n -d imens iona l Euc l idean space. T h e suppor t , supp (p), of a fuzzy set # : R n ~ I = [0, 1] is def ined as s u p p ( # ) = { x e R n ] # ( x ) > 0} . A fuzzy set # : R n ~ I is cal led fuzzy convex if i t is quas i concave in c o m m o n sense on its su...

We show here some of our results on intuitionistic fuzzy topological spaces. In 1983, K.T. Atanassov proposed a generalization of the notion of fuzzy set: the concept of intuitionistic fuzzy set [1]. Some basic results on intuitionistic fuzzy sets were publised in [2,3], and the book [4] provides a comprehensive coverage of virtually all results until 1999 in the area of the theory and applicat...