### Table 2 Three-dimensional structures of ribosomal proteins

1998

"... In PAGE 14: ... Someday, useful information may be gained by building these structures into low-resolution ribosome mod- els. Table2 lists the structures available, and Figures 6 and 7 display their topologies. Several conclusions have already emerged.... ..."

Cited by 2

### Table 1: An example of a three-dimensional table.

1993

"... In PAGE 3: ...Table1 has three categories, D1, D2 and D3; thus, it is a three-dimensional table. The logical relationship among the data items of a table is the association between labels and entries.... In PAGE 3: ... Each entry is associated with one or more sets of labels of di erent categories simultaneously. For example, in Table1 , entry e1 is associated with a set of labels fd11; d21; d311g simultaneously; entry e7 is associated with both fd12; d21; d312g and fd12; d22; d312g simultaneously. The data items and the logical relationship among them provide the logical structure of the table, which is the primary information that a table conveys and which is independent of its format.... In PAGE 6: ... This function guarantees that every entry in E is mapped from at least one ff1; ; fng 2 D1 n. Using this model, Table1 can be abstracted by (3; fD1; D2; D3g; E; ), where D1 = fd11; d12g D2 = fd21; d22; d23g D3 = fd31; d32g d31 = fd311; d312g d11 = d12 = d21 = d22 = d23 = d32 = d311 = d312 = fg E = fe1; e2; e3; e4; e5; e6; e7; e8; e9g (fD1:d11; D2:d21; D3:d31:d311g) = e1; (fD1:d11; D2:d21; D3:d31:d312g) = e2; (fD1:d11; D2:d22; D3:d31:d311g) = e3; (fD1:d11; D2:d22; D3:d31:d312g) = e3; (fD1:d11; D2:d23; D3:d31:d311g) = e4; (fD1:d11; D2:d21; D3:d32g) = e5; (fD1:d11; D2:d22; D3:d32g) = e5; (fD1:d11; D2:d23; D3:d32g) = e5; (fD1:d12; D2:d21; D3:d31:d311g) = e6; (fD1:d12; D2:d21; D3:d31:d312g) = e7; (fD1:d12; D2:d22; D3:d31:d312g) = e7; (fD1:d12; D2:d23; D3:d31:d312g) = e8; (fD1:d12; D2:d21; D3:d32g) = e9; (fD1:d12; D2:d22; D3:d32g) = e9; (fD1:d12; D2:d23; D3:d32g) = e9; 4.2 Basic operators in the tabular model We rst describe the syntax of all basic operators in function form by giving the operator identi ers and the types of their operands and results.... ..."

Cited by 2

### Table 2: Breakdown of the computational time for the rst three-dimensional rectangular structure simulation.

"... In PAGE 9: ...ase grid of 140 12 24 cells (cf. Fig. 16) and utilises between 1:3 M and 1:5 M cells, instead of 8:7 M cells like a uniformly re ned grid. Table2 clearly re ects the in- creased expense in solving the hydrodynamic equations in three space dimensions. After a settling time of about 20 periods, a regular cellular oscillation with identical strength in x2- and x3- direction can be observed.... ..."

### Table 9. Execution time (seconds) for Haskell versions with three-dimensional intermediate forms

1997

"... In PAGE 18: ... Peak heap use (in K bytes) for strict Haskell versions (Chalmers) 5.4 Time analysis Table9 shows the time performance of the codes that use three-dimensional interme- diate structures. Both Glasgow and Chalmers favor the selection/recursion code, and both show the copy versions performing worse than the selection versions.... ..."

Cited by 6

### Table 2. I/O Characteristics of the ROMIO three-dimensional block test

2003

"... In PAGE 7: ...locks. The memory datatype is contiguous. 0 10 20 30 40 50 60 70 80 90 100 0 10 20 30 40 50 60 70 Aggregate read bandwidth (Mbytes/sec) Compute processes (2 per node) DatatypeList Two-Phase Data SievingPOSIX 10 20 30 40 50 60 70 80 90 0 10 20 30 40 50 60 70 Aggregate write bandwidth (Mbytes/sec) Compute processes (2 per node) Datatype List Two-PhasePOSIX Figure 10. 3D block read and write perfor- mance Table2 characterizes the resulting I/O patterns using our tested optimizations, and Figure 10 shows the results of our tests. Again, datatype I/O is the clear performance winner; peak performance is more than double that of the next-best approach.... ..."

Cited by 10

### Table 2. I/O Characteristics of the ROMIO three-dimensional block test

2003

"... In PAGE 7: ...locks. The memory datatype is contiguous. 0 10 20 30 40 50 60 70 80 90 100 0 10 20 30 40 50 60 70 Aggregate read bandwidth (Mbytes/sec) Compute processes (2 per node) DatatypeList Two-Phase Data Sieving POSIX 10 20 30 40 50 60 70 80 90 0 10 20 30 40 50 60 70 Aggregate write bandwidth (Mbytes/sec) Compute processes (2 per node) DatatypeList Two-Phase POSIX Figure 10. 3D block read and write perfor- mance Table2 characterizes the resulting I/O patterns using our tested optimizations, and Figure 10 shows the results of our tests. Again, datatype I/O is the clear performance winner; peak performance is more than double that of the next-best approach.... ..."

Cited by 10

### Table 1: The number of iterations of the parallel domain decomposition algorithm required to solve a typical three-dimensional convection-diffusion problem in [12].

"... In PAGE 5: ... Furthermore, it is applied to a class of convection- diffusion equations in three dimensions that is not covered by the underlying theory in [3]. Nevertheless, it proves to be surprisingly robust, as illustrated by the iteration counts shown in Table1 that are typical of the results in [12]. Furthermore, very creditable parallel performances are recorded, including parallel speed-ups in excess of 12 when using locally refined ... In PAGE 5: ...Table 1: The number of iterations of the parallel domain decomposition algorithm required to solve a typical three-dimensional convection-diffusion problem in [12]. The iteration counts shown in Table1 illustrate that the number of iterations of the parallel solver that are required to obtain a converged solution is essentially independent of the level of the finest mesh and the number of subdomains used. Hence, provided the sequential solver used on each processor (at step 4 of the algorithm in Figure 4) has a computational cost of O(N), the total cost of the parallel algorithm will also be approximately proportional to N.... ..."

### Table 3. Three-dimensional K-optimal lattice rules

"... In PAGE 7: ... One sets NL = NU = Nopt. The list of rules in Table3 was obtained as follows. For each value of ,thesearch module was used with NU large and NL =max(NME(3; );NCL(3; )) as given in (1.... In PAGE 7: ... Finally, the list of matrices was processed to remove all symmetric equivalents. Note that, without the second run, one of the entries for each of = 5 and 11 in Table3 would have been missed. The 4-octahedron has eight facet-pairs.... In PAGE 12: ....2. Three-dimensional lattice rules. For every abscissa count we have listed, we have speci ed at least one cubature rule. Table3 contains speci cations of thirty- one K-optimal rules. This list is complete in the sense that every K-optimal rule of enhanced degree thirty or less is included here or is symmetrically equivalent to one listed here.... ..."

Cited by 2

### Table 1: The table shows heuristic estimates of the number of iterations and of the computational cost for BEM and for FEM. Based on these observations, we nd it interesting to consider the application of FEM for solving the Laplace equation in the three-dimensional water volume

"... In PAGE 25: ...84% 2.34% Table1 0: The table shows, for the test problem studied in section 6.2, maximum deviation of the computed total energy, obtained on di erent meshes, from the exact value.... ..."

### Table 1. Comparison of GWI apos;s for shortwave radiative forcing by sulfate aerosol evaluated with forcing calculated by box model and three-dimensional global model.

2006

"... In PAGE 8: ...rom the cloud forcing. Charlson et al.{Charlson, 1992 #9} estimate this forcing as -1 W m-2, but highly uncertain. For reference the corresponding contributions to GWI and aS are also given in Table1 . However in view of the uncertainty in estimating the cloud forcing, I use only the direct forcing due to clear-sky light scattering in comparisons with the CO2 forcing;... ..."