{"title":"A general description of the national aeronautics and space administration real time computing complex","authors":"J. Hamlin","doi":"10.1145/800257.808890","DOIUrl":"https://doi.org/10.1145/800257.808890","url":null,"abstract":"Presented is a general description of the Real Time Computer Complex (RTCC), its objectives, and the design concepts being employed in its development. The RTCC is the computing and data processing system being developed for support of all manned spacecraft missions starting with the Gemini Rendezvous. In meeting Gemini requirements, the RTCC is required to handle 10 times the data flow, have 100 times the computing power, and 275 times the capacity of the Mercury System to present display information. The RTCC design challenge has been to provide an open-ended System to meet the long-term computing obligations of Gemini and Apollo missions and this has been met by developing a system design philosophy of modularity, in both equipment and programming. This design approach confines system functions to logical segments and enables substitutions of or modifications to either equipments or programming sub-parts without major redesign considerations or serious effect in other areas of the total system. The four IBM 7094 Mod II computer configuration with associated program packages for Gemini Rendezvous missions will be completed early in 1965.","PeriodicalId":167902,"journal":{"name":"Proceedings of the 1964 19th ACM national conference","volume":"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":"127629137","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":"Cadfiss test system computation and data flow integrated subsystem tests","authors":"W. I. Adams, P. Federico","doi":"10.1145/800257.808891","DOIUrl":"https://doi.org/10.1145/800257.808891","url":null,"abstract":"Project Mercury was the first space program to create a real time computer-centered, worldwide satellite tracking and communications network. This network is a complex of remote sites or stations having a direct, on-demand access to the Goddard Space Flight Center (GSFC) computers via various transmission linkages: teletype, submarine cable, land lines, etc. Distance between a given site and these computers ranges from less than one thousand miles on the one hand to worldwide proportions on the other. With such an extensive network, a quick and accurate method to determine network capability to provide mission support had to be developed. Such a method had to provide for the quick identification and isolation of any malfunction anywhere in the network. In addition, a -and-ldquo;test standard-and-rdquo; applicable to all sites was needed regardless of their individual equipment configuration. Thus, a status of -and-ldquo;Good-and-rdquo; at the Canary Islands had to be identical with a status of -and-ldquo;Good-and-rdquo; at Woomera, Australia. Another factor to be considered was the tendency of electronic equipment to drift off calibration after being peaked for support of a mission. This tendency required that the peaking and the means of status determination of the equipment for support of a mission had to be performed reasonably close to llftoff. To fulfill these requirements, CADFIST, a computer-controlled, automated, network test was designed. It is a real time tracking network status check which simultaneously tests the major subsystem at each of the world-wide sites for their ability and readiness to support manned missions. CADFIST is an abbreviation for Computation and Data Flow Integrated Subsystem Test. The system, made up of individual tests under control of a master program, is designed to provide a qualitative measure of how well certain logical subsets of the over all network are functioning. Without CADFISS testing, this network verification would have to be accomplished by a personor persons centrally located making visual and voice checks.","PeriodicalId":167902,"journal":{"name":"Proceedings of the 1964 19th ACM national conference","volume":"39 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":"130442790","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":"On the fixed charge transportation problem","authors":"K. Spielberg","doi":"10.1145/800257.808885","DOIUrl":"https://doi.org/10.1145/800257.808885","url":null,"abstract":"The paper primarily investigates the application of mixed-variable techniques (due to J. F. Benders) to the Fixed Charge Transportation Problem. On account of the special structure of the problem several parts of the general algorithm can be simplified. The mathematical programming part of the general iteration becomes essentially a zero-one integer programming problem. The linear programming part reduces to a transportation problem with certain prohibited routes, which is discussed in detail. An example for the iterative procedure is given.","PeriodicalId":167902,"journal":{"name":"Proceedings of the 1964 19th ACM national conference","volume":"34 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":"117134397","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":"SDI-5, an advanced system for selective dissemination of information","authors":"A. Barnes, A. Briggs, J. Gauss, A. Resnick","doi":"10.1145/800257.808922","DOIUrl":"https://doi.org/10.1145/800257.808922","url":null,"abstract":"Continued experimentation and operational experience have been incorporated into the programming of a new IBM 1401-7090 Data Processing System for Selective Dissemination of Information (SDI) now serving over 1200 scientific, technical and administrative personnel. The most significant new features are: Machine printing of all bibliographic information including abstracts and matching index terms. Control by the user of the type and quantity of information he receives. Segmentation of user's interest profiles into distinct interest areas. Weighting of user index terms. Extensive analysis routines to monitor user and system performance. Several procedures for automatically updating user interest profiles. Machine-controlled vocabulary guide for both user and document profiles.","PeriodicalId":167902,"journal":{"name":"Proceedings of the 1964 19th ACM national conference","volume":"7 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":"115307302","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":"Business and engineering enriched FORTRAN (BEEF)","authors":"Norman Moraff","doi":"10.1145/800257.808897","DOIUrl":"https://doi.org/10.1145/800257.808897","url":null,"abstract":"In April, 1961, the Westinghouse Baltimore Defense and Space Center established a truly integrated Information Processing Department with the responsibility of serving the combined needs of scientific research and engineering computer applications, as well as management information systems and business data processing. A single high-speed, large scale, binary, fixed-word length computer was selected as the heart of the computer facilities to be used. Personnel previously using similar equipment in Westinghouse had for a number of years used FORTRAN for programming the solution process of a broad spectrum of engineering work in the area of military electronics. Obviously, FORTRAN would continue to be used as a programming language in this area of activity. The limitations of FORTRAN in its original form as a data processing language were, of course, recognized, however, the introduction of another language was not considered economically feasible or desirable in the light of the heavy engineering FORTRAN load. Instead, it was decided to augment FORTRAN with a package of CALLable subroutines suitable for the new problem area. What has been developed is an enriched FORTRAN suitable for a much larger spectrum of applications than the original algebraic language. This enriched machine independent programming language is referred to as BEEF for Business and Engineering Enriched FORTRAN. This approach to the problem has also been taken by several computer installations throughout the country. In particular, Rocketdyne has implemented a system designated as COMFORTII, while the Sandia Corporation in an article in the Communications of the ACM in July 1962 outlined and commented on several of their FORTRAN callable data processing subroutines.","PeriodicalId":167902,"journal":{"name":"Proceedings of the 1964 19th ACM national conference","volume":"3 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":"129814340","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 computer program for discovering and proving recognition rules for Backus Normal Form grammars","authors":"R. L. London","doi":"10.1145/800257.808887","DOIUrl":"https://doi.org/10.1145/800257.808887","url":null,"abstract":"This paper is based upon a running computer program which will discover rules for the recognition of grammatical strings when given a simple Backus Normal Form (BNF) grammar [10]. The program attempts to prove that these rules are both necessary and sufficient to characterize grammatical strings. The main mathematical techniques that are mechanized are induction and case analysis. In addition, the program is capable of producing counter-examples. There are two reasons for writing this program. First, we are interested in constructing efficient recognizers for simple BNF grammars. Second, the task of proving that a proposed recognizer is indeed a recognizer is sufficiently complex and difficult to make it a convenient area for proving theorems by machines, especially theorems whose proofs may use fairly involved case analysis.","PeriodicalId":167902,"journal":{"name":"Proceedings of the 1964 19th ACM national conference","volume":"33 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":"121066451","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 proposed academic program in the computer sciences","authors":"Earl J. Schweppe","doi":"10.1145/800257.808918","DOIUrl":"https://doi.org/10.1145/800257.808918","url":null,"abstract":"Considerable work in the Computer Science Center at the University of Maryland has been devoted to the creation of an academic program in the computer sciences. Those involved have been W. C. Rheinboldt, J. P. Menard, R. H. Austing, J. M. Ortega, G. E. Lindamood and the author. Numerous other people, both at Maryland and elsewhere, have contributed to this work, but the frequent assistance of H. E. Tompkins and A. B. Marcovitz of the Electrical Engineering Department has been especially helpful. The program is now under consideration for adoption at the University and will hopefully be underway by the Fall of 1965. This program would begin with the offering of a number of new courses and expand toward the establishment of a master of science degree, a baccalaureate degree and then a doctoral program as rapidly as staff and other necessary conditions could be developed. In addition to degree programs in the computer sciences, the development of supporting courses for other programs is very important and this program has been designed to satisfy much of this need.","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":"116375023","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 technology at Case","authors":"R. Varga","doi":"10.1145/800257.808920","DOIUrl":"https://doi.org/10.1145/800257.808920","url":null,"abstract":"An undergraduate program in Computer Technology was instituted at Case Institute of Technology in the Fall of 1963. Prior to 1963, several efforts were made to develop a program of undergraduate studies in computing within the Department of Mathematics. At that time, except for one or two courses in pulse and digital circuits and an undergraduate course in digital computer design, all relevant courses were offered by the Department of Mathematics. These courses included numerical methods, programming, numerical analysis, a course in logical design and some more or less related work in logic.","PeriodicalId":167902,"journal":{"name":"Proceedings of the 1964 19th ACM national conference","volume":"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":"130592680","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 environment for an operating system","authors":"G. F. Leonard, J. Goodroe","doi":"10.1145/800257.808910","DOIUrl":"https://doi.org/10.1145/800257.808910","url":null,"abstract":"Conventional operating systems are limited in scope and are designed to deal with very specific problems in the utilization of a computer facility. As more sophisticated programming techniques and new applications for computers are developed, it becomes increasingly apparent that operating systems, as currently conceived, do not adequately cope with the resulting problems. In this paper, a new approach to computer facility utilization is proposed which is based on the concept of extending the operations of a computer with software so as to provide a proper environment for an operating system. The organization and functional descriptions of a system, called an -and-ldquo;extensible machine-and-rdquo;, is presented with the advantages it affords over conventional systems being explicitly stated. Criteria for developing such a system are presented and the capabilities of the system are discussed in the light of current problem areas such as parallel processing, real time processing, and intelligence systems.","PeriodicalId":167902,"journal":{"name":"Proceedings of the 1964 19th ACM national conference","volume":"51 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":"130710943","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":"Cloud pattern recognition","authors":"R. D. Joseph, S. Viglione, H. F. Wolf","doi":"10.1145/800257.808901","DOIUrl":"https://doi.org/10.1145/800257.808901","url":null,"abstract":"Cloud cover photographs transmitted from meteorological satellites must be processed and interpreted before weather maps can be issued. Most of the routine processing can be handled by present day digital computer techniques; however, the recognition and interpretation of cloud patterns such as vortices indicating hurricanes, must still be performed by humans due to the lack of suitable recognition mechanisms. This paper investigates the feasibility of using a perceptron-type computer for the recognition of vortex patterns. A formula is derived which enables the prediction of machine performance as a function of problem complexity and perceptron size (number of logic units). It is shown that the problem complexity can be estimated through optical correlation measurements on cloud cover negatives. These measurements are described and a computer routine is developed which mechanizes the prediction equations and examines the experimental data gained from 10,000 measurements. The results of the computer program are presented and their meaning is discussed.","PeriodicalId":167902,"journal":{"name":"Proceedings of the 1964 19th ACM national conference","volume":"12 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":"125770133","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}