### Table 1: Convergence rates for several = ( 1; 2)T for uniform re nement (upper) and adaptive re nement (lower). 4. References 1 Bank, R.E., Dupont, T.F., Yserentant, H.: The hierarchical basis multigrid method. Numer. Math. 52, 427-458 (1988) 2 Bank, R.E., Gutsch, S.: Hierarchical basis for the convection-di usion equation on unstructured meshes. Ninth Interna- tional Symposium on Domain Decomposition Methods for Partial Di erential Equations (P. Bj rstad, M. Espedal and D. Keyes, eds.), J. Wiley and Sons, New York, (1996) to appear 3 Bank, R.E., Gutsch, S.: The generalized hierarchical basis two-level method for the convection-di usion equation on a regular grid. submitted to the Proceedings of the 5th European Multigrid Conference in Stuttgart (1996) 4 Bank, R.E., Xu, J.: The hierarchical basis multigrid method and incomplete LU decomposition. Seventh International Symposium on Domain Decomposition Methods for Partial Di erential Equations (D. Keyes and J. Xu, eds.), 163-173. AMS, Providence, Rhode Island (1994) 5 Reusken, A.A.: Approximate cyclic reduction preconditioning. Preprint RANA 97-02, Eindhoven University of Technology Addresses: Randolph E. Bank, Department of Mathematics, University of California at San Diego, USA Sabine Gutsch, Mathematical Seminar II, Christian-Albrechts-University Kiel, Germany

### Table 3 shows the initial results for the two scenarios compared to the results for the two

1997

"... In PAGE 15: ... Table3 . Analog Dial-in Subscriber Costs for 4 Scenarios.... ..."

Cited by 1

### Table V shows the values of K00(O) lim for different coding schemes. Comparing the 3 rightmost columns, we see that Theorem 2 results in the narrower range of information word lengths, while Theorem 3 provides the wider range and Theorem 4 results in an intermediate range. Moreover, we note that the stronger limitation of Theorem 2 corresponds to a generally tighter bound, while the weaker limitation of Theorem 3 corresponds to a looser bound. Finally, Theorem 4 features intermediate values. Since the computation of (23), (27) and (31) might be impractical due to the large number of values to be considered for w, we provide a simplification in the following corollary. Corollary 3: The minimum distance of a serially concatenated convolutional code satisfies the following inequal- ity:

2006

Cited by 1

### Table 2 Frequency (per 10,000 words) of stylistic features per gender per age bracket. (10s = 13-17; 20s = 23-27; 30s = 33-42). For all features (but post length) numbers are average of normalized per document frequency over all documents in class.

### Table 6.1. Maximum error with h = 1=N2; = h and no coarse mesh. The error for s = 1 is the error of the algorithm of [2]. The scheme is unstable when s is taken as an odd number. 12. M. Dryja, Substructure methods for parabolic problems, Fourth international symposium on Domain decompo- sition methods for partial di erential equations (R. Glowinski, Yuri Kuznetsov, G. A. Meurant, J. Periaux, O. Widlund, eds.), SIAM, Philadelphia, 1991, pp. 264{271. 13. M. Espedal, X.-C. Tai and N. Yan:, A hybrid domain decomposition method for advection-di usion problems, University of Bergen, Department of Mathematics, Report No. 102 (1996). 14.

### TABLE XI STUDENTS apos; VIEWS ON COMPUTER FA CILITIES How do you rate the facilities for using mathematical computer programs at your college?

### Table 2. International Undergraduate Computational Science Programs

"... In PAGE 7: ... International Undergraduate Programs Undergraduate computational science programs have also been developed outside of the United States. Table2 lists several representative programs at international universities. Table 2.... ..."

Cited by 2

### Table 4 Virtual Universities

"... In PAGE 39: ... These are online institutions that typically operate without brick-and-mortar campuses. The current private operators of online universities enroll less than 5 percent of all students in postsecondary distance education, although this number is growing rapidly[23] Perhaps the most successful-and one of the most controversial-of the new virtual institutions is the University of Phoenix Online ( Table4 ). Founded in 1976 by CEO John G.... In PAGE 41: ... quot;[32] Located in Englewood, Colo., Jones International University ( Table4 ) is the nation apos;s first fully accredited, exclusively online higher education institution. When JIU was accredited by North Central in March 1999, some 96 percent (54 out of 56) of its faculty members were hired on a part-time basis.... In PAGE 42: ... quot;[33] At a June 1995 meeting of the Western Governors Association, policymakers discussed the issue of population growth in the West and the potential for rapidly expanding enrollment at regional colleges and universities. In response, the governors created the Western Governors University ( Table4 ), one of the most highly publicized virtual universities created in the past few years. Organized as a joint project of 19 western states and Guam, WGU is a privately owned university that offers courses from a range of outside academic institutions and corporations.... In PAGE 42: ...[35] In September 2000, the state of Utah released an audit that criticized WGU for its low enrollment numbers, for withholding information from auditors, and for overcharging students for degree programs in comparison with other regional colleges and universities.[36] Capella University ( Table4 ), based in Minneapolis, is a private, virtual university geared toward adult professionals. Founded in 1993 by CEO Steve Shank, Capella has instituted faculty and student policies that are more in line with existing brickand-mortar institutions.... ..."

### Table 2 Mathematical Software Packages Utilized Mathematical

1999

"... In PAGE 4: ... Problem originally suggested by H. S. Fogler of the University of Michigan ** Problem preparation assistance by N. Brauner of Tel-Aviv University MATHEMATICAL PACKAGES USED IN THE COMPARISON Table2 lists the various mathematical software packages that were used in the solutions to the problem set and the individuals who kindly provided the solution set. These individuals had considerable experience with the software package that they utilized.... ..."

Cited by 1

### Table 1: Traditional vs. Partial Inlining: Amount of Inlining Achieved [7] K. D. Cooper, M. W. Hall, and L. Torczon, \Unexpected Side E ects of Inline Substitution quot;, ACM Letters on Programming Languages and Systems vol. 1 no. 1, March 1992, pp. 22{32. [8] J. W. Davidson and A. M. Holler, \Subprogram Inlining: A Study of its E ects on Program Execution Time quot;, IEEE Transactions on Software Engineering vol. 18 no. 2, Feb. 1992, pp. 89{102. [9] K. De Bosschere and S. K. Debray, \alto : A Link-Time Optimizer for the DEC Alpha quot;, Technical Report 96-15, Dept. of Computer Science, The University of Arizona, June 1996. [10] J. Dean and C. Chambers, \Towards Better Inlining Decisions using Inlining Trials quot;, Proc. 1994 ACM Conference on Lisp and Functional Programming, Orlando, Florida, June 1994, pp. 273{282. [11] R. E. Hank, Region-based Compilation, Ph.D. Dissertation, University of Illinois at Urbana-Champaign, 1996. [12] R. E. Hank, W. W. Hwu, and B. R. Rau, \Region-Based Compilation: An Introduction and Motivation quot;, Proc. 28th IEEE/ACM Symposium on Microarchitecture, Nov. 1995, pp. 158{168. 11

"... In PAGE 9: ... Partial inlining can be compared to traditional inlining along two dimensions: rst, the amount of inlining that can be achieved for a given \budget quot; of code growth; and second, the improvement in execution time. Table1 illustrates the rst dimension using three di erent budgets (a code growth factor of m% in this table indicates that each function is allowed to increase in size by at most m%). Three groups of data are shown for each benchmark program: the number of call sites expanded inline; the total number of basic blocks inlined across all of the call sites expanded; and the total number of instructions in these basic blocks.... ..."