A Constant Space Representation of Digital Cubic Parabolas
A context-based approach to linguistic hedges
We present a framework of L-fuzzy modifiers for L being a complete lattice. They are used to model linguistic hedges that act on linguistic terms represented by L-fuzzy sets. In the modelling process the context is taken into account by means of L-fuzzy relations, endowing the L-fuzzy modifiers with a clear inherent semantics. To our knowledge, these L-fuzzy modifiers are the first ones proposed that are suitable to perform this representation task for a lattice L different from the unit interval....
A continuous family of automata : the Ising automata
A contribution to the top-to-bottom recognizer rehabilitation
A convenient category for directed homotopy.
A cost-sensitive learning algorithm for fuzzy rule-based classifiers.
Designing classifiers may follow different goals. Which goal to prefer among others depends on the given cost situation and the class distribution. For example, a classifier designed for best accuracy in terms of misclassifications may fail when the cost of misclassification of one class is much higher than that of the other. This paper presents a decision-theoretic extension to make fuzzy rule generation cost-sensitive. Furthermore, it will be shown how interpretability aspects and the costs of...
A course in spatial visualisation.
A criterion for non-automaticity of sequences.
A data model architecture for parametrics.
A data model for indexing and searching XML documents.
A database model for library material usage.
A decision method for the recognizability of sets defined by number systems
A decision support system for regional hazardous waste management alternatives.
A decomposition and noise removal method combining diffusion equation and wave atoms for textured images.
A deductive calculus for conditional equational systems with built-in predicates as premises.
A defuzzification based new algorithm for the design of Mamdani-type fuzzy controllers
This paper presents a new learning algorithm for the design of Mamdani- type or fully-linguistic fuzzy controllers based on available input-output data. It relies on the use of a previously introduced parametrized defuzzification strategy. The learning scheme is supported by an investigated property of the defuzzification method. In addition, the algorithm is tested by considering a typical non-linear function that has been adopted in a number of published research articles. The test stresses on...
A density version of the Carlson–Simpson theorem
We prove a density version of the Carlson–Simpson Theorem. Specifically we show the following. For every integer and every set of words over satisfying there exist a word over and a sequence of left variable words over such that the set is contained in . While the result is infinite-dimensional its proof is based on an appropriate finite and quantitative version, also obtained in the paper.
A deterministic subclass of context-free languages
A differential evolution approach to dimensionality reduction for classification needs
A direct decomposition of 3-connected planar graphs.