Search

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.

Invites research publications for various conferences on computer science that will be held in the coming months.

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]