### Table 5 shows the one way latencies for five different ping-pong micro-benchmarks: three that use GM alone, one that uses CL, and one that uses reliable CL. The first

in Design and Validation of Portable Communication Infrastructure for Fault-Tolerant Cluster Middleware

### Table 5.2: Summarized tracking results for the development level 0 (non-adaptive integration). Sequences movie01, movie03 and movie22 are in a range which might be acceptable although not reliable. The other ones show poor tracking capabilities.

### Table 1 We are currently programming the GMRZ and also lling up the void places in Table 1. In particular, it will be interesting to derive the algorithm based on L anczos/Orthodir for treating near{breakdowns in the CGS, since this algorithm is the only reliable one for implementing L anczos method. The ideas developed in this paper only became clear after programming the algorithms and testing them on many numerical examples, which shows once more, if necessary, that, as stated by P. Wynn [56]

"... In PAGE 9: ... FORTRAN subroutines corresponding to some of these algorithms can be found in [15] together with numerical examples; see also [10, 16]. Let us mention that Gutknecht proposed an unnormalized version of the BIORES algorithm for curing ghost breakdowns in the BIORES by using a three{term recurrence relationship and, by squaring it, he obtained the unnormalized BIORES2 for treating ghost breakdowns in the CGS [30] (these algorithms will be respectively denoted by uBIORES and uBIORES2 in Table1 below). Another procedure for treating breakdowns in the classical L anczos algorithm is described in [4].... ..."

### Table 8 Reliability of CITIDEL services

"... In PAGE 25: ... Example of use. Table8 shows reliability figures for the most popular services of CITIDEL, according to a log analysis done on April 1, 2004. The low reliability for the structured searching service can be explained by the fact that it was an experimental one, which ran only for a short period of time.... ..."

### Table 1. Experimental results with transductive reliability estimation on 14 domains and 6 ML algorithms, obtained with leave one out testing.

2002

Cited by 9

### Table II: w as a function of p and . w is the number of \standard deviations quot; one must go above the mean to get a reliability of p.

1997

### Table 5 Low Reliability Precincts

"... In PAGE 13: ...ounties. The precinct-level results have been posted on the Miami Herald web site [30]. To evaluate the usefulness of the data reliability calculations, we have examined the number of undervotes and the resulting change in the gap between the candidates for the precincts having the highest and the lowest reliability degrees (see Tables 5 and 6 below). The total number of undervotes in 20 precincts having the lowest reliability degrees ( Table5 ) is much larger than the number of undervotes in 20 precincts with highest reliability (Table 6). In other words, starting the count of undervotes in low reliability precincts would help to detect significant gaps, like the one in Precinct No.... ..."

Cited by 1

### Table 6 High Reliability Precincts

"... In PAGE 13: ...ounties. The precinct-level results have been posted on the Miami Herald web site [30]. To evaluate the usefulness of the data reliability calculations, we have examined the number of undervotes and the resulting change in the gap between the candidates for the precincts having the highest and the lowest reliability degrees (see Tables 5 and 6 below). The total number of undervotes in 20 precincts having the lowest reliability degrees (Table 5) is much larger than the number of undervotes in 20 precincts with highest reliability ( Table6 ). In other words, starting the count of undervotes in low reliability precincts would help to detect significant gaps, like the one in Precinct No.... ..."

Cited by 1

### Table 3. This table shows the mean and standard deviation, over generations 50-150 of the GA, of the cost and reliability functions for GA strategy one, and varying number of offspring (10, 20, and 50). We use generations 50-150 as by generation 50 the GA has optimized the network to a fitness plateau (not shown). Note that our measure of reliability has a maximum achievable value of one.

2004

"... In PAGE 8: ....4. Number of offspring for GA strategy one Here we considered what happens if we change the number of offspring produced at each step of GA strategy one. The results are shown in Table3... ..."