{"title":"All from one, one for all, failure diagnosis of discrete event system using representatives","authors":"Y. Pencolé","doi":"10.1109/TAI.2003.1250192","DOIUrl":"https://doi.org/10.1109/TAI.2003.1250192","url":null,"abstract":"Failure diagnosis in large and complex systems is a critical and challenging task. In the realm of model based diagnosis on discrete event systems, computing a failure diagnosis means computing the set of system behaviours that could explain observations. Depending on the diagnosed system, such behaviours can be numerous, so that a problem of representing them is induced. The paper discusses about this problem and presents a way of representing a diagnosis by the use of a partial order reduction technique.","PeriodicalId":160023,"journal":{"name":"Proceedings. 15th IEEE International Conference on Tools with Artificial Intelligence","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127546607","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 comparative study of techniques for intrusion detection","authors":"Srinivas Mukkamala, A. Sung","doi":"10.1109/TAI.2003.1250243","DOIUrl":"https://doi.org/10.1109/TAI.2003.1250243","url":null,"abstract":"Due to increasing incidents of cyber attacks and heightened concerns for cyber terrorism, implementing effective intrusion detection systems (IDSs) is an essential task for protecting cyber security--as well as physical security because of the great dependence on networked computers for the operational control of various infrastructures. Building effective IDSs, unfortunately, has remained an elusive goal owing to the great technical challenges involved; and applied AI techniques are increasingly being utilized in attempts to overcome the difficulties. This paper presents a comparative study of using support vector machines (SVMs), artificial neural networks (ANNs), multivariate adaptive regression splines (MARS) and linear genetic programs (LGPs) for intrusion detection. We investigate and compare the performance of IDSs based on the mentioned techniques, with respect to a well-known set of intrusion evaluation data gathered by Lincoln Labs. Through a variety of experiments and analysis, it is found that, with appropriately chosen population size, program size, crossover rate and mutation rate, LGPs outperform other techniques in terms of detection accuracy at the expense of time. SVMs outperform MARS and ANNs in three critical aspects of intrusion detection: accuracy, training time, and testing time.","PeriodicalId":160023,"journal":{"name":"Proceedings. 15th IEEE International Conference on Tools with Artificial Intelligence","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115271874","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":"Answer filtering via text categorization in question answering systems","authors":"Alessandro Moschitti","doi":"10.1109/TAI.2003.1250197","DOIUrl":"https://doi.org/10.1109/TAI.2003.1250197","url":null,"abstract":"Modern Information Technologies and Web-based services are faced with the problem of selecting, filtering and managing growing amounts of textual information to which access is usually critical. On one hand, text categorization models allow users to browse more easily the set of texts of their own interests, by navigating in category hierarchies. On the other hand, question/answering is a method of retrieving information from vast document collections. In spite of their shared goal, these two information retrieval techniques have been ever applied separately. In this paper we present a question/answering system that takes advantage from category information by exploiting several models of question and answer categorization. Knowing the question category has the potential of enhancing a more efficient answer extraction mechanism as the matching of the question category with the answer category allows to: (1) re-rank the answers; and (2) eliminate incorrect answers. Experimental results show the effects of question and answer categorization on the overall question answering performance.","PeriodicalId":160023,"journal":{"name":"Proceedings. 15th IEEE International Conference on Tools with Artificial Intelligence","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125410426","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":"On case-based knowledge sharing in semantic Web","authors":"Huajun Chen, Zhaohui Wu","doi":"10.1109/TAI.2003.1250191","DOIUrl":"https://doi.org/10.1109/TAI.2003.1250191","url":null,"abstract":"Human experience is a special kind of knowledge, which captures previously experienced, similar problem situations (case) for human problem solving. This paper describes a case-based approach for knowledge sharing and management with regard to the semantic web settings. We define a RDF-based Case Markup Language (CaseML) for experience knowledge representation and develop a generic architecture for the case based reasoning in the open, distributed environment with the emphasis on the integration of case knowledge with web ontologies. An application scenario from traditional Chinese medicine field is introduced to evaluate our methodology. With our application experience, we claim that, in contrast with logic-based knowledge representation formalisms, case is a more suitable for knowledge sharing in the semantic Web, because case based reasoning is similarity-based and there is weak demand on semantic consistent in such reasoning processes.","PeriodicalId":160023,"journal":{"name":"Proceedings. 15th IEEE International Conference on Tools with Artificial Intelligence","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114491261","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":"Domain ontology and Galois lattice structure for query refinement","authors":"B. Safar, H. Kefi","doi":"10.1109/TAI.2003.1250246","DOIUrl":"https://doi.org/10.1109/TAI.2003.1250246","url":null,"abstract":"We present a system for interactively querying a topical resources repository and for navigating the set of responses obtained from the repository. Our system makes use of a domain ontology for dynamically constructing a Gallois lattice. Nodes in this structure are resources clusters which are interactively examined by the user during the construction process.","PeriodicalId":160023,"journal":{"name":"Proceedings. 15th IEEE International Conference on Tools with Artificial Intelligence","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129579352","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":"Nonlinear speech model based on support vector machine and wavelet transform","authors":"Jianmin Li, Bo Zhang, Fuzong Lin","doi":"10.1109/TAI.2003.1250199","DOIUrl":"https://doi.org/10.1109/TAI.2003.1250199","url":null,"abstract":"To improve the naturalness of reconstructed speech, nonlinear speech models are paid more and more attention in recent years. A nonlinear speech model for speech synthesis based on support vector machine (SVM) is presented firstly. After speech signal is embedded into phase space, nonlinear map in the model is obtained with support vector regression. It is shown in the experiments that for some pieces of speech, not only can speech be perfectly reconstructed by the system, but also jitter and shimmer in the original signal is preserved. However, the output of the system is quite different from the original one for other pieces. The reason is that the sub-bands with different frequency in the original signal can not be perfectly described by a SVM-based autoregressive model trained with one set of training parameters. Consequently, a multi-band model is then proposed. After the original speech is decomposed into several bands through wavelet packet decomposition, a nonlinear dynamical model based on SVM is constructed for each sub-band signal. It is shown in the experiments that the stability of such system is improved.","PeriodicalId":160023,"journal":{"name":"Proceedings. 15th IEEE International Conference on Tools with Artificial Intelligence","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128374119","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}
Dianxiang Xu, R. Volz, Michael S. P. Miller, Jesse Plymale
{"title":"Human-agent teamwork for distributed team training","authors":"Dianxiang Xu, R. Volz, Michael S. P. Miller, Jesse Plymale","doi":"10.1109/TAI.2003.1250247","DOIUrl":"https://doi.org/10.1109/TAI.2003.1250247","url":null,"abstract":"This paper presents an approach to human-agent mixed teams for distributed team training, demonstrated through the integration of the domain independent multiagent architecture CAST with the military command-and-control simulation software DDD (distributed dynamic decision-making). We extend the CAST architecture in a way such that agents can replace any number of teammates on a DDD team. To capture the overall picture of teamwork, we explore the MALLET language in CAST for the specification of team structures and processes that involve both humans and agents.","PeriodicalId":160023,"journal":{"name":"Proceedings. 15th IEEE International Conference on Tools with Artificial Intelligence","volume":" 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120827045","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}
T. Khoshgoftaar, Laurent A. Nguyen, Kehan Gao, Jayanth Rajeevalochanam
{"title":"Application of an attribute selection method to CBR-based software quality classification","authors":"T. Khoshgoftaar, Laurent A. Nguyen, Kehan Gao, Jayanth Rajeevalochanam","doi":"10.1109/TAI.2003.1250169","DOIUrl":"https://doi.org/10.1109/TAI.2003.1250169","url":null,"abstract":"This study investigates the attribute selection problem for reducing the number of software metrics (program attributes) used by a case-based reasoning (CBR) software quality classification model. The metrics are selected using the Kolmogorov-Smirnov (K-S) two sample test. The \"modified expected cost of misclassification\" measure, recently proposed by our research team, is used as a performance measure to select, evaluate, and compare classification models. The attribute selection procedure presented in this paper can assist a software development organization in determining the software metrics that are better indicators of software quality. By reducing the number of software metrics to be collected during the development process, the metrics data collection task can be simplified. Moreover, reducing the number of metrics would result in reducing the computation time of a CBR model. Using an empirical case study of a real-world software system, it is shown that with a reduced number of metrics the CBR technique is capable of yielding useful software quality classification models. Moreover, their performances were better than or similar to CBR models calibrated without attribute selection.","PeriodicalId":160023,"journal":{"name":"Proceedings. 15th IEEE International Conference on Tools with Artificial Intelligence","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116258148","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":"Automatic lesion/tumor detection using intelligent mesh-based active contour","authors":"L. Yin, Sandeep Deshpande, J. Chang","doi":"10.1109/TAI.2003.1250216","DOIUrl":"https://doi.org/10.1109/TAI.2003.1250216","url":null,"abstract":"Automatic detection of the lesion/tumor region is always of interest in medical imaging system. We address this issue in this paper for improving the accuracy and robustness as compared to the conventional methods. Active contour has been commonly used for the detection of irregular shape of region, however, it suffers the problem of the false attraction given the noisy image, and requires the correct estimation of the initial location of the object to be detected. In this paper, we present a novel method for robustly locating the object area by using a so-called intelligent mesh. With the accurate location and shape approximation in the initial stage, the object of interest is correctly detected by using a mesh-based active contour model. The correctness and robustness of the proposed algorithm are demonstrated on extracting the lesion/tumor regions of CT and Mammography images as an intensive test.","PeriodicalId":160023,"journal":{"name":"Proceedings. 15th IEEE International Conference on Tools with Artificial Intelligence","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115887618","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":"MFSAT: a SAT solver using multi-flip local search","authors":"A. Mali, Yevgeny Lipen","doi":"10.1109/TAI.2003.1250174","DOIUrl":"https://doi.org/10.1109/TAI.2003.1250174","url":null,"abstract":"Local search-based methods of SAT solving have received a significant attention in the last decade. All local search-based methods choose the next truth assignment by flipping the value of only one variable. Simultaneously flipping values of multiple variables on an iteration can allow a local search-based solver to take long leaps in the search space. We report on SAT solver MFSAT, which has nine local search-based procedures. One of them is similar to conventional procedures which flip the value of one variable on an iteration. Other eight procedures are capable of simultaneously flipping values of multiple variables on an iteration to generate the successor truth assignment. We call these procedures \"multi-flip\" procedures. We report on the empirical evaluation of the nine procedures on more than 2700 benchmark SAT problems. Our results show that multi-flip procedures solve many more problems than the uni-flip procedure. Several multi-flip procedures solve problems many times faster than the uni-flip procedure.","PeriodicalId":160023,"journal":{"name":"Proceedings. 15th IEEE International Conference on Tools with Artificial Intelligence","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132299298","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}