Computer Science and Artificial Intelligence Lab (CSAIL): Recent submissions

Now showing items 501-520 of 2625

  • Transcendence, Facticity, and Modes of Non-Being 

    Unknown author (MIT Artificial Intelligence Laboratory, 1986-03)
    Research in artificial intelligence has yet to satisfactorily address the primordial fissure between human consciousness and the material order. How is this split reconciled in terms of human reality? By what duality is ...

  • Vision Utilities 

    Unknown author (MIT Artificial Intelligence Laboratory, 1985-12)
    This paper documents a collection of Lisp utilities which I have written while doing vision programming on a Symbolics Lisp machine. Many of these functions are useful both as interactive commands invoked from the Lisp ...

  • A Counterexample to the Theory that Vision Recovers Three-Dimensional Scenes 

    Unknown author (MIT Artificial Intelligence Laboratory, 1988-11)
    The problem of three-dimensional vision is generally formulated as the problem of recovering the three-dimensional scene that caused the image. Here we present a certain line-drawing and show that it has the following ...

  • Test Programming by Program Composition and Symbolic Simulation 

    Unknown author (MIT Artificial Intelligence Laboratory, 1985-11)
    Classical test generation techniques rely on search through gate-level circuit descriptions, which results in long runtimes. In some instances, classical techniques cannot be used because they would take longer than the ...

  • Automated Program Recognition: A Proposal 

    Unknown author (MIT Artificial Intelligence Laboratory, 1985-12)
    The key to understanding a program is recognizing familiar algorithmic fragments and data structures in it. Automating this recognition process will make it easier to perform many tasks which require program understanding, ...

  • How to do Research At the MIT AI Lab 

    Unknown author (MIT Artificial Intelligence Laboratory, 1988-10)
    This document presumptuously purports to explain how to do research. We give heuristics that may be useful in pickup up specific skills needed for research (reading, writing, programming) and for understanding and enjoying ...

  • Jordan Form of (i+j over j) over Z[subscript p] 

    Unknown author (MIT Artificial Intelligence Laboratory, 1985-07)
    The Jordan Form over field Z[subscript p] of J[superscript p][subscript p]n is diagonal for p > 3 with characteristic polynomial, ϕ(x) = x[superscript 3] - 1, for p prime, n natural number. These matrices have dimension ...

  • IDEME: A DBMS of Methods 

    Unknown author (MIT Artificial Intelligence Laboratory, 1985-08)
    In this paper, an intelligent database management system (DBMS) called IDEME is presented. IDEME is a program that takes as input a task specification and finds a set of methods potentially relevant to solving that task. ...

  • Writing and Representation 

    Unknown author (MIT Artificial Intelligence Laboratory, 1988-09)
    This paper collects several notes I've written over the last year in an attempt to work through my dissatisfactions with the ideas about representation I was taught in school. Among these ideas are the notion of a 'world ...

  • Toward a Principle-Based Translator 

    Unknown author (MIT Artificial Intelligence Laboratory, 1985-06)
    A principle-based computational model of natural language translation consists of two components: (1) a module which makes use of a set of principles and parameters to transform the source language into an annotated surface ...

  • How to Use YTEX 

    Unknown author (MIT Artificial Intelligence Laboratory, 1986-06-09)
    YTEX—pronounced why-TEX or oops-TEX—is a TEX macro package. YTEX provides both an easy-to-use interface for TEX novices and a powerful macro-creation library for TEX programmers. It is this two-tier structure that makes ...

  • Support for Obviously Synchonizable Series Expressions in Pascal 

    Unknown author (MIT Artificial Intelligence Laboratory, 1988-11)
    Obviously synchronizable series expressions enable programmers to write algorithms as straightforward compositions of functions rather than as less comprehensible loops while retaining the significantly higher efficiency ...

  • Puma/Cougar Implementor's Guide 

    Unknown author (MIT Artificial Intelligence Laboratory, 1985-04)
    This document is intended to be a guide to assist a programmer in modifying or extending the Lisp Puma system, the Puma PDP-11 system, or the Cougar PDP-11 system. It consists mostly of short descriptions or hints, and is ...

  • Using the PUMA System 

    Unknown author (MIT Artificial Intelligence Laboratory, 1985-04)
    This document describes the operation of the Lisp Machine interface to the Unimation Puma 600 Robot Arm. The interface is evolved from a system described in an earlier paper, and much is the same. However, the under-lying ...

  • Analyzing the State Behavior of Programs 

    Unknown author (MIT Artificial Intelligence Laboratory, 1988-08)
    It is generally agreed that the unrestricted use of state can make a program hard to understand, hard to compile, and hard to execute, and that these difficulties increase in the presence of parallel hardware. This problem ...

  • Toward a Richer Language for Describing Software Errors 

    Unknown author (MIT Artificial Intelligence Laboratory, 1985-05)
    Several approaches to the meaning and uses of errors in software development are discussed. An experiment involving a strong type-checking language, CLU, is described, and the results discussed in terms of the state of the ...

  • A Proposal for Research With the Goal of Formulating a Computational Theory of Rational Action 

    Unknown author (MIT Artificial Intelligence Laboratory, 1985-04)
    A theory of rational action can be used to determine the right action to perform in a situation. I will develop a theory of rational action in which an agent has access to an explicit theory of rationality. The agent makes ...

  • Parallel Flow Graph Matching for Automated Program Recognition 

    Unknown author (MIT Artificial Intelligence Laboratory, 1988-07)
    A flow graph matching algorithm has been implemented on the Connection Machine which employs parallel techniques to allow efficient subgraph matching. By constructing many different matchings in parallel, the algorithm is ...

  • Exceptional Situations in Lisp 

    Unknown author (MIT Artificial Intelligence Laboratory, 1985-02)
    Frequently, it is convenient to describe a program in terms of the normal situations in which it will be used, even if such a description does not describe the its complete behavior in all circumstances. This paper surveys ...

  • The Structures of Everyday Life 

    Unknown author (MIT Artificial Intelligence Laboratory, 1985-02)
    This note descends from a talk I gave at the AI Lab's Revolving Seminar series in November 1984. I offer it as an informal introduction to some work I've been doing over the last year on common sense reasoning. Four themes ...