Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/800182acmconferencesBook PagePublication Pagesacm-national-conferenceConference Proceedingsconference-collections
ACM '74: Proceedings of the 1974 annual conference - Volume 1
ACM1974 Proceeding
Publisher:
  • Association for Computing Machinery
  • New York
  • NY
  • United States
ISBN:
978-1-4503-7482-8
Published:
01 January 1974

Reflects downloads up to 10 Oct 2024Bibliometrics
Abstract

No abstract available.

Article
Free
Semantic attributes and improvement of generated code

Once the general principles of compilation by semantic attributes have been exposed, it is then demonstrated, with the help of a simple example, how such an approach leads naturally to an amelioration of the generated code without resorting to any ...

Article
Free
Rounding error in evaluating continued fraction expansions

It is well known that continued fraction expansions provide a useful means for representing and computing values of functions. Expansions for many functions of mathematical analysis and physics are contained in the literature [1, 7, 9, 10]. Other ...

Article
Free
Structure of a direct-execution high-level Chinese programming language processor

Chinese language computer systems are those computer systems which accept programs in Chinese programming languages as well as data in Chinese characters. There are a number of ways that such a computer system could be implemented. This paper describes ...

Article
Free
Heuristic programmers and their gambling machines

Following our paper given at the IFIP Congress 71, another progres report is presented of our ongoing research efforts aimed at human decision making under uncertainty and risk. We have studied many aspects of human and machine learning processes, ...

Article
Free
Optimal scheduling of independent tasks on heterogeneous computing systems

In this paper, the problem of optimal scheduling of independent tasks on heterogeneous computing systems is considered. Optimal scheduling algorithms which produce preemptive schedules with minimal completion times and non-preemptive schedules with ...

Article
Free
Interpolating numerical solutions of ordinary differential equations

Methods like the Runge-Kutta family for the solution of ordinary differential equations produce approximate solutions only at mesh points. The efficiency of such methods is greatly reduced if the user requests output too frequently. This paper justifies ...

Article
Free
Cost evaluation of storage schemes

In this paper we present a methodology for the cost evaluation of file system performance. The cost structure we consider takes into account the various operations that are required during the processing of data in the system. The cost evaluation ...

Article
Free
Human factors design criteria in man-computer interaction

The need for better understanding of human behavior in the Management Information Systems (MIS) environment has been recognized. One method of examining this behavior is to describe man as an information processor and focus on his ability to store, ...

Article
Free
Scheduling in systems with two scarce resources

Few optimality results have been reported for the scheduling of computer systems with more than one resource. This paper considers a system with two independently-scheduled scarce resources, which may be thought of as a CPU and an I/O channel, and two ...

Article
Free
Assisting network users with a network access machine

Accessing networks of heterogeneous computer systems can often be cumbersome due to differences in command languages and conventions. Approaches toward improving these conditions are identified and a specific solution - a “Network Access Machine” - is ...

Article
Free
Semantic preprocessing

Many preprocessor systems exist to transform a program from an augmented language to the particular language expected by a processor. Historically these have been capable of only simple lexical or syntactic substitutions (macro processors). This paper ...

Article
Free
Automatic nested dissection

Nested dissection is an ordering technique used to order the sparse symmetric positive definite systems of linear equations arising from discretizations to elliptic boundary value problems yielding regular n × n grids. By taking a recursive view of ...

Article
Free
An excellent mixture for PSI: Computer science, PLATO, knowledge levels.

Introductory computer science courses offer an excellent test bed for utilizing a personalized system of instruction. The ubiquity and operating hours of computer terminals and computer centers in educational institutions is ideal for student self-...

Article
Free
Compile time type determination in SETL

In this paper, some features of the SETL language are presented. Also discussed are two methods for determining the data types of runtime objects in higher level languages from the static program text. The first method determines the type of a variable ...

Article
Free
An overview of a multi associative processor study

In this paper, a brief introduction is given to a multi associative processor computer system. This architecture embodies multiple control units, each capable of SIMD operation on an associatively addressed set of processing elements. The purpose of the ...

Article
Free
The algebraic solution of large sparse systems of linear equations using REDUCE 2

This paper discusses some of the problems encountered during the solution of a large system of sparse linear equations with algebraic coefficients, using REDUCE 2. Of particular importance is intermediate expression swell, which ultimately uses up all ...

Article
Free
Mechanical construction of type-checking predicates for extensible data types

The intent of this paper is to propose a simple mechanical procedure by which type checking predicates can be constructed for extensible sets of data types. Type checking under these circumstances is nontrivial because the potentially infinite (or at ...

Article
Free
The bureau of labor statistic's Table Producing Language (TPL)

A national statistical agency such as the Bureau of Labor Statistics usually produces the results of its surveys in tabular form at the cost of a substantial portion of its data processing resources. The tables are often quite complex with common ...

Article
Free
Goals and plans in a program for playing Go

A program that plays Go provides a basis for analyzing possibilities for extending present AI conceptions of planning and goal structures to problems that are ill-structured, dynamic, multiperson, resource-bound, and highly interactive. The focus is on ...

Article
Free
The variable cell length listprocessor VARLIST

A listprocessing system which allows assignment of cells of any length, expressed in a discrete number of computer words, is proposed for a wider range of problems than just for the algebraic manipulation systems for which it was designed. Erasure of ...

Article
Free
An approach to optimal partitioning of hypergraphs

The problem of determining optimal partitions of hypergraphs (or, more simply of ordinary graphs), is relevant in several areas, such as computer aided design of printed boards, information retrieval and program paging. In many cases there exist optimal ...

Article
Free
An extrapolation step-size monitor for solving ordinary differential equations

A step-size monitor is presented for use in numerically solving ordinary differential equations by extrapolation methods. The monitor uses the information present in the extrapolation lozenge to determine the “optimal” step-size and order. This allows ...

Article
Free
Computational requirements for control of the utah arm

Figure 1 illustrates an above-elbow amputee fitted with a three-degree-of-freedom prosthetic arm. The development of a successful prosthetic arm requires the completion of two tasks. First, a controller must be devised which can determine an amputee's ...

Article
Free
Avoiding deadlock in distributed data bases

Deadlock prevention mechanisms and a deadlock protection mechanism for distributed data base systems are presented. The notion of process sets used in preventing deadlock is introduced. Examples are given to illustrate these methods for avoiding file ...

Article
Free
Scheduling independent processors with different storage capacities

The analysis of multiprocessor scheduling strategies has been the focus of substantial research in recent years. Because of the inherent complexity of the general scheduling problem, many researchers have proposed simple mathematical models of computing ...

Article
Free
SYNVER: A system for the automatic synthesis and verification of synchronization processes

The automatic synthesis of systems of synchronized processes and the proof of the synchronization's correctness is discussed. A general system, SYNVER, is proposed. Its input is a problem description and its output is a set of communicating processes ...

Article
Free
A model highlighting the security of operating systems

The major thrust toward providing secure computing facilities has gone into the design of, or models for, new operating systems. Work directed toward securing current systems has, for the most part, taken the form of penetration attempts. Penetration ...

Article
Free
Access control in a relational data base management system by query modification

This work describes the access control system being implemented in INGRES (INteractive Graphics and REtrieval System). The scheme can be applied to any relational data base management system and has several advantages over other suggested schemes.

...

Article
Free
Skeleton planning spaces for non-numeric heuristic optimization*

The AFTERMATH system implements a heuristic technique for improving long solutions (up to about 250 steps) for robot planning problems. AFTERMATH transforms the given solution into a skeleton solution that focuses attention on repetitious and opposite ...

Article
Free
A method to expose the hidden structure of Fortran programs

Program structure is inherent in program design; therefore special keywords such as "if... then ... else” or "do ... while” are useful only to the extent that they reveal that structure.

A simple listing of Fortran program statements is ineffective for ...

Contributors

Index Terms

  1. Proceedings of the 1974 annual conference - Volume 1

    Recommendations