### Table 21: A Measurement Study of Organizational Properties in the Global Electronic Mail Community

"... In PAGE 28: ... From the data they formed graphs where the nodes represent people, hosts, or administrative domains (depending on the level of detail desired in the graph) and the edges represent communication between nodes. Table21 gives the general measurement parameters. Among their results they found that at the macroscopic level the graph was very sparse.... ..."

### Table 1 E ect of Problem Size on Convergence Rate Note: Each two-grid MGCG method is implemented twice for a sample problem: once on a small mesh of 17;289 unknowns and once on a larger mesh of 126;225 unknowns. Variants of MGCG di er from each other in the number of coarse-grid relaxation passes. nl=ns is a measure of independence of each method from mesh size. Iterative

"... In PAGE 16: ...2, we were able to run the two-grid MGCG methods on two di erent mesh discretizations of the same problem. Table1 shows the number of iterations, ns and nl, necessary for the various methods (including DCG and ICCG) to reach convergence on the small problem (17,289 unknowns) and on the \large quot; problem (126,225 unknowns), respectively. For a method truly independent of mesh size, the ratio of these two, nl=ns, would be 1.... ..."

### Table 8. Desired Eigenvectors

"... In PAGE 12: ... The approach used to specify eigenvectors was to set each element of the eigenvector to be 0 or 1 as appropriate to achieve the desired decoupling of the aircraft rigid-body modes. Initial choices for eigenvectors were chosen as shown in Table8 . In this table, the quot;x quot; indicates elements not weighted in the cost function and therefore are free to be determined by the eigenspace assignment algorithm.... ..."

### Table 3: Desirability Specifications

### Table II Desired

### Tables 2 and 3 show timing results for Sobel edge de- tection with two different input image sizes. If we only partition the data arrays, the number of clock cycles are re- duced. However, the maximal frequencies after placement and routing are slower than our desired frequencies. In or- der to reduce memory accesses, optimization techniques such as scalar replacement for array elements and buffer insertion for data prefetching are utilized. In the smaller design, we finally achieve the 150 MHz design goal, and with a 46x speedup compared to the original design.

### TABLE 3 KEY FACTORS IN DECIDING METHOD OF DEBRIDEMENT

### Table 2: Possible Desires and Values in the Debate No. Desire Value Condition to be

2005

"... In PAGE 4: ... We also need to associate these desires with a value, and a degree to which the satisfaction of the desire promotes the value. For now we list the set of desires, conditions and val- ues in Table2 below and we will go on to discuss degrees of promotion in the next section. Based upon the beliefs and desires given in the above ta- bles, each agent can provide one or more instantiation of AS1.... ..."

Cited by 5