The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying 161 –
180 of
376
An overview of generated triangular norms and their applications is presented. Several properties of generated -norms are investigated by means of the corresponding generators, including convergence properties. Some applications are given. An exhaustive list of relevant references is included.
In this paper, some generating methods for principal topology are introduced by means of some logical operators such as uninorms and triangular norms and their properties are investigated. Defining a pre-order obtained from the closure operator, the properties of the pre-order are studied.
In this paper we study two ways of generating multi-dimensional aggregation functions. First of all we obtain multi-dimensional OWA operators in two different ways, one of them through quantifiers and the other through sequences. In the first case, we see that all the operators we obtain are multi-dimensional aggregation functions. We then characterize the multi-dimensional aggregation functions that are generated by quantifiers. In the second case, we characterize the sequences that provide multi-dimensional...
In this study, we consider the Takagi-Sugeno (T-S) fuzzy model to examine the global asymptotic stability of Clifford-valued neural networks with time-varying delays and impulses. In order to achieve the global asymptotic stability criteria, we design a general network model that includes quaternion-, complex-, and real-valued networks as special cases. First, we decompose the -dimensional Clifford-valued neural network into -dimensional real-valued counterparts in order to solve the noncommutativity...
The basic tool considered in this paper is the so-called graded set, defined on the analogy of the family of α-cuts of a fuzzy set. It is also considered the corresponding extensions of the concepts of a point and of a real number (again on the analogy of the fuzzy case). These new graded concepts avoid the disadvantages pointed out by Gerla (for the fuzzy points) and by Kaleva and Seikkala (for the convergence of sequences of fuzzy numbers).
The basic concepts of the theory of intuitionistic fuzzy topological spaces have been defined by D. Çoker and co-workers. In this paper, we define new notions of Hausdorffness in the intuitionistic fuzzy sense, and obtain some new properties, in particular on convergence.
Recently, the utilization of invariant aggregation operators, i.e., aggregation operators not depending on a given scale of measurement was found as a very current theme. One type of invariantness of aggregation operators is the homogeneity what means that an aggregation operator is invariant with respect to multiplication by a constant. We present here a complete characterization of homogeneous aggregation operators. We discuss a relationship between homogeneity, kernel property and shift-invariance...
Since the common approach to defining membership functions of fuzzy numbers is rather subjective, another, more objective method is proposed. It is applicable in situations where two models, say and , share the same uncertain input parameter . Model is used to assess the fuzziness of , whereas the goal is to assess the fuzziness of the -dependent output of model . Simple examples are presented to illustrate the proposed approach.
In this paper, we define the set of incomparable elements with respect to the triangular order for any t-norm on a bounded lattice. By means of the triangular order, an equivalence relation on the class of t-norms on a bounded lattice is defined and this equivalence is deeply investigated. Finally, we discuss some properties of this equivalence.
The information boundedness principle requires that the knowledge obtained as a result of an inference process should not have more information than that contained in the consequent of the rule. From this point of view relevancy transformation operators as a generalization of implications are investigated.
This paper deals with the concept of the “size“ or “extent“ of the information in the sense of measuring the improvement of our knowledge after obtaining a message. Standard approaches are based on the probabilistic parameters of the considered information source. Here we deal with situations when the unknown probabilities are subjectively or vaguely estimated. For the considered fuzzy quantities valued probabilities we introduce and discuss information theoretical concepts.
The structures of the fuzzy information theory are focused on the concept of fuzzy entropy, where the individual information of symbols is considered only implicitely. This paper aims to fill this gap and to study the concepts of fuzzy information. Special attention is paid to the typical fuzzy set theoretical paradigma of monotonicity of operations.
We start by analyzing the role of imprecision in information retrieval in the Web, some theoretical contributions for managing this problem and its presence in search engines, with special emphasis on the use of thesaurus in order to increase the relevance of the documents retrieved. We then present FDSA, a Spanish electronic dictionary of synonyms that compute degrees of synonymy, and an eflicient implementation of it by using deterministic acyclic finite-state automata. We conclude by conjecturing...
Currently displaying 161 –
180 of
376