Search results for "Probabilistic"
showing 10 items of 380 documents
Uncertainty quantification on a spatial Markov-chain model for the progression of skin cancer
2019
AbstractA spatial Markov-chain model is formulated for the progression of skin cancer. The model is based on the division of the computational domain into nodal points, that can be in a binary state: either in ‘cancer state’ or in ‘non-cancer state’. The model assigns probabilities for the non-reversible transition from ‘non-cancer’ state to the ‘cancer state’ that depend on the states of the neighbouring nodes. The likelihood of transition further depends on the life burden intensity of the UV-rays that the skin is exposed to. The probabilistic nature of the process and the uncertainty in the input data is assessed by the use of Monte Carlo simulations. A good fit between experiments on mi…
Probabilistic Flood Hazard Mapping Using Bivariate Analysis Based on Copulas
2017
This study presents a methodology to extract probabilistic flood hazard maps in an area subject to flood risk, taking into account uncertainties in the definition of design hydrographs. Particularly, the authors present a new method to produce probabilistic inundation and flood hazard maps in which the hydrological input (i.e., synthetic flood design event) to a 2D hydraulic model has been obtained by using a bivariate statistical analysis (copulas) to generate flood peak discharges and volumes. This study also aims to quantify the contribution of boundary conditions’ uncertainty in order to evaluate the effect of this uncertainty source on probabilistic flood hazard mapping. Different comb…
Probabilistic Self-Localization and Mapping - An Asynchronous Multirate Approach
2008
[EN] In this paper, we present a set of robust and efficient algorithms with O(N) cost for the solution of the Simultaneous Localization And Mapping (SLAM) problem of a mobile robot. First, we introduce a novel object detection method, which is mainly based on multiple line fitting method for landmark detection with regular constrained angles. Second, a line-based pose estimation method is proposed, based on LeastSquares (LS). This method performs the matching of lines, providing the global pose estimation under assumption of known Data-Association. Finally, we extend the FastSLAM (FActored Solution To SLAM) algorithm for mobile robot self-localisation and mapping by considering the asynchr…
Image classification based on 2D feature motifs
2013
The classification of raw data often involves the problem of selecting the appropriate set of features to represent the input data. In general, various features can be extracted from the input dataset, but only some of them are actually relevant for the classification process. Since relevant features are often unknown in real-world problems, many candidate features are usually introduced. This degrades both the speed and the predictive accuracy of the classifier due to the presence of redundancy in the candidate feature set. In this paper, we study the capability of a special class of motifs previously introduced in the literature, i.e. 2D irredundant motifs, when they are exploited as feat…
Probabilities to Accept Languages by Quantum Finite Automata
1999
We construct a hierarchy of regular languages such that the current language in the hierarchy can be accepted by 1-way quantum finite automata with a probability smaller than the corresponding probability for the preceding language in the hierarchy. These probabilities converge to 1/2.
ON-LINE CONSTRUCTION OF A SMALL AUTOMATON FOR A FINITE SET OF WORDS
2012
In this paper we describe a "light" algorithm for the on-line construction of a small automaton recognising a finite set of words. The algorithm runs in linear time. We carried out good experimental results on real dictionaries, on biological sequences and on the sets of suffixes (resp. factors) of a set of words that shows how our automaton is near to the minimal one. For the suffixes of a text, we propose a modified construction that leads to an even smaller automaton. We moreover construct linear algorithms for the insertion and deletion of a word in a finite set, directly from the constructed automaton.
Project duration evaluated using affine arithmetic
2016
A civil engineering work can be performed by organizing the available resources (manpower, equipment and materials) in many different ways. Each different configuration results in a realization time and a cost that a building company has to bear. To produce reliable duration forecasts and money savings, it is essential to take into account all the uncertainties involved in the project operations. Generally, since it is impractical to process numerous uncertain variables - also undefined from a statistical point of view -, traditional probabilistic methods involve application difficulties for complex environments such as construction sites. To properly handle this issue, the authors propose …
Automata and forbidden words
1998
Abstract Let L ( M ) be the (factorial) language avoiding a given anti-factorial language M . We design an automaton accepting L ( M ) and built from the language M . The construction is effective if M is finite. If M is the set of minimal forbidden words of a single word ν, the automaton turns out to be the factor automaton of ν (the minimal automaton accepting the set of factors of ν). We also give an algorithm that builds the trie of M from the factor automaton of a single word. It yields a nontrivial upper bound on the number of minimal forbidden words of a word.
Development of a Taekwondo Combat Model Based on Markov Analysis
2019
The purpose of the present study was to examine male and female Olympic taekwondo competitors' movement patterns according to their tactical actions by applying a Markov processes analysis. To perform this study, 11,474 actions by male competitors and 12,980 actions by female competitors were compiled and analyzed. The results yielded 32 significant sequences among male competitors and 30 among female competitors. Male competitors demonstrated 11 sequences initiated by an attack, 11 initiated by a counterattack, and 10 initiated by a defensive action. Female competitors demonstrated nine sequences initiated by an attack, 11 initiated by a counterattack, and 10 initiated by a defensive move.…
Iterated Conditionals and Characterization of P-Entailment
2021
In this paper we deepen, in the setting of coherence, some results obtained in recent papers on the notion of p-entailment of Adams and its relationship with conjoined and iterated conditionals. We recall that conjoined and iterated conditionals are suitably defined in the framework of conditional random quantities. Given a family \(\mathcal {F}\) of n conditional events \(\{E_{1}|H_{1},\ldots , E_{n}|H_{n}\}\) we denote by \(\mathcal {C}(\mathcal {F})=(E_{1}|H_{1})\wedge \cdots \wedge (E_{n}|H_{n})\) the conjunction of the conditional events in \(\mathcal F\). We introduce the iterated conditional \(\mathcal {C}(\mathcal {F}_{2})|\mathcal {C}(\mathcal {F}_{1})\), where \(\mathcal {F}_{1}\)…