Browse

ftp://ftp.cs.cornell.edu (521)

	ftp://ftp.cs.cornell.edu//pub/marzullo/TR90-1155.ps.Z, 19901102 Making Real-Time Reactive Systems Reliable Keith Marzullo marzullo@cs.cornell.edu Mark Wood wood@cs.cornell.edu Cornell University Department of Computer Science Ithaca, New York 14853 March 30, 1990 A reactive system is characterized by a control program that interacts with an environment (or
	ftp://ftp.cs.cornell.edu//pub/marzullo/TR90-1156.ps.Z, 19901102 Tolerating Failures of Continuous-Valued Sensors Keith Marzullo Cornell University Department of Computer Science September 14, 1990
	ftp://ftp.cs.cornell.edu//pub/marzullo/TR90-1141.ps.Z, 19901102 MTP: An Atomic Multicast Transport Protocol Alan O. Freier Networking and Communications Apple Computer, Inc. Cupertino, CA 95014 freier@apple.com Keith Marzullo Cornell University Computer Science Dept. Ithaca, NY 14853 marzullo@cs.cornell.edu July 30, 1990
	ftp://ftp.cs.cornell.edu//pub/marzullo/detect.ps.Z, 19910204 Detection of Global State Predicates (Extended Abstract) Keith Marzullo Cornell University Department of Computer Science Gil Neigery College of Computing Georgia Institute of Technology
	ftp://ftp.cs.cornell.edu//pub/marzullo/nDsensors.ps.Z, 19910212 as in ailures o ulti i ensional ensors Paul ew eit arzulloy ornell niversity epartment of omputer Science It aca, ew or 14 anuary , 1 1 bstract en a co uter on tors a s ca rocess, t e co uter uses s s s to eter ne t e a ues o t e s ca ar a es t at re resent t e state o t e rocess. sensor can so et es a
	ftp://ftp.cs.cornell.edu//pub/marzullo/meta.ps.Z, 19910223 Tools for Constructing Distributed Reactive Systems Keith Marzullo marzullo@cs.cornell.edu Mark D. Woody wood@cs.cornell.edu Cornell University Department of Computer Science Ithaca, New York 14853 February 22, 1991
	ftp://ftp.cs.cornell.edu//pub/marzullo/TR90-1190.ps.Z, 19910328 Masking Failures of Multidimensional Sensors Paul Chew Keith Marzulloy Cornell University Department of Computer Science Ithaca, New York 14853 January 8, 1991
	ftp://ftp.cs.cornell.edu//pub/marzullo/prioinversion.ps.Z, 19910608 Priority Inversion and its Prevention Ozalp Babao>=gluy Keith Marzullo Fred B. Schneider Department of Computer Science Cornell University Ithaca, New York 14853 April 14, 1991
	ftp://ftp.cs.cornell.edu//pub/marzullo/meta_debug.ps.Z, 19910801 Consistent Detection of Global Predicates Robert Cooper Keith Marzullo Department of Computer Science Cornell University Ithaca NY 14853, USA A fundamental problem in debugging and monitoring is detecting whether the state of a system satisfies some predicate. If the system is distributed, then the
	ftp://ftp.cs.cornell.edu//pub/navin/DBD.ps, 19910823 Early{Stopping Distributed Bidding and Applications Navin Budhirajay Ajei Gopalz Sam Touegx Department of Computer Science Cornell University Ithaca, NY 14853 fnavin, ajei, samg@cs.cornell.edu
	ftp://ftp.cs.cornell.edu//pub/marzullo/rnfs.ps.Z, 19910824 Supplying High Availability with a Standard Network File System1 Keith Marzullo and Frank Schmuck Department of Computer Science Cornell University Ithaca, N.Y. 14853
	ftp://ftp.cs.cornell.edu//pub/marzullo/L1.ps.Z, 19910824 Fault-Tolerant Distributed Systems Keith Marzullo Mark Wood Cornell University Department of Computer Science Fault-Tolerant Systems and ISIS EurOpen Spring '91 Tromso May 1991 1 Fault-Tolerant Systems and ISIS Introduction to building highly available systems using the ISIS toolkit. By the end of this
	ftp://ftp.cs.cornell.edu//pub/marzullo/meta_euug.ps.Z, 19911111 Tools for Monitoring and Controlling Distributed Applications Extended Abstract Keith Marzullo marzullo@cs.cornell.edu Mark D. Woody wood@cs.cornell.edu Cornell University Department of Computer Science Ithaca, New York 14853 November 16, 1990
	ftp://ftp.cs.cornell.edu//pub/ozalp/paralex.ps.Z, 19911209 Paralex: An Environment for Parallel Programming in Distributed Systems Ozalp Babao>=glu Lorenzo Alvisi Alessandro Amoroso Renzo Davoli Luigi Alberto Giachini Department of Mathematics University of Bologna Piazza Porta S. Donato, 5 40127 Bologna, Italy ozalp@dm.unibo.it
	ftp://ftp.cs.cornell.edu//pub/marzullo/TR92-1265.ps.Z, 19920203 Primary{Backup Protocols: Lower Bounds and Optimal Implementations Navin Budhiraja Keith Marzullo Fred B. Schneidery Sam Touegz Department of Computer Science, Cornell University Ithaca NY 14853, USA January 30, 1992
	ftp://ftp.cs.cornell.edu//pub/marzullo/wood-thesis.ps.Z, 19920205 FAULT-TOLERANT MANAGEMENT OF DISTRIBUTED APPLICATIONS USING THE REACTIVE SYSTEM ARCHITECTURE A Dissertation 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 Mark Dixon Wood January 1992 c Mark Dixon
	ftp://ftp.cs.cornell.edu//pub/pidgin/TyphoonCompiler/cs612/pidgin-doc.ps, 19920306 The Pidgin Compiler \| for CS612 Typhoon Project March 2, 1992 Contents 1 Introduction 1 2 User's Guide 3 2.1 Functional Pidgin DFG's : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 4 2.1.1 Nodes : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : :
	ftp://ftp.cs.cornell.edu//pub/murthy/bra-90.ps.Z, 19920308 Finding Computational Content in Classical Proofs 1 Summary We illustrate the effectiveness of proof transformations which expose the computational content of classical proofs even in cases where it is not apparent. We state without proof a theorem that these transformations apply to proofs in a
	ftp://ftp.cs.cornell.edu//pub/murthy/thesis-report.ps.Z, 19920308 Extracting Constructive Content From Classical Proofs A Dissertation 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 Chetan Murthy August 1990 c Chetan Murthy 1990 ALL RIGHTS RESERVED Extracting
	ftp://ftp.cs.cornell.edu//pub/murthy/cincs91.ps.Z, 19920308 Classical Proofs as Programs How, What, When, and Why Chetan R. Murthy Department of Computer Science Cornell University Ithaca, NY 14853 USA murthy@cs.cornell.edu Feb 18, 1991
	ftp://ftp.cs.cornell.edu//pub/murthy/eta-cbn-control.ps.Z, 19920308 Sound Axioms for CBN Control Via Operational Reasoning Chetan R. Murthy Projet FORMEL INRIA-Rocquencourt 78153 Le Chesnay, FRANCE murthy@margaux.inria.fr Jan 14, 1992
	ftp://ftp.cs.cornell.edu//pub/jfc/tr91-005.ps.Z, 19920402 USING DISCRETE EVENT MODELING FOR EFFECTIVE COMPUTER ANIMATION CONTROL Paul A. Fishwick Hanns-Oskar A. Porr Dept. of Computer & Information Science University of Florida Bldg. CSE, Room 301 Gainesville, FL 32611
	ftp://ftp.cs.cornell.edu//pub/murthy/lics92.ps.Z, 19920403 A Computational Analysis of Girard's Translation and LC Chetan R. Murthy Projet FORMEL INRIA-Rocquencourt 78153 Le Chesnay, FRANCE murthy@margaux.inria.fr
	ftp://ftp.cs.cornell.edu//pub/murthy/bra-91.ps.Z, 19920411 Finding the Answers in Classical Proofs: A Unifying Framework Chetan R. Murthy Projet FORMEL INRIA-Rocquencourt 78153 Le Chesnay, FRANCE murthy@margaux.inria.fr January 1992
	ftp://ftp.cs.cornell.edu//pub/marzullo/subcuts.ps.Z, 19920413 Using Consistent Subcuts for Detecting Stable Properties Keith Marzullo Laura Sabel Cornell University Department of Computer Science 23 March 1992
	ftp://ftp.cs.cornell.edu//pub/murthy/cw92-big-version.ps.Z, 19920415 Control Operators, Hierarchies, and Pseudo-Classical Type Systems: A-Translation at Work Chetan R. Murthyy Projet FORMEL INRIA-Rocquencourt B.P. 105 78153 Le Chesnay Cedex, FRANCE murthy@margaux.inria.fr April 15, 1992
	ftp://ftp.cs.cornell.edu//pub/murthy/cw92-conf.ps.Z, 19920415 Control Operators, Hierarchies, and Pseudo-Classical Type Systems: A-Translation at Work Chetan R. Murthyy Projet FORMEL INRIA-Rocquencourt B.P. 105 78153 Le Chesnay Cedex, FRANCE murthy@margaux.inria.fr April 15, 1992
	ftp://ftp.cs.cornell.edu//pub/dml/Sept91/abstractions.ps.Z, 19920527 DML: Packaging High-Level Distributed Abstractions in SMLy Clifford D. Krumviedaz Department of Computer Science Cornell University Ithaca, NY 14853 cliff@cs.cornell.edu
	ftp://ftp.cs.cornell.edu//pub/navin/Bounds.ps.Z, 19920708 Primary{Backup Protocols: Lower Bounds and Optimal Implementations Navin Budhiraja Keith Marzullo Fred B. Schneidery Sam Touegz Department of Computer Science, Cornell University Ithaca NY 14853, USA January 30, 1992
	ftp://ftp.cs.cornell.edu//pub/marzullo/PBProtos.ps.Z, 19920708 Optimal Primary-Backup Protocols (extended abstract) Navin Budhiraja Keith Marzullo Fred B. Schneidery Sam Touegz Department of Computer Science, Cornell University Ithaca NY 14853, USA fnavin,marzullo,fbs,samg@cs.cornell.edu 1 Introduction One way to implement a fault-tolerant service is by using
	ftp://ftp.cs.cornell.edu//pub/marzullo/meta-arch.ps.Z, 19920725 Tools for Constructing Distributed Reactive Systems Keith Marzullo Cornell University Department of Computer Science Ithaca, New York 14853 marzullo@cs.cornell.edu Mark D. Woody Vrije Universiteit Faculteit Wiskunde en Informatica Amsterdam, The Netherlands wood@cs.vu.nl 28 May 1992
	ftp://ftp.cs.cornell.edu//pub/marzullo/pb.ps, 19920816 Optimal Primary-Backup Protocols Navin Budhiraja , Keith Marzullo , Fred B. Schneider , Sam Toueg Department of Computer Science, Cornell University, Ithaca NY 14853, USA
	ftp://ftp.cs.cornell.edu//pub/chandra/time.and.message.efficient.bari90.ps.Z, 19920820 Time and Message Efficient Reliable Broadcasts Tushar Deepak Chandra Sam Toueg Department of Computer Science Upson Hall, Cornell University Ithaca, New York 14853 e-mail (chandra@cs.cornell.edu, sam@cs.cornell.edu)
	ftp://ftp.cs.cornell.edu//pub/isis/horus/doc/sigops.ps.Z, 19920907 A RISC approach to Process Groups Robbert van Renesse Robert Cooper Bradford Glade Patrick Stephenson
	ftp://ftp.cs.cornell.edu//pub/isis/horus/doc/micro.ps.Z, 19920907 Reliable Multicast between Microkernels Robbert van Renesse Ken Birman Robert Cooper Bradford Glade Patrick Stephenson Computer Science Department, Upson Hall Cornell University, Ithaca, NY
	ftp://ftp.cs.cornell.edu//pub/isis/horus/doc/mach-kernel-interface.ps.Z, 19921112 Group Communication in Mach: Kernel Interface Supplement Draft Copy Bradford B. Glade Kenneth P. Birman Robbert van Renesse November 3, 1992 This work was partially supported by the Defense Advanced Research Projects Agency (DoD) under DARPA/NASA subcontract NAG2-593 administered by the NASA Ames
	ftp://ftp.cs.cornell.edu//pub/marzullo/fbl.ps.Z, 19921203 Nonblocking and Orphan-Free Message Logging Protocols Lorenzo Alvisiy Bruce Hoppe Keith Marzulloz Cornell University Department of Computer Science Ithaca NY 14853 USA
	ftp://ftp.cs.cornell.edu//pub/dsouza/CSP/history.ps, 19921205 6 Timed process algebras 33 G. M. Reed and A. W. Roscoe, Metric spaces as models for real-time concurrency, Proceedings of the Third Workshop on the Mathematical Foundations of Programming Language Semantics, Springer LNCS 298, 1987 G. M. Reed and A. W. Roscoe, Analysing MTFS : a study
	ftp://ftp.cs.cornell.edu//pub/dsouza/CSP/manual.ps, 19921205 Failures Divergence Refinement User Manual and Tutorial Version 1.2 Formal Systems (Europe) Ltd 13 October 1992 c 1992 Formal Systems (Europe) Ltd The FDR system is the property of Formal Systems (Europe) Ltd, and may not be used or copied except as provided by the attached licence and the following
	ftp://ftp.cs.cornell.edu//pub/marzullo/manetho1.ps.Z, 19921220 Implementation and Performance of Transparent Rollback-Recovery in Manetho Elmootazbellah Nabil Elnozahy Willy Zwaenepoel Department of Computer Science Rice University Houston, Texas 77251-1892 mootaz@cs.rice.edu, willy@cs.rice.edu
	ftp://ftp.cs.cornell.edu//pub/marzullo/manetho2.ps.Z, 19921220 The Performance of Consistent Checkpointing Elmootazbellah Nabil Elnozahy David B. Johnson Willy Zwaenepoel Department of Computer Science Rice University Houston, Texas 77251-1892 mootaz@cs.rice.edu, dbj@cs.cmu.edu, willy@cs.rice.edu
	ftp://ftp.cs.cornell.edu//pub/chandra/shared.memory.faulty.ps.Z, 19921230 Fault-tolerant Wait-free Shared Objects y Prasad Jayanti Tushar Deepak Chandraz Sam Toueg fprasad, chandra, samg@cs.cornell.edu Department of Computer Science Cornell University Ithaca, New York 14853 August 21, 1992
	ftp://ftp.cs.cornell.edu//pub/marzullo/holygrail.ps.Z, 19930106 1 Detecting Causal Relationships in Distributed Computations: In Search of the Holy Grail1 Reinhard Schwarz Department of Computer Science, University of Kaiserslautern, P.O. Box 3049, D - 6750 Kaiserslautern, Germany schwarz@informatik.uni-kl.de Friedemann Mattern Department of Computer Science,
	ftp://ftp.cs.cornell.edu//pub/jayanti/wdag92.jt.ps, 19930113 Some Results on the Impossibility, Universality, and Decidability of Consensus y Prasad Jayanti Sam Toueg Department of Computer Science, Cornell University Ithaca, New York 14853, USA fprasad,samg@cs.cornell.edu August 21, 1992 1 Introduction 1.1 Background A concurrent system consists of processes
	ftp://ftp.cs.cornell.edu//pub/pidgin/TyphoonCompiler/papers-ps/pnuma.ps, 19930121 Loop Transformations for NUMA Machines Wei Li Keshav Pingali Department of Computer Science Cornell University 1 Introduction In this paper, we describe a framework for loop transformations and code generation for NUMA (non-uniform memory access) machines. Most scalable parallel machines can be
	ftp://ftp.cs.cornell.edu//pub/pidgin/TyphoonCompiler/tech-reports-ps/access-norm.ps, 19930121 Access Normalization: Loop Restructuring for NUMA Compilers Wei Li Keshav Pingali Department of Computer Science Cornell University Ithaca, New York 14853 TR 92-1278 April 1992
	ftp://ftp.cs.cornell.edu//pub/pidgin/TyphoonCompiler/papers-ps/asplos92.ps, 19930121 Access Normalization: Loop Restructuring for NUMA Compilers (to appear in ASPLOS '92) Wei Li Keshav Pingaliy Department of Computer Science Cornell University Ithaca, New York 14853
	ftp://ftp.cs.cornell.edu//pub/pidgin/TyphoonCompiler/papers-ps/x-dfg.ps, 19930122 An Executable Representation of Distance and Direction Richard Johnson Wei Li Keshav Pingali Cornell University
	ftp://ftp.cs.cornell.edu//pub/isis/horus/doc/tuto.ps.Z, 19930202 A MUTS Tutorial Robbert van Renesse Computer Science Department 4118 Upson Hall, Cornell University Ithaca, NY 14853
	ftp://ftp.cs.cornell.edu//pub/murthy/cl-as-pl.ps.Z, 19930220 Classical Logic as a Programming Language: Typing Nonlocal Control Chetan R. Murthy Projet FORMEL INRIA-Rocquencourt B.P. 105 78153 Le Chesnay, FRANCE murthy@margaux.inria.fr Feb 20, 1993
	ftp://ftp.cs.cornell.edu//pub/navin/Upper-bounds.ps, 19930302 Optimal Primary-Backup Protocols Navin Budhiraja , Keith Marzullo , Fred B. Schneider , Sam Toueg Department of Computer Science, Cornell University, Ithaca NY 14853, USA
	ftp://ftp.cs.cornell.edu//pub/navin/Lower-bounds.ps, 19930302 Primary{Backup Protocols: Lower Bounds and Optimal Implementations Navin Budhiraja Keith Marzullo Fred B. Schneidery Sam Touegz Department of Computer Science Cornell University Ithaca NY 14853, USA
	ftp://ftp.cs.cornell.edu//pub/navin/Overview.ps, 19930302 The Primary{Backup Approach Navin Budhiraja Keith Marzullo y Fred B. Schneider z Sam Toueg x Department of Computer Science Cornell University Ithaca, New York 14853, USA 1 Introduction One way to implement a fault-tolerant service is by using multiple servers that fail independently. The state of the
	ftp://ftp.cs.cornell.edu//pub/raman/computerized-information-and-the-internet.ps, 19930322 Draft: Please do not redistribute Importance of computerized information to the visually impaired. T. V. Raman Department of Computer Science 4116 Upson Hall Cornell University Ithaca NY 14853{7501 Phone: (607)255--9202 E-mail: hraman@cs.cornell.edui 12 November, 1992 1 Benefits of computerized
	ftp://ftp.cs.cornell.edu//pub/raman/ieee-congrats.ps, 19930322 Draft: Please do not redistribute Congrats: A System for Converting Graphics to Sound T. V. Raman M. S. Krishnamoorthy Center for Applied Mathematics Department of Computer Science Cornell University Rensselaer Polytechnique Institute Ithaca, NY 14853{6201 Troy NY 12810
	ftp://ftp.cs.cornell.edu//pub/raman/podp-92.ps, 19930322 Draft: Please do not redistribute Documents are not just for printing T. V. Raman Center for Applied Mathematics Cornell University Ithaca NY 14853 Phone: (607)255--9202 E-mail: hraman@cs.cornell.edui October 5, 1992
	ftp://ftp.cs.cornell.edu//pub/raman/tug92.ps, 19930322 Draft: Please do not redistribute An audio view of (LA)TEX documents. T. V. Raman Center for Applied Mathematics Cornell University Ithaca NY 14853{6201 Phone: (607)255{7421 Internet: raman@cs.cornell.edu
	ftp://ftp.cs.cornell.edu//pub/raman/podp92-updated.ps, 19930322 Draft: Please do not redistribute Documents are not just for printing T. V. Raman Center for Applied Mathematics Cornell University Ithaca NY 14853 Phone: (607)255-9202 E-mail: hraman@cs.cornell.edui March 8, 1993
	ftp://ftp.cs.cornell.edu//pub/raman/textalk.ps, 19930322 Draft: Please do not redistribute TEXTALK T.V.Raman Center for Applied Mathematics Cornell University Ithaca NY 14853{6201 October 6, 1990
	ftp://ftp.cs.cornell.edu//pub/pidgin/TyphoonCompiler/papers-ps/pldi93.ps, 19930401 Dependence-Based Program Analysis Richard Johnson Keshav Pingali Department of Computer Science Cornell University, Ithaca, NY 14853
	ftp://ftp.cs.cornell.edu//pub/pidgin/TyphoonCompiler/papers-ps/sigplan93.ps, 19930401 Lifetime-Sensitive Modulo Scheduling Richard A. Huff Department of Computer Science Cornell University Ithaca, NY 14853 (607) 254-8830 huff@cs.cornell.edu
	ftp://ftp.cs.cornell.edu//pub/raman/work.ps, 19930506 Current research I have developed AFL, a language for expressing audio formatting rules. AFL has been used in my system for producing audio renderings of electronic documents with heavy mathematical content. The system surpasses current day reading machines in both the type of documents handled and
	ftp://ftp.cs.cornell.edu//pub/dml/June92/expressing.ps.Z, 19930507 Expressing Fault-Tolerant and Consistency-Preserving Programs in Distributed ML Clifford D. Krumvieday cliff@cs.cornell.edu Computer Science Department, Cornell University, Ithaca, NY 14853
	ftp://ftp.cs.cornell.edu//pub/dml/June92/asynchronous.ps.Z, 19930507 Distributed Programming with Asynchonous Ordered Channels in Distributed ML Robert Coopery Clifford Krumviedaz frcbc,cliffg@cs.cornell.edu Computer Science Department, Cornell University, Ithaca NY 14853
	ftp://ftp.cs.cornell.edu//pub/pidgin/TyphoonCompiler/tech-reports-ps/lambda.ps, 19930702 A Singular Loop Transformation Framework Based on Non-singular Matrices Wei Li Keshav Pingali Department of Computer Science Cornell University Ithaca, New York 14853 TR 92-1294 June 1992
	ftp://ftp.cs.cornell.edu//pub/pidgin/TyphoonCompiler/papers-ps/framework.ps, 19930702 A Singular Loop Transformation Framework Based on Non-singular Matrices Wei Li Keshav Pingali Department of Computer Science Cornell University Ithaca, New York 14853
	ftp://ftp.cs.cornell.edu//pub/wang/design.ps, 19930708 Kinematic Synthesis with Configuration Spaces Devika Subramanian Department of Computer Science Cornell University Ithaca, NY 14853 devika@cs.cornell.edu Cheuk-San (Edward) Wang Department of Computer Science Cornell University Ithaca, NY 14853 wang@cs.cornell.edu April 10, 1992
	ftp://ftp.cs.cornell.edu//pub/pidgin/TyphoonCompiler/tech-reports-ps/regions.ps, 19930709 Finding Regions Fast: Single Entry Single Exit and Control Regions in Linear Time Richard Johnson David Pearson Keshav Pingali Department of Computer Science Cornell University, Ithaca, NY 14853 Report # CTC93TR141 July 1993
	ftp://ftp.cs.cornell.edu//pub/isis/horus/doc/lwg.ps.Z, 19930716 Light-Weight Process Groups in the ISIS System Bradford B. Glade Kenneth P. Birman Robert C. B. Cooper Robbert van Renesse Computer Science Department, Cornell University, USA f glade j ken j rcbc j rvr g @cs.cornell.edu
	ftp://ftp.cs.cornell.edu//pub/isis/horus/doc/horus.ps.Z, 19930728 The Horus System Robbert van Renesse Ken Birman Robert Cooper Brad Glade Patrick Stephenson July 28, 1993
	ftp://ftp.cs.cornell.edu//pub/dph/hausdorff-pami.ps.Z, 19930805 Comparing Images Using the Hausdorff Distance Daniel P. Huttenlocher, Gregory A. Klanderman, and William J. Rucklidge Department of Computer Science Cornell University Ithaca, NY 14853 CUCS TR 91-1211 (revised)
	ftp://ftp.cs.cornell.edu//pub/kjartan/nrp.ps, 19930831 Systems of Set Constraints with Negative Constraints are NEXPTIME-Complete Kjartan Stefansson y stefan@cs.cornell.edu August 31, 1993
	ftp://ftp.cs.cornell.edu//pub/wjr/lowerbd.ps.Z, 19930907 Lower bounds for the complexity of the Hausdorff distance William J. Rucklidge Department of Computer Science, Cornell University Ithaca NY 14853, USA wjr@cs.cornell.edu
	ftp://ftp.cs.cornell.edu//pub/raman/audio-document.ps, 19931004 Audio Documents T. V. Raman May 10, 1993
	ftp://ftp.cs.cornell.edu//pub/buch/thead.ps, 19931005 PROBABILISTIC REVISION OF LOGICAL DOMAIN THEORIES A Dissertation 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 Ronen Feldman May 1993 Ronen Feldman 1993 ALL RIGHTS RESERVED PROBABILISTIC REVISION
	ftp://ftp.cs.cornell.edu//pub/vavasis/papers/accel-ip.ps.Z, 19931014 An Accelerated Interior Point Method Whose Running Time Depends Only on A Stephen A. Vavasis Yinyu Ye y October 14, 1993
	ftp://ftp.cs.cornell.edu//pub/ken/catocs.ps.Z, 19931015 A Response to Cheriton and Skeen's Criticism of Causal and Totally Ordered Communication Ken Birman October 15, 1993
	ftp://ftp.cs.cornell.edu//pub/raman/education.ps, 19931020 Education I have a wide-ranging background in the areas of Computer Science and Applied Mathematics. I began my educational career in mathematics, and I have gradually expanded my area of knowledge to encompass both Applied Mathematics and Computer Science. The following paragraphs summarize the
	ftp://ftp.cs.cornell.edu//pub/raman/resume.ps, 19931026 T. V. Raman 4116 Upson Hall Cornell University Ithaca, NY 14853-7501 Voice-mail: (607)255-9202 Fax: (607)255-4428 E-mail: hraman@cs.cornell.edui Objective Pursue a challenging research career in the area of innovative multimedia user interface technology using speech and audio. Principal fields of
	ftp://ftp.cs.cornell.edu//pub/raman/slides/logo-slide.ps, 19931027 ASTER Audio System for Technical Readings The next-generation reading machine. Information is display independent. Electronic Document (LA)TEX ! Print ! ASTER Audio Different views of the same document. + 4
	ftp://ftp.cs.cornell.edu//pub/vavasis/papers/accel-ip-errata.ps, 19931030 Errata to: An Accelerated Interior Point Method Whose Running Time Depends Only on A" (Cornell C.S. TR 93-1391) Stephen A. Vavasis Yinyu Ye October 30, 1993 On page 7, the displayed formula for ffi(y; ) is incorrect. The correct formula is: ffi(y; ) = h (b= AS 1e)T (AS 2AT ) 1(b= AS 1e) i1=2 : In
	ftp://ftp.cs.cornell.edu//pub/vavasis/papers/basis.ps, 19931112 Identifying an optimal basis in linear programming Stephen A. Vavasis Yinyu Ye y November 9, 1993
	ftp://ftp.cs.cornell.edu//pub/pidgin/TyphoonCompiler/tech-reports-ps/cdequiv.ps, 19931207 Finding Regions Fast: Single Entry Single Exit and Control Regions in Linear Time Richard Johnson David Pearson Keshav Pingali Department of Computer Science Cornell University, Ithaca, NY 14853 Report # CTC93TR141 July 1993
	ftp://ftp.cs.cornell.edu//pub/pidgin/TyphoonCompiler/papers-ps/popl92.ps, 19931207
	ftp://ftp.cs.cornell.edu//pub/pidgin/TyphoonCompiler/tech-reports-ps/TR91-1220.ps, 19931207
	ftp://ftp.cs.cornell.edu//pub/segre/cache.ps.Z, 19931209 Bounded-Overhead Caching for De nite-Clause Theorem Proving Alberto Segre & Daniel Scharstein segre@cs.cornell.edu schar@cs.cornell.edu Department of Computer Science Cornell University Ithaca, NY 14853-7501
	ftp://ftp.cs.cornell.edu//pub/segre/ebl.ps.Z, 19931209 AHigh-Performance Explanation-Based Learning Algorithm Alberto Segre Charles Elkan segre@cs.cornell.edu elkan@cs.ucsd.edu Department of Computer Science Department of Computer Science and Engineering Cornell University University of California at San Diego Ithaca, NY 14853 La Jolla, CA 92093
	ftp://ftp.cs.cornell.edu//pub/allan/Hypertext93.ps.Z, 19931213 Hypertext '93 Proceedings 1 November 1993 ACM COPYRIGHT This space reserved for ACM copyright information. * This study was supported in part by the National Science Foundation under grant IRI 89-15847. Selective Text Utilization and Text Traversal Gerard Salton* Department of Computer Science Cornell
	ftp://ftp.cs.cornell.edu//pub/raman/spoken-math.ps, 19940109 Mathematics for computer generated spoken documents. T. V. Raman Department of Computer Science 4116 Upson Hall Cornell University Ithaca NY 14853{7501 Voice-mail: (607)255-9202 E-mail: hraman@cs.cornell.edui May 27, 1992 1 simple fractions and expressions. a + b + c + d a + bc + d a + b c + d ab + c +
	ftp://ftp.cs.cornell.edu//pub/pidgin/TyphoonCompiler/papers-ps/popl91.ps, 19940125 Dependence Flow Graphs: An Algebraic Approach to Program Dependencies Keshav Pingali Micah Beck Richard Johnson Mayan Moudgill Paul Stodghill Department of Computer Science, Cornell University, Ithaca, NY 14853
	ftp://ftp.cs.cornell.edu//pub/kate/wonr.inc.comp/Derive.ps.Z, 19940204 Deriving Incremental Programs Yanhong A. Liu Tim Teitelbaum Department of Computer Science, Cornell University, Ithaca, NY 14853 fyanhong, ttg@cs.cornell.edu October 1993
	ftp://ftp.cs.cornell.edu//pub/mdw/SGML/manual.ps.gz, 19940210 The qwertz SGML Document Types (Version 1.2 Reference Manual) Tom Gordon The qwertz Project Institute for Applied Information Technology (F3) German National Research Center for Computer Science (GMD) February 10, 1994 Contents 1 Why Not Just Use LaTEX 3 2 A Short Tour 4 3 The qwertz Document Type
	ftp://ftp.cs.cornell.edu//pub/mdw/SGML/issues.ps, 19940210 Deductive ClosureIssuesCurrent ContextGoalWorking Interpretation
	ftp://ftp.cs.cornell.edu//pub/vbhatt/techreport-msd-93-01.ps.Z, 19940211 techreport MSD-93-01, Mech. Engr.,Cornell University Draft copy. Please do not recirculate THREE DIMENSIONAL FRICTIONAL RIGID BODY IMPACT by Vivek Bhatt & Jeffrey C. Koechling MSD-93-01 December 1993 1 Draft copy. Please do not recirculate
	ftp://ftp.cs.cornell.edu//pub/vbhatt/iasted-3d-impact.ps.Z, 19940211 IASTED Conf. on Modeling and Simulation, May 1993 Draft copy. Please do not recirculate Modeling 3-D Frictional Rigid Body Impact: Dealing with Degenerate Singularities Vivek Bhatt Jeff Koechling Sibley School of Mechanical and Aerospace Engineering Cornell University, Ithaca, NY 14853-7501 USA
	ftp://ftp.cs.cornell.edu//pub/vbhatt/asme-j-dyn-sys-limping-in-hopping.ps.Z, 19940211 ASME Winter Annual Meeting 1193, DSC Vol.49 Draft copy. Please do not recirculate Experimental and Analytical Results in the Study of Limping in a Hopping Robot Vivek Bhatt Jeff Koechling Sibley School of Mechanical and Aerospace Engineering Cornell University, Ithaca, NY 14853-7501 USA
	ftp://ftp.cs.cornell.edu//pub/vbhatt/iasted-link-impact.ps.Z, 19940211 IASTED Conf. on Modeling and Simulation, May 1993 Draft copy. Please do not recirculate Incorporating Frictional Impacts in Dynamic Simulations of Planar Multi-Link Chains Vivek Bhatt Jeff Koechling Sibley School of Mechanical and Aerospace Engineering Cornell University, Ithaca, NY 14853-7501 USA
	ftp://ftp.cs.cornell.edu//pub/vbhatt/icra94-3d-impact.ps.Z, 19940211 IEEE Conf. Robotics and Automation, May 1994 Draft copy. Please do not recirculate Classifying Dynamic Behavior During Three Dimensional Frictional Rigid Body Impact Vivek Bhatt Jeff Koechling Sibley School of Mechanical and Aerospace Engineering Cornell University, Ithaca, NY 14853-7501 USA
	ftp://ftp.cs.cornell.edu//pub/vbhatt/can-cong-app-mech-3d-impact.ps.Z, 19940211 Canadian Cong. of Applied Mechanics, June 1993 Draft copy. Please do not recirculate INVESTIGATIONS INTO THREE DIMENSIONAL IMPACT OF RIGID BODIES Vivek Bhatt Jeff Koechling Sibley School of Mechanical and Aerospace Engineering Cornell University, Ithaca, NY 14853-7501 USA
	ftp://ftp.cs.cornell.edu//pub/segre/weiss.ps.Z, 19940225 Book Review: Computer Systems that Learn Sholom Weiss & Casimir Kulikowski Alberto Segre GeoffreyGordon segre@cs.cornell.edu ggordon@cs.cmu.edu Department of Computer Science School of Computer Science Cornell University Carnegie Mellon University Ithaca, NY 14853-7501 Pittsburgh, PA15213-3890 1.
	ftp://ftp.cs.cornell.edu//pub/glade/deceit/deceit.ps.Z, 19940307 Chapter 3 Deceit Architecture The Deceit File System is the most important case in the file system survey. Deceit was explicitly designed for exploring a wide range of file system semantics and performance. Design decisions that locked file semantics were delayed as long as
	ftp://ftp.cs.cornell.edu//pub/isis/horus/doc/page.ps.Z, 19940311 Horus Architecture Device Drivers IPCThreadsMUTSKernel GroupsOrdered MCast/ IPC Operating System Basic GroupsVSync Ordered MCast User Address SpaceTransparent Fault Tolerance Object ReplicationLong-haul CommunicationNews ServiceProcess GroupsTOOLKITSNaming ServiceMETAFailure DetectorSTANDARD UTILITIES 6
	ftp://ftp.cs.cornell.edu//pub/gries/Teachmath1.ps.gz, 19940314 Teaching Math More Effectively, Through the Design of Calculational Proofs David Gries 1 and Fred B. Schneider 2 Computer Science, Cornell University February 1994 Lower-level college math courses usually avoid using formalism, in both definitions and proofs. Later, when students have mastered
	ftp://ftp.cs.cornell.edu//pub/gries/Teachmath2.ps.gz, 19940314 A New Approach to Teaching Mathematics David Gries 1 and Fred B. Schneider 2 Computer Science, Cornell University February 1994 1 Introduction Generally speaking, mathematicians and computer scientists are not satisfied with the level at which college students understand math. Students have difficulty
	ftp://ftp.cs.cornell.edu//pub/pidgin/TyphoonCompiler/papers-ps/94-pldi.ps, 19940315 The Program Structure Tree: Computing Control Regions in Linear Time Richard Johnson David Pearson Keshav Pingali rjohnson@cs.cornell.edu pearson@cs.cornell.edu pingali@cs.cornell.edu Department of Computer Science Cornell University, Ithaca, NY 14853
	ftp://ftp.cs.cornell.edu//pub/segre/ptr.ps.Z, 19940323 Bias-DrivenRevision of Logical Domain Theories Moshe Koppel Ronen Feldman Alberto Maria Segre koppel@bimacs.cs.biu.ac.il feldman@bimacs.cs.biu.ac.il segre@cs.cornell.edu Department of Mathematics and Computer Science Department of Computer Science Bar-Ilan University Cornell University Ramat-Gan, Israel
	ftp://ftp.cs.cornell.edu//pub/segre/critical.ps.Z, 19940323 ACritical Look at Experimental Evaluations of EBL Alberto Segre Charles Elkan Alexander Russell segre@cs.cornell.edu elkan@cs.ucsd.edu arussell@cs.cornell.edu Department of Computer Science Department of Computer Science and Engineering Cornell University University of California at San Diego Ithaca, NY
	ftp://ftp.cs.cornell.edu//pub/segre/cade94.ps.Z, 19940325 A Novel Asynchronous Parallelism Scheme for First-Order Logic David B. Sturgill and Alberto Maria Segre Cornell University, Ithaca NY 14853-7501, USA
	ftp://ftp.cs.cornell.edu//pub/segre/aaai94.ps.Z, 19940414 Using Hundreds of Workstations to SolveFirst-Order Logic Problems Alberto Maria Segre & David B. Sturgill segre@cs.cornell.edu sturgill@cs.cornell.edu Department of Computer Science Cornell University Ithaca, NY 14853-7501 Abstract This paper describes a distributed, adaptive, rst-order logic engine
	ftp://ftp.cs.cornell.edu//pub/bressoud/TalkAndNotes.ps.Z, 19940418 Page 1 Joke Cite Goals/Overview Build an HP processor capable of tolerating a single Hardware crash failure Tandem story Bring home the advantage of transparent fault tolerance -- No software changes. Virtual Fault-Tolerance Page 1 4/18/94 Building a Virtually Fault-Tolerant System Building a Virtually
	ftp://ftp.cs.cornell.edu//pub/isis/isis-publications.ps.Z, 19940419 PUBLICATIONS LIST ISIS Activity 93-xxxx* Understanding Partitions and the `No Partition' Assumption. Andr e Schiper, Aleta Ricciardi and Kenneth Birman. To appear 4th Future Trends in Distributed Computing Systems, September 22-24, 1993, Lisbon, Portugal. 93-xxxx* Reliable Enterprise Computing. Kenneth
	ftp://ftp.cs.cornell.edu//pub/segre/ml94.ps.Z, 19940420 Getting the Most from Flawed Theories Moshe Koppel Alberto Maria SegreRonen Feldman Department of Mathematics Department of Computer Science Department of Mathematics and Computer Science Cornell University and Computer Science Bar-Ilan University Ithaca, NY 14853 Bar-Ilan University Ramat-Gan, Israel
	ftp://ftp.cs.cornell.edu//pub/allan/Sigir94.ps.Z, 19940420 The Effect of Adding Relevance Information in a Relevance Feedback Environment Chris Buckley , Gerard Salton, James Allan
	ftp://ftp.cs.cornell.edu//pub/allan/Trec2.ps.Z, 19940420 Automatic Routing and Ad-hoc Retrieval Using SMART : TREC 2 Chris Buckley , James Allan, and Gerard Salton
	ftp://ftp.cs.cornell.edu//pub/gries/Chapter0.ps.gz, 19940428 A New Discrete-Math Course based on the text A Logical Approach to Discrete Math" David Gries and Fred B. Schneider Computer Science, Cornell University April 28, 1994 Our text A Logical Approach to Discrete Math" attempts to change, in a revolutionary way, how discrete math is taught. Instead of
	ftp://ftp.cs.cornell.edu//pub/mdw/linux/linux-logo.ps, 19940509 inux
	ftp://ftp.cs.cornell.edu//pub/brd/homology.ps.Z, 19940526 On Computing the Homology Type of a Triangulation David Renpan Chang Bruce Randall Donald Computer Science Department, Cornell University March 9, 1994
	ftp://ftp.cs.cornell.edu//pub/brd/information-invariants.ps.Z, 19940526 On Information Invariants in Robotics Bruce Randall Donald Computer Science Department Cornell University Ithaca, New York April 18, 1994 This book describes research done in the Robotics and Vision Laboratory at Cornell University. Support for our robotics research is provided in part by the National
	ftp://ftp.cs.cornell.edu//pub/brd/scheme-mobile-robots.ps.Z, 19940526 Program Mobile Robots in Scheme1 Jonathan Rees Bruce Donald Computer Science Robotics and Vision Laboratory Cornell University Ithaca, NY 14850
	ftp://ftp.cs.cornell.edu//pub/brd/distributed-manipulation.ps.Z, 19940531 Information Invariants for Distributed Manipulation1 Bruce Randall Donald, James Jennings, and Daniela Rus Robotics & Vision Laboratory Computer Science Department Cornell University Ithaca, New York In , we described a manipulation task for cooperating mobile robots that can push large, heavy
	ftp://ftp.cs.cornell.edu//pub/kjartan/newton.ps, 19940615 Computing the Newtonian Graph (Extended abstract) Dexter Kozen Kjartan Stefansson kozen@cs.cornell.edu stefan@cs.cornell.edu June 15, 1994
	ftp://ftp.cs.cornell.edu//pub/tah/Papers/real-time_system=discrete_system+clock_variables.ps, 19940615 Real-time System = Discrete System + Clock Variables Rajeev Alur Thomas A. Henzingery AT&T Bell Laboratories Computer Science Department 600 Mountain Avenue Cornell University Murray Hill, NJ 07974 Ithaca, NY 14853 alur@research.att.com tah@cs.cornell.edu How can we take a programming language off the
	ftp://ftp.cs.cornell.edu//pub/brd/harmful-if-swallowed/demo-tape-label.ps.Z, 19940616 HARMFULIFSWALLOWEDHarmful if Swallowed '93Harmful if Swallowed:Recorded in Ithaca, NY (1993) Engineering and remix: Bruce Donald This is a Dolby C stereo recordingAll songs c 1993Paranoia Paradise EvaristeEsthetique du Mal Zoe3:032:437:028:00'..1993Jim Davis: bass, vocalsBruce Donald: guitar, vocals
	ftp://ftp.cs.cornell.edu//pub/brd/harmful-if-swallowed/cassette-label-dat.ps.Z, 19940616 Harmful if Swallowed Habitat for HumanityFeb 5 1994 Evariste (2:40) Car On Fire (4:17) Matchline II (3:24) Desert Storm (6:42) Paranoia Paradise (2:55) Sonja and James (2:27) Kumas (5:57) Esth tique du Mal (6:18) Punk Solipsist (3:00) Dalai Lama (5:17) Lunar Institute (4:12) Zo (5:38) To Corner You
	ftp://ftp.cs.cornell.edu//pub/pidgin/TyphoonCompiler/lambda/userGuide.ps, 19940617 The Lambda Loop Transformation Toolkit (User's Reference Manual) Wei Li Department of Computer Science University of Rochester Keshav Pingali Department of Computer Science Cornell University May 1994 University of Rochester Technical Report 511 Cornell University Technical Report 94-1431
	ftp://ftp.cs.cornell.edu//pub/rz/Vista/OSDIAbstract.ps, 19940621 File Systems As Storage Personalities In Microstorage Architectures Dawson Dean and Richard Zippel Department of Computer Science Cornell University, Ithaca, NY 14850 USA dawson@cs.cornell.edu, rz@cs.cornell.edu Dawson Dean is a full time graduate student. Author Contact: Dawson Dean email:
	ftp://ftp.cs.cornell.edu//pub/scott/other-papers/maxmin-cover.ps, 19940624 Approximating the MaxMin-Angle Covering Triangulation Extended Abstract Scott A. Mitchell
	ftp://ftp.cs.cornell.edu//pub/scott/other-papers/refining.ps, 19940624 Refining a Triangulation of a Planar Straight-Line Graph to Eliminate Large Angles Scott A. Mitchell
	ftp://ftp.cs.cornell.edu//pub/scott/other-papers/edge-insert.ps, 19940624 Edge Insertion for Optimal Triangulations1 M. Bern2, H. Edelsbrunner3, D. Eppstein4, S. Mitchell5, and T. S. Tan6
	ftp://ftp.cs.cornell.edu//pub/scott/GG/COVER/minmax-cover.ps, 19940624 Finding a Covering Triangulation Whose Maximum Angle is Provably Small Scott A. Mitchell
	ftp://ftp.cs.cornell.edu//pub/scott/GG/ls-nonobtuse.ps, 19940624 Linear-size Nonobtuse Triangulation of Polygons Marshall Bern Scott Mitchell y Jim Ruppert z
	ftp://ftp.cs.cornell.edu//pub/scott/tri/quality-mesh.ps, 19940624 Quality Mesh Generation in Three Dimensions Extended Abstract Scott A. Mitchell Stephen A. Vavasisy
	ftp://ftp.cs.cornell.edu//pub/scott/other-papers/card-bounds.ps, 19940624 Cardinality Bounds for Triangulations with Bounded Minimum Angle Scott A. Mitchell
	ftp://ftp.cs.cornell.edu//pub/tah/Papers/hybrid_automata.ps, 19940626 Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems1 Rajeev Alur2 Costas Courcoubetis3 Thomas A. Henzinger4 Pei-Hsin Ho3
	ftp://ftp.cs.cornell.edu//pub/isis/horus/doc/muts-spec.ps.Z, 19940707 MUTS Documentation Draft Copy The Horus Group June 8, 1994 This work was partially supported by the Defense Advanced Research Projects Agency (DoD) under DARPA/NASA subcontract NAG2-593 administered by the NASA Ames Research Center and by grants from IBM and Siemens Corp. The views, opinions, and
	ftp://ftp.cs.cornell.edu//pub/isis/horus/doc/groups.ps.Z, 19940707 The Horus Uniform Group Interface Robbert van Renesse Cornell University
	ftp://ftp.cs.cornell.edu//pub/isis/horus/doc/socket.ps.Z, 19940707 Horus Socket Interface Draft Copy The Isis Group May 26, 1994 This work was partially supported by the Defense Advanced Research Projects Agency (DoD) under DARPA/NASA subcontract NAG2-593 administered by the NASA Ames Research Center and by grants from IBM and Siemens Corp. The views, opinions, and
	ftp://ftp.cs.cornell.edu//pub/isis/horus/doc/tour.ps.Z, 19940707 A tour of the Horus source tree. Robbert van Renesse Cornell University Ithaca, NY 14850
	ftp://ftp.cs.cornell.edu//pub/isis/horus/doc/horus-principles-talk.ps.Z, 19940707 Fault-Tolerant Programming with Horus: Overview Bradford B. Glade Cornell University March 23, 1993 1 Horus Tutorial The Isis/Horus Distributed Toolkit Procedural API ffl Library and servers on top of variety of Operating Systems including: UNIX, AIX, Chorus, Mach. ffl Core technology designed to slide
	ftp://ftp.cs.cornell.edu//pub/allan/RIAO94.ps.Z, 19940729 Automatic Text Decomposition and Structuring Gerard Salton and James Allan
	ftp://ftp.cs.cornell.edu//pub/isis/horus/doc/arch.ps.Z, 19940812 Design and Performance of Horus: A Lightweight Group Communications System Robbert van Renesse, Takako M. Hickey, and Kenneth P. Birman Dept. of Computer Science Cornell University
	ftp://ftp.cs.cornell.edu//pub/vbhatt/wam94-fractals.ps.Z, 19940815 Measures of Robust Dynamical Behavior and Fractal Basin Boundaries for Two and Three-Well Potential Problems Vivek Bhatt Francis C. Moon Sibley School of Mechanical and Aerospace Engineering Cornell University Ithaca, NY USA.
	ftp://ftp.cs.cornell.edu//pub/isis-publications.ps.Z, 19940819 PUBLICATIONS LIST ISIS Activity 94-1442 Design and Performance of Horus: A Lightweight Group Communications system. van Renesse, Hickey, and Birman. August 1994. Cornell University's Computer Science Department Technical Report. 94-1426(Rep`s 92-1293) The Weakest Failure Detector for Solving Consensus.
	ftp://ftp.cs.cornell.edu//pub/sabel/tr94-1413.ps, 19940825 Simulating Fail-Stop in Asynchronous Distributed Systems Laura S. Sabely Cornell University Department of Computer Science Keith Marzullo University of California, San Diego Department of Computer Science 22 June 1994
	ftp://ftp.cs.cornell.edu//pub/chandra/thesis.ps.Z, 19940831 UNRELIABLE FAILURE DETECTORS FOR ASYNCHRONOUS DISTRIBUTED SYSTEMS A Dissertation 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 Tushar Deepak Chandra May 1993 c Tushar Deepak Chandra 1993 ALL
	ftp://ftp.cs.cornell.edu//pub/TR-94-1147.ps, 19940902 Uniform Actions in Asynchronous Distributed Systems Dalia Malki Ken Birmany Aleta Ricciardiz Andr e Schiper x TR 94-1447 Department of Computer Science, Cornell University
	ftp://ftp.cs.cornell.edu//pub/gries/Error3.ps.gz, 19940909 1 Errors to be Corrected in the Third Printing of A Logical Approach to Discrete Math by David Gries and Fred B. Schneider 23 August 1994 A number of errors will be corrected in the third printing of A Logical Approach to Discrete Math". If you have a copy of an earlier printing, you may want to copy
	ftp://ftp.cs.cornell.edu//pub/tah/Papers/half-order_modal_logic.ps, 19940910 Half-order Modal Logic: How To Prove Real-time Properties Thomas A. Henzingery Department of Computer Science Stanford University
	ftp://ftp.cs.cornell.edu//pub/tah/Papers/the_benefits of relaxing_punctuality.ps, 19940915 The Benefits of Relaxing Punctuality1 Rajeev Alur AT&T Bell Laboratories Murray Hill, NJ 07974 Email: alur@research.att.com Tom as Feder IBM Almaden Research Center San Jose, CA 95120 Email: tomas@almaden.ibm.com Thomas A. Henzinger2 Computer Science Department, Cornell University Ithaca, NY 14853
	ftp://ftp.cs.cornell.edu//pub/tah/Papers/real-time_logics.ps, 19940915 Real-time Logics: Complexity and Expressiveness y Rajeev Alur Thomas A. Henzinger AT&T Bell Laboratories Computer Science Department 600 Mountain Avenue Cornell University Murray Hill, NJ 07974 Ithaca, NY 14853
	ftp://ftp.cs.cornell.edu//pub/tah/Slides/Old/watertank.ps, 19940917 Water-Level Monitor Verified Property Number ofNumber of transitionslocations The water level is always between 1 and 12 meters. 4 4 3.8 sec. CPU time valve valve closed valve open : clock: water level water tank x := y = 1 x = 2 x = 2 x := _x = 1 _y = 1 _y = 1 y <= 10 x <= 2 _x = 1 _y = 2 x <= 2 _y = 2
	ftp://ftp.cs.cornell.edu//pub/tah/Papers/model-checking_strategies_for_linear_hybrid_systems.ps, 19940917 Model Checking Strategies for Linear Hybrid Systems y Thomas A. Henzingerz Pei-Hsin Ho Computer Science Department Cornell University (tahjho)@cs.cornell.edu Extended Abstract
	ftp://ftp.cs.cornell.edu//pub/tah/Papers/automatic_symbolic_verification of embedded_systems.ps, 19940917 Automatic Symbolic Verification of Embedded Systems Rajeev Alury Thomas A. Henzingerz Pei-Hsin Hoz
	ftp://ftp.cs.cornell.edu//pub/tah/Papers/symbolic_model_checking_for_real-time_systems.ps, 19940917 Symbolic Model Checking for Real-time Systems Thomas A. Henzingery Computer Science Department, Cornell University Ithaca, NY 14853, U.S.A. Xavier Nicollinz Joseph Sifakisz Sergio Yovinez VERIMAG, Miniparc-ZIRST rue Lavoisier 38330 Montbonnot Saint Martin, France
	ftp://ftp.cs.cornell.edu//pub/tah/Papers/the_algorithmic_analysis of hybrid_systems.ps, 19940917 The Algorithmic Analysis of Hybrid Systems R. Alury C. Courcoubetisz N. Halbwachsx T.A. Henzinger{ P.-H. Hox X. Nicollinz A. Oliveroz J. Sifakisz S. Yovinez
	ftp://ftp.cs.cornell.edu//pub/tah/Slides/Old/fischerprotocol.ps, 19940917 repeat forever repeat until bdelay await Critical section Fischer's Mutual Exclusion Protocol Number ofNumber of transitionslocations16 8.5 sec.81 CPU time Mutual exclusion (two processes are never in the critical section at the same time). k := k = i k = k := i; P1 P2 fk = g 1 <= _y <= 1110 45 <= _x <=
	ftp://ftp.cs.cornell.edu//pub/tah/Slides/Old/railroadcrossing.ps, 19940917 Verified Property Number ofNumber of transitionslocations Train Gate Controller When the train is within 10 meters to the gate, 36 5.9 sec.90 the gate is always fully closed. Train Gate Controller Railroad Crossing : Train, Controller, and Gate CPU time x < 100 _x 2 _t = 1 _t = 1 _t = open y =
	ftp://ftp.cs.cornell.edu//pub/tah/Papers/computing_accumulated_delays_in_real-time_systems.ps, 19940918 Computing Accumulated Delays in Real-time Systems Rajeev Alury Costas Courcoubetisz Thomas A. Henzingerx
	ftp://ftp.cs.cornell.edu//pub/tah/Papers/logics_and_models of real_time.ps, 19940918 Logics and Models of Real Time: A Survey1 Rajeev Alur AT&T Bell Laboratories Murray Hill, NJ 07974 Thomas A. Henzinger Computer Science Department Cornell University Ithaca, NY 14853
	ftp://ftp.cs.cornell.edu//pub/tah/Papers/a_really_temporal_logic.ps, 19940918 A Really Temporal Logic y Rajeev Alur Thomas A. Henzinger AT&T Bell Laboratories Computer Science Department 600 Mountain Avenue Cornell University Murray Hill, NJ 07974 Ithaca, NY 14853
	ftp://ftp.cs.cornell.edu//pub/tah/Papers/parametric_real-time_reasoning.ps, 19940918 Parametric Real-time Reasoning Rajeev Alur AT&T Bell Laboratories Murray Hill, NJ Thomas A. Henzingery Department of Computer Science Cornell University, Ithaca, NY Moshe Y. Vardi IBM Almaden Research Center San Jose, CA
	ftp://ftp.cs.cornell.edu//pub/tah/Papers/what_good_are_digital_clocks.ps, 19940918 What Good Are Digital Clocks y Thomas A. Henzingerz Zohar Mannax Amir Pnueli{
	ftp://ftp.cs.cornell.edu//pub/tah/Papers/temporal_proof_methodologies_for_timed_transition_systems.ps, 19940918 Temporal Proof Methodologies for Timed Transition Systems1;2 Thomas A. Henzinger Department of Computer Science Cornell University Ithaca, NY 14853 Zohar Manna Department of Computer Science Stanford University Stanford, CA 94305 Amir Pnueli Department of Applied Mathematics The Weizmann Institute of
	ftp://ftp.cs.cornell.edu//pub/tah/Papers/towards_refining_temporal_specifications_into_hybrid_systems.ps, 19940918 Towards Refining Temporal Specifications into Hybrid Systems12 Thomas A. Henzinger Computer Science Department Cornell University Ithaca, NY 14853 e-mail: tah@cs.cornell.edu Zohar Manna Computer Science Department Stanford University Stanford, CA 94305 e-mail: zm@cs.stanford.edu Amir Pnueli Department
	ftp://ftp.cs.cornell.edu//pub/tah/Papers/the_observational_power of clocks.ps, 19940918 The Observational Power of Clocks Rajeev Alury Costas Courcoubetisz Thomas A. Henzingerx
	ftp://ftp.cs.cornell.edu//pub/tah/Papers/back_to_the_future.ps, 19940919 Back to the Future: Towards a Theory of Timed Regular Languages Rajeev Alur Thomas A. Henzingery AT&T Bell Laboratories Computer Science Department 600 Mountain Avenue Cornell University Murray Hill, NJ 07974 Ithaca, NY 14853
	ftp://ftp.cs.cornell.edu//pub/branch/interface/userguide.ps.Z, 19941002 Getting CUTE with Matlab Mary Ann Branchy Department of Computer Science Cornell University, Ithaca, NY 14853 branch@cs.cornell.edu Report # CTC94TR194 September 1994
	ftp://ftp.cs.cornell.edu//pub/vbhatt/resume-faculty.ps, 19941012 VIVEK BHATT Office Address Department Of Mechanical Engineering 191 Upson Hall, Cornell University Ithaca, NY 14853 (607)-255-3420, (607)-255-6671 email: vbhatt@cs.cornell.edu Home Address 611 Winston Court Apt. # 4 Ithaca, NY 14850 (607)-266-0845 (to leave messages) Principal Fields of Interest
	ftp://ftp.cs.cornell.edu//pub/vbhatt/resume.ps, 19941012 VIVEK BHATT Office Address Department Of Mechanical Engineering 191 Upson Hall, Cornell University Ithaca, NY 14853. (607)-255-3420 Email:vbhatt@cs.cornell.edu WWW:http://www.cs.cornell.edu/Info/People/vbhatt/vbhatt.html Residential Address 611 Winston Court Apt. # 4 Ithaca, NY 14850 (607)-266-0845 (to
	ftp://ftp.cs.cornell.edu//pub/vbhatt/sensorless-manipulation-icra95.ps.Z, 19941012 Draft of 10/3/94. Submitted to ICRA'95 Sensorless Manipulation Using Transverse Vibrations of a Plate Karl-Friedrich B ohringer Computer Science Cornell University Ithaca, NY 14853-7501 Vivek Bhatt Mechanical Engineering Cornell University Ithaca, NY 14853-7501 Ken Goldberg Computer Science University
	ftp://ftp.cs.cornell.edu//pub/tah/Slides/Old/reactortemperature.ps, 19941018 Number ofNumber of transitionslocations CPU time 812 17.2 sec. Nuclear Reactor ( Linear Approximation ) add 2 y2 >= T y2 := _y2 = 1 out2 in2 in1 add 1 y2 = T y1 := _y1 = 1 remove2 remove1 y1 = T out1 y1 >= T 45T < 23(U L) rod 1 no rod rod 2 add 1 add2 x = L x >= L x = U remove 1 x = L x = U remove2 x =
	ftp://ftp.cs.cornell.edu//pub/vbhatt/j-app-mech-3d-impact.ps.Z, 19941028 Three Dimensional Frictional Rigid Body Impact Vivek Bhatt Jeff Koechling Student Member Not a member Sibley School of Mechanical and Aerospace Engineering Cornell University, Ithaca, NY 14853-7501 USA
	ftp://ftp.cs.cornell.edu//pub/multimed/lossless.ps.gz, 19941101 Experiments with a Lossless JPEG Codec September 2, 1994 21 FIGURE 8. Image 3: F-18 FIGURE 9. Image 4: flowers Experiments with a Lossless JPEG Codec September 2, 1994 20 Appendix A FIGURE 6. Image 1: Lena FIGURE 7. Image 2: football Experiments with a Lossless JPEG Codec September 2, 1994 19 References
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR92-1269.ps.Z, 19941104 Integrating Security in a Group Oriented Distributed System Michael Reiter Kenneth Birman Li Gong Dept. of Computer Science Dept. of Computer Science ORA Corporation Cornell University Cornell University 675 Massachusetts Ave. Ithaca, NY 14853 Ithaca, NY 14853 Cambridge, MA 02139 reiter@cs.cornell.edu
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR91-1187.ps.Z, 19941104 Tools for Monitoring and Controlling Distributed Applications Extended Abstract Keith Marzullo marzullo@cs.cornell.edu Mark D. Woody wood@cs.cornell.edu Cornell University Department of Computer Science Ithaca, New York 14853 November 16, 1990
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR92-1289.ps.Z, 19941104 Using the ISIS Resource Manager for Distributed, Fault-Tolerant Computing Timothy Clark Kenneth Birman Department of Computer Science, Cornell University June 23, 1992
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR92-1307.ps.Z, 19941104 Tradeoffs in Implementing Primary{Backup Protocols Navin Budhiraja y Keith Marzulloz Department of Computer Science, Cornell University Ithaca NY 14853, USA fnavin,marzullog@cs.cornell.edu
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR92-1321.ps.Z, 19941104 A Multi-Resolution Technique for Comparing Images Using the Hausdorff Distance Daniel P. Huttenlocher William J. Rucklidge Department of Computer Science Cornell University Ithaca, NY 14853 dph@cs.cornell.edu wjr@cs.cornell.edu CUCS TR 92-1321
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR92-1320.ps.Z, 19941104 Tracking Non-Rigid Objects in Complex Scenes Daniel P. Huttenlocher, Jae J. Noh and William J. Rucklidge Computer Science Department Cornell University Ithaca NY 14853 USA
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR91-1216.ps.Z, 19941104 The Process Group Approach to Reliable Distributed Computing Kenneth P. Birman March 22, 1993
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR91-1185.ps.Z, 19941104 Programming with Process Groups: Group and Multicast Semantics Kenneth P. Birman Robert Cooper Barry Gleeson TR-91-1185 January 29, 1991
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR91-1193.ps.Z, 19941104 Tools for Constructing Distributed Reactive Systems Keith Marzullo marzullo@cs.cornell.edu Mark D. Woody wood@cs.cornell.edu Cornell University Department of Computer Science Ithaca, New York 14853 February 22, 1991
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR93-1349.ps.Z, 19941104 Consistent Failure Reporting in Reliable Communication Systems Cornell University Dept. of CS TR 93-1349 Kenneth P. Birman and Bradford B. Glade May 19, 1993
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR92-1287.ps.Z, 19941104 How to Securely Replicate Services Michael Reiter Kenneth Birman reiter@cs.cornell.edu ken@cs.cornell.edu Department of Computer Science Cornell University Ithaca, New York 14853 June 15, 1992
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR92-1266.ps.Z, 19941104 Performance in Flexible Distributed File Systems A Dissertation 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 Alexander Siegel May 1992 c Alexander Siegel 1992 ALL RIGHTS RESERVED Performance in
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR91-1252.ps.Z, 19941104 FAULT-TOLERANT MANAGEMENT OF DISTRIBUTED APPLICATIONS USING THE REACTIVE SYSTEM ARCHITECTURE A Dissertation 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 Mark Dixon Wood January 1992 c Mark Dixon
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR91-1233.ps.Z, 19941104 Practical Utility of Knowledge-Based Analyses : Optimizations and Optimality for an Implementation of Asynchronous, Fail-Stop Processes1 (Extended Abstract) Aleta M. Ricciardi Cornell University Department of Computer Science Ithaca, NY 14853 USA aleta@cs.cornell.edu September 13,1991 1Research
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR94-1432.ps.Z, 19941104 Performance of the Isis Distributed Computing Toolkit Kenneth P. Birman and Timothy Clark June 22, 1994
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR93-1390.ps.Z, 19941107 A Response to Cheriton and Skeen's Criticism of Causal and Totally Ordered Communication Ken Birman October 15, 1993
	ftp://ftp.cs.cornell.edu//pub/chandra/podc95.ps.Z, 19941107 CALL FOR PAPERS Fourteenth ACM Symposium on Principles of Distributed Computing (PODC) Ottawa, Ontario, Canada August 20-23, 1995 SCOPE AND FORMAT: Research contributions to the theory, design, specification or implementation of distributed systems are solicited. Topics of interest include, but are not
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR94-1441.ps.Z, 19941107 Lower bounds for the complexity of the Hausdorff distance William J. Rucklidge Department of Computer Science, Cornell University Ithaca NY 14853, USA wjr@cs.cornell.edu
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR94-1424.ps.Z, 19941107 1 A Group Communication Approach for Mobile Computing MobileChannel: an ISIS tool for mobile services Kenjiro Cho Kenneth P. Birman Department of Computer Science, Cornell University Ithaca, New York 14853-7501 May 17, 1994
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR94-1408.ps.Z, 19941107 AUDIO SYSTEM FOR TECHNICAL READINGS A Dissertation 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 T. V. Raman May 1994 c T. V. Raman 1994 ALL RIGHTS RESERVED AUDIO SYSTEM FOR TECHNICAL READINGS T.
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR94-1406.ps.Z, 19941107 Chain Models and Finite Element Analysis Richard S. Palmer Department of Computer Science Cornell University Ithaca, NY 14853 rick@cs.cornell.edu January 12, 1993
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR93-1392.ps.Z, 19941107 s s , , 1 Introduction Modern application programs support increasingly rich documents that contain many different types of data, such as text, pictures, sounds, and simulations. Different programs, written by different developers, may manipulate a single document, and no single program may understand
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR94-1404.ps.Z, 19941107 A str ct. We describe finite-state programs over real-numbered time in a guardedcommand language with real-valued clocks or, equivalently, as finite automata with real-valued clocks. Model checking answers the question which states of a real-time program satisfy a branching-time specification (given in
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR93-1394.ps.Z, 19941107 1 n r c n Given a system of n + 1 generic Laurent polynomials, for i = 1; : : : ; n + 1, i(x) = q2 ciq xq ; q = (q1; : : : ; qn); xq = xq11 xq2 xqnn ; (1:1) with ( nite) support sets i , where is some affine lattice isomorphic to Z n; we consider the e ton res tant ( 1; 2; : : : ; n+1). This is the
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR94-1434.ps.Z, 19941107 ON PROGRAM TRANSFORMATIONS A Dissertation 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 Sofoklis Efremidis May 1994 c Sofoklis Efremidis 1994 ALL RIGHTS RESERVED ON PROGRAM TRANSFORMATIONS
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR93-1401.ps.Z, 19941107 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 Technical Report 93-1401,Department of Computer Science, Cornell University and as Report No. 89, Reports in
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR93-1384.ps.Z, 19941107 Deriving Incremental Programs Yanhong A. Liu Tim Teitelbaum Department of Computer Science, Cornell University, Ithaca, NY 14853 fyanhong, ttg@cs.cornell.edu October 1993
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR93-1397.ps.Z, 19941107 Interprocedural Data Flow Analysis Based on Temporal Specifications Arnd Poetzsch{Heffter 1 2 Cornell University 4112 Upson Hall Ithaca, NY 14853 poetzsch@cs.cornell.edu Institut f ur Informatik Technische Universit at D{80290 M unchen poetzsch@informatik.tu-muenchen.de
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR94-1403.ps.Z, 19941107 How can we take a programming language o the shelf and upgrade it into a real-time programming language Programs such as device drivers and plant controllers must explicitly refer and react to time. For this purpose, a variety of language constructs\|including delays, timeouts, and watchdogs\|has been put
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR94-1437.ps.Z, 19941107 Model Checking Strategies for Linear Hybrid Systems y Thomas A. Henzingerz Pei-Hsin Ho Computer Science Department Cornell University (tahjho)@cs.cornell.edu Extended Abstract
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR94-1433.ps.Z, 19941107 A Polynomial-time Algorithm for the Change-Making Problem David Pearson Computer Science Department Cornell University Ithaca, New York 14853, USA pearson@cs.cornell.edu June 14, 1994
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR94-1440.ps.Z, 19941107 IMPLEMENTING AND EXPLOITING STATIC SPECULATION ON MULTIPLE INSTRUCTION ISSUE PROCESSORS A Dissertation 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 Mayan Moudgill May 1994 c Mayan Moudgill 1994
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR93-1402.ps.Z, 19941107 On the Intellectual Terrain around NPy Juris Hartmanis1 and Suresh Chari2 1 Cornell University and Max-Planck Institut f ur Informatik 2 Cornell University
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR94-1412.ps.Z, 19941107 Improved Data Structures for Fully Dynamic Biconnectivity Monika Rauch
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR93-1375.ps.Z, 19941107 Chain Models of Physical Behavior for Engineering Analysis and Design Richard S. Palmer Department of Computer Science Cornell University Ithaca, NY 14053 rick@cs.cornell.edu Vadim Shapiro Analytic Process Department General Motors R & D Center Warren, MI 48090-9055 shapiro@gmr.com August 11, 1993
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR92-1294.ps.Z, 19941107 A Singular Loop Transformation Framework Based on Non-singular Matrices Wei Li Keshav Pingali Department of Computer Science Cornell University Ithaca, New York 14853 TR 92-1294 June 1992
	ftp://ftp.cs.cornell.edu//pub/isis/horus/doc/pcode.ps.Z, 19941109 A Comparative Work on the Performance of PCODE by Rimon Orni High Availability Lab Computer Science Department The Hebrew University of Jerusalem Jerusalem, Israel Submitted as a Lab Project October 17, 1994 1 An Overview of PCODE Parallel computing on clusters of workstations and personal computers has
	ftp://ftp.cs.cornell.edu//pub/isis/horus/doc/tcl.ps.Z, 19941121 The Tcl Interface to the Horus System Robbert van Renesse November 21, 1994 The Tcl language is a convenient language for prototyping applications. Together with its TK graphical toolkit, it is possible to write real applications with fancy graphical interfaces. Combining Tcl/TK with Horus, which
	ftp://ftp.cs.cornell.edu//pub/vbhatt/j-app-mech-param-space-3d.ps.Z, 19941123 Partitioning the Parameter Space According to Different Behaviors During 3D Impacts Vivek Bhatt Jeff Koechling Sibley School of Mechanical and Aerospace Engineering Cornell University, Ithaca, NY 14853-7501 USA
	ftp://ftp.cs.cornell.edu//pub/multimed/mmsys.ps.gz, 19941202 Page 35 Figure 14: SNR of blur (left) and shrink-by-2 (right) vs. number of multiplies 20 40 60 200 400 600 800 1000 1200 SNR mults 20 40 60 80 1000 2000 3000 4000 SNR mults Blur Shrink-by-2 Page 34 Figure 13: Effect of condensation for shrink-by-2. Top: uncondensed (1100 mults/vector). Bottom:
	ftp://ftp.cs.cornell.edu//pub/multimed/mm94.ps.Z, 19941206
	ftp://ftp.cs.cornell.edu//pub/brd/jacm-final.ps.Z, 19941209 Kinodynamic Motion Planning1 Bruce Donald2 Patrick Xavier2 John Canny3 John Reif 4
	ftp://ftp.cs.cornell.edu//pub/vavasis/papers/accel-pd.ps.Z, 19941210 A Primal-Dual Accelerated Interior Point Method Whose Running Time Depends Only on A Stephen A. Vavasisy Yinyu Yez December 10, 1994
	ftp://ftp.cs.cornell.edu//pub/dph/dcg.ps, 19941218 The Upper Envelope of Voronoi Surfaces and its Applications Daniel P. Huttenlocher(1), Klara Kedem(1;2), and Micha Sharir(2;3) (1)Department of Computer Science Cornell University, Ithaca, NY 14853, U.S.A (2)Department of Computer Science Tel-Aviv University, Tel-Aviv 69978, Israel (3)Courant Institute
	ftp://ftp.cs.cornell.edu//pub/dph/cghkkk.ps, 19941218 Geometric Pattern Matching under Euclidean Motion L. Paul Chew1, Michael T. Goodrich2, Daniel P. Huttenlocher3, Klara Kedem3;4, Jon M. Kleinberg3, and Dina Kravets5
	ftp://ftp.cs.cornell.edu//pub/brd/algorithmica-1.ps.Z, 19950104 Provably Good Approximation Algorithms for Optimal Kinodynamic Planning: Robots with Decoupled Dynamics Bounds1 Bruce R. Donald Department of Computer Science, Cornell University, Ithaca, NY 14853-7501 Patrick Xavier Sandia National Laboratories, Albuquerque NM 87185-0951 Keywords: robot motion
	ftp://ftp.cs.cornell.edu//pub/brd/algorithmica-2.ps.Z, 19950104 Provably Good Approximation Algorithms for Optimal Kinodynamic Planning for Cartesian Robots and Open Chain Manipulators1 Bruce R. Donald Department of Computer Science, Cornell University, Ithaca NY 14853-7501 Patrick G. Xavier Sandia National Laboratories, Albuquerque NM 87185-0951 Keywords: robot
	ftp://ftp.cs.cornell.edu//pub/allan/CIKM93-agents.ps.Z, 19950118 Information Agents for Building Hyperlinks James Allan, Jim Davis, Dean Krafft, Daniela Rus, Devika Subramanian Department of Computer Science Upson Hall Cornell University Ithaca, NY 14853 email: rus@cs.cornell.edu FAX: (607) 255-4428
	ftp://ftp.cs.cornell.edu//pub/allan/CIKM93-htext.ps.Z, 19950118 The Identification of Text Relations Using Automatic Hypertext Linking James Allan Gerard Saltony Department of Computer Science Cornell University Ithaca, NY 14853-7501 Fax: 607/255-4428 fallan,gsg@cs.cornell.edu
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR95-1475.ps.Z, 19950207 Rational Spaces and Set Constraints Dexter Kozen Computer Science Department Cornell University Ithaca, New York 14853-7501, USA kozen@cs.cornell.edu
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR95-1480.ps.Z, 19950209 EFFICIENT GEOMETRIC ALGORITHMS FOR ROBOT SENSING AND CONTROL A Dissertation 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 Amy Judith Briggs January 1995 c Amy Judith Briggs 1995 ALL RIGHTS
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR95-1479.ps.Z, 19950209 MULTICAST FLOW CONTROL ON LOCAL AREA NETWORKS A Dissertation 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 Guerney Douglass Holloway Hunt May 1995 c Guerney Douglass Holloway Hunt 1995 ALL RIGHTS
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR95-1485.ps.Z, 19950214 Localization, Mapmaking, and Distributed Manipulation with Flexible, Robust Mobile Robots A Dissertation 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 Russell Gregory Brown May 1995 c Russell
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR95-1483.ps.Z, 19950214 Undecidability Results for Hybrid Systems Thomas A. Henzingery and Peter W. Kopkez Computer Science Department Cornell University, Ithaca, NY 14853x February 7, 1995
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR95-1484.ps.Z, 19950214 AUTOMATIC HYPERTEXT CONSTRUCTION A Dissertation 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 James Allan January 1995 c James Allan 1995 ALL RIGHTS RESERVED AUTOMATIC HYPERTEXT CONSTRUCTION
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR95-1474.ps.Z, 19950214 Efficient Message Passing Interface (MPI) for Parallel Computing on Clusters of Workstations Jehoshua Bruck Danny Dolevy Ching-Tien Hoz Marcel-C>=at>=alin Ro sux Ray Strongz California Institute of Technology yInstitute of CS Mail Code 116-81 Hebrew University Pasadena, CA 91125 Jerusalem, Israel
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR94-1465.ps.Z, 19950214 ntroduction This note uses the NuPrl term structure and editor display mechanism to provide an unambiguous notation that can be used in the computer assisted development of arguments in mathematics. The example used to demonstrate this application is a theorem in Hamiltonian dynamics. These
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR95-1486.ps.Z, 19950214 On the Number of Small Cuts in a Graph Monika Rauch Henzinger Cornell University David P. Williamson IBM Watson
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR95-1482.ps.Z, 19950214 Verification Methods for the Divergent Runs of Clock Systems Thomas A. Henzingery and Peter W. Kopkez Computer Science Department Cornell University, Ithaca, NY 14853x February 6, 1995
	ftp://ftp.cs.cornell.edu//pub/chandra/undec.ps.Z, 19950215 Undecidability in Economics: A Formal Challenge to Rational Expectations (Preliminary Draft) Siddharth Chandray and Tushar Deepak Chandraz August 15, 1993
	ftp://ftp.cs.cornell.edu//pub/karl/AAAI92.ps, 19950219 AAAI 1992 Fall Symposium Series - Design from Physical Principles, Boston, MA, October 1992. Computational Aspects of the Design of Micro-Mechanical Hinged Structures Karl-Friedrich B ohringer Department of Computer Science, Cornell University Ithaca, New York 14853 karl@cs.cornell.edu
	ftp://ftp.cs.cornell.edu//pub/karl/MEMS94-abstract.ps, 19950219 Submitted to IEEE Workshop on Micro Electro Mechanical Systems, Oiso, Japan, January 1994 A Theory of Manipulation and Control for Microfabricated Actuator Arrays Karl-Friedrich B ohringer Bruce R. Donald Robotics & Vision Laboratory Department of Computer Science Cornell University, Ithaca, NY Robert
	ftp://ftp.cs.cornell.edu//pub/karl/MEMS94.ps, 19950219 Proc. Seventh IEEE International Workshop on Micro Electro Mechanical Systems, Oiso, Japan, January 1994. A THEORY OF MANIPULATION AND CONTROL FOR MICROFABRICATED ACTUATOR ARRAYS Karl-Friedrich B ohringer Bruce R. Donald Robotics & Vision Laboratory Department of Computer Science Cornell University
	ftp://ftp.cs.cornell.edu//pub/karl/SM93.ps, 19950219 Proc. ACM/SIGGRAPH Symposium on Solid State Modeling and Applications, Montreal, Quebec, Canada, May 1993 A COMPUTATIONAL APPROACH TO THE DESIGN OF MICROMECHANICAL HINGED STRUCTURES Karl-Friedrich B ohringer Department of Computer Science, Cornell University Ithaca, NY 14853 karl@cs.cornell.edu
	ftp://ftp.cs.cornell.edu//pub/karl/flier93.ps, 19950219 A Geometric Theory of Manipulation and Control for Microfabricated Actuator Arrays Karl-Friedrich B ohringer and Bruce R. Donald csrvl A wide variety of micro-electromechanical structures (MEMS) has been built recently by using processing techniques known from VLSI industry. Our work in microrobotics
	ftp://ftp.cs.cornell.edu//pub/karl/SIGCHI90.ps, 19950219 Proc. of ACM SIGCHI Conf. on Human Factors in Computing Systems, Seattle, WA, April 1990. USING CONSTRAINTS TO ACHIEVE STABILITY IN AUTOMATIC GRAPH LAYOUT ALGORITHMS Karl-Friedrich B ohringer Frances Newbery Paulisch Institute for Informatics University of Karlsruhe D-7500 Karlsruhe 1 West Germany
	ftp://ftp.cs.cornell.edu//pub/karl/NSF93.ps, 19950219 Proc. NSF Design and Manufacturing Systems Grantees Conference, Charlotte, NC, January 1993. Application of Computational Topology to the Design of Microelectromechanical Structures Karl-Friedrich B ohringer Department of Computer Science Cornell University Ithaca, NY 14853
	ftp://ftp.cs.cornell.edu//pub/karl/ICRA94.ps, 19950219 Proc. of IEEE Int. Conf. on Robotics and Automation, San Diego, CA, May 1994. Sensorless Manipulation Using Massively Parallel Microfabricated Actuator Arrays Karl-Friedrich B ohringer Bruce R. Donald Robert Mihailovich Noel C. MacDonald Robotics & Vision Laboratory School of Electrical Engineering and
	ftp://ftp.cs.cornell.edu//pub/karl/ICRA95.ps, 19950221 Proc. of the IEEE Int. Conf. on Robotics and Automation (ICRA'95), Nagoya, Japan, May 1995. Sensorless Manipulation Using Transverse Vibrations of a Plate Karl-Friedrich B ohringer Vivek Bhatt Kenneth Y. Goldberg Robotics & Vision Laboratory Sibley School of Mechanical Dept. of Computer Science Dept. of
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR95-1495.ps.Z, 19950322 Hypervisor-based Fault-tolerance* Thomas C. Bressoud** ISIS Distributed Systems 111 South CayugaStreet Ithaca, NewYork 14850 Fred B. Schneider Computer Science Department Cornell University Ithaca, NewYork 14853 March 16, 1995
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR95-1481.ps.Z, 19950322 A QUASI-NEWTON L2-PENALTY METHOD FOR MINIMIZATION SUBJECT TO NONLINEAR EQUALITY CONSTRAINTS THOMAS F. COLEMANy AND WEI YUANz
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR95-1492.ps.Z, 19950322 A Determinizable Class of Timed Automata Rajeev Alury Limor Fixz Thomas A. Henzingerx
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR95-1489.ps.Z, 19950322 Incorporating System Resource Information into Flow Control Takako M. Hickey and Robbert van Renesse Dept. of Computer Science Upson Hall Cornell University Ithaca, NY 14853
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR95-1491.ps.Z, 19950322 Strong and Weak Virtual Synchrony in Horus Roy Friedman Robbert van Renesse Department of Computer Science Cornell University Ithaca, NY 14853. March 1, 1995
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR95-1493.ps.Z, 19950322 Achieving Critical Reliability With Unreliable Components and Unreliable Glue Mark Hayden and Ken Birman Computer Science Department, Cornell University, Ithaca NY 14853
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR95-1490.ps.Z, 19950322 Preserving Privacy in a Network of Mobile Computers TR 95-1490 David A. Cooper Kenneth P. Birmany Dept. of Computer Science Cornell University Ithaca, NY 14853{7501
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR95-1488.ps.Z, 19950322 Election Vs. Consensus in Asynchronous Systems Laura S. Sabely Cornell University Department of Computer Science Keith Marzullo University of California, San Diego Department of Computer Science
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR95-1477.ps.Z, 19950322 A NEW TRUST REGION ALGORITHM FOR EQUALITY CONSTRAINED OPTIMIZATION THOMAS F. COLEMANy AND WEI YUANz
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR95-1497.ps.Z, 19950322 Hybrid Automata with Finite Mutual Simulations Thomas A. Henzinger and Peter W. Kopke Computer Science Department Cornell University, Ithaca, NY 14853 (tahjpkpk)@cs.cornell.edu
	ftp://ftp.cs.cornell.edu//pub/stoller/NOSSDAV95.ps.Z, 19950327 Storage Replication and Layout in Video-on-Demand Servers Scott D. Stoller1 and John D. DeTreville2 1 Dept. of Computer Science, Cornell University, Ithaca, NY 14853-7501, USA. stoller@cs.cornell.edu 2 Digital Equipment Corporation, Systems Research Center 130 Lytton Avenue, Palo Alto CA 94301-1044,
	ftp://ftp.cs.cornell.edu//pub/stoller/TACS94.ps.Z, 19950327 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.cs.cornell.edu//pub/stoller/TSE94.ps.Z, 19950327 Addendum to Proof Rules for Flush Channels" Scott Stoller
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR95-1503.ps.Z, 19950331 Randomized Graph Drawing with Heavy-Duty Preprocessing David Harel and Meir Sardasy Dept. of Applied Mathematics and Computer Science The Weizmann Institute of Science, Rehovot, Israel March 15, 1995
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR95-1502.ps.Z, 19950331 Combining Multiple Evidence from Different Properties of Weighting Schemes Joon Ho Lee Department of Computer Science Cornell University Ithaca, NY 14853-7501
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR95-1499.ps.Z, 19950331 Incremental Computation for Transformational Software Development Yanhong A. Liu Tim Teitelbaum March 1995
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR95-1500.ps.Z, 19950331 Horus: A Flexible Group Communications System Robbert van Renesse, Kenneth P. Birman, Brad Glade, Katie Guo, Mark Hayden, Takako M. Hickey, Dalia Malki, Alex Vaysburd, and Werner Vogels1 Dept. of Computer Science, Cornell University
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR94-1467.ps.Z, 19950331 Set Constraints and Logic Programming Dexter Kozen Computer Science Department Cornell University Ithaca, New York 14853-7501, USA kozen@cs.cornell.edu November 16, 1994
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR95-1501.ps.Z, 19950331 Analyzing the Effectiveness of Extended Boolean Models in Information Retrieval Joon Ho Lee Department of Computer Science Cornell University Ithaca, NY 14853-7501
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR95-1506.ps.Z, 19950331 Using Virtual Synchrony to Develop Efficient Fault Tolerant Distributed Shared Memories Roy Friedman Department of Computer Science Cornell University Ithaca, NY 14853. March 31, 1995
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR95-1505.ps.Z, 19950331 Protocol Composition in Horus Robbert van Renesse rvr@cs.cornell.edu Kenneth P. Birman ken@cs.cornell.edu Dept. of Computer Science Cornell University March 29, 1995
	ftp://ftp.cs.cornell.edu//pub/yanhong/Cir-TR95.ps.Z, 19950405 Caching Intermediate Results for Program Improvement Yanhong A. Liu Tim Teitelbaum March 1995
	ftp://ftp.cs.cornell.edu//pub/isis/horus/doc/overview.ps.Z, 19950405 Horus: A Flexible Group Communications System Robbert van Renesse, Kenneth P. Birman, Brad Glade, Katie Guo, Mark Hayden, Takako M. Hickey, Dalia Malki, Alex Vaysburd, and Werner Vogels1 Dept. of Computer Science, Cornell University
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR95-1507.ps.Z, 19950407 Length Normalization in Degraded Text Collections Amit Singhal Gerard Salton Chris Buckley Department of Computer Science Cornell University, Ithaca, NY 14853 fsinghal, gs, chrisbg@cs.cornell.edu
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR94-1456.ps.Z, 19950407 Presented at Hot Interconnects II, Aug. 1994, Palo Alto, CA, abridged version in IEEE Micro, Feb 1995. hoti-tr.doc 3/7/95 1 Low-Latency Communication over ATM Networks using Active Messages Thorsten von Eicken, Veena Avula, Anindya Basu, and Vineet Buch Department of Computer Science Cornell University
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR94-1446.ps.Z, 19950407 Efficient Resolution of Singularities of Plane Curves Dexter Kozen Computer Science Department Cornell University Ithaca, New York 14853, USA kozen@cs.cornell.edu
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR95-1496.ps.Z, 19950407 The Expressive Power of Clocks Thomas A. Henzingery Peter W. Kopke Howard Wong-Toi Computer Science Department Cornell University, Ithaca, NY 14853 (tahjpkpkjhoward)@cs.cornell.edu
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR94-1445.ps.Z, 19950407 Efficient Average-Case Algorithms for the Modular Group Jin-Yi Cai SUNY Buffalo cai@cs.buffalo.edu Wolfgang H. Fuchs Cornell University fuchs@math.cornell.edu Dexter Kozen Cornell University kozen@cs.cornell.edu Zicheng Liu Princeton University zl@cs.princeton.edu
	ftp://ftp.cs.cornell.edu//pub/twilson/thesis.ps.gz, 19950418 Preface This thesis studies the framework arising in the algebraic and categorical description of general (or point-set") topology. In this framework\|variously called frame theory, locale theory, point-free topology, or even pointless topology\|the focus is on the algebraic (lattice-theoretic)
	ftp://ftp.cs.cornell.edu//pub/twilson/titlepage.ps, 19950420 The Assembly Tower and Some Categorical and Algebraic Aspects of Frame Theory J. Todd Wilson May 1994 CMU-CS-94-186 School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy Thesis Committee:
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR95-1508.ps.Z, 19950424 An Incremental Drawing Algorithm for Planar Graphs David Harel and Meir Sardasy Dept. of Applied Mathematics and Computer Science The Weizmann Institute of Science, Rehovot, Israel April 10, 1995
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR95-1509.ps.Z, 19950424 ENHANCING THE NUPRL PROOF DEVELOPMENT SYSTEM AND APPLYING IT TO COMPUTATIONAL ABSTRACT ALGEBRA A Dissertation 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 Paul Bernard Jackson January 1995 c
	ftp://ftp.cs.cornell.edu//pub/stoller/SCP95.ps.Z, 19950426 Verifying Programs that use Causally-ordered Message-passing Scott D. Stoller Fred B. Schneidery Department of Computer Science Cornell University Ithaca, New York 14853 April 26, 1995
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR95-1504.ps.Z, 19950428 EFFICIENT ACCESS TO KNOWLEDGE VIA FORWARD CHAINING TACTICS Ze-Wei Chen March 5, 1995
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR95-1512.ps.Z, 19950510 On Presenting Monotonicity and On EA)AE David Gries Computer Science, Cornell University April 1995
	ftp://ftp.cs.cornell.edu//pub/yanhong/Cir-PEPM95.ps.Z, 19950513 Caching Intermediate Results for Program Improvement Yanhong A. Liu Tim Teitelbaum Department of Computer Science, Cornell University, Ithaca, NY 14853 Email: fyanhong, ttg@cs.cornell.edu
	ftp://ftp.cs.cornell.edu//pub/yanhong/Inc-TR94.ps.Z, 19950518 Systematic Derivation of Incremental Programs Yanhong A. Liu Tim Teitelbaum August 1994
	ftp://ftp.cs.cornell.edu//pub/yanhong/Drv-TR93-Rvs.ps.Z, 19950518 Deriving Incremental Programs Yanhong A. Liu Tim Teitelbaum Department of Computer Science, Cornell University, Ithaca, NY 14853 fyanhong, ttg@cs.cornell.edu October 1993
	ftp://ftp.cs.cornell.edu//pub/yanhong/Tsd-TR95.ps.Z, 19950518 Incremental Computation for Transformational Software Development Yanhong A. Liu Tim Teitelbaum March 1995
	ftp://ftp.cs.cornell.edu//pub/chandra/podc95program.ps.Z, 19950519 PODC 1995 Final Program Fourteenth ACM Annual Symposium on Principles of Distributed Computing Hotel Chateau Laurier Ottawa, Ontario, Canada August 20{23, 1995 Sponsored by: ACM SIGOPS and SIGACT Supported by: Digital Equipment Coorporation, IBM Almaden Research Center and Carleton University General
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR95-1520.ps.Z, 19950526 Avoiding the Undefined by Underspecification David Gries and Fred B. Schneider Computer Science Department, Cornell University Ithaca, New York 14853 USA
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR94-1473.ps.Z, 19950526 Complete Orthogonal Decomposition for Weighted Least Squares Patricia D. Houghy Stephen A. Vavasisz March 15, 1995
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR95-1519.ps.Z, 19950526 NEWTONIAN GRAPHS, RIEMANN SURFACES AND COMPUTATION A Dissertation 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 Kjartan Stefansson May 1995 c Kjartan Stefansson 1995 ALL RIGHTS RESERVED NEWTONIAN
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR95-1513.ps.Z, 19950526 Automatic Symbolic Verification of Embedded Systems Rajeev Alury Thomas A. Henzingerz Pei-Hsin Hoz
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR94-1472.ps.Z, 19950526 GMRES vs. ideal GMRES Kim-Chuan Toh January 24, 1995
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR95-1515.ps.Z, 19950526 Estimating the Attainable Accuracy of Recursively Computed Residual Methods Anne Greenbaum April 14, 1995
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR94-1471.ps.Z, 19950526 Completeness Results for Recursive Data Bases Tirza Hirst and David Harel Dept. of Applied Mathematics & Computer Science The Weizmann Institute of Science Rehovot 76100, Israel ftirza, harelg@wisdom.weizmann.ac.IL
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR95-1514.ps.Z, 19950526 Dienst: Implementation Reference Manual Carl Lagoze Erin Shawy James R. Davisz Dean B. Krafftx May 5, 1995
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR95-1518.ps.Z, 19950526 A Complete Gentzen-style Axiomatization for Set Constraints Allan Cheng and Dexter Kozen Computer Science Department Cornell University Ithaca, New York 14853, USA e-mail:facheng,kozeng@cs.cornell.edu
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR95-1516.ps.Z, 19950526 Improved Curve Detection Through Decomposition of the Hough Transform Clark F. Olson Computer Science Department Cornell University Ithaca, NY 14853 clarko@cs.cornell.edu May 15, 1995
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR95-1517.ps, 19950530 Efficient Algorithms for Optimal Video Transmission Dexter Kozen kozen@cs.cornell.edu Yaron Minsky yminsky@cs.cornell.edu Brian Smith bsmith@cs.cornell.edu Computer Science Department Upson Hall Cornell University Ithaca, New York 14853-7501 May 16, 1995
	ftp://ftp.cs.cornell.edu//pub/driscoll/SC-Toolbox/sct-guide.ps, 19950601 Schwarz-Christoffel Toolbox User's Guide Version 1.3 Tobin A. Driscoll 1 Introduction The Schwarz-Christoffel Toolbox (SC Toolbox) is a collection of files for the interactive computation and visualization of Schwarz-Christoffel conformal maps in MATLAB1 version 4. The toolbox is a descendant of SCPACK,
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR95-1494.ps.Z, 19950601 A Robust Method for Detecting Cuts and Dissolves in Video Sequences Kevin Mai Justin Miller Ramin Zabih Technical Report TR95-1494 Computer Science Department Cornell University Ithaca, NY 14853
	ftp://ftp.cs.cornell.edu//pub/rus/iser95/iser-full-good.ps.Z, 19950604 Distributed Robotic Manipulation: Experiments in Minimalism Karl B ohringer, Russell Brown, Bruce Donald, Jim Jennings Daniela Rus Robotics and Vision Laboratory Robotics Laboratory Department of Computer Science Department of Computer Science Cornell University Dartmouth College Ithaca, NY 14853
	ftp://ftp.cs.cornell.edu//pub/maffeis/94-9-14.ps.gz, 19950606 OMG RFP Submission IDL C++ Language Mapping Specification Digital Equipment Corporation Expersoft Corporation Hewlett-Packard Company IONA Technologies, Ltd. International Business Machines Corporation Novell Inc. SunSoft, Inc. OMG Document 94-9-14 September 12, 1994 1 Introduction 9 1.1 Cosubmitting
	ftp://ftp.cs.cornell.edu//pub/maffeis/corba1.2.ps.gz, 19950606 The Common Object Request Broker: Architecture and Specification Digital Equipment Corporation Hewlett-Packard Company HyperDesk Corporation NCR Corporation Object Design, Inc. SunSoft, Inc. OMG Document Number 93.xx.yy Revision 1.2 Draft 29 December 1993 Copyright 1991, 1992 by Digital Equipment
	ftp://ftp.cs.cornell.edu//pub/chandra/others/shay.ps.Z, 19950608 Fast Distributed Construction of k-Dominating Sets and Applications (Extended Abstract) Shay Kutten David Peleg y
	ftp://ftp.cs.cornell.edu//pub/chandra/others/Gil.ps.Z, 19950614 Failure Detectors and the Wait-Free Hierarchy (Extended Abstract) Gil Neiger Software Technology Lab Intel Corporation
	ftp://ftp.cs.cornell.edu//pub/stoller/WDAG95.ps.Z, 19950620 Faster Possibility Detection by Combining Two Approaches Scott D. Stoller and Fred B. Schneider Dept. of Computer Science, Cornell University, Ithaca, NY 14853, USA. stoller@cs.cornell.edu, fbs@cs.cornell.edu
	ftp://ftp.cs.cornell.edu//pub/nikos/mirror.ps.gz, 19950625 Revised draft as of 6/20/94 { Please do not cite or distribute Optimizing closed loop adaptive optics performance using multiple control bandwidths Brent L. Ellerbroek Starfire Optical Range, US Air Force Phillips Laboratory, Kirtland Air Force Base, New Mexico 87117 Charles Van Loan and Nikos P.
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR95-1521.ps.Z, 19950705 HyTech : The Cornell HYbrid TECHnology Tool y Thomas A. Henzingerz Pei-Hsin Ho Computer Science Department, Cornell University, Ithaca, NY 14853 (tahjho)@cs.cornell.edu
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR95-1522.ps.Z, 19950705 Fast Compiled Logic Simulation Using Linear BDDs Sudeep Gupta and Keshav Pingali Department of Computer Science Cornell University, Ithaca, New York 14853.
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR95-1524.ps.Z, 19950705 EFFICIENT DYNAMIC NETWORK FLOW ALGORITHMS A Dissertation 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 Bruce Edward Hoppe August 1995 c Bruce Edward Hoppe 1995 ALL RIGHTS RESERVED EFFICIENT
	ftp://ftp.cs.cornell.edu//pub/smart/z3950.ranked/RQspec.July6.ps, 19950707 Type 102 Ranked List Query Preliminary Specification June 21, 1995 1 Preface: Potential Usage & Users of Ranked List Query The Type 102 Ranked List Query (RLQ) was originally intended as a natural language query. Because of the vast number of natural language searching methodologies being used today it
	ftp://ftp.cs.cornell.edu//pub/dissolve/pamidlfinal.ps, 19950710 Feature-Based Algorithms for Detecting and Classifying Scene Breaks Ramin Zabih Justin Miller Kevin Mai Computer Science Department Cornell University Ithaca, NY 14853
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR95-1525.ps.Z, 19950711 A SUBSPACE, INTERIOR, AND CONJUGATE GRADIENT METHOD FOR LARGE-SCALE BOUND-CONSTRAINED MINIMIZATION PROBLEMS MARY ANN BRANCHy , THOMAS F. COLEMANz AND YUYING LIy
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR95-1526.ps.Z, 19950711 GEOMETRIC BICRITERIA OPTIMAL PATH PROBLEMS A Dissertation 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 Christine Diane Piatko August 1993 c Christine Diane Piatko 1993 ALL RIGHTS RESERVED
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR95-1511.ps.Z, 19950717 Faster Possibility Detection by Combining Two Approaches Scott D. Stoller and Fred B. Schneider Dept. of Computer Science, Cornell University, Ithaca, NY 14853, USA. stoller@cs.cornell.edu, fbs@cs.cornell.edu
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR95-1527.ps.Z, 19950717 Packing Messages as a Tool for Boosting the Performance of Total Ordering Protocols Roy Friedman Robbert van Renesse Department of Computer Science Cornell University Ithaca, NY 14853. July 7, 1995
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR94-1420.ps, 19950717 Lower Bounds for Fully Dynamic Connectivity Problems in Graphs Michael L. Fredman Monika Rauch Henzinger y
	ftp://ftp.cs.cornell.edu//pub/TECH-RPT/TR95-1528.ps.Z, 19950717 Exploring Query Expansion Strategies for MEDLINE Padmini Srinivasan Department of Computer Science Cornell University, Ithaca, NY 14853 June 22, 1995
	ftp://ftp.cs.cornell.edu//pub/maffeis/vanilla/vanilla.ps.gz, 19950720 Design and Implementation of a Configurable Mixed-Media Filesystem Extended Abstract Silvano Maffeis Computer Science Department, University of Zurich, Switzerland maffeis@ifi.unizh.ch IFI TR 94:03 June 1993
	ftp://ftp.cs.cornell.edu//pub/isis/horus/arpa/www-quad.95.ps, 19950728 Kenneth P. Birman Robust Distributed Computing Systems HORUSThe challenge: * Provide tools for building robust distributed software * Support a plug-and-play view of security, fault-tolerance, other guarantees and properties * Offer through flexible interfaces Technology base is needed for * Critical
	ftp://ftp.cs.cornell.edu//pub/rz/techsum.ps, 19950728 Collaborative Mathematics Environments Paul Chew, Robert L. Constable, Keshav Pingali, Steve Vavasis, Richard Zippel December 17, 1994 Computational science will be the dominant paradigm for science in the next century. This proposal addresses one of the major challenges facing this new kind of science
	ftp://ftp.cs.cornell.edu//pub/rus/jetai95/paperieee.ps, 19950801 Minimalism + Distribution = Supermodularity Bruce Donald Jim Jennings Department of Computer Science Department of Computer Science Cornell University Tulane University Ithaca, NY 14853 New Orleans, LA 70118 Daniela Rus Department of Computer Science Dartmouth College Hanover, NH 03755 August 1, 1995
	ftp://ftp.cs.cornell.edu//pub/rus/agents/proposal.ps, 19950805 Autonomous Information Agents: Intelligent, Extensible, and Adaptable Tactical Picture Agents Daniela Rus1 George Cybenko2 David Kotz3 Dartmouth College ALPHATECH Corporation August 4, 1995 This proposal is submitted pursuant to the ONR Guide to Programs, Broad Agency Announcement for Tactical Picture
	ftp://ftp.cs.cornell.edu//pub/chandra/podc96.ps.Z, 19950807 CALL FOR PAPERS Fifteenth ACM Symposium on Principles of Distributed Computing (PODC) Participating in the 1996 Federated Computing Research Conference (FCRC'96) Philadelphia, PA, USA May 23{26, 1996 SCOPE AND FORMAT: Research contributions to the theory, design, specification or implementation of
	ftp://ftp.cs.cornell.edu//pub/chandra/fda.ps, 19950820 Unreliable Failure Detectors for Reliable Distributed Systems Tushar Deepak Chandra Sam Toueg Department of Computer Science Cornell University Ithaca, New York 14853 tushar@watson.ibm.com, sam@cs.cornell.edu
	ftp://ftp.cs.cornell.edu//pub/mhr/papers/average.ps.gz, 19950823 Average Case Analysis of Dynamic Graph Algorithms David Alberts Monika Rauch Henzingery
	ftp://ftp.cs.cornell.edu//pub/mhr/papers/2-vertex2.ps.gz, 19950823 Improved Data Structures for Fully Dynamic Biconnectivity An extended abstract appeared in Proceedings of STOC 94 Monika Rauch
	ftp://ftp.cs.cornell.edu//pub/mhr/papers/cycle.ps.gz, 19950823 Fully Dynamic Cycle-Equivalence in Graphs to appear in Proceedings of FOCS 94 Monika Rauch Henzinger Department of Computer Science Cornell University Ithaca, NY 14853
	ftp://ftp.cs.cornell.edu//pub/mhr/papers/2-vertex1.ps.gz, 19950823 Fully Dynamic Biconnectivity in Graphs To appear in Algorithmica M. R. Henzinger
	ftp://ftp.cs.cornell.edu//pub/mhr/papers/2-edge.ps.gz, 19950823 Data Structures for Two-Edge Connectivity in Planar Graphs John Hershberger DEC Systems Research Center Monika Rauch Princeton University Subhash Suri Bell Communications Research
	ftp://ftp.cs.cornell.edu//pub/mhr/papers/soda.ps.gz, 19950823 Average Case Analysis of Dynamic Graph Algorithms David Alberts Monika Rauch Henzingery
	ftp://ftp.cs.cornell.edu//pub/mhr/papers/connectivity.ps.gz, 19950823 Randomized Fully Dynamic Graph Algorithms with Polylogarithmic Time per Operation Monika Rauch Henzinger Valerie King y
	ftp://ftp.cs.cornell.edu//pub/mhr/papers/shortest-path.ps.gz, 19950823 Faster shortest-path algorithms for planar graphs to appear in Proceedings of STOC 94 Philip Klein Brown University Satish Rao NEC Research Institute Monika Rauchy Cornell University Sairam Subramanian Brown University
	ftp://ftp.cs.cornell.edu//pub/mhr/papers/certificates.ps.gz, 19950823 Certificates and Fast Algorithms for Biconnectivity in Fully-Dynamic Graphs Monika R. Henzinger1 and Han La Poutr e2 1 Department of Computer Science, Cornell University, Ithaca, NY 14853, USA. 2 Department of Computer Science, Utrecht University, Utrecht, The Netherlands.
	ftp://ftp.cs.cornell.edu//pub/mhr/papers/verification.ps.gz, 19950823 VERIFICATION AND SENSITIVITY ANALYSIS OF MINIMUM SPANNING TREES IN LINEAR TIME1 BRANDON DIXON1;2, MONIKA RAUCH1;3 AND ROBERT E. TARJAN1;4
	ftp://ftp.cs.cornell.edu//pub/mhr/papers/planarity-testing.ps.gz, 19950823 Fully Dynamic Planarity Testing in Planar Embedded Graphs Giuseppe F. Italianoy Johannes A. La Poutr ez Monika H. Rauchx
	ftp://ftp.cs.cornell.edu//pub/rz/BAA95-37-white.ps, 19950824 2 Summary of Proposal A Innovative Claims The key to successful collaborative design is accurately communicating specifications and functionality. The simplest description, or specification of an artifact is a textual one. However, graphical images of an artifact are better than textual descriptions,
	ftp://ftp.cs.cornell.edu//pub/rosu/tr.ps, 19950827 Processor Controlled Off-Processor I/O Marcel-C>=at>=alin Ro su rosu@cs.cornell.edu Computer Science Department Upson Hall Cornell University Ithaca, New York 14853-7501 August 27, 1995
	ftp://ftp.cs.cornell.edu//pub/sam/gms-specification.ps.gz, 19950828 On the Formal Specification of Group Membership Services Emmanuelle Anceaumey Bernadette Charron-Bostz Pascale Minetx Sam Toueg{
	ftp://ftp.cs.cornell.edu//pub/sam/failure.detectors.weakest.ps.gz, 19950828 The Weakest Failure Detector for Solving Consensus Tushar Deepak Chandrayx Vassos Hadzilacosz Sam Touegx May 9, 1994
	ftp://ftp.cs.cornell.edu//pub/bsmith/Tcl_book.ps.Z, 19950830 A% dp_address info $a 128.84.154.8 0 {alvin.cs.cornell.edu fw.cs.cornell.edu alvin.cs alvin fw.cs fw} The return value shows that the IP address of fw.cs.cornell.edu is 128.84.154.8, and that it is known by a variety of names, including alvin, alvin.cs, and fw.cs.cornell.edu. The dp_address command can
	ftp://ftp.cs.cornell.edu//pub/tah/Slides/reactortemperature.ps, 19950901 Safety Property Nuclear Reactor Rod 2 Rod 1 Reactor Robot arms Three Assumptions: Whenever the temperature reaches U , one of the rods can be put in. The temperature decreases at rate x 10 56 or x 10 60, depending on which rod is used. 1. The temperature x rises at rate x 10 + 50 if both dampening rods
	ftp://ftp.cs.cornell.edu//pub/tah/Slides/railroadcrossing.ps, 19950901 Number ofNumber of transitionslocations Train Gate When the train is within 10 meters to the gate, 36 90 the gate is always fully closed. Train Gate Controller Railroad Crossing : Train, Controller, and Gate CPU time 0.2 sec. Controller x :=
	ftp://ftp.cs.cornell.edu//pub/yanhong/Cachet-KBSE95.ps.Z, 19950901 CACHET: An interactive, incremental-attribution-based program transformation system for deriving incremental programs Yanhong A. Liu Department of Computer Science, Cornell University, Ithaca, NY 14853
	ftp://ftp.cs.cornell.edu//pub/tah/611/handout0.ps, 19950901 CS 611 Advanced Programming Languages Handout Fall 1995 Tom Henzinger September 1 Course Information Instructor: Tom Henzinger, Upson 4105C, 255-3009, tah@cs.cornell.edu. Office hours: after class, and by appointment. Teaching assistant: Neal Glew, Upson 5162, 255-7421, glew@cs.cornell.edu. Office
	ftp://ftp.cs.cornell.edu//pub/tah/Slides/fischerprotocol.ps, 19950901 repeat forever repeat until bdelay await Critical section Fischer's Mutual Exclusion Protocol Number ofNumber of transitionslocations16 81 Mutual exclusion (two processes are never CPU time in the critical section at the same time). 3.8 sec. k := i; k := k = i k = 1 <= _y <= 1110 P2 1 <= _y <= 1110 y <=
	ftp://ftp.cs.cornell.edu//pub/tah/Slides/watertank.ps, 19950901 Water-Level Monitor Verified Property Number ofNumber of transitionslocations The water level is always between 1 and 12 meters. 4 4 CPU time valve valve closed valve open : clock: water level water tank 0.2 sec. x := y = 1 x = 2 x = 2 x := _x = 1 _y = 1 _y = 1 y <= 10 x <= 2 _x = 1 _y = 2 x <= 2 _y = 2
	ftp://ftp.cs.cornell.edu//pub/tah/Conferences/Hybrid95/call.ps, 19950902 Call For Papers Workshop on Verification and Control of Hybrid Systems Sponsored by DIMACS and SYCON October 22{25, 1995 New Brunswick, New Jersey The fifth of a series of workshops on hybrid systems will be organized at Rutgers University in New Brunswick, New Jersey, from October 22 to October 25,
	ftp://ftp.cs.cornell.edu//pub/tah/611/homework0.ps, 19950906 CS 611 Advanced Programming Languages Homework Fall 1995 Tom Henzinger Due September 13 Problem 0. The set Bin of binary-number expressions is defined inductively by the grammar b ::= j 1 j b0 j b1 Define a denotational semantics ] : Bin ! N so that every binary-number expression denotes a natural
	ftp://ftp.cs.cornell.edu//pub/bsmith/query-by-hum.ps.Z, 19950910 Query By Humming Musical Information Retrieval in An Audio Database Asif Ghias Jonathan Logan David Chamberlin Brian C. Smith Cornell University fghias,bsmithg@cs.cornell.edu, logan@ghs.com, chamber@engr.sgi.com
	ftp://ftp.cs.cornell.edu//pub/tah/611/notes9-6.ps, 19950911 CS 611 Advanced Programming Languages Handout 3 Fall 1995 Tom Henzinger September 6 Scribe: David Walker 1 Partial correctness of OS wrt DS Before proving the partial correctness of OS wrt DS, we need the following lemmas: Lemma 1: (8a0; a1; n0; n1 : a0 ! n0 and a1 ! n1 ) a0 + a1 ! n0 + n1) Lemma 2:
	ftp://ftp.cs.cornell.edu//pub/tah/611/notes9-4.ps, 19950911 CS 611 Advanced Programming Languages Handout 1 Fall 1995 Tom Henzinger September 4 Scribe: Yi-Cheng Huang Outline ffl Administrativa ffl Arithmetic Expressions (cont.) ffl Denotational Semantics (DS) of Arithmetic Expressions ffl Operational Semantics (OS) of Arithmetic Expressions 1 Administrativa ffl
	ftp://ftp.cs.cornell.edu//pub/tah/611/notes9-1.ps, 19950911 CS 611 Advanced Programming Languages Lecture Fall 1995 Tom Henzinger September 1 Scribe: Lynette I. Millett Outline ffl Announcements & Administrivia ffl Example programs in IMP ffl Syntax vs. Semantics ffl Arithmetic Expressions: Three different semantic viewpoints 1 Announcements & Administrivia
	ftp://ftp.cs.cornell.edu//pub/tah/611/notes9-8.ps, 19950913 CS 611 Advanced Programming Languages Lecture 4 Fall 1995 Tom Henzinger 09/08/95 Scribe: Vera Kettnaker 1 On Proof Techniques 1.1 General Rule Induction Scheme We have encountered three types of induction: 1. on natural numbers (eg. length of computations) 2. on expressions (structural induction) 3. on
	ftp://ftp.cs.cornell.edu//pub/tah/611/handout1.ps, 19950913 CS 611 Advanced Programming Languages Handout 1 Fall 1995 Tom Henzinger 13 September SML on CUCS SML is one variant of a family of languages called ML, which stands for Meta-Language. ML was originally invented by Robin Milner as part of a theorem proving system called LCF (Logic for Computable
	ftp://ftp.cs.cornell.edu//pub/tah/611/homework1.ps, 19950913 CS 611 Advanced Programming Languages Homework 1 Fall 1995 Tom Henzinger Due September 22 Problem 0. The set Nexp of nondeterministic arithmetic expressions is defined inductively by the grammar a ::= n j a0 + a1 j a0 a1 j a0 or a1 for n 2 N. The natural semantics + Nexp N is defined by the rules n + n
	ftp://ftp.cs.cornell.edu//pub/tah/611/notes9-11.ps, 19950918 CS 611 Advanced Programming Languages Lecture 3 Fall 1995 Tom Henzinger September 11 Scribe: Steve Marschner Reduction Strategies in Aexp Leftmost reduction. In class, we have always dealt with just one reduction strategy, leftmost reduction, in which reduction of addition expressions is done by the
	ftp://ftp.cs.cornell.edu//pub/karl/TR95-1.ps, 19950928 Submitted to IEEE Int. Conf. on Robotics and Automation, Minneapolis, MN, April 1996.Submitted to IEEE Int. Conf. on Robotics and Automation, Minneapolis, MN, April 1995. Classification and Lower Bounds for MEMS Arrays and Vibratory Parts Feeders: What Programmable Vector Fields Can (and Cannot) Do \|
	ftp://ftp.cs.cornell.edu//pub/tah/611/notes9-18.ps, 19950928 CS 611 Advanced Programming Languages Lecture 8 Fall 1995 Tom Henzinger 09/18/95 Scribe: Marcos Kawazoe Aguilera When defining the denotational semantics for the IMP language, we had a problem because we had to include a while in its own definition. We now present some concepts that clarify things. We
	ftp://ftp.cs.cornell.edu//pub/tah/611/notes9-22.ps, 19950928 CS 611 Advanced Programming Languages Lecture 5 Fall 1995 Tom Henzinger 09/22/95 Scribe: Frederick Smith 1 On Fixpoints 1.1 Definitions Definition 1 A set D and a relation <= is a preorder if <= is reflexive and transitive. Definition 2 A set D and a relation <= is a partial order if it is a preorder
	ftp://ftp.cs.cornell.edu//pub/tah/611/notes9-13.ps, 19950928 CS 611 Advanced Programming Languages Lecture 6 Fall 1995 Tom Henzinger 09/13/95 Scribe: Anonymous Friday: Introduction to ML IMP (continued) 1 Operational semantics of IMP Advantages: ffl provides an interpreter (see homework) ffl permits formal reasoning about programs (e.g., c0 ' c1 , (8oe; oe0 2 S
	ftp://ftp.cs.cornell.edu//pub/karl/TR95-2.ps, 19950928 Submitted to IEEE Int. Conf. on Robotics and Automation, Minneapolis, MN, April 1996.Submitted to IEEE Int. Conf. on Robotics and Automation, Minneapolis, MN, April 1995. New and Improved Manipulation Algorithms for MEMS Arrays and Vibratory Parts Feeders: What Programmable Vector Fields Can (and
	ftp://ftp.cs.cornell.edu//pub/tah/611/homework2.ps, 19950928 CS 611 Advanced Programming Languages Homework 2 Fall 1995 Tom Henzinger Due October 2 Problem 0. Let 1 be the partial order (ffflg; f(ffl; ffl)g). Draw the Hasse diagrams for the partial orders 1, 1 , 1 + 1, (1 + 1) , 1 1 , (1 ) , and (1 ) 1 . Which of these partial orders are lattices c.p.o.s domains
	ftp://ftp.cs.cornell.edu//pub/tah/611/notes9-20.ps, 19950928 CS 611 Advanced Programming Languages Lecture 9 Fall 1995 Tom Henzinger September 20 Scribe: David Greenberger Homework The assignment was graded out of ten points. Problem was worth one point. Problem 1 was worth four points: one for the definition (as given in lecture 3 or otherwise correct), one for
	ftp://ftp.cs.cornell.edu//pub/tah/611/notes9-27.ps, 19951004 CS 611 Advanced Programming Languages Lecture 11 Fall 1995 Tom Henzinger September 27 Scribe: Xavier Boyen Semantics of while loop (cont'd) Function denoted by ]: f(oe) = if ]oe = F then oe else if ]oe defined then f (]oe) else undefined or, using the lambda notation: f =
	ftp://ftp.cs.cornell.edu//pub/tah/611/solutions0.ps, 19951004 CS 611 Advanced Programming Languages Handout Fall 1995 Tom Henzinger 14 September Problem 0. ] = ] = 1 ] = 2] ] = 2] + 1 Problem 1. ffl n ! n a0 ! n0 a1 ! n1 a0+"a1 ! n0 + n1 a0 ! n0 a1 ! n1 a0 "a1 ! n0n1 ffl 5 ! 5 1 ! 1 2 ! 2 3 ! 3 5 + 1 ! 6 2 + 3 ! 5 3 ! 3 (5 + 1) (2 + 3)
	ftp://ftp.cs.cornell.edu//pub/tah/611/notes9-29.ps, 19951004 CS 611 Advanced Programming Languages Lecture 13 Fall 1995 Tom Henzinger 09/29/95 Scribe: Nick Howe 1 Meta-Lambda Notation Defines Only Continuous Functions We wish to define a notation for future use that will only allow us to write down continuous functions between c.p.o.'s. We call our new notation
	ftp://ftp.cs.cornell.edu//pub/tah/611/notes10-2.ps, 19951004 CS 611 Advanced Programming Languages Lecture 7 Fall 1995 Tom Henzinger 10/02/95 Scribe: Dan Brown 1 Administrative Midterm will be Wednesday, October 18, in class (50 minutes). 2 Meta-lambda notation defines only continuous functions 2.1 Functions x 2 D; y 2 E ` e 2 F x 2 D ` (>=y:e) 2 ffl
	ftp://ftp.cs.cornell.edu//pub/tah/611/solutions1.ps, 19951004 CS 611 Advanced Programming Languages Solutions 1 Fall 1995 Tom Henzinger 27 September Problem 0. (((3 or 7) + 2) or 2) + n iff n 2 f2; 5; 9g. Rules Deterministic Confluent Terminating Partially Correct Alice Yes Yes Yes No Bob No No Yes Yes Carol No No Yes Yes Number the rules in the order they appear
	ftp://ftp.cs.cornell.edu//pub/tah/611/notes9-25.ps, 19951004 CS 611 Advanced Programming Languages Lecture 6 Fall 1995 Tom Henzinger September 25 Scribe: Amanda M. Holland-Minkley 1 Semantics of a while loop In our language IMP we have defined the command while b do c od with two different types of semantics. They are: ffl natural semantics: a set of reductions
	ftp://ftp.cs.cornell.edu//pub/tah/Conferences/Hybrid95/program.ps, 19951005 Workshop on Verification and Control of Hybrid Systems Sponsored by DIMACS and SYCON October 22{25, 1995, New Brunswick, New Jersey Organizers: R. Alur, T.A. Henzinger, E. Sontag Sunday, October 22 Invited Lecture I (Chair: P. Varaiya) 8.30{9.30 J. Lygeros, D.N. Godbole, S.S. Sastry. A game theoretic
	ftp://ftp.cs.cornell.edu//pub/sabel/thesis.ps, 19951006 APPROXIMATING PERFECT FAILURE DETECTORS IN ASYNCHRONOUS DISTRIBUTED SYSTEMS A Dissertation 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 Laura Susanne Sabel January 1996 c Laura Susanne Sabel
	ftp://ftp.cs.cornell.edu//pub/dissolve/mm95.ps, 19951014 A Feature-Based Algorithm for Detecting and Classifying Scene Breaks Ramin Zabih Justin Miller Kevin Mai Computer Science Department Cornell University Ithaca, NY 14853 frdz,jmiller,kmaig@cs.cornell.edu 607-255-8413
	ftp://ftp.cs.cornell.edu//pub/tah/611/notes10-6.ps, 19951016 CS 611 Advanced Programming Languages Lecture 15 Fall 1995 Tom Henzinger 10/06/95 Scribe: Olga Veksler 1 REC language 1.1 Syntax Recall the syntax for REC: p ::= t where d t ::= x j j t + 1 j t 1 j if t = then t1 else t2 j fi(t1; : : : ; tki) d ::= f1(x1; : : : ; xk1) = d1 fm(x1; : : : ; xkm) = dm Where
	ftp://ftp.cs.cornell.edu//pub/tah/611/notes10-4.ps, 19951016 CS 611 Advanced Programming Languages Lecture 5 Fall 1995 Tom Henzinger 10/04/95 Scribe: Asif Ghias In-class midterm on Oct. 18 1 On Fixpoints Let construct contd. Let x ( e:f vs applyh>=x:f; ei 2 F1 Let: ` e 2 E x 2 E ` f 2 F ` (let x ( e:f) 2 F If e is undefined then the whole let returns undefined.
	ftp://ftp.cs.cornell.edu//pub/tah/611/homework3.ps, 19951016 CS 611 Advanced Programming Languages Homework 3 Fall 1995 Tom Henzinger Due October 16 Problem 0. Suppose you are given three base types, the singleton 1, the natural numbers N, and the finite lists of natural numbers N , and the following constants: ; 1; 2; : : : 2 N, inc 2 (increment a
	ftp://ftp.cs.cornell.edu//pub/tah/611/homework4.ps, 19951016 CS 611 Advanced Programming Languages Homework 4 Fall 1995 Tom Henzinger Due November 3 Problem 0. We are given the strict Meta-Lambda constants +1; 1 2 and =; >= 2 (remember that if any argument of a strict function is , then the result is ). Consider the continuous function h 2
	ftp://ftp.cs.cornell.edu//pub/tah/611/solutions2.ps, 19951016 CS 611 Advanced Programming Languages Solutions 2 Fall 1995 Tom Henzinger 2 October Problem 0. Hasse Diagrams (Courtesy of Brian Willem) 1 r 1 r r 1 + 1 r r (1 + 1) r r r 1 1 r r r r (1 ) r r r (1 ) 1 r r r r r r
	ftp://ftp.cs.cornell.edu//pub/tah/611/handout2.ps, 19951017 CS 611 Advanced Programming Languages Handout 2 Fall 1995 Tom Henzinger October 2 Meta-Lambda Meta-Lambda Expressions Meta-Lambda is a notation for building complex functions from simple functions (see Section 8.4 of Winskel). The Meta-Lambda expressions are defined by the grammar e ::= x j c j he1; e2i
	ftp://ftp.cs.cornell.edu//pub/pidgin/TyphoonCompiler/papers-ps/gcd.ps, 19951018 GENERALIZED DOMINANCE and CONTROL DEPENDENCE Gianfranco Bilardi Keshav Pingali Dipartimento di Elettronica ed Informatica, Department of Computer Science Universit a di Padova, Padova, Italy. Cornell University, Ithaca, NY 14853. Correspondence: E-mail: pingali@cs.cornell.edu; Phone: 607-255-7203
	ftp://ftp.cs.cornell.edu//pub/yanhong/Dai-POPL96.ps.Z, 19951021 Discovering Auxiliary Information for Incremental Computation Yanhong A. Liu Scott D. Stollery Tim Teitelbaum Department of Computer Science, Cornell University, Ithaca, New York 14853 fyanhong,stoller,ttg@cs.cornell.edu
	ftp://ftp.cs.cornell.edu//pub/techrpt/tests/TR-ftp1.ps, 19951022 Good quote from Nancy Chodorow Jim Davis October 22, 1995 When people have extreme needs for emotional support, and a few very intense relationships (whose sole basis is emotional connection, ungrounded in cooperative activity or institutionalized non-emotional roles) to provide for these needs, these
	ftp://ftp.cs.cornell.edu//pub/techrpt/tests/TR-ftp2.ps.Z, 19951022 A Connoisseur's Guide to Fine Chocolate Lindt chocolate company October 22, 1995 Apart from its umblemished, silky sheen, it is hardly possible, even for the expert, to detect with the naked eye differences in quality between one chocolate and another. We invite you to break off a piece of Lindt
	ftp://ftp.cs.cornell.edu//pub/techrpt/tests/lite1/TR-lite1.ps, 19951022 Evil music Anonymous October 22, 1995 African and hot-blooded, crazy with life ... restless, unbeautiful, passionate ... he exorcises the wicked devils from our bodies and he does it with , which are the modern exorcism ... capturing our senses in a sweet trance. Typically African is the way
	ftp://ftp.cs.cornell.edu//pub/vavasis/papers/asp9.ps.Z, 19951023 An aspect ratio bound for triangulating a d-grid cut by a hyperplane Scott A. Mitchell Stephen A. Vavasisy August 14, 1995
	ftp://ftp.cs.cornell.edu//pub/simlab/tech-reports/TR94-1406.ps, 19951023 Chain Models and Finite Element Analysis: An Executable Chains Formulation of Plane Stress Richard S. Palmer Department of Computer Science Cornell University Ithaca, NY 14853 rick@cs.cornell.edu January 12, 1994
	ftp://ftp.cs.cornell.edu//pub/simlab/tech-reports/TR92-1246.ps, 19951023 SimLab: Automatically Creating Physical Systems Simulators Richard S. Palmer James F. Cremer Cornell University
	ftp://ftp.cs.cornell.edu//pub/simlab/tech-reports/TR93-1375.ps, 19951023 Chain Models of Physical Behavior for Engineering Analysis and Design Richard S. Palmer Department of Computer Science Cornell University Ithaca, NY 14053 rick@cs.cornell.edu Vadim Shapiro Analytic Process Department General Motors R & D Center Warren, MI 48090-9055 shapiro@gmr.com August 11, 1993
	ftp://ftp.cs.cornell.edu//pub/simlab/tech-reports/imacs94.ps, 19951023 Physical Elements: Using chains and cell complexes to solve multiple domain PDE problems Richard S. Palmer Department of Computer Science Cornell University Ithaca, NY 14853 rick@cs.cornell.edu Palghat S. Ramesh Xerox Corp., Design Research Institute Cornell University Ithaca, NY 14853
	ftp://ftp.cs.cornell.edu//pub/simlab/tech-reports/ASME-WAM92.ps, 19951023 SimLab: Automatically Creating Physical Systems Simulators Richard S. Palmer Computer Science Department Cornell University Email: rick@cs.cornell.edu James F. Cremer Computer Science Department University of Iowa Email: cremer@cs.uiowa.edu
	ftp://ftp.cs.cornell.edu//pub/karl/ISER95/VeryOld/ISER95.ps, 19951023 Proc. of the Forth International Symposium on Experimental Robotics (ISER), Stanford, CA, June 1995. Distributed Robotic Manipulation: Experiments in Minimalism Karl B ohringer, Russell Brown, Bruce Donald, Jim Jennings Cornell University Ithaca, NY 14853, USA brd@cs.cornell.edu Daniela Rus Dartmouth
	ftp://ftp.cs.cornell.edu//pub/techrpt/tests/lite1/TR-lite2.ps.Z, 19951023 Gender Politics Francesca M Cancia October 23, 1995 "Women's responsibility for love and their overt dependence can also leave both partners feeling controlled by the other. Insofar as love is defined as the woman's `turf', an area where she sets the rules and expectations, a
	ftp://ftp.cs.cornell.edu//pub/karl/MEMS96-abstract.ps, 19951105 Submitted to IEEE MEMS, San Diego, CA, February 1996. Single-Crystal Silicon Actuator Arrays for Micro Manipulation Tasks Karl-Friedrich B ohringer, Bruce Randall Donald Noel C. MacDonald Robotics & Vision Laboratory School of Electrical Engineering and Department of Computer Science The National
	ftp://ftp.cs.cornell.edu//pub/karl/IMECE95.ps, 19951109 Proc. ASME Int. Mech. Eng. Congress and Exposition (IMECE'95), San Francisco, CA, Nov. 1995. DESIGN, FABRICATION, AND CHARACTERIZATION OF SINGLE CRYSTAL SILICON LATCHING SNAP FASTENERS FOR MICRO ASSEMBLY Rama Prasad Karl-Friedrich B ohringer Noel C. MacDonald Sibley School of Mechanical Robotics &
	ftp://ftp.cs.cornell.edu//pub/tah/611/notes10-20.ps, 19951115 CS 611 Advanced Programming Languages Lecture 20 Fall 1995 Tom Henzinger October 20 Scribe: Xiaoming Liu 1 Recall We have two kinds of notions so far: ffl validity j= fAgcfBg is a valid Hoare triple i.e. 8oe 2 ; I 2 I; if oe j=I A and c terminates; then ]oe j=I B ffl provability ` fAgcfBg is a
	ftp://ftp.cs.cornell.edu//pub/tah/611/homework7.ps, 19951115 CS 611 Advanced Programming Languages Homework 7 Fall 1995 Tom Henzinger Due 17 November Problem 0. (SML Fragment Type Inference) This question involves inferring types for a simple fragment of SML. The language has terms and types given by this grammar: t ::= v j n j t1 t2 j >=v : T:t T ::= nat j T1 !
	ftp://ftp.cs.cornell.edu//pub/tah/611/notes11-8.ps, 19951115 CS 611 Advanced Programming Languages Lecture 28 Fall 1995 Tom Henzinger November 8 Scribe: Li-dong Zhou 1 Course Outline What we have covered till now: 1. Semantics ffl Operational Semantics: Two flavors: { natural semantics { stepwise semantics ffl Denotational Semantics ffl Axiomatic Semantics 2.
	ftp://ftp.cs.cornell.edu//pub/tah/611/notes10-13.ps, 19951115 CS 611 Advanced Programming Languages Lecture 18 Fall 1995 Tom Henzinger 10/13/95 Scribe: Dan Klein 1 Overview of Semantics for IMP So far we have two semantics for IMP: ffl Operational Semantics: hc; oei ! oe0 ffl Denotational Semantics: ]oe = oe0 We now will examine: ffl Axiomatic Semantics:
	ftp://ftp.cs.cornell.edu//pub/tah/611/notes10-23.ps, 19951115 CS 611 Advanced Programming Languages Lecture Fall 1995 Tom Henzinger 23 October Scribe: Reed Solomon 1 Administrative This is the first in a series of lectures by Professor David Gries. He will cover the majority of Parts 2 and 3 of Gries, The Science of Programming. 2 Weakest Precondition 2.1
	ftp://ftp.cs.cornell.edu//pub/yanhong/talk-Cachet-KBSE95.ps.Z, 19951118 CACHET: A system for deriving incremental programs Why What How Y. Annie Liu Department of Computer Science Cornell University November 1995 1 Incremental Programs f is an incremental version of f under if f computes f(x y) efficiently by making use of f(x). Examples: ffl f is sort, x is a list of
	ftp://ftp.cs.cornell.edu//pub/tah/611/notes11-10.ps, 19951121 CS 611 Advanced Programming Languages Lecture 27 Fall 1995 Tom Henzinger November 10 Scribe: David Greenberger Administrivia Homework 7, due November 17, was handed out. Both of Prof. Gries's homework assignments (5 and 6) were returned, along with solution sets. Homework 5 was graded fairly leniently,
	ftp://ftp.cs.cornell.edu//pub/tah/611/notes11-15.ps, 19951121 CS 611 Advanced Programming Languages Lecture Fall 1995 Tom Henzinger 11/15/95 Scribe: Nick Howe 1 Review of Proving Properties of Programs We began with a review of the various techniques for proving properties of programs. Today we wrapped up the details of these techniques. 1.1 REC In REC, we have a
	ftp://ftp.cs.cornell.edu//pub/tah/611/notes10-16.ps, 19951121 CS 611 Advanced Programming Languages Lecture Fall 1995 Tom Henzinger 10/16/95 Scribe: Alan Kwan 1 Administrative Midterm will be Wednesday, October 18, in class (50 minutes). The mid-term covers Chapters 1-5 and 8-9 of the text. The mid-term will be open book. 2 Proof Derivation and Proof Outline 2.1
	ftp://ftp.cs.cornell.edu//pub/tah/611/notes11-13.ps, 19951121 CS 611 Advanced Programming Languages Lecture 30 Fall 1995 Tom Henzinger 11/13/95 Scribe: Frederick Smith 1 Proving Properties of Programs In general the following properties of programs are of interest: ffl Partial Correctness: The program meets the specification for all the inputs that it terminates
	ftp://ftp.cs.cornell.edu//pub/tah/611/solutions4.ps, 19951122 CS 611 Advanced Programming Languages Solutions 4 Fall 1995 Tom Henzinger 3 November Problem 0. (1 point) is not, counterexample (1)( ) = 2 <> = h(1)( ); is not, counterexample (0)(1) = 1 <> = h(0)(1); is not, counterexample (0)(1) = <> = h(0)(1). The least fixed point is:
	ftp://ftp.cs.cornell.edu//pub/tah/611/homework8.ps, 19951122 CS 611 Advanced Programming Languages Homework 8 Fall 1995 Tom Henzinger Due December 1 Problem 0. We extend IMP with the subtraction function on numbers, finite lists of numbers, and five list functions: nil returns the empty list; null(a) returns true if the list a is empty, and false otherwise;
	ftp://ftp.cs.cornell.edu//pub/bsmith/nossdav.ps.gz, 19951127
	ftp://ftp.cs.cornell.edu//pub/tah/611/notes11-22.ps, 19951127 CS 611 Advanced Programming Languages Lecture Fall 1995 Tom Henzinger 11/22/95 Scribe: David Walker 1 Adequacy Definition: Adequacy The denotational semantics are adequate with respect to the operational semantics iff for all closed terms t, 1. t!c ) = 2. + ) t # where ffl + ,
	ftp://ftp.cs.cornell.edu//pub/tah/611/notes11-20.ps, 19951128 CS 611 Advanced Programming Languages Lecture 32 Fall 1995 Tom Henzinger 11/20/95 Scribe: Brian Willem 1 Natural Semantics of PCF continued 1.1 Properties of ! In the last lecture, a natural semantics for PCF was given. We showed that under ! any term t reduces to some canonical form c. Unlike REC, c is
	ftp://ftp.cs.cornell.edu//pub/tah/611/notes11-17.ps, 19951128 CS 611 Advanced Programming Languages Lecture 17 Fall 1995 Tom Henzinger 11/17/95 Scribe: Marcos Kawazoe Aguilera Programming Computable Functions \| PCF Syntax PCF is a typed language. Types in PCF are defined by: T ::= nat j bool j T1 T2 j T1 ! T2 Let V ar be a set of variables. Each variable x has a
	ftp://ftp.cs.cornell.edu//pub/coleman/TR95-1557.ps.Z, 19951201 Cornell Computer Science Technical Report TR 95-1557 The efficient computation of sparse Jacobian matrices using automatic differentiation Thomas F. Colemany Arun Vermaz December 1, 1995
	ftp://ftp.cs.cornell.edu//pub/yanhong/Thesis-TR95.ps.Z, 19951202 INCREMENTAL COMPUTATION: A SEMANTICS-BASED SYSTEMATIC TRANSFORMATIONAL APPROACH A Dissertation 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 Yanhong Annie Liu January 1996 c Yanhong Annie Liu
	ftp://ftp.cs.cornell.edu//pub/tah/611/notes11-29.ps, 19951205 CS 611 Advanced Programming Languages Lecture 35 Fall 1995 Tom Henzinger 11/29/95 Scribe: Nikolay Mateev 1 Administrative You can pick up Homework 9 at any time on December 5 and return it 48 hours later on December 7. 2 Logical Relations Adequacy theorem for PCF, Part 2: ] + ) t # A naive attempt
	ftp://ftp.cs.cornell.edu//pub/tah/611/solutions7.ps, 19951205 CS 611 Advanced Programming Languages Solutions 7 Fall 1995 Tom Henzinger 19 November Problem & 1. See attached output of the prepare script. Problem 2. ffl Natural deduction: ((p _ q) ) r) ^ p ` ((p _ q) ) r) ^ p ((p _ q) ) r) ^ p ` (p _ q) ) r ((p _ q) ) r) ^ p ` ((p _ q) ) r) ^ p ((p _ q) ) r) ^ p `
	ftp://ftp.cs.cornell.edu//pub/tah/611/handout3.ps, 19951205 CS 611 Advanced Programming Languages Handout 3 Fall 1995 Tom Henzinger 27 November Syntax p ::= t where d t ::= n j x j (t; t) j f(t) j if t = then t else t j P (t) d ::= hf(x) = ti Semantics The goal is to define a one-step" semantics, that evalutes only one function application at a time. To achieve
	ftp://ftp.cs.cornell.edu//pub/tah/611/notes12-1.ps, 19951205 CS 611 Advanced Programming Languages Lecture 36 Fall 1995 Tom Henzinger December 1 Scribe: Amanda Holland-Minkley 1 Eager vs. Lazy PCF So far, we have been considering a call-by-value, or eager, version of PCF. We would now like to look at a call-by-name, or lazy, version of PCF. The difference between
	ftp://ftp.cs.cornell.edu//pub/tah/611/midterm_solutions.ps, 19951205 CS 611 Advanced Programming Languages Midterm Fall 1995 Tom Henzinger October 18, 1995 Problem 0. (20 points) Consider the following REC declaration d of a recursive function: f(x) = if x = then else f(x 1) + 1 (a) Give a derivation of f(1) !d 1, using the natural call-by-name semantics for REC (for
	ftp://ftp.cs.cornell.edu//pub/tah/611/midterm.ps, 19951205 CS 611 Advanced Programming Languages Midterm Fall 1995 Tom Henzinger October 18, 1995 Problem 0. (20 points) Consider the following REC declaration d of a recursive function: f(x) = if x = then else f(x 1) + 1 (a) Give a derivation of f(1) !d 1, using the natural call-by-name semantics for REC. 1 !d 1
	ftp://ftp.cs.cornell.edu//pub/tah/611/solutions8.ps, 19951205 CS 611 Advanced Programming Languages Solutions 8 Fall 1995 Tom Henzinger 1 Decemeber Problem 0. The program is: fX = m ^ Y = ng s := nil; while :(X = ^ null(s)) do f Inv: ack(m; n) = ack(s1; ack(s2; : : : ; ack(sp; ack(X; Y )) : : : )) Bound: t = hs1; : : : ; sp; Xi Where: s = g if X =
	ftp://ftp.cs.cornell.edu//pub/tah/611/homework9.ps, 19951208 CS 611 Advanced Programming Languages Homework 9 Fall 1995 Tom Henzinger Due December 7 Problem 0. (20 points) We extend the programming language Rec with strict operations on natural numbers, such as multiplication and equality test. Consider the following Rec declaration of a recursive function: f(x;
	ftp://ftp.cs.cornell.edu//pub/tah/611/solutions9.ps, 19951208 CS 611 Advanced Programming Languages Solutions Final Fall 1995 Tom Henzinger 4 December Problem 0. (a). B B 1 2 1 3 2 1 4 3 2 1 1 C C A (b). Let oe be an arbitrary state. Define: P (g) = (>=m 2 N:>=n 2 N:if bm < nc then applyhg; oei else N = ]) P is inclusive because its the
	ftp://ftp.cs.cornell.edu//pub/vavasis/cs421/pracfin.ps.Z, 19951212 CS 421: Numerical Analysis Fall 1995 Practice Final Exam Handed out: Fri., Dec. 8. This exam has 15 questions and 140 points total. There were 140 minutes to complete all the questions. This exam was closed-book and closed-note, but students were allowed to consult a prepared sheet of notes (one page,
	ftp://ftp.cs.cornell.edu//pub/tah/611/notes12-6.ps, 19951212 CS 611 Advanced Programming Languages Lecture 39 Fall 1995 Tom Henzinger December 8 Scribe: Xiaoming Liu 1 Overview 1.1 semantics We have three kinds of semantics so far: ffl natural semantics ! ffl denotational semantics ] ffl reduction semantics 7 ! 1.2 languages Three languages vs. their values:
	ftp://ftp.cs.cornell.edu//pub/vavasis/cs421/ps6soln.ps.Z, 19951212 CS 421: Numerical Analysis Fall 1995 Problem Set 6 Solutions Handed out: Tues., Dec. 12. 1. Consider applying the forward Euler method with equally spaced points to the spring equation d2x=dt2 = kx (after converting it to a system of first order equations using the technique from lecture). Let u1; u2; :
	ftp://ftp.cs.cornell.edu//pub/ozan/division_short.ps, 19951217 DIVISION ________ C division_begin ******************** DIVISION *********************** D power_df Parens ::Prec(div):: ^== power{}(; ) M power_ml % Take n to the powr m % add_rec_def dn^me dif m
	ftp://ftp.cs.cornell.edu//pub/ozan/divArch.ps, 19951217 Non-restoring Division Algorithm Ozan Hafizogullari November 21,1995 Here I will try to follow the order of the paper on the square root algorithm, which I think, will faciliate communication. The final algorithm is: divideD(x0;divisor;r) == lastAdjust(iterateD(>=quad.updateD(quad);initD(x0;
	ftp://ftp.cs.cornell.edu//pub/ozan/division_long.ps, 19951217 SQRT_2 ______ C sqrt_2_begin ********* SQRT_1 ********** C vimp1 *******THE MAIN WORK************* D power_df Parens ::Prec(div):: ^== power{}(; ) M power_ml % Take n to the powr m % add_rec_def dn^me dif m
	ftp://ftp.cs.cornell.edu//pub/isis/horus/agreement.ps, 19951218 HORUS RESEARCH USER AGREEMENT This research license is entered into between CORNELL UNIVERSITY (LICENSOR) and (LICENSEE). Licensor grants to licensee a personal non-exclusive, non-assignable license to use the HORUS DISTRIBUTED COMPUTING SYSTEM (SOFTWARE) for the limited purpose of research. ffl
	ftp://ftp.cs.cornell.edu//pub/tah/611/notes12-4.ps, 19951218 CS 611 Advanced Programming Languages Lecture 37 Fall 1995 Tom Henzinger 12/4/95 Scribe: Yvonne Lo 1 Admiministrative Homework 9 can be picked up anytime on 12/5 and returned 48 hours later on 12/7. 2 (Simply) Typed >= -Calculus We have defined the following language L: ffl Types: T ::= o T1!T2 ffl
	ftp://ftp.cs.cornell.edu//pub/maffeis/electra/reliable_corba.ps.gz, 19951219 Building Reliable Distributed Systems with CORBA Sean Landis Isis Distributed Systems, Inc. Ithaca, NY 14850 scl@isis.com Silvano Maffeis Dept. of Computer Science Cornell University maffeis@acm.org
	ftp://ftp.cs.cornell.edu//pub/maffeis/electra/sigcomm.ps.gz, 19951219 An Interoperable Middleware Infrastructure Supporting Object-Group Communication (SIGCOMM Workshop Position Paper) Silvano Maffeis , Alexey Vaysburdy, and Sophia Georgiakaki Department of Computer Science Cornell University fmaffeis,alexey,spgg@cs.cornell.edu Keywords: Object-Oriented Distributed
	ftp://ftp.cs.cornell.edu//pub/maffeis/electra/electra_corba.ps.gz, 19951219 Adding Group Communication and Fault-Tolerance to CORBA y Silvano Maffeis maffeis@acm.org Department of Computer Science Cornell University, Ithaca, NY
	ftp://ftp.cs.cornell.edu//pub/maffeis/electra/abstract.ps.gz, 19951219 Electra: An Object Request Broker for Robust Distributed Systems Extended Abstract Silvano Maffeis University of Zurich Department of Computer Science Winterthurerstr. 190, 8057 Z urich phone: 01/ 257 43 27, fax: 01/ 363 00 35 e-mail: maffeis@ifi.unizh.ch Keywords: Object-Oriented Distributed
	ftp://ftp.cs.cornell.edu//pub/maffeis/electra/group_pattern.ps.gz, 19951219 Object Group an Object Behavioral Pattern for Fault-Tolerance and Group Communication in Distributed Systems Silvano Maffeis Dept. of Computer Science Cornell University maffeis@acm.org http://www.cs.cornell.edu/Info/People/maffeis Phone: 607-255-9222, Fax: 607-255-4428
	ftp://ftp.cs.cornell.edu//pub/maffeis/electra/oopsla95_poster.ps.gz, 19951219 1 Some Electra Highlights n Electra is a CORBA V.2 Object Request Broker (ORB) n Unlike most of the ORBs available today, dynamic object replication, object migration, multicast, and consistent failure detection are supported n Operations can be submitted synchronously, asynchronously, and
	ftp://ftp.cs.cornell.edu//pub/maffeis/electra/electra_thesis.ps.gz, 19951219 Run-Time Support for Object-Oriented Distributed Programming Dissertation der Wirtschaftswissenschaftlichen Fakult at der Universit at Z urich zur Erlangung der W urde eines Doktors der Wirtschaftswissenschaft vorgelegt von Silvano Maffeis von M annedorf ZH genehmigt auf Antrag von Prof. Dr. Lutz H.
	ftp://ftp.cs.cornell.edu//pub/nuprl/doc/book.ps.gz, 19951222 Implementing Mathematics with The Nuprl Proof Development System Draft of 18 October 1995 By the PRL Group: R. L. Constable S. F. Allen H. M. Bromley W. R. Cleaveland J. F. Cremer R. W. Harper D. J. Howe T. B. Knoblock N. P. Mendler P. Panangaden J. T. Sasaki S. F. Smith Computer Science Department
	ftp://ftp.cs.cornell.edu//pub/nuprl/doc/man.ps.gz, 19951222 The Nuprl Proof Development System, Version 4.1 Reference Manual and User's Guide Paul Jackson June 8, 1995 Contents 1 Introduction 6 1.1 Purpose : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 6 1.2 Conventions : : : : : : : : : : : : : : : : : : : : : : : : : : :
	ftp://ftp.cs.cornell.edu//pub/yanhong/ThesisAbs.ps, 19960110 INCREMENTAL COMPUTATION: A SEMANTICS-BASED SYSTEMATIC TRANSFORMATIONAL APPROACH Yanhong Annie Liu, Ph.D. Cornell University 1996 Incremental computation takes advantage of repeated computations on inputs that differ slightly from one another, computing each new output incrementally by making use of the
	ftp://ftp.cs.cornell.edu//pub/yanhong/ThesisIntro.ps, 19960110 INCREMENTAL COMPUTATION: A SEMANTICS-BASED SYSTEMATIC TRANSFORMATIONAL APPROACH A Dissertation 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 Yanhong Annie Liu January 1996 c Yanhong Annie Liu
	ftp://ftp.cs.cornell.edu//pub/clarko/iuw96a.ps.gz, 19960118 Recognition by Matching With Edge Location and Orientation Clark F. Olson and Daniel P. Huttenlocher Computer Science Department Cornell University Ithaca, NY 14853 clarko@cs.cornell.edu,dph@cs.cornell.edu David M. Doria Hughes Aircraft Company, Electro-Optical Systems El Segundo, CA 90245
	ftp://ftp.cs.cornell.edu//pub/vavasis/papers/crdt.ps.gz, 19960125 Numerical conformal mapping using cross-ratios and Delaunay triangulation Tobin A. Driscoll Stephen A. Vavasisy January 23, 1996
	ftp://ftp.cs.cornell.edu//pub/maffeis/cv.ps, 19960125 Curriculum Vitae name: Silvano Maffeis date of birth: 12=16=1965 place of birth: M annedorf, Switzerland nationality: Switzerland e-mail: maffeis@acm.org WWW: http://www.cs.cornell.edu/Info/People/maffeis Education 4=1973 - 3=1979 Primarschule, M annedorf, Switzerland 4=1979 - 3=1981 Sekundarschule, M
	ftp://ftp.cs.cornell.edu//pub/maffeis/gts/gts_overview.ps.gz, 19960126 A Generic Multicast Transport Service to Support Disconnected Operation y Silvano Maffeis maffeis@acm.org Walter Bischofberger bischi@ubilab.ubs.ch Kai-Uwe M atzel maetzel@ubilab.ubs.ch Department of Computer Science, Cornell University, and UBILAB, Union Bank of Switzerland
	ftp://ftp.cs.cornell.edu//pub/cs674/hwk1.ps, 19960129 CS674 Natural Language Understanding Spring 1995 Assignment 1 Due Wednesday, February 7 at the beginning of class 1. In English, it is sometimes necessary to preface a noun with an article (i.e., the, an, or a ); other times, no article is required. It's fine to say, I am in bed, for example, but you
	ftp://ftp.cs.cornell.edu//pub/karl/MEMS96.ps, 19960131 Proc. IEEE Workshop on Micro Electro Mechanical Structures (MEMS), San Diego, CA, February 1996. SINGLE-CRYSTAL SILICON ACTUATOR ARRAYS FOR MICRO MANIPULATION TASKS Karl-Friedrich B ohringer Bruce Randall Donald Noel C. MacDonald Robotics and Vision Laboratory School of Electrical Engineering and
	ftp://ftp.cs.cornell.edu//pub/mishaal/CS664/figure4.ps, 19960201 E P
	ftp://ftp.cs.cornell.edu//pub/mishaal/CS664/figure2.ps, 19960201 d m
	ftp://ftp.cs.cornell.edu//pub/mishaal/CS664/figure3.ps, 19960201 Small T Large T
	ftp://ftp.cs.cornell.edu//pub/mishaal/CS664/figure1.noborder.ps, 19960201 d m
	ftp://ftp.cs.cornell.edu//pub/mishaal/CS664/figure1.ps, 19960201 d m
	ftp://ftp.cs.cornell.edu//pub/karl/ICRA96.ps, 19960206 Proceedings IEEE Int. Conference on Robotics and Automation (ICRA), Minneapolis, MN, April 1996. What Programmable Vector Fields Can (and Cannot) Do: Force Field Algorithms for MEMS and Vibratory Plate Parts Feeders Karl-Friedrich B ohringer Bruce Randall Donald Noel C. MacDonald Robotics & Vision
	ftp://ftp.cs.cornell.edu//pub/sam/gms-impossibility.ps.gz, 19960207 On the Impossibility of Group Membership Tushar Deepak Chandray Vassos Hadzilacosz Sam Touegx Bernadette Charron-Bost{
	ftp://ftp.cs.cornell.edu//pub/vogels/podc.ps.gz, 19960207 A Framework for Protocol Composition in Horus Robbert van Renesse, Kenneth P. Birman, Roy Friedman, Mark Hayden, and David A. Karr Dept. of Computer Science Cornell University
	ftp://ftp.cs.cornell.edu//pub/vogels/arch.ps.gz, 19960207 Horus: A Flexible Group Communications System Robbert van Renesse, Kenneth P. Birman, Brad Glade, Katie Guo, Mark Hayden, Takako M. Hickey, Dalia Malki, Alex Vaysburd, and Werner Vogels1 Dept. of Computer Science, Cornell University
	ftp://ftp.cs.cornell.edu//pub/chandra/PolylogConsensus.ps.Z, 19960216 Polylog Randomized Wait-Free Consensus Tushar Deepak Chandra
	ftp://ftp.cs.cornell.edu//pub/chandra/GMSImpossibility.ps.Z, 19960216 On the Impossibility of Group Membership Tushar Deepak Chandray Vassos Hadzilacosz Sam Touegx Bernadette Charron-Bost{
	ftp://ftp.cs.cornell.edu//pub/maffeis/electra/piranha.ps.gz, 19960219 PIRANHA { A Hunter of Crashed CORBA Objects Silvano Maffeis Olsen & Associates, Zurich maffeis@acm.org January 1996
	ftp://ftp.cs.cornell.edu//pub/mdw/gs-2.3/chapter4.ps.gz, 19960222 Chapter 4 System Administration This chapter is an overview to Linux system administration, including a number of advanced features which aren't necessarily for system administrators only. Just as every dog has its day, every system has its administrator, and running the system is a very important and
	ftp://ftp.cs.cornell.edu//pub/mdw/gs-2.3/chapter0.ps.gz, 19960222 Linux Installation and Getting Started Copyright c 1992{1996 Matt Welsh Version 2.3, 22 February 1996. This book is an installation and new-user guide for the Linux system, meant for UNIX novices and gurus alike. Contained herein is information on how to obtain Linux, installation of the software, a
	ftp://ftp.cs.cornell.edu//pub/mdw/gs-2.3/install-guide-2.3.ps.gz, 19960222 Linux Installation and Getting Started Copyright c 1992{1996 Matt Welsh Version 2.3, 22 February 1996. This book is an installation and new-user guide for the Linux system, meant for UNIX novices and gurus alike. Contained herein is information on how to obtain Linux, installation of the software, a
	ftp://ftp.cs.cornell.edu//pub/mdw/gs-2.3/chapter1.ps.gz, 19960222 Chapter 1 Introduction to Linux Linux is quite possibly the most important achievement of free software since the original Space War, or, more recently, Emacs. It has developed into the operating system for businesses, education, and personal productivity. Linux is no longer just for UNIX wizards who
	ftp://ftp.cs.cornell.edu//pub/mdw/gs-2.3/chapter2.ps.gz, 19960222 Chapter 2 Obtaining and Installing Linux In this chapter, we'll describe how to obtain the Linux software, in the form of one of the various pre-packaged distributions, and how to install the distribution that you choose. As we have mentioned, there is no single official" distribution of the Linux
	ftp://ftp.cs.cornell.edu//pub/mdw/gs-2.3/chapter3.ps.gz, 19960222 Chapter 3 Linux Tutorial 3.1 Introduction New users of UNIX and Linux may be a bit intimidated by the size and apparent complexity of the system before them. There are many good books on using UNIX out there, for all levels of expertise from novice to expert. However, none of these books covers,
	ftp://ftp.cs.cornell.edu//pub/mdw/gs-2.3/appendix.ps.gz, 19960222 Appendix A Sources of Linux Information This appendix contains information on various sources of Linux information, such as online documents, books, and more. Many of these documents are available either in printed form, or electronically from the Internet or BBS systems. Many Linux distributions also
	ftp://ftp.cs.cornell.edu//pub/mdw/gs-2.3/chapter5.ps.gz, 19960222 Chapter 5 Advanced Features This chapter will introduce you to some of the more interesting features of Linux. This assumes that you have at least basic UNIX experience, and understand the information contained in the previous chapters. The most important aspect of Linux that distinguishes it from other
	ftp://ftp.cs.cornell.edu//pub/maffeis/electra/pman.ps.gz, 19960225 Electra 2:0b Programmer's Manual Silvano Maffeis Dept. of Computer Science Cornell University maffeis@acm.org February 1996
	ftp://ftp.cs.cornell.edu//pub/maffeis/electra/electra_naming.ps.gz, 19960227 A Fault-Tolerant CORBA Name Server Silvano Maffeis Cornell University, Ithaca, NY and Olsen & Associates, Zurich maffeis@acm.org February 27, 1996
	ftp://ftp.cs.cornell.edu//pub/fielding/1upUsers.ps, 19960306 SMART Users/Programmers Guide Cornell University Computer Science Department March 6, 1996 Updated 1 March 1996 Version 0.1 Draft
	ftp://ftp.cs.cornell.edu//pub/fielding/1upOverview.ps, 19960306 SMART System Overview Cornell University Computer Science Department March 6, 1996 Updated 1 March 1996 Version 0.1 Draft
	ftp://ftp.cs.cornell.edu//pub/fielding/2upUsers.ps, 19960306 SMART Users/Programmers Guide Cornell University Computer Science Department March 6, 1996 Updated 1 March 1996 Version 0.1 Draft
	ftp://ftp.cs.cornell.edu//pub/vogels/failure.ps.gz, 19960314 World Wide Failures. Werner Vogels Dept. of Computer Science, Cornell University 4105a Upson Hall, Ithaca, NY 14853 vogels@cs.cornell.edu
	ftp://ftp.cs.cornell.edu//pub/bhao/index.ps, 19960318 Table of Contents Next Trail Map: Java/HotJava Programmer's Guide Welcome to the Java/HotJava Programmer's Guide The Java/HotJava Programmer's Guide is a practical, on-line guide to writing programs in the Java language. Java programs can be standalone applications, or they can
	ftp://ftp.cs.cornell.edu//pub/bhao/JavaBook.ps, 19960318 The Java Language Environment A White Paper May 1995 A Sun Microsystems, Inc. Businessfl2550 Garcia AvenueflMountain View, CA 94043 U.S.A.fl415 960-1300 FAX 415 969-9131 The Java Language Environment A White Paper May 1995 A Sun Microsystems, Inc. Businessfl2550 Garcia AvenueflMountain View, CA 94043
	ftp://ftp.cs.cornell.edu//pub/bhao/TOC.ps, 19960318 Trail Map Next Table Of Contents The following Table of Contents are available. Getting Started Programming in Java Trail Map Next
	ftp://ftp.cs.cornell.edu//pub/bhao/usingThisDoc.ps, 19960318 Using This Guide The Java/HotJava Programmer's Guide is a practical, on-line guide to writing programs in the Java language. Java programs can be standalone applications, or they can execute within the HotJava browser. Documentation Trails This guide is comprised of a series of intersecting
	ftp://ftp.cs.cornell.edu//pub/bhao/MissingPage.ps, 19960318 Placeholder Page: Java/HotJava Programmer's Guide This page hasn't been written yet.
	ftp://ftp.cs.cornell.edu//pub/rus/iser95/iser95-new/trace1.ps.Z, 19960323 Step 1 Step 2
	ftp://ftp.cs.cornell.edu//pub/rus/iser95/iser95-new/trace3.ps.Z, 19960323 Step 1 Step 2
	ftp://ftp.cs.cornell.edu//pub/rus/iser95/iser95-new/contact-mode.ps.Z, 19960323 1 13 3 2 15 14 4 12 8 10 6 5 7 9 11
	ftp://ftp.cs.cornell.edu//pub/rus/iser95/iser95-new/push-track-crt.ps.Z, 19960323 Translate Until {#t,#f} = 0 q v Bumpers
	ftp://ftp.cs.cornell.edu//pub/sam/Broadcast.ps.gz, 19960323 A Modular Approach to Fault-Tolerant Broadcasts and Related Problems Vassos Hadzilacos Department of Computer Science University of Toronto Toronto, Ontario, Canada M5S 1A1 Sam Toueg y Department of Computer Science Cornell University Ithaca, New York 14853, USA 1 Introduction The design and
	ftp://ftp.cs.cornell.edu//pub/rus/iser95/iser95-new/iser-style.ps.Z, 19960323 Distributed Robotic Manipulation: Experiments in Minimalism Karl B ohringer, Russell Brown, Bruce Donald, Jim Jennings Cornell University Ithaca, NY 14853, USA brd@cs.cornell.edu Daniela Rus Dartmouth College Hanover, NH 03755, USA rus@cs.dartmouth.edu This paper describes research done in the Robotics
	ftp://ftp.cs.cornell.edu//pub/rus/iser95/iser95-new/push-tracka.ps.Z, 19960323 (a) COF Y X
	ftp://ftp.cs.cornell.edu//pub/rus/iser95/iser95-new/push-track.ps.Z, 19960323 COF X Y
	ftp://ftp.cs.cornell.edu//pub/rus/iser95/planning2.ps, 19960415 Global Controller (a) off-line, global control push-track(2) push-track(3)Trajectory Planner motion plan push-track(1) Planner World Model Plan: Initial Placements Repeat: Planner World Model Plan: (d) on-line, parallel, asynchronous (c) on-line, synchronous (b) on-line, local control Initial Placements
	ftp://ftp.cs.cornell.edu//pub/rus/iser95/execution1.ps, 19960415 robot2 (d) on-line, parallel, asynchronous robot1 robot3 robot2 Global Controller (a) off-line, global control robot1 robot3 (c) on-line, synchronous robot2robot1 robot3 (b) on-line, local control robot2robot1 robot3
	ftp://ftp.cs.cornell.edu//pub/rus/iser95/new-pose-newa.ps, 19960415 x y (b) push-track end-of-face spin end-of-face push-track spin
	ftp://ftp.cs.cornell.edu//pub/karl/ISER95/Old/PART1.ps.gz, 19960417 Distributed Robotic Manipulation: Experiments in Minimalism Karl B ohringer, Russell Brown, Bruce Donald, Jim Jennings Cornell University Ithaca, NY 14853, USA brd@cs.cornell.edu Daniela Rus Dartmouth College Hanover, NH 03755, USA rus@cs.dartmouth.edu This paper describes research done in the Robotics
	ftp://ftp.cs.cornell.edu//pub/karl/ISER95/Old/PART2.ps.gz, 19960417 Figure 5. A prototype M-Chip fabricated in 1995. A large unidirectional actuator array (scanning electron microscopy). Each actuator is 180 240 m2 in size. Detail from a 1 in2 array with more than 11,000 actuators. Figure 6. Released asymmetric actuator for the M-Chip (scanning electron microscopy).
	ftp://ftp.cs.cornell.edu//pub/isis/horus/doc/rtss7-tr.ps.Z, 19960418 DRAFT - Do Not Distribute Using Group Communication Technology to Implement a Reliable and Scalable Distributed IN Coprocessor Roy Friedman Ken Birman Department of Computer Science Cornell University Ithaca, NY 14853 USA e-mail:froy,keng@cs.cornell.edu March 15, 1996 This work was supported by ARPA/ONR
	ftp://ftp.cs.cornell.edu//pub/ozan/SRT.ps, 19960423 SRT ___ C SRT_begin ********* SRT ********** C DEFN DEFINITIONS D power_df Parens ::Prec(div):: ^== power{}(; ) *M power_ml % Take n to the powr m % add_rec_def dn^me dif m
	ftp://ftp.cs.cornell.edu//pub/gries/Everywhere.ps.gz, 19960502 Adding the Everywhere Operator to Propositional Logic David Gries and Fred B. Schneider y Computer Science Department, Cornell University Ithaca, New York 14853 USA May 1, 1996
	ftp://ftp.cs.cornell.edu//pub/sam/failure.detectors.algorithms.ps.gz, 19960505 Unreliable Failure Detectors for Reliable Distributed Systems Tushar Deepak Chandra I.B.M Thomas J. Watson Research Center, Hawthorne, New York and Sam Toueg Cornell University, Ithaca, New York We introduce the concept of unreliable failure detectors and study how they can be used to solve Consensus in
	ftp://ftp.cs.cornell.edu//pub/bsmith/hp96.ps.gz, 19960507 Resolution Independent Comp ressed Domain EditingPRINCIPLE INVESTIGATOR: Brian C. SmithAssistant ProfessorCornell UniversityDepartment of Computer ScienceUpson HallIthaca, NY, 14853phone: (607) 255-1180fax: (607) 255-4428email: bsmith@cs. cornell.eduPRINCIPLE INVESTIGATOR: Ramin ZabihAssistant
	ftp://ftp.cs.cornell.edu//pub/clarko/papers/vindex.tr.ps, 19960520 Probabilistic Indexing: Recognizing 3D Objects from 2D Images Using the Probabilistic Peaking Effect Clark F. Olson Computer Science Division University of California at Berkeley Berkeley, CA 94720 clarko@robotics.eecs.berkeley.edu Technical Report UCB//CSD-93-733
	ftp://ftp.cs.cornell.edu//pub/driscoll/thesis.ps, 19960520 DOMAIN DECOMPOSITION METHODS FOR CONFORMAL MAPPING AND EIGENVALUE PROBLEMS A Dissertation 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 Tobin Allen Driscoll May 1996 c Tobin Allen Driscoll 1996
	ftp://ftp.cs.cornell.edu//pub/tah/HyTech/user_guide.ps, 19960523 A User Guide to HyTech y Thomas A. Henzinger Pei-Hsin Ho Howard Wong-Toi Dept of Elec. Eng. & Comp. Sci. Intel Development Labs Cadence Berkeley Labs University of California Intel Corporation Cadence Design Systems Berkeley, CA. Hillsboro, OR. Berkeley, CA. tah@eecs.berkeley.edu pho@ichips.intel.com
	ftp://ftp.cs.cornell.edu//pub/cs222/A1.ps, 19960625 CS222 Summer 1996 Assignment 1 Due Date: July 1, 1996 Print your name and student ID on the first page (one copy with both names if working in pairs). Uphold the academic integrity code. For each computing problem, submit all MATLAB files which produce the output. Make sure that your code is clearly
	ftp://ftp.cs.cornell.edu//pub/aguilera/hybrid.consensus.algorithm.ps.gz, 19960702 Randomization and Failure Detection: A Hybrid Approach to Solve Consensus Marcos K. Aguilera and Sam Toueg aguilera@cs.cornell.edu sam@cs.cornell.edu Department of Computer Science Upson Hall, Cornell University Ithaca, NY 14853-7501, USA. June 27, 1996
	ftp://ftp.cs.cornell.edu//pub/cs222/A2.ps, 19960703 CS222 Summer 1996 Assignment 2 Due Date: July 9, 1996 Print your name and student ID on the first page (one copy with both names if working in pairs). Uphold the academic integrity code. For each computing problem, submit all MATLAB files which produce the output. Make sure that your code is clearly
	ftp://ftp.cs.cornell.edu//pub/stoller/SIGOPS96.ps.Z, 19960706 Cryptographic Support for Fault-Tolerant Distributed Computing Yaron Minskyy Robbert van Renesse z Fred B. Schneidery Scott D. Stollery Department of Computer Science Cornell University Ithaca, New York 14853, U.S.A July 6, 1996 1 Introduction Mobile processes, or agents, have been proposed for a
	ftp://ftp.cs.cornell.edu//pub/yanhong/Inc-SCP95.ps.Z, 19960715 Systematic Derivation of Incremental Programs Yanhong A. Liu y, Tim Teitelbaum Department of Computer Science, Cornell University, Ithaca, NY 14853, USA
	ftp://ftp.cs.cornell.edu//pub/kguo/CameraReady.ps, 19960723 A Transparent Light-Weight Group Service Lu s Rodrigues ler@inesc.pt Katherine Guo kguo@cs.cornell.edu Antonio Sargento amgs@pandora.inesc.pt Robbert van Renesse rvr@cs.cornell.edu Brad Glade glade@isis.com Paulo Ver ssimo paulov@inesc.pt Ken Birman ken@cs.cornell.edu
	ftp://ftp.cs.cornell.edu//pub/cs222/A5.ps, 19960724 CS222 Summer 1996 Assignment 5 Due Date: July 29, 1996 Print your name and student ID on the first page (one copy with both names if working in pairs). Uphold the academic integrity code. For each computing problem, submit all MATLAB files which produce the output and the requested output. Make sure
	ftp://ftp.cs.cornell.edu//pub/rus/mcm/goodprpages.ps, 19960730 20 40 60 80 100 120 140 160 180 200 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 Page number Percentage Precision and recall results for pages
	ftp://ftp.cs.cornell.edu//pub/rus/mcm/text-flow-goal-bw.ps, 19960730 OCR Software & Parser PDL Document PDL Parser Text & Graphic Zones Scanned Bitmap Indentation Analysis Layout Topology White Space (& Symbol) Analysis Labelled Hierarchy Markup
	ftp://ftp.cs.cornell.edu//pub/rus/mcm/real-doc-6x6.ps, 19960730 Analyzing Teams of Cooperating Mobile Robots1 Bruce Randall Donald James Jennings Daniela Rus Robotics & Vision Laboratory Computer Science Department Cornell University Ithaca, New York
	ftp://ftp.cs.cornell.edu//pub/rus/mcm/goal-tree.ps, 19960730 Title Main Document Heading Section Paragraph Paragraph List Paragraph List Item Item Item Item Item Document Heading Section Structured Section Part Structured Section Part Paragraph List Paragraph List Paragraph Item Item Item
	ftp://ftp.cs.cornell.edu//pub/rus/mcm/podp20.ps, 19960730 Geometric Algorithms and Experiments for Automated Document Structuring Daniela Rus Department of Computer Science Dartmouth College Hanover, NH 03755 rus@cs.dartmouth.edu Kristen Summersy Department of Computer Science Cornell University Ithaca, NY 14853 summers@cs.cornell.edu
	ftp://ftp.cs.cornell.edu//pub/rus/mcm/application.ps, 19960730 figure caption related figure caption description analysis different version description theorem proof explanation
	ftp://ftp.cs.cornell.edu//pub/rus/mcm/snowman-wdg.ps, 19960730 0.75 0.8 0.85 0.9 0.95 1 20 40 60 80 100 120 140 "snowman.wdg"
	ftp://ftp.cs.cornell.edu//pub/rus/mcm/ind-tree.ps, 19960730 Blocks 1 - 17 Block 1 Blocks 2 - 17 Block 2 Blocks 3 - 9 Block 10 Blocks 11 - 17 Blocks 3 - 8 Block 9 Blocks 11 - 16 Block 17 Block 3 Blocks 4 -5 Block 6 Blocks 7 - 8 Block 11 Blocks 12 -13 Blocks 15 - 16Block 14 Block 4 Block 5 Block 7 Block 8 Block 12 Block 13 Block 15 Block 16
	ftp://ftp.cs.cornell.edu//pub/rus/mcm/mini-doc.ps, 19960730 White Space Density Graphs of Polygons 1. Assumptions In all characterizations of WDGs, we make the following assumptions. They enable us to characterize the WDGs of many polygons precisely: o The block of text for which the WDG is given contains exactly one figure. o The block and the figure are of the
	ftp://ftp.cs.cornell.edu//pub/rus/mcm/bothgraphs.ps, 19960730 2 4 6 8 10 12 14 16 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 Technical report number Percentage Precision and recall results for the TR collection
	ftp://ftp.cs.cornell.edu//pub/karl/WAFR96.ps, 19960731 Upper and Lower Bounds for Programmable Vector Fields with Applications to MEMS and Vibratory Plate Parts Feeders Karl-Friedrich B ohringer, Bruce Randall Donald, Noel C. MacDonald Cornell University, Ithaca, New York, USA Programmable vector fields can be used to control a variety of flexible planar
	ftp://ftp.cs.cornell.edu//pub/karl/ISER95/New/AckEnd/iser-B.ps.gz, 19960804 Distributed Robotic Manipulation: Experiments in Minimalism Karl B ohringer, Russell Brown, Bruce Donald, Jim Jennings Cornell University Ithaca, NY 14853, USA brd@cs.cornell.edu Daniela Rus Dartmouth College Hanover, NH 03755, USA rus@cs.dartmouth.edu
	ftp://ftp.cs.cornell.edu//pub/karl/ISER95/New/AckEnd/iser-A.ps.gz, 19960804 Distributed Robotic Manipulation: Experiments in Minimalism Karl B ohringer, Russell Brown, Bruce Donald, Jim Jennings Cornell University Ithaca, NY 14853, USA brd@cs.cornell.edu Daniela Rus Dartmouth College Hanover, NH 03755, USA rus@cs.dartmouth.edu
	ftp://ftp.cs.cornell.edu//pub/karl/ISER95/New/AckFront/iser-11-15.ps.gz, 19960805 Figure 5. A prototype M-Chip fabricated in 1995. A large unidirectional actuator array (scanning electron microscopy). Each actuator is 180 240 m2 in size. Detail from a 1 in2 array with more than 11,000 actuators. Figure 6. Released asymmetric actuator for the M-Chip (scanning electron microscopy).
	ftp://ftp.cs.cornell.edu//pub/karl/ISER95/New/AckFront/iser-1-10.ps.gz, 19960805 Distributed Robotic Manipulation: Experiments in Minimalism Karl B ohringer, Russell Brown, Bruce Donald, Jim Jennings Cornell University Ithaca, NY 14853, USA brd@cs.cornell.edu Daniela Rus Dartmouth College Hanover, NH 03755, USA rus@cs.dartmouth.edu
	ftp://ftp.cs.cornell.edu//pub/karl/IJRR96.ps, 19960813 Submitted for review to the International Journal of Robotics Research (IJRR), August 1996. Programmable Vector Fields for Distributed Manipulation, with Applications to MEMS Actuator Arrays and Vibratory Parts Feeders Karl-Friedrich B ohringer, Bruce Randall Donald, Noel C. MacDonald Cornell
	ftp://ftp.cs.cornell.edu//pub/rz/MathBus/mathbus.ps.gz, 19960816 The MathBus Term Structure 1 DRAFT of 8/16/96 4:34 PM The MathBus Term Structure Richard Zippel Dept. of Computer Science Cornell University Ithaca, New York 14853 USA Email: rz@cs.cornell.edu This is a very preliminary version of the MathBus term structure. Please send all corrections, comments and
	ftp://ftp.cs.cornell.edu//pub/vavasis/papers/cod2a.ps.gz, 19960816 Complete Orthogonal Decomposition for Weighted Least Squares Patricia D. Houghy Stephen A. Vavasisz March 15, 1995
	ftp://ftp.cs.cornell.edu//pub/isis/horus/doc/sigops7_kguo.ps, 19960822 Structured Virtual Synchrony: Exploring the Bounds of Virtual Synchronous Group Communication Katherine Guo, Werner Vogels and Robbert van Renesse1 Dept. of Computer Science, Upson Hall, Cornell University, Ithaca, NY 14853, U.S.A. E-mail: {kguo, vogels, rvr}@cs.cornell.edu Multipoint communication
	ftp://ftp.cs.cornell.edu//pub/isis/horus/doc/srds96_tlwgs.ps, 19960822 A Transparent Light-Weight Group Service Lu s Rodrigues ler@inesc.pt Katherine Guo kguo@cs.cornell.edu Antonio Sargento amgs@pandora.inesc.pt Robbert van Renesse rvr@cs.cornell.edu Brad Glade glade@isis.com Paulo Ver ssimo paulov@inesc.pt Kenneth Birman ken@cs.cornell.edu
	ftp://ftp.cs.cornell.edu//pub/tyan/heap-ps.ps, 19960825 The Geobucket Data Structure for Polynomials Thomas Yan Computer Science Cornell University tyan@cs.cornell.edu August 22, 1996