The performance of opt imum vector quantizers subject to a conditional entropy constraint is studied in this paper. This new class of vector quantizers was originally suggested by Chou and Lookabaugh. A locally optimal design of this kind of vector quantizer can be accompl ished through a general ization of the well-known entropy-constrained vector quantizer (ECVQ) algorithm. This general izati...

The conditional independences within a system of four discrete random variables are studied simultaneously. The problem where independences can occur at the same time, called the problem of probabilistic representability, is attacked by an analysis of cones of polymatroids. New results on the cone of all polymatroids satisfying Ingleton inequalities imply a substantial reduction of the problem ...

Let X → Y → Z be a discrete memoryless degraded broadcast channel (DBC) with marginal transition probability matrices TY X and TZX . Denote q as the distribution of the channel input X . For any given q, and H(Y |X) ≤ s ≤ H(Y ), where H(Y |X) is the conditional entropy of Y given X and H(Y ) is the entropy of Y , define the function F ∗ TY X ,TZX (q, s) as the infimum of H(Z|U), the conditional...

Automatic music structure analysis or song segmentation has immediate applications in the field of music information retrieval. Among these applications is active music navigation, automatic generation of audio summaries, automatic music analysis, etc. One of the important aspects of a song segmentation task is its evaluation. Commonly, that implies comparing the automatically estimated segment...

We use systematic functional method to analyze and try to find out the estimated correlation behind several different texts. Ideology makes great influences on translation expression and strategy, which thus, is the product of the ideology. Language understanding means to obtain a semantic network and conditional information from a text in a deep sense.

According to what is now commonly referred to as "the Equation" in the literature on indicative conditionals, the probability of any indicative conditional equals the probability of its consequent of the conditional given the antecedent of the conditional. Philosophers widely agree in their assessment that the triviality arguments of Lewis and others have conclusively shown the Equation to be t...

People contribute more to public goods, the more others give (“crowding-in”). We investigate two possible causes of crowding-in: reciprocity, the usual explanation, and conformism, a neglected alternative. The issue is important since conformism has more scope to bring about endogenous social interaction effects outside the laboratory. We use Bardsley’s (2000) Conditional Information Lottery de...

The existing upper and lower bounds between entropy and error probability are mostly derived from the inequality of the entropy relations, which could introduce approximations into the analysis. We derive analytical bounds based on the closed-form solutions of conditional entropy without involving any approximation. Two basic types of classification errors are investigated in the context of bin...

The distribution of frequency counts of distinct words by length in a language’s vocabulary will be analyzed using two methods. The first, will look at the empirical distributions of several languages and derive a distribution that reasonably explains the number of distinct words as a function of length. We will be able to derive the frequency count, mean word length, and variance of word lengt...

In this paper we illustrate the potential of ordinal-patterns-based methods for analysis of real-world data and, especially, of electroencephalogram (EEG) data. We apply already known (empirical permutation entropy, ordinal pattern distributions) and new (empirical conditional entropy of ordinal patterns, robust to noise empirical permutation entropy) methods for measuring complexity, segmentat...