### Table 2: average distribution of the erroneous bits within the CLB tiles

"... In PAGE 4: ... However, a noticeable number of erroneous bits has also been observed in the logic configuration (including LUTs). Table2 summarizes the average distribution with respect to the elements controlled by the erroneous bits within a CLB tile. The configuration data for a given CLB are organized within 22 different frames.... ..."

### Table 2 Examples of estimated and measured bit error rates for embedded watermarks. (y: no bit errors observed for a watermark of length 10000 bit.) =

"... In PAGE 10: ...) = 1 p2 1 r 2 1erfc 2 p cr mean( i) p2 1 ! (11) and nally BER = 12 erfc 0 @ p pcr mean( i) p2 q 2 v + 2 v 1 A : (12) At the same time, the data rate RWM for the watermark is RWM = number of luminance pixels per second cr (13) Increase of chip-rate cr, average amplitude mean( i), or variance of the pseudo- noise signal p decrease the bit error rate; using a poor lter which does not remove the video signal from the watermarked video signal very well increases the bit error rate. Table2 gives a few examples for parameters used and the resulting bit error rates. It can be seen that bit error rates below 10?10 can easily be accomplished.... In PAGE 11: ...in the right column of Table2 . However, these estimations and experiments are valid only for embedding of watermarks into uncompressed video, and do not include the e ects of malicious attacks on the watermarks.... ..."

### Table 2 Probability estimates for 6-bit amp;.

"... In PAGE 6: ... Again, agreement between calculation and measurement is excellent. Figures 5 and 6 show similar experimental and theoretical calculations for the 6-bit a table ( Table2 ). As might be expected, the finer granularity of this table significantly decreases the coding inefficiency for stationary statistics.... In PAGE 10: ... The i circles are measured for pseudorandom data sets of fixed q. The 6-bit 1 Q, table ( Table2 ) is used with this multi-rate system. Consequently, the coding efficiency of the single-rate 6-bit Q, estimator is included 1 for comparison (solid line).... ..."

### Table 4-3: Sensitivity of the three adaptive segmentation methods to erroneous training data.

1988

"... In PAGE 28: ... Using the new segmentation for training data, we re-segment the image and iterate the process. Table4 -3 shows the average errors of the resulting segmentations after 1 and 2 iterations. Conclusions All three of these methods are clearly robust to random errors in the training data; even when the classifications are entirely random (half of the data is mislabeled), the adaptive methods converge to quite good results after only two iterations.... In PAGE 29: ...4 color(adaptive) 7.8 Table4 -2: Error magnitudes for some discriminant types 5 10 15 20 25 10 20 30 40 intensity color (fixed) color (adaptive) Figure 4-16: Plot of error magnitude for three discriminant types. Average error magnitude (in pixels)... In PAGE 31: ... Each of the three boundary following methods discussed have some advantageous charac- teristics. As shown in Table4 -1, the average accuracies of all three methods are roughly comparable in the alfalfa harvesting domain, slightly favoring the step function method. The lack of tuning parameters, simplicity, flexibility of its output model, rapid running time, and efficient memory usage of the step-function based method have made it our method of choice for the Demeter system.... In PAGE 34: ...6 Bayesian 9.3 Table4 -1: Average error magnitudes for boundary sensing methods. 5 10 15 20 25 10 20 30 40 50 60 70 curvature hypothesis Bayesian step function Figure 4-13: Error plot for three boundary sensing methods.... In PAGE 35: ... Results from this experiment are plotted in Figure 4-13, which shows error statistics for each of these methods. The results are summarized in Table4 -1; the actual images can be... ..."

### Table 9: Memory requirements operation code size table size work area remarks

2000

"... In PAGE 13: ...58 (unit: Mbps @ 550MHz) 3.4 Memory evaluation Table9 shows the memory requirements, where the key scheduling part contains key generation codes and operation loops for respective key sizes: 128, 192, 256 bits, and where the loop of round function is not expanded. Work areas of respective processes are roughly estimated as 80 bytes, because 20 32-bit words are used in C language description.... ..."

### Table 13 Two erroneous tuple discovered

"... In PAGE 17: ...alues specified by Eq. (16). What seems unnatural is that the support of func- tion (1) is not 100% as it should be. We found the following two tuples listed in Table13 that were identified as the outliers. They are indeed the tuples with errors contained in the original data: both tuples have incorrect value of GST amount.... ..."

### Table 1: Comparison of Parity Codes In high-speed memories, single-bit error-correcting and double-bit error-detecting (SEC-DED) codes are most commonly used. The data before writing to the memory are passed to a parity generator. The generated parity bit (or bits) is (are) then stored in the memory together with the data. On read operation the data bits are passed into the parity checker that regenerates the parity bit (or bits) and compares it with the parity bit(s) stored in the memory when the original data were written to the memory. The single-bit parity code has a minimum Hamming distance of two. The following description brings more details on Hamming codes. In Hamming single-error correction code, c parity bits are added to a k-bit data word, forming a code word of k+c bits. The following expression can be used to determine number of necessary check (parity) bits to protect k bits of information:

"... In PAGE 10: ... 10 computers to check errors in busses, memory, and registers. Table1 compares parity codes for memories. Five strategies for calculating parity are considered: (1) bit-per-word parity, (2) bit-per- byte, (3) bit-per-multiple-chips, (4) bit-per-chip, and (5) interlaced parity.... ..."

### Table 1: Comparison of Parity Codes In high-speed memories, single-bit error-correcting and double-bit error-detecting (SEC-DED) codes are most commonly used. The data before writing to the memory are passed to a parity generator. The generated parity bit (or bits) is (are) then stored in the memory together with the data. On read operation the data bits are passed into the parity checker that regenerates the parity bit (or bits) and compares it with the parity bit(s) stored in the memory when the original data were written to the memory. The single-bit parity code has a minimum Hamming distance of two. The following description brings more details on Hamming codes. In Hamming single-error correction code, c parity bits are added to a k-bit data word, forming a code word of k+c bits. The following expression can be used to determine number of necessary check (parity) bits to protect k bits of information:

"... In PAGE 10: ... 10 computers to check errors in busses, memory, and registers. Table1 compares parity codes for memories. Five strategies for calculating parity are considered: (1) bit-per-word parity, (2) bit-per- byte, (3) bit-per-multiple-chips, (4) bit-per-chip, and (5) interlaced parity.... ..."

### Table 13: Two erroneous tuple discovered

1998

"... In PAGE 21: ... What seems unnatural is that the support of Function 1 is not 100% as it should be. We found the following two tuples listed in Table13 that were identified as the outliers. They are indeed the tuples with errors contained in the original data: Both tuples have incorrect value of GST amount.... In PAGE 22: ...hich is the same as Function 6. When A5 = 0, A8 = 0, and Function 6 still holds. Because the original data only has two tax rates and one of which is zero, Function 6 can be obtained without partitioning the data. Again, there are two outliers because the tax amount in the two tuples shown in Table13 is not correctly calculated based on the regulations. 5.... ..."

### Table 2 Estimated Generalization Error (%)

1998

"... In PAGE 3: ... The result is given in table 2. Table2 Average Number of Terminal Nodes Data Set CART CPD-CART sonar 12.4 19.... In PAGE 3: ...6 34.2 Table2 shows that using CPD-CART generally resulted in larger trees. But the story is not universal.... ..."

Cited by 5