AFIPS '67 (Spring)最新文献

{"title":"Base conversion mappings","authors":"D. Matula","doi":"10.1145/1465482.1465532","DOIUrl":"https://doi.org/10.1145/1465482.1465532","url":null,"abstract":"Most computers utilize either binary, octal or hexadecimal representation for internal storage of numbers, whereas decimal format is desired for most input, output and for the representation of constants in a user language such as FORTRAN or ALGOL. The conversion of a normalized number in one base to a normalized number in another base is beset with difficulties because of the incompatibility of exact representations of a number when only a limited number of digits are available in each base.","PeriodicalId":127219,"journal":{"name":"AFIPS '67 (Spring)","volume":"4 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":"124178426","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 air force computer program acquisition concept","authors":"M. Ratynski","doi":"10.1145/1465482.1465488","DOIUrl":"https://doi.org/10.1145/1465482.1465488","url":null,"abstract":"The classic approach to the development of Air Force operational computer programs has been to award separate contracts for the hardware and for the \"software\" aspects of an electronic system. The integration of the hardware and the \"software\" into a homogeneous total system has not always been a planned certainty, primarily due to the lack of definitive management procedures and contractor guidance and control techniques for the area popularly known as \"soft-ware.\" It was with this history in mind that a study was initiated to evolve a technique which would permit the following:\u0000 a. Development of contractual requirements standards to provide positive control over the contractor's effort in the development of computer programs.\u0000 b. Development of a series of principles and procedures which would be applied to the configuration management of computer programs.\u0000 c. Development of a series of design standards and specifications for use during computer program design and development.\u0000 d. And most important of all, to develop an orderly process of \"software\" production that would assure full compatibility and timeliness with hardware production.","PeriodicalId":127219,"journal":{"name":"AFIPS '67 (Spring)","volume":"29 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":"128048556","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 structural theory of machine diagnosis","authors":"C. Ramamoorthy","doi":"10.1145/1465482.1465603","DOIUrl":"https://doi.org/10.1145/1465482.1465603","url":null,"abstract":"The present trend in large scale integration of microelectronic technology has focussed a heavy emphasis on the maintenance and diagnostic aspects of large computers. Efficient techniques of diagnosis are important in multi-processors with reconfiguring capabilities to provide high availability. Also, a need exists for simple but effective means of understanding, visualizing and analyzing the problems associated with diagnostics. This paper presents a unified approach based on graph theory, which seems to provide a new insight into the problem without regard to the level of detail under consideration.","PeriodicalId":127219,"journal":{"name":"AFIPS '67 (Spring)","volume":"212 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":"115774500","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 macromodular systems simulator (MS2)","authors":"R. Dammkoehler","doi":"10.1145/1465482.1465540","DOIUrl":"https://doi.org/10.1145/1465482.1465540","url":null,"abstract":"The macromodular systems simulator is a control program and programming language implemented at Washington University to facilitate the design and subsequent realization of macromodular computer systems. The MS2 control program and language enable an engineer or programmer to describe macromodular systems and run programs on such systems simulated on a conventional digital computer (IBM 360/50). Input to the simulator consists of a standard set of function definitions for the basic macromodules, a description of the organization of the target machine, the program to be executed by the target machine, and data required by that program. Output from the present version of MS2 is a level change map (a continuous trace of the internal control network of the target machine as it executes its program) and the results of computations performed by the target machine. A procedure for preparing wiring tables and diagrams has been developed and will be incorporated into an improved version of the simulator.","PeriodicalId":127219,"journal":{"name":"AFIPS '67 (Spring)","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":"115585461","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":"Security and privacy in computer systems","authors":"W. Ware","doi":"10.1145/1465482.1465523","DOIUrl":"https://doi.org/10.1145/1465482.1465523","url":null,"abstract":"With the advent of computer systems which share the resources of the configuration among several users or several problems, there is the risk that information from one user (or computer program) will be coupled to another user (or program). In many cases, the information in question will bear a military classification or be sensitive for some reason, and safeguards must be provided to guard against the leakage of information. This session is concerned with accidents or deliberate attempts which divulge computer-resident information to unauthorized parties.","PeriodicalId":127219,"journal":{"name":"AFIPS '67 (Spring)","volume":"70 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":"127000332","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":"Backward time analog computer solutions of optimum control problems","authors":"Max D. Anderson, Someshwar C. Gupta","doi":"10.1145/1465482.1465503","DOIUrl":"https://doi.org/10.1145/1465482.1465503","url":null,"abstract":"Optimum control problems can be solved by iterative computing methods. However, the techniques used for parameter searching are quite sophisticated; consequently, a hybrid computer or a large digital computer is required for their mechanization. These computing systems are very expensive and are not readily available. Furthermore, the trend is towards larger hybrid and digital computer requirements. This situation could be greatly helped by finding simpler methods for solving these problems. One such method utilizing an analog computer is developed in this paper.","PeriodicalId":127219,"journal":{"name":"AFIPS '67 (Spring)","volume":"49 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":"130068470","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 by questionnaire","authors":"A. S. Ginsberg, H. Markowitz, Paula M. Oldfather","doi":"10.1145/1465482.1465552","DOIUrl":"https://doi.org/10.1145/1465482.1465552","url":null,"abstract":"The programming burden has often impeded computer application, but programming time and cost have been considerably reduced by the development of advanced programming languages such as FORTRAN, COBOL, and SIMSCRIPT. The objective of the technique discussed here is to further reduce the time and effort required to produce large computer programs within specified areas.","PeriodicalId":127219,"journal":{"name":"AFIPS '67 (Spring)","volume":"4 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":"130755405","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":"DTPL push down list memory","authors":"R. Spain, M. Marino, H. Jauvtis","doi":"10.1145/1465482.1465564","DOIUrl":"https://doi.org/10.1145/1465482.1465564","url":null,"abstract":"Push down lists (PUDL) or First In Last Out memories have been described for use in multiprocessors. However, in most of these applications, the system's fast access memory is divided in stacks, each program being run in a given stack on a first stack available basis. The push down list is then used to store the program instructions. Very seldom has such a system been described using more than two to six fast access lists. These applications might not justify the use of a special device for the PUDL, making use, instead, of a random access memory section addressed by a pointer address register or counter to keep track of the upper word in the PUDL. There the PUDL storage is only a small fraction of the total fast access storage, and software implementation is more economical than special hardware would be. However, in more sophisticated data processing applications such that language translation, pattern recognition, high speed data acquisition and retrieval, etc., an efficient system organization would result from the use of a central processor working on a multiplicity of programs on a fast interrupt and logic priority basis. The next active program location would depend upon the output from the presently processed instruction. Then the program storage is an important part or even the largest part of the total fast access storage of the system. In this situation, a large number of lists could be required with an access time of the order of one microsecond. If the program instruction lists are stored in a conventional random access memory one pointer register per list would be required and result in an expensive hardware. The pointer could be stored in memory, however, this would result in much increased access time and additional software. A more economical and more efficient implementation of such a multiprogram organization may result from the use a specialized hardware such as a DTPL magnetic thin film Push Down List Memory. The system described here has as an objective the development of a DDPL push down list memory consisting of a set of 128 lists. Each list is 100 words deep with 38 bits per word and thus is implemented by 38 shift registers of 100 bits each. An additional shift register of the same length stores a bottom-of-list (BOL) flag that can be sensed at both ends of the register to deliver an empty or filled list warning signal. Only one magnetic thin film of approximately one inch square area is required for the 38 shift registers constituting one list. The system makes use of a stack of 100 magnetic thin films. Every list is controlled by a conductor that can be selected in a manner similar to that of a word line of a conventional random access memory. The DTPL Push Down List Memory makes use of the controlled propagation of elongated domains of reversed magnetization contained within low coercive force channels imbedded in a magnetic thin film of higher coercive force. This technique of implementation is particularly suited to","PeriodicalId":127219,"journal":{"name":"AFIPS '67 (Spring)","volume":"212 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":"133879591","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":"Address mapping and the control of access in an interactive computer","authors":"D. C. Evans, J. Leclerc","doi":"10.1145/1465482.1465486","DOIUrl":"https://doi.org/10.1145/1465482.1465486","url":null,"abstract":"Computer system designs have attempted to maximize machine utilization (sometimes called efficiency) without regard to other important factors including the human effort and elapsed time required to solve problems. In recent years some computing systems have been developed which provide communication and control means by which users can interact with their own computing processes and with each other. Initial use of these systems has demonstrated their superiority in computer-aided problem solving applications. These interactive computing systems are mainly adaptations of conventional computing systems and are far from ideal in many respects. This paper describes a much improved mechanism for protection, address mapping, and subroutine linkage for an interactive computing system.","PeriodicalId":127219,"journal":{"name":"AFIPS '67 (Spring)","volume":"21 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":"114180142","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":"Degradation analysis of digitized signal transmission","authors":"J. C. Kim, E. Kaiser","doi":"10.1145/1465482.1465570","DOIUrl":"https://doi.org/10.1145/1465482.1465570","url":null,"abstract":"In communication systems signals are subjected to various kinds of noises. Although extensive studies of error control methods have been conducted, there is little information available as to the effects of noise upon the recovered and processed signal.","PeriodicalId":127219,"journal":{"name":"AFIPS '67 (Spring)","volume":"25 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":"131970498","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}