### Table 5.3: Implementation costs for the Bio-inspired Processing Module. FPGA Block Slice Operating RAM Blocks

2004

### Table 3. Characteristics of the catchment types

"... In PAGE 3: ....2. Natural systems The natural context was considered for the transfer of nitrate in catchments through hydrological behaviour and rainfall. Three contrasting catchment types were selected ( Table3 ). Table 3.... ..."

### Table 3: Estimation of U Using BLRC with Semi-stationary Cycles Starting with 3 Failed Components IS Algorithm

### Table 3: Bus cycles

"... In PAGE 4: ...1.3 Bus cycles The various kinds of bus cycles are listed in Table3 . The READ (RFO (read-for-ownership))cycle acquires shared (ex- clusive) ownership of the cache line.... ..."

### Table 1 . Optimal cycles

"... In PAGE 3: ... Figure 3. Line-Graph LG3 of G3 The optimal cycles are presented in Table1 . The columns indicate the links between p and d.... ..."

### Table 1 Cycle (111)

"... In PAGE 33: ...! (011) 2;3 ! (001) 1;2 ! (111) a three-cycle. Table1 in Appendix 1 enumerates all the possible cyclic patterns (we can have up to 8 cycles) associated with symmetric allocation rules.There are also states associated with asymmetric allocation rules.... ..."

### Table 2: Cycle statistics

2007

"... In PAGE 9: ... Table2 lists the cycle statistics for basic and SIMDized bitonic sorts as well as the quick sort on the SPE. Note that the CPI is significantly lower with the optimized SIMD implementation (less than half of the CPI of basic bitonic sort and one third of the CPI of quick sort).... ..."

Cited by 2

### Table 4. Hamiltonian cycle

"... In PAGE 7: ... As for computing Hamiltonian cycles on complete graphs, lookahead cannot reduce the depth of the search tree while bringing on extra constraint propagations. The experimental results ( Table4 ) show smodels can be several hundred times slower than smodels without lookahead. For the above two problems, A-smodels works largely as smodels without lookahead.... In PAGE 7: ... A-smodels turned off lookahead perma- nently after some literals are assigned during the process of solving this problem. For the Hamiltonian cycle problem, the performance of A-smodels is in between smodels and smodels without lookahead - it is about 20 to 30 times faster than smodels and 2 to 10 times slower than smodels without lookahead ( Table4 ). We notice that if the parameter look score is set to be 2 and ratio 0.... ..."

### Table 1. Stall cycles

"... In PAGE 6: ... Breakdown of UPC 1 u- ops retired 10% 2 u- ops retired 6% 3 u- ops retired 21% 0 u- ops retired 63% There are additional counters in Pentium III allowing us to further categorize different types of stalls. Table1 summarizes the result. The percentage is ranked among all cycles.... ..."

### Table 5: Cycles of D

1998

"... In PAGE 19: ...28i.e. the set of inheritance vectors#29, where H = D 4 or C 2 #02 C 2 and G = S k or S h #02 S k,h . Table5 lists for eachpermutation in D 4 the number of cycles of length j, j =1; 2; 3; 4. The m i apos;s are calculated using Table 5, and the fact that for #1C 2 D 4 and i #15 0 m 4 #28#1C#29 = m 4i+4 #28#1C#29; m 1 #28#1C#29 = m 4i+1 #28#1C#29=m 4i+3 #28#1C#29; m 2 #28#1C#29 = m 4i+2 #28#1C#29: When H = C 2 #02 C 2 , only the #0Crst and third rows of Table 7 are used.... In PAGE 19: ...Table 5 lists for eachpermutation in D 4 the number of cycles of length j, j =1; 2; 3; 4. The m i apos;s are calculated using Table5 , and the fact that for #1C 2 D 4 and i #15 0 m 4 #28#1C#29 = m 4i+4 #28#1C#29; m 1 #28#1C#29 = m 4i+1 #28#1C#29=m 4i+3 #28#1C#29; m 2 #28#1C#29 = m 4i+2 #28#1C#29: When H = C 2 #02 C 2 , only the #0Crst and third rows of Table 7 are used. When G = S h #02 S k,h ,we note that the cycle index polynomial of the direct product of two groups is simply the product of the cycle indices of the two groups and Table 7 may be used again.... ..."