AFIPS '63 (Fall)Pub Date : 1899-12-30DOI: 10.1145/1463822.1463869
R. Boyell, H. Ruston
{"title":"Hybrid techniques for real-time radar simulation","authors":"R. Boyell, H. Ruston","doi":"10.1145/1463822.1463869","DOIUrl":"https://doi.org/10.1145/1463822.1463869","url":null,"abstract":"This paper summarizes results of a study of the design and application of special-purpose computers for the simulation of air-to-ground radars. Specifically, the computers must generate information in real-time to simulate the display of a scanning radar in a vehicle flying at Mach 3 and arbitrary altitude. The radar can view 105 square miles of terrain per second with a resolution of 60 points per mile in range (five per microsecond). This paper describes a hybrid simulator that exploits both the redundancy in the terrain and the repetitiveness caused by the radar scan pattern. An overall design is presented that affords reductions of 103 in storage capacity and computation speed, compared with a straightforward digital approach for generation of topographic profiles from which the display is prepared. Details are presented of data formats and transfer schemes through the memory hierarchy, and of algorithms for the reconstruction of analog profiles from a digitally stored contour map.","PeriodicalId":432708,"journal":{"name":"AFIPS '63 (Fall)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1899-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123464074","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}
AFIPS '63 (Fall)Pub Date : 1899-12-30DOI: 10.1145/1463822.1463852
T. Miura, J. Iwata
{"title":"Effects of digital execution time in a hybrid computer","authors":"T. Miura, J. Iwata","doi":"10.1145/1463822.1463852","DOIUrl":"https://doi.org/10.1145/1463822.1463852","url":null,"abstract":"Recently, for the purpose of improving the computing accuracy of an analog computer as well as assuring the stability of solution, hybrid computing techniques have been developed rapidly in the form of applying digital computing techniques to relatively low accuracy computing elements such as nonlinear element or in the form of combining the conventional analog computing equipment in the simulator, etc. with a digital computer with the aim of realizing low cost, simplified equipment and easy updating. Two problems pointed out on such a bybrid computer are computation assignment between digital and analog parts and effects of digital execution time. In the parallel hybrid computing system in which the above-mentioned digital part operates in parallel with the analog computer, essential time delay required for the digital computation is of prime importance and, in many cases, the computation assignment can not be determined without considering the effects of it. For instance, if the amount of computation on the digital part is increased in order to raise accuracy, execution time is prolonged and so, increased computing error may result.","PeriodicalId":432708,"journal":{"name":"AFIPS '63 (Fall)","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1899-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125270369","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}
AFIPS '63 (Fall)Pub Date : 1899-12-30DOI: 10.1145/1463822.1463864
S. Kuno, A. Oettinger
{"title":"Syntactic structure and ambiguity of English","authors":"S. Kuno, A. Oettinger","doi":"10.1145/1463822.1463864","DOIUrl":"https://doi.org/10.1145/1463822.1463864","url":null,"abstract":"This paper is in two parts. The first (Section 2) gives an evaluation of the performance of the multiple-path syntactic analyzer to date, with emphasis on the nature and the consequences of syntactic ambiguities in English sentences and suggestions for the refinement of the grammar. The remainder of the paper is concerned with certain concrete implications of the theoretical description of multiple-path predictive analysis provided by recent work of Evey and Greibach. A modification of the form of the current grammar is proposed which should yield a new grammar with additional intuitive appeal, a simplified version of the present analysis program, and sentence structure descriptions in the form of a generalized parenthesis-free notation readily interpretable as a tree.","PeriodicalId":432708,"journal":{"name":"AFIPS '63 (Fall)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1899-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128455132","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}
AFIPS '63 (Fall)Pub Date : 1899-12-30DOI: 10.1145/1463822.1463830
C. A. Rowland, W. O. Berge
{"title":"A 300 nanosecond search memory","authors":"C. A. Rowland, W. O. Berge","doi":"10.1145/1463822.1463830","DOIUrl":"https://doi.org/10.1145/1463822.1463830","url":null,"abstract":"This paper describes a 24 digit, 128 word, transistorized magnetic thin film search memory with a 300 nanosecond read cycle time. With further improvement such a memory could work with a 100 nanosecond cycle time. A search or associative memory is one in which an input word is compared simultaneously with all stored words; an output is produced on all words that differ from the input word. Variations of this memory permit search between limits by setting up a \"don't care\" condition for some of the stored bits; however, the emphasis in this paper is on the equality search.\u0000 The writing system described is capable of doing a complete rewrite of all 128 words in 13 milliseconds; much faster writing systems are possible. Applications are in sorting, cataloging, information retrieval, translation, and searching.","PeriodicalId":432708,"journal":{"name":"AFIPS '63 (Fall)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1899-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124048946","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}
AFIPS '63 (Fall)Pub Date : 1899-12-30DOI: 10.1145/1463822.1463838
M. E. Conway
{"title":"A multiprocessor system design","authors":"M. E. Conway","doi":"10.1145/1463822.1463838","DOIUrl":"https://doi.org/10.1145/1463822.1463838","url":null,"abstract":"Parallel processing is not so mysterious a concept as the dearth of algorithms which explicitly use it might suggest. As a rule of thumb, if N processes are performed and the outcome is independent of the order in which their steps are executed, provided that within each process the order of steps is preserved, then any or all of the processes can be performed simultaneously, if conflicts arising from multiple access to common storage can be resolved. All the elements of a matrix sum may be evaluated in parallel. The ith summand of all elements of a matrix product may be computed simultaneously. In an internal merge sort all strings in any pass may be created at the same time. All the coroutines of a separable program may be run concurrently.","PeriodicalId":432708,"journal":{"name":"AFIPS '63 (Fall)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1899-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127927433","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}
AFIPS '63 (Fall)Pub Date : 1899-12-30DOI: 10.1145/1463822.1463854
J. Wait
{"title":"A hybrid analog-digital differential analyzer system","authors":"J. Wait","doi":"10.1145/1463822.1463854","DOIUrl":"https://doi.org/10.1145/1463822.1463854","url":null,"abstract":"In recent years, considerable effort has been expended toward combining the capabilities of digital and analog elements in specialized computing systems. The concept of blending analog and digital elements can be extended to a system of true hybrid computing elements.","PeriodicalId":432708,"journal":{"name":"AFIPS '63 (Fall)","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1899-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116703509","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}
AFIPS '63 (Fall)Pub Date : 1899-12-30DOI: 10.1145/1463822.1463846
Albert Kaplan
{"title":"A search memory subsystem for a general-purpose computer","authors":"Albert Kaplan","doi":"10.1145/1463822.1463846","DOIUrl":"https://doi.org/10.1145/1463822.1463846","url":null,"abstract":"The search memory provides an extremely powerful tool for data-processing applications in which files of data are manipulated---applications such as data correlation, information retrieval and data analysis. For many such problems, a moderate size search memory can increase the performance of a general-purpose computer by several orders of magnitude. This paper describes the system design of a search memory subsystem integral to a general-purpose computer. The unit will operate in much the same manner as a conventional arithmetic unit, receiving data directly from the main memory, and placing the results of a search in the accumulator. This generalized design is independent of the particular magnetic memory element used and is not constrained by any particular computer organization. However, values have been assigned to the various parameters in the system so that the concepts can be concretely described. The techniques and concepts presented in this paper are the result of a company-sponsored program. The following sections present an assumed general-purpose computer structure, the design of a search memory subsystem, and possible implementation. Appendix A presents the basic principles of the search memory organization.","PeriodicalId":432708,"journal":{"name":"AFIPS '63 (Fall)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1899-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129572908","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}
AFIPS '63 (Fall)Pub Date : 1899-12-30DOI: 10.1145/1463822.1463831
B. Kaufman, E. Ulzurrun
{"title":"A new technique for using thin magnetic films as a phase script memory element","authors":"B. Kaufman, E. Ulzurrun","doi":"10.1145/1463822.1463831","DOIUrl":"https://doi.org/10.1145/1463822.1463831","url":null,"abstract":"The use of thin magnetic film memories for high speed computers has been well established. More recently, efforts have been made to adapt thin-film memory elements for operation in a phase script mode by using drive fields at two different frequencies to switch and read the state of the memory element. The resulting memory system is uniquely suited for operation in a parametron computer where information exists as a phase state rather than an amplitude state.","PeriodicalId":432708,"journal":{"name":"AFIPS '63 (Fall)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1899-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121720509","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}
AFIPS '63 (Fall)Pub Date : 1899-12-30DOI: 10.1145/1463822.1463887
W. R. Adey
{"title":"Computer applications at the frontiers of biomedical research","authors":"W. R. Adey","doi":"10.1145/1463822.1463887","DOIUrl":"https://doi.org/10.1145/1463822.1463887","url":null,"abstract":"It would appear that the rapid growth of computing facilities in major life science institutions in this country has brought with it an obligation on those enjoying the privilege of these aids to experimental design and data analysis to view critically the utilization of these methods, as they may determine broad research philosophies in particular problem areas, and thus also, both the conduct and probable outcome of such research.","PeriodicalId":432708,"journal":{"name":"AFIPS '63 (Fall)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1899-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122051387","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}
AFIPS '63 (Fall)Pub Date : 1899-12-30DOI: 10.1145/1463822.1463865
J. L. Dolby, H. L. Resnikoff, E. MacMurray
{"title":"A tape dictionary for linguistic experiments","authors":"J. L. Dolby, H. L. Resnikoff, E. MacMurray","doi":"10.1145/1463822.1463865","DOIUrl":"https://doi.org/10.1145/1463822.1463865","url":null,"abstract":"Almost since the arrival of the first piece of modern computing equipment there has been considerable interest in the potential of this equipment for various aspects of linguistic data handling. Experiments in machine translation date to at least the late forties and more recently experiments in indexing and abstracting are becoming more widespread. Almost without exception these experiments have shown that the basic problems are not trivial and that serious experimentation on an extensive level will be necessary before any of these problems can be conquered---even assuming that solutions of some sort can be found. As a result there has been an increasing amount of speculation about the fundamental nature of linguistic structure and a growing need for fundamental data on which various conjectures about this structure can be tested.","PeriodicalId":432708,"journal":{"name":"AFIPS '63 (Fall)","volume":"184 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1899-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120831451","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}
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
