Showing papers by "Computer Sciences Corporation published in 1969"
TL;DR: A method of optimizing the computation of arithmetic and indexing expressions of a Fortran program is presented, based on a linear analysis of the definition points of the variables and the branching and DO loop structure of the program.
Abstract: A method of optimizing the computation of arithmetic and indexing expressions of a Fortran program is presented. The method is based on a linear analysis of the definition points of the variables and the branching and DO loop structure of the program.The objectives of the processing are (1) to eliminate redundant calculations when references are made to common sub-expression values, (2) to remove invariant calculations from DO loops, (3) to efficiently compute subscripts containing DO iteration variables, and (4) to provide efficient index register usage.The method presented requires at least a three-pass compiler, the second of which is scanned backward. It has been used in the development of several FORTRAN compilers that have proved to produce excellent object code without significantly reducing the compilation speed.
22 citations
Patent•
23 Sep 1969TL;DR: In this article, the authors present a monitoring apparatus for binary coded communications between a plurality of stations, which includes receiver means for receiving binary signal and register means for sampling received binary signals in such a manner that they may be stored into memory means.
Abstract: Monitoring apparatus according to the present disclosure is capable of monitoring binary coded communications between a plurality of stations. The apparatus includes receiver means for receiving binary signal and register means for sampling received binary signals in such a manner that they may be stored into memory means. Display means is provided for retrieving and displaying alpha-numeric representations of the binary signals so that the individual characters of the binary coded communications may be displayed on the display read-out. One feature of the monitoring apparatus resides in a parity check apparatus wherein the parity of the binary coded characters may be verified.
6 citations
TL;DR: Computer memory reduction through Fortran higher level language, discussing tradeoff between costs saved and additional logic hardware.
Abstract: Computer memory reduction through Fortran higher level language, discussing tradeoff between costs saved and additional logic hardware
2 citations
TL;DR: In this article, a generalised form of Riccati-Bernoulli ordinary differential equations is shown to be reducible to equivalent linear systems of higher order through a nonlinear differential transformation.
Abstract: 1st-order nonlinear systems described by a generalised form of Riccati-Bernoulli ordinary differential equations are shown to be reducible to equivalent linear systems of higher order through a nonlinear differential transformation. The method is generalised further to cover systems governed by partial differential equations with Riccati-Bernoulli-type nonlinearities.
TL;DR: In this paper, the calculus of variations is used to optimize the proton shield weight consistent with certain proton attenuation requirements, for voids which are bounded by general surfaces and shielded by some or all available materials suitable for proton shields.
Abstract: The calculus of variations is used to optimize the proton shield weight consistent with certain proton attenuation requirements, for voids which are bounded by general surfaces and shielded by some or all available materials suitable for proton shields. The thickness of the shielding materials and their order at each point are found in terms of a variable Lagrange multiplier, the relative stopping powers and densities of the eligible shielding materials and the geometry of the void surface at the point. Regions on the surface of the void are delineated wherein all the prescribed shielding materials can be used, while in other regions some of these materials must be dropped in a given order.