Showing papers by "Applied Science Private University published in 1977"
TL;DR: A parallel computational method is described that provides a simple and fast algorithm for the evaluation of polynomials, certain rational functions and arithmetic expressions, solving a class of systems of linear equations, or performing the basic arithmetic operations in a fixed-point number representation system.
Abstract: A parallel computational method, amenable for efficient hardware-level implementation, is described. It provides a simple and fast algorithm for the evaluation of polynomials, certain rational functions and arithmetic expressions, solving a class of systems of linear equations, or performing the basic arithmetic operations in a fixed-point number representation system. The time required to perform the computation is of the order of m carry-free addition operations, m being the number of digits in the solution. In particular, the method is suitable for fast evaluation of mathematical functions in hardware.
97 citations
TL;DR: The technique is to test for surface proximity in a well defined manner, ‘ well spaced’ surfaces requiring a simple measure of distance to determine priority, and ‘closely spaced' surfaces being modified until they are ‘well spaced�’.
Abstract: Most hidden surface algorithms require a considerable amount of computation for all but the simplest images. This prevents their use in real time systems where new frames may be calculated at a rate of 25 per second. The paper presents an approach suitable for fixed models, such as those used in flight simulators, where most of the time consuming computation may be performed when the model is first created. The technique is to test for surface proximity in a well defined manner, ‘well spaced’ surfaces requiring a simple measure of distance to determine priority, and ‘closely spaced’ surfaces being modified until they are ‘well spaced’. This modification is only in the representation of the surface and does not affect its final appearance in the picture. The work to be described is part of a project financed by the Science Research Council, to which grateful acknowledgement is made.
11 citations
TL;DR: In this article, a 70ft high hydraulic fill dam was constructed as a home-made do-it-yourself project on a ranch near Hollister, Calif. from 1912-1931.
Abstract: This 70-ft high hydraulic fill dam was constructed as a home-made do-it-yourself project on a ranch near Hollister, Calif. from 1912-1931. It is in one of the most seismically active zones in the state. Following a policy set for all hydraulic fill dams, as a result of the 1971 San Fernando earthquake, a recent request from the State Division of Dam Safety required it to be analyzed according to latest techniques for seismic safety. The paper describes the analysis which was carried out and the basis for the conclusions that the dam should be adequately stable against the maximum credible earthquake. The major reason for this unexpected result for an old hydraulic fill dam is that it was constructed slowly in lifts at about 0.5 m to 1 m per year for 19 yr, predominantly of clayey soil, and with ample time for desiccation drying and consequent strengthening of the soil during construction.
5 citations
TL;DR: A megachannel pulse-height analysis system using a PDP-8/E computer and two moving-head disk memories has been developed as mentioned in this paper, which has a storage capacity of 220 memory locations, is capable of processing 1100 events/s, and provides on-line sorting and disk storage.
Abstract: A megachannel pulse-height analysis system using a PDP-8/E computer and two moving-head disk memories has been developed. The system has a storage capacity of 220 memory locations, is capable of processing 1100 events/s, and provides on-line sorting and disk storage. An X- or Y-pulse-height spectrum in coincidence with one or several arbitrary pulse-height windows can be assembled in core for scope display and spectral analysis within 2 to 20 seconds. Reconstruction of a complete X- or Y-pulse-height spectrum requires about 3 minutes.
2 citations