Search

A calendar of events for the Fall Joint Computer Conference 1968 technical program is presented. Information about several papers that will be discussed at a symposium including doctor Sanford Elkin's "Reliability, Maintenance, Error Recovery in Third Generation Systems" and doctor Glen Lewis "Applied Mathematics" is presented.

The article presents information on professional activities within the Association for Computing Machines (ACM). ACM Southeastern Regional Meeting will be conducted on April 18-20, the ACM Southeastern Region will hold a meeting at the Sheraton-Nashville Hotel in Nashville, Tennessee. The Association for Computing Machinery will sponsor the Sixth International Users Conference on May 14-17 at the Sheraton-Anaheim Hotel in Anaheim California. Coast Community. The Boy Scouts of America (BSA) recently published a booklet for use in its merit badge program on Computing. BSA is now looking for computer professionals to help Scouts attain the required skilk for this badge interested persons should contact their local Boy Scout offices.

In a companion paper to this, "I Methodology and Experiences," the automatic Clenshaw-Curtis quadrature scheme was described and how each quadrature formula used in the scheme requires a cosine transformation of the integrand values was shown. The high cost of these cosine transformations has been a serious drawback in using Clenshaw-Curtis quadrature. Two other problems related to the cosine transformation have also been troublesome. First, ... conventional computation of the cosine transformation by recurrence relation is numerically unstable, particularly at the low frequencies which have the largest effect upon the integral. Second, in case the automatic scheme should require refinement of the sampling, storage is required to save the integrand values after the cosine transformation is computed. This second part of the paper shows how the cosine transformation can be computed by a modification of the fast Fourier transform and all three problems overcome. The modification is also applicable in other circumstances requiring cosine or sine transformations, such as polynomial interpolation through the Chebyshev points. [ABSTRACT FROM AUTHOR]

Clenshaw-Curtis quadrature is a particularly important automatic quadrature scheme for a variety of reasons, especially the high accuracy obtained from relatively few integrand values. However, it has received little use because it requires the computation of a cosine transformation, and the arithmetic cost of this has been prohibitive. This paper is in two parts; a companion paper, "II Computing the Cosine Transformation," shows that this objection can be overcome by computing the cosine transformation by a modification of the fast Fourier transform algorithm. This first part discusses the strategy and various error estimates, and summarizes experience with a particular implementation of the scheme. [ABSTRACT FROM AUTHOR]

This paper discusses the multiplication of conformable sequences of row vectors, column vectors, and square matrices. The minimum time required to evaluate such products on ordinary serial computers as well as parallel computers is discussed. Algorithms are presented which properly parse suck matrix sequences subject to the constraints of the machine organization. [ABSTRACT FROM AUTHOR]

The consecutive retrieval property is an important relation between a query set and record set. Its existence enables the design of an information retrieval system with a minimal search time and no redundant storage. Some important theorems on the consecutive retrieval property are proved in this paper. Conditions under which the consecutive retrieval property exists and remain invariant have been established. An outline for designing an information retrieval system based on the consecutive retrieval property is also discussed. [ABSTRACT FROM AUTHOR]

Analyzes the proposed American Standard Vocabulary of Information Processing and the Vocabulary of Terms Used in Information Processing developed by the Federation for Information Processing and the International Computation Centre. Influence of earlier works on the vocabularies; Distinctive contributions; Caliber of the technical experts involved and the prestige of the sponsoring organizations.

A previous paper presented an efficient algorithm, called the Recomputation Algorithm, for evaluating a rational expression to within any desired tolerance on a computer which performs variable-precision arithmetic operations. The Recomputation Algorithm can be applied to expressions involving any variable-precision operations having O(10-... + Σ ∣ε∣) error bounds, where p denotes the operation's precision and ε, denotes the error in the operation's with argument. This paper presents an efficient variable-precision exponential operation with an error bound of the above order. Other operations, such as log, sin, and cos, which have simple series expansions, can be handled similarly. [ABSTRACT FROM AUTHOR]

The article presents information on various chapters of the Association for Computing Machinery (ACM) across the U.S. The Greater Rio Grande Chapter of ACM has recently extracted from its files a list of the titles of all technical papers presented at Chapter meetings since its inception in 1957. Using a program developed by D.K. Robbins of Sandia Corp., a KWIC-type listing of permuted titles of these papers has been made. This listing has been distributed to all members of the Chapter. Topics and speakers at ACM Chapters across the U.S. indicate the current trends of interest in computer science and data processing. The ACM Tidewater Chapter is sponsoring this spring a professional development course on "Real-Time Computing." The course is given by the Chapter's professional development chairman, Cecil Frost, who is applications staff specialist for Control Data Corp. At its April 21, 1966 meeting, the Westchester-Fairfield Chapter heard William Orchard-Hays speak on "Linear Programming of Computational Techniques."