Browse

ftp://ftp.cs.uiuc.edu (394)

	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/janeliu/uiucdcs1627-doc.ps, 19920218 Scheduling Tasks with AND/OR Precedence Constraints Donald W. Gillies and Jane W.-S. Liu Department of Computer Science University of Illinois at Urbana-Champaign 1304 W. Springfield Urbana, Illinois 61801 USA (217) 244-0432 email: gillies@cs.uiuc.edu Wednesday, December 4, 1991
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/janeliu/uiucdcs1627-fig.ps, 19920218 5 10 15 20 25 30 35 40 45 49 T'4T'5T'6 T1T2T3 290 5 10 15 20 25 30 35 40 45 49 T'1T'2T'3T'4T'5T'6 T1T2T3T4T5T6 29 5 10 15 20 25 30 35 40 45 49 T'1T'2T'3 T4T5T6 290 (b) Before scheduling (c) Feasible schedule #1 (truth) (d) Feasible schedule #2 (falsity) Figure A.5. Simple in-trees for a variable
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-92-1741.ps.Z, 19920928 c Copyright by David Wayne Dykstra 1992 OBJECT-ORIENTED HIERARCHIES ACROSS PROTECTION BOUNDARIES BY DAVID WAYNE DYKSTRA B.S., University of Illinois, 1983 M.S., Illinois Institute of Technology, 1987 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-92-1754.ps.Z, 19920928 REPORT NO. UIUCDCS-R-92-1754 UILU-ENG-92-1734 The Complexity of Pursuit on a Graph by Arthur S. Goldstein Edward M. Reingold June 1992 1
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-92-1754.ps.Z, 19920928 REPORT NO. UIUCDCS-R-92-1754 UILU-ENG-92-1734 The Complexity of Pursuit on a Graph by Arthur S. Goldstein Edward M. Reingold June 1992 1
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-92-1757.ps.Z, 19920928 REPORT NO. UIUCDCS-R-92-1757 Multidimensional Divide-and-Conquer Maximin Recurrences by Laurent Alonso Edward M. Reingold Ren e Schott June 1992 DEPARTMENT OF COMPUTER SCIENCE 1304 W. SPRINGFIELD AVENUE UNIVERSITY OF ILLINOIS AT URBANA-CHAMPAIGN URBANA, IL 61801 This research has been supported in part
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-92-1749.ps.Z, 19920928 AUTOMATED ACQUISITION AND REFINEMENT OF REUSABLE SOFTWARE DESIGN COMPONENTS BY HING-YAN LEE B.S., Imperial College of Science and Technology, 1981 M.S., Imperial College of Science and Technology, 1982 M.S., University of Illinois, 1991 THESIS Submitted in partial fulfillment of the requirements for the
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-92-1755.ps.Z, 19920928 1 CHAPTER 1. Introduction Since the earliest days of the computer era there has been an intense interest in visualizing objects, data, and other real or imaginary entities on the computer screen. Advertisers desire methods for producing high quality graphic arts in a cost effective fashion. Cartoonists
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-92-1763.ps.Z, 19920928 ENCODING PROBLEMS IN CONTROLLER SYNTHESIS BY DAVID MARK BINGER B.S., The University of the South, 1985 M.S., University of Illinois, 1987 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in the Graduate College of the University of
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-92-1741.ps.Z, 19920928 c Copyright by David Wayne Dykstra 1992 OBJECT-ORIENTED HIERARCHIES ACROSS PROTECTION BOUNDARIES BY DAVID WAYNE DYKSTRA B.S., University of Illinois, 1983 M.S., Illinois Institute of Technology, 1987 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-92-1758.ps.Z, 19920928 Copyright by Infan Kuok Cheong 1992 SCHEDULING IMPRECISE HARD REAL-TIME JOBS WITH CUMULATIVE ERROR BY INFAN KUOK CHEONG B.S., University of Houston, 1982 M.S., University of Illinois, 1987 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-92-1759.ps.Z, 19920928 REFACTORING OBJECT-ORIENTED FRAMEWORKS BY WILLIAM F. OPDYKE B.S., Drexel University, 1979 B.S., Drexel University, 1979 M.S., University of Wisconsin - Madison, 1982 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in the Graduate
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-92-1735.ps.Z, 19920928 Internet Protocol Traffic Analysis with Applications for ATM Switch Design Andrew Schmidt and Roy Campbell University of Illinois at Urbana-Champaign Department of Computer Science 1304 W. Springfield Avenue, Urbana, IL 61801 (217) 244-0582
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-92-1761.ps.Z, 19920928 A PORTABLE SYSTEM FOR DATA SONIFICATION BY TARA MAJA MADHYASTHA B.A., Rutgers State University, 1990 THESIS Submitted in partial fulfillment of the requirements for the degree of Master of Science in Computer Science in the Graduate College of the University of Illinois at Urbana-Champaign, 1992 Urbana,
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-92-1757.ps.Z, 19920928 REPORT NO. UIUCDCS-R-92-1757 Multidimensional Divide-and-Conquer Maximin Recurrences by Laurent Alonso Edward M. Reingold Ren e Schott June 1992 DEPARTMENT OF COMPUTER SCIENCE 1304 W. SPRINGFIELD AVENUE UNIVERSITY OF ILLINOIS AT URBANA-CHAMPAIGN URBANA, IL 61801 This research has been supported in part
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-92-1763.ps.Z, 19920928 ENCODING PROBLEMS IN CONTROLLER SYNTHESIS BY DAVID MARK BINGER B.S., The University of the South, 1985 M.S., University of Illinois, 1987 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in the Graduate College of the University of
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-92-1732.ps.Z, 19921001 c Copyright by KENNETH PAUL SMITH 1992 MANAGING RULES IN ACTIVE DATABASES BY KENNETH PAUL SMITH B.S., Abilene Christian University, 1979 M.S., University of Texas at Austin, 1986 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in the
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-92-1732.ps.Z, 19921001 c Copyright by KENNETH PAUL SMITH 1992 MANAGING RULES IN ACTIVE DATABASES BY KENNETH PAUL SMITH B.S., Abilene Christian University, 1979 M.S., University of Texas at Austin, 1986 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in the
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-92-1774.ps.Z, 19921103 1 CHAPTER 1. INTRODUCTION A hard real-time computing system is one in which there are time-critical tasks. Time-critical tasks have timing constraints imposed on them. The result produced by such a task is correct only if the result is produced within the timing constraints, in addition to being
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-92-1772.ps.Z, 19921109 A CARTESIAN PARALLEL NESTED DISSECTION ALGORITHM MICHAEL T. HEATH y AND PADMA RAGHAVAN z
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-92-1760.ps.Z, 19921110 Weighted Alpha Shapes1 Herbert Edelsbrunner2
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-92-1762.ps.Z, 19921110 c Copyright by OZG UR ULUSOY 1992 CONCURRENCY CONTROL IN REAL-TIME DATABASE SYSTEMS BY OZG UR ULUSOY B.Sc., Middle East Technical University, Ankara, 1986 M.Sc., Bilkent University, Ankara, 1988 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-92-1760.ps.Z, 19921110 Weighted Alpha Shapes1 Herbert Edelsbrunner2
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-92-1768.ps.Z, 19921111 EXPERIMENTAL ANALYSIS OF DATA MANAGEMENT FOR DISTRIBUTED DATA STRUCTURES BY BRIAN KEITH TOTTY B.S., Massachusetts Institute of Technology, 1988 THESIS Submitted in partial fulfillment of the requirements for the degree of Master of Science in Computer Science in the Graduate College of the University of
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-92-1767.ps.Z, 19921112 c Copyright by Hsien Ching Kelvin Sung 1992 THE AREA SAMPLING MACHINE BY HSIEN CHING KELVIN SUNG B.S., University of Wisconsin, 1986 M.S., University of Illinois, 1990 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in the Graduate
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/reddy/papers/termination.ps.Z, 19921116 A Framework of Directionality for Proving Termination of Logic Programs Francois Bronsard T.K. Lakshman1 Uday S. Reddy Department of Computer Science University of Illinois at Urbana-Champaign Urbana, Illinois 61801, USA internet: hbronsard,lakshman,reddyi@cs.uiuc.edu
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-92-1733.ps.Z, 19921116 A Completable Approach to Integrating Planning and Scheduling Melinda T. Gervasio and Gerald F. DeJong Beckman Institute For Advanced Science and Technology University of Illinois at Urbana Champaign 405 N. Mathews Ave., Urbana, IL 61801 (217) 244 1503 gervasio@cs.uiuc.edu dejong@cs.uiuc.edu
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-92-1775.ps.Z, 19921123 Vita Lucja Iwa nska was born on August 14, 1958 in Walbrzych, Poland. She graduated with honors from Moscow Power Engineering Institute, Department of Automation and Computer Science, in 1982 obtain- ing a M.Engr. degree in Computer Science. After three years of working as a Research Associate in the
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-92-1775.ps.Z, 19921123 Vita Lucja Iwa nska was born on August 14, 1958 in Walbrzych, Poland. She graduated with honors from Moscow Power Engineering Institute, Department of Automation and Computer Science, in 1982 obtain- ing a M.Engr. degree in Computer Science. After three years of working as a Research Associate in the
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-92-1751.ps.Z, 19921124 Copyright c 1992 by Peter William Madany AN OBJECT-ORIENTED FRAMEWORK FOR FILE SYSTEMS BY PETER WILLIAM MADANY B.A., Trinity Christian College, 1982 M.S., Illinois Institute of Technology, 1984 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-92-1744.ps.Z, 19921130 MULTIGRID SOLUTION OF THE POISSON-BOLTZMANN EQUATION MICHAEL HOLSTy AND FAISAL SAIEDy
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-92-1744.ps.Z, 19921130 MULTIGRID SOLUTION OF THE POISSON-BOLTZMANN EQUATION MICHAEL HOLSTy AND FAISAL SAIEDy
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-92-1746.ps.Z, 19921209 EQUATIONAL INFERENCE, CANONICAL PROOFS, AND PROOF ORDERINGS Leo Bachmair Department of Computer Science State University of New York at Stony Brook Stony Brook, New York 11794, U.S.A. Nachum Dershowitz Department of Computer Science University of Illinois at Urbana-Champaign Urbana, Illinois 61801,
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-92-1746.ps.Z, 19921209 EQUATIONAL INFERENCE, CANONICAL PROOFS, AND PROOF ORDERINGS Leo Bachmair Department of Computer Science State University of New York at Stony Brook Stony Brook, New York 11794, U.S.A. Nachum Dershowitz Department of Computer Science University of Illinois at Urbana-Champaign Urbana, Illinois 61801,
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-92-1784.ps.Z, 19921210 c Copyright by David Wayne Jensen 1993 DISK I/O IN HIGH-PERFORMANCE COMPUTING SYSTEMS BY DAVID WAYNE JENSEN B.S., Iowa State University of Science and Technology, 1979 M.S., Syracuse University, 1983 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-92-1783.ps.Z, 19921211 c Copyright by Tiow-Seng Tan, 1993 OPTIMAL TWO-DIMENSIONAL TRIANGULATIONS BY TIOW-SENG TAN B.Sc., National University of Singapore, 1984 M.Sc., National University of Singapore, 1988 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-92-1769.ps.Z, 19921211 Choices , Frameworks and Refinement Roy H. Campbell and Nayeem Islam Peter Madany Department of Computer Science Sun Microsystems Laboratories, Inc. University of Illinois at Urbana-Champaign Mountain View, CA 94043 USA Urbana, IL 61801 USA We present a method for designing operating systems as an
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-92-1783.ps.Z, 19921211 c Copyright by Tiow-Seng Tan, 1993 OPTIMAL TWO-DIMENSIONAL TRIANGULATIONS BY TIOW-SENG TAN B.Sc., National University of Singapore, 1984 M.Sc., National University of Singapore, 1988 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-92-1770.ps.Z, 19921211 Reusable Data Flow Diagrams Nayeem Islam and Roy H. Campbell University of Illinois at Urbana-Champaign Department of Computer Science 1304 W. Springfield Avenue, Urbana, IL 61801 While the reuse of code and interfaces has been the primary focus in object-oriented system design, the reuse of large scale
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-93-1786.ps.Z, 19921215 c Copyright by Hidenori Nakazato 1993 ISSUES ON SYNCHRONIZING AND SCHEDULING TASKS IN REAL-TIME DATABASE SYSTEMS BY HIDENORI NAKAZATO B.Engr., Waseda University, 1982 M.S., University of Illinois, 1989 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-92-1782.ps.Z, 19921215 A MODIFIED DIRECT PRECONDITIONER FOR INDEFINITE SYMMETRIC TOEPLITZ SYSTEMS Paul Concus Lawrence Berkeley Laboratory and Department of Mathematics University of California Berkeley, CA 94720 concus@lbl.gov Paul E. Saylory Department of Computer Science University of Illinois Urbana, IL 61801
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-92-1782.ps.Z, 19921215 A MODIFIED DIRECT PRECONDITIONER FOR INDEFINITE SYMMETRIC TOEPLITZ SYSTEMS Paul Concus Lawrence Berkeley Laboratory and Department of Mathematics University of California Berkeley, CA 94720 concus@lbl.gov Paul E. Saylory Department of Computer Science University of Illinois Urbana, IL 61801
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-92-1785.ps.Z, 19921217 c Copyright by Daniel Irowa Okunbor 1992 REPORT NO. UIUCDCS-R-92-1785 CANONICAL INTEGRATION METHODS FOR HAMILTONIAN DYNAMICAL SYSTEMS BY DANIEL IROWA OKUNBOR B.Sc., University of Benin, 1983 M.Sc., University of Benin, 1986 THESIS Submitted in partial fulfillment of the requirements for the degree of
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-92-1785.ps.Z, 19921217 c Copyright by Daniel Irowa Okunbor 1992 REPORT NO. UIUCDCS-R-92-1785 CANONICAL INTEGRATION METHODS FOR HAMILTONIAN DYNAMICAL SYSTEMS BY DANIEL IROWA OKUNBOR B.Sc., University of Benin, 1983 M.Sc., University of Benin, 1986 THESIS Submitted in partial fulfillment of the requirements for the degree of
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-92-1781.ps.Z, 19921230 Counting Triangle Crossings and Halving Planes1 Tamal K. Dey2 and Herbert Edelsbrunner2
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-92-1781.ps.Z, 19921230 Counting Triangle Crossings and Halving Planes1 Tamal K. Dey2 and Herbert Edelsbrunner2
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-93-1787.ps.Z, 19930105 An Incremental Algorithm for Betti Numbers of Simplicial Complexes1 Cecil Jose A. Delfinado2 and Herbert Edelsbrunner2
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-93-1787.ps.Z, 19930105 An Incremental Algorithm for Betti Numbers of Simplicial Complexes1 Cecil Jose A. Delfinado2 and Herbert Edelsbrunner2
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-92-1765.ps.Z, 19930107 Report No. UIUCDCS-R-92-1765 SCHEDULING IN REAL-TIME SYSTEMS TO ENSURE GRACEFUL DEGRADATION: THE IMPRECISE-COMPUTATION AND THE DEFERRED-DEADLINE APPROACHES. BY WEI-KUAN SHIH B.S., National Taiwan University, 1982 M.S., National Taiwan University, 1984 THESIS Submitted in partial fulfillment of the
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-93-1790.ps.Z, 19930128 The Union of Balls and its Dual Shape1 Herbert Edelsbrunner2
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-93-1790.ps.Z, 19930128 The Union of Balls and its Dual Shape1 Herbert Edelsbrunner2
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-93-1791.ps.Z, 19930212 SCHEDULABILITY ANALYZER TOOL BY JUAN LUIS REDONDO Licen., Universidad Polit ecnica de Madrid, 1990 THESIS Submitted in partial fulfillment of the requirements for the degree of Master of Science in Computer Science in the Graduate College of the University of Illinois at Urbana-Champaign, 1993 Urbana,
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-93-1795.ps.Z, 19930222 1 CHAPTER 1. INTRODUCTION A hard real-time system is one in which there is a timing constraint imposed on every time- critical task. The simplest timing constraint is given as a deadline. The result produced by a time- critical task must be available by the task's deadline, in addition to being
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-93-1793.ps.Z, 19930223 DISTRIBUTED SOLUTION OF SPARSE LINEAR SYSTEMS MICHAEL T. HEATH y AND PADMA RAGHAVAN z
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-93-1794.ps.Z, 19930223 LINE AND PLANE SEPARATORS PADMA RAGHAVAN y
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-93-1792.ps.Z, 19930301 REPORT NO. UIUCDCS-R-93-1792 AN EXAMINATION OF INDUCTIVE LEARNING ALGORITHMS FOR THE CLASSIFICATION OF SLEEP SIGNALS by John A. Bentrup Sylvian R. Ray February 1993 DEPARTMENT OF COMPUTER SCIENCE 1304 W. SPRINGFIELD AVENUE UNIVERSITY OF ILLINOIS AT URBANA-CHAMPAIGN URBANA, IL 61801 This report is a
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-93-1792.ps.Z, 19930301 REPORT NO. UIUCDCS-R-93-1792 AN EXAMINATION OF INDUCTIVE LEARNING ALGORITHMS FOR THE CLASSIFICATION OF SLEEP SIGNALS by John A. Bentrup Sylvian R. Ray February 1993 DEPARTMENT OF COMPUTER SCIENCE 1304 W. SPRINGFIELD AVENUE UNIVERSITY OF ILLINOIS AT URBANA-CHAMPAIGN URBANA, IL 61801 This report is a
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-93-1788.ps.Z, 19930304 c Copyright by Young-Tack Park 1993 BLACKBOARD SCHEDULER CONTROL KNOWLEDGE FOR HEURISTIC CLASSIFICATION: REPRESENTATION AND INFERENCE BY YOUNG-TACK PARK B.S., Seoul National University, 1978 M.S., Korea Advanced Institute of Science, 1980 THESIS Submitted in partial fulfillment of the requirements for
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-93-1788.ps.Z, 19930304 c Copyright by Young-Tack Park 1993 BLACKBOARD SCHEDULER CONTROL KNOWLEDGE FOR HEURISTIC CLASSIFICATION: REPRESENTATION AND INFERENCE BY YOUNG-TACK PARK B.S., Seoul National University, 1978 M.S., Korea Advanced Institute of Science, 1980 THESIS Submitted in partial fulfillment of the requirements for
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-93-1797.ps.Z, 19930309 CONSTRUCTING DELAUNAY AND REGULAR TRIANGULATIONS IN THREE DIMENSIONS BY MICHAEL ALLEN FACELLO B.S., Johns Hopkins University, 1990 THESIS Submitted in partial fulfillment of the requirements for the degree of Master of Science in Computer Science in the Graduate College of the University of Illinois at
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-93-1797.ps.Z, 19930309 CONSTRUCTING DELAUNAY AND REGULAR TRIANGULATIONS IN THREE DIMENSIONS BY MICHAEL ALLEN FACELLO B.S., Johns Hopkins University, 1990 THESIS Submitted in partial fulfillment of the requirements for the degree of Master of Science in Computer Science in the Graduate College of the University of Illinois at
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-93-1798.ps.Z, 19930323 Generalized Kraft's Inequality and Discrete k-Modal Search Anmol Mathur Edward M. Reingold Department of Computer Science University of Illinois at Urbana-Champaign 1304 W. Springfield Avenue Urbana, Illinois 61801 USA March, 1993
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-93-1798.ps.Z, 19930323 Generalized Kraft's Inequality and Discrete k-Modal Search Anmol Mathur Edward M. Reingold Department of Computer Science University of Illinois at Urbana-Champaign 1304 W. Springfield Avenue Urbana, Illinois 61801 USA March, 1993
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-93-1796.ps.Z, 19930329 1 1 CHARM++ : A Portable Concurrent Object Oriented System Based On C++ Laxmikant V. Kale Department of Computer Science, University of Illinois, Urbana-Champaign. email : kale@cs.uiuc.edu Phone : (217) 244-0094 Sanjeev Krishnan Department of Computer Science, University of Illinois, Urbana-Champaign.
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-93-1799.ps.Z, 19930330 Statechart split bars alpha epsilon gamma e d c delta selection state-creation transition-creation redraw zoom out/in visibility REPORT NO. UIUCDCS-R-93-1799 UILU-ENG-93-1714 A GRAPHICAL EDITOR PROPOSAL FOR DEVELOPING CONCURRENT, HIERARCHICAL, FINITE STATE MACHINES by Paul Jay Lucas January 1993 1 A
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-93-1799.ps.Z, 19930330 Statechart split bars alpha epsilon gamma e d c delta selection state-creation transition-creation redraw zoom out/in visibility REPORT NO. UIUCDCS-R-93-1799 UILU-ENG-93-1714 A GRAPHICAL EDITOR PROPOSAL FOR DEVELOPING CONCURRENT, HIERARCHICAL, FINITE STATE MACHINES by Paul Jay Lucas January 1993 1 A
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/ray.old/cs384.ps, 19930413 X Graph tstout.d Y X -3.50 -3.00 -2.50 -2.00 -1.50 -1.00 -0.50 0.00 0.50 1.00 0.00 50.00 100.00 150.00 200.00 250.00
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-93-1800.ps.Z, 19930419 EFFICIENT INDEXING OF SPATIAL OBJECTS IN OBJECT-ORIENTED DATABASES BY JUI-TINE LEE B.S., National Taiwan University, 1983 M.S., University of Illinois at Urbana-Champaign, 1990 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in the
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-93-1801.ps.Z, 19930430 Rational Learning: A Principled Approach to Balancing Learning and Action Jonathan Gratch and Gerald DeJong Beckman Institute for Advanced Science and Technology University of Illinois 405 N. Mathews Urbana, IL 61801 gratch@cs.uiuc.edu Keywords Utility Analysis Decision Theory Flexible Bias Speed-up
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-93-1802.ps.Z, 19930430 PERTS: A Prototyping Environment for Real-Time Systems Jane W. S. Liu Juan-Luis Redondo Zhong Deng Too-Seng Tia Riccardo Bettati Ami Silberman Matthew Storch Rhan Ha Wei-Kuan Shih Department of Computer Science University of Illinois Urbana, Illinois 61801 Email address: janeliu@cs.uiuc.edu Phone: (217)
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-93-1801.ps.Z, 19930430 Rational Learning: A Principled Approach to Balancing Learning and Action Jonathan Gratch and Gerald DeJong Beckman Institute for Advanced Science and Technology University of Illinois 405 N. Mathews Urbana, IL 61801 gratch@cs.uiuc.edu Keywords Utility Analysis Decision Theory Flexible Bias Speed-up
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-93-1803.ps.Z, 19930505 A CONSTRAINT LOGIC APPROACH TO AUTOMATED MODAL DEDUCTION BY RICHARD BRIAN SCHERL A.B., Columbia University, 1974 Diploma, Madurai University (India), 1977 M.A., University of Chicago, 1981 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-93-1803.ps.Z, 19930505 A CONSTRAINT LOGIC APPROACH TO AUTOMATED MODAL DEDUCTION BY RICHARD BRIAN SCHERL A.B., Columbia University, 1974 Diploma, Madurai University (India), 1977 M.A., University of Chicago, 1981 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-93-1806.ps.Z, 19930524 BY JONATHAN MATTHEW GRATCH B.A., University of Texas at Austin, 1986 COMPOSER: A Decision-theoretic Approach to Adaptive Problem Solving THESIS Submitted in partial fulfillment of the requirements for the degree of Master of Science in Computer Science in the Graduate College of the University of
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-93-1806.ps.Z, 19930524 BY JONATHAN MATTHEW GRATCH B.A., University of Texas at Austin, 1986 COMPOSER: A Decision-theoretic Approach to Adaptive Problem Solving THESIS Submitted in partial fulfillment of the requirements for the degree of Master of Science in Computer Science in the Graduate College of the University of
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-93-1813.ps.Z, 19930601 ON THE LEARNABILITY OF DISJUNCTIVE NORMAL FORM FORMULAS AND DECISION TREES BY HOWARD JAY AIZENSTEIN B.S., University of Illinois at Urbana-Champaign, 1986 M.S., University of Illinois at Urbana-Champaign, 1988 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-93-1813.ps.Z, 19930601 ON THE LEARNABILITY OF DISJUNCTIVE NORMAL FORM FORMULAS AND DECISION TREES BY HOWARD JAY AIZENSTEIN B.S., University of Illinois at Urbana-Champaign, 1986 M.S., University of Illinois at Urbana-Champaign, 1988 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-92-1756.ps.Z, 19930604 Jonathan Gratch and Gerald DeJong Beckman Institute for Advanced Studies,University of Illinois 405 N. Mathews, Urbana, IL 61801 e mail: gratch.cs.uiuc.edu Rational Learning: Finding a Balance Between Utility and Efficiency Youhong Yang Department of Statistics, University of Illinois 725 S. Wright,
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-93-1809.ps.Z, 19930607 A VISUAL PROGRAMMING LANGUAGE FOR VISUALIZATION OF SCIENTIFIC DATA BY DANIEL DAVID HILS B.S., John Carroll University, 1985 M.S., University of Illinois, 1987 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in the Graduate College of
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-93-1809.ps.Z, 19930607 A VISUAL PROGRAMMING LANGUAGE FOR VISUALIZATION OF SCIENTIFIC DATA BY DANIEL DAVID HILS B.S., John Carroll University, 1985 M.S., University of Illinois, 1987 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in the Graduate College of
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-93-1815.ps.Z, 19930611 The Concert System { Compiler and Runtime Support for Efficient, Fine-Grained Concurrent Object-Oriented Programs Andrew A. Chien Vijay Karamcheti John Plevyak Department of Computer Science 1304 W. Springfield Avenue Urbana, IL 61801 fachien,vijayk,jplevyakg@cs.uiuc.edu June 11, 1993
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-93-1816.ps.Z, 19930614 Copyright by Susan Vlasta Vrbsky, 1993 APPROXIMATE: A QUERY PROCESSOR THAT PRODUCES MONOTONICALLY IMPROVING APPROXIMATE ANSWERS BY SUSAN VLASTA VRBSKY B.A., Northwestern University, 1975 M.S., Southern Illinois University, 1983 THESIS Submitted in partial fulfillment of the requirements for the degree
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-93-1808.ps.Z, 19930614 UNBOUNDED UNIMODAL SEARCH AND PURSUIT PROBLEMS BY ARTHUR SANDER GOLDSTEIN B.Phys., University of Minnesota, 1983 M.S., University of Illinois, 1985 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in the Graduate College of the
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-91-1716.ps.Z, 19930617 c Copyright by Lawrence Bruce Holder, Jr. 1993 MAINTAINING THE UTILITY OF LEARNED KNOWLEDGE USING MODEL-BASED ADAPTIVE CONTROL BY LAWRENCE BRUCE HOLDER, JR. B.S., University of Illinois, 1986 M.S., University of Illinois, 1988 THESIS Submitted in partial fulfillment of the requirements for the degree of
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-93-1810.ps.Z, 19930621 - title page here - 1 - red-bordered form here - 2
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-93-1810.ps.Z, 19930621 - title page here - 1 - red-bordered form here - 2
	ftp://ftp.cs.uiuc.edu/pub/dcs/Locally_Developed_Software/CHARM/old/ABOUT_CHARM.ps, 19930628 Parallel Programming with CHARM CHARM is a machine independent parallel programming system. Programs written using this system will run unchanged on MIMD machines with or without a shared memory. It provides high-level mechanisms and strategies to facilitate the task of developing even highly complex
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-91-1695.ps.Z, 19930628 OPPORTUNISTIC CONSTRUCTIVE INDUCTION: USING FRAGMENTS OF DOMAIN KNOWLEDGE TO GUIDE CONSTRUCTION BY GREGG HAROLD GUNSCH B.S., University of North Dakota, 1979 M.S., Air Force Institute of Technology, 1983 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-91-1695.ps.Z, 19930628 OPPORTUNISTIC CONSTRUCTIVE INDUCTION: USING FRAGMENTS OF DOMAIN KNOWLEDGE TO GUIDE CONSTRUCTION BY GREGG HAROLD GUNSCH B.S., University of North Dakota, 1979 M.S., Air Force Institute of Technology, 1983 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-92-1777.ps.Z, 19930702 c Copyright by Vipin Swarup, 1992 TYPE THEORETIC PROPERTIES OF ASSIGNMENTS BY VIPIN SWARUP B.Tech., Indian Institute of Technology, 1984 M.S., University of Illinois, 1988 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in the
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-92-1777.ps.Z, 19930702 c Copyright by Vipin Swarup, 1992 TYPE THEORETIC PROPERTIES OF ASSIGNMENTS BY VIPIN SWARUP B.Tech., Indian Institute of Technology, 1984 M.S., University of Illinois, 1988 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in the
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-93-1817.ps.Z, 19930706 REPLICA CONTROL PROTOCOLS THAT GUARANTEE HIGH AVAILABILITY AND LOW ACCESS COST BY CHIENWEN WU B.Sc., National Chiao Tung University, 1986 M.S., University of Illinois at Urbana-Champaign, 1991 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-93-1817.ps.Z, 19930706 REPLICA CONTROL PROTOCOLS THAT GUARANTEE HIGH AVAILABILITY AND LOW ACCESS COST BY CHIENWEN WU B.Sc., National Chiao Tung University, 1986 M.S., University of Illinois at Urbana-Champaign, 1991 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-93-1818.ps.Z, 19930709 DISTRIBUTED SPARSE GAUSSIAN ELIMINATION AND ORTHOGONAL FACTORIZATION PADMA RAGHAVAN y
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-93-1820.ps.Z, 19930712 c Copyright by Charles David Page Jr. 1993 ANTI-UNIFICATION IN CONSTRAINT LOGICS: FOUNDATIONS AND APPLICATIONS TO LEARNABILITY IN FIRST-ORDER LOGIC, TO SPEED-UP LEARNING, AND TO DEDUCTION BY CHARLES DAVID PAGE JR. B.A., Clemson University, 1985 M.S., Clemson University, 1987 THESIS Submitted in partial
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-93-1821.ps.Z, 19930716 c Copyright by Michael Jay Holst, 1993 MULTILEVEL METHODS FOR THE POISSON-BOLTZMANN EQUATION BY MICHAEL JAY HOLST B.S., Colorado State University, 1987 M.S., University of Illinois, 1990 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-93-1821.ps.Z, 19930716 c Copyright by Michael Jay Holst, 1993 MULTILEVEL METHODS FOR THE POISSON-BOLTZMANN EQUATION BY MICHAEL JAY HOLST B.S., Colorado State University, 1987 M.S., University of Illinois, 1990 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-93-1822.ps.Z, 19930722 LANGUAGE ACQUISITION IN A UNIFICATION-BASED GRAMMAR PROCESSING SYSTEM USING A REAL-WORLD KNOWLEDGE BASE BY DALE W. RUSSELL B.A., Geneva College, 1981 A.M., University of Illinois, 1983 Ph.D., University of Illinois, 1987 THESIS Submitted in partial fulfillment of the requirements for the degree of
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-93-1823.ps.Z, 19930722 A Technique for Documenting the Framework of an Object-Oriented System Roy H. Campbell and Nayeem Islam University of Illinois at Urbana-Champaign Department of Computer Science 1304 W. Springfield Avenue Urbana, IL 61801
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-93-1824.ps.Z, 19930722
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-93-1827.ps.Z, 19930805 CHAPTER 1 BACKGROUND 1.1. De nitions File migration is concerned with the movement of les between storage devices and media with different characteristics; normally this involves the movement of less active les to slower,less expensive storage and leaving more active les on faster,more expensive storage
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/reddy/papers/assign.ps.Z, 19930816 Assignments for Applicative Languages Vipin Swarupy The MITRE Corporation Burlington Road Bedford, MA 01730. E-mail: swarup@mitre.org Uday S. Reddyz Dept. of Computer Science University of Illinois at Urbana-Champaign Urbana, IL 61801. E-mail: reddy@cs.uiuc.edu Evan Ireland School of Information
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/reddy/papers/global.ps.Z, 19930816 Global State Considered Unnecessary: Semantics of Interference-free Imperative Programming Uday S. Reddy Department of Computer Science University of Illinois at Urbana-Champaign Urbana, IL 61801 Net: reddy@cs.uiuc.edu May 25, 1993 1 Introduction Idealized Algol, due to Reynolds , is a clean
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/reddy/papers/state.bibliography.ps, 19930817 Programming Languages for State Manipulation Bibliography August 17, 1993 The following reading list is based on a course taught by S. N. Kamin and U. S. Reddy during Spring 1993 at the University of Illinois at Urbana-Champaign. 1 Introduction ffl State, Review of lambda calculus (12 ) 2 Algol-like
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/reddy/tkl/SoftTyping.ps.Z, 19930818 Soft Typing with Conditional Types Alexander Aiken and Edward L. Wimmers IBM Almaden Research Center 650 Harry Rd., San Jose, CA 95120 faiken,wimmersg@almaden.ibm.com T. K. Lakshmany Department of Computer Science University of Illinois at Urbana-Champaign 1304 W. Springfield Ave, Urbana, IL 61801
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-93-1830.ps.Z, 19930824 c Copyright by Taewhan Kim 1993 SCHEDULING AND ALLOCATION PROBLEMS IN HIGH-LEVEL SYNTHESIS BY TAEWHAN KIM B.S., Seoul National University, 1985 M.S., Seoul National University, 1987 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-93-1828.ps.Z, 19930901 Automatic Generation and Management of Program Analyses Kwangkeun Yi Department of Computer Science Center for Supercomputing Research and Development1 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosphy in Computer Science in the Graduate College of the
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-93-1828.ps.Z, 19930901 Automatic Generation and Management of Program Analyses Kwangkeun Yi Department of Computer Science Center for Supercomputing Research and Development1 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosphy in Computer Science in the Graduate College of the
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-92-1748.ps.Z, 19930903 REPORT NO. UIUCDCS-R-92-1748 UILU-ENG-92-1728 Scheduling Real-Time Computations with Temporal Distance and Separation Constraints and with Extended Deadlines by Ching-Chih Han June 1992 REPORT NO. UIUCDCS-R-92-1748 SCHEDULING REAL-TIME COMPUTATIONS WITH TEMPORAL DISTANCE AND SEPARATION CONSTRAINTS AND
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-93-1832.ps.Z, 19930927 c Copyright by Tom Zhong-Yu Zhou 1993 APPLICATION-INDEPENDENT USER INTERFACE DESIGN USING AN APPLICATION EXPOSURE BY TOM ZHONG-YU ZHOU M.S., University of Lowell, 1989 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in the Graduate
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-93-1832.ps.Z, 19930927 c Copyright by Tom Zhong-Yu Zhou 1993 APPLICATION-INDEPENDENT USER INTERFACE DESIGN USING AN APPLICATION EXPOSURE BY TOM ZHONG-YU ZHOU M.S., University of Lowell, 1989 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in the Graduate
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-93-1834.ps.Z, 19931001 Incomplete Factorization Preconditioning for Linear Least Squares Problems BY Xiaoge Wang B.S., Tsinghua University, P. R. China, 1982 M.S., Tsinghua University, P. R. China, 1984 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-93-1836.ps.Z, 19931012 SHAPES AND IMPLEMENTATIONS IN THREE-DIMENSIONAL GEOMETRY Ernst Peter Mucke Department of Computer Science University of Illinois at Urbana-Champaign September, 1993
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-93-1836.ps.Z, 19931012 SHAPES AND IMPLEMENTATIONS IN THREE-DIMENSIONAL GEOMETRY Ernst Peter M ucke Department of Computer Science University of Illinois at Urbana-Champaign September, 1993
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-93-1838.ps.Z, 19931018 PROGRAMMING IN THREE DIMENSIONS BY MARC-ALEXANDER NAJORK Dipl.-Wirtsch. Inf., Technische Hochschule Darmstadt, Germany, 1989 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in the Graduate College of the University of Illinois at
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-93-1838.ps.Z, 19931018 PROGRAMMING IN THREE DIMENSIONS BY MARC-ALEXANDER NAJORK Dipl.-Wirtsch. Inf., Technische Hochschule Darmstadt, Germany, 1989 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in the Graduate College of the University of Illinois at
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-93-1831.ps.Z, 19931020 c Copyright by Ziad H. Najem 1994 A HIERARCHICAL REPRESENTATION OF CONTROL KNOWLEDGE FOR A HEURISTIC CLASSIFICATION SHELL Ziad H. Najem, Ph.D. Department of Computer Science University of Illinois at Urbana-Champaign, 1994 David C. Wilkins, Advisor A central component of expertise is control knowledge
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/reddy/papers/state.full.ps.Z, 19931028 A Linear Logic Model of State Uday S. Reddy Department of Computer Science University of Illinois at Urbana-Champaign Urbana, IL 61801 Net: reddy@cs.uiuc.edu Janurary 8, 1993
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/reddy/papers/state.abstract.ps.Z, 19931111 A Linear Logic Model of State (Extended Abstract) Uday S. Reddy
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/reddy/papers/directional.ps.Z, 19931111 A Typed Foundation for Directional Logic Programming Uday S. Reddy Department of Computer Science University of Illinois at Urbana-Champaign Urbana, IL 61801 Net: reddy@cs.uiuc.edu
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/reddy/papers/state.ps.Z, 19931111 A Linear Logic Model of State (Preliminary Report) Uday S. Reddy University of Illinois at Urbana-Champaign reddy@cs.uiuc.edu July 6, 1992
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-91-1720.ps.Z, 19931122 SORTED UNIFICATION AND THE SOLUTION OF SEMI-LINEAR MEMBERSHIP CONSTRAINTS BY TOM AS ESTEBAN URIBE B.S., University of Illinois at Urbana-Champaign, 1989 THESIS Submitted in partial fulfillment of the requirements for the degree of Master of Science in Computer Science in the Graduate College of the
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-91-1720.ps.Z, 19931122 SORTED UNIFICATION AND THE SOLUTION OF SEMI-LINEAR MEMBERSHIP CONSTRAINTS BY TOM AS ESTEBAN URIBE B.S., University of Illinois at Urbana-Champaign, 1989 THESIS Submitted in partial fulfillment of the requirements for the degree of Master of Science in Computer Science in the Graduate College of the
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/reddy/papers/oosem.ps.Z, 19931129 Two Semantic Models of Object-Oriented Languages Samuel N. Kamin Uday S. Reddy University of Illinois at Urbana-Champaign October 4, 1993
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-93-1842.ps.Z, 19931202 A Temporal Sequence Processor Based on the Biological Reaction-Diffusion Process Sylvian R. Ray and Hillol Kargupta Department of Computer Science University of Illinois at Urbana-Champaign Urbana, Illinois 61801
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-93-1843.ps.Z, 19931202 The number of 3-sets of a finite point set in the plane 1 Edgar A. Ramos 2
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-93-1842.ps.Z, 19931202 A Temporal Sequence Processor Based on the Biological Reaction-Diffusion Process Sylvian R. Ray and Hillol Kargupta Department of Computer Science University of Illinois at Urbana-Champaign Urbana, Illinois 61801
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-93-1844.ps.Z, 19931202 Equipartition of mass distributions by hyperplanes 1 Edgar A. Ramos 2
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-93-1843.ps.Z, 19931202 The number of 3-sets of a finite point set in the plane 1 Edgar A. Ramos 2
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-93-1844.ps.Z, 19931202 Equipartition of mass distributions by hyperplanes 1 Edgar A. Ramos 2
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/kadie/masters.ps.gz, 19931210 DIFFY-S: LEARNING ROBOT OPERATORS FROM EXAMPLES OF OPERATOR EFFECTS BY CARL MYERS KADIE B.S., University of Illinois, 1985 THESIS Submitted in partial fulfillment of the requirements for the degree of Master of Science in Computer Science in the Graduate College of the University of Illinois at
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-93-1829.ps.Z, 19931214 Incremental Inference of Concrete Types John Plevyak Andrew A. Chien Department of Computer Science 1304 W. Springfield Avenue Urbana, IL 61801 fjplevyak,achieng@cs.uiuc.edu
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-94-1846.ps.Z, 19931222 c Copyright by John William Collins 1994 PROCESS-BASED DIAGNOSIS: AN APPROACH TO UNDERSTANDING NOVEL FAILURES BY JOHN WILLIAM COLLINS B.S., Rose-Hulman Institute of Technology, 1979 M.S., University of Illinois, 1988 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-94-1846.ps.Z, 19931222 c Copyright by John William Collins 1994 PROCESS-BASED DIAGNOSIS: AN APPROACH TO UNDERSTANDING NOVEL FAILURES BY JOHN WILLIAM COLLINS B.S., Rose-Hulman Institute of Technology, 1979 M.S., University of Illinois, 1988 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/reddy/papers/acceptors.ps.Z, 19931224 Acceptors as Values Functional Programming in Classical Linear Logic (Technical Summary) Uday S. Reddy Department of Computer Science University of Illinois at Urbana-Champaign Urbana, IL 61801 Net: reddy@cs.uiuc.edu December 9, 1991
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-94-1839.ps.Z, 19931229 c Copyright by Biju Joseph Kalathil, 1994 SUPPORTING LOCAL AUTONOMY IN A DISTRIBUTED OBJECT-ORIENTED DATABASE BY BIJU JOSEPH KALATHIL B.Sc., University of Kerala, 1983 M.S., University of Illinois at Urbana-Champaign, 1989 THESIS Submitted in partial fulfillment of the requirements for the degree of
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-94-1839.ps.Z, 19931229 c Copyright by Biju Joseph Kalathil, 1994 SUPPORTING LOCAL AUTONOMY IN A DISTRIBUTED OBJECT-ORIENTED DATABASE BY BIJU JOSEPH KALATHIL B.Sc., University of Kerala, 1983 M.S., University of Illinois at Urbana-Champaign, 1989 THESIS Submitted in partial fulfillment of the requirements for the degree of
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-93-1841.ps.Z, 19940104 INTERACTIVE DIRECT VOLUME RENDERING OF CURVILINEAR AND UNSTRUCTURED DATA BY PETER LAWRENCE WILLIAMS B.S., University of California, Berkeley, 1960 M.S., University of Lowell, 1984 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-94-1847.ps.Z, 19940110 ISOTROPIC GRAPHS WITH APPLICATIONS TO PARALLEL COMPUTATION BY ANDREA PIETRACAPRINA Laurea, University of Pisa, 1987 M.S., University of Illinois, 1991 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in the Graduate College of the
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-94-1847.ps.Z, 19940110 ISOTROPIC GRAPHS WITH APPLICATIONS TO PARALLEL COMPUTATION BY ANDREA PIETRACAPRINA Laurea, University of Pisa, 1987 M.S., University of Illinois, 1991 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in the Graduate College of the
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-94-1845.ps.Z, 19940114 Copyright by Sai-keung Dong, 1994 GRAPH-BASED ALGORITHMS FOR FLOORPLANNING, ROUTING AND COMPACTION BY SAI-KEUNG DONG B.S., University of Illinois at Urbana-Champaign, 1984 M.S., University of Minnesota, Minneapolis, 1986 THESIS Submitted in partial fulfillment of the requirements for the degree of
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-94-1845.ps.Z, 19940114 Copyright by Sai-keung Dong, 1994 GRAPH-BASED ALGORITHMS FOR FLOORPLANNING, ROUTING AND COMPACTION BY SAI-KEUNG DONG B.S., University of Illinois at Urbana-Champaign, 1984 M.S., University of Minnesota, Minneapolis, 1986 THESIS Submitted in partial fulfillment of the requirements for the degree of
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/reddy/tkl/Termination-long.ps.Z, 19940125 A Framework of Directionality for Proving Termination of Logic Programs Francois Bronsard T.K. Lakshman1 Uday S. Reddy Department of Computer Science University of Illinois at Urbana-Champaign Urbana, Illinois 61801, USA internet: hbronsard,lakshman,reddyi@cs.uiuc.edu
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/reddy/tkl/Termination.ps.Z, 19940125 A Framework of Directionality for Proving Termination of Logic Programs1 Francois Bronsard T.K. Lakshman Uday S. Reddy Department of Computer Science University of Illinois at Urbana-Champaign Urbana, Illinois 61801, USA internet: hbronsard,lakshman,reddyi@cs.uiuc.edu
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/reddy/tkl/TypedProlog.ps.Z, 19940128 Typed Prolog: A Semantic Reconstruction of the Mycroft-O'Keefe Type System1 T.K. Lakshman and Uday S. Reddy Department of Computer Science University of Illinois at Urbana-Champaign Urbana, Illinois 61801, USA internet: hlakshman,reddyi@cs.uiuc.edu
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-94-1848.ps.Z, 19940201 Triangulating Topological Spaces1 Herbert Edelsbrunner2 and Nimish R. Shah2
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-94-1848.ps.Z, 19940201 Triangulating Topological Spaces1 Herbert Edelsbrunner2 and Nimish R. Shah2
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-93-1814.ps.Z, 19940210 c Copyright by Steven Lewis Lee 1993 KRYLOV METHODS FOR THE NUMERICAL SOLUTION OF INITIAL-VALUE PROBLEMS IN DIFFERENTIAL-ALGEBRAIC EQUATIONS BY STEVEN LEWIS LEE B.S., Yale University, 1985 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-93-1814.ps.Z, 19940210 c Copyright by Steven Lewis Lee 1993 KRYLOV METHODS FOR THE NUMERICAL SOLUTION OF INITIAL-VALUE PROBLEMS IN DIFFERENTIAL-ALGEBRAIC EQUATIONS BY STEVEN LEWIS LEE B.S., Yale University, 1985 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer
	ftp://ftp.cs.uiuc.edu/pub/dcs/Locally_Developed_Software/CHARM/www/distrib.4.5/projections.manual.ps.gz, 19940213 User Manual for Projections (version 2.0) 1 Introduction Projections is a performance analysis tool for Charm. Projections can be used to examine performance information for Charm programs. Charm is currently available on shared machines including Multimax and Sequent Symmetry, nonshared machines
	ftp://ftp.cs.uiuc.edu/pub/dcs/Locally_Developed_Software/CHARM/www/distrib.4.5/dagger.tutorial.ps.gz, 19940213 Dagger Language: Tutorial 1 Introduction In order to reduce the complexity of program development, a coordination language called Dagger has been developed on top of Charm system. In Charm, an entry point is executed when there is a message directed to it. If the computation in that entry point is
	ftp://ftp.cs.uiuc.edu/pub/dcs/Locally_Developed_Software/CHARM/www/distrib.4.5/summary.manual.ps.gz, 19940213 User Manual for SummaryTool (version 1.0) 1 Introduction SummaryTool presents summary performance information for the machine independent parallel programming language Charm. Charm is currently available on shared machines including Multimax and Sequent Symmetry, nonshared machines including Intel
	ftp://ftp.cs.uiuc.edu/pub/dcs/Locally_Developed_Software/CHARM/www/distrib.4.5/charm.tutorial.ps.gz, 19940213 A Tutorial Introduction to Charm L.V. Kale Department of Computer Science University of Illinois at Urbana Champaign 1304 W. Springfield Ave., Urbana, IL-61801 1 Introduction Charm is a machine independent parallel programming system. Programs written using this system will run unchanged on MIMD
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/edels/geometry/sos-90.ps.Z, 19940214 Simulation of Simplicity: A Technique to Cope with Degenerate Cases in Geometric Algorithms1 Herbert Edelsbrunner2 and Ernst Peter M ucke2
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-93-1789.ps.Z, 19940308 For: gratch Printed on: Thu, Mar 3, 1994 14:02:12 Document: JPL report Last saved on: Thu, Mar 3, 1994 14:01:11 pl2ps 4.0.5 Learning Search Control Knowledge for the Deep Space Network Scheduling Problem Jonathan Gratch and Steve Chien* Jet Propulsion Laboratory California Institute of Technology 4800
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/reddy/papers/higher.ps.Z, 19940318 Higher-order Aspects of Logic Programming Uday S. Reddy Department of Computer Science University of Illinois at Urbana-Champaign Urbana, IL 61801 Net: reddy@cs.uiuc.edu
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-94-1850.ps.Z, 19940331 c Copyright by Dennis Martin DeCoste 1994 GOAL-DIRECTED QUALITATIVE REASONING WITH PARTIAL STATES BY DENNIS MARTIN DECOSTE B.S., University of Illinois at Urbana-Champaign, 1986 M.S., University of Illinois at Urbana-Champaign, 1989 THESIS Submitted in partial fulfillment of the requirements for the
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/kadie/comments.ps, 19940407 1 Comments on XCG.94.01 Carl M. Kadie Principles 1. Universality Computer forums and facilities (and other new forums and facilities) should be treated the same as traditional university forums and facilities. 2. Clarity A rule should not be so vague that " of common intelligence must
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/reddy/tkl/ids.ps.Z, 19940415 Type Based Reasoning of Incomplete Data Structures Francois Bronsard 1, T. K. Lakshman 2, Uday S. Reddy2 1 CRIN-INRIA-Lorraine and The University of Illinois at Urbana-Champaign 2 The University of Illinois at Urbana-Champaign
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/reddy/papers/passivity.ps.Z, 19940420 Passivity and Independence Uday S. Reddy University of Illinois at Urbana-Champaign Email: reddy@cs.uiuc.edu
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-93-1833.ps.Z, 19940426 Validating Timing Constraints in Multiprocessor and Distributed Real-Time Systems Rhan Ha and Jane W. S. Liu Department of Computer Science University of Illinois at Urbana-Champaign Urbana, Illinois 61801
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-94-1858.ps.Z, 19940503 c Copyright by Michael Duane Frazier 1994 MATTERS HORN AND OTHER FEATURES IN THE COMPUTATIONAL LEARNING THEORY LANDSCAPE: THE NOTION OF MEMBERSHIP BY MICHAEL DUANE FRAZIER B.S., University of Missouri { Rolla, 1985 M.S., University of Missouri { Rolla, 1987 THESIS Submitted in partial fulfillment of the
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-94-1858.ps.Z, 19940503 c Copyright by Michael Duane Frazier 1994 MATTERS HORN AND OTHER FEATURES IN THE COMPUTATIONAL LEARNING THEORY LANDSCAPE: THE NOTION OF MEMBERSHIP BY MICHAEL DUANE FRAZIER B.S., University of Missouri { Rolla, 1985 M.S., University of Missouri { Rolla, 1987 THESIS Submitted in partial fulfillment of the
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-94-1857.ps.Z, 19940506 c Copyright by Sirpa Helena Saarinen 1994 MODELLING FUNCTIONS FROM SAMPLE DATA WITH CLASSIFICATION APPLICATIONS BY SIRPA HELENA SAARINEN Lic., Turun Yliopisto, 1984 M.S., University of Cambridge, 1988 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-94-1857.ps.Z, 19940506 c Copyright by Sirpa Helena Saarinen 1994 MODELLING FUNCTIONS FROM SAMPLE DATA WITH CLASSIFICATION APPLICATIONS BY SIRPA HELENA SAARINEN Lic., Turun Yliopisto, 1984 M.S., University of Cambridge, 1988 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in
	ftp://ftp.cs.uiuc.edu/pub/dcs/Locally_Developed_Software/perts/taskgraph_model.ps, 19940507 The Task-Graph Model We often specify or describe a real-time software system by means of a task graph. The nodes (vertices) in this graph represent tasks. Tasks are the basic units of work and the smallest entities that are treated as schedulable units by the operating system. Tasks are connected by
	ftp://ftp.cs.uiuc.edu/pub/dcs/Locally_Developed_Software/perts/validation.ps, 19940507 Validating Timing Constraints in Multiprocessor and Distributed Real-Time Systems Rhan Ha and Jane W. S. Liu frhanha, janeliug@cs.uiuc.edu Department of Computer Science University of Illinois Urbana, Illinois 61801
	ftp://ftp.cs.uiuc.edu/pub/dcs/Locally_Developed_Software/perts/description_about_perts.ps, 19940507 PERTS: A PROTOTYPIING ENVIRONMENT FOR REAL-TIME SYSTEMS J. W. S. Liu, C. L. Liu, J. L. Redondo, Z. Deng, T. S. Tia, R. Bettati, J. Sun, A. Silberman, M. Storch, D. Hull Department of Computer Science University of Illinois, Urbana, Illinois 61801 INTRODUCTION ``Non-functional, or quality, aspects of
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-94-1864.ps.Z, 19940510 Adaptive Simplicial Grids from Cross-sections of Monotone Complexes 1 Herbert Edelsbrunner2 and Roman Waupotitsch2
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-94-1864.ps.Z, 19940510 Adaptive Simplicial Grids from Cross-sections of Monotone Complexes 1 Herbert Edelsbrunner2 and Roman Waupotitsch2
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-94-1862.ps.Z, 19940516 QUORUM CONSENSUS PROTOCOLS FOR THE CLIENT-SERVER ARCHITECTURE BY KHALED SAADI SOUFI B.S., The American University of Beirut, 1984 M.S., American University, 1989 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in the Graduate College
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-94-1862.ps.Z, 19940516 QUORUM CONSENSUS PROTOCOLS FOR THE CLIENT-SERVER ARCHITECTURE BY KHALED SAADI SOUFI B.S., The American University of Beirut, 1984 M.S., American University, 1989 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in the Graduate College
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-94-1865.ps.Z, 19940518 The Average-Case Complexity of Determining the Majority Laurent Alonsoy Edward M. Reingoldz Ren e Schottx May 18, 1994
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-94-1865.ps.Z, 19940518 The Average-Case Complexity of Determining the Majority Laurent Alonsoy Edward M. Reingoldz Ren e Schottx May 18, 1994
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-94-1863.ps.Z, 19940520 COMPILER OPTIMIZATIONS FOR PARALLEL LOOPS WITH FINE-GRAINED SYNCHRONIZATION BY DING-KAI CHEN B.S., National Taiwan University, 1985 M.S., University of Illinois at Urbana Champaign, 1989 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-94-1863.ps.Z, 19940520 COMPILER OPTIMIZATIONS FOR PARALLEL LOOPS WITH FINE-GRAINED SYNCHRONIZATION BY DING-KAI CHEN B.S., National Taiwan University, 1985 M.S., University of Illinois at Urbana Champaign, 1989 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/kamin/workshop.ps.Z, 19940531 Report of a Workshop on Future Directions in Programming Languages and Compilers May 31, 1994 Purpose In January, 1993, a panel of experts in the area of programming languages and compilers met in a one and a half day workshop to discuss the future of research in that area. This paper is the report of
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-94-1856.ps.Z, 19940601 Copyright c 1994 by Nayeem Islam CUSTOMIZED MESSAGE PASSING AND SCHEDULING FOR PARALLEL AND DISTRIBUTED APPLICATIONS BY NAYEEM ISLAM B.S.E., Princeton University, 1986 M.S., Stanford University, 1987 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-94-1856.ps.Z, 19940601 Copyright c 1994 by Nayeem Islam CUSTOMIZED MESSAGE PASSING AND SCHEDULING FOR PARALLEL AND DISTRIBUTED APPLICATIONS BY NAYEEM ISLAM B.S.E., Princeton University, 1986 M.S., Stanford University, 1987 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-94-1852.ps.Z, 19940615 c Copyright by Attila G ursoy 1994 SIMPLIFIED EXPRESSION OF MESSAGE-DRIVEN PROGRAMS AND QUANTIFICATION OF THEIR IMPACT ON PERFORMANCE BY ATTILA G URSOY B.Sc., Middle East Technical University, 1986 M.S., Bilkent University, 1988 THESIS Submitted in partial fulfillment of the requirements for the degree
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-94-1852.ps.Z, 19940615 c Copyright by Attila G ursoy 1994 SIMPLIFIED EXPRESSION OF MESSAGE-DRIVEN PROGRAMS AND QUANTIFICATION OF THEIR IMPACT ON PERFORMANCE BY ATTILA G URSOY B.Sc., Middle East Technical University, 1986 M.S., Bilkent University, 1988 THESIS Submitted in partial fulfillment of the requirements for the degree
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/kadie/uiucpri.ps, 19940627 Privacy Rights in the University: A Report and Proposal of the Senate Council ad hoc Committee on Privacy Rights The undersigned were appointed to consider whether it would be useful for the University to adopt policy generally to govern and, more particularly, to protect the privacy interests of
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-94-1868.ps.Z, 19940707 Copyright by Paul Jay Lucas, 1993 Software: Copyright by AT&T, 1993 AN OBJECT-ORIENTED LANGUAGE SYSTEM FOR IMPLEMENTING CONCURRENT, HIERARCHICAL, FINITE STATE MACHINES BY PAUL JAY LUCAS B.S., Polytechnic University, 1989 THESIS Submitted in partial fulfillment of the requirements for the degree of
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-94-1868.ps.Z, 19940707 Copyright by Paul Jay Lucas, 1993 Software: Copyright by AT&T, 1993 AN OBJECT-ORIENTED LANGUAGE SYSTEM FOR IMPLEMENTING CONCURRENT, HIERARCHICAL, FINITE STATE MACHINES BY PAUL JAY LUCAS B.S., Polytechnic University, 1989 THESIS Submitted in partial fulfillment of the requirements for the degree of
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-94-1873.ps.Z, 19940721 PERFORMANCE DRIVEN PLACEMENT AND ROUTING ALGORITHMS BY TONG GAO B.S. University of Illinois at Urbana-Champaign, 1988 M.S. University of Illinois at Urbana-Champaign, 1992 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in the
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-94-1873.ps.Z, 19940721 PERFORMANCE DRIVEN PLACEMENT AND ROUTING ALGORITHMS BY TONG GAO B.S. University of Illinois at Urbana-Champaign, 1988 M.S. University of Illinois at Urbana-Champaign, 1992 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in the
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-94-1859.ps.Z, 19940728 Aperiodic Request Scheduling in Fixed-Priority Preemptive Systems by Too-Seng Tia Jane W.-S. Liu Mallikarjun Shankar Department of Computer Science 1304 W. Springfield Avenue University of Illinois at Urbana-Champaign Urbana, IL 61801 July 1994
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-94-1859.ps.Z, 19940728 Aperiodic Request Scheduling in Fixed-Priority Preemptive Systems by Too-Seng Tia Jane W.-S. Liu Mallikarjun Shankar Department of Computer Science 1304 W. Springfield Avenue University of Illinois at Urbana-Champaign Urbana, IL 61801 July 1994
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-94-1867.ps.Z, 19940804 A CONVERSATION-BASED FRAMEWORK FOR MUSICAL IMPROVISATION BY WILLIAM FRANKLIN WALKER B. S., University of Illinois, 1987 M. S. University of Illinois, 1989 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in the Graduate College of the
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-94-1867.ps.Z, 19940804 A CONVERSATION-BASED FRAMEWORK FOR MUSICAL IMPROVISATION BY WILLIAM FRANKLIN WALKER B. S., University of Illinois, 1987 M. S. University of Illinois, 1989 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in the Graduate College of the
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-94-1878.ps.Z, 19940808 PARALLEL ARCHITECTURAL SIMULATIONS ON SHARED-MEMORY MULTIPROCESSORS BY PAVLOS KONAS B.Sc., University of Crete, 1988 M.S., University of Illinois at Urbana-Champaign, 1991 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in the
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-94-1878.ps.Z, 19940808 PARALLEL ARCHITECTURAL SIMULATIONS ON SHARED-MEMORY MULTIPROCESSORS BY PAVLOS KONAS B.Sc., University of Crete, 1988 M.S., University of Illinois at Urbana-Champaign, 1991 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in the
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-94-1877.ps.Z, 19940817 c Copyright by Nimish Rameshbhai Shah, 1994 TOPOLOGICAL MODELING WITH SIMPLICIAL COMPLEXES BY NIMISH RAMESHBHAI SHAH B.Engr., Gujarat University, 1989 M.Engr., Indian Institute of Science, Bangalore, 1990 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-93-1805.ps, 19940817 I. Overview of Spectral Matching An ideal music synthesis technique would provide both a high-level spectral control of the sound and be efficient. Simple playback of recorded samples lacks spectral control, while additive sine wave synthesis is inefficient. FM and wavetable synthesis, however, satisfy
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-93-1805.ps, 19940817 I. Overview of Spectral Matching An ideal music synthesis technique would provide both a high-level spectral control of the sound and be efficient. Simple playback of recorded samples lacks spectral control, while additive sine wave synthesis is inefficient. FM and wavetable synthesis, however, satisfy
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-94-1877.ps.Z, 19940817 c Copyright by Nimish Rameshbhai Shah, 1994 TOPOLOGICAL MODELING WITH SIMPLICIAL COMPLEXES BY NIMISH RAMESHBHAI SHAH B.Engr., Gujarat University, 1989 M.Engr., Indian Institute of Science, Bangalore, 1990 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-94-1855.ps.Z, 19940819 SEMANTIC UNIFICATION FOR CONVERGENT SYSTEMS BY SUBRATA MITRA B.Tech., Indian Institute of Technology, Kanpur, 1988 M.S., University of Delaware, 1991 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in the Graduate College of the
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-94-1855.ps.Z, 19940819 SEMANTIC UNIFICATION FOR CONVERGENT SYSTEMS BY SUBRATA MITRA B.Tech., Indian Institute of Technology, Kanpur, 1988 M.S., University of Delaware, 1991 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in the Graduate College of the
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-94-1884.ps.Z, 19940823 c Copyright by Mei-Chin Tsai 1994 CATEGORIZATION AND ANALYZING LINKED STRUCTURES BY MEI-CHIN TSAI B.S. of Engineer, National Taiwan University, 1986 M.S. of Engineer, National Taiwan University, 1988 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-94-1884.ps.Z, 19940823 c Copyright by Mei-Chin Tsai 1994 CATEGORIZATION AND ANALYZING LINKED STRUCTURES BY MEI-CHIN TSAI B.S. of Engineer, National Taiwan University, 1986 M.S. of Engineer, National Taiwan University, 1988 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-94-1840.ps.Z, 19940829 END-TO-END SCHEDULING TO MEET DEADLINES IN DISTRIBUTED SYSTEMS BY RICCARDO BETTATI Diploma, Swiss Federal Institute of Technology, Z urich, 1988 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in the Graduate College of the
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-94-1840.ps.Z, 19940829 END-TO-END SCHEDULING TO MEET DEADLINES IN DISTRIBUTED SYSTEMS BY RICCARDO BETTATI Diploma, Swiss Federal Institute of Technology, Z urich, 1988 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in the Graduate College of the
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-94-1886.ps.Z, 19940829 c Copyright by Der-Shung Yang, 1994 MANAGEMENT OF STANDARD GRAPHIC SYMBOLS IN A COMPUTER-AIDED DESIGN AND DRAFTING ENVIRONMENT USING NEURAL NETWORK APPROACHES BY DER-SHUNG YANG B.S., National Chiao Tung University, 1986 M.S., University of Illinois at Urbana-Champaign, 1992 THESIS Submitted in partial
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-94-1886.ps.Z, 19940829 c Copyright by Der-Shung Yang, 1994 MANAGEMENT OF STANDARD GRAPHIC SYMBOLS IN A COMPUTER-AIDED DESIGN AND DRAFTING ENVIRONMENT USING NEURAL NETWORK APPROACHES BY DER-SHUNG YANG B.S., National Chiao Tung University, 1986 M.S., University of Illinois at Urbana-Champaign, 1992 THESIS Submitted in partial
	ftp://ftp.cs.uiuc.edu/pub/dcs/Locally_Developed_Software/CHARM/old/doc/CharmPlusManual.ps.Z, 19940908 The Charm++ (4.3) Programming Language Manual September 8, 1994 1 The Charm software was developed as a group effort. The earliest prototype, Chare Kernel(1.0), was developed by Wennie Shu and Kevin Nomura working with Laxmikant Kale. The second prototype, Chare Kernel(2.0), a complete re-write with
	ftp://ftp.cs.uiuc.edu/pub/dcs/Locally_Developed_Software/CHARM/old/doc/ProjectionsManual.ps.Z, 19940909 User Manual for Projections (version 2.0) 1 Introduction Projections is a performance analysis tool for Charm. Projections can be used to examine performance information for Charm programs. Charm is currently available on shared machines including Multimax and Sequent Symmetry, nonshared machines
	ftp://ftp.cs.uiuc.edu/pub/dcs/Locally_Developed_Software/CHARM/old/doc/CharmManual.ps.Z, 19940909 The Charm (4.3) Programming Language Manual September 9, 1994 1 The Charm software was developed as a group effort. The earliest prototype, Chare Kernel(1.0), was developed by Wennie Shu and Kevin Nomura working with Laxmikant Kale. The second prototype, Chare Kernel(2.0), a complete re-write with major
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-94-1888.ps.Z, 19940912 Algorithms for Scheduling Tasks with Input Error and End-to-End Deadlines W. Feng and J. W.-S. Liu Department of Computer Science University of Illinois at Urbana-Champaign 1304 W. Springfield Ave. Urbana, IL 61801 ffeng, janeliug@cs.uiuc.edu
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-94-1888.ps.Z, 19940912 Algorithms for Scheduling Tasks with Input Error and End-to-End Deadlines W. Feng and J. W.-S. Liu Department of Computer Science University of Illinois at Urbana-Champaign 1304 W. Springfield Ave. Urbana, IL 61801 ffeng, janeliug@cs.uiuc.edu
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/edels/geometry/shapes-94.ps.Z, 19940921 Three-dimensional Alpha Shapes1 Herbert Edelsbrunner2 and Ernst P M ucke2 Abstract. Frequently, data in scientific computing is in its abstract form a finite point set in space, and it is sometimes useful or required to compute what one might call the shape" of the set. For that purpose, this paper
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-94-1872.ps.Z, 19940930 INCREMENTAL ALGORITHMS FOR GENERAL PURPOSE LAYOUT SYSTEM BY MYONG HEON CYNN B.S., Seoul National University, 1977 M.S., Korea Advanced Institute of Science, 1979 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in the Graduate College
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-94-1872.ps.Z, 19940930 INCREMENTAL ALGORITHMS FOR GENERAL PURPOSE LAYOUT SYSTEM BY MYONG HEON CYNN B.S., Seoul National University, 1977 M.S., Korea Advanced Institute of Science, 1979 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in the Graduate College
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-94-1889.ps.Z, 19941004 c Copyright by Darrell Roy Hougen, 1994 ESTIMATION OF SHAPE, LIGHTING, AND REFLECTIVITY FROM STEREO AND SHADING INFORMATION BY DARRELL ROY HOUGEN B.S., Iowa State University of Science & Technology, 1986 M.S., University of Illinois at Urbana-Champaign, 1988 THESIS Submitted in partial fulfillment of
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-94-1889.ps.Z, 19941004 c Copyright by Darrell Roy Hougen, 1994 ESTIMATION OF SHAPE, LIGHTING, AND REFLECTIVITY FROM STEREO AND SHADING INFORMATION BY DARRELL ROY HOUGEN B.S., Iowa State University of Science & Technology, 1986 M.S., University of Illinois at Urbana-Champaign, 1988 THESIS Submitted in partial fulfillment of
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-94-1879.ps.Z, 19941013 c Copyright by Yachyang Sun 1994 ALGORITHMIC RESULTS ON PHYSICAL DESIGN PROBLEMS IN VLSI AND FPGA BY YACHYANG SUN B.S., National Cheng Kung University, 1985 M.S., Northwestern University, 1989 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-94-1879.ps.Z, 19941013 c Copyright by Yachyang Sun 1994 ALGORITHMIC RESULTS ON PHYSICAL DESIGN PROBLEMS IN VLSI AND FPGA BY YACHYANG SUN B.S., National Cheng Kung University, 1985 M.S., Northwestern University, 1989 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-94-1881.ps.Z, 19941019 c Copyright by Brian Keith Totty 1994 TUNABLE SHARED-MEMORY ABSTRACTIONS FOR DISTRIBUTED-MEMORY SYSTEMS BY BRIAN KEITH TOTTY B.S., Massachusetts Institute of Technology, 1988 M.S., University of Illinois at Urbana-Champaign, 1992 THESIS Submitted in partial fulfillment of the requirements for the degree
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-94-1881.ps.Z, 19941019 c Copyright by Brian Keith Totty 1994 TUNABLE SHARED-MEMORY ABSTRACTIONS FOR DISTRIBUTED-MEMORY SYSTEMS BY BRIAN KEITH TOTTY B.S., Massachusetts Institute of Technology, 1988 M.S., University of Illinois at Urbana-Champaign, 1992 THESIS Submitted in partial fulfillment of the requirements for the degree
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-94-1891.ps.Z, 19941020 ADAPTIVE AND INTEGRATED DATA CACHE PREFETCHING FOR SHARED-MEMORY MULTIPROCESSORS BY EDWARD H. GORNISH B.S., Massachusetts Institute of Technology, 1986 M.S., University of Illinois, 1989 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-94-1891.ps.Z, 19941020 ADAPTIVE AND INTEGRATED DATA CACHE PREFETCHING FOR SHARED-MEMORY MULTIPROCESSORS BY EDWARD H. GORNISH B.S., Massachusetts Institute of Technology, 1986 M.S., University of Illinois, 1989 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-94-1893.ps.Z, 19941028 An Effective Method for Correlated Selection Problems Jonathan Gratch Beckman Institute, University of Illinois 405 N. Mathews, Urbana, IL 61801 1. INTRODUCTION Many problems in machine learning are actually statistical problems of a class called correlated selection problems. Selection problems arise
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-94-1893.ps.Z, 19941028 An Effective Method for Correlated Selection Problems Jonathan Gratch Beckman Institute, University of Illinois 405 N. Mathews, Urbana, IL 61801 1. INTRODUCTION Many problems in machine learning are actually statistical problems of a class called correlated selection problems. Selection problems arise
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-94-1895.ps.Z, 19941129 c Copyright by David D. Mattox 1995 INDEED: An Active Database for Concurrent Engineering BY DAVID D. MATTOX B.S., Wayne State University, 1983 M.S., Wayne State University, 1985 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in the
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-94-1895.ps.Z, 19941129 c Copyright by David D. Mattox 1995 INDEED: An Active Database for Concurrent Engineering BY DAVID D. MATTOX B.S., Wayne State University, 1983 M.S., Wayne State University, 1985 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in the
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-94-1849.ps.Z, 19941205 DATABASE SUPPORT FOR ELECTRONIC CAD APPLICATION: PERFORMANCE AND ARCHITECTURE BY SHEAUYIN CHU B.A., National Cheng-chi University, 1984 M.B.A., University of Illinois at Urbana-Champaign, 1988 M.S., University of Illinois at Urbana-Champaign, 1990 THESIS Submitted in partial fulfillment of the
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-94-1849.ps.Z, 19941205 DATABASE SUPPORT FOR ELECTRONIC CAD APPLICATION: PERFORMANCE AND ARCHITECTURE BY SHEAUYIN CHU B.A., National Cheng-chi University, 1984 M.B.A., University of Illinois at Urbana-Champaign, 1988 M.S., University of Illinois at Urbana-Champaign, 1990 THESIS Submitted in partial fulfillment of the
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-94-1885.ps.Z, 19941213 c Copyright by Amitabh Bhuvangyan Sinha 1994 PERFORMANCE ANALYSIS OF OBJECT-BASED AND MESSAGE-DRIVEN PROGRAMS BY AMITABH BHUVANGYAN SINHA B.Tech., Indian Institute of Technology, Kanpur, 1988 M.S., Ohio State University, 1989 THESIS Submitted in partial fulfillment of the requirements for the degree of
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-94-1885.ps.Z, 19941213 c Copyright by Amitabh Bhuvangyan Sinha 1994 PERFORMANCE ANALYSIS OF OBJECT-BASED AND MESSAGE-DRIVEN PROGRAMS BY AMITABH BHUVANGYAN SINHA B.Tech., Indian Institute of Technology, Kanpur, 1988 M.S., Ohio State University, 1989 THESIS Submitted in partial fulfillment of the requirements for the degree of
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-94-1883.ps.Z, 19941216 PARALLEL ALGORITHMS FOR CONVEX HULLS AND PROXIMITY PROBLEMS BY NANCY MARIE AMATO B.S., Stanford University, 1986 A.B., Stanford University, 1986 M.S., University of California at Berkeley, 1988 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-94-1883.ps.Z, 19941216 PARALLEL ALGORITHMS FOR CONVEX HULLS AND PROXIMITY PROBLEMS BY NANCY MARIE AMATO B.S., Stanford University, 1986 A.B., Stanford University, 1986 M.S., University of California at Berkeley, 1988 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/reddy/tkl/DirTypeChecking.ps.Z, 19950107 Directional Type Checking of Logic Programs Alexander Aiken1 and T. K. Lakshman2 1 Computer Science Division, University of California, Berkeley, 571 Evans, Berkeley, CA 94720. email: aiken@cs.berkeley.edu 2 Department of Computer Science, University of Illinois at Urbana-Champaign, 1304 W. Springfield
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-95-1902.ps.Z, 19950130 An Integrated Compilation and Performance Analysis Environment for Data Parallel Programs Vikram S. Adve John Mellor-Crummey Mark Anderson Ken Kennedy Center for Research on Parallel Computation Rice University Houston, Texas 77251-1892 Jhy-Chun Wang Daniel A. Reed Department of Computer Science
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-95-1902.ps.Z, 19950130 An Integrated Compilation and Performance Analysis Environment for Data Parallel Programs Vikram S. Adve John Mellor-Crummey Mark Anderson Ken Kennedy Center for Research on Parallel Computation Rice University Houston, Texas 77251-1892 Jhy-Chun Wang Daniel A. Reed Department of Computer Science
	ftp://ftp.cs.uiuc.edu/pub/dcs/Locally_Developed_Software/CHARM/www/distrib.4.5/dagtool.manual.ps.gz, 19950216 DagTool: Tutorial 1 Introduction In order to reduce the complexity of program development, a coordination language called Dagger has been developed on top of Charm system. In Charm, an entry point is executed when there is a message directed to it. If the computation in that entry point is dependent on
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/reddy/hasker-thesis.ps.gz, 19950222 THE REPLAY OF PROGRAM DERIVATIONS BY ROBERT W. HASKER B.S., Wheaton College, 1984 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in the Graduate College of the University of Illinois at Urbana-Champaign, 1995 Urbana, Illinois THE
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/reddy/papers/term.ps.Z, 19950222 Term Rewriting Induction Uday S. Reddyy Department of Computer Science University of Illinois at Urbana-Champaign Urbana, IL 61801 Net: reddy@a.cs.uiuc.edu
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-93-1812.ps.Z, 19950224 c Copyright by Joseph Kee-Yin Ng 1993 PERFORMANCE OF HIGH-SPEED NETWORKS FOR REAL-TIME APPLICATIONS BY JOSEPH KEE-YIN NG B.S., University of Illinois at Urbana-Champaign, 1986 M.S., University of Illinois at Urbana-Champaign, 1988 THESIS Submitted in partial fulfillment of the requirements for the
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-95-1904.ps.Z, 19950307 A FAMILY OF PRECONDITIONED ITERATIVE SOLVERS FOR SPARSE LINEAR SYSTEMS BY ULRIKE MEIER YANG Dipl., Ruhruniversit at Bochum, 1983 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in the Graduate College of the University of Illinois at
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-95-1904.ps.Z, 19950307 A FAMILY OF PRECONDITIONED ITERATIVE SOLVERS FOR SPARSE LINEAR SYSTEMS BY ULRIKE MEIER YANG Dipl., Ruhruniversit at Bochum, 1983 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in the Graduate College of the University of Illinois at
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-95-1899.ps.Z, 19950310 c Copyright by F.X. Nursalim Hadi 1995 CHECKPOINTING IN DISTRIBUTED VIRTUAL MEMORY BY USING LOCAL VIRTUAL MEMORY BY F.X. NURSALIM HADI Sarjana Teknik, Institut Teknologi Bandung, 1986 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-95-1899.ps.Z, 19950310 c Copyright by F.X. Nursalim Hadi 1995 CHECKPOINTING IN DISTRIBUTED VIRTUAL MEMORY BY USING LOCAL VIRTUAL MEMORY BY F.X. NURSALIM HADI Sarjana Teknik, Institut Teknologi Bandung, 1986 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-95-1908.ps.Z, 19950414 Sequential Inductive Learning Jonathan Gratch Beckman Institute, Department of Computer Science University of Illinois 405 N. Mathews, Urbana, IL 61801 gratch@cs.uiuc.edu Phone: (217) 244-1503 FAX: (217) 244-8371 Keywords Decision Trees, Statistical Analysis, Learning Theory
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-95-1908.ps.Z, 19950414 Sequential Inductive Learning Jonathan Gratch Beckman Institute, Department of Computer Science University of Illinois 405 N. Mathews, Urbana, IL 61801 gratch@cs.uiuc.edu Phone: (217) 244-1503 FAX: (217) 244-8371 Keywords Decision Trees, Statistical Analysis, Learning Theory
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/reddy/tkl/SoftTypingFinal.ps.Z, 19950426 Soft Typing with Conditional Types Alexander Aiken and Edward L. Wimmers IBM Almaden Research Center 650 Harry Rd., San Jose, CA 95120 faiken,wimmersg@almaden.ibm.com T. K. Lakshmany Department of Computer Science University of Illinois at Urbana-Champaign 1304 W. Springfield Ave, Urbana, IL 61801
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-95-1910.ps.Z, 19950428 USING TERM ORDERING TO CONTROL CLAUSAL DEDUCTION BY FRANCOIS BRONSARD B.S., Universit e de Montr eal, 1985 M.M., Waterloo University, 1987 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in the Graduate College of the University of
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-95-1910.ps.Z, 19950428 USING TERM ORDERING TO CONTROL CLAUSAL DEDUCTION BY FRANCOIS BRONSARD B.S., Universit e de Montr eal, 1985 M.M., Waterloo University, 1987 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in the Graduate College of the University of
	ftp://ftp.cs.uiuc.edu/pub/dcs/Locally_Developed_Software/CHARM/old/papers/interop/converse1.ps.Z, 19950503 CONVERSE : An Interoperable Framework for Parallel Programming Sanjay Kale, Milind Bhandarkar, Narain Jagathesan, Sanjeev Krishnan Parallel Programming Laboratory Department of Computer Science University of Illinois, Urbana. Sanjeev Krishnan 1 Motivation ffl many different parallel programming
	ftp://ftp.cs.uiuc.edu/pub/dcs/Locally_Developed_Software/CHARM/old/papers/interop/converse2.ps.Z, 19950503 Narain Kumar Jagathesan 1 Supporting Paradigms On Converse ffl Paradigms supported { Message Driven Objects { SPMD (PVM, NXLib) { Threads (with message passing) ffl Common facilities needed for supporting paradigms/language runtimes { Message managers { Thread objects April 26, 1995 Parallel Programming
	ftp://ftp.cs.uiuc.edu/pub/dcs/Locally_Developed_Software/CHARM/www/papers/pvmug95.ps.gz, 19950511 Interoperability and multithreading for PVM using the CONVERSE Interoperable Framework L. V. Kal e, Abner Zangvil and Narain K. Jagathesan Parallel Programming Laboratory Department of Computer Science University of Illinois, Urbana. PVM UG Meet '95 CONVERSE 1 Outline ffl What is CONVERSE ffl Motivation
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-95-1911.ps.Z, 19950525 AUTOMATIC ARRAY PRIVATIZATION AND DEMAND-DRIVEN SYMBOLIC ANALYSIS BY PENG TU B.S.Eng., Shanghai Jiao Tong University, 1984 M.S.Eng., Shanghai Jiao Tong University, 1987 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in the Graduate
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-95-1906.ps.Z, 19950525 c Copyright by Too Seng Tia 1995 UTILIZING SLACK TIME FOR APERIODIC AND SPORADIC REQUESTS SCHEDULING IN REAL-TIME SYSTEMS BY TOO SENG TIA B.Sc., National University of Singapore, 1988 B.Sc. (Honors), National University of Singapore, 1989 M.S., University of Illinois at Urbana-Champaign, 1992 THESIS
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-95-1906.ps.Z, 19950525 c Copyright by Too Seng Tia 1995 UTILIZING SLACK TIME FOR APERIODIC AND SPORADIC REQUESTS SCHEDULING IN REAL-TIME SYSTEMS BY TOO SENG TIA B.Sc., National University of Singapore, 1988 B.Sc. (Honors), National University of Singapore, 1989 M.S., University of Illinois at Urbana-Champaign, 1992 THESIS
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-95-1911.ps.Z, 19950525 AUTOMATIC ARRAY PRIVATIZATION AND DEMAND-DRIVEN SYMBOLIC ANALYSIS BY PENG TU B.S.Eng., Shanghai Jiao Tong University, 1984 M.S.Eng., Shanghai Jiao Tong University, 1987 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in the Graduate
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-95-1913.ps.Z, 19950609 c Copyright by William Joseph Blume 1995 SYMBOLIC ANALYSIS TECHNIQUES FOR EFFECTIVE AUTOMATIC PARALLELIZATION BY WILLIAM JOSEPH BLUME M.S., University of Illinois, 1992 B.S., University of Illinois, 1989 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-95-1913.ps.Z, 19950609 c Copyright by William Joseph Blume 1995 SYMBOLIC ANALYSIS TECHNIQUES FOR EFFECTIVE AUTOMATIC PARALLELIZATION BY WILLIAM JOSEPH BLUME M.S., University of Illinois, 1992 B.S., University of Illinois, 1989 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/saylor/painless-conjugate-gradient.ps.Z, 19950613 An Introduction to the Conjugate Gradient Method Without the Agonizing Pain Edition 1 1 4 Jonathan Richard Shewchuk August 4, 1994 School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/saylor/templates.ps, 19950614 ynynynynynIs the transpose available Is storage at a premium Try CGI s the matrix symmetric Is the matrix definite Are the outer eigenvalues known Try Chebyshev or CGT ry GMRES with long restart Try MinRES or CGT ry QMRT ry CGS or Bi-CGSTAB Flowchart with Suggestions for the Selection of Iterative
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-95-1912.ps.Z, 19950616 INTERCONNECTION NETWORKS AND DATA PREFETCHING FOR LARGE-SCALE MULTIPROCESSORS: DESIGN AND PERFORMANCE BY SUNIL KIM B.S., Seoul National University, 1985 M.S., Seoul National University, 1987 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-95-1912.ps.Z, 19950616 INTERCONNECTION NETWORKS AND DATA PREFETCHING FOR LARGE-SCALE MULTIPROCESSORS: DESIGN AND PERFORMANCE BY SUNIL KIM B.S., Seoul National University, 1985 M.S., Seoul National University, 1987 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-95-1921.ps.Z, 19950626 Copyright c 1995 by Lun Xiao AN OBJECT-ORIENTED EXTENSIBLE TRANSACTION MANAGEMENT SYSTEM BY LUN XIAO Dipl., Nanjing University, 1982 M.S., Nanjing University, 1985 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in the Graduate
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-95-1921.ps.Z, 19950626 Copyright c 1995 by Lun Xiao AN OBJECT-ORIENTED EXTENSIBLE TRANSACTION MANAGEMENT SYSTEM BY LUN XIAO Dipl., Nanjing University, 1982 M.S., Nanjing University, 1985 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in the Graduate
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-95-1914.ps.Z, 19950703 INDUCTIVE CLASSIFIER LEARNING FROM DATA: AN EXTENDED BAYESIAN BELIEF FUNCTION APPROACH BY YONG MA B.Sc., Dalian University of Technology, 1983 M.Sc., University of California, Davis, 1987 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-95-1914.ps.Z, 19950703 INDUCTIVE CLASSIFIER LEARNING FROM DATA: AN EXTENDED BAYESIAN BELIEF FUNCTION APPROACH BY YONG MA B.Sc., Dalian University of Technology, 1983 M.Sc., University of California, Davis, 1987 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-95-1909.ps.Z, 19950710 c Copyright by Ilan Moshe Shimshoni, 1995. INTERPRETING IMAGES OF POLYHEDRAL OBJECTS IN THE PRESENCE OF UNCERTAINTY BY ILAN MOSHE SHIMSHONI B.A., Hebrew University of Jerusalem, 1985 M.Sc., Weizmann Institute of Science, 1989 THESIS Submitted in partial fulfillment of the requirements for the degree of
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-95-1909.ps.Z, 19950710 c Copyright by Ilan Moshe Shimshoni, 1995. INTERPRETING IMAGES OF POLYHEDRAL OBJECTS IN THE PRESENCE OF UNCERTAINTY BY ILAN MOSHE SHIMSHONI B.A., Hebrew University of Jerusalem, 1985 M.Sc., Weizmann Institute of Science, 1989 THESIS Submitted in partial fulfillment of the requirements for the degree of
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-95-1917.ps.Z, 19950713 c Copyright by Anmol Mathur 1995 TIMING DRIVEN OPTIMIZATION PROBLEMS IN VLSI CAD BY ANMOL MATHUR B. Tech., Indian Institute of Technology, Delhi, 1990 M.S., University of Illinois at Urbana-Champaign, 1993 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-95-1917.ps.Z, 19950713 c Copyright by Anmol Mathur 1995 TIMING DRIVEN OPTIMIZATION PROBLEMS IN VLSI CAD BY ANMOL MATHUR B. Tech., Indian Institute of Technology, Delhi, 1990 M.S., University of Illinois at Urbana-Champaign, 1993 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-95-1918.ps.Z, 19950719 c Copyright by R. Alan Whitehurst 1995 SYSTEMIC SOFTWARE REUSE THROUGH ANALOGICAL REASONING BY R. ALAN WHITEHURST B.S., Brigham Young University, 1983 M.S., Johns Hopkins University, 1986 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-95-1918.ps.Z, 19950719 c Copyright by R. Alan Whitehurst 1995 SYSTEMIC SOFTWARE REUSE THROUGH ANALOGICAL REASONING BY R. ALAN WHITEHURST B.S., Brigham Young University, 1983 M.S., Johns Hopkins University, 1986 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-94-1898.ps.Z, 19950720 EFFICIENT SCHEDULING OF PARALLEL TASKS IN A MULTIPROGRAMMING ENVIRONMENT BY DALE ALLAN SCHOUTEN B.S.C.E., University of Arizona, 1986 M.S., University of Illinois, 1990 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in the Graduate
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-94-1898.ps.Z, 19950720 EFFICIENT SCHEDULING OF PARALLEL TASKS IN A MULTIPROGRAMMING ENVIRONMENT BY DALE ALLAN SCHOUTEN B.S.C.E., University of Arizona, 1986 M.S., University of Illinois, 1990 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in the Graduate
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-95-1916.ps.Z, 19950724 { Copyright by Jonathan Matthew Gratch, 1995 13 BY JONATHAN MATTHEW GRATCH B.A., University of Texas at Austin, 1986 M.S., University of Illinois at Urbana-Champaign, 1993 ON EFFICIENT APPROACHES TO THE UTILITY PROBLEM IN ADAPTIVE PROBLEM SOLVING THESIS Submitted in partial fulfillment of the
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-95-1916.ps.Z, 19950724 { Copyright by Jonathan Matthew Gratch, 1995 13 BY JONATHAN MATTHEW GRATCH B.A., University of Texas at Austin, 1986 M.S., University of Illinois at Urbana-Champaign, 1993 ON EFFICIENT APPROACHES TO THE UTILITY PROBLEM IN ADAPTIVE PROBLEM SOLVING THESIS Submitted in partial fulfillment of the
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-95-1924.ps.Z, 19950728 c Copyright by Ellard Thomas Roush 1995 THE FREEZE FREE ALGORITHM FOR PROCESS MIGRATION BY ELLARD THOMAS ROUSH B.S., University of Washington, 1976 M.S., Stanford University, 1977 M.B.A., Campbell University, 1980 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-95-1924.ps.Z, 19950728 c Copyright by Ellard Thomas Roush 1995 THE FREEZE FREE ALGORITHM FOR PROCESS MIGRATION BY ELLARD THOMAS ROUSH B.S., University of Washington, 1976 M.S., Stanford University, 1977 M.B.A., Campbell University, 1980 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-95-1923.ps.Z, 19950731 c Copyright by STEPHEN WILSON TURNER 1995 PERFORMANCE ANALYSIS OF MULTIPROCESSOR INTERCONNECTION NETWORKS USING A BURST-TRAFFIC MODEL BY STEPHEN WILSON TURNER B.S. E.E., Ohio State University, 1986 M.S. E.C.E., University of Illinois, 1989 THESIS Submitted in partial fulfillment of the requirements for
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-95-1923.ps.Z, 19950731 c Copyright by STEPHEN WILSON TURNER 1995 PERFORMANCE ANALYSIS OF MULTIPROCESSOR INTERCONNECTION NETWORKS USING A BURST-TRAFFIC MODEL BY STEPHEN WILSON TURNER B.S. E.E., Ohio State University, 1986 M.S. E.C.E., University of Illinois, 1989 THESIS Submitted in partial fulfillment of the requirements for
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/kadie/phd.ps.gz, 19950804 Copyright by Carl Myers Kadie, 1995 SEER: MAXIMUM LIKELIHOOD REGRESSION FOR LEARNING-SPEED CURVES BY CARL MYERS KADIE B.S., University of Illinois, 1985 M.S., University of Illinois, 1989 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-94-1890.ps.gz, 19950811 THE REPLAY OF PROGRAM DERIVATIONS BY ROBERT W. HASKER B.S., Wheaton College, 1984 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in the Graduate College of the University of Illinois at Urbana-Champaign, 1995 Urbana, Illinois THE
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-94-1890.ps.gz, 19950811 THE REPLAY OF PROGRAM DERIVATIONS BY ROBERT W. HASKER B.S., Wheaton College, 1984 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in the Graduate College of the University of Illinois at Urbana-Champaign, 1995 Urbana, Illinois THE
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-95-1922.ps.Z, 19950814 c Copyright by Peichen Pan, 1995 LOGIC AND LAYOUT OPTIMIZATION FOR SEQUENTIAL CIRCUITS BY PEICHEN PAN B.Engr., Xidian University, 1984 M.S., Peking University, 1987 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in the Graduate
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-95-1922.ps.Z, 19950814 c Copyright by Peichen Pan, 1995 LOGIC AND LAYOUT OPTIMIZATION FOR SEQUENTIAL CIRCUITS BY PEICHEN PAN B.Engr., Xidian University, 1984 M.S., Peking University, 1987 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in the Graduate
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-95-1874.ps.Z, 19950905 Copyright by Carl Myers Kadie, 1995 SEER: MAXIMUM LIKELIHOOD REGRESSION FOR LEARNING-SPEED CURVES BY CARL MYERS KADIE B.S., University of Illinois, 1985 M.S., University of Illinois, 1989 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-95-1874.ps.Z, 19950905 Copyright by Carl Myers Kadie, 1995 SEER: MAXIMUM LIKELIHOOD REGRESSION FOR LEARNING-SPEED CURVES BY CARL MYERS KADIE B.S., University of Illinois, 1985 M.S., University of Illinois, 1989 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer
	ftp://ftp.cs.uiuc.edu/pub/dcs/Locally_Developed_Software/CHARM/www/papers/ParallelSort_ICPP93.ps.gz, 19950912 A COMPARISON BASED PARALLEL SORTING ALGORITHM Laxmikant V. Kal e Sanjeev Krishnan Department of Computer Science Department of Computer Science University of Illinois University of Illinois Urbana, IL 61801 Urbana, IL 61801 E-mail: kale@cs.uiuc.edu E-mail: sanjeev@cs.uiuc.edu
	ftp://ftp.cs.uiuc.edu/pub/dcs/Locally_Developed_Software/CHARM/www/papers/CharmOverview.ps.gz, 19950912 Parallel Programming with CHARM: An Overview L. V. Kale Department of Computer Science, University of Illinois, Urbana-Champaign. email : kale@cs.uiuc.edu Phone : (217) 244-0094, Email: kale@cs.uiuc.edu
	ftp://ftp.cs.uiuc.edu/pub/dcs/Locally_Developed_Software/CHARM/www/papers/TPDS_PartII.ps.gz, 19950912 The Charm Parallel Programming Language and System: Part II - The Runtime System B. Ramkumar A. B. Sinha V. A. Saletore L. V. Kal e Dept. of Electrical and Computer Eng. Dept. of Computer Science Dept. of Computer Science University of Iowa University of Illinois Oregon State University Iowa City, Iowa
	ftp://ftp.cs.uiuc.edu/pub/dcs/Locally_Developed_Software/CHARM/www/papers/Symbolic_LNCS93.ps.gz, 19950912 Prioritization in Parallel Symbolic Computing L. V. Kale1, B. Ramkumar2, V. Saletore3, and A. B. Sinha1 1 Department of Computer Science, University of Illinois at Urbana Champaign, 1304 W. Springfield Ave., Urbana IL-61801 2 Department of Electrical and Computer Engineering, University of Iowa, Iowa
	ftp://ftp.cs.uiuc.edu/pub/dcs/Locally_Developed_Software/CHARM/www/papers/PrioritizedLoadBalancing_IPPS93.ps.gz, 19950912 A Load Balancing Strategy For Prioritized Execution of Tasks Amitabh B. Sinha Laxmikant V. Kal e Department of Computer Science Department of Computer Science University of Illinois University of Illinois Urbana, IL 61801 Urbana, IL 61801 email: sinha@cs.uiuc.edu email: kale@cs.uiuc.edu
	ftp://ftp.cs.uiuc.edu/pub/dcs/Locally_Developed_Software/CHARM/www/papers/Projections_IPPS93.ps.gz, 19950912 Projections: A Preliminary Performance Tool for Charm Amitabh B. Sinha Laxmikant V. Kal e Department of Computer Science Department of Computer Science University of Illinois University of Illinois Urbana, IL 61801 Urbana, IL 61801 email: sinha@cs.uiuc.edu email: kale@cs.uiuc.edu
	ftp://ftp.cs.uiuc.edu/pub/dcs/Locally_Developed_Software/CHARM/www/papers/Checkpoint.ps.gz, 19950912 Efficient, Language-Based Checkpointing for Massively Parallel Programs Sanjeev Krishnan Department of Computer Science, University of Illinois, Urbana-Champaign. email : sanjeev@cs.uiuc.edu Phone : (217) 333-5827 Laxmikant V. Kale Department of Computer Science, University of Illinois,
	ftp://ftp.cs.uiuc.edu/pub/dcs/Locally_Developed_Software/CHARM/www/papers/ChareKernel_ICPP91.ps.gz, 19950912 Supporting Machine Independent Parallel Programming on Diverse Architectures W. Fenton B. Ramkumar V. A. Saletore A. B. Sinha L. V. Kal e Department of Computer Science, University Of Illinois at Urbana{Champaign, Urbana, Illinois 61801
	ftp://ftp.cs.uiuc.edu/pub/dcs/Locally_Developed_Software/CHARM/www/papers/Performance_ICPP94.ps.gz, 19950912 A framework for intelligent performance feedback Amitabh B. Sinha Laxmikant V. Kal e Department of Computer Science, University of Illinois, Urbana. Urbana, IL 61801. email: sinhajkale@cs.uiuc.edu
	ftp://ftp.cs.uiuc.edu/pub/dcs/Locally_Developed_Software/CHARM/www/papers/TPDS_PartI.ps.gz, 19950912 The Charm Parallel Programming Language and System: Part I \| Description of Language Features L. V. Kal e B. Ramkumar A. B. Sinha A. G ursoy Dept. of Computer Science Dept. of Electrical and Computer Engineering University of Illinois University of Iowa Urbana, IL 61801 Iowa City, IA 52242 E-mail:
	ftp://ftp.cs.uiuc.edu/pub/dcs/Locally_Developed_Software/CHARM/www/papers/InformationSharing_SC93.ps.gz, 19950912 Information sharing mechanisms in parallel programs Laxmikant V. Kal e Department of Computer Science, University Of Illinois at Urbana{Champaign, Urbana, Illinois 61801. email: kale@cs.uiuc.edu Amitabh B. Sinha Department of Computer Science, University Of Illinois at Urbana{Champaign, Urbana, Illinois
	ftp://ftp.cs.uiuc.edu/pub/dcs/Locally_Developed_Software/CHARM/www/papers/FMA_ICPP95.ps.gz, 19950912 To appear in International Conference on Parallel Processing, August 1995. A PARALLEL ADAPTIVE FAST MULTIPOLE ALGORITHM FOR N-BODY PROBLEMS Sanjeev Krishnan and Laxmikant V. Kal e Department of Computer Science University of Illinois Urbana, IL 61801. E-mail: fsanjeev,kaleg@cs.uiuc.edu
	ftp://ftp.cs.uiuc.edu/pub/dcs/Locally_Developed_Software/CHARM/www/papers/Charm++_OOPSLA93.ps.gz, 19950912 CHARM++ : A Portable Concurrent Object Oriented System Based On C++* Laxmikant V. Kale Department of Computer Science University of Illinois, Urbana-Champaign email : kale@cs.uiuc.edu Sanjeev Krishnan Department of Computer Science University of Illinois, Urbana-Champaign email : sanjeev@cs.uiuc.edu
	ftp://ftp.cs.uiuc.edu/pub/dcs/Locally_Developed_Software/CHARM/www/papers/hpccPosition.ps.gz, 19950912 APPLICATION ORIENTED AND COMPUTER SCIENCE CENTERED HPCC RESEARCH Laxmikant V. Kal e Department of Computer Science University of Illinois Urbana, IL 61801 E-mail: kale@cs.uiuc.edu
	ftp://ftp.cs.uiuc.edu/pub/dcs/Locally_Developed_Software/CHARM/www/papers/agents.ps.gz, 19950912 Agents: an Undistorted Representation of Problem Structure J. Yelon and L. V. Kal e Dept. of Computer Science, University of Illinois, Urbana Illinois 61801, jyelon@cs.uiuc.edu, kale@cs.uiuc.edu
	ftp://ftp.cs.uiuc.edu/pub/dcs/Locally_Developed_Software/CHARM/www/papers/DP_TR_92_10.ps.gz, 19950912 Dynamic Adaptive Scheduling in an Implementation of a Data Parallel Language Edward A. Kornkven Department of Computer Science University Of Illinois Urbana, IL 61801 email: kornkven@cs.uiuc.edu tel: (217)-333-5827 fax: (217)-333-3501 Laxmikant V. Kal e Department of Computer Science University Of
	ftp://ftp.cs.uiuc.edu/pub/dcs/Locally_Developed_Software/CHARM/www/papers/Quiescence.ps.gz, 19950912 A dynamic and adaptive quiescence detection algorithm Amitabh B. Sinha Laxmikant V. Kal e Department of Computer Science University of Illinois Urbana, Illinois 61801 email: fsinha,kaleg@cs.uiuc.edu Balkrishna Ramkumar Department of Electrical and Computer Engineering University of Iowa Iowa City, Iowa
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-95-1926.ps.Z, 19950921 c Copyright by Lawrence Rauchwerger 1995 RUN-TIME PARALLELIZATION: A FRAMEWORK FOR PARALLEL COMPUTATION BY LAWRENCE RAUCHWERGER Dipl., Institutul Politehnic Bucure sti, 1980 M.S., Stanford University, 1987 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-95-1930.ps.Z, 19950921 AUTOMATIC LAYOUT SYNTHESIS FOR HIGH-PERFORMANCE FULL CUSTOM VLSI CHIPS BY JAEWON KIM B.S., Seoul National University, Seoul, Korea, 1987 M.S., Seoul National University, Seoul, Korea, 1989 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-95-1926.ps.Z, 19950921 c Copyright by Lawrence Rauchwerger 1995 RUN-TIME PARALLELIZATION: A FRAMEWORK FOR PARALLEL COMPUTATION BY LAWRENCE RAUCHWERGER Dipl., Institutul Politehnic Bucure sti, 1980 M.S., Stanford University, 1987 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-95-1925.ps.Z, 19950925 c Copyright by Douglas Paul Bogia 1995 SUPPORTING FLEXIBLE, EXTENSIBLE TASK DESCRIPTIONS IN AND AMONG TASKS BY DOUGLAS PAUL BOGIA B.A., Washburn University of Topeka, 1986 M.S., University of Illinois at Urbana-Champaign, 1988 THESIS Submitted in partial fulfillment of the requirements for the degree of
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-95-1901.ps.Z, 19950929 TOPICS IN COMBINATORIAL AND COMPUTATIONAL GEOMETRY BY EDGAR ARTURO RAMOS Ingen., Pontificia Universidad Javeriana, 1985 Titul., Universidad Nacional de Colombia, 1986 M.S., Michigan State University, 1988 M.S., Michigan State University, 1988 THESIS Submitted in partial fulfillment of the requirements
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-95-1901.ps.Z, 19950929 TOPICS IN COMBINATORIAL AND COMPUTATIONAL GEOMETRY BY EDGAR ARTURO RAMOS Ingen., Pontificia Universidad Javeriana, 1985 Titul., Universidad Nacional de Colombia, 1986 M.S., Michigan State University, 1988 M.S., Michigan State University, 1988 THESIS Submitted in partial fulfillment of the requirements
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-95-1928.ps.Z, 19951012 Algebraic Decomposition of Non-convex Polyhedra Herbert Edelsbrunnery
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-95-1935.ps.Z, 19951013 On the Definition and the Construction of Pockets in Macromolecules Herbert Edelsbrunner y , Michael Facello z and Jie Liang x October 11, 1995
	ftp://ftp.cs.uiuc.edu/pub/dcs/Locally_Developed_Software/CHARM/www/distrib.4.5/charm.manual.ps.gz, 19951027 The Charm (4.3) Programming Language Manual October 27, 1995 1 The Charm software was developed as a group effort. The earliest prototype, Chare Kernel(1.0), was developed by Wennie Shu and Kevin Nomura working with Laxmikant Kale. The second prototype, Chare Kernel(2.0), a complete re-write with major
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-95-1936.ps.Z, 19951106 c Copyright by Swee Boon Lim 1996 ADAPTIVE CACHING IN A DISTRIBUTED FILE SYSTEM BY SWEE BOON LIM B.S., George Washington University, 1987 M.S., University of Illinois, 1991 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in the
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/reddy/private/422.ps, 19951107 Computer Science 422 Programming Language Semantics Course objectives: This course is an advanced sequel to Computer Science 322, Programming Language Design, and an entree to research and advanced topics courses in programming languages. Catalog description: Topics in the theory and formal description
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-95-1929.ps.Z, 19951127 c Copyright by Michael Tracy Barbehenn, 1995. INCREMENTAL GEOMETRIC ROBOT MOTION PLANNING BY MICHAEL TRACY BARBEHENN A.B., Cornell University, 1987 M.S., University of Illinois, 1993 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/reddy/papers/yoneda.ps.Z, 19951209 Electronic Notes in Theoretical Computer Science 1 (1995) to appear Objects, Interference, and the Yoneda Embedding Peter W. O'Hearn 1 Syracuse University Uday S. Reddy 2 University of Illinois at Urbana-Champaign Dedicated to John C. Reynolds, in honor of his 60th birthday.
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/reddy/papers/global.object.ps.Z, 19951211 J. of Lisp and Symbolic Computation, , 1{78 (199 ) c 199 Kluwer Academic Publishers, Boston. Manufactured in The Netherlands. Global State Considered Unnecessary: An Introduction to Object-Based Semantics UDAY S. REDDY reddy@cs.uiuc.edu Department of Computer Science, University of Illinois at
	ftp://ftp.cs.uiuc.edu/pub/dcs/Locally_Developed_Software/CHARM/www/distrib.4.5/charm++.manual.ps.gz, 19951212 The Charm++ (4.5) Programming Language Manual December 7, 1995 1 The Charm software was developed as a group effort. The earliest prototype, Chare Kernel(1.0), was developed by Wennie Shu and Kevin Nomura working with Laxmikant Kale. The second prototype, Chare Kernel(2.0), a complete re-write with
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-95-1938.ps.Z, 19951213 c Copyright by Chaeryung Park, 1996 TASK SCHEDULING IN HIGH LEVEL SYNTHESIS BY CHAERYUNG PARK B.S.Engr., Seoul National University, 1987 M.S.Engr., Seoul National University, 1989 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-95-1934.ps.Z, 19960103 User Access Patterns to NCSA's World Wide Web Server Thomas T. Kwan Robert E. McGrath y Daniel A. Reed z National Center for Supercomputing Applications Department of Computer Science University of Illinois Urbana, Illinois 61801
	ftp://ftp.cs.uiuc.edu/pub/dcs/Locally_Developed_Software/CHARM/www/papers/Converse_IPPS96.ps.gz, 19960123 To appear in the International Parallel Processing Symposium, April 1996. Converse : An Interoperable Framework for Parallel Programming Laxmikant V. Kal e, Milind Bhandarkar, Narain Jagathesan, Sanjeev Krishnan, Joshua Yelon Department of Computer Science, University of Illinois, Urbana, IL 61801.
	ftp://ftp.cs.uiuc.edu/pub/dcs/Locally_Developed_Software/perts/SimulatorPaper.ps, 19960124 DRTSS: A Simulation Framework for Complex Real-Time Systems Matthew F. Storch and Jane W.-S. Liu Department of Computer Science University of Illinois Urbana, IL 61801
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/saylor/hw2.ps, 19960202 CSE 411 / CS 450 Homework 2 1. Exercise 3, problem 6. 2. The concept of definiteness may be generalized to B-definiteness: A matrix A is defined to be B-definite if hAv; vi <> for v <> 0. Discuss whether A is definite if and only if it is B-definite. That is, either prove this or give a counter-example.
	ftp://ftp.cs.uiuc.edu/pub/dcs/Locally_Developed_Software/CHARM/www/distrib.4.5/converse.manual.ps.gz, 19960204 Converse Programming Manual February 4, 1996 Converse Parallel Programming Environment was developed as a group effort at Parallel Programming Laboratory, University of Illinois at Urbana- Champaign. The team consisted of Attila Gursoy, Sanjeev Krishnan, Joshua Yelon, Milind Bhandarkar, Narain
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-95-1905.ps.Z, 19960205 c Copyright by Changwen Liu 1996 IMPRECISE COMPUTATION IN REAL-TIME CONTROL SYSTEMS BY CHANGWEN LIU B.Sc., Hunan Normal University, 1982 M.Sc., Huazhong University of Science and Technology, 1985 M.S., University of Illinois at Urbana-Champaign, 1992 THESIS Submitted in partial fulfillment of the
	ftp://ftp.cs.uiuc.edu/pub/Dept_Of_Computer_Science/Tech_Reports/UIUCDCS-R-95-1905.ps.Z, 19960205 c Copyright by Changwen Liu 1996 IMPRECISE COMPUTATION IN REAL-TIME CONTROL SYSTEMS BY CHANGWEN LIU B.Sc., Hunan Normal University, 1982 M.Sc., Huazhong University of Science and Technology, 1985 M.S., University of Illinois at Urbana-Champaign, 1992 THESIS Submitted in partial fulfillment of the
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/reddy/papers/synthesis.ps.Z, 19960206 J. Symbolic Computation (1993) 11, 1{000 Deductive and Inductive Synthesis of Equational Programsy NACHUM DERSHOWITZ AND UDAY S. REDDY Department of Computer Science, University of Illinois at Urbana-Champaign, U.S.A. (Received 5 June 1993) An equational approach to the synthesis of functional and logic
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/reddy/papers/absint.ps.Z, 19960206 On the Power of Abstract Interpretation Uday S. Reddy, Samuel N. Kamin Department of Computer Science University of Illinois at Urbana-Champaign Urbana, IL 61801 Net: freddy,kaming@cs.uiuc.edu
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/reddy/papers/sci.inference.ps.Z, 19960206 Type Reconstruction for SCI Howard Huang Uday Reddy Department of Computer Science The University of Illinois fhhuang,reddyg@cs.uiuc.edu January 23, 1996
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/reddy/papers/clausal.ps.Z, 19960206 Clausal Completion Francois Bronsard Andersen Consulting, Northbrook, IL 60062, USA. Uday S. Reddy Dept. of Computer Science The University of Illinois at Urbana-Champaign January 11, 1996
	ftp://ftp.cs.uiuc.edu/pub/dcs/Locally_Developed_Software/CHARM/www/papers/charmpp.ps.gz, 19960207 7 CHARM++ Laxmikant V. Kal e and Sanjeev Krishnan Department of Computer Science, University of Illinois, Urbana-Champaign Urbana, IL 61801 fkale, sanjeevg@cs.uiuc.edu CHARM++ is a parallel object-oriented language based on C++. It was developed over the past few years at the Parallel Programming
	ftp://ftp.cs.uiuc.edu/pub/dcs/Locally_Developed_Software/CHARM/www/papers/ParallelObjectArrays_POOMA96.ps.gz, 19960208 A Parallel Array Abstraction for Data-Driven Objects Sanjeev Krishnan and Laxmikant V. Kal e Dept of Computer Science, University of Illinois, Urbana, IL 61801 E-mail: fsanjeev,kaleg@cs.uiuc.edu
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-96-1941.ps.Z, 19960212 A CONVEX OPTIMIZATION APPROACH FOR MODERATELY LARGE DEFLECTION PROBLEMS IN CIRCULAR MEMBRANES AND CIRCULAR PLATES BY RAJEEVA GAUR B.E., University of Roorkee, 1982 M.Tech., Indian Institute of Technology, Kharagpur, 1984 M.S., Stevens Institute of Technology, 1990 THESIS Submitted in partial fulfillment
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/saylor/cs450c.ps, 19960214 Draft Chap. 2a CG (Saylor), February 14, 1996 19 such that p(k+1) B p(j); <= j <= k: (2.11) Condition (2.11) of course means that hp(k+1); p(j)iB = hAp(k) k X j=0 oekjp(j); p(j)iB = which yields oekj = hAp(k); p(k)iB kp(j)k2 : (2.12) We thus know how to create the new optimal approximation (though the
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/klara/ProbeAlg.ps, 19960218 A Probe-based Algorithm for QoS Specification and Adaptation Klara Nahrstedt, Ashfaq Hossain and Sung-Mo Kang e-mail: klara@cs.uiuc.edu, ashfaq@ipoint.vlsi.uiuc.edu,kang@ece.uiuc.edu University of Illinois at Urbana Champaign
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/klara/QoSrevision.ps, 19960218 Challenges of Providing End-to-End QoS Guarantees in Networked Multimedia Systems Klara Nahrstedt Computer Science Department University of Illinois, Urbana Champaign e-mail: klara@cs.uiuc.edu 1 Introduction Multimedia applications, such as video-on-demand, and remote control applications, require
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/klara/AdmitSched.ps, 19960218 New Algorithms for Admission Control and Scheduling to support Multimedia Feedback Remote Control Applications Klara Nahrstedt Jonathan Smith Computer Science Department Computer Science Department University of Illinois University of Pennsylvania
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-96-1947.ps.Z, 19960307 Compiler Analysis for Cache Coherence: Interprocedural Array Data-Flow Analysis and Its Impacts on Cache Performance1 Lynn Choi Center for Supercomputing Research and Development University of Illinois at Urbana-Champaign 1308 West Main Street Urbana, IL 61801 Email: lchoi@csrd.uiuc.edu Pen-Chung Yew
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-96-1946.ps.Z, 19960307 Hardware and Compiler-Directed Cache Coherence in Large-Scale Multiprocessors: Design Considerations and Performance Study1 Lynn Choi Center for Supercomputing Research and Development University of Illinois at Urbana-Champaign 1308 West Main Street Urbana, IL 61801 Email: lchoi@csrd.uiuc.edu Pen-Chung
	ftp://ftp.cs.uiuc.edu/pub/dcs/Locally_Developed_Software/CHARM/www/papers/RuntimeOpts_ICS96.ps.gz, 19960308 Automating Parallel Runtime Optimizations Using Post-Mortem Analysis Sanjeev Krishnan and Laxmikant V. Kale Department of Computer Science, University of Illinois, Urbana-Champaign. Email : fsanjeev,kaleg@cs.uiuc.edu Phone : (217) 244-0094
	ftp://ftp.cs.uiuc.edu/pub/dcs/Locally_Developed_Software/CHARM/www/reportlist.ps.gz, 19960309 Introduction to Reports and Publications Parallel Programming Laboratory L.V. Kale University of Illinois at Urbana Champaign Department of Computer Science kale@cs.uiuc.edu (217) 244-0094 The research at the laboratory is focussed on tools, techniques, and applications of parallel pro- cessing. Much of
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-96-1943.ps.Z, 19960313 c Copyright by Chun Xia 1996 EXPLOITING MULTIPROCESSOR MEMORY HIERARCHIES FOR OPERATING SYSTEMS BY CHUN XIA B.Engr., Tsinghua University, 1985 M.Engr., Tsinghua University, 1989 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in the
	ftp://ftp.cs.uiuc.edu/pub/dcs/Locally_Developed_Software/CHARM/www/distrib.4.5/install.manual.ps.gz, 19960322 Charm/Charm++/Converse Installation and Usage Parallel Programming Laboratory Department of Computer Science University of Illinois at Urbana{Champaign November 17, 1995 1 INTRODUCTION 1 1 Introduction In this manual, we describe how to install Charm, Charm++ and Converse, how to compile and execute
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-96-1948.ps.Z, 19960326 HARDWARE AND COMPILER SUPPORT FOR CACHE COHERENCE IN LARGE-SCALE SHARED-MEMORY MULTIPROCESSORS BY LYNN CHOI B.S., Seoul National University, 1986 M.S., Seoul National University, 1988 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-96-1945.ps.Z, 19960326 c Copyright by Patrick Joseph Moran 1996 VISUALIZATION AND MODELING WITH SHAPE BY PATRICK JOSEPH MORAN B.S.E.E., University of Santa Clara, 1984 M.S., University of Illinois at Urbana-Champaign, 1990 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in
	ftp://ftp.cs.uiuc.edu/pub/dcs/Locally_Developed_Software/CHARM/www/distrib.4.6/doc/converse.manual/manual.ps.gz, 19960415 Charm/Charm++/Converse Installation and Usage Parallel Programming Laboratory Department of Computer Science University of Illinois at Urbana{Champaign April 18, 1996 1 INTRODUCTION 1 1 Introduction In this manual, we describe how to install Charm, Charm++ and Converse, how to compile and execute
	ftp://ftp.cs.uiuc.edu/pub/dcs/Locally_Developed_Software/CHARM/www/distrib.4.6/doc/install.manual/manual.ps.gz, 19960415 Charm/Charm++/Converse Installation and Usage Parallel Programming Laboratory Department of Computer Science University of Illinois at Urbana{Champaign April 18, 1996 1 INTRODUCTION 1 1 Introduction In this manual, we describe how to install Charm, Charm++ and Converse, how to compile and execute
	ftp://ftp.cs.uiuc.edu/pub/dcs/Locally_Developed_Software/CHARM/www/distrib.4.6/doc/charm++.manual/manual.ps.gz, 19960418 The Charm++ (4.5) Programming Language Manual April 18, 1996 1 The Charm software was developed as a group effort. The earliest prototype, Chare Kernel(1.0), was developed by Wennie Shu and Kevin Nomura working with Laxmikant Kale. The second prototype, Chare Kernel(2.0), a complete re-write with major
	ftp://ftp.cs.uiuc.edu/pub/dcs/Locally_Developed_Software/CHARM/www/distrib.4.6/doc/summary.manual/manual.ps.gz, 19960418 User Manual for SummaryTool (version 1.0) 1 Introduction SummaryTool presents summary performance information for the machine independent parallel programming language Charm. Charm is currently available on shared machines including Multimax and Sequent Symmetry, nonshared machines including Intel
	ftp://ftp.cs.uiuc.edu/pub/dcs/Locally_Developed_Software/CHARM/www/distrib.4.6/doc/charm.manual/aboutCharm.ps.gz, 19960418 Parallel Programming with CHARM CHARM is a machine independent parallel programming system. Programs written using this system will run unchanged on MIMD machines with or without a shared memory. It provides high-level mechanisms and strategies to facilitate the task of developing even highly complex
	ftp://ftp.cs.uiuc.edu/pub/dcs/Locally_Developed_Software/CHARM/www/distrib.4.6/doc/charm.manual/tut.ps.gz, 19960418 A Tutorial Introduction to Charm L.V. Kale Department of Computer Science University of Illinois at Urbana Champaign 1304 W. Springfield Ave., Urbana, IL-61801 1 Introduction Charm is a machine independent parallel programming system. Programs written using this system will run unchanged on MIMD
	ftp://ftp.cs.uiuc.edu/pub/dcs/Locally_Developed_Software/CHARM/www/distrib.4.6/doc/charm.manual/manual.ps.gz, 19960418 The Charm (4.5) Programming Language Manual April 18, 1996 1 The Charm software was developed as a group effort. The earliest proto- type, Chare Kernel(1.0), was developed by Wennie Shu and Kevin Nomura working with Laxmikant Kale. The second prototype, Chare Kernel(2.0), a complete re-write with major
	ftp://ftp.cs.uiuc.edu/pub/dcs/Locally_Developed_Software/CHARM/www/distrib.4.6/doc/dagger.tutorial/tut.ps.gz, 19960418 Dagger Language: Tutorial 1 Introduction In order to reduce the complexity of program development, a coordination language called Dagger has been developed on top of Charm system. In Charm, an entry point is executed when there is a message directed to it. If the computation in that entry point is
	ftp://ftp.cs.uiuc.edu/pub/dcs/Locally_Developed_Software/CHARM/www/distrib.4.6/doc/sysdoc/doc.ps.gz, 19960418 Chare Kernel - the Charm Runtime System - Documentation The "system" described here is only the inner kernel, consisting of modules: initialization, main, ck, boc, communication, condsends, , qm, vid. 1 The documentation will describe the system at three levels: 1. Flow of control.
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-96-1950.ps.Z, 19960424 c Copyright by Daniel Charles Sturman, 1996 MODULAR SPECIFICATION OF INTERACTION POLICIES IN DISTRIBUTED COMPUTING BY DANIEL CHARLES STURMAN B.S., Cornell University, 1991 M.S., University of Illinois, 1994 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-96-1933.ps.Z, 19960425 c Copyright by Jonathan Charles Springer 1996 IMPLEMENTATION OF FUNCTIONAL LANGUAGES WITH STATE BY JONATHAN CHARLES SPRINGER B.S., Rice University, 1989 B.A., Rice University, 1989 M.S., University of Illinois, 1992 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-96-1919.ps.Z, 19960503 c Copyright by Kent Eldon Seamons 1996 PANDA: FAST ACCESS TO PERSISTENT ARRAYS USING HIGH LEVEL INTERFACES AND SERVER DIRECTED INPUT/OUTPUT BY KENT ELDON SEAMONS B.S., Brigham Young University, 1986 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-96-1955.ps.Z, 19960507 c Copyright by David Chazin 1996 All Rights Reserved AN ARCHITECTURE AND TRANSACTION MODEL FOR LARGE FEDERATED DATA BASES BY DAVID CHAZIN B.S., Colorado School of Mines, 1977 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in the
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/klara/TuningSystem.ps, 19960508 A Tuning System for Distributed Multimedia Applications Klara Nahrstedt and Lintian Qiao University of Illinois e-mail: klara,l-qiao@cs.uiuc.edu
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/klara/LessonsLearned.ps, 19960508 End-to-End QoS Guarantees: Lessons Learned from OMEGA Klara Nahrstedt Jonathan M. Smith Computer Science Department CIS Department University of Illinois University of Pennsylvania
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/klara/OMEGA.ps, 19960508 Design, Implementation and Experiences of the OMEGA End-Point Architecture Klara Nahrstedt Computer Science Department University of Illinois at Urbana-Champaign, IL 61801 Jonathan M. Smith Distributed Systems Laboratory University of Pennsylvania, Philadelphia, PA 19104
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/klara/QoSbroker.ps, 19960508 The QoS Broker Klara Nahrstedt and Jonathan M. Smith Distributed Systems Laboratory University of Pennsylvania, Philadelphia, PA 19104-6389
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-96-1960.ps.Z, 19960522 AUTONOMOUS HIERARCHICAL ADAPTIVE MESH REFINEMENT FOR MULTISCALE SIMULATIONS BY HENRY JOEL NEEMAN B.S., State University of New York at Buffalo, 1987 B.A., State University of New York at Buffalo, 1987 M.S., University of Illinois at Urbana-Champaign, 1990 University of Illinois at Urbana-Champaign, 1996
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-96-1956.ps.Z, 19960528 COMPILER TECHNIQUES FOR MATLAB PROGRAMS BY LUIZ ANT^ONIO DE ROSE Bach., Universidade de Bras lia, 1978 M.Stat., Universidade de Bras lia, 1982 M.S., University of Illinois at Urbana-Champaign, 1992 THESIS Submitted in partial fullfilment of the requirements for the degree of Doctor of Philosophy in
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-96-1953.ps.Z, 19960531 c Copyright by Cheng Chang 1996 A NEW MODEL FOR ENGINEERING TRANSACTION BY CHENG CHANG B.S., Chung Cheng Institute of Technology, 1982 M.S., National Tsing Hwa University, 1987 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in the
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-96-1942.ps.Z, 19960610 MOLECULE SURFACE TRIANGULATION FROM ALPHA SHAPES BY NATARAJ AKKIRAJU B.S., Osmania University, 1985 M.C.A., University of Hyderabad, 1988 M.S., University of Minnesota, 1991 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in the
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/skeel/namd.ps, 19960610 NAMD{a Parallel, Object-Oriented Molecular Dynamics Program Mark Nelson, William Humphrey, Attila Gursoy, Andrew Dalke Laxmikant Kal e, Robert D. Skeel, Klaus Schulten Theoretical Biophysics Group University of Illinois and Beckman Institute 405 North Matthews Urbana, IL 61801 June 10, 1996 1 Proposed
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-96-1963.ps.Z, 19960621 A Convex Optimization Approach for Moderately Large Deflection Problem in Circular Plates Rajeeva Gaur1 Actel Corp. 955 E. Arques Ave. Sunnyvale, CA 94086 Pravin M. Vaidya Department of Computer Science University of Illinois at Urbana-Champaign 1304, W. Springfield Avenue Urbana, IL 61801. May 2, 1996
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-96-1962.ps.Z, 19960621 c Copyright by Sanjeev Krishnan 1996 AUTOMATING RUNTIME OPTIMIZATIONS FOR PARALLEL OBJECT-ORIENTED PROGRAMMING BY SANJEEV KRISHNAN B.Tech., Indian Institute of Technology, Bombay, 1991 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-96-1964.ps.Z, 19960621 A Convex Optimization Approach for Moderately Large Deflection Problem in Circular Membranes Rajeeva Gaur1 Actel Corp. 955 E. Arques Ave. Sunnyvale, CA 94086 Pravin M. Vaidya Department of Computer Science University of Illinois at Urbana-Champaign 1304, W. Springfield Avenue Urbana, IL 61801. May 7,
	ftp://ftp.cs.uiuc.edu/pub/dcs/Locally_Developed_Software/CHARM/www/papers/SanjeevThesis.ps.gz, 19960622 c Copyright by Sanjeev Krishnan 1996 AUTOMATING RUNTIME OPTIMIZATIONS FOR PARALLEL OBJECT-ORIENTED PROGRAMMING BY SANJEEV KRISHNAN B.Tech., Indian Institute of Technology, Bombay, 1991 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-96-1949.ps.Z, 19960625 Bounding the End-to-End Response Times of Tasks in a Distributed Real-Time System Using the Direct Synchronization Protocol Jun Sun Jane Liu
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-94-1887.ps.Z, 19960628 Constrained Software and Runtime System Generation for Embedded Applications Rajesh K. Gupta Department of Computer Science University of Illinois, Urbana-Champaign 1304 W. Springfield Avenue Urbana, IL 61801. (rgupta@cs.uiuc.edu) Giovanni De Micheli Departments of EECS Stanford University Stanford, CA
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-95-1907.ps.Z, 19960628 VALIDATING TIMING CONSTRAINTS IN MULTIPROCESSOR AND DISTRIBUTED SYSTEMS BY RHAN HA B.S., Seoul National University, 1987 M.S., Seoul National University, 1989 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science in the Graduate College of
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-94-1851.ps.Z, 19960628 An algorithm for intersecting equal radius balls in R3 1 Edgar A. Ramos 2
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-96-1957.ps.Z, 19960703 End-to-End QoS Guarantees: Lessons Learned from OMEGA Klara Nahrstedt Jonathan M. Smith Computer Science Department CIS Department University of Illinois University of Pennsylvania
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-96-1958.ps.Z, 19960703 A Tuning System for Distributed Multimedia Applications Klara Nahrstedt and Lintian Qiao University of Illinois e-mail: klara,l-qiao@cs.uiuc.edu
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/skeel/NYU/fig3.ps, 19960706 0.01 0.1 1 10 100 2 4 6 8 10 12 14 log10(\|max-min\|/energy) timestep alpha=0 (postprocessed) alpha=1/4 log10(D/energy)
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/skeel/NYU/fig1.ps, 19960706 0.01 0.1 1 10 100 1 1.2 1.4 1.6 1.8 2 2.2 2.4 2.6 log10(\|max-min\|/energy) timestep not postprocessed cheaply postprocessed postprocessed log10(D/energy)
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/skeel/NYU/fig6.ps, 19960706 0.01 0.1 1 10 100 2 4 6 8 10 12 14 log10(\|max-min\|/energy) timestep alpha=0 (postprocessed) alpha=1/3 (postprocessed) log10(D/energy)
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/skeel/NYU/fig7.ps, 19960706 1e-08 1e-07 1e-06 1e-05 0.0001 0.001 0.01 0.1 1 10 50 100 150 200 log10(\|max-min\|/energy) timestep alpha = 0 (postprocessed) alpha=1/4 log10(epsilon)
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/skeel/NYU/fig2.ps, 19960706 0.01 0.1 1 10 100 2 4 6 8 10 12 14 log10(\|max-min\|/energy) timestep not postprocessed cheaply postprocessed postprocessed log10(D/energy)
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/skeel/NYU/fig8.ps, 19960706 1e-09 1e-08 1e-07 1e-06 1e-05 0.0001 0.001 0.01 0.1 1 10 50 100 150 200 log10(\|max-min\|/energy) timestep apha=0 (postprocessed) alpha=1/3 (postprocessed) log10(epsilon)
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/skeel/NYU/fig0.ps, 19960706 1.57 3.14 4.71 6.28 1.57 3.14
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/skeel/NYU/fig4.ps, 19960706 0.01 0.1 1 10 100 2 4 6 8 10 12 14 log10(\|max-min\|/energy) timestep alpha=0 (postprocessed) alpha=1/3 (postprocessed) log10(D/energy)
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/skeel/NYU/fig5.ps, 19960706 0.01 0.1 1 10 100 2 4 6 8 10 12 14 log10(\|max-min\|/energy) timestep alpha=0 (postprocessed) alpha=1/2 (postprocessed) log10(D/energy)
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/skeel/NYU/fig11.ps, 19960711 1.5 2 2.5 -0.2 -0.1 0.1 0.2
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/skeel/NYU/fig10.ps, 19960711 1.5 2 2.5 -0.2 -0.1 0.1 0.2
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/skeel/NYU/fig9.ps, 19960711 1.5 2 2.5 -0.2 -0.1 0.1 0.2
	ftp://ftp.cs.uiuc.edu/pub/dcs/Faculty-Staff/skeel/NYU/fig12.ps, 19960711 1.5 2 2.5 -0.2 -0.1 0.1 0.2
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-96-1961.ps.Z, 19960712 c Copyright by THOMAS RICHARD IOERGER 1996 CHANGE OF REPRESENTATION IN MACHINE LEARNING, AND AN APPLICATION TO PROTEIN STRUCTURE PREDICTION BY THOMAS RICHARD IOERGER B.S., The Pennsylvania State University, 1989 M.S., University of Illinois, 1992 THESIS Submitted in partial fulfillment of the
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-96-1959.ps.Z, 19960715 SIMPLIFYING AND DEFORMING THROUGH HIERARCHIES OF SIMPLICIAL GRIDS BY ROMAN WAUPOTITSCH Dipl.Ing., University of Technology Graz, 1988 M.S., University of Illinois at Urbana{Champaign, 1992 THESIS Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer
	ftp://ftp.cs.uiuc.edu/pub/dcs/Tech_Reports/UIUCDCS-R-96-1952.ps.Z, 19960715 Constrained Software Synthesis for Embedded Applications Rajesh K. Gupta Department of Computer Science University of Illinois, Urbana-Champaign 1304 W. Springfield Avenue Urbana, IL 61801. Giovanni De Micheli Department of Electrical Engineering Stanford University Stanford, CA 94305.
	ftp://ftp.cs.uiuc.edu/pub/dcs/Locally_Developed_Software/CHARM/europar/notes.ps, 19960823 1 1 August 28, 1996 Structured Dagger Structured Dagger A Coordination Language for Message-Driven Programming Laxmikant V. Kal and Milind A. Bhandarkar Parallel Programming Laboratory Department of Computer Science, University of Illinois, Urbana IL {kale,milind}@cs.uiuc.edu 2 2 August 28, 1996
	ftp://ftp.cs.uiuc.edu/pub/dcs/Locally_Developed_Software/CHARM/europar/paper.ps, 19960823 Structured Dagger: A Coordination Language for Message-Driven Programming Laxmikant V. Kal e and Milind A. Bhandarkar Department of Computer Science University of Illinois, Urbana IL fkale,milindg@cs.uiuc.edu
	ftp://ftp.cs.uiuc.edu/pub/dcs/Locally_Developed_Software/CHARM/europar/slides.ps, 19960823 1 August 28, 1996 Structured Dagger Structured Dagger A Coordination Language for Message-Driven Programming Laxmikant V. Kal and Milind A. Bhandarkar Parallel Programming Laboratory Department of Computer Science, University of Illinois, Urbana IL {kale,milind}@cs.uiuc.edu 2 August 28, 1996 Structured