The radial basis bidirectional competitive and cooperative network (RCCN) is a bidirectional mapping network that accommodates and generates radial basis function units (RBFUs) with the help of efficient use of the accommodation boundaries. The analysis and simulation show that the automatic generation scheme provides the necessary and sufficient enhancement of the network, the hierarchical learning scheme ensures the desired accuracy in mapping, the mapping scheme processes the many-to-many relation for both directions with sufficient accuracy, and using ellipsoidal boundaries is more efficient and flexible compared to circles. RCCN may create an enormous number of RBFUs and degenerate in accuracy by learning with noisy samples. However, greater efficiency can be expected if RBFUs are allowed to have individual accommodation boundary sizes under the optimal learning scheme.<>
{"title":"RCCN: radial basis competitive and cooperative network","authors":"Sukhan Lee, S. Shimoji","doi":"10.1109/TAI.1992.246370","DOIUrl":"https://doi.org/10.1109/TAI.1992.246370","url":null,"abstract":"The radial basis bidirectional competitive and cooperative network (RCCN) is a bidirectional mapping network that accommodates and generates radial basis function units (RBFUs) with the help of efficient use of the accommodation boundaries. The analysis and simulation show that the automatic generation scheme provides the necessary and sufficient enhancement of the network, the hierarchical learning scheme ensures the desired accuracy in mapping, the mapping scheme processes the many-to-many relation for both directions with sufficient accuracy, and using ellipsoidal boundaries is more efficient and flexible compared to circles. RCCN may create an enormous number of RBFUs and degenerate in accuracy by learning with noisy samples. However, greater efficiency can be expected if RBFUs are allowed to have individual accommodation boundary sizes under the optimal learning scheme.<<ETX>>","PeriodicalId":265283,"journal":{"name":"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125963315","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}
RUTA-100 is an AI-based route planner that uses the Dempster-Shafer theory of belief to combine partial and inexact information, received from a number of unreliable sources, to find an optimal route, by means of the A* algorithm, in a changing environment. The current version of RUTA-100 plans optimized routes for various kinds of helicopters. The Dempster-Shafer theory of belief, which is an extension of probability theory, provides the mechanism for combining partial information transmitted by the knowledge sources (sensors, observers, etc.). With an extension of the Dempster-Shafer theory, one can infer inexact information on one variable (e.g. danger level or weather) based on partial information on some other (closely related) variable. RUTA-100 is implemented on a Symbolics 3620 workstation running Lisp.<>
{"title":"RUTA-100: a dynamic route planner","authors":"F. Golshani, E. Cortes-Rello, S. Ahluwalia","doi":"10.1109/TAI.1992.246440","DOIUrl":"https://doi.org/10.1109/TAI.1992.246440","url":null,"abstract":"RUTA-100 is an AI-based route planner that uses the Dempster-Shafer theory of belief to combine partial and inexact information, received from a number of unreliable sources, to find an optimal route, by means of the A* algorithm, in a changing environment. The current version of RUTA-100 plans optimized routes for various kinds of helicopters. The Dempster-Shafer theory of belief, which is an extension of probability theory, provides the mechanism for combining partial information transmitted by the knowledge sources (sensors, observers, etc.). With an extension of the Dempster-Shafer theory, one can infer inexact information on one variable (e.g. danger level or weather) based on partial information on some other (closely related) variable. RUTA-100 is implemented on a Symbolics 3620 workstation running Lisp.<<ETX>>","PeriodicalId":265283,"journal":{"name":"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129365311","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 framework for applying cognitive abstraction in the domain of qualitative physics to suppress irrelevant distinctions between the possible behaviors is presented. Cognitive abstraction is especially useful for inferring the behavior of a physical system based on incremental qualitative simulation. The framework of a prototype of cognitive abstraction, based on QSIM, is presented. The limitations of the approach are discussed.<>
{"title":"Cognitive abstraction for qualitative simulation","authors":"Judy Chen, Sukhan Lee","doi":"10.1109/TAI.1992.246442","DOIUrl":"https://doi.org/10.1109/TAI.1992.246442","url":null,"abstract":"A framework for applying cognitive abstraction in the domain of qualitative physics to suppress irrelevant distinctions between the possible behaviors is presented. Cognitive abstraction is especially useful for inferring the behavior of a physical system based on incremental qualitative simulation. The framework of a prototype of cognitive abstraction, based on QSIM, is presented. The limitations of the approach are discussed.<<ETX>>","PeriodicalId":265283,"journal":{"name":"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129198388","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 for belief maintenance for a natural language system is proposed. Based on uncertainty values and the interlinkage of directly asserted and derived propositions, the method provides a means for the postponement of a decision regarding the reason for a contradiction, and includes algorithms that perform nonmonotonic reasoning on a commonsense knowledge base in a manner consistent with humanlike, informal reasoning.<>
{"title":"Belief maintenance in a natural language system","authors":"P. Buchheit","doi":"10.1109/TAI.1992.246418","DOIUrl":"https://doi.org/10.1109/TAI.1992.246418","url":null,"abstract":"A method for belief maintenance for a natural language system is proposed. Based on uncertainty values and the interlinkage of directly asserted and derived propositions, the method provides a means for the postponement of a decision regarding the reason for a contradiction, and includes algorithms that perform nonmonotonic reasoning on a commonsense knowledge base in a manner consistent with humanlike, informal reasoning.<<ETX>>","PeriodicalId":265283,"journal":{"name":"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125228487","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 novel search algorithm called band search that generalizes guided depth-first and best-first searches is proposed. The performance of band search is studied, and it is evaluated using six benchmarks. The band-search algorithm and its properties are presented, the conditions when band search behaves like best first search are identified, and possible anomalous behavior when the bandwidth of the search is increased is discussed. The classes of search problems for which band search is applicable are given, and the performance of band search on these problems is evaluated.<>
{"title":"Band search: an efficient alternative to guided depth-first search","authors":"Lon-Chan Chu, B. Wah","doi":"10.1109/TAI.1992.246360","DOIUrl":"https://doi.org/10.1109/TAI.1992.246360","url":null,"abstract":"A novel search algorithm called band search that generalizes guided depth-first and best-first searches is proposed. The performance of band search is studied, and it is evaluated using six benchmarks. The band-search algorithm and its properties are presented, the conditions when band search behaves like best first search are identified, and possible anomalous behavior when the bandwidth of the search is increased is discussed. The classes of search problems for which band search is applicable are given, and the performance of band search on these problems is evaluated.<<ETX>>","PeriodicalId":265283,"journal":{"name":"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134005481","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 cases and rules is addressed. A case representation language tool used to directly represent instantiated cases is presented. PRIMO (plausible reasoning module), a rule-based system used to represent uncertainty and vagueness in data and rules, is described. Cases and rules, integrated in a combined approximate reasoning system (CARS), are illustrated with examples taken from the domain of mergers and acquisitions.<>
{"title":"Representing cases and rules in plausible reasoning systems","authors":"P. Bonissone, S. Ayub","doi":"10.1109/TAI.1992.246436","DOIUrl":"https://doi.org/10.1109/TAI.1992.246436","url":null,"abstract":"The representation of cases and rules is addressed. A case representation language tool used to directly represent instantiated cases is presented. PRIMO (plausible reasoning module), a rule-based system used to represent uncertainty and vagueness in data and rules, is described. Cases and rules, integrated in a combined approximate reasoning system (CARS), are illustrated with examples taken from the domain of mergers and acquisitions.<<ETX>>","PeriodicalId":265283,"journal":{"name":"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134267186","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 modification to the algorithmic mapping algorithm for neural network models proposed by W. Lin et al. (1991) is presented. The modified algorithm can accommodate a larger class of network models recently proposed. The new neural network model uses vectorial interconnections between neurons and multiactivation product units. The generalized delta rule for the Rumelhart-Hinton-Williams neural networks can still be used with appropriate enhancement. The implementation of the model is targeted for fine-grain mesh-connected SIMD machines. The basic routing procedures are similar to those in the algorithmic mapping algorithm but with more flexibility in specifying the size of the data to be shifted between processors.<>
{"title":"Algorithmic mapping of neural networks with multi-activation product units onto SIMD machines","authors":"Yiwei Chen, F. Bastani","doi":"10.1109/TAI.1992.246368","DOIUrl":"https://doi.org/10.1109/TAI.1992.246368","url":null,"abstract":"A modification to the algorithmic mapping algorithm for neural network models proposed by W. Lin et al. (1991) is presented. The modified algorithm can accommodate a larger class of network models recently proposed. The new neural network model uses vectorial interconnections between neurons and multiactivation product units. The generalized delta rule for the Rumelhart-Hinton-Williams neural networks can still be used with appropriate enhancement. The implementation of the model is targeted for fine-grain mesh-connected SIMD machines. The basic routing procedures are similar to those in the algorithmic mapping algorithm but with more flexibility in specifying the size of the data to be shifted between processors.<<ETX>>","PeriodicalId":265283,"journal":{"name":"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114301266","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 tool to aid the designer of cooperative distributed problem solving (CDPS) systems will determine whether a proposed CDPS system violates any of the constraints for CDPS systems, and will display a prediction of the performance that can be expected from that CDPS system. This tool will rely on a predictive model for the performance of the expert systems in the CDPS system. Using the Blackbox Expert (a DAI testbed), an experiment was conducted to test the performance of expert systems in a CDPS system. Statistically significant differences in the Blackbox Expert's performance were found when the CDPS system was changed. The results of the experiment are being using to create a predictive model for the performance of the Blackbox Expert when it is a member of the CDPS system.<>
协同分布式问题解决(cooperative distributed problem solving, CDPS)系统的设计人员可以使用一个工具来确定所提出的CDPS系统是否违反了CDPS系统的任何约束条件，并对该CDPS系统的预期性能进行预测。该工具将依赖于CDPS系统中专家系统性能的预测模型。利用黑盒专家(DAI测试平台)，对专家系统在CDPS系统中的性能进行了测试。当CDPS系统被改变时，Blackbox Expert的性能有统计学上的显著差异。实验结果被用来创建一个预测模型，预测黑箱专家作为CDPS系统成员时的性能。
{"title":"Towards a tool for the design of cooperating expert systems","authors":"C. Grossner, J. Lyons, T. Radhakrishnan","doi":"10.1109/TAI.1992.246446","DOIUrl":"https://doi.org/10.1109/TAI.1992.246446","url":null,"abstract":"A tool to aid the designer of cooperative distributed problem solving (CDPS) systems will determine whether a proposed CDPS system violates any of the constraints for CDPS systems, and will display a prediction of the performance that can be expected from that CDPS system. This tool will rely on a predictive model for the performance of the expert systems in the CDPS system. Using the Blackbox Expert (a DAI testbed), an experiment was conducted to test the performance of expert systems in a CDPS system. Statistically significant differences in the Blackbox Expert's performance were found when the CDPS system was changed. The results of the experiment are being using to create a predictive model for the performance of the Blackbox Expert when it is a member of the CDPS system.<<ETX>>","PeriodicalId":265283,"journal":{"name":"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115895647","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}
M. Perlin, J. Carbonell, Daniel P. Miranker, S. Stolfo, Milind Tambe
A panel session in which issues relating to the effects of advances in faster and more parallel hardware, production system match (PSM) algorithms, and application domains for match on PSM as a research area is presented. It is argued that there is no such thing as the optimal matching algorithm, even for the well-defined task of production-system match and that broadening the scope of the matching task beyond forward-chaining production system presents a new set of problems to the artificial intelligence community. Also, even with all the speedups, large production system runs take hours to complete, and a major portion of this time is attributable to PSM. Match technology remains a large and centralized component of system performance. To that extent, providing sufficient speedups in the match in these systems may still be useful. Performance issues of production system execution are discussed, and a common set of benchmarks and test cases is called for. It is argued that parallel algorithms for match, resolve, and fire are all interesting and difficult problems to solve, and should be the focus of research by the PSM community.<>
{"title":"Is production system matching interesting?","authors":"M. Perlin, J. Carbonell, Daniel P. Miranker, S. Stolfo, Milind Tambe","doi":"10.1109/TAI.1992.246380","DOIUrl":"https://doi.org/10.1109/TAI.1992.246380","url":null,"abstract":"A panel session in which issues relating to the effects of advances in faster and more parallel hardware, production system match (PSM) algorithms, and application domains for match on PSM as a research area is presented. It is argued that there is no such thing as the optimal matching algorithm, even for the well-defined task of production-system match and that broadening the scope of the matching task beyond forward-chaining production system presents a new set of problems to the artificial intelligence community. Also, even with all the speedups, large production system runs take hours to complete, and a major portion of this time is attributable to PSM. Match technology remains a large and centralized component of system performance. To that extent, providing sufficient speedups in the match in these systems may still be useful. Performance issues of production system execution are discussed, and a common set of benchmarks and test cases is called for. It is argued that parallel algorithms for match, resolve, and fire are all interesting and difficult problems to solve, and should be the focus of research by the PSM community.<<ETX>>","PeriodicalId":265283,"journal":{"name":"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124043384","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 formulation of a heuristic-based car-shop scheduling application is described. The problem involves scheduling repair jobs on cars, given restrictions on operator availability and other resource/time constraints. The problem is solved by taking an intelligent generate-and-test approach and extending the simple notion of scheduling-the allocation of resources to tasks over time within constraints defining the system. Dispatch of tasks for scheduling and allocation of resources to them are guided by a set of heuristics. The system is built on a user-extensible knowledge base of rules and heuristics written in Prolog. The emphasis in the system is on providing a flexible AI problem representation and also collecting some empirical results on the performance of different heuristics in the system.<>
{"title":"A heuristic-based car shop scheduling application","authors":"Venkatesh Srinivasan, W. Fabens","doi":"10.1109/TAI.1992.246363","DOIUrl":"https://doi.org/10.1109/TAI.1992.246363","url":null,"abstract":"The formulation of a heuristic-based car-shop scheduling application is described. The problem involves scheduling repair jobs on cars, given restrictions on operator availability and other resource/time constraints. The problem is solved by taking an intelligent generate-and-test approach and extending the simple notion of scheduling-the allocation of resources to tasks over time within constraints defining the system. Dispatch of tasks for scheduling and allocation of resources to them are guided by a set of heuristics. The system is built on a user-extensible knowledge base of rules and heuristics written in Prolog. The emphasis in the system is on providing a flexible AI problem representation and also collecting some empirical results on the performance of different heuristics in the system.<<ETX>>","PeriodicalId":265283,"journal":{"name":"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1992-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133610936","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
扫码关注我们
求助内容：
应助结果提醒方式：