Displaying 41 – 60 of 70

Showing per page

Information systems in categories of valued relations.

Vladimir B. Gisin (1994)

Mathware and Soft Computing

The paper presents a categorical version of the notion of information system due to D. Scott. The notion of information system is determined in the framework of ordered categories with involution and division and the category of information systems is constructed. The essential role in all definitions and constructions play correlations between inclusion relations and entailment relations.

Information-type divergence when the likelihood ratios are bounded

Andrew Rukhin (1997)

Applicationes Mathematicae

The so-called ϕ-divergence is an important characteristic describing "dissimilarity" of two probability distributions. Many traditional measures of separation used in mathematical statistics and information theory, some of which are mentioned in the note, correspond to particular choices of this divergence. An upper bound on a ϕ-divergence between two probability distributions is derived when the likelihood ratio is bounded. The usefulness of this sharp bound is illustrated by several examples of...

Informazione relativa in uno spazio con legge d'indipendenza qualsiasi.

Carla Poggi (1982)

Stochastica

The notion of relative measure of information in an abstract information space with generalized independence law is studied. The axiomatic definition is given and the form of dependence on the absolute measures is determined, as a solution of a system of functional equations.

Instruments and mutual entropies in quantum information

Alberto Barchielli, Giancarlo Lupieri (2006)

Banach Center Publications

General quantum measurements are represented by instruments. In this paper the mathematical formalization is given of the idea that an instrument is a channel which accepts a quantum state as input and produces a probability and an a posteriori state as output. Then, by using mutual entropies on von Neumann algebras and the identification of instruments and channels, many old and new informational inequalities are obtained in a unified manner. Such inequalities involve various quantities which characterize...

Integrated region-based segmentation using color components and texture features with prior shape knowledge

Mehryar Emambakhsh, Hossein Ebrahimnezhad, Mohammad Hossein Sedaaghi (2010)

International Journal of Applied Mathematics and Computer Science

Segmentation is the art of partitioning an image into different regions where each one has some degree of uniformity in its feature space. A number of methods have been proposed and blind segmentation is one of them. It uses intrinsic image features, such as pixel intensity, color components and texture. However, some virtues, like poor contrast, noise and occlusion, can weaken the procedure. To overcome them, prior knowledge of the object of interest has to be incorporated in a top-down procedure...

Interpretability of linguistic variables: a formal account

Ulrich Bodenhofer, Peter Bauer (2005)

Kybernetika

This contribution is concerned with the interpretability of fuzzy rule-based systems. While this property is widely considered to be a crucial one in fuzzy rule-based modeling, a more detailed formal investigation of what “interpretability” actually means is not available. So far, interpretability has most often been associated with rather heuristic assumptions about shape and mutual overlapping of fuzzy membership functions. In this paper, we attempt to approach this problem from a more general...

Invariance groups of finite functions and orbit equivalence of permutation groups

Eszter K. Horváth, Géza Makay, Reinhard Pöschel, Tamás Waldhauser (2015)

Open Mathematics

Which subgroups of the symmetric group Sn arise as invariance groups of n-variable functions defined on a k-element domain? It appears that the higher the difference n-k, the more difficult it is to answer this question. For k ≤ n, the answer is easy: all subgroups of Sn are invariance groups. We give a complete answer in the cases k = n-1 and k = n-2, and we also give a partial answer in the general case: we describe invariance groups when n is much larger than n-k. The proof utilizes Galois connections...

Currently displaying 41 – 60 of 70