### Table 1: The Distance-Regular Graphs with an Eigenvalue of Multiplicity Four

"... In PAGE 13: ... Lemma 7.1 For the array listed in Table1 , it is impossible to realise this array by a distance-regular graph. Proof: There is only one array; such a graph would have 4 as an eigenvalue of multiplicity three and thus would have a representation in R3.... ..."

### Table 2: The Distance-Regular Graphs with an Eigenvalue of Multiplicity Five

"... In PAGE 13: ... This process involves two steps. First, the acceptable arrays which are not realisable are listed in a table (Ta- ble 1, Table2 , and Table 3). For each of these arrays, we exhibit a feasibility condition from Section 6 which is violated.... In PAGE 15: ... Lemma 7.3 For each array listed in Table2 , it is impossible to realise this array by a distance-regular graph. Proof: Array 2-1: This array should correspond to a graph on twenty- eight vertices having diameter two.... ..."

### Table 4: The Distance-Regular Graphs with an Eigenvalue of Multiplicity Seven

"... In PAGE 9: ... So, for m = 3, only the cube and the icosahedron fall into this category. The graphs with m = 4 were determined in [23] and are listed in Table4 of the Appendix. None of them has diameter six.... ..."

### Table 2. Rates of Internet access and regular computer use among patients with isolated visual impairment and multiple physical impairments, aged 15-64. Note that total number of patients is different from Table 1 because of different age range*.

2005

"... In PAGE 8: ... Third, many patients with visual disabilities are elderly people who suffer from additional impairments such as hearing loss or physical limitations. As shown in Table2 , adults whose ... ..."

Cited by 1

### Table 1: Regular expressions for Multiple Cycle instruction for two models Model 1

2001

"... In PAGE 8: ... Other multi_cycle instructions can be treated similarly. Table1... In PAGE 11: ... Table 10 summarizes the distances with and without transaction recognition. Table1 0: Edit and block distances for signal waveforms with amp; without transaction recognition Signals Edit/block Distance Without Transaction Recognition Edit/block Distance With Transaction Recognition Din 0/0 1/1 Dout 500/490 1/1 Total 500/490 2/2 5. Conclusion While simulation still remains a main approach to evaluation of suitability of IPs for target applications, it is very difficult and time consuming to compare and to interpret simulation waveforms from different models.... ..."

### Table 1: Some Common Geometric Regularities

2004

"... In PAGE 3: ...ells (e.g. symmetrically arranged directions where the angles be- tween the directions are integer multiples of some angle pi/n). Table1 lists the types of common regularities which we deter- mine using feature symmetries. The regularities are mainly distin- guished by the type of symmetry involved.... ..."

### Table 1: Characteristics of the Regular Polytopes in 4D

2004

"... In PAGE 3: ... The Simple Regular 4D Polytopes In four dimensions there exist six regular polytopes [1]. Table1 summarizes some of their salient geomet- ric features and lists the valence v of the vertices, the number w of faces (or cells) sharing each edge, the number n of sides on each face, and the type of cell that makes up the shell of each polytope. Many differ- ent symmetric edge projections from 4D to a 3D subspace have been discussed and illustrated in [2].... ..."

Cited by 1

### Table 3. A characterization of many IDEA variants which are susceptible to multiplicative dif- ferential cryptanalysis.

"... In PAGE 15: ... Many other variants of IDEA are also vulnerable to multiplicative differential at- tacks. Table3 characterizes a large class of weak IDEA variants by showing the min- imum changes necessary to IDEA to render it vulnerable. These IDEA variants have three different round functions, BT, BU, and BV.... ..."

### Table 3. A characterization of many IDEA variants which are susceptible to multiplicative dif- ferential cryptanalysis.

"... In PAGE 15: ... Many other variants of IDEA are also vulnerable to multiplicative differential at- tacks. Table3 characterizes a large class of weak IDEA variants by showing the min- imum changes necessary to IDEA to render it vulnerable. These IDEA variants have three different round functions, BT, BU, and BV.... ..."

### Table 3. Bit patterns in multiplication data (Multiplier power is related to how many 01 cases can become 10.)

2003

"... In PAGE 6: ... Rather, the benefit of compiler swap- ping is slightly higher with an 8-bit LUT than it is for the original processor that has no hardware modifications. Table3 displays the bit patterns for multiplication data. This table, shows that 15.... ..."

Cited by 2