EuDML | Browse

Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Displaying 121 – 140 of 193

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

On the anti–synchronization detection for the generalized Lorenz system and its applications to secure encryption

Volodymyr Lynnyk, Sergej Čelikovský (2010)

Kybernetika

In this paper, a modified version of the Chaos Shift Keying (CSK) scheme for secure encryption and decryption of data will be discussed. The classical CSK method determines the correct value of binary signal through checking which initially unsynchronized system is getting synchronized. On the contrary, the new anti-synchronization CSK (ACSK) scheme determines the wrong value of binary signal through checking which already synchronized system is loosing synchronization. The ACSK scheme is implemented...

On the asymptotic rate of non-ergodic information sources

Karel Winkelbauer (1970)

Kybernetika

On the branching property of entropy

Inder Jeet Taneja (1977)

Annales Polonici Mathematici

On the capacity of asymptotically mean stationary channels

Štefan Šujan (1981)

Kybernetika

On the coding theorem for decomposable discrete information channels. II

Karel Winkelbauer (1971)

Kybernetika

On the coding theorem for decomposable discrete information channels. I

Karel Winkelbauer (1971)

Kybernetika

On the computation of covert channel capacity

Eugene Asarin, Cătălin Dima (2010)

RAIRO - Theoretical Informatics and Applications

We address the problem of computing the capacity of a covert channel, modeled as a nondeterministic transducer. We give three possible statements of the notion of “covert channel capacity” and relate the different definitions. We then provide several methods allowing the computation of lower and upper bounds for the capacity of a channel. We show that, in some cases, including the case of input-deterministic channels, the capacity of the channel can be computed exactly (e.g. in the form...