### Table 5: Performance when provided only with non-identical fragments, with all other seg- ments identi ed.

1994

"... In PAGE 18: ... In such a case, the approximate length of the fragments are known, but not the multiplicity. For the experiments reported in Table5 , all fragments clustered together within the given grouping percentage were replaced by one instance of the mean length of these fragments. Thus, unlike our other tables, the problems get harder with increasing grouping percentage.... In PAGE 18: ... Thus, unlike our other tables, the problems get harder with increasing grouping percentage. The number of missing fragments is reported within parentheses in Table5 . All missing fragments were assumed to be multiple occurrences of existing fragments instead of unrestricted wildcards.... In PAGE 18: ... Five random instances of N base fragments were generated and subjected to a random relative error of r, where 10 N 20 and 0:0% r 2:5%. Table5 summarizes these experiments, by presenting the con dence interval with = 0:05 for the average running time in seconds. It clearly illustrates that the critical region is r = (1=n2), as is predicted by the theory.... ..."

Cited by 12

### Table 4: Number of tuples and non-identical dependency triples (types) extracted per de- pendency relation.

Cited by 1

### Table 3.1: Optimization results using identical and non-identical thresholds

2004

### Table 2 Comparison of Scenarios for Non-identical Firms with Different Cross Sensitivities.

2001

"... In PAGE 18: ... On the other hand, if the net effect is positive, Firm 2 generates higher profits under DC than CC and under DD than CD. We can observe this ordering of scenarios for Firm 2 in the example in Table2 . As the percentage of customers Firm 1 loses through lead-time competition is high, Firm 2 benefits from the longer lead-times quoted by a decentralized competitor and generates the highest profits under DC.... ..."

### Table A directed graph can be represented as an adjacency matrix, and an adjacency matrix allows the derivation of a routing table, using an adapted form of matrix algebra. The adjacency matrix shown in Figure 3 corresponds to the graph in Figure 2. As the name implies, an adjacency matrix shows all operations ef- fecting a transition between two adjacent nodes. Thus we can see that this matrix has non-zero, non-identity entries wherever a path of length 1 exists between two adjacent nodes. These entries contain a set of one or more atomic operations, each of which could be used to execute the required transition.

### Table 5: Results for real maps, without ltering out non-identical matches. The RMS calculation pairs up neighboring atoms and takes the average distance be- tween such pairs.

"... In PAGE 7: ... For example, there might be a good match of a Gln to an Asp with high density correlation that would be rejected in favor of the best Asp in the database, which might have a much lower correlation. Therefore, in Table5 we show results for constructing models for the real maps of crambin and avodoxin as we intended for TEXTAL. The models constructed now do not have the same amino acid sequences as the original structures.... ..."

### Table 1: Match Distribution for CMU-SCS Technical Report Data Set.

1996

"... In PAGE 7: ... This set consists of just over 30MB of text. Table1 gives the distribution of matches when each document is searched against all others. The number in parenthesis in the right hand column is the number of non-identical docu- ment matches (i.... ..."

Cited by 1

### Table 5, Fig 2, text: In the specialised setting, the cost of illnesses was $615. Also, in the non-specialised setting, the cost of illnesses was virtually identical at $614. Whereas, at baseline for the specialised setting, the cost of illnesses was $1235 compared to $962 in the non-specialised setting. Given that as stated by the authors that non-specialised populations tend to require less follow

2006

"... In PAGE 11: ...able 4 Study Characteristics multi-component hygiene studies.................32 Table5 Threats to validity, hand hygiene studies .... In PAGE 34: ... For full details see Appendix 12, page 97. Table5 , below and Table 6, page 35, highlight particular areas of study methodology identified from the quality assessment that were thought to be important threats to the validity of each study. HAND HYGIENE STUDIES Table 5 Threats to validity, hand hygiene studies Study ID Important threats to validity Implications A.... In PAGE 34: ... Table 5, below and Table 6, page 35, highlight particular areas of study methodology identified from the quality assessment that were thought to be important threats to the validity of each study. HAND HYGIENE STUDIES Table5 Threats to validity, hand hygiene studies Study ID Important threats to validity Implications A. Master 199775 1.... In PAGE 35: ... However, there were many methodological problems with the randomised hand hygiene trials, which have consequences on the validity of the trial outcomes. (See Table5 , page 33). The main problem with the trial by White and colleagues70 was the number of clusters excluded from the final analysis because of non-compliance issues.... In PAGE 59: ... The remaining studies were non randomised designs, and are therefore open to selection bias. Each study had individual problems that could have an effect on the internal validity of the study (see Table5 , page 33 amp; Table 6, page 35) therefore the results of this review should be treated with caution. 6.... ..."

### Table 3 shows the main characteristics of 3 problems taken from [15] and the performance of GENPACK (combined with SPG for solving the nonlinear decision subproblems (11)). Figure 5 illustrates the packings found. The decision problems (1) and (11) can also be extended to considerer k non-identical circles with radius r1, r2, . . . , rk as follows:

2003

"... In PAGE 15: ...1307835795 60 60 155 363.62 Table3 : Performance of GENPACK for packing circles into circles.... ..."

### Table 1: Expected case behaviour. The columns denote the ideal case, the case where the asynchrony j 6 = 0 and the case where the landmark sets are not identical, but each agent has d non-commonlandmarks.

2001

Cited by 16