### Table 3.1: Cost Estimates for Light Pulser System Peter Eckstein, Martin Kocian, Klaus Schubert, Rainer Schwierz, Bernhard Spaan Dept. of Physics and Astronomy, University of Edinburgh,Edinburgh, UK Roland Bernet, Philip Clark, Steve Playfer Dept. of Physics, University of Liverpool, Liverpool, UK John Fry, Steve McMahon, Sean Colloby University of Bergen, Bergen, Norway Gerald Eigen Currently, the manpower devoted to the system includes 17 people, (6 Faculty, 7 PhD-Physicists and 4 PhD-Students), several of whom will be working full time on the light pulser:

### Table 3 (continued):

"... In PAGE 10: ...RUDOLF SCHARLAU, ALEXANDER SCHIEMANN, AND RAINER SCHULZE-PILLOT Table3 . Dimensions of spans of theta series Notation (l, n, G, Gh as above (Tables 1,2)).... ..."

### Table 1: Combination of Computer Science with different main professional field.

"... In PAGE 1: ... Likewise students who are enrolled at another university have the possibility to follow their secondary professional field at the Gerhard- Mercator University of Duisburg. Table1 shows the relation between the main professional fields and the... ..."

### Table 3 -- Agent Interaction Shown in Figure 4.

"... In PAGE 9: ... 4. A USAGE SCENARIO IMPLEMENTATION In Figure 4 and Table3 we illustrate the example gear transmission usage scenario, originally presented in (Gerhard, et al., 1999), as implemented in the PRE-RMI framework with integrated design, analysis, and RTTB software.... ..."

### Table 1. Some special cases of f .

"... In PAGE 10: ... For integer the generalized hypergeometric function in the de nition of f reduces to an ordinary hypergeometric function, which can be written in terms of elementary functions. Table1 lists f for the cases = ?1; ?2 and ?3, which have very simple forms. The case = ?4 is given in Appendix B of Dehnen amp; Gerhard (1994).... ..."

### Table 3. Signal transduction pathways in S.cerevisiae

2004

"... In PAGE 3: ... The Bio- chemical Pathways book by Gerhard Michal was used as a reference for all the annotation work (21). In addition to the metabolic pathways, information on 18 signal transduction pathways and composing sub-pathways is also provided (listed in Table3 ). This information is organized in a similar way as for the metabolic pathways except that all the interactions are modeled as specialized transformations, such as Expression (of genes), Assembly (of biochemical enti- ties), Translocation (of biochemical entities between cellular localization) and Reaction (mainly modifying biochemical entities).... ..."

### Table 2: Windowing code trace hit rate comparison of LRU, LRU/2, and 2Q.

"... In PAGE 6: ... We received a trace le containing 427,618 references to 290 256 byte pages. The results in Table2 show again that both LRU/2 and 2Q provide a signi cantly higher hit rate than LRU and Gclock. Trace Data from an On-line Transaction Pro- cessing System Gerhard Weikum supplied us with the trace he used to validate the performance of the LRU/2 algorithm [15], a one hour page reference trace to a CODASYL database.... ..."

### Table 2: Windowing code trace hit rate comparison of LRU, LRU/2, and 2Q.

"... In PAGE 6: ... We received a trace le con- taining 427,618 references to 290 256 byte pages. The results in Table2 show again that both LRU/2 and 2Q provide a signi cantly higher hit rate than LRU and Gclock. Trace Data from an On-line Transaction Processing System Gerhard Weikum supplied us with the trace he used to validate the performance of the LRU/2 algorithm [15], a one hour page reference trace to a CODASYL database.... ..."

### Table 3 lists a summary of their properties: column #vars shows the number of occurring variables, column #polys the number of elements (polynomials), column ho- mog gives the homogeneity, and Degs shows the maximal degree of the input sets. Degmax gives the maximal degree occurring during the GB computation w.r.t. the degree re- verse lexicographical ordering. The last column gives refer- ences to, our sources of these examples4. Those without a reference are from the collection of examples of the Singu- lar team. Finally, in the rest of this appendix, we completely list the all the used examples. cyclic n: [x1; : : : xn], n generators pk:

1998

"... In PAGE 12: ...I this appendix, we show some more details about the sets of polynomial we used for our GB computation test runs. Example #vars #polys homog Degs Degmax Ref ecyclic 7 43 7 no 7 27 ecyclic 6 31 6 no 6 17 rcyclic 10 i 19 i i?1 no i?1 bi=2c 2+4 homog 2mat3 19 8 yes 4 13 [14] 2mat3 18 8 no 4 13 homog gonnet 18 19 yes 2 11 [6] gonnet 17 19 no 2 11 [6] schwarz 11 11 11 no 2 13 schwarz 10 10 10 no 2 12 katsura 8 9 9 no 2 10 [13] katsura 7 8 8 no 2 9 [13] bjork 8 8 9 no 8 18 [5] homog cyclic 7 8 7 yes 7 20 [5] cyclic 7 7 7 no 7 27 [5] homog cyclic 6 7 6 yes 6 17 [5] cyclic 6 6 6 no 6 17 [5] homog alex 3 6 4 yes 14 51 alex 3 5 4 no 14 51 gerhard 1 5 3 yes 10 32 symmetric 6 5 5 yes 6 23 [12] homog alex 2 5 3 yes 12 40 cohn2 4 4 no 6 20 [14] alex 2 4 3 no 12 33 gerhard 2 4 3 yes 9 44 gerhard 3 4 3 yes 23 81 Table3 : Summary of properties of benchmark examples Table 3 lists a summary of their properties: column #vars shows the number of occurring variables, column #polys the number of elements (polynomials), column ho- mog gives the homogeneity, and Degs shows the maximal degree of the input sets. Degmax gives the maximal degree occurring during the GB computation w.... ..."

Cited by 4

### Table 1. Current bounds for algorithms scheduling jobs one by one with no constraints.

"... In PAGE 10: ... The analysis of all these algorithms is relatively complicated. The current state of our knowledge is summarized in Table1 . For comparison we include also the competitive ratio of List Scheduling.... In PAGE 14: ... It essentially tries to preserve the invariant above, with some special considerations for large jobs. Thus, in this model both deterministic and randomized cases are completely solved, giving the same bounds as the randomized lower bounds in Table1 . More- over, we know that randomization does not help.... In PAGE 17: ... Joel Wein observed that for preemptive open shop scheduling there exists a 2-competitive algorithm for arbitrary m. Gerhard Woeginger and the author ob- served that the randomized lower bound from the basic model which approaches e=(e ? 1) 1:5819 (see Table1 ) can be modi ed to work for open shop, too. 4.... ..."