Strategies for seeing.
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...
This paper presents a method for building a foothold selection module as well as methods for the stability check for a multi-legged walking robot. The foothold selection decision maker is shaped automatically, without expert knowledge. The robot learns how to select appropriate footholds by walking on rough terrain or by testing ground primitives. The gathered knowledge is then used to find a relation between slippages and the obtained local shape of the terrain, which is further employed to assess...
This paper addresses a sweep coverage problem of multi-robot networks with general topologies. To deal with environmental uncertainties, we present discrete time sweep coverage algorithms to guarantee the complete coverage of the given region by sweeping in parallel with workload partition. Moreover, the error between actual coverage time and the optimal time is estimated with the aid of continuous time results. Finally, numerical simulation is conducted to verify the theoretical results.
This work introduces how possibilistic regression can be used in the case of non symmetrical triangular membership functions, building a system of regressions, so that suitable restrictions for each particular problem can be incorporated. We apply this methodology to the problem of ecological inference, in particular to the estimation of the electoral transition matrix. An experimentation with several examples shows the benefits of the new approach.
Frameworks for interactive theorem proving give the user explicit control over the construction of proofs based on meta languages that contain dedicated control structures for describing proof construction. Such languages are not easy to master and thus contribute to the already long list of skills required by prospective users of interactive theorem provers. Most users, however, only need a convenient formalism that allows to introduce new rules with minimal overhead. On the the other hand, rules...
In traditional statistics all parameters of the mathematical model and possible observations should be well defined. Sometimes such assumption appears too rigid for the real-life problems, especially while dealing with linguistic data or imprecise requirements. To relax this rigidity fuzzy methods are incorporated into statistics. We review hitherto existing achievements in testing statistical hypotheses in fuzzy environment, point out their advantages or disadvantages and practical problems. We...
Finite mixture modelling of class-conditional distributions is a standard method in a statistical pattern recognition. This paper, using bag-of-words vector document representation, explores the use of the mixture of multinomial distributions as a model for class-conditional distribution for multiclass text document classification task. Experimental comparison of the proposed model and the standard Bernoulli and multinomial models as well as the model based on mixture of multivariate Bernoulli distributions...