{"title":"Removing node and edge overlapping in graph layouts by a modified EGENET solver","authors":"V. Tam","doi":"10.1109/TAI.1999.809789","DOIUrl":"https://doi.org/10.1109/TAI.1999.809789","url":null,"abstract":"Graph layout problems, such as node and edge overlapping, occur widely in many industrial computer-aided design applications. Usually, these problems are handled in an ad-hoc manner by some specially designed algorithms. GENET and its extended model EGENET are local search models that are used to efficiently solve constraint satisfaction problems such as the car-sequencing problems. Both models use min-conflict heuristic-based artificial neural nets to update every finite-domain variable for finding local minima, and then apply heuristic learning rule(s) to escape those local minima not representing solutions. In the past, few researchers have ever considered to apply any local search method like the EGENET approach to solve graph layout problems. In this paper, we consider how to modify the original EGENET model for solving the graph layout problems formulated as continuous constrained optimization problems. An empirical evaluation of different approaches on the graph layout problems demonstrated some advantages of our modified EGENET approach, which requires further investigation. More importantly, this interesting proposal opens up numerous opportunities for exploring the other possible ways to modify the original EGENET model, or using the other local search methods to solve these graph layout problems.","PeriodicalId":194023,"journal":{"name":"Proceedings 11th International Conference on Tools with Artificial Intelligence","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124293752","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}
{"title":"Using knowledge-based system with hierarchical architecture to guide the search of evolutionary computation","authors":"Xidong Jin, R. Reynolds","doi":"10.1109/TAI.1999.809762","DOIUrl":"https://doi.org/10.1109/TAI.1999.809762","url":null,"abstract":"Regional knowledge is determined by function's fitness landscape patterns, such as basins, valleys and multi-modality. Furthermore, for constrained optimization problems, the knowledge of feasible/infeasible regions can also be regards as regional knowledge. Therefore, it would be very helpful if there were a general tool to allow for the representation of regional knowledge, which can be acquired from evolutionary search and then be in reverse applied to guide the search. We define region-based schemata, implemented as belief-cells, which can provide an explicit mechanism to support the acquisition, storage and manipulation of the regional knowledge of a function landscape. In a cultural algorithm framework, the belief space can \"contain\" a set of these schemata, which can be arranged in a hierarchical architecture, and can be used to guide the search of the evolving population, i.e. region-based schemata can be used to guide the optimization search in a direct way by pruning the infeasible regions and promoting the promising regions. The experiments for an engineering problem with nonlinear constraints indicate the potential behind this approach.","PeriodicalId":194023,"journal":{"name":"Proceedings 11th International Conference on Tools with Artificial Intelligence","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121794131","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}
{"title":"VERITAS-an application for knowledge verification","authors":"Jorge Santos, C. Ramos, Z. Vale, A. Marques","doi":"10.1109/TAI.1999.809839","DOIUrl":"https://doi.org/10.1109/TAI.1999.809839","url":null,"abstract":"Knowledge management is one of the most important goals of any organization. Therefore, several automatic tools are used for that purpose, e.g. Knowledge Based Systems (KBS), Experts Systems, Data Mining Applications and Computer Aided Decision Systems. The validation and verification (V&V) process is fundamental in order to ensure the quality of used knowledge. The usage of automatic verification tools can be a reliable, inexpensive and reusable way to overcome the constant growth of the Knowledge Bases, the shortening of development times and the costs of Validation, specially field tests. This paper addresses the verification of Knowledge Based Systems, focussing on VERITAS, a verification tool initially developed to verify a KBS used to assist operators of Portuguese Transmission Control Centers in incident analysis and power restoration VERITAS performs knowledge base structural analysis allowing the detection of knowledge anomalies.","PeriodicalId":194023,"journal":{"name":"Proceedings 11th International Conference on Tools with Artificial Intelligence","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132420120","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}
{"title":"Capturing user access patterns in the Web for data mining","authors":"I-Yuan Lin, Xin-Mao Huang, Ming-Syan Chen","doi":"10.1109/TAI.1999.809818","DOIUrl":"https://doi.org/10.1109/TAI.1999.809818","url":null,"abstract":"Existing methods for knowledge discovery in the Web are mostly server-oriented and approaches taken are affected by the use of proxy servers. As a result, it is difficult to capture individual Web user behavior from the current log mechanism. As an effort to remedy this problem, we develop methods for design and implementation of an access pattern collection server to conduct data mining in the Web. We also devise an innovative method, called page conversion, which converts the original Web pages to enciphered ones so that the devised data collection mechanism will not be deliberately bypassed. With the concept of page conversion, the methods we proposed involves a mechanism of software downloading to resolve the difficulty imposed by proxy servers and to effectively capture the Web user behavior. Using the devised mechanism, traversal patterns are generated and compared to those produced by the ordinary Web servers to validate our results. It is shown that the traversal patterns resulting from the devised system are not only more informative but also more accurate than those generated by ordinary Web servers, showing the importance and the usefulness of the mechanism devised.","PeriodicalId":194023,"journal":{"name":"Proceedings 11th International Conference on Tools with Artificial Intelligence","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132706529","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}
{"title":"Constrained simulated annealing with applications in nonlinear continuous constrained global optimization","authors":"B. Wah, Tao Wang","doi":"10.1109/TAI.1999.809827","DOIUrl":"https://doi.org/10.1109/TAI.1999.809827","url":null,"abstract":"This paper improves constrained simulated annealing (CSA), a discrete global minimization algorithm with asymptotic convergence to discrete constrained global minima with probability one. The algorithm is based on the necessary and sufficient conditions for discrete constrained local minima in the theory of discrete Lagrange multipliers. We extend CSA to solve nonlinear continuous constrained optimization problems whose variables take continuous values. We evaluate many heuristics, such as dynamic neighborhoods, gradual resolution of nonlinear equality constraints and reannealing, in order to greatly improve the efficiency of solving continuous problems. We report much better solutions than the best-known solutions in the literature on two sets of continuous optimization benchmarks.","PeriodicalId":194023,"journal":{"name":"Proceedings 11th International Conference on Tools with Artificial Intelligence","volume":"237 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132710994","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}
{"title":"Managing inference process in student modelling for intelligent tutoring systems","authors":"R. Nkambou","doi":"10.1109/TAI.1999.809760","DOIUrl":"https://doi.org/10.1109/TAI.1999.809760","url":null,"abstract":"We present an approach to managing the side effect of information updates in the student model (SM). The approach is based on fuzzy logic and fuzzy reasoning on the knowledge structure in the SM. The SM includes three parts: a cognitive model, a behavioural model and an inference engine. The cognitive model is an overlay on curriculum knowledge structures, the behaviour model contains affective and conative values of the student and the inference engine aims to manage updates occurring in the SM during the learning process. As updates imply the evolution of the knowledge structure of the student the propagation module evaluates the possible impacts of the updated information on other related information. This is done by activating a fuzzy reasoning on knowledge networks in the curriculum and deducing new information in the SM. The control module handles conflict situations by considering factors such as the information source and the confidence degree.","PeriodicalId":194023,"journal":{"name":"Proceedings 11th International Conference on Tools with Artificial Intelligence","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115338011","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}
{"title":"A family of Delphi components for case-based reasoning","authors":"H. Bergstrom","doi":"10.1109/TAI.1999.809780","DOIUrl":"https://doi.org/10.1109/TAI.1999.809780","url":null,"abstract":"Nearest neighbour (NN) algorithms are one of the more popular approaches to implementing case-based reasoning systems. A family of Delphi components are presented that implements an NN approach based on the weighted Euclidean distance (WED). To make the approach more general, the distance measure of WED is implemented by so called comparators which are specialised components for comparing attribute values.","PeriodicalId":194023,"journal":{"name":"Proceedings 11th International Conference on Tools with Artificial Intelligence","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115409184","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}
{"title":"An in-service agent monitoring and analysis system","authors":"Z. Cui, B. Odgers, Michael Schroeder","doi":"10.1109/TAI.1999.809792","DOIUrl":"https://doi.org/10.1109/TAI.1999.809792","url":null,"abstract":"Multi Agent Systems (MAS) have been experimented in building a variety of applications. Several agent-building tools are available to assist with the tasks of building agent-based systems. However the issues on how to visualize and monitor the behaviors, and to analyze the performance of in-service agents have largely not been addressed. This paper describes the system we have developed for visualizing, monitoring and analyzing MAS activities both on-line and off-line. Our system uses an agent-based infrastructure in dealing with various service requirements from agent-based application systems concerning visualization monitoring and analysis. There are three types of agents: 1) an information management agent for collecting and storing data from MAS, and for making service agreements with MAS, 2) a visualization agent for constructing and presenting various views and 3) analysis agent for analyzing MAS activities and for making recommendations with a view to optimize the in-service agent performance.","PeriodicalId":194023,"journal":{"name":"Proceedings 11th International Conference on Tools with Artificial Intelligence","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122031198","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}
{"title":"Dynamic email organization via relevance categories","authors":"Kenrick J. Mock","doi":"10.1109/TAI.1999.809830","DOIUrl":"https://doi.org/10.1109/TAI.1999.809830","url":null,"abstract":"Many researchers have proposed classification systems that automatically classify email in order to reduce information overload. However, none of these systems are in use today. This paper examines some of the problems with classification technologies and proposes Relevance Categories as a method to avoid some of these problems. In particular, the dynamic nature of email categories, the cognitive overhead, required training categories, and the high costs of classification errors are hurdles for many classification algorithms. Relevance Categories avoid some of these problems through their simplicity; they are merely relevance-ranked lists of email messages that are similar to a set of query messages. by displaying messages as the result of a dynamic query in lieu of fixed categories, we hypothesize that users will be less sensitive to errors using the Relevance Categories scheme than to errors using a fixed categorization scheme. To study the effectiveness of the Relevance Categories concept, we devised a performance metric for relevance ranking and used it to test an inverted index implementation on the Reuter-21578 test collection. The promising test results indicate the need for further work.","PeriodicalId":194023,"journal":{"name":"Proceedings 11th International Conference on Tools with Artificial Intelligence","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129610243","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}
{"title":"Mining typhoon knowledge with neural networks","authors":"Zhi-Hua Zhou, Shifu Chen, Zhaoqian Chen","doi":"10.1109/TAI.1999.809809","DOIUrl":"https://doi.org/10.1109/TAI.1999.809809","url":null,"abstract":"Neural network technology has not been fully utilised in data mining. There are two reasons for this. Firstly, most neural algorithms need long-term training, and cannot perform incremental learning. Secondly, the knowledge learned by neural networks is concealed within a large quantity of connections. We have develop a neural network method to mine typhoon knowledge which overcomes those two obstacles. Experimental results show that our method shows considerable promise.","PeriodicalId":194023,"journal":{"name":"Proceedings 11th International Conference on Tools with Artificial Intelligence","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129611158","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}