Search

This article focuses on the Association for Computers Machinery (ACM) 1968 National Conference and Exposition that was held during August 27-29, 1968 in Las Vegas, Nevada. A keener recognition of member interest and professional responsibilities characterizes the spirit in which the Conference Program for ACM68 was organized. Appropriately, technical and special sessions of timely and practical concern to the information processing; community have been planned for Conference attendees. The Program Committee has worked with ACM Special Interest Groups (SIG) and Special Interest Committees (SIC) in an effort to integrate SIG/SIC efforts with the aim of presenting a distinguished program. By developing sessions with the cooperation of ACM SIG's and SIC's, the Program Committee has attempted to evolve a program which is most responsive to the needs of the ACM membership. SIG and SIC also assisted the Program Committee by encouraging their members to develop and submit papers, and by advising the SIC on the newest developments in each special interest area. Further, they were able to provide knowledge and guidance to the SIC for the selection of session chairmen and technical paper referees.

Session 19 of the ACM 20th Anniversary Conference on August 31, 1967, was entitled Education, Design Experiments, and Computer Appreciation. Its second half consisted of a panel discussion on computer appreciation, organized and chaired by Elliott I. Organick. The four panelists were Charles H. Davidson, Bernard A. Goller, Richard W. Hamming, and Alan J. Perlis. After making prepared statements, the panelists were joined in discussion by Andries van Dam and Arthur B. Kohn, who had presented papers in the first half. This is a transcript of the panel discussion, condensed by Dr. Organick and edited by him and the panelists. Same remarks referred to papers by van Dam and Kahn or to the discussion during the first half of the session. Pertinent papers are included in the references. [ABSTRACT FROM AUTHOR]

The American Standard Code for Information Interchange (ASCII) contains a number of control characters associated with the principle of code extension, that is, with the representation of Information which cannot be directly represented by means of the characters in the Code. The manner of use of these characters has not previously been completely described. This paper presents a set of mutually consistent philosophies regarding code extension applications, and suggests a corollary set of doctrines for the application of the code extension characters. Distinctions are drawn between code extension and such other concepts as "graphic substitution" or "syntactic representation" which are often used to meet similar requirements. Also covered are certain topics which are not truly concerned with code extension but which are often linked with it in discussion on code applications. The material In this paper is equally applicable in principle to the (proposed) ISO international 7-bit code for information interchange. [ABSTRACT FROM AUTHOR]

The purpose of this paper is to present a comparison of some computer simulation languages and of some of the packages by which each is implemented. Some considerations involved in comparing software packages for digital computers are discussed In Part I. The issue is obvious: users of digital computers must choose from available languages or write their own. Substantial costs can occur, particularly in training, implementation and computer time if an inappropriate language is chosen. More and more computer simulation languages are being developed: comparisons and evaluations of existing languages are useful for designers and implementers as well as users. The second part is devoted to computer simulation and simulation languages. The computational characteristics of simulation are discussed with special attention being paid to a distinction between continuous and discrete change models. Part III presents a detailed comparison of six simulation languages and packages: SIMSCRIPT, CLP, CSL, GASP, GPSS and SOL. The characteristics of each are summarized in a series of tables. The implications of this analysis for designers of languages, for users, and for implementers are developed. The conclusion of the paper is that the packages now available for computer simulation offer features which none of the more general-purpose packages do and that analysis of strengths and weaknesses of each suggests ways in which both current and future simulation languages and packages can be improved. [ABSTRACT FROM AUTHOR]

In the first part of the paper, flow diagrams are introduced to represent inter al. mappings of a set into itself. Although not every diagram is decomposable into finite number of given base diagrams, this becomes true at a semantical level due to o suitable extension of the given set and of the basic mappings defined in it. Two normalization methods of flow diagrams are given. The first has three base diagrams; the second, only two. In the second part of the paper, the second method is applied to the theory of Turing machines. With every Turing maching provided with a two-way half-tape, there is associated similar machine, doing essentially the same job, but working on a tape obtained from the first one by interspersing alternate blank squares. The new machine belongs to the family, elsewhere introduced, generated by composition and iteration from the two machines χ and R. That family is proper subfamily of the whole family of Turing machines. [ABSTRACT FROM AUTHOR]

The aim of this paper is to provide background information on the existing literature on experimental design techniques which may be applicable to the design of computer simulation experiments for industrial systems. Although major emphasis is placed on analysis of variance techniques, three other techniques of data analysis are considered—multiple ranking procedures, sequential sampling and spectral analysis. The paper treats four specific experimental design problems and several techniques for solving them. The four experimental design problems are: (1) the problem of stochastic convergence, (2) the problem of factor selection, (3) the problem of motive and (4) the many response problem. [ABSTRACT FROM AUTHOR]

One of the most salient characteristics of extensible machines (EM) is the facility for providing system control over program-to-program and program-to-data linkage (e.g., address connection). It is the intent of this paper to expand and clarify the remarks concerning program-to-program and program-to-data linkage that were embodied in the authors' previous paper on the EM concepts, and to, finally, trace the employment of linkage mechanisms through various levels of programming languages. [ABSTRACT FROM AUTHOR]

This paper describes how some of the semantics of ALGOL 60 can be formalized by establishing a correspondence between expressions of ALGOL 60 and expressions in a modified form of Church's λ-notation. First a model for computer languages and computer behavior is described, based on the notions of functional application and functional abstraction, but also having analogues for imperative language features. Then this model is used as an "abstract object language" into which ALGOL 60 is mapped. Many of ALGOL 60's features emerge as particular arrangements of a small number of structural rules, suggesting new classifications and generalizations. The correspondence is first described informally, mainly by illustrations. The second part of the paper gives a formal description, i.e. an "abstract compiler" into the "abstract object language." This is itself presented in a "purely functional" notation, that is one using only application and abstraction. [ABSTRACT FROM AUTHOR]

The article talks about the popularity of Origami in the U.S. Origami in Japanese is the art of folding paper. According to Lillian Oppenheimer, a pioneer enthusiast and founder of an Origami Center in New York City, the Japanese and Chinese have worked or played at it as a craft or game for nearly 2000 years--about as long as paper itself has been known.

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

The article offers information about the 21st National Conference of the Association for Computing Machinery to be held in Los Angeles, California, from August 30 to September 1, 1966.

This article presents information related to refugees. The Hungarian refugees in Vienna, Austria, are living lives that cannot be IBM-carded. Most families are broken up, one or more of the adults living in a camp, the children in boarding schools or in private homes. They make fantastic treks to see each other. A man in a camp near Salzburg travels 400 miles each weekend to see his wife who cooks for an American family in Vienna. Their children are in a school in Lower Austria. He has no job; she has the only income in the family. They are more fortunate than some. The Intergovernmental Committee for European Migration has registered 1,898 refugees who are termed "hard-core"; too old, too sick or, for some other reason unable to work and, in most cases, impossible to place. Even those refugees who have skills do not easily find jobs. Although the Austrian economy, at present, is quite firm, it still cannot absorb much outside labor.

This article presents information on different newspapers, read by the people of the U.S. The article also presents an account of headlines and statements, published in these newspapers, regarding a controversy surrounding the students of Yale University in New Haven, Connecticut. One of the newspaper "San Francisco Chronicle," said that presidential candidate Adlai Stevenson quelled a pushing, pulling mob of Yale students by appealing to their pride as Yale men and Americans." As reader, Francis J. Carr, of Palo Alto, California observes: "The upshot of the whole affair was that apparently the Yale students were in a rather festive mood."

The article presents an exploration into the personality and political profile of the advisor Pat Moynihan to the administration of President Richard Nixon. Moynihan's views on poverty and the political responsibility of the government concerning them are discussed, highlighting comments written in the book "Republican Papers," by Melvin Laird.

The article deals with the uses of paper. It cites the method of delivering food and medicine performed by the U.S. Army in the Pacific islands. The Army used paper containers in dropping supplies in the surf and allowed those to float in with the tide. In Alaska, Guadalcanal and other outposts, paper has been used in insulating huts.

Presents the author's experience of constructing a reform calendar. Report that the author and his wife went to a party where he had a glass of champagne; Information on the need of calendar reform by the author as told to his wife by a priest; Plans of the author to deliver a lecture on his own calendar reform.

The article talks about advertising and publishing in colonial America. The first reference to America among advertising antiquities was found in a booklet caused to be printed by Samuel Macham. The development of publishing in the U.S., which began with William Rittenhouse's establishment of the first paper mill in America in 1690 and the start of a newspaper in Boston by Benjamin Harris in September 25, 1690, is discussed. The history of advertising in the U.S. is also discussed.

The article presents information about how American Bank Note Co. fends off counterfeiters and thieves. Despite the creative ability needed to transform mere paper into something of more value, absolute security is the company's greatest asset. Each piece of paper entering the plant must be traced throughout the production process and counted between twenty-two and twenty-seven times. Each shipment that leaves the plant must be sealed to prevent tampering, and although no company shipment has ever been highjacked, delivery of the currency to customers has sometimes demanded originality and even daring on the part of company personnel.

The article discusses the conservation of paper as a way of helping in the development of a battleship by the U.S. Navy. The Navy uses sixteen tons of paper for the plans, designs and blueprints for a ship. The construction of a Flying Fortress takes 20,000 drawings. The restriction of paper use is a way of contributing to the war effort.

Focuses on the taxation of the income of U.S. President Richard Nixon. Announcement that Nixon would pay the taxes he owed to Internal Revenue Service and the Senate-House Joint Committee on Internal Revenue Taxation on his income during the first four years of his presidency; Information about the gross income of the president during that period; Details of deductions for a gift of his pre-presidential papers to the National Archives; Information about the valuation of donated papers by a professional appraiser.

Presents the investigation of taxes by U.S. President Richard M. Nixon. Overstatement made by the Nixon; Discussion of the donation of papers with former U.S. President Lyndon Johnson; Efforts of the Congress to close the tax loophole that allowed for the donating of deductible papers; Overview on the investigation; Estimation of the amount of possible deduction on tax returns of Nixon for four year, 1969 to 1972.

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 news related to the Association for Computing Machinery (ACM). The new position of Director of Administration has been established at ACM Headquarters and Joseph Saetta has been hired to fill it. The position collects into one department the activities of three units which were previously in different department. They are--first, the unit which handles all membership, subscription, and single copy transactions; second, the unit which handles purchasing, the stock room, and incoming and outgoing mail; and third, the accounting unit. The Second ACM Symposium on Symbolic and Algebraic Manipulation will be held on March 23-25, 1971, at the International Hotel in Los Angeles, California. The Special Interest Group on Symbolic and Algebraic Manipulation is sponsoring the symposium, with the Special Interest Group on Artificial Intelligence as a co-sponsor. The symposium will cover developments in the field in the past five years. A number of sessions of contributed papers are scheduled, and approximately ten invited tutorial papers will survey key subject areas. The symposium will be of interest to users of both symbolic and manipulation systems as well as to system developers.

An efficient method of ordered retrieval of binary words from an associative memory, as described by Lewin, is based on the case of special readout circuits which indicate the digit values present in the individual digit columns of the memory. Thus the circuits indicate whether the individual digit columns contain digits of both values, or of only one value, or contain no digits at all (i.e. that the memory is empty). The use of these circuits, which in this paper are termed column value indicators, reduces considerably the number of memory accesses necessary to retrieve in order a number of distinct binary words from the memory. Lewin proves that, for the readout by the described method of m distinct binary words, 2m-1 memory accesses are necessary. (Thus he proves that the number of necessary memory accesses of his method, unlike those of other methods, is independent of the word length.) In this paper a very simple proof of this theorem derived from some elementary aspects of the structure of sets of binary numbers is presented. [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."

As linear programming models grow bigger and bigger in size, much actual data that must be memorized is often put on magnetic tape or disk, and consequently there is an improportionately fast rise in the consumption of computer time. To cut down this expense, on ever increasing effort Is mode to design more efficient algorithms. This paper is meant to support the effort. If is attempted to find some characteristics of the way pivot column is found. The number of repetitions of a certain transfer of data from tape to core memory is considered. After some simplification, the problem is restated in a general way. The generating function of the probability distribution and the moment generating function of the number of repetitions is found. Asymptotic formulas are given for the moments using result from a paper of S. Narumi [1]. The results may be applied to write very efficient routines that search for an extreme value in a table. Formulas provide a means of calculating the computer timings in this case. [ABSTRACT FROM AUTHOR]

The use of the Kleene regular expression notation for describing algebraic language syntax, in particular of ALGOL is described in this paper. A FORTRAN II computer program for carrying out the elimination algorithm of Gorn, similar to Gaussian elimination for linear systems of algebraic equations, is described. This was applied to numerous smaller languages, including some sublanguages of ALGOL. A hand calculation result of the application of the algorithm to all of ALGOL is given, thus expressing the Revised ALGOL 1960 syntax in completely nonrecursive terms, as far as its context-free portion is concerned. This description in many ways is far more intuitively understood than the previous recursive description, it is suggested. The paper also includes results of the machine program, which does not include a simplification algorithm. [ABSTRACT FROM AUTHOR]

The article presents the author's comments on the paper "We Need Both Professions. Neither Is Likely to Eliminate the Other." The author says that one needs to merely scan the works of popular 19th Century Protestant preachers to find their exhortations to follow the path of good conduct and to avoid the pitfalls of evil. The Catholic preachers of this period did not ignore the reality of sin. However, the paper claimed that people generally doubt the reality of virtue nowadays but this is not true because psychiatrists are trying to make their patients behave in a way which, in the old days, would have been called virtuous.

Focuses on grand jury system investigating the leakage of secret documents from the U.S. Department of Defense. People accused of duplicating the Pentagon papers; Provisions related to secrecy of proceedings in the Federal Rules of Criminal Procedure; Information that because Lynda Sinay, the woman who had allegedly helped duplicate the Pentagon Papers, testified before the grand jury, is free from possible prosecution.

The article reports on the changes on the signature of the Treasurer of the United States on paper currencies. The signature in American paper currencies has been changed from Dorothy Andrews Elston to Dorothy Andrews Kabis. This change was made following the treasurer's marriage to W.L. Kabis in September.