Browsing Project MAC by Title

Now showing items 1-20 of 176

    • An Abstract Model of a Research Institute: Simple Automatic Programming Approach 

      Briabrin, Victor (1974-03)
      A problem of knowledge representation is considered in terms of designing a model for a simple sociological structure. A version of the access language is proposed which is based on three kind of expressions accepted by ...

    • ADEPT: A Heuristic Program for Proving Theorems of Group Theory 

      Norton, Lewis Mark (1966-10)
      A computer program, named ADEPT (A Distinctly Empirical Prover of Theorems), has been written which proves theorems taken from the abstract theory of groups. Its organization is basically heuristic, incorporating many ...

    • Analysis of Asynchronous Concurrent Systems by Timed Petri Nets 

      Ramchandani, Chander (1974-02)
      This thesis is concerned with the modeling and performance analysis of systems which consist of concurrently acting components, an example of which is an asynchronous pipelined processor. The work is divided into two ...

    • Analysis of Production Schemata by Petri Nets 

      Hack, Michel Henri Théodore (1972-02)
      Petri nets provide a powerful graphical tool for representing and analyzing complex concurrent systems. Properties such as hang-up freeness, determinacy, conflict, concurrency and dependency, can be represented and studied. ...

    • An Analysis of Sorting Networks 

      Smith, Burton J. (1972-10)
      Comparators which sort two numbers can be interconnected to form networks which sort n numbers for any n. The input and output characteristics of comparator networks are analyzed from several different points of view.

    • An Analysis of Time-Shared Computer Systems 

      Scherr, Allan Lee (1965-06)
      Some of the aspects of the operation of time-shared, interactive computer systems are analyzed. The emphasis is on the reaction of hardware systems to the demands that its users make upon it. Simply shared systems and ...

    • An Asynchronous Logic Array 

      Patil, Suhas S. (1975-05)
      A new asynchronous logic array for the general synthesis of asynchronous digital circuits is presented. The parallel and asynchronous nature of the array gives the realized systems the speed and characteristics of hardwired ...

    • Automatic Code-generation from an Object-machine Description 

      Miller, Perry L. (1970-10)
      This memo outlines the basic elements of a macro code-generating system, and develops an informal machine-independent model of a code generator. Then the memo discusses how an implementation of this model could be set up ...

    • Automatic Creation of a Code Generator from a Machine Description 

      Miller, Perry L. (1971-05)
      This paper studies some of the problems involved in attaining machine independence for a code generator, similar to the language independence and the token independence attained by automatic parsing and automatic lexical ...

    • Automatic Test, Configuration and Repair of Cellular Arrays 

      Manning, Frank B. (1975-06)
      A cellular array is an iterative array of identical information processing machines, cells. The arrays discussed are rectangular arrays of programmable logic, in which information stored in a working cell tells the cell ...

    • Autonomous, Synchronous Counters Constructed Only of J-K Flip-flops 

      Manning, Frank (1972-05)
      This report describes research into some properties of autonomous, synchronous counters constructed with only the simplest form of J-K Flip-Flop. The research revolved around a system with a special-purpose digital machine ...

    • 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 ...

    • 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, ...

    • Calculaid: An On-line System for Algebraic Computation and Analysis 

      Wantman, Mayer Elihu (1965-09)
      OPS is an on-line system developed by M. Greenberger et al. at Project MAC. The present work provides a powerful and simple way to perform numerical manipulations and calculations within OPS. The program package is called ...

    • CAMAC: Group Manipulation System 

      Weiss, Randell B. (1975-03)
      CAMAC is a collection of group manipulation progams with an easy to use interface. With groups defined by either generating permutations or generators and relations the system can find coset tables, normalizers, centralizers, ...

    • A Canonic Translator 

      Alsop, Joseph Wright (1967-11)
      An algorithm to recognize and translate sets of character strings specified by canonic system is presented. The ability of canonic systems to define the context sensitive features of strings and to specify their translation ...

    • CARPS, A Program Which Solves Calculus Word Problems 

      Charniak, Eugene

    • CARPS: A Program which Solves Calculus Word Problems 

      Charniak, Eugene (1968-07-01)
      A program was written to solve calculus word problems. The program, CARPS (CALculus Rate Problem Solver), is restricted to rate problems. The overall plan of the program is similar to Bobrow's STUDENT, the primary ...

    • Case Study in Interactive Graphics Programming: A Circuit Drawing and Editing Program for Use with A Storage-tube Display Terminal 

      Brackett, J.; Hammer, M.M.; Thornhill, D. (1969-10)
      The concepts involved in building and manipulating a data structure through graphical interaction are presented, using the drawing and editing of electrical circuits as a vehicle. The circuit drawings program was designed ...

    • A Class of Boolean Functions with Linear Combinatorial Complexity 

      Hsieh, W. N.; Harper, L.H.; Savage, J.E. (1974-10)
      In this paper we investigate the combinatorial complexity of Boolean functions satisfying a certain property, P^nk,m. A function of n variable has the P^nk,m property if there are at least m functions obtainable from each ...