The Structural Representation of Proximity Matrices With MATLAB
نویسنده
چکیده
A proximity matrix, morse digits.dat, for the ten Morse code symbols representing the first ten digits (data from Rothkopf, 1957). 33 9.1 Order-constrained least-squares approximations to the digit proximity data of Shepard et al. (1975); the upper-triangular portion is anti-Robinson and the lower-triangular portion is strongly-anti-The 45 subsets listed according to increasing diameter values that are contiguous in the object ordering used to display the upper-triangular portion of Table 9.1. The 22 subsets given in italics are redundant in the sense that they are proper subsets of another listed subset with the same diameter.. The fourteen (nonredundant) subsets listed according to increasing diameter values are contiguous in the linear object ordering used to display the lower-triangular SAR portion of Table 9.
منابع مشابه
The Structural Representation of Proximity Matrices With MATLAB
1.1 The number.dat data file from Shepard, Kilpatric, and Cunningham (1975). 11 3.1 A proximity matrix, morse digits.dat, for the 10 Morse code symbols representing the first ten digits 9.1 Order-constrained least-squares approximations to the digit proximity data of Shepard et al. (1975); the upper-triangular portion is anti-Robinson and the lower-triangular portion is strongly-anti-9.2 The 45...
متن کاملQUASI-PERMUTATION REPRESENTATIONS OF SUZtTKI GROUP
By a quasi-permutation matrix we mean a square matrix over the complex field C with non-negative integral trace. Thus every permutation matrix over C is a quasipermutation matrix. For a given finite group G, let p(G) denote the minimal degree of a faithful permutation representation of G (or of a faithful representation of G by permutation matrices), let q(G) denote the minimal degree of a fai...
متن کاملQUASI-PERMUTATION REPRESENTATIONS OF METACYCLIC 2-GROUPS
By a quasi-permutation matrix we mean a square matrix over the complex field C with non-negative integral trace. Thus, every permutation matrix over C is a quasipermutation matrix. For a given finite group G, let p(G) denote the minimal degree of a faithful permutation representation of G (or of a faithful representation of G by permutation matrices), let q(G) denote the minimal degree of a fa...
متن کاملCOMPUTATIONAL ENUMERATION OF POINT DEFECT CLUSTERS IN DOUBLE- LATTICE CRYSTALS
The cluster representation matrices have already been successfully used to enumerate close-packed vacancy clusters in all single-lattice crystals [I, 2]. Point defect clusters in double-lattice crystals may have identical geometry but are distinct due to unique atomic postions enclosing them. The method of representation matrices is extended to make it applicable to represent and enumerate ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Technometrics
دوره 49 شماره
صفحات -
تاریخ انتشار 2007