Fuzzy množiny - perspektivy, problémy a aplikace
Fuzzy regions: interpretations of surface area and distance
Fuzzy relation equation under a class of triangular norms: A survey and new results.
By substituting the classical lattice operator min of the unit real interval with a triangular norm of Schweizer and Sklar, the usual fuzzy relational equations theory of Sanchez can be generalized to wider theory of fuzzy equations. Considering a remarkable class of triangular norms, for such type of equations defined on finite sets, we characterize the upper an lower solutions.We also characterize the solutions posessing a minimal fuzziness measure of Yager valued with respect to a triangular...
Fuzzy relation equations under LSC and USC t-norms and their Boolean solutions.
This paper follows a companion paper (Stochastica 8 (1984), 99-145) in which we gave the state of the art of the theory of fuzzy relation equations under a special class of triangular norms. Here we continue this theory establishing new results under lower and upper semicontinuous triangular norms and surveying on the main theoretical results appeared in foregoing papers. Max-t fuzzy equations with Boolean solutions are recalled and studied. Many examples clarify the results established.
Fuzzy sets and fusion of multisensor data
Fuzzy sets as set classes.
Fuzzy sets have been studied in various forms. We now offer a presentation of fuzzy sets whereby they are conceived as representatives of a whole class of sets (that are themselves subsets of the universe of objects on which the fuzzy set is defined).
Fuzzy sets in pattern recognition, image analysis and automatic speech recognition
Fuzzy set theory, a recent generalization of classical set theory, has attracted the attention of researchers working in various areas including pattern recognition, which has had a seminal influence in the development of this new theory. This paper attempts to discuss some of the methodologies that have been suggested for pattern recognition, and techniques for image processing and speech recognition.
Fuzzy topologies
Fuzzy transforms in image compression and fusion
An overview of direct and inverse fuzzy transforms of three types is given and applications to data processing are considered. The construction and some important properties of fuzzy transforms are presented on the theoretical level. Three applications of -transform to data processing have been chosen: compressional and reconstruction of data, removing noise and data fusion. All of them successively exploit the filtering property of the inverse fuzzy transform.
Fuzzy zero, algebraic equivalence: yes or no?
Gabor Frames, Unimodularity, and Window Decay.
Gabor Time-Frequency Lattices and the Wexler-Raz Identity.
Galois correspondences for closed classes of functions with delay. I.
Galois rings and algebraic cryptography
Gate circuits in the algebra of transients
We study simulation of gate circuits in the infinite algebra of transients recently introduced by Brzozowski and Ésik. A transient is a word consisting of alternating s and s; it represents a changing signal. In the algebra of transients, gates process transients instead of s and s. Simulation in this algebra is capable of counting signal changes and detecting hazards. We study two simulation algorithms: a general one that works with any initial state, and a special one that applies only if...
Gate circuits in the algebra of transients
We study simulation of gate circuits in the infinite algebra of transients recently introduced by Brzozowski and Ésik. A transient is a word consisting of alternating 0s and 1s; it represents a changing signal. In the algebra of transients, gates process transients instead of 0s and 1s. Simulation in this algebra is capable of counting signal changes and detecting hazards. We study two simulation algorithms: a general one that works with any initial state, and a special one that applies only if...
Gaussian maximum of entropy and reversed log-Sobolev inequality
Generador de seqüències de test per circuits integrats NMOS.
El generador de secuencias de ensayo que se presenta en este artículo utiliza una descripción del circuito a nivel de transistor que representa las redes de transistores de enriquecimiento de las funciones lógicas NMOS mediante grafos no orientados. Para la generación de vectores de ensayo se emplea el algoritmo D, habiendo desarrollado un método enumerativo de búsqueda de caminos en la parte superior del grafo, a partir del camino mínimo que pasa por el flanco que representa el transistor afectado...
General bounds for identifying codes in some infinite regular graphs.
Generalised directed divergence without symmetry