At Dartmouth College the "computer" has become an essential component of the university community comparable to the library in importance, size, and diversity of application. While such a statement no longer raises eyebrows, in few other cases has the extent of the infusion of computing into the life of the university community been as great, or as painless, as at Dartmouth. The purpose of this paper is to report some of the many ways in which computing has been found useful in teaching and research at Dartmouth, and to claim that these almost revolutionary (though almost painless) developments were generated primarily by having freely available to all students and faculty a general purpose time-sharing system equipped with a simple and easy to learn language (BASIC), and a simple and friendly user interface.
{"title":"The many roles of computing on the campus","authors":"T. Kurtz","doi":"10.1145/1476793.1476903","DOIUrl":"https://doi.org/10.1145/1476793.1476903","url":null,"abstract":"At Dartmouth College the \"computer\" has become an essential component of the university community comparable to the library in importance, size, and diversity of application. While such a statement no longer raises eyebrows, in few other cases has the extent of the infusion of computing into the life of the university community been as great, or as painless, as at Dartmouth. The purpose of this paper is to report some of the many ways in which computing has been found useful in teaching and research at Dartmouth, and to claim that these almost revolutionary (though almost painless) developments were generated primarily by having freely available to all students and faculty a general purpose time-sharing system equipped with a simple and easy to learn language (BASIC), and a simple and friendly user interface.","PeriodicalId":326625,"journal":{"name":"AFIPS '69 (Spring)","volume":"24 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":"116652111","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 representation of integers by a place value sequence of digits taken from a radix polynomial is one of the profound mathematical developments of all times. It provides an elegant foundation for mathematical questions where algorithmic procedures are needed, such as how to computationally effect the operations of addition, subtraction, multiplication, division and comparison. Nevertheless, as invaluable as the place value representation system is to computational mathematics, most questions regarding the mathematical structure of the integers are usually answered with proofs which make no reference to any representational form of the integers, but are based solely on an abstract characterization of the integers.
{"title":"Towards an abstract mathematical theory of floating-point arithmetic","authors":"D. Matula","doi":"10.1145/1476793.1476922","DOIUrl":"https://doi.org/10.1145/1476793.1476922","url":null,"abstract":"The representation of integers by a place value sequence of digits taken from a radix polynomial is one of the profound mathematical developments of all times. It provides an elegant foundation for mathematical questions where algorithmic procedures are needed, such as how to computationally effect the operations of addition, subtraction, multiplication, division and comparison. Nevertheless, as invaluable as the place value representation system is to computational mathematics, most questions regarding the mathematical structure of the integers are usually answered with proofs which make no reference to any representational form of the integers, but are based solely on an abstract characterization of the integers.","PeriodicalId":326625,"journal":{"name":"AFIPS '69 (Spring)","volume":"14 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":"115262295","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}
This paper demonstrates a straightforward algorithm for converting programming language grammars into pushdown-store automata translators. The language grammar is written as a "translation grammar" in which, for each syntactic rule, there is a corresponding "rule of translation" that recursively specifies the reverse Polish string translation of the objects in the syntactic rule. This augmented grammar is transformed directly into a flow chart for the appropriate translator.
{"title":"A system for designing fast programming language translators","authors":"V. Schneider","doi":"10.1145/1476793.1476927","DOIUrl":"https://doi.org/10.1145/1476793.1476927","url":null,"abstract":"This paper demonstrates a straightforward algorithm for converting programming language grammars into pushdown-store automata translators. The language grammar is written as a \"translation grammar\" in which, for each syntactic rule, there is a corresponding \"rule of translation\" that recursively specifies the reverse Polish string translation of the objects in the syntactic rule. This augmented grammar is transformed directly into a flow chart for the appropriate translator.","PeriodicalId":326625,"journal":{"name":"AFIPS '69 (Spring)","volume":"258 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":"114258323","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}
Information for management and specifically Management Information Systems (MIS) have been discussed with increasing frequency over the past few years either by those who have theorized about what an information system for management should consist of or by those who are convinced that MIS from a practical or realistic viewpoint is a myth.
{"title":"An on-line information system for management","authors":"G. Duffy, F. P. Gartner","doi":"10.1145/1476793.1476845","DOIUrl":"https://doi.org/10.1145/1476793.1476845","url":null,"abstract":"Information for management and specifically Management Information Systems (MIS) have been discussed with increasing frequency over the past few years either by those who have theorized about what an information system for management should consist of or by those who are convinced that MIS from a practical or realistic viewpoint is a myth.","PeriodicalId":326625,"journal":{"name":"AFIPS '69 (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":"122306660","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 a time-sharing system that is intended to serve a number of console users simultaneously, there are two related, but distinct, functions to be performed. One is time slicing, which is the allocation of bursts of processor time to the various active programs according to a suitable algorithm. The other is core space allocation which arises because, in a modern multi-programmed system, there will be space in core for more than one active program at the same time. If, as will normally be the case, there are more active programs than can be accommodated in core, some of them must be held on a drum and brought into core periodically; this is swapping. Confusion has sometimes arisen between time slicing and swapping, since, in the early time-sharing systems, there was only one active object program resident in core at any time, all the others being on the drum. In these circumstances, swapping and time slicing go together; when a program is in core, it is receiving processor time, and as soon as it ceases to receive processor time it is removed from core. In a multi-programmed system, however, space allocation and time slicing can proceed independently. It is the responsibility of the space allocation algorithm to ensure that, as far as possible, there is always at least one program in core that is ready to run. The time-slicing algorithm is responsible for dividing up the available processor time between the various programs that are in core.
{"title":"A model for core space allocation in a time-sharing system","authors":"M. Wilkes","doi":"10.1145/1476793.1476836","DOIUrl":"https://doi.org/10.1145/1476793.1476836","url":null,"abstract":"In a time-sharing system that is intended to serve a number of console users simultaneously, there are two related, but distinct, functions to be performed. One is time slicing, which is the allocation of bursts of processor time to the various active programs according to a suitable algorithm. The other is core space allocation which arises because, in a modern multi-programmed system, there will be space in core for more than one active program at the same time. If, as will normally be the case, there are more active programs than can be accommodated in core, some of them must be held on a drum and brought into core periodically; this is swapping. Confusion has sometimes arisen between time slicing and swapping, since, in the early time-sharing systems, there was only one active object program resident in core at any time, all the others being on the drum. In these circumstances, swapping and time slicing go together; when a program is in core, it is receiving processor time, and as soon as it ceases to receive processor time it is removed from core. In a multi-programmed system, however, space allocation and time slicing can proceed independently. It is the responsibility of the space allocation algorithm to ensure that, as far as possible, there is always at least one program in core that is ready to run. The time-slicing algorithm is responsible for dividing up the available processor time between the various programs that are in core.","PeriodicalId":326625,"journal":{"name":"AFIPS '69 (Spring)","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":"131422593","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 many computers floating point arithmetic operations are performed by subprograms: software packages in the case of most small computers, and micro-programmed read-only memories in some larger systems. In such a subprogram there are normally several free choices as to which set of conditions gets a speed advantage. If this advantage is given to the most probable case then there will be an increase in system performance with no increase in cost.
{"title":"Optimizing floating point arithmetic via post addition shift probabilities","authors":"J. Field","doi":"10.1145/1476793.1476885","DOIUrl":"https://doi.org/10.1145/1476793.1476885","url":null,"abstract":"In many computers floating point arithmetic operations are performed by subprograms: software packages in the case of most small computers, and micro-programmed read-only memories in some larger systems. In such a subprogram there are normally several free choices as to which set of conditions gets a speed advantage. If this advantage is given to the most probable case then there will be an increase in system performance with no increase in cost.","PeriodicalId":326625,"journal":{"name":"AFIPS '69 (Spring)","volume":"3235 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":"127485485","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}
Two consecutive papers on the subject, "Managing the Economics of Computer Programming" presented at the 1968 National Conference of the Association of Computing Machinery conclude respectively: •First, one must understand computer programming well enough to know what is possible, what is probable, and what is impossible or unlikely. •Second, one must make commitments based on the technology used, not on the needs of the world---and not on the unreasonable hopes of the starry-eyed experts. •Third, one must insist upon schedules based on physical events, and on numerical descriptions of the products that are being produced, to the greatest extent that ingenuity will permit. •Fourth, one must objectively assess the status of the project against a well-developed plan. •Finally, of course, one must do something about the trouble one finds.
{"title":"The management and organization of large scale software development projects","authors":"R.H. Kay","doi":"10.1145/1476793.1476857","DOIUrl":"https://doi.org/10.1145/1476793.1476857","url":null,"abstract":"Two consecutive papers on the subject, \"Managing the Economics of Computer Programming\" presented at the 1968 National Conference of the Association of Computing Machinery conclude respectively:\u0000 •First, one must understand computer programming well enough to know what is possible, what is probable, and what is impossible or unlikely.\u0000 •Second, one must make commitments based on the technology used, not on the needs of the world---and not on the unreasonable hopes of the starry-eyed experts.\u0000 •Third, one must insist upon schedules based on physical events, and on numerical descriptions of the products that are being produced, to the greatest extent that ingenuity will permit.\u0000 •Fourth, one must objectively assess the status of the project against a well-developed plan.\u0000 •Finally, of course, one must do something about the trouble one finds.","PeriodicalId":326625,"journal":{"name":"AFIPS '69 (Spring)","volume":"26 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":"125187196","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 LEADER system is a new service-oriented prototype designed to meet the retrieval needs of research scientists working within or in conjunction with the Center for the Information Sciences at Lehigh University. In the first part of this paper, we describe the major conceptual apparatus and principal design features of LEADER, while the second part contains a brief discussion of system implementation and user interaction.
{"title":"The LEADER retrieval system","authors":"D. Hillman, Andrew J. Kasarda","doi":"10.1145/1476793.1476860","DOIUrl":"https://doi.org/10.1145/1476793.1476860","url":null,"abstract":"The LEADER system is a new service-oriented prototype designed to meet the retrieval needs of research scientists working within or in conjunction with the Center for the Information Sciences at Lehigh University. In the first part of this paper, we describe the major conceptual apparatus and principal design features of LEADER, while the second part contains a brief discussion of system implementation and user interaction.","PeriodicalId":326625,"journal":{"name":"AFIPS '69 (Spring)","volume":"33 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":"121854492","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 syntax of ALGOL is specified in its defining report by a grammar whose rules are given in Backus-Naur Form (BNF). Because of the need for precision in the specification of complex systems, BNF has been used to record the syntax of many other programming languages. The rules of BNF are equivalent to context-free production rules. However, due to its declarations, ALGOL is context-dependent, and its syntax cannot be fully specified by a grammar limited to context-free rules. Other grammars for ALGOL are more compact than the BNF of the defining report, but they are generatively no more powerful. Because of this context-dependency of declarations, even an assembly language cannot be fully specified in BNF.
{"title":"An extended BNF for specifying the syntax of declarations","authors":"G. Whitney","doi":"10.1145/1476793.1476929","DOIUrl":"https://doi.org/10.1145/1476793.1476929","url":null,"abstract":"The syntax of ALGOL is specified in its defining report by a grammar whose rules are given in Backus-Naur Form (BNF). Because of the need for precision in the specification of complex systems, BNF has been used to record the syntax of many other programming languages. The rules of BNF are equivalent to context-free production rules. However, due to its declarations, ALGOL is context-dependent, and its syntax cannot be fully specified by a grammar limited to context-free rules. Other grammars for ALGOL are more compact than the BNF of the defining report, but they are generatively no more powerful. Because of this context-dependency of declarations, even an assembly language cannot be fully specified in BNF.","PeriodicalId":326625,"journal":{"name":"AFIPS '69 (Spring)","volume":"2 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":"129975548","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 use of hybrid computers for the simulation of dynamic systems has focused interest on the ill-effects of sampling and digital execution time upon solution accuracy. Techniques have been proposed for the compensation of these effects by various authors. However, there has been a noted lack of common denominator available to compare the relative merits of these methods of compensation. As a rule, one may observe that quality criteria used to evaluate different compensation methods have been local rather than global, and the resulting compensation algorithms are therefore largely tuned to whatever quality criteria has been selected a priori.
{"title":"Stability contours for the analysis of analog/digital hybrid simulation loops","authors":"R. Vichnevetsky","doi":"10.1145/1476793.1476935","DOIUrl":"https://doi.org/10.1145/1476793.1476935","url":null,"abstract":"The use of hybrid computers for the simulation of dynamic systems has focused interest on the ill-effects of sampling and digital execution time upon solution accuracy. Techniques have been proposed for the compensation of these effects by various authors. However, there has been a noted lack of common denominator available to compare the relative merits of these methods of compensation. As a rule, one may observe that quality criteria used to evaluate different compensation methods have been local rather than global, and the resulting compensation algorithms are therefore largely tuned to whatever quality criteria has been selected a priori.","PeriodicalId":326625,"journal":{"name":"AFIPS '69 (Spring)","volume":"78 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":"133655900","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
扫码关注我们
求助内容：
应助结果提醒方式：