### Table 1. Comparison of methods.

Cited by 1

### Table 1 Examples of acceptance

"... In PAGE 57: ... Results of multiple markers training using normal vector constraint To show the usefulness of the proposed system, we took a usability test on immersion with 9 volunteers. Table1 shows the results of quantitative measurement of immersion reducing factors. 5 reducing factors were investigated when users were playing the ARPushPush.... In PAGE 57: ... 5 reducing factors were investigated when users were playing the ARPushPush. Table1 . Quantitative measurement to analyze immersion reducing factors, average and standard deviation Immersion reducing factors Average (Max = 5) STD Unstable augmentation 4.... In PAGE 94: ... Differing from direct physical sensors the input properties must be extracted from noisy high-bandwidth image sequence. Table1 shows what properties can be derived from image sequences. In practice, the requirement of interaction techniques to operate in real-time with minimal lag is often in conflict with the high processing requirements of computer vision techniques, especially if local processing on a mobile device is intended, so only a subset of these possibilities can be used.... ..."

### Table 6.6: 1000144.col: Solve times in seconds using the FLAps 500 modification of march dl for two runs of nine different balanced approximated minimal cuts using hMeTiS. The actual balance, the size of the break set, the number of partition swaps and whether a satisfy- ing assignment for the variable break set could be found or not are given as well. 1000144.col is solved in 1.75 seconds using the unmodified march dl solver. balance

in or

2006

### Table 6.7: stanion 1617: Solve times in seconds using the FLAps 500 modification of march dl for five different balanced approximated minimal cuts using hMeTiS. The actual bal- ance, the size of the break set, the number of partition swaps and whether a satisfying assignment for the variable break set could be found or not are given as well. stanion 1617 is solved in 936.82 seconds using the unmodified march dl solver. balance

in or

2006

### Table 6.8: pmg 3939: Solve times in seconds using the FLAps 500 modification of march dl for five different balanced approximated minimal cuts using hMeTiS. The actual bal- ance, the size of the break set, the number of partition swaps and whether a satisfying assignment for the variable break set could be found or not are given as well. pmg 3939 is solved in 502.37 seconds using the unmodified march dl solver. balance

in or

2006

### Table 6.9: philips: Solve times in seconds using the FLAps 500 modification of march dl for five different balanced approximated minimal cuts using hMeTiS. The actual balance, the size of the break set, the number of partition swaps and whether a satisfying assignment for the variable break set could be found or not are given as well. philips is solved in 1438.46 seconds using the unmodified march dl solver. balance

in or

2006

### Table 6.10: anton 930: Solve times in seconds using the FLAps 500 modification of march dl for nine different balanced approximated minimal cuts using hMeTiS. The actual bal- ance, the size of the break set, the number of partition swaps and whether a satisfying assignment for the variable break set could be found or not are given as well. anton 930 is solved in 90.62 seconds using the unmodified march dl solver. balance

in or

2006

### Table 5. CPU Times for the SASA Calculations Using Different Methods and Amber95 Radii.

"... In PAGE 8: ... The benchmarks were performed on an SGI R10000/250 MHz processor using CH11001H11001 code optimized at the H11002mips4 H11002O3 level. Table5 shows the CPU times for the analytical and numerical SASA calculations using the Amber95 radii. One can see that our method requires about the same amount of time for the SASA calculation as the pairwise method of Hasel et al.... In PAGE 8: ...hey report a CPU time of 0.87 s for the SASA and its derivative. Our method takes 0.57 s for this molecule ( Table5 ). This makes their algorithm slightly slower than ours for this test case.... ..."

### Table 3 Suggestions for modifications to the Halstead Metrics for the measurement of the understandability of the text of requirements

"... In PAGE 6: ... However we need to determine if the measurement provides anything useful. The research question here is can we modify the Halstead Metrics or a similar metric to produce a metric for the understandability of requirements? A conceptual approach for developing a one-dimension formula is shown in Table3 . However, it is likely that we would need different word classification (grouping) and the understandability index would be based on a weighting formula or a multi-dimension metric, where different groups contribute different weights to the index in the manner of the Dale-Chall index (Dale and Chall, 1948) which counts sentence length and whether a word appears on a list of 3000 acceptable words (SRI, 2000).... ..."

### Table 4. Consequences of method modifications within a method CM system

"... In PAGE 10: ... Thereby, we have shown that these problems do not occur in any case, but under certain conditions. Table4 summarizes our ... ..."