An outstanding computer engineer recently compared libraries to the whaling industry, a relic of the romantic past. As whales disappeared, so will books, he said. We should stop building libraries, store all information on tape and retrieve it through consoles.
{"title":"Computers in service to libraries of the future: library requirements","authors":"W. N. Locke","doi":"10.1145/1476793.1476809","DOIUrl":"https://doi.org/10.1145/1476793.1476809","url":null,"abstract":"An outstanding computer engineer recently compared libraries to the whaling industry, a relic of the romantic past. As whales disappeared, so will books, he said. We should stop building libraries, store all information on tape and retrieve it through consoles.","PeriodicalId":326625,"journal":{"name":"AFIPS '69 (Spring)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1969-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121032295","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}
The increased use of computer graphics to enhance the man-machine interface has resulted in many and varied systems and devices to meet a multitude of needs. One type of display that is receiving new emphasis as a computer output device is the "raster format" display (of which standard television is a particular type). Among the reasons for using this type of display are: (1) the relative simplicity of the display device, (2) the ease of remote operation for multiple station users, (3) the low cost per station, (4) capability for mixing output with standard television sources, and (5) good position repeatability for computer generated data.
{"title":"Computer generated graphic segments in a raster display","authors":"R. A. Metzger","doi":"10.1145/1476793.1476824","DOIUrl":"https://doi.org/10.1145/1476793.1476824","url":null,"abstract":"The increased use of computer graphics to enhance the man-machine interface has resulted in many and varied systems and devices to meet a multitude of needs. One type of display that is receiving new emphasis as a computer output device is the \"raster format\" display (of which standard television is a particular type). Among the reasons for using this type of display are: (1) the relative simplicity of the display device, (2) the ease of remote operation for multiple station users, (3) the low cost per station, (4) capability for mixing output with standard television sources, and (5) good position repeatability for computer generated data.","PeriodicalId":326625,"journal":{"name":"AFIPS '69 (Spring)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1969-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127170363","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}
The procedure described herein is in essence an extension, albeit a simplification, of the work Earley which in turn was based on Evans, Feldman, Floyd, and Standish. For a large subset of grammars, the procedure maps the Backus Naur Form (BNF) definition of the grammar of a language into a deterministic, left-to-right parser for the sentences in that language. It is shown below that the procedure by design, covers all bounded right context grammars and, as a by-product, some LR(k) grammars which are not bounded right context. See Knuth for the definitions of these classes of grammars. If two parameters are incorporated a priori into the procedure, one limiting the look-back and the other limiting the look-ahead capabilities of the parser to be generated, an algorithm results. For each BNF grammar G the algorithm either rejects G as not bounded right context for the specified limits or it generates a parser for G.
这里描述的过程本质上是对Earley工作的扩展，尽管是简化，而Earley的工作又以Evans, Feldman, Floyd和Standish为基础。对于大量语法子集，该过程将语言语法的Backus Naur Form (BNF)定义映射到该语言中句子的确定性、从左到右的解析器。如下所示，该过程通过设计涵盖了所有有界右上下文语法，并且作为副产品，还涵盖了一些非有界右上下文的LR(k)语法。有关这些语法类的定义，请参阅Knuth。如果将两个参数先验地合并到过程中，一个限制回看，另一个限制要生成的解析器的预看功能，则生成一个算法。对于每个BNF语法G，该算法要么拒绝G作为指定限制的无界右上下文，要么为G生成一个解析器。
{"title":"Generating parsers for BNF grammars","authors":"F. DeRemer","doi":"10.1145/1476793.1476928","DOIUrl":"https://doi.org/10.1145/1476793.1476928","url":null,"abstract":"The procedure described herein is in essence an extension, albeit a simplification, of the work Earley which in turn was based on Evans, Feldman, Floyd, and Standish. For a large subset of grammars, the procedure maps the Backus Naur Form (BNF) definition of the grammar of a language into a deterministic, left-to-right parser for the sentences in that language. It is shown below that the procedure by design, covers all bounded right context grammars and, as a by-product, some LR(k) grammars which are not bounded right context. See Knuth for the definitions of these classes of grammars. If two parameters are incorporated a priori into the procedure, one limiting the look-back and the other limiting the look-ahead capabilities of the parser to be generated, an algorithm results. For each BNF grammar G the algorithm either rejects G as not bounded right context for the specified limits or it generates a parser for G.","PeriodicalId":326625,"journal":{"name":"AFIPS '69 (Spring)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1969-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125893327","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}
Like a number of fast growing North American cities, Metropolitan Toronto is faced with the ever increasing problems of greater motor vehicle traffic volume, congestion and accidents. Metropolitan Toronto today has more than 700,000 vehicles registered in its 240 square miles, for a per capita density that rates behind only Los Angeles. In addition over 100,000 vehicles from outside the area converge daily on the City.
{"title":"Automatic traffic signal control systems: the metropolitan Toronto experience","authors":"J. D. Hodges, D. Whitehead","doi":"10.1145/1476793.1476872","DOIUrl":"https://doi.org/10.1145/1476793.1476872","url":null,"abstract":"Like a number of fast growing North American cities, Metropolitan Toronto is faced with the ever increasing problems of greater motor vehicle traffic volume, congestion and accidents. Metropolitan Toronto today has more than 700,000 vehicles registered in its 240 square miles, for a per capita density that rates behind only Los Angeles. In addition over 100,000 vehicles from outside the area converge daily on the City.","PeriodicalId":326625,"journal":{"name":"AFIPS '69 (Spring)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1969-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114499347","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}
The work described in this paper was undertaken in order to provide estimates of the throughput capacity of certain multiprogrammed computer systems. In particular, we consider those systems whose users are never simultaneously receiving input-output and central processor attention. Systems making use of "demand paging" tend to fall within this class.
{"title":"An analytic model of multiprogrammed computing","authors":"R. Fenichel, A. Grossman","doi":"10.1145/1476793.1476914","DOIUrl":"https://doi.org/10.1145/1476793.1476914","url":null,"abstract":"The work described in this paper was undertaken in order to provide estimates of the throughput capacity of certain multiprogrammed computer systems. In particular, we consider those systems whose users are never simultaneously receiving input-output and central processor attention. Systems making use of \"demand paging\" tend to fall within this class.","PeriodicalId":326625,"journal":{"name":"AFIPS '69 (Spring)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1969-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116508684","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}
Wide-scale application of interactive computer graphics (ICG) is currently inhibited by two major difficulties: 1. Terminal time costs too much. 2. It takes too much effort and expertise to develop and modify ICG programs.
{"title":"POGO: programmer-oriented graphics operation","authors":"B. Boehm, V. Lamb, R. Mobley, J. E. Rieber","doi":"10.1145/1476793.1476842","DOIUrl":"https://doi.org/10.1145/1476793.1476842","url":null,"abstract":"Wide-scale application of interactive computer graphics (ICG) is currently inhibited by two major difficulties:\u0000 1. Terminal time costs too much.\u0000 2. It takes too much effort and expertise to develop and modify ICG programs.","PeriodicalId":326625,"journal":{"name":"AFIPS '69 (Spring)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1969-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131587752","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}
Automation activities in libraries have been undertaken with accelerating frequency over the past ten years. It is no longer uncommon to find successful projects in almost every type and size of library throughout the country. Libraries have demonstrated that they can develop and operate ordering and processing systems to control financial and bibliographic information at the time a new item is added to the collection. Book catalogs and other holdings lists are produced and distributed in many formats. Automated circulation control systems, particularly the data collection type, are widely accepted and functioning successfully.
{"title":"Computers in service to libraries of the future","authors":"Howard W. Dillon","doi":"10.1145/1476793.1476811","DOIUrl":"https://doi.org/10.1145/1476793.1476811","url":null,"abstract":"Automation activities in libraries have been undertaken with accelerating frequency over the past ten years. It is no longer uncommon to find successful projects in almost every type and size of library throughout the country. Libraries have demonstrated that they can develop and operate ordering and processing systems to control financial and bibliographic information at the time a new item is added to the collection. Book catalogs and other holdings lists are produced and distributed in many formats. Automated circulation control systems, particularly the data collection type, are widely accepted and functioning successfully.","PeriodicalId":326625,"journal":{"name":"AFIPS '69 (Spring)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1969-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130967285","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}
The Computer Personnel Development Association, Inc. (CPDA) is an organization that has been set up to secure openings in the computer field for individuals from ghetto areas. To prepare these people for work in a business environment, CPDA will provide orientation and training courses in data processing. The program is organized by professionals within the computer industry in collaboration with local community development groups who will help select participants for the program, and with industrial leaders who will locate and provide job opportunities for the participants.
{"title":"Computers and the underprivileged","authors":"Allen L. Morton","doi":"10.1145/1476793.1476806","DOIUrl":"https://doi.org/10.1145/1476793.1476806","url":null,"abstract":"The Computer Personnel Development Association, Inc. (CPDA) is an organization that has been set up to secure openings in the computer field for individuals from ghetto areas. To prepare these people for work in a business environment, CPDA will provide orientation and training courses in data processing. The program is organized by professionals within the computer industry in collaboration with local community development groups who will help select participants for the program, and with industrial leaders who will locate and provide job opportunities for the participants.","PeriodicalId":326625,"journal":{"name":"AFIPS '69 (Spring)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1969-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129422279","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}
At present, software development is responsible for a large part of the total cost of computer systems. A segment of this cost is traceable to the development of programming language (e.g., FORTRAN, ALGOL, PL/I) translators which constitute major components of any software package.
{"title":"Software measurements and their influence upon machine language design","authors":"Leon Presser, M. Melkanoff","doi":"10.1145/1476793.1476916","DOIUrl":"https://doi.org/10.1145/1476793.1476916","url":null,"abstract":"At present, software development is responsible for a large part of the total cost of computer systems. A segment of this cost is traceable to the development of programming language (e.g., FORTRAN, ALGOL, PL/I) translators which constitute major components of any software package.","PeriodicalId":326625,"journal":{"name":"AFIPS '69 (Spring)","volume":"81 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1969-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129847302","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}
During the early development of higher order languages in 1959, we were told that programs written in such languages could be run on almost any computer. Now, ten years later, we find that programs so written not only are non-transferable from one manufacturer's computer to that of another, but, in some instances, cannot be run on two computers of the same make and model with memories of different sizes. In the intervening years, computers have become much faster and the cost per operation has become much cheaper, while the cost of programming has become relatively far more expensive. Still, we do not have program transferability and millions of dollars are spent each year on the uninspiring task of reprogramming routines on additional computers.
{"title":"Program transferability","authors":"J. Ward","doi":"10.1145/1476793.1476887","DOIUrl":"https://doi.org/10.1145/1476793.1476887","url":null,"abstract":"During the early development of higher order languages in 1959, we were told that programs written in such languages could be run on almost any computer. Now, ten years later, we find that programs so written not only are non-transferable from one manufacturer's computer to that of another, but, in some instances, cannot be run on two computers of the same make and model with memories of different sizes. In the intervening years, computers have become much faster and the cost per operation has become much cheaper, while the cost of programming has become relatively far more expensive. Still, we do not have program transferability and millions of dollars are spent each year on the uninspiring task of reprogramming routines on additional computers.","PeriodicalId":326625,"journal":{"name":"AFIPS '69 (Spring)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1969-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132381276","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号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：