### Table 1: Experiments on embedding a polygon in three half-planes.

1996

"... In PAGE 20: ... The number of possible poses for the polygon to be embedded in these generated half-planes was then computed, and the summarized results for all group are listed in the last two columns of the table. Table1 tells us that three half-planes are insu#0Ecient to limit all possible poses of an embedded polygon to a unique one, namely, the real pose; in fact the table suggests that... In PAGE 22: ... The ratio between these two squares #28circles#29 was set uniformly to be 1 2 for all seven groups of data. In contrast to Table1 , Table 2 tells us that two cones allowaunique pose of an inscribed polygon in most cases. In each group of tests, only cases with one pose or two poses occurred, and the mean of possible poses stayed very close to 1, independent of the mean polygon size.... ..."

Cited by 19

### Table 1: Experiments on embedding a polygon in three half-planes.

1996

"... In PAGE 15: ... The number of possible poses for the polygon to be embedded in these generated half-planes was then computed, and the summarized results for all group are listed in the last two columns of the table. Table1 tells us that three half-planes are insu#0Ecient to limit all possible poses of an embedded polygon to a unique one, namely, the real pose; in fact the table suggests that a linear #28in the size of the polygon#29 number of possible poses will usually exist. We can see in the table that despite the appearances of cases with one or two possible poses, the ratio between the mean of numbers of possible poses and mean polygon size lies in the approximate range 0.... In PAGE 17: ...squares #28circles#29 was set uniformly to be 1 2 for all seven groups of data. In contrast to Table1 , Table 2 tells us that two cones allowaunique pose of an inscribed polygon in most cases. In each group of tests, only cases with one or two poses occurred, and the mean of possible poses stayed very close to 1, independent of the mean polygon size.... ..."

Cited by 19

### Table 1: Experiments on embedding a polygon in three half- planes.

"... In PAGE 6: ... The number of possible poses for the polygon to be embedded in these generated half-planes was then computed, and the summarized results for all group are listed in the last two columns of the table. Table1 tells us that three half-planes are insufficient to limit all possible poses of an embedded polygon to a unique one, namely, the real pose; in fact the table suggests that linear (in the size of the polygon) number of possible poses will usually exist. We can see in the table that despite the appearances of cases with one or two possible poses, the ratio between the mean of numbers of possible poses and mean polygon size lies in the approximate range 0.... In PAGE 7: ... The ratio between these two squares (circles) was set uniformly to be 1 2 for all seven groups of data. In contrast to Table1 , Table 2 tells us that two cones allow a unique pose of an inscribed polygon in most cases. In each group of tests, only cases with one pose or two poses occurred, and the mean of possible poses stayed very close to 1, independent of the mean polygon size.... ..."

### Table 1: Experiments on embedding a polygon in three half- planes.

"... In PAGE 6: ... The number of possible poses for the polygonto be embedded in these generated half-planes was then computed, and the summarized results for all group are listed in the last two columns of the table. Table1 tells us that three half-planes are insufficient to limitall possible poses of an embedded polygon to a unique one, namely, the real pose; in fact the table suggests that linear (in the size of the polygon) number of possible poses will usually exist. We can see in the table that despite the appearances of cases with one or two possible poses, the ratio between the mean of numbers of possible poses and mean polygonsize lies in the approximate range 0.... In PAGE 7: ... The ratio between these two squares (circles) was set uniformly to be 1 2 for all seven groups of data. In contrast to Table1 , Table 2 tells us that two cones allow a unique pose of an inscribed polygon in most cases. In each group of tests, only cases with one pose or two poses occurred, and the mean of possible poses stayed very close to 1, independent of the mean polygon size.... ..."

### Table 1 summarizes the current status of the newly formulated problem of colored simultaneous embedding. A check indicates that it is always possible to simultaneously embed the type of graphs, a a23 indicates that it is not always possible, and a ? indicates an open problem.

2007

"... In PAGE 11: ... Table1 . k-colored simultaneous embeddings: results and open problems.... ..."

Cited by 3

### Table 1 summarizes the current status of the newly formulated problem of colored simultaneous embedding. A check indicates that it is always possible to simultaneously embed the type of graphs, a a23 indicates that it is not always possible, and a ? indicates an open problem.

2007

"... In PAGE 11: ... Table1 . k-colored simultaneous embeddings: results and open problems.... ..."

Cited by 3

### Table 2 Clustering coeSOcients of the market graph

2004

### Table 1: A summary of known results for online routing in plane graphs.

### Table 3-4 Test Sequence for Embedded D-Latch. Pattern No. 1 2 3 4 5 6 7 8 9 10 11 12

"... In PAGE 3: ... For the first step, a test that contains all four transitions can either start with 00 or 11, end with 00 or 11, or not start or end with either one. Table3 -1 shows the five possible cases. Consider the first case in Table 3-1.... In PAGE 3: ... Table 3-1 shows the five possible cases. Consider the first case in Table3 -1. If a sequence starts with 00, then the initial string of 0s must be followed by 1, implying that the sequence contains 001.... In PAGE 3: ... A similar analysis can be applied to the other set of sub-sequences. Table3 -1 Five cases of Transitions Sequences. Case Sequence Implied sub-sequences 1.... In PAGE 3: ... In this table, x indicates an unknown value, either 0 or 1, and * indicates a point that the output is not captured. From Table3 -2a, patterns 5a and 7a show two different outputs for the input CD=00, indicating different internal states. Pattern 6a causes a change in internal state.... In PAGE 3: ... Pattern 6a causes a change in internal state. Thus the flow table in Table3 -3a can be formed. Now, pattern 4b and pattern 5b show two different values for input CD=01, indicating different internal states.... In PAGE 3: ... Now, pattern 4b and pattern 5b show two different values for input CD=01, indicating different internal states. This is shown in Table3 -3b. Here, the output value is not known, since the connection between the states has not yet been identified.... In PAGE 3: ... According to the flow table, pattern 3c would set the machine to internal state A even though no output is observed. Since patterns 4c and 5c do not cause a change in state, the machine must be in state A after pattern 5c is applied, making the A,01 entry of the flow table 0, which in turn makes the B,01 entry of the flow table 1 (see Table3 -3c). Now, pattern 8c must keep the machine in state B since the output is 1.... In PAGE 3: ... The final flow table is shown in Table 3-3d. Table3 -2 Test Sub-Sequences Applied to Embedded D- latch. a) Test Sub-Sequence 100.... In PAGE 3: ... Pattern No. 1c 2c 3c 4c 5c 6c 7c 8c 9c 10c Sequence 0 1 C 0 0 1 0 0 1 0 0 D x 0 0 0 1 1 1 x Q * x * * 0 * * 1 Table3 -3 Flow Table Fragments. a) From Table 3-2.... In PAGE 3: ... d) Final Table. CD CD 00 01 11 10 00 01 11 10 A A ,0 A ,0 A A A ,0 A ,0 B A B B ,1 B ,1 A B B ,1 B ,1 B A The flow table in Table3 -3d is not complete since the outputs have not been identified when C=1. The non- overlapping constraints make it impossible to propagate the outputs when C=1 to the primary outputs.... In PAGE 4: ...Figure 3-3 Waveforms Illustrating Testing of All Embedded Latches. The five capture points in the d4 waveform (p4, p6, p8, p10, p12) correspond exactly to the five capture points of the test in Table3 -4. This can be seen by looking at the values of d3 and d4 at the capture points and comparing them with the D and Q values of Table 3-4.... In PAGE 4: ... The five capture points in the d4 waveform (p4, p6, p8, p10, p12) correspond exactly to the five capture points of the test in Table 3-4. This can be seen by looking at the values of d3 and d4 at the capture points and comparing them with the D and Q values of Table3 -4. For example at p4, d3=1, and d4=0.... In PAGE 4: ... For example at p4, d3=1, and d4=0. This matches with pattern 3 of Table3 -4. The capture points in all the other waveforms also correspond to the capture points of the test in Table 3- 4.... In PAGE 4: ... The simulations reported here record whether tests caused excessive supply current as well as incorrect outputs. The results are shown in Table3 -5. In spite of the fact that the exhaustive tests were generated to verify the functionality of the latches, the table shows that, in addition to detecting functional faults, they are very useful in detecting faults that only cause excessive current.... In PAGE 4: ... D Q C M8 M4 M9 M3 M6 M1 M2 M5 C C M7 M0 Vdd Vdd Vdd C C C Q N1 Figure 3-4 Transmission Gate D-Latch. Table3 -5 Fault Simulation Results (67 Faults). Test Type Miss Volt Alone Current Alone Minimum Length 3 47 61 Embedded 1 49... ..."

### Table 3: Modulo graph embedding results for the dedicated register file CGRA.

2006

"... In PAGE 9: ... This shows that the modulo graph embedding scheduler is able to achieve quality solutions for significantly lower cost CGRAs. The modulo scheduler runtimes (last column of Table3 ) are rea- sonably fast, as all benchmarks are scheduled within 5 seconds on a 3 GHz Pentium-4 machine with 1G of RAM. This is because the search space is limited to operations in the DFG with the same height; thus, fewer than 20 operations are generally considered at a time.... ..."

Cited by 5