Displaying similar documents to “Semantic information within the BEATCA framework”

Entropy solution for anisotropic reaction-diffusion-advection systems with L data.

Mostafa Bendahmane, Mazen Saad (2005)

Revista Matemática Complutense

Similarity:

In this paper, we study the question of existence and uniqueness of entropy solutions for a system of nonlinear partial differential equations with general anisotropic diffusivity and transport effects, supplemented with no-flux boundary conditions, modeling the spread of an epidemic disease through a heterogeneous habitat.

Convexity inequalities for estimating generalized conditional entropies from below

Alexey E. Rastegin (2012)

Kybernetika

Similarity:

Generalized entropic functionals are in an active area of research. Hence lower and upper bounds on these functionals are of interest. Lower bounds for estimating Rényi conditional α -entropy and two kinds of non-extensive conditional α -entropy are obtained. These bounds are expressed in terms of error probability of the standard decision and extend the inequalities known for the regular conditional entropy. The presented inequalities are mainly based on the convexity of some functions....

Entropy-like functionals: conceptual background and some results

Miroslav Katětov (1992)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

We describe a conceptual approach which provides a unified view of various entropy-like functionals on the class of semimetric spaces, endowed with a bounded measure. The entropy E considered in the author’s previous articles is modified so as to assume finite values for a fairly wide class of spaces which fail to be totally bounded.

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

Igor Vajda, Arnost Vesely, Jana Zvarova (2005)

Revista Matemática Complutense

Similarity:

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...