Deriving the weights of criteria from the pairwise comparison matrix with fuzzy elements is investigated. In the proposed method we first convert each element of the fuzzy comparison matrix into the nearest weighted interval approximation one. Then by using the goal programming method we derive the weights of criteria. The presented method is able to find weights of fuzzy pairwise comparison ma...

Clustering of data items is one of the important applications of graph partitioning using a graph model. The pairwise similarities between all data items form the adjacency matrix of a weighted graph that contains all the necessary information for clustering. In this paper we propose a novel hybrid-evolutionary algorithm based on graph partitioning approach for data clustering. The algorithm is...

This paper presents a new asymptotically exact lower bound on pairwise error probability of a space-time code as well as an example code that outperforms the comparable orthogonal-design-based space-time (ODST) code. Also contained in the paper are some observations relating to exact pairwise error probability, signal design guidelines and simplicity of the ODST code receiver. Keywords— Space-t...

Multi attribute decision making methods are considered as one of the most useful methods for solving ranking problems. In some decision making problems, while the alternatives for corresponding criteria are compared in a pairwise comparison manner, if the criteria are inherently fuzzy, debates will arise in ranking alternatives due to the closeness of the values of the criteria. In this researc...

We consider the problem of learning a ranking function, that is a mapping from instances to rankings over a finite number of labels. Our learning method, referred to as ranking by pairwise comparison (RPC), first induces pairwise order relations from suitable training data, using a natural extension of so-called pairwise classification. A ranking is then derived from a set of such relations by ...

For a sequence of pairwise negative quadrant dependent random variables {Xn, n ≥ 1}, conditions are given under which normed and centered partial sums converge to 0 almost certainly. As special cases, new results are obtained for weighted sums { ∑n j=1 ajXj , n ≥ 1} where {an, n ≥ 1} is a sequence of positive constants and the {Xn, n ≥ 1} are also identically distributed. A result of Matu la [1...

We present a report on work in progress on a divide and conquer approach to multiple alignment. The algorithm makes use of the costs calculated from applying the standard dynamic programming scheme to all pairs of sequences. The resulting cost matrices for pairwise alignment give rise to secondary matrices containing the additional costs imposed by fixing the path through the dynamic programmin...

The pairwise lottery system is amultiple round voting procedure which chooses by lot a winner from a pair of alternatives to advance to the next round where in each round the odds of selection are based on each alternative’s majority rule votes. We develop a framework for determining the asymptotic relative likelihood of the lottery selecting in the final round the Borda winner, Condorcet winne...

A detailed analytic and numerical study is made of the potential for permanent genetic variation in frequency-dependent models based on pairwise interactions among genotypes at a single diallelic locus. The full equilibrium structure and qualitative gene-frequency dynamics are derived analytically for a symmetric model, in which pairwise fitnesses are chiefly determined by the genetic similarit...

Let T be an edge weighted tree, let dT (u, v) be the sum of the weights of the edges on the path from u to v in T , and let dmin and dmax be two nonnegative real numbers such that dmin ≤ dmax. Then a pairwise compatibility graph of T for dmin and dmax is a graph G = (V,E), where each vertex u′ ∈ V corresponds to a leaf u of T and there is an edge (u′, v′) ∈ E if and only if dmin ≤ dT (u, v) ≤ d...