Browse

ftp://wuarchive.wustl.edu (902)

	ftp://wuarchive.wustl.edu/doc/techreports/purdue.edu/cs/TR823.PS.Z, 19881209 The Internet Worm Program: An Analysis Purdue Technical Report CSD-TR-823 Eugene H. Spafford Department of Computer Sciences Purdue University West Lafayette, IN 47907-2004 spaf@cs.purdue.edu
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr91/tr91-002.ps.Z, 19910702 Non-Blocking Algorithms for Concurrent Data Structures Sundeep Prakash Yann-Hang Lee Theodore Johnson Dept. of Computer and Information Sciences University of Florida Gainesville, FL 32611 July 1, 1991
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr91/tr91-006.ps.Z, 19910730 HETEROGENEOUS DECOMPOSITION AND INTER-LEVEL COUPLING FOR COMBINED MODELING Paul A. Fishwick Dept. of Computer & Information Science University of Florida Bldg. CSE, Room 301 Gainesville, FL 32611
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr91/tr91-005.ps.Z, 19910730 USING DISCRETE EVENT MODELING FOR EFFECTIVE COMPUTER ANIMATION CONTROL Paul A. Fishwick Hanns-Oskar A. Porr Dept. of Computer & Information Science University of Florida Bldg. CSE, Room 301 Gainesville, FL 32611
	ftp://wuarchive.wustl.edu/doc/techreports/uky.edu/cs/191-91.ps.Z, 19910805 An Implementation of Service Rebalancing University of Kentucky Technical Report Number 191-91 To appear in the 1991 Proceedings of the XI International Conference of the Chilean Computer Science Society Eric H. Herrin II Raphael A. Finkel July, 1991
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr91/tr91-007.ps.Z, 19910818 A Highly Concurrent Priority Queue Based on the B-link Tree University of Florida, Department of CIS Electronic Tech Report #007-91 Theodore Johnson August 18, 1991
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr91/tr91-008.ps.Z, 19910826 Feed-forward Neural Nets as Models for Time Series Forecasting Zaiyong Tang BUS 351 Dept. of Decision & Information Sciences University of Florida, Gainesville, FL 32611 Phone: 904-392-9600 Email: zt@beach.cis.ufl.edu Paul A. Fishwick 301 CSE, Department of Computer & Information Sciences University of
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr90/ai-app.paper.ps.Z, 19910904 1 POND: A Knowledge Representation Language which Facilates Requirements Capturing Douglas D. Dankel II Assistant Professor E301 CSE, C.I.S., University of Florida Gainesville, FL 32611 ddd@cis.ufl.edu (904) 392-1387 (Office), (904) 392-1220 (FAX) Wayne Walker Graduate Student E301 CSE, C.I.S. Mark
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr90/swe.paper.ps.Z, 19910905 1 GATOR: A Requirements Gatering System Douglas D. Dankel II Assistant Professor E301 CSE, C.I.S., University of Florida Gainesville, FL 32611 ddd@cis.ufl.edu (904) 392-1387 (Office), (904) 392-1220 (FAX) Wayne Walker Graduate Student E301 CSE, C.I.S. Mark Schmalz Graduate Student E301 CSE, C.I.S. Key
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr91/tr91-023.ps.Z, 19910906 Unsymmetric-pattern multifrontal methods for parallel sparse LU factorization T. A. Davis Computer and Information Sciences Department University of Florida, Gainesville, Florida, USA I. S. Duffy European Center for Research and Advanced Training in Scientific Computation (CERFACS) Toulouse, France
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr91/tr91-009.ps.Z, 19910912 A Concurrent Fast-Fits Memory Manager University of Florida, Dept. of CIS Electronic TR91-009 Theodore Johnson Dept. of Computer and Information Science, University of Florida ted@cis.ufl.edu September 12, 1991
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr90/tr90-034.ps.Z, 19911025 Vertex Splitting In Dags And Applications To Partial Scan Designs And Lossy Circuits Doowon Paik+ Sudhakar Reddy++ Sartaj Sahni+ University of Florida University of Iowa University of Florida
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr91/tr91-030.ps.Z, 19911025 Deleting Vertices To Bound Path Length Doowon Paik+ Sudhakar Reddy++ Sartaj Sahni+ University of Florida University of Iowa University of Florida
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr91/tr91-026.ps.Z, 19911025 Optimal Folding Of Bit Sliced Stacks+ Doowon Paik Sartaj Sahni University of Minnesota University of Florida
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr91/tr91-028.ps.Z, 19911025 Upgrading Circuit Modules To Improve Performance+ Doowon Paik Sartaj Sahni University of Minnesota University of Florida
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr90/book-pro.ps.Z, 19911030 PROSPECTUS The Engineering of Knowledge-based Systems by: Dr. A. J. Gonzalez, University of Central Florida Dr. D. D. Dankel, University of Florida The structure of this text was developed based on the weaknesses which the authors recognized in the texts existing in 1989: too little detail on how
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr91/tr91-031.ps.Z, 19911106 Reconfigurable Mesh Algorithms For Fundamental Data Manipulation Operations Jing-Fu Jenq1 and Sartaj Sahni2 1Department of Soil Science, University of Minnesota, Minneapolis, MN 55455, USA 2Computer and Information Sciences Department, CSE 301, University of Florida, Gainesville, FL 32611, USA
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/89.reports/tr21.89.ps, 19911106 Technical Report CMU/SEI-89-TR-21 ESD-TR-89-29 June 1989 Software Engineering Institute Carnegie Mellon University Pittsburgh, Pennsylvania 15213 1989 SEI Report on Graduate Software Engineering Education ____________________________________________________________________
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr91/tr91-029.ps.Z, 19911106 NP-Hard Network Upgrading Problems+ Doowon Paik Sartaj Sahni University of Minnesota University of Florida University of Florida Technical Report 91-29
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/91.reports/tr02.91.ps, 19911107 Technical Report CMU/SEI-91-TR-2 ESD-TR-91-2 April 1991 Software Engineering Institute Carnegie Mellon University Pittsburgh, Pennsylvania 15213 1991 SEI Report on Graduate Software Engineering Education ___________________________________________________________________
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr91/tr91-024.ps.Z, 19911108 Computing Display Conflicts in String Visualization Dinesh P. Mehta yz Sartaj Sahniy Technical Report 24
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr91/tr91-025.ps.Z, 19911108 A Data Structure for Circular String Analysis and Visualization Dinesh P. Mehta yz Sartaj Sahniy Technical Report 25
	ftp://wuarchive.wustl.edu/doc/techreports/purdue.edu/cs/TR994.PS.Z, 19911127 Are Computer Hacker Break-ins Ethical Purdue Technical Report CSD-TR-994 Eugene H. Spafford Department of Computer Sciences Purdue University West Lafayette, IN 47907{1398 spaf@cs.purdue.edu July, 1990 Revised April, 1991
	ftp://wuarchive.wustl.edu/doc/techreports/purdue.edu/cs/TR933.PS.Z, 19911127 The Internet Worm Incident Technical Report CSD-TR-933* Eugene H. Spafford Department of Computer Sciences Purdue University West Lafayette, IN USA 47907-2004 spaf@cs.purdue.edu On the evening of 2 November 1988, someone ``infected'' the Internet with a worm program. That program exploited flaws in
	ftp://wuarchive.wustl.edu/doc/techreports/uky.edu/cs/raj.mcp.ps.Z, 19911130 MCP: A Protocol For Coordination and Temporal Synchronization in Multimedia Collaborative Applications Raj Yavatkar Department of Computer Science University of Kentucky, Lexington, KY 40506-0027 November 11, 1991
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr91/tr91-027.ps.Z, 19911202 Upgrading Vertices In Trees, Series-Parallel Digraphs And General Series-Parallel Digraphs To Bound Path Length+ Doowon Paik Sartaj Sahni University of Minnesota University of Florida
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/89.reports/files.without.figures/tr36.89.ps, 19911210 Technical Report CMU/SEI-89-TR-36 ESD-89-TR-47 Comparative Evaluations of Four Specification Methods for Real-Time Systems David P. Wood William G. Wood December 1989 Technical Report CMU/SEI-89-TR-36 ESD-89-TR-47 December 1989 Comparative Evaluations of Four Specification Methods for Real-Time Systems
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1991/wucs-91-46.part1.ps.Z, 19920110 Jonathan S. Turner 3 Figure 3: Example of System with Expanding Copy Network we can support a maximum fanout of n and fully loaded input links. This is illustrated in Figure 3. A second problem with Lee's original multicast architecture is that it requires very large memories for multicast address
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1991/wucs-91-37.ps.Z, 19920110 The Power of Self-Directed Learning Sally A. Goldman Department of Computer Science Washington University St. Louis, Missouri 63130 Robert H. Sloany Dept. of Electrical Engineering and Computer Science University of Illinois at Chicago Chicago, IL 60680 WUCS-91-37 December 30, 1991
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1991/wucs-91-46.part2.ps.Z, 19920110 6 A Practical Version of Lee's Multicast Switch Architecture a power of two), the best choice for f is 64, giving a memory requirement of approximately 272 Kbits per input port. To close, let's estimate the overall chip count required to add the multicast capability to a point-to-point network with 256
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1991/wucs-91-29.ps.Z, 19920115 The Difficulty of Random Attribute Noise Sally A. Goldman Department of Computer Science Washington University St. Louis, Missouri 63130 Robert H. Sloany Dept. of Electrical Engineering and Computer Science University of Illinois at Chicago Chicago, IL 60680 WUCS-91-29 June 6, 1991
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1991/wucs-91-21.part2.ps.Z, 19920115 8 Resequencing Cells in an atm Switch Figure 9: Timing of Control Slot Operations Figure 10: Two Level Contention Circuit alter the input operation, by appending the complement of the busy/idle flip flop's state to the slot number during the bus contention. In a large resequencer, a single level
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1991/wucs-91-38.ps.Z, 19920115 Exact Identification of Read-once Formulas Using Fixed Points of Amplification Functions Sally A. Goldmany Department of Computer Science Washington University St. Louis, MO 63130 sg@cs.wustl.edu Michael J. Kearns International Computer Science Institute 1947 Center Street, Suite 600 Berkeley, CA 94704
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1991/wucs-91-21.part1.ps.Z, 19920115 4 Resequencing Cells in an atm Switch Figure 4: Distributed Contention Resolution Figure 5: Buffer Control Circuit The registers at left each contain a unique binary value which is placed sequentially on a wire-or bus, with the most significant bit (msb) first. As the bits are placed on the bus, each
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1991/wucs-91-36.part3.ps.Z, 19920115 Theorem 15.10 Suppose A is a polynomial time learning algorithm for learning monomials using monomials, and can tolerate a malicious error rate of = fflr (n) , then there is a poly- nomial time algorithm A0 for set cover that finds a weighted cover with cost at most 4r(n) times the optimal cost, where n
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1991/wucs-91-21.part3.ps.Z, 19920115 Turner 13 References Coudreuse, J. P. and M. Servel. Prelude: An Asynchronous Time-Division Switched Network," International Communications Conference, 1987. Melen, Riccardo and Jonathan S. Turner. Nonblocking Multirate Networks," SIAM Journal on Computing, 4/89. Melen, Riccardo and
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1991/wucs-91-47.ps.Z, 19920117 A Quantitative Comparison of Architectures for ATM Switching Systems Ellen E. Witte wucs-91-47 October 9, 1991 Department of Computer Science Campus Box 1045 Washington University One Brookings Drive St. Louis, MO 63130-4899
	ftp://wuarchive.wustl.edu/doc/techreports/purdue.edu/cs/91-086.PS.Z, 19920121 User Authentication and Related Topics: An Annotated Bibliography Eugene H. Spafford Stephen A. Weeber Purdue Technical Report CSD{TR{91{086 Introduction This bibliography is the result of our examination of the current state of user authentication, with an emphasis on password authentication. We
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1991/wucs-91-55.ps.Z, 19920122 Designing Communication Networks with Fixed or Nonblocking Traffic Requirements J. Andrew Fingerhut wucs-91-55 January 10, 1992 Department of Computer Science Campus Box 1045 Washington University One Brookings Drive St. Louis, MO 63130-4899
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1991/wucs-91-24.ps.Z, 19920130 The Visual Display of Temporal Information Steve B. Cousins Michael G. Kahn Medical Informatics Laboratory Department of Internal Medicine Washington University School of Medicine Washington University Computer Science Technical Report WUCS-91-24 Correspond with: Steve B. Cousins Medical Informatics
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1991/wucs-91-25.ps.Z, 19920130 CABeN: A Collection of Algorithms for Belief Networks Steve B. Cousins William Chen Mark E. Frisse WUCS-91-25 Medical Informatics Laboratory Washington University October, 1990 Revised January 22, 1992 Correspond with: Steve Cousins Medical Informatics Laboratory Washington University School of Medicine
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1991/wucs-91-48.ps.Z, 19920205 Ranking Radiotherapy Treatment Plans Using Decision-Analytic and Heuristic Techniques Nilesh L. Jain and Michael G. Kahn Medical Informatics and Computer Science, Institute for Biomedical Computing, Campus Box 8036, Washington University School of Medicine, St. Louis MO 63110
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr92/tr92-002.ps.Z, 19920205 A Distributed Data-balanced Dictionary Based on the B-link Tree by Theodore Johnson Adrian Colbrook University of Florida MIT Laboratory for Computer Science Gainesville, FL 32611 Cambridge, MA 02139 ted@squall.cis.ufl.edu colbrook@concerto.lcs.mit.edu February 1992
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/89.reports/tr38.89.ps, 19920214 Technical Report CMU/SEI-89-TR-38 ESD-TR-89-49 Inertial Navigation System Simulator Program: Top-Level Design Kenneth J. Fowler January 1990 Technical Report CMU/SEI-89-TR-38 ESD-TR-89-49 January 1990 Inertial Navigation System Simulator Program: Top-Level Design AB Kenneth J. Fowler Software Systems
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/90.reports/tr22.90.ps, 19920214 Technical Report CMU/SEI-90-TR-22 ESD-90-TR-223 A Design Space and Design Rules for User Interface Software Architecture Thomas G. Lane November 1990 Technical Report CMU/SEI-90-TR-22 ESD-90-TR-223 November 1990 A Design Space and Design Rules for User Interface Software Architecture AB Thomas G. Lane
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/88.reports/files.without.figures/tr17.88.ps, 19920214 Technical Report CMU/SEI-88-TR-17 ESD-TR-88-18 A Distributed Ada Real-Time Kernel Version 2 Judy Bamberger Tim Coddington Robert Firth Daniel Klein David Stinchcomb Roger Van Scoy Currie Colket April 1989 Technical Report CMU/SEI-88-TR-17 ESD-TR-88-18 April 1989 A Distributed Ada Real-Time Kernel
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/87.reports/tr44.87.ps, 19920214 Technical Report CMU/SEI-87-TR-44 ESD-TR-87-207 Report on the SEI Workshop on Ada in Freshman Courses Gary Ford, Editor December 1987 Technical Report CMU/SEI-87-TR-44 ESD-TR-87-207 December 1987 Report on the SEI Workshop on Ada in Freshman Courses AB Gary Ford, Editor Undergraduate Software
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/89.reports/files.without.figures/tr11.89.ps, 19920214 Technical Report CMU/SEI-89-TR-11 ESD-TR-89-19 Scheduling Sporadic and Aperiodic Events in a Hard Real-Time System Brinkley Sprunt Lui Sha John Lehoczky April 1989 Technical Report CMU/SEI-89-TR-11 ESD-TR-89-19 April 1989 Scheduling Sporadic and Aperiodic Events in a Hard Real-Time System AB Brinkley
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/90.reports/tr07.90.ps, 19920214 Technical Report CMU/SEI-90-TR-7 ESD-90-TR-208 Hartstone Benchmark Results and Analysis Patrick Donohoe Ruth Shapiro Nelson Weiderman June 1990 Technical Report CMU/SEI-90-TR-7 ESD-90-TR-208 June 1990 Hartstone Benchmark Results and Analysis AB Patrick Donohoe Ruth Shapiro Nelson Weiderman Real-Time
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/87.reports/tr33.87.ps, 19920214 Technical Report CMU/SEI-87-TR-33 ESD-TR-87-196 Inertial Navigation System Simulator: Behavioral Specification Stefan F. Landherr Mark H. Klein October 1987 Technical Report CMU/SEI-87-TR-33 ESD-TR-87-196 October 1987 Inertial Navigation System Simulator: Behavioral Specification AB Stefan F. Landherr
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/88.reports/tr35.88.ps, 19920214 Technical Report CMU/SEI-88-TR-35 ESD-TR-88-036 Experiment Planning for Software Development: Redevelopment Experiment J. M. Perry K. C. Kang S. Cohen R. Holibaugh A. S. Peterson November 1988 Technical Report CMU/SEI-88-TR-35 ESD-TR-88-036 November 1988 Experiment Planning for Software Development:
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/87.reports/tr37.87.ps, 19920214 Technical Report CMU/SEI-87-TR-37 ESD-TR-87-200 Prototype Real-Time Monitor: User's Manual Roger Van Scoy Charles Plinta Timothy Coddington Richard D'Ippolito Kenneth Lee Michael Rissman November 1987 Technical Report CMU/SEI-87-TR-35 ESD-TR-87-200 November 1987 Prototype Real-Time Monitor: User's
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/87.reports/tr20.87.ps, 19920214 Technical Report CMU/SEI-87-TR-20 ESD-TR-87-171 Teaching a Project-Intensive Introduction to Software Engineering James E. Tomayko August 1987 Technical Report CMU/SEI-87-TR-20 ESD-TR-87-171 September 1987 Teaching a Project-Intensive Introduction to Software Engineering AB James E. Tomayko The Wichita
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/88.reports/tr07.88.ps, 19920214 Technical Report CMU/SEI-88-TR-7 ESD-TR-88-008 July 1988 The Project Management Experiment Peter H. Feiler Roger Smeaton May 1988 Technical Report CMU/SEI-88-TR-7 ESD-TR-88-008 July 1988 The Project Management Experiment AB Peter H. Feiler Evaluation of Environments Project Roger Smeaton Resident
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/87.reports/tr31.87.ps, 19920214 Technical Report CMU/SEI-87-TR-31 ESD-TR-87-194 Annual Technical Report for Ada Embedded Systems Testbed Project Nelson H. Weiderman Neal Altman Mark Borger Patrick Donohoe William E. Hefley Mark H. Klein Stefan F. Landherr Hans Mumm John A. Slusarz December 1987 Technical Report CMU/SEI-87-TR-31
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/88.reports/tr06.88.ps, 19920214 Technical Report CMU/SEI/88-TR-6 ESD-TR-88-007 The Serpent Runtime Architecture and Dialogue Model Len Bass Erik Hardy Kurt Hoyt Reed Little Robert Seacord May 1988 Technical Report CMU/SEI-88-TR-6 ESD-TR-88-007 May 1988 The Serpent Runtime Architecture and Dialogue Model AB Len Bass Erik Hardy Kurt
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/88.reports/tr18.88.ps, 19920214 Technical Report CMU/SEI-88-TR-18 ESD-TR-88-19 The Durra Runtime Environment Mario R. Barbacci Dennis L. Doubleday Charles B. Weinstock July 1988 Technical Report CMU/SEI-88-TR-18 ESD-TR-88-19 July 1988 The Durra Runtime Environment AB Mario R. Barbacci Dennis L. Doubleday Charles B. Weinstock Software
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/87.reports/tr38.87.ps, 19920214 Technical Report CMU/SEI-87-TR-38 ESD-TR-87-201 Prototype Real-Time Monitor: Design Roger Van Scoy Charles Plinta Richard D'Ippolito Kenneth Lee Michael Rissman November 1987 Technical Report CMU/SEI-87-TR-38 ESD-TR-87-201 November 1987 Prototype Real-Time Monitor: Design AB Roger Van Scoy Charles
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/89.reports/tr07.89.ps, 19920214 Technical Report CMU/SEI-89-TR-7 ESD-89-TR-7 Conducting SEI-Assisted Software Process Assessments Timothy G. Olson Watts S. Humphrey Dave Kitson February 1989 Technical Report CMU/SEI-90-TR-7 ESD-90-TR-7 February 1989 Conducting SEI-Assisted Software Process Assessments AB Timothy G. Olson Watts S.
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/89.reports/tr33.89.ps, 19920214 Technical Report CMU/SEI-89-TR-33 ESD-TR-89-44 Durra: A Task-Level Description Language User's Manual Mario R. Barbacci Dennis L. Doubleday Charles B. Weinstock September 1989 Technical Report CMU/SEI-89-TR-33 ESD-TR-89-44 September 1989 Durra: A Task-Level Description Language User's Manual AB Mario R.
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/89.reports/tr02.89.ps, 19920214 Technical Report CMU/SEI-89-TR-2 ESD-89-TR-2 Software Process Modeling: Principles of Entity Process Models Watts S. Humphrey Marc I. Kellner February 1989 Technical Report CMU/SEI-89-TR-2 ESD-89-TR-2 February 1989 Software Process Modeling: Principles of Entity Process Models AB Watts S. Humphrey Marc
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/87.reports/tr27.87.ps, 19920214 Technical Report CMU/SEI-87-TR-27 ESD-TR-87-190 Ada Performance Benchmarks on the MicroVAX II: Summary and Results Version 1.0 Patrick Donohoe December 1987 Technical Report CMU/SEI-87-TR-27 ESD-TR-87-190 December 1987 Ada Performance Benchmarks on the MicroVAX II: Summary and Results Version 1.0 AB
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/87.reports/tr36.87.ps, 19920214 Technical Report CMU/SEI-87-TR-36 ESD-TR-87-199 Prototype Real-Time Monitor: Requirements Richard D'Ippolito Kenneth Lee Charles Plinta Michael Rissman Roger Van Scoy November 1987 Technical Report CMU/SEI-87-TR-36 ESD-TR-87-199 November 1987 Prototype Real-Time Monitor: Requirements AB Richard
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/88.reports/tr22.88.ps, 19920214 Technical Report CMU/SEI-88-TR-22 ESD-TR-88-023 Perspective on Software Reuse J. M. Perry GTE Resident Affiliate GTE Government Systems Corporation September 1988 Technical Report CMU/SEI-88-TR-22 ESD-TR-88-023 September 1988 Perspective on Software Reuse AB J. M. Perry GTE Resident Affiliate GTE
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/88.reports/tr11.88.ps, 19920214 Technical Report CMU/SEI-88-TR-11 ESD-TR-88-012 Managing Development of Very Large Systems: Implications for Integrated Environment Architectures Peter H. Feiler Roger Smeaton May 1988 Technical Report CMU/SEI-88-TR-11 ESD-TR-88-012 May 1988 Managing Development of Very Large Systems: Implications for
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/87.reports/tr22.87.ps, 19920214 Technical Report CMU/SEI-87-TR-22 ESD-TR-87-173 Factors Causing Unexpected Variations in Ada Benchmarks Neal Altman October 1987 Technical Report CMU/SEI-87-TR-22 ESD-TR-87-173 October 1987 Factors Causing Unexpected Variations in Ada Benchmarks AB Neal Altman Ada Embedded Systems Testbed Project
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/89.reports/tr34.89.ps, 19920214 Technical Report CMU/SEI-89-TR-34 ESD-TR-89-45 Durra: A Task-Level Description Language Reference Manual (Version 2) Mario R. Barbacci Jeannette M. Wing September 1989 Technical Report CMU/SEI-89-TR-34 ESD-TR-89-45 September 1989 Durra: A Task-Level Description Language Reference Manual (Version 2) AB
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr92/tr92-001.ps.Z, 19920228 Hypertextual Concurrent Control of a Lisp Kernel P. David Stottsy Richard Furuta z Department of Computer and Department of Computer Science and Information Sciences Institute for Advanced Computer Studies University of Florida University of Maryland Gainesville, FL 32611 College Park, MD 20742
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr92/tr92-003.ps.Z, 19920228 A Functional/Declarative Dichotomy for Characterizing Simulation Models P. A. Fishwick Department of Computer and Information Sciences University of Florida, Bldg CSE, Room 301 Gainesville, FL. 32611
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/87.reports/tr01.87.set/2tr01.87.ps, 19920305 Evaluation of Ada Environments Chapter 3 3. Configuration Management /Version Control Experiments 3.1 Introduction The Configuration Management /Version Control experiments (three in all) exercise the Configuration Management and version control capabilities of the Ada Programming Support Environment
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/87.reports/tr01.87.set/4tr01.87.ps, 19920305 Evaluation of Ada Environments Chapter 6 6. Unit Testing and Debugging (TD) Experiments 6.1 Introduction to Unit Testing and Debugging Experiments This is the second of two generic experiments that evaluate environmental support for programming-in-the-small activities. The first experiment concentrated
	ftp://wuarchive.wustl.edu/doc/techreports/arizona.edu/cs/1991/TR91-22.ps, 19920306 Sabbatical in Japan: Collected Trip Reports Richard D. Schlichting TR 91-22
	ftp://wuarchive.wustl.edu/doc/techreports/arizona.edu/cs/1991/TR91-32.ps, 19920306 P. Verissimo and J. Marques. Reliable broadcast for fault-tolerance on local computer networks. In Ninth IEEE Symposium on Reliable Distributed Systems, pages 543, Huntsville, AL, oct 1990. B. Walter. A robust and efficient protocol for checking the availability of remote sites. Computer
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/87.reports/files.without.figures/tr01.chap5.87.ps, 19920306 Technical Report CMU/SEI-87-TR-1 Evaluation of Ada Environments Nelson Weiderman Technical Report CMU/SEI-87-TR-1 1987 Evaluation of Ada Environments AB Nelson Weiderman Approved for public release. Distribution unlimited. Software Engineering Institute Carnegie Mellon University Pittsburgh,
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/87.reports/tr01.87.set/1tr01.87.ps, 19920306 Technical Report CMU/SEI-87-TR-1 Evaluation of Ada Environments, Executive Summary Nelson Weiderman 1987 Technical Report CMU/SEI-87-TR-1 1987 Evaluation of Ada Environments, Executive Summary AB Nelson Weiderman Approved for public release. Distribution unlimited. Software Engineering Institute
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/87.reports/tr01.87.set/5tr01.87.ps, 19920309 Technical Report CMU/SEI-87-TR-1 Evaluation of Ada Environments Nelson Weiderman Approved for public release. Distribution unlimited. Evaluation of Ada Environments Chapter 7 This technical report was prepared for the SEI Joint Program Office ESD/AVS Hanscom AFB, MA 01731 The ideas and findings in this
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/87.reports/tr01.87.set/6tr01.87.ps, 19920309 Technical Report CMU/SEI-87-TR-1 Evaluation of Ada Environments Nelson Weiderman Technical Report CMU/SEI-87-TR-1 1987 Evaluation of Ada Environments AB Nelson Weiderman Approved for public release. Distribution unlimited. Software Engineering Institute Carnegie Mellon University Pittsburgh,
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1991/wucs-91-43.ps.Z, 19920402 Composition, Superposition, and Encapsulation in the Formal Specification of Distributed Systems Kenneth J. Goldman WUCS-91-43 July1991, Revised April 1992 previously, A Compositional Model for Layered Distributed Systems" Department of Computer Science Washington University Campus Box 1045 One
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr91/tr91-032.ps.Z, 19920402 Models and Techniques for the Visualization of Labeled Discrete Objects Dinesh P. Mehta yz Sartaj Sahniy
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr92/tr92-007.ps.Z, 19920403 Vlist: A Vectorized List University of Florida CIS TR #92-007 Theodore Johnson Dept. of CIS, University of Florida Gainesville, Fl 32611-2024 ted@cis.ufl.edu April 3, 1992
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr92/tr92-008.ps.Z, 19920403 Space Efficient Parallel Buddy Memory Management University of Florida CIS TR #92-008 Theodore Johnson Tim Davis Dept. of Computer and Information Science, University of Florida ted@cis.ufl.edu, davis@cis.ufl.edu April 3, 1992
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1991/wucs-91-42.ps.Z, 19920406 The Spectrum Simulation System: A Formal Approach to Distributed Algorithm Development Tools Kenneth J. Goldman WUCS-91-42 July1991 Department of Computer Science Washington University Campus Box 1045 One Brookings Drive Saint Louis, MO 63130{4899 The Spectrum Simulation System: A Formal Approach to
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/91.reports/tr30.91.ps, 19920407
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1991/wucs-91-50.ps.Z, 19920410 DNA Mapping Algorithms: Fragment Splitting and Combining James Daues Will Gillett WUCS-91-50 October 1991 DEPARTMENT OF COMPUTER SCIENCE WASHINGTON UNIVERSITY Saint Louis, Missouri 63130 (314) 889-6160 This work was supported by the James S. McDonnell Foundation under Grant 87-24 and NIH under Grant
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1991/wucs-91-34.ps.Z, 19920410 DNA Mapping Algorithms: Clone Sequencing Judith H. Lewis Will Gillett WUCS-91-34 October 1991 DEPARTMENT OF COMPUTER SCIENCE WASHINGTON UNIVERSITY Saint Louis, Missouri 63130 (314) 889-6160 This work was supported by the James S. McDonnell Foundation under Grant 87-24 and NIH under Grant 1 R01 HG00180.
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1991/wucs-91-33.ps.Z, 19920410 DNA Mapping Algorithms:
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1991/wucs-91-23.ps.Z, 19920410 DNA Mapping Algorithms: Topological Mapping Kenneth Moorman Paul Poulosky Will Gillett WUCS-91-23 March 1991 DEPARTMENT OF COMPUTER SCIENCE WASHINGTON UNIVERSITY Saint Louis, Missouri 63130 (314) 889-6160 This work was supported by the James S. McDonnell Foundation under Grant 87-24 and the National
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1991/wucs-91-07.ps.Z, 19920413 WASHINGTON UNIVERSITY IN ST LOUIS Washington School of Engineering & Applied Science Saint Louis, MO 63130-4899One Brookings DriveCampus Box 1045Washington UniversityDepartment of Computer Science Visualization in Concurrent Contexts: A Model Kenneth C. Cox WUCS-91-07 November 1990 Visualization in
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1991/wucs-91-09.ps.Z, 19920413 WASHINGTON UNIVERSITY IN ST LOUIS Washington School of Engineering & Applied Science Saint Louis, MO 63130-4899One Brookings DriveCampus Box 1045Washington UniversityDepartment of Computer Science SwarmView: A Graphical Engine for the Interpretation and Display of Visualizations Kenneth C. Cox
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1991/wucs-91-08.ps.Z, 19920413 WASHINGTON UNIVERSITY IN ST LOUIS Washington School of Engineering & Applied Science Saint Louis, MO 63130-4899One Brookings DriveCampus Box 1045Washington UniversityDepartment of Computer Science SwarmExec: A Prolog-Based Execution Engine for a Shared-Dataspace Language with Visualization Capabilities
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1991/wucs-91-10.ps.Z, 19920414 WASHINGTON UNIVERSITY IN ST LOUIS Washington School of Engineering & Applied Science Saint Louis, MO 63130-4899One Brookings DriveCampus Box 1045Washington UniversityDepartment of Computer Science SwarmView Animation Vocabulary and Interpretation Kenneth C. Cox WUCS-91-10 January 1991 2 SwarmView
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1991/wucs-91-05.ps.Z, 19920415 WASHINGTON UNIVERSITY IN ST LOUIS Washington School of Engineering & Applied Science Saint Louis, MO 63130-4899One Brookings DriveCampus Box 1045Washington UniversityDepartment of Computer Science Printed 4/14/92 On Deriving Distributed Programs from Formal Specifications of Functional Requirements and
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/88.reports/tr03.88.ps, 19920415 ISTAR Evaluation
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1991/wucs-91-26.ps.Z, 19920415 WASHINGTON UNIVERSITY IN ST LOUIS Washington School of Engineering & Applied Science Saint Louis, MO 63130-4899One Brookings DriveCampus Box 1045Washington UniversityDepartment of Computer Science Pavane: A System for Declarative Visualization of Concurrent Computations Gruia-Catalin Roman Kenneth C.
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1991/wucs-91-32.ps.Z, 19920415 WASHINGTON UNIVERSITY IN ST LOUIS Washington School of Engineering & Applied Science Saint Louis, MO 63130-4899One Brookings DriveCampus Box 1045Washington UniversityDepartment of Computer Science Parallel Synchronous Control Gruia-Catalin Roman Jerome Y. Plun WUCS-91-32 May 1991
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/math/papers/fakle.ps.Z, 19920422 10 MLADEN VICTOR WICKERHAUSER 6. CONCLUSIONS Wavelet packet analysis reduces the number of parameters needed to perform approximate Karhunen{Lo eve expansions. For a factor analysis explaining" all but ffl of the ensemble variance in a full-rank, d-dimensional collection of random vectors, the
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/math/papers/wasp.ps.Z, 19920422 Wavelet Analysis and Signal Processing Ronald R. Coifman, Yves Meyer, and Victor Wickerhauser Yale University, New-Haven, Ct 06520, USA Wavelet Analysis consists of a versatile collection of tools for the analysis and manipulation of signals such as sound and images,as well as more general digital data
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/math/papers/inria300.ps.Z, 19920422 LECTURES ON WAVELET PACKET ALGORITHMS 75 References Bradley Alpert, Dissertation, Yale University, 1990. Pascal Auscher, Symmetry properties for Wilson bases and new examples with compact support, preprint, Department of Mathematics, Washington University, (St. Louis, Missouri) 1990. R.
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/math/papers/dsp.ps.Z, 19920422 HIGHESOLUTION STILL PICTURE COMPRESSION 33 M. V. Wickerhauser and Ronald R. Coifman, Entropy based methods for best basis selection, IEEE Transactions on Information Theory (March, 1992). Ingrid Daubechies, Orthonormal bases of compactly supported wavelets, Communications on Pure and
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/math/papers/entbb.ps.Z, 19920422 14 RONALD R. COIFMAN, MLADEN VICTOR WICKERHAUSER For voice signals and images this procedure leads to remarkable compression algorithms; see the references and below. The best basis method may be applied to ensembles of vectors, more like classical Karrhunen-Lo eve analysis. The so-called
	ftp://wuarchive.wustl.edu/doc/techreports/indiana.edu/cs/TR348.ps.Z, 19920423 Characterizing the Paralation Model using Dynamic Assignment Eric T. Freeman1 and Daniel P. Friedman2 1 Yale University, Department of Computer Science, New Haven, Connecticut 06520 2 Indiana University, Computer Science Department, Bloomington, Indiana 47405
	ftp://wuarchive.wustl.edu/doc/techreports/indiana.edu/cs/TR352.ps.Z, 19920502 Efficient Parallel Dynamic Programming Phillip G. Bradford Indiana University Department of Computer Science 215 Lindley Hall Bloomington, IN 47405 bradford@iuvax.cs.indiana.edu April 21, 1992
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr92/tr92-013.ps.Z, 19920508 Synthesizing a Global Net State from Synchronized Local Pieces P. David Stottsy J. Cyrano Ruizz Department of Computer and Department of Reliability Engineering Information Sciences University of Maryland University of Florida College park, MD 20742 Gainesville, FL 32611
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/arl/May92_T1S1.5_contrib.ps.Z, 19920508 COMMITTEE T1 CONTRIBUTION Document No.: T1S1.5/92-165 STANDARDS PROJECT: Broadband Aspects of ISDN TITLE: A B-ISDN Object-Oriented Call Model ISSUES ADDRESSED: B-ISDN Signalling Requirements SOURCE: Southwestern Bell Corporation and Washington University Matthew Nguyen Rick Bubenik Southwestern Bell
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/arl/CMAP_spec_v2.1.1.ps.Z, 19920508 Connection Management Access Protocol (CMAP) Specification John DeHart Mike Gaddis Rick Bubenik Version 2.1.1 May 7, 1992 Applied Research Laboratory Working Note ARL-89-06 Department of Computer Science Technical Report WUCS-92-01 Applied Research Laboratory Department of Computer Science Washington
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1991/wucs-91-49.ps.Z, 19920513 The Kumon Approach to Learning Mathematics: An Educator's Perspective Thomas H. Fuller, Jr. WUCS-91-49 December 1991 Department of Computer Science Washington University Campus Box 1045 One Brookings Drive St. Louis, MO 63130-4899 This work was supported by the Kumon Machine Project.
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr92/tr92-014.ps.Z, 19920526 Performance of an unsymmetric-pattern multifrontal method for sparse LU factorization Timothy A. Davis 301 CSE, Computer and Information Sciences Dept. University of Florida, Gainesville, FL 32611-2024 USA (904) 392-1481, email: davis@cis.ufl.edu Supported in part by NSF ASC-9111263. To appear:
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/92.reports/tr05.92.ps, 19920527
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/91.reports/tr20.91.ps, 19920529
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/88.reports/tr33.88.ps, 19920529 Technical Report CMU/SEI-88-TR-33 ESD-TR-88-034 Real-Time Scheduling Theory and Ada Lui Sha John B. Goodenough November 1988 Technical Report CMU/SEI-88-TR-33 ESD-TR-88-034 November 1988 Real-Time Scheduling Theory and Ada AB Lui Sha John B. Goodenough Real-Time Scheduling in Ada Project Approved for
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/91.reports/tr26.91.ps, 19920529
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/87.reports/tr17.87.ps, 19920529 Technical Report CMU/SEI-87-TR-17 ESD-TR-87-118 The Use of Representation Clauses and Implementation-Dependent Features in Ada: IIIA. Qualitative Results for VAX Ada Version 1.3 B. Craig Meyers Andrea L. Cappellini July 1987 Technical Report CMU/SEI-87-TR-17 ESD/TR-87-118 July 1987 The Use of
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/87.reports/tr19.87.ps, 19920529 Technical Report CMU/SEI-87-TR-19 ESD-TR-87-170 The Use of Representation Clauses and Implementation-Dependent Features in Ada: IVA. Qualitative Results for Ada/M(44) Version 1.6 B. Craig Meyers Andrea L. Cappellini July 1987 Technical Report CMU/SEI-87-TR-19 ESD/TR-87-170 July 1987 The Use of
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/91.reports/tr09.91.ps, 19920601 Technical Report CMU/SEI-91-TR-9 ESD-TR-91-9 Software Engineering Education Directory Software Engineering Curriculum Project May 1991 Technical Report CMU/SEI-91-TR-9 ESD-TR-91-9 May 1991 Software Engineering Education Directory AB Software Engineering Curriculum Project Education Program Approved for
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/91.reports/tr06.91.ps, 19920601 Technical Report CMU/SEI-91-TR-6 ESD-91-TR-6 Rate Monotonic Analysis for Real-Time Systems Lui Sha Mark H. Klein John B. Goodenough March 1991 Technical Report CMU/SEI-91-TR-6 ESD-91-TR-6 March 1991 Rate Monotonic Analysis for Real-Time Systems AB Lui Sha Mark H. Klein John B. Goodenough Rate Monotonic
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/91.reports/tr04.91.ps, 19920601 Technical Report CMU/SEI-91-TR-4 ESD-9-TR-4 Rationale for SQL Ada Module Description Language SAMeDL Gary J. Chastek Marc H. Graham Gregory Zelesnik March 1991 Technical Report CMU/SEI-91-TR-4 ESD-91-TR-4 March 1991 Rationale for SQL Ada Module Description Language SAMeDL AB Gary J. Chastek Marc H.
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/90.reports/tr11.90.ps, 19920601 Technical Report CMU/SEI-90-TR-11 ESD-90-TR-212 Spectrum of Functionality in Configuration Management Systems Susan Dart December 1990 Technical Report CMU/SEI-90-TR-11 ESD-90-TR-212 December 1990 Spectrum of Functionality in Configuration Management Systems AB Susan Dart Software Environments Project
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/90.reports/tr24.90.ps, 19920601 Technical Report CMU/SEI-90-TR-24 ESD-90-TR-225 Software Engineering Process Group Guide Priscilla Fowler Stan Rifkin September 1990 Technical Report CMU/SEI-90-TR-24 ESD-90-TR-225 September 1990 Software Engineering Process Group Guide AB Priscilla Fowler Technology Applications Project Stan Rifkin
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/89.reports/tr26.89.ps, 19920601 Technical Report CMU/SEI-89-TR-26 ESD-TR-89-34 CASE Planning and the Software Process Watts S. Humphrey May 1989 Technical Report CMU/SEI-89-TR-26 ESD-TR-89-34 May 1989 CASE Planning and the Software Process AB Watts S. Humphrey Software Process Program Approved for public release. JPO approval
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/88.reports/tr04.88.ps, 19920601 Technical Report CMU/SEI-88-TR-4 ESD-TR-88-005 Evaluation and Recommendations for Technology Insertion into Technical Order Maintenance Greg Hansen James Over May 1988 Technical Report CMU/SEI-88-TR-4 ESD-TR-88-005 May 1988 Evaluation and Recommendations for Technology Insertion into Technical Order
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/89.reports/tr22.89.ps, 19920601 Technical Report CMU/SEI-89-TR-22 ESD-TR-89-30 Real-Time Software Engineering in Ada: Observations and Guidelines Mark W. Borger Mark H. Klein Robert A. Veltre September 1989 Technical Report CMU/SEI-89-TR-22 ESD-TR-89-30 September 1989 Real-Time Software Engineering in Ada: Observations and Guidelines
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/89.reports/tr24.89.ps, 19920601 Technical Report CMU/SEI-89-TR-24 ESD-89-TR-32 Temporal Logic Case Study William G. Wood August 1989 Technical Report CMU/SEI-89-TR-24 ESD-89-TR-32 August 1989 Temporal Logic Case Study AB William G. Wood Software Methods Program Approved for public release. JPO approval signature on file. Software
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/89.reports/files.without.figures/tr18.89.ps, 19920601 Technical Report CMU/SEI-89-TR-18 ESD-89-TR-26 A Real-Time Locking Protocol Lui Sha Ragunathan Rajkumar Sang Son Chun-Hyon Chang April 1989 Technical Report CMU/SEI-89-TR-18 ESD-89-TR-26 April 1989 A Real-Time Locking Protocol AB Lui Sha Real-Time Scheduling in Ada Project Ragunathan Rajkumar Carnegie
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/88.reports/tr23.88.ps, 19920601 Technical Report CMU/SEI-88-TR-23 ESD-TR-88-024 Functional Performance Specification for an Inertial Navigation System B. Craig Meyers October 1988 Technical Report CMU/SEI-88-TR-23 ESD-TR-88-024 October 1988 Functional Performance Specification for an Inertial Navigation System AB B. Craig Meyers Naval
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr92/tr92-010.ps.Z, 19920608 Finding A Minimum Cost Acceptable Path in Parallel1 Theodore Johnson Panos E. Livadas ted@squall.cis.ufl.edu pel@cis.ufl.edu University of Florida, Dept. of CIS Gainesville, FL 32611-2024 Abstract We consider the problem of finding a minimum cost acceptable path on a toroidal grid graph, where each
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr92/tr92-018.ps.Z, 19920609 The Design and Implementation of the Ariel Active Database Rule Systemy Eric N. Hanson Department of Computer and Information Sciences University of Florida Gainesville, FL 32611 hanson@cis.ufl.edu UF-CIS-018-92 September 1991
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr92/tr92-019.ps.Z, 19920610 An efficient approximation algorithm for load balancing with resource migration in distributed systems Ravi Varadarajan Computer and Information Sciences Department University of Florida, Gainesville, FL 32611 An efficient approximation algorithm for load balancing with resource migration in distributed
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr92/tr92-020.ps.Z, 19920610 An Efficient Approximation Algorithm for the File Redistribution Scheduling Problem in Fully Connected Networks Ravi Varadarajan Pedro I. Rivera-Vegay
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr91/tr91-001.ps.Z, 19920612 A Multimodel Methodology for Qualitative Model Engineering Paul A. Fishwick University of Florida and Bernard P. Zeigler University of Arizona
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr92/tr92-016.ps.Z, 19920616 The Interval Skip List: A Data Structure for Finding All Intervals That Overlap a Point y Eric N. Hanson Theodore Johnson Computer and Information Sciences Department University of Florida Gainesville, FL 32611 UF-CIS-92-016 16 June 1992
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr91/tr91-003.ps.Z, 19920701 Including Postscript Images in your LaTEX Document Paul A. Fishwick University of Florida email: fishwick@cis.ufl.edu July 1, 1992
	ftp://wuarchive.wustl.edu/doc/techreports/arizona.edu/cs/1992/TR92-05.ps, 19920707 Approximate Matching of Network Expressions with Spacers* Eugene W. Myers TR 92-5
	ftp://wuarchive.wustl.edu/doc/techreports/arizona.edu/cs/1992/TR92-03.ps, 19920707 INTERACTIVE GRAPH LAYOUT: THE EXPLORATION OF LARGE GRAPHS (Ph.D. Dissertation) Tyson Rombauer Henry TR 92-03 June 30, 1992 Department of Computer Science The University of Arizona Tucson, Arizona 85721 This work was supported in part by the National Science Foundation under grants IRI{8702784, CDA{
	ftp://wuarchive.wustl.edu/doc/techreports/arizona.edu/cs/1992/TR92-08.ps, 19920707 Anchors in Tournaments TR 92-08
	ftp://wuarchive.wustl.edu/doc/techreports/arizona.edu/cs/1992/TR92-11.ps, 19920707 High-Performance Cross-Domain Data Transfer Peter Druschel and Larry L. Peterson1 TR 92-11
	ftp://wuarchive.wustl.edu/doc/techreports/arizona.edu/cs/1992/TR92-07.ps, 19920707 Multiple Calendar Support for Conventional Database Management Systems Michael D. Soo1 Richard T. Snodgrass2 TR 92-07 February 28, 1992
	ftp://wuarchive.wustl.edu/doc/techreports/arizona.edu/cs/1992/TR92-02.ps, 19920707 A Language-Based Approach to Protocol Implementation Mark B. Abbott and Larry L. Peterson1 TR 92-2
	ftp://wuarchive.wustl.edu/doc/techreports/arizona.edu/cs/1992/TR92-12.ps, 19920707 Approximate Regular Expression Pattern Matching with Concave Gap Penalties James R. Knight1 Eugene W. Myers1 TR 92-12 Revised June 15, 1992
	ftp://wuarchive.wustl.edu/doc/techreports/arizona.edu/cs/1992/TR92-14.ps, 19920707 Estimating the Number of Solutions for Constraint Satisfaction Problems Nai-Wei Lin Department of Computer Science The University of Arizona Tucson, AZ 85721 naiwei@cs.arizona.edu March 1992
	ftp://wuarchive.wustl.edu/doc/techreports/indiana.edu/cs/TR358.ps.Z, 19920714 Four-Dimensional Views of 3D Scalar Fields Andrew J. Hanson Pheng A. Heng CN/AS Division Department of Computer Science CERN Indiana University CH-1211, Geneva 23, Switzerland Bloomington, IN 47405 and Department of Computer Science Indiana University Bloomington, IN 47405
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1992/wucs-92-25.ps.Z, 19920716 Can PAC Learning Algorithms Tolerate Random Attribute Noise Sally A. Goldman Department of Computer Science Washington University St. Louis, Missouri 63130 Robert H. Sloany Dept. of Electrical Engineering and Computer Science University of Illinois at Chicago Chicago, IL 60680 WUCS-92-25z July 10, 1992
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr92/tr92-017.ps.Z, 19920717 Analysis of potential parallel implementations of the unsymmetric-pattern multifrontal method for sparse LU factorization Steven M. Hadfield and Timothy A. Davis 301 CSE, Computer and Information Sciences Dept. University of Florida, Gainesville, FL 32611-2024 USA (904) 392-1481, email: smh@cis.ufl.edu
	ftp://wuarchive.wustl.edu/doc/techreports/arizona.edu/cs/1991/TR91-15.ps, 19920721 Contents 1 Introduction 1 2 Historical Relations 2 3 Historical Operators 4 3.1 Historical Analogues of the Snapshot Operators : : : : : : : : : : : : : : : : : : : : : 4 3.2 Historical Derivation : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 7 3.3 Conversion Operators : : : :
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1992/wucs-92-26.ps.Z, 19920722 Learning k-term DNF Formulas with an Incomplete Membership Oracle Sally A. Goldman Department of Computer Science Washington University St. Louis, MO 63130 sg@cs.wustl.edu H. David Mathias Department of Computer Science Washington University St. Louis, MO 63130 dmath@cs.wustl.edu WUCS-92-26 July 21,
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr92/tr92-015.ps.Z, 19920728 1 AN OBJECT-ORIENTED RULE-BASED APPROACH TO DATA MODEL AND SCHEMA TRANSLATION* S. Y. W. Su S. C. Fang H. Lam Database Systems Research and Development Center, CSE#470 Department of Computer and Information Sciences Department of Electrical Engineering University of Florida, Ganiesville, FL 32611 Email:
	ftp://wuarchive.wustl.edu/doc/techreports/indiana.edu/cs/TR354.ps.Z, 19920805 An Implementation of an Applicative File System Technical Report 354 Brian C. Heck and David S. Wise Computer Science Department Indiana University Bloomington, IN 47405{4101 USA Fax: +1 (812) 855-4829 Email: heckb@cs.indiana.edu
	ftp://wuarchive.wustl.edu/doc/techreports/indiana.edu/cs/TR347.ps.Z, 19920806 An Algebra for List-Oriented Applications Latha S. Colby Department of Computer Science Indiana University Bloomington, IN, 47405 colby@cs.indiana.edu February 23, 1992
	ftp://wuarchive.wustl.edu/doc/techreports/purdue.edu/cs/92-049.PS.Z, 19920807 Observing Reusable Password Choices Purdue Technical Report CSD TR 92 049 Eugene H. Spafford Department of Computer Sciences Purdue University West Lafayette, IN 47907 1398 spaf@cs.purdue.edu 31 July 1992
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr92/tr92-022.ps.Z, 19920807 SIMPACK: GETTING STARTED WITH SIMULATION PROGRAMMING IN C AND C++ Paul A. Fishwick Dept. of Computer & Information Science University of Florida Bldg. CSE, Room 301 Gainesville, FL 32611
	ftp://wuarchive.wustl.edu/doc/techreports/purdue.edu/cs/91-028.PS.Z, 19920807 OPUS: Preventing Weak Password Choices Purdue Technical Report CSD TR 92 028 Eugene H. Spafford Department of Computer Sciences Purdue University West Lafayette, IN 47907 1398 spaf@cs.purdue.edu June 1991
	ftp://wuarchive.wustl.edu/doc/techreports/arizona.edu/cs/1992/TR92-10.ps, 19920809 Bounds and Approximations for Overheads in the Time to Join Parallel Forks Peter J. Downey TR 92-10
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr92/tr92-023.ps.Z, 19920812 Flipping Modules To Improve Circuit Performance And Routability Keumog Ahn Sartaj Sahni* and University of Minnesota University of Florida University of Florida TR 92-23
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr92/tr92-024.ps.Z, 19920812 NP-hard Module Rotation Problems Keumog Ahn Sartaj Sahni* and University of Minnesota University of Florida University of Florida TR 92-24 Abstract Preplaced circuit modules may be rotated to improve performance and/or routability. We show that several simple versions of the module rotation problem are
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr92/tr92-025.ps.Z, 19920817 A Formal Approach to the Vertical Partitioning Problem in Distributed Database Design J. Muthuraj1 S. Chakravarthy2 R. Varadarajan Computer and Information Sciences Department University of Florida, Gainesville, FL 32611, USA Email: sharma@snapper.cis.ufl.edu S. B. Navathe1 College of Computing Georgia
	ftp://wuarchive.wustl.edu/doc/techreports/arizona.edu/cs/1992/TR92-22cover.ps, 19920823 An Overview of the Temporal Query Language TQuel Richard T. Snodgrass TR 92-22 August 20, 1992
	ftp://wuarchive.wustl.edu/doc/techreports/arizona.edu/cs/1992/TR92-22.ps, 19920823 An Overview of TQuel Richard Snodgrass Chapter 6 An Overview of TQuel Richard Snodgrass 6.1 Introduction In this chapter we discuss the temporal query language TQuel. TQuel is a minimal extension to Quel , the query language for Ingres . TQuel supports valid
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr92/tr92-027.ps.Z, 19920910 Analysis of Optimistic Concurrency Control Revisited Theodore Johnson September 3, 1992
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr90/shrink.ps.Z, 19920916 Reconfigurable Mesh Algorithms For Image Shrinking, Expanding, Clustering, And Template Matching* Jing-Fu Jenq and Sartaj Sahni University of Minnesota University of Florida
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr90/tr90-032.ps.Z, 19920916 Serial And Parallel Algorithms For The Medial Axis Transform* Jing-Fu Jenq Sartaj Sahni and University of Minnesota University of Florida
	ftp://wuarchive.wustl.edu/doc/techreports/purdue.edu/cs/92-062.PS.Z, 19920918 A Generic Virus Scanner in C++ Technical Report CSD TR 92 062 Sandeep Kumar Eugene H. Spafford The COAST Project Department of Computer Sciences Purdue University West Lafayette, IN 47907 1398 fkumar,spafg@cs.purdue.edu 17 September 1992
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1992/wucs-92-31.ps.Z, 19920922 Separating Structure from Function in the Specification and Design of Distributed Systems Kenneth J. Goldman WUCS-92-31 September 1992 Department of Computer Science Washington University Campus Box 1045 One Brookings Drive Saint Louis, MO 63130{4899 Separating Structure from Function in the
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1992/wucs-92-33.ps.Z, 19920923 On the Sample Complexity of Weakly Learning Sally A. Goldman Department of Computer Science Washington University St. Louis, MO 63130 sg@cs.wustl.edu Michael J. Kearns AT&T Bell Laboratories Murray Hill, NJ 07974 mkearns@research.att.com Robert E. Schapire AT&T Bell Laboratories Murray Hill, NJ 07974
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr92/tr92-029.ps.Z, 19920924 Approximate Analysis of Reader/Writer Queues Theodore Johnson Dept. of CIS University of Florida Gainesville, Fl 32611-2024 September 3, 1992
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr92/tr92-030.ps.Z, 19920924 Supporting Insertions and Deletions in Striped Parallel Filesystems Theodore Johnson University of Florida, Dept. of CIS Gainesville, Fl 32611-2024 September 23, 1992
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr92/tr92-028.ps.Z, 19920924 On the Natural Growth of Random Forests Theodore Johnson, University of Florida Harold S. Stone, IBM T. J. Watson Center July 29, 1992
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1992/wucs-92-30.part4.ps.Z, 19920925 A MODEL FOR DETECTING MOTIFS IN BIOLOGICAL SEQUENCES 1. INTRODUCTION This report proposes a new method for detecting patterns in groups of biological sequences. This method offers several significant improvements over other sequence analysis methods: it does not require an alignment, it has a
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1992/wucs-92-30.part2.ps.Z, 19920925 i TABLE OF CONTENTS LIST OF FIGURES......................................................................................................... iv LIST OF TABLES .......................................................................................................... v 1.
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1992/wucs-92-30.part6.ps.Z, 19920925 73 5. CONCLUSION AND FUTURE WORK 5.1. ADVANTAGES AND DISADVANTAGES OF THE ASSET METHOD The method here described offers several significant improvements over other sequence analysis methods. It has a rigorous statistical basis for determining which patterns are significant and offers a quantitative
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1992/wucs-92-06.ps.Z, 19920925 WASHINGTON UNIVERSITY IN ST LOUIS Washington School of Engineering & Applied Science Saint Louis, MO 63130-4899One Brookings DriveCampus Box 1045Washington UniversityDepartment of Computer Science Program Visualization: The Art of Mapping Programs to Pictures Gruia-Catalin Roman Kenneth C. Cox
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1992/wucs-92-14.ps.Z, 19920925 WASHINGTON UNIVERSITY IN ST LOUIS Washington School of Engineering & Applied Science Saint Louis, MO 63130-4899One Brookings DriveCampus Box 1045Washington UniversityDepartment of Computer Science Abstraction in Algorithm Animation Kenneth C. Cox Gruia-Catalin Roman WUCS-92-14 March 1992 Abstraction in
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1992/wucs-92-30.part8.ps.Z, 19920925 78 6. APPENDIX 6.1. DEFINITIONS OF TERMS Table 6.1. Definitions and descriptions of terms used in the text. Symbol Description Definition N The set of all natural numbers {0,1,2,3,4,...} P The set of all positive integers {1,2,3,4,...} I The set of all intergers {...,-3,-2,-1,0,+1,+2,+3,...} R The set
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1992/wucs-92-30.part7.ps.Z, 19920925 89 7. BIBLIOGRAPHY 1. G.N Reeke, Jr, "Protein folding: computational approaches to an exponential-time problem," Annual Review of Computer Science, vol. 3, pp. 59-84, 1988. 2. G.E. Schulz, "A critical evaluation of methods for predictiion of protein secondary structures," Annual Review of Biophysics and
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1992/wucs-92-30.part1.ps.Z, 19920925 A Model for Detecting Motifs in Biological Sequences Andrew F. Neuwald, Philip P. Green WUCS-92-30 August 1992 Department of Computer Science Campus Box 1045 Washington University One Brookings Drive Saint Louis , Missouri 63130 (314) 935-6160
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1992/wucs-92-30.part3.ps.Z, 19920925 8 2. SEQUENCE ANALYSIS METHODS Many sequence analysis methods involve sequence alignments while a number of more recent methods do not. This chapter reviews both types with an emphasis on those methods that can be used to detect patterns in distantly related sequences. 2.1. METHODS BASED ON ALIGNMENTS
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1992/wucs-92-30.part5.ps.Z, 19920925 51 4. VERIFICATION OF THE METHOD 4.1. IMPLEMENTATION - THE ASSET PROGRAM The model described in the previous chapter was implemented in the C programming language on a Sun4/260 under the UNIX operating system (62). The command language grammar was implemented using Lex (63) and Yacc (64); key operations
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1992/wucs-92-30.part9.ps.Z, 19920925 18 3. A MODEL FOR DETECTING MOTIFS IN BIOLOGICAL SEQUENCES From the previous chapter it seems clear that the ideal sequence analysis method has not yet been found. Such a method would be based on rigorous statistics, efficiently detect significant patterns of variable length among large numbers
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1992/wucs-92-14.part1.ps.Z, 19920928 WASHINGTON UNIVERSITY IN ST LOUIS Washington School of Engineering & Applied Science Saint Louis, MO 63130-4899One Brookings DriveCampus Box 1045Washington UniversityDepartment of Computer Science Abstraction in Algorithm Animation Kenneth C. Cox Gruia-Catalin Roman WUCS-92-14 March 1992 This paper
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1992/wucs-92-14.part2.ps.Z, 19920928 24 Figure 5(a). Direct abstraction in which distances aremapped to boxes arranged in the X-Y plane. The color ofeach square is a function of the distance between the twonodes, with shorter distances mapped to darker shades.Figure 5(b). Oblique view of the boxes depicted inFigure 5(a). The height of each
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/92.reports/tr12.92.ps, 19921005
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr92/tr92-031.ps.Z, 19921007 An Overview of Production Rules in Database Systems Eric N. Hanson Dept. of Computer and Information Sciences University of Florida Gainesville, FL 32611 USA hanson@cis.ufl.edu Jennifer Widom IBM Almaden Research Center 650 Harry Road San Jose, CA 95120 USA widom@almaden.ibm.com University of Florida
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1992/92-19.dir/92-19-24.ps.gz, 19921007 Evaluation and Parallelization of Functions in Functional + Logic Languages
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1992/92-19.dir/92-19-13.ps.Z, 19921007 Cache Behaviour of Lazy Functional Programs (working paper) Koen Langendoen Dirk-Jan Agterkamp University of Amsterdam, Kruislaan 403, 1098 SJ Amsterdam, The Netherlands e-mail: koen@fwi.uva.nl
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1992/92-19.dir/92-19-16.ps.gz, 19921007 1. An Attribute Grammar Evaluator in Haskell David Rushall Department of Computer Science, Victoria University of Manchester, Oxford Road, Manchester, UK. M13 9PL. drushall@uk.ac.man.cs September 1992
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1992/92-19.dir/92-19-03.ps.gz, 19921007 Lisa\| a Lazy Interpreter for a Full-Fledged >=-Calculus C. Rathsack and S.B. Scholz Dept. of Computer Science University of Kiel Germany email: fcar,sbsg@informatik.uni-kiel.dbp.de September 18, 1992
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1992/92-19.dir/92-19-06.ps.Z, 19921007 Equational Constraints, Residuation, and the Parallel JUMP-machine Manuel M.T. Chakravarty Martin K ohler September 23, 1992
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1992/92-19.dir/92-19-07.ps.Z, 19921007 Polymorphic Strictness Analysis using Frontiers Draft version: comments welcomed Julian Seward University of Manchester sewardj@uk.ac.man.cs September 23, 1992
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1992/92-19.dir/92-19-04.ps.gz, 19921007 1 3 1 Author's full address: Department of Computing and Electrical Engineering, Heriot-Watt University, Riccarton, Edinburgh EH14 4AS, United Kingdom. Email: tore@cs.hw.ac.uk Programs written in explicitly parallel languages are often composed of pieces of task specific code structured and interwoven
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1992/92-19.dir/92-19-12.ps.gz, 19921007 Simulation of Multicache Parallel Graph Reduction Andrew J Bennett Paul H J Kelly Department of Computing, Imperial College of Science, Technology and Medicine, London SW7 2BZ email: ajb@doc.ic.ac.uk
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1992/92-19.dir/92-19-22.ps.Z, 19921007 Cps-Translation and the Correctness of Optimising Compilers Geoffrey Burn and Daniel Le M etayery Department of Computing Imperial College of Science, Technology and Medicine 180 Queen's Gate, London SW7 2BZ, United Kingdom. fglb,dlmg@doc.ic.ac.uk Submitted for publication. In the meantime, please refer
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1992/92-19.dir/92-19-05.ps.Z, 19921007 Polymorphic Type Checking by Interpretation of Code Stefan Kahrs University of Edinburgh Laboratory for Foundations of Computer Science King's Buildings, EH9 3JZ email: smk@dcs.ed.ac.uk
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1992/92-19.dir/92-19-08.ps.gz, 19921007 ss{Red+ A Compiling Graph{Reduction System for a Full{Fledged >={Calculus D. G artner, A. Kimms and W. Kluge Christian{Albrechts{Universit at Kiel Institut f ur Informatik Preusserstrasse 1{9 D{2300 Kiel 1 Email: fdg,ak,wkg@informatik.uni{kiel.dbp.de
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1992/92-19.dir/92-19-14.ps.gz, 19921007 Profiling scheduling strategies on the GRIP parallel reducer Kevin Hammond and Simon Peyton Jones August 23, 1991
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1992/92-19.dir/92-19-15b.ps.Z, 19921007 Figure 2: Parallelism detected by hyperstrictness and WHNF strictness (4 processors, 2 active tasks/processor) Tasks created in the hyperstrict model can be larger in size than tasks in the WHNF model, as Figure 3 shows. Note that in the task size histograms, a task which becomes blocked n times is
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1992/92-19.dir/92-19-11.ps.gz, 19921007 AParallel Graph Reduction Machine MikeJoy Department of Computer Science, University of Warwick, COVENTRY, CV4 7AL, UK. TomAxford Department of Computer Science, University of Birmingham, BIRMINGHAM, B15 2TT, UK. 10 September 1992
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1992/92-19.dir/92-19-17.ps.gz, 19921007 Statistics on storage management in a lazy functional language implementation John Wild Hugh Glaser Pieter Hartel Department of Electronics and Computer Science The University, Southampton, SO9 5NH, UK e-mail: jmw@ecs.soton.ac.uk September 24, 1992
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1992/92-19.dir/92-19-18.ps.Z, 19921007 Parallel Implementations of Functional Languages Wellington Santos Martins * Universidade Federal de Goi s, Goi nia, BRAZIL and University of East Anglia, Norwich, UK
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1992/92-19.dir/92-19-19.ps.gz, 19921007 Manchester Functional Programming Group Document MFPG-Report-0001 Author(s) David Lester Title Distributed Garbage Collec- tion of Cyclic Structures Status Draft Revision 1.1 Last Revised 92/09/16 11:24:38 Report-0001 Draft: 1.1, 92/09/16, 11:24:38. 1 Distributed Garbage Collection of Cyclic Structures
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1992/92-19.dir/92-19-15a.ps.Z, 19921007 Using Strictness Information in the STG{machine Sava Mintchev mintches@uk.ac.man.cs September 22, 1992
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1992/92-19.dir/92-19-20.ps.Z, 19921007 Parallelization of Branch-and-Bound Algorithms in a Functional Programming Environment J.C. Glas R.F.H. Hofman W.G. Vree Department of Computer Systems, University of Amsterdam Kruislaan 403, 1098 SJ Amsterdam, The Netherlands
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1992/92-19.dir/92-19-25.ps.gz, 19921008 COMMUNICATION ISSUES REGARDING PARALLEL FUNCTIONAL GRAPH REWRITING Marco Kesseler Faculty of Mathematics and Computer Science, University of Nijmegen, Toernooiveld 1, 6525 ED Nijmegen, The Netherlands E-mail: marcok@cs.kun.nl September 1992
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1992/92-19.dir/92-19-26.ps.gz, 19921008 Characterizing and representing neededness in functional logic languages Thomas Peikenkamp October 8, 1992 In functional languages arguments needed for the evaluation are detected by a strictness analysis. Results of this analysis are represented by annotating source programs with evaluation
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1989/89-18.ps.gz, 19921009 REFERENCES 27 applicative languages. Nevertheless, we present the syntax of some ML-constructs in order to help readers who are not familiar with this particular language. As we mentioned in the very beginning of this paper, we use Cardelli's version of ML , . It differs slightly from Standard ML
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1991/91-22.ps.gz, 19921009 A. Trew, G. Wilson: Past, Present, Parallel, Springer, 1991, 126-137 A Syntax of TDL TDLscript ::= Defs Subnet Defs ::= ConstDefs FctDefs ConstDefs ::= " j const ConstDef ; FctDefs ::= function FctId ( FormPars ) f Netg FctDefs j function FctId ( ) f Net g FctDefs j " ConstDef ::= ConstId = Exp,
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1991/91-24.ps.gz, 19921009 The Concurrency Workbench: A Semantics Based Tool for the Verification of Concurrent Systems Rance Cleaveland y Joachim Parrow z Bernhard Steffen x February 28, 1992 Aachener Informatikberichte Nr. 91 { 24
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1991/91-15.ps.gz, 19921009 ss&o#o$oOae ss($ssO#o O# $ fl %AE>= $ oOE!" &ss "ss%#>= oAEo$) 9/%#, 8/01#/ O," #/1 OE9,"-/$ flfflffi <= ss fi <=oeoAEOE<= !oe ffss aeoe AE>= ffffff <=aeoessoAEoe <= ss oe ssO ffffi ffl fffflffi !&'#3',% /#20O ''16 '0 O !#,1/O %-O* ', ./-%/O++',% oe',!# !-"# !O, 0#*"-+ # /#20#" O0 '0 '1 '0
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1992/92-19.dir/92-19-00.ps.gz, 19921009 4th International Workshop on the Parallel Implementation of Functional Languages Aachen, September 1992 Proceedings Herbert Kuchen / Rita Loogen (Editors) 1 Preface The 4th International Workshop on the Parallel Implementation of Functional Languages was held at Aachen, Germany, from the 28th to the
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1991/91-27.ps.gz, 19921009 90-17 M. M oller: Ein Ebenenmodell wissensbasierter Konsultationen - Unterst utzung f ur Wissensakquisition und Erkl arungsf ahigkeit 90-18 E. Kowalewski: Entwurf und Interpretation einer Sprache zur Beschreibung von Konsultationsphasen in Expertensystemen 90-19 F. Strauss: Erkl arungsf ahigkeit eines
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1991/91-28.ps.gz, 19921009 91-14 A. Fasbender / W. Kremer: A New Approximation Algorithm for Tandem Networks with Priority Nodes. 91-15 J. B orstler / A. Z undorf: Revisiting extensions to Modula-2 to improve reusability. 91-16 J. B orstler / T. Janning: Bridging the gap between Requirements Analysis and Design 91-17 A. Z undorf
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1990/90-05.ps.Z, 19921009 G. Burn: A Shared Memory Parallel G-Machine Based on the Evaluation Transformer Model of Computation, Workshop Impl. of Lazy Functional Languages, Progr. Methodology Group, Report 53, G oteborg, 1988, 301-330 P. Hudak, B. Goldberg: Experiments in Diffused Combinator Reduction, Proc. of the
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1991/91-05.ps.Z, 19921009 the other basic operations on DAAs are defined as follows: map f S = gen g where g i = f (sel S i) zip g L R = gen h where h i = g (sel L i) (sel R i) matrix multiplication on DAAs (A = sel A ((i 1) n + j)): matmult A B n = gen f (n*n) where f k = sum ((k-1) div n + 1) ((k-1) mod n + 1) 1 n sum i
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1992/92-19.dir/92-19-01.ps.gz, 19921009 PASTEL A Parallel Stack-based Implementation of Eager Functional Programs with Lazy Data Structures Guido Hogen and Rita Loogen RWTH Aachen, Lehrstuhl f ur Informatik II Ahornstrasse 55, W-5100 Aachen, Germany Extended Abstract 1 Introduction In purely sequential implementations of functional
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1991/91-17.ps.gz, 19921009 page 21 of 21 production LoadFerry (* Take some cargo on board of the empty ferry.) end; production UnloadFerry ( Put the ferry s cargo ashore.) end; production FerryOver ( The ferry and its load are crossing the river. ) end; production ReducePopulation ( That should not happen! Probably the
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1991/91-20.ps.Z, 19921009 C.Clack, S.Peyton-Jones: Strictness Analysis \| A Practical Approach, Conf. on Functional Progr. Languages and Computer Architecture, LNCS 201, Springer Verlag 1985. M.C.J.D.van Eekelen, M.J.Plasmeijer, J.E.W.Smeetsers: Parallel Graph Rewriting on Loosely
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1991/91-01.ps.gz, 19921009 141 139 140 30. 10. 90 Dr. Sabine Th urmel, Siemens AG, M unchen Paralleles Lisp f ur eine verteilte Maschine: ein Forschungsbericht 15. 11. 90 Prof. Dr. Tenenbaum, TU Moskau, USSR Ideas of Relational Database Theory and Solving some Problems in other Classes of Systems 27. 11. 90 Frau Tiziana Magaria,
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1991/91-11.ps.gz, 19921009 REFERENCES 17 M.Hanus: Compiling Logic Programs with Equality, Workshop on Programming Language Implementation and Logic Programming (PLILP) 1990, LNCS 456, Springer Verlag 1990. M.Hanus: Efficient Implementation of Narrowing and Rewriting, Draft Paper, University of Dortmund 1991.
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1990/90-16.ps.Z, 19921009 174 59'1.7-) .3 -6., oe64;70. !4>3'6, )7 OE AE OE aeae OEO oe ffi OE AEAEss ooe o oaeAE! OE fl oe ffi8- ae38 %4607-45 <=623 ss62&3= AE&6(- ff 64( oOE>=" fflflfi <=61.3 "56.3,6 $*61&, ssOEoe#oe& ffi#o$&" (O oe&OssOE( ffi <= fi<=ff>=>= fl #AE) AEoe 'oeae $# fi& %OE fi& "" &' 3)= "(- 66 fi OEO !
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1991/91-03.ps.Z, 19921009 E. Clarke, O. Grumberg and M.C. Browne. Reasoning About Networks With Many Identical Finitetate Processes, Carnegie Mellon University, Pittsburg, October 1986. R. Cleaveland, J. G. Parrow and B. Steffen. The Concurrency Workbench: Operating Instructions, University of Edinburgh,
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1991/91-19.ps.gz, 19921009 From Relational to Object-Oriented Integrity Simplification Manfred Jeusfeldy, Matthias Jarkez y Universit at Passau, Innstrasse 33, 8390 Passau, Germany jeusfeld@andorfer.fmi.uni-passau.de z RWTH Aachen, Ahornstrasse 55, 5100 Aachen, Germany jarke@picasso.informatik.rwth-aachen.de Abstract1 Relational
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1992/92-01.ps.gz, 19921009 Jahresbericht 1991 der Fachgruppe Informatik in der Mathematisch-Naturwissenschaftlichen Fakult at der RWTH Aachen Herausgeber: Fachgruppe Informatik RWTH Aachen Ahornstr. 55 W-5100 Aachen Redaktion: S. Eherer Druck: Fotodruck J. Mainz GmbH Neupforte 13, 5100 Aachen Inhalt Vorwort : : : : : : : : : : :
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1991/91-30.ps.Z, 19921009 91-14 A. Fasbender / W. Kremer: A New Approximation Algorithm for Tandem Networks with Priority Nodes. 91-15 J. B orstler / A. Z undorf: Revisiting extensions to Modula-2 to improve reusability. 91-16 J. B orstler / T. Janning: Bridging the gap between Requirements Analysis and Design 91-17 A. Z undorf
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1991/91-23.ps.gz, 19921009 Compositional Minimization of Finite State Systems Susanne Graf y Bernhard Steffen z Aachener Informatikberichte Nr. 91 { 23
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1990/90-20.ps.gz, 19921009 A Complete Proof System for Timed Observations Yolanda Ortega-Mall en David de Frutos-Escrig Secci on Departamental de Inform atica y Autom atica Facultad de Matem aticas Universidad Complutense de Madrid, Spain August 1990
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1992/92-19.dir/92-19-02.ps.Z, 19921009 A.2 Modified Fold Algorithm typedef struct int partner, son, node; node = pid; son = pid; while (node > 0) son = node; node = (--son) / 2;
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1991/91-26.ps.gz, 19921009 Query Optimization in Deductive Object Bases Manfred Jeusfeldy, Martin Staudtz y Universit at Passau, 8390 Passau, Germany, jeusfeld@uni-passau.de z RWTH Aachen, 5100 Aachen, Germany, staudt@informatik.rwth-aachen.de Abstract1. Deductive object bases are extended database systems which amalgamate
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1989/89-20.ps.gz, 19921009 C.1 Translation Function 39 JMP end lb lb N: exptrans (N) end lb: . . . exptrans (M op N) := exptrans (M) exptrans (N) OP fail lb JMP end lb fail lb: FORCE end lb: . . . op 2 f +, {, , div, mod, <= g and the corresponding OP 2 f ADD, SUB, MUL, DIV, MOD, LEQ g exptrans (: B) := exptrans (B) NOT exptrans
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1990/90-11.ps.Z, 19921009 D.5 Semantics of Jump Instructions 37 else if bval = false then (atp, G ) SI ] (atp, G ) := if G (dereference(adr)) =
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1990/90-22.ps.gz, 19921009 44 REFERENCES W.C. Rounds; Mappings and grammars on trees; Math. Syst. Theory 4(1970), 257-287. J.W. Thatcher; Tree automata: an informal survey; in: "Currents in the Theory of Computing", (A.V. Aho, Ed.), Prentice Hall, Englewood Cliffs (1973), 143-172. H. Vogler; Funktionale
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1991/91-10.ps.Z, 19921009 Compiler-based Implementation of Syntax-Directed Functional Programming Katia Gladitz Lehrstuhl f ur Informatik II, RWTH Aachen Ahornstrasse 55, W{5100 Aachen, Germany Heinz Fassbender and Heiko Vogler Abt. Theoretische Informatik, Universit at Ulm Oberer Eselsberg, W-7900 Ulm, Germany Ulmer
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1991/91-04.ps.gz, 19921009 A New Class of Cryptosystems Based on Interconnection Networks Michael Portz RWTH Aachen Lehrstuhl f ur angewandte Mathematik insb. Informatik Ahornstr. 55 D-5100 Aachen michaelp@terpsichore.informatik.rwth-aachen.de 1 Introduction Interconnection networks have been widely studied in the field of
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1990/90-14.ps.gz, 19921009 61 ffl Schreiben Sie ein Miranda-Programm, welches zu einer rechtslinearen Grammatik G, die nur Regeln der Form A -> a B und A -> a enth alt, und einem Wort w feststellt, ob w in L(G) liegt. Definieren Sie hierzu die algebraischen Typen nonterminal ::= A\|B\|C\|D\|E\|F\|G\|H\|I\|J\|K\|L\|M\|
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1990/90-04.ps.gz, 19921009 REFERENCES 17 R.Loogen, H.Kuchen, K.Indermark, W.Damm: Distributed Implementation of Programmed Graph Reduction, Conf. on Parallel Architectures and Languages Europe 1989, LNCS 365, Springer 1989. J.J.Moreno-Navarro, M.Rodr guez-Artalejo: BABEL: A functional and
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1991/91-31.ps.gz, 19921009 Generating Data Flow Analysis Algorithms from Modal Specifications Bernhard Steffen Lehrstuhl f ur Informatik II RWTH { Aachen D-5100 Aachen Aachener Informatikberichte Nr. 91 { 31
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1992/92-19.dir/92-19-27.ps.gz, 19921013 Monitoring with Graph-Grammars as formal operational Models Heiko D rr Institut f r Informatik Freie Universit t Berlin Nestorstr. 8-9 D-1000 Berlin 31 doerr@inf.fu-berlin.de 21/9/92 This paper presents a monitoring method which reduces the costs of event-tracing. To support the monitoring of a
	ftp://wuarchive.wustl.edu/doc/techreports/uky.edu/cs/214-92.ps.Z, 19921014 A comparison of some parallel game-tree search algorithms (Revised version) Jaleh Rezaie (jrezaie@ms.uky.edu) Raphael Finkel (raphael@ms.uky.edu) Department of Computer Science University of Kentucky Lexington, KY 40506-0027
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1992/wucs-92-41.ps.Z, 19921015 Hyperflow: A Visual Programming Language for Pen Computers1 Takayuki Dan Kimura Department of Computer Science Washington University in St. Louis (314) 935-6122 tdk@wucs1.wustl.edu
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1992/wucs-92-42.ps.Z, 19921015 Hyperflow: A Uniform Visual Language for Different Levels of Programming1 Takayuki Dan Kimura Department of Computer Science Washington University in St. Louis (314) 935-6122 tdk@wucs1.wustl.edu
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1992/92-19.dir/92-19-28.ps.gz, 19921015 Some implementation aspects of Concurrent Clean on distributed memory architectures. John H. G. van Groningen Faculty of Mathematics and Computer Science, University of Nijmegen, Toernooiveld 1, 6525 ED Nijmegen, The Netherlands E-mail: johnvg@cs.kun.nl October 1992
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1992/92-19.dir/92-19-09.ps.gz, 19921015 Experiments with strict STG code Denis B Howe Geoffrey L Burn Computing Department, Imperial College, London. E-mail: dbh, glb@doc.ic.ac.uk October 15, 1992
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1992/92-19.dir/92-19-21.ps.gz, 19921016 September 23, 1992 11 : 56 DRAFT 27 David R. Lester and Geoffrey L. Burn, An Executable Specification of the HDGachine", In Workshop on Massive Parallelism: Hardware, Programming and Applications, Amalfi, Italy, 95 October 1989. Simon L Peyton Jones, Implementing lazy
	ftp://wuarchive.wustl.edu/doc/techreports/indiana.edu/cs/TR359.ps.Z, 19921019 Using Goals and Experience to Guide Abduction1 David B. Leake leake@cs.indiana.edu Technical Report #359 Department of Computer Science, Indiana University Lindley Hall 215, Bloomington, IN 47405
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1992/92-19.dir/92-19-29.ps.gz, 19921020 Load Bounding for Implicit Parallelism Gerald Ostheimer Department of Mathematical and Computational Sciences University of St. Andrews
	ftp://wuarchive.wustl.edu/doc/techreports/indiana.edu/cs/TR362.ps.Z, 19921021 Language Extension via First-class Interpreters Indiana University Computer Science Department Technical Report #362 John Wiseman Simmons II Stanley Jeffersony Daniel P. Friedmanz September 29, 1992
	ftp://wuarchive.wustl.edu/doc/techreports/uky.edu/cs/216-92.ps.Z, 19921027 A Reservation-based CSMA Protocol for Integrated Manufacturing Networks Technical Report 216-92 Rajendra Yavatkar, Prashant Pai and Raphael Finkel Department of Computer Science University of Kentucky Lexington, KY 40506 fraj,raphaelg@ms.uky.edu October 8, 1992
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr92/tr92-032.ps.Z, 19921104 Implementing Distributed Search Structures Padmashree Krishna Theodore Johnson pk@cis.ufl.edu ted@cis.ufl.edu Computer and Information Sciences Department University of Florida Gainesville, FL 32611 November 4, 1992
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1992/wucs-92-49.ps.Z, 19921113 The Power of Self-Directed Learning Sally A. Goldman Department of Computer Science Washington University St. Louis, Missouri 63130 Robert H. Sloany Dept. of Electrical Engineering and Computer Science University of Illinois at Chicago Chicago, IL 60680 WUCS-92-49z November 12, 1992
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr92/tr92-035.ps.Z, 19921117 Constant Time Computational Geometry On Reconfigurable Meshes With Buses* Madhusudan Nigam and Sartaj Sahni University of Florida Gainesville, FL 32611 Technical Report 92-35
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr92/tr92-005.ps.Z, 19921117 Sorting n Numbers On n n Reconfigurable Meshes With Buses* Madhusudan Nigam and Sartaj Sahni University of Florida Gainesville, FL 32611 Technical Report 92-5
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr92/tr92-034.ps.Z, 19921117 Sorting n 2 Numbers On n n Meshes* Madhusudan Nigam and Sartaj Sahni University of Florida Gainesville, FL 32611 Technical Report 92-34
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1992/wucs-92-28.ps.Z, 19921118 On the Complexity of Teaching Sally A. Goldman Department of Computer Science Washington University St. Louis, MO 63130 sg@cs.wustl.edu Michael J. Kearns AT&T Bell Laboratories Murray Hill, NJ 07974 mkearns@research.att.com WUCS-92-28 August 11, 1992
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1992/wucs-92-37.ps.Z, 19921118 An Application-Oriented Error Control Scheme For High Speed Networksy Fengmin Gong MCNC Center for Communications gong@concert.net Phone 919-248-9214 FAX 919-248-1405 Guru Parulkar Computer and Communications Research Center Washington University, St. Louis guru@flora.wustl.edu Phone 314-935-4621 FAX
	ftp://wuarchive.wustl.edu/doc/techreports/arizona.edu/cs/1992/TR92-29.ps, 19921119 Super-Pattern Matching James R. Knight1 Eugene W. Myers1 TR 92-29 Revised November 16, 1992
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr92/tr92-036.ps.Z, 19921120 Performance Driven Graph Enhancement Problems* Doowon Paika and Sartaj Sahnib aAT&T Bell Laboratories, Murray Hill, NJ bComputer and Information Sciences Department, University of Florida, Gainesville, FL 32611 TECHNICAL REPORT: 92-036
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr92/tr92-037.ps.Z, 19921123 A New Approach to Finding Objects in Programs Panos E. Livadas Theodore Johnson Computer and Information Sciences Department University of Florida, Gainesville, FL 32611
	ftp://wuarchive.wustl.edu/doc/techreports/arizona.edu/cs/1992/TR92-31.ps, 19921124 FT-SR: A Programming Language for Constructing Fault-Tolerant Distributed Systems Richard D. Schlichting Vicraj T. Thomas TR 92-31 FT-SR: A Programming Language for Constructing Fault-Tolerant Distributed Systems 1 Richard D. Schlichting Vicraj T. Thomas TR 92-312
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr92/tr92-039.ps.Z, 19921124 A Multi-Model Approach to Reasoning and Simulation Paul A. Fishwick University of Florida fishwick@cis.ufl.edu N. Hari Narayanan Hitachi Advanced Research Laboratory narayan@harl.hitachi.co.jp Jon Sticklen Michigan State University sticklen@cpswh.cps.msu.edu Andrea Bonarini Politecnico di Milano
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr92/tr92-038.ps.Z, 19921124 Hybrid Heterogeneous Hierarchical Models for Knowledge-Based Autonomous Systems Victor T. Miller University of Florida, Department of Aerospace and Mechanical Engineering Sciences 231 Aero building Gainesville, Florida, 32611 Paul A. Fishwick University of Florida, Department of Computer and Information
	ftp://wuarchive.wustl.edu/doc/techreports/indiana.edu/cs/TR364.ps.Z, 19921130 A Simple Reflective Interpreter Stanley Jefferson Daniel P. Friedman IMSA '92 International Workshop on Reflection and Meta-Level Architecture Tokyo, November 4-7, 1992 A Simple Reflective Interpreter Stanley Jefferson Daniel P. Friedman y Department of Computer Science Indiana University Bloomington,
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1992/wucs-92-32.ps.Z, 19921202 The Programmers' Playground: I/O Abstraction for Heterogeneous Distributed Systems Kenneth J. Goldman and Michael D. Anderson WUCS-92-32 November 1992 Department of Computer Science Washington University Campus Box 1045 One Brookings Drive Saint Louis, MO 63130{4899 The Programmers' Playground: I/O
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1992/92-35.ps.gz, 19921207 ffiaeoe OE <= ae >=ffissss<= <= ffiae<= ffi fi oess <= fffl J rgen B rstler Lehrstuhl f r Informatik III Aachen University of Technology Ahornstra e 55, W-5100 Aachen, Germany jubo@rwthi3.informatik.rwth aachen.de fflssae ffi ae ae fi flae >=>= <= ffl ss<= ff fffioefi <=>= fi ss o ssffl fiae fi ssfflfi
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1992/wucs-92-36.ps.Z, 19921209 Simulation of an ATM{FDDI Gateway Milind M. Buddhikot Department of Computer Scince, Washington University in St. Louis, St. Louis, MO 63130. milind@dworkin.wustl.edu Sanjay Kapoor Department of Electrical Engineering, Washington University in St. Louis, St. Louis, MO 63130. kapoor@wuee1.wustl.edu
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr92/tr92-033.ps.Z, 19921210 Lazy Updates for Distributed Search Structures Theodore Johnson and Padmashree Krishna Dept. of CIS University of Florida December 1, 1992
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1992/92-24.ps.gz, 19921211 The Three Dimensions of Requirements Engineering+ Klaus Pohl Informatik V, RWTH-Aachen, Ahornstr. 55, 5100 Aachen pohl@informatik.rwth-aachen.de
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr92/tr92-040.ps.Z, 19921214 A simple correctness proof of the MCS contention-free lock Theodore Johnson Krishna Harathi Computer and Information Sciences Department University of Florida
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr92/tr92-045.ps.Z, 19921217 University of Florida Computer and Information Sciences An Objective Function For Vertically Partitioning Relations in Distributed Databases and its Analysis Sharma Chakravarthy Jaykumar Muthuraj Ravi Varadarajan Shamkant B. Navathe email: sharma@snapper.cis.ufl.edu UF-CIS-TR-92-045 (Submitted for
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/math/papers/crasslob.ps.Z, 19921217 SMOOTH LOCALIZED ORTHONORMAL BASES 5 the collection E = fU k U k+1OIkWk ek;j : j; k 2 Zg is an orthonormal basis for L2(R) consisting of functions of compact support. If in addition all the functions ek;j and rk, k; j 2 Z, belong to Cd(R) for some <= d <= 1, then the functions in E belong to Cd0 (R).
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/math/papers/cwatfa.ps.Z, 19921217 R. R.Coifman, Y. Meyer, and M. V. Wickerhauser, Wavelet analysis and signal processing, Wavelets and Their Applications, ed. Ruskai et al., ISBN 0-86720-225-4, Jones and Bartlett, Boston, 1992, pp. 15378.. R. R.Coifman, Y. Meyer, and M. V. Wickerhauser, Size properties of wavelet packets,
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr92/tr92-043.ps.Z, 19921217 University of Florida Computer and Information Sciences Real-Time Transaction Scheduling : A Cost Conscious Approach D. Hong T. Johnson S. Chakravarthy email: fdh2, ted, sharmag@cis.ufl.edu UF-CIS-TR-92-043 (Submited for publication) (This work was supported by the National Science Foundation Research
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr92/tr92-044.ps.Z, 19921217 University of Florida Computer and Information Sciences A Retrospective Analysis of Time Concepts in Temporal Databases Seung-Kyum Kim and Sharma Chakravarthy email: fskk,sharmag@cis.ufl.edu UF-CIS-TR-92-044 (Submited for publication) (This work was supported in part by the NSF Research Initiation Grant
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr92/tr92-041.ps.Z, 19921217 University of Florida Computer and Information Sciences Architectures and Monitoring Techniques for Active Databases : An Evaluation Sharma Chakravarthy email: sharma@snapper.cis.ufl.edu UF-CIS-TR-92-041 (Submited for publication) (This work was (in part) supported by the Office of Naval Technology and
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr92/tr92-042.ps.Z, 19921217 University of Florida Computer and Information Sciences A New Perspective on Rule Support for Object-Oriented Databases E. Anwar L. Maugis S. Chakravarthy email: sharma@snapper.cis.ufl.edu UF-CIS-TR-92-042 (Submited for publication) (This work was supported in part by the NSF Research Initiation Grant
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/math/papers/wawa.ps.Z, 19921217 WAVELETS AND ADAPTED WAVEFORM ANALYSIS 33 11. M. V. Wickerhauser, Computation with Adapted Time-Frequency Atoms, To appear in Proceedings of the International Conference: Wavelets and Applications, Toulouse, 8{13 June 1992. 12. R. R. Coifman, F. Majid, and M. V. Wickerhauser, denoise, Available from
	ftp://wuarchive.wustl.edu/doc/techreports/arizona.edu/cs/1992/TR92-36.ps, 19921217 A Sub-quadratic Algorithm for Approximate Limited Expression Matching Sun Wu, Udi Manber, & Gene Myers TR 92-36 A Sub-quadratic Algorithm for Approximate Limited Expression Matching Sun Wu, Udi Manber1, and Gene Myers2 TR 92-36
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/math/papers/gwoz.ps.Z, 19921218 This is a very preliminary version of the notes from which the Adelaide lectures are based. These are not to be distributed outside the city limits of Adelaide. Typeset by AMS-TEX Time-Frequency Methods and Time-Scaling Methods in Signal and Image Processing lectured by G.Weiss from notes of Y.Meyer
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/math/papers/burgers.ps.Z, 19921218 Scale Decompostion In Burgers' Equation Fr ed eric Heurtaux Fabrice Planchony Mladen Victor Wickerhauserz Department of Mathematics, Campus Box 1146 Washington University in St. Louis, MO 63130 December 1, 1992
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/math/papers/aww.ps.Z, 19921222 Local Sine and Cosine Bases 19 and >= = 1 + 1m ; m a positive integer. If we let w(x) 1 p2ss R 1 1 eix ( )d , then w is a mother function" that generates a wavelet basis (giving us a Multi Resolution Analysis) fw(x>= k n ss >= 1 )>= k2 g; for all k; n 2 Z, whenever >= = 1 + 1m ; m a positive integer.
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr92/tr92-046.ps.Z, 19921227 University of Florida Computer and Information Sciences Database Supported Cooperative Problem Solving S. Chakravarthy K. Karlapalem S. B. Navathe A. Tanaka email: sharma@snapper.cis.ufl.edu Tech. Report UF-CIS-TR-92-046 December 1992 (Submitted for publication) Department of Computer and Information
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr92/tr92-047.ps.Z, 19921228 University of Florida Computer and Information Sciences Active Data/Knowledge Base Research At The University of Florida S. Chakravarthy E. Hanson S. Y. W. Su email: fsharma,hanson,sug@cis.ufl.edu Tech. Report UF-CIS-TR-92-047 December 1992 (Invited paper) Department of Computer and Information Sciences
	ftp://wuarchive.wustl.edu/doc/techreports/arizona.edu/cs/1992/TR92-25.ps, 19921228 Experience with Modularity in Consul Shivakant Mishra,1 Larry L. Peterson, and Richard D. Schlichting TR 92-25
	ftp://wuarchive.wustl.edu/doc/techreports/arizona.edu/cs/1992/TR92-20.ps, 19921228 Modularity in the Design and Implementation of Consul Shivakant Mishra,1 Larry L. Peterson and Richard D. Schlichting TR 92-20
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr92/tr92-048.ps.Z, 19921230 University of Florida Computer and Information Sciences Heterogeneous Databases: Inferring Relationships for Merging Component Schemas, and a Query Language W. K. Whang S. Chakravarthy S. B. Navathe email: sharma@snapper.cis.ufl.edu Tech. Report UF-CIS-TR-92-048 December 1992 (Submitted for publication)
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr93/tr93-001.ps.Z, 19930103 University of Florida Computer and Information Sciences Design and Implementation of Active Capability for an Object-Oriented Database S. Chakravarthy E. Anwar L. Maugis email: sharma@snapper.cis.ufl.edu Tech. Report UF-CIS-TR-93-001 January 1993 (Submitted for publication) Department of Computer and
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr93/tr93-002.ps.Z, 19930103 University of Florida Computer and Information Sciences A Comparative Evaluation of Active Relational Databases S. Chakravarthy email: sharma@snapper.cis.ufl.edu Tech. Report UF-CIS-TR-93-002 January 1993 (Submitted for publication) Department of Computer and Information Sciences Computer Science
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr92/tr92-006.ps.Z, 19930104 An Integrated Approach to System Modelling using a Synthesis of Artificial Intelligence, Software Engineering and Simulation Methodologies Paul A. Fishwick University of Florida.
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1992/92-30.ps.gz, 19930108 Object-Orientation Axiomatised by Dynamic Logic Alfons Kemper Guido Moerkotte+ Klaus Peithner Lehrstuhl f ur Informatik III +Fakult at f ur Informatik RWTH Aachen Universit at Karlsruhe Ahornstrasse 55 Am Fasanengarten 5 D{5100 Aachen, F. R. G. D{7500 Karlsruhe, F. R. G. kemper
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/92.reports/tr35.92.ps, 19930112 Technical Report CMU/SEI-92-TR-35 ESD-TR-92-35 Control Integration Through Message Passing in a Software Development Environment Alan W. Brown December 1992 Technical Report CMU/SEI-92-TR-35 ESD-TR-92-35 December 1992 Control Integration Through Message Passing in a Software Development Environment Alan
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1992/92-36.ps.gz, 19930113 1 ESPRIT Project 6353 (NATURE), Report AC-92-1 Theories Underlying Requirements Engineering: An Overview of NATURE at Genesis Matthias Jarke, Informatik V, RWTH Aachen, Ahornstr. 55, 5100 Aachen, Germany Janis Bubenko, SISU-ISE, Isafjordsgatan 26, 1250 Kista, Sweden Colette Rolland, Universite Paris 1,
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr93/tr93-004.ps.Z, 19930114 University of Florida Computer and Information Sciences Resolution of Time Concepts in Temporal Databases Sharma Chakravarthy Seung-Kyum Kim email: sharma@snapper.cis.ufl.edu Tech. Report UF-CIS-TR-93-004 January 1993 (Submitted for publication) Department of Computer and Information Sciences Computer
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/arl/infocom92.ps.Z, 19930118 COMMUNICATING WITH VIRTUAL PATHS AND VIRTUAL CHANNELS Rick Bubenik Mike Gaddis John DeHart Applied Research Laboratory Department of Computer Science Washington University St. Louis, Missouri 63130-4899 1 Introduction Clients of ATM (Asynchronous Transfer Mode) networks communicate by creating
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr93/tr93-005.ps.Z, 19930121 A Priority Synchronization Algorithm for Multiprocessors Krishna Harathi Theodore Johnson krishna@cis.ufl.edu ted@cis.ufl.edu Computer and Information Sciences Department University of Florida Gainesville, FL 32611 January 21, 1993
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1992/wucs-92-35.part1.ps.Z, 19930126 Short Title: Gesture System for Graph Editor Taysi, M.S. 1992 LIST OF TABLES TABLES Page 1. Description of Types 14 2. Draw Commands 45 3. Test Results 54 iv LIST OF FIGURES FIGURES Page 1. The Move Gesture 2 2. Deleting in GEdit a) individual b) group 9 3. Different Gesture Sets used in GDP 10 4. Pen
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1992/wucs-92-06.part1.ps.Z, 19930126 WASHINGTON UNIVERSITY IN ST LOUIS Washington School of Engineering & Applied Science Saint Louis, MO 63130-4899One Brookings DriveCampus Box 1045Washington UniversityDepartment of Computer Science Program Visualization: The Art of Mapping Programs to Pictures Gruia-Catalin Roman Kenneth C. Cox
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1992/wucs-92-04.ps.Z, 19930126 WASHINGTON UNIVERSITY IN ST LOUIS Washington School of Engineering & Applied Science Saint Louis, MO 63130-4899One Brookings DriveCampus Box 1045Washington UniversityDepartment of Computer Science 1/25/93 Seeking Concurrency in Rule-based Programming Gruia-Catalin Roman Rose F. Gamble William E. Ball
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1992/wucs-92-35.part2.ps.Z, 19930128 1 1. Introduction The research on pen based computing began in the mid 1960's with the development of Rand and Sylvania tablets , and has seen significant development in the late 1980's into 1990's. Referred to as both the Paper-Like Interface 1 and Silicon Paper Technology , the advantages
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1992/wucs-92-40.ps.Z, 19930129 WASHINGTON UNIVERSITY IN ST LOUIS Washington School of Engineering & Applied Science Saint Louis, MO 63130-4899One Brookings DriveCampus Box 1045Washington UniversityDepartment of Computer Science Printed 1/29/93 Experiences with the Pavane Program Visualization Environment Kenneth C. Cox Gruia-Catalin
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr93/tr93-006.ps.Z, 19930131 University of Florida Computer and Information Sciences A Federated Multi-media DBMS for Medical Research : Architecture and Functionality S. Chakravarthy V. Krishnaprasad Z. Tamizuddin F. Lambay email: sharma@snapper.cis.ufl.edu Tech. Report UF-CIS-TR-93-006 January 1993 (Submitted for publication)
	ftp://wuarchive.wustl.edu/doc/techreports/uky.edu/cs/225-93.ps.Z, 19930201 The Viva File System Eric H. Herrin II Raphael A. Finkel Technical Report Number 225-93 915 Patterson Office Tower Department of Computer Science University of Kentucky Lexington, Kentucky 40506 eric@ms.uky.edu, raphael@ms.uky.edu
	ftp://wuarchive.wustl.edu/doc/techreports/indiana.edu/cs/TR368.ps.Z, 19930202 An Object Based Algebra for Parallel Query Processing and Optimization Vijay M. Sarathy Indiana University Computer Science Department Bloomington, Indiana 47405-4101, USA e-mail: vijay@cs.indiana.edu Lawrence V. Saxton University of Regina Department of Computer Science Regina, Saskatchewan S4S 0A2,
	ftp://wuarchive.wustl.edu/doc/techreports/indiana.edu/cs/TR371.ps.Z, 19930202 Learning to Perceive and Produce Rhythmic Patterns in an Artificial Neural Network J. Devin McAuley1 Department of Computer Science Indiana University Bloomington, Indiana 47405 February 1, 1993 1The author is supported by ONR grant N00014-91-J1261. Thanks to Michael Gasser, Robert Port, Joseph
	ftp://wuarchive.wustl.edu/doc/techreports/indiana.edu/cs/TR370.ps.Z, 19930205 Predicting Convergence Time for Genetic Algorithms Sushil J. Louis Gregory J. E. Rawlins Department of Computer Science Indiana University Bloomington, IN 47405 email: louis@cs.indiana.edu
	ftp://wuarchive.wustl.edu/doc/techreports/arizona.edu/cs/1992/TR92-37.ps, 19930208 Combinatorial algorithms for DNA sequence assembly John D. Kececioglu1 Eugene W. Myers2 TR 92-37 Revised October 20, 1992; revised January 15, 1993
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/er-92-07.ps.Z, 19930211 AAAI Fall Symposium on AI for Real-World Autonomous Mobile Robots", Cambridge, MA, October 1992. A Case-Based Approach to Reactive Control for Autonomous Robots Kenneth Moorman and Ashwin Ram College of Computing Georgia Institute of Technology
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/er-90-03.ps.Z, 19930211 Proceedings of the Twelvth Annual Conference of the Cognitive Science Society, Cambridge, MA, August 1990. Decision Models: A Theory of Volitional Explanation Ashwin Ram College of Computing Georgia Institute of Technology Atlanta, Georgia 30332-0280 (404) 853-9372 E-mail: ashwin@cc.gatech.edu
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-91-37.ps.Z, 19930211 Learning Momentum: On-line Performance Enhancement for Reactive Systems Russell J. Clark, Ronald C. Arkin, and Ashwin Ram Technical Report GIT-CC-91/37 College of Computing Georgia Institute of Technology Atlanta, GA 30332-0280
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/er-91-04.ps.Z, 19930211 Proceedings of the First International Workshop on Multistrategy Learning, Harpers Ferry, WV, November, 1991. 217 Using Introspective Reasoning to Select Learning Strategies Michael Cox and Ashwin Ram cox@cc.gatech.edu ashwin@cc.gatech.edu Georgia Institute of Technology College of Computing Atlanta, GA
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/er-90-02.ps.Z, 19930211 Proceedings of the Twelvth Annual Conference of the Cognitive Science Society, Cambridge, MA, August 1990. Knowledge Goals: A Theory of Interestingness Ashwin Ram College of Computing Georgia Institute of Technology Atlanta, Georgia 30332-0280 (404) 853-9372 E-mail: ashwin@cc.gatech.edu
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1992/92-44.ps.Z, 19930212 oe<= fi ffl OEfi>=AEfio<= ff fi aefiss ae<= o ffl fiofiflfioe ffOoeo ae <= ae<= ssss>=<=ffifio<= oe ff <=OE<=ss ffi #AEAE <=OEO>=<= O<=ss fi<= AEOEO ss >=#AE oe>=oAEae O ffl<= oe ss oe !<=AEOE O" o>= <=oe $ <=oe <=AEae oe" floeoaefiffio ss.#$1- 2.%36 1$ 2823$,2 %.1 //+(" 3(.- 1$ 2 +(*$ .%%("$ 43., 3(.-
	ftp://wuarchive.wustl.edu/doc/techreports/indiana.edu/cs/TR369.ps.Z, 19930219 Matrix Chain Ordering in Polylog Time with n=lg n Processors Phillip G. Bradford Gregory J. E. Rawlinsy Gregory E. Shannonz February 19, 1993
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr93/tr93-003.ps.Z, 19930222 A Simulation Environment for Multimodeling Paul A. Fishwick University of Florida
	ftp://wuarchive.wustl.edu/doc/techreports/uky.edu/cs/vade.mecum.2.ps.Z, 19930227 An Operating Systems Vade Mecum Raphael A. Finkel University of Wisconsin at Madison Prentice Hall Englewood Cliffs, New Jersey 07632 PREFACE Traditionally, a vade mecum (pronounced ``VAHdee MAYkem'') is a laboratory manual that guides the student step by step through complex procedures. Operating
	ftp://wuarchive.wustl.edu/doc/techreports/arizona.edu/cs/1993/TR93-01.ps, 19930301 Efficient Timestamp Input and Output Curtis E. Dyreson1 Richard T. Snodgrass2 TR 93-01 February 25, 1993
	ftp://wuarchive.wustl.edu/doc/techreports/indiana.edu/cs/TR372.ps.Z, 19930305 indiana university computer science department technical report no. 372 Integrating Boolean Verification with Formal Derivation Bhaskar Bose, Steven D. Johnson, and Shyamsundar Pullela february 1993 To appear in the proceedings of the 1993 IFIP Conference on Hardware Description Languages and their
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr93/tr93-007.ps.Z, 19930308 University of Florida Computer and Information Sciences Snoop: An Expressive Event Specification Language For Active Databases Sharma Chakravarthy Deepak Mishra email: sharma@snapper.cis.ufl.edu Tech. Report UF-CIS-TR-93-007 (Revised and extended version of UF-CIS-TR-91-23, September 1991) March 1993
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/92.reports/tr15.92.ps, 19930310
	ftp://wuarchive.wustl.edu/doc/techreports/uky.edu/cs/os.summary.ps.Z, 19930312 A quick course in operating systems Raphael Finkel Computer Science Department University of Kentucky Lexington, KY raphael@ms.uky.edu raphael@ukma.bitnet Operating Systems 1 What is an operating system iiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiii Resource Principle iiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiii An
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cs-93-02.ps.Z, 19930316 Introspective Multistrategy Learning Michael T. Cox March 16, 1993 Report No. 2 GEORGIA INSTITUTE OF TECHNOLOGY A UNIT OF THE UNIVERSITY SYSTEM OF GEORGIA NI AIGROEG EHT FO LAES STITUTE OF TECHNOLOGY 8581NADPROGRESSSERVICE S c i e n c eC o g n i t i v e Introspective Multistrategy Learning Michael T.
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1993/93-03.ps.Z, 19930326 A New Stack Technique for the Management of Runtime Structures in Distributed Implementations Guido Hogen and Rita Loogen RWTH Aachen, Lehrstuhl f ur Informatik II Ahornstrasse 55, W-5100 Aachen, Germany
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr93/tr93-011.ps.Z, 19930327 A Concurrent Dynamic Task Graph Theodore Johnson Dept. of Computer and Inf. Science University of Florida Gainesville, Fl 32611-2024 ted@cis.ufl.edu
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1992/92-04.ps.Z, 19930328 Priority as Extremal Probability Scott A. Smolkay Bernhard Steffen Department of Computer Science Lehrstuhl f ur Informatik II SUNY at Stony Brook RWTH Aachen Stony Brook, NY 11794-4400 5100 Aachen USA Germany sas@cs.sunysb.edu bus@zeus.informatik.rwth-aachen.de Aachener Informatikberichte Nr. 92 { 4
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1992/92-20.ps.gz, 19930328 Implementing Disequality in the Lazy Functional Logic Language Babel Herbert Kuchen RWTH Aachen Francisco Javier L opez-Fraguas Universidad Complutense de Madridy Juan Jos e Moreno-Navarro Universidad Polit ecnica de Madridz Mario Rodr guez-Artalejo Universidad Complutense de Madridx
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1992/92-12.ps.Z, 19930328 On the Interaction of Lazy Evaluation and Backtracking Werner Hans, Rita Loogen and Stephan Winkler RWTH Aachen, Lehrstuhl f ur Informatik II Ahornstrasse 55, W-5100 Aachen, Germany Aachener Informatik-Berichte Nr. 92{12
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1992/92-27.ps.Z, 19930328 Aliasing and Groundness Analysis of Logic Programs through Abstract Interpretation and its Safety Werner Hans and Stephan Winkler RWTH Aachen, Lehrstuhl f ur Informatik II Ahornstrasse 55, W-5100 Aachen, Germany Aachener Informatikberichte Nr. 92{27
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1992/92-29.ps.Z, 19930328 Abschiedsvorlesung Warum Frauenforschung in Naturwissenschaft und Technik von Britta Schinzel gehalten am 19.12.1991 um 17.00 im AH I der RWTH Aachen 19. November 1992 Ein mathematischer Beweis, eine physikalische Theorie, eine chemische Formel, ein Experiment in der Biologie, eine technische
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1992/92-11.ps.gz, 19930328 A Complete Indexing Scheme for WAM-based
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1992/92-15.ps.gz, 19930328 1. Einleitung 1 1. Einleitung In der Informatik werden zur Modellierung komplexer Sachverhalte h ufig Graphen eingesetzt. Sie begegnen uns in nahezu allen Disziplinen der Informatik - und auch in anderen Anwendungsgebieten, z.B. der Biologie, der Chemie, ... . Als Beispiele lassen sich Petrinetze,
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1992/92-21.ps.Z, 19930328 Result Directed Computing in a Functional Logic Language Herbert Kuchen RWTH Aachen Francisco Javier L opez-Fraguas Universidad Complutense de Madridy
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1992/92-06.ps.Z, 19930328 Model Checking for Context-Free Processes Olaf Burkart and Bernhard Steffen Lehrstuhl f ur Informatik II RWTH Aachen Ahornstrasse 55 W-5100 Aachen GERMANY
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1992/92-22.ps.gz, 19930328 Independent AND-Parallel Narrowing Herbert Kuchen RWTH Aachen Juan Jos e Moreno-Navarro, Manuel V. Hermenegildo Universidad Polit ecnica de Madridy
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1992/92-38.ps.gz, 19930328 page 1 of 12 Implementation of the imperative / rule based language PROGRES Albert Z ndorf1 Department of computer science III Aachen University of Technology Ahornstra e 55, 5100 Aachen, Germany e-mail: albert@rwthi3.informatik.rwth-aachen.de phone: ++49/+241/80-21312 fax: ++49/+241/80-21329
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1992/92-23.ps.gz, 19930328 Distinguishing Formulas for Free Tiziana Margaria Bernhard Steffen Lehrstuhl f ur Informatik II RWTH Aachen 5100 Aachen Germany tel: +49 241 8021.201 fax: +49 241 8021.229 ftiziana,busg@informatik.rwth-aachen.de Aachener Informatikberichte Nr. 92 { 23
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1992/92-14.ps.Z, 19930328 Top{down Parsing with Simultaneous Evaluation of Noncircular Attribute Grammars Thomas Noll Lehrstuhl f ur Informatik II RWTH Aachen Ahornstrasse 55 D{52056 Aachen Germany noll@zeus.informatik.rwth-aachen.de Heiko Vogler Abt. Theoretische Informatik Universit at Ulm Oberer Eselsberg D{89069 Ulm Germany
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1992/92-43.ps.gz, 19930328
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1992/92-39.ps.gz, 19930328 Intelligentes Backtracking bei der Auswertung funktional-logischer Programme Patrik Koch Lehrstuhl f ur Informatik II Rheinisch-Westf alische Technische Hochschule Aachen patrik@zeus.informatik.rwth-aachen.de Zusammenfassung Deklarative Programmiersprachen erm oglichen eine problemorientierte
	ftp://wuarchive.wustl.edu/doc/techreports/mcgill.ca/math/rags/nets/nets.ps.Z, 19930330 Natural deduction and coherence for weakly distributive categories R.F. Blute1 J.R.B. Cockett2 R.A.G. Seely3 T.H. Trimble4
	ftp://wuarchive.wustl.edu/doc/techreports/mcgill.ca/math/barr/variable.sets.ps.Z, 19930330 FUNCTIONAL SET THEORY Michael Barr Department of Mathematics and Statistics McGill University 805 Sherbrooke St., W Montreal, Quebec Canada H3A 2K6 Email: barr@triples.math.mcgill.ca March 12, 1992 1 Introduction A recent article in The Intelligencer described in some detail the theory of
	ftp://wuarchive.wustl.edu/doc/techreports/mcgill.ca/math/rags/wk_dist_cat/wdcat.ps.Z, 19930330 Weakly distributive categories J.R.B. Cockett R.A.G. Seelyy
	ftp://wuarchive.wustl.edu/doc/techreports/mcgill.ca/math/pavlovic/4color-A4.ps.Z, 19930330 A categorical setting for the 4-Colour Theorem Du<=sko Pavlovi c Department of Mathematics and Statistics, McGill University Montreal, Quebec, Canada H3A 2K6 e-mail: pavlovic@triples.math.mcgill.ca August 12, 1992
	ftp://wuarchive.wustl.edu/doc/techreports/mcgill.ca/math/rags/wk_dist_cat/wdc.ps.Z, 19930330 Weakly distributive categories J.R.B. Cockett R.A.G. Seelyy
	ftp://wuarchive.wustl.edu/doc/techreports/mcgill.ca/math/rags/ptime/ptime.ps.Z, 19930330 A Logical Calculus for Polynomial-time Realizability J.N. Crossley Monash University G.L. Mathai Monash University R.A.G. Seely McGill University & John Abbott College February 14, 1991
	ftp://wuarchive.wustl.edu/doc/techreports/mcgill.ca/math/pavlovic/4color-US.ps.Z, 19930330 A categorical setting for the 4-Colour Theorem Du<=sko Pavlovi c Department of Mathematics and Statistics, McGill University Montreal, Quebec, Canada H3A 2K6 e-mail: pavlovic@triples.math.mcgill.ca August 12, 1992
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/mimi/er-mr-93-01.ps.Z, 19930331 Running head: Learning strategies and transfer Learning Strategies and Transfer in the Domain of Programming Peter Pirolli and Margaret Recker University of California, Berkeley Learning Strategies and Transfer Page 2
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr93/tr93-012.ps.Z, 19930331 A Parallel Algorithm For Surface Triangulation Theodore Johnson, Panos E. Livadas, Sunjay E. Talele Dept. of Computer and Information Science University of Florida March 31, 1993
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1993/wucs-93-12.ps.Z, 19930402 Research Proposal: Preference Acquisition through Reconciliation of Inconsistencies Nilesh L. Jain WUCS-93-12 April 8, 1993 Division of Medical Informatics Campus Box 8005 Washington University School of Medicine 660 S. Euclid Ave St. Louis MO 63110
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1993/wucs-93-13.ps.Z, 19930402 Objective Evaluation of Radiation Treatment Plans Nilesh L. Jain and Michael G. Kahn WUCS-93-13 April 9, 1993 Division of Medical Informatics Campus Box 8005 660 S. Euclid Ave Washington University School of Medicine St. Louis MO 63110 Submitted to the Seventeenth Annual Symposium on Computer
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1992/wucs-92-11.ps.Z, 19930402 Kumon Machine: Learning Math with Silicon Paper Takayuki Dan Kimura WUCS-92-11 February 1992 (Revised March 1993) Laboratory for Pen-Based Silicon Paper Technology Department of Computer Science Washington University St. Louis, Missouri 63130 phone: (314) 935-6122, fax: (314) 935-7302
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1993/wucs-93-18.ps.Z, 19930402 A Comparison Study of The Pen and The Mouse in Editing Graphic Diagrams Ajay Apte and Takayuki Dan Kimura WUCS-93-18 March 1993 Laboratory for Pen-Based Silicon Paper Technology Department of Computer Science Washington University St. Louis, Missouri 63130 phone: (314) 935-6122, fax: (314) 935-7302
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1993/wucs-93-04.ps.Z, 19930402 WASHINGTON UNIVERSITY IN ST LOUIS Washington School of Engineering & Applied Science Saint Louis, MO 63130-4899One Brookings DriveCampus Box 1045Washington UniversityDepartment of Computer Science Printed 1/25/93 Reasoning about Synchrony Illustrated on Three Models of Concurrency Gruia-Catalin Roman
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1993/wucs-93-17.ps.Z, 19930406 Supervised Competitive Learning with Backpropagation Network and Fuzzy Logic1 Takayuki Dan Kimura Thomas H. Fuller, Jr. Ce Wang WUCS-93-17 March 1993 Laboratory for Pen-Based Silicon Paper Technology Department of Computer Science Washington University St. Louis, Missouri 63130 phone: (314) 935-6122,
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1992/wucs-92-48.ps.Z, 19930414 Efficient Accommodation of May-Alias Information in SSA Form Ron Cytron Washington University St. Louis, Missouri 63130 Reid Gershbeiny Oberlin College Oberlin, Ohio 44074
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1992/92-34.ps.Z, 19930415 Partition-Based Clustering in Object Bases: From Theory to Practice Carsten Gerlhof Alfons Kemper Christoph Kilger y Guido Moerkottey RWTH Aachen yUniversit at Karlsruhe Lehrstuhl f ur Informatik III Fakult at f ur Informatik Ahornstrasse 55 Am Fasanengarten W-5100 Aachen, Germany W-7500 Karlsruhe,
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr93/tr93-015.ps.Z, 19930427 A Fast Solution to the Surface Reconstruction Problem B. C. Vemuri1 and S. H. Lai2 1Department of Computer & Information Sciences 2Department of Electrical Engineering University of Florida, Gainesville, FL 32611 email:vemuri@scuba.cis.ufl.edu
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1992/wucs-92-10.ps.Z, 19930428 Hierarchical Correctness Proofs for Recursive Distributed Algorithms using Dynamic Process Creation Bala Swaminathan Kenneth J. Goldman WUCS-92-10 Revised April 1993 Department of Computer Science Washington University Campus Box 1045 One Brookings Drive Saint Louis, MO 63130{4899 Hierarchical
	ftp://wuarchive.wustl.edu/doc/techreports/arizona.edu/cs/1993/TR93-12.ps, 19930428 Call Forwarding: A Simple Interprocedural Optimization Technique for Dynamically Typed Languages Koen De Bosschere;y Saumya K. Debray;z David Gudeman;z Sampath Kannanz y Electronics Laboratory Rijksuniversiteit Gent B-9000 Gent, Belgium z Department of Computer Science The University of Arizona Tucson,
	ftp://wuarchive.wustl.edu/doc/techreports/mcgill.ca/math/cubric/frccc.ps.Z, 19930429 Embedding of a Free Cartesian Closed Category into the Category of Sets Djordje <=Cubri c
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/92.reports/tr32.92.ps, 19930504
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/er-92-08.ps.Z, 19930504 Communications of the ACM, 35(12):80{81, December 1992. Natural Language Understanding for Information-Filtering Systems Ashwin Ram College of Computing Georgia Institute of Technology Atlanta, Georgia 30332-0280 E-mail: ashwin@cc.gatech.edu Traditional approaches to information filtering that rely on
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr93/tr93-017.ps.Z, 19930506 Interruptible Critical Sections for Real-time Systems Theodore Johnson Dept. of Computer and Information Science University of Florida
	ftp://wuarchive.wustl.edu/doc/techreports/arizona.edu/cs/1993/TR93-11.ps, 19930510 Memory Consistency Models1 David Mosberger TR 93/11
	ftp://wuarchive.wustl.edu/doc/techreports/indiana.edu/cs/TR380.ps.Z, 19930510 indiana university computer science department technical report no. 380 DDD-FM9001: Derivation of a Verified Microprocessor An Exercise in Integrating Verification with Formal Derivation Bhaskar Bose and Steven D. Johnson may 1993 To appear in the proceedings of the 1993 IFIP Advanced Research
	ftp://wuarchive.wustl.edu/doc/techreports/indiana.edu/cs/TR379.ps.Z, 19930511 Benchmark Queries for Temporal Databases Patrick P. Kalua and Edward L Robertson Indiana University Computer Science Department Bloomington, Indiana 47405, USA email : fkalua, edrbtsng@cs.indiana.edu
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr93/tr93-018.ps.Z, 19930514 An unsymmetric-pattern multifrontal method for sparse LU factorization Timothy A. Davis Computer and Information Sciences Department University of Florida, Gainesville, Florida, USA Iain S. Duffy European Center for Research and Advanced Training in Scientific Computation (CERFACS) Toulouse, France
	ftp://wuarchive.wustl.edu/doc/techreports/ufl.edu/cs/tr93/tr93-009.ps.Z, 19930519 Gator: A Discrimination Network Structure for Active Database Rule Condition Matching Eric N. Hanson 301 CSE CIS Department University of Florida Gainesville, FL 32611 hanson@cis.ufl.edu April 7, 1993 UF-CIS-TR-93-009 (revised May 19, 1993)
	ftp://wuarchive.wustl.edu/doc/techreports/mcgill.ca/math/blute/topvec.ps.Z, 19930521 Linear Topology, Hopf Algebras and -Autonomous Categories Richard F. Blute McGill University Montreal, Quebec CANADA email address: blute@triples.math.mcgill.ca May 21, 1993
	ftp://wuarchive.wustl.edu/doc/techreports/arizona.edu/cs/1992/TR92-34.ps, 19930525 XIB: X-Icon Interface Builder Mary Cameron TR 92-34
	ftp://wuarchive.wustl.edu/doc/techreports/indiana.edu/cs/TR383.ps.Z, 19930528 Indiana University Computer Science Department Technical Report No. 383 An Example of Interactive Hardware Transformation Zheng Zhu and Steven D. Johnson May 1993 This paper was presented at the ACM/SIGDA Workshop on Formal Methods in VLSI design, Maimi, Florida, January 1991. Due to publication
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1993/wucs-93-26.ps.Z, 19930602 1 TRAINREC: A System for Training Feedforward & Simple Recurrent Networks Efficiently and Correctly Barry L. Kalman and Stan C. Kwasny WUCS-93-26 May 1993 This material is based upon work supported by the National Science Foundation under Grant No. IRI-9201987. 2 TRAINREC: A System for Training
	ftp://wuarchive.wustl.edu/doc/techreports/indiana.edu/cs/TR382.ps.Z, 19930604 Learning Noun and Adjective Meanings: A Connectionist Account Michael Gasser gasser@cs.indiana.edu Computer Science and Linguistics Departments Indiana University Bloomington, IN 47405, USA Linda B. Smith smith4@ucs.indiana.edu Psychology Department Indiana University Bloomington, IN 47405, USA
	ftp://wuarchive.wustl.edu/doc/techreports/arizona.edu/cs/1993/TR93-08.ps, 19930609 A Functional and Attribute Based Computational Model for Fault-Tolerant Software Masato Suzuki, Takuya Katayama,1 and Richard D. Schlichting TR 93-8
	ftp://wuarchive.wustl.edu/doc/techreports/indiana.edu/cs/TR384.ps.Z, 19930611 Learning Words in Time: Towards a Modular Connectionist Account of the Acquisition of Receptive Morphology Michael Gasser Computer Science and Linguistics Departments Indiana University Bloomington, IN, USA gasser@cs.indiana.edu June 10, 1993
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/92.reports/tr34.92.ps, 19930618 Software Engineering Discipline November 1992 Daniel M. Berry ESC-TR-92-034 Academic Legitimacy of the Technical Report CMU/SEI-92-TR-34 Technical Report CMU/SEI-92-TR-34 ESC-TR-92-034 November 1992 Academic Legitimacy of the Software Engineering Discipline hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh
	ftp://wuarchive.wustl.edu/doc/techreports/indiana.edu/cs/TR375.ps.Z, 19930621 indiana university computer science department technical report no. 375 Toward a Basis for Protocol Specification and Process Decomposition Kamlesh Rath and Steven D. Johnson june 1993 To appear in the proceedings of the 1993 IFIP Conference on Hardware Description Languages and their Applications (CHDL
	ftp://wuarchive.wustl.edu/doc/techreports/indiana.edu/cs/TR385.ps.Z, 19930621 indiana university computer science department technical report no. 385 Derivation of a DRAM Memory Interface by Sequential Decomposition Kamlesh Rath, Bhaskar Bose, and Steven D. Johnson june 1993 To appear in the proceedings of the 1993 IEEE International Conference on Computer Design (ICCD '93 ),
	ftp://wuarchive.wustl.edu/doc/techreports/arizona.edu/cs/1993_ABSTRACTS.ps, 19930622 Department of Computer Science Gould-Simpson Building Tucson, Arizona 85721 RL-32 July 1993 Technical Report List January - June 1993 Abstracts of technical reports available from our department are listed below. If you would like to receive a copy of any of these documents, return the form at the end
	ftp://wuarchive.wustl.edu/doc/techreports/arizona.edu/cs/1993/TR93-16.ps, 19930623 Interactive Displays for End-Users: A Pluto Tutorial Shamim P. Mohamed TR 93-16
	ftp://wuarchive.wustl.edu/doc/techreports/arizona.edu/cs/1993/TR93-15.ps, 19930629 An Abelian Theorem for Completely Monotone Functions Peter J. Downey TR 93-15
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1993/93-01b.ps.gz, 19930630 Lehrstuhl f ur Informatik III 1 Personal ffl Lehrstuhlinhaber: Prof. Dr.-Ing. M. Nagl ffl Sekretariat: A. Fleck M. Sch urr ffl Wissenschaftliche MitarbeiterInnen: Dipl.-Ing. V. Ba<=cvanski (Graduiertenstipendiat) Dipl.-Inform. M. von der Beeck (Esprit COMPLEMENT) Dipl.-Inform. J. B orstler Dipl.-Inform.
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1993/93-01a.ps.gz, 19930630 Jahresbericht 1992 der Fachgruppe Informatik in der Mathematisch-Naturwissenschaftlichen Fakult at der RWTH Aachen Herausgeber: Fachgruppe Informatik RWTH Aachen Ahornstr. 55 W-5100 Aachen Redaktion: H. Boll Druck: Fotodruck J. Mainz GmbH S usterfeldstr. 83, 5100 Aachen Inhalt Vorwort : : : : : : : : :
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1993/wucs-93-35.ps.Z, 19930630 A Unified Model for Shared-Memory and Message-Passing Systems Kenneth Goldman and Katherine Yelick WUCS-93-35 June 1993 Department of Computer Science Washington University Campus Box 1045 One Brookings Drive Saint Louis, MO 63130{4899 A Unified Model for Shared-Memory and Message-Passing Systems
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1993/wucs-93-14.ps.Z, 19930709 Clinical Decision-Support Systems in Radiation Therapy Nilesh L. Jain and Michael G. Kahn WUCS-93-14 Division of Medical Informatics Campus Box 8005 Washington University School of Medicine 660 S. Euclid Ave St. Louis MO 63110 Paper presented at the First International Symposium on 3D Radiation
	ftp://wuarchive.wustl.edu/doc/techreports/mcgill.ca/math/rags/fock/fock.ps.Z, 19930712 Holomorphic Models of Exponential Types in Linear Logic R.F. Blute Prakash Panangadeny R.A.G. Seelyz Department of Mathematics School of Computer Science Department of Mathematics McGill University Montreal, Quebec, H3A 2K6 June 29, 1993
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/91.reports/tr08.91.ps, 19930713
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/89.reports/tr13.89.ps, 19930715 Technical Report CMU/SEI-89-TR-13 ESD-TR-89-21 Ada Adoption Handbook: Compiler Evaluation and Selection Version 1.0 Nelson H. Weiderman March 1989 Ada Adoption Handbook: Compiler Evaluation and Selection Version 1.0 AB Approved for public release. Distribution unlimited. Software Engineering Institute
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/88.reports/tr21.88.ps, 19930715 Technical Report CMU/SEI-88-TR-21 ESD-TR-88-22 Experiment Transcripts for the Evaluation of the Rational Environment Grace Downey Mitchell Bassman, Computer Sciences Corporation Carl Dahlke, Computer Sciences Corporation September 1988 Experiment Transcripts for the Evaluation of the Rational
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1993/93-09.ps.Z, 19930728 Subsumption between Queries to Object-Oriented Databases Martin Buchheity Manfred A. Jeusfeldz Werner Nutty Martin Staudtz yGerman Research Center for Artificial Intelligence (DFKI), Stuhlsatzenhausweg 3, D-66123 Saarbr ucken, Germany, fbuchheit,nuttg@dfki.uni-sb.de zRWTH Aachen, Informatik V, Ahornstr.
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/93.reports/technical.review/carleton.ps, 19930728 SEI Technical Review 93 Measurement Definitions for DoD Systems: Recommendations for an Initial Core Set 36 Measurement Definitions for DoD Systems: SEI Technical Review 93 Recommendations for an Initial Core Set 35 Schultz, Herman P. Software Management Metrics (ESD-TR-88-001). Bedford,
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/93.reports/technical.review/brown.ps, 19930728 SEI Technical Review 93 Issues in the Definition and Use of a Project Support Environment Reference Model 26 Issues in the Definition and Use of a SEI Technical Review 93 Project Support Environment Reference Model 25 Alan Brown is a member of the technical staff, where he is researching integrated
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/93.reports/technical.review/chittister.ps, 19930803 SEI Technical Review 93 Risk Management in Practice 12 4 REFERENCES Boehm, B. Rapid Prototyping, Risk Management, 2167, and the Ada Process Model. Proceedings of the U.S. Army-AWIS Ada Symposium. TRW: Fairfax, Va.: September 1988. Brooks, F. P. No Silver Bullet: Essence and
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/93.reports/technical.review/sha.ps, 19930803 Facilitated Bidirectional Technology Transition SEI Technical Review 93 15 SEI Technical Review 93 Facilitated Bidirectional Technology Transition 14 Volz, R.; Sha, L.; & Wilcox, D. Maintaining Global Time in Futurebus+. Real-Time Systems Journal, 1991.
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1993/93-06.ps.Z, 19930804 Adaptable Pointer Swizzling Strategies in Object Bases: Design, Realization, and Quantitative Analysis Alfons Kempery Donald Kossmannz yLehrstuhl f ur Informatik zGraduiertenkolleg Informatik und Technik" Universit at Passau RWTH Aachen Innstr. 33 Ahornstr. 55 D{94032 Passau, F. R. G. D{52074 Aachen,
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/93.reports/technical.review/master.ps, 19930805 SEI Technical Review 93 Risk Management in Practice 14 About the Authors Clyde Chittister is director of the Software Risk Management Program, whose focus is to develop and transition a set of methods that enhances a project's ability to identify and analyze software technical risks. Robert Kirkpatrick
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/91.reports/tr13.91.ps, 19930810
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/88.reports/files.without.figures/sr04.88.ps, 19930810 Special Report CMU/SEI-88-SR-4 The Priority Ceiling Protocol: A Method for Minimizing the Blocking of High-Priority Ada Tasks John B. Goodenough Lui Sha March 1988 Special Report CMU/SEI-88-SR-4 March 1988 The Priority Ceiling Protocol: A Method for Minimizing the Blocking of High-Priority Ada Tasks AB
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/91.reports/tr18.91.ps, 19930810
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/er-93-01.ps.Z, 19930810 Goal-Driven Learning: Fundamental Issues and Symposium Report David Leake Computer Science Department Indiana University Bloomington, Indiana 47405 (812) 855-9756 E-mail: leake@moose.cs.indiana.edu Ashwin Ram College of Computing Georgia Institute of Technology Atlanta, Georgia 30332-0280 (404) 853-9372
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/er-93-03.ps.Z, 19930810 Proceedings of the Second International Workshop on Multistrategy Learning, Harpers Ferry, WV, May 1993. A Multistrategy Case-Based and Reinforcement Learning Approach to Self-Improving Reactive Control Systems for Autonomous Robotic Navigation Ashwin Ram and Juan Carlos Santamar a College of Computing
	ftp://wuarchive.wustl.edu/doc/techreports/arizona.edu/cs/1993/TR93-23.ps, 19930810 FT-SR: A PROGRAMMING LANGUAGE FOR CONSTRUCTING FAULT-TOLERANT DISTRIBUTED SYSTEMS (Ph.D. Dissertation) Vicraj Timothy Thomas TR 93-23 August 9, 1993 Department of Computer Science The University of Arizona Tucson, Arizona 85721 This work was supported in part by the National Science Foundation under
	ftp://wuarchive.wustl.edu/doc/techreports/indiana.edu/cs/TR389.ps.Z, 19930811 indiana university computer science department technical report no. 389 Behavior Tables: A Basis for System Representation and Transformational System Synthesis Kamlesh Rath, M. Esen Tuna, and Steven D. Johnson august 1993 To appear in the proceedings of the 1993 IEEE/ACM International Conference on
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/others/pallet.ps.Z, 19930819 New Approaches to the Pallet Loading Problem Josef Nelissen1 Lehrstuhl f ur Angewandte Mathematik, insbesondere Informatik RWTH Aachen 52056 Aachen Germany August 19, 1993 1e-mail: jonas@beor.informatik.rwth-aachen.de
	ftp://wuarchive.wustl.edu/doc/techreports/uky.edu/cs/235-93.ps.Z, 19930825 Service Rebalancing Eric H. Herrin II Raphael A. Finkel Technical Report Number 235-93 May 12, 1993 915 Patterson Office Tower Department of Computer Science University of Kentucky Lexington, Kentucky 40506 eric@ms.uky.edu, raphael@ms.uky.edu
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1993/wucs-93-19.ps.Z, 19930827 Approximation Algorithms for Configuring Hierarchical Nonblocking Communication Networks J. Andrew Fingerhut wucs-93-19 August 26, 1993 Department of Computer Science Campus Box 1045 Washington University One Brookings Drive St. Louis, MO 63130-4899
	ftp://wuarchive.wustl.edu/doc/techreports/arizona.edu/cs/1993/TR93-28.ps, 19930831 DISCRETE PATTERN MATCHING OVER SEQUENCES AND INTERVAL SETS (Ph.D. Dissertation) James Robert Knight TR 93-28 August 31, 1993 Department of Computer Science The University of Arizona Tucson, Arizona 85721 This research was supported in part by the National Institute of Health under Grant R01 LM04960, by
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1993/wucs-93-22.ps.Z, 19930903 WASHINGTON UNIVERSITY IN ST LOUIS Washington School of Engineering & Applied Science Saint Louis, MO 63130-4899One Brookings DriveCampus Box 1045Washington UniversityDepartment of Computer Science Printed June 30, 1993 A Taxonomy of Program Visualization Systems Gruia-Catalin Roman Kenneth C. Cox
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/92.reports/tr07.92.ps, 19930907
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/91.reports/tr28.91.ps, 19930907
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1993/wucs-93-37.part3.ps.Z, 19930908 Analysis of an Improved Distributed Checkpointing Algorithm 1 Sachin Garg Kenneth F. Wong sachin@wuccrc.wustl.edu kenw@wuccrc.wustl.edu Computer and Communications Research Center Washington University One Brookings Drive, Campus Box 1115 St. Louis, Missouri 63130 1 Introduction The possibility of
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1993/wucs-93-37.part1.ps.Z, 19930908 Analysis of an Improved Distributed Checkpointing Algorithm Sachin Garg Kenneth F. Wong WUCS-93-37 June 1993 Department of Computer Science Washington University Campus Box 1045 One Brookings Drive St. Louis, MO 63130-4899
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1993/wucs-93-37.part2.ps.Z, 19930908 Design of a Low-Overhead Distibuted Checkpointing Algorithm Sachin Garg Kenneth F. Wong sachin@wuccrc.wustl.edu kenw@wuccrc.wustl.edu Computer and Communications Research Center Washington University One Brookings Drive, Campus Box 1115 St. Louis, Missouri 63130 Submitted to Fifth IEEE Symposium on
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/math/papers/alttasp.ps.Z, 19930909 Adapted Local Trigonometric Transforms and Speech Processing Eva Wesfreid1 Mladen Victor Wickerhauser2 1CEREMADE, Universit e Paris IX-Dauphine 2Department of Mathematics, Washington University in St. Louis 1 Introduction In this communication we apply an algorithm, based on the local trigonometric
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/math/papers/rovinj.ps.Z, 19930913 Wavelet approximations to Jacobians and the inversion of complicated maps Mladen Victor Wickerhauser Department of Mathematics Washington University in St. Louis Missouri 63130 USA September 13, 1993
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/er-93-07.ps.Z, 19930917 Proceedings of the ML-93 Workshop on Knowledge Compilation and Speedup Learning, Amherst, MA, June 1993. Knowledge Compilation and Speedup Learning in Continuous Task Domains Juan Carlos Santamar a College of Computing Georgia Institute of Technology Atlanta, Georgia 30332-0280 carlos@cc.gatech.edu
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/er-93-06.ps.Z, 19930917 To appear in the Proceedings of the Workshop on Knowledge Compilation and Speedup Learning (KCSL 93), June 30, 1993 Computational Models of the Utility Problem and their Application to a Utility Analysis of Case-Based Reasoning Anthony G. Francis, Jr. Ashwin Ram College of Computing Georgia Institute of
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/er-93-05.ps.Z, 19930917 Proceedings of the AAAI-93 Workshop on Case-Based Reasoning, pp. 86 93, Washington, DC, July 1993. Continuous Case-Based Reasoning Ashwin Ram and Juan Carlos Santamar a College of Computing Georgia Institute of Technology Atlanta, Georgia 30332-0280 fashwin,carlosg@cc.gatech.edu
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/93.reports/tr06.93.ps, 19930920
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/93.reports/tr05.93.ps, 19930920
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/93.reports/tr02.93.ps, 19930920 Technical Report CMU/SEI-93-TR-2 ESC-TR-93-179 Distributed Real-Time System Design: Theoretical Concepts and Applications Lui Sha Shirish S. Sathaye March 1993 Technical Report CMU/SEI-93-TR-2 ESC-TR-93-179 March 1993 Distributed Real-Time System Design: Theoretical Concepts and Applications AB Lui Sha
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1993/wucs-93-23.ps.Z, 19930922 Asking Questions to Minimize Errors Nader H. Bshouty Department of Computer Science The University of Calgary 2500 University Drive N.W. Calgary, Alberta, Canada T2N 1N4 bshouty@cpsc.ucalgary.ca Sally A. Goldman Department of Computer Science Washington University St. Louis, MO 63130 sg@cs.wustl.edu
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1993/wucs-93-45.ps.Z, 19930929 Supervised Competitive Learning Thomas H. Fuller, Jr. and Takayuki D. Kimura, WUCS-93-45 Reprinted from Journal of Intelligent Material Systems and Structures (pages xx-xx) October 1993 Department of Computer Science Washington University Campus Box 1045 One Brookings Drive St. Louis, MO 63130-4899 This
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1993/wucs-93-44.ps.Z, 19930929 Supervised Competitive Learning Part II: SCL with Fuzzy Logic Ce Wang, Takayuki D. Kimura, and Thomas H. Fuller, Jr. WUCS-93-44 Reprinted from Intelligent Engineering through Artificial Neural Networks, Volume 2. New York: ASME Press, 1992. Editor: C. Dagli et al. (pages 351-356) November 1992
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1993/wucs-93-15.part1.ps.Z, 19930929 WASHINGTON UNIVERSITY IN ST LOUIS Washington School of Engineering & Applied Science Saint Louis, MO 63130-4899One Brookings DriveCampus Box 1045Washington UniversityDepartment of Computer Science Printed 9/3/93 A Characterization of the Computational Power of Rule-based Visualization Kenneth C. Cox
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1993/wucs-93-15.part2.ps.Z, 19930929 11 given is an input space and some set X S . For each x X we wish to produce a fact function_name(s,f(s)). The function has the form: f(s) = b(s) if s B h(f(g(s))) otherwise (1) Here B S and b : B fi V, g : S fi S, and h : V fi V. Thus, if s B the value of f(s) is b(s); otherwise, we evaluate g(s) to
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1993/wucs-93-43.ps.Z, 19930929 Supervised Competitive Learning Part I: SCL with Backpropagation Networks Thomas H. Fuller, Jr. and Takayuki D. Kimura WUCS-93-43 Reprinted from Intelligent Engineering through Artificial Neural Networks, Volume 2. New York: ASME Press, 1992. Editor: C. Dagli et al. (pages 185-190) November 1992
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1993/wucs-93-15.part3.ps.Z, 19930929 state space animation space intermediate spaces current
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1993/wucs-93-16.ps.Z, 19930930 The N-Body Problem: Distributed System Load Balancing And Performance Evaluation12 Mark Franklin Vasudha Govindan jbf@random.wustl.edu vasu@wuccrc.wustl.edu Computer and Communications Research Center Washington University Campus Box 1115 One Brookings Drive St. Louis, Missouri 63130 1 Introduction In
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1993/wucs-93-01.part1.ps.Z, 19930930 The Washington University Multimedia System WILLIAM D. RICHARD1,JEROME R. COX, Jr.,2,3 BRIAN L. GOTTLIEB1,2,3,AND KEN KRIEGER1,3 Washington University in St. Louis 1Department of Electrical Engineering 2Department of Computer Science 3Electronic Radiology Laboratory One Brookings Drive St. Louis,
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1993/wucs-93-36.part1.ps.Z, 19931001 Distributed Computing Systems and Checkpointing Ken Wong Mark Franklin WUCS-93-36 July 1993 Department of Computer Science Washington University Campus Box 1045 One Brookings Drive St. Louis, MO 63130-4899 Distributed Computing Systems and Checkpointing Ken Wong and Mark Franklin The Computer and
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1993/wucs-93-36.part2.ps.Z, 19931001 Distributed Computing Systems and Checkpointing* Ken Wong and Mark Franklin The Computer and Communications Research Center Washington University, St. Louis, MO 63130
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1993/wucs-93-48.ps.Z, 19931001 DNA Mapping Algorithms: Synchronized Double Digest Mapping Jim Daues Will Gillett WUCS-93-48 September 1993 DEPARTMENT OF COMPUTER SCIENCE WASHINGTON UNIVERSITY Saint Louis, Missouri 63130 (314) 935-6160 This work was supported by the James S. McDonnell Foundation under Grant 87-24 and NIH under grant
	ftp://wuarchive.wustl.edu/doc/techreports/mcgill.ca/math/reyes/cognitio.ps, 19931004 10 Category Theory as a Conceptual Tool in the Study of Cognition Fran cois Magnan and Gonzalo E. Reyes 1. Introduction The aim of this paper is to introduce category theory as a conceptual tool in the study of cognition. We believe that category theory has several advantages over set theory as a guide
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1993/wucs-93-47.ps.Z, 19931005 OPTIMAL NONBLOCKING MULTIPOINT VIRTUAL CIRCUIT SWITCHING Jonathan S. Turner Computer Science Department Washington University, St. Louis wucs-93-47 September 25, 1993 Department of Computer Science Campus Box 1045 Washington University One Brookings Drive St. Louis, MO 63130-4899
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1993/wucs-93-50.ps.Z, 19931005 DNA Mapping Algorithms: Fragment Matching Mistake Detection and Correction Jim Daues Will Gillett WUCS-93-50 October 1993 DEPARTMENT OF COMPUTER SCIENCE WASHINGTON UNIVERSITY Saint Louis, Missouri 63130 (314) 935-6160 This work was supported by the James S. McDonnell Foundation under Grant 87-24 and NIH
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/92.reports/technical.review/kirkpatrick.ps, 19931006 30 Draft 1992 SEI Technical Review Rowe, W. D. An Anatomy of Risk, Malabar, Florida: Robert E. Krieger Publishing Company, 1988. 1992 SEI Technical Review Draft 29 References Military Standard, Defense System Software Development. February 29, 1988, DOD-STD-2167A. Boehm, B.
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1993/wucs-93-02.ps.Z, 19931006 Teaching a Smarter Learner Sally A. Goldman Department of Computer Science Washington University St. Louis, MO 63130 sg@cs.wustl.edu H. David Mathias Department of Computer Science Washington University St. Louis, MO 63130 dmath@cs.wustl.edu September 1993 WUCS-93-02
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/92.reports/technical.review/brown.ps, 19931006 50 Draft 1992 SEI Technical Review ADC89 Software Maintencance & Development Systems, Inc. Aide-De-Camp Software Management System, Product Overview. Concord, MA, 1989. Teitelman81 Teitelman, W. and Masinter, L. The Interlisp Programming Environment. IEEE Computer, 14, 4, April 1981, 25-33. Thomas89
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/92.reports/technical.review/christel.ps, 19931006 32 Draft 1992 SEI Technical Review 1992 SEI Technical Review Draft 31 Authorization Act for Fiscal Year 1991. Senate Report 101-384, United States Senate, Washington, DC, 1990. Waterworth85 Waterworth, J.A., & Thomas, C.M. Why is Synthetic Speech Harder to Remember Than Natural Speech CHI Proceedings,
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/92.reports/technical.review/paulk.ps, 19931006 30 Draft 1992 SEI Technical Review Radice85 R.A. Radice, J.T. Harding, P.E. Munnis, and R.W. Phillips, A Programming Process Study, IBM Systems Journal, 24, 2, 1985. Siegel90 J.A.L. Siegel, et al., National Software Capacity: Near-Term Study, Software Engineering Institute, CMU/SEI-90-TR-12, DTIC:
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1993/wucs-93-20.part2.ps.Z, 19931007 Improving the Speed of A Distributed Checkpointing Algorithm Sachin Garg Kenneth F. Wong sachin@wuccrc.wustl.edu kenw@wuccrc.wustl.edu Computer and Communications Research Center Washington University One Brookings Drive, Campus Box 1115 St. Louis, Missouri 63130
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1993/wucs-93-20.part1.ps.Z, 19931007 Improving the Speed of A Dis- tributed Checkpointing Algorithm Sachin Garg Kenneth F. Wong WUCS-93-20 April 1993 Department of Computer Science Washington University Campus Box 1045 One Brookings Drive St. Louis, MO 63130-4899 Improving the Speed of A Distibuted Checkpointing Algorithm Sachin Garg
	ftp://wuarchive.wustl.edu/doc/techreports/mcgill.ca/math/rags/wk_dist_cat/wkdist.ps.Z, 19931012 Weakly distributive categories J.R.B. Cockett R.A.G. Seelyy
	ftp://wuarchive.wustl.edu/doc/techreports/arizona.edu/cs/1993/TR93-31.ps, 19931019 Unifying Temporal Data Models via a Conceptual Model Christian S. Jensen1 Michael D. Soo2 Richard T. Snodgrass2 TR 93-31 September 20, 1993
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1993/93-10.ps.gz, 19931022 Pushdown Processes: Parallel Composition and Model Checking Olaf Burkart Lehrstuhl f ur Informatik II RWTH Aachen Ahornstrasse 55 52056 Aachen Germany Bernhard Steffeny Fakult at f ur Mathematik und Informatik Universit at Passau Innstrasse 33 Postfach 2540 94032 Passau Germany Keywords: infinite-state
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/93.reports/tr15.93.ps, 19931022 Technical Report CMU/SEI-93-TR-15 ESC-TR-93-192 An Investigation into the State of the Practice of CASE Tool Integration Jock Rader Alan W. Brown Ed Morris August 1993 Software Engineering Institute Carnegie Mellon University Pittsburgh, Pennsylvania 15213 Approved for public release. Distribution
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/93.reports/tr04.93.ps, 19931022
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1993/93-14.ps.gz, 19931026 ConceptBase - A Deductive Object Base Manager Matthias Jarke, Stefan Eherer, Rainer Gallersd orfer Manfred A. Jeusfeld, Martin Staudt Informatik V, RWTH Aachen, Ahornstr. 55, D-52056 Aachen, Germany fjarke,eherer,gallersd,jeusfeld,staudtg@informatik.rwth-aachen.de
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1993/93-05.ps.gz, 19931026 1 A Heuristic for the Subgraph Isomorphism Problem in Executing PROGRES Albert Z ndorf1 Department of Computer Science III Aachen University of Technology Ahornstra e 55, 52074 Aachen, Germany e-mail: albert@i3.informatik.rwth-aachen.de phone: ++49/+241/80-21312 fax: ++49/+241/80-21329
	ftp://wuarchive.wustl.edu/doc/techreports/arizona.edu/cs/1993/TR93-33.ps, 19931102 DEPARTMENT OF COMPUTER SCIENCE Finding Similar Files in a Large File System Udi Manber TR 93-33 October 1993 To appear in the 1994 Winter USENIX Technical Conference FINDING SIMILAR FILES IN A LARGE FILE SYSTEM Udi Manber1 Department of Computer Science University of Arizona Tucson, AZ 85721
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1993/93-13.ps.gz, 19931103 On Syntactic Congruences for ! languages Oded Malery Verimag Miniparc ZIRST 38330 Montbonnot France Oded.Maler@imag.fr Ludwig Staigerz RWTH Aachen Lehrstuhl f ur Informatik II Ahornstr. 55 D-52056 Aachen Germany staiger@zeus.informatik.rwth-aachen.de A preliminary version of this paper appeared in:
	ftp://wuarchive.wustl.edu/doc/techreports/uky.edu/cs/qddb.ps.Z, 19931112 An ASCII Database for Fast Queries of Relatively Stable Data Appears in Computing Systems, Volume 4 Number 2 Copyright 1991 by The Regents of the University of California Eric H. Herrin II Raphael Finkel September, 1990
	ftp://wuarchive.wustl.edu/doc/techreports/indiana.edu/cs/TR391.ps.Z, 19931117 On Lower Bounds for the Matrix Chain Ordering Problem Phillip G. Bradfordy Venkatesh Choppellaz Gregory J. E. Rawlinsx November 17, 1993
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1993/93-15.ps.gz, 19931122 Query by Class, Rule and Concept Martin Staudt Hans W. Nissen Manfred A. Jeusfeld Informatik V, RWTH Aachen, Ahornstr. 55, 52056 Aachen, Germany fstaudt,nissen,jeusfeldg@informatik.rwth-aachen.de
	ftp://wuarchive.wustl.edu/doc/techreports/mcgill.ca/math/pavlovic/mapsI-A4.ps.Z, 19931123 Maps I: relative to a factorisation system Du<=sko Pavlovi c
	ftp://wuarchive.wustl.edu/doc/techreports/indiana.edu/cs/TR387.ps.Z, 19931201 Backtracking and Probing Paul Walton Purdom, Jr., Indiana University G. Neil Haven, Indiana University Partial support provided by NSF Grant CCR 92-03942.
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/mimi/er-mr-93-03.ps, 19931202 Explorations in the Parameter Space of a Model Fit to Individual Subjects' Strategies while Learning from Instructions Margaret M. Recker College of Computing Georgia Institute of Technology Atlanta, Georgia 30332 (404) 894-9218 email: mimi@cc.gatech.edu
	ftp://wuarchive.wustl.edu/doc/techreports/mcgill.ca/math/pavlovic/chu-US.ps.Z, 19931212 The Chu construction and cofree models of classical linear logic Du<=sko Pavlovi c
	ftp://wuarchive.wustl.edu/doc/techreports/mcgill.ca/math/pavlovic/chu-A4.ps.Z, 19931212 The Chu construction and cofree models of classical linear logic Du<=sko Pavlovi c
	ftp://wuarchive.wustl.edu/doc/techreports/arizona.edu/cs/1993/TR93-27.ps, 19931214 Representing Type Information in Dynamically Typed Languages David Gudeman gudeman@cs.arizona.edu Department of Computer Science Gould-Simpson Building The University of Arizona Tucson, AZ 85721, USA TR 93-27 October 1993
	ftp://wuarchive.wustl.edu/doc/techreports/arizona.edu/cs/1993/TR93-26.ps, 19931214 Performance Experiments for the Filaments Package David K. Lowenthal Dawson R. Engler TR 93-26 Performance Experiments for the Filaments Package1 David K. Lowenthal Dawson R. Engler TR 93-26
	ftp://wuarchive.wustl.edu/doc/techreports/indiana.edu/cs/TR392.ps.Z, 19931215 indiana university computer science department technical report no. 392 An Introduction to Behavior Tables Kamlesh Rath, M. Esen Tuna, and Steven D. Johnson december 1993 An Introduction to Behavior Tables Kamlesh Rath, M. Esen Tuna, Steven D. Johnson Indiana University Computer Science Department
	ftp://wuarchive.wustl.edu/doc/techreports/indiana.edu/cs/TR388.ps.Z, 19940103 Higher Order Logic Daniel Leivant Contents 1 Introduction : : : : : : : : : : : : : : : : : : : : : : : : : : : : 2 2 The expressive power of second order Logic : : : : : : : : : : : 3 2.1 The language of second order logic : : : : : : : : : : : : : 3 2.2 Expressing size : : : : : : : : : : : : : : : :
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/cox/Papers/git-cc-93-67.ps.Z, 19940105 Learning to troubleshoot: Multistrategy learning of diagnostic knowledge for a real-world problem solving task Ashwin Ram, College of Computing, Georgia Tech S. Narayanan, School of Industrial and Systems Engineering, Georgia Tech Michael T. Cox, College of Computing, Georgia Tech
	ftp://wuarchive.wustl.edu/doc/techreports/indiana.edu/cs/TR390.ps.Z, 19940107 Dynamic Statistics of Sequential Prolog Ignacio Celis and Jonathan W. Mills Computer Science Dept. Indiana University Lindley Hall 215 Bloomington, IN 47405 e-mail: {celisi, jwmills}@cs.indiana.edu phone (812)-857-7038 Keywords: Implementations and Architectures
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1993/93-21.ps.gz, 19940111 THREE ASPECTS OF INTELLIGENT COOPERATION IN THE QUALITY CYCLE1 MATTHIAS JARKE , MANFRED A. JEUSFELD, PETER SZCZURKO Informatik V, RWTH Aachen Ahornstr. 55, 52056 Aachen, Germany The WibQuS project investigates distributed computer and communication support for Total Quality Management in industrial
	ftp://wuarchive.wustl.edu/doc/techreports/indiana.edu/cs/TR345.ps.Z, 19940111 The Revised Report on the Syntactic Theories of Sequential Control and State Matthias Felleisen Department of Computer Science Rice University Houston, TX 77251-1892 Robert Hieb Computer Science Department Indiana University Bloomington, IN 47405 Rice University Technical Report # 100-89 to appear in:
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/er-93-09.ps.Z, 19940128 Informatica 17(4) pages 347{369, 1993 1 MULTISTRATEGY LEARNING IN REACTIVE CONTROL SYSTEMS FOR AUTONOMOUS ROBOTIC NAVIGATION Ashwin Ram and Juan Carlos Santamar a College of Computing, Georgia Institute of Technology, Atlanta, Georgia 30332-0280, U.S.A. Keywords: Robot navigation, reactive control,
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/93.reports/tr12.93.ps, 19940201 Technical Report CMU/SEI-93-TR-12 ESC-TR-93-189 AMORE: The Advanced Multimedia Organizer for Requirements Elicitation Michael G. Christel David P. Wood Scott M. Stevens June 1993 Software Engineering Institute Carnegie Mellon University Pittsburgh, Pennsylvania 15213 Approved for public release.
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/93.reports/tr29.93.ps, 19940202 Technical Report CMU/SEI-93-TR-29 ESC-TR-93-203 Technology Transition Push: A Case Study of Rate Monotonic Analysis (Part 1) Priscilla Fowler Linda Levine December 1993 Software Engineering Institute Carnegie Mellon University Pittsburgh, Pennsylvania 15213 Approved for public release. Distribution un
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1994/wucs-94-03.ps.Z, 19940203 Speculative Computation: Overcoming Communication Delays in Parallel Algorithms Vasudha Govindan Mark A. Franklin vasu@wuccrc.wustl.edu jbf@random.wustl.edu Computer & Communications Research Center Washington University Campus Box 1115, One Brookings Drive St. Louis, Missouri 63130
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/93.reports/tr13.93.ps, 19940209
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/others/Hammill.a4.ps.Z, 19940214 The Peter Hammill Book Version 1.4 2 This is a collection of short stories, lyrics, poems and drawings by Peter Hammill. Most of the stories, poems and drawings were taken from Killers, Angels, Refugees" and Mirrors, Dreams, and Miracles". This book will always be a few inches away from being
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/others/Hammill.letter.ps.Z, 19940214 The Peter Hammill Book Version 1.4 2 This is a collection of short stories, lyrics, poems and drawings by Peter Hammill. Most of the stories, poems and drawings were taken from Killers, Angels, Refugees" and Mirrors, Dreams, and Miracles". This book will always be a few inches away from being
	ftp://wuarchive.wustl.edu/doc/techreports/indiana.edu/cs/TR399.ps.Z, 19940225 A Formalization of the Turing Test Phillip G. Bradford and Michael Wollowski (812) 855-2136 Indiana University Department of Computer Science 215 Lindley Hall Bloomington, Indiana 47405 f bradford, wollowsk g@cs.indiana.edu February 1994
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1994/94-02.ps.gz, 19940226 - 1 - Development of Incremental Integration Tools Using Formal Specifications Martin Lefering Lehrstuhl f r Informatik III, RWTH Aachen Ahornstr. 55, 52074 Aachen martin@i3.informatik.rwth-aachen.de
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/eiselt/er-km-93-01.ps.Z, 19940228 In AAAI-93: Proceedings of the Eleventh National Conference on Artificial Intelligence, July 11-15, 1993, Washington, DC, pp 380-385. Having Your Cake and Eating It Too: Autonomy and Interaction in a Model of Sentence Processing Kurt P. Eiselt College of Computing Georgia Institute of Technology
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/er-92-06.ps.Z, 19940228 AN EXPLICIT REPRESENTATION OF FORGETTING Michael T. Cox and Ashwin Ram College of Computing Georgia Institute of Technology, Atlanta, GA 30332-0280 email: cox@cc.gatech.edu; ashwin@cc.gatech.edu
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/93.reports/tr19.93.ps, 19940302 Technical Report CMU/SEI-93-TR-19 ESC-TR-93-318 An Ada Binding to the SAFENET Lightweight Application Services B. Craig Meyers Gary Chastek December 1993 Technical Report CMU/SEI-93-TR-19 ESC-TR-93-318 December 1993 An Ada Binding to the SAFENET Lightweight Application Services AB B. Craig Meyers Gary
	ftp://wuarchive.wustl.edu/doc/techreports/arizona.edu/cs/1993/TR93-04.ps, 19940309 Cache and TLB Effectiveness in the Processing of Network Data Michael A. Pagels Peter Druschel Larry L. Peterson1 TR 93 04
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/eleni/aid-askjef.ps.Z, 19940310 ASKJEF: INTEGRATION OF CASE-BASED AND MULTIMEDIA TECHNOLOGIES FOR INTERFACE DESIGN SUPPORT JOHN BARBER , SAMBASIVA BHATTA , ASHOK GOEL , MARK JACOBSON , MICHAEL PEARCE , LOUISE PENBERTHY , MURALI SHANKAR , ROBERT SIMPSON and ELENI STROULIA Human Interface Technology Center NCR Corporation 500 Tech
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/math/papers/htrunc.ps.Z, 19940311 TRUNCATIONS OF THE HILBERT TRANSFORM Loukas Grafakos Washington University
	ftp://wuarchive.wustl.edu/doc/techreports/indiana.edu/cs/TR349.ps.Z, 19940323 MERGING INTERACTIVE, MODULAR, AND OBJECT-ORIENTED PROGRAMMING Sho-Huan Simon Tung Submitted to the faculty of the Graduate School in partial fulfillment of the requirements for the degree Doctor of Philosophy in the Department of Computer Science Indiana University This material is based on work
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/bhatta/umil-aaai92-ws.ps.Z, 19940327 Use of Mental Models for Constraining Index Learning in Experience-Based Design Sambasiva R. Bhatta and Ashok K. Goel College of Computing Georgia Institute of Technology Atlanta, GA 30332-0280 bhatta@cc.gatech.edu, goel@cc.gatech.edu In Procs. of the AAAI-92 workshop on Constraining Learning with
	ftp://wuarchive.wustl.edu/doc/techreports/indiana.edu/cs/TR402.ps.Z, 19940330 INDIANA UNIVERSITY COMPUTER SCIENCE DEPARTMENT TECHNICAL REPORT NO. 402 Analyzing Data-structure Movements in Message-Passing Programs Sekhar R. Sarukkai Recom Technologies, MS 269-3, NASA Ames Research Center, Moffett Field, CA 94035-1000 email: sekhar@kronos.arc.nasa.gov phone: (415) - 604 - 4242
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1994/wucs-94-06.ps.Z, 19940331 An Incremental Distributed Algorithm for Computing Biconnected Components Bala Swaminathan Kenneth J. Goldman WUCS-94-6 March 1994 Department of Computer Science Washington University Campus Box 1045 One Brookings Drive Saint Louis, MO 63130{4899 An Incremental Distributed Algorithm for Computing
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/doug/making_a_clean_sweep__behavior_based_vacuuming.ps.Z, 19940404 Making a Clean Sweep: Behavior Based Vacuuming Douglas C. MacKenzie Tucker R. Balch Mobile Robot Laboratory College of Computing Georgia Institute of Technology Atlanta, Georgia 30332-0280 U.S.A. doug@cc.gatech.edu Position Paper for AAAI Fall Symposium, Instantiating Real-World Agents I. Introduction
	ftp://wuarchive.wustl.edu/doc/techreports/indiana.edu/cs/TR405.ps.Z, 19940405 Technical Report No. 405 Interaction of Formal Design Systems in the Development of a Fault-Tolerant Clock Synchronization Circuit1 Paul S. Miner2 Shyamsundar Pullela Steven D. Johnson Indiana University Computer Science Department Bloomington, IN 47405-4101 April 1994 1Research reported herein was
	ftp://wuarchive.wustl.edu/doc/techreports/mcgill.ca/math/otto/c-docs/k-ls-p.ps.Z, 19940406 Kalmar, Linear Space, and P J. Otto Department of Mathematics McGill University otto@math.mcgill.ca August 12, 1993 April 6, 1994
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1993/wucs-93-29.ps.Z, 19940407 The Programmers' Playground: I/O Abstraction for Heterogeneous Distributed Systems Kenneth J. Goldman, Michael D. Anderson and Bala Swaminathan WUCS-93-29 June 1993 (supersedes WUCS-92-32, revised 2/94) Department of Computer Science Washington University Campus Box 1045 One Brookings Drive Saint Louis,
	ftp://wuarchive.wustl.edu/doc/techreports/mcgill.ca/math/pavlovic/4c-US.ps.Z, 19940410 A categorical setting for the 4-Colour Theorem Du<=sko Pavlovi c Department of Mathematics and Statistics, McGill University Montreal, Quebec, Canada H3A 2K6 e-mail: pavlovic@triples.math.mcgill.ca
	ftp://wuarchive.wustl.edu/doc/techreports/mcgill.ca/math/pavlovic/4c-A4.ps.Z, 19940410 A categorical setting for the 4-Colour Theorem Du<=sko Pavlovi c Department of Mathematics and Statistics, McGill University Montreal, Quebec, Canada H3A 2K6 e-mail: pavlovic@triples.math.mcgill.ca
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/94.reports/tr03.94.ps, 19940411
	ftp://wuarchive.wustl.edu/doc/techreports/mcgill.ca/math/pavlovic/mapsII-US.ps.Z, 19940412 Maps II: Chasing diagrams in categorical proof theory Du<=sko Pavlovi c Dedicated to Jim Lambek in friendship and admiration
	ftp://wuarchive.wustl.edu/doc/techreports/mcgill.ca/math/pavlovic/mapsII-A4.ps.Z, 19940412 Maps II: Chasing diagrams in categorical proof theory Du<=sko Pavlovi c Dedicated to Jim Lambek in friendship and admiration
	ftp://wuarchive.wustl.edu/doc/techreports/mcgill.ca/math/otto/c-docs/linti.ps.Z, 19940416 The linear time hierarchy ( 0) via tiers and monoidal categories J. Otto Department of Mathematics McGill University 805 Sherbrooke Street West Montreal, Quebec, Canada H3A 2K6 otto@math.mcgill.ca December 7, 1993 April 16, 1994 1 Introduction We find the functions computable in linear time among the
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1994/wucs-94-10.ps.Z, 19940418 Visual Specification of Interprocess and Intraprocess Communication T. Paul McCartney and Kenneth J. Goldman WUCS-94-10 April 1994 Department of Computer Science Washington University Campus Box 1045 One Brookings Drive Saint Louis, MO 63130{4899 Visual Specification of Interprocess and Intraprocess
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/cox/Www/csgsc-t-page.ps, 19940419 Proceedings of the 1994 Cognitive Science Graduate Student Conference (CSGSC-94) April 21-22, 1994 Steering Committee Michael T. Cox (Chair) Angel Cabrera (CogSci Student Coordinator) Andy Edmonds (Psychology Student Liaison) Kenneth Moorman (AI Student Liaison) Jim Sawyer (CHMSR Student Liaison)
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1994/wucs-94-09.ps.Z, 19940503 An Evaluation of the Pavane Visualization System Kenneth C. Cox Gruia-Catalin Roman WUCS-94-09 April 1994 Submitted to the 1994 IEEE Workshop on Visual Languages. WASHINGTON UNIVERSITY IN ST LOUIS Washington 1
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/cox/Www/csgsc-proc.ps.Z, 19940505 Contents 1 Auditory Cues for Information Display: Merging Two Auditory Interface Techniques Michael C. Albers 1 2 Creativity in Analogical Design: A Model-Based Approach Sambasiva R. Bhatta 2 3 Situated Action Meets Symbol Processing and Both Win Mike Byrne 5 4 Cognitive Psychodynamics: The Timing of
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/cox/Www/brochure.ps, 19940507 4:00-4:20 Integrating Learning, Planning, and Acting Juan Santamar a in Continuous Domains 4:20-4:40 The Representation of Motion in Object and Alan Kersten Event Categories 4:40-5:00 Theory Based Representation: A FrameTodd W. Griffith work for Modeling Conceptual Change Session V: Reception I
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/92.reports/tr13.92.ps, 19940510
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1994/94-07.ps.gz, 19940510 INTEGRATING MODELS OF QUALITY MANAGEMENT METHODS BY AN OBJECT-ORIENTED REPOSITORY Peter Peters, Peter Szczurko Informatik V RWTH Aachen 52056 Aachen Germany
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1994/94-12.ps.gz, 19940513 -1- Aachener Informatik-Berichte AIB 94-12 Specification of Graph Translators with Triple Graph Grammars Andy Sch rr Lehrstuhl f r Informatik III, RWTH Aachen, Ahornstr. 55, D-52074 Aachen e-mail: andy@i3.informatik.rwth-aachen.de
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1994/94-11.ps.gz, 19940513 -1- Aachener Informatik-Berichte AIB 94-11 PROGRES, A Visual Language and Environment for PROgramming with Graph REwriting Systems Andy Sch rr Lehrstuhl f r Informatik III, RWTH Aachen, Ahornstr. 55, D-52074 Aachen e-mail: andy@i3.informatik.rwth-aachen.de
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1994/94-13.ps.gz, 19940513 -1- Aachener Informatik-Berichte AIB 94-13 Logic Based Programmed Structure Rewriting Systems Andy Sch rr Lehrstuhl f r Informatik III, RWTH Aachen, Ahornstr. 55, D-52074 Aachen e-mail: andy@i3.informatik.rwth-aachen.de
	ftp://wuarchive.wustl.edu/doc/techreports/indiana.edu/cs/TR393.ps.Z, 19940519 CIMGS: An Incomplete Orthogonal Factorization Preconditioner Xiaoge Wang Department of Computer Science Indiana University - Bloomington Kyle Gallivan Department of Electrical and Computer Engineering University of Illinois- Urbana Randall Bramley Department of Computer Science Indiana University -
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1994/wucs-94-02.ps.Z, 19940520 Learning From a Consistently Ignorant Teacher Michael Frazier Dept. of Computer Science University of Illinois Urbana, IL 61801 mfrazier@uiuc.edu Sally Goldmany Dept. of Computer Science Washington University St. Louis, MO 63130 sg@cs.wustl.edu Nina Mishra Dept. of Computer Science University of
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1994/wucs-94-01.ps.Z, 19940520 Learning One-Dimensional Geometric Patterns Under One-Sided Random Misclassification Noise Paul W. Goldberg Department 1423 Sandia National Laboratories, MS 1110 P.O. Box 5800 Albuquerque, NM 87185-1110 pwgoldb@cs.sandia.gov Sally A. Goldmany Dept. of Computer Science Washington University St. Louis, MO
	ftp://wuarchive.wustl.edu/doc/techreports/mcgill.ca/math/otto/c-docs/talk.ps.Z, 19940523 May 94 ASL talk I successively modify doctrines of categories involving numbers, beginning with G odel's system T, and ending with the linear time hierarchy. Jim Otto www file://triples.math.mcgill.ca/pub/otto/home.html ftp triples.math.mcgill.ca /pub/otto email otto@math.mcgill.ca 1 Unary In set, the
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1993/wucs-93-46.ps.Z, 19940524 Learning Unions of Boxes with Membership and Equivalence Queries Paul W. Goldberg Department 1423 Sandia National Laboratories, MS 1110 P.O. Box 5800 Albuquerque, NM 87185-1110 pwgoldb@cs.sandia.gov Sally A. Goldmany Dept. of Computer Science Washington University St. Louis, MO 63130 sg@cs.wustl.edu H.
	ftp://wuarchive.wustl.edu/doc/techreports/mcgill.ca/math/otto/dp/ac.ps.Z, 19940525 Dependent product diagrams and Awodey's axiom of choice J. Otto Department of Mathematics McGill University 805 Sherbrooke Street West Montreal, Quebec, Canada H3A 2K6 otto@math.mcgill.ca May 25, 1994 1 Introduction At the May '94 ASL meeting in Kansas City, when S. Awodey (awod@midway.uchicago.edu)
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/er-94-04.ps.Z, 19940531 In Proceedings of the 12th National AAAI Conference, Seattle, WA, August 1994 A Model of Creative Understanding Kenneth Moorman and Ashwin Ram Georgia Institute of Technology College of Computing Atlanta, GA 30332-0280 fkennethm,ashwing@cc.gatech.edu
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/er-94-10.ps.Z, 19940531 In Proceedings of the 16th Annual Cognitive Science Conference, Atlanta, GA, August 1994 Integrating Creativity and Reading: A Functional Approach Kenneth Moorman and Ashwin Ram Georgia Institute of Technology College of Computing Atlanta, GA 30332-0280 fkennethm,ashwing@cc.gatech.edu
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/er-94-08.ps.Z, 19940531 Machines that Forget: Learning from retrieval failure of mis-indexed explanations Michael T. Cox College of Computing Georgia Institute of Technology Atlanta, GA 30332-0280 cox@cc.gatech.edu
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/er-94-07.ps.Z, 19940531 Proceedings of the AAAI-94 Workshop on Indexing and Reuse in Multimedia Systems, Seattle, WA, August 1994. Cognitive Media Types as Indices for Hypermedia Learning Environments Mimi Recker and Ashwin Ram College of Computing Georgia Institute of Technology Atlanta, GA 30332-0280 mimi@cc.gatech.edu
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/er-94-01.ps.Z, 19940531 Using Genetic Algorithms to Learn Reactive Control Parameters for Autonomous Robotic Navigation Ashwin Ram, Ronald Arkin, Gary Boone, and Michael Pearce College of Computing Georgia Institute of Technology
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/94.reports/tr08.94.ps, 19940607
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1993/wucs-93-51.ps.Z, 19940607 FrIL\|A Fractal Intermediate Language Ron Cytron Washington University Campus Box 1045 St. Louis, Missouri 63130 David Shields IBM Research P.O. Box 704 Yorktown Heights, NY 10598 July 15, 1993
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/mimi/er-mr-93-02.ps, 19940607 Journal of the Learning Sciences, 4(1), 1994. Modelling Individual Differences in Students' Learning Strategies Margaret M. Recker Georgia Institute of Technology and Peter Pirolli Xerox Palo Alto Research Center and University of California, Berkeley June 7, 1994
	ftp://wuarchive.wustl.edu/doc/techreports/indiana.edu/cs/TR403.ps.Z, 19940608 Interactive Rendering of Complex 3D Models in Pipelined Graphics Architectures Paulo W. C. Maciel Technical Report Department of Computer Science Indiana University, Bloomington May 23, 1994
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/others/uai94.ps.gz, 19940608 Model-Based Diagnosis with Qualitative Temporal Uncertainty Wolfgang Nejdl Informatik V RWTH Aachen Ahornstrasse 55, D-52056 Aachen nejdl@informatik.rwth-aachen.de Johann Gamper Informatik V RWTH Aachen Ahornstrasse 55, D-52056 Aachen gamper@informatik.rwth-aachen.de
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1994/wucs-94-15.ps.Z, 19940609 Strategies for the Parallel Training of Simple Recurrent Neural Networks Peter J. McCann and Barry L. Kalman WUCS-94-15 June, 1994 Strategies for the Parallel Training of Simple Recurrent Neural Networks Peter J. McCann and Barry L. Kalman
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/justin/cogsci94.ps, 19940614 Correspondences between Syntactic Form and Meaning: From Anarchy to Hierarchy Justin Peterson College of Computing Georgia Institute of Technology Atlanta, Georgia 30332 justin@cc.gatech.edu Dorrit Billman School of Psychology Georgia Institute of Technology Atlanta, Georgia 30332 billman@cc.gatech.edu
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/doug/PhD_proposal.ps.Z, 19940615 A Design Methodology for the Configuration of Behavior-Based Mobile Robots Ph. D. Thesis Proposal Douglas C. MacKenzie College of Computing Georgia Institute of Technology
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1992/wucs-92-17.ps.Z, 19940624 Energy-related Feature Abstraction for Handwritten Digit Recognition Thomas H. Fuller, Jr. WUCS-92-17 Reprinted from Proceedings of the Fourth Midwest Artificial Intelligence and Cognitive Science Society Conference (pages 71-76) May 1992 Department of Computer Science Washington University Campus Box
	ftp://wuarchive.wustl.edu/doc/techreports/indiana.edu/cs/TR408a.ps.Z, 19940629 Visualizing Distributed Data Structures Suresh Srinivas, Dennis Gannon Department of Computer Science, Lindley Hall 215, Indiana University, Bloomington, IN 47405. fssriniva,gannong@cs.indiana.edu
	ftp://wuarchive.wustl.edu/doc/techreports/indiana.edu/cs/TR408b.ps.Z, 19940629 CYCLIC,CYCLICBLOCK,BLOCKBLOCK,CYCLICCYCLIC,BLOCK Color Plate #1 Visualization of Distributions in a 2D collection Processor 0Processor 1Processor 2Processor 3 Iteration 15: Refinement Level 0 Iteration 15: Refinement Level 1Top ViewZoom on Larger Peak Color Plate #2 Evolution of Adaptive Data
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1994/94-14.ps.gz, 19940629 Codes, Simplifying Words, and Open Set Condition Ludwig Staiger Rhein.{Westf. Techn. Hochschule Aachen, Lehrstuhl f ur Informatik II, Ahornstr. 55, D{52074 Aachen, Germany
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/93.reports/tr31.93.ps, 19940706 Technical Report CMU/SEI-93-TR-31 ESC-TR-93-317 A Conceptual Framework for Software Technology Transition Priscilla Fowler Linda Levine December 1993 Software Engineering Institute Carnegie Mellon University Pittsburgh, Pennsylvania 15213 Approved for public release. Distribution unlimited. Technical
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1994/wucs-94-19.ps.Z, 19940708 Exact Learning of Discretized Geometric Concepts Nader H. Bshoutyy Department of Computer Science The University of Calgary Calgary, Alberta, Canada T2N 1N4 bshouty@cpsc.ucalgary.ca Paul W. Goldbergz Department 1423 Sandia National Labs, MS 1110 P.O. Box 5800 Albuquerque, NM 87185-1110
	ftp://wuarchive.wustl.edu/doc/techreports/mcgill.ca/math/barr/CE.cohomology.ps, 19940710 Cartan-Eilenberg cohomology and triples Michael Barr 1994-02-01
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/91.reports/cm23.91.ps, 19940713
	ftp://wuarchive.wustl.edu/doc/techreports/mcgill.ca/math/blute/fock.ps, 19940714 Fock Space: A Model of Linear Exponential Types R.F. Blute Department of Mathematics University of Ottawa Ottawa, Canada K1N6N5 rblute@mathstat.uottawa.ca Prakash Panangadeny School of Computer Science McGill University Montreal, Canada H3A2A7 prakash@cs.mcgill.ca R.A.G. Seelyz Department of Mathematics
	ftp://wuarchive.wustl.edu/doc/techreports/indiana.edu/cs/TR409.ps.Z, 19940715 indiana university computer science department technical report no. 409 Continuations in Hardware-Software Codesign M. Esen Tuna, Steven D. Johnson, and Robert G. Burger July 1994 To appear in the proceedings of the 1994 IEEE International Conference on Computer Design (ICCD '94 ), Cambridge,
	ftp://wuarchive.wustl.edu/doc/techreports/arizona.edu/cs/1993/TR93-30a.ps, 19940715 A Comparison of Implicit and Explicit Parallel Programming Vincent W. Freeh TR 93-30a A Comparison of Implicit and Explicit Parallel Programming 1 Vincent W. Freeh TR 93-30a
	ftp://wuarchive.wustl.edu/doc/techreports/indiana.edu/cs/TR406.ps.Z, 19940715 Rotations for N-Dimensional Graphics Andrew J. Hanson Computer Science Department Indiana University Bloomington, IN 47405 hanson@cs.indiana.edu } Introduction } In a previous article in Graphics Gems IV, Geometry for N-Dimensional Graphics" (Hanson 1994), we described a fundamental family of
	ftp://wuarchive.wustl.edu/doc/techreports/indiana.edu/cs/TR319.ps.Z, 19940715 The Rolling Ball Andrew J. Hanson Indiana University Bloomington, IN Interactive graphics systems often need techniques that allow the user to rotate graphical objects freely in three-dimensional space using commonlyavailable two-dimensional input devices such as a mouse. Achieving this goal is hampered
	ftp://wuarchive.wustl.edu/doc/techreports/berkeley.edu/raid/papers/algorithmica.ps.Z, 19940720 Coding Techniques for Handling Failures in Large Disk Arrays1 Lisa Hellerstein,2 Garth A. Gibson,3 Richard M. Karp,4 Randy H. Katz4 and David A. Patterson4 Abstract:Abstract: The goal of the Berkeley RAID (Redundant Arrays of Inexpensive Disks) project is to design and build a high performance, reliable
	ftp://wuarchive.wustl.edu/doc/techreports/berkeley.edu/raid/papers/raid5stripe.ps.Z, 19940720 Peter M. Chen & Edward K. Lee Striping in a RAID Level 5 Disk Array 1 Striping in a RAID Level 5 Disk Array Peter M. Chen Computer Science and Engineering Division Electrical Engineering and Computer Science Department University of Michigan Edward K. Lee DEC Systems Research Center
	ftp://wuarchive.wustl.edu/doc/techreports/berkeley.edu/raid/papers/winter93usenix.ps.Z, 19940720 An Analysis of File Migration in a Unix Supercomputing Environment 1 An Analysis of File Migration in a Unix Supercomputing Environment Ethan L. Miller Randy H. Katz University of California, Berkeley
	ftp://wuarchive.wustl.edu/doc/techreports/berkeley.edu/raid/papers/usenix90.ps.Z, 19940720 Disk Scheduling Revisited Margo Seltzer, Peter Chen, John Ousterhout Computer Science Division Department of Electrical Engineering and Computer Science University of California Berkeley, CA 94720
	ftp://wuarchive.wustl.edu/doc/techreports/berkeley.edu/raid/papers/benchUsenix90.ps.Z, 19940720 USENIX Summer Conference June 11-15, 1990 Anaheim, California Why Aren't Operating Systems Getting Faster As Fast as Hardware John K. Ousterhout - University of California at Berkeley
	ftp://wuarchive.wustl.edu/doc/techreports/berkeley.edu/raid/papers/tech91_638.ps.Z, 19940720 File Migration on the Cray Y-MP at the National Center for Atmospheric Research Ethan L. Miller Computer Science Division Department of Electrical Engineering and Computer Science University of California, Berkeley Berkeley, CA 94720 elm@cs.berkeley.edu June 25, 1991
	ftp://wuarchive.wustl.edu/doc/techreports/berkeley.edu/raid/papers/asplos91.ps.Z, 19940720 Performance Consequences of Parity Placement in Disk Arrays Edward K. Lee and Randy H. Katz Computer Science Division Electrical Engineering and Computer Science University of California at Berkeley Berkeley, California 94720
	ftp://wuarchive.wustl.edu/doc/techreports/berkeley.edu/raid/papers/lfsSOSP91.ps.Z, 19940720 The Design and Implementation of a Log-Structured File System Mendel Rosenblum and John K. Ousterhout Electrical Engineering and Computer Sciences, Computer Science Division University of California Berkeley, CA 94720 mendel@sprite.berkeley.edu, ouster@sprite.berkeley.edu
	ftp://wuarchive.wustl.edu/doc/techreports/berkeley.edu/raid/papers/tech91_616.ps.Z, 19940720 Input/Output Behavior of Supercomputing Applications Ethan L. Miller Computer Science Division Department of Electrical Engineering and Computer Science University of California, Berkeley Berkeley, CA 94720 December 14, 1990 Revised October 16, 1992
	ftp://wuarchive.wustl.edu/doc/techreports/berkeley.edu/raid/papers/tech93_770.ps.Z, 19940720 Performance Modeling and Analysis of Disk Arrays by Edward Kihyen Lee B.S. (University of California at Los Angeles) 1987 M.S. (University of California at Berkeley) 1990 A dissertation submitted in partial satisfaction of the requirements for the degree of Doctor of Philosophy in Computer Science in
	ftp://wuarchive.wustl.edu/doc/techreports/berkeley.edu/raid/papers/superComputing91.ps.Z, 19940720 50 100 150 200 250 300 350 400 450 500 4 16 64 256 Idle time (seconds) Cache size (MB) 4K cache blocks 8K cache blocks Figure 8: Idle time while running two instances of venus with varying cache sizes. Execution time would be 761 seconds if there were no idle time. 7 Conclusions While much attention has
	ftp://wuarchive.wustl.edu/doc/techreports/berkeley.edu/raid/papers/sigmetrics90.ps.Z, 19940720 An Evaluation of Redundant Arrays of Disks using an Amdahl 5890 Peter M. Chen, Garth A. Gibson, Randy H. Katz, David A. Patterson Computer Science Division, University of California, Berkeley
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/kolodner/er-AID-94.ps.Z, 19940721 To appear in J.S. Gero (ed.) Artificial Intelligence in Design 94, Kluwer Academic Publishers: Netherlands. THE DESIGN OF A TOOL KIT FOR CASE-BASED DESIGN AIDS E. A. DOMESHEK and J. L. KOLODNER College of Computing, Georgia Institute of Technology Atlanta, GA 30332-0280, USA and C. M. ZIMRING College of
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/kolodner/er-AIEDAM-93.ps.Z, 19940722 From AI EDAM (1993) 7(2), 87-96 USING THE POINTS OF LARGE CASES ERIC DOMESHEK AND JANET KOLODNER College of Computing, Georgia Institute of Technology, Atlanta, GA 30332-0280, U.S.A. We believe that Case-Based Reasoning (CBR) will prove applicable to design, at least in part because we have seen
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/others/cc94.ps.gz, 19940726 Efficient Organization of Control Structures in Distributed Implementations Guido Hogen1 and Rita Loogen2 1 RWTH Aachen, Lehrstuhl f ur Informatik II Ahornstrasse 55, D-52056 Aachen, Germany email: ghogen@zeus.informatik.rwth-aachen.de 2 Philipps-Universit at Marburg, Fachgebiet Informatik Hans Meerwein
	ftp://wuarchive.wustl.edu/doc/techreports/indiana.edu/cs/TR412a.ps.Z, 19940727 TECHNICAL REPORT NO. 412 A EMILY: A Visualization Tool for Large Sparse Matrices by R. Bramley (bramley@cs.indiana.edu) and T. Loos (tloos@cs.indiana.edu) July, 1994 All screen shots have been deleted from this version to save space COMPUTER SCIENCE DEPARTMENT INDIANA UNIVERSITY Bloomington, Indiana
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/wills/er-93-symp.ps.Z, 19940804 AAAI Spring Symposium on AI and Creativity, Stanford, CA, March 1993. Reprinted in AI and Simulation of Behavior Quarterly (85), Autumn 1993. CASE-BASED CREATIVE DESIGN Janet L. Kolodner and Linda M. Wills College of Computing Georgia Institute of Technology Atlanta, Georgia 30332-0280
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/wills/er-94-aaai.ps.Z, 19940804 Proceedings of AAAI-94, Seattle, WA, August 1994. Towards More Creative Case-Based Design Systems Linda M. Wills and Janet L. Kolodner College of Computing Georgia Institute of Technology Atlanta, Georgia 30332-0280 linda@cc.gatech.edu, jlk@cc.gatech.edu
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/wills/er-93-cbr.ps.Z, 19940804 AAAI-93 Case-Based Reasoning Workshop, Washington, D.C., July 1993, pp. 19-25. Paying Attention to the Right Thing: Issues of Focus in Case-Based Creative Design Janet L. Kolodner and Linda M. Wills College of Computing Georgia Institute of Technology Atlanta, Georgia 30332-0280 jlk@cc.gatech.edu,
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1994/94-16.ps.gz, 19940805 Designing Software with Modula 3 Peter Klein Lehrstuhl f r Informatik III RWTH Aachen Peter Klein e mail: pk@i3.informatik.rwth aachen.de Lehrstuhl f r Informatik III Tel.: +49/241/80 21311 Ahornstr. 55 Fax.: +49/241/8888 218 RWTH Aachen 52074 Aachen, Germany Designing Software with Modula 32 1.
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/symposia/aaai-spring-95/papers/related-papers/MPI-I-92-250.ps.Z, 19940807 MAX-PLANCK-INSTITUT F UR INFORMATIK Reflection in Logical Systems Se an Matthews MPI{I{92{250 November 1992 Oo Oo k I N F O R M A T I K Im Stadtwald W 6600 Saarbr ucken Germany Author's Address Max-Planck-Institut f ur Informatik, Im Stadtwald, W-6600 Saarbr ucken, Germany. sean@mpi-sb.mpg.de
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/symposia/aaai-spring-95/papers/related-papers/meta-knowledge.ps.Z, 19940807 KNOME: Modeling What the User Knows in UC* David N. Chin Department of Information and Computer Sciences University of Hawaii at Manoa 2565 The Mall Honolulu, HI 96822 email: Chin@Hawaii.Edu
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/symposia/aaai-spring-95/papers/related-papers/control-info.ps.Z, 19940807 Is there any Need for Domain-Dependent Control Information Matthew L. Ginsberg and Donald F. Geddisy Computer Science Department Stanford University Stanford, California 94305 ginsberg@cs.stanford.edu
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/symposia/aaai-spring-95/papers/related-papers/reflective-agents.ps.Z, 19940807 Learning from Examples, Agent Teams and the Concept of Reflection Uwe Beyer Frank Smieja June 15, 1993
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1994/94-17.ps.gz, 19940815 Finite acceptance of infinite words Igor Litovsky ESSI Route des colles BP 145 F-06903 Sophia Antipolis Cedex France Ludwig Staigery RWTH Aachen Lehrstuhl f ur Informatik II Ahornstr. 55 D-52056 Aachen Germany
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/others/vs-draft.ps.Z, 19940818 Parallel Functional Implementations: Graphbased vs. Stackbased Reduction Guido Hogen and Rita Loogen Functional Languages Implementation Workshop. Paper 999
	ftp://wuarchive.wustl.edu/doc/techreports/indiana.edu/cs/TR404.ps.Z, 19940825 TECHNICAL REPORT NO. 404 Leveled Entity Relationship Model Munish Gandhi gandhim@cs.indiana.edu Edward L. Robertson edrbtsn@cs.indiana.edu Dirk Van Gucht vgucht@cs.indiana.edu May 25, 1994 Computer Science Department, Indiana University, Bloomington, IN-47405. 1
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/symposia/aaai-spring-95/papers/mccarthy.ps.Z, 19940825 CONTENTIONS ABOUT SELF-CONSCIOUSNESS John McCarthy, Stanford University August 25, 1994 Here are some general contentions about what programs need to know about themselves. 1. To understand mental phenomena it is important to take the design stance in a stronger form than Daniel Dennett does. Namely, we
	ftp://wuarchive.wustl.edu/doc/techreports/indiana.edu/cs/TR415.ps.Z, 19940825 TECHNICAL REPORT NO. 415 A Data Model for Audio-Video Data Munish Gandhi gandhim@cs.indiana.edu Edward L. Robertson edrbtsn@cs.indiana.edu August 24, 1994 Computer Science Department, Indiana University, Bloomington, IN-47405. 1 Contents 1 Introduction 4 2 Algebra: Domain 6 2.1 Track Atom, TAD and Track
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/eleni/jaai.ps.Z, 19940831 Functional Representation and Reasoning for Reflective Systems Eleni Stroulia and Ashok K. Goel yz College of Computing Georgia Institute of Technology Atlanta, GA 30332-0280 eleni@cc.gatech.edu, goel@cc.gatech.edu Mailing Address: Eleni Stroulia College of Computing Georgia Institute of Technology
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1994/94-19.ps.gz, 19940904 An Executable Meta Model for Re-Engineering of Database Schemas Manfred A. Jeusfeldy, Uwe A. Johnenz yInformatik V, RWTH Aachen, 52056 Aachen, Germany zdebis Systemhaus - Software Tools, 52076 Aachen, Germany
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1994/94-18.ps.gz, 19940904 Parallel Functional Implementations: Graphbased vs. Stackbased Reduction Guido Hogen and Rita Loogen
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/symposia/aaai-spring-95/papers/cox-freed.ps.Z, 19940905 Using Knowledge of Cognitive Behavior to Learn from Failure Michael T. Cox Michael Freed College of Computing NASA Ames Research Center Georgia Institute of Technology Artificial Intelligence Branch Atlanta, GA 30332-0280 Moffett Field, CA 94035 cox@cc.gatech.edu freed@picasso.arc.nasa.gov
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1994/94-01.ps.gz, 19940905 Jahresbericht 1993 der Fachgruppe Informatik in der Mathematisch-Naturwissenschaftlichen Fakult at der RWTH Aachen Herausgeber: Fachgruppe Informatik RWTH Aachen Ahornstr. 55 52056 Aachen Redaktion: Margit Generet Sven Martin Druck: trans-aix-press E. Dirks Kurbrunnenstra e 30, 52066 Aachen Inhalt
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/symposia/aaai-spring-95/descr.ps.Z, 19940905 REFERENCES: Dennett, D. (1987) The intentional stance. Cambridge, MA: MIT Press/Bradford Books. Freed, M., & Collins, G. (1994). Adapting routines to improve task coordination. In K. Hammond (Ed.), Proceedings of the Second International Conference on Artificial Intelligence Planning Systems (pp
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/bhatta/imba-aid94.ps.Z, 19940906 INNOVATION IN ANALOGICAL DESIGN: A MODEL-BASED APPROACH S. BHATTA AND A. GOEL College of Computing Georgia Institute of Technology Atlanta, GA 30332-0280, USA AND S. PRABHAKAR School of Computing Sciences University of Technology, Sydney POB 123, Broadway Sydney, NSW 2007, Australia In the Proceedings
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/bhatta/dp-aiedam94.ps.Z, 19940906 Discovery of Physical Principles from Design Experiences Sambasiva R. Bhatta and Ashok K. Goel College of Computing Georgia Institute of Technology Atlanta, GA 30332-0280 bhatta@cc.gatech.edu, goel@cc.gatech.edu In a special issue on Machine Learning in Design" of the International Journal AI EDAM (AI
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/bhatta/detogm-mld94.ps.Z, 19940906 From Design Experiences To Generic Mechanisms: Model-Based Learning in Analogical Design Sambasiva R. Bhatta and Ashok K. Goel College of Computing Georgia Institute of Technology Atlanta, Georgia 30332-0280 fbhatta,goelg@cc.gatech.edu In the Proceedings of the AID-94 workshop on Machine Learning in
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-92-19.ps.Z, 19940908 Introspective reasoning using meta-explanations for multistrategy learning Ashwin Ram and Michael T. Cox College of Computing Georgia Institute of Technology Atlanta, Georgia 30332-0280 ashwin@cc.gatech.edu and cox@cc.gatech.edu
	ftp://wuarchive.wustl.edu/doc/techreports/indiana.edu/cs/TR416.ps.Z, 19940913 Extending Formal Reasoning with Support for Hardware Diagrams Kathi Fisler Department of Computer Science Lindley Hall 215 Indiana University Bloomington, IN 47405 kfisler@cs.indiana.edu
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1994/wucs-94-24.ps.Z, 19940921 Performance Comparison of Asynchronous Adders1 Mark A. Franklin and Tienyo Pan Computer and Communication Research Center Washington University St. Louis, MO 63130
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/carlos/papers/er-94-03.ps.Z, 19940921 To appear in the Proceedings of the IV Iberoamerican Congress on Artificial Intelligence (IBERAMIA-94), Caracas, Venezuela, Octubre 1994. On-line Knowledge Compilation and Speedup Learning in Continuous Task Domains Juan Carlos Santamar a and Ashwin Ram College of Computing Georgia Institute of
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/er-94-11.ps.Z, 19940930 Managing Learning Goals in Strategy-Selection Problems Michael T. Cox and Ashwin Ram College of Computing Georgia Institute of Technology Atlanta, GA 30332-0280 {cox,ashwin}@cc.gatech.edu
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/doc.list.ps, 19941003 Software Engineering Institute Documents Maintained by Information Management September 1994 Software Engineering Institute Carnegie Mellon University Pittsburgh, Pennsylvania 15213 Approved for public release. Distribution unlimited. September 1994 Software Engineering Institute Documents Maintained by
	ftp://wuarchive.wustl.edu/doc/techreports/mcgill.ca/math/rags/bang/bang.ps.Z, 19941004 ! and Storage as tensorial strength R.F. Blute1 J.R.B. Cockett2 R.A.G. Seely3
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/94.reports/tr13.94.ps, 19941005 Technical Report CMU/SEI-94-TR-13 ESC-TR-94-013 August 1994 Software Engineering Institute Carnegie Mellon University Pittsburgh, Pennsylvania 15213 Benefits of CMM-Based Software Process Improvement: Initial Results ___________________________________________________________________
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/symposia/aaai-spring-95/papers/cox.ps.Z, 19941008
	ftp://wuarchive.wustl.edu/doc/techreports/cmu.edu/sei/doc.list.ftp.ps, 19941012 Software Engineering Institute Documents (FTP Version) Maintained by Information Management September 1994 Software Engineering Institute Carnegie Mellon University Pittsburgh, Pennsylvania 15213 Approved for public release. Distribution unlimited. September 1994 Software Engineering Institute Documents
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1994/94-22.ps.gz, 19941013 Valuations and Unambiguity of Languages, with Applications to Fractal Geometry Henning Fernau Lehrstuhl Informatik f ur Ingenieure und Naturwissenschaftler Universit at Karlsruhe (TH) D-76128 Karlsruhe Ludwig Staigery Lehrstuhl f ur Informatik II RWTH Aachen Ahornstrasse 55 D-52056 Aachen
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1994/94-21.ps.gz, 19941013 Proving the Correctness of the Static Link Technique Using Evolving Algebras Markus Mohnen RWTH Aachen, Lehrstuhl f ur Informatik II Ahornstrasse 55, 52056 Aachen, Germany email: markusm@zeus.informatik.rwth-aachen.de
	ftp://wuarchive.wustl.edu/doc/techreports/mcgill.ca/math/blute/hopf.ps, 19941016 Hopf Algebras and Linear Logic Richard F. Blute University of Ottawa Ottawa, Ontario CANADA email address: rblute@acadvm1.uottawa.ca October 14, 1994
	ftp://wuarchive.wustl.edu/doc/techreports/mcgill.ca/math/otto/c-docs/lcc-talk.ps.Z, 19941024 Tiers, Tensor, and Linear Time J. Otto October 1994 In this talk I want to show you 1. how to use tiers and tensor to characterize the linear time functions, and then 2. how to use unbounded tier quantifications to characterize the linear time hierarchy relations. 1. is related to, but different from,
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/math/papers/taormina2.ps.Z, 19941031 Efficiency Comparison of Wavelet Packet and Adapted Local Cosine Bases for Compression of a Two-dimensional Turbulent Flow Mladen Victor Wickerhauser Marie Fargey Eric Goirand Eva Wesfreidz Echeyde Cubillox June 2, 1994
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/math/papers/oe.ps.Z, 19941031 Two fast approximate wavelet algorithms for image processing, classification, and recognition Mladen Victor Wickerhauser Department of Mathematics Washington University in St. Louis Missouri 63130 USA June 3, 1994
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/math/papers/timeloc.ps.Z, 19941031 Ingrid Daubechies. Ten Lectures on Wavelets, volume 61 of CBMS-NSF Regional Conference Series in Applied Mathematics. SIAM Press, Philadelphia, 1992. D. Esteban and C. Galand. Application of quadrature mirror filters to split band voice coding systems. In Proceedings of IEEE ICASSP-77, pages
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/math/papers/baseb.ps.Z, 19941031 BEST-ADAPTED WAVELET PACKET BASES 17 Ruskai et al., ISBN 0-86720-225-4, Jones and Bartlett, Boston, 1992, pp. 15378.. . Ingrid Daubechies, Orthonormal bases of compactly supported wavelets, Communications on Pure and Applied Mathematics XLI (1988), 909996. . Michael Frazier, Bjorn Jawerth
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/math/papers/awaatr.ps.Z, 19941031 Adapted waveform analysis as a tool for modeling, feature extraction and denoising. Ronald R. Coifman,M Victor Wickerhauser We describe the development of Adapted Waveform Analysis (AWA) as a tool for fast processing of the various identification tasks involved in medical diagnostics and Automatic
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/math/papers/fdr92.ps.Z, 19941031 14 M. FARGE, E. GOIRAND, Y. MEYER, F. PASCAL, M. V. WICKERHAUSER Acknowledgments The numerical experiments were performed on the Cray 2 at the Centre de Calcul Vectoriel pour la Recherche, using the incompressible Navier-Stokes code of Claude Basdevant. The color visualizations were done in
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/math/papers/awfc.ps.Z, 19941031 4 Wickerhauser the application of J2BM to J1v requires at most #jJ2BM j = O(r2) operations, where #jU j denotes the number of nonnegligible coefficients in U . Thus nonstandard multiplication costs an initial investment of O(r2 log r), plus at most an additional O(r2) per right-hand side;
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/math/papers/taormina1.ps.Z, 19941031 Comparison of Picture Compression Methods: Wavelet, Wavelet Packet, and Local Cosine Transform Coding Mladen Victor Wickerhauser Department of Mathematics Washington University St. Louis, Missouri 63130
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/math/papers/wtfa.ps.Z, 19941031 Wavelets and Time-Frequency Analysis Nikolaj Hess-Nielsen Mladen Victor Wickerhausery July 22, 1994
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/symposia/aaai-spring-95/papers/acceptances/paper3.ps.gz, 19941101 An Abstract General Model and Logic of Resource-Bounded Believers Michael Wooldridge Department of Computing Manchester Metropolitan University Chester Street, Manchester M1 5GD United Kingdom M.Wooldridge@doc.mmu.ac.uk
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/symposia/aaai-spring-95/papers/acceptances/paper9.ps.gz, 19941101 4 Student Model The ML-Modeler can emulate novice-to-expert transitions independently of any student input. However, to apply ML-Modeler to the student modeling problem, the learning mechanisms, concepts, and procedures to be used must be guided by the student's problem-solving behavior over time. The
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/symposia/aaai-spring-95/papers/acceptances/paper11.ps.gz, 19941101 Using a Domain-Independent Introspection Mechanism to Improve Memory Search Angela C. Kennedy School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 ach@cs.cmu.edu In his position paper, Krulwich states that there are basic levels of representation of cognitive phenomena that
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/symposia/aaai-spring-95/papers/acceptances/paper4.ps.gz, 19941101 Modeling Case-based Planning for Repairing Reasoning Failures Susan Fox David B. Leake October 28, 1994
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1994/wucs-94-04.ps.Z, 19941101 WASHINGTON UNIVERSITY IN ST LOUIS Washington School of Engineering & Applied Science Saint Louis, MO 63130-4899One Brookings DriveCampus Box 1045Washington UniversityDepartment of Computer Science Printed 10/25/94 Reasoning about Places, Times, and Actions in the Presence of Mobility C. Donald Wilcox
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/symposia/aaai-spring-95/papers/acceptances/paper8.ps.gz, 19941101 Modelling at the Mental-level { Some Ideas and Some Challenges Ronen I. Brafman Computer Science Department Stanford University Stanford, CA 94305 brafman@cs.stanford.edu Moshe Tennenholtz Faculty of Industrial Engineering and Management Technion Haifa 32000, Israel moshet@ie.technion.ac.il 1
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1994/wucs-94-29.ps.Z, 19941101 1 High Performance Training of Feedforward & Simple Recurrent Networks Barry L. Kalman and Stan C. Kwasny WUCS-94-29 October 1994 This material is based upon work supported by the National Science Foundation under Grant No. IRI-9201987. 2 High Performance Training of Feedforward & Simple Recurrent
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1994/wucs-94-31.ps.Z, 19941102 Practical Methods for Approximating Shortest Paths on a Convex Polytope in R3 John Hershberger Mentor Graphics 1001 Ridder Park Drive San Jose, CA 95131. Subhash Suri Department of Computer Science Washington University St. Louis, MO 63130.
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1994/wucs-94-30.ps.Z, 19941102 Morphing Binary Trees John Hershberger Mentor Graphics San Jose, CA 95131 Subhash Suri Washington University St. Louis, MO 63130 November 1, 1994
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/symposia/aaai-spring-95/papers/acceptances/paper14.ps.gz, 19941113 Towards More Flexible and Common-Sensical Reasoning about Beliefs Gees C. Stein and John A. Barnden. gstein@crl.nmsu.edu , jbarnden@crl.nmsu.edu Computing Research Lab & Computer Science Dept. New Mexico State University Las Cruces, NM 88003-8001
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/arl/CMAP_spec_v3.0.ps.Z, 19941114 CMAP Ken Cox and John DeHart WUCS-94-21 Version 3.0 (ARL-94-08) Previous Versions (WUCS-92-01, ARL-89-06) authored by: John DeHart Mike Gaddis Rick Bubenik July, 1994 Department of Computer Science Washington Univeristy Campus Box 1045 One Brookings Drive St. Louis MO 63130-4899 Hypertext Linkage
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1994/wucs-94-25.ps.Z, 19941114 Design of a Large Scale Multimedia Server Milind M. Buddhikot, Guru Parulkar, Jerome R. Cox, Jr. wucs-94-25 November 14, 1994 Department of Computer Science Campus Box 1045 Washington University One Brookings Drive St. Louis, MO 63130-4899 This work was supported in part by the ARPA, National Science
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/math/papers/awaftts-errata.ps.Z, 19941114 ERRATA Adapted Wavelet Analysis from Theory to Software Mladen Victor Wickerhauser AK Peters, Ltd. 1994 \| ISBN 1-56881-041-5 November 13, 1994 The following errors were found in the 9 May 1994 version: ffl Chapter 1, page 10, line 31: replace The Schwartz class S with The Schwartz class S ffl Chapter 1,
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/symposia/aaai-spring-95/papers/acceptances/paper16.ps.gz, 19941116 A Knowldge-Sharing Strategy Dr. David Goldstein Sophisticated cooperative reasoning among agents requires that the agents be able to share models of their reasoning processes. Developing intelligent systems cost-effectively necessitates that components be reused. In order to facilitate sharing and
	ftp://wuarchive.wustl.edu/doc/techreports/mcgill.ca/math/rags/music/continuo.ps.Z, 19941116 Basics of the basics of lute continuo Arto Wikla November 1994 The starting point for lute continuo learning 1. Learn to read bass staff fluently and to play it musically. Play whatsoever bass lines you happen to meet. (Already this ability makes you a useful partner for a
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/carlos/SRL/DRS/ta.ps, 19941118 Dent Recognition Software - Task Analysis Submitted to SRL Mobile Robot Laboratory College of Computing Georgia Institute of Technology Atlanta, Georgia 30332-0280 U.S.A. 1 Summary The following Task Analysis is being submitted as part of the requirements stated in the ERDA Statement of Scope and it
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/mimi/cv.ps.gz, 19941205 CURRICULUM VITAE Margaret M. Recker University Address College of Computing Georgia Institute of Technology Atlanta, GA 30332-0280 (404) 894-9218 mimi@cc.gatech.edu Home Address 1125 State St Atlanta, GA 30318 (404) 875-2187 Research Experience Georgia Institute of Technology Atlanta, GA 1992{1994
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/s-94-05.ps.Z, 19941209 Continuous Case-Based Reasoning Ashwin Ram and Juan Carlos Santamar a College of Computing Georgia Institute of Technology December 9, 1994
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/cox/Www/l-goal-short6-cbr.ps, 19941215 Interacting Learning-Goals: Treating Learning as a Planning Task Michael T. Cox and Ashwin Ram Georgia Institute of Technology. Atlanta, GA 30332-0280 {cox,ashwin}@cc.gatech.edu
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1994/wucs-94-34.ps.Z, 19941221 UNIVERSAL CONTINUOUS MEDIA I/O: DESIGN AND IMPLEMENTATION Charles D. Cranor and Gurudatta M. Parulkar WUCS-94-34 December 19, 1994 Department of Computer Science Campus Box 1045 Washington University One Brookings Drive St. Louis, MO 63130-4899
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1994/wucs-94-11.ps.Z, 19941223 Catching Up With the Networks: Host I/O at Gigabit Rates Zubin D. Dittia Jerome R. Cox, Jr. Guru M. Parulkar zubin@dworkin.wustl.edu jrc@hobbs.wustl.edu guru@flora.wustl.edu Technical Report WUCS-94-11 Department of Computer Science Washington University in St. Louis St. Louis, MO 63130.
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/cox/Www/vitae6.ps.Z, 19950104 Michael T. Cox Curriculum Vitae Educational Experience Research Experience Graduate Research Assistant for Dr. Ashwin Ram (advisor) under Air Force Office of Scientific Research grant F49620-94-1-0092 (1993-1994) Graduate Research Assistant for Dr. Ashwin Ram under National Science Foundation grant
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/er-95-04.ps.Z, 19950105 Goal-Driven Learning in Multistrategy Reasoning and Learning Systems Ashwin Ram, College of Computing Michael T. Cox, College of Computing S. Narayanan, School of Industrial & Systems Engineering Georgia Institute of Technology Atlanta, Georgia 30332-0280 1 Introduction This chapter presents a
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/cox/Papers/t4.ps.gz, 19950106 Interacting Learning-Goals: Treating Learning as a Planning Task Michael T. Cox and Ashwin Ram Georgia Institute of Technology. Atlanta, GA 30332-0280 {cox,ashwin}@cc.gatech.edu
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1994/wucs-94-16.ps.Z, 19950117 Trading Packet Headers for Packet Processing George Varghese June 29, 1994
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1994/wucs-94-17.ps.Z, 19950117 Efficient Fair Queuing using Deficit Round Robin M. Shreedhar and George Varghese November 18, 1994
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/carlos/resume.ps, 19950117 CURRICULUM VITAE JUAN CARLOS SANTAMARIA Ph.D. Candidate College of Computing Georgia Institute of Technology Atlanta, GA 30332{0280 (404) 853{9381 Education Master of Science in Computer Science Georgia Institute of Technology, Atlanta, March 1993. Overall GPA 3.90/4.00. Course Curriculum includes:
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/carlos/abstract.ps, 19950117 Integrating Learning, Planning, and Acting under Continuous Domains. Juan Carlos Santamar a Artificial Intelligence Group College of Computing Georgia Institute of Technology Atlanta, Georgia 30332-0280 carlos@cc.gatech.edu
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/s-95-01.ps.gz, 19950119 Interacting Learning-Goals: Treating Learning as a Planning Task Michael T. Cox and Ashwin Ram Georgia Institute of Technology. Atlanta, GA 30332-0280 {cox,ashwin}@cc.gatech.edu
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/doug/specification_and_execution of multiagent_missions.ps.Z, 19950124 GIT-COGSCI-95/02 Specification and Execution of Multiagent Missions Douglas C. MacKenzie Jonathan M. Cameron Ronald C. Arkin January 24, 1995 Douglas C. MacKenzie College of Computing Georgia Institute of Technology Atlanta, Georgia 30332 U.S.A. doug@cc.gatech.edu
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1994/wucs-94-21.ps.Z, 19950126 CMAP Ken Cox and John DeHart WUCS-94-21 Version 3.0 (ARL-94-08) Previous Versions (WUCS-92-01, ARL-89-06) authored by: John DeHart Mike Gaddis Rick Bubenik July, 1994 Department of Computer Science Washington Univeristy Campus Box 1045 One Brookings Drive St. Louis MO 63130-4899 Hypertext Linkage
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/symposia/aaai-spring-95/papers/acceptances/brafman.ps.gz, 19950128 Action Prediction Using a Mental-Level Model Ronen I. Brafman Stanford University Dept. of Computer Science Stanford, CA 94305-2140 brafman@cs.stanford.edu Moshe Tennenholtz Faculty of Industrial Engineering and Management Technion Haifa 32000, Israel moshet@ie.technion.ac.il
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/symposia/aaai-spring-95/papers/acceptances/fox.ps.gz, 19950128 Modeling Case-based Planning for Repairing Reasoning Failures Susan Fox David B. Leake Computer Science Department Indiana University Bloomington, IN 47405 fsfox,leakeg@cs.indiana.edu
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/symposia/aaai-spring-95/papers/acceptances/goldstein.ps.gz, 19950128 A Knowledge-Sharing Strategy David Goldstein and Albert Esterline North Carolina A&T State University Greensboro, North Carolina goldstn @ncat.edu, esterlin@ncat.edu Introduction Sophisticated cooperative reasoning among agents requires that the agents be able to share models of their reasoning
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/symposia/aaai-spring-95/papers/acceptances/shahar.ps.gz, 19950128 Plan Recognition and Revision in Support of Guideline-Based Care Yuval Shahar and Mark A. Musen Section on Medical Informatics, Departments of Medicine and Computer Science, Stanford University, Stanford, CA 94305 shahar@camis.stanford.edu
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/symposia/aaai-spring-95/papers/acceptances/oehlmann.ps.gz, 19950128
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/symposia/aaai-spring-95/papers/acceptances/gurer.ps.gz, 19950128
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/symposia/aaai-spring-95/papers/acceptances/kennedy.ps.gz, 19950128 Using a Domain-Independent Introspection Mechanism to Improve Memory Search 1 Angela C. Kennedy School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 ach@cs.cmu.edu
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/symposia/aaai-spring-95/papers/acceptances/paper7.ps.gz, 19950128 Defining Knowledge and Belief in Terms of Perception and Memory c 1994 M. Moser M. Moser, N. Shiratori Shiratori Laboratory Research Institute of Electrical Communication Tohoku University 980 Sendai, Japan Philosophus probat, quod principium nostrae cognitionis est a sensu. \| Thomas Aquinas, Summa
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/symposia/aaai-spring-95/papers/acceptances/paper1.ps.gz, 19950128 Looking for the Human Cognition Foundations by Calin Teodorescu researcher, Ph.D student Artificial Intelligence Laboratory, Research Institute for Informatics, Bucharest, Romania, 8-10 Averescu Avenue, RM-71316 phone : +40-1-665 6060 / 141 fax : +40-1-312 8539 email : calin@roearn.ici.ro
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/symposia/aaai-spring-95/papers/acceptances/krulwich.ps.gz, 19950128 Cognitive behavior, basic levels, and intelligent agents A position paper for the 1995 Spring Symposium on Representing Mental States and Mechanisms Bruce Krulwich Center for Strategic Technology Research Andersen Consulting LLP 100 South Wacker Drive, Chicago, IL 60606 krulwich@andersen.com
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1995/wucs-95-01.ps.Z, 19950131 WASHINGTON UNIVERSITY IN ST LOUIS Washington School of Engineering & Applied Science Saint Louis, MO 63130-4899One Brookings DriveCampus Box 1045Washington UniversityDepartment of Computer Science Transient data sharing among mobile programs Jerome Plun Gruia-Catalin Roman WUCS-95-01 January 1995
	ftp://wuarchive.wustl.edu/doc/techreports/rwth-aachen.de/1994/94-28.ps.gz, 19950201 An Elementary Bisimulation Decision Procedure for Arbitrary Context-Free Processes Olaf Burkart Lehrstuhl f ur Informatik II RWTH Aachen Ahornstrasse 55 52074 Aachen Germany Didier Caucaly IRISA Campus de Beaulieu 35042 Rennes France Bernhard Steffenz Fakult at f ur Mathematik und Informatik Universit
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1995/wucs-95-05.ps.Z, 19950203 A General Matrix Iterative Model for Dynamic Load Balancing y Mark A. Franklin Vasudha Govindan jbf@random.wustl.edu vasu@wuccrc.wustl.edu Computer and Communications Research Center Campus Box 1115, One Brookings Drive Washington University, St. Louis, Missouri 63130
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/symposia/aaai-spring-95/papers/acceptances/mccarthy.ps.gz, 19950205 Making Robots Conscious of their Mental States John McCarthy Computer Science Department Stanford University Stanford, CA 94305 jmc@cs.stanford.edu
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/paper.ps, 19950206 Cognitive Media Types for Multimedia Information Access Mimi Recker, Ashwin Ram , Terry Shikano, George Li, John Stasko College of Computing Georgia Institute of Technology Atlanta, Georgia January 9, 1994
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/d-94-01.ps.Z, 19950206 Submitted to The Journal of the Learning Sciences. Creative Conceptual Change Ashwin Ram, Kenneth Moorman, Juan Carlos Santamar a College of Computing Georgia Institute of Technology Atlanta, Georgia 30332-0280 E-mail: ashwin.ram@cc.gatech.edu
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1995/wucs-95-04.ps.Z, 19950209 Can Declared Strategy Voting be an Effective Instrument for Group Decision-Making Lorrie Faith Cranor WUCS-95-04 February 8, 1995 Department of Computer Science Campus Box 1045 Washington University One Brookings Drive St. Louis, MO 63130-4899
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/kennethm/Papers/psychgrad/psycgrad.ps.Z, 19950211 To appear in an upcoming edition of PsychGrad. A Functional Theory of Creative Reading Kenneth Moorman and Ashwin Ram Georgia Institute of Technology College of Computing Atlanta, GA 30332-0280 (404) 853-9381 (404) 853-9372 fkennethm,ashwing@cc.gatech.edu February 5, 1995 3:42 P.M.
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/mimi/tv-paper.ps, 19950221 Student Troubleshooting Strategies in a Dynamic Simulation Environment Margaret M. Recker Victoria University of Wellington T. Govindaraj Industrial and Systems Engineering Georgia Institute of Technology Vijay Vasandani International Business Machine Corporation Address correspondences to: Mimi Recker
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/carlos/SRL/DRS/tr-draft.ps.gz, 19950222 Dent Recognition on Drum Surfaces { Technical Report This technical report presents results based on simulated images * This technical report does not consider the recent change on SWAMI-II nor the new structured light system * Submitted to SRL Mobile Robot Laboratory College of Computing
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-93-67.ps.Z, 19950223 Learning to troubleshoot: Multistrategy learning of diagnostic knowledge for a real-world problem-solving task Ashwin Ram College of Computing Georgia Institute of Technologyy S. Narayanan Department of Biomedical and Human Factors Engineering Wright State Universityz Michael T. Cox College of Computing
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1993/wucs-93-21.ps.Z, 19950320 Dynamic Reconfiguration with I/O Abstraction Bala Swaminathan Kenneth J. Goldman WUCS-93-21 August 20 1993 Revised March 17 1995 Department of Computer Science Washington University Campus Box 1045 One Brookings Drive Saint Louis, MO 63130{4899 Dynamic Reconfiguration with I/O Abstraction Bala
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-93-47.ps.Z, 19950322 Technical Report GIT-CC-93/47, College of Computing, Georgia Institute of Technology, Atlanta, GA, 1993. In R.C. Schank, A. Kass, & C.K. Riesbeck, editors, Inside Case-Based Explanation, chapter 7, pages 207 261, Lawrence Erlbaum Associates, 1994. AQUA: Questions that drive the explanation process
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/symposia/aaai-spring-95/papers/cox-final.ps.gz, 19950403 22
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/Continuous_CBR.ps.Z, 19950403 Continuous Case-Based Reasoning Ashwin Ram College of Computing, Georgia Tech What s in common between: l CHEF recipe planning l AQUA newspaper story understanding l HYPO legal argumentation l MEDIATOR dispute resolution l PRODIGY high-level planning Case-Based Reasoning (CBR) Discrete, symbolic task
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/er-05-05.ps.Z, 19950403 To appear in A. Ram & D.B. Leake, editors, Goal-Driven Learning, MIT Press/Bradford Books. Chapter 21 Learning as Goal-Driven Inference Ryszard S. Michalski and Ashwin Ram 1 Inferential Theory of Learning A remarkable aspect of human learners is that they are able to apply a great variety of learning
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/carlos/SRL/DRS/tr-final.ps, 19950407 Dent Detection on Drum Surfaces { Technical Report Submitted to Savannah River Technology Center Juan C. Santamar a and Ronald C. Arkin Mobile Robot Laboratory College of Computing Georgia Institute of Technology Atlanta, Georgia 30332-0280 U.S.A. 1 Introduction The Savannah River Technology Center
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/centaur/ecml95.ps.Z, 19950412 A Comparative Utility Analysis of Case-Based Reasoning and Control-Rule Learning Systems Anthony G. Francis, Jr. and Ashwin Ram College of Computing Georgia Institute of Technology Atlanta, Georgia 30332-0280 (404) 853-9381, (404) 853-9372 {centaur, ashwin}@cc.gatech.edu
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/centaur/function.ps.Z, 19950412 PSYCHOLOGICAL ASPECTS OF MOORE: THE MEMORY ORGANIZATION AND OPTIMIZED RETRIEVAL ENGINE Anthony G. Francis, Jr. College of Computing Georgia Institute of Technology Atlanta, Georgia 30332-0280 centaur@cc.gatech.edu
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/centaur/akr95-a.ps.Z, 19950418 1 A Domain-Independent Algorithm for Multi-Plan Adaptation and Merging in Least-Commitment Planners Anthony G. Francis, Jr. and Ashwin Ram* College of Computing Georgia Institute of Technology Atlanta, Georgia 30332-0280 {centaur, ashwin}@cc.gatech.edu * This research was supported by the United States
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1995/wucs-95-07.ps.Z, 19950419 MAINTAINING HIGH THROUGHPUT DURING OVERLOAD IN ATM SWITCHES Jonathan S. Turner wucs-95-07 April 18, 1995 Department of Computer Science Campus Box 1045 Washington University One Brookings Drive St. Louis, MO 63130-4899
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/er-95-09.ps, 19950419 Interacting Learning-Goals: Treating Learning as a Planning Task Michael T. Cox and Ashwin Ram Georgia Institute of Technology. Atlanta, GA 30332-0280 {cox,ashwin}@cc.gatech.edu
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/centaur/ecml95c.ps.Z, 19950421 A Comparative Utility Analysis of Case-Based Reasoning and Control-Rule Learning Systems Anthony G. Francis, Jr. and Ashwin Ram College of Computing Georgia Institute of Technology Atlanta, Georgia 30332-0280 (404) 853-9381, (404) 853-9372 {centaur, ashwin}@cc.gatech.edu
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1995/wucs-95-10.ps.Z, 19950427 PAC Learning of One-Dimensional Patterns PAUL W. GOLDBERG pwgoldb@cs.sandia.gov Sandia National Laboratories, MS 1110, P.O. Box 5800, Albuquerque, NM 87185-1110, U.S.A. SALLY A. GOLDMAN sg@cs.wustl.edu Dept. of Computer Science, Washington University, St. Louis, MO 63130 STEPHEN D. SCOTT
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1995/wucs-95-08.ps.Z, 19950428 1
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1995/wucs-95-09.ps.Z, 19950428 An Efficient Signaling Structure for ATM Networks WUCS-95-09 Dakang Wu Department of Computer Science Washington University dw@dworkin.wustl.edu April 25, 1995
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1995/wucs-95-11.ps.Z, 19950503 Reliable FIFO Load Balancing over Multiple FIFO Channels Hari Adiseshu, Gurudatta M. Parulkar and George Varghese WUCS-95-11 May 3, 1995 Department of Computer Science Campus Box 1045 Washington University One Brookings Drive St. Louis, MO 63130-4899
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/philosophy/clarkchalmers.extended.ps, 19950518 The Extended Mind Andy Clark & David Chalmers Department of Philosophy Washington University St. Louis, Missouri 63130 andy@twinearth.wustl.edu dave@twinearth.wustl.edu April 10, 1995 1 Introduction Where does the mind stop and the rest of the world begin The question invites two standard replies. Some
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/philosophy/mccann.goldmarket.ps, 19950518 A Neural Network Model for the Gold Market Peter J. McCann Department of Computer Science Washington University Campus Box 1045 St. Louis, Missouri 63130-4899 pjm3@cs.wustl.edu Barry L. Kalman Department of Computer Science Washington University Campus Box 1045 St. Louis, Missouri 63130-4899
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/philosophy/kalman.trainrec.ps, 19950518 1 TRAINREC: A System for Training Feedforward & Simple Recurrent Networks Efficiently and Correctly Barry L. Kalman and Stan C. Kwasny Department of Computer Science Washington University St. Louis, MO 63130 (314) 935-7539 (314) 935-6123 barry@cs.wustl.edu sck@cs.wustl.edu This material is based upon
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/philosophy/bechtel.embodied.ps, 19950518 Paper for Conference on Reassessing the Cognitive Revolution, York University Draft: Please do not circulate or quote without permission. Embodied Connectionism William Bechtel Department of Philosophy Washington University in St. Louis 1. Cognition Disembodied Among the characteristics of the cognitive
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/philosophy/clark.coupling.ps, 19950518 Happy Couplings: Emergence and Explanatory Interlock Correspondence: Andy Clark Department of Philosophy Washington University in St. Louis St. Louis, MO 63130 U.S.A. Phone: (314) 935 7147 Fax: (314) 935 7349 email: andy@twinearth.wustl.edu 0. Emergence and Explanation 1. Some Explanatory Styles 2.
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/philosophy/christiansen.language-learning.ps, 19950518 Language Learning in the Full or, Why the stimulus might not be so poor after all Morten H. Christiansen Philosophy-Neuroscience-Psychology Program Department of Philosophy Washington University in St. Louis Campus Box 1073 St. Louis, MO 63130 morten@twinearth.wustl.edu January 6, 1994
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/philosophy/bechtel.language.ps, 19950518 WHAT KNOWLEDGE MUST BE IN THE HEAD IN ORDER TO ACQUIRE LANGUAGE William Bechtel Department of Philosophy Washington University in St. Louis 1. Localizationist Dangers in the Study of Language Many studies of language, whether in philosophy, linguistics, or psychology, have focused on highly developed
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1993/wucs-93-30.ps.Z, 19950518 AN OPTIMAL NONBLOCKING MULTICAST VIRTUAL CIRCUIT SWITCH Jonathan S. Turner wucs-93-30 March 23, 1994 Department of Computer Science Campus Box 1045 Washington University One Brookings Drive St. Louis, MO 63130-4899
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/philosophy/bechtel.conn-phil-sci.ps, 19950518 Support for this research was provided by the American Society for Cell Biology, the 1 National Endowment for the Humanities (RH-21013-91) and Georgia State University, all of which are gratefully acknowledged. I also thank Robert McCauley for his comments on an earlier draft of this manuscript. This is
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/arl/CMNP_spec_DRAFT.ps.Z, 19950518 Connection Management Network Protocol (CMNP) Specification 1 of 60 Applied Research Laboratory DRAFT Zeus Project Connection Management Network Protocol (CMNP) Specification John DeHart Dakang Wu Version 1.0 November 4, 1993 Applied Research Laboratory Department of Computer Science Washington
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1995/wucs-95-12.ps.Z, 19950518 ISSUES IN DISTRIBUTED CONTROL FOR ATM NETWORKS Jonathan S. Turner Washington University, St. Louis jst@cs.WUSTL.edu wucs-95-12 May 17, 1995 Department of Computer Science Campus Box 1045 Washington University One Brookings Drive St. Louis, MO 63130-4899
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1991/wucs-91-45.ps.Z, 19950518 Project Zeus: Design of a Broadband Network and its Application on a University Campus Jerome R. Cox, Jr. and Jonathan S. Turner wucs-91-45 February 1, 1995 Department of Computer Science Campus Box 1045 Washington University One Brookings Drive St. Louis, MO 63130-4899
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/philosophy/christiansen.nlp-recursion.ps, 19950518 Natural Language Recursion and Recurrent Neural Networks Morten H. Christiansen Nick Chater Philosophy-Neuroscience-Psychology Program Neural Networks Research Group Department of Philosophy Department of Psychology Washington University in St. Louis University of Edinburgh Campus Box 1073 7 George
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/philosophy/bechtel.consciousness.ps, 19950518 August 31, 1994 Consciousness: Perspectives from Symbolic and Connectionist AI William Bechtel Program in Philosophy, Neuroscience, and Psychology Department of Philosophy Washington University in St. Louis 1. Computational Models of Consciousness For many people, consciousness is one of the defining
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/philosophy/chalmers.consciousness.ps, 19950518 Facing Up to the Problem of Consciousness David J. Chalmers Department of Philosophy Washington University St. Louis, Missouri 63130 dave@twinearth.wustl.edu December 16, 1994 1 Introduction Consciousness poses the most baffling problems in the science of the mind. There is nothing that we know more
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/philosophy/chalmers.computation.ps, 19950518 A Computational Foundation for the Study of Cognition David J. Chalmers Department of Philosophy Washington University St. Louis, Missouri 63130 dave@twinearth.wustl.edu May 13, 1994 Short abstract Computation is central to the foundations of modern cognitive science, but its role is controversial.
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/philosophy/kwasny.sraam.ps, 19950518 Ta il-Recursive Distributed Representations and Simple Recurrent Networks Stan C. Kwasny Barry L. Kalman WUCS-93-52 November,1993 Department of Computer Science Campus Box 1045 Washington University One Brookings Drive St. Louis, Missouri 63130-4899 sck@cs.wustl.edu barry@cs.wustl.edu This material is
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/philosophy/anderson.neurocomp.ps, 19950518 Neurobiological Computational Systems Charles H. Anderson and David C. Van Essen Dept. of Anatomy and Neurobiology Washington University School of Medicine St. Louis, MO 63110 Presented at the: IEEE World Congress on Computational Intelligence Orlando, FL. June 26-July 1, 1994. I. Introduction
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/philosophy/bechtel.deduction.ps, 19950518 Natural Deduction in Connectionist Systems William Bechtel Department of Philosophy Program in Philosophy, Neuroscience, and Psychology Washington University in St. Louis Abstract The relation between logic and thought has long been controversial, but has recently influenced theorizing about the nature
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/philosophy/clark.trading-spaces.ps, 19950518 Trading Spaces: Computation, Representation and the Limits of Uninformed Learning Andy Clarky Philosophy/Neuroscience/Psychology Program Washington University in St Louis Campus Box 1073 St Louis MO-63130 USA Email: andy@twinearth.wustl.edu Chris Thornton Cognitive and Computing Sciences University of
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/philosophy/chalmers.qualia.ps, 19950518 Absent Qualia, Fading Qualia, Dancing Qualia David J. Chalmers Department of Philosophy Washington University St. Louis, Missouri 63130 dave@twinearth.wustl.edu June 18, 1994 1 The principle of organizational invariance It is widely accepted that conscious experience has a physical basis. That is, the
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/math/papers/eawdmsi.ps.Z, 19950522 Experiments with Adapted Wavelet De-Noising for Medical Signals and Images Ronald R. Coifman, Ph.D.y Mladen Victor Wickerhauser, Ph.D.z May 18, 1995
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/philosophy/chalmers.rock.ps, 19950523 Does a Rock Implement Every Finite-State Automaton David J. Chalmers
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/philosophy/chalmers.availability.ps, 19950523 Availability: The Cognitive Basis of Experience David J. Chalmers Department of Philosophy Washington University St. Louis, Missouri 63130 dave@twinearth.wustl.edu February 14, 1995 Block's distinction between access consciousness and phenomenal consciousness (or experience) is very useful. There is
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/philosophy/chalmers.content.ps, 19950523 The Components of Content David J. Chalmers Department of Philosophy Washington University St. Louis, Missouri 63130 dave@twinearth.wustl.edu May 9, 1995 1 Introduction Here are six puzzles about the contents of thought.1 (1) Is content in the head I believe that water is wet. My twin on Twin Earth,
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/cox/Papers/intro-chapt.ps.gz, 19950524 1 Part One PRELIMINARIES 2 CHAPTER I INTRODUCTION Discus, starred with premonitions, throw yourself out of yourself. Paul Celan. 1.1 Research Motivation An intelligent agent learns from its mistakes; a fool is doomed to repeat them. Thus, if we want to understand intelligence, it is important to
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/er-95-02.ps.Z, 19950526 Published in Machine Learning: ECML-95: 8th European Conference on Machine Learning, Heraclion, Crete, Greece, April 1995. Proceedings. Lavrac, N. & Wrobel, S. (eds). Lecture Notes in Artificial Intelligence, vol 912. Springer-Verlag. A Comparative Utility Analysis of Case-Based Reasoning and
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/carlos/larc.ps, 19950531 Multistrategy Learning of Adaptive Reactive Controllers Juan Carlos Santamar a and Ashwin Ram College of Computing Georgia Institute of Technology Atlanta, Georgia 30332-0280 E-mail: fcarlos,ashwing@cc.gatech.edu Phone: (404) 853-9372 Fax: (404) 853-9378
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1995/wucs-95-16.ps.Z, 19950531 An Interactive Model of Teaching H. DAVID MATHIAS dmath@cs.wustl.edu Dept. of Computer Science, Washington University, St. Louis, MO 63130 WUCS-95-16 May 1995
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1995/wucs-95-03.ps.Z, 19950614 ARAS: Asynchronous RISC Architecture Simulator1 Chia-Hsing Chien, Mark A. Franklin, Tienyo Pan2 , and Prithvi Prabhu Computer and Communications Research Center Washington University St. Louis, Missouri, 63130-4899 U.S.A.
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/kennethm/Papers/aaai94.ps, 19950630 In Proceedings of the 12th National AAAI Conference, Seattle, WA, August 1994 A Model of Creative Understanding Kenneth Moorman and Ashwin Ram Georgia Institute of Technology College of Computing Atlanta, GA 30332-0280 fkennethm,ashwing@cc.gatech.edu
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1995/wucs-95-19.ps.Z, 19950710 7 Common Questions 12 EUPHORIA Reference Manual Washington University Department of Computer Science bered that EUPHORIA is part of a distributed system; if the EUPHORIA module monopolizes the CPU, external modules will run slower which, in turn, will make EUPHORIA run slowly. Also, if other modules
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1995/wucs-95-21.ps.Z, 19950720 Efficient Demultiplexing of Network Packets by Automatic Parsing Mahesh Jayaram Ron K. Cytron wucs-95-21 July 19, 1995 Department of Computer Science Campus Box 1045 Washington University One Brookings Drive St. Louis, MO 63130-4899 This work supported by the National Science Foundation Grant
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1995/wucs-95-25.ps.Z, 19950815 WASHINGTON UNIVERSITY IN ST LOUIS Washington School of Engineering & Applied Science Saint Louis, MO 63130-4899One Brookings DriveCampus Box 1045Washington UniversityDepartment of Computer Science Printed 8/9/95 Reasoning about Program Interactions in the Presence of Mobility Gruia-Catalin Roman Peter
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/math/papers/fw.ps.Z, 19950816 Construction of Minimally-Supported-Frequencies Wavelets Xiang Fang Xihua Wang December 13, 1994
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/math/papers/hww1.ps.Z, 19950816 Smoothing Minimally Supported Frequency (MSF) Wavelets : Part I Eugenio Hern andez Xihua Wang Guido Weissy March 31, 1995
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1995/wucs-95-20.ps.Z, 19950816 Building Interactive Distributed Applications in C++ with The Programmers' Playground Kenneth J. Goldman, T. Paul McCartney, Ram Sethuraman, Bala Swaminathan, and Todd Rodgers WUCS-95-20 July 1995 Department of Computer Science Washington University Campus Box 1045 One Brookings Drive Saint Louis, MO
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/math/papers/hww2.ps.Z, 19950816 Smoothing Minimally Supported Frequency (MSF) Wavelets : Part II Eugenio Hern andez Xihua Wang Guido Weissy May 19, 1995
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/d-95.01.ps.Z, 19950817 Submitted to Machine Learning. Multistrategy Learning of Adaptive Reactive Controllers Juan Carlos Santamar a and Ashwin Ram College of Computing Georgia Institute of Technology Atlanta, Georgia 30332-0280 E-mail: fcarlos,ashwing@cc.gatech.edu Phone: (404) 853-9372 Fax: (404) 853-9378
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1995/wucs-95-26.ps.Z, 19950818 WASHINGTON UNIVERSITY IN ST LOUIS Washington School of Engineering & Applied Science Saint Louis, MO 63130-4899One Brookings DriveCampus Box 1045Washington UniversityDepartment of Computer Science Assertional Reasoning about Pairwise Transient Interactions in Mobile Computing Gruia-Catalin Roman Peter
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1995/wucs-95-29.ps.Z, 19950822 EUPHORIA: End-User Construction of Direct Manipulation User Interfaces for Distributed Applications T. Paul McCartney, Kenneth J. Goldman, and David E. Saff WUCS-95-29 Department of Computer Science Washington University Campus Box 1045 One Brookings Drive Saint Louis, MO 63130-4899 August 1995 1
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1995/wucs-95-27.ps.Z, 19950823 1 Time Variability While Training a Parallel Neural Net Network Tina I. Seawell and Barry L. Kalman
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/math/papers/tw.ps.gz, 19950823 A Relation Between Shannon{Weaver Entropy and Theoretical Dimension" for Classes of Smooth Functions y Aurelija Trgoz Mladen Victor Wickerhauserx August 22, 1995
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/er-95-06.ps, 19950905 Proceedings of the Fourth World Conference on Engineering Education St. Paul, Minnesota; October, 1995. STRUCTURING ON-THE-JOB TROUBLESHOOTING PERFORMANCE TO AID LEARNING Brian Minsk Center for Human-Machine Systems Research School of Industrial & Systems Engineering Georgia Institute of Technology
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/math/papers/connec.ps.gz, 19950914 Multiplication of Short Wavelet Series Using Connection Coefficients Valerie Perrier y Mladen Victor Wickerhauser z September 14, 1995
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/cox/Papers/Thesis/theories-chapt.ps.gz, 19950925 36 CHAPTER II CONTENT THEORIES AND PROCESS THEORIES By distinguishing sharply between the knowledge level and the symbol level the theory implies an equally sharp distinction between the knowledge required to solve a problem and the processing required to bring that knowledge to bear in real time and
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/cox/Papers/Thesis/references.ps.gz, 19950925 244 References for Chapter I Boring, E. G. (1953). A history of introspection. Psychological Bulletin, 50(3), 169-189. Cox, M. T. (1991). Reasoning about Reasoning via META-XPs. Unpublished. Cox, M. T. (1992). Toward an Epistemological Treatment of the Blame Assignment Problem. Unpublished. Cox, M. T.
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/cox/Papers/Thesis/frontmatter.ps.gz, 19950925 INTROSPECTIVE MULTISTRATEGY LEARNING: Constructing a Learning Strategy under Reasoning Failure A Thesis Presented to The Academic Faculty by Michael T. Cox In Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy in Computer Science Georgia Institute of Technology November, 1995 ii
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/cox/Papers/Thesis/symptoms-chapt.ps.gz, 19950925 52 Part Two A CONTENT THEORY OF MENTAL REPRESENTATION 53 CHAPTER III SYMPTOMS AND CAUSES OF FAILURE: THE CONTENT The general idea of failure-based understanding is that examining how we make comparisons between our expectations and what actually occurs is the key to our knowledge of the understanding
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/cox/Papers/Thesis/theories-chapt-refs.ps.gz, 19950926 248 References for Chapter II Aho, A. V., & Ullman, J. D. (1992). Foundations of computer science. New York: Computer Science Press. Birnbaum, L. (1986). Integrated Processing in Planning and Understanding (Tech. Rep. No. 489). Doctoral dissertation, New Haven, CT: Yale University. Birnbaum, L. (1991).
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/cox/Papers/Thesis/symptoms-chapt-refs.ps.gz, 19950926 249 References for Chapter III Arkin, R. (1987). Towards cosmopolitan robots: Intelligent navigation in extended manmade environments (Tech. Rep. No. 87-80). Doctoral dissertation. Computer and Information Science, University of Massachusetts, Amherst, MA. Birnbaum, L., and Collins, G. (1984).
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/cox/Papers/Thesis/intro-chapt-refs.ps.gz, 19950926 244 References for Chapter I Boring, E. G. (1953). A history of introspection. Psychological Bulletin, 50(3), 169-189. Cox, M. T. (1991). Reasoning about Reasoning via META-XPs. Unpublished. Cox, M. T. (1992). Toward an Epistemological Treatment of the Blame Assignment Problem. Unpublished. Cox, M. T.
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/math/papers/emb.ps.gz, 19950930 Adapted Waveform De-Noising for Medical Signals and Images Ronald R. Coifman, Ph.D.y Mladen Victor Wickerhauser, Ph.D.z January 5, 1995
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/carlos/papers/er-94-01.ps.Z, 19951004 Proceedings of the International Conference of Intelligent Robots and Systems (IROS-94), vol. 1, pp. 64{72, Munich, Germany, September 1994. Model-based Echolocation of Environmental Objects Juan Carlos Santamar a and Ronald C. Arkin Mobile Robot Laboratory College of Computing Georgia Institute of
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/carlos/papers/er-95-02.ps.Z, 19951005 To appear in the Proceedings of the SPIE Photonic East 95 - Mobile Robots X Conference, Philadelphia, Pennsylvania, October 1995. Structured Light Systems for Dent Recognition: Lessons Learned Juan C. Santamar a College of Computing Georgia Institute of Technology Atlanta, Georgia 30332-0280 U.S.A.
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/bhatta/detogm-aiedam95.ps.Z, 19951017 From Design Experiences To Generic Mechanisms: Model-Based Learning in Analogical Design Sambasiva R. Bhatta and Ashok K. Goel College of Computing Georgia Institute of Technology Atlanta, Georgia 30332-0280 fbhatta,goelg@cc.gatech.edu
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1995/wucs-95-30.ps.Z, 19951018 Design of a Tool for Rapid Prototyping of Communication Protocols Aniruddha Gokhale (gokhale@cs.wustl.edu) Ron Cytron (cytron@cs.wustl.edu) George Varghese (varghese@cs.wustl.edu) Department of Computer Science Washington University Box 1045 St. Louis, MO 63130 Phone: (314)935-6160 Fax: (314)935-7302
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/cox/Papers/Thesis/proc-chapt.ps.gz, 19951019 135 Part Three A PROCESS THEORY OF LEARNING AND INTROSPECTION 136 CHAPTER V A PROCESS THEORY OF UNDERSTANDING AND LEARNING Learning without creativity is like a butterfly without wings. Anonymous (from a fortune cookie following a Korean meal). In most cognitive science theories, problem solving,
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/cox/Papers/Thesis/proc-chapt-refs.ps.gz, 19951019 321 References for Chapter V Anderson, J. R. (1983). The architecture of cognition. Cambridge, MA: Harvard University Press. Anderson, J. R. (1993). Rules of the mind. Hillsdale, NJ: Lawrence Erlbaum Associates. Barsalou, L. W. (1995). Storage side effects: Studying processing to understand learning. In
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/cox/Papers/Thesis/learn-chapt-refs.ps.gz, 19951019 329 References for Chapter VII Birnbaum, L. (1986). Integrated processing in planning and understanding (Tech. Rep. No. 489). Doctoral dissertation, Yale University, New Haven, CT. Brodley, C. E. (1993). Addressing the selective superiority problem: Automatic algorithm / model class selection. In
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/arl/infocom91.ps.Z, 19951019 MULTIPOINT CONNECTION MANAGEMENT IN HIGH SPEED NETWORKS Rick Bubenik John DeHart Mike Gaddis Applied Research Laboratory Department of Computer Science Washington University St. Louis, Missouri 63130-4899
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/arl/icc92.ps.Z, 19951019 A Call Model For Multipoint Communication in Switched Networks Michael E. Gaddis Rick Bubenik John D. DeHart Applied Research Laboratory Department of Computer Science Washington University St. Louis, Missouri 63130-4899 1 Introduction Multimedia workstations, characterized by video, audio and data
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/cox/Papers/Thesis/cbi-chapt-refs.ps.gz, 19951019 326 References for Chapter VI Aamodt, A. (1994). Explanation-driven case-based reasoning. In S. Wess, K.-D. Althoff, and M. M. Richter (Eds.), Topics in case-based reasoning (EWCBR-93) (pp. 274-288). Berlin: Springer-Verlag. Ashley, K. D., & Rissland, E. L. (1988). A case-based approach to modeling
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/arl/ncf90.ps.Z, 19951019 Connection Management for a Prototype Fast Packet ATM B-ISDN Network Mike Gaddis, Rick Bubenik, John DeHart Applied Research Laboratory Department of Computer Science Washington University St. Louis, Missouri 63130
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1995/wucs-95-22.ps.Z, 19951030 User Interface Applications of a Multi-way Constraint Solver T. Paul McCartney WUCS-95-22 Department of Computer Science Washington University Campus Box 1045 One Brookings Drive Saint Louis, MO 63130-4899 October 1995 User Interface Applications of a Multi-way Constraint Solver 1 User Interface
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/cox/Papers/Thesis/cbi-chapt.ps.gz, 19951101 174 CHAPTER VI CASE-BASED INTROSPECTION The best part of human language, properly so called, is derived from reflection on the act of the mind itself. Samuel Taylor Coleridge (1817) The goals of this chapter are to specify how a system might reflect upon its reasoning so as to understand why its
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/cox/Papers/Thesis/learn-chapt.ps.gz, 19951101 202 CHAPTER VII LEARNING AS A NON-LINEAR PLANNING TASK I think people tend to forget that trees are living creatures. They re sort of like dogs. Huge, quiet, motionless dogs, with bark instead of fur. Deep Thoughts by Jack Handey Humans are amazing in their seemingly effortless ability to learn, yet the
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1995/wucs-95-06.ps.Z, 19951102 Real-time Upcalls: A Mechanism to Provide Real-time Processing Guarantees 9/21/95 19 Feldmeir, D.C., Multiplexing Issues in Communication System Design, Proc. ACM Sigcomm, October 1990, pp. 209-219. Gopalakrishnan, R., Parulkar, G.M., Efficient Quality of Service Support in Multimedia Computer
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1995/wucs-95-17.ps.Z, 19951107 Formal Specification of a Dynamically Configurable Distributed System Ram Sethuraman and Kenneth J. Goldman WUCS-95-17 July 1995 (revised November 3, 1995) Department of Computer Science Washington University Campus Box 1045 One Brookings Drive Saint Louis, MO 63130{4899 Formal Specification of a
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1994/wucs-94-33.ps.Z, 19951107 Distributed Data Layout, Scheduling and Playout Control in a Large Scale Multimedia Storage Server Milind M. Buddhikot, Guru Parulkar wucs-94-33 July 94 Department of Computer Science Campus Box 1045 Washington University One Brookings Drive St. Louis, MO 63130-4899 This work was supported in part by
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1995/wucs-95-31.ps.Z, 19951117 An OO Encapsulation of Lightweight OS Concurrency Mechanisms in the ACE Toolkit Douglas C. Schmidt schmidt@cs.wustl.edu http://www.cs.wustl.edu/ schmidt/ Department of Computer Science Washington University St. Louis, MO 63130, (314) 935-7538 This document is available as technical report number
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/cox/Papers/Thesis/future-res-chapt.ps.gz, 19951118 333 CHAPTER X FUTURE RESEARCH Man is not the sum of what he has but the totality of what he does not yet have, of what he might have. Jean Paul Sartre (1939) The effort to construct the theory and implementation presented in this document has been substantial and, as a result, a few questions have been
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/cox/Papers/Thesis/future-res-chapt-refs.ps.gz, 19951118 491 References for Chapter X Allen, J., Hendler, J., & Tate, A. (Eds.). (1990). Readings in planning. San Mateo, CA: Morgan Kaufmann. Anderson, J. R. (1983). A spreading activation theory of memory. Journal of Verbal Learning and Verbal Behavior, 22, 261-295. Barsalou, L. W. (1983). Ad hoc categories.
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/cox/Papers/Thesis/appendix-b.ps.gz, 19951120 397 APPENDIX B META-AQUA OUTPUT IN STORY UNDERSTANDING MODE Recreate story T6585 by calling (re-run-story T6585) One day Elvis was bored.Elvis pushed cupboard-door away from the cupboard1. The cupboard1 was open. He took the pipe1 from the cupboard1. He had the pipe1. The cupboard1 didn t have the
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/cox/Papers/Thesis/appendix-a.ps.gz, 19951120 392 APPENDIX A THE DEGREES OF FREEDOM IN LEARNING IML theory contains a preference for failed experiences, rather than successful ones. The detection of a failure in an input stream is equivalent to self-selection of training examples. Although by filtering examples of successful performance the
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/cox/Papers/Thesis/appendix-d.ps.gz, 19951120 439 APPENDIX D META-AQUA OUTPUT IN LISP PROGRAMMING MODE Begin Meta-AQUA. Continue (Y or N) Yes. Input Structure: EACH-ONE-GREATER.241 NIL Continue (Y or N) Yes. Input Structure: EACH-ONE-GREATER.241 NIL Continue (Y or N) Yes. Retrieving plan for concept EACH-ONE-GREATER.241 Produced plan:
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/cox/Papers/Thesis/appendix-c.ps.gz, 19951120 427 APPENDIX C STORY LISTINGS FOR RUN NUMBER FOUR Story number 1 . . . One day ...MOM was BORED. Mom asked Karen, Would you push the balloon3 to me away from you She asked her, Would I take the balloon3 from me She pushed cupboard-door away from the cupboard1. The cupboard1 was open. She took the
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1995/wucs-95-23.ps.Z, 19951207 Redesigning the BSD Callout and Timer Facilities Adam M. Costello and George Varghese wucs-95-23 2 Nov 1995 Department of Computer Science Campus Box 1045 Washington University One Brookings Drive St. Louis, MO 63130-4899
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1995/wucs-95-34.ps.Z, 19951207 A Single-Stroke Orientation-Orient Gesture System Hu, Yike 1. INTRODUCTION Accompanying development of pen-based computers, a new tool of human-computer interaction -- the gesture system has been created and put in really use in some products. Compared to the traditional keyboard-based command and
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1995/wucs-95-24.ps.Z, 19951219 Self-Stabilization by Window Washing Adam M. Costello and George Varghese wucs-95-24 13 Dec 1995 Department of Computer Science Campus Box 1045 Washington University One Brookings Drive St. Louis, MO 63130-4899
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1995/wucs-95-35.ps.Z, 19960108 Error Control for Continuous Media and Multipoint Applications Christos Papadopoulos and Guru Parulkar WUCS-95-35 December 1995 Department of Computer Science Washington University Campus Box 1045 One Brookings Drive St. Louis MO 63130-4899 This work was presented in part at the 6th Maryland Workshop on
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/centaur/mpa-10.ps, 19960116 To appear in Leake, D.B., editor (in press), Case-Based Reasoning: Experiences, Lessons, and Future Directions, AAAI Press. 1 8/7, 8/7, 3 3/$1 /$1 55(75,(9$/ $1' (75,(9$/ $1' $$'$37$7,21 ,1 '$37$7,21 ,1 $1 $1 ((;3(5,(1&( ;3(5,(1&( % %$6(' $6(' $$(17 (17 $VKZLQ 5DP $VKZLQ 5DP DQG $QWKRQ * )UDQFLVffl
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/cox/Papers/Thesis/eval-chapt-refs.ps.gz, 19960119 490 References for Chapter IX Anderson, J. R., & Reiser, B. J. (1985, April). The LISP tutor. BYTE, pp. 159-175. Ayer, A. J. (1952). Language, truth and logic. New York: Dover Publications. (Original work published in 1936) Boring, E. G. (1953). A history of introspection. Psychological Bulletin, 50(3),
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/cox/Papers/Thesis/meta-aqua-chapt-refs.ps.gz, 19960119 487 References for Chapter VIII Bhatta, S. (1995). Model-based analogy in innovative device design. Doctoral dissertation. Georgia Institute of Technology, College of Computing, Atlanta. Booker, L. B., Goldberg, D. E. & Holland, J. H. (1989). Classifier systems and genetic algorithms. Artificial
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/cox/Papers/Thesis/meta-aqua-chapt.ps.gz, 19960119 246 Part Four IMPLEMENTATION AND CONCLUSION 247 CHAPTER VIII META-AQUA Total grandeur of a total edifice, Chosen by an inquisitor of structures For himself. He stops upon this threshold As if the design of all his words takes form And frame from thinking and is realized. Wallace Stevens (1952). The
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/cox/Papers/Thesis/eval-chapt.ps.gz, 19960119 296 CHAPTER IX EVALUATION The answ er is that we test the validity of an empirical hypothesis by seeing whether it actually fulfills the function which it is designed to fulfil. And we have seen that the function of an empirical hypothesis is to enable us to anticipate experience. Accordingly, if an
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/cox/Papers/goal-interact.ps.gz, 19960122 Interacting Learning-Goals: Treating Learning as a Planning Task Michael T. Cox and Ashwin Ram Georgia Institute of Technology. Atlanta, GA 30332-0280 {cox,ashwin}@cc.gatech.edu
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/cox/Papers/Thesis/intro-chapt.ps.gz, 19960122 1 Part One PRELIMINARIES 2 CHAPTER I INTRODUCTION WURFSCHEIBE, mit DISCUS, Vorgesichten besternt, starred with premonitions, wirf dich throw yourself aus dir hinaus. out of yourself. Paul Celan (1970). translation (1986). This research investigates goal-driven learning by creating a computational model
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/cox/Papers/Thesis/repr-chapt-refs.ps.gz, 19960123 1 References for Chapter IV Almonayyes, A. (1994). Improving problem understanding through case-based reasoning: A case study in the domain of international conflicts. In J. W. Brahan & G. E. Lasker (Eds.), Proceedings of the Seventh International Conference on Systems Research, Informatics and
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/cox/Papers/Thesis/repr-chapt.ps.gz, 19960123 98 CHAPTER IV MENTAL STATES AND MECHANISMS: THE REPRESENTATION But the number of those which are simple and primitive is not very large. For, in making a review of all those in which I have enumerated, we may easily notice that there are but six which are such, i.e. wonder, love, hatred, desire, joy and
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/wucs-96-02.ps.Z, 19960124 Design and Implementation of a Practical Security-Conscious Electronic Polling System Lorrie Faith Cranor Ron K. Cytron WUCS-96-02 January 23, 1996 Department of Computer Science Campus Box 1045 Washington University One Brookings Drive St. Louis, MO 63130-4899
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1996/wucs-96-02.ps.Z, 19960126 Design and Implementation of a Practical Security-Conscious Electronic Polling System Lorrie Faith Cranor Ron K. Cytron WUCS-96-02 January 23, 1996 Department of Computer Science Campus Box 1045 Washington University One Brookings Drive St. Louis, MO 63130-4899
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/d-94-02.ps.Z, 19960219 Continuous Case-Based Reasoning Ashwin Ram and Juan Carlos Santamar a College of Computing Georgia Institute of Technology February 19, 1996
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/carlos/resume-brief.ps, 19960220 CURRICULUM VITAE JUAN CARLOS SANTAMARIA Ph.D. Candidate College of Computing Georgia Institute of Technology Atlanta, GA 30332{0280 (404) 853{9381 E-mail: carlos@cc.gatech.edu OBJECTIVE To work on a project dealing with automated reasoning, planning, or scheduling. EDUCATION Jan. 93 - Ph.D. in Computer
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/centaur/mpa-eba.ps.Z, 19960223 To appear in Leake, D.B., editor (in press), Case-Based Reasoning: Experiences, Lessons, and Future Directions, AAAI Press. 1 8/7, 8/7, 3 3/$1 /$1 55(75,(9$/ $1' (75,(9$/ $1' $$'$37$7,21 ,1 '$37$7,21 ,1 $1 $1 ((;3(5,(1&( ;3(5,(1&( % %$6(' $6(' $$(17 (17 $VKZLQ 5DP $VKZLQ 5DP DQG $QWKRQ * )UDQFLVffl
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/chapters/chapt-6.ps.gz, 19960225 188 CHAPTER VI CASE-BASED INTROSPECTION The best part of human language, properly so called, is derived from reflection on the act of the mind itself. Samuel Taylor Coleridge (1817) The goals of this chapter are to specify how a system might reflect upon its reasoning so as to understand why its
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/chapters/chapt-5.ps.gz, 19960225 147 Part Three A PROCESS THEORY OF LEARNING AND INTROSPECTION 148 CHAPTER V A PROCESS THEORY OF UNDERSTANDING AND LEARNING Learning without creativity is like a butterfly without wings. Anonymous (from a fortune cookie following a Korean meal). In most cognitive science theories, problem solving,
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/chapters/chapt-4.ps.gz, 19960225 98 CHAPTER IV MENTAL STATES AND MECHANISMS: THE REPRESENTATION But the number of those which are simple and primitive is not very large. For, in making a review of all those in which I have enumerated, we may easily notice that there are but six which are such, i.e. wonder, love, hatred, desire, joy and
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/chapters/chapt-7.ps.gz, 19960225 217 CHAPTER VII LEARNING AS A NON-LINEAR PLANNING TASK I think people tend to forget that trees are living creatures. They re sort of like dogs. Huge, quiet, motionless dogs, with bark instead of fur. Deep Thoughts by Jack Handey.80 Humans are amazing in their seemingly effortless ability to learn, yet
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/chapters/abbrevs.ps.gz, 19960225 xxviii LIST OF ABBREVIATIONS AAAI American Association for Artificial Intelligence ACT Adaptive Character of Thought AI Artificial Intelligence BK Background Knowledge CBR Case-Based Reasoning CD Conceptual Dependency D-C-Node Decide-Compute-Node EBG Explanation-Based Generalization FK Foreground
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/chapters/appendix-b.ps.gz, 19960225 453 APPENDIX B META-AQUA OUTPUT IN STORY UNDERSTANDING MODE Recreate story T6585 by calling (re-run-story T6585) One day Elvis was bored.Elvis pushed cupboard-door away from the cupboard1. The cupboard1 was open. He took the pipe1 from the cupboard1. He had the pipe1. The cupboard1 didn t have the
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/chapters/chapt-8.ps.gz, 19960225 249 Part Four IMPLEMENTATION AND CONCLUSION 250 CHAPTER VIII META-AQUA Total grandeur of a total edifice, Chosen by an inquisitor of structures For himself. He stops upon this threshold As if the design of all his words takes form And frame from thinking and is realized. Wallace Stevens (1952), pp.
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/chapters/epilog.ps.gz, 19960225 424 CHAPTER XIII EPILOGUE I wish a robot would get elected president. That way, when he came to town, we could all take a shot at him and not feel too bad. Deep Thoughts by Jack Handey.143 But would the above assassin not feel different if she knew that the president-robot had a sense of self Like the
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/chapters/chapt-3.ps.gz, 19960225 57 Part Two A CONTENT THEORY OF MENTAL REPRESENTATION 58 CHAPTER III SYMPTOMS AND CAUSES OF FAILURE: THE CONTENT The general idea of failure-based understanding is that examining how we make comparisons between our expectations and what actually occurs is the key to our knowledge of the understanding
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/chapters/appendix-d.ps.gz, 19960225 496 APPENDIX D META-AQUA OUTPUT IN LISP PROGRAMMING MODE Begin Meta-AQUA. Continue (Y or N) Yes. Input Structure: EACH-ONE-GREATER.241 NIL Continue (Y or N) Yes. Input Structure: EACH-ONE-GREATER.241 NIL Continue (Y or N) Yes. Retrieving plan for concept EACH-ONE-GREATER.241 Produced plan:
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/chapters/index-programs.ps.gz, 19960225 554 A ACT* 397 ANON 220, 251 AQ3 218 AQUA 29, 32, 157, 195, 196, 252, 255, 257, 266, 333 AUTOCLASS 279 Autognostic 287, 392, 394 B BORIS 315 BRIDGER 168 C CASTLE 392, 393, 394 CELIA 193 CHEF 222 CMU LISP tutor 329 CYRUS 251 D DMAP 251, 295 E EITHER 368, 392 F FUNES 251 G GEMINI 169 I ID3 354, 449
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/chapters/chapt-1.ps.gz, 19960225 1 Part One PRELIMINARIES 2 CHAPTER I INTRODUCTION WURFSCHEIBE, mit DISCUS, Vorgesichten besternt, starred with premonitions, wirf dich throw yourself aus dir hinaus. out of yourself. Paul Celan (1970), p. 41. translation (1986), p. 39. This research investigates goal-driven learning by specifying a
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/git-cc-96-06.old.ps.gz, 19960225 INTROSPECTIVE MULTISTRATEGY LEARNING: Constructing a Learning Strategy under Reasoning Failure A Thesis Presented to The Academic Faculty by Michael Thomas Cox In Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy in Computer Science Georgia Institute of Technology February,
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/chapters/chapt-12.ps.gz, 19960225 411 CHAPTER XII CONCLUSIONS I know I see what I know that I know I think and that I don t know. I know what I see. But I forget. But sometimes I forget. I see that I am blind and I see the blinding light And This is the Way in everything, It should be. but I forget. At the end of every forget I
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/chapters/chapt-10.ps.gz, 19960225 350 CHAPTER X FUTURE RESEARCH Man is not the sum of what he has but the totality of what he does not yet have, of what he might have. Jean Paul Sartre (1939) The effort to construct the theory and implementation presented in this document has been substantial and, as a result, a few questions have been
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/chapters/references.ps.gz, 19960225 512 REFERENCES Aamodt, A. (1994). Explanation-driven case-based reasoning. In S. Wess, K.-D. Althoff, and M. M. Richter (Eds.), Topics in case-based reasoning (EWCBR-93) (pp. 274-288). Berlin: Springer-Verlag. Aho, A. V., & Ullman, J. D. (1992). Foundations of computer science. New York: Computer
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/chapters/tables.ps.gz, 19960225 xxiii LIST OF TABLES Table 1: Basic taxonomy of causes of reasoning failure. . . . . . . . . . . . . . 25 Table 2: Logical truth table for reasoning model . . . . . . . . . . . . . . . . . 66 Table 3: Expanded table for reasoning model . . . . . . . . . . . . . . . . . . . 70 Table 4: Final table for
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/chapters/index-gen.ps.gz, 19960225 556 A Aamodt, A. 215, 433 abduction 167, 177 Abelson, R. P. 38, 207, 257, 428, 429 abstract cases 215 abstraction 169, 238, 281, 289, 354 abstraction schema 239 abstraction transmutation 239 achievement goal 207 ACT* 397 action schema 235 action schemas 227 active failure generation 299 actschemas 227
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/www/cbi-chapt.fig_6.ps, 19960225 Figure 1. The drug-bust story (HC1) S1:A police dog sniffed at a passenger s luggage in the airport terminal. S2:The dog suddenly began to bark at the luggage. S3:The authorities arrested the passenger, charging him with smuggling drugs. S4:The dog barked because it detected two kilograms of marijuana
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/chapters/front-matter.ps.gz, 19960226 INTROSPECTIVE MULTISTRATEGY LEARNING: Constructing a Learning Strategy under Reasoning Failure A Thesis Presented to The Academic Faculty by Michael Thomas Cox In Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy in Computer Science Georgia Institute of Technology February,
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/chapters/indiv-chapt-refs/chapt11-refs.ps.gz, 19960228 R-44 References for Chapter XI Anderson, J. R. (1983). The architecture of cognition. Cambridge, MA: Harvard University Press. Anderson, J. R., & Thompson, R. (1989). Use of analogy in a production system architecture. In S. Vosniadou & A. Ortony (Eds.), Similarity and analogical reasoning (pp. 267-
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/chapters/indiv-chapt-refs/chapt6-refs.ps.gz, 19960228 R-26 References for Chapter VI Aamodt, A. (1994). Explanation-driven case-based reasoning. In S. Wess, K.-D. Althoff, and M. M. Richter (Eds.), Topics in case-based reasoning (EWCBR-93) (pp. 274-288). Berlin: Springer-Verlag. Ashley, K. D., & McLaren, B. M. (1995). A CBR knowledge representation for
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/chapters/indiv-chapt-refs/chapt13-refs.ps.gz, 19960228 R-57 References for Chapter XIII Asimov, I. (1942). Runaround. Astounding Science Fiction. Birnbaum, L. (1986). Integrated processing in planning and understanding (Tech. Rep. No. 489). Doctoral dissertation, Yale University, Department of Computer Science, New Haven, CT. Buchanan, B. G., & Smith, R. G.
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/chapters/indiv-chapt-refs/chapt4-refs.ps.gz, 19960228 R-14 References for Chapter IV Almonayyes, A. (1994). Improving problem understanding through case-based reasoning: A case study in the domain of international conflicts. In J. W. Brahan & G. E. Lasker (Eds.), Proceedings of the Seventh International Conference on Systems Research, Informatics and
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/chapters/indiv-chapt-refs/chapt10-refs.ps.gz, 19960228 R-41 References for Chapter X Allen, J., Hendler, J., & Tate, A. (Eds.). (1990). Readings in planning. San Mateo, CA: Morgan Kaufmann. Barsalou, L. W. (1983). Ad hoc categories. Memory & Cognition, 11, 211-227. Barsalou, L. W., Hale, C. H., & Cox, M. T. (1989). MECH: A computer interface for teaching
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/chapters/indiv-chapt-refs/chapt9-refs.ps.gz, 19960228 R-37 References for Chapter IX Anderson, J. R., & Reiser, B. J. (1985, April). The LISP tutor. BYTE, pp. 159-175. Ayer, A. J. (1952). Language, truth and logic. New York: Dover Publications. (Original work published 1936) Boring, E. G. (1953). A history of introspection. Psychological Bulletin, 50(3),
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/git-cc-96-06.ps.gz, 19960306 INTROSPECTIVE MULTISTRATEGY LEARNING: Constructing a Learning Strategy under Reasoning Failure A Thesis Presented to The Academic Faculty by Michael Thomas Cox In Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy in Computer Science Georgia Institute of Technology February,
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/chapters/contents.ps.gz, 19960307 xvi TABLE OF CONTENTS DEDICATION . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . iii ACKNOWLEDGEMENTS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . iv PREFACE . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ix TABLE OF CONTENTS
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1996/wucs-96-04.ps.Z, 19960307 Bringing Real-time Scheduling Theory and Practice Closer for Multimedia Computing R. Gopalakrishnan Gurudatta M. Parulkar gopal@dworkin.wustl.edu guru@flora.wustl.edu Department of Computer Science Washington University in St.Louis
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/www/git-cc-96-06.odd-pages.ps.gz, 19960310 INTROSPECTIVE MULTISTRATEGY LEARNING: Constructing a Learning Strategy under Reasoning Failure A Thesis Presented to The Academic Faculty by Michael Thomas Cox Tech. Rep. No. GIT-CC-96-06 In Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy in Computer Science Georgia Institute
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/www/git-cc-96-06.even-pages.ps.gz, 19960310 442 440 438 TMXP (see Trace Meta-XP) 18, 20, 27, 34, 79, 84, 87, 91, 115, 120, 121, 125, 127, 135, 138, 139, 143, 147, 184, 197, 204, 213, 250, 271, 288 token 149, 162, 190, 191, 192, 195, 269 too many cooks spoil the broth 154, 157 toolbox models 118 Trace Meta-Explanation Pattern 101 Trace Meta-XP
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/www/eval-chapt.fig_25.ps, 19960311 1. Trace Restatement: This strategy is a superficial restatement of the solution in LISP- like terms. We have interpreted it as an attempt to rehearse the material, thus providing a better memory for the information therein. 2. Re-read Solution : Re-reading the solution is a deeper review of the
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/www/intro-chapt.fig_1.ps, 19960311 Figure 1. Andrew s failure (Reprinted with special permission of King Features Syndicate)
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/www/symptoms-chapt.fig_17.ps, 19960311 Figure 1. A reasoner s input
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/www/proc-chapt.fig_58.ps, 19960311 Figure 1. Failure detection algorithm Detect-failure (E, A, trace) begin If (A (outFK) and trace indicates time to event expired) or (A (outFK) and impossible (goal (generate, E))) then return false expectation If E(inFK) then if E A then return contradiction else if E = A then If expected to fail then
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/www/future-res-chapt.fig_1.ps, 19960311 S1:A dog was trained to appear to count. S2:When the trainer held up various objects, it would bark appropriately. S3:The dog barked twice because it detected two bowling pins in his hand. Figure 1. The trick story
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/www/meta-aqua-chapt.fig_64.ps, 19960311 actor sniffbark micro-index.15 more indexing ... dog seal micro-index.16 more indexing ... to micro-index.24123 micro-index.24124 container animate-object micro-index.24127 xp-type.0 xp-type.0 (SELF-CAUSE.49207) (XP-DEFENSIVE-BARK.203) Figure 1. Indexing for items about why dogs bark (ACTOR.1212)
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/www/meta-aqua-chapt.fig_59.ps, 19960311 Figure 1. Learning phase during TS4
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/www/meta-aqua-chapt.fig_56.ps, 19960311 S1: A person was outside a house. S2: The policeman approached the suspect. S3: His dog followed. S4: The policeman saw that the person was near a compost pile. S5: The dog barked at the compost pile. S6: The authorities arrested the suspect for drug possession. S7: The dog barked because he detected
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/www/cbi-chapt.fig_23.ps, 19960311 Unary Goals Knowledge Acquisition Goal Knowledge Refinement Goal Knowledge Expansion Goal Knowledge Organization Goal N-ary Goals Knowledge Differentiation Goal Knowledge Reconciliation Goal Knowledge Organization Goal Figure 1. A taxonomy of learning goals
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/www/future-res-chapt.tbl_4.ps, 19960311 a. The discussion is contained in the introduction to Chapter VIII. Table 1: Extending IML theory Issue for Future Research Section(s) Page(s) Increasing the scope of blame assignment VIIIa 178 Additional goal interactions 7.4 170 New learning algorithms for toolbox 7.5, 8.5.1 173, 197 Parallelism in
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/www/cbi-chapt.fig_32.ps, 19960311 EF Probe Probe ExpectedActual IF RF Not Expected Inappropriate Explanation Missing Explanation Actual Constraint G1 Knowledge Reconciliation G2 Knowledge Differentiation (What Happened) (What Didn t Happen) M M A2 A1 E E C Figure 1. Two learning goals spawned in story HC1 (cf. Figure 55) I I
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/www/meta-aqua-chapt.fig_34.ps, 19960311 Halt Anomalous Interesting More Input Start N N Given Explanation Can Explain Can Explain N Is Right Explanation N Y Y Y Y Had Right Explanation Had Right Explanation Given Explanation Had Right Explanation N N N N Had Right Explanation Y Y N Y N Y N Y Y
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/www/cbi-chapt.fig_29.ps, 19960311 (truth (domain (value Z)) (co-domain (value (inFK))) (status (value question.0))))) Figure 1. Representation of the question Is Z believable
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/www/proc-chapt.fig_54.ps, 19960311 Figure 1. Sub-processes of learning PostScript Lang. Ref. Man., 2nd Ed., H.2.4 says EPS must not call setglobal
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/www/eval-chapt.fig_39.ps, 19960311 ;;; NOTE that the beginning of the definition is just like the definition of a MOP (Memory Organization Packet). ;;; There is one important difference between MOPs and LISP-functions, however. The object that is manipulated ;;; is the precondition state, instead of being something separate. One could
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/www/front-matter.fig_7.ps, 19960311 Figure 1. Cognitive causes of failure 1995 Snowolff
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/www/meta-aqua-chapt.fig_61.ps, 19960311 One day Elvis was jonesing. Elvis took the lighter1 from the table2. He had the lighter1. The table2 didn t have the lighter1. Police and dogs arrived. The phone1 was ringing. Mom picked up phone-receiver1. The phone1 wasn t ringing. She had phonereceiver1. She let go of phone-receiver1. She didn t have
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/www/eval-chapt.fig_32.ps, 19960311 Q0: How can IML theory be evaluated Ans0: Test Hypotheses 1 and 2.
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/www/proc-chapt.fig_56.ps, 19960311 0. Perform and Record Reasoning in Trace 1. Failure Detection on Reasoning Trace 2. If Failure Then Learn from Mistake: 2 a. Blame Assignment Compute index as characterization of failure Retrieve Meta-XP Apply Meta-XP to trace of reasoning If Meta-XP application is successful then Check Meta-XP
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/www/eval-chapt.fig_45.ps, 19960311 2 4 6 8 10 12 14 16 18 2 4 6 8 10 12 14 16 18 20 22 24 Question Points Problem Number Learning Goals Random Learning No Learning Figure 1. Run 4, question points histogram
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/www/proc-chapt.fig_16.ps, 19960311 Reasoning is goal-directed processing of input given some background knowledge. A multistrategy approach is appropriate for both reasoning and learning. Knowledge is memory-based. Learning is failure-driven. Figure 1. Assumptions
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/www/eval-chapt.fig_47.ps, 19960311 20 40 60 80 100 5 10 15 20 25 30 35 40 Cumulative accuracy (% correct) Number of episodes HLNL L42 Mean L20 Figure 1. Cumulative diagnostic accuracy(From Ram, Narayanan & Cox, 1995)
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/www/theories-chapt.fig_4.ps, 19960311 The Story Reasoning about the story Introspective reasoning about Figure 1. Multilevel representations and processes State1 of Mental Story story understanding events Event Mental Event Story Event Character State2 of Character Repr1 Story Repr2 Introsp Repr1 Introsp Repr2 events and objects
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/www/eval-chapt.fig_4.ps, 19960311 Failure Blame Symptoms Failure Causes Learning Goals Learning Plan Assignment Deciding What to Learn Strategy Construction Figure 1. Learning goal ablation Failure Blame Symptoms Failure Causes Learning Plan Assignment Strategy Construction Three phases of fully-introspective multistrategy learning Two
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/www/proc-chapt.fig_31.ps, 19960311 Achieve Achieve Decide what to learn Failure Blame assignment Learning Goal BK1 BK2 FK2 FK1 Anomaly Knowledge Goal Elaborate anomaly Pose question Select learning Select explanation strategy strategy Question-Driven Understanding Input: FK1 Anomaly FK1 BK Output: FK2 such that there exists the
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/www/meta-aqua-chapt.fig_73.ps, 19960311 Figure 1. Sentences from story TS1 corresponding to HC1 S25: The police-dog1 sniffed the vase3. S26: The police-dog1 barked at the vase3. S32: Officer1 arrested Elvis. S37: If the police-dog1 detects the ganja1 then the police-dog1 will bark at the vase3.
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/www/proc-chapt.fig_26.ps, 19960311 Multistrategy Performance Subsystem Learning Subsystem Learning trace Learning Toolbox Algorithm Tools Execute Learning Input Memory G Multistrategy Performance Figure 1. Model of introspective multistrategy learning
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/www/meta-aqua-chapt.fig_22.ps, 19960311 PostScript Lang. Ref. Man., 2nd Ed., H.2.4 says EPS must not call setglobal
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/www/eval-chapt.fig_1.ps, 19960311 LISP Tutor Input Programming Step Step i+1 1 Expected Correct Step i Actual Correct Step Expectation Failure Reflect on Error Strategy Choice: Fine Comparison Identify Failure Strategy Difference Reminding Old Example Reread Text Strategy Results Results Comprehension Plan Comparison Results Results
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/www/eval-chapt.fig_28.ps, 19960311 20 40 60 80 100 120 2 4 6 8 10 12 14 16 18 20 22 24 Cumulative Question Points Problem Run Number Learning Goals Random Learning No Learning Figure 1. Run 4, cumulative question points as a function of the number of problems 916046
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/www/meta-aqua-chapt.fig_30.ps, 19960311 PostScript Lang. Ref. Man., 2nd Ed., H.2.4 says EPS must not call setglobal
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/www/symptoms-chapt.fig_21.ps, 19960311 Actual Expected Compare A E Figure 1. The extended comparison model Relation R
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/www/learn-chapt.fig_7.ps, 19960311 ;; Perform an abstraction transmutation on relation r1 given relation r2. ;; The function raises the co-domain of r1 to the shared parent type of ;; r1 and r2. (actschema do-abstraction-change :todo (abstracted r1 r2) :expansion ( (step1 :primitive (perform-abstraction r1 r2))) :conditions ( (:use-when
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/www/proc-chapt.fig_1.ps, 19960311 Interesting Get Input N Y Failure Generate Test N Y Figure 1. Basic reasoning model
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/www/meta-aqua-chapt.fig_24.ps, 19960311 Tale-Spin CD-2-Frame-Translator Goal Generator Meta-AQUA Character + problem (spin & mumble functions) ALL (convert-story function) Story-Concepts (init-goals function) Goal-Queue World-Model Figure 1. Representational flow between generator and understander Performance Module Story Generator
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/www/front-matter.fig_9.ps, 19960311 Figure 1. How to repair the failure 1995 Snowolff
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/www/meta-aqua-chapt.fig_32.ps, 19960311 Figure 1. Meta-AQUA output during hypothesis generation phase of TS4
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/www/cbi-chapt.fig_21.ps, 19960311 Q2: How to decide what to learn Ans2: Post a learning goal.
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/www/eval-chapt.fig_51.ps, 19960311 Failure Symptoms Learning Goals Learning Plan Deciding What to Learn Strategy Construction Failure Symptoms Learning Plan Strategy Construction Alternate phases of semi-introspective multistrategy learning Fully-reflexive (non-introspective) multistrategy learning Figure 1. Alternate ablations
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/www/learn-chapt.tbl_42.ps, 19960311 Table 1: Matrix associative-solution to strategy construction Situation 1 Situation 2 Situation 3 Situation 4 ..... Situation M Algorithm 1 X X Algorithm 2 X X Algorithm 3 X X Algorithm N X
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/www/symptoms-chapt.tbl_34.ps, 19960311 Table 1: Expanded table for reasoning model $E expectation exists $E E then A expectation does not exist; feedback after knowing expectation does not exist $E A then E expectation does not exist; feedback before knowing expectation does not exist $A actual exists Contradiction Impasse Surprise $A actual
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/www/eval-chapt.tbl_70.ps, 19960311 Table 1: Problem distribution (run four) Problem Incidence Boredom 10 Jones 7 Thirst 4 Concerned 3
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/www/symptoms-chapt.tbl_33.ps, 19960311 Table 1: Logical truth table for reasoning model $E expectation exists $E expectation does not exist $A actual exists Contradiction Impasse $A actual does not exist False Expectation Degenerate (N/A)
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/www/eval-chapt.fig_34.ps, 19960311 Oh I see, I would have to use 1+, I could use Add1nums because for this, for every thing but the first element. Unfortunately, it s not clear to me how this works... I m not sure why you would have to, you would have to code in the beginning um...1+ you have to add
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/www/symptoms-chapt.fig_9.ps, 19960311 Q6a: What kinds of reasoning failure exist Ans6: Contradiction, impasse, false expectation, surprise, and unexpected success. a. The numbering on the questions in boxes throughout the text refer to the subgoal structure in Figure 9 on page 14.
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/git-cc-96-06/www/symptoms-chapt.fig_1.ps, 19960311 Table 1: Detailed taxonomy of causes of reasoning failure Domain Knowledge Knowledge Selection Goal Generation Goal Selection Processing Strategy Strategy Selection Input Input Selection Novel Situation Missing Association Missing Goal Forgotten Goal Missing Behavior Missing Heuristic Missing Input
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/goel/eleni/cogsci92.ps, 19960314 Generic Teleological Mechanisms and their Use in Case Adaptation Eleni Stroulia and Ashok K. Goel College of Computing Georgia Institute of Technology Atlanta, GA 30332-0280 eleni@cc.gatech.edu, goel@cc.gatech.edu
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/goel/bhatta/mblsi-ijcai93-ws.ps, 19960314 Model-Based Learning of Structural Indices to Design Cases Sambasiva R. Bhatta and Ashok K. Goel Artificial Intelligence Group College of Computing Georgia Institute of Technology Atlanta, GA 30332-0280 Tel: (404) 853-9381, (404) 853-9371 Fax: (404) 853-9378 Email: fbhatta,goelg@cc.gatech.edu In Procs.
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/goel/bhatta/lgm-cogsci93.ps, 19960314 Learning Generic Mechanisms from Experiences for Analogical Reasoning Sambasiva R. Bhatta and Ashok K. Goel College of Computing Georgia Institute of Technology Atlanta, Georgia 30332-0280 fbhatta,goelg@cc.gatech.edu In the Proceedings of the Fifteenth Annual Conference of the Cognitive Science Society,
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/goel/murdock/kritik.ps, 19960316 KRITIK: AN EARLY CASE-BASED DESIGN SYSTEM ASHOK K. GOEL, SAMBASIVA R. BHATTA, ELENI STROULIA College of Computing Georgia Institute of Technology Atlanta, GA 30332-0280 Tel: (404) 853-9371, (404) 853-9381 Fax: (404) 853-937 Email: {goel,bhatta,eleni}@cc.gatech.edu
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/goel/griffith/cogsci96.ps, 19960411 The Role of Generic Models in Conceptual Change1 1 This research was funded in part by NSF Grant No. IRI-92-10925 and in part by ONR Grant No. N00014-92-J-1234. We thank John Clement for the use of his protocol transcript, James Greeno for his contribution to developing our constructive modeling
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/d-96-01/fig-6.ps, 19960423 Compute index as characterization of input Retrieve Explanation Pattern (XP) Apply XP to input representation If XP application is successful then Check XP antecedents If one or more nodes not believed then Recursive questioning Example explanation strategy
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/d-96-01/d-96-01.fig_84.ps, 19960423 1. Interestingness Detection on Story Input 2. If Interesting Then Explain Input (XP Application Version) 2 a. Input Elaboration Compute index as characterization of input Retrieve XP Apply XP to input representation If XP application is successful then Check XP antecedents If one or more nodes not
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/d-96-01/fig-2.ps, 19960423 Generate Changes to Specify a learning goal whose Context Goal Changes Strategy Find source of failure Run strategy Construct lear ning strategy BK achievement repairs failure that achieves specification Major process components of learning changes
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1996/wucs-96-11.ps.Z, 19960423 Efficient User space Protocol Implementations with QoS Guarantees using Real-time Upcalls R. Gopalakrishnan Gurudatta M. Parulkar gopal@dworkin.wustl.edu guru@flora.wustl.edu Department of Computer Science Washington University in St.Louis
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/d-96-01/fig-12.ps, 19960423 Achieve Achieve Decide what to learn Failure Blame assignment Learning Goal BK1 BK2 FK2 FK1 Anomaly Knowledge Goal Elaborate anomaly Pose question Select learning Select explanation strategy strategy Question-Driven Understanding Input: FK1 Anomaly FK1 BK Output: FK2 such that there exists the
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/d-96-01/fig-10.ps, 19960423 Failure detection algorithm Detect-failure (E, A, trace) begin If (A (outFK) and trace indicates time to event expired) or (A (outFK) and impossible (goal (generate, E))) then return false expectation If E(inFK) then if E A then return contradiction else if E = A then If expected to fail then return
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/d-96-01/fig-8.ps, 19960423 Model of introspective multistrategy learning Tale Problem Multistrategy Understanding Story CBR Planner Multistrategy Performance Subsystem Learning Subsystem Learning Learning Trace Story case library XP library script library BK FK Story Representation Lear ning Toolbox Algorithm Learning Plans
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/d-96-01/fig-1.ps, 19960423 Problem Solving Comprehension Story Understanding Learning Planning Reasoning Hierarchical decomposition of reasoning tasks
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1996/wucs-96-09.ps.Z, 19960423 Reconsidering Fragmentation and Reassembly Girish P. Chandranmenon girish@cs.wustl.edu +1 314 935 4163 George Varghese varghese@askew.wustl.edu +1 314 935 4963 wucs-96-09 Reconsidering Fragmentation and Reassembly 1 April 15, 1996 Department of Computer Science Campus Box 1045 Washington University One
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1996/wucs-96-10.ps.Z, 19960423 Leap Forward Virtual Clock: An O(log log N) Fair Queuing Scheme with Guaranteed Delays and Throughput Fairness Subhash Suri suri@cs.wustl.edu +1 314 935 7546 George Varghese varghese@askew.wustl.edu +1 314 935 4963 Girish P. Chandranmenon girish@cs.wustl.edu +1 314 935 4163 wucs-96-10 Leap Forward
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/d-96-01/fig-3.ps, 19960423 Interesting Get Input N Y Failure Generate Test N Y Basic reasoning model
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/d-96-01/fig-7.ps, 19960423 Performance Learning Performance Knowledge Modifications Input Measure Subsystem Traditional model of learning Subsystem
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/d-96-01/fig-9.ps, 19960423 Input: Learning Goal Reasoning Trace FK BK1 If a failure occurred during the trace then Construct a learning strategy to repair BK1 Execute strategy Store reasoning trace Output: BK2 The knowledge is repaired if, given a similar future situation, the failure will not recur Learning specification
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1996/wucs-96-13.ps.Z, 19960429 ON THE PERFORMANCE OF EARLY PACKET DISCARD Maurizio Casoni and Jonathan S. Turner jst@cs.wustl.edu wucs-96-13 April 29, 1996 Department of Computer Science Campus Box 1045 Washington University One Brookings Drive St. Louis, MO 63130-4899
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/er-96-02.ps.Z, 19960520 Exploring Interface Options in Multimedia Educational Environments Gordon Shippey College Of Computing shippey@cc.gatech.edu Ashwin Ram College Of Computing ashwin@cc.gatech.edu Florian Albrecht College Of Computing florian@cc.gatech.edu Janis Roberts College Of Computing janis@cc.gatech.edu Mark
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1996/wucs-96-08.ps.Z, 19960522 WASHINGTON UNIVERSITY IN ST LOUIS Washington School of Engineering & Applied Science Saint Louis, MO 63130-4899One Brookings DriveCampus Box 1045Washington UniversityDepartment of Computer Science Mobile UNITY: Reasoning and Specification in Mobile Computing Gruia-Catalin Roman Peter J. McCann
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/ram/er-96-04.ps.Z, 19960523 Evaluating The Structural Organization Of A Hypermedia Learning Environment Using GOMS Model Analysis Terry Shikano (terry@psy.gatech.edu) School of Psychology, Georgia Institute of Technology, Atlanta, Georgia 30332, U.S.A. Mimi Recker (Mimi.Recker@vuw.ac.nz) UTDC, Box 600, Victoria University of
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1996/wucs-96-18.ps.Z, 19960618 Page 10 cally. Individuals would only receive those exhibits they could support. We are also working on creating an H.261 gateway to allow conferencing with low bandwidth sources. Presently, the connection management system is centralized, so this limits the scalability of the system. This
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1996/wucs-96-12.ps.Z, 19960621 The APIC Approach to High Performance Network Interface Design: Protected DMA and Other Techniques
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1996/wucs-96-19.ps.Z, 19960627 Supporting DIS Applications using ATM Multipoint Connection Caching Anshul Kantawala , Guru Parulkar, John DeHart(Corresponding Author) anshul@arl.wustl.edu, guru@arl.wustl.edu, jdd@arl.wustl.edu Applied Research Laboratory Department of Computer Science Washington University St. Louis Mo. 63130, USA
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1996/wucs-96-17.part10.ps.Z, 19960711 53 Appendix A Picasso User s Manual A.1 Development Platform Picasso was written using Borland12 C++ 4.51 using OWL 2.5. The speech recognition engine used for the editor s design was Dragon s VoiceTools 1.1 Windows Supplement. The character handwriting recognition program used was Palm Computing s
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1996/wucs-96-17.part5.ps.Z, 19960711 10 Chapter 3 Method This chapter describes the plan that was used to solve the research problem of the thesis. Our approach was experimental. Two versions of a graphical editor were constructed: One with pen input only and the other with multimodal pen and speech recognition input. The editors were used
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/symposia/csgsc-94/csgsc-proc.ps.Z, 19960711 Contents 1 Auditory Cues for Information Display: Merging Two Auditory Interface Techniques Michael C. Albers 1 2 Creativity in Analogical Design: A Model-Based Approach Sambasiva R. Bhatta 2 3 Situated Action Meets Symbol Processing and Both Win Mike Byrne 5 4 Cognitive Psychodynamics: The Timing of
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1996/wucs-96-17.part3.ps.Z, 19960711 1 Chapter 1 Introduction In the last half a century, the world has seen computers transform from large room-sized calculators into sleek portable design and information tools. These new machines are now constantly changing the way that people work, play, and think. This computer evolution has affected
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1996/wucs-96-17.part2.ps.Z, 19960711 WASHINGTON UNIVERSITY SEVER INSTITUTE OF TECHNOLOGY DEPARTMENT OF COMPUTER SCIENCE A PILOT STUDY OF SPEECH AND PEN USER INTERFACE FOR GRAPHICAL EDITING by Karl E. Schmidt Prepared under the direction of Professor Takayuki Dan Kimura A thesis presented to the Sever Institute of Washington University in
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1996/wucs-96-17.part9.ps.Z, 19960711 52 Chapter 7 Conclusion The thesis that speech recognition can increase the speed, accuracy, usability, and userfriendliness of a pen-only interface in a developed system is partially shown. On average, speech recognition slightly increased the speed of drawing diagrams in a pen-based graphical editor.
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1996/wucs-96-17.part1.ps.Z, 19960711 A PILOT STUDY OF SPEECH AND PEN USER INTERFACE FOR GRAPHICAL EDITING Karl E. Schmidt WUCS-96-17 June 1996 Department of Computer Science Washington University Campus Box 1045 One Brookings Drive Saint Louis, MO 63130-4899
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1996/wucs-96-17.part7.ps.Z, 19960711 46 Chapter 5 Evaluation The following chapter critically evaluates the results and procedures of the experiment. In addition, comments about the experiment that did not affect the results are contained in Appendix B.8. 5.1 Subject Selection There was more experience for the subjects using pen technology
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1996/wucs-96-17.part8.ps.Z, 19960711 50 Chapter 6 Future Directions Possible future work stems into many directions including extending this work further, more multimodal input research and new sound recognition input methods. I would like to repeat the experiment from Chapter 4 using a pen-only editor that contains a quality gesture
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1996/wucs-96-17.part13.ps.Z, 19960711 140 References Apte, A., and Kimura, T.D., A Comparison Study of the Pen and the Mouse in Editing Graphic Diagrams, Proceedings of 1993 IEEE Symposium on Visual Languages (VL 93), August 1993, Bergen, Norway, pp. 352-359. Apte, A., Vo, V., and Kimura, T.D., "Recognizing Multistroke Geometric
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1996/wucs-96-17.part6.ps.Z, 19960711 12 Chapter 4 Experiment This chapter describes a pilot study design of the experiment outlined in Chapter 3. Two versions of a graphical editor were developed with identical functionality. One was controlled by pen input alone and the other was controlled by both pen and speech recognition input. The
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1996/wucs-96-17.part14.ps.Z, 19960711 145 Vita Name: Karl E. Schmidt Date of Birth: September 25, 1970 Place of Birth: Smithtown, NY Undergraduate Study: The University of Vermont, B.S. Electrical Engineering, 1992 Graduate Study: Washingon University, M.S. Computer Science, 1996 Professional Experience: Teaching Assistant, Washington
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/symposia/csgsc-94/brochure.ps, 19960711 4:00-4:20 Integrating Learning, Planning, and Acting Juan Santamar a in Continuous Domains 4:20-4:40 The Representation of Motion in Object and Alan Kersten Event Categories 4:40-5:00 Theory Based Representation: A FrameTodd W. Griffith work for Modeling Conceptual Change Session V: Reception I
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1996/wucs-96-17.part12.ps.Z, 19960711 113 Appendix C Subject Diagrams Appendix C contains the task diagrams drawn by each subject. 114 Subject 1 FIGURE C-1. Diagram Task 1 for Subject 1 FIGURE C-2. Diagram Task 2 for Subject 1 115 Subject 1 FIGURE C-3. Diagram Task 3 for Subject 1 FIGURE C-4. Diagram Task 4 for Subject 1 116 Subject 2
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1996/wucs-96-17.part11.ps.Z, 19960711 81 Appendix B Experiment Procedures and Handouts Section B.1 contains the handout that subjects were told to read before doing the experiment. Section B.2 contains the experiment tester s instructions. Section B.3 contains the experiment training instructions for the experiment. Section B.4 contains
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1996/wucs-96-17.part4.ps.Z, 19960711 5 Chapter 2 Problem This chapter defines the problem to be solved by this research and its significance. 2.1 Problem Definition The problem is to prove the following thesis: Speech recognition can increase the speed, accuracy, usability, and user-friendliness of a pen-only interface in editing graphic
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/carlos/rlfa.ps, 19960810 Reinforcement Learning, Function Approximations, and Resource Allocation in Problems with Continuous States and Actions (until a better title comes out) Juan Carlos Santamar a, Richard Sutton, and Ashwin Ram
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/math/papers/cwpicd.ps.gz, 19960815 Custom Wavelet Packet Image Compression Design Mladen Victor Wickerhauser y July 11, 1996
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/math/papers/eeg.ps.gz, 19960815 Wavelets, Adapted Waveforms, and De-Noising Ronald R. Coifman, Ph.D. Mladen Victor Wickerhauser, Ph.D.y
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/math/papers/tdcst.ps.gz, 19960815 14 V. Wickerhauser, M. Farge, E. Goirand C. Marchioro and M. Pulvirenti. Vortex Methods in 2D Fluid Dynamics. Number 203 in Lecture Notes in Physics. Springer-Verlag, Berlin, 1984. Yves Meyer. Orthonormal wavelets. In Jean-Michel Combes, Alexander Grossmann, and Philippe Tchamitchian, editors,
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/goel/murdock/aid96.ps, 19960822 EXPLANATORY INTERFACE IN INTERACTIVE DESIGN ENVIRONMENTS ASHOK GOEL,ANDR ES G OMEZ DE SILVA GARZA,NATHALIE GRU E, J. WILLIAM MURDOCKAND MARGARET RECKER College of Computing Georgia Institute of Technology Atlanta, Georgia 30332, USA AND T. GOVINDARAJ School of Industrial and Systems Engineering Georgia
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/goel/murdock/ewcbr96.ps, 19960826 Meta-Cases: Explaining Case-Based Reasoning Ashok K. Goel and J. William Murdock Artificial Intelligence Group College of Computing Georgia Institute of Technology To appear in Proceedings of the 1996 European Workshop on Case-Based Reasoning.
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1996/wucs-96-21.ps.Z, 19960827 Short Title: Continuous Compilation Plezbert, M.Sc. 1996 WASHINGTON UNIVERSITY SEVER INSTITUTE OF TECHNOLOGY DEPARTMENT OF COMPUTER SCIENCE CONTINUOUS COMPILATION FOR SOFTWARE DEVELOPMENT AND MOBILE COMPUTING by Michael P. Plezbert Prepared under the direction of Dr. Ron K. Cytron A thesis presented to
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1996/wucs-96-01.ps.Z, 19960827 Analysis of MPEG Compressed Video Traffic Jerome R. Cox, Jr. and O. Matthew Beal WUCS 96-01 January 1996 Revised: August 1996 Department of Computer Science Applied Research Laboratory Campus Box 1045 Washington University One Brookings Drive St. Louis, MO. 63130-4899
	ftp://wuarchive.wustl.edu/doc/techreports/gatech.edu/students/carlos/RLI/tech-report.ps, 19960911 Experiments with Reinforcement Learning in Problems with Continuous States and Actions Spaces Juan Carlos Santamar a, Richard Sutton, and Ashwin Ram
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1996/wucs-96-22.ps.Z, 19961008 NEGOTIATION AS A RESOURCE ALLOCATION PROCESS WUCS-96-22 Fernando Tohm e
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1996/wucs-96-24.part2.ps.Z, 19961014 115 Appendix A Color Figures This appendix contains color versions of selected figures, which are also contained within the text. Each figure repeated here is denoted by an asterisk by the figure title within the text. If possible, this appendix should be printed on a high resolution color printer. 116
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1996/wucs-96-24.part1.ps.Z, 19961014 WASHINGTON UNIVERSITY SEVER INSTITUTE OF TECHNOLOGY DEPARTMENT OF COMPUTER SCIENCE END-USER CONSTRUCTION AND CONFIGURATION OF DISTRIBUTED MULTIMEDIA APPLICATIONS by Terrance Paul McCartney Prepared under the direction of Professor Kenneth J. Goldman A dissertation presented to the Sever Institute of
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1996/wucs-96-24.part3.ps.Z, 19961025 122 Appendix B EUPHORIA Reference Manual The Programmers Playground is a software library and runtime system for creating distributed multimedia applications , . EUPHORIA is the user interface management system for Playground, enabling end-users to create direct manipulation graphical user
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1996/wucs-96-26.ps.Z, 19961029 A Usability Study of End-User Construction of Direct Manipulation User Interfaces T. Paul McCartney WUCS-96-26 Department of Computer Science Washington University Campus Box 1045 One Brookings Drive Saint Louis, MO 63130-4899 October 1996 A Usability Study of End-User Construction of Direct
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1996/wucs-96-20.ps.Z, 19961104 Optimal Solution of Off-line and On-line Generalized Caching Saied Hosseini-Khayat y and Jerome R. Cox, Jr. Washington University in St. Louis
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1996/wucs-96-25.ps.Z, 19961104 New Results on Generalized Caching Saied Hosseini-Khayat y Washington University in St. Louis
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/math/software/blochin-landauin-readme.ps.gz, 19961121 4 ALBERT BAERNSTEIN II AND JADE P. VINSON output: sum, the updated sum of all the triangles counted. steps: set stage = stage + 1. compose = ffi Vside: set affinity = affinity + 1 increment sum = sum + (0)2=fl(0)3: while (affinity < 11) do set side = side + 2. compose = ffi Vside: set affinity =
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1996/wucs-96-27.ps.Z, 19961125 Distributed Stream Filtering For Database Applications William M. Shapiro and Kenneth J. Goldman WUCS-96-27 Department of Computer Science Washington University Campus Box 1045 One Brookings Drive Saint Louis, MO 63130-4899 October 1996 1
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1996/wucs-96-31.ps.Z, 19961223 Building Distributed Applications with Design Patterns Gruia-Catalin Roman James C. Hu December 19, 1996 WUCS-96-31
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/wucs-97-01.ps.Z, 19961226 WASHINGTON UNIVERSITY IN ST LOUIS Washington School of Engineering & Applied Science Saint Louis, MO 63130-4899One Brookings DriveCampus Box 1045Washington UniversityDepartment of Computer Science Mobile UNITY: A Language and Logic for Concurrent Mobile Systems Peter J. McCann Gruia-Catalin Roman
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1997/wucs-97-01.ps.Z, 19961226 WASHINGTON UNIVERSITY IN ST LOUIS Washington School of Engineering & Applied Science Saint Louis, MO 63130-4899One Brookings DriveCampus Box 1045Washington UniversityDepartment of Computer Science Mobile UNITY: A Language and Logic for Concurrent Mobile Systems Peter J. McCann Gruia-Catalin Roman
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1996/wucs-96-15.ps.Z, 19970106 WASHINGTON UNIVERSITY IN ST LOUIS Washington School of Engineering & Applied Science Saint Louis, MO 63130-4899One Brookings DriveCampus Box 1045Washington UniversityDepartment of Computer Science Mobile UNITY Coordination Constructs Applied to Packet Forwarding for Mobile Hosts Peter J. McCann
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1996/wucs-96-32.ps.Z, 19970106 Alchourr on's Defeasible Conditionals and Defeasible Reasoning Fernando Tohm ey Ronald P. Loui Computer Science Department Washington University in St.Louis One Brookings Drive, Campus Box 1045, St.Louis, MO 63130-4899, USA E-mail: ftohme,louig@cs.wustl.edu yDepartamento de Econom a, Universidad del
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/cs/1996/wucs-96-16.ps.Z, 19970116 Extending ATM Networks for Efficient Reliable Multicast Jonathan S. Turner jst@cs.wustl.edu wucs-96-16 January 13, 1997 Department of Computer Science Campus Box 1045 Washington University One Brookings Drive St. Louis, MO 63130-4899
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/math/papers/pla.ps.gz, 19971022 COMPARISON OF P-HARMONIC MEASURES OF SUBSETS OF THE UNIT CIRCLE Albert Baernstein II 1. Introduction For real numbers p 2 (1; 1), the p-Laplace operator Dp in Rn is the operator defined on smooth functions u by (1.1) Dpu = div(jrujp 2ru) = jrujp 2( u + (p 2) X @iju@iu @ju jruj2 ): Here denotes the usual
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/math/papers/blo.ps.gz, 19971120 LOCAL MININMALITY RESULTS RELATED TO THE BLOCH AND LANDAU CONSTANTS 39 , The hyperbolic metric and the universal curve, J.Differential Geometry 31 (1990), 417-472. H. Yanagihara, Quasi-conformal variations and local minimality of the Ahlfors-Grunsky function, J.Analyse Math. 51 (1988), 30-61.
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/math/papers/dba.ps.gz, 19971218 SOME CONJECTURES ABOUT INTEGRAL MEANS OF @f AND @f: 21 A.Pelczy nski, Norms of classical operators in function spaces, Colloque Laurent Schwartz, Ast erisque 131 (1985), 137-162. S.Pichorides, On the best value of the constants in the theorems of M.Riesz, Zygmund, and Kolmogorov, Studia Math.
	ftp://wuarchive.wustl.edu/doc/techreports/wustl.edu/math/papers/wcsd.ps.gz, 19980212 Comparison of Wavelet Image Coding Schemes for Seismic Data Compression Anthony Vassilioua and Mladen Victor Wickerhauserb aAmoco EPTG, 4502 E. 41 St., Tulsa, OK 74135 bDept. of Math., Washington University, St. Louis, MO 63130