ACM '65Pub Date : 1965-08-24DOI: 10.1145/800197.806064
J. C. Reynolds
{"title":"Programming languages for non-numeric processing—2: An introduction to the COGENT programming system","authors":"J. C. Reynolds","doi":"10.1145/800197.806064","DOIUrl":"https://doi.org/10.1145/800197.806064","url":null,"abstract":"THE COGENT (COmpiler and GENeralized Translator) programming system is a compiler whose input language is designed to describe symbolic or linguistic manipulation algorithms. Although the system is intended primarily for use as a compiler compiler, it is also applicable to such problem areas as algebraic manipulation, mechanical theorem-proving, and heuristic programming.\u0000 In designing the system the major objective has been to unify the concept of syntax-directed compilation1 with the more general but primitive concept of recursive list-processing2. This objective is achieved by using the syntax of a language to define a mapping between strings of the language and list structures. Given such a mapping, linguistic processes become equivalent to list processes, and a list-processing language becomes a concise vehicle for describing such processes.\u0000 Thus a program written in the COGENT language is a list-processing program in which the list structures normally represent phrases of one or more object languages (i.e., the input and output languages to be processed by the program), in a representation determined by the syntax of these languages. Correspondingly, the COGENT language itself contains two major constructions: productions, which define the object language syntax, and generator definitions, which define list-processing subroutines called generators.","PeriodicalId":213949,"journal":{"name":"ACM '65","volume":"347 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1965-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120892223","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
ACM '65Pub Date : 1965-08-24DOI: 10.1145/800197.806058
T. G. Evans
{"title":"Man-machine interaction: Machine-aided design of context-free grammars","authors":"T. G. Evans","doi":"10.1145/800197.806058","DOIUrl":"https://doi.org/10.1145/800197.806058","url":null,"abstract":"A RECENT TREND of great potential importance is the increased on-line use of digital computers to permit a close coupling of user and machine in solving a wide variety of problems. Program debugging, theorem proving, mechanical design, architectural design, and mathematical manipulation are among the areas in which the use of such on-line techniques has already been attempted. With the spread of large-scale time-sharing systems, which are intended to make extensive usage of this type economically feasible, this approach will unquestionably be extended to many other areas.\u0000 In this paper we shall not be concerned with such questions as the relative merits of various formal models of syntax. Rather, taking the extensive use of context-free grammars as evidence of their presently-established utility to at least some class of users, our purpose is to describe a program which permits the convenient on-line use of a digital computer as an aid in the modification and testing of such grammars. Both the structure and the use of the program are described in detail in the following sections.","PeriodicalId":213949,"journal":{"name":"ACM '65","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1965-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124727849","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
ACM '65Pub Date : 1965-08-24DOI: 10.1145/800197.806060
R. Kronmal, M. Tarter
{"title":"Analysis of computational systems: Cumulative polygon address calculation sorting","authors":"R. Kronmal, M. Tarter","doi":"10.1145/800197.806060","DOIUrl":"https://doi.org/10.1145/800197.806060","url":null,"abstract":"The cumulative polygon address calculation sort has been shown to be of considerably more general use, in terms of speed, robustness, and capacity than previously investigated algorithms. A method will be given which will make it possible for the file to be sorted in place instead of in a work area.\u0000 There will not be space in this paper to derive expressions for the expected number of comparisons and exchanges as well as storage and time estimates. Instead the effect of the simplifying assumptions will be discussed in the light of their effect upon “sorting in place.”","PeriodicalId":213949,"journal":{"name":"ACM '65","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1965-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130248237","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
ACM '65Pub Date : 1965-08-24DOI: 10.1145/800197.806055
C. Baugh
{"title":"Undergraduate research in computer sciences: FODESAR: FORTRAN dependent storage allocation and relocation package","authors":"C. Baugh","doi":"10.1145/800197.806055","DOIUrl":"https://doi.org/10.1145/800197.806055","url":null,"abstract":"IN FORTRAN PROGRAMMING of extensive storage problems the programmer has to devise elaborate schemes to make use of available space. The programmer also has to define the extent of the storage before execution, even when the sizes of the various data blocks are unknown. These requirements place severe restrictions on the efficient use of the size of the storage—the inability to re-use no longer needed space and the inability to specify storage no larger than needed. FODESAR has been devised using FORTRAN to provide the programmer with a dynamic storage allocation and relocation scheme which would allow for varying programmer's needs during execution.\u0000 The FODESAR package has been developed in such a way that it can handle any type of problem which can be reduced to a list process problem. It has the capability of linking data blocks together to form complex list structures. However, the main impetus for the original package was matrix operation with dynamic storage allocation and relocation, and as a result extensive work has been completed in this area. One should keep in mind that FODESAR is a general storage scheme even though throughout the description matrix examples and terminology are used; also since FODESAR is written in FORTRAN, it is adaptable to most machines and can easily be extended by adding further routines.\u0000 At present, FODESAR is under development. For this reason many of the procedures outlined below may undergo substantial revisions during implementation.","PeriodicalId":213949,"journal":{"name":"ACM '65","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1965-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132014092","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
ACM '65Pub Date : 1965-08-24DOI: 10.1145/800197.806030
K. U. Smith
{"title":"Recent study of teaching: cybernetic foundations of learning science","authors":"K. U. Smith","doi":"10.1145/800197.806030","DOIUrl":"https://doi.org/10.1145/800197.806030","url":null,"abstract":"APPRECIATION of the significance of computer systems for feedback analyses depends on one's understanding of the cybernetic model. Until recently, feedback control in the living system has been assumed generally to conform to the negative-feedback servo-system model for control of minimal error. We conceptualize the cybernetic model as encompassing both positive- and negative-feedback regulation and many different modes of maximal-error, variable-error, constant-error, differentiated-error, and integrated-error control. Further, we see the living body not as a single-channel system, but as a multichannel response mechanism which can generate sensory input independently of external stimulation and also can match, modulate, compare, order, integrate, differentiate, block, and vary sources of external stimulation. Our theory is that the nature of performance and the course of learning are determined directly by the variable feedback effects of these different modes and dimensions of cybernetic control9, 13.","PeriodicalId":213949,"journal":{"name":"ACM '65","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1965-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123283945","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
ACM '65Pub Date : 1965-08-24DOI: 10.1145/800197.806037
J. Snediker
{"title":"Complex information processing: a self organizing program for describing concepts","authors":"J. Snediker","doi":"10.1145/800197.806037","DOIUrl":"https://doi.org/10.1145/800197.806037","url":null,"abstract":"ASSOCIATED WITH MANY ARTIFICIAL intelligence problems there is a set of <underline>elementary objects</underline> with which the problem is concerned. This set of objects constitutes the <underline>universe</underline> for a particular problem. Typical examples might be the set of machine printed numerals 0-9, the set of all possible positions in a checker game, or the set of military land vehicles. The objects in any one of these sets possess various <underline>properties</underline> (e.g., shape, color, size, strength), and each particular object assumes one of several <underline>values</underline> for each of these properties. Each property then, by virtue of its values, partitions the universe into disjoint, exhaustive subsets. By suitable combinations of these subsets (i.e., set-theoretic union and intersection), one can create new sets whose elements possess any desired property values for all properties. This fact motivates the following definition of the word “concept”. A <underline>concept</underline> is defined as a set of elementary objects whose members can be identified as belonging to the set by virtue of their distinguishing properties<supscrpt>2</supscrpt>. We desire some method of describing and manipulating concepts that is suitable, in terms of memory requirements and logic, for use on a digital computer.","PeriodicalId":213949,"journal":{"name":"ACM '65","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1965-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126966374","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
ACM '65Pub Date : 1965-08-24DOI: 10.1145/800197.806056
R. J. Lewis
{"title":"Undergraduate research in computer sciences: Real time computerized expressway traffic control in the Chicago area","authors":"R. J. Lewis","doi":"10.1145/800197.806056","DOIUrl":"https://doi.org/10.1145/800197.806056","url":null,"abstract":"MANY URBAN and metropolitan areas have surface street networks, expressway, and high-speed road systems that are adequate for normal operation, but which become congested during the peak demands imposed by commuter travel. Since peak demand occurs only for short periods of about four hours a day, it is not economical to increase road capacity by more road construction even if this is possible. A more economical approach is to design an automated information and control system that will improve the operation of present facilities.\u0000 Several organizations have been established for the purpose of studying traffic operations and feasibility of the implementation of electronic control systems. The John C. Lodge Expressway Project in Detroit has used closed circuit television for visual surveillance, but recently went to an electronic detector and computer system using a CDC 8090 as the central processor. The metropolitan Toronto1 project uses a detector system and a UNIVAC 1107 computer to control traffic intersection signal lights. In this paper we will review the work done by a Chicago traffic study group, the Chicago Area Expressway Surveillance Project.","PeriodicalId":213949,"journal":{"name":"ACM '65","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1965-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127009988","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
ACM '65Pub Date : 1965-08-24DOI: 10.1145/800197.806068
S. Saltzman
{"title":"Management information systems: Survey of principle types of simulation models of the firm","authors":"S. Saltzman","doi":"10.1145/800197.806068","DOIUrl":"https://doi.org/10.1145/800197.806068","url":null,"abstract":"DIFFERENT TYPES of abstract models have been used for years in industry to describe activities and aid in the solution of management problems. It has been only in the last fifteen years, however, that this formal approach to the solution of some of these problems has developed to its present relatively sophisticated state. Much of the credit for the initiation of this development can be attributed to individuals from various disciplines who were active in the first industrial applications of operations research following the Second World War12. Since then, representatives of many different disciplines such as computer science, mathematics, statistics, engineering, economics, and the physical and behavioral sciences have contributed to the rapid growth of the applications of quantitative methods to the solution of management problems.","PeriodicalId":213949,"journal":{"name":"ACM '65","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1965-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130245279","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
ACM '65Pub Date : 1965-08-24DOI: 10.1145/800197.806072
G. Hain, K. Hain
{"title":"System optimization: Automatic flow chart design","authors":"G. Hain, K. Hain","doi":"10.1145/800197.806072","DOIUrl":"https://doi.org/10.1145/800197.806072","url":null,"abstract":"A PROGRAM can be logically described as a set of elements Aj, which contain the instructions, and a matrix cjk which gives the connections between these elements (JUMP instructions). (In PERT terms the elements Aj are events, and the cj,i are activities.) Here the attempt is made to draw a two-dimensional picture of the logical structure of a program by disregarding the specific contents of the elements. To get this picture two facts are important.\u0000 (a) - There is a hierarchy, namely the order by which the elements are called. This order would be unique if there were no closed loops. Therefore, the first aim is to achieve this unique order by handling the loops appropriately and then setting up the sequential order. (Level structure, y-coordinates.)\u0000 (b) - Usually there will be more than one element in one of these levels, so that the task is now to sort the elements in such a way that there will be as little crossing of connecting lines as possible; furthermore, similar elements shall be brought as close together as possible. (Branch structure, x-coordinates).","PeriodicalId":213949,"journal":{"name":"ACM '65","volume":"1975 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1965-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130057704","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
ACM '65Pub Date : 1965-08-24DOI: 10.1145/800197.806044
S. J. Tauber
{"title":"Information retrieval: digital handling of chemical structures and associated information","authors":"S. J. Tauber","doi":"10.1145/800197.806044","DOIUrl":"https://doi.org/10.1145/800197.806044","url":null,"abstract":"THE NEED for ready access to chemical information is by now generally recognized as common to many different agencies within government as well as to industrial, academic, and other private organizations. A review of techniques available for finding chemical information and of work in progress toward improving and augmenting those techniques will not here be attempted1. This paper concentrates on our work at the National Bureau of Standards and our approach to developing the techniques required for a major chemical information system. Our group seeks to develop the necessary techniques but has no desire to establish or operate a chemical information center. We instead make the results of our work available to those organizations with responsibility for such an operation.","PeriodicalId":213949,"journal":{"name":"ACM '65","volume":"34 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1965-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114306349","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}