{"title":"COMMEN: a new approach to programming languages","authors":"L. J. Cohen","doi":"10.1145/1465482.1465590","DOIUrl":"https://doi.org/10.1145/1465482.1465590","url":null,"abstract":"The Compiler Oriented for Multiprogramming and Multi-processing ENvironments is an outgrowth of the FADAC Automatic Test Analysis Language (FATAL) developed for the University of Pennsylvania under their contract with the Frankford Arsenal to investigate techniques for the automatic check-out of electronic circuits. The purpose of the FATAL Compiler was to prepare programs for execution in the FADAC Computer. This computer has a two-wire teletype input-output system that can be used to establish connections between a unit under test and a set of test equipments through an interface device. The configuration for the check-out system is shown in Figure 1.","PeriodicalId":127219,"journal":{"name":"AFIPS '67 (Spring)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1967-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131677342","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":"Centralized vs. decentralized computer assisted instruction systems","authors":"M. Gelman","doi":"10.1145/1465482.1465545","DOIUrl":"https://doi.org/10.1145/1465482.1465545","url":null,"abstract":"This discussion deals with a qualitative comparison of two configuration alternatives in the design and implementation of a Computer Assisted Instruction (CAI) System. With CAI in its infancy and in a necessarily experimental stage, there is little available data upon which to develop quantitative support for the opinions expressed herein. In this respect, CAI bears a definite kinship with \"time-sharing\" systems. It can in fact be strongly argued that CAI is essentially a special form of the \"time-sharing\" system. At this stage of CAI development we are still dealing with \"guesstimates\" of mass storage requirements for course material, quantity of course material required to reside \"on-line\" at a given time and tolerable response times in the interaction among student, student terminal, and terminal controllers.","PeriodicalId":127219,"journal":{"name":"AFIPS '67 (Spring)","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1967-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126574538","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":"The MULTILANG on-line programing system","authors":"R. Wexelblat, H. A. Freedman","doi":"10.1145/1465482.1465575","DOIUrl":"https://doi.org/10.1145/1465482.1465575","url":null,"abstract":"This paper describes the organization of an on-line programing system mechanized as an experiment in problem-solving. Although not primarily a conversational system, a limited amount of interplay is possible. Designed as a bootstrapped operation, the subroutines associated with the operating system of the central processor may be called directly by a user's program and combined into larger entities. The system is built upon an information retrieval file system developed at the University of Pennsylvania and known as MULTILIST which simulates a large content-addressable store of programs and data.","PeriodicalId":127219,"journal":{"name":"AFIPS '67 (Spring)","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1967-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127592535","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":"The place of digital backup in the direct digital control system","authors":"J. M. Lombardo","doi":"10.1145/1465482.1465608","DOIUrl":"https://doi.org/10.1145/1465482.1465608","url":null,"abstract":"The key to the success of direct digital control on large industrial processes lies in its flexibility in implementing everyday process control problems as well as advanced control at lower overall system cost. Control concepts for continuous processes use the computing, monitoring, information storage and analytical ability of the direct digital control computer. In the batch or discontinuous process the computer's logic capability is emphasized. To perform batching operations, a comprehensive logic system is necessary. Implementation of such a system using digital techniques provides many advantages over implementation using analog equipment with auxiliary digital logic circuits.","PeriodicalId":127219,"journal":{"name":"AFIPS '67 (Spring)","volume":"339 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1967-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115886168","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":"An integrated MOS transistor associative memory system with 100 ns cycle time","authors":"R. Igarashi, T. Yaita","doi":"10.1145/1465482.1465565","DOIUrl":"https://doi.org/10.1145/1465482.1465565","url":null,"abstract":"Since the announcement of the development of a technique for using MOS transistor integrated circuits as associative memory cells, 128 words of 48 bits per word associative memory has been experimented and engineered.","PeriodicalId":127219,"journal":{"name":"AFIPS '67 (Spring)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1967-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123334761","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":"File management on a small computer the C-10 system","authors":"Gilbert Steil","doi":"10.1145/1465482.1465512","DOIUrl":"https://doi.org/10.1145/1465482.1465512","url":null,"abstract":"C-10 is a general purpose file management system that has been implemented by The MITRE Corporation for the IBM 1410. It is of interest for two reasons: first, it is one of the most flexible file management systems ever attempted for a machine the size of the IBM 1410; and second, the conditions surrounding its implementation have produced a design for a large system of programs that displays some uncommon and useful characteristics. These uncommon characteristics include a strong affinity for redesign; a framework for debugging that eliminates the need for memory dumps, symbolic snapshots, and other conventional debugging aids; and an adaptability to machines of various memory sizes and configurations without reprogramming.","PeriodicalId":127219,"journal":{"name":"AFIPS '67 (Spring)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1967-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122063703","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":"The design and implementation of a table driven compiler system","authors":"C. L. Liu, G. Chang, R. E. Marks","doi":"10.1145/1465482.1465593","DOIUrl":"https://doi.org/10.1145/1465482.1465593","url":null,"abstract":"The broader application of digital computers to various areas of studies has prompted the design and usage of special purpose problem-oriented programming languages. Although designing and writing a compiler for a special purpose language is no more a mysterious task as it was ten years ago, it is still, in most cases, a very tedious task that might take a large number of man-months to perform. The purpose of designing a generalized table-driven compiler system is to allow a user to write his own compiler for his special language at a reduction of the time currently required in the implementation of a compiler for a new source language. It should be pointed out that not only can a user design a compiler of his own but he can also make modifications, large or slight, to an existing compiler developed with the system. This, therefore, also provides an ideal simulation environment in connection with the implementation of new ideas in translation process. This particular line of development in translation systems naturally lends itself to the increasing use of digital computers in a time-sharing environment.","PeriodicalId":127219,"journal":{"name":"AFIPS '67 (Spring)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1967-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129858843","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 compact data structure for storing, retrieving and manipulating line drawings","authors":"A. V. Dam, David Evans","doi":"10.1145/1465482.1465580","DOIUrl":"https://doi.org/10.1145/1465482.1465580","url":null,"abstract":"The field of graphical man/machine interaction is customarily split into hardware and software areas. The former can be considered to have come of age: there are over twenty-five brands of off-the-shelf consoles with all the requisite input devices, and new techniques and improvements are constantly being developed. Many consoles are also provided with primitive supporting software which allow one to draw points, lines, arcs, etc., in a symbolic language of some sort. Less well understood and developed, however, is that aspect of display software concerned with representing and manipulating the problem model from which these primitive point/line/arc pictures are derived. The \"data structure\" is the machine representation of the often complex and hierarchical problem model. It must be judiciously derived from the model on the one hand and, on the other, lead readily to the reduced console display file of points, lines and arcs which cause the actual visual display. Furthermore, the data structure must be efficiently stored and processed (usually contradictory requirements).","PeriodicalId":127219,"journal":{"name":"AFIPS '67 (Spring)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1967-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130565503","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":"Serving the needs of the information retrieval user","authors":"C. Merritt","doi":"10.1145/1465482.1465549","DOIUrl":"https://doi.org/10.1145/1465482.1465549","url":null,"abstract":"During the last few years, there have been a large number of reports, papers and articles written on a variety of information retrieval systems. I believe that too much has been written on the needs of information retrieval systems, and not enough either researched or written on the needs of the user. Webster's Collegiate Dictionary states that \"need\" is a \"necessary duty; obligation; or a condition requiring supply or relief.\" This clearly defines what we mean by the \"needs\" of the information retrieval user. Despite all the advances in the field of information retrieval, we may inadvertently be building limitations into many of our information systems, simply because we are not fully considering the user, his needs, his reactions and his interactions with information retrieval.","PeriodicalId":127219,"journal":{"name":"AFIPS '67 (Spring)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1967-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121627327","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 functional description of macromodules","authors":"S. Ornstein, M. Stucki, W. Clark","doi":"10.1145/1465482.1465537","DOIUrl":"https://doi.org/10.1145/1465482.1465537","url":null,"abstract":"This paper describes a set of macromodular building blocks such as registers, adders, memories, control devices, etc., from which it is possible for the electronically-naive to construct arbitrarily large and complex computers that work. Machines are assembled by plugging the modules into cells of a special frame which provides for communication between adjacent cells. Explicit data pathways and control structures are then made by plugging in standardized cables. All pieces of a system are therefore recoverable and systems can be reconfigured easily. Data modules process twelve-bit word-segments; greater word lengths are obtained by interconnecting modules. Memory modules hold 4096 twelve-bit segments and can also be interconnected to form larger arrays. Particular attention is given to the problem of designing control structures. The control signals for a given process are routed along the cables of a control network whose topology is isomorphic to the flow diagram representing the process. The step from conception to realization can therefore be made directly.","PeriodicalId":127219,"journal":{"name":"AFIPS '67 (Spring)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1967-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122592688","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}