A language or set of languages, called dynamic algebras, which will simplify programming and provide the capability of simplifying programs are proposed. In such languages, the constructions of arithmetic and algebra are emphasized, resulting in fewer but larger statements, rather than smaller, explicitly sequenced assignments and transfer A set of operators (called the Aiken operators) are introduced and their usefulness demonstrated. Three examples are presented of the simplification of dynamic algebra programs using the ordinary rules of algebra. Finally, the efficiency of such programs on von Neumann, parallel, and pipeline machines is discussed.
{"title":"Dynamic algebra","authors":"R. E. Noonan","doi":"10.1145/800182.810420","DOIUrl":"https://doi.org/10.1145/800182.810420","url":null,"abstract":"A language or set of languages, called dynamic algebras, which will simplify programming and provide the capability of simplifying programs are proposed. In such languages, the constructions of arithmetic and algebra are emphasized, resulting in fewer but larger statements, rather than smaller, explicitly sequenced assignments and transfer A set of operators (called the Aiken operators) are introduced and their usefulness demonstrated. Three examples are presented of the simplification of dynamic algebra programs using the ordinary rules of algebra. Finally, the efficiency of such programs on von Neumann, parallel, and pipeline machines is discussed.","PeriodicalId":204185,"journal":{"name":"ACM '74","volume":"25 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":"133401418","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}
Although higher level languages have achieved wide-spread use for program production, much system software is still being written in assembler language for reasons such as efficiency of code produced, lack of appropriate high level languages or compilers, costs of compilations, or compatibility with older software. Code efficiency is probably the most often cited reason for using assembler language since it affects the saleability of a manufacturer's product much more than whether the code is easy to understand and modify or is well-documented. Code efficiency directly affects system performance under benchmark tests, one of the most widely used comparators for computer selection. The future development of very large cheap and fast processor and main memory components will influence how important it will be to continue programming in low level "efficient" languages, but the use of these languages will probably continue on a large scale for at least another decade.
{"title":"Inverse compiling for program documentation","authors":"Gregory L. Hopwood","doi":"10.1145/1408800.1408928","DOIUrl":"https://doi.org/10.1145/1408800.1408928","url":null,"abstract":"Although higher level languages have achieved wide-spread use for program production, much system software is still being written in assembler language for reasons such as efficiency of code produced, lack of appropriate high level languages or compilers, costs of compilations, or compatibility with older software. Code efficiency is probably the most often cited reason for using assembler language since it affects the saleability of a manufacturer's product much more than whether the code is easy to understand and modify or is well-documented. Code efficiency directly affects system performance under benchmark tests, one of the most widely used comparators for computer selection. The future development of very large cheap and fast processor and main memory components will influence how important it will be to continue programming in low level \"efficient\" languages, but the use of these languages will probably continue on a large scale for at least another decade.","PeriodicalId":204185,"journal":{"name":"ACM '74","volume":"34 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":"121468525","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}
Impact analysis is the assessment in terms of monetary loss of any potential threat to the organization. Impact analysis combines the Bayesian decisionprocess withthe Delphi method, as modified herein. A computer can be used to produce a statistical summary useful in fore-casting. This paper will describe impact analysis.First, brief summaries of the Bayesian decision process and the Delphi technique are offered.Then, the method for impact analysis is outlined, followed by a description of a recent application.The application was developed at the Weyer- haeuser Company, Tacoma, ashington. Weyer- haeuser is one of the largest forest products companies in the world. The paper concludes with suggestions for other applications.
{"title":"Impact analysis","authors":"James S. Ketchel, John P. Dolan","doi":"10.1145/800182.810419","DOIUrl":"https://doi.org/10.1145/800182.810419","url":null,"abstract":"Impact analysis is the assessment in terms of monetary loss of any potential threat to the organization. Impact analysis combines the Bayesian decisionprocess withthe Delphi method, as modified herein. A computer can be used to produce a statistical summary useful in fore-casting.\u0000 This paper will describe impact analysis.First, brief summaries of the Bayesian decision process and the Delphi technique are offered.Then, the method for impact analysis is outlined, followed by a description of a recent application.The application was developed at the Weyer- haeuser Company, Tacoma, ashington. Weyer- haeuser is one of the largest forest products companies in the world. The paper concludes with suggestions for other applications.","PeriodicalId":204185,"journal":{"name":"ACM '74","volume":"2 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":"114574316","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}
Mr. C. T. Schlegel, Chairman of the ACM74 session for which this paper was prepared, described his session as one which will try to distinguish those intrinsic features of information systems which separate them from data management systems. He further states that. "there exist many programming packages which efficiently and rapidly handle large amounts of data stored on computers. However, to call them information systems is a little too inaccurate for our tastes"... Mr. Schlegel makes the further observation that. "data becomes information only when interpreted in some context, and the context and the interpretation are usually provided by people who use the data, not the software".
编写本文件的第74届会议主席C. T. Schlegel先生说，他的会议将努力区分信息系统与数据管理系统之间的内在特征。他进一步指出。现在有许多程序包可以高效、快速地处理存储在计算机上的大量数据。然而，称它们为信息系统对我们的口味来说有点太不准确了……施莱格尔先生进一步指出。“数据只有在某种情况下被解释才能成为信息，而这种情况和解释通常是由使用数据的人提供的，而不是软件”。
{"title":"A look at characterizing the design of information systems","authors":"N. P. Edwards, H. Tellier","doi":"10.1145/1408800.1408865","DOIUrl":"https://doi.org/10.1145/1408800.1408865","url":null,"abstract":"Mr. C. T. Schlegel, Chairman of the ACM74 session for which this paper was prepared, described his session as one which will try to distinguish those intrinsic features of information systems which separate them from data management systems. He further states that. \"there exist many programming packages which efficiently and rapidly handle large amounts of data stored on computers. However, to call them information systems is a little too inaccurate for our tastes\"... Mr. Schlegel makes the further observation that. \"data becomes information only when interpreted in some context, and the context and the interpretation are usually provided by people who use the data, not the software\".","PeriodicalId":204185,"journal":{"name":"ACM '74","volume":"68 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":"115701680","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 area of "software physics and algorithmic complexity" is providing some much needed quantization of the notions of a program and an algorithm. I am interested in those aspects of this quantization that allow one to estimate the length of an algorithm programmed in one language given the length of the same algorithm programmed in another language.
{"title":"Analysis of algorithms implemented in software and hardware","authors":"D. Ostapko","doi":"10.1145/1408800.1408924","DOIUrl":"https://doi.org/10.1145/1408800.1408924","url":null,"abstract":"The area of \"software physics and algorithmic complexity\" is providing some much needed quantization of the notions of a program and an algorithm. I am interested in those aspects of this quantization that allow one to estimate the length of an algorithm programmed in one language given the length of the same algorithm programmed in another language.","PeriodicalId":204185,"journal":{"name":"ACM '74","volume":"44 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":"122538907","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}
Myoelectric signal processing techniques, used as the basis for control of a multiple-axis upper limb prosthesis, have been exceptional in providing the amputee with natural control of motion without the need for training. The approach rests on the electronic recognition of normal muscle synergies in the stabilizing musculature of the shoulder, chest, and back, in order to control the motors of the prosthesis when performing the intended motions. Observations were made of the variability and repeatability of the myoelectric patterns; the appropriate signal processing parameters were determined, and a laboratory prostheses was fabricated and tested.
{"title":"Myoelectric signal processing for control of prosthetic devices","authors":"Donald R. Taylor, F. Ray Finley","doi":"10.1145/1408800.1408883","DOIUrl":"https://doi.org/10.1145/1408800.1408883","url":null,"abstract":"Myoelectric signal processing techniques, used as the basis for control of a multiple-axis upper limb prosthesis, have been exceptional in providing the amputee with natural control of motion without the need for training. The approach rests on the electronic recognition of normal muscle synergies in the stabilizing musculature of the shoulder, chest, and back, in order to control the motors of the prosthesis when performing the intended motions. Observations were made of the variability and repeatability of the myoelectric patterns; the appropriate signal processing parameters were determined, and a laboratory prostheses was fabricated and tested.","PeriodicalId":204185,"journal":{"name":"ACM '74","volume":"11 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":"115554906","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}
An on-line interactive audiographic learning system is described. The system is able to deliver synchronized narrative and line-graphic learning information to learners at remote locations via regular telephone lines. A quasi-conversational mode of instruction allows learners to control the interaction by using Touch-Tone telephone signals. Individualized instruction is achieved by providing the learner with the possibility of selecting, stopping, reviewing, and skipping instructional materials at his own desire and pace. Instructional information in both audio and graphic forms are stored electronically on regular stereo audio tapes in modular forms. Multiple tape units are used to store the learning data base. A PDP-8/I computer is used to control the process. Instructional modules are redundantly stored to permit access by multiple learners at different learning stations. Learning activities of each user are recorded. The hardware and software of the system is described. The procedures of course generation, editing, processing, and up-dating are described.
{"title":"An on-line interactive audiographic learning system","authors":"T. Ting, A. P. Jensen","doi":"10.1145/800182.810408","DOIUrl":"https://doi.org/10.1145/800182.810408","url":null,"abstract":"An on-line interactive audiographic learning system is described. The system is able to deliver synchronized narrative and line-graphic learning information to learners at remote locations via regular telephone lines. A quasi-conversational mode of instruction allows learners to control the interaction by using Touch-Tone telephone signals. Individualized instruction is achieved by providing the learner with the possibility of selecting, stopping, reviewing, and skipping instructional materials at his own desire and pace.\u0000 Instructional information in both audio and graphic forms are stored electronically on regular stereo audio tapes in modular forms. Multiple tape units are used to store the learning data base. A PDP-8/I computer is used to control the process. Instructional modules are redundantly stored to permit access by multiple learners at different learning stations. Learning activities of each user are recorded.\u0000 The hardware and software of the system is described. The procedures of course generation, editing, processing, and up-dating are described.","PeriodicalId":204185,"journal":{"name":"ACM '74","volume":"56 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113933761","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 feasibility of the use of techniques of inverse compilation (decompilation) for the solution of Software Transport problems depends to a great extent upon the level of adaptability of software systems designed to automate the decompilation process. The attainment of a sufficiently high level of adaptability requires the development of very general and efficient techniques of program structure and variable usage analysis. However, while such techniques are necessary for the development of adaptable decompilation software, they are not by themselves sufficient. What is further needed is a highly sophisticated medium of program description that 1) is comparatively easy to map to and from assembly languages for a wide variety of machines, 2) is suitable for direct input to a program analyzer, and 3) is easily produced by a high-level language compiler.
{"title":"Inverse compilation feasibility","authors":"F. Friedman","doi":"10.1145/1408800.1408927","DOIUrl":"https://doi.org/10.1145/1408800.1408927","url":null,"abstract":"The feasibility of the use of techniques of inverse compilation (decompilation) for the solution of Software Transport problems depends to a great extent upon the level of adaptability of software systems designed to automate the decompilation process. The attainment of a sufficiently high level of adaptability requires the development of very general and <u>efficient</u> techniques of program structure and variable usage analysis. However, while such techniques are necessary for the development of adaptable decompilation software, they are not by themselves sufficient. What is further needed is a highly sophisticated medium of program description that 1) is comparatively easy to map to and from assembly languages for a wide variety of machines, 2) is suitable for direct input to a program analyzer, and 3) is easily produced by a high-level language compiler.","PeriodicalId":204185,"journal":{"name":"ACM '74","volume":"53 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":"117201544","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 is an attempt at presenting a high level model of the set and graph aspects of the graph algorithmic language GRAAL [5]. The problem area for which the language GRAAL was designed was the solution of graph problems of the type primarily arising in applications. It was designed with two objectives in mind. The first was to develop a language which permitted the writing of graph algorithms in a highly readable form with as natural a set of primitives as possible for describing the algorithm. The second was to allow for a wide variety of graphs of different types and complexity with as little degradation as possible in the efficient implementation and execution of an algorithm designed for a specific type of problem.
{"title":"Sets and graphs in GRAAL","authors":"V. Basili","doi":"10.1145/800182.810415","DOIUrl":"https://doi.org/10.1145/800182.810415","url":null,"abstract":"This paper is an attempt at presenting a high level model of the set and graph aspects of the graph algorithmic language GRAAL [5]. The problem area for which the language GRAAL was designed was the solution of graph problems of the type primarily arising in applications. It was designed with two objectives in mind. The first was to develop a language which permitted the writing of graph algorithms in a highly readable form with as natural a set of primitives as possible for describing the algorithm. The second was to allow for a wide variety of graphs of different types and complexity with as little degradation as possible in the efficient implementation and execution of an algorithm designed for a specific type of problem.","PeriodicalId":204185,"journal":{"name":"ACM '74","volume":"59 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":"123118851","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 structured programmer often produces code in an order relatively unrelated to the order required by a specific programming language. The task of reordering the structured code to the specifications of the chosen language is tedious and error prone, particularly for large programs. A programming aid, "STRUCTURE", is described that relieves the programmer of this burden. In addition, it provides a listing of the program in the hierarchical order of the solution, making the program more amenable to manipulation by the programmer.
{"title":"A programming aid for structured programmers","authors":"Douglas E. Jones","doi":"10.1145/1408800.1408879","DOIUrl":"https://doi.org/10.1145/1408800.1408879","url":null,"abstract":"The structured programmer often produces code in an order relatively unrelated to the order required by a specific programming language. The task of reordering the structured code to the specifications of the chosen language is tedious and error prone, particularly for large programs. A programming aid, \"STRUCTURE\", is described that relieves the programmer of this burden. In addition, it provides a listing of the program in the hierarchical order of the solution, making the program more amenable to manipulation by the programmer.","PeriodicalId":204185,"journal":{"name":"ACM '74","volume":"31 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":"121925146","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
扫码关注我们
求助内容：
应助结果提醒方式：