Accession Number:
AD0647046
Title:
LINEAR RANKINGS OF FINITE-DIMENSIONAL PATTERNS.
Descriptive Note:
Technical rept.,
Corporate Author:
STANFORD UNIV CALIF STANFORD ELECTRONICS LABS
Personal Author(s):
Report Date:
1966-09-01
Pagination or Media Count:
19.0
Abstract:
The paper determines Qn,d, the number of ways that n d-dimensional pattern vectors can be ordered by projection onto a freely-chosen weighting vector. This is equivalent to finding the number of ways of ranking n students on the basis of arbitrary linear combinations of their scores on d examinations. Qn,d is independent subject to minor nonsingularity constraints of the precise configuration of the pattern vectors, and is naturally expressible as a sum of stirling-like numbers. Author
Descriptors:
Subject Categories:
- Theoretical Mathematics
- Cybernetics