Search results for "Probabilistic"
showing 10 items of 380 documents
Deterministic versus probabilistic consequences of trust and trustworthiness: An experimental investigation
2014
Abstract There is overwhelming evidence of reciprocal behavior, driven by intentions. However, the role of consequences is less clear cut. Experimentally manipulating how efficient trust and reciprocity can be in deterministic and uncertain environments allows us to study how payoff consequences of trust and trustworthiness affect reciprocity. According to the results for our modified Investment Game, trustees reward trust more when trust is more efficient but do not adjust rewards when the efficiency of rewarding is varied. Furthermore, higher deterministic benefits result in higher levels of reciprocity for all trust levels, whereas an uncertain environment diminishes reciprocity.
Probabilistic semantics for categorical syllogisms of Figure II
2018
A coherence-based probability semantics for categorical syllogisms of Figure I, which have transitive structures, has been proposed recently (Gilio, Pfeifer, & Sanfilippo [15]). We extend this work by studying Figure II under coherence. Camestres is an example of a Figure II syllogism: from Every P is M and No S is M infer No S is P. We interpret these sentences by suitable conditional probability assessments. Since the probabilistic inference of \(\bar{P}|S\) from the premise set \(\{M|P,\bar{M}|S\}\) is not informative, we add \(p(S|(S \vee P))>0\) as a probabilistic constraint (i.e., an “existential import assumption”) to obtain probabilistic informativeness. We show how to propagate the…
Probabilistic stability analysis of social obesity epidemic by a delayed stochastic model
2014
Abstract Sufficient conditions for stability in probability of the equilibrium point of a social obesity epidemic model with distributed delay and stochastic perturbations are obtained. The obesity epidemic model is demonstrated on the example of the Region of Valencia, Spain. The considered nonlinear system is linearized in the neighborhood of the positive point of equilibrium and a sufficient condition for asymptotic mean square stability of the zero solution of the constructed linear system is obtained.
Minimal forbidden words and factor automata
1998
International audience; Let L(M) be the (factorial) language avoiding a given antifactorial language M. We design an automaton accepting L(M) and built from the language M. The construction is eff ective if M is finite. If M is the set of minimal forbidden words of a single word v, the automaton turns out to be the factor automaton of v (the minimal automaton accepting the set of factors of v). We also give an algorithm that builds the trie of M from the factor automaton of a single word. It yields a non-trivial upper bound on the number of minimal forbidden words of a word.
Dynamic Shakedown Sensitivity Analysis by Means of a Probabilistic Approach
2017
The shakedown limit load multiplier problem for elastic plastic structures subjected to a combination of fixed and seismic loads is treated. In particular, reference is firstly made to the unrestricted dynamic shakedown theory. The relevant seismic load history is modeled as a repeated one and, with reference to classically damped structures, appropriate modal analyses are utilized. With the aim of evaluating the reliability of the results arising from the application of the cited theory, a recent probabilistic approach is also utilized. This approach adopts the Monte Carlo method in order to define the necessary seismic acceleration histories and finally compute the related shakedown limit…
Quantum Finite One-Counter Automata
1999
In this paper the notion of quantum finite one-counter automata (QF1CA) is introduced. Introduction of the notion is similar to that of the 2-way quantum finite state automata in [1]. The well-formedness conditions for the automata are specified ensuring unitarity of evolution. A special kind of QF1CA, called simple, that satisfies the well-formedness conditions is introduced. That allows specify rules for constructing such automata more naturally and simpler than in general case. Possible models of language recognition by QF1CA are considered. The recognition of some languages by QF1CA is shown and compared with recognition by probabilistic counterparts.
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…
Probabilistic analysis of non-local random media
2008
Computational stochastic methods have been devoted over the last years to analysis and quantification of the mechanical response of engineering systems involving random media. Specifically analysis of random, heterogeneous media is getting more and more important with the emergence of new complex materials requiring reliable methods to provide accurate probabilistic response. Advanced materials, often used at nano or meso-levels possess strong non-local characters showing that long-range forces between non-adjacent volume elements play an important role in mechanical response. Moreover long and short-range molecular interactions may have random nature due to unpredictable fabrication proces…
On the fractional probabilistic Taylor's and mean value theorems
2016
In order to develop certain fractional probabilistic analogues of Taylor's theorem and mean value theorem, we introduce the nth-order fractional equilibrium distribution in terms of the Weyl fractional integral and investigate its main properties. Specifically, we show a characterization result by which the nth-order fractional equilibrium distribution is identical to the starting distribution if and only if it is exponential. The nth-order fractional equilibrium density is then used to prove a fractional probabilistic Taylor's theorem based on derivatives of Riemann-Liouville type. A fractional analogue of the probabilistic mean value theorem is thus developed for pairs of nonnegative rand…
Epistemic uncertainty in fault tree analysis approached by the evidence theory
2012
Abstract Process plants may be subjected to dangerous events. Different methodologies are nowadays employed to identify failure events, that can lead to severe accidents, and to assess the relative probability of occurrence. As for rare events reliability data are generally poor, leading to a partial or incomplete knowledge of the process, the classical probabilistic approach can not be successfully used. Such an uncertainty, called epistemic uncertainty, can be treated by means of different methodologies, alternative to the probabilistic one. In this work, the Evidence Theory or Dempster–Shafer theory (DST) is proposed to deal with this kind of uncertainty. In particular, the classical Fau…