Special issue on uncertainty processing
This special issue of the Kybernetika Journal arose from the 9th workshop on uncertainty processing, WUPES’12, held in Mariánské Lázně, Czech Republic, in September 2012. In the selection process for this special issue, we tried to capture the rich variety of the presented methodological approaches. The quality of the selected papers was judged by reviewers in accord with the usual practice of Kybernetika. After a careful selection, 7 papers were included in the special issue. There are, however,...
The goal of this paper is to present all algorithm for pattern recognition, leveraging on an existing fuzzy clustering algorithm developed by Del Amo et al. [3, 5], and modifying it to its supervised version, in order to apply the algorithm to different pattern recognition applications in Remote Sensing. The main goal is to recognize the object and stop the search depending on the precision of the application. The referred algorithm was the core of a classification system based on Fuzzy Sets Theory...
Congestion control in the ABR class of ATM network presents interesting challenges due to the presence of multiple uncertain delays. Recently, probabilistic methods and statistical learning theory have been shown to provide approximate solutions to challenging control problems. In this paper, using some recent results by the authors, an efficient statistical algorithm is used to design a robust, fixed-structure, controller for a high-speed communication network with multiple uncertain propagation...
Most models for the time series of stock prices have centered on autoregresive (AR) processes. Traditionaly, fundamental Box-Jenkins analysis [3] have been the mainstream methodology used to develop time series models. Next, we briefly describe the develop a classical AR model for stock price forecasting. Then a fuzzy regression model is then introduced. Following this description, an artificial fuzzy neural network based on B-spline member ship function is presented as an alternative to the stock...
The paper presents a recursive algorithm for the investigation of a strict,linear separation in the Euclidean space. In the case when sets are linearly separable, it allows us to determine the coefficients of the hyperplanes. An example of using this algorithm as well as its drawbacks are shown. Then the algorithm of determining an optimal separation (in the sense of maximizing the distance between the two sets) is presented.
In [vB88], Johan van Benthem introduces Relational Semantics (RelSem for short), and states Soundness Theorem for Lambek Calculus (LC) w.r.t. RelSem. After doing this, he writes: "it would be very interesting to have the converse too", i.e., to have Completeness Theorem. The same question is in [vB91, p. 235]. In the following, we state Strong Completeness Theorems for different versions of LC.
À travers l'étude d'un modèle de représentation des connaissances comme catégorie de faisceaux de traits localement définis ; ce texte montre que la théorie des topoï permet de décrire formellement l'émergence d'une logique intrinsèque à partir d'une approche relationnelle, qu'elle soit structurale ou cognitive. On peut alors caractériser mathématiquement le défaut d'intensionnalité des modèles classiques, et montrer qu'une solution est dans la mathématisation de structures entièrement relationnelles....
Un système de règles grammaticales est présenté pour analyser un fragment du français permettant l'expression de théorèmes et de preuves mathématiques. Pour cet objectif, on développe une version de la grammaire de Montague, avec des catégories syntaxiques relatives au contexte et aux domaines d'individus. Ce système peut être interprété dans la théorie constructive des types de Martin-Löf. Il est appliqué, d'abord, au français sans symboles mathématiques, avec une attention spéciale aux restrictions...
Un système de règles grammaticales est présenté pour analyser un fragment du français permettant l'expression de théorémes et de preuves mathématiques. Pour cet objectif, on développe une version de la grammaire de Montague, avec des catégories syntaxiques relatives au contexte et aux domaines d'individus. Ce système peut être interprété dans la théorie constructive des types de Martin-Löf. Il est appliqué, d'abord, au français sans symboles mathématiques, avec une attention spéciale aux restrictions...