The DBTG [1] introduced two modes of set implementation--chain and pointer array. To review briefly, a set occurrence is an occurrence of the (unique) set owner along with zero or more occurrences of each of the set members. The mode of a set indicates the strategy to be used by the data management system in moving from one record occurrence to another within the same set occurrence.
{"title":"When are pointer arrays better than chains","authors":"R. W. Taylor","doi":"10.1145/1408800.1408900","DOIUrl":"https://doi.org/10.1145/1408800.1408900","url":null,"abstract":"The DBTG [1] introduced two modes of set implementation--chain and pointer array. To review briefly, a set occurrence is an occurrence of the (unique) set owner along with zero or more occurrences of each of the set members. The mode of a set indicates the strategy to be used by the data management system in moving from one record occurrence to another within the same set occurrence.","PeriodicalId":204185,"journal":{"name":"ACM '74","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129096159","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 aim of this report is to show that, within the limits of what we know how to do efficiently with computers, it is possible to design a system of types that, to a good degree, models the conceptual hierarchies that we use in our everyday discourse.
{"title":"Hierarchies and relations among data types","authors":"G. Ingargiola","doi":"10.1145/1408800.1408867","DOIUrl":"https://doi.org/10.1145/1408800.1408867","url":null,"abstract":"The aim of this report is to show that, within the limits of what we know how to do efficiently with computers, it is possible to design a system of types that, to a good degree, models the conceptual hierarchies that we use in our everyday discourse.","PeriodicalId":204185,"journal":{"name":"ACM '74","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122235156","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}
A prototype interactive page layout system is described in which textual and pictorial information can be manipulated under computer control on a scanned color display. The system demonstrates the unique advantages of a scanned display for the showing of both text and illustrations, of details of different fonts, and of color. Text can be edited, positioned, and changed in size, font, and case; pictures can be positioned, shrunk, enlarged, and cropped. The color of both text and pictures can also be changed in order to guide the designer's eye to essential parts of the page. The system is suitable for designing both the individual advertisements and complete pages of directories or newspapers.
{"title":"An interactive system for page layout design","authors":"P. Denes, I. Gershkoff","doi":"10.1145/800182.810405","DOIUrl":"https://doi.org/10.1145/800182.810405","url":null,"abstract":"A prototype interactive page layout system is described in which textual and pictorial information can be manipulated under computer control on a scanned color display. The system demonstrates the unique advantages of a scanned display for the showing of both text and illustrations, of details of different fonts, and of color. Text can be edited, positioned, and changed in size, font, and case; pictures can be positioned, shrunk, enlarged, and cropped. The color of both text and pictures can also be changed in order to guide the designer's eye to essential parts of the page.\u0000 The system is suitable for designing both the individual advertisements and complete pages of directories or newspapers.","PeriodicalId":204185,"journal":{"name":"ACM '74","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122945311","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 application of symbolic computation techniques to a class of problems originating in the study of the heating of high temperature plasmas has made possible the understanding of particular nonlinear interactions between electromagnetic waves and plasmas. These wave interactions were investigated as part of the research effort in controlled thermonuclear fusion. The emphasis of our symbolic methods has been the reduction of large symbolic expressions to small analytic forms. A careful presentation and interpretation of intermediate steps of the computation was essential for obtaining a physical understanding of the phenomena under investigation. Our focus contrasts with other symbolic computations whose objective is the construction of expressions for numerical evaluation.
{"title":"Symbolic computation in nonlinear plasma interactions","authors":"J. Kulp","doi":"10.1145/1408800.1408859","DOIUrl":"https://doi.org/10.1145/1408800.1408859","url":null,"abstract":"The application of symbolic computation techniques to a class of problems originating in the study of the heating of high temperature plasmas has made possible the understanding of particular nonlinear interactions between electromagnetic waves and plasmas. These wave interactions were investigated as part of the research effort in controlled thermonuclear fusion. The emphasis of our symbolic methods has been the reduction of large symbolic expressions to small analytic forms. A careful presentation and interpretation of intermediate steps of the computation was essential for obtaining a physical understanding of the phenomena under investigation. Our focus contrasts with other symbolic computations whose objective is the construction of expressions for numerical evaluation.","PeriodicalId":204185,"journal":{"name":"ACM '74","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127932886","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}
In this paper, a brief introduction is given to a multi associative processor computer system. This architecture embodies multiple control units, each capable of SIMD operation on an associatively addressed set of processing elements. The purpose of the study is threefold: to investigate the capability of a new system architecture; to study measurement and evaluation techniques for this and similar classes of architecture; and to derive some general properties of operating systems for machines of this general class.
{"title":"An overview of a multi associative processor study","authors":"G. Nutt","doi":"10.1145/800182.810387","DOIUrl":"https://doi.org/10.1145/800182.810387","url":null,"abstract":"In this paper, a brief introduction is given to a multi associative processor computer system. This architecture embodies multiple control units, each capable of SIMD operation on an associatively addressed set of processing elements. The purpose of the study is threefold: to investigate the capability of a new system architecture; to study measurement and evaluation techniques for this and similar classes of architecture; and to derive some general properties of operating systems for machines of this general class.","PeriodicalId":204185,"journal":{"name":"ACM '74","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114707208","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}
There are now several data base management systems which are based on the proposed CODASYL specifications1, 2; these include UNIVAC's DMS 11003, DIGITAL EQUIPMENT's DBMS-104, Cullinane's IDMS5, and to some degree Burroughs' B6700 DMS6. Since the CODASYL specifications are still not yet finalized, and since many important features of the proposed standard are left as "implementor defined", these particular systems all differ in a number of respects. However, their basic data structuring capabilities remain similar. The purpose of this paper is to outline some data base design considerations when using the CODASYL class systems, and to highlight differences with other types of systems.
现在有几个基于CODASYL规范的数据库管理系统1,2;这些包括UNIVAC的DMS 11003, DIGITAL EQUIPMENT的DBMS-104, Cullinane的IDMS5，以及在某种程度上Burroughs的B6700 DMS6。由于CODASYL规范尚未最终确定，并且由于所提议的标准的许多重要特性仍然是“实现者定义的”，因此这些特定的系统在许多方面都有所不同。但是，它们的基本数据结构功能仍然相似。本文的目的是概述使用CODASYL类系统时的一些数据库设计注意事项，并强调与其他类型系统的区别。
{"title":"Data base design using a CODASYL system","authors":"R. Curtice","doi":"10.1145/1408800.1408829","DOIUrl":"https://doi.org/10.1145/1408800.1408829","url":null,"abstract":"There are now several data base management systems which are based on the proposed CODASYL specifications1, 2; these include UNIVAC's DMS 11003, DIGITAL EQUIPMENT's DBMS-104, Cullinane's IDMS5, and to some degree Burroughs' B6700 DMS6. Since the CODASYL specifications are still not yet finalized, and since many important features of the proposed standard are left as \"implementor defined\", these particular systems all differ in a number of respects. However, their basic data structuring capabilities remain similar. The purpose of this paper is to outline some data base design considerations when using the CODASYL class systems, and to highlight differences with other types of systems.","PeriodicalId":204185,"journal":{"name":"ACM '74","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126512190","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 purpose of decompilers is to minimize the cost of converting a program from assembler language to a higher level language. There exist two different objectives for the design of a decompiler. The first one is to minimize conversion time by producing a literal translation of the program. It is accomplished by a translator which is as complete as possible. The second objective considers the efficiency of the converted program an important and integral part of conversion. This is usually satisfied more adequately by what we call a resystemizer, namely a conversion tool which limits itself to listing data structures, program flow and other pertinent information required to rewrite the program while retaining the old design. Clearly there is no strict dividing line between a Resystemizer and a Translator. The former may easily evolve into the latter and the latter can be used as the former, but their original design objectives differ.
{"title":"A pragmatic look at decompilers","authors":"M. F. Weller","doi":"10.1145/1408800.1408930","DOIUrl":"https://doi.org/10.1145/1408800.1408930","url":null,"abstract":"The purpose of decompilers is to minimize the cost of converting a program from assembler language to a higher level language. There exist two different objectives for the design of a decompiler. The first one is to minimize conversion time by producing a literal translation of the program. It is accomplished by a translator which is as complete as possible. The second objective considers the efficiency of the converted program an important and integral part of conversion. This is usually satisfied more adequately by what we call a resystemizer, namely a conversion tool which limits itself to listing data structures, program flow and other pertinent information required to rewrite the program while retaining the old design. Clearly there is no strict dividing line between a Resystemizer and a Translator. The former may easily evolve into the latter and the latter can be used as the former, but their original design objectives differ.","PeriodicalId":204185,"journal":{"name":"ACM '74","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124945014","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}
It is desirable to detect and to identify properly any input data errors in a data collection system. The most common errors include hardware errors, field range errors, incorrect character-in-field errors, and records-out-of-sequence errors. In order to process these error conditions in a general manner, a set of Xerox FORTRAN and assembly language routines has been developed. These routines, collectively referred to as the CHECKR system, are table-driven and, therefore, can be used to validate input data from many different sources. A number of tables are created which specify the allowable conditions that can exist, and CHECKR uses these tables to produce an easy-to-read error message report. CHECKR has been used successfully to validate data for the Automated Data Repository (ADR) Project, a system to collect and process information concerning exercise and its relation to the prevention of coronary heart disease.
{"title":"CHECKR: an efficient table-driven facility for input record data validation","authors":"S. R. White, J. Purdy","doi":"10.1145/1408800.1408857","DOIUrl":"https://doi.org/10.1145/1408800.1408857","url":null,"abstract":"It is desirable to detect and to identify properly any input data errors in a data collection system. The most common errors include hardware errors, field range errors, incorrect character-in-field errors, and records-out-of-sequence errors. In order to process these error conditions in a general manner, a set of Xerox FORTRAN and assembly language routines has been developed. These routines, collectively referred to as the CHECKR system, are table-driven and, therefore, can be used to validate input data from many different sources. A number of tables are created which specify the allowable conditions that can exist, and CHECKR uses these tables to produce an easy-to-read error message report. CHECKR has been used successfully to validate data for the Automated Data Repository (ADR) Project, a system to collect and process information concerning exercise and its relation to the prevention of coronary heart disease.","PeriodicalId":204185,"journal":{"name":"ACM '74","volume":"158 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125509003","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}
In this paper, some features of the SETL language are presented. Also discussed are two methods for determining the data types of runtime objects in higher level languages from the static program text. The first method determines the type of a variable from the way in which it is defined, while the second method determines its type from the way it is subsequently used. This technique is shown to be of value in producing optimized object code. An implementation of the technique is also discussed and an example of the results produced under the implementation for a specific SETL program is presented.
{"title":"Compile time type determination in SETL","authors":"A. Tenenbaum","doi":"10.1145/800182.810386","DOIUrl":"https://doi.org/10.1145/800182.810386","url":null,"abstract":"In this paper, some features of the SETL language are presented. Also discussed are two methods for determining the data types of runtime objects in higher level languages from the static program text. The first method determines the type of a variable from the way in which it is defined, while the second method determines its type from the way it is subsequently used. This technique is shown to be of value in producing optimized object code. An implementation of the technique is also discussed and an example of the results produced under the implementation for a specific SETL program is presented.","PeriodicalId":204185,"journal":{"name":"ACM '74","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131829236","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 goals of my research were to investigate some of the problems involved in translating machine language programs into high level procedural languages and to develop a systematic methodology for this process. It was assumed that the source program was produced either manually or by a compiler. A translator was implemented to accept programs coded in Knuth's MIXAL (assembly language for the MIX machine) and produce an "equivalent" PL/1 version.
{"title":"On inverse translation of machine language","authors":"Barron C. Housel","doi":"10.1145/1408800.1408929","DOIUrl":"https://doi.org/10.1145/1408800.1408929","url":null,"abstract":"The goals of my research were to investigate some of the problems involved in translating machine language programs into high level procedural languages and to develop a systematic methodology for this process. It was assumed that the source program was produced either manually or by a compiler. A translator was implemented to accept programs coded in Knuth's MIXAL (assembly language for the MIX machine) and produce an \"equivalent\" PL/1 version.","PeriodicalId":204185,"journal":{"name":"ACM '74","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128294028","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
扫码关注我们
求助内容：
应助结果提醒方式：