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.

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]

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

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."

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]

This paper discusses modularization as a mechanism for improving the flexibility and comprehensibility of a system while allowing the shortening of its development time. The effectiveness of a "modularization" is dependent upon the criteria used in dividing the system into modules. A system design problem is presented and both a conventional and unconventional decomposition are described. It is shown that the unconventional decompositions have distinct advantages for the goals outlined. The criteria used in arriving at the decompositions are discussed. The unconventional decomposition, if implemented with the conventional assumption that a module consists of one or more subroutines, will be less efficient in most cases. An alternative approach to implementation which does not have this effect is sketched. [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]

A cellular array is a two-dimensional, checkerboard type interconnection of identical modules (or cells), where each cell contains a few hits of memory and a small amount of combinational logic, and communicates mainly with its immediate neighbors In the array. The chief computational advantage offered by cellular arrays is the improvement in speed achieved by virtue of the possibilities for parallel processing. In this paper it is shown that cellular arrays are inherently well suited for the solution of many graph problems. For example, the adjacency matrix of a graph is easily mapped onto an array; each matrix element is stored in one cell of the array, and typical row and column operations are readily implemented by simple cell logic. A major challenge in the effective use of cellular arrays for the solution of graph problems is the determination of algorithms that exploit the possibilities for parallelism, especially for problems whose solutions appear to be inherently serial. In particular, several parallelized algorithms are presented for the solution of certain spanning tree, distance, and path problems, with direct applications to wire routing, PERT chart analysis, and the analysis of many types of networks. These algorithms exhibit a computation time that in many cases grows at a rate not exceeding log2, n, where n is the number of nodes in the graph. Straight. forward cellular implementations of the well-known serial algorithms for these problems require about n steps, and noncellular implementations require from n2 to n3 steps. [ABSTRACT FROM AUTHOR]

Various kinds of interference between communicating parallel processes have been examined by Dijkstra, Knuth and others. Solutions have been given for the mutual exclusion problem and associated subproblems, in the form of parallel programs, and informal proofs of correctness have been given for these solutions. In this paper a system of parallel processes is regarded as a machine which proceeds from one state S (i.e. a collection of pertinent data values and process configurations) to a next state 5' in accordance with a transition rule S ⇒ S . A set of such rules yields sequences of states, which dictate the system's behavior. The mutual exclusion problem and the associated subproblems are formulated as questions of inclusion between sets of states, or of the existence of certain sequences. A mechanical proof procedure is shown, which will either verify (prove the correctness of) or discredit (prove the incorrectness of) an attempted solution, with respect to any of the interference properties. It is shown how to calculate transition rules from the "partial rules" by which the individual processes operate. The formation of partial rules and the calculation of transition rules are both applicable to hardware processes as well as to software processes, and symmetry between processes is not required. [ABSTRACT FROM AUTHOR]

This paper presents an approach to writing specifications for parts of software systems. The main goal is to provide specifications sufficiently precise and complete that other pieces of software can be written to interact with the piece specified without additional information. The secondary goal is to include in the specification no more information than necessary to meet the first goal. The technique is illustrated by means of a variety of examples from a tutorial system. [ABSTRACT FROM AUTHOR]

In this paper an attempt is made to explore the logical foundations of computer programming by use of techniques which were first applied in the study of geometry and have later been extended to other branches of mathematics. This involves the elucidation of sets of axioms and rules of inference which con be used in proofs of the properties of computer programs. Examples are given of such axioms and rules, and a formal proof of a simple theorem is displayed. Finally, it is argued that important advantages, both theoretical and practical, may follow from a pursuance of these topics. [ABSTRACT FROM AUTHOR]

CODAS, a Customer Oriented Data System, is a user-oriented data retrieval and display system. The command language of the system provides the user with an easy means for specifying data retrieval and display requests. Data is displayed as tables and graphs produced in a format ready for publication. In this paper the statements of the request language and the general system design are described. [ABSTRACT FROM AUTHOR]

In this general paper the role of programming in advanced graduate training is discussed. Subject matter related to programming as well as programming per se is considered. The importance and application of formalism are considered and also the need for good empirical experimentation. A brief outline for a sequence of courses is included, and subject headings that have been obtained from an extensive bibliography are given. A bibliography of programming references is included. [ABSTRACT FROM AUTHOR]

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.

In the main text of the paper [Comm. ACM 9, 12 (Dec. 1966), 864], a FORMAC program was discussed which is capable of calculating various quantities of interest in tensor calculus. This Appendix is intended as an example of the program output. Christoffel symbols calculated for 12 bask orthogonal coordinate systems are listed. [ABSTRACT FROM AUTHOR]

Computer programming deals with an enormous variety of activities and is carried on by people with a great variety of backgrounds. It seems clear that part but not all of this activity h evolving toward a distinct professional field, but that the scope of this emerging profession, and some of its economic, social, and educational characteristics are as yet by no means well defined. In this paper, these issues are examined and some opinions about them are expressed. [ABSTRACT FROM AUTHOR]

The class of reducing transition languages introduced by Eickel, Paul, Bauer, and Samelson was shown by Morris to be a proper superclass of the simple precedence languages. In this paper this result is extended, showing that, in fact, the first class is equivalent to the class of deterministic context free languages. [ABSTRACT FROM AUTHOR]

This article reports on recent developments related to the Association for Computing Machinery (ACM). The ACM Nominating Committee is preparing to nominate candidates for Regional Representatives to Council from the Northeast, North Central, Pacific, and South Central regions. The elected representatives--one from each region--will serve a three-year term effective from June 1, 1975. The Special Interest Group on Computer Uses in Education has proposed two sessions for ACM 74. A session of four technical papers has been proposed. These four papers exhibit a rich variety of types of computer use in learning. One emphasizes the technique of artificial intelligence. Another paper by a Japanese author describes an ambitious computer managed system. The third paper illustrates a system that couples tape recorders to a minicomputer. And the fourth paper suggests the important role of the computer in self-paced courses. A new Committee on International Scientific and Technical Information Programs has been established within the Commission on International Relations of the National Academy of Sciences--National Research Council.

The article presents news related to the Association for Computing Machinery (ACM). Charles W. Gullotta has been appointed Chairman of the ACM Accreditation Committee by President Walter M. Carlson, to succeed Carl Hammer. The Accreditation Committee has been particularly active in the programmer training area, concerning itself with the creation of proper guidelines for trade school accreditation. The enthusiasm generated by the call for papers issued in early November 1970, for ACM 1971, the ACM annual conference, is evidenced by an unusually large early response. According to Melvyn H. Schwartz, Technical Program Chairman, 265 notices of intentions to submit papers have been received. Alan J. Perlis has been appointed by Yale University to be the first Eugene Higgins Professor of Computer Science. He will join the university's computer science department, effective July 1, 1971. The chair which he will occupy is named after Eugene Higgins, who was responsible for the establishment of trusts for the advancement of science at several major universities.

This article presents information on the Association of Computing Machinery's 20th anniversary conference that will be held in Washington in September 2005. Jack Minker, chairman of the technical program committee, revealed that 58 papers had been selected and that the program would stress the historical theme of the meeting--"Past Is Prologue,"--through the scheduled 25 sessions. He noted that there would be 19 formal sessions in which the number of papers had been limited to permit greater discussion and in-depth analysis of the subject. Approximately 80 exhibit booths had been reserved by manufacturers of computer hardware and peripheral equipment as well as a number of the leading software firms. The firms--including IBM, Univac, Control Data, Honeywell, Computer Sciences Corp., Computer Usage and others--will display a number of new product applications at the meeting, it is understood. Of special interest to conferees will be two special presentations relating to the history of computer development.

The article presents information on the second annual Computer Science Conference (CSC) that was held in Detroit, Michigan, from February 12 to February 14, 1974. All the components of the first CSC were present: the invited addresses, the short-paper sessions of 12-15 minute presentations, the employment register, the book exhibit, the banquet, the department chairmen's luncheon, and the overlap with the annual SIGCSE Technical Symposium. New features were a terminal exhibit of commercial products and an academic and research display of materials and systems developed in various educational contexts by computer science departments and others. Over 400 abstracts were presented at the 49 short-paper sessions; approximately 250 available positions were listed by employers, about equally divided between academia and industry, and some 400 prospective employees were registered. Total conference attendance topped 1,200. All of which indicates a favorable prognosis for the future of the Conference. The banquet speaker was John Opel, senior vice-president of IBM.

The article presents information on technical program and sessions of the "25th Anniversary Conference" of the Association for Computing Machinery (ACM), which would be held in Boston, from August 14-16, 1972. John J. Donovan would hold Feature session on "Current Research in Computer Science." The following papers would be presented in the paper sessions: "Artificial Intelligence: Theoretical Papers," by George W. Ernst; "Artificial Intelligence: General Paper," by Thomas G. Evans; "Implementation of Medical Information Systems," by Lael Gatewood; "Computer Languages for Interactive Health Services," by Allan H. Levy; and others.

Discusses a proposed reorganization of the Computer Systems Department of the Association for Computing Machinery. Information that the department has been divided into two sub-departments: Computer Architecture and Measurement, and Performance Evaluation; Functions and roles of the departments; Information on the steps taken by the association for the publication of valuable papers related to the field of computer science in the periodical "Communications of the ACM."

The article presents new briefs related to latest developments related to computer science in the United States. It reports that the legislation to classify computer-produced bills and statements of accounts as first class mail was introduced by Senator A. S. Monroney of Oklahoma. The Academic Computer Center at the United States Military Academy, West Point, would like to establish contact with persons having a strong programming and computer science background who are entering the army. The installation is highly student-oriented, has an operational in-house, 15-terminal, time sharing/remote batch system and has run over 150,000 programs this academic year. It is primarily interested in persons who will enter the service as enlisted men rather than officers. The Australian Computer Society, which was formally organized by a combination of a number of state societies, is establishing a journal at the professional level in the data, information processing, and computing fields. Papers are invited for publication in the inaugural and following issues of the Journal.

The article presents news related to the journal "Communications of the ACM." The report "Curriculum Recommendations for Graduate Professional Programs and Information Systems" that appeared in the May 1972 issue of the journal is now available as a separate reprint with heavy paper cover. The report is the result of over three years' work by the ACM Curriculum Committee on Computer Education for Management. The report is available at $1.50 per copy to ACM members and at $3.00 per copy to others. Orders accompanied by payment and clearly identified as for the report may be addressed to ACM Headquarters Order Department; ACM members are requested to give their member numbers. M. Stuart Lynn, Editor-in-Chief, is pleased to announce the July 1972 issue of Communications will be a Commemorative Issue in honor of ACM'S 25th Anniversary. This issue will be outstanding in every way. Especially solicited technical contributions will be presented in four groups. Fundamentals will cover the basic concepts and methodology, which underlie the application of computer techniques to the problems of the real world.

The article presents information on forthcoming events related to computer science. A two-day Association for Computing Machinery (ACM) Workshop in microprogramming will be held in Bedford, Massachusetts, October 7-8,1968. The ACM is sponsoring the workshop in cooperation with the Mitre Corp. The purpose of the workshop is to answer a need for discussing developments in microprogramming and its application with third generation equipment. The Instrumentation Society of America will sponsor the 1968 Research Conference on Instrumentation Science, July 29 - August 2, 1968, on the campus of Quinnipiac College, Hamden, Coinnecticut. The preliminary program and call for papers for the International Congress on Scientific Information, to be held in conjunction with the 34th International Federation for Documentation Conference in Moscow, Soviet Union, September 9-18, 1968 have been announced by the Soviet Organizing Committee. All individuals concerned with problems of scientific information are invited to participate.

Presents the author's comments on the paper "Reducing Truncation Errors by Programming," by J.M. Wolfe. Comments on Wolfe's proposal to use cascaded accumulators to evaluate a sum of the truncation errors; Remarks on the method used for rounding of errors; Advantages of using electronic computers which normalize floating-point sums before rounding or truncating them.