Browsing LCS Publications by Title

Now showing items 97-116 of 1163

    • Backup and Recovery of On-line Information in a Computer Utility 

      Stern, Jerry A. (1974-01)
      This thesis describes a design for an automatic backup mechanism to be incorporated in a computer utility for the protection of on-line information against accidental or malicious destruction. This protection is achieved ...

    • Bandwidth Management in Wireless Sensor Networks 

      Hull, Bret; Jamieson, Kyle; Balakrishnan, Hari (2003-04)
      Wireless sensor networks are often used in monitoring and control applications, where software running on generalpurpose computers ÔøΩpullÔøΩ information from remote sensors and ÔøΩpushÔøΩ actuations into the network. The ...

    • Baring it all to Software: The Raw Machine 

      Waingold, Elliot; Taylor, Michael; Sarkar, Vivek; Lee, Walter; Lee, Victor; e.a. (1997-03)
      Rapid advances in technology force a quest for computer architectures that exploit new opportunities and shed existing mechanisms that do not scale. Current architectures, such as hardware scheduled superscalars, are ...

    • Bicontinuous Extensions of Invertible Combinatorial Functions 

      Toffoli, Tommaso (1979-01)
      We discuss and solve the problem of constructing a diffeomorphic componentwise extension for an arbitrary invertible combinatorial function. Interpreted in physical terms, our solution constitutes a proof of the physical ...

    • Bitwidth Analysis with Application to Silicon Compilation 

      Stephenson, Mark; Babb, Jonathan; Amarasinghe, Saman (1999-11)
      In this paper introduces Bitwise, a compiler that minimizes the bitwidth - the number of bits used to represent each operand - for both integers and pointers in a program. By propagating static information both forward and ...

    • Blueware: Bluetooth Simulator for ns 

      Tan, Godfrey (2002-10)

    • Boolean Compilation of Relational Specifications 

      Jackson, Daniel (1998-01)
      A new method for analyzing relational specifications is described. A property to be checked is cast as a relational formula, which, if the property holds, has no finite models. The relational formula is translated into a ...

    • Boosting Fault-Tolerance in Asynchronous Message Passing Systems is Impossible 

      Attie, Paul C.; Lynch, Nancy A.; Rajsbaum, Sergio (2002-12)

    • Boston Community Information System - 1986 Experimental Test Results 

      Gifford, David K.; Heitmann, Dawn; Segal, David A.; Cote, Robert G.; Tanacea, Kendra; e.a. (1987-08)
      This report describes the first year of an experimental test of the Boston Community Information System (Boston CommInS). The experiment implements new ideas of data communication and database design in the transmission ...

    • Boston Community Information System User Manual (Version 6.0) 

      Lucassen, John M.; Gifford, David K.; Berlin, Stephen T.; Burmaster, David E. (1986-04)
      The Boston Community Information System turns your computer into a personal information assistant that monitors the news as it happens. This experiment, CommInS, tests a new way of distributing world news and features ...

    • Boston Community Information System User's Manual 

      Segal, David A.; Gifford, David K.; Lucassen, John M.; Henderson, James B.; Berlin, Stephen T.; e.a. (1987-10)
      The Boston Community Information System turns your computer into a personal information assistant that monitors the news as it happens. This experiment, CommInS, tests a new way of distributing world news as it happens ...

    • Bounded Width Branching Programs 

      Barrington, David A. (1986-06)
      We examine the branching program model of computation and in particular the classes of languages which can be recognized when the width of the programs is bounded by a constant. After slightly revising the framework of ...

    • Bounded-Error Interactive Ray Tracing 

      Bala, Kavita; Dorsey, Julie; Teller, Seth (1998-03)

    • Bounds on Information Retrieval Efficiency in Static File Structures 

      Welch, Terry A. (1971-06)
      This research addresses the problem of file organization for efficient information retrieval when each file item may be accessed through any one of a large number of identification keys. The emphasis is on library problems, ...

    • Bounds on the Scheduling of Types Task Systems 

      Jaffe, Jeffrey M. (1978-09)
      We study the scheduling of different types of tasks on different types of processors. If there are k types of tasks and mi identifical processors for takss of type I, the finishing times of any demand driven or list schedule ...

    • Bounds on the Time to Reach Agreement in the Presence of Timing Uncertainty 

      Attiya, Hagit; Dwork, Cynthia; Lynch, Nancy A.; Stockmeyer, Larry (1990-11)

    • BRAND X Manual 

      Szolovits, Peter; Martin, William A. (1980-11)
      BRAND X is a simple representation language implemented as a pure extension of LISP. BRAND X provides the following additional facilities over LISP: Unique and canonical structures, property lists for all objects, labels ...

    • A Brief Overview of the GSM Radio Interface 

      Turletti, Thierry (1996-03)
      This technical memorandum contains a compilation of several papers, reports and books relative to the GSM-900 radio interface. It is not exhaustive and it is restricted to the Traffic Channel/Full-Rate Speech (TCH/FS).

    • Building an Active Node on the Internet 

      Murphy, David M. (1997-05)

    • Building Data Structures on Untrusted Peer-to-Peer Storage with Per-participant Logs 

      Chen, Benjie; Gil, Thomer M.; Muthitacharoen, Athicha; Morris, Robert T. (2003-03)
      L* is a technique for building multi-user distributed data structures out of untrusted peer-to-peer distributed hash tables (DHTs). L* uses multiple logs, one log per participant, to store changes to the data structure. ...