### Table 1: The distribution of haplotype blocks using LD measure of Zhu et al. [6]

2007

"... In PAGE 4: ...ttp://www.biomedcentral.com/1753-6561/1/S1/S149 The distributions of the blocks found by the approach in Zhu et al. [6] are given in Table1 . Most blocks have two to five markers.... ..."

### Table D-6 Median Meteorological Interpretation Ratings per Product for ZHU Users

2004

### Table 8: Ratio between the execution time of Zhu-Yew apos;s scheme and that of the CYT algorithm for 32 processors.

1994

"... In PAGE 28: ... Recall that Zhu-Yew apos;s scheme has the same applicability and requires the same system support as ours. To compare the two schemes, we show in Table8 the ratio between the execution time of Zhu-Yew apos;s algorithm and that of the CYT algorithm for 32 processors. Table 8: Ratio between the execution time of Zhu-Yew apos;s scheme and that of the CYT algorithm for 32 processors.... ..."

Cited by 35

### Table 4: Ratio between the execution time of Zhu-Yew apos;s scheme and ours using 32 processors.

1994

"... In PAGE 7: ... The results can also be applied to another scheme proposed by Mid- ki and Padua [7] because they use the same inspector algorithm and therefore have similar communication pat- terns. Table4 shows the ratio between the execution time of Zhu-Yew apos;s algorithm and ours for 32 processors. The table shows that our scheme is nearly always faster than Zhu-Yew apos;s.... ..."

Cited by 35

### Table 2. Retrieval performance considering support- ing documents. Runs MAP R-precision Bpref P@10 kmiZhu1 0.4421

### Table IV from Zhu et al. (2005) with the addition of our alignment results. Zhu et al. chose the following alignment examples to cover a broad range of structural classes. For each alignment, our method returned sequence ordered alignments. N is the number of aligned residues corresponding to each method and M% is the number of aligned residues generated by the corresponding algorithm that are equivalent to HOMSTRAD apos;s aligned residues.

2007

### Table 4.1: Summary of the four publicly available gene expression time-series data sets analyzed in this thesis. The first three data sets are from the work of Spellman et al [51], in which yeast cells were synchronized using three different methods. The fourth data set is from a study by Zhu et al [60], in which the genes fkh1 and fkh2, encoding transcriptional regulators, were knocked out.

2002

### Table 1: Convergence of the e ectivity indices for the three adaptive analyses. 4. REFERENCES [1] J. Barlow. Optimal Stress Locations in Finite Element Models. Int. J. Numer. Meths. Engrg., 10, 243{251 (1976). [2] T. Blacker and T. Belytschko. Superconvergent Patch Recovery with Equilibrium and Conjoint Inter- polant Enhancements. Int. J. Numer. Meths. Engrg., 37, 517{536 (1994). [3] N.-E. Wiberg, F. Abdulwahab, and S. Ziukas. Enhanced Superconvergent Patch Recovery Incorporat- ing Equilibrium and Boundary Conditions. Int. J. Numer. Meths. Engrg., 37, 3417{3440 (1994). [4] O. C. Zienkiewicz and J. Z. Zhu. The Superconvergent Patch Recovery and a posteriori Error Estimates. Part 1: The Recovery Technique. Int. J. Numer. Meths. Engrg., 33, 1331{1364 (1992). 4

"... In PAGE 4: ... In both of the latter analyses a bi-linear polynomial is assumed for the recovered stress eld over the patch of elements. In Table1 the convergence of the e ectivity indices, 1 and 2, are reported for the three analyses. These indices are de ned through 1 = v u u t 1 nel nel X e=1 ke ek keek ? 1 2 ; 2 = ke k kek where kek = v u u t nel X e=1 keek2 (14) ke ek and keek denote the energy norms of the estimated and exact errors, respectively, for element number e.... ..."

### Table 2: 2-MFP(45,5) with group order 8 [2] R.C. Bose, An a ne analogue of Singer apos;s theorem, J. Ind. Math. Soc. 6 (1942), 1-15. [3] A.R. Camina, A survey of the automorphism groups of block designs, J. Combinat. Des. 2 (1994), 79-100. [4] A.R. Camina and S. Mischke, Line{transitive automorphism groups of block designs, Electron. J. Combinat. 3 (1996), #R3. [5] D.H. Davies, Automorphisms of Designs, PhD Thesis, University of East Anglia, 1987. [6] J. Doyen, Two variations on a theme by de Bruijn and Erdos, Presentation at the Seventh Auburn Combinatorics Conference, Auburn AL, 1996. [7] D.L. Kreher, D.R. Stinson, and L. Zhu, On the maximum number of xed points in automorphisms of prime order of 2-(v,k,1) designs, Annals Combinat., to appear.

1998

"... In PAGE 4: ... The nal 19 blocks shown are the blocks xed by the automorphism. Table2 gives an alternate solution based on the other decomposable supersimple 2- (16; 4; 2) design that can be partitioned and signed. This 2-(16; 4; 2) design has group order 32, but once the signing and partitioning are chosen here, the resulting 2-(45,5,1) design has group order 8.... ..."