Computer based conferencing is now the subject of several serious large scale research programs. A number of conferencing systems exist and have been refined to the stage that they are now practical working tools for use in at least some kinds of conferencing activities. The impact of the energy crisis and a growing interest in substituting telecommunication for transportation has encouraged this growth.
{"title":"Computer based conferencing: a progress report","authors":"M. Morgan","doi":"10.1145/1408800.1408909","DOIUrl":"https://doi.org/10.1145/1408800.1408909","url":null,"abstract":"Computer based conferencing is now the subject of several serious large scale research programs. A number of conferencing systems exist and have been refined to the stage that they are now practical working tools for use in at least some kinds of conferencing activities. The impact of the energy crisis and a growing interest in substituting telecommunication for transportation has encouraged this growth.","PeriodicalId":204185,"journal":{"name":"ACM '74","volume":"2022 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":"128059846","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 computer program that interacts through sensory and motor mechanisms with a simulated two-dimensional environment is described. The program receives information from the environment through visual and tactile senses, and possesses an arm with which it can move objects. Learning mechanisms are described that allow the program to progress from almost random initial behavior to fairly organized interactions with the environment, including guiding the arm by use of visual information. The program retains its knowledge of its world in a net-like structure.
{"title":"Sensorimotor learning in a simulated physical environment","authors":"R. Plummer","doi":"10.1145/800182.810424","DOIUrl":"https://doi.org/10.1145/800182.810424","url":null,"abstract":"A computer program that interacts through sensory and motor mechanisms with a simulated two-dimensional environment is described. The program receives information from the environment through visual and tactile senses, and possesses an arm with which it can move objects.\u0000 Learning mechanisms are described that allow the program to progress from almost random initial behavior to fairly organized interactions with the environment, including guiding the arm by use of visual information. The program retains its knowledge of its world in a net-like structure.","PeriodicalId":204185,"journal":{"name":"ACM '74","volume":"67 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":"132674095","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 trace-driven model is used to study the effects of various schedulers and deadlock control algorithms, and their interactions, on response times in a general-purpose operating system. Jobs' requests for memory and processors are extracted from a production load and used to drive a detailed simulation program. The simulation results show that response time is more sensitive than CPU utilization to differences between schedulers and deadlock control algorithms. Preemptive scheduling improves response time but degrades CPU utilization. Preemptive deadlock control algorithms improve both measures of performance. There are significant interactions between schedulers and deadlock control algorithms. Deadlock control algorithms can not be expected to optimize resource utilization.
{"title":"A study of response times under various deadlock algorithms and job schedulers","authors":"S. Sherman, J. Howard, J. Browne","doi":"10.1145/1408800.1408843","DOIUrl":"https://doi.org/10.1145/1408800.1408843","url":null,"abstract":"A trace-driven model is used to study the effects of various schedulers and deadlock control algorithms, and their interactions, on response times in a general-purpose operating system. Jobs' requests for memory and processors are extracted from a production load and used to drive a detailed simulation program. The simulation results show that response time is more sensitive than CPU utilization to differences between schedulers and deadlock control algorithms. Preemptive scheduling improves response time but degrades CPU utilization. Preemptive deadlock control algorithms improve both measures of performance. There are significant interactions between schedulers and deadlock control algorithms. Deadlock control algorithms can not be expected to optimize resource utilization.","PeriodicalId":204185,"journal":{"name":"ACM '74","volume":"38 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":"132743475","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 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}
The arm amputee is limited in his ability to generate and receive the information necessary to achieve smooth, coordinated control of a multijoint prosthesis. To augment his information processing capability, various applications of reflex feedback loops in the prosthesis itself and computer aiding with micro computer technology appear to make it possible to develop sophisticated arm prostheses at reasonable cost. Based on a review of various techniques utilized for prosthetic control, a combination is proposed that makes use of myoelectric pattern recognition, local reflex control, and adaptive computer aiding with heuristic and algorithmic generation of multijoint trajectories.
{"title":"Design approaches to adaptive control systems for arm prostheses","authors":"J. Lyman","doi":"10.1145/1408800.1408841","DOIUrl":"https://doi.org/10.1145/1408800.1408841","url":null,"abstract":"The arm amputee is limited in his ability to generate and receive the information necessary to achieve smooth, coordinated control of a multijoint prosthesis. To augment his information processing capability, various applications of reflex feedback loops in the prosthesis itself and computer aiding with micro computer technology appear to make it possible to develop sophisticated arm prostheses at reasonable cost. Based on a review of various techniques utilized for prosthetic control, a combination is proposed that makes use of myoelectric pattern recognition, local reflex control, and adaptive computer aiding with heuristic and algorithmic generation of multijoint trajectories.","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":"117295575","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}
Economy and flexibility provide the motivation for using a single set of computer ports for various terminal types. To do this, the communications controller must adapt to the different terminal characteristics. This, in turn, requires that the controller recognize the type of terminal. Many terminal speed recognition algorithms require the user to type a terminal identification character before entering the first command. Entering an identification character detracts from the user interface to the computer. A scheme making terminal recognition almost invisible to the user is described. The implementation recognizes the following terminal types: the IBM 2741, and ASCII terminals operating at 110, 150, and 300 baud. While the algorithm is programmed on the IBM 3705 Communications Controller, it could be applied to other controllers. To make this easier, the algorithm is described in detail, and the techniques generalized.
{"title":"User-transparent automatic terminal speed selection","authors":"E. F. Hart","doi":"10.1145/1408800.1408823","DOIUrl":"https://doi.org/10.1145/1408800.1408823","url":null,"abstract":"Economy and flexibility provide the motivation for using a single set of computer ports for various terminal types. To do this, the communications controller must adapt to the different terminal characteristics. This, in turn, requires that the controller recognize the type of terminal. Many terminal speed recognition algorithms require the user to type a terminal identification character before entering the first command. Entering an identification character detracts from the user interface to the computer. A scheme making terminal recognition almost invisible to the user is described. The implementation recognizes the following terminal types: the IBM 2741, and ASCII terminals operating at 110, 150, and 300 baud. While the algorithm is programmed on the IBM 3705 Communications Controller, it could be applied to other controllers. To make this easier, the algorithm is described in detail, and the techniques generalized.","PeriodicalId":204185,"journal":{"name":"ACM '74","volume":"20 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":"115383274","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}
Techniques for scheduling disk drives are of two types: those which schedule transfers (based on rotational position) and those which schedule seeks (based on cylinder position). A simulation model has been developed to evaluate both of these approaches in a multiple drive environment. Use of this model for a comparison of two techniques for transfer scheduling has recently been reported [13]. This paper presents additional results of that study and extends it with a preliminary exploration of seek scheduling effects. The results indicate that seek scheduling can be effective for large configurations only when used in conjunction with a transfer scheduling technique.
{"title":"The scheduling of multiple disk drives","authors":"Richard R. Reisman","doi":"10.1145/800182.810422","DOIUrl":"https://doi.org/10.1145/800182.810422","url":null,"abstract":"Techniques for scheduling disk drives are of two types: those which schedule transfers (based on rotational position) and those which schedule seeks (based on cylinder position). A simulation model has been developed to evaluate both of these approaches in a multiple drive environment. Use of this model for a comparison of two techniques for transfer scheduling has recently been reported [13]. This paper presents additional results of that study and extends it with a preliminary exploration of seek scheduling effects. The results indicate that seek scheduling can be effective for large configurations only when used in conjunction with a transfer scheduling technique.","PeriodicalId":204185,"journal":{"name":"ACM '74","volume":"65 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":"122103311","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 Navy's Integrated Ship Design System (ISDS) is being designed as a collection of application program modules (for preliminary design) which communicate with a centralized set of data files. These files use the existing COMRADE Data Management System which was designed specifically for integrated systems. Apart from providing an environment in which to operate the engineering application modules, ISDS's main role is to manage the creation, flow and archiving of the ship design data and to control access to this data. Consequently, a major concern during the lengthy and complex ship design process is assuring the integrity of the design data as it grows and is revised over time. Planning for control of the design data requires a clear understanding of the design process and the interrelationships between the design tasks. Requirements are stated, problem areas are identified, and possible approaches for implementation are suggested.
{"title":"Control of design data in the integrated ship design system","authors":"P. Bono","doi":"10.1145/800182.810428","DOIUrl":"https://doi.org/10.1145/800182.810428","url":null,"abstract":"The Navy's Integrated Ship Design System (ISDS) is being designed as a collection of application program modules (for preliminary design) which communicate with a centralized set of data files. These files use the existing COMRADE Data Management System which was designed specifically for integrated systems.\u0000 Apart from providing an environment in which to operate the engineering application modules, ISDS's main role is to manage the creation, flow and archiving of the ship design data and to control access to this data. Consequently, a major concern during the lengthy and complex ship design process is assuring the integrity of the design data as it grows and is revised over time.\u0000 Planning for control of the design data requires a clear understanding of the design process and the interrelationships between the design tasks. Requirements are stated, problem areas are identified, and possible approaches for implementation are suggested.","PeriodicalId":204185,"journal":{"name":"ACM '74","volume":"79 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":"127774520","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 many computing systems developed in the last few years have claimed to be 'user-oriented,' there is no consensus, beyond gratuitous generalizations and isolated examples, on what are user needs and what constitutes a user-oriented system.
{"title":"User needs and the design of user-oriented systems","authors":"R. Venezky, N. Relles","doi":"10.1145/1408800.1408915","DOIUrl":"https://doi.org/10.1145/1408800.1408915","url":null,"abstract":"Although many computing systems developed in the last few years have claimed to be 'user-oriented,' there is no consensus, beyond gratuitous generalizations and isolated examples, on what are user needs and what constitutes a user-oriented system.","PeriodicalId":204185,"journal":{"name":"ACM '74","volume":"1 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":"129052742","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
扫码关注我们
求助内容：
应助结果提醒方式：