{"title":"Classification of Cardiac Arrhythmias Using Interval Type-2 TSK Fuzzy System","authors":"Phan Anh Phong, Kieu Quang Thien","doi":"10.1109/KSE.2009.19","DOIUrl":"https://doi.org/10.1109/KSE.2009.19","url":null,"abstract":"The paper proposes a method to construct type-2 Takagi–Sugeno-Kang (TSK) fuzzy system for electrocardiogram (ECG) arrhythmic classification. The classifier is applied to distinguish normal sinus rhythm (NSR), ventricular fibrillation (VF) and ventricular tachycardia (VT). Two features of ECG signals, the average period and the pulse width, are inputs to the fuzzy classifier. The rule base in the fuzzy system is constructed from training data. We also present the method using fuzzy C-mean clustering algorithm and the back-propagation technique to determine parameters of type-2 TSK fuzzy classifier. The generalized bell primary membership function is used to examine the performance of the classifier with different shapes of membership functions. The results of experiments with data from the MIT-BIH Malignant Ventricular Arrhythmia Database show the classification accuracy of 100% for NSR signals, 93.3% for VF signals, and 92% of VT signals.","PeriodicalId":347175,"journal":{"name":"2009 International Conference on Knowledge and Systems Engineering","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127170995","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}
Hyo-Jung Oh, C. Lee, Yi-Gyu Hwang, Jeong Hur, Myung-Gil Jang
{"title":"Extensible Framework for Distinct Question Answering Agents","authors":"Hyo-Jung Oh, C. Lee, Yi-Gyu Hwang, Jeong Hur, Myung-Gil Jang","doi":"10.1109/KSE.2009.9","DOIUrl":"https://doi.org/10.1109/KSE.2009.9","url":null,"abstract":"For question answering, the multi-source approach is justifiable especially when different sources provide different types of knowledge. In this paper, a variety of question and answer types are revealed. The key point this paper addresses under the framework of extensible QA is efficient and consonant usage of a number of distinct QA techniques for improving the answer confidence. To prove the extensibility of the proposed model, we started with four QA modules first and added two specialty modules to the system one by one. As a result, both effectiveness and efficiency are improved as we employ more specialized QA modules.","PeriodicalId":347175,"journal":{"name":"2009 International Conference on Knowledge and Systems Engineering","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122234155","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":"Analyzing RBAC Security Policy of Implementation Using AST","authors":"Tuan-Hung Pham, Ninh-Thuan Truong, Viet-Ha Nguyen","doi":"10.1109/KSE.2009.23","DOIUrl":"https://doi.org/10.1109/KSE.2009.23","url":null,"abstract":"Security policy is a critical property in software applications which require high levels of safety and security. It has to be clearly specified in requirement documents and its implementation must be conformed to the specification. In this paper, we propose an approach to check if the implementation is in accordance with its security policy specification. We use the Abstract Syntax Tree (AST), another manner of expressing the program, to analyze the source code and specify user permission policy in software systems by Role-Based Access Control (RBAC).","PeriodicalId":347175,"journal":{"name":"2009 International Conference on Knowledge and Systems Engineering","volume":"15 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125762933","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":"Ontology Learning Through Focused Crawling and Information Extraction","authors":"H. Luong, Susan Gauch, Qiang Wang","doi":"10.1109/KSE.2009.28","DOIUrl":"https://doi.org/10.1109/KSE.2009.28","url":null,"abstract":"Ontology learning aims to facilitate the construction of ontologies by decreasing the amount of effort required to produce an ontology for a new domain. However, there are few studies that attempt to automate the entire ontology learning process from the collection of domain-specific literature, to text mining to build new ontologies or enrich existing ones. In this paper, we present a complete framework for ontology learning that enables us to retrieve documents from the Web using focused crawling, and then use a SVM (Support Vector Machine) classifier to identify domain-specific documents and perform text mining in order to extract useful information for the ontology enrichment process. We have carried out several experiments on components of this framework in a biological domain, amphibian morphology. This paper reports on the overall system architecture and our initial experiments on information extraction using text mining techniques to enrich the domain ontology.","PeriodicalId":347175,"journal":{"name":"2009 International Conference on Knowledge and Systems Engineering","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127851478","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":"Checking the Compliance of Timing Constraints in Software Applications","authors":"Thanh-Binh Trinh, Tuan-Anh Do, Ninh-Thuan Truong, Viet-Ha Nguyen","doi":"10.1109/KSE.2009.38","DOIUrl":"https://doi.org/10.1109/KSE.2009.38","url":null,"abstract":"Timing constraints play an important role in software development, particularly in real time systems. This paper proposes an approach for checking the compliance of execution of tasks in an application with their timing constraints. In this approach, timing constraints are specified by UML Timing Diagrams. Aspect Oriented Programming technology is used to observe the execution of the program and to check if the execution of tasks satisfies their timing constraint specification.The approach is illustrated by a case study of an Automatic Teller Machine system.","PeriodicalId":347175,"journal":{"name":"2009 International Conference on Knowledge and Systems Engineering","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127880021","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}
Trong Hai Duong, Mohammed Nazim Uddin, Geun-Sik Jo
{"title":"Collaborative Web for Personal Ontology Generation and Visualization for a Social Network","authors":"Trong Hai Duong, Mohammed Nazim Uddin, Geun-Sik Jo","doi":"10.1109/KSE.2009.32","DOIUrl":"https://doi.org/10.1109/KSE.2009.32","url":null,"abstract":"There is a huge amount of indexed web resources are used by millions of users in every country the Earth. It is this huge amount of the content and the integration of information across space and time that leads to the Web containing itself a social network. In this paper, we proposed a frame- work for construction and visualization of a social network by collaborative web approach, in which a consensus method is proposed to identify personal information from different web search spaces (include personal/organizational sites, blogs, publications) of user. A personal ontology is automatically generated from the personal information. Construction of social network is carried out by analyzing relationship among people, contents and organizations found from the different search spaces of each target user.","PeriodicalId":347175,"journal":{"name":"2009 International Conference on Knowledge and Systems Engineering","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121227092","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 Parameterized Unit Test Framework Based on Symbolic Java PathFinder","authors":"Anh-Hoang Truong, T. Vu","doi":"10.1109/KSE.2009.47","DOIUrl":"https://doi.org/10.1109/KSE.2009.47","url":null,"abstract":"Parameterized unit test recently gains a lot of attention as it saves testing cost and is more efficient in term of code coverage. We present a framework for running parameterized unit tests (PUT) based on Java PathFinder (JPF) and JUnit. Our approach bases on model checking and symbolic execution of JPF for generating standard unit tests. As a result, we achieve high structural and path coverage. The generated unit tests are automatically executed by JUnit so programmers receive immediately assertion failures if any. Currently, our approach mainly works with numeric and boolean data type but it is possible to extend our framework for other data types such as string.","PeriodicalId":347175,"journal":{"name":"2009 International Conference on Knowledge and Systems Engineering","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128608639","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":"Hedge Algebra Based Type-2 Fuzzy Logic System and its Application to Predict Survival Time of Myeloma Patients","authors":"Phan Anh Phong, Dinh Khac Dong, T. D. Khang","doi":"10.1109/KSE.2009.22","DOIUrl":"https://doi.org/10.1109/KSE.2009.22","url":null,"abstract":"In this paper, we propose a method to construct hedge algebra based type-2 fuzzy logic systems (HA-T2FLS). In these fuzzy logic systems, the footprints of uncertainty (FOU) of type-2 fuzzy sets are optimized by genetic algorithm and the dispersion of data. The key ingredient of our system is the concept of centroid of hedge algebra based type-2 fuzzy sets. It is used in the type-reducing of the HA-T2FLS, and transforming interval type-2 fuzzy sets to hedge algebra based type-2 fuzzy sets. As an application, we show how hedge algebra based type-2 fuzzy logic systems can be used to predict survival time of myeloma patients. The results show that hedge algebra based type-2 fuzzy logic systems are more accurate than type-1 and interval type-2 fuzzy logic systems in this class of problems.","PeriodicalId":347175,"journal":{"name":"2009 International Conference on Knowledge and Systems Engineering","volume":"152 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117344380","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 Optimal Tableau Decision Procedure for Converse-PDL","authors":"Linh Anh Nguyen, A. Szałas","doi":"10.1109/KSE.2009.12","DOIUrl":"https://doi.org/10.1109/KSE.2009.12","url":null,"abstract":"We give a novel tableau calculus and an optimal (EXPTIME)tableau decision procedure based on the calculus for the satisfiability problem of propositional dynamic logic with converse. Our decision procedure is formulated with global caching and can be implemented together with useful optimization techniques.","PeriodicalId":347175,"journal":{"name":"2009 International Conference on Knowledge and Systems Engineering","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124970695","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}
Yoshitaka Nagasawa, Kazunori Mizuno, H. Sasaki, Yasushi Miki, S. Nishihara
{"title":"Constructive Generation of 3COL Instances by Embedding Minimal Unsolvable Structures","authors":"Yoshitaka Nagasawa, Kazunori Mizuno, H. Sasaki, Yasushi Miki, S. Nishihara","doi":"10.1109/KSE.2009.40","DOIUrl":"https://doi.org/10.1109/KSE.2009.40","url":null,"abstract":"Graph colorability, COL, is a typical constraint satisfaction problem to which phase transition phenomena,PTs, are important in the computational complexity of combinatorial search algorithms. PTs are significant and subtle because, in the PT region, extraordinarily hard problem instances are found, which may require exponential-order computational time to solve. To clarify PT mechanism, many studies have been undertaken to produce very hard instances, many of which were based on generate-and-test approaches. We propose a rather systematic or constructive algorithm that repeats the embedding of 4-critical graphs to arbitrarily generate large extraordinarily hard 3-colorability instances. We demonstrated experimentally that the computational cost to solve our generated instances is of an exponential order of the number of vertices by using a few actual coloring algorithms.","PeriodicalId":347175,"journal":{"name":"2009 International Conference on Knowledge and Systems Engineering","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124132788","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}