{"title":"Discovery and learning techniques for pattern recognition","authors":"Rebecca C. Prather, L. Uhr","doi":"10.1145/800257.808900","DOIUrl":"https://doi.org/10.1145/800257.808900","url":null,"abstract":"The problem of pattern recognition is that of grasping the meaning of complex entities. A great variety of problem areas attempt to cope with Just such complexities. The importance of discovery and induction methods embedded within a pattern recognition program lies in their potential generality. The program, rather than the programmer, can be asked to discover and learn about the problem area. Pattern recognition should ultimately provide powerful techniques for use in such research areas as form perception, target recognition, language translation, theorem proving, game playing, and the testing of psychological models. Research on some of these applications is already underway. To the extent that discovery and induction can be successfully employed by the program itself, they should be used. This paper describes a program that makes a beginning attempt at such use.","PeriodicalId":167902,"journal":{"name":"Proceedings of the 1964 19th ACM national conference","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1964-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117191525","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}
{"title":"META II a syntax-oriented compiler writing language","authors":"D. V. Schorre","doi":"10.1145/800257.808896","DOIUrl":"https://doi.org/10.1145/800257.808896","url":null,"abstract":"META II is a compiler writing language which consists of syntax equations resembling Backus normal form and into which instructions to output assembly language commands are inserted. Compilers have been written in this language for VALGOL I and VALGOL II. The former is a simple algebraic language designed for the purpose of illustrating META II. The latter contains a fairly large subset of ALGOL 60. The method of writing compilers which is given in detail in the paper may be explained briefly as follows. Each syntax equation is translated into a recursive subroutine which tests the input string for a particular phrase structure, and deletes it if found. Backup is avoided by the extensive use of factoring in the syntax equations. For each source language, an interpreter is written and programs are compiled into that interpretive language.","PeriodicalId":167902,"journal":{"name":"Proceedings of the 1964 19th ACM national conference","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1964-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116528513","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}
{"title":"Impact of computer technology on communications","authors":"B. R. Jacobellis","doi":"10.1145/800257.808931","DOIUrl":"https://doi.org/10.1145/800257.808931","url":null,"abstract":"The field of electronic computer technology is new compared to the electrical communication field - yet its impact has already been profound. More startingly is the observation that the impact already witnessed is only a minor encroachment which will find major exploitation in the next ten to fifteen years. Three major areas of impact on the electrical communication field have been selected as representing this important trend. These are: 1. Network performance analysis of a major communication system to effect real time control and engineering improvement. 2. Communication switching center design and design control. 3. Switching center hardware characteristics and functions.","PeriodicalId":167902,"journal":{"name":"Proceedings of the 1964 19th ACM national conference","volume":"204 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1964-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128714116","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}
{"title":"A bull's eye view of management and engineering information systems","authors":"A. Oettinger","doi":"10.1145/800257.808892","DOIUrl":"https://doi.org/10.1145/800257.808892","url":null,"abstract":"Prophets of doom are apt to misquote Vannevar Bush's statement that -and-ldquo;The investigator is staggered by the findings and conclusions of thousands of other workers -and-mdash; many of which he cannot find time to grasp, much less to remember, as they appear.-and-rdquo; (3) They then extrapolate to such shrill exaggerations as -and-ldquo;The enormous gap in our capacity to store and retrieve information and at the same time meet the demands and responsibilities in our society has created the most costly and wasteful drain on our resources, which is without parallel in the entire history of mankind.-and-rdquo;(4) A milder point of view is reflected in the statement that -and-ldquo;It is certainly not true that the world is about to go to the dogs or to suffocate in its information flood unless information processing is mechanized or otherwise totally overhauled. There is, of course, no doubt that information processing, like any other conceivable human activity, could be improved.-and-rdquo;(5)","PeriodicalId":167902,"journal":{"name":"Proceedings of the 1964 19th ACM national conference","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1964-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124000127","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}
{"title":"SIR: A statistical information retrieval system","authors":"C. D. Parsons","doi":"10.1145/800257.808921","DOIUrl":"https://doi.org/10.1145/800257.808921","url":null,"abstract":"This paper describes the techniques and results of an information retrieval system utilizing an IBM 7094 installation at Phillips Petroleum Company. The Statistical Information Retrieval (SIR) system employs a -and-ldquo;co-ordinate concept-and-rdquo; with a logic based on the statistical probability that a desired document will be abstracted with a relatively high percentage of the identical or synonym keywords used in posing an inquiry concerning the document subjects. This approach to retrieval allows the use of an unlimited vocabulary, thus eliminating the need for a dictionary or thesaurus. The SIR programming incorporates a unique computing technique, vector manipulations and a search strategy which permit the system to operate efficiently on a large-scale computer. A bibliography and a representative example of the SIR program input and output are contained in an Appendix.","PeriodicalId":167902,"journal":{"name":"Proceedings of the 1964 19th ACM national conference","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1964-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126522901","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}
{"title":"Computer and information sciences program for high school students","authors":"Daniel Asher, A. V. Dam, D. Prener","doi":"10.1145/800257.808915","DOIUrl":"https://doi.org/10.1145/800257.808915","url":null,"abstract":"A well-received pilot program held on seven consecutive Saturdays in 1962 led the University of Pennsylvania to initiate a full scale program in computer oriented mathematics and programming during July and August 1963. Thirty highly qualified students in a Basic Course studied number theory, switching circuits, and abstract algebra, with an underlying basis of machine language programming, software theory, and Fortran coding. Twenty Advanced Course students covered mechanical languages and system simulation. Six of these students assisted University professors in research problems. The 1964 program is sponsored by the National Science Foundation and has eighty-seven participants, nine of whom are high school teachers.","PeriodicalId":167902,"journal":{"name":"Proceedings of the 1964 19th ACM national conference","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1964-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133476290","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}
{"title":"Panel on computer science curriculum (Session LI)","authors":"W. F. Atchison","doi":"10.1145/800257.808917","DOIUrl":"https://doi.org/10.1145/800257.808917","url":null,"abstract":"The need for education in the computer field is one of the most pressing issues facing the computer profession. The purpose of this panel discussion on curriculum is to present to the audience outlines of complete undergraduate degree programs in computer science. Some indications of graduate programs will also be given. The first program presented below is in the process of being formulated. The next two already have several years of experience back of them. These presentations are for the purpose of presenting some ideas and guidance to the many schools starting or about to start programs in computer science or its equivalent.","PeriodicalId":167902,"journal":{"name":"Proceedings of the 1964 19th ACM national conference","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1964-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134624580","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}
{"title":"Automatic machine grading programs","authors":"G. Forsythe","doi":"10.1145/800257.808930","DOIUrl":"https://doi.org/10.1145/800257.808930","url":null,"abstract":"In connection with introductory programming and numerical analysis courses at Stanford University, grading programs have been used intermittently since 1961. The original idea came from the TEACH routine devised at Carnegie Tech. by A. J. Perlis and others. Our programs furnish data, check student answers in various ways, keep track of running time, and keep a -and-ldquo;grade book-and-rdquo; for the problems. They do not check the quality of the programming in any other way. In contrast to the TEACH routine, the Stanford routines, called GRADER1, GRADER2, etc., are written separately for each problem. The most flexible and useful system was used with the Burroughs 220 computer in the BALGOL language, a dialect of ALGOL 58, and will now be described. Each grader program was written as a BALGOL-language procedure. It was then compiled together with a procedure called BUTTERFLY, written by Roger Moore of Stanford. The result was a relocatable machine-language procedure, with a mechanism for equating its variables to variables of any BALGOL program, in just the form of the BALGOL compiler's own machine-language library procedures (SIN, WRITE, READ, etc.). Finally, the grader program was added to the compiler library tape for the duration of its use.","PeriodicalId":167902,"journal":{"name":"Proceedings of the 1964 19th ACM national conference","volume":"69 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1964-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127977760","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}
{"title":"Queueing in a memory-shared computer*","authors":"D. Fife, R. Rosenberg","doi":"10.1145/800257.808912","DOIUrl":"https://doi.org/10.1145/800257.808912","url":null,"abstract":"Multiple console, shared digital computers represent a new concept in computer design, in which emphasis is placed on ease of user communication with the machine, and rapid machine response to commands. A complete description of machine response characteristics must include the statistical behavior brought about by queues in the system. The numerical solution of a complex queueing model is one way of predicting the statistical response characteristics, and models incorporating a good deal of realism can be rapidly solved. To illustrate this viewpoint in a simple way, a queueing model has been developed for a multi-console computer with a multiply shared memory. The relation of the model to a physical system is described in detail, and the numerical solutions discussed. 50","PeriodicalId":167902,"journal":{"name":"Proceedings of the 1964 19th ACM national conference","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1964-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126762522","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}
{"title":"Iterative methods for solution of diffusion problems in r--and-thgr; geometry","authors":"D. B. MacMillan","doi":"10.1145/800257.808906","DOIUrl":"https://doi.org/10.1145/800257.808906","url":null,"abstract":"This paper compares three iteration methods for computing approximately a steady-state solution of the diffusion equation, in a pie-shaped region of the plane, using a finite mesh based on the r--and-thgr; coordinate system. The methods are successive line overrelaxation along curves of constant radius, successive line relaxation along radii, and alternating-direction-implicit iteration. It is concluded that the first-named of these three methods is superior, in that it is expected to converge faster for most problems.","PeriodicalId":167902,"journal":{"name":"Proceedings of the 1964 19th ACM national conference","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1964-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125621953","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}