نتایج جستجو برای: discrete entropy

تعداد نتایج: 223106  

2009
B. ANDREIANOV K. H. KARLSEN

We consider a class of doubly nonlinear degenerate hyperbolicparabolic equations with homogeneous Dirichlet boundary conditions, for which we first establish the existence and uniqueness of entropy solutions. We then turn to the construction and analysis of discrete duality finite volume schemes (in the spirit of Domelevo and Omnès [41]) for these problems in two and three spatial dimensions. W...

2009
K. H. KARLSEN

We consider a class of doubly nonlinear degenerate hyperbolicparabolic equations with homogeneous Dirichlet boundary conditions, for which we first establish the existence and uniqueness of entropy solutions. We then turn to the construction and analysis of discrete duality finite volume schemes (in the spirit of Domelevo and Omnès [41]) for these problems in two and three spatial dimensions. W...

Journal: :CoRR 2014
Jonathon Shlens

The uncertainty in a set of discrete outcomes is the entropy. In some text books an explanation for this assertion is often another assertion: the entropy is the average minimum number of yes-no questions necessary to identify an item randomly drawn from a known, discrete probability distribution. It would be preferable to avoid these assertions and search for the heart of the matter where does...

Journal: :Information and Control 1980
Kazuhiko Ozeki

Based on the non-standard analysis by Robinson, a new definition of the entropy of general distributions is given as a straightforward extension of Shannon's discrete entropy. The newly defined entropy has natural properties such as positiveness and invariance under transformations unlike Shannon's continuous entropy. In the light of this new definition, the meaning of Shannon's continuous entr...

2013
Yifan Xing Jun Wu

This paper proposes a new quantum control method which controls the Shannon entropy of quantum systems. For both discrete and continuous entropies, controller design methods are proposed based on probability density function control, which can drive the quantum state to any target state. To drive the entropy to any target at any prespecified time, another discretization method is proposed for t...

2017
Jean Honorio

A basic property of the entropy of a discrete random variable x is that: 0 ≤ H(x) ≤ log |X | In fact, the entropy is maximal for the discrete uniform distribution. That is, (∀x ∈ X ) p(x) = 1/|X |, in which case H(x) = log |X |. Definition 3.2 (Conditional entropy). The conditional entropy of y given x is defined as: H(y|x) = ∑ v∈X px(v)H(y|x = v) = − ∑ v∈X px(v) ∑ y∈Y py|x(y|v) log py|x(y|v) =...

Journal: :European Journal of Operational Research 2002
Jean-Luc Marichal

We introduce a measure of entropy for any discrete Choquet capacity and we interpret it in the setting of aggregation by the Choquet integral.

Journal: :International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 2000
Jean-Luc Marichal Marc Roubens

The concept of entropy of a discrete fuzzy measure has been recently introduced in two different ways. A first definition was proposed by Marichal [10] in the aggregation framework, and a second one by Yager [25] in the framework of uncertain variables. We present a comparative study between these two proposals and point out their properties. We also propose a definition for the entropy of an o...

Journal: :IEEE Trans. Information Theory 1994
László Györfi Istvan Pali Edward C. van der Meulen

We show that a discrete infinite distribution with finite entropy cannot be estimated consistently in information divergence. As a corollary we get that there is no universal source code for an infinite source alphabet over the class of all discrete memoryless sources with finite entropy.

Journal: :IEEE Trans. Information Theory 2001
Po-Ning Chen Fady Alajaji

Csiszár’s forward -cutoff rate (given a fixed 0) for a discrete source is defined as the smallest number such that for every , there exists a sequence of fixed-length codes of rate with probability of error asymptotically vanishing as . For a discrete memoryless source (DMS), the forward -cutoff rate is shown by Csiszár [6] to be equal to the source Rényi entropy. An analogous concept of revers...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید