Rank aggregation is the problem of generating an overall ranking from a set of individual votes. The aim in doing so is to produce a ranking which is as close as possible to the (unknown) correct ranking for a given distance measure such as the Kendall-tau distance. The challenge is that votes are often both noisy and incomplete. Existing work has largely focused on finding the most likely rank...

A new approach. micm benchmarks. has recently been developed. Using this technique. we have analyzed the KSRI, and in particular the "ALLCACHE" memory architecture and ring interconnection. We have been able to elucidate many facets of memory performance. The technique has enabled us to identify and characterize puts of the memory design not described by Kendall Square Research. Our results sho...

This paper analyzes and evaluates some novel latency hiding features of the KSR1 multiprocessor: prefetch and poststore instructions and automatic updates. As a case study, we analyze the performance of an iterative sparse solver which generates irregular communications. We show that automatic updates signiicantly reduce the amount of communication. Although prefetch and poststore instructions ...

The n × n Brualdi-Li matrix Bn has recently been shown to have maximal Perron value (spectral radius) ρ among all tournament matrices of even order n, thus settling the conjecture by the same name. This renews our interest in estimating ρ and motivates us to study the Perron eigenvector x of Bn, which is normalized to have 1-norm equal to one. It follows that x minimizes the 2-norm among all Pe...

Recently, Drs. Ken Resnicow and Roger Vaughan published a thought-provoking paper in the International Journal of Behavioral Nutrition and Physical Activity (IJBNPA). They argue that the most often used social-cognition theories in behavioral nutrition and physical activity are of limited use. These models describe behavior change as a linear event, while Resnicow and Vaughan posit that behavio...

We establish Choquet-Kendall-Matheron theorems on non-Hausdorff topological spaces. This typical result of random set theory is profitably recast in purely topological terms, using intuitions and tools from domain theory. We obtain three variants of the theorem, each one characterizing distributions, in the form of continuous valuations, over relevant powerdomains of demonic, resp. angelic, res...