### Table 1: Complementary Instantiations

2003

"... In PAGE 5: ... For the architecture-centric instantiation we used a security ABAS for attribute reasoning, and a Web-based enterprise system for the component technology (from the case study found in [25]). Table1 summarizes the mapping of these instantiations to the reference model. Table 1: Complementary Instantiations ... ..."

### Table 1: Orthogonalization of cluster bases

2004

"... In PAGE 18: ... In the first example, we apply the orthogonalization algorithm to an intermediate approximation constructed by cubic interpolation. The results of the experiment are reported in Table1 . The first and second column give the time for the construction of the approximation: The first column contains the total time in seconds, the second contains the time per degree of freedom in milliseconds.... ..."

### Table 6:Statistical summary for orthogonality Orthogonality

"... In PAGE 9: ...1.3 Orthogonality Based on Table6 , which data are again not yet disaggregated with respect to expertise, orthogonality is 97%, while variance is 2. This expresses that, in the average, programmers commonly percept ODC with respect, and tend to provide just one classification per defect, whatever is their expertise.... ..."

### Table 2: Memory Access Times for Multiple Generations of Machines

2005

"... In PAGE 3: ....6.9 E1000 device driver code. Table2 presents the re- sults. Note that while L1 and L2 access times remain rel- atively consistent in terms of processor cycles, the time to access main memory and the device registers is in- creasing over time.... ..."

Cited by 7

### Table 2: Memory Access Times for Multiple Generations of Machines

2005

"... In PAGE 3: ....6.9 E1000 device driver code. Table2 presents the re- sults. Note that while L1 and L2 access times remain rel- atively consistent in terms of processor cycles, the time to access main memory and the device registers is in- creasing over time.... ..."

Cited by 7

### Table 1: Code orthogonality with single element antenna

"... In PAGE 3: ... In the initial results published in [2], the noise effects were present. The refined code orthogonality values presented in Table1 are more realistic, being dependent... ..."

### Table 4. Implementation Tuning and Abstraction are complementary

"... In PAGE 43: ... We believe the two approaches are orthogonal and complementary approaches to achieve simulation scalability. Table4 gives an analogy to explain the subtle difference between abstraction and implementation tuning. In that, an abstract simulation can be re-implemented in a more efficient manner.... In PAGE 114: ...2. Contributions Table4 summarizes all the scaling techniques described earlier. Among the seven techniques, centralized computation, end-to-end packet delivery, algorithmic routing, and finite state automata modeling are abstraction techniques.... ..."

### Table 1: Maximum Minimum Lee Distances for Best Self-Orthogonal (pm, m) QC Codes over Z4

"... In PAGE 15: ... It was found that it is best to first find a code with a specified even minimum distance, then check for orthogonality. Table1 presents the minimum weights of the best codes obtained. Note that it was shown in [18] that self-dual QT codes exist only for lengths a multiple of 8 (m a multiple of 4).... In PAGE 15: ... Note that it was shown in [18] that self-dual QT codes exist only for lengths a multiple of 8 (m a multiple of 4). The first rows of the twistulant matrices of the QT codes listed in Table1 are compiled in Tables 2 - 5. Since this is the first compiled table of Z4 codes (self-orthogonal or otherwise), it is not possible to compare these codes with previous results.... In PAGE 15: ... However, using the Gray map, it is possible to compare these codes with the best binary linear codes [3] with even minimum distance. Of the 111 entries in Table1 , 54 or almost half attain the best known distance for the corresponding binary code. Hence the class of self-orthogonal QT codes contains many good codes.... ..."

### Table 2 These polynomials satisfy the multiple orthogonality relations Z

"... In PAGE 13: ...1. Di erential equations for Table2 . First we consider the polynomials de ned by (1.... In PAGE 13: ...1) The information that will be used is that fwsg are solutions of the Pearson equation w0 s(z) = Bs(z) (z) ws(z) ; s = 1; : : : ; p; (4.2) with the data given in Table2 (multiple Hermite and Laguerre II polynomials). This data implies that the quantity Bs(z) (z) Bk(z) (z) = s k ; s; k = 1; : : : ; p ; (4.... ..."

Cited by 11