Search results for " Probability"
showing 10 items of 2176 documents
Channel selection in Cognitive Radio Networks: A Switchable Bayesian Learning Automata approach
2013
We consider the problem of a user operating within a Cognitive Radio Network (CRN) which involves N channels each associated with a Primary User (PU). The problem consists of allocating a channel which, at any given time instant is not being used by a PU, to a Secondary User (SU). Within our study, we assume that a SU is allowed to perform “channel switching”, i.e., to choose an alternate channel S times (where S +1 ≤ N) if the previous choice does not lead to a channel which is vacant. The paper first presents a formal probabilistic model for the problem itself, referred to as the Formal Secondary Channel Selection (FSCS) problem, and the characteristics of the FSCS are then analyzed. Ther…
Social Practices based characters in a Robotic Storytelling System
2020
In this work, we present a robotic storytelling system, where the characters have been modelled as cognitive agents embodied in Pepper and NAO robots. The characters have been designed by exploiting the ACT-R architecture, taking into account knowledge, behaviours, norms, and expectations typical of social practices and desires resulting from their personality. The characters explain their reasoning processes during the narration, through a sort of internal dialogue that generate a high level of credibility experienced over the audience.
Explicit Upper Bound for Entropy Numbers
2004
We give an explicit upper bound for the entropy numbers of the embedding I : W r,p(Ql) → C(Ql) where Ql = (−l, l)m ⊂ Rm, r ∈ N, p ∈ (1,∞) and rp > m.
Bayesian hypothesis testing: A reference approach
2002
Summary For any probability model M={p(x|θ, ω), θeΘ, ωeΩ} assumed to describe the probabilistic behaviour of data xeX, it is argued that testing whether or not the available data are compatible with the hypothesis H0={θ=θ0} is best considered as a formal decision problem on whether to use (a0), or not to use (a0), the simpler probability model (or null model) M0={p(x|θ0, ω), ωeΩ}, where the loss difference L(a0, θ, ω) –L(a0, θ, ω) is proportional to the amount of information δ(θ0, ω), which would be lost if the simplified model M0 were used as a proxy for the assumed model M. For any prior distribution π(θ, ω), the appropriate normative solution is obtained by rejecting the null model M0 wh…
A space on which diameter-type packing measure is not Borel regular
1999
We construct a separable metric space on which 1-dimensional diameter-type packing measure is not Borel regular.
The simplex dispersion ordering and its application to the evaluation of human corneal endothelia
2009
A multivariate dispersion ordering based on random simplices is proposed in this paper. Given a R^d-valued random vector, we consider two random simplices determined by the convex hulls of two independent random samples of sizes d+1 of the vector. By means of the stochastic comparison of the Hausdorff distances between such simplices, a multivariate dispersion ordering is introduced. Main properties of the new ordering are studied. Relationships with other dispersion orderings are considered, placing emphasis on the univariate version. Some statistical tests for the new order are proposed. An application of such ordering to the clinical evaluation of human corneal endothelia is provided. Di…
Testing for selectivity in the dependence of random variables on external factors
2008
Random variables AA and BB, whose joint distribution depends on factors (x,y)(x,y), are selectively influenced by xx and yy, respectively, if AA and BB can be represented as functions of, respectively, (x,SA,C)(x,SA,C) and (y,SB,C)(y,SB,C), where SA,SB,CSA,SB,C are stochastically independent and do not depend on (x,y)(x,y). Selective influence implies selective dependence of marginal distributions on the respective factors: thus no parameter of AA may depend on yy. But parameters characterizing stochastic interdependence of AA and BB, such as their mixed moments, are generally functions of both xx and yy. We derive two simple necessary conditions for selective dependence of (A,B)(A,B) on (x…
The McKay conjecture and Galois automorphisms
2004
The main problem of representation theory of finite groups is to find proofs of several conjectures stating that certain global invariants of a finite group G can be computed locally. The simplest of these conjectures is the ?McKay conjecture? which asserts that the number of irreducible complex characters of G of degree not divisible by p is the same if computed in a p-Sylow normalizer of G. In this paper, we propose a much stronger version of this conjecture which deals with Galois automorphisms. In fact, the same idea can be applied to the celebrated Alperin and Dade conjectures.
Extensions of cocycles for hyperfinite actions and applications
1997
Given a countable, hyperfinite, ergodic and measure-preserving equivalence relationR on a standard probability space (X, ℬ, μ) and an elementW of the normalizerN (R) ofR, we investigate the problem of extendingR-cocycles to\(\bar R\), where\(\bar R\) is the relation generated byR andW. As an application, we obtain that for a Bernoulli automorphism the smallest family of natural factors in sense of [6] consists of all factors. Given an automorphism which is embeddable in a measurable flow and a compact, metric group, we show that for a typical cocycle we cannot lift the whole flow to the centralizer of the corresponding group extension.
Optimization problem in inductive inference
1995
Algorithms recognizing to which of n classes some total function belongs are constructed (n > 2). In this construction strategies determining to which of two classes the function belongs are used as subroutines. Upper and lower bounds for number of necessary strategies are obtained in several models: FIN- and EX-identification and EX-identification with limited number of mindchanges. It is proved that in EX-identification it is necessary to use n(n−1)/2 strategies. In FIN-identification [3n/2 − 2] strategies are necessary and sufficient, in EX-identification with one mindchange- n log2n+o(n log2n) strategies.