We present the Concordant-Ranks (CR) strategy that decision makers use to quickly find an alternative that is proximate to an ideal alternative in a multi-attribute decision space. CR implies that decision makers prefer alternatives that exhibit concordant ranks between attribute values and attribute weights. We show that, in situations where the alternatives are equal in multi-attribute utilit...

BACKGROUND Chronic stress may conceivably require plasticity of maternal physiology and behavior to cope with the conflicting primary demands of infant rearing and foraging for food. In addition, social rank may play a pivotal role in mandating divergent homeostatic adaptations in cohesive social groups. We examined cerebrospinal fluid (CSF) oxytocin (OT) levels and hypothalamic-pituitary adren...

In this paper, we study the rank distributions of linear codes. We give the analogous to the MacWilliams identity for the rank distributions of codes. The considerations of our proof can be adapted to give an alternate derivation of the identity for the Hamming metric. This derivation does not rely on the identity for the complete weight enumerator. Using the result for the rank metric, we dete...

Abstract We establish lower bounds on the rank of matrices in which all but diagonal entries lie a multiplicative group small rank. Applying these we show that distance sets finite pointsets $\mathbb {R}^d$ generate high-rank groups and cannot contain large sumsets.

Matrices with very few nonzero entries cannot have large rank. On the other hand matrices without any zero entries can have rank as low as 1. These simple observations lead us to our main question. For matrices over finite fields, what is the relationship between the rank of a matrix and the number of nonzero entries in the matrix? This question motivated a summer research project collaboration...

Using 1710 Thoroughbred racehorses in Japan, a cohort study was performed to evaluate the influence of genotypes at four single nucleotide polymorphisms (SNPs) on equine chromosome 18 (ECA18), which were associated in a previous genome-wide association study for racing performance with lifetime earnings and performance rank. In males, both g.65809482T>C and g.65868604G>T were related to perform...

This paper describes a semi-supervised distance metric learning algorithm which uses pairwise equivalence (similarity and dissimilarity) constraints to discover the desired groups within high-dimensional data. As opposed to the traditional full rank distance metric learning algorithms, the proposed method can learn nonsquare projection matrices that yield low rank distance metrics. This brings ...

This paper introduces a semi-supervised distance metric learning algorithm which uses pairwise equivalence (similarity and dissimilarity) constraints to discover the desired groups within high-dimensional data. In contrast to the traditional full rank distance metric learning algorithms, the proposed method can learn nonsquare projection matrices that yield low rank distance metrics. This bring...

UNLABELLED Gene prioritization refers to a family of computational techniques for inferring disease genes through a set of training genes and carefully chosen similarity criteria. Test genes are scored based on their average similarity to the training set, and the rankings of genes under various similarity criteria are aggregated via statistical methods. The contributions of our work are threef...

Recently Lu and Kumar made use of binary, maximal rank-distance codes to construct space-time codes, which we shall term rank-distance space-time (RDST) codes, over PAM, QAM, and 2-PSK constellations which are optimal under the rate-diversity tradeoff. The RDST code can be regarded as being composed of layers with each layer or component, associated to a maximal-rank binary code. Two generaliza...