Displaying 101 – 120 of 192

Showing per page

On solution sets of information inequalities

Nihat Ay, Walter Wenzel (2012)

Kybernetika

We investigate solution sets of a special kind of linear inequality systems. In particular, we derive characterizations of these sets in terms of minimal solution sets. The studied inequalities emerge as information inequalities in the context of Bayesian networks. This allows to deduce structural properties of Bayesian networks, which is important within causal inference.

On some functional equations from additive and nonadditive measures (III).

Palaniappan Kannappan (1980)

Stochastica

In this series, this paper is devoted to the study of two related functional equations primarily connected with weighted entropy and weighted entropy of degree beta (which are weighted additive and weighted beta additive respectively) which include as special cases Shannon's entropy, inaccuracy (additive measures) and the entropy of degree beta (nonadditive) respectively. These functional equations which arise mainly from the representation and these 'additive' properties are solved for fixed m...

On spectral bandwidth of a stationary random process

Vladimír Klega (1983)

Aplikace matematiky

The irregularity coefficient is one of the numerical characteristics of the spectral bandwith of a stationary random process. Its basic properties are investigated and the application to the dichotomic classification of a process into narrow-band and wide-band ones is given. Further, its behaviour is analyzed for sufficiently wide classes of stationary processes whose spectral densities frequently appear both in theory and applications.

On the amount of information resulting from empirical and theoretical knowledge.

Igor Vajda, Arnost Vesely, Jana Zvarova (2005)

Revista Matemática Complutense

We present a mathematical model allowing formally define the concepts of empirical and theoretical knowledge. The model consists of a finite set P of predicates and a probability space (Ω, S, P) over a finite set Ω called ontology which consists of objects ω for which the predicates π ∈ P are either valid (π(ω) = 1) or not valid (π(ω) = 0). Since this is a first step in this area, our approach is as simple as possible, but still nontrivial, as it is demonstrated by examples. More realistic approach...

Currently displaying 101 – 120 of 192