Evolutionary trees of species can be reconstructed by pairwise comparison of their entire genomes. Such a comparison can be quantified by determining the number of events that change the order of genes in a genome. Earlier Erdem and Tillier formulated the pairwise comparison of entire genomes as the problem of planning rearrangement events that transform one genome to the other. We reformulate ...

Designers routinely rank alternatives in a variety of settings using a staple of comparison, the pairwise comparison. In recent years questions have been raised about the use of such comparisons as a means of calculating and aggregating meaningful preference or choice data. Results on voting have been used to argue that the positional procedure known as the Borda count is the best pairwise voti...

Evolutionary trees of species can be reconstructed by pairwise comparison of their entire genomes. Such a comparison can be quantified by determining the number of events that change the order of genes in a genome. Earlier Erdem and Tillier formulated the pairwise comparison of entire genomes as the problem of planning rearrangement events that transform one genome to the other. We reformulate ...

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...

This paper provides a block coordinate descent algorithm to solve unconstrained optimization problems. In our algorithm, computation of function values or gradients is not required. Instead, pairwise comparison of function values is used. Our algorithm consists of two steps; one is the direction estimate step and the other is the search step. Both steps require only pairwise comparison of funct...

We introduce strong separation axioms in bitopological spaces. We also introduce the notion of strong pairwise compactness.

in recent years, the problem of selecting and evaluating the suppliers in supply chain management has aroused considerable interest in business firms. owing to the development of information systems, reaching an appropriate decision for adopting discrete methods is a need. the researchers intend to present a new model in this paper as a contributing factor in the grey environment in which the r...

Most grey level thresholding methods produce good results only when the illumination of the image is homogeneous. An automatic binarization technique suitable for images containing regions of different brightness is presented. It does not use image’s grey level histogram as a source of information. Rather, the method is based on the transformation of the raster image in such a way that the tran...

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...

The Grey-White Decision Network (GWDN) is presented as an analog constraint satisfaction neural network that segments magnetic resonance brain images. Constraints on signal intensity, neighborhood interactions and edge in uences are combined to assign labels of grey matter, white matter or \other" to each pixel. An improved version of this novel segmentation network that is provably stable is d...