Browsing LCS Technical Memos (1974 - 2003) by Title
Now showing items 251-270 of 492
-
The Macaims Data Management System
(1971-04)MacAIMS (MAC Advanced Interactive Management System) is a relatively small research project that was initiated in the summer of 1968 to investigate the feasibility of using some of the then existing computer facilities at ... -
A Machine Language Instruction Set for a Data Flow Processor
(1979-12)A data flow processor is a computer in which instructions are data driven and enabled for execution by the arrival of their operands. Data flow processors execute data flow programs, normally represented as program graphs, ... -
Maclisp Extensions
(1981-07)This document describes a common subset of selected facilities available in Maclisp and its derivatives: PDP-10 and Multics Maclisp., List Machine Lisp (Zetalisp), and NIL. The object of this document is to aid people in ... -
A Manager for Named, Permanent Objects
(1980-04)Storing data in a computing system for a long time has been of interest ever since it was possible to do so. Classically, on stores bit- or byte- strings, or perhaps arrays of "records." Yet, current programming philosophy ... -
Maps: a Compiler-Managed Memory System for RAW Machines
(1998-07)Microprocessors of the next decade and beyond will be built using VLSI chips employing billions of transistors. In this generation of microprocessors, achieving a high level of parallelism at a reasonable clock speed will ... -
The Markov Chain Tree Theorem
(1983-11)Let M be a finite first-order stationary Markov chain. We define an arborescence to be a set of edges in the directed graph for M having at most one edge out of every vertex, no cyles, and maximum cardinality. The weight ... -
The MASC Composable Computing Infrastructure for Intelligent Environments
We present a system architecture and framework for creating rapidly deployable intelligent environments. The rapid pace of innovation of computer hardware and intelligent systems software leads to uncertainty that deters ... -
Matching and Pose Refinement with Camera Pose Estimates
(1996-01)This paper describes novel algorithms that use absolute camera pose information to identify correspondence among point features in hundreds or thousands of images. Our incidence counting algorithm is a geometric approach ... -
The Max Flow Algorithm of Dinis and Karzanov: An Exposition
(1976-12)Recently A.V. Karzanov improved Dinic's algorithm to run in time 0(n^3) for networks of n vertices. For the benefit of those who do not read Russian, the Dinic-Karzanov algorithm is explained and proved. In addition to ... -
The MD4 Message Digest Algorithm
(1990-10)The MD4 message digest algorithm takes an input message of arbitrary length and produces an output 128-bit "fingerprint" or "message digest," in such a way that it is (hopefully) computationally infeasible to produce two ... -
MDC-Programmer: A Muddle-to-datalanguage Translator for Information Retrieval
(1974-10)This memo describes a practical application within the framework of the ARPA computer network of the philosophy that a fully developed computer network should appear as a virtual extensino of the user's own software ... -
Measuring User Characteristics on the MILTICS System
(1977-08)One of the problems in measuring the performance of a computer system is in defining its normal workload. In the case of timesharing systems, it is necessary to develop a behavioral model of the average user. This thesis ... -
Memory Assignment for Multiprocessor Caches Through Graph Coloring
(1992-02)It has become apparent that the achieved performance of multiprocessors is heavily dependent upon the quality of the availabel compilers. In this paper we are concerned with compile-time techniques that can be used to ... -
Metal Poker
(1979-02)Can two potentially dishonest players play a fair game of poker without using any cards (e.g. over the phone)? This paper provides the following answers: 1. No. (Rigorous mathematical proof supplied. 2. Yes. (Correct & ... -
A Method for Obtaining Digital Signatures and Public-key Cryptosystems
(1977-04)We present an encryption method with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key. This has two important consequences. 1. Couriers or other secure ... -
Minimax Optimal Universal Codeword Sets
(1982-01)In an interactive multi-user data-processing system a user knows the probabilities of his messages and must encode them into a fixed system-wide variable-length codeword set. He needs to receive the answer to his last ... -
Minimum Register Allocation is Complete in Polynomial Space
(1979-03)The Minimum Register Allocation Problem is to determine the minimum number of registers required to evaluate an arithmetic expression. A pebble game on directed acyclic graphs is used to prove that this is complete is ... -
The MIT Alewife Machine: A Large-scale Distributed-memory Multiprocessor
(1991-06)The Alewife multiprocessor project focuses on the architecture and design of a large-scale parallel machine. The machine uses a low dimension direct interconnection network to provide scalable communication band-width, ... -
A Mixed Integer Linear Programming Problem Which is Efficiently Solvable
(1985-07)Efficient algorithms are known for the simple linear programming problem where each inequality is of the form xj-xi<=aij. Furthermore, these techniques extend to the integer linear programming variant of the problem. This ... -
Modeling Multiprogrammed Caches
This paper presents a simple, yet accurate, model for multiprogrammed caches and validates it against trace-driven simulation. The model takes into account nonstationary behavior of processes and process sharing. By making ...
