Search results for " artificial intelligence"
showing 10 items of 1992 documents
On the suffix automaton with mismatches
2007
International audience; In this paper we focus on the construction of the minimal deterministic finite automaton S_k that recognizes the set of suffixes of a word w up to k errors. We present an algorithm that makes use of S_k in order to accept in an efficient way the language of all suffixes of w up to k errors in every window of size r, where r is the value of the repetition index of w. Moreover, we give some experimental results on some well-known words, like prefixes of Fibonacci and Thue-Morse words, and we make a conjecture on the size of the suffix automaton with mismatches.
Towards Automatic Testing of Reference Point Based Interactive Methods
2016
In order to understand strengths and weaknesses of optimization algorithms, it is important to have access to different types of test problems, well defined performance indicators and analysis tools. Such tools are widely available for testing evolutionary multiobjective optimization algorithms. To our knowledge, there do not exist tools for analyzing the performance of interactive multiobjective optimization methods based on the reference point approach to communicating preference information. The main barrier to such tools is the involvement of human decision makers into interactive solution processes, which makes the performance of interactive methods dependent on the performance of huma…
An Artificial Decision Maker for Comparing Reference Point Based Interactive Evolutionary Multiobjective Optimization Methods
2021
Comparing interactive evolutionary multiobjective optimization methods is controversial. The main difficulties come from features inherent to interactive solution processes involving real decision makers. The human can be replaced by an artificial decision maker (ADM) to evaluate methods quantitatively. We propose a new ADM to compare reference point based interactive evolutionary methods, where reference points are generated in different ways for the different phases of the solution process. In the learning phase, the ADM explores different parts of the objective space to gain insight about the problem and to identify a region of interest, which is studied more closely in the decision phas…
A trie-based approach for compacting automata
2004
International audience; We describe a new technique for reducing the number of nodes and symbols in automata based on tries. The technique stems from some results on anti-dictionaries for data compression and does not need to retain the input string, differently from other methods based on compact automata. The net effect is that of obtaining a lighter automaton than the directed acyclic word graph (DAWG) of Blumer et al., as it uses less nodes, still with arcs labeled by single characters.
Less Data Same Information for Event-Based Sensors: A Bioinspired Filtering and Data Reduction Algorithm
2018
Sensors provide data which need to be processed after acquisition to remove noise and extract relevant information. When the sensor is a network node and acquired data are to be transmitted to other nodes (e.g., through Ethernet), the amount of generated data from multiple nodes can overload the communication channel. The reduction of generated data implies the possibility of lower hardware requirements and less power consumption for the hardware devices. This work proposes a filtering algorithm (LDSI&mdash
Comparison between two different cardiovascular models during a hemorrhagic shock scenario
2020
Hemorrhagic shock is a form of hypovolemic shock determined by rapid and large loss of intravascular blood volume and represents the first cause of death in the world, whether on the battlefield or in civilian traumatology. For this, the ability to prevent hemorrhagic shock remains one of the greatest challenges in the medical and engineering fields. The use of mathematical models of the cardiocirculatory system has improved the capacity, on one hand, to predict the risk of hemorrhagic shock and, on the other, to determine efficient treatment strategies. In this paper, a comparison between two mathematical models that simulate several hemorrhagic scenarios is presented. The models considere…
Convergence Analysis of Distributed Set-Valued Information Systems
2016
This paper focuses on the convergence of information in distributed systems of agents communicating over a network. The information on which the convergence is sought is not rep- resented by real numbers, as often in the literature, rather by sets. The dynamics of the evolution of information across the net- work is accordingly described by set-valued iterative maps. While the study of convergence of set-valued iterative maps is highly complex in general, this paper focuses on Boolean maps, which are comprised of arbitrary combinations of unions, intersections, and complements of sets. For these important class of systems, we provide tools to study both global and local convergence. A distr…
Geometry control of the junction between two fractal curves
2012
International audience; The general objective of our work is to create a geometric modeller based on iterative processes. With this objective in mind, we have to provide tools that work with fractal objects in the same manner as with objects of classical topology. In this article we focus on the constructing of an intermediate curve between two other curves defined by different iterative construction processes. A similar problem often arises with subdivision surfaces, when the goal is to connect two surfaces with different subdivision masks. We start by dealing with curves, willing to later generalise our approach to surfaces. We formalise the problem with the Boundary Controlled Iterated F…
Image difference detection under varying illumination based on vector space and correlations
2012
Abstract We propose two methods to detect differences in images independently of local changes of intensity. The methods are based on calculating geometrical operators when images are considered as vectors. Operators can be expressed in terms of correlations for the possibility of optical implementations. The methods are invariant to changes of the form af ( x , y ) + b , where a and b are arbitrary unknown parameters that may vary over the image f ( x , y ). Computer simulations show that the method works well when the illumination model is satisfied. Results from real images taken with a web camera show the robustness of the method.
Learning-based multiresolution transforms with application to image compression
2013
In Harten's framework, multiresolution transforms are defined by predicting finer resolution levels of information from coarser ones using an operator, called prediction operator, and defining details (or wavelet coefficients) that are the difference between the exact and predicted values. In this paper we use tools of statistical learning in order to design a more accurate prediction operator in this framework based on a training sample, resulting in multiresolution decompositions with enhanced sparsity. In the case of images, we incorporate edge detection techniques in the design of the prediction operator in order to avoid Gibbs phenomenon. Numerical tests are presented showing that the …