### Table 2. Demographic Profi le

### Table 1 Advantages and disadvantages of proteomic technologies for protein profi ling

### Table 5: Storage requirements and elapsed solution time for vari- ous problem sizes using a complex-symmetric pro le solver (with- out pivoting) on a Sun SPARCstation10. Mesh (Unknowns) Storage (Mbytes) Solution time (min:s)

1995

"... In PAGE 26: ... very e ective for sequential machines. Table5 presents the storage requirements and elapsed times for performing direct solution of various problem sizes using a complex-symmetric pro le solver. A compar- ison of these direct solution times with iterative solution times presented in Tables 3-4 demonstrates that even for large two-dimensional problems, iterative solution using hierarchical basis preconditioners is faster by about 3 to 6 times depending on the frequency of analysis.... ..."

Cited by 8

### Table 3: Elapsed time for performing various operations in each iteration of complex- symmetric QMR on a Sun SPARCstation10, and total solution time at kd = =6. Mesh (Unknowns) Preconditioner

1995

"... In PAGE 23: ... In order to compare the computational performance of various preconditioners, we summarize elapsed times required for performing the matrix-vector product, the preconditioning steps and the overall time spent within each iteration of QMR. Table3 presents such a summary of elapsed times for various preconditioners on a Sun Sparc10 workstation. The computation of matrix-vector products was performed using the element-by-element procedure described in section 6.... ..."

Cited by 8

### Table 4. Complexity of skeptical inference w.r.t. LE from COMP(B).

### T a b le 1 A minimum matching has to be found, for example using the algorithm for minimum perfect matching with time complexity

### Table 4: The pro le of the example query in Figure 4.

1995

"... In PAGE 14: ...f including a relation into the query plan (i.e., choosing a maximal value from q values) is O(q), the complexity of heuristic MW is thus O(q2), where q is the number of relations in the query. To illustrate heuristic MW, consider an example query of 7 relations whose pro le is given in Figure 4 and Table4 . We assume that a multiprocessor system of eight nodes is employed, where each node has 64K byte memory and the size of each tuple is assumed to be 100 bytes4.... ..."

Cited by 6

### Table 9: Code Complexity. The number of lines of code required to implement various aspects of an SDS are presented. For the In SDS component of the EOF tool, there are 2542 lines of code; roughly 1800 of those lines are shared among all le system types; the rest is le-system speci c.

"... In PAGE 14: ...2 Complexity Analysis We brie y explore the complexity of implementing soft- ware for an SDS. Table9 shows the number of lines of code for each of the components in our system and the case studies. From the table, one can see that most of the complexity is found in the EOF tool, the basic cache and hash tables, and the operation inferencing code.... ..."

### Table 9: Code Complexity. The number of lines of code required to implement various aspects of an SDS are presented. For the In SDS component of the EOF tool, there are 2542 lines of code; roughly 1800 of those lines are shared among all le system types; the rest is le-system speci c.

"... In PAGE 14: ...2 Complexity Analysis We brie y explore the complexity of implementing soft- ware for an SDS. Table9 shows the number of lines of code for each of the components in our system and the case studies. From the table, one can see that most of the complexity is found in the EOF tool, the basic cache and hash tables, and the operation inferencing code.... ..."