Browse

ftp://ftp.research.att.com (373)

	ftp://ftp.research.att.com/dist/internet_security/kerblimit.usenix.ps, 19910228 Limitations of the Kerberos Authentication System Steven M. Bellovin AT&T Bell Laboratories Michael Merritt AT&T Bell Laboratories
	ftp://ftp.research.att.com/dist/smb/sessext.ps.Z, 19910426 The ``Session Tty'' Manager S.M. Bellovin ulysses!smb AT&T Bell Laboratories Murray Hill, NJ 07974
	ftp://ftp.research.att.com/dist/internet_security/ipext.ps.Z, 19910822 Security Problems in the TCP/IP Protocol Suite S.M. Bellovin* smb@ulysses.att.com AT&T Bell Laboratories Murray Hill, New Jersey 07974
	ftp://ftp.research.att.com/dist/qos/pricing.ps, 19920306 A Framework for the Study of Pricing in Integrated Networks Colin Parris Tenet Group, Computer Science Division, UC Berkeley and International Computer Science Institute, Berkeley, CA 94720 Srinivasan Keshav AT&T Bell Laboratories 600 Mountain Ave., Murray Hill, NJ 07974 Domenico Ferrari Tenet Group,
	ftp://ftp.research.att.com/dist/smb/neke.ps, 19920309 Encrypted Key Exchange: Password-Based Protocols Secure Against Dictionary Attacks Steven M. Bellovin Michael Merritt AT&T Bell Laboratories AT&T Bell Laboratories Murray Hill, NJ 07974 Murray Hill, NJ 07974 smb@ulysses.att.com mischu@research.att.com
	ftp://ftp.research.att.com/dist/ai/kc-gen.ps.Z, 19920323 A General Framework for Knowledge Compilation Henry Kautz and Bart Selman AI Principles Research Department AT&T Bell Laboratories Murray Hill, NJ 07974 USA kautz@research.att.com selman@research.att.com
	ftp://ftp.research.att.com/dist/ai/amtime.ps.Z, 19920323 Integrating Metric and Qualitative Temporal Reasoning Henry A. Kautz AT&T Bell Laboratories Murray Hill, NJ 07974 kautz@research.att.com Peter B. Ladkin International Computer Science Institute Berkeley, CA 94704 ladkin@icsi.berkeley.edu
	ftp://ftp.research.att.com/dist/ai/kc-horn.ps.Z, 19920323 Knowledge Compilation Using Horn Approximations Bart Selman and Henry Kautz AI Principles Research Department AT&T Bell Laboratories Murray Hill, NJ 07974 fselman, kautzg@research.att.com
	ftp://ftp.research.att.com/dist/qos/qos.abs.ps, 19920420 Workshop on Quality of Service Issues in High Speed Networks Preliminary Proceedings AT&T Bell Laboratories, Murray Hill April 23-24 1992 _ ______________________________________________________________________________ Participant List _
	ftp://ftp.research.att.com/dist/ai/kc-assim.ps.Z, 19920702 Forming Concepts for Fast Inference Henry Kautz and Bart Selman AI Principles Research Department AT&T Bell Laboratories 600 Mountain Avenue, Room 2C-407 Murray Hill, NJ 07974 fkautz, selmang@research.att.com
	ftp://ftp.research.att.com/dist/ai/bridging.ps.Z, 19920901 Bridging the Gap Between Theory and Applications in Knowledge Representation Research Henry Kautz AT&T Bell Laboratories Murray Hill, New Jersey USA With thanks to Bart Selman, Ron Brachman, Peter Patel-Schneider, & Alex Borgida 1 Knowledge Representation: understanding and designing intelligent systems
	ftp://ftp.research.att.com/dist/ai/backstrom.ps.Z, 19920923 The Complexity of Planning Bart Selman AT&T Bell Laboratories Murray Hill, New Jersey USA Presentation and discussion of results by Christer Backstrom (1992) 1 What is planning Plan: Sequence of action leading from an initial state to a goal state. Planning: The task of finding a plan. Plans and
	ftp://ftp.research.att.com/dist/ai/satplan.ps.Z, 19921120 Planning as Satisfiability Henry Kautz and Bart Selman AI Principles Research Department AT&T Bell Laboratories 600 Mountain Avenue, Room 2C-407 Murray Hill, NJ 07974 fkautz, selmang@research.att.com
	ftp://ftp.research.att.com/dist/ai/thesis.selman.ps.Z, 19921130 Tractable Default Reasoning by Bart Selman A Thesis submitted in conformity with the requirements for the Degree of Doctor of Philosophy in the University of Toronto Copyright c Bart Selman, 1990
	ftp://ftp.research.att.com/dist/ai/inh.ps.Z, 19930104 The complexity of path-based defeasible inheritance Bart Selman AI Principles Research Dept. AT&T Bell Laboratories Murray Hill, NJ 07974 selman@research.att.com Hector J. Levesquey Dept. of Computer Science University of Toronto Toronto, Canada M5S 1A4 hector@cs.toronto.edu
	ftp://ftp.research.att.com/dist/ai/hsat.ps.Z, 19930104 Hard and Easy Distributions of SAT Problems David Mitchell Dept. of Computing Science Simon Fraser University Burnaby, Canada V5A 1S6 mitchell@cs.sfu.ca Bart Selman AT&T Bell Laboratories Murray Hill, NJ 07974 selman@research.att.com Hector Levesque Dept. of Computer Science University of Toronto
	ftp://ftp.research.att.com/dist/ai/gsat.ps.Z, 19930104 A New Method for Solving Hard Satisfiability Problems Bart Selman AT&T Bell Laboratories Murray Hill, NJ 07974 selman@research.att.com Hector Levesque Dept. of Computer Science University of Toronto Toronto, Canada M5S 1A4 hector@ai.toronto.edu David Mitchell Dept. of Computing Science Simon Fraser
	ftp://ftp.research.att.com/dist/ml/93.release-notes.ps, 19930216 Standard ML of New Jersey Release Notes (Version 0.93) February 15, 1993 Copyright c 1989, 1990, 1991, 1992, 1993 by AT&T Bell Laboratories License and Disclaimer Copyright c 1989, 1990, 1991, 1992, 1993 by AT&T Bell Laboratories All Rights Reserved Permission to use, copy, modify, and distribute this
	ftp://ftp.research.att.com/dist/COSPAN/notes.PS.Z, 19930220 Automata-Theoretic Verification of Coordinating Processes R. P. Kurshan Mathematical Sciences Research Center AT&T Bell Laboratories Murray Hill, NJ 07974 August 5, 1992 1 Introduction 1 1.1 An Example : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 3 1.2 Relationship between
	ftp://ftp.research.att.com/dist/carl/jofp93.ps, 19930317 Reference Counting as a Computational Interpretation of Linear Logic Jawahar Chirimar Department of CIS University of Pennsylvania Philadelphia, PA 19104 Carl A. Gunter AT&T Bell Laboratories 600 Mountain Avenue Murray Hill, NJ 07974 Jon G. Riecke AT&T Bell Laboratories 600 Mountain Avenue Murray Hill,
	ftp://ftp.research.att.com/dist/ai/gsat-ext.ps.Z, 19930403 Domain-Independent Extensions to GSAT: Solving Large Structured Satisfiability Problems Bart Selman and Henry Kautz AT&T Bell Laboratories Murray Hill, NJ 07974 fselman, kautzg@research.att.com
	ftp://ftp.research.att.com/dist/ai/kc-models.ps.Z, 19930426 Reasoning With Characteristic Models Henry A. Kautz, Michael J. Kearns, and Bart Selman AI Principles Research Department AT&T Bell Laboratories Murray Hill, NJ 07974 fkautz, mkearns, selmang@research.att.com
	ftp://ftp.research.att.com/dist/qos/keshav.ch6.ps.Z, 19930714 1 Chapter 6: Simulation Experiments 6.1. Introduction The previous chapters have presented the design and analysis of the Fair Queueing scheduling algorithm and the Packet-Pair flow control scheme. This chapter presents simulation experiments to study these mechanisms and to compare them with some
	ftp://ftp.research.att.com/dist/db/att-db-93-9.ps.Z, 19930718 Parallel Pointer-based Join Techniques for Object-Oriented Databases Daniel F. Lieuwen David J. DeWitt Manish Mehta AT&T Bell Laboratories Computer Sciences Department Murray Hill, New Jersey 07974 University of Wisconsin Madison, WI 53706
	ftp://ftp.research.att.com/dist/carl/SPL_errata.ps, 19930726 Corrections For the First Printing of Semantics of Programming Languages Structures and Techniques by Carl A. Gunter July 26, 1993 Text appearing between brackets like is extracted from the first printing; text appearing between pararentheses like f This g is to be inserted for the second
	ftp://ftp.research.att.com/dist/mab/cfs.ps, 19930812 ACryptographic File System for Unix Matt Blaze AT&T Bell Laboratories 101 Crawfords Corner Road, Room 4G-634 Holmdel, NJ 07733 mab@research.att.com
	ftp://ftp.research.att.com/dist/smb/packets.ps, 19930823 Packets Found on an Internet Steven M. Bellovin August 23, 1993
	ftp://ftp.research.att.com/dist/drawdag/neatodoc.ps.Z, 19930831 neato User's Guide Stephen C. North AT&T Bell Laboratories Murray Hill, NJ 1 Introduction neato is a utility that draws undirected graphs, that are common in telecommunications and computer programming. It draws a graph by constructing a virtual physical model and running an iterative solver to find a
	ftp://ftp.research.att.com/dist/mab/swipeusenix.ps, 19930906 The Architecture and Implementation of Network-Layer Security Under Unix
	ftp://ftp.research.att.com/dist/video.ps.Z, 19930908 50000 100000 150000 200000 250000 20 40 60 80 100 120 140 Bits/Frame Frame number 50000 100000 150000 200000 20 40 60 80 100 120 140 Bits/Frame Frame number Figure 6: Input frame rates for two of the eight video sequences used 50 100 150 200 250 300 350 400 1000 2000 3000 4000 5000 Packets Time (ms) 0.2
	ftp://ftp.research.att.com/dist/trevor/pda.ps.Z, 19930910 Penalized Discriminant Analysis Trevor Hastie Statistics and Data Analysis Research Department AT&T Bell Laboratories Murray Hill, New Jersey Andreas Buja Statistics and Data Analysis Research Group Bellcore Morristown, New Jersey Robert Tibshirani Department of Preventive Medicine and Biostatistics and
	ftp://ftp.research.att.com/dist/ai/charsli.ps.Z, 19930921 Reasoning With Characteristic Models Henry Kautz, Michael Kearns, and Bart Selman Artificial Intelligence Principles Research Department AT&T Bell Laboratories 1 Motivation Discovering structure in empirical data. structure identification" Data is given as a collection of positive examples. E.g.,
	ftp://ftp.research.att.com/dist/trevor/gam-slides.ps.Z, 19930923 AT&T Bell Laboratories September 23, 1993 Generalized Additive Models an Overview 23 Directions in Nonparametric Regression ffl Local regression and local likelihood ffl Neural network models ffl Rebirth of projection pursuit and look-alikes ffl Tree based models and hierarchical mixtures AT&T Bell
	ftp://ftp.research.att.com/dist/trevor/HTII.ps.Z, 19931026 Nonparametric Regression and Classification Part II Nonparametric Classification T. J. Hastie1 and R. J. Tibshirani2 1 Statistics and Data Analysis Research Department, AT&T Bell Laboratories Room 2C-261, AT&T Bell Laboratories, 600 Mountain Avenue, Murray Hill, NJ 07974. trevor@research.att.com 2
	ftp://ftp.research.att.com/dist/trevor/HTI.ps.Z, 19931026 Nonparametric Regression and Classification Part I Nonparametric Regression T. J. Hastie1 and R. J. Tibshirani2 1 Statistics and Data Analysis Research Department, AT&T Bell Laboratories Room 2C-261, AT&T Bell Laboratories, 600 Mountain Avenue, Murray Hill, NJ 07974. trevor@research.att.com 2 Department
	ftp://ftp.research.att.com/dist/smb/aeke.ps, 19931030 Augmented Encrypted Key Exchange: a Password-Based Protocol Secure Against Dictionary Attacks and Password File Compromise Steven M. Bellovin smb@research.att.com Michael Merritt mischu@research.att.com AT&T Bell Laboratories
	ftp://ftp.research.att.com/dist/drawdag/dotdoc.ps.Z, 19931111 Drawing graphs with dot Eleftherios Koutsofios Stephen C. North AT&T Bell Laboratories Murray Hill, NJ dot draws directed graphs as hierarchies. Like its predecessor, dag, it is a Unix filter, makes good drawings, and runs quickly. Its important new features are node ports for drawing data structures
	ftp://ftp.research.att.com/dist/ai/inh-cred1.ps, 19931127 Efficient Credulous Inheritance Reasoning Bart Selman AT&T Bell Laboratories Murray Hill, NJ 07974 selman@research.att.com Richmond H. Thomason Intelligent Systems Program University of Pittsburgh Pittsburgh, PA 15260 thomason@cad.cs.cmu.edu
	ftp://ftp.research.att.com/dist/ai/gsat-study.ps.Z, 19931215 An Empirical Study of Greedy Local Search for Satisfiability Testing Bart Selman and Henry A. Kautz AI Principles Research Department AT&T Bell Laboratories Murray Hill, NJ 07974 fselman, kautzg@research.att.com
	ftp://ftp.research.att.com/dist/db/att-db-92-6.ps.Z, 19940102 Event Specification in an Active Object-Oriented Database N. H. Gehani H. V. Jagadish O. Shmueli AT&T Bell Laboratories Murray Hill, New Jersey 07974 1. INTRODUCTION Of late, there has been a surge of interest in active databases . Several trigger and constraint specification
	ftp://ftp.research.att.com/dist/db/att-db-92-8.ps.Z, 19940102 Counting solutions to the View Maintenance Problem Ashish Gupta Dinesh Katiyar Department of Computer Science Stanford University CA 94305, USA fagupta,katiyarg@cs.stanford.edu Inderpal Singh Mumick AT&T Bell Laboratories 600 Mountain Avenue Murray Hill, NJ 07974, USA mumick@research.att.com
	ftp://ftp.research.att.com/dist/db/att-db-91-2.ps.Z, 19940102 Ode as an Active Database: Constraints and Triggers N. H. Gehani H. V. Jagadish AT&T Bell Laboratories Murray Hill, New Jersey 07974 1. INTRODUCTION Ode is a database system and environment based on the object paradigm. The database is defined, queried, and manipulated using the database
	ftp://ftp.research.att.com/dist/db/att-db-93-14.ps.Z, 19940102 COMPOSE A System For Composite Event Specification and Detection Narain Gehani AT&T Bell Laboratories nhg@research.att.com H. V. Jagadish AT&T Bell Laboratories jag@research.att.com Oded Shmueli AT&T Bell Laboratories oshmu@cs.technion.ac.il December 1992
	ftp://ftp.research.att.com/dist/db/att-db-93-13.ps.Z, 19940102 Making C++ Objects Persistent: The Hidden Pointers A. Biliris AT&T Bell Labs Murray Hill, New Jersey 07974 S. Dar AT&T Bell Labs Murray Hill, New Jersey 07974 University of Wisconsin Madison, WI 53706 N. H. Gehani AT&T Bell Labs Murray Hill, New Jersey 07974 1. INTRODUCTION O++ is a database
	ftp://ftp.research.att.com/dist/db/att-db-93-21.ps.Z, 19940102 Database Research at AT&T Bell Laboratories H. V. Jagadish1 Bell Laboratories is the Research and Development arm of AT&T. There is today tremendous support for database research in Bell Labs and in AT&T. This is expected to continue since database technology is recognized as being central not just to
	ftp://ftp.research.att.com/dist/db/att-db-92-17.ps.Z, 19940102 A Proclamation-Based Model for Cooperating Transactions H. V. Jagadish Oded Shmueli AT&T Bell Laboratories Murray Hill, New Jersey 07974
	ftp://ftp.research.att.com/dist/db/att-db-92-4.ps.Z, 19940102 CQL++ A SQL for a C++ Based Object-Oriented DBMS S. Dar N. H. Gehani H. V. Jagadish AT&T Bell Laboratories Murray Hill, New Jersey 07974 1. INTRODUCTION Ode is a database system and environment based on the object paradigm. It offers an integrated data model for both database and general purpose
	ftp://ftp.research.att.com/dist/db/att-db-92-1.ps.Z, 19940102 SWORD: A Declarative Object-Oriented Database Architecture Inderpal Singh Mumick AT&T Bell Laboratories mumick@research.att.com Kenneth A. Ross Columbia University kar@cs.columbia.edu December 9, 1992
	ftp://ftp.research.att.com/dist/db/INDEX.ps, 19940102 AT&T Bell Labs Database Technical Reports The papers marked with an * are not available in postscript form. You can contact the author(s) directly. 1982 att-db-82-1* N. Gehani. Databases and units of measure. IEEE Transactions on Software Engineering, SE-8(6):605{611, 1982. att-db-82-2* W.D. Roome. The
	ftp://ftp.research.att.com/dist/db/att-db-89-2.ps.Z, 19940102 ODE (Object Database and Environment): The Language and the Data Model R. Agrawal N. H. Gehani AT&T Bell Laboratories Murray Hill, New Jersey 07974
	ftp://ftp.research.att.com/dist/db/att-db-93-20.ps.Z, 19940102 Temporal Queries for Active Database Support (position paper) N. H. Gehani AT&T Bell Laboratories nhg@research.att.com H. V. Jagadish AT&T Bell Laboratories jag@research.att.com Inderpal Singh Mumick AT&T Bell Laboratories mumick@research.att.com Oded Shmueli Technion - Israel Institute of Technology
	ftp://ftp.research.att.com/dist/db/att-db-93-4.ps.Z, 19940102 Maintaining Views Incrementally Extended Abstract Ashish Gupta Stanford University agupta@cs.stanford.edu Inderpal Singh Mumick AT&T Bell Laboratories mumick@research.att.com V.S. Subrahmaniany University of Maryland vs@cs.umd.edu
	ftp://ftp.research.att.com/dist/db/att-db-93-18.ps.Z, 19940102 Multi-Granularity Locks in an Object-Oriented Database H. V. Jagadish, Daniel F. Lieuwen AT&T Bell Laboratories 600 Mountain Avenue Murray Hill, NJ 07974 fjag,lieuweng@allegra.att.com
	ftp://ftp.research.att.com/dist/db/att-db-93-10.ps.Z, 19940102 Optimizations of Bottom-Up Evaluation with Non-Ground Terms (Extended Abstract) S. Sudarshan y Rm. 2A-212, AT&T Bell Labs, 600 Mountain Ave, Murray Hill, NJ 07974, U.S.A. sudarsha@research.att.com tel: (908) 582 7263 fax: (908) 582 5809 Raghu Ramakrishnan Computer Sciences Department, Univ. of
	ftp://ftp.research.att.com/dist/db/att-db-92-12.ps.Z, 19940102 QUERIES IN AN OBJECT-ORIENTED GRAPHICAL INTERFACE S. Dar AT&T Bell Labs Murray Hill, New Jersey 07974 University of Wisconsin Madison, WI 53706 N. H. Gehani AT&T Bell Labs Murray Hill, New Jersey 07974 H. V. Jagadish AT&T Bell Labs Murray Hill, New Jersey 07974 J. Srinivasan DEC Nashua, NH 03062 1.
	ftp://ftp.research.att.com/dist/db/att-db-91-1.ps.Z, 19940102 Object Versioning in Ode R. Agrawal IBM Almaden Research Center San Jose, California 95120 S. J. Buroff AT&T Bell Labs Summit, New Jersey 07901 N. H. Gehani AT&T Bell Labs Murray Hill, New Jersey 07974 D. Shasha New York University New York, NY 10012 1. INTRODUCTION Ode is a database system and
	ftp://ftp.research.att.com/dist/db/att-db-93-2.ps.Z, 19940102 THE O++ DATABASE PROGRAMMING LANGUAGE: IMPLEMENTATION AND EXPERIENCE Rakesh Agrawal + Shaul Dar * Narain Gehani * + IBM Almaden Research Center University of Wisconsin * AT&T Bell Laboratories San Jose, California Madison, Wisconsin Murray Hill, New Jersey
	ftp://ftp.research.att.com/dist/db/att-db-93-15.ps.Z, 19940102 Adornments in Database Programs Inderpal Singh Mumick AT&T Bell Laboratories mumick@research.att.com Hamid Pirahesh IBM Almaden Research Center pirahesh@ibm.com Raghu Ramakrishnany University of Wisconsin at Madison raghu@cs.wisc.edu June 1993
	ftp://ftp.research.att.com/dist/db/att-db-93-7.ps.Z, 19940102 Equivalence, Query-Reachability, and Satisfiability in Datalog Extensions Extended Abstract Alon Y. Levy Stanford University levy@cs.stanford.edu Inderpal Singh Mumick AT&T Bell Laboratories mumick@research.att.com Yehoshua Sagivy Hebrew University sagiv@cs.huji.ac.il Oded Shmueliz Technion\|Israel
	ftp://ftp.research.att.com/dist/db/att-db-89-3.ps.Z, 19940102 Rationale for the Design of Persistence and Query Processing Facilities in the Database Programming Language O++ R. Agrawal N. H. Gehani AT&T Bell Laboratories Murray Hill, New Jersey 07974
	ftp://ftp.research.att.com/dist/db/att-db-92-10.ps.Z, 19940102 Integrity Maintenance in an Object-Oriented Database H. V. Jagadish Xiaolei Qian AT&T Bell Laboratories Murray Hill, New Jersey 07974
	ftp://ftp.research.att.com/dist/db/att-db-ode.ps.Z, 19940102 The Ode Project A. Biliris J. Gava N. Gehani H. V. Jagadish D. F. Lieuwen E. Panagos W. D. Roome T. J. Roycraft 1 Past contributors include S. Buroff, S. Dar and R. Agrawal. 2 The Ode Papers The report numbers correspond to the file names in the ftp distribution. att-db-tr-89-2 R. Agrawal and N.H.
	ftp://ftp.research.att.com/dist/db/att-db-92-11.ps.Z, 19940102 References V. Aho, E. Hopcroft, and J.D. Ullman. (1985) Data Structures and Algorithms. Reading, MA: Addison-Wesley. C. Beeri and T. Milo. (1991) A Model for Active Object Oriented Database. In Proc. of the 17th Int'l Conf. on Very Large Databases, pages 337{349. P.A. Bernstein and N. Goodman. (1981)
	ftp://ftp.research.att.com/dist/db/att-db-93-22.ps.Z, 19940102 EOS User's Guide Release 2.0 For UNIX-based Systems Alexandros Biliris Euthimios Panagos 600 Mountain Avenue AT&T Bell Laboratories Murray Hill, NJ 07974 fbiliris, thimiosg@research.att.com May 5, 1993
	ftp://ftp.research.att.com/dist/db/att-db-93-16.ps.Z, 19940102 Interactive Spatial irectories Brian C. Schmult, H. V. Jagadish, and S. Kicha Ganapathy AT&T Bell Laboratories
	ftp://ftp.research.att.com/dist/db/att-db-92-2.ps.Z, 19940102 The EOS Large Object Manager Alexandros Biliris AT&T Bell Laboratories Murray Hill, NJ 07974 biliris@research.att.com December 1992
	ftp://ftp.research.att.com/dist/db/att-db-90-2.ps.Z, 19940102 OdeView: The Graphical Interface to Ode R. Agrawal* AT&T Bell Laboratories Murray Hill, New Jersey 07974 N. H. Gehani AT&T Bell Laboratories Murray Hill, New Jersey 07974 J. Srinivasan AT&T Bell Laboratories West Lafayette, IN 47907
	ftp://ftp.research.att.com/dist/db/att-db-93-11.ps.Z, 19940102 Recovering from Main-Memory Lapses H.V. Jagadish Avi Silberschatz S. Sudarshan AT&T Bell Labs. 600 Mountain Ave., Murray Hill, NJ 07974 fjag,silber,sudarshag@allegra.att.com
	ftp://ftp.research.att.com/dist/db/att-db-93-12.ps.Z, 19940102 Extending the Well-Founded and Valid Semantics for Aggregation S. Sudarshany Rm. 2A-212, AT&T Bell Labs. 600 Mountain Ave. Murray Hill, NJ 07974 sudarsha@research.att.com tel: (908) 582 7263 fax: (908) 582 5809 Divesh Srivastava Computer Sciences Department University of Wisconsin\|Madison Madison, WI
	ftp://ftp.research.att.com/dist/db/att-db-93-3.ps.Z, 19940102 OdeFS: A File System Interface to an Object-Oriented Database N. Gehani H. V. Jagadish W. D. Roome AT&T Bell Laboratories Murray Hill, New Jersey 07974
	ftp://ftp.research.att.com/dist/db/att-db-92-7.ps.Z, 19940102 Composite Event Specification in Active Databases: Model & Implementation N. H. Gehani H. V. Jagadish O. Shmueli AT&T Bell Laboratories Murray Hill, New Jersey 07974 1. INTRODUCTION Of late, there has been a surge of interest in active databases . In an
	ftp://ftp.research.att.com/dist/db/att-db-93-5.ps.Z, 19940102 Accessing Extra Database Information: Concurrency Control and Correctness Narain Gehani AT&T Bell Laboratories nhg@research.att.com Krithi Ramamritham University of Massachusetts krithi@nirvan.cs.umass.edu Oded Shmueliy AT&T Bell Laboratories oshmu@cs.technion.ac.il December 1992
	ftp://ftp.research.att.com/dist/db/att-db-91-5.ps.Z, 19940102 data odel for ulti edia docu ents Guy A. Story H. . Jagadish AT T Bell Laboratories 600 ountain Avenue urray Hill, ew Jersey 07974 SA (908) 582-5571; story allegra.att.com bstract We present a new model of data representation, an extension of the more familiar object-oriented model. We argue the
	ftp://ftp.research.att.com/dist/db/att-db-89-12.ps.Z, 19940102 An Intelligent Memory Transaction Engine Abhaya Asthana H. V. Jagadish Scott C. Knauer AT&T Bell Laboratories Murray Hill, New Jersey 07974
	ftp://ftp.research.att.com/dist/db/att-db-93-8.ps.Z, 19940102 Finiteness Properties of Database Queries (Extended Abstract) Inderpal Singh Mumick AT&T Bell Laboratories 600 Mountain Avenue Murray Hill, NJ 07974, USA mumick@research.att.com Oded Shmueli AT&T Bell Laboratories 600 Mountain Avenue Murray Hill, NJ 07974, USA oshmu@cs.Technion.AC.IL
	ftp://ftp.research.att.com/dist/db/att-db-93-1.ps.Z, 19940102 A Flexible Transaction Facility for an Object-Oriented Database A. Biliris, S. Dar , N. Gehani, H. V. Jagadish, K. Ramamrithamy AT&T Bell Labs Murray Hill, NJ 07974 December 5, 1992
	ftp://ftp.research.att.com/dist/db/att-db-92-9.ps.Z, 19940102 Events with Attributes in an Active Database H. V. Jagadish AT&T Bell Laboratories jag@research.att.com Inderpal Singh Mumick AT&T Bell Laboratories mumick@research.att.com Oded Shmueli AT&T Bell Laboratories oshmu@cs.technion.ac.il December 1992
	ftp://ftp.research.att.com/dist/trevor/mda.ps.Z, 19940110 Discriminant Analysis by Gaussian Mixtures Trevor Hastie Statistics and Data Analysis Research Group AT&T Bell Laboratories Murray Hill, New Jersey Robert Tibshirani Department of Preventive Medicine and Biostatistics and Department of Statistics University of Toronto Toronto, Ontario January 10, 1994 c
	ftp://ftp.research.att.com/dist/smb/netmeas.ps.Z, 19940128 A Best-Case Network Performance Model Steven M. Bellovin February 12, 1992
	ftp://ftp.research.att.com/dist/trevor/mda.slides.ps.Z, 19940208 AT&T Bell Laboratories February 8, 1994 Mixture Discriminant Analysis by 19 Comments Since ^p(cjrjx; j) = ssjre D(x; jr)=2 PRj k=1 ssjke D(x; jk)=2 (x) is sufficient to compute relative Mahalanobis distances to subclass centroids. Likewise for posterior probability estimates: p(jjx) j Rj X r=1 ssjre
	ftp://ftp.research.att.com/dist/trevor/pseud.ps.Z, 19940215 Pseudo Splines Trevor Hastie Statistics and Data Analysis Research Group AT&T Bell Laboratories Murray Hill, New Jersey January 20, 1994 c AT&T Bell Laboratories
	ftp://ftp.research.att.com/dist/howe/tacs94.ps.gz, 19940215 An Operational Approach to Combining Classical Set Theory and Functional Programming Languages Douglas J. Howe1 and Scott D. Stoller2 1 AT&T Bell Labs, 600 Mountain Ave., Room 2B-438 Murray Hill, NJ 07974, USA howe@research.att.com. 2 Department of Computer Science, Cornell University Ithaca, NY 14853,
	ftp://ftp.research.att.com/dist/trevor/lrpp.tm.ps.Z, 19940224 Logistic Response Projection Pursuit 19 x1x20.00.20.40.60.81.00.00.20.40.60.81.0
	ftp://ftp.research.att.com/dist/brassil/infocom94.ps, 19940224 Electronic Marking and Identification Techniques to Discourage Document Copying J. Brassil, S. Low, N. Maxemchuk, L. O'Gorman AT&T Bell Laboratories Murray Hill, NJ Modern computer networks make it possible to distribute documents quickly and economically by electronic means rather than by conventional
	ftp://ftp.research.att.com/dist/trevor/asp.tm.ps.Z, 19940224 Automatic Smoothing Spline Projection Pursuit 12 References Friedman, J. H. (1984a), SMART User's Guide. Dept. of Statistics Technical Report No. 1, Stanford University. Friedman, J. H. (1984b), A Variable Span Smoother. Dept. of Statistics Technical Report LCS 05, Stanford University.
	ftp://ftp.research.att.com/dist/tds/globecom93.ps, 19940302 From ``Proceedings of the IEEE Global Telecommunications Conference - Globecom '93,'' pages 542-549, 1993. Throughput Performance of Transport-Layer Protocols over Wireless LANs Antonio DeSimone tds@hoserve.att.com Mooi Choo Chuah chuah@hoserve.att.com On-Ching Yue ocyue@ie.cuhk.hk AT&T Bell
	ftp://ftp.research.att.com/dist/brassil/reg94.ps, 19940307 Peak Rate Regulation Maintains Service Quality in ATM LAN/WAN Interconnection Jack Brassil AT&T Bell Laboratories Murray Hill, NJ Cell delay variations can cause a cell stream traversing an ATM LAN to occasionally exceed a connection's negotiated peak cell rate at the entry point to an ATM WAN,
	ftp://ftp.research.att.com/dist/anoncc/accinet.ps.Z, 19940317 Anonymous Internet Mercantile Protocol David M. Kristol Steven H. Low Nicholas F. Maxemchuk AT&T Bell Laboratories, Murray Hill, NJ 07974 DRAFT: March 17, 1994
	ftp://ftp.research.att.com/dist/trevor/proto.ps.Z, 19940323 Deformable Prototype Curves in Handwritten Signature and Digit Models Trevor Hastie Statistics and Data Analysis Research Department room 2C-261 AT&T Bell Laboratories Murray Hill, New Jersey 07974, USA trevor@research.att.com April 15, 1993
	ftp://ftp.research.att.com/dist/trevor/zip.proto.ps.Z, 19940324 Handwritten Digit Recognition via Deformable Prototypes Trevor Hastie Statistics and Data Analysis Research Department AT&T Bell Laboratories Murray Hill, New Jersey Robert Tibshirani Department of Preventive Medicine and Biostatistics and Department of Statistics University of Toronto Toronto, Ontario
	ftp://ftp.research.att.com/dist/internet_security/firewall.book/preface.ps, 19940328 Preface It is easy to run a secure computer system. You merely have to disconnect all dial-up connections and permit only direct-wired terminals, put the machine and its terminals in a shielded room, and post a guard at the door. F.T. GRAMPP AND R.H. MORRIS For better or for worse, most computer systems
	ftp://ftp.research.att.com/dist/internet_security/firewall.book/toc.ps, 19940328 Contents Preface xi I Getting Started 1 1 Introduction 3 1.1 Why Security : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 3 1.2 Picking a Security Policy : : : : : : : : : : : : : : : : : : : : : : : : : : : : 4 1.3 Strategies for a Secure Network : : : : : : : : : : : : : : : : : : :
	ftp://ftp.research.att.com/dist/drawdag/dotty.ps.Z, 19940404 Applications of Graph Visualization Stephen C. North Eleftherios Koutsofios AT&T Bell Laboratories 600 Mountain Avenue Murray Hill, NJ 07974
	ftp://ftp.research.att.com/dist/ai/aaai94bots.ps.Z, 19940419 An Experiment in the Design of Software Agents Henry A. Kautz, Bart Selman, Michael Coen, Steven Ketchpel, and Chris Ramming AI Principles Research Department AT&T Bell Laboratories Murray Hill, NJ 07974 fkautz, selman, jcrg@research.att.com mhcoen@ai.mit.edu ketchpel@cs.stanford.edu This paper appears
	ftp://ftp.research.att.com/dist/trevor/tangent.ps.Z, 19940429 Learning Prototype Models for Tangent Distance Trevor Hastie Patrice Y. Simardy Eduard S ackingery DRAFT\|April 4, 1994 c AT&T Bell Laboratories
	ftp://ftp.research.att.com/dist/trevor/nips94.tangent.ps.Z, 19940502 true: 6true proj.pred. proj. ( 0 )true: 2true proj.pred. proj. ( 0 )true: 5true proj.pred. proj. ( 8 )true: 2true proj.pred. proj. ( 0 )true: 9true proj.pred. proj. ( 4 )true: 4true proj.pred. proj. ( 7 ) Figure 2: Some of the errors for the test set corresponding to line (3) of table 4. Each case is
	ftp://ftp.research.att.com/dist/howe/cade12.ps.Z, 19940505 Tactic Theorem Proving with Refinement-Tree Proofs and Metavariables Amy Felty and Douglas Howe AT&T Bell Laboratories, 600 Mountain Ave., Murray Hill, NJ 07974, USA
	ftp://ftp.research.att.com/dist/mab/cfskey.ps, 19940506 Key Management in an Encrypting File System Matt Blaze AT&T Bell Laboratories
	ftp://ftp.research.att.com/dist/howe/lpar94.ps.Z, 19940509 Generalization and Reuse of Tactic Proofs Amy Felty and Douglas Howe AT&T Bell Laboratories, 600 Mountain Ave., Murray Hill, NJ 07974, USA.
	ftp://ftp.research.att.com/dist/qos/mechanism.ps, 19940523 A Mechanism for Congestion Control in Computer Networks Srinivasan Keshav Computer Systems Research Group, Computer Science Division, Department of Electrical Engineering and Computer Science, University of California, Berkeley, Berkeley, CA 94720. We approach the problem of congestion control in
	ftp://ftp.research.att.com/dist/levy/aaai94-modeling.ps.Z, 19940603 Automated Model Selection for Simulation Yumi Iwasaki Knowledge Systems Laboratory Stanford University 701 Welch Road, Bldg. C Palo Alto, California, 94304 iwasaki@cs.stanford.edu Alon Y. Levy AT&T Bell Laboratories AI Principles Research Department 600 Mountain Ave., Room 2C-406 Murray Hill, NJ 07974
	ftp://ftp.research.att.com/dist/levy/pods92.ps.Z, 19940603 Constraints and Redundancy in Datalog Alon Levy Dept. of Computer Science Stanford University Stanford, CA 94305 (alevy@cs.stanford.edu) Yehoshua Sagivy Dept. of Computer Science Hebrew University Jerusalem, Israel (sagiv@cs.huji.ac.il)
	ftp://ftp.research.att.com/dist/levy/pods93.ps.Z, 19940603 Equivalence, Query-Reachability, and Satisfiability in Datalog Extensions Extended Abstract Alon Y. Levy Stanford University levy@cs.stanford.edu Inderpal Singh Mumick AT&T Bell Laboratories mumick@research.att.com Yehoshua Sagivy Hebrew University sagiv@cs.huji.ac.il Oded Shmueliz Technion\|Israel
	ftp://ftp.research.att.com/dist/levy/vldb93.ps.Z, 19940603 Queries Independent of Updates Alon Y. Levy Department of Computer Science Stanford University Stanford, California, 94305 levy@cs.stanford.edu Yehoshua Sagivy Department of Computer Science Hebrew University Jerusalem, Israel sagiv@cs.huji.ac.il
	ftp://ftp.research.att.com/dist/levy/aaai94-abs.ps.Z, 19940603 Creating Abstractions Using Relevance Reasoning Alon Y. Levy AT&T Bell Laboratories AI Principles Research Department 600 Mountain Avenue, Room 2C-406 Murray Hill, NJ, 07974. Email: levy@research.att.com
	ftp://ftp.research.att.com/dist/levy/levy-thesis.ps.Z, 19940603 IRRELEVANCE REASONING IN KNOWLEDGE BASED SYSTEMS a dissertation submitted to the department of computer science and the committee on graduate studies of stanford university in partial fulfillment of the requirements for the degree of doctor of philosophy By Alon Yitzchak Levy October 1993 c Copyright
	ftp://ftp.research.att.com/dist/levy/ijcai93.ps.Z, 19940603 Exploiting Irrelevance Reasoning to Guide Problem Solving Alon Y. Levy Dept. of Computer Science Stanford University Stanford, California 94305 (levy@cs.stanford.edu) Yehoshua Sagiv Dept. of Computer Science Hebrew University Jerusalem, Israel (sagiv@cs.huji.ac.il)
	ftp://ftp.research.att.com/dist/levy/info-agents94.ps.Z, 19940606 Towards Efficient Information Gathering Agents Alon Y. Levy AT&T Bell Laboratories AI Principles Research Department Murray Hill, NJ, USA. levy@research.att.com Yehoshua Sagiv Department of Computer Science Hebrew University Jerusalem, Israel. sagiv@cs.huji.ac.il Divesh Srivastava AT&T Bell Laboratories
	ftp://ftp.research.att.com/dist/howe/thesis-appendix.ps.Z, 19940606 Appendix C The Partial-Reflection Library C.1 Complete Listing The first part of this appendix gives a complete listing of the library that was described in Chapter 5. What we show is similar to what would be displayed in Nuprl's library window, with the following exceptions. ffl The bodies of DEF, EVAL
	ftp://ftp.research.att.com/dist/jon/simpat.ps.Z, 19940606 Visualizing Similarity Patterns in Language Jonathan Isaac Helfman AT&T Bell Laboratories Murray Hill, NJ 07974-2070 jon@research.att.com
	ftp://ftp.research.att.com/dist/levy/paper-abstracts.ps.Z, 19940606 Recent Papers by Alon Y. Levy Artificial Intelligence Principles Research Department, AT&T Bell Labs, Murray Hill, NJ, 07974. Email: levy@research.att.com Papers available via anonymous ftp to research.att.com (directory dist/levy). Creating Abstractions Using Relevance Reasoning Proceedings of the 12th
	ftp://ftp.research.att.com/dist/howe/thesis.ps.Z, 19940606 Automating Reasoning in an Implementation of Constructive Type Theory A Thesis Presented to the Faculty of the Graduate School of Cornell University in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy by Douglas James Howe January 1988 Contents 1 Introduction 1 1.1 Nuprl in
	ftp://ftp.research.att.com/dist/jon/mcrsft2.ps.Z, 19940607 8 chapters of Microsoft manuals in Dutch, French, German, Italian, Spanish, Swedish 3.3 million 4-grams Church and Helfman, 1994
	ftp://ftp.research.att.com/dist/jon/features.ps, 19940607 a. Squares aaaaaaaaabbbbbbbbb b. Diagonals abcde f gh i abcde f gh i
	ftp://ftp.research.att.com/dist/howe/lics89.ps.Z, 19940607 Equality In Lazy Computation Systems Douglas J. Howe Department of Computer Science Cornell University Ithaca, New York 14853
	ftp://ftp.research.att.com/dist/levy/vldb94.ps.Z, 19940609 Query Optimization by Predicate Move-Around Alon Y. Levy AT&T Bell Laboratories Murray Hill, NJ. levy@research.att.com Inderpal Singh Mumick AT&T Bell Laboratories Murray Hill, NJ. mumick@research.att.com Yehoshua Sagiv Hebrew University Jerusalem, Israel. sagiv@cs.huji.ac.il
	ftp://ftp.research.att.com/dist/eos/eos2.1_user_guide.ps.Z, 19940610 EOS User's Guide Release 2.1 For UNIX-based Systems Alexandros Biliris Euthimios Panagos 600 Mountain Avenue AT&T Bell Laboratories Murray Hill, NJ 07974 fbiliris, thimiosg@research.att.com
	ftp://ftp.research.att.com/dist/trevor/fpda.ps.Z, 19940627 AT&T Bell Laboratories June 27, 1994 Nonparametric Discriminant Analysis 33 Summary ffl LDA is a classification procedure a data reduction and interpretation tool ffl FDA/PDA are both the above, as well as FDA can produce nonlinear decision boundaries FDA will produce better separation PDA will produce
	ftp://ftp.research.att.com/dist/alur/hybrid.ps, 19940630 Specification and Automatic Verification of Hybrid Systems 1 Motivation ffl To develop formal methods for automatic verification of real-time and hybrid systems ffl Example Systems { Communication protocols { Asynchronous circuits { Real-time control systems 2 Part I: Modeling 3 Discrete Untimed Systems
	ftp://ftp.research.att.com/dist/alur/reg.ps, 19940630 A, y=z=1 B, y=11,z>1 C, y=1
	ftp://ftp.research.att.com/dist/trevor/japan.talk.ps.Z, 19940706 Tokyo, Japan, July 1994 Modern Regression and Classification 19 Nonparametric Discriminant Analysis Hastie, Tibshirani and Buja, JASA, to appear Fisher's LDA is equivalent to: ffl Linear Regression: ^ Y = HY , followed by an ffl Eigendecomposition: Y T ^ Y = D T For a more flexible discriminant analysis
	ftp://ftp.research.att.com/dist/ai/dl-94/Notes.ps.Z, 19940712 Working Notes of the 1994 Description Logic Workshop Franz Baader Lehr- und Forschungsgebiet Theoretische Informatik RWTH Aachen Aachen, Germany baader@informatik.rwth-aachen.de Maurizio Lenzerini Dipartimento di Informatica e Sistermistica Universita di Roma, La Sapienza" Rome, Italy
	ftp://ftp.research.att.com/dist/ai/aaai94loc.ps.Z, 19940712 Noise Strategies for Improving Local Search Bart Selman, Henry A. Kautz, and Bram Cohen AT&T Bell Laboratories Murray Hill, NJ 07974 fselman, kautz, coheng@research.att.com This paper appears in Proceedings of AAAI-94, Seattle, WA, July 1994.
	ftp://ftp.research.att.com/dist/ml/papers/ML94/13-bjorner.ps.Z, 19940719 Minimal Typing Derivations Nikolaj Skallerud Bjorner Stanford University nikolaj@cs.stanford.edu
	ftp://ftp.research.att.com/dist/ml/papers/ML94/14-guzman.ps.Z, 19940719 An Extended Type System for Exceptions Juan Carlos Guzm an and Asc ander Su arez Universidad Sim on Bol var { Departamento de Computaci on Valle de Sartenejas, Caracas 1080, Venezuela Email: fjcguzman,suarezg@usb.ve
	ftp://ftp.research.att.com/dist/ml/papers/ML94/00-cover.ps.Z, 19940719 ISSN 0249-6399apport de recherchefl1994fl INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET AUTOMATIQUE Record of the 1994 ACM SIGPLAN Workshop on ML and its Applications Orlando, Florida (USA) June 25-26, 1994 N 2265 Juin 1994 PROGRAMME 2 Calcul symbolique, programmation et g enie logiciel
	ftp://ftp.research.att.com/dist/ml/papers/ML94/12-malmkjaer.ps.Z, 19940719 ML Partial Evaluation using Set-Based Analysis Karoline Malmkjaer Aarhus University (karoline@daimi.aau.dk) Nevin Heintze Carnegie Mellon University (nch@cs.cmu.edu) Olivier Danvy Aarhus University (danvy@daimi.aau.dk)
	ftp://ftp.research.att.com/dist/ml/papers/ML94/04-barthelemy.ps.Z, 19940719
	ftp://ftp.research.att.com/dist/ml/papers/ML94/09-chailloux.ps.Z, 19940719 mlP cTEX, a picture environment for LaTEX Emmanuel CHAILLOUX LIENS - LITPy Asc ander SU AREZ USBz- LIENS
	ftp://ftp.research.att.com/dist/ml/papers/ML94/02a-p22.ps.Z, 19940719 22
	ftp://ftp.research.att.com/dist/ml/papers/ML94/16-appel.ps.Z, 19940719 Axiomatic Bootstrapping: A guide for compiler hackers Andrew W. Appel Princeton University
	ftp://ftp.research.att.com/dist/ml/papers/ML94/05-thorup.ps.Z, 19940719 Object-Oriented Programming and Standard ML Lars Thorup and Mads Tofte Department of Computer Science, University of Copenhagen Universitetsparken 1, DK - 2100 O, Denmark.
	ftp://ftp.research.att.com/dist/ml/papers/ML94/11-serrano.ps.Z, 19940719 1 + 1 = 1: an optimizing Caml compiler M. Serrano P. Weis INRIA Rocquencourt
	ftp://ftp.research.att.com/dist/ml/papers/ML94/07-goubault.ps.Z, 19940719 HimML: Standard ML with Fast Sets and Maps Jean Goubault Bull S.A., rue Jean Jaur es, 78 340 Les Clayes-sous-Bois, France Tel: (33 1) 30 80 69 28 Jean.Goubault@frcl.bull.fr
	ftp://ftp.research.att.com/dist/ml/papers/ML94/10-kawaguchi.ps.Z, 19940719 TERSE: TErm Rewriting Support Environment Nobuo KAWAGUCHI Toshiki SAKABE Yasuyoshi INAGAKI Department of Information Engineering, Nagoya University Furo-cho, Chikusa-ku, Nagoya, 464-01 JAPAN E-mail: kawaguti@inagaki.nuie.nagoya-u.ac.jp
	ftp://ftp.research.att.com/dist/ml/papers/ML94/00-front.ps.Z, 19940719 Foreword The ML programming language has evolved as an important tool, as well as a framework for research in language design and implementation. The aim of this workshop is to present recent developments and provide a forum for new ideas related to ML. The main theme of the papers is modularity \|
	ftp://ftp.research.att.com/dist/ml/papers/ML94/02-cregut.ps.Z, 19940719 An Implementation of Higher-Order Functors Pierre Cr egut David B. MacQueen CNET - France Telecom AT&T Bell Laboratories Lannion - France Murray Hill - USA
	ftp://ftp.research.att.com/dist/ml/papers/ML94/06-duggan.ps.Z, 19940719 Object interfaces, polymorphic methods and multi-method dispatching for ML-like languages Dominic Duggan Department of Computer Science University of Waterloo Ontario, Canada N2L 3G1. dduggan@uwaterloo.ca 1 Introduction Recent years have seen much attention paid to the foundations of typed object
	ftp://ftp.research.att.com/dist/ml/papers/ML94/01-leroy.ps.Z, 19940719 A syntactic theory of type generativity and sharing (extended abstract) Xavier Leroy INRIA Rocquencourt
	ftp://ftp.research.att.com/dist/ml/papers/ML94/15-harper.ps.Z, 19940719 A Compilation Manager for Standard ML of New Jersey Robert Harper Frank Pfenning Peter Lee Eugene Rollins
	ftp://ftp.research.att.com/dist/ml/papers/ML94/08-mauny.ps.Z, 19940719 A complete and realistic implementation of quotations for ML Michel Mauny INRIA-Rocquencourt Daniel de Rauglaudre INRIA-Rocquencourt
	ftp://ftp.research.att.com/dist/ml/papers/ML94/03-cregut.ps.Z, 19940719 Safe Dynamic Connection of Distributed Applications Pierre Cr egut CNET Lannion - France Telecom E-mail: cregut@lannion.cnet.fr
	ftp://ftp.research.att.com/dist/tds/CAR.ps, 19940802 From: Proceedings of the ACM SIGCOMM '94 Conference; London, UK; August 31 to September 2, 1994. Controlling Alternate Routing in General-Mesh Packet Flow Networks Sandeep Sibal ECSE Department Rensselaer Polytechnic Institute Troy, NY 12180-3590 sibal@networks.ecse.rpi.edu Antonio DeSimone Performance
	ftp://ftp.research.att.com/dist/anoncc/privacy.ps.Z, 19940808 The Use of Communications Networks to Increase Personal Privacy N. F. Maxemchuk S. Low AT&T Bell Laboratories Murray Hill, New Jersey 07974 1. Introduction As computer memories have increased in size and decreased in cost, it has become reasonable to assemble vast amounts of information about
	ftp://ftp.research.att.com/dist/trevor/fda.ps.Z, 19940812 Flexible Discriminant Analysis by Optimal Scoring Trevor Hastie Statistics and Data Analysis Research Group AT&T Bell Laboratories Murray Hill, New Jersey Robert Tibshirani Department of Preventive Medicine and Biostatistics and Department of Statistics University of Toronto Toronto, Ontario Andreas
	ftp://ftp.research.att.com/dist/wcohen/papers/ijcai-93.ps, 19940812 Efficient Pruning Methods for Separate-and-Conquer Rule Learning Systems William W. Cohen AT&T Bell Laboratories 600 Mountain Avenue Murray Hill, NJ 07974 wcohen@research.att.com
	ftp://ftp.research.att.com/dist/wcohen/papers/ijcai-ws-93.ps, 19940812 Rapid Prototyping of ILP Systems Using Explicit Bias William W. Cohen AT&T Bell Laboratories Room 2A-427, 600 Mountain Avenue Murray Hill, NJ 07974 wcohen@research.att.com
	ftp://ftp.research.att.com/dist/wcohen/papers/clnl-90.ps, 19940812 Learning from Data with Bounded Inconsistency: Theoretical and Experimental Results Haym Hirsh Computer Science Department Hill Center, Busch Campus Rutgers University New Brunswick, NJ 08903 hirsh@cs.rutgers.edu William W. Cohen AT&T Bell Laboratories 600 Mountain Avenue Murray Hill, NJ 07974
	ftp://ftp.research.att.com/dist/wcohen/papers/mlj-aebl.ps, 19940812 Abductive Explanation-Based Learning: A Solution to the Multiple Inconsistent Explanation Problem William W. Cohen AT&T Bell Laboratories 600 Mountain Avenue Murray Hill, NJ 07974 (201)-582-2092 wcohen@research.att.com June 13, 1994
	ftp://ftp.research.att.com/dist/wcohen/papers/mlj-dleq.ps, 19940812 The Learnability of Description Logics with Equality Constraints William W. Cohen AT&T Bell Laboratories 600 Mountain Avenue Murray Hill, NJ 07974 wcohen@research.att.com Haym Hirsh Department of Computer Science Hill Center for the Mathematical Sciences Busch Campus Rutgers University New Brunswick, NJ
	ftp://ftp.research.att.com/dist/wcohen/papers/aaai-92.ps, 19940812 Computing Least Common Subsumers in Description Logics William W. Cohen AT&T Bell Laboratories 600 Mountain Avenue Murray Hill, NJ 07974 wcohen@research.att.com Alex Borgida Dept. of Computer Science Rutgers University New Brunswick, NJ 08903 borgida@cs.rutgers.edu Haym Hirsh Dept. of Computer Science
	ftp://ftp.research.att.com/dist/wcohen/papers/aaai-93-force2.ps, 19940812 Pac-Learning a Restricted Class of Recursive Logic Programs William W. Cohen AT&T Bell Laboratories 600 Mountain Avenue Murray Hill, NJ 07974 wcohen@research.att.com
	ftp://ftp.research.att.com/dist/wcohen/papers/classic-tr.ps, 19940812 Learnability of the Classic Knowledge Representation Language William W. Cohen AT&T Bell Laboratories 600 Mountain Avenue Murray Hill, NJ 07974 wcohen@research.att.com Haym Hirsh Department of Computer Science Rutgers University New Brunswick, NJ 08903 hirsh@cs.rutgers.edu April 30, 1993
	ftp://ftp.research.att.com/dist/wcohen/papers/aaai-93-cryptlim.ps, 19940812 Cryptographic Limitations on Learning One-Clause Logic Programs William W. Cohen AT&T Bell Laboratories 600 Mountain Avenue Murray Hill, NJ 07974 wcohen@research.att.com
	ftp://ftp.research.att.com/dist/wcohen/papers/aij-nonrec.ps, 19940812 Pac-Learning Non-Recursive Prolog Clauses William W. Cohen AT&T Bell Laboratories 600 Mountain Avenue Murray Hill, NJ 07974 (908)-582-2092 wcohen@research.att.com December 2, 1993
	ftp://ftp.research.att.com/dist/wcohen/papers/aaai-90.ps, 19940812 (VanLehn, 1987) K. VanLehn. Learning one subprocedure per lesson. Artificial Intelligence, 31:1{40, 1987. Conclusions To summarize, we have identified a problem that arises in learning from the knowledge in textbooks: the problem of learning from knowledge including omissions and inconsistencies that
	ftp://ftp.research.att.com/dist/wcohen/papers/ml-88.ps, 19940812 Generalizing Number and Learning from Multiple Examples in Explanation Based Learning William W. Cohen Rutgers Computer Science Department New Brunswick, NJ 08903 (201)-932-4714 wcohen@paul.rutgers.edu August 12, 1994
	ftp://ftp.research.att.com/dist/wcohen/papers/ci.ps, 19940812 Using Distribution-Free Learning Theory to Analyze Solution Path Caching Mechanisms William W. Cohen AT&T Bell Laboratories 600 Mountain Avenue Murray Hill, NJ 07974 (201)-582-2092 wcohen@research.att.com August 12, 1994
	ftp://ftp.research.att.com/dist/wcohen/papers/ras-sub.ps, 19940812 Adaptive Mapping and Navigation by Teams of Simple Robots William W. Cohen AT&T Bell Laboratories 600 Mountain Avenue Murray Hill, NJ 07974 (908)-582-2092 wcohen@research.att.com March 24, 1994
	ftp://ftp.research.att.com/dist/wcohen/papers/colt-92.ps, 19940812 Learnability of Description Logics William W. Cohen AI Principles Research Department AT&T Bell Laboratories 600 Mountain Avenue Murray Hill, NJ 07974 wcohen@research.att.com Haym Hirsh Department of Computer Science Hill Center, Busch Campus, Rutgers University New Brunswick, NJ 08903
	ftp://ftp.research.att.com/dist/wcohen/papers/kr-94.ps, 19940812 Learning the Classic Description Logic: Theoretical and Experimental Results William W. Cohen AI Principles Research Department AT&T Bell Laboratories Murray Hill, NJ 07974 wcohen@research.att.com Haym Hirsh AI Principles Research Department AT&T Bell Laboratories Murray Hill, NJ 07974
	ftp://ftp.research.att.com/dist/wcohen/papers/ilp-93.ps, 19940812 Learnability of Restricted Logic Programs William W. Cohen AT&T Bell Laboratories 600 Mountain Avenue Murray Hill, NJ 07974 wcohen@research.att.com December 28, 1993
	ftp://ftp.research.att.com/dist/wcohen/papers/aaai-94-rc.ps, 19940812 Recovering Software Specifications with Inductive Logic Programming William W. Cohen AT&T Bell Laboratories 600 Mountain Avenue Murray Hill, NJ 07974 wcohen@research.att.com
	ftp://ftp.research.att.com/dist/wcohen/papers/ml-92.ps, 19940812 Compiling Prior Knowledge Into an Explicit Bias William W. Cohen AT&T Bell Laboratories AI Principles Research Department Murray Hill, NJ 07974 USA wcohen@research.att.com
	ftp://ftp.research.att.com/dist/wcohen/papers/ml-90-repshift.ps, 19940812 An Analysis of Representation Shift In Concept Learning William W. Cohen Computer Science Department Rutgers University New Brunswick, NJ 08903
	ftp://ftp.research.att.com/dist/wcohen/papers/aij-grendel.ps, 19940812 Grammatically Biased Learning: Learning Horn Theories Using an Explicit Antecedent Description Language William W. Cohen AT&T Bell Laboratories 600 Mountain Avenue Murray Hill, NJ 07974 (908)-582-2092 wcohen@research.att.com March 24, 1993
	ftp://ftp.research.att.com/dist/wcohen/papers/aaai-94-local.ps, 19940812 Pac-learning Nondeterminate Clauses William W. Cohen AT&T Bell Laboratories 600 Mountain Avenue Murray Hill, NJ 07974 wcohen@research.att.com
	ftp://ftp.research.att.com/dist/wcohen/papers/ml-90-axaebl.ps, 19940812 Learning Approximate Control Rules Of High Utility William W. Cohen Computer Science Department Rutgers University New Brunswick, NJ 08903
	ftp://ftp.research.att.com/dist/wcohen/papers/ml-91.ps, 19940812 The Generality Of Overgenerality William W. Cohen AI Principles Research Dept. AT&T Bell Laboratories 600 Mountain Avenue Murray Hill, NJ 07974 wcohen@research.att.com
	ftp://ftp.research.att.com/dist/wcohen/papers/mlj-iaebl.ps, 19940812 Incremental Abductive EBL William W. Cohen AT&T Bell Laboratories 600 Mountain Avenue Murray Hill, NJ 07974 wcohen@research.att.com February 10, 1993
	ftp://ftp.research.att.com/dist/wcohen/papers/clnl-91.ps, 19940812 Probabilistic Hill-Climbing William W. Cohen AT&T Bell Laboratories Murray Hill, NJ 07974 wcohen@research.att.com Russell Greiner Siemens Corporate Research Princeton, NJ 08540 greiner@learning.siemens.com Dale Schuurmans Department of Computer Science University of Toronto Toronto, Ontario M5S 1A4
	ftp://ftp.research.att.com/dist/wcohen/papers/jair-rec-sub.ps, 19940812 The Pac-Learnability of Recursive Logic Programs William W. Cohen AT&T Bell Laboratories 600 Mountain Avenue Murray Hill, NJ 07974 (908)-582-2092 wcohen@research.att.com August 8, 1994
	ftp://ftp.research.att.com/dist/wcohen/papers/aii-92.ps, 19940812 Desiderata for Generalization-to-N Algorithms William W. Cohen AI Principles Research Department, AT&T Bell Laboratories 600 Mountain Avenue Murray Hill, NJ 07974 USA wcohen@research.att.com August 12, 1994
	ftp://ftp.research.att.com/dist/anoncc/copyright.epub.ps.Z, 19940818 Copyright Protection for Electronic Publishing over Computer Networks A. K. Choudhury, N. F. Maxemchuk, and S. Paul AT&T Bell Laboratories Murray Hill, NJ 07974 fakc,nfm,sanjoyg@research.att.com H. G. Schulzrinne GMD-Fokus Berlin, Germany hgs@fokus.gmd.de
	ftp://ftp.research.att.com/dist/ml/papers/ML94/00-cover-A4.ps.Z, 19940824 ISSN 0249-6399apport de recherchefl1994fl INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET AUTOMATIQUE Record of the 1994 ACM SIGPLAN Workshop on ML and its Applications Orlando, Florida (USA) June 25-26, 1994 N 2265 Juin 1994 PROGRAMME 2 Calcul symbolique, programmation et g enie logiciel
	ftp://ftp.research.att.com/dist/ml/papers/ML94/00-french-front.ps.Z, 19940824 Actes du s eminaire 1994 ACM-SIGPLAN Workshop on ML and its Applications Avant propos Le langage de programmation ML est devenu a la fois un outil important et un cadre de travail pour la recherche sur la conception des langages et de leur mise en oeuvre. Le but de ce s eminaire est de pr esenter les d
	ftp://ftp.research.att.com/dist/mab/eesproto.ps, 19940831 Protocol Failure in the Escrowed Encryption Standard Matt Blaze AT&T Bell Laboratories mab@research.att.com August 20, 1994
	ftp://ftp.research.att.com/dist/levy/information-manifold.ps.Z, 19940909 The Information Manifold Thomas Kirk, Alon Y. Levy, Divesh Srivastava AT&T Bell Laboratories tk,levy,divesh@research.att.com The growth in the quality and number of online information services holds forth the promise of enriching the ways we work and live, yet at the same time the rapid expansion of
	ftp://ftp.research.att.com/dist/levy/glis-challenges.ps.Z, 19940909 Global Information Systems Data Models and Query Evaluation Thomas Kirk AT&T Bell Laboratories tk@research.att.com Alon Y. Levy AT&T Bell Laboratories levy@research.att.com Yehoshua Sagiv Hebrew University sagiv@cs.huji.ac.il Divesh Srivastava AT&T Bell Laboratories divesh@research.att.com
	ftp://ftp.research.att.com/dist/howe/abstract.ps.Z, 19940912 An Extensional Model of Nuprl Douglas J. Howe The standard" semantics for Nuprl's type theory is based on Allen's partial-equivalencerelation semantics for Martin-L of's extensional type theory. We give a new model of Nuprl that solves two serious problems with this semantics, allowing a number of
	ftp://ftp.research.att.com/dist/ai/aaai94kc.ps.Z, 19940914 An Empirical Evaluation of Knowledge Compilation Henry Kautz and Bart Selman AI Principles Research Department AT&T Bell Laboratories Murray Hill, NJ 07974 fkautz, selmang@research.att.com This paper appears in Proceedings of AAAI-94, Seattle, WA, July 1994.
	ftp://ftp.research.att.com/dist/eos/eos2.2_user_guide.ps.Z, 19941001 EOS User's Guide Release 2.2 For UNIX-based Systems Alexandros Biliris Euthimios Panagos 600 Mountain Avenue AT&T Bell Laboratories Murray Hill, NJ 07974 fbiliris, thimiosg@research.att.com
	ftp://ftp.research.att.com/dist/anoncc/anoncc.ps.Z, 19941005 Anonymous Credit Cards1 Steven H. Low Nicholas F. Maxemchuk AT&T Bell Laboratories, Murray Hill, NJ 07974 and Sanjoy Paul AT&T Bell Laboratories, Holmdel, NJ 07733
	ftp://ftp.research.att.com/dist/riecke/linear-logic-lfp.ps.gz, 19941006 Proving Memory Management Invariants for a Language Based on Linear Logic Jawahar Chirimar Carl A. Gunter Jon G. Riecke Department of Computer and Information Science University of Pennsylvania Philadelphia, PA 19104 April 9, 1992
	ftp://ftp.research.att.com/dist/ml/papers/94-sas-yi.ps, 19941006 Compile-time Detection of Uncaught Exceptions in Standard ML Programs Kwangkeun Yi AT&T Bell Laboratories
	ftp://ftp.research.att.com/dist/ml/papers/93-trends-gansner.ps, 19941006 4 A Multi-threaded Higher-order User Interface Toolkit EMDEN R. GANSNER and JOHN H. REPPY AT&T Bell Laboratories
	ftp://ftp.research.att.com/dist/riecke/algebraic.ps.gz, 19941006 Algebraic Reasoning and Completeness in Typed Languages Jon G. Riecke AT&T Bell Laboratories Ramesh Subrahmanyam Wesleyan University
	ftp://ftp.research.att.com/dist/ml/papers/92-lncs-reppy.ps, 19941006 Concurrent ML: Design, Application and Semantics John H. Reppy Department of Computer Science Cornell University 1 Introduction Concurrent ML (CML) is a high-level, high-performance language for concurrent programming. It is an extension of Standard ML (SML) , and is implemented on top of
	ftp://ftp.research.att.com/dist/ml/papers/94-esop-macqueen.ps, 19941006 A Semantics for Higher-order Functors David B. MacQueen1 and Mads Tofte2 1 AT&T Bell Labs, New Jersey, USA 2 Dept. of Computer Science, Copenhagen University, Denmark
	ftp://ftp.research.att.com/dist/ml/papers/94-cc-george.ps, 19941006 A Portable and Optimizing Back End for the SML/NJ Compiler Lal George1, Florent Guillame2, John H. Reppy1 1 AT&T Bell Laboratories, 600 Mountain Ave., Murray Hill, NJ 07974, USA 2 Ecole Normale Sup erieure, 45, rue d'Ulm, 75005 Paris, France Email: fgeorge, jhrg@research.att.com, guillaum@clipper.ens.fr
	ftp://ftp.research.att.com/dist/riecke/kripke-pcf.ps.gz, 19941006 Kripke Logical Relations and PCF Peter W. O'Hearn Syracuse University Jon G. Riecke AT&T Bell Laboratories October 6, 1994
	ftp://ftp.research.att.com/dist/ml/papers/91-plip-appel.ps, 19941006 Standard ML of New Jersey Andrew W. Appel Princeton University David B. MacQueen AT&T Bell Laboratories
	ftp://ftp.research.att.com/dist/riecke/delimiters.ps.gz, 19941006 Delimiting the Scope of Effects Jon G. Riecke AT&T Bell Laboratories 600 Mountain Avenue Murray Hill, NJ 07974 USA riecke@research.att.com
	ftp://ftp.research.att.com/dist/ml/papers/93-tr-reppy.ps, 19941006 A High-performance Garbage Collector for Standard ML John H. Reppy AT&T Bell Laboratories 600 Mountain Ave. Murray Hill, NJ 07974 We have designed and implemented a new garbage collector for the Standard ML of New Jersey System (SML/NJ). This collector has higher performance, lower latency and generally
	ftp://ftp.research.att.com/dist/riecke/fa-poly.ps.gz, 19941006 Fully Abstract Translations and Parametric Polymorphism Peter W. O'Hearn 1 and Jon G. Riecke2 1 School of Computer & Information Science, Syracuse University Syracuse NY 13244-4100 ohearn@top.cis.syr.edu 2 AT&T Bell Laboratories 600 Mountain Avenue, Murray Hill, NJ 07974 riecke@research.att.com
	ftp://ftp.research.att.com/dist/ml/papers/90-tr-reppy.ps, 19941006 Asynchronous Signals in Standard ML John H. Reppy TR 90-1144 August 1990 Department of Computer Science Cornell University Ithaca, NY 14853 This work was supported, in part, by the NSF and ONR under NSF grant CCR-85-14862 Asynchronous Signals in Standard ML John H. Reppy Cornell University
	ftp://ftp.research.att.com/dist/riecke/translation-popl.ps.gz, 19941006 Fully Abstract Translations between Functional Languages (Preliminary Report) Jon G. Riecke MIT Laboratory for Computer Science
	ftp://ftp.research.att.com/dist/riecke/amast.ps.gz, 19941006 LCF Should Be Lifted (Summary) Bard Bloom Jon G. Riecke MIT Laboratory for Computer Science Cambridge, MA 02139 email: bard@theory.lcs.mit.edu, riecke@theory.lcs.mit.edu
	ftp://ftp.research.att.com/dist/ml/papers/85-note-baudinet.ps, 19941006 Tree Pattern Matching for ML (extended abstract) Mariann e Baudine t S t a n f or d U n ive r sit y C o m p u t e r S cien ce D e p a r t m e n t S t a n f or d , C A 94305 David MacQ ueen A T & T Bell L a b or a t o r ie s 600 M ou n t a in A ve n u e M u r r a y H ill, N J 07974 D e cem be r 6, 1985
	ftp://ftp.research.att.com/dist/riecke/translation-journal.ps.gz, 19941006 Math. Struct. in Comp. Science (1993), vol. 11, pp. 1{000 Fully Abstract Translations between Functional Languages Jon G. Rieckey AT&T Bell Laboratories, 600 Mountain Avenue, Murray Hill, NJ 07974 Received 3 March 1993 We examine the problem of finding fully abstract translations between programming
	ftp://ftp.research.att.com/dist/ml/papers/93-tr-efremidis.ps, 19941006 AML: Attribute Grammars in ML Sofoklis G. Efremidis Cornell University Khalid A. Mughal University of Bergen John H. Reppy AT&T Bell Laboratories December 1993 This report is available as Cornell University Department of Computer Science Technical Report TR 93-1401, and as Reports in Informatics,
	ftp://ftp.research.att.com/dist/ml/papers/92-tr-aitken.ps, 19941006
	ftp://ftp.research.att.com/dist/ml/papers/92-lncs-macqueen.ps, 19941006 Reflections on Standard ML David B. MacQueen AT&T Bell Laboratories Murray Hill NJ 07974
	ftp://ftp.research.att.com/dist/riecke/extensions.ps.gz, 19941010 Extensions to Type Systems Can Preserve Operational Equivalences Jon G. Riecke1 and Ramesh Subrahmanyam2 1 AT&T Bell Laboratories 600 Mountain Avenue, Murray Hill, NJ 07974 riecke@research.att.com 2 Department of Mathematics, Wesleyan University Middletown, CT 06459 rsubrahmanya@eagle.wesleyan.edu
	ftp://ftp.research.att.com/dist/riecke/masters.ps.gz, 19941010 by Jon Gary Riecke B.A., Computer Science Williams College (1986) submitted to the Department of Electrical Engineering and Computer Science in partial fulfillment of the requirements for the degree of Master of Science in Electrical Engineering and Computer Science at the Massachusetts Institute of
	ftp://ftp.research.att.com/dist/anoncc/collude.ps.Z, 19941010 Anonymous Credit Cards and its Collusion Analysis Steven H. Low Nicholas F. Maxemchuk Sanjoy Paul AT&T Bell Laboratories Murray Hill, NJ 07974 October 10, 1994
	ftp://ftp.research.att.com/dist/qos/pp.ps.Z, 19941017 Packet-Pair Flow Control Srinivasan Keshav AT&T Bell Laboratories 600 Mountain Avenue, Murray Hill, NJ 07974, USA keshav@research.att.com
	ftp://ftp.research.att.com/dist/hall/papers/isat/subsetting-sim-dyn-slicing-jaseV2.ps, 19941024 Automatic Extraction of Executable Program Subsets by Simultaneous Dynamic Program Slicing by Robert J. Hall AT&T Bell Laboratories 600 Mountain Ave., Rm 2B-229 Murray Hill, NJ 07974-0636 email: hall@research.att.com phone: (908) 582-5139, fax: (908) 582-5192
	ftp://ftp.research.att.com/dist/hall/papers/isat/systematic-validation-detail.ps, 19941024 SPHONE: The Details Robert J. Hall AT&T Bell Laboratories Murray Hill, NJ 07974-0636 hall@research.att.com This section gives the details of the SPHONE case study discussed in my KBSE'94 paper. Figure 1 shows the three end-user supplied requirement scenarios, PH-1\|3. Figure 2 shows the full 11 rule
	ftp://ftp.research.att.com/dist/hall/papers/cpprof/usenix93.ps, 19941024 Call Path Profiling of Monotonic Program Resources in UNIX by Robert J. Hall Aaron J. Goldberg AT&T Bell Laboratories 600 Mountain Ave. Murray Hill, NJ 07974
	ftp://ftp.research.att.com/dist/hall/papers/cpprof/integration.ps, 19941024 Integrated Call Path Profiling of Multiple System Resources by Robert J. Hall AT&T Bell Laboratories Murray Hill, NJ 07974-0636 hall@research.att.com, (908) 582-5139 Aaron J. Goldberg Lehman Bros. New York, NY ajg@cs.stanford.edu, (212) 640-6294
	ftp://ftp.research.att.com/dist/hall/papers/cpprof/icse92.ps, 19941024 Call Path Profiling Robert J. Hall AT&T Bell Laboratories 600 Mountain Ave. Murray Hill, NJ 07974-0636 hall@allegra.att.com
	ftp://ftp.research.att.com/dist/hall/papers/misc/gen-behavior-based-retrieval-icse93.ps, 19941024 Generalized Behavior-based Retrieval Robert J. Hall AT&T Bell Laboratories 600 Mountain Ave. Murray Hill, NJ, 07974-0636 hall@allegra.att.com
	ftp://ftp.research.att.com/dist/hall/papers/isat/systematic-validation-kbse94.ps, 19941024 Systematic Incremental Validation of Rule-based Reactive Systems Robert J. Hall AT&T Bell Laboratories Murray Hill, NJ, 07974-0636 hall@research.att.com
	ftp://ftp.research.att.com/dist/hall/papers/isat/ebg-validation-kbse93.ps, 19941024 Validation of Rule-based Reactive Systems by Sound Scenario Generalization Robert J. Hall AT&T Bell Laboratories Murray Hill, NJ, 07974-0636 hall@research.att.com
	ftp://ftp.research.att.com/dist/hall/papers/misc/more-powerful-ebg.ps, 19941024 Clause Unioning and Proof Restructuring: Improving the Power of Explanation-based Generalization by Robert J. Hall AT&T Bell Laboratories 600 Mountain Ave. Murray Hill, NJ 07974-0636 Internet: hall@research.att.com
	ftp://ftp.research.att.com/dist/hall/papers/isat/proposal-aaai92asd.ps, 19941024 Interactive Specification Acquisition via Scenarios: A Proposal Robert J. Hall AT&T Bell Laboratories 600 Mountain Ave. Murray Hill, New Jersey 07974-0636 hall@allegra.att.com
	ftp://ftp.research.att.com/dist/andreas/PS/rejoinder.ps, 19941026 Rejoinder Andreas Buja George W. Furnas September 22, 1994 1 General Comments We thank the authors for a stimulating discussion. They point out difficulties as well as advantages of prosection ideas. Of great interest are also their experiences with alternative but related methodologies and systems.
	ftp://ftp.research.att.com/dist/levy/sss95/demolombe.ps, 19941026 A common logical framework to retrieve information and meta information Robert Demolombe ONERA/CERT, Toulouse, France demolomb@tls-cs.cert.fr Andrew Jones Department of Philosophy, University of Oslo, Norway jones@hedda.uio.no 1 Introduction The development of networks connecting a large number of
	ftp://ftp.research.att.com/dist/andreas/APC/apc.ps, 19941026
	ftp://ftp.research.att.com/dist/andreas/APC/rejoinder.ps, 19941026 Rejoinder October 10, 1994 We thank Professor Flury for his insightful remarks. In particular we are glad that he pointed to a Gnanadesikan-Wilks reference that fell by the wayside as we shortened the paper. Since points of disagreement often expose critical ideas, we first take up Flury's assertion
	ftp://ftp.research.att.com/dist/levy/sss95/knoblock-levy.ps, 19941026 Efficient Query Processing for Information Gathering Agents 1 Introduction In the not too distant future, we envision information gathering agents that will have access to a large set of diverse information sources. These information sources will not belong to the agent, rather they will be information
	ftp://ftp.research.att.com/dist/andreas/PS/figs.ps, 19941026 1 234 5 61 2 3 4 56 Figure 1: Two 2-projections of the ultrametric locus. (The projections of the coordinate unit vec- tors are shown in the bottom left corner.) 6543210 10 210 Dimension of Target 6-Space 2-D Image linepoint plane linepoint The GAP 2-D Section 2-D Projection Figure 2: Projection can
	ftp://ftp.research.att.com/dist/ai/horn-rel.ps.Z, 19941026 Horn Approximations of Empirical Data Henry Kautz, Michael Kearns, and Bart Selman AI Principles Research Dept., AT&T Bell Laboratories, Murray Hill, NJ 07974 email: fkautz, mkearns, selmang@research.att.com
	ftp://ftp.research.att.com/dist/levy/sss95/zeng.ps, 19941026 Task-based Multi-agent Coordination for Information Gathering Katia P. Sycara Dajun Zeng katia+@cs.cmu.edu zeng+@cs.cmu.edu (412)268-8825 (412)268-8815 The Robotics Institute School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 1. Introduction The ubiquity of network-based
	ftp://ftp.research.att.com/dist/levy/sss95/hall.ps, 19941029 Agents Helping Agents: Issues in Sharing How-to Knowledge (Abstract of a Research Proposal) by Robert J. Hall AT&T Bell Laboratories Murray Hill, NJ 07974-0636 hall@research.att.com Submitted to 1995 AAAI Spring Symposium on Information Gathering from Heterogeneous, Distributed Environments1
	ftp://ftp.research.att.com/dist/levy/sss95/buvac.ps, 19941029 A Declarative Formalization of Knowledge Translation Sa<=sa Buva<=c Computer Science Department Stanford University Stanford California 94305-2140 buvac@sail.stanford.edu Richard Fikes Knowledge Systems Laboratory Stanford University 701 Welch Road, Bldg C Palo Alto California 94304
	ftp://ftp.research.att.com/dist/levy/sss95/liu.ps, 19941029 Incorporating an Agent-based Communication Model in an Object-oriented Software Environment Ling Liu Department of Computing Science University of Alberta, 615 GSB Edmonton, T6G 2H1 Alberta, Canada Email: lingliu@cs.ualberta.ca Calton Pu Department of Computer Science and Engineering Oregon Graduate
	ftp://ftp.research.att.com/dist/levy/sss95/kautz.ps, 19941029 Agent Amplified Communication
	ftp://ftp.research.att.com/dist/riecke/isolating-sequential.ps.gz, 19941031 Isolating Side Effects in Sequential Languages Jon G. Riecke AT&T Bell Laboratories 600 Mountain Avenue Murray Hill, NJ 07974, USA Email: riecke@research.att.com Ramesh Viswanathan Stanford University Department of Computer Science Stanford, CA 94305, USA Email: vramesh@theory.stanford.edu
	ftp://ftp.research.att.com/dist/levy/sss95/kirk.ps, 19941109 The Information Manifold (Submission for AAAI Spring Symposium Workshop on Information Gathering from Heterogeneous, Distributed Environments) Thomas Kirk Alon Y. Levy Divesh Srivastava AT&T Bell Laboratories 600 Mountain Avenue Murray Hill, NJ 07974, U.S.A. tk,levy,divesh@research.att.com 1
	ftp://ftp.research.att.com/dist/anoncc/epub.ps.Z, 19941111 Electronic Document Distribution N. F. Maxemchuk AT&T Bell Laboratories Murray hill, New Jersey 07974
	ftp://ftp.research.att.com/dist/anoncc/privacy.health.ps.Z, 19941111 The Use of Communication Networks to Increase Personal Privacy In a Health Insurance Architecture N. F. Maxemchuk S. H. Low AT&T Bell Laboratories Murray Hill, New Jersey 07974 1. Introduction If a national health insurance plan is implemented, the government has an obligation to monitor its use and to
	ftp://ftp.research.att.com/dist/ml/papers/92-thesis-reppy.ps.Z, 19941112 Higher-order Concurrency John Hamilton Reppy Ph.D Thesis TR 92-1852 June 1992 Department of Computer Science Cornell University Ithaca, NY 14853 HIGHER-ORDER CONCURRENCY A Dissertation Presented to the Faculty of the Graduate School of Cornell University in Partial Fulfillment of the Requirements for
	ftp://ftp.research.att.com/dist/levy/sss95/ordille.ps, 19941114 Information Gathering and Distribution in Nomenclator Joann J. Ordille joann@research.att.com AT&T Bell Laboratories Computing Science Research Center 600 Mountain Ave., Rm. 2C-301 Murray Hill, NJ. 07974 1. INTRODUCTION As the Internet grows beyond a million hosts in tens of thousands of organizations,
	ftp://ftp.research.att.com/dist/mab/mcg.ps, 19941202 ek = &(key->val); /* round loop, unrolled 4x / for (i=0; i<(ROUNDS/4); ++i) c = r2 ^ (--ek); b = r1 ^ (--ek); a = r0 ^ (--ek); r3 ^=((OUT0 & stable) \| (OUT1 & stable) \| (OUT2 & stable) \|
	ftp://ftp.research.att.com/dist/riecke/one-section.ps.gz, 19941205 Statman's 1-Section Theorem Jon G. Riecke AT&T Bell Laboratories, 600 Mountain Avenue, Murray Hill, NJ 07974
	ftp://ftp.research.att.com/dist/douglis/storage-alternatives/paper.ps.gz, 19941212 Storage Alternatives for Mobile Computers y Fred Douglisz Ram on C aceres AT&T Bell Laboratories AT&T Bell Laboratories Frans Kaashoek Kai Li Massachusetts Institute of Technology Princeton University Brian Marsh Joshua A. Tauber D.E. Shaw & Co. Massachusetts Institute of Technology
	ftp://ftp.research.att.com/dist/slow/pricing.ps.Z, 19941212 A New Approach to Service Provisioning in ATM Networks Steven H. Low, Member, IEEE, and Pravin P. Varaiya, Fellow, IEEE
	ftp://ftp.research.att.com/dist/classic/finalsigmod-for-viewing.ps, 19941212 CLASSIC: A Structural Data Model for Objects Alexander Borgida Ronald J. Brachman Deborah L. McGuinness Lori Alperin Resnick AT&T Bell Laboratories Murray Hill, NJ 07974
	ftp://ftp.research.att.com/dist/ramon/osdi94.ps.Z, 19941214 Storage Alternatives for Mobile Computers Fred Douglis Ram on C aceres AT&T Bell Laboratories AT&T Bell Laboratories Frans Kaashoek Kai Li Massachusetts Institute of Technology Princeton University Brian Marsh Joshua A. Tauber D.E. Shaw & Co. Massachusetts Institute of Technology To appear in the
	ftp://ftp.research.att.com/dist/drawdag/koutsofios-north-GI94.ps.gz, 19941214 Applications of Graph Visualization Stephen C. North Eleftherios Koutsofios AT&T Bell Laboratories 600 Mountain Avenue Murray Hill, NJ 07974
	ftp://ftp.research.att.com/dist/ramon/jsac.ps.Z, 19941214 Improving the Performance of Reliable Transport Protocols in Mobile Computing Environments Ram on C aceres Liviu Iftode AT&T Bell Laboratories Princeton University 101 Crawfords Corner Road Department of Computer Science Holmdel, NJ 07733, USA Princeton, NJ 08544, USA ramon@research.att.com
	ftp://ftp.research.att.com/dist/douglis/storage-alternatives/talk.ps.gz, 19941220 3DJH <= )UHG 'RXJOLV GRXJOLV#UHVHDUFK DWW FRP 6WRUDJH $OWHUQDWLYHV IRU 0RELOH &RPSXWHUV :RUN SHUIRUPHG DW 0DWVXVKLWD ,QIRUPDWLRQ 7HFKQRORJ /DERUDWRU 3ULQFHWRQffl 1- -RLQW ZRUN ZLWK 5DPyQ &iFHUHVffl )UDQV .DDVKRHNffl .DL /Lffl %ULDQ 0DUVKffl DQG -RVKXD 7DXEHU $7 7 %HOO /DERUDWRULHV 0XUUD +LOOffl 1- >=
	ftp://ftp.research.att.com/dist/kanakia/sigcomm92.ps.Z, 19950111 A Hop by Hop Rate-based Congestion Control Scheme Partho P. Mishra Systems Design and Analysis Group Department of Computer Science University of Maryland partho@cs.umd.edu Hemant Kanakia Computing Science Research Center AT&T Bell Labs Murray Hill kanakia@research.att.com January 13, 1992
	ftp://ftp.research.att.com/dist/howe/bisim-note.ps.gz, 19950111 A Note on Proving Congruence of Bisimulation in a Generalized Lambda Calculus Douglas J. Howe AT&T Bell Laboratories 600 Mountain Avenue, Room 2B-438 Murray Hill, NJ 07974, USA howe@research.att.com
	ftp://ftp.research.att.com/dist/kanakia/jvideo.ps.Z, 19950112 a) b) Figure 12: Frame #110 for bicycle sequence with a) priority loss and b) random loss a) b) Figure 11: Frame #110 for bicycle sequence with a) perfect channel, b) feedback control P. P. Mishra. Fair Bandwidth Sharing for Video traffic sources using Distributed Feedback Control. AT&T Technical
	ftp://ftp.research.att.com/dist/riecke/prompt.ps.gz, 19950118 A Generalization of Exceptions and Control in ML-like Languages Carl A. Gunter University of Pennsylvania gunter@cis.upenn.edu Didier R emy INRIA, Rocquencourt Didier.Remy@inria.fr Jon G. Riecke AT&T Bell Laboratories riecke@research.att.com
	ftp://ftp.research.att.com/dist/riecke/linear-logic-journal.ps.gz, 19950209 J. Functional Programming 1 (1): { , January 1993 c 1993 Cambridge University Press 1 Reference Counting as a Computational Interpretation of Linear Logic JAWAHAR CHIRIMAR, CARL A. GUNTER Department of Computer and Information Science University of Pennsylvania Philadelphia, PA 19104 JON G. RIECKE AT&T
	ftp://ftp.research.att.com/dist/ml/papers/94-tppp-reppy.ps, 19950220 First-class Synchronous Operations John H. Reppy AT&T Bell Laboratories
	ftp://ftp.research.att.com/dist/slow/brs.figs.ps, 19950220 Figure 7: Affine server Figure 8: Tradeoff between bandwidth and buffers along a connection (a, r) m m x x1 m m x2 ( 0, r) m m c c1 m m m2 m1 m=m1 m f1 fk fs x1 xk b m = mk+1 m m2 mk Figure 5: Ordering of leaky bucket servers Figure 6: Busy cycles of b1(t) (s1, r1) m m x1 c1 m m x2 c2 m m
	ftp://ftp.research.att.com/dist/slow/brs.ps, 19950220 Burst Reducing Servers in ATM Networks Steven H. Low AT&T Bell Laboratories, Murray Hill NJ 07974 Pravin P. Varaiya University of California, Berkeley CA 94720 June 20, 1994
	ftp://ftp.research.att.com/dist/hall/papers/isat/validation-big.ps, 19950220 Systematic Incremental Validation of Reactive Systems via Sound Scenario Generalization by Robert J. Hall AT&T Bell Laboratories 600 Mountain Ave., Rm 2B-229 Murray Hill, NJ 07974-0636 email: hall@research.att.com phone: (908) 582-5139, fax: (908) 582-5192
	ftp://ftp.research.att.com/dist/slow/acccol.ps.Z, 19950220 Anonymous Credit Cards and its Collusion Analysis Steven H. Low Nicholas F. Maxemchuk Sanjoy Paul AT&T Bell Laboratories Murray Hill, NJ 07974 October 10, 1994
	ftp://ftp.research.att.com/dist/jphvs/miguel/miguel.try.ps, 19950227 On the Use of a Sinusoidal Model for Speech Synthesis in Text-to-Speech Miguel Angel Rodr guez Crespo Pilar Sanz Velasco Luis Monz on Serrano Jos e Gregorio Escalada Sardina
	ftp://ftp.research.att.com/dist/jphvs/miguel/miguel.ps, 19950227 On the Use of a Sinusoidal Model for Speech Synthesis in Text-to-Speech Miguel Angel Rodr guez Crespo Pilar Sanz Velasco Luis Monz on Serrano Jos e Gregorio Escalada Sardina
	ftp://ftp.research.att.com/dist/jphvs/reiner/Biomechanical.ps, 19950227 Biomechanical and physiologically based speech modeling Reiner Wilhelms-Tricarico Joseph S. Perkell
	ftp://ftp.research.att.com/dist/jphvs/chapters/chn/x.ps, 19950303 Discourse Structural Constraints on Accent in Narrative Christine H. Nakatani
	ftp://ftp.research.att.com/dist/douglis/mlic95/adapt.ps.gz, 19950307 Adaptive Disk Spin-down Policies for Mobile Computers y Fred Douglisz AT&T Bell Laboratories P. Krishnan Brown University Brian Bershad University of Washington
	ftp://ftp.research.att.com/dist/crk/pnni.ps, 19950315 ATM Forum 94-0471R6 P-NNI Draft Specification P-NNI SWG Editor: Doug Dykeman Chair: Mike Goguen IBM Zurich Research Lab Centillion +41 (1) 724-8380 +1 (415)969-6700 Internet: ddy@zurich.ibm.com Internet: mgoguen@centillion.com 1.
	ftp://ftp.research.att.com/dist/andreas/X/doc/mass.ps, 19950321 XGobi: A Tool for Visualization of High-Dimensional Data Andreas Buja AT&T Bell Laboratories Joint work with D. F. Swayne Bellcore D. Cook Iowa State Characteristics of XGobi: highly interactive dynamic graphics built on X11 using Athena widgets shell-callable S-callable roughly 1 meg of code in over 50
	ftp://ftp.research.att.com/dist/andreas/X/doc/slides-toronto.ps, 19950322 Prosections: High-dimensional Inference through Sections and Projections George W. Furnas Bellcore Morristown, New Jersey Andreas Buja AT&T Bell Laboratories Murray Hill, New Jersey work done while with Bellcore Morristown, New Jersey Graphics generated with the XGobi software (Swayne, Cook, Buja) THE
	ftp://ftp.research.att.com/dist/andreas/X/doc/slides.ps, 19950322 CONCLUSIONS Summary: g ``Looking'' at high-dimensional objects via dimension reduction. g Complementary strength of sections and pro jections. g Powerful composition: prosections. Sliding window of sensitivity to dimensionalities. Further questions: g More ``realistic'' idealizations than flats g
	ftp://ftp.research.att.com/dist/riecke/phd.ps.gz, 19950326 The Logic and Expressibility of Simply-typed Call-by-value and Lazy Languages by Jon Gary Riecke B.A., Computer Science Williams College (1986) S.M., Electrical Engineering and Computer Science Massachusetts Institute of Technology (1989) Submitted to the Department of Electrical Engineering and
	ftp://ftp.research.att.com/dist/terveen/ijis-93.ps, 19950331 Intelligent Systems as Cooperative Systems1 Loren G. Terveen AT&T Bell Laboratories 600 Mountain Avenue Murray Hill, NJ 07974 USA terveen@research.att.com In The International Journal of Intelligent Systems, special issue on The Social Context of Intelligent Systems, P. Thomas, editor, Vol. 3, Nos. 2-4,
	ftp://ftp.research.att.com/dist/terveen/imacs-journal.ps, 19950331 INTEGRATED SUPPORT FOR DATA ARCHAEOLOGY RONALD J. BRACHMAN FERN HALPER PETER G. SELFRIDGE THOMAS KIRK LOREN G. TERVEEN ALAN LAZAR BORIS ALTMAN DEBORAH L. MCGUINNESS ALEX BORGIDA LORI ALPERIN RESNICK AT&T Bell Laboratories 600 Mountain Avenue Murray Hill, NJ 07974 Received February 1, 1993 Revised May
	ftp://ftp.research.att.com/dist/terveen/intrct95.ps, 19950331 DynaDesigner: A Tool for Rapid Creation of Device-Independent Interactive Services Loren Terveen and Mark Tuomenoksa AT&T Bell Laboratories {terveen, mlt}@research.att.com KEYWORDS service creation tools, device-independent design, dialogue design, end user programming, consumer systems
	ftp://ftp.research.att.com/dist/terveen/cikm-93.ps, 19950331 Interface Support for Data Archaeology Loren G. Terveen AT&T Bell Laboratories 600 Mountain Avenue, 2C-401 Murray Hill, NJ 07974-0636 USA terveen@research.att.com
	ftp://ftp.research.att.com/dist/terveen/da-hci.ps, 19950331 Living Design Memory Framework, Implementation, Lessons Learned Loren G. Terveen AT&T Bell Laboratories Peter G. Selfridge AT&T Bell Laboratories M. David Long AT&T Bell Laboratories In Human-Computer Interaction, 1995 Loren G. Terveen is a Computer Scientist with interests in organizational memory,
	ftp://ftp.research.att.com/dist/terveen/kbs-95.ps, 19950331 An Overview of Human-Computer Collaboration Loren G. Terveeen AT&T Bell Laboratories 600 Mountain Avenue Murray Hill, NJ 07974 terveen@research.att.com July 3, 1994
	ftp://ftp.research.att.com/dist/terveen/simcity.ps, 19950331 1 From SimCity 2000fi to MagicCity - Making a Magic World SimCity 2000fi (hereafter, SimCity) is a city simulation game, in which the mayor of the city (i.e., the player) builds a city. The mayor views the city in the City window, an overhead zoomable view that shows some or all of the city, a square
	ftp://ftp.research.att.com/dist/terveen/kbse-94.ps, 19950331 Intelligent Assistance for Software Construction: A Case Study Loren G. Terveen and Peter G. Selfridge AT&T Bell Laboratories 600 Mountain Avenue Murray Hill, NJ 07974 fterveen,pgsg@research.att.com
	ftp://ftp.research.att.com/dist/brassil/1995/infocom95.ps.Z, 19950407 Document Marking and Identification using Both Line and Word Shifting S. H. Low N. F. Maxemchuk J. T. Brassil L. O'Gorman AT&T Bell Laboratories Murray Hill NJ 07974
	ftp://ftp.research.att.com/dist/smb/hostpair.encrypt.ps, 19950407 Assumptions ffl Host-pair keying. ffl Both hosts are multiuser machines; the attacker has logins on both machines. (It seems likely that one can omit one login with judicious use of the UDP echo server. It also seems probable that the attack works on router-to-router encryption, if a common key is
	ftp://ftp.research.att.com/dist/ai/kc-whole.ps.Z, 19950425 Knowledge Compilation and Theory Approximation Bart Selman and Henry Kautz AI Principles Research Department AT&T Bell Laboratories Murray Hill, NJ 07974 fselman, kautzg@research.att.com
	ftp://ftp.research.att.com/dist/ai/ijcai95pos.ps, 19950425 Stochastic Search For Model Finding Bart Selman AT&T Bell Laboratories 600 Mountain Avenue, Room 2T-414 Murray Hill, NJ 07974 selman@research.att.com Recent work on stochastic search for solving constraint satisfaction problems has shown that that such methods can be surprisingly good at finding
	ftp://ftp.research.att.com/dist/howe/bisim-congruence.ps.gz, 19950426 Proving Congruence of Bisimulation in Functional Programming Languages Douglas J. Howe AT&T Bell Laboratories 600 Mountain Avenue, Room 2B-438 Murray Hill, NJ 07974, USA howe@research.att.com
	ftp://ftp.research.att.com/dist/c++std/WP/contents.ps.Z, 19950430 Contents 1 General ...................................................................................................................................................1 1 1.1 Scope
	ftp://ftp.research.att.com/dist/c++std/WP/body.ps.Z, 19950430 _ ____________________________________________________________________________________________________________________________________________________________________________ _ ___________________________________________ 1 General _
	ftp://ftp.research.att.com/dist/c++std/WP/index.ps.Z, 19950430 Index , see comma operator ! see logical negation operator != see inequality operator # operator 16 5 ## operator 16 6 % see modulus operator %= operator 5 22 see address of operator see bitwise AND operator reference declarator 8 5 && see logical AND operator &= operator 5 22 see function call operator
	ftp://ftp.research.att.com/dist/c++std/WP/foreword.ps.Z, 19950430 _ ____________________________________________________________________________________________________________________________________________________________________________ _ ___________________________________________ Foreword _
	ftp://ftp.research.att.com/dist/c++std/WP/concordance.ps.Z, 19950501 Accredited Standards Committee* Doc No: X3J16/95 0088 X3, INFORMATION PROCESSING SYSTEMS WG21/N0688 Date: 28 April 1995 Project: Programming Language C+ + Reply to: Andrew Koenig AT&T Bell Laboratories PO Box 636 600 Mountain Avenue Room 2C 306 Murray Hill, NJ 07974 USA ark@research.att.com Concordance
	ftp://ftp.research.att.com/dist/c++std/WP/coversheet.ps.Z, 19950501 Accredited Standards Committee* Doc No: X3J16/95 0087 X3, INFORMATION PROCESSING SYSTEMS WG21/N0687 Date: 28 April 1995 Project: Programming Language C+ + Reply to: Andrew Koenig AT&T Bell Laboratories PO Box 636 600 Mountain Avenue Room 2C 306 Murray Hill, NJ 07974 USA ark@research.att.com Working
	ftp://ftp.research.att.com/dist/ai/ai-phys.ps.Z, 19950517 Stochastic Search and Phase Transitions: AI Meets Physics (extended abstract) Bart Selman AT&T Bell Laboratories Murray Hill, NJ 07974 U.S.A. selman@research.att.com http://www.research.att.com/orgs/ssr/people/selman/
	ftp://ftp.research.att.com/dist/andreas/paper.ps, 19950522 Crusing in High-Dimensional Data Spaces ANDREAS BUJA1, DIANNE COOK2.
	ftp://ftp.research.att.com/dist/ai/crit.ps.Z, 19950524 Critical Behavior in the Satisfiability of Random Boolean Formulae Scott Kirkpatrick IBM TJ Watson Research Center Yorktown Heights, NY 10598 kirk@watson.ibm.com Bart Selman AT&T Bell Laboratories Murray Hill, NJ 07974 selman@research.att.com
	ftp://ftp.research.att.com/dist/andreas/HEIDEL/cubesbw.ps, 19950613 Figure 4: Cubes of dimensions 3 up 9 in eight XGobi windows. The 9-D cube is shown with and without edges. 1
	ftp://ftp.research.att.com/dist/andreas/HEIDEL/laser2.ps, 19950613 Figure 3: Rotations of the laser data in 3-D and 4-D. Top row: 3-D, in the space of Current 1", Current 2", Energy". With the connecting lines, the energy dip (blue) and the odd observation (red) are visible. Bottom row: 4-D, with WaveLength" rotated into the projection. The wavelength instabilities
	ftp://ftp.research.att.com/dist/ai/ijcai95ling.ps.Z, 19950613 The Comparative Linguistics of Knowledge Representation Goran Gogic University of California San Diego CSE Department La Jolla, California 92093, USA email: goran@cs.ucsd.edu Henry Kautz AI Principles Research Department AT&T Bell Laboratories Murray Hill, NJ 07974, USA email: kautz@research.att.com
	ftp://ftp.research.att.com/dist/andreas/HEIDEL/laser3.ps, 19950613 Figure 10: Conditional plots of the laser data, given the levels of Current 2". Red: Energy curves as a function of Current 1". Yellow: Wavelength curves, featuring instabilities and change points. 1
	ftp://ftp.research.att.com/dist/andreas/HEIDEL/xgobi.ps, 19950613 Figure 1: An XGobi window. The plotting area shows points and lines. The major modes, such as DotPlot," XYPlot" and Tour," are accessible through buttons on the top bar. Subordinate to each major mode, the left side shows a number of buttons and sliders for controlling for example animation speed.
	ftp://ftp.research.att.com/dist/andreas/HEIDEL/places.ps, 19950613 Figure 6: The Places Rated data. Red is Coastal California, green the Pacific Northwest, and blue the extreme climates. 1
	ftp://ftp.research.att.com/dist/andreas/HEIDEL/laser1.ps, 19950613 EnergyWave LengthCurrent 2Current 1 Figure 2: The laser data, responses versus predictors. 1
	ftp://ftp.research.att.com/dist/andreas/HEIDEL/seg1.ps, 19950613 Figure 8: The market segmentation data. Left: A plot of the first two principal components. Center: A projection halfway between the principal components plot and the 4-point plot of the binary usage variables. Right: The 4-point plot of the binary usage variables. 1
	ftp://ftp.research.att.com/dist/andreas/HEIDEL/iris.ps, 19950613 Figure 7: Fisher's Iris data. Top left: The merge level of the tree is plotted against the true species, numbered from 1 to 3. Note that all variables, including Species", have values not only for the observations but for the branching points of the tree as well. The red rectangle is the brush, which
	ftp://ftp.research.att.com/dist/andreas/HEIDEL/seg2.ps, 19950613 Figure 9: The market segmentation data, in a (2 2) (2 2) arrangement. Horizontal: Usage 2" nested within Usage 1". Thus the columns correspond left to right to the low-low, low-high, high-low, high-high levels of Usage 1" and Usage 2". Vertical: Needs 2" nested within Needs 1". The rows, from the
	ftp://ftp.research.att.com/dist/ai/dimacs.ps.Z, 19950614 Local Search Strategies for Satisfiability Testing Bart Selman, Henry A. Kautz, and Bram Cohen AT&T Bell Laboratories Murray Hill, NJ 07974 fselman, kautz, coheng@research.att.com Presented at the Second DIMACS Challenge on Cliques, Coloring, and Satisfiability, Oct. 1993. Revised version to appear in a
	ftp://ftp.research.att.com/dist/ai/ampl.ps.Z, 19950621 Agent Amplified Communication Henry Kautz, Al Milewski, and Bart Selman AT&T Bell Laboratories Murray Hill, NJ 07974 fkautz, aem, selmang@research.att.com
	ftp://ftp.research.att.com/dist/julia/biblio/lsa93.ps, 19950622 Readings for Pragmatics and Intonation Julia Hirschberg June 21, 1995 1 Course Readings References G. Brown. 1983. Prosodic structure and the given/new distinction. In D. R. Ladd and A. Cutler, editors, Prosody: Models and Measurements, pages 67{78. Springer Verlag, Berlin. Carlos Gussenhoven. 1983a.
	ftp://ftp.research.att.com/dist/julia/papers/tts_escapes.ps, 19950622 Controlling Intonational Variation Using Escape Sequences in the Bell Laboratories Text-to-Speech System Julia Hirschberg June 22, 1995
	ftp://ftp.research.att.com/dist/julia/papers/aij93.ps, 19950622 Pitch Accent in Context: Predicting Intonational Prominence from Text Julia Hirschberg AT&T Bell Laboratories 600 Mountain Avenue Murray Hill NJ 07974 julia@research.att.com June 21, 1995
	ftp://ftp.research.att.com/dist/julia/papers/cl93.ps, 19950622 Empirical Studies on the Disambiguation of Cue Phrases Julia Hirschberg Diane Litman AT&T Bell Laboratories 600 Mountain Avenue Murray Hill, NJ 07974 fjulia,dianeg@research.att.com June 21, 1995
	ftp://ftp.research.att.com/dist/julia/papers/icslp92.ps, 19950622 SOME INTONATIONAL CHARACTERISTICS OF DISCOURSE STRUCTURE Barbara Grosz Julia Hirschberg Division of Applied Sciences 2D-450, AT&T Bell Laboratories Harvard University 600 Mountain Avenue Cambridge MA 02138 Murray Hill NJ 07974-0636
	ftp://ftp.research.att.com/dist/julia/papers/darpa92.ps, 19950622 Intonational Features of Local and Global Discourse Structure Julia Hirschberg and Barbara Grosz 2D-450, AT&T Bell Laboratories Division of Applied Sciences 600 Mountain Avenue Harvard University Murray Hill NJ 07974-0636 Cambridge MA 02138
	ftp://ftp.research.att.com/dist/julia/papers/aaaiss95.ps, 19950622 Discourse Structure in Spoken Language: Studies on Speech Corpora Christine H. Nakataniy Barbara J. Grosz Aiken Computation Laboratory Division of Applied Sciences Harvard University Cambridge MA 02138 USA fchn,groszg@das.harvard.edu Julia Hirschberg 2C-409, AT&T Bell Laboratories 600 Mountain Avenue
	ftp://ftp.research.att.com/dist/julia/papers/jasa93.ps, 19950622 A Corpus-based study of repair cues in spontaneous speech Christine H. Nakatani Aiken Computation Laboratory, Harvard University, Cambridge, MA 02138 Julia Hirschberg 2D-450, AT&T Bell Laboratories, Murray Hill, NJ 07974 Short Title: Repair cues in spontaneous speech Received: The occurrence of
	ftp://ftp.research.att.com/dist/julia/papers/esca94.ps, 19950622 TRAINING INTONATIONAL PHRASING RULES AUTOMATICALLY FOR ENGLISH AND SPANISH TEXT-TO-SPEECH Julia Hirschberg Pilar Prieto AT&T Bell Laboratories 600 Mountain Avenue Murray Hill NJ USA, 07974{0636 fjulia,prietog@research.att.com June 21, 1995
	ftp://ftp.research.att.com/dist/julia/papers/csl92.ps, 19950622 Automatic Classification of Intonational Phrase Boundaries Michelle Q. Wang Churchill College Cambridge University Cambridge UK Julia Hirschberg AT&T Bell Laboratories 2D-450 600 Mountain Avenue Murray Hill NJ 07974 June 21, 1995
	ftp://ftp.research.att.com/dist/julia/papers/icphs95.ps, 19950622 The Intonational Disambiguation of Potentionally Ambiguous Utterances in English, Italian, and Spanish Cinzia Avesani , Julia Hirschberg, and Pilar Prieto AT&T Bell Laboratories
	ftp://ftp.research.att.com/dist/hall/papers/cpprof/refinements-ieeetse95.ps, 19950628 Call Path Refinement Profiles by Robert J. Hall AT&T Bell Laboratories Murray Hill, NJ 07974 hall@research.att.com
	ftp://ftp.research.att.com/dist/mab/sesscrypt.ps, 19950704 Session-Layer Encryption Matt Blaze Steven M. Bellovin mab@research.att.com smb@research.att.com AT&T Bell Laboratories
	ftp://ftp.research.att.com/dist/ai/comp_chall.ps.Z, 19950901 Facing Computational Challenges in AI: Theory Approximation, Knowledge Compilation, and Randomized Strategies Bart Selman AT&T Bell Laboratories Murray Hill, New Jersey USA 1 Motivation Many AI systems are, and will be, knowledge-based. Given a wide range of facts about the world, the systems are
	ftp://ftp.research.att.com/dist/ai/ai-phys-sli.ps.Z, 19950901 BS - 08/95 1 Stochastic Search And Phase Transitions: AI Meets Physics Bart Selman AT&T Bell Laboratories Murray Hill, N.J. USA BS - 08/95 2 Computational Challenges In AI Computational Challenges In AI Many core AI tasks have been shown to be computationally intractable. We have results in: -reasoning
	ftp://ftp.research.att.com/dist/mab/mkcs.ps, 19950912 Master-Key Cryptosystems Matt Blaze AT&T Bell Labs mab@research.att.com Joan Feigenbaum AT&T Bell Labs jf@research.att.com F. T. Leighton MIT Math Dept ftl@math.mit.edu We initiate the study of a new class of secret-key cryptosystems, called master-key cryptosystems (MKCSs), in which an authorized third
	ftp://ftp.research.att.com/dist/tadiran/fe2-95.ps, 19950912 -1- Telecommunications Standardization Sector COM 15 No. (ITU-T) Date: February 1995 Original: English Study Period 1993-1996 Question:5/15 STUDYGROUP 15 CONTRIBUTION SOURCE: AT&T TITLE: Draft ANNEX I on G.728 Decoder Modi cations for Frame Erasure Concealment 1. Introduction This document contains a
	ftp://ftp.research.att.com/dist/brassil/1995/ciss95.ps.Z, 19950926 Hiding Information in Document Images J. Brassil, S. Low, N. F. Maxemchuk, L. O'Gorman AT&T Bell Laboratories Murray Hill, NJ Consider 2 distinct document pages which we label A and B. The pages are sufficiently similar that they are indistinguishable upon visual inspection, even when compared
	ftp://ftp.research.att.com/dist/gsm/seg-4.ps, 19951003 SEG-4 (v 1.0) EFR Preselection Test Plan ETSI SMG2 Speech Experts Group SEG-4 (v 1.0) Source1 : FRANCE TELECOM / CNET Title : A Subjective Pre-Selection Test Plan for the Enhanced Full Rate Speech Coding Algorithm. This document is based both on : - the Revised Version of Test Plan (TD 95/41) agreed in
	ftp://ftp.research.att.com/dist/floc/cfp/cfp.ps, 19951009 1996 Federated Logic Conference FLoC'96 July 27 - August 3, 1996, Rutgers University, New Jersey, USA Conference Committee Chair: Jon G. Riecke AT&T Bell Laboratories 600 Mountain Avenue, Rm 2B-430 Murray Hill, NJ 07974, USA riecke@research.att.com Phone: (607) 582-4517 Fax: (607) 582-7550 Conference
	ftp://ftp.research.att.com/dist/floc/cade-workshops.ps.Z, 19951009 Thirteenth International Conference on Automated Deduction Rutgers University, New Brunswick, USA 30 July, 1996 ae8oe9!13 CALL FOR WORKSHOPS The CADE conferences are the major forum for the presentation of new research in all aspects of automated deduction. It is proposed to hold number of workshops in
	ftp://ftp.research.att.com/dist/floc/cade-tutorials.ps.Z, 19951009 Thirteenth International Conference on Automated Deduction Rutgers University, New Brunswick, USA 30 July, 1996 ae8oe9!13 CALL FOR TUTORIALS The CADE conferences are the major forum for the presentation of new research in all aspects of automated deduction. It is proposed to hold a number of tutorials
	ftp://ftp.research.att.com/dist/floc/cfp/cade-cfp.ps.gz, 19951009 Thirteenth International Conference on Automated Deduction Rutgers University, New Brunswick, USA 30 July{3 August, 1996 ae8oe9!13 FIRST CALL FOR PAPERS The CADE conferences are the major forum for the presentation of new research in all aspects of automated deduction. Original research papers,
	ftp://ftp.research.att.com/dist/floc/cfp/lics-cfp.ps.gz, 19951009 CALL FOR PAPERS Eleventh Annual IEEE Symposium on LOGIC IN COMPUTER SCIENCE July 27{30, 1996, New Brunswick, New Jersey, USA Program Chair: Edmund M. Clarke Department of Computer Science Carnegie Mellon University Pittsburgh, PA 15228 lics96@cs.cmu.edu Phone: (412) 268-2628 Fax: (412) 268-5576 Program
	ftp://ftp.research.att.com/dist/floc/cfp/rta-cfp.ps.gz, 19951009 RTA-96 Call for Papers Seventh International Conference on July 27-30, 1996 Rewriting Techniques and Applications Rutgers University, NJ, USA This information is also avaliable under http://www.mpi-sb.mpg.de/rta96/ . The Seventh Conference on Rewriting Techniques and Applications solicits original
	ftp://ftp.research.att.com/dist/floc/cfp/cav-cfp.ps.Z, 19951009 Call For Papers Conference on Computer-Aided Verification (CAV 96) July 31{August 3, 1996 New Brunswick, New Jersey, USA This conference is the eighth in a series dedicated to the advancement of the theory and practice of computerassisted formal analysis methods for software and hardware systems. The
	ftp://ftp.research.att.com/dist/drawdag/dynadag.ps.gz, 19951018 Incremental Layout in DynaDAG Stephen C. North north@research.att.com Software and Systems Research Center AT&T Bell Laboratories Murray Hill, N.J. 07974 U.S.A.
	ftp://ftp.research.att.com/dist/erg/private/basis.ps.Z, 19951030 Contents I Standard Library 1 1 General 1 1.1 The General structure : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1 1.2 The Bool structure : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 4 1.3 The Locale structure : : : : :
	ftp://ftp.research.att.com/dist/lics/cfp96.ps.Z, 19951130 CALL FOR PAPERS Eleventh Annual IEEE Symposium on LOGIC IN COMPUTER SCIENCE July 27{30, 1996, New Brunswick, New Jersey, USA Program Chair: Edmund M. Clarke Department of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 lics96@cs.cmu.edu Phone: (412) 268-2628 Fax: (412) 268-5576 Program
	ftp://ftp.research.att.com/dist/kanakia/icip95.ps.Z, 19951201 0.0020.0040.0060.0080.00100.00120.00140.00160.00180.00200.000.001.002.003.004.005.00Time (in secs)KbytesRJ scheme Figure 2: Buffer occupancy at the bottleneck with the RJ scheme 5 10 15 20 25 30 35 40 20 40 60 80 100 120 140 SNR (db) Frame number RJ scheme Figure 3: SNR plots for bicycle sequence - RJ
	ftp://ftp.research.att.com/dist/kanakia/jhbh.ps.Z, 19951201 On Hop-by-hop Rate-based Congestion Control Partho P. Mishra, Hemant Kanakia and Satish K. Tripathi
	ftp://ftp.research.att.com/dist/mab/card_cipher.ps, 19951205 High-Bandwidth Encryption with Low-Bandwidth Smartcards Matt Blaze AT&T Bell Laboratories, Murray Hill, NJ 07974 mab@research.att.com December 3, 1995
	ftp://ftp.research.att.com/dist/smb/recog.ps, 19951207 A Programmable Plaintext Recognizer David A. Wagner Steven M. Bellovin Princeton University AT&T Bell Laboratories Princeton, NJ Murray Hill, NJ dawagner@princeton.edu smb@research.att.com Phone: +1 908-582-5886 Fax: +1 908-582-3063
	ftp://ftp.research.att.com/dist/g729/g729.ps, 19960205 INTERNATIONAL TELECOMMUNICATION UNION TELECOMMUNICATIONS STANDARDIZATION SECTOR Date: December 1995 Original: E STUDY GROUP 15 CONTRIBUTION - Q. 12/15 Draft Recommendation G.729 Coding of Speech at 8 kbit/s using Conjugate-Structure Algebraic- Code-Excited Linear-Prediction (CS-ACELP) February 5, 1996,
	ftp://ftp.research.att.com/dist/andreas/HEIDEL/cubes.ps, 19960206 Figure 4: Cubes of dimensions 3 up 9 in eight XGobi windows. The 9-D cube is shown with and without edges. 1
	ftp://ftp.research.att.com/dist/andreas/HEIDEL/paper.ps, 19960206 Interactive High-Dimensional Data Visualization Andreas BUJA 1 , Dianne COOK 2 , and Deborah F. SWAYNE 3 We propose a rudimentary taxonomy of interactive data visualization based on a triad of data analytic tasks: finding Gestalt, posing queries, and making comparisons. These tasks are supported by
	ftp://ftp.research.att.com/dist/mab/keylength.ps, 19960206 Minimal Key Lengths for Symmetric Ciphers to Provide Adequate Commercial Security A Report by an Ad Hoc Group of Cryptographers and Computer Scientists Matt Blaze 1 Whitfield Diffie 2 Ronald L. Rivest 3 Bruce Schneier 4 Tsutomu Shimomura 5 Eric Thompson 6 Michael Wiener 7 January 1996
	ftp://ftp.research.att.com/dist/ai/plan.ps, 19960207 Pushing the Envelope: Planning, Propositional Logic, and Stochastic Search Henry Kautz and Bart Selman AT&T Bell Laboratories 600 Mountain Avenue, Room 2a-402 Murray Hill, NJ 07974 (908) 582-2815 fkautz, selmang@research.att.com
	ftp://ftp.research.att.com/dist/andreas/INTERP/paper.ps, 19960210 the grand tour (Asimov 1985), defined as an infinite path of planes that becomes dense in the set of all planes. ffl Precomputed choice: At times one would like to design paths of data projections for specific purposes. An example is the little tour (McDonald 1982) which provides a path connecting all
	ftp://ftp.research.att.com/dist/wcohen/papers/jnl-rc.ps, 19960219 Inductive Specification Recovery: Understanding Software by Learning from Example Behaviors William W. Cohen AT&T Bell Laboratories 600 Mountain Avenue Room 2A-427 Murray Hill, NJ 07974 (908)-582-2092 wcohen@research.att.com May 31, 1995
	ftp://ftp.research.att.com/dist/smb/bisconf.ps, 19960227 A Bump in the Stack" Encryptor for MS-DOS Systems David A. Wagner Steven M. Bellovin daw@cs.berkeley.edu smb@research.att.com U. of California at Berkeley AT&T Bell Laboratories Berkeley, CA Murray Hill, NJ 07974
	ftp://ftp.research.att.com/dist/mab/policymaker.ps, 19960315 Decentralized Trust Management Matt Blaze Joan Feigenbaum Jack Lacy AT&T Research Murray Hill, NJ 07974 fmab,jf,lacyg@research.att.com
	ftp://ftp.research.att.com/dist/drawdag/gknv93.ps.gz, 19960322 A Technique for Drawing Directed Graphs Emden R. Gansner Eleftherios Koutsofios Stephen C. North Kiem-Phong Vo AT&T Bell Laboratories Murray Hill, New Jersey 07974
	ftp://ftp.research.att.com/dist/ml/papers/95-tutorial-reppy.ps, 19960410 Concurrent Programming in ML John Reppy AT&T Bell Laboratories August 21, 1995 Outline ffl Background. ffl A tour of Concurrent ML. ffl Concurrency in user interfaces. ffl Concurrency in distributed systems. ffl Prototyping concurrency features in SML/NJ. 1 Background Concurrent ML (CML) is an extension
	ftp://ftp.research.att.com/dist/hall/papers/agents/trust.ps, 19960411 Trusting Your Assistant by Robert J. Hall AT&T Research 600 Mountain Ave, Rm. 2B-229 Murray Hill, NJ 07974 hall@research.att.com phone: (908) 582-5139, fax: (908) 582-5192
	ftp://ftp.research.att.com/dist/hall/papers/agents/trust-issue-aaai-sss96.ps, 19960411 The Trust Issue in Task Automation Robert J. Hall AT&T Bell Laboratories 600 Mountain Ave. Murray Hill, NJ 07974 hall@research.att.com
	ftp://ftp.research.att.com/dist/ai/panel-final.ps, 19960415 Challenge Problems for Artificial Intelligence (panel statement) Bart Selman (moderator) AT&T Rodney A. Brooks MIT Thomas Dean Brown University Eric Horvitz Microsoft Tom M. Mitchell CMU Nils J. Nilsson Stanford University Introduction: Bart Selman AI textbooks and papers often discuss the big
	ftp://ftp.research.att.com/dist/ai/pan99.ps, 19960416 Challenge Problems for Artificial Intelligence (panel statement) Bart Selman (moderator) AT&T Rodney A. Brooks MIT Thomas Dean Brown University Eric Horvitz Microsoft Tom M. Mitchell CMU Nils J. Nilsson Stanford University Introduction: Bart Selman AI textbooks and papers often discuss the big
	ftp://ftp.research.att.com/dist/floc/advance-program.ps, 19960421 1996 Federated Logic Conference Welcome to the 1996 Federated Logic Conference (FLoC)! FLoC is modelled after the Federated Computer Research Conference (FCRC), and brings together synergetic conferences that explore connections between logic and computer science. The following conferences will be a
	ftp://ftp.research.att.com/dist/floc/forms.ps, 19960424 Instructions for Registration Please include the Conference Fee Form, On-Campus Housing Form (if on-campus housing is desired), and this form with payment and mail to FLoC c/o Priscilla Rasmussen P. O. Box 6148 Somerset, NJ 08875 USA All inquiries should be directed to Priscilla Rasmussen Phone: (908)
	ftp://ftp.research.att.com/dist/floc/advance-program-a4.ps, 19960425 1996 Federated Logic Conference Welcome to the 1996 Federated Logic Conference (FLoC)! FLoC is modelled after the Federated Computer Research Conference (FCRC), and brings together synergetic conferences that explore connections between logic and computer science. The following conferences will be a
	ftp://ftp.research.att.com/dist/felty/lpar94.ps.gz, 19960501 Generalization and Reuse of Tactic Proofs Amy Felty and Douglas Howe AT&T Bell Laboratories, 600 Mountain Ave., Murray Hill, NJ 07974, USA.
	ftp://ftp.research.att.com/dist/felty/welp92a.ps.gz, 19960501 Higher-Order Conditional Term Rewriting in the L>= Logic Programming Language Preliminary Results Amy Felty AT&T Bell Laboratories 600 Mountain Avenue Murray Hill, NJ 07974
	ftp://ftp.research.att.com/dist/felty/proof87.ps.gz, 19960501 PROOF EXPLANATION AND REVISION Amy Felty and Dale Miller Department of Computer and Information Science University of Pennsylvania Philadelphia, PA 19104-6389 March 1987
	ftp://ftp.research.att.com/dist/felty/welp91.ps.gz, 19960501 A Logic Program for Transforming Sequent Proofs to Natural Deduction Proofs Amy Felty INRIA Sophia-Antipolis 2004, Route des Lucioles 06565 Valbonne Cedex, France
	ftp://ftp.research.att.com/dist/felty/cade12.ps.gz, 19960501 Tactic Theorem Proving with Refinement-Tree Proofs and Metavariables Amy Felty and Douglas Howe AT&T Bell Laboratories, 600 Mountain Ave., Murray Hill, NJ 07974, USA
	ftp://ftp.research.att.com/dist/felty/ppcoq.ps.gz, 19960501 Proving Properties About a Lazy Functional Language with the Coq Proof Development System Jill Seaman Department of Computer Science Pennsylvania State University University Park, PA 16802 USA Amy Felty AT&T Bell Laboratories 600 Mountain Ave. Murray Hill, NJ 07974 USA April 1993
	ftp://ftp.research.att.com/dist/felty/jar.ps.gz, 19960501 Implementing Tactics and Tacticals in a Higher-Order Logic Programming Language Amy Felty AT&T Bell Laboratories 600 Mountain Ave. Murray Hill, NJ 07974
	ftp://ftp.research.att.com/dist/felty/acsc95.ps.gz, 19960501 Formalizing Inductive Proofs of Network Algorithms Ramesh Bharadwaj1, Amy Felty2, Frank Stomp2 1 CRL, McMaster University, 1280 Main St. West, Hamilton, ON, Canada L8S4K1 2 AT&T Bell Laboratories, 600 Mountain Avenue, Murray Hill, NJ 07974, USA
	ftp://ftp.research.att.com/dist/felty/lics93.ps.gz, 19960502 Encoding the Calculus of Constructions in a Higher-Order Logic Amy Felty AT&T Bell Laboratories 600 Mountain Ave. Murray Hill, NJ 07974 USA
	ftp://ftp.research.att.com/dist/felty/lf91.ps.gz, 19960502 Encoding Dependent Types in an Intuitionistic Logic Amy Felty INRIA Rocquencourt Domaine de Voluceau 78153 Le Chesnay Cedex, France
	ftp://ftp.research.att.com/dist/felty/welp92.ps.gz, 19960502 A Logic Programming Approach to Implementing Higher-Order Term Rewriting Amy Felty INRIA Rocquencourt Domaine de Voluceau 78153 Le Chesnay Cedex, France
	ftp://ftp.research.att.com/dist/felty/compass96.ps.gz, 19960502 A Correctness Proof of a Cache Coherence Protocol Amy Felty and Frank Stomp Bell Laboratories 700 Mountain Avenue Murray Hill, NJ 07974, USA
	ftp://ftp.research.att.com/dist/felty/cade13.ps.gz, 19960502 Proof Search with Set Variable Instantiation in the Calculus of Constructions Amy Felty Bell Laboratories Lucent Technologies, 700 Mountain Ave., Murray Hill, NJ 07974, USA Amy.Felty@bell-labs.com
	ftp://ftp.research.att.com/dist/howe/amast96.ps.gz, 19960523 Semantic Foundations for Embedding HOL in Nuprl Douglas J. Howe Bell Labs 600 Mountain Ave., Room 2B-438 Murray Hill, NJ 07974, USA.
	ftp://ftp.research.att.com/dist/howe/tphol96.ps.gz, 19960523 Importing Mathematics from HOL into Nuprl Douglas J. Howe Bell Labs 600 Mountain Ave., Room 2B-438 Murray Hill, NJ 07974, USA. howe@bell-labs.com 1 Introduction Nuprl and HOL are general-purpose interactive theorem proving systems with a number of similarities: their logics are higher-order type
	ftp://ftp.research.att.com/dist/drawdag/EN96.ps.gz, 19960531 TclDG - A Tcl Extension for Dynamic Graphs John Ellson john.ellson@lucent.com Stephen North stephen.north@att.com
	ftp://ftp.research.att.com/dist/mab/netescrow.ps, 19960612 Oblivious Key Escrow Matt Blaze AT&T Research Murray Hill, NJ 07974 mab@research.att.com 12 June 1996
	ftp://ftp.research.att.com/dist/marty/demand.ps, 19960618 Demand Driven Pricing in a Loss System Martin I. Reiman Bell Labs, Lucent Technologies Murray Hill, NJ USA Outline Erlang Loss System Single Class Optimization Problem Asymptotic Solution of Optimization Problem Critical Loading Extension to Multiclass Link (This is a very preliminary report on joint
	ftp://ftp.research.att.com/dist/riecke/oml-classes.ps.gz, 19960619 Classes in Object ML via Modules John H. Reppy AT&T Research jhr@research.att.com Jon G. Riecke Bell Laboratories riecke@bell-labs.com April 1, 1996 1 Introduction This paper describes a simple means for encoding classes in Object ML (OML) using the Stan- dard ML (SML) module system . In
	ftp://ftp.research.att.com/dist/andreas/D/hampel.ps, 19960621 Figure 5: The fermentation data of Johnson and Leone (vol. 2, p. 187). Left: Hampel's 4-D cube for the 24 experiment. Right: Our reconstruction in XGobi. Top: The original data; the two points at the bottom right are confused. Bottom: The corrected data. 1
	ftp://ftp.research.att.com/dist/andreas/D/hampel-back.ps, 19960621 Figure 1: The fermentation data of Johnson and Leone (vol. 2, p. 187). Left: Hampel's 4-D cube for the 24 experiment. Right: Our reconstruction in XGobi. Top: The original data; the two points at the bottom right are confused. Bottom: The corrected data. 1
	ftp://ftp.research.att.com/dist/smb/badesp.ps, 19960720 Problem Areas for the IP Security Protocols Steven M. Bellovin smb@research.att.com AT&T Research
	ftp://ftp.research.att.com/dist/smb/dnshack.ps, 19960724 Using the Domain Name System for System Break-ins Steven M. Bellovin smb@research.att.com AT&T Bell Laboratories
	ftp://ftp.research.att.com/dist/hall/papers/agents/trust-kbse96.ps, 19960731 Trusting Your Assistant Robert J. Hall AT&T Research Murray Hill, NJ, 07974