In this correspondence, we establish a partial ordering framework to compare flatfading channels in a capability sense, which is based on the relative dominance of their mutual information functions over a convex set of input distributions. For this purpose, we address the effect of the line-of-sight and scattering components on the mutual information of flat-fading channels. For example, we sh...

Most systems for the automation of termination proofs using polynomial orderings are only semi-automatic,i.e. the \right" polynomial ordering has to be given by the user. We show that a variation of Lank-ford's partial derivative technique leads to an easier and slightly more powerful method than most other semi-automatic approaches. Based on this technique we develop a method for the automated...

The quantum grassmannian is known to be a graded quantum algebra with a straightening law when the poset of generating quantum minors is endowed with the standard partial ordering. In this paper it is shown that this result remains true when the ordering is subjected to cyclic shifts. The method involves proving that noncommutative dehomogenisation is possible at any consecutive quantum minor. ...

In the rst part of the paper we are concerned about nite sequences (over arbitrary symbols) u for which Ex(u;n) = O(n). The function Ex(u;n) measures the maximum length of nite sequences over n symbols which contain no subsequence of the type u. It follows from the result of Hart and Sharir that the containment ababa u is a (minimal) obstacle to Ex(u;n) = O(n). We show by means of a constructio...

If n is a cyclic permutation and x is a periodic point of a continuous function /:R •-► R with period(x) = order(Tt) = n , then we say that x has type n if the orbit of x consists of points xx < x2 < •■■ < xn with f(x¡) = x„/« . In analogy with Sarkovskii's Theorem, we define a partial ordering on cyclic permutations by 8 —» n if every continuous function with a periodic point of type 0 also ha...

In this paper we prove some stochastic comparisons results for progressive type II censored order statistics. The problem of stochastically comparing concomitants of the two progressive type II censored order statistics with possibly different schemes, under different kinds of dependence between X and Y is considered and it is proved that if Y is stochastically increasing (decreasing) in X, ...

This paper presents an approach to deal with the underspecification of Aktionsarten in German sentences. In German the difference between an accomplishment and the associated progressive state is often not marked on the sentence level. This distinction is important for correctly interpreting texts and for translation into languages which provide morphological markings of Aktionsarten. To mainta...

In this paper we define a partial order on the set of all knots and links using a special property derived from their minimal diagrams. A knot or link K′ is called a predecessor of a knot or link K if Cr(K′) < Cr(K) and a diagram of K′ can be obtained from a minimal diagram D of K by a single crossing change. In such a case we say that K′ < K. We investigate the sets of knots that can be obtain...

Actor programs consist of a number of concurrent objects called actors, which communicate by exchanging messages. Nondeterminism in actors results from the different possible orders in which available messages are processed. Systematic testing of actor programs explores various feasible message processing schedules. Dynamic partial-order reduction (DPOR) techniques speed up systematic testing b...

The paper deals in a preliminary way with the problem of the selection of a unique fuzzy preference relation from the set of fuzzy preference relations. A direct algorithm of possibilistic clustering is the basis of the method of fuzzy preference relation discriminating. A method of decision-making based on a fuzzy preference relation is described and basic concepts of the heuristic method of p...