References

1. S. Nasar, A Beautiful Mind, Touchstone/Simon and Schuster, New York, 1998.
2. R. Lougee-Heimer, “The Common Optimization INterface for Operations Research: Promoting Open-Source Software in the Operations Research Community,” IBM J. Res. & Dev. 47, No. 1, 57–66 (2003, this issue).
3. F. G. Gustavson, “Recursion Leads to Automatic Variable Blocking for Dense Linear-Algebra Algorithms,” IBM J. Res. & Dev. 41, No. 6, 737–755 (1977).
4. F. G. Gustavson, “High-Performance Linear Algebra Algorithms Using New Generalized Data Structures for Matrices,” IBM J. Res. & Dev. 47, No. 1, 31–55 (2003, this issue).
5. C. V. Apte, S. J. Hong, R. Natarajan, E. P. D. Pednault, F. A. Tipu, and S. M. Weiss, “Data-Intensive Analytics for Predictive Modeling,” IBM J. Res. & Dev. 47, No. 1, 17–23 (2003, this issue).
6. R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A. I. Verkamo, “Fast Discovery of Association Rules,” Advances in Knowledge Discovery and Data Mining, U. M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy, Eds., AAAI/MIT Press, Cambridge, MA, 1996, pp. 307–328.
7. S. J. Hong, “R-MINI: An Iterative Approach for Generating Minimal Rules from Examples,” IEEE Trans. Knowledge & Data Eng. 9, No. 5, 709–717 (1997).
8. C. Apte, E. Bibelnieks, R. Natarajan, E. P. D. Pednault, F. Tipu, D. Campbell, and B. Nelson, “Segmentation-Based Modeling for Advanced Targeted Marketing,” Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (SIGKDD), 2001, pp. 408–413.
9. C. V. Apte, R. Natarajan, E. P. D. Pednault, and F. A. Tipu, “A Probabilistic Estimation Framework for Predictive Modeling Analytics,” IBM Syst. J. 41, No. 3, 438–448 (2002).
10. C. Apte, E. Grossman, E. P. D. Pednault, B. Rosen, F. Tipu, and B. White, “Probabilistic Estimation Based Data Mining for Discovering Insurance Risks,” IEEE Trans. Intell. Syst. 14, No. 6, 49–58 (1999).
11. R. Anbil, J. J. Forrest, and W. R. Pulleyblank, “Column Generation and the Airline Crew Pairing Problem,” Documenta Mathematica, Journal der Deutschen Mathematiker Vereinigung, Extra Volume ICM III (Invited Lecture at International Congress of Mathematicians, Berlin, 1998), pp. 677–686.
12. A. Bar-Noy, R. Bar-Yehuda, A. Freund, J. Naor, and B. Schieber, “A Unified Approach to Approximating Resource Allocation and Scheduling,” J. ACM 48, No. 5, 1069–1090 (2001).
13. A. Bar-Noy, S. Guha, Y. Katz, J. Naor, B. Schieber, and H. Shachnai, “Throughput Maximization of Real-Time Scheduling with Batching,” Proceedings of the 13th ACM–SIAM Symposium on Discrete Algorithms, 2002, pp. 742–751.
14. M. X. Goemans and D. P. Williamson, “0.878-Approximation Algorithm for MAX-CUT and MAX-2SAT,” Proceedings of the 26th Annual ACM Symposium on the Theory of Computing, 1994, pp. 422–431.
15. M. Shub, Editorial, Foundations of Computational Mathematics 1, No. 1, 1–2 (2001).
16. L. R. Bahl, F. Jelinek, and R. L. Mercer, “A Maximum Likelihood Approach to Continuous Speech Recognition,” IEEE Trans. Pattern Anal. & Machine Intell. PAMI-5, 179–190 (1983).
17. F. Jelinek, Statistical Methods for Speech Recognition, The MIT Press, Cambridge, MA, 1997.
18. D. E. Johnson, F. J. Oles, T. Zhang, and T. Goetz, “A Decision-Tree-Based Symbolic Rule Induction System for Text Categorization,” IBM Syst. J. 41, No. 3, 428–437 (2002).
19. M. Martens and T. J. Nowicki, “Ergodic Theory of One-Dimensional Dynamics,” IBM J. Res. & Dev. 47, No. 1, 67–76 (2003, this issue).
20. C. Pugh and M. Shub, “Stable Ergodicity and Julienne Quasi-Conformality,” J. European Math. Soc. 2, 1–52 (2000).
21. K. Burns, C. Pugh, M. Shub, and A. Wilkinson, “Recent Results About Stable Ergodicity,” Proceedings of Symposia in Pure Mathematics, Vol. 69—Smooth Ergodic Theory and Its Applications, A. Katok, R. de la Llave, Y. Pesin, and H. Weiss, Eds., American Mathematical Society, Providence, RI, 2001, pp. 327–366.
22. R. L. Adler, B. P. Kitchens, M. Martens, C. P. Tresser, and C. W. Wu, “The Mathematics of Halftoning,” IBM J. Res. & Dev. 47, No. 1, 5–15 (2003, this issue).
23. P. L. Bernstein, Against the Gods, the Remarkable Story of Risk, John Wiley & Sons, Inc., New York, 1996.
24. M. Crouhy, D. Galai, and R. Mark, Risk Management, McGraw-Hill Book Co., Inc., New York, 2001.
25. X. Guo, “Information and Option Pricing,” J. Quantitative Finance 1, No. 1, 38–44 (2001).
26. D. L. Jensen and A. J. King, “Frontier: A Graphical Interface for Portfolio Optimization in a Piecewise Linear-Quadratic Framework,” IBM Syst. J. 31, No. 1, 62–70 (1992).