We consider the problem of determining when a given source can be used to approximate the output due to any input to a given channel. We provide achievability and converse results for a general source and channel. For the special case of a full-rank discrete memoryless channel we give a stronger converse result than we can give for a general channel.

Let $H=H(V,E)$ be a non-trivial simple connected graph with edge and vertex set $E(H)$ $V(H)$, respectively. A subset $\mathbb{D}\subset V(H)$ distinct vertices is said to resolving in $H$ if for each pair of $p$ $q$ we have $d(p,u)\neq d(q,u)$ some $u\in H$. minimum possible metric basis $H$. The cardinality called the dimension $H$, denoted by $\dim_{v}(H)$. In this paper, prove that constant...

For an ordered setW = {w1,w2, . . . ,wk} of vertices and a vertexv in a connected graphG, the code of v with respect toW is the k-vector cW (v)= (d(v,w1),d(v,w2), . . . ,d(v,wk)), where d(x,y) represents the distance between the vertices x andy . The setW is a resolving set for G if distinct vertices of G have distinct codes with respect to W . The minimum cardinality of a resolving set for G i...

This paper describes three experiments in using frame level observation probabilities as the basis for word confidence annotation in an HMM speech recognition system. One experiment is at the word level, one uses word classes, and the other uses phone classes. In each experiment we categorize hypotheses into correct and incorrect categories by aligning a best recognition hypothesis with the kno...

In recent years, the Pirate Party of Sweden, the Wikimedia Foundation, the Debian project, the “Software in the Public Interest” project, the Gentoo project, and many other private organizations adopted a new single-winner election method for internal elections and referendums. In this paper, we will introduce this method, demonstrate that it satisfies e.g. resolvability, Condorcet, Pareto, rev...

Interesing groups often occur as automorphism groups of some combinatorial objects. One may use these objects to obtain a representation of the constructed designs. Our combinatorial objects are graphs. Representing a design graphically may make certain properties of a combinatorial design obvious that otherwise would require tedious reasoning. This holds for symmetries, resolvability, and sub-...

In recent years, the Pirate Party of Sweden, the Wikimedia Foundation, the Debian project, the Gentoo project, and many other private organizations adopted a new single-winner election method for internal elections and referendums. In this paper, we will introduce this method, demonstrate that it satisfies e.g. resolvability, Condorcet, Schwartz, Smith-IIA, Pareto, reversal symmetry, monotonici...

We propose an enhanced image reconstruction method for spotlight-mode synthetic aperture radar (SAR). Our approach involves extension of feature preserving regularization techniques developed in other applications to the complex-valued SAR imaging problem. Compared to conventional image formation schemes, our approach offers increased resolvability of point-scatterers, enhancement of object sha...