In the literature, several numerical methods are proposed for solvingnth-order fuzzy linear differential equations. However, till now there areonly two analytical methods for the same. In this paper, the fuzzy Kolmogorov'sdifferential equations, obtained with the help of fuzzy Markov modelof piston manufacturing system, are solved by one of these analytical methodsand illustrated that the obtai...

The π-derivative for fuzzy function is considered. Consequently, using this π-derivative we study fuzzy differentuial equations. In particular, we build a solution for a fuzzy differential equation with the help of a system of ordinary differential equations which is generates of the π-derivative. Keywords— π-derivative for set valued functions, derivative for fuzzy functions, fuzzy differentia...

Many data sets to be clustered are stored in relational databases. Having a clusterization algorithm implemented in SQL provides easier clusterization inside a relational DBMS than outside with some alternative tools. In this paper we propose Fuzzy c-Means clustering algorithm adapted for PostgreSQL open-source relational DBMS.

The fuzzy linear second order equations with fuzzy initial values are investigatedin this paper. The analytic general solution solutions of them usinga rst solution is founded. The parametric form of fuzzy numbers is appliedto solve the second order equations. General solutions for fuzzy linear secondorder equations with fuzzy initial values are investigated and formulatedin four cases. A examp...

The aim of this thesis is to develop the fuzzy relational calculus. To develop this calculus, we study four algebraic formalisations of fuzzy relations which are called fuzzy relation algebras, Zadeh categories, relation algebras and Dedekind categories, and we strive to arrive at their representation theorems. The calculus of relations has been investigated since the middle of the nineteenth c...

Fuzzy Databases have been a fertile research area that has produced a wide variety of remarkable solutions for the storage and manipulation of imperfect information. Proposals can be found in the three most relevant data models: relational, object-oriented, and object-relational. Query capabilities have been especially studied in the context of the relational data model, while in object models ...

Successes with kernel-based classification methods have spawned many recent efforts to kernelize clustering algorithms for object data. We extend this idea to the relational data case by proposing kernelized forms of the non-Euclidean relational fuzzy (NERF) and hard (NERH) c-means algorithms. We show that these relational forms are dual to kernelized forms of fuzzy and hard c-means (FCM, HCM) ...

in this paper, the finitely many constraints of a fuzzy relationinequalities problem are studied and the linear objective function on the regiondefined by a fuzzy max-average operator is optimized. a new simplificationtechnique which accelerates the resolution of the problem by removing thecomponents having no effect on the solution process is given together with analgorithm and a numerical exa...