### Table 2: Throughput optimization of non-linear real-life designs with unrestricted amount of unfolding used: ICPL - initial critical path length, ! 0 - arbitrary speed-up

"... In PAGE 4: ... Table 1 shows throughput im- provement achieved using the best previous approach by [2] and using the new approach with optimization engine of general non- linear computation with no unfolding. Table2 shows throughput improvement achieved for non-restricted amount of unfolding. When no unfolding is used, our approach reduces the critical path lengths from the technique of [2] by 35 % on average.... ..."

### Table 2: Throughput optimization of non-linear real-life designs with unrestricted amount of unfolding used: ICPL - initial critical path length, ! 0 - arbitrary speed-up

"... In PAGE 4: ... Table 1 shows throughput im- provement achieved using the best previous approach by [2] and using the new approach with optimization engine of general non- linear computation with no unfolding. Table2 shows throughput improvement achieved for non-restricted amount of unfolding. When no unfolding is used, our approach reduces the critical path lengths from the technique of [2] by 35 % on average.... ..."

### TABLE 2. Categories of data and percentages of respondents for size of facility, average bird weight, amount of water used to processbefore and after Hazard Analysis and Critical ControlPoint (HACCP), difference in processing water due to HACCP, and amount of water recycled

### Table 7 Temperature conversion factors and critical temperatures

"... In PAGE 14: ... Also determined were the critical temperature (the temperature integer at the mid-point of a 5C [9F] temperature range within which the largest amount of damage accumulates) an d TCFs to the critical temperature . Results of these computations, summarized in Table7 , confirm prior findings tha t TCFs are both site- as well as pavement structure-specific . They also confirm prior findings that critical temperatures are larger for 203 mm (8.... ..."

### Table 8- Critical-path delay breakdown of CDCT3. 6.2.2.4 CDCT4 and CDCT5: Controller pipelining Looking at the critical paths of the architectures, it is evident that the controller contributes to a major amount of the delay. The CMem, CW, and Address Generator (AG) delays are part of the critical path of CDCT3. To reduce the effect of the controller delay, we insert one pipeline register (i.e. CW register) in front of the CMem. The new architecture (CDCT4) can run much faster at the clock frequency of 147MHz. Table 9 shows a reduction in the critical path delay. On the downside however, the number of cycles of DCT increases to 3080 because of an extra branch delay cycle. Note that the NISC compiler

2005

"... In PAGE 4: ...able 7- Critical-path delay breakdown of CDCT1................................................................................19 Table8 - Critical-path delay breakdown of CDCT2.... In PAGE 24: ...4MHz. The breakdown of critical path delay ( Table8 ) shows a considerable reduction in the delay of the comparator. Also, the number of fanouts of RF output wires is reduced, and hence its interconnect delay is reduced.... ..."

### Table 14: Intra-Cluster Critical Data Forwarding During Cluster Migration With Pinning No Pinning

2003

"... In PAGE 22: ... The purpose of pinning the instructions is to reduce instructions from oscillating between clus- ters and to increase the amount of intra-cluster forwarding for critical data dependencies. The change in intra-cluster forwarding can be seen in Table14 . Overall, pinning instructions increases the amount of same-cluster critical data forwarding for eight out of 12 benchmarks and by a small percentage overall (60.... ..."

Cited by 1

### Table 1: Universality Classes of N = 2 SCFTs based on SU(2) Gauge TheoryWe note that in the cases Nf 2 there appear Casimir operators Cj as- sociated with the global avor symmetry group SU(Nf) with the dimensions [Cj] = j. Let us now turn to the case of the SU(Nc) theory and start presenting our results. We consider the case of Nf matter hypermultiplets in vector representations with a common mass m. (We may add extra avors with di erent masses, however, at critical points this amounts only to shifting the rank Nc of the group). The curve is given by [9] C : y2 = C(x)2 ? G(x); (6)

"... In PAGE 9: ...points do not depend on Nc so far as 2Nc gt; Nf. In fact the dimensions of the relevant operator 1=2; 3=2 are exactly the same as in the case of Nc = 2 (see Table1 ). Thus they represent a universality class of N = 2 SCFTs with the global SU(Nf = odd) symmetry.... In PAGE 14: ...gauge groups dimensions MAr SU(r + 1),SO(2r + 1); Sp(2r) 2 e + 1 h + 2 e = 1; 2; ; r h = r + 1 MDr SO(2r) 2 e + 1 h + 2 e = 1; 3; ; 2r ? 3; r ? 1 h = 2r ? 2 Table 3: SCFTs based on N = 2 pure Yang-Mills theories rank 2: MA2 4=5; 6=5 rank 3: MA3 2=3; 1; 4=3 rank 4: 8 lt; : MA4 MD4 4=7; 6=7; 8=7; 10=7 1=2; 1; 3=2; 1 Note that there exist unique universality classes in rank 2 and 3 theories and they coincide with the SU(2) gauge theory with Nf = 1 and Nf = 2 avors, respectively (see Table1 ). At rank 4, there appear two universality classes and one of them, MD4, coincides with the Nf = 3; SU(2) theory.... ..."

### Table 5 presents the main characteristics of the two algorithms. The number of edges of graph G = (V, E) is equal to the size n of the set S of keys for the two algorithms. The number of vertices of G is equal to 1.15n and 2.09n for the new algorithm and the CHM algorithm, respectively. This measure is related to the amount of space to store the array g. The number of critical edges is 0.5|E| and 0, for the new algorithm and the CHM algorithm, respectively.

"... In PAGE 11: ... Table5 : Main characteristics of the algorithms. Table 6 presents time results for constructing MPHFs using the two algorithms.... ..."

### Table 1: Number of Critical Incidents Reported Per User -

"... In PAGE 3: ... low-severity incidents, as computed by collapsing the four-point scale used by the participants into two groups; and average time to report an incident, per session. RESULTS Data Analysis Participants reported a total of 360 critical incidents ( Table1 ). Most of the sessions took between one and three hours: 10-20 minutes of review and practice, 15-45 minutes working through tasks, the same amount of time watching the session videotape (retrospective participants only), and 30-60 minutes reporting incidents.... ..."

### Table 3. Computed critical points for mixtures of carbon dioxide (1) and n-hexadecane (2).

"... In PAGE 15: ...The critical states computed using the IN/GB method are given in Table3 for several different mixture compositions. The computation times reported here and in the other examples are actually quite good for a general-purpose approach offering a verified solution.... In PAGE 15: ...erified solution. This code (van Hentenryck et al., 1997) combines ideas from interval analysis, such as used here, with techniques from constraint satisfaction programming (CSP). On the first mixture in Table3 (n1 = 0.97), Numerica required 3947 s to find just the first critical point (Tc = 386K), and to allow this critical point to be found within this amount of time, it was necessary to start with a narrow initial interval of width only 10 K and 10 cm3 containing the critical point.... ..."