This paper revisits the pairwise sorting network introduced by Parberry in the early 90’s. We provide a simple specification of the pairwise network which also clarifies its close resemblance to the more classic odd-even network introduced by Batcher in the mid 60’s. Finally we illustrate that pairwise networks are better suited than odd-even networks for the construction of selection networks.

The research presented is a partial empirical evaluation of the second author’s proposed psychophysical theory (Luce, 2002, 2003a,b). The theory deals with the global percept of subjective intensity in which there is a psychophysical function Ψ that maps pairs of physical intensities onto the positive real numbers and represents subjective summation and a form of ratio production. A number of b...

The asymptotic relative efficiency of the mean deviation with respect to the standard deviation is 88% at the normal distribution. In his seminal 1960 paper A survey of sampling from contaminated distributions, J. W. Tukey points out that, if the normal distribution is contaminated by a small -fraction of a normal distribution with three times the standard deviation, the mean deviation is more ...

In this paper we define pairwise-$\alpha$-paracompact subsets as a generalisation of $\alpha$-paracompact in topological spaces and study their properties its relations with other bitopological spaces. Several theorems are obtained concerning sets. We introduced the definition $p$-paracompact bitoplogical

We extend the consistency rules to make them complete and present an automatically enforced “consistency”algorithm for the non-numerical ranking method based on the pairwise comparisons.