Advertisement

Characteristics of the FORTRAN CEP language

The FORTRAN CEP languages differs from FORTRAN II mainly because: (1) it extends the variety of the modes for real quantities; (2) it allows suitable mixtures, in an input/output list or in an expression, of quantities that occur under different modes; (3) it makes it possible to address a greater number of input/output equipment; and (4) it removes the restrictions on the complexity of the list of quantities to be transmitted between the magnetic core memory and the drum or the magnetic tape units.

Autosate

An automated data system analysis technique is described. The technique is designed to alleviate some of the principal problems that beset current analysis—large data workloads, long span of time between project inception and system operational date, the lack of explicit directions for conducting data system analysis and using the results, and the lack of a technique to control data system changes throughout its lifetime. The analysis is geared to determining workload, relationships and storage characteristics of documents in the information network automatically.

Experimental personalized array translator system

A system designed for intimate man-machine interaction in a general-purpose problem-solving environment is experimentally operational. The system utilizes an array-oriented symbolic source language containing powerful statement types. These include numeric, Boolean, relational and selection operators on operands which can be entire arrays. The system also permits simple specification of test and argument arrays in single statements. The completely symbolic operating system includes display and entry of program and data. Sequence control is aided by an interrupt switch which allows the user to interact with the program during execution. In addition to normal stored program sequencing, the system provides trace options and the ability to enter any statement for immediate execution. Present implementation of the system is with an interpretive translator on an IBM 1620 computer.

Generation of test matrices by similarity transformations

A method for obtaining test matrices with a prescribed distribution of characteristic roots is given. The process consists of using particularly simple similarity transformations to generate full matrices from canonical forms. The matrices generated also have known characteristic vectors, inverses and determinants.

Numerical solution of nonlinear two-point boundary problems by finite difference methods

Solution of nonlinear two-point boundary-value problems is often an extremely difficult task. Quite apart from questions of reality and uniqueness, there is no established numerical technique for this problem. At present, shooting techniques are the easiest method of attacking these problems. When these fail, the more difficult method of finite differences can often be used to obtain a solution. This paper gives examples and discusses the finite difference method for nonlinear two-point boundary-value problems.

Symbol manipulation in FORTRAN: SASP I subroutines

A set of subroutines for use in FORTRAN are described whose purpose is to synthesize output strings from (i) input strings which have been analysed by the SHADOW general syntactic analysis subroutine reported earlier, and/or (ii) packed BCD strings formed in any way. Function-type subroutines are included for intermediate manipulations, which are performed on the strings which are stored in an abbreviated internal representation. The automatic way in which an internal representation for each newly created substring is stored sequentially in a block of common storage, and the manner in which a storage block is dynamically allocated for that purpose, are discussed.

Growing applications of linear programming

Use of linear programming models has grown so extensively in recent years that the whole concept for organizing a computer code has undergone a radical change. It no longer is adequate merely to reduce a mathematical algorithm (i.e. the simplex method) to a computer code. An advanced code must cope with such a variety of situations that the respective computer subprograms must be organized into an integrated system.Emphasis in this paper is devoted to the underlying principles upon which future linear programming systems must be based. These viewpoints are influenced by the new demands that applications within the petroleum industry are placing on such systems. Some of the components of such a system are: translation of problem statement in terms of basic data to linear programming matrix coefficients, data transmission for direct computer entry, data file at the computer center, data processing and editing prior to solving the simplex algorithm, an efficient and reliable code for solving the above-mentioned algorithm, and flexible means for summarizing the results.

Shape the Future of Computing

ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.

Get Involved

Communications of the ACM (CACM) is now a fully Open Access publication.

By opening CACM to the world, we hope to increase engagement among the broader computer science community and encourage non-members to discover the rich resources ACM has to offer.

Learn More