The AFTERMATH system implements a heuristic technique for improving long solutions (up to about 250 steps) for robot planning problems. AFTERMATH transforms the given solution into a skeleton solution that focuses attention on repetitious and opposite moves. AFTERMATH attempts to obtain an alternate, improved skeleton. From the alternate skeleton, an alternate solution is built (if possible) to the original problem. If the alternate solution is an improvement, AFTERMATH accepts it as input, and cycles. Although not guaranteeing optimality, AFTERMATH improves many solutions, sometimes gradually in several cycles. Examples can be built for which AFTERMATH obtains an arbitrarily large improvement in one cycle.
{"title":"Skeleton planning spaces for non-numeric heuristic optimization*","authors":"L. Siklóssy, M. Haecker","doi":"10.1145/800182.810401","DOIUrl":"https://doi.org/10.1145/800182.810401","url":null,"abstract":"The AFTERMATH system implements a heuristic technique for improving long solutions (up to about 250 steps) for robot planning problems. AFTERMATH transforms the given solution into a skeleton solution that focuses attention on repetitious and opposite moves. AFTERMATH attempts to obtain an alternate, improved skeleton. From the alternate skeleton, an alternate solution is built (if possible) to the original problem. If the alternate solution is an improvement, AFTERMATH accepts it as input, and cycles. Although not guaranteeing optimality, AFTERMATH improves many solutions, sometimes gradually in several cycles. Examples can be built for which AFTERMATH obtains an arbitrarily large improvement in one cycle.","PeriodicalId":204185,"journal":{"name":"ACM '74","volume":"345 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1973-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124642983","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}
Computing came into political science at an uneven pace and piecemeal. Early applications in the nineteen fifties centered on political phenomena with obvious quantitative characteristics, voting results above all. Thus, computing served early in the studies of the data of national and state elections, of legislative decisions, judicial behavior, and United Nations voting records. Another conjunction occurred in the work of public opinion polling, spreading from the home ground of pre-election surveys to many other aspects of public affairs.
{"title":"Useful applications of international event analysis","authors":"C. McClelland","doi":"10.1145/1408800.1408810","DOIUrl":"https://doi.org/10.1145/1408800.1408810","url":null,"abstract":"Computing came into political science at an uneven pace and piecemeal. Early applications in the nineteen fifties centered on political phenomena with obvious quantitative characteristics, voting results above all. Thus, computing served early in the studies of the data of national and state elections, of legislative decisions, judicial behavior, and United Nations voting records. Another conjunction occurred in the work of public opinion polling, spreading from the home ground of pre-election surveys to many other aspects of public affairs.","PeriodicalId":204185,"journal":{"name":"ACM '74","volume":"27 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":"116651801","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 my opinion that a new programming language is needed for applied scientific computing. Since there are so many languages already available one must address the question as to why another is needed. If one grants that a new one is in fact needed, then one must outline the functional specifications and/or the procedure for inventing the requisite language. The purpose of this article is to stimulate thought on the matter.
{"title":"On the need for a scientific programming language","authors":"P. M. Neely","doi":"10.1145/1408800.1408875","DOIUrl":"https://doi.org/10.1145/1408800.1408875","url":null,"abstract":"It is my opinion that a new programming language is needed for applied scientific computing. Since there are so many languages already available one must address the question as to why another is needed. If one grants that a new one is in fact needed, then one must outline the functional specifications and/or the procedure for inventing the requisite language. The purpose of this article is to stimulate thought on the matter.","PeriodicalId":204185,"journal":{"name":"ACM '74","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":"121107826","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}
J. Lederberg, E. Feigenbaum, E. Levinthal, T. Rindfleisch
In partnership with the Biotechnology Resources Branch (BRB) of the Division of Research Resources of the National Institutes of Health, Stanford University is developing a nationally shared computing resource to promote research in artificial intelligence (AI) oriented to bio-medical problems. Based on an initial national community of projects and taking advantage of current data communications technologies, the SUMEX (Stanford University Medical Experimental Computer) project hopes to provide an efficient engineering support team and software library for such investigations, and to promote a more systematic exchange of research tools, products, and ideas among existing projects.
{"title":"SUMEX: a resource for applications of artificial intelligence in medicine","authors":"J. Lederberg, E. Feigenbaum, E. Levinthal, T. Rindfleisch","doi":"10.1145/1408800.1408907","DOIUrl":"https://doi.org/10.1145/1408800.1408907","url":null,"abstract":"In partnership with the Biotechnology Resources Branch (BRB) of the Division of Research Resources of the National Institutes of Health, Stanford University is developing a nationally shared computing resource to promote research in artificial intelligence (AI) oriented to bio-medical problems. Based on an initial national community of projects and taking advantage of current data communications technologies, the SUMEX (Stanford University Medical Experimental Computer) project hopes to provide an efficient engineering support team and software library for such investigations, and to promote a more systematic exchange of research tools, products, and ideas among existing projects.","PeriodicalId":204185,"journal":{"name":"ACM '74","volume":"12 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":"127229042","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 problem of determining optimal partitions of hypergraphs (or, more simply of ordinary graphs), is relevant in several areas, such as computer aided design of printed boards, information retrieval and program paging. In many cases there exist optimal or near optimal partitions, subject to the constraint that each block is an LS set. Intuitively, an LS set is a subset of nodes of the given hypergraph, more strongly connected to each other that to the nodes in the complementary subset. This paper presents a polynomial-bounded procedure to determine all the LS sets in a given hypergraph.
{"title":"An approach to optimal partitioning of hypergraphs","authors":"G. Alia, P. Maestrini","doi":"10.1145/800182.810393","DOIUrl":"https://doi.org/10.1145/800182.810393","url":null,"abstract":"The problem of determining optimal partitions of hypergraphs (or, more simply of ordinary graphs), is relevant in several areas, such as computer aided design of printed boards, information retrieval and program paging. In many cases there exist optimal or near optimal partitions, subject to the constraint that each block is an LS set. Intuitively, an LS set is a subset of nodes of the given hypergraph, more strongly connected to each other that to the nodes in the complementary subset.\u0000 This paper presents a polynomial-bounded procedure to determine all the LS sets in a given hypergraph.","PeriodicalId":204185,"journal":{"name":"ACM '74","volume":"221 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":"116412958","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 advocates a certain type of computer network which we call a cluster network. The name is derived from the characteristic topology of the network which consists of processors grouped into clusters. The cluster design presented here assumes that: (1) processors are physically near each other; (2) each processor has a local memory; (3) network control of scheduling, resource allocation, and interprocess communication will be implemented in software.
{"title":"Communication and control in a cluster network","authors":"G. Chesson","doi":"10.1145/1408800.1408839","DOIUrl":"https://doi.org/10.1145/1408800.1408839","url":null,"abstract":"This paper advocates a certain type of computer network which we call a cluster network. The name is derived from the characteristic topology of the network which consists of processors grouped into clusters. The cluster design presented here assumes that: (1) processors are physically near each other; (2) each processor has a local memory; (3) network control of scheduling, resource allocation, and interprocess communication will be implemented in software.","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":"116626391","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 describes a new approach to the measurement and evaluation of computer performance. An extension of the classical benchmark technique, it offers substantially reduced costs in performing benchmark evaluations and also provides a means for aggregating data from several benchmarks to produce one evaluation. The technique is described and then a small example of the evaluation of two sorting routines is given.
{"title":"Language directed computer performance evaluation","authors":"D. Wortman","doi":"10.1145/800182.810413","DOIUrl":"https://doi.org/10.1145/800182.810413","url":null,"abstract":"This paper describes a new approach to the measurement and evaluation of computer performance. An extension of the classical benchmark technique, it offers substantially reduced costs in performing benchmark evaluations and also provides a means for aggregating data from several benchmarks to produce one evaluation. The technique is described and then a small example of the evaluation of two sorting routines is given.","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":"130601924","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 well known that continued fraction expansions provide a useful means for representing and computing values of functions. Expansions for many functions of mathematical analysis and physics are contained in the literature [1, 7, 9, 10]. Other expansions can be developed from a Taylor series (convergent or asymptotic) by efficient non-linear sequence algorithms [4, 5]. In addition to questions of convergence and speed of convergence of an infinite continued fraction
{"title":"Rounding error in evaluating continued fraction expansions","authors":"W. B. Jones, W. J. Thron","doi":"10.1145/800182.810374","DOIUrl":"https://doi.org/10.1145/800182.810374","url":null,"abstract":"It is well known that continued fraction expansions provide a useful means for representing and computing values of functions. Expansions for many functions of mathematical analysis and physics are contained in the literature [1, 7, 9, 10]. Other expansions can be developed from a Taylor series (convergent or asymptotic) by efficient non-linear sequence algorithms [4, 5]. In addition to questions of convergence and speed of convergence of an infinite continued fraction","PeriodicalId":204185,"journal":{"name":"ACM '74","volume":"184 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":"121230421","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}
Details are given on the architectural design of a computer currently under construction which has been optimized for display processing and display generation. The design takes full advantage of evolving trends in ECL medium and large scale integrated circuits. The processor incorporates the concept of instruction set partitioning. Hardwired instructions are used for critical display requirements while general purpose flexibility is provided by externally microprogrammable asynchronous processors. Design cycle time for this 32 bit processor is under 100 nanoseconds for instruction fetch and execute. Processor hardware costs are under $25,000. The device is designed to generate a full color TV image of 512 by 512 resolution in 0.1 to 0.8 seconds for 3D images of up to 1000 polygon complexity with all hidden parts removed by software for hidden surface calculations. Due to its inherent generality the CPU may be expanded to encompass a wide variety of other specialized or real-time tasks with minor additional hardware.
{"title":"A display-optimized processor","authors":"J. Staudhammer, J. Eastman","doi":"10.1145/1408800.1408881","DOIUrl":"https://doi.org/10.1145/1408800.1408881","url":null,"abstract":"Details are given on the architectural design of a computer currently under construction which has been optimized for display processing and display generation. The design takes full advantage of evolving trends in ECL medium and large scale integrated circuits. The processor incorporates the concept of instruction set partitioning. Hardwired instructions are used for critical display requirements while general purpose flexibility is provided by externally microprogrammable asynchronous processors. Design cycle time for this 32 bit processor is under 100 nanoseconds for instruction fetch and execute. Processor hardware costs are under $25,000. The device is designed to generate a full color TV image of 512 by 512 resolution in 0.1 to 0.8 seconds for 3D images of up to 1000 polygon complexity with all hidden parts removed by software for hidden surface calculations.\u0000 Due to its inherent generality the CPU may be expanded to encompass a wide variety of other specialized or real-time tasks with minor additional hardware.","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":"121801680","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 presentation will review potential areas of application for the new communications media of computer based conferencing and will explore the reasons why this form of communication is attractive for particular applications. In addition, the underlying economic and regulatory conditions needed to lead to wide spread utilization will be reviewed.
{"title":"Future applications of computerized conferencing","authors":"M. Turoff","doi":"10.1145/1408800.1408910","DOIUrl":"https://doi.org/10.1145/1408800.1408910","url":null,"abstract":"This presentation will review potential areas of application for the new communications media of computer based conferencing and will explore the reasons why this form of communication is attractive for particular applications. In addition, the underlying economic and regulatory conditions needed to lead to wide spread utilization will be reviewed.","PeriodicalId":204185,"journal":{"name":"ACM '74","volume":"42 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":"114756664","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
扫码关注我们
求助内容：
应助结果提醒方式：