Faculty Biographies

William Y. Arms
Professor
wya@cs.cornell.edu
D.Phil. University of Sussex U.K., 1973

My research interests concentrate on web information systems, digital libraries and electronic publishing. These fields integrate methods from many disciplines, so that the work ranges from technical topics, such as distributed computing and information representation, to the economic and social aspects of change. My book Digital Libraries was published by the MIT Press in winter 2000. This year we received a major grant to integrate many separate projects into the NSF's new digital library for science, mathematics, engineering and technology education. This is likely to be the largest and most heterogeneous digital library yet attempted. Cornell's multidisciplinary team combines computer science, librarian and user interfaces design expertise. One of my principal interests is the change in scientific publication as online materials replace printed journals as the primary means of creating, storing, and distributing research information. I have recently completed a period as chair of the ACM Publications Board, am a member of the MIT Press Management Board, and am a member of a strategic planning committee of the American Physical Society. As part of the NSF-funded Prism project, I am working with the Library of Congress to develop methods for long-term preservation of materials on the Web.


University Activities
Chair, Provost's Advisory Committee on Distance Education. Director, eCornell.
Member of the Faculty Senate, the Faculty Advisory Board on Information Technology, and the University Library Board.

Professional Activities
Publications Board, Association for Computing Machinery.
National Research Council study Issues for Science and Engineering Researchers in the Digital Age.
MIT Press, member of the Management Board and editor of the series on Digital Libraries and Electronic Publishing.

Lectures
The Impact of the Internet on Research Universities. National Science Foundation (April 13, 2001).
The National Science Digital Library Program. Coalition for Networked Information (April 9, 2001).
Quality Control in Scholarly Publishing. What are the Alternatives to Peer Review? Keynote, workshop on the
      Open Archives initiative and peer review journals in Europe, Geneva (March 22 - 24, 2001).
Minerva: The Web Preservation Project. Library of Congress (February 2, 2001).
Strategies for Collecting and Preserving Open Access Materials on the Web. Federal Library and Information
      Center Committee, Washington D.C. (December 7, 2000).
The Web as an Open Access Digital Library. Closing address, 2000 Kyoto International Conference on Digital
      Libraries: Research and Practice, Kyoto, Japan (November 15, 2000).
Open Access to Digital Libraries. Must Research Libraries be Expensive? Keynote address, European
      Conference on Digital Libraries, ECDL2000, Lisbon, Portugal (September 18, 2000).

Publications
"Uniform Resource Names: Handles, PURLs, and Digital Object Identifiers." Communication of the ACM,
      44(5):68 (May, 2001).
"Collecting and Preserving the Web: The Minerva Prototype." RLG DigiNews 5(2) (April2001). With Roger
      Adkins, Cassy Ammen, and Allene Hayes.
      (http://www.rlg.org/preserv/diginews/diginews5-2.html#feature1)
"An Architecture for Reference Linking." Technical Report TR 2000-1820,Computer Science Department,
      Cornell University (October, 2000). With Donna Bergmark, and Carl Lagoze.
"Automated Digital Libraries. How Effectively can Computers be used for the Skilled Tasks of Professional
      Librarianship?" D-Lib Magazine 6(7/8)(July/August, 2000).
      (http://www.dlib.org/dlib/july00/arms/07arms.html )
"Economic Models for Open-access Publishing." IMP(March,2000).(http://www.cisp.org/imp/march_2000
/03_00arms.htm). Digital Libraries. MIT Press, ISBN 0-262-01180-8, 2000.

Graeme Bailey
Professor
bailey@cs.cornell.edu
Ph.D. University of Birmingham U.K., 1977

Originally working in low-dimensional topology and combinatorial group theory, through an odd mixture of circumstances I have become actively involved in research in mathematics and medicine. One of two ongoing research projects in this area is the modeling of lung inflation, together with a research group at the Class One Trauma Center at Upstate Medical Univ., Syracuse, NY. This is in the early stages of a program to extend to various pathologies affecting elasticity and aimed towards effective clinical treatments. The group, now having made some significant advances in answering questions that had remained unsolved for over 30 years, is now in the process of trying to obtain reliable mathematical models. This involves building computer simulations of dynamic packing results under constrained perturbations and deformations. The other project is in understanding deformations of trans membrane proteins used in cell-signaling processes. This is a carefully constrained version of the protein-folding problems that have been exciting the mathematical biology community in recent years; the application of a topological viewpoint in collaborating with molecular pharmacologists and structural biologists has already yielded some intriguing insights.

Honors/Awards
Kenneth A. Goldman '71 Excellence in Teaching Award, 2000.

University Activities
Adjunct Professor; Mathematics.
Member, Fellowship Selection Committees: Rhodes, Marshall, Churchill, and Fulbright.
Member, WCHI-Development and Transition Committee.
Member, Donlon Fellows Development.
Member, Master of Engineering Committee.
Member, Cornell EMS.
Faculty Advisor, Judo Club.

Kenneth P. Birman
Professor
ken@cs.cornell.edu
http://www.cs.cornell.edu/ken/
Ph.D. University of California, Berkeley, 1981

My research is concerned with reliability and security in modern networked environments. This work has three broad themes. Our main focus is on a new system called "Spinglass" (http://www.cs.cornell.edu/Info/Projects/Spinglass ). The idea is to explore a class of reliable multicast protocols that are extremely scalable and provide unusually stable throughput under stress. We believe that stable throughput is a common requirement in demanding critical settings, but few reliable protocols have this property. By scalability, we mean that a system which works with ten computers should also be usable with ten thousand of them. Spinglass involves two subprojects. One, called Astrolabe, is concerned with a new way to represent data in a network. Astrolabe is like a network-wide database in which each computer or component contributes a live tuple. As data change, Astrolabe propagates the updates. The system uses a form of dynamically materialized view to continuously compute summaries of th epicture of the network as a whole. This results in a powerful new tool for distributed monitoring, management, control, and live collaboration. Robbert van Renesse is the leader on this work, and we're collaborating with Al Demers and Johannes Gehrke on aspects related to databases and data mining. The second big part of Spinglass is concerned with reliable multicast. We've developed a scalable multicast protocol that gives probabilistic consistency guarantees, and we are finding ways to apply this in practical settings. Graduate students looking at these questions include Indranil Gupta, who is developing algorithms that make direct use of probabilistic guarantees; Rimon Barr, who is looking at adapting these tools for mobile networks; and Ranveer Chandra and Venugopalen Ramasubramanian, who areinvestigating ad-hoc mobile networking. Kate Jenkins and Ken Hopkinson are looking at applications that arise when using these protocols in real-world settings arising from the restructuring of the electric power grid.
     Our third big activity is joint work with Bob Constable's Nuprl project, and involves the use of formal methods to prove properties of reliable communication protocols, such as those used in Isis, Horus, and Ensemble.
Our project is funded primarily by DARPA, with some additional funding from the Electric Power Research Institute and Microsoft Research. The project is directed by myself, R. van Renesse, and W. Vogels. R. Bhoedjang is visiting as a post-doc for a few years, and developing Intrusion Detection software to make use of Astrolabe.

Honors
Stephen '57 and Marilyn Miles Excellence in Teaching Award, 2000.

University Activities
Committees: Founding Committee for Faculty of Computing and Information Science; University Conflicts of Interest; Chairman of the Responsible Conduct of Research Committee, Engineering College Policy Committee; IP Advisory Council for the Cornell Research Foundation.

Lectures
Next Generation Internet: Unsafe at any Speed?
-. Keynote Speaker: ISDCS '01 (April, 2001).
-. University of Rochester (November, 2000).
-. IBM T.J. Watson Research Center (March, 2000).
-. Keynote: Middleware 2000.

Publications
"Technology Requirements for Virtual Overlay Networks." IEEE Systems, Man and Cybernetics: Special issue
     on Information Assurance (March, 2001).
"Next Generation Internet: Unsafe at Any Speed?" IEEE Computer, Special issue on Infrastructure Protection
     (Fall, 2000).
"Technology Challenges for Virtual Overlay Networks." IEEE Systems, Man, and Cybernetics Information
     Assurance and Security Workshop, West Point, New York (June 6-7, 2000).
"Optimized Group Rekey for Group Communications Systems." Networked and Distributed Systems Security
     2000, San Diego, California. (V). Extended version available as Cornell University, Computer Science TR99-
     1764. With Ohad Rodeh, and Danny Dolev.
"A Dynamic Light-weight Group Service." Journal of Parallel and Distributed Computing 60:1449-1479 (2000).
     With Luis Rodrigues, Katherine Guo, and Paulo Verissimo.
"A Gossip Protocol for Subgroup Multicast." International Workshop on Applied Reliable Group
      Communication (WARGC 2001), Phoenix, AZ (April, 2001). With Kate Jenkins.
"Providing Efficient, Robust Error Recovery through Randomization." International Workshop on Applied
     Reliable Group Communication (WARGC 2001), Phoenix, AZ (April, 2001). With Zhen Xiao.
"Anonymous Gossip: Improving Multicast Reliability in Ad-hoc Networks." International Conference on
     Distributed Computing systems (ICDCS 2001), Phoenix, AZ (April, 2001). With Ranveer Chandra and Vanogupalen Ramasubramanian.
"A Randomized Error Recovery Algorithm for Reliable Multicast." IEEE Infocom 2001 AK (April, 2001). With
     Zhen Xiao.
"Using Epidemic Techniques for Building Ultra-scalable Reliable Communications Systems." Workshop on
     New Visions for Large-scale Networks: Research and Applications, Vienna, VA (March, 2001). With
     Werner Vogels, and Robbert van Renesse.
"Optimizing Buffer Management for Reliable Multicast." Submitted to the 2nd Annual Workshop on Networked
     Group Communication (NGC 2000), Palo Alto, CA (November 8-10, 2000). With Zhen Xiao, and Robbert van
     Renesse.
"Throughput Stability of Reliable Multicast Protocols." ADVIS' 2000, Dokuz Eylul University, Izmir, Turkey
     (October 25-27, 2000). With Oznur Ozkasap.
"A Probabilistically Correct Election Protocol for Large Groups." DISC 2000, Toledo, Spain (October 4-6,
     2000). With Indranil Gupta, and Robbert van Renesse.

Publications-Landmark
"Bimodal Multicast." ACM Transactions on Computer Systems 17(2):41-88 (May, 1999). With M. Hayden, O.
      Ozkasap, Z. Xiao, M. Budiu, and Y. Minsky.
"A Probabilistically Correct Leadership Election Protocol for Large Groups." DISC-2000, Nov 2000, Toledo
      Spain. With I. Gupta and R. van Renesse.

Martin Burtscher
Assistant Professor
Member of the School of Electrical
and Computer Engineering and the Graduate Field of Computer Science
burtscher@csl.cornell.edu
http://www.csl.cornell.edu/~burtscher/
Ph.D. University of Colorado at Boulder, 2000

My research interests are high-performance micro-processor architecture, instruction-level parallelism, and compiler optimizations. In particular, I am exploring hardware- and software-based value prediction, data compression, and latency reduction techniques.
    The constantly widening speed gap between CPUs and memory is becoming more and more of a performance-limiting factor. In fact, current high-end microprocessors already spend a substantial amount of time waiting for memory accesses. To speed up program execution, the CPU needs to process useful instructions while waiting for the memory. One way of providing a processor with useful work is to predict what it will have to do next. Many commodity microprocessors already contain branch predictors to boost their performance, and it is likely that more predictors will be needed to meet the continuing demand for ever-faster CPUs. Designing, evaluating, and improving such predictors is an important focus of my research.
Ongoing projects include locating novel domains that can benefit from prediction, adding compiler support to aid and simplify the prediction hardware, devising means to reduce predictor sizes and power consumption without compromising performance, discovering as-of-yet unobserved patterns to build new predictors, and using value- prediction techniques to enhance branch-prediction accuracy and data-compression rates.

Lectures
Designing a High-performance Load-value Predictor. Hewlett-Packard Company (December, 2000).
The Evolution of a High-performance Load-value Predictor. Lockheed Martin Corporation (November, 2000).
The Design of a High-performance Load Value Predictor. Compaq Computer Corporation (October, 2000).
Hybridizing and Coalescing Load-value Predictors. International Conference on Computer Design (September,
     2000).
Predictability and Exploitability of Load Values. Microsoft Research (June, 2000).

Publications
"Hybridizing and Coalescing Load-value Predictors." International Conference on Computer Design, Austin, TX
     (September, 2000) :81-92. With B. Zorn.
"Exploring Last n Value Prediction." International Conference on Parallel Architectures and Compilation
     Techniques, Paris, France (October, 1999):66-76. With B. Zorn.
"Prediction Outcome History-based Confidence Estimation for Load-value Prediction." Journal of Instruction-
     level Parallelism1 (May 1999). http://www.jilp.org/vol1/  With B. Zorn.

Claire Cardie
Associate Professor
cardie@cs.cornell.edu
http://www.cs.cornell.edu/home/cardie/
Ph.D. University of Massachusetts
Amherst, 1994

My primary research areas are Natural Language Processing (NLP) and Machine Learning (ML) where we focus on developing corpus-based techniques for understanding and extracting information from natural language texts. In particular, my group investigates the use of machine learning techniques as tools for guiding natural language system development and for exploring the mechanisms that underlie language understanding. Our work encompasses three related areas: (1) machine learning of natural language, (2) the use of corpus-based NLP techniques to aid information retrieval (IR) and summarization systems, and (3) the design of user-trainable NLP systems that can efficiently and reliably extract the important information from a document.
In the past year or so we have made progress on both the natural language processing and machine learning aspects of our research. First, we have extended our approach to partial parsing of natural language texts to operate effectively in a weakly supervised learning framework. The original approach, developed with graduate students Scott Mardis and David Pierce, combines corpus-based grammar induction with a very simple pattern-matching algorithm and an optional constituent verification step. In evaluations on a number of large-scale partial parsing tasks involving on-line text, the approach produces partial parsers that are both fast and accurate.
    Unfortunately, however, large amounts of expensive, human-annotated data are required for training. In new work with David Pierce, we investigate the use of weakly supervised learning algorithms for partial parsing that require only a small set of labeled training instances. In particular, we examine the learning behavior of co-training, a weakly supervised learning paradigm in which the redundancy of the learning task is captured by training two classifiers using separate views of the same data. This enables bootstrapping from a small set of labeled training data via a large set of unlabeled data. For noun phrase bracketing, we find that co-training reduces by 36 percent the difference in error between co-trained classifiers and fully supervised classifiers trained on a labeled version of all available data. However, degradation in the quality of the bootstrapped data arises as an obstacle to further improvement. To address this, we propose a moderately supervised variant of co-training in which a human corrects the mistakes made during automatic labeling. Our analysis suggests that corrected co-training and similar moderately supervised methods may help co-training scale to other natural language learning tasks that typically require large amounts of training data.
In a joint project with CoGenTex Inc. and the University of Montreal, we have begun to extend existing corpus-based learning algorithms for information extraction to acquire a broader set of extraction patterns. We have implemented a new learning algorithm, Autoslog-XML, that can extract linguistic entities beyond just noun phrases. Autoslog-XML is a semi-supervised algorithm for locating useful extraction patterns from unrestricted text. The learned extraction patterns have been employed to support domain-specific multi-document summarization in the natural disasters domain. We have also begun to investigate the application of the extraction pattern learning algorithm for Korean texts. Graduate students Vincent Ng and Kiri Wagstaff are part of this joint research effort.
    The techniques described above can, in turn, be used to support a number of practical, end-to-end text-processing tasks in addition to multi-document summarization. For example, we are using the corpus-based partial-parsing techniques as the primary linguistic component in a new system for general-knowledge question answering. The system combines techniques for standard information retrieval, query-dependent text summarization, and shallow syntactic and semantic sentence analysis. In a series of experiments, we examined the role of each statistical and linguistic knowledge source in the question-answering system and find that even very weak linguistic knowledge can offer substantial improvements over purely IR-based techniques for question answering, especially when smoothly integrated with statistical preferences computed by the IR subsystems.
    Finally, in machine learning research with Kiri Wagstaff, we are investigating the use of prior knowledge in the form of user-supplied constraints to improve the performance of clustering algorithms.

University Activities
College Scholar Advisor.
College Scholar Committee Chair.
Independent Major Advisor.
Cognitive Studies Concentration Advisor.
Member: Faculty of Computing and Information Founders; Faculty of Computing and Information Working Group for Information Science; Faculty of Computing and Information Working Group for Crosscutting Education Programs; Independent Major Advisory Board; Provost's Advisory Group of Women in Science and Engineering; Cognitive Studies Steering Committee; Computer Science Department Ph.D. admissions committee; Department of Computer Science space committee; Cognitive Studies Selection Committees for Summer Fellowships, for Continuing Fellowships, and for Incoming Fellowships.

Professional Activities
Secretary: North American Association for Computational Linguistics (2000-2001).
Secretary: SIGNLL, Association for Computational Linguistics special interest group on Natural Language
     Learning (1999-2001).
Editorial Board: Machine Learning (1999-2001), Semantic Web Journal.
Action Editor: Journal of Machine Learning Research (2000-2002).
Program co-chair: Fourth Computational Natural Language Learning Workshop (CoNLL 2000).
Member: DARPA/NSF Question and Answering Roadmap Committee; DARPA/NSF Summarization Roadmap
     Committee; DARPA Translingual Information Detection, Extraction, and Summarization (TIDES) Evaluation Committee.

Program Committees
Eighteenth International Conference on Machine Learning (ICML) (2001).
Seventeenth International Joint Conference on Artificial Intelligence (IJCAI) (2001).
First International Conference on Knowledge Capture (K-CAP) (2001).
39th Annual Meeting of the Association for Computational Linguistics (2001).
Second Meeting of the North American Chapter of the Association for Computational Linguistics (2001).
Fifth Computational Natural Language Learning Workshop (CoNLL) (2001).
Area Chair: The 24th Annual International ACM SIGIR Conference on Research and Development in Information
    Retrieval (2001).
Reviewer: Special issue of Computational Linguistics on anaphora resolution.
Executive Board: SIGDAT, Special Interest Group of ACL for Linguistic Data and Corpus-based approaches to
     NLP.
NSF Review Panel: Knowledge and Cognitive Systems (2000); Human-Computer Interaction (2001).

Lectures
Noun Phrase Co-reference for Information Extraction. Logic and AI Seminar, University of Maryland (April,
     2001).
Machine Learning for Information Extraction from Unrestricted Text. Alan Perlis Symposium, Yale University
     (April, 2001).
Rapidly Portable Translingual Information Extraction and Interactive Multi-document Summarization. DARPA
     TIDES Meeting (February, 2001).
Overview of Cornell University Projects in Natural Language Understanding. America On-line (December, 2000).

Publications
"Limitations of Co-training for Natural Language Learning from Large Datasets." Proceedings of the 2001
     Conference on Empirical Methods in Natural Language Processing (EMNLP-2001), 1-9. Association for
     Computational Linguistics (2001). With David Pierce.
"Multi-document Summarization via Information Extraction." Proceedings of the First International Conference
     on Human Language Technology Research (2001). With Michael White, Tanya Korelsky, Vincent Ng, David
     Pierce, and Kiri Wagstaff.
"Issues, Tasks and Program Structures to Roadmap Research in Question & Answering" (Q&A). DARPA/NSF
     (2000). With J. Burger, V. Chaudhri, R. Gaizauskas, S. Harabagiu, D. Israel, C. Jacquemin, C. Lin, S.
     Maiorano, G. Miller, D. Moldovan, B. Ogden, J. Prager, E. Riloff, A. Singhal, R. Shrihari, T. Strzalkowski,
     E. Voorhees, and R. Weischedel.
"Using Clustering and SuperConcepts within SMART: TREC 6." Information Processing and Management
     36(1):109-131 (2000). With C. Buckley, M. Mitra, and J. Walz.
"A Cognitive Bias Approach to Feature Selection and Weighting for Case-based Learners." Machine Learning
     41:85-116 (2000).
"Examining the Role of Statistical and Linguistic Knowledge Sources in a General-knowledge Question-
     answering System." Proceedings of the Sixth Applied Natural Language Processing Conference (ANLP-
     2000), 180-187. Association for Computational Linguistics / Morgan Kaufmann (2000). With V. Ng, D.
     Pierce, and C. Buckley.
"Clustering with Instance-level Constraints." Proceedings of the Seventeenth International Conference on
     Machine Learning, 1103-1110. Morgan Kaufmann (2000). With Kiri Wagstaff.
Integrating Case-based Learning and Cognitive Biases for Machine Learning of Natural Language." Journal of
     Experimental and Theoretical Artificial Intelligence 11:297-337 (1999).
"The Role of Lexicalization and Pruning for Base Noun Phrase Grammars." Proceedings of the Sixteenth
     National Conference on Artificial Intelligence, 423-430. AAAI Press / MIT Press (1999). With David Pierce.
"Noun Phrase Co-reference as Clustering." Proceedings of the Joint Conference on Empirical Methods in
     Natural Language Processing and Very Large Corpora, 82-89. Association for Computational Linguistics
     (1999). With Kiri Wagstaff.
Error-driven Pruning of Treebank Grammars for Base Noun Phrase Identification." Proceedings of the Annual
     Conference of the Association for Computational Linguistics and COLING-98, 218-224. Association for
     Computational Linguistics (1998). With David Pierce.
"Empirical Methods in Information Extraction." AI Magazine 18(4):65-79 (1997).

[On sabbatic leave 2001-2002]

L. Paul Chew
Senior Research Associate
chew@s.cornell.edu
http://www.cs.cornell.edu/Info/People/chew/chew.html

My primary interest is in geometric algorithms with an emphasis on practical applications. These practical applications have included placement, motion planning, shape comparison, vision, sensing, mesh generation, molecular matching, and protein shape-comparison.
    In recent work on protein shape, Klara Kedem and I have developed a new kind of "consensus shape" for protein families. This is an analog of the consensus string that is sometimes used for multiple alignment of proteins. The idea is based, in part, on our previous work on the Unit-vector Root Mean Square (URMS) distance for protein shapes. The consensus shape is a pseudo-protein with useful properties. It is a pseudo-protein because it fails to have certain characteristics of real proteins. In particular, for the consensus shape, the spacing between successive alpha carbons is variable, with small distances in regions where the members of the protein family exhibit significant variation and large distances (up to the standard spacing of four angstroms) in regions where the family members agree. Despite this nonprotein-like characteristic, the consensus shape does preserve structural information. If all members of a protein family exhibit a geometric relationship between corresponding alpha carbons then that relationship is preserved in the consensus shape. In particular, distances and angles that are consistent across family members are preserved. Thus, the consensus shape provides a compact summary of the significant strucutural information for a family. We are exploring the use of the consensus shape (1) as a tool for improved protein threading for use in protein structure prediction and (2) as a tool for automating the division of proteins into families and subfamilies.
    My work on mesh generation has been motivated by the finite element method for finding approximate solutions to partial differential equations. The first step of this method is to create a mesh, i.e. to divide the given problem region into simple shapes called elements (usually triangles or quadrilaterals in 2D, tetrahedra or hexahedra in 3D). A number of algorithms have been developed to automate this process, but most of them don't guarantee the quality of the resulting mesh (e.g., a triangle may cross a region boundary or there may be some flat triangles, leading to poor error bounds). I developed efficient techniques for producing meshes of guaranteed quality for problems in the plane and for curved surfaces. The triangles produced are close to equilateral in shape; all region boundaries are respected; and the user can control the element density, producing small elements in "interesting" regions and large elements elsewhere.
    I extended this work to produce tetrahedral meshes for three-dimensional problems. The major difficulty here is to avoid producing "slivers": tetrahedra with nicely shaped faces but with near-zero volume. I showed that slivers can be avoided by choosing each new mesh point randomly within a small specified volume. The randomness helps; a good mesh point-one that does not form any slivers-can be found in constant expected time.
    This work is being used in a large, multi-disciplinary project: developing adaptive software for field-driven simulations. In particular, we focus on computational fracture mechanics and reactive, multiphase fluid flows. Our goal is to develop principles for building software systems that can adapt to changing conditions. These conditions include changes in the desired physics (e.g. we may need to change our physics model when we discover that vibration is significant), changes in the desired algorithms (e.g. we may change our solution technique depending on how quickly we are converging toward a solution), and changes in the computing environment (e.g. additional processors may become available or we may lose processors due to processor failure). Other Cornell researchers working on this project are Keshav Pingali, Steve Vavasis, Paul Stodghill, and Tony Ingraffea (Civil Engineering), along with participants at Mississippi State University, Ohio State University, Clark-Atlanta University, and the College of William & Mary.

Professional Activities
Associate Editor: Pattern Recognition: the Journal of the Pattern Recognition Society.
Referee: Journal of the Association for Computing Machinery, SIAM Journal on Scientific Computing.

Publications
"Parallel FEM Simulation of Crack Propagation-challenges, Status, and Perspectives." Proceedings of Irregular
     2000 (2000). With B. Carter, C.S. Chen, G. Heber, A.R. Ingraffea, R. Krause, C. Myers, P.A. Wawrzynek,
     K. Pingali, P. Stodghill, S. Vavasis, N. Chrisochoides, D. Nave, and G.R. Gao.
"Fast Detection of Common Geometric Substructure in Proteins." Journal of Computational Biology 6(3):313-
     325 (1999). With D. Huttenlocher, K. Kedem, and J. Kleinberg.
"Unit-vector RMS (URMS) as a Tool to Analyze Molecular Dynamics Trajectories." Proteins: Structure,
     Function and Genetics 37, 554-564 (1999). With K. Kedem and R. Elber.

Tom Coleman
Professor
Director, Cornell Theory Center
Director, Financial Industry Solutions Center (FISC)

Our research is concerned with the design and understanding of practical and efficient numerical algorithms for continuous optimization problems. Our primary emphasis is the development of algorithms for large-scale optimization, especially as applied to the area of computational finance.
    With colleagues Yuying Li, Peter Mansfield, Arun Verma, and Shirish Chinchalkar, we are developing a variety of tools and methods for computational finance in the areas of portfolio management and options pricing (and hedging). Several Ph.D. students in the Center for Applied Mathematics are also involved in this work: Cristina Patron, Yohan Kim, and Changhong He. Yohan Kim completed his Ph.D. dissertation in May, 2001: Estimation of Smooth Volatility Functions in Option Pricing Models.

University Activities
Director: Cornell Theory Center.
Director: Financial Industry Solutions Center (55 Broad Street, NYC).
Member: Engineering Dean Search Committee; Cornell Task Force on Genomics; Program Committee for the Center for Applied Mathematics.

Professional Activities
Chair: SIAM Activity Group on Optimization.
Co-organizer: The 11th Annual Derivatives Securities Conference, New York (April 27-28).
Organizer: FISC Spring 2000 Workshop Series.
Program Committee: Automatic Differentiation 2000, INRIA, France.
Member: Advisory Board, Brookhaven Center for Data Intensive Computing; Scientific Program Committee.
Member: Organizing committee for the thematic year at the Fields Institute: Numerical and Computational
     Challenges in Science and Engineering (2001-2002).
Organizer: Proposal for an IMA Special Year on Optimization, Minneapolis, MN (2002-2003); Seventh SIAM
     Conference on Optimization, Toronto, Ontario (2002).
Editorial Board: Applied Mathematics Letters; SIAM Journal of Scientific Computing; Computational
     Optimization and Applications, Comm. on Applied Non-linear Analysis, Mathematical Modeling and
     Scientific Computing.
Referee/Reviewer: Mathematical Programming; Computational Optimization and Applications; SIAM Journal of
     Optimization; SIAM Journal of Scientific Computing; Department of Energy, NSF.

Lectures
Dynamic Hedging and a Deterministic Local Implied Volatility Function. Eleventh Annual Derivatives
     Conference, New York (April 28, 2001).
RISK 2001 Europe, Paris France (April 10-11, 2001).
Introduction to Computational Finance in Matlab: A 1-day workshop at FISC-Japan, Tokyo (March 22, 2001).
A Newton Method for Option Valuation. U. Singapore, Singapore (December 12, 2000).
-. City University of Hong Kong, Hong Kong (December 22, 2000).

Publications
"ADMIT?1: Automatic Differentiation and MATLAB Interface Toolbox." ACM Transactions on Mathematical
     Software 22:150-175 (2000). With Arun Verma.
"Efficiency Improvements for Pricing American Options with a Stochastic Mesh: Parallel Implementation."
     Financial Engineering News, 1-2 (December, 2000). With Thanos Avranidis, Yuriy Zinchenko, and Arun
     Verma.

[On sabbatic leave 2001-2002]

Bob Constable
Professor
Dean for Computing and Information Science
rc@cs.cornell.edu
http://www.cs.cornell.edu/home/rc/
Ph.D. University of Wisconsin-Madison, 1968

We have been building a system that we call a logical programming environment (LPE). It provides substantial automation in the design, coding, verification, and evolution of large software systems. Generally an LPE will integrate programming languages and logics. In our case we integrate the ML programming language and a programming logic based on type theory. Reasoning about ML programs is founded on type theoretic semantics for ML. The LPE also integrates a compiler and a theorem prover. We use the latest version of Nuprl as the prover.
    Over the past year we have deployed our prototype LPE to support the Ensemble group communication system that Ken Birman, Robbert van Renesse, and their students have built. The LPE provides automatic code transformations that improve performance in a way that is guaranteed not to introduce errors. The LPE also supports the design and coding of new adaptive protocols that are part of the Spinglass project.
    The Nuprl 5 system is a major re-implementation of Nuprl 4; its design is based on communicating processes that synchronize around a logical database that we call "the Library." The Library stores definitions, theorems, conjectures, proofs, algorithms, proof tactics, and commentary that is linked to the formal mathematics. We released the first version of Nuprl 5 last summer, with a debut at CADE in June involving the whole design and implementation team (Stuart Allen, Rich Eaton, Christoph Kreitz, Lori Lorigo, and me). Nuprl 5 supports multiple proof engines and multiple editors. It also integrates an automatic theorem prover, called the JProver, built by C. Kreitz, Jens Otten, and Stephan Schmitt.
    The Library includes over ten thousand theorems. Many of these are used in system verification, but a large number are from general mathematics. These general theorems are a valuable resource. We are funded by ONR to further develop and explore the concept of a formal digital library of formal constructive mathematics built around these theorems. We will generalize our mechanisms to allow many users to contribute to the Library using other theorem provers such as ACL2, HOL and PVS.
    We are also working on a more experimental LPE called MetaPRL, which started with Jason Hickey's thesis and now involves many people but especially Aleksey Nogin and Alexsey Kopylov. This system is built entirely in OCaml and supports OCaml as its programming language. It is coded for efficiency as well as modularity, and at some tasks it is over two orders of magnitude faster than Nuprl 5. It also supports multiple programming logics. Nuprl 5 and MetaPRL share mathematics libraries.
    The two theorem provers are used in a variety of other projects as well, including the creation of formal courseware by S. Allen, the translation of formal proofs into natural language by Amanda Holland-Minkley, the automatic analysis of the computational complexity of higher-order programs by Ralph Benzinger, and efficient reflection being designed and implemented by Eli Barzilay. We follow the work of Greg Morrisett and his students on new ML compilers and on typed assembly language. We plan to use the LPE to broadly support research on language-based security in the department and at the new Information Assurance Institute, including the work of Dexter Kozen, Andrew Myers, and Fred Schneider.

University Activities
Dean: Computing and Information Science.
Committees: Applied Math Policy; Cognitive Studies Executive Committee; Theory Center Executive Committee.

Professional Activities
Advisory Council: Princeton University Department of Computer Science.
Editor: Journal of Logic and Computation; Formal Methods in System Design; Journal of Symbolic
    Computation.
Director: NATO Summer School, Marktoberdorf, Germany.
General Committee Member: LICS.

Lectures
How Computers Think. Dean's Forum, Faculty of Natural Sciences, Ben-Gurion University (June, 2001).
Formal Complexity Classes: An Approach to Automating Computational Complexity Analysis. Cornell
     University (May, 2001). With Ralph Benzinger.
How Nuprl Reasons. University of Delaware (May, 2001).
Taking a MEGABYTE: Cornell in the Information Age. University of Delaware (May, 2001).
How Nuprl Reasons. Yale University (February, 2001).
Taking a MEGABYTE: Cornell in the Information Age. Cornell University (February, 2001).
Representing the Faculty of Computing and Information. Cornell University (September, 2000).
How Computers Think. Cornell University (September, 2000).
Computer Science: Achievements and Challenges Circa 2000. Cornell University (March, 2000).

Publications
"An Experiment in Formal Design Using Meta-properties. In Proceedings of DARPA Information Survivability
     Conference and Exposition II (DISCEX 2001), IEEE Computer Society Press (June, 2001). With C. Kreitz,
     M. Bickford, and R. van Renesse.
"Protocol Switching: Exploiting Meta-properties." In Proceedings of the International Workshop on Applied
     Reliable Group Communication (WARGC 2001) (April, 2001). IEEE Computer Society Press. With C.
     Kreitz, X. Liu, R. van Renesse, and M. Bickford.
"Computational Complexity and Induction for Partial Computable Functions in Type Theory." In Reflections: A
     Collection of Essays in Honor of Solomon Feferman, Association for Symbolic Logic (2001). With K. Crary.
"Constructively Formalizing Automata." In Proof, Language and Interaction: Essays in Honour of Robin Milner,
     MIT Press, 213-238 (2000). With P.B. Jackson, P. Naumov, and J. Uribe.
"Nuprl's Class Theory and its Applications." In Foundations of Secure Computation, F.L. Bauer and R.
     Steinbruggen, editors. IOS Press, 91-115 (2000).
"Types in Logic, Mathematics and Programming." In Handbook of Proof Theory, S. R. Buss, editor. Elsevier
     Science B. V., 684-785 (1998).
"The Structure of Nuprl's Type Theory." In Logic of Computation, Springer-Verlag, (1997).
Implementing Mathematics with the Nuprl Development System. Prentice-Hall (1986). With S. Allen, et. al.

Alan Demers
Professor
ademers@cs.cornell.edu
Ph.D. Princeton University, 1975

My current research concerns aspects of weakly-consistent data replication in databases and distributed systems. With Ken Birman, Robbert van Renesse, Johannes Gehrke, and others, I am studying randomized "gossip protocols." Such protocols are highly fault-tolerant and, when properly designed, extremely scalable as well. We are studying convergence properties of several flat and hierarchal versions of the basic protocols tailored to specific application requirements.
    My particular focus is approximate evaluation of aggregate queries in such a system. We are studying age distributions of gossiped data in order to prove probabilistic bounds on the quality of aggregate query results. Alternatively, we can use this approach to bound the latency required to probabilistically guarantee a client-specified degree of consistency.
    We are considering classes of "resource location" or "anomaly detection" problems, in which query results are site-specific and depend on distance and subsumption. Such problems can have efficient and highly scalable solutions using gossip partner choice distributions based on the distance between sites.
    Finally, we are studying graph constructions for which flooding or deterministic gossip partner choices can be used, leading to reduced overhead while still retaining most of the desirable properties of randomized gossip.
    The above is related to my previous work on the Clearinghouse and Bayou projects at Xerox PARC. I am also doing work supported by Oracle on asynchronous update-anywhere replication in a more traditional database setting. This involves algorithms for scheduling/reordering update propagation between sites to improve throughput while preserving eventual consistency and bounded inconsistency during propagation.

Recent Papers
"Logarithmic Harary Graphs." ICDCS International Workshop on Applied Reliable Group Communication,
     Phoenix, Arizona (April, 2001). With K. Jenkins.
"Spatial Gossip and Resource Location Protocols." Proceedings of the 33d ACM Symposium on Theory of
     Computing, Crete (July, 2001). With D. Kempe, and J. Kleinberg.

Ron Elber
Professor
ron@cs.cornell.edu
http://www.cs.cornell.edu/ron/old_webpage-ron/index_ron.html
Ph.D. Hebrew University, Jerusalem, 1984

My research is in the field of Computational Molecular Biology. We develop computer algorithms to study sequences, structures, dynamics, and function of proteins and apply these methods to a variety of biological problems. Our techniques are implemented in the systems MOIL and LOOPP, available on the web http://www.tc.cornell.edu/CBIO.
    My current research directions include: mean field approaches for global optimization and structure prediction (Locally Enhanced Sampling). Structures are often determined by an optimization of an energy function. I introduced mean field approaches that modify the target function and make it more accessible to global optimization. We have applied these techniques to determine conformations of short peptides and to refine low-resolution structures of proteins. These approaches are implemented into MOIL.
    We are also working on development of folding potentials using linear programming. An ideal folding potential assigns the lowest energy to the correct three-dimensional structure of a protein. All other structures must have higher energies. The design of folding potentials relies on considerable human intuition and many trials and errors. I developed an automated protocol that "learns" and improves the quality of the current potential energy. We used this protocol to prove that the widely used pairwise interactionmodel cannot recognize exactly correct protein folds. Based on these studies, a novel threading algorithm was designed and implemented in the program LOOPP. In a threading algorithm a sequence is matched with a structure. In a recent article in Science, we published an intriguing application of this program. We suggested an evolutionary link between a gene that controls the size of the tomato fruit and a protein that participates in controlling cell growth and division. Malfunction of this protein causes cancer in humans (joint work with Steve Tanksley's group).
    Another project concerns extending the time scale of simulations. One of the striking observations in dynamics of biological molecules is the extremely large time scale they covered. Initiation by light absorption of biochemical processes is very rapid (femtoseconds), while protein folding is slow (milliseconds to minutes). Current simulation approaches (Molecular Dynamics (MD)) are restricted to nanoseconds (10-9 seconds). I developed a stochastic path integral formulation that provides a numerically stable trajectory for almost any arbitrary time step. We apply the new algorithm to study activation of proteins (the R->T transitions in hemoglobin, microseconds) and to protein folding (folding of C peptide, tens of nanoseconds). The method provides systematic approximations to the dynamics and is more efficient than MD by orders of magnitude. It is available in MOIL.

Professional Activities
Acting head: NIH resource for parallel computing at the Cornell Theory Center.
Committees: Statistical and Computational Genomics Committee; Computational Biology Committee for the collaborative efforts at Cornell, Rockefeller, and Sloan Kettering Institutes; Cornell Life Science Advisory Board;
     Planning Committee for Life Science and Technology Building; Theory Center committee.
National Committees: NIH study sections; NSF study section; Reviewer for the State of Texas; Chair:
     workshop on protein dynamics, Telluride (August, 2001).

Lectures
Protein Recognition by Threading. DIMACS, Rutgers (March, 2001).
Parallel Computations of Trajectories. SIAM (March, 2001).
Long Time Dynamics of Proteins. University of Pennsylvania (February, 2001).
Long Time Dynamics and Protein Recognition by Threading. IBM Watson (February, 2001).
Long Time Dynamics of Biomolecules. Florida State, Computational Biophysics (January, 2001).
Protein Recognition by Threading. CUNY (December, 2000).
Protein Recognition by Threading. University of Maryland (October, 2000).
Long Time Dynamics of Biomolecules. NYU (October, 2000), M3.

Publications
"Protein Recognition by Sequence-to-structure Fitness: Bridging Efficiency and Capacity of Threading Models."
     Submitted to Advances in Chemical Physics, by invitation. With Jaroslaw Meller.
"The Enzymatic Circularization of a Malto-octaose Linear Chain Studied by Stochastic Reaction Path
     Calculations on Cyclodextrin Glycosyltransferase." Proteins, Structure, Function and Genetics 43:327-335 (2001). With Joost C.M. Uitdehaag, Bart A. van der Veen, Lubbert Dijkhuizen, and Bauke W. Dijkstra.
"Cloning, Transgenic Expression and Function of fw2.2: a Quantitative Trait Locus Key to the Evolution of
     Tomato Fruit." Science 289:85-88 (2000). With A. Frary, C. Nesbitt, A. Frary, S. Grandillo, E. van der
     Knaap, B. Cong, J. Liu, J. Meller, K.B. Alpert, and S.D. Tanksley.
"Distance Dependent Pair Potential for Protein Folding: Results from Linear Optimization." Proteins, Structure,
     Function and Genetics 41:40-46 (2000). With D. Tobi.
"Probing the Role of the Local Propensity in Peptide Turn Formation." International Journal of Quantum
     Chemistry 80:1125-1128 (2000). With D. Mohanty, and D. Thirumalai.

Geri Gay
Professor
FCI, Joint with Communications
gkg1@cornell.edu
http://www.comm.cornell.edu/faculty/gay.html
Ph.D. Cornell University, 1985

Iam the director of the Human Computer Interaction Group (HCI Group) and a professor of communication at Cornell University. The HCI Group is a research and development group whose members design and research the use of computer-mediated learning environments. My research interests focus on cognitive and social issues for the design and use of interactive communication technologies. Past research has explored navigation issues, knowledge management, mental models and metaphors, knowledge representations, collaborative work and learning, and system design.
     I have received funding for my research and design projects from the National Science Foundation (NSF), the National Endowment for the Humanities (NEH), the Mellon Foundation, Intel, Microsoft, IBM, Getty, and several private donors. I teach courses in interactive multimedia design and research, computer-mediated communication, human-computer interaction, and the social design of communication systems.

Honors/Awards
NYS Chancellor's Award for Excellence 2001.
Innovative Teaching Award 2000.

Current Projects
NASA and AT&T Advanced Technology for Learning projects.
Intel Museum Context Aware Computing Project.
Intel and NSF studies on the use of wireless computing, covered in Chronicle of Higher Education, USA Today,
      Newsweek, The New York Times, Globe and Mail, and NPR.

Lectures
American Educational Research Association, International Communication Association; ACM Multimedia; Japanese Private University Association.

Publications
Articles in Journal of Computer-Mediated Communication; Journal of Research on Computing in Education; Journal of Educational Technology; Journal of Educational Computing Research; Journal of Educational Psychology; International Journal of HCI; ACM Digital Libraries; Journal of Information Technologies.

Johannes Gehrke
Assistant Professor
johannes@cs.cornell.edu
http://www.cs.cornell.edu/johannes/
Ph.D. University of Wisconsin-Madison, 1999

My primary research interest is in the development of new data mining and database technology. My group is currently involved in three projects: The Himalaya Data Mining Project, the Cougar Sensor Database System, and the Amazon Stream Processing Project.
     In the Himalaya Data Mining Project we develop new data mining functionality, and we work on techniques to make the resulting data mining models more understandable to the user. As an example, consider classification trees, a data mining model that is supported in nearly all commercial data mining suites. In recent research we have shown that a large class of classification tree construction algorithms is biased (including most algorithms used in commercial tools), thus, users could draw incorrect conclusions from the resulting "incorrect" classification tree. Our methods can provably eliminate this bias from any existing split selection method. Other recent results include the fastest published algorithm for mining long market baskets, and new methods for mining long sequential patterns.
     The widespread deployment of sensors and mobile devices is transforming our physical environment into a computing platform. There is now computing power on every device, and emerging networking techniques ensure that devices are interconnected and accessible from local or wide-area networks. This is a distributed database system of unprecedented scale. In the Cougar Sensor DatabaseSystem, we develop database technology for tasking, mining, and monitoring such a large number of distributed data sources. We have implemented the first generation of the Cougar Device Database System, where we leverage the processing power on the devices to push query processing directly to the data sources. Different query processing strategies allow us to balance resource usage, accuracy, and speed of query answers. Our current research focuses on distributed and fault tolerant query processing and meta-data management.
In many applications, for example in intrusion detection, sensor networks, and network management, data arrive in streams, and the large volume of such high-speed data streams makes storage and offline processing of the data infeasible. In the Amazon Stream Processing Project, we are developing query processing techniques for long running queries over infinite data streams. The main difficulty here is the new model of computation: Instead of being able to re-read data many times and to perform expensive offline computation on a static dataset, we need to compute query answers and maintain summary statistics in an online fashion. Our recent results include computation of correlated aggregates and quantiles over data streams.

Honors/Awards
IBM Faculty Development Award (2000, 2001).
James and Mary Tien Excellence in Teaching Award (2001).

University Activities
Member: Space Committee, Department of Computer Science; Faculty Search Committee, School of
      Operations Research and Industrial Engineering; faculty Search Committee, The Computational and
      Statistical Genomics Trust.

Profesional Activities
Program Committees:
Twenty-sixth International Conference on Very Large Databases (VLDB), Cairo, Egypt (September, 2000).
      Demonstrations Committee.
Seventeenth IEEE International Conference on Data Engineering (ICDE 2001), Heidelberg, Germany (April,
      2001).
Fourth International Workshop on Parallel and Distributed Data Mining. Workshop held in conjunction with the
      15th International Parallel and Distributed Processing Symposium, San Francisco, CA (April, 2001).
Twentieth ACM SIGMOD Conference (SIGMOD 2001), Santa Barbara, CA (May, 2001).
ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery (DMKD 2001) held in
      cooperation with SIGMOD 2001. Santa Barbara, CA (May, 2001). Workshop Co-chair.
Eighteenth International Conference on Machine Learning (ICML 2001), Williams College, MA (June, 2001). Sixth ACM SIGKDD Conference (KDD 2001), San Jose, CA (August, 2001).
Twelfth International Conference on Software Engineering and Knowledge Engineering, Chicago, IL (July, 2000).
Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2000). Boston,
      MA (August, 2000).
Editorial Boards:
Knowledge and Information Systems.
Journal of Database Management.

Lectures
An Introduction to Data Mining. Air Force Research Laboratory, Rome, NY (September 12, 2000).
An Overview of Modern Data Mining Technology. Workshop at the Financial Industry Solutions Center (FISC)
      New York (November 8, 2000).
The Infrastructure of Electronic Commerce. Lectures on Database Technology and Data Mining. Johnson
      Graduate School of Management, Cornell University (January, 2001).
Honest Classification Trees. IBM Watson Research Center, Yorktown, NY (March, 2001).
Panel Manager for "Storage-A Crowded Place?" Panel at the 2001 Leadership in the Technology Marketplace
      Symposium, Cornell Johnson Graduate School of Management, Ithaca (April, 2001).
Querying the Physical World. DARPA Sensor Information Technology PI Meeting. St. Petersburg, FL (April,
      2001).
Mining Very Large Databases. Invited talk at the 33rd Symposium on the Interface of Computing Science and
      Statistics, Costa Mesa, CA (June, 2001).

Publications
"RAINFOREST - A Framework for Fast Decision Tree Construction of Large Datasets. In Data Mining and
      Knowledge Discovery 4(2/3):27-162 (July, 2000). With Raghu Ramakrishnan, and Venkatesh Ganti.
"Querying the Physical World." In IEEE Personal Communications, special issue on Smart Spaces and
      Environments (October, 2000). With Philippe Bonnet, and Praveen Seshadri.
"Towards Sensor Database Systems." In Proceedings of the Second International Conference on Mobile Data
      Management, Hong Kong, China (January, 2001). With Philippe Bonnet, and Praveen Seshadri.
"DEMON: Mining and Monitoring Evolving Data." In IEEE Transactions on Knowledge and Data Engineering      13(1):50-63 (January/February 2001). With Venkatesh Ganti, and Raghu Ramakrishnan.
"MAFIA: A Maximal Frequent Itemset Algorithm for Transactional Databases." In Proceedings of the 17th
      International Conference on Data Engineering, Heidelberg, Germany (April, 2001). With Doug Burdick, and
      Manuel Calimlim.
"On Computing Correlated Aggregates Over Continual Data Streams." In Proceedings of the 2001 ACM
      SIGMOD International Conference on Management of Data, Santa Barbara, CA (May, 2001). With Flip
      Korn, and Divesh Srivastava.
"Query Optimization In Compressed Database Systems." In Proceedings of the 2001 ACM SIGMOD
      International Conference on Management of Data, Santa Barbara, CA (May, 2001). With Zhiyuan Chen,
      and Flip Korn.
"Bias Correction in Classification Tree Construction." In Proceedings of the Seventeenth International
      Conference on Machine Learning (ICML 2001), Williams College, MA (June, 2001). With Alin Dobra.

Carla Gomes
Research Associate
Director, Intelligent Information Systems Institute (IISI)
gomes@cs.cornell.edu
http://www.cs.cornell.edu/gomes
Ph.D. University of Edinburgh, 1993

My research interests are centered around the integration of methods from artificial intelligence and operations research for solving hard combinatorial problems. I consider applications in areas ranging from combinatorial design, planning and scheduling, reasoning, multi-agent systems, and machine learning. Recently, I have focused on randomized search techniques. In this work, I study so-called heavy-tailed distributions that characterize complete randomized search methods. A promising way of exploiting heavy-tailed behavior is by combining a suite of search methods into a portfolio, running on a distributed compute cluster. It can be shown that such portfolios dramatically reduce the expected overall computational cost, thereby allowing us to solve large, previously unsolved combinatorial problems. Another recent research direction (joint work with groups at the University of Washington and Microsoft Research) involves the use of machine learning techniques and Bayesian models to develop effective adaptive algorithmic strategies given bounded computational resources.
I also established and direct the newly formed Intelligent Information Systems Institute (IISI) at Cornell. The mission of the institute is to foster research in computation and data intensive methods for intelligent decision making systems. See www.cis.cornell.edu/iisi.

Professional Activities
Director, Intelligent Information Systems Institute (IISI).
Guest Editor, Journal of Knowledge Engineering Review, Cambridge Press.
Guest Editor, Artificial Intelligence Journal.
Editorial Board, Journal of Knowledge Engineering Review.
Editorial Board, International Journal AI Tools (IJAIT).
Co-chair, AAAI Symposium on Uncertainty in Computation, Boston, MA (2001).
Co-chair, AAAI Workshop on Leveraging Probability and Uncertainty in Computation, AAAI (2000).
Member, Advisory Committee International Scientists, Ministry of Science and Technology, Portuguese Government, Presidency of European Union (2000).
Member, Program Committee, SAT, Boston, MA (2001).
External Examiner, Ph.D. Thesis of Ramon Bejar, Univ. of Leida, Barcelona, Spain.
Reviewer for 7th Int. Joint Conference on Artificial Intelligence (IJCAI); Journal of Automated Reasoning; Journal
of Artificial Intelligence Research; Constraints: An International Journal; Discrete Applied Mathematics.

Lectures
Structure, Duality, and Randomization: Common Themes in AI and OR.
-. Broad Area Colloquium, Stanford University, Stanford, CA (November, 2000).
-. AI Seminar, SRI, Palo Alto, CA (November, 2000).
-. Research Seminar, NASA/Ames, Mountain View, CA (November, 2000).
-. Colloquium, Univ. of Lisbon, Lisbon, Portugal (March, 2001).
Survey of Information Retrieval and Knowledge Representation, 3 lectures at AFRL/IF, Rome, NY (November,
      2000).
Vision and Directions for the Intelligent Information System Institute, AFRL/IF, Rome, NY (February, 2001).
Impact of Structure on Complexity. MURI /AFOSR meeting on Coop. Control of Distributed Autonomous
      Vehicles in Adversarial Environments, UCLA, Los Angeles, CA (May, 2001).
Structure and Complexity in the Virtual Transportation Company. Meeting on Taskable Agent Software Kit,
      DARPA, Sante Fe, NM (April, 2001).
Controlling Computational Cost. Meeting on Autonomous Negotiation Teams, DARPA, Lake Tahoe, CA (May,
      2001).

Publications
"On the Intersection of AI and OR." Journal of Knowledge Engineering Review 16(1) (2001).
"Algorithm Portfolios." Artificial Intelligence Journal 126(2001). With B. Selman.
"A Bayesian Approach to Tackling Hard Computational Problems." Proc. 17th Conf. on Uncertainty and
      Artificial Intelligence (UAI-2001), Seattle, WA (2001). With E. Horvitz, Y. Ruan, H. Kautz, B. Selman, and      M. Chickering.
"Balance and Filtering in Structured Satisfiable Problems. Proc. 17th Intl. Conf. on Artificial Intelligence (IJCAI-
      2001), Seattle, WA (2001). With H. Kautz, Y. Ruan, D. Achlioptas, B. Selman, and M. Stickel.
"Extending the Reach of SAT with Many-valued Logics." Electronic Notes in Discrete Mathematics 9, Elsevier
      Science Publ. (2001). With R. Bejar, A. Cabiscol, C. Fernandez, and F. Manya.
"An Application of Randomization and Restarts in Proof Planning." Proc. of the 6th European Conference on
      Planning (ECP-01), Toledo, Spain (2001). With A. Meier, and E.Melis.
"Extending the Reach of Proof Planning by Randomization and Restart Techniques." Future Directions in
      Automated Reasoning, IJCAR Workshop, Siena, Italy (2001). With A. Meier and E. Melis.
"Generating Hard Feasible Schedules. Proc. of the 6th European Conference on Planning (ECP-01), Toledo,
      Spain (2001). With J. Argelich, R. Bejar, A. Cabiscol, C. Fernandez, and F. Manya.
"Heavy-tailed Behavior and Randomization in Proof Planning. Model-based Validation of Intelligence, AAAI
      2001 Spring Symposium Series, Stanford, CA (2001). With A. Meier and E. Melis.
"Distribute Constraint Satisfaction in a Wireless Sensor Tracking System. Proc. Workshop on Distributed
      Constraint Reasoning (CONS-2), IJCAI-2001, Seattle (2001). With R. Bejar, B. Krishnamachari, and B.
      Selman.
"Heavy-tailed Phenomena in Satisfiability and Constraint Satisfaction Problems. Journal of Automated
      Reasoning 24(1/2):67-100 (2000). With B. Selman, N. Crato, and Henry Kautz). Results featured in
      Science News (2000).
"Artificial Intelligence and Operations Research: Challenges and Opportunities in Planning and Scheduling and
      Operations Research. Journal of Knowledge Engineering Review 15(1) (2000).

Donald Greenberg
Professor and Member of the FCI,
the Johnson School of Management,
the Department of Architecture, and the
Graduate Field of Computer Science
dpg@graphics.cornell.edu
http://www.graphics.cornell.edu/people/director.html
Ph.D. Cornell University, 1968

Iam one of the pioneers in the emerging field of computer graphics, having served as a leading researcher and teacher in the field since 1965. My research is primarily concerned with physically based image synthesis and with applying graphic techniques to a variety of disciplines. My specialties include color science, parallel processing, and realistic image generation. My application work now focuses on medical imaging, architectural design, perception, digital photography, and real-time photorealistic image generation.
     Consistent with the interdisciplinary nature of the field of computer graphics, I am a member of Cornell's faculty in Johnson Graduate School of Management, the Department of Computer Science, and the Department of Architecture. In recent years I have taught courses in computer graphics, computer-aided architectural design, digital photography, and disruptive technologies.
     I was the founding director of the NSF Science and Technology Center for Computer Graphics and Scientific Visualization, now in its eleventh year. I am the director of the Program of Computer Graphics and former director of the Computer-aided Design Instructional Facility at Cornell.
     I have published more than 200 articles on computer graphics, and many of my students have been highly recognized in the field, including several who have received the SIGGRAPH Achievement Award and others who have received Hollywood Oscars.
     In 1987, I received the ACM Steven Coons Award, the highest honor in the field, for my outstanding creative contributions in computer graphics. I also received the National Computer Graphics Association Academic Award in 1989. In 1997 I received the ASCA Creative Research Award in Architecture. An honorary doctoral degree from New Jersey Institute of Technology was presented to me in 1999.

Professional Activities
Member: National Academy of Engineering.
Fellow: ACM and International Association of Medical and Biological Engineering.

Lectures
Disruptive Histories of Our Future. Cornell JGSM Reunion 2001, Cornell University (June 9, 2001).
Art & Design for Living. Cornell University, Parents Visit (April 20, 2001).
Virtual Environments of the 21st Century. Cornell Association of Professors Emeriti, Cornell University (April
      19, 2001).
Rendering History & Progress. STC Lecture, Program of Computer Graphics, Cornell University (April 17,
      2001).
The Real Challenge for Architecture in a Virtual World. Architecture Department, University of Virginia,
      Charlottesville, VA (April 5, 2001).
Rendering. EAG 2001, Boston, MA (April 3, 2001).
Working Today on Tomorrow's Design Software. SOM Lecture Series, NY (February 15, 2001).
B-schools: A Case History of Our Future. MBA Leadership 2001 Conference, New Orleans, Louisiana (January
      25, 2001).
Distance Learning. Cornell Club of Eastern Florida, Delray Beach, FL (December 6, 2000).
Great Ideas for Computer Science. Lecture, ComS 150, Computer Science, Cornell University (October 18,
      2000).
Technology & Design Practices. Real-time Workshop on Technology and Design Practice, Program of
      Computer Graphics, Cornell University (October 8, 2000).
Tomorrow's Internet and Design Software. Proceedings: Emerging Information Technologies for Facilities, NAS,
      FCC, Washington D.C. (October 20, 2000).
How Do We Prepare Our Students for the Future? Architecture Summer School: Architecture Department,
      Cornell University (July 12, 2000).

Publications
"Spatiotemporal Sensitivity and Visual Attention For Efficient Rendering of Dynamic Environments." ACM
      Transactions on Graphics (2001). With Hector (Yang-Li) Yee, and Sumanta N. Pattanaik.
"Field Trip to Ithaca, N.Y.: Autodesk Development Team Refining Sketching Advantages of Architectural
      Studio." Design Architecture.com (June 4, 2001). With Wendy Talarico.
"Lighting the Way: A Conversation with Don Greenberg of Cornell's Program in Computer Graphics." Cadence
      Web (http://www.cadenceweb.com/features/interviews/greenberg.html), 1-2 (2001).
"Tomorrow's Internet and Design Software." Symposium: Emerging Information Technologies for Facilities,
      NAS, FCC, Washington D.C. (October 20, 2000).
"Once and Future Graphics Pioneer." Architecture Week (18):1-7 (September, 2000). With B. J. Novitski.
"Time-dependent Visual Adaptation for Realistic Image Display." Computer Graphics Proceedings, Annual
      Conference Series, ACM SIGGRAPH, 47-53(July, 2000). With Sumanta N. Pattanaik, Jack Tumblin, and Hector Yee.
"Toward a Psychophysically Based Light Reflection Model for Image Synthesis." Computer Graphics Proceedings, Annual Conference Series ACM SIGGRAPH, 55-64 (July, 2000). With Fabio Pellacini, and James A. Ferwerda.
"A Lab Ahead of its Time: Cornell Graphics Lab Sets High Standards." Architectural Record, 198-204 (June, 2000). With B. J. Novitski, and Moreno A. Piccolotto.
"Approximate Visibility for Illumination Computations using Point Clouds." Program of Computer Graphics Technical Report, Cornell University (June 1, 2000). With Philip M. Dutre, and Parag Tole.
"A System for 3D Conceptual Modeling for Architectural Design." Program of Computer Graphics Technical Report, Cornell University (January 3, 2000). With Moreno Piccolotto, Sebastian Fernandez, Kavita Bala, and Michael Malone.
"Interactive Direct Lighting in Dynamic Scenes." Program of Computer Graphics Technical Report, Cornell University (January 2, 2000). With Sebastian Fernandez, Kavita Bala, and Moreno Piccolotto.

Zygmunt Haas
Associate Professor
Member of the School of Electrical and Computer Engineering
and the Graduate Field of Computer Science
haas@cs.cornell.edu
http://www.ee.cornell.edu/$\sim$haas/wnl.htm
Ph.D. Stanford University

My research is in the area of mobile and wireless systems and networks. Selected examples of the projects that are conducted in my Wireless Network Laboratory (WNL) are: ad-hoc networks (routing, medium access control, security, etc.), quality of service, cross-layer protocol design, mobile web access, multicasting, and mobility management.

Memberships
Professional Societies: IEEE Communications Society; IEEE Vehicular Technology; Association for Computing Machinery (ACM); Special Interest Group on Mobile Communications (SIGMOBILE).

Awards/Honors
Michael Tien '72 Award, Cornell College of Engineering, Excellence in Teaching Award (September, 2000).

University Activities
Member, Ad-hoc Tenure Promotion Review Committee, Computer Science Department, Cornell University;
      Computing Policy Committee (CPC), College of Engineering, Cornell University.
EE Policy Committee, School of Electrical and Computer Engineering, Cornell University (2000).
Member of the Committee on "Bits On Our Minds 2001 (BOOM '01).

Professional Activities
Editorial Board: IEEE Transactions on Networking.
Editorial Board: IEEE Communications Magazine.
Organizer and chair of the session on "Outrageous Opinions" at MobiHoc '01, The ACM Symposium on Mobile
      Ad-hoc Networking & Computing, Long Beach, CA (October 4-5, 2001).
Member: IASTED (The International Association of Science and Technology for Development) Technical
      Committee on Telecommunication.
Member:ACM Mobicom Steering Committee.
Chair of the IEEE Technical Committee on Personal Communications (TCPC).
Vice-chair of the IEEE Technical Committee on Personal Communications (TCPC).
Editorial Board of the journal Wireless Communications and Mobile Computing, John Wiley & Sons.
Guest Editor: Wireless Personal Communication Journal, special issue on Multimedia Network Protocols and
      Enabling Radio Technologies.
Editorial Board: ACM/Baltzer Wireless Networks.
Editorial Board: Journal of High Speed Networks.
Program Committee: IEEE Symposium on Ad-hoc Wireless Networks (SAWN), in conjunction with IEEE
      GLOBECOM 2001, San Antonio, TX (November 25-29, 2001).
Program Committee member and session chair, Milcom'01, McLean, VA (October 28-31, 2001).
Committee member: Wireless Communications and Networking Conference 2002 (WCNC'02), Orlando, FL
      (March 18-21, 2002).
Program Committee: European Wireless 2002, Next Generation Wireless Networks: Technologies, Protocols,
      Services and Applications, Florence, Italy (February 26-28, 2002).
Program Committee: 11th IEEE Workshop on Local and Metropolitan Area Networks, Boulder, CO (May 18,
      2001).
Program Committee: IEEE Wireless Networks and Mobile Computing Workshop, Phoenix, AZ (April 16-19, 2001).
Program Committee: ACM/IEEE MobiCom'2000, Boston, MA (August 6-11, 2000).
Program Committee: First IEEE Workshop on Mobile Ad HOC Networking and Computing Workshop
      (MobiHOC), Boston, MA (August 11-12, 2000).
NSF reviewer and panelist.

Lectures
Research in the Wireless Networks Laboratory at Cornell. Department of Electrical Engineering, Columbia
      University (April 23, 2001).
Research in the Wireless Networks Laboratory at Cornell. Communication Systems Department, Swiss
      Federal Institute of Technology Lausanne (EPFL) (December 11, 2000).

Publications
"The Zone Routing Protocol: A Hybrid Framework for Routing in Ad-hoc Networks." Ad-hoc Networks, Charlie
      Perkins, editor. Addison Wesley (2001). With M. R. Pearlman.
"A Communication Infrastructure for Smart Environments - A Position Article." IEEE Personal Communications
      Magazine, special issue on "Networking the Physical World," 6-10 (October , 2000).
"Predictive Distance-based Mobility Management for PCS Networks." 2000 Cornell Summer Workshop on
      Information Theory (Bergerfest), Ithaca, NY (August 18-19, 2000). And B. Liang.
"On the Impact of Alternate Path Routing for Load Balancing in Mobile Ad-hoc Networks." First Annual
      IEEE/ACM Workshop on Mobile Ad-hoc Networking & Computing, MobiHOC'2000, Boston, MA (August
      11, 200). With M. R. Pearlman, P. Scholander, and S. S. Tabrizi.
"A Decision-theoretic Approach to Resource Allocation in Wireless Multimedia Networks." Fourth International
      Workshop on Discrete Algorithms and Methods for Mobile Computing, DIALM 2000, Boston, MA (August
      11, 2000). And J. Y. Halpern, L. Li, and S. B. Wicker.
"Securing Ad-hoc Networks." IEEE Network Magazine 13(6) (November/December 1999) With L. Zhou.
"Determining the Optimal Configuration for the Zone Routing Protocol." IEEE Journal on Selected Areas in
      Communications (JSAC), issue on Ad-hoc Networks 17(8):1395-1414 (August, 1999). And M. R.
      Pearlman.
"The Dynamic Packet Reservation Multiple Access Scheme for Multimedia Traffic." ACM/Baltzer Mobile
      Networks Applications 4:87-99 (1999). With D. A. Dyson.
"Ad-hoc Location Management using Quorum Systems." IEEE Transactions on Networking, ACM/IEEE
      Transactions on Networking (April, 1999). And B. Liang.
"The Multiply-detected Macrodiversity Scheme for Wireless Cellular Systems." IEEE Transactions on
      Vehicular Technology 47(2) (May, 1998). And C-P. Li.

New Patent Applications
"ITAMAR - Independent Tree Ad-hoc Multicast Routing." Cornell Research Foundation, Application number: D-
      2823 - Haas. And M. S. Sajama.
"COCA: A Secure Distributed On-line Certification Authority." Cornell Research Foundation, Application
      number: D-2732A - Haas. With F. Schneider, L. Zhou, and R. van Renesse.
"Adaptive Power Control in Wireless Ad-hoc Networks." Cornell Research Foundation, Application number: D-
      2507 - Haas. And Miguel Sanchez.
"Routing and Mobility Management Protocols for Ad-hoc Networks." Cornell Research Foundation, Application
      number: D-2191 - Haas.

Joseph Halpern
Professor, and Co-director:
Cognitive Studies Program
halpern@cs.cornell.edu
http://www.cs.cornell.edu/home/halpern/
Ph.D. Harvard University, 1981

My research is concerned with representing and reasoning about knowledge and uncertainty in multi-agent systems. The work uses tools from logic (particularly modal logic and the idea of possible-worlds semantics), probability theory, distributed systems, game theory, and AI, and I like to think that it contributes to our understanding of each of these areas as well.
     Some themes of my current research include: (1) applying ideas of decision theory to constructing algorithms in asynchronous distributed systems, database systems, and wireless systems, (2) providing foundations for useful qualitative notions of decision theory, (3) reasoning about security.

Honors
Guggenheim Fellowship (for 2001-02).
Fulbright Fellowship (for 2001-02).

University Activities
Co-director: Cognitive Studies Program.
Chair, Admissions Committee, Department of Computer Science.

Professional Activities
Fellow, American Association of Artificial Intelligence.
Editor-in-chief: Journal of the ACM (as of May, 1997).
Consulting Editor: Chicago Journal of Computer Science.
Editorial board: Artificial Intelligence Journal; Information and Computation; Journal of Logic and Computation.
Member: ACM Publications Board.
Chairman: ACM Preprint Repository.
Coordinator: CoRR (Computing Research Repository).
Member: LICS (IEEE Conference on Logic in Computer Science) Advisory Board.
President of Board of Directors: Corporation for Theoretical Aspects of Reasoning About Knowledge.
Program Chair, 16th Annual IEEE Symposium on Logic in Computer Science (2001).
Program Committee Member and Conference Chair, 8th Conference on Theoretical Aspects of Rationality and
      Knowledge (2001).

Lectures
A Computer Scientist Looks at Game Theory.
-. Invited talk, Games 2000, Bilbao, Spain (July, 2000).
-.Invited talk, 4th Conference on Logic and Foundations of Game and Decision Theory, Torino, Italy (July,
      2000).
Plausibility Measures and Default Reasoning. Amsterdam University (May, 2001).
Plausibility Measures: a General Approach for Representing Uncertainty Northwestern University (May, 2001).
Complexity, Logic, and Computation: A Symposium in Honor of Albert Meyer, Boston, MA (June, 2001).

Publications
"Axiomatizing Causal Reasoning." Journal of AI Research 12:317-337 (2000).
"A Note on Knowledge-based Programs and Specifications." Distributed Computing 13(3):145-153 (2000).
"First-order Conditional Logic Revisited." ACM Transactions on Computational Logic 1(2):175-207 (2000). With
      N. Friedman and D. Koller.
"Multi-agent Only Knowing." Journal of Logic and Computation 11(1):41-70 (2001). With G. Lakemeyer.
"A Logic for SDSI's Linked Local Named Spaces." Journal of Computer Security 9(1,2):47-74 (2001). With R.
      van der Meyden.
"A Decision-theoretic Approach to Reliable Message Delivery. Distributed Computing 14:1-16 (2001). With F.
      Chu.
"A Decision-theoretic Approach to Resource Allocation in Wireless Multimedia Networks." Proceedings of Dial
      M for Mobility, 86-95 (2000). With Z. Haas, L. Li, and S. B. Wicker.
"Conditional Plausibility Measures and Bayesian Networks." Proceedings of the Sixteenth Conference on
      Uncertainty in AI, 247-255 (2000).
"Minimum-energy Mobile Wireless Networks Revisited." Proceedings of the IEEE Conference on
      Communications (2001). With L. Li.
"A Logical Reconstruction of SPKI." Proceedings of the 14th IEEE Computer Security Foundations Workshop
      (2001). With R. van der Meyden.
"Review of 'Probability and Conditionals: Belief Revision and Rational Decisions.'" Journal of Philosophical
      Logic 100(2):277-281 (2000).
"The Unusual Effectiveness of Logic in Computer Science." Bulletin of Symbolic Logic 7(2):213-236 (2001).
      With R. Harper, N. Immerman, P. G. Kolaitis, M. Y. Vardi, and V. Vianu.
"Editorial: An Author's Bill of Rights and Responsibilities." Journal of the ACM 47(5):828-825 (2000).
"CoRR: A Computing Research Repository (with commentary)." ACM Journal of Computer Documentation
      24(2):41-48 (2000).

Landmark Publications
Reasoning About Knowledge. MIT Press (1995). With R. Fagin, Y. Moses, and M. Y. Vardi.
"Knowledge and Common Knowledge in a Distributed Environment." Journal of the ACM 37(3):549-587 (1990).
      With Y. Moses. Awarded Godel Prize in 1997.
"Belief, Awareness, and Limited Reasoning." Artificial Intelligence 34:39-76 (1988). With R. Fagin. Conference
      version winner of MIT Press Publisher's Prize as best paper of the 9th International Joint Conference on
      Artificial Intelligence (1985).
"An Analysis of First-order Logics of Probability." Artificial Intelligence 46:311-350 (1990). Conference version
      winner of Publisher's Prize as best paper of the 11th International Joint Conference on Artificial Intelligence
      (1989).
"Plausibility Measures and Default Reasoning." Proceedings of the Thirteenth National Conference on Artificial
      Intelligence, 1297-1304 (1996). To appear in the Journal of the ACM . With N. Friedman. Commended for
      its excellence by the Committee on the "IGPL/FoLLI Prize for the Best Idea of the Year 1996."

Juris Hartmanis
Walter R. Read Professor of Engineering
Turing Award Winner
jh@cs.cornell.edu
Ph.D. California Institute of Technology, 1955

The strategic goal of my research is to contribute to the development of a comprehensive theory of computational complexity. Computational complexity, the study of the quantitative laws that govern computation, is an essential part of the science base needed to guide, harness, and exploit the explosively growing computer technology. My current research interests focus on understanding the computational complexity of chaotic systems and the classification of undecidable problems in complexity theory.

Awards
Recipient of the Grand Medal of the Latvian Academy of Sciences (Lielo Medalu) (2001).

Professional Activities
Member: National Academy of Engineering.
Foreign Member: Latvian Academy of Sciences.
Fellow: American Academy of Arts and Sciences; New York State Academy of Sciences; AAAS.
Editor: Springer-Verlag Lecture Notes in Computer Science; Journal of Computer and Systems Sciences; Fundamenta Informaticae.
Advisory Board: EATCS Monographs in Theoretical Computer Science; Springer-Verlag; International Journal
      of Foundations of Computing.
Member: DIMACS External Advisory Committee.
Member: Santa Fe Institute Science Board.
Member: Santa Fe Institute Science Steering Committee.
Member: University of Cincinnati Computing Program Review Committee (November 1-3, 2000).

University Activities
Chair: Engineering College Nominating Committee.
Member: FCI Founders Committee.

Lectures
Goedel, Undecidability and Automata Theory, Half Century of Automata Theory. University of Western Ontario
       (July 26, 2000).
Four lectures at Jyvaskyle University, Finland, (August 10-11, 2000).
-. Undecidability and Incompleteness Results in Theory of Computing
-. Succinctness and Minimality of Automata Description
-. Search for Limits of Feasible Computations
-. On the Complexity and Shape of Mathematical Proofs
Computational Complexity and Mathematical Proofs, University of Saarbruecken, Germany (August 30, 2000).
What can Computational Complexity Theory Say about Mathematics?
-. Iowa State University (October 23, 2000).
-. Cray Lecture Series, University of Minnesota (October 30, 2000).

Publications
"Computational Complexity and Mathematical Proofs." Informatics- 10 Years Back, 10 Years Ahead.
      Reinhard Wilhelm, editor. Springer-Verlag LNCS 2000, 251-256 (2001).

Mark Heinrich
Assistant Professor
Member of the School of Electrical and Computer Engineering
and the Graduate Field of Computer Science
heinrich@csl.cornell.edu
http://www.csl.cornell.edu/~heinrich/
Ph.D. Stanford University, 1998

My research is concerned with the design of active memory and I/O systems for next-generation servers and data-intensive computing. This work has focused on extending the cache coherence mechanism in modern servers to implement active memory operations-computation performed in the memory system on behalf of the microprocessor to speed up overall execution time. Coupled with this work is the exploration of the effect of new networking technologies (i.e. InfiniBand) on next-generation servers and the integration of active memory and I/O techniques with this networking technology. We have also shown that active memory machines and hardware cache-coherent distributed shared-memory (DSM) machines need much the same support, and, in fact, that by building our single-node active memory system we can also support a multiprocessor version of the machine that we call active memory clusters. Active memory clusters can achieve hardware DSM performance at the low cost of clusters.
     In my work on Active I/O systems I am developing a smart InfiniBand switch (which can also be used in active memory clusters) that can support either normal or intelligent I/O devices, and offload computation from the microprocessor to minimize latency and reduce bandwidth requirements in the I/O system. This work also involves innovative operating system restructuring, including the filesystem and the network stack. The operating system in active I/O systems must be partitioned between the microprocessor and the active I/O devices. Our own operating system, SplitOS, is joint work between our research group and groups at Rutgers and Princeton.
     In work on scalable cache coherence protocols, I am working on issues of fairness and robustness in scalable distributed shared-memory (DSM) machines. In addition, I am looking at the quantitative impact of many coherence protocol techniques by evaluating each technique on a flexible DSM prototype. Together with Martin Burtscher, I am also exploring predictive techniques in cache coherence protocols to minimize latency.

Awards/Honors
Michael Tien '72 Excellence in Teaching Award (2000-2001).
IEEE Teacher of the Year Award (1999-2000).
NSF Faculty Early Career Development Award (2000-2004).

University Activities
Member: Intelligent Information Systems Institute; ECE Curriculum and Standards Committee; ECE Long-
      Range Recruiting Committee; ECE Experimental Systems Recruiting Committee; ECE Circuits & MEMS
      Recruiting Committee; CURIE Summer Program for Women in Engineering; Fields of Electrical
      Engineering, Computer Science.

Professional Activities
Publicity Chair: International Symposium on High-performance Computer Architecture (PCA) (January, 2001).
Panelist: Mathematics, Information, and Computational Sciences Division within the Office of Advanced
      Scientific Computing Research in the Office of Science at the U.S. Department of Energy (DOE) (April,
      2001).
Program Committee: Workshop on Caching, Coherence, and Consistency (WC3), held in conjunction with the
      ACM Conference on Supercomputing (June, 2001).
Program Committee: International Conference on Parallel Architectures and Compilation Techniques (PACT)
      (September, 2001).

Lectures
Flash Forward: Better, Faster, Cooler. Cornell University Silicon Valley Event, hosted by Hunter Rawlings, San
      Mateo, CA (April, 2001).
Providing Hardware DSM Performance at Software DSM Cost. Seminar, University of Rochester (April, 2001).
Hardware DSM Performance at Software DSM Cost. Air Force Research Laboratory, Rome, NY (March, 2001).
A Case for Asynchronous Active Memories. ISCA Workshop on Solving the Memory Wall (June, 2000).

Publications
"FLASH vs. (Simulated) FLASH: Closing the Simulation Loop." In Proceedings of the 9th International
      Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), 49-
      58 (November, 2000). With J. Gibson, R. Kunz, D. Ofelt, M. Horowitz, and J. Hennessy.
"Using Meta-level Compilation to Check FLASH Protocol Code." In Proceedings of the 9th International
      Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), 59-
      70 (November, 2000). With A. Chou, B. Chelf, and D. Engler.
"A Case for Asynchronous Active Memories." In Proceedings of the ISCA Workshop on Solving the Memory
      Wall (June, 2000). With R. Manohar.

Sheila Hemami
Associate Professor
Member of the School of Electrical and Computer Engineering
and the Graduate Field of Computer Science
hemami@cs.cornell.edu
http://www.ece.cornell.edu/people/faculty/faculty_list.shtml#shei
Ph.D. Stanford University, 1994

The emerging information superhighway provides an example of the flexibility required of image and video compression and transmission techniques. Varying network capacities, differences in viewing devices, and a broad spectrum of user needs suggest the desirability of coding techniques that can efficiently span large quality and bandwidth ranges. Additionally, coded data must be robust to errors and loss of varying degrees across multiple network segments. For practicality, algorithms must be inexpensive to implement, in either hardware or software. My research interests broadly concern such communication of visual information. Particular topics of interest include multirate video coding and transmission, compression specific to packet networks and other lossy networks, and psychovisual considerations.

University Activities
College of Engineering Committee of Faculty Women.
Society of Women Engineers Faculty Advisor.
EE Curriculum and Standards Committee.
Peoplesoft Lab Oversight Committee.
EE General Recruiting Committee.
Summer presentation to students in "Inventing an Information Society" (July, 2000).

Professional Activities
Reviewer, IEEE Trans. Signal Processing; IEEE Trans. Image Processing, IEEE Trans. Circuits and Systems for Video Technology; IEEE Communications Letters; IEEE ICIP 2001.
Associate Editor, IEEE Trans. Signal Processing.

Awards/Honors
HKN C. Holmes MacDonald Outstanding Teaching Award.
Michael Tien '72 Cornell College of Engineering Teaching Award.
Fulbright Distinguished Lecturer, State of Morocco (2001).

Publications
"Perceptual Quantization for Wavelet-based Image Coding." Proc. IEEE Int. Conf.