WorldCat Identities

Project MAC (Massachusetts Institute of Technology)

Works: 294 works in 346 publications in 1 language and 1,056 library holdings
Genres: Conference papers and proceedings  Music 
Classifications: QA76, 001.64
Publication Timeline
Most widely held works about Project MAC (Massachusetts Institute of Technology)
moreShow More Titles
fewerShow Fewer Titles
Most widely held works by Project MAC (Massachusetts Institute of Technology)
Record by Woods Hole, Mass.> Conference on Concurrent Systems and Parallel Computation. <1970( Book )

6 editions published in 1970 in English and held by 70 WorldCat member libraries worldwide

A parallel processing model of musical structures by Stephen W Smoliar( Book )

2 editions published in 1971 in English and held by 32 WorldCat member libraries worldwide

EUTERPE is a real-time computer system for the modeling of musical structures. It provides a formalism wherein familiar concepts of musical analysis may be readily expressed. This is verified by its application to the analysis of a wide variety of conventional forms of music: Gregorian chant, Mediaeval polyphony, Bach counterpoint, and sonata form. It may be of further assistance in the real-time experiments in various techniques of thematic development. Finally, the system is endowed with sound-synthesis apparatus with which the user may prepare tapes fr musical performances. (Author)
Lambda-calculus models of programming languages by James H Morris( Book )

2 editions published in 1968 in English and held by 27 WorldCat member libraries worldwide

Two aspects of programming languages, recursive definitions and type declarations are analyzed in detail, using Church's lambda-calculus as the programming language model. The main result on recursion is an analogue to Kleene's first recursion theorem: If A = FA for any lambda-expressions A and F, then A is an extension of YF in the sense that if E(YF), any expression containing YF, has a normal form then E(YF) = E(A). Y is Curry's paradoxical combinator. The result is shown to be invariant for many different versions of Y.A system of types and type declarations is developed for the lambda-calculus and its semantic assumptions are identified. The system is shown to be adequate in the sense that it permits a preprocessor to check formulae prior to evaluation to prevent type errors. It is shown that any formula with a valid assignment of types to all its subexpressions must have a normal form. (Author)
Computer recognition of three-dimensional objects in a visual scene by Adolfo Guzmán( Book )

3 editions published in 1968 in English and held by 25 WorldCat member libraries worldwide

Methods are presented: (1) to partition or decompose a visual scene into the bodies forming it; (2) to position these bodies in three-dimensional space, by combining two scenes that make a stereoscopic pair; (3) to find the regions or zones of a visual scene that belong to its background; (4) to carry out the isolation of objects in (1) when the input has inaccuracies. Running computer programs implement the methods, and many examples illustrate their behavior. The input is a two-dimensional line-drawing of the scene, assumed to contain three-dimensional bodies possessing flat faces (polyhedra); some of them may be partially occluded. Suggestions are made for extending the work to curved objects. Some comparisons are made with human visual perception. The main conclusion is that it is possible to sseparate a picture or scene into the constituent objects exclusively in basis of monocular geometric properties (in basis of pure form); in fact, successful methods are shown. (Author)
Economies of scale in computer use : initial tests and implications for the computer utility by Lee L Selwyn( )

2 editions published in 1970 in English and held by 25 WorldCat member libraries worldwide

The study is concerned with the existence of economies of scale in the production of data processing and other computing services, and the possible regulatory and public policy implications of such economies. An analysis was made of data on nearly 10,000 computers installed at firms in manufacturing industries, using the survival technique, which uses market experience as a basis for studying levels of optimum plant size. The results of this analysis suggested that users did operate computers as if there were significant economies of scale in their use. (Author)
The flow graph schemata model of parallel computation by Donald Ray Slutz( Book )

3 editions published in 1968 in English and held by 24 WorldCat member libraries worldwide

Flow Graph Schemata are introduced as uninterpreted models of parallel algorithms, operating asynchronously and reflecting physical properties inherent to any implementation. Three main topics are investigated: (1) determinacy, (2) equivalence, and (3) equivalence-preserving transformations on the control structure of a Flow Graph Schemata. A model is determinate if the results of a computation depend only on the initial values and not on any timing constraints within the model. Equivalence is undecidable in general, but for a large class of determinate Flow Graph Schemata which are in a maximum parallel form, equivalence is shown decidable. In equivalence-preserving transformations, sufficient tested conditions for equivalence are formulated that depend only on the portion of the structure to be transformed. Current and future computational systems are evaluated in terms of results obtained for Flow Graph Schemata. A number of interesting extensions of the work are suggested
MAC TR by Project MAC (Massachusetts Institute of Technology)( )

in Undetermined and English and held by 23 WorldCat member libraries worldwide

A formal system for defining the syntax and semantics of computer languages by Henry F Ledgard( Book )

1 edition published in 1969 in English and held by 20 WorldCat member libraries worldwide

The thesis of this dissertation is that formal definitions of the syntax and semantics of computer languages are needed. This dissertation investigates two candidates for formally defining computer languages: (1) the formalism of canonical systems for defining the syntax of a computer language and its translation into a target language, and (2) the formalisms of the lambda-calculus and extended Markov algorithms as a combined formalism used as the basis of a target language for defining the semantics of a computer language. Formal definitions of the syntax and semantics of SNOBOL/1 and ALGOL/60 are included as examples of the approach. (Author)
Symbolic integration by Joel Moses( Book )

2 editions published in 1967 in English and held by 19 WorldCat member libraries worldwide

SIN and SOLDIER are heuristic programs written in LISP which solve symbolic integration problems. SIN (Symbolic INtegrator) solves indefinite integration problems at the difficulty approaching those in the larger integral tables. SIN contains several more methods than are used in the previous symbolic integration program SAINT, and solves most of the problems attempted by SAINT in less than one second. SOLDIER (SOLution of Ordinary DIfferential Equations Routine) solves first-order, first-degree, ordinary differential equations at the level of a good college sophomore and at an average of about five seconds per problem attempted. The differences in philosopy and operation between SAINT and SIN are described, and suggestions are made for extending this work. (Author)
MAC technical memorandum by Project MAC (Massachusetts Institute of Technology)( )

in English and held by 18 WorldCat member libraries worldwide

Symbolic mathematical laboratory by W. A. P Martin( Book )

3 editions published in 1967 in English and held by 16 WorldCat member libraries worldwide

A large computer program has been developed to aid applied mathematicians in the solution of problems in non-numerical analysis which involve tedious manipulations of mathematical expressions. The mathematician uses typed commands and a light pen to direct the computer in the application of mathematical transformations; the intermediate results are displayed in standard text-book format so that the system user can decide the next step in the problem solution. Three problems selected from the literature have been solved to illustrate the use of the system. A detailed analysis of the problems of input, transformation, and display of mathematical expressions is also presented. (Author)
A simulator of multiple interactive users to drive a time-shared computer system by H Greenbaum( Book )

4 editions published between 1968 and 1969 in English and held by 16 WorldCat member libraries worldwide

Constructing and maintaining a time-shared computer system requires a controlled, repeatable environment for making performance measurements. This thesis describes the use of a small second computer to simulate the actions of multiple interactive users over individual communication lines. Each simulated user exhibits responses similar to those of a 'normal' interactive user; these are recognized and verified by the 'simulator.' The simulator also emulates a 'think time' corresponding to a normal user's think time between typing lines on the console. Text corresponding to a user's console input, as well as control information regarding think time simulation and verification of responses from the system being tested, are retrieved from prepared scripts which have been pre-stored on the small computer's magnetic disc unit. Although the programming package is capable of simulating up to 12 users, only four are simulated here. The simulator system is intended to be used to test the M.I.T. CTSS and Multics time-shared computer systems. However, it is designed to be adaptable for testing most time-shared computer systems having serial character oriented input/output over communications lines interfacing with 103A compatible data sets. (Author)
Program analysis by digital computer by Daniel U Wilde( Book )

3 editions published in 1967 in English and held by 15 WorldCat member libraries worldwide

Comparing properties of non- and self-modifying programs leads to the definition of independent and dependent instructions. Non-modifying programs contain only independent instructions, and such programs can be analyzed by a straight-forward, two-step analysis procedure. First, program control flow is detected; second, that control flow is used to determine program data flow or data processing. However, self-modifying programs can also contain dependent instructions, and then program control flows and data flows exhibit cyclic interaction. This cyclic interaction suggests using an iterative or relaxation analysis technique. Initially, the relaxation procedure determines a first approximation to control flow; the second step, to data flow. These two steps are repeated until steady-state condition is reached. Algorithms for implementing the first iteration are presented. These algorithms are capable of analyzing programs which modify their control and processing instructions while executing. Also described are data structures which permit constructing functional expressions for data flow or information processing. Finally, actual output flowcharts of self-modifying programs are displayed. (Author)
Some upper and lower bounds on decision procedures in logic by Jeanne Ferrante( Book )

1 edition published in 1974 in English and held by 15 WorldCat member libraries worldwide

PILOT : a step toward man-computer symbiosis by Warren Teitelman( Book )

2 editions published in 1966 in English and held by 14 WorldCat member libraries worldwide

PILOT is a programming system constructed in LISP. It is designed to facilitate the development of programs by easing the familiar sequence: write some code, run the program, make some changes, write some more code, run the program again, etc. As a program becomes more complex, making these changes becomes harder and harder because the implications of changes are harder to anticipate. In the PILOT system, the computer plays an active role in this evolutionary process by providing the means whereby changes can be effected immediately, and in ways that seem natural to the user. The user of PILOT feels that he is giving advice, or making suggestions, to the computer about the operation of his programs, and that the system then performs the work necessary. The PILOT system is thus an interface between the user and his program, monitoring both the requests of the user and the operation of his program. The user may easily modify the PILOT system itself by giving it advice about its own operation. This allows him to develop his own language and to shift gradually onto PILOT the burden of performing routine but increasingly complicated tasks
The Multiplexed information and computing service : programmers' manual by Project MAC (Massachusetts Institute of Technology)( Book )

5 editions published between 1969 and 1974 in English and held by 14 WorldCat member libraries worldwide

Incremental simulation on a time-shared computer by Malcolm Murray Jones( Book )

2 editions published in 1968 in English and held by 12 WorldCat member libraries worldwide

The thesis describes a system which allows simulation models to be built and tested incrementally. It is called OPS-4 and is specifically designed to operate in the environment of the Multics system. It represents a major expansion and improvement of the OPS-3 system implemented in CTSS and also includes many features adapted from other current simulation systems. The PL/1 language, augmented by many additional statements and new data objects, provides the basis for defining models in OPS-4. A list of desirable features for an incremental simulation system is presented and it is shown how OPS-4 incorporates these features, whereas other current simulation systems satisfy only some of them and are not suitable for use in time-shared environment. A simplified model of page and segment fault handling in Multics illustrates some of the features OPS-4 provides to allow the user to continuously interact with a model during its construction, testing and running phases. It also illustrates how the user himself may portray portions of a model that are not yet defined. (Author)
A computer-controlled graphical display processor by James Gerard Fiasconaro( Book )

2 editions published in 1970 in English and held by 10 WorldCat member libraries worldwide

The report describes the design, construction and operation of a low-cost, relatively sophisticated display processor that can be used with a standard cathode-ray tube (CRT) monito to display computer-generated pictures. The design was based on the following desired characteristics. The display processor should be able to intensify any one of the 1024 X 1024 raster points of the 10 X 10 inch display area. It should be able to draw straight lines of arbitrary length (up to 1024 raster units along each coordinate). It should be able to display any of the 96 printable ASCII characters. And finally, it should provide two character sizes and eight intensity levels. (Author)
Hierarchical associative memories for parallel computation by Jeffrey Lee Gertz( Book )

2 editions published in 1970 in English and held by 8 WorldCat member libraries worldwide

Two current trends in computing, namely the increasing importance of parallelism in computer operations and the concept of programming generality, indicate that new computer systems must employ location-independent addressing. One possible manner of accomplishing this objective involves the use of an associative memory for the computer system. The report is concerned with the study, analysis, and design of a multi-level associative memory for a highly parallel computer system, as well as the representation and execution of highly parallel programs in such a memory hierarchy. (Author)
Progress report VI, July 1968 to July 1969 by Project MAC (Massachusetts Institute of Technology)( Book )

1 edition published in 1969 in English and held by 1 WorldCat member library worldwide

moreShow More Titles
fewerShow Fewer Titles
Audience Level
Audience Level
  Kids General Special  
Audience level: 0.74 (from 0.36 for Progress R ... to 1.00 for Papers, ...)

Alternative Names

controlled identityMassachusetts Institute of Technology

controlled identityMassachusetts Institute of Technology. Laboratory for Computer Science

Le M.A.C.


Massachusetts Institute of Technology Project MAC

Project M.A.C.

Project M.A.C. (Massachusetts Institute of Technology)

Project MAC

Project MAC Cambridge, Mass

Project MAC (Massachusetts Institute of Technology)

English (66)