{"title":"Real time quick-look analysis for the OGO satellites","authors":"R. Coyle, J. Stewart","doi":"10.1145/1464122.1464134","DOIUrl":"https://doi.org/10.1145/1464122.1464134","url":null,"abstract":"The National Aeronautics and Space Administration has designed a series of general purpose orbiting satellites which have the family name of Orbiting Geophysical Observatory (OGO). Each of these satellites is capable of carrying up to 50 scientific experiment devices, which transmit data to ground stations via a common telemetry channel. There are two tracking stations, at Rosman, North Carolina, and Fairbanks, Alaska, which will receive this telemetry, transmitting it to Central Control at Goddard Space Flight Center in Greenbelt, Maryland, at a data rate of up to 64 KC.","PeriodicalId":395858,"journal":{"name":"AFIPS '64 (Spring)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1964-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124550279","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 delta-sigma modulation system for time delay and analog function storage","authors":"H. Handler, R. H. Mangels","doi":"10.1145/1464122.1464153","DOIUrl":"https://doi.org/10.1145/1464122.1464153","url":null,"abstract":"The advent of fast iterative analog computers poses the requirement for storing analog functions for integral multiples of the computer repetition period which is typically of the order of 1 to 10 milliseconds. In addition to function storage for one computer run, it would be desirable to store analog functions for indefinite time intervals to permit table lookup. Typical accuracy requirements might be 0.1 to 0.5 per cent of half-scale at ten times the computer repetition frequency (10 cps to 1000 cps) with somewhat lower accuracy at higher frequencies.","PeriodicalId":395858,"journal":{"name":"AFIPS '64 (Spring)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1964-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131419474","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":"Some flexible information retrieval systems using structure matching procedures","authors":"G. Salton, Edward H. Sussenguth","doi":"10.1145/1464122.1464178","DOIUrl":"https://doi.org/10.1145/1464122.1464178","url":null,"abstract":"The comparison between stored information identifications and requests for information is one of the principal tasks to be performed in automatic information retrieval. In so-called descriptor systems, where information is represented by sets of independent key words, this operation is relatively simple, since it consists of a comparison between the respective \"vertors\" of key words. In many retrieval systems it has been found necessary or expedient to use more complicated constructs for the identification of information. Notably \"role\" indicators are often added to identify various types of key words, and \"links\" specify a variety of relations between key words. A complete identification for a document or an item of information is often represented by a graph, consisting of nodes and branches between nodes, to identify respectively the key words and relations between key words. The matching of such information graphs with graphs representing requests for information is a relatively complicated and time consuming operation, particularly since the request structure can be made to match the information structure only partially and incompletely.","PeriodicalId":395858,"journal":{"name":"AFIPS '64 (Spring)","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1964-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115238620","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":"Remote computing--an experimental system: part 1: external specifications","authors":"T. Dunn, J. Morrissey","doi":"10.1145/1464122.1464164","DOIUrl":"https://doi.org/10.1145/1464122.1464164","url":null,"abstract":"Remote computing has been around as long as computers themselves. More recently, interest has revived in providing remote users with convenient, economical access to a large central computer. Considerable attention has been addressed to its economics and practicality. Several batch-oriented systems have been implemented. The techniques of time-sharing a large or small system have been described, as have the attendant advantages of man-machine interaction for symbolic mathematics and program testing. Several input-output devices have been considered, including typewriters, displays, and dial-voice equipment.","PeriodicalId":395858,"journal":{"name":"AFIPS '64 (Spring)","volume":"127 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1964-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124643859","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":"Analytical technique for automatic data processing equipment acquisition","authors":"S. Rosenthal","doi":"10.1145/1464122.1464159","DOIUrl":"https://doi.org/10.1145/1464122.1464159","url":null,"abstract":"In this paper we describe in considerable detail the \"Analytical Technique for Automatic Data Processing Equipment Acquisition\" developed and documented with Mr. Ernest L. Holt and Mr. Joseph T. Averitt for the Directorate of Data Automation, Headquarters, U.S. Air Force. This is the first public description of this Technique and how to use it.","PeriodicalId":395858,"journal":{"name":"AFIPS '64 (Spring)","volume":"1702 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1964-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129409477","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":"Syntax-directed compiling","authors":"T. Cheatham, K. Sattley","doi":"10.1145/1464122.1464126","DOIUrl":"https://doi.org/10.1145/1464122.1464126","url":null,"abstract":"This paper is primarily concerned with the analysis of source statements in a programming language, although some of the ideas and techniques may be applicable to the analysis of source statements in a natural language. We are particularly concerned with those techniques which might be classed as predictive; the companion paper by Graham is concerned with other (\"nonpredictive\") techniques of analysis. Very broadly the techniques we will discuss operate as follows: Given a set of rules (Syntax Specification) for forming allowable constructs, eventually resulting in a statement (or sentence, word, program, etc.) of a language, we analyze a source statement in that language by guessing, or predicting, how the statement is constructed and either verifying that this is the case or backing up to try again, assuming some other method of construction. We keep a \"history\" of our attempts and when we have determined the exact way in which the statement is constructed we can use this \"history\" of its construction for further processing of the components of the statement.","PeriodicalId":395858,"journal":{"name":"AFIPS '64 (Spring)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1964-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125186184","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":"Training a computer to assign descriptors to documents: experiments in automatic indexing","authors":"M. Stevens, G. Urban","doi":"10.1145/1464122.1464176","DOIUrl":"https://doi.org/10.1145/1464122.1464176","url":null,"abstract":"During the past five to ten years, increasing interest has developed in the use of machines as a substitution for human intellectual effort in the indexing or classification of the subject content of documents. In terms of practical applications, the greatest interest to date has been in keyword indexing from the significant words actually occurring in titles, abstracts, or full texts. Pioneering use of computers for this purpose, by Luhn and Baxendale, has been followed by the development of a number of KWIC (keyword-in-context) and similar programs.","PeriodicalId":395858,"journal":{"name":"AFIPS '64 (Spring)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1964-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130010425","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":"Some improvements in the technology of string merging and internal sorting","authors":"M. Goetz","doi":"10.1145/1464122.1464180","DOIUrl":"https://doi.org/10.1145/1464122.1464180","url":null,"abstract":"Sort/merge programs for magnetic tape computer systems are of two basic classes:\u0000 Digital (or Radix) and Collation\u0000 The digital sort is useful in only a limited number of cases and is not examined in this paper.","PeriodicalId":395858,"journal":{"name":"AFIPS '64 (Spring)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1964-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124636580","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":"Programming systems and languages: a historical survey","authors":"S. Rosen","doi":"10.1145/1464122.1464124","DOIUrl":"https://doi.org/10.1145/1464122.1464124","url":null,"abstract":"Twenty years ago, in 1943, there were no Electronic computers. Ten years ago, in 1953, a large number of Electronic calculators were in use, but the general purpose stored program electronic computer was still quite rare. The Coincident Current Magnetic Core memory which finally provided both reliability and speed at reasonable cost had only just been developed, and was still a laboratory device. A number of specially designed, mostly one of a kind, computers were in operation at Universities and government research centers. Commercially, a few Univac I computers had been delivered and were operating with great reliability at rather low speed. A few IBM 701's provided high speed but with very poor reliability. In 1953 most computing was being done by the Card-Programmed Calculator, an ingenious mating of an Electromechanical Accounting Machine with an Electronic Calculating Punch.","PeriodicalId":395858,"journal":{"name":"AFIPS '64 (Spring)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1964-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124372434","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":"Information processing and some implications for more effective manpower programs","authors":"H. E. Striner","doi":"10.1145/1464122.1464137","DOIUrl":"https://doi.org/10.1145/1464122.1464137","url":null,"abstract":"This brief paper will focus on the tremendous potential which now exists for the development of a more rational and effective technique for dealing with problems of manpower utilization. This topic should call for a far more detailed and sophisticated treatment than it is about to receive from me. For this, I must apologize, both to this audience and my own conscience. I feel, however, that the opportunity should be taken to outline to this particular audience the sort of information processing system which I feel must be developed if we are to have a more effective means for dealing with the growing manpower problem in the U.S.","PeriodicalId":395858,"journal":{"name":"AFIPS '64 (Spring)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1964-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132061600","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}