On finite principal ideal rings.
A binary relation language is an important tool of the theory of measurements (see, for example, book [5]). Specifically, the theory of nominal and ordinal scales is based on theories of equivalent relations and weak orderings. These binary relations have a simple structure which can be described as follows (bearing in mind a context of the measurement theory).
Some generalizations of the concept of ordered fuzzy numbers (OFN) are defined to handle fuzzy inputs in a quantitative way, exactly as real numbers are handled. Additional two structures, an algebraic one and a normed (topological) one, are introduced to allow for counting with a more general type of membership relations.
The notion of cumulative past inaccuracy (CPI) measure has recently been proposed in the literature as a generalization of cumulative past entropy (CPE) in univariate as well as bivariate setup. In this paper, we introduce the notion of CPI of order and study the proposed measure for conditionally specified models of two components failed at different time instants, called generalized conditional CPI (GCCPI). Several properties, including the effect of monotone transformation and bounds of GCCPI...
The aim of this review is to give different two-parametric generalizations of the following measures: directed divergence (Kullback and Leibler, 1951), Jensen difference divergence (Burbea and Rao 1982 a,b; Rao, 1982) and Jeffreys invariant divergence (Jeffreys, 1946). These generalizations are put in the unified expression and their properties are studied. The applications of generalized information and divergence measures to comparison of experiments and the connections with Fisher information...
Kullback's relative information and Kerridge's inaccuracy are two information-theoretic measures associated with a pair of probability distributions of a discrete random variable. The authors study a generalized measure which in particular contains a parametric generalization of relative information and inaccuracy. Some important properties of this generalized measure along with an inversion theorem are also studied.
We have been investigating the cryptographical properties of in nite families of simple graphs of large girth with the special colouring of vertices during the last 10 years. Such families can be used for the development of cryptographical algorithms (on symmetric or public key modes) and turbocodes in error correction theory. Only few families of simple graphs of large unbounded girth and arbitrarily large degree are known. The paper is devoted to the more general theory of directed graphs of large...