The purpose of this paper was to introduce some of the preliminary findings resulting from the studies into the management of a class of computer based information systems which were conducted in the School of Information and Computer Science of the Georgia Institute of Technology. One of the main accomplishments was the specification of a pre-scheduling system which could monitor existing and future workloads and could identify effective processing sequences. The pre-scheduling procedure and its basic components were outlined through the identification of the fundamental defining expressions. The possible effects of the implementation of such a procedure were investigated through several experiments and a summary of these have been presented as to the effects of the pre-scheduling upon management decisions.
{"title":"Pre-scheduling—a management tool?","authors":"J. Hoffman, J. Gwynn","doi":"10.1145/800184.810468","DOIUrl":"https://doi.org/10.1145/800184.810468","url":null,"abstract":"The purpose of this paper was to introduce some of the preliminary findings resulting from the studies into the management of a class of computer based information systems which were conducted in the School of Information and Computer Science of the Georgia Institute of Technology. One of the main accomplishments was the specification of a pre-scheduling system which could monitor existing and future workloads and could identify effective processing sequences. The pre-scheduling procedure and its basic components were outlined through the identification of the fundamental defining expressions. The possible effects of the implementation of such a procedure were investigated through several experiments and a summary of these have been presented as to the effects of the pre-scheduling upon management decisions.","PeriodicalId":126192,"journal":{"name":"ACM '71","volume":"36 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":"116428093","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 development of software for mathematical programming has paralleled the development of basic software and has perhaps the longest history of any application system in the computing field. It is by now powerful and elaborate, as well as complicated and expensive. In spite of some aberrations in the evolution of mathematical programming systems, or MPS—due to competitive factors for both a business and a professional nature—a fairly universal set of design specification and performance characteristics have evolved and are now well proven in several systems. Unfortunately, existing capability is seldom used with full effectiveness and useful extensions are passed over even though many are possible with modest expenditure—provided one builds upon legitimate experience.
{"title":"Software for mathematical programming","authors":"W. Orchard-Hays","doi":"10.1145/800184.810499","DOIUrl":"https://doi.org/10.1145/800184.810499","url":null,"abstract":"The development of software for mathematical programming has paralleled the development of basic software and has perhaps the longest history of any application system in the computing field. It is by now powerful and elaborate, as well as complicated and expensive.\u0000 In spite of some aberrations in the evolution of mathematical programming systems, or MPS—due to competitive factors for both a business and a professional nature—a fairly universal set of design specification and performance characteristics have evolved and are now well proven in several systems. Unfortunately, existing capability is seldom used with full effectiveness and useful extensions are passed over even though many are possible with modest expenditure—provided one builds upon legitimate experience.","PeriodicalId":126192,"journal":{"name":"ACM '71","volume":"45 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":"123754788","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}
Gary J. Boos, Dennis W. Cooper, J. Gillogly, D. Levy, H. D. Raymond, David J. Slate, Rolf C. Smith, B. Mittman
Last year, during ACM'70 in New York, the First United States Computer Chess Championship was held. Six programs competed, with Northwestern University's CHESS 3.0 winning the tournament. This year at ACM'71, the Second Annual Computer Chess Championship and a panel of the programs' authors are scheduled. At the time of this writing, there are six programs entered in the tournament. Presented below are short summaries of authors' panel presentations, giving some details of their programs and discussing techniques for developing more effective chess playing programs. Mr. David Levy, an international chess master from the University of Glasgow, is the tournament director for the chess championship and a discussant during the panel.
{"title":"Computer chess programs (Panel)","authors":"Gary J. Boos, Dennis W. Cooper, J. Gillogly, D. Levy, H. D. Raymond, David J. Slate, Rolf C. Smith, B. Mittman","doi":"10.1145/800184.810474","DOIUrl":"https://doi.org/10.1145/800184.810474","url":null,"abstract":"Last year, during ACM'70 in New York, the First United States Computer Chess Championship was held. Six programs competed, with Northwestern University's CHESS 3.0 winning the tournament. This year at ACM'71, the Second Annual Computer Chess Championship and a panel of the programs' authors are scheduled. At the time of this writing, there are six programs entered in the tournament. Presented below are short summaries of authors' panel presentations, giving some details of their programs and discussing techniques for developing more effective chess playing programs. Mr. David Levy, an international chess master from the University of Glasgow, is the tournament director for the chess championship and a discussant during the panel.","PeriodicalId":126192,"journal":{"name":"ACM '71","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":"130634719","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}
Traditional pencil-and-paper analyses of enzyme kinetic experiments assume so much simplification that the results have limited biological significance. Althouqh performing initial velocity experiments with negligibly low enzyme concentrations in the presence of single inhibitors facilitates interpretation, there are a number of enzymes for which this method fails completely. Software has been developed for the economical simulation of enzyme behavior under realistic conditions. Enzyme activity is computed as a function of either time or concentration by solution of either differential or algebraic equations with any desired ratio of enzyme/substrate concentrations. Simulation of experiments with hexo-kinase from mouse ascites cells has permitted resolution of some apparently contradictory results and indicated guidelines for assuring reliability of data. Applications of lab. analyzers to improve interpretation of experiments and perhaps actually perform them are discussed.
{"title":"Computer technology for the realistic calculation of properties of enzyme systems","authors":"L. Garfinkel, D. Rhoads, D. Garfinkel","doi":"10.1145/800184.810530","DOIUrl":"https://doi.org/10.1145/800184.810530","url":null,"abstract":"Traditional pencil-and-paper analyses of enzyme kinetic experiments assume so much simplification that the results have limited biological significance. Althouqh performing initial velocity experiments with negligibly low enzyme concentrations in the presence of single inhibitors facilitates interpretation, there are a number of enzymes for which this method fails completely. Software has been developed for the economical simulation of enzyme behavior under realistic conditions. Enzyme activity is computed as a function of either time or concentration by solution of either differential or algebraic equations with any desired ratio of enzyme/substrate concentrations. Simulation of experiments with hexo-kinase from mouse ascites cells has permitted resolution of some apparently contradictory results and indicated guidelines for assuring reliability of data. Applications of lab. analyzers to improve interpretation of experiments and perhaps actually perform them are discussed.","PeriodicalId":126192,"journal":{"name":"ACM '71","volume":"17 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":"132026477","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 concerned with the development of data management systems from an associative point of view. The design utilizes relational set theory applied to information systems. The basic notion involves the mathematical transformation of hierarchical structures of n-ary relations into associative normal form (ANF). This transformation preserves the information content while at the same time allowing the information to be manipulated by an associative memory in a more efficient manner than is possible on a random access memory. Among the advantages that can be realized from this system are the capability of handling many and varied data structures; substantially fewer pointers and directories; a reduction in storage space requirements; and a substantial decrease in query and update time.
{"title":"Associative techniques in the solution of data management problems","authors":"C. R. Defiore, N. J. Stillman, P. Berra","doi":"10.1145/800184.810470","DOIUrl":"https://doi.org/10.1145/800184.810470","url":null,"abstract":"This paper is concerned with the development of data management systems from an associative point of view. The design utilizes relational set theory applied to information systems. The basic notion involves the mathematical transformation of hierarchical structures of n-ary relations into associative normal form (ANF). This transformation preserves the information content while at the same time allowing the information to be manipulated by an associative memory in a more efficient manner than is possible on a random access memory. Among the advantages that can be realized from this system are the capability of handling many and varied data structures; substantially fewer pointers and directories; a reduction in storage space requirements; and a substantial decrease in query and update time.","PeriodicalId":126192,"journal":{"name":"ACM '71","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":"131534265","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 method is described for utilizing a system of Fortran subprograms to implement algorithms and variants of algorithms for Mathematical Programming. A particular implementation of the Dantzig-Wolfe procedure is used as an example.
{"title":"MOSES—a system for quickly implementing efficient code for new linear programming algorithms and variants of algorithms","authors":"R. C. Bushnell","doi":"10.1145/800184.810496","DOIUrl":"https://doi.org/10.1145/800184.810496","url":null,"abstract":"A method is described for utilizing a system of Fortran subprograms to implement algorithms and variants of algorithms for Mathematical Programming. A particular implementation of the Dantzig-Wolfe procedure is used as an example.","PeriodicalId":126192,"journal":{"name":"ACM '71","volume":"23 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":"134320528","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 experiment is described which treats the computer as an interacting member of a dyad in studying the social psychology of conflict. An internation simulation is used to test the effects of threat type (Deterrent vs. Compellent), situation (Hostile vs. Friendly set) and opponent (Man vs. Computer) on compliance. The results indicate that those playing against the computer are more likely to initiate an early pre-emptive attack. Of those that do not attack, though, those playing against the computer are more likely to comply to a threat than those playing another person. Further, compellent threats are less likely to be complied with and are more likely to result in an attack from the person being threatened. Possible reasons for these findings are discussed. Finally, it was found that individual self-perceptions and perceptions of the other vary as a function of the condition.
{"title":"The computerized statesman: Further explorations into the escalation of conflict","authors":"Douglas F. Johnson, W. L. Mihal","doi":"10.1145/800184.810479","DOIUrl":"https://doi.org/10.1145/800184.810479","url":null,"abstract":"An experiment is described which treats the computer as an interacting member of a dyad in studying the social psychology of conflict. An internation simulation is used to test the effects of threat type (Deterrent vs. Compellent), situation (Hostile vs. Friendly set) and opponent (Man vs. Computer) on compliance. The results indicate that those playing against the computer are more likely to initiate an early pre-emptive attack. Of those that do not attack, though, those playing against the computer are more likely to comply to a threat than those playing another person. Further, compellent threats are less likely to be complied with and are more likely to result in an attack from the person being threatened. Possible reasons for these findings are discussed. Finally, it was found that individual self-perceptions and perceptions of the other vary as a function of the condition.","PeriodicalId":126192,"journal":{"name":"ACM '71","volume":"104 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":"131215752","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 concerned with the mechanisms of human intelligence and natural language communication, and with the design of an interactive computer program that incorporates and utilizes analogous mechanisms to improve man-machine communication. AUTONOTE2 is an improved personal information retrieval system. It includes, in addition to AUTONOTE (a presently running system), (1) mechanisms allowing the user to employ certain kinds of noun phrases to describe the items he wishes to store and retrieve; and (2) mechanisms enabling the system to maintain a map of what the user is referring to. Though extremely limited by comparison with the analogous human capabilities, these mechanisms add significantly to the descriptive power available to the user, and to the ease and efficiency of communication with the system. Furthermore, because AUTONOTE is a file oriented system, these additions add little to the present low cost of using the system. AUTONOTE2 also suggests new directions for software development for man-machine interaction, and it provides a practical testing ground for ideas about intelligence derived from observation of natural intelligence.
{"title":"Referential communication in AUTONOTE, a personal information retrieval system","authors":"William E. Linn, W. Reitman","doi":"10.1145/800184.810472","DOIUrl":"https://doi.org/10.1145/800184.810472","url":null,"abstract":"This paper is concerned with the mechanisms of human intelligence and natural language communication, and with the design of an interactive computer program that incorporates and utilizes analogous mechanisms to improve man-machine communication. AUTONOTE2 is an improved personal information retrieval system. It includes, in addition to AUTONOTE (a presently running system), (1) mechanisms allowing the user to employ certain kinds of noun phrases to describe the items he wishes to store and retrieve; and (2) mechanisms enabling the system to maintain a map of what the user is referring to. Though extremely limited by comparison with the analogous human capabilities, these mechanisms add significantly to the descriptive power available to the user, and to the ease and efficiency of communication with the system. Furthermore, because AUTONOTE is a file oriented system, these additions add little to the present low cost of using the system. AUTONOTE2 also suggests new directions for software development for man-machine interaction, and it provides a practical testing ground for ideas about intelligence derived from observation of natural intelligence.","PeriodicalId":126192,"journal":{"name":"ACM '71","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":"126271909","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 general goals of a patient monitoring system are described and discussed, particular emphasis being placed on the necessity for extensive user-system interactions. The design of an executive program based on these goals is presented. The executive controls the execution of multiple, independent tasks and provides certain functions which are most frequently used in real-time monitoring. The executive structure and control algorithms are described. Several applications which use the executive are described including a four patient, multiple-signal, continuous monitoring system and a paging control program.
{"title":"Utilization of a small computer for real-time continuous patient monitoring","authors":"S. Deller, F. Lewis, M. Quinn","doi":"10.1145/800184.810529","DOIUrl":"https://doi.org/10.1145/800184.810529","url":null,"abstract":"The general goals of a patient monitoring system are described and discussed, particular emphasis being placed on the necessity for extensive user-system interactions. The design of an executive program based on these goals is presented. The executive controls the execution of multiple, independent tasks and provides certain functions which are most frequently used in real-time monitoring. The executive structure and control algorithms are described. Several applications which use the executive are described including a four patient, multiple-signal, continuous monitoring system and a paging control program.","PeriodicalId":126192,"journal":{"name":"ACM '71","volume":"58 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":"116727697","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 paper describes the design of a software structure which handles a large variable data base on a minicomputer. The design centers around a minicomputer with a 4K word memory, a low cost magnetic tape unit and a paper tape reader. The product under test is a 400 line telephone system. The TE 400A telephone system is tailored to each customer, and over 4000 test points are required to test the larger systems.
{"title":"A software structure for testing a complex product with a minicomputer","authors":"D. J. Garney","doi":"10.1145/800184.810482","DOIUrl":"https://doi.org/10.1145/800184.810482","url":null,"abstract":"The paper describes the design of a software structure which handles a large variable data base on a minicomputer. The design centers around a minicomputer with a 4K word memory, a low cost magnetic tape unit and a paper tape reader. The product under test is a 400 line telephone system. The TE 400A telephone system is tailored to each customer, and over 4000 test points are required to test the larger systems.","PeriodicalId":126192,"journal":{"name":"ACM '71","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":"129285977","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
扫码关注我们
求助内容：
应助结果提醒方式：