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...
Minimal cycle bases of outerplanar graphs.
Minimum distances of error-correcting codes in incidence rings.
Minimum entropy of error estimate for multi-dimensional parameter and finite-state-space observations
Minimum of average conditional entropy for given minimum probability of error
Mining online auction social networks for reputation and recommendation
Missile System Selection Based on the Fuzzy Sets Theory
Mixture of generalized gamma density-based score function for FastICA.