Search results for "probabilistic"
showing 10 items of 380 documents
Quantum counter automata
2011
The question of whether quantum real-time one-counter automata (rtQ1CAs) can outperform their probabilistic counterparts has been open for more than a decade. We provide an affirmative answer to this question, by demonstrating a non-context-free language that can be recognized with perfect soundness by a rtQ1CA. This is the first demonstration of the superiority of a quantum model to the corresponding classical one in the real-time case with an error bound less than 1. We also introduce a generalization of the rtQ1CA, the quantum one-way one-counter automaton (1Q1CA), and show that they too are superior to the corresponding family of probabilistic machines. For this purpose, we provide gene…
Gesture Recognition for Improved User Experience in a Smart Environment
2013
Ambient Intelligence (AmI) is a new paradigm that specifically aims at exploiting sensory and context information in order to adapt the environment to the user's preferences; one of its key features is the attempt to consider common devices as an integral part of the system in order to support users in carrying out their everyday life activities without affecting their normal behavior. Our proposal consists in the definition of a gesture recognition module allowing users to interact as naturally as possible with the actuators available in a smart office, by controlling their operation mode and by querying them about their current state. To this end, readings obtained from a state-of-the-art…
Special factors and the combinatorics of suffix and factor automata
2011
AbstractThe suffix automaton (resp. factor automaton) of a finite word w is the minimal deterministic automaton recognizing the set of suffixes (resp. factors) of w. We study the relationships between the structure of the suffix and factor automata and classical combinatorial parameters related to the special factors of w. We derive formulae for the number of states of these automata. We also characterize the languages LSA and LFA of words having respectively suffix automaton and factor automaton with the minimal possible number of states.
Transitivity in coherence-based probability logic
2016
We study probabilistically informative (weak) versions of transitivity by using suitable definitions of defaults and negated defaults in the setting of coherence and imprecise probabilities. We represent p-consistent sequences of defaults and/or negated defaults by g-coherent imprecise probability assessments on the respective sequences of conditional events. Moreover, we prove the coherent probability propagation rules for Weak Transitivity and the validity of selected inference patterns by proving p-entailment of the associated knowledge bases. Finally, we apply our results to study selected probabilistic versions of classical categorical syllogisms and construct a new version of the squa…
Square of Opposition Under Coherence
2016
Various semantics for studying the square of opposition have been proposed recently. So far, only (Gilio et al., 2016) studied a probabilistic version of the square where the sentences were interpreted by (negated) defaults. We extend this work by interpreting sentences by imprecise (set-valued) probability assessments on a sequence of conditional events. We introduce the acceptability of a sentence within coherence-based probability theory. We analyze the relations of the square in terms of acceptability and show how to construct probabilistic versions of the square of opposition by forming suitable tripartitions. Finally, as an application, we present a new square involving generalized qu…
Unary Probabilistic and Quantum Automata on Promise Problems
2015
We continue the systematic investigation of probabilistic and quantum finite automata (PFAs and QFAs) on promise problems by focusing on unary languages. We show that bounded-error QFAs are more powerful than PFAs. But, in contrary to the binary problems, the computational powers of Las-Vegas QFAs and bounded-error PFAs are equivalent to deterministic finite automata (DFAs). Lastly, we present a new family of unary promise problems with two parameters such that when fixing one parameter QFAs can be exponentially more succinct than PFAs and when fixing the other parameter PFAs can be exponentially more succinct than DFAs.
Probabilistic analysis of truss structures with uncertain parameters (virtual distortion method approach)
2004
A new approach for probabilistic characterization of linear elastic redundant trusses with uncertainty on the various members subjected to deterministic loads acting on the nodes of the structure is presented. The method is based on the simple observation that variations of structural parameters are equivalent to superimposed strains on a reference structure depending on the axial forces on the elastic modulus of the original structure as well as on the uncertainty (virtual distortion method approach). Superposition principle may be applied to separate contribution to mechanical response due to external loads and parameter variations. Statically determinate trusses dealt with the proposed m…
Ranking coherence in topic models using statistically validated networks
2023
Probabilistic topic models have become one of the most widespread machine learning techniques in textual analysis. Topic discovering is an unsupervised process that does not guarantee the interpretability of its output. Hence, the automatic evaluation of topic coherence has attracted the interest of many researchers over the last decade, and it is an open research area. This article offers a new quality evaluation method based on statistically validated networks (SVNs). The proposed probabilistic approach consists of representing each topic as a weighted network of its most probable words. The presence of a link between each pair of words is assessed by statistically validating their co-oc…
Spatio-temporal modelling of COVID-19 incident cases using Richards’ curve: An application to the Italian regions
2021
Abstract We introduce an extended generalised logistic growth model for discrete outcomes, in which spatial and temporal dependence are dealt with the specification of a network structure within an Auto-Regressive approach. A major challenge concerns the specification of the network structure, crucial to consistently estimate the canonical parameters of the generalised logistic curve, e.g. peak time and height. We compared a network based on geographic proximity and one built on historical data of transport exchanges between regions. Parameters are estimated under the Bayesian framework, using Stan probabilistic programming language. The proposed approach is motivated by the analysis of bot…
Weighted weak semivalues
2000
We introduce two new value solutions: weak semivalues and weighted weak semivalues. They are subfamilies of probabilistic values, and they appear by adding the axioms of balanced contributions and weighted balanced contributions respectively. We show that the effect of the introduction of these axioms is the appearance of consistency in the beliefs of players about the game.