Search

This paper provides performance results using the SPERRY UNIVAC 1100 Series linear programming product FMPS to solve a set of 16 real-world linear programming problems. As such, this paper provides a data point for the actual performance of a commercial simplex algorithm on real-world linear programming problems and shows that the simplex algorithm is a linear time algorithm in actual performance. Correlations and performance relationships not previously available are also provided. [ABSTRACT FROM AUTHOR]

This article presents information about a research paper which examines the functions realizable with word-parallel logical and two's complement addition instructions. H. Tim Gladwin has shown a number of programming tricks involving binary numbers, some of which are represented in this paper. It was assumed that two's complement (or unsigned) arithmetic is used, and that overflow may be ignored. Gladwin's motivation is to provide simple tests to determine whether or not a number is of a certain binary form. Leslie Lamport gives similar tricks for comparison of integers when several are packed in a single word. In the discussed paper, a theorem is described from which one may easily deduce whether or not a coding trick of this general class exists for computing a given function, followed by an efficient implementation of sign propagation that does not use shifting instructions or branching instructions. In this theorem, sign propagation means considering a certain bit position in a word to be the sign bit in the two's complement representation of a number.

Presents comments and suggestions for the publication the journal "Communications of the ACM." Proposition for the publication of papers; Criticisms on the article of Peter Naur in the December 1975 issue entitled "Programming Languages, Natural Languages, and Mathematics"; Comments on the contribution of Wallace E. Lin in the January 1976 issue.

The article reports on finding all subgraphs of an undirected graph [H]. A maximal complete subgraph is also called clique which refers to a complete subgraph that is not included in any other complete subgraph. According to the authors, a research paper was released wherein descriptions of techniques to find maximal complete subgraphs are provided. The authors discussed two algorithms using a branch-and-bound technique so that there will be no clique. The first algorithm produces cliques in lexicographic order while the second is derived from the first algorithm.

This article presents information about contributions of Alan Turing in the field of computer science. Turing was a brilliant mathematician who showed that computers could not completely prove mathematical assertions. This connection between computers and mathematics was later used to develop a mathematical foundation for computer science, comparable to mathematical foundations for physics and other sciences. Born in 1912, Turing was accepted by Cambridge University, Cambridge, England in 1930 to study mathematics, and became a Fellow in 1934 at the age of 22, completing a dissertation that extended the group theory models of Von Neumann. After its beginning with Turing's pioneering paper in 1936, computer science emerged as a mature discipline in the 1960s, when universities nationwide started offering it as an undergraduate program of study. The new discipline of computer science viewed computation as information processing, a transformation of input to output--where the input is completely defined before the start of computation, and the output provides a solution to the problem at hand.

The article provides information on the upcoming symposiums related to the computer engineering in 1966. A one-day symposium will be sponsored by ACM, SIAM and Florida State University on March 14 on "The Recommended Impact of Computer Applications on the Undergraduate Mathematics Curriculum." The four New York Metropolitan Area chapters will hold a one-day symposium in New York City on March 18. A session of invited papers will be devoted to "The Application of Computers to the Problems of a Metropolitan Society." In addition, a session of contributed papers on any topics in the computer field is now in the process of being organized . Automatic Data Processing exhibits and workshops headline the Federal Government Accountants Association 15th National Symposium, in Minneapolis, June 15-17. Topics include "Case Studies in ADP," "Programming: The Modern Budget Officer's Tool," and "The Future of Computers in the Federal Government." The Instrument Society of America (ISA) has invited papers for presentation at the 21st Annual ISA Conference and Exhibit, to be conducted October 24-27 in New York City. Theme of the meeting is "Instrumentation for an Urban Society."

The purpose of this note is to report computational experience additional to that recently summarized by Gue et al., with two algorithms for the zero-one linear programming problem. An error in Gue's paper is corrected. The utility of one of the algorithms as a suboptimizer is indicated. [ABSTRACT FROM AUTHOR]

The article presents abstracts of some of the papers that were published in the "Journal of the Association for Computing Machinery." A number of observations and comments are directed toward suggesting that more than the usual engineering flavor be given to computer science. The engineering aspect is important because most present difficulties in this field do not involve the theoretical question of whether certain things can be done, bat rather the practical question of how can they be accomplished well and simply. The teaching of computer science could be made more effective by various alterations, for example, the inclusion of a laboratory course in programming, the requirement for a strong minor in something other than mathematics, and more practical coding and less abstract theory, as well as more seriousness and less game playing. Recursive formulas for the numerical evaluation of the real convolution integral are derived for the case in which the impulse response is given analytically. These formulas require considerably less computation time and memory space than the general time series formulas and can be effectively applied for digital simulation of continuous physical systems.

The article explores design-oriented mathematical practices in school and work settings. The article represents two scenes that show people working on design problems in very different places. In the first scene, a group of seventh graders have decided that separate space for tubs and wash basins in a dormitory floorplan for college students in Seattle, Washington. With savings from the redesigned bathrooms, they propose a better insulated dormitory for the colder climate of Duluth, Minnesota. The second scene shows a civil engineer leaning over paper space views of a housing development project proposed for a hilly region of California. People in both scenes combine different representations to model space and its intended use. To understand how mathematical reasoning develops to support this activity a research team compares settings at three levels of analysis. The practical goal of the article is to improve learning and teaching mathematics in grades 6, 7, and 8. This involves developing curriculum units that package together simulation environments.

Presents a note on author C.J. Cheney's paper 'Nonrecursive List-Compacting Algorithm,' which appeared in the November 1970 issue of the periodical 'Communications of the ACM.' Effect of circular list consisting exclusively of non-items on the flow of the list-compacting algorithm; Structural meaning of the list-compacting algorithm.