Maximizing the Bregman divergence from a Bregman family
The problem to maximize the information divergence from an exponential family is generalized to the setting of Bregman divergences and suitably defined Bregman families.
Maximum Entropy and Utility in a Transportation System
Maximum entropy wave functions.
Mean mutual information and symmetry breaking for finite random fields
G. Edelman, O. Sporns and G. Tononi have introduced the neural complexity of a family of random variables, defining it as a specific average of mutual information over subfamilies. We show that their choice of weights satisfies two natural properties, namely invariance under permutations and additivity, and we call any functional satisfying these two properties an intricacy. We classify all intricacies in terms of probability laws on the unit interval and study the growth rate of maximal intricacies...
Meaningful share generation for increased number of secrets in visual secret-sharing scheme.
Measures of fuzziness and operations with fuzzy sets.
We discuss the effects that the usual set theoretic and arithmetic operations with fuzzy sets and fuzzy numbers have with respect to the energies and entropies of the fuzzy sets connected and of the resulting fuzzy sets, and we also compare the entropies and energies of the results of several of those operations.
Measures of fuzziness based on t-norms.
We use the concept of t-norms and conorms to develop a pseudo metric and we then use this pseudo metric to define a class of measures of fuzziness associated with a fuzzy set. We investigate the properties of this class of measures of fuzziness.
Measures of information associated with Csiszár's divergences
Measures of inset information on the open domain - I: Inset entropies and information functions of all degrees.
Measures of uncertainty totally compositive with the branching property.
This paper deals with a characterization of the totally compositive measures of uncertainty which satisfy the branching property. A procedure to construct all continuous measures in this class is given.
Measures of vector information with the branching property
Measuring information beyond communication theory - Why some generalized information measures may be useful, others not.
Medidas de entropía en la teoría de la evidencia.
The aim of this paper is to define global measures of uncertainty in the framework of Dempster-Shafer's Theory of Evidence. Starting from the concepts of entropy and specificity introduced by Yager, two measures are considered; the lower entropy and the upper entropy.
Medidas de nitidez para conjuntos difusos.
En este trabajo se realiza un estudio de Medidas de Nitidez para conjuntos difusos. Se comienza dando los conceptos de Medida Puntual de Nitidez o Auto-nitidez puntual y Medida de Nitidez para conjunto difuso, pasando a continuación a dar dos teoremas de construcción de Medidas de Nitidez y uno de caracterización para aquellas medidas que sean valoraciones en el retículo Ln(X).
Memory elements and partition pairs in the synthesis of sequential circuits
Messages parasites et codes synchronisants
Mesures d'information et représentation de semi-groupes associés
Metric coset schemes revisited
An Abelian scheme corresponds to a special instance of what is usually named a Schur-ring. After the needed results have been quoted on additive codes in Abelian schemes and their duals, coset configurations, coset schemes, metric schemes and distance regular graphs, partition designs and completely regular codes, we give alternative proofs of some of those results. In this way we obtain a construction of metric Abelian schemes and an algorithm to compute their intersection matrices.
Migrativity properties of 2-uninorms over semi-t-operators
In this paper, we analyze and characterize all solutions about -migrativity properties of the five subclasses of 2-uninorms, i. e. , , , , , over semi-t-operators. We give the sufficient and necessary conditions that make these -migrativity equations hold for all possible combinations of 2-uninorms over semi-t-operators. The results obtained show that for , the -migrativity of over a semi-t-operator is closely related to the -section of or the ordinal sum representation of t-norm...
Minimal Codewords in Linear Codes
2000 Mathematics Subject Classification: 94B05, 94B15.Cyclic binary codes C of block length n = 2^m − 1 and generator polynomial g(x) = m1(x)m2^s+1(x), (s, m) = 1, are considered. The cardinalities of the sets of minimal codewords of weights 10 and 11 in codes C and of weight 12 in their extended codes ^C are determined. The weight distributions of minimal codewords in the binary Reed-Muller codes RM (3, 6) and RM (3, 7) are determined. The applied method enables codes with larger parameters to...