Using neural network we try to model the unknown function f for given input-output data pairs. The connection strength of each neuron is updated through learning. Repeated simulations of crisp neural network produce different values of weight factors that are directly affected by the change of different parameters. We propose the idea that for each neuron in the network, we can obtain quasi-fuz...

A Real-Time Optimization (RTO) strategy incorporating the fuzzy sets theory is developed, where the problem constraints obtained from process considerations are treated in fuzzy environment. Furthermore, the objective function is penalized by a fuzzified form of the key process constraints. To enable using conventional optimization techniques, the resulting fuzzy optimization problem is the...

In this paper we describe an operation on directed graphs which produces a graph with fewer vertices, such that the C-algebra of the new graph is Morita equivalent to that of the original graph. We unify and generalize several related constructions, notably delays and desingularizations of directed graphs.

in this paper, a model of an optimal control problem with chance constraints is introduced. the parametersof the constraints are fuzzy, random or fuzzy random variables. todefuzzify the constraints, we consider possibility levels.  bychance-constrained programming the chance constraints are converted to crisp constraints which are neither fuzzy nor stochastic and then the resulting classical op...

Time modeling is a crucial feature in many application domains. However, temporal information often is not crisp, but is uncertain, subjective and vague. This is particularly true when representing historical information, as historical accounts are inherently imprecise. Similarly, we conjecture that in the Semantic Web representing uncertain temporal information will be a common requirement. He...

Rough set is a new approach to uncertainties in spatial analysis. In this paper, we complete three works under the umbrella of rough space. First, a set of simplified rough symbols is extended on the basis of existing rough symbols. It is in terms of rough interpretation and specialized indication. Second, rough spatial entity is proposed to study the real world as it is, without forcing uncert...

In recent years many Fuzzy Description Logics (FDLs) based on infinite t-norms have been proved to be undecidable. On the other hand, several FDLs based on finite t-norms, not only have been proved to be decidable, but they have been proved to belong to the same complexity classes as the corresponding crisp DLs. In light of such results, a question that naturally arises is whether the finite-va...

In previous studies we first concentrated on utilizing crisp simulationto produce discrete event fuzzy systems simulations. Then we extendedthis research to the simulation of continuous fuzzy systems models. In this paperwe continue our study of continuous fuzzy systems using crisp continuoussimulation. Consider a crisp continuous system whose evolution depends ondifferential equations. Such a ...

In Description Logic (DL) knowledge bases (KBs) information is typically captured by crisp concepts. For many applications, querying the KB by crisp query concepts is too restrictive. A controlled way of gradually relaxing a query concept can be achieved by the use of concept similarity measures. In this paper we formalize the task of instance query answering for crisp DL KBs using concepts rel...

In Description Logics (DL) knowledge bases (KBs) information is typically captured by crisp concept descriptions. However, for many practical applications querying the KB by crisp concepts is too restrictive. A controlled way of gradually relaxing a query concept can be achieved by the use of similarity measures. To this end we formalize the task of instance query answering for crisp DL KBs usi...