We study the enclosing problem for discrete and continuous dynamical systems in the context of computer assisted proofs. We review and compare the existing methods and emphasize the importance of developing a suitable set arithmetic for efficient algorithms solving the enclosing problem.
When proposing and processing uncertainty decision-making algorithms of various kinds and purposes, we more and more often meet probability distributions ascribing non-numerical uncertainty degrees to random events. The reason is that we have to process systems of uncertainties for which the classical conditions like -additivity or linear ordering of values are too restrictive to define sufficiently closely the nature of uncertainty we would like to specify and process. In cases of non-numerical...
Many handwritten signature verification algorithms have been developed in order to distinguish between genuine signatures and forgeries. An important group of these methods is based on dynamic time warping (DTW). Traditional use of DTW for signature verification consists in forming a misalignment score between the verified signature and a set of template signatures. The right selection of template signatures has a big impact on that verification. In this article, we describe our proposition for...
Fuzzy set theory is based on a `fuzzification' of the predicate in (element of), the concept of membership degrees is considered as fundamental. In this paper we elucidate the connection between indistinguishability modelled by fuzzy equivalence relations and fuzzy sets. We show that the indistinguishability inherent to fuzzy sets can be computed and that this indistinguishability cannot be overcome in approximate reasoning. For our investigations we generalize from the unit interval as the basis...
This article provides an introduction to Simultaneous Localization And Mapping (SLAM), with the focus on probabilistic SLAM utilizing a feature-based description of the environment. A probabilistic formulation of the SLAM problem is introduced, and a solution based on the Extended Kalman Filter (EKF-SLAM) is shown. Important issues of convergence, consistency, observability, data association and scaling in EKF-SLAM are discussed from both theoretical and practical points of view. Major extensions...
The aim of this paper is to study the threshold behavior for the satisfiability property of a random -XOR-CNF formula or equivalently for the consistency of a random Boolean linear system with variables per equation. For we show the existence of a sharp threshold for the satisfiability of a random -XOR-CNF formula, whereas there are smooth thresholds for and .
Parametric software cost estimation models are well-known and widely used estimation tools, and several fuzzy extensions have been proposed to introduce a explicit handling of imprecision and uncertainty as part of them. Nonetheless, such extensions do not consider two basic facts that affect the inputs of software cost parametric models: cost drivers are often expressed through vague linguistic categories, and in many cases cost drivers are better expressed in terms of aggregations of second-level...
We propose a heuristic for solving the maximum independent set problem for a set of processors in a network with arbitrary topology. We assume an asynchronous model of computation and we use modified Hopfield neural networks to find high quality solutions. We analyze the algorithm in terms of the number of rounds necessary to find admissible solutions both in the worst case (theoretical analysis) and in the average case (experimental Analysis). We show that our heuristic is better than the...