Although many studies have targeted homogeneous and heterogeneous traffic flow, they are normally little or no attention to driver reaction passing intersection. Understanding complex movement within an intersection is the critical task which can explain the reason of traffic jam especially in big cities (for example, Ho Chi Minh City, Hanoi). This paper describes a microscopic model based on Cellular Automata (CA) for mixed traffic flow and is concerned with how the driver interacting with other vehicles in the intersection. A simulation environment is also built with a set of basic rules integrated to handle the way vehicle passing an intersection. Given an O/D matrix, the simulation results present a strong relation between traffic and control parameters even with the given set of rules. Based on this research, further studies can be performed easily in order to understand the heterogeneous 2-wheel dominated traffic.
{"title":"Simulation of Mixed Traffic Flow within Intersection","authors":"Vo Hong Thanh, T. Hoai","doi":"10.1109/KSE.2010.21","DOIUrl":"https://doi.org/10.1109/KSE.2010.21","url":null,"abstract":"Although many studies have targeted homogeneous and heterogeneous traffic flow, they are normally little or no attention to driver reaction passing intersection. Understanding complex movement within an intersection is the critical task which can explain the reason of traffic jam especially in big cities (for example, Ho Chi Minh City, Hanoi). This paper describes a microscopic model based on Cellular Automata (CA) for mixed traffic flow and is concerned with how the driver interacting with other vehicles in the intersection. A simulation environment is also built with a set of basic rules integrated to handle the way vehicle passing an intersection. Given an O/D matrix, the simulation results present a strong relation between traffic and control parameters even with the given set of rules. Based on this research, further studies can be performed easily in order to understand the heterogeneous 2-wheel dominated traffic.","PeriodicalId":158823,"journal":{"name":"2010 Second International Conference on Knowledge and Systems Engineering","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132650633","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}
Wu and coworkers introduced an active basis model (ABM) for detecting generic objects in static images. A grey-value local power spectrum was utilized to find a common template and deformable templates from a set of training images and to detect an object in unknown images by template matching. In this paper, we propose a color-based active basis model (color-based ABM for short) which includes color information. We adapt the framework of Wu et al. into the learning, detection, and classification of the color-based ABM. However, in order to improve the performance in object recognition, we modify the framework of Wu et al. by using different color-based features in both supervised learning and template matching algorithms. In addition, significant improvements are reported with regard to the proposed color-based ABM for object recognition.
{"title":"Supervised Learning of a Color-Based Active Basis Model for Object Recognition","authors":"T. T. Q. Bui, K. Hong","doi":"10.1109/KSE.2010.20","DOIUrl":"https://doi.org/10.1109/KSE.2010.20","url":null,"abstract":"Wu and coworkers introduced an active basis model (ABM) for detecting generic objects in static images. A grey-value local power spectrum was utilized to find a common template and deformable templates from a set of training images and to detect an object in unknown images by template matching. In this paper, we propose a color-based active basis model (color-based ABM for short) which includes color information. We adapt the framework of Wu et al. into the learning, detection, and classification of the color-based ABM. However, in order to improve the performance in object recognition, we modify the framework of Wu et al. by using different color-based features in both supervised learning and template matching algorithms. In addition, significant improvements are reported with regard to the proposed color-based ABM for object recognition.","PeriodicalId":158823,"journal":{"name":"2010 Second International Conference on Knowledge and Systems Engineering","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131572804","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, S. Nishihara
Phase trainsition phenomena observed in most combinatorial search problems including constraint satisfaction problems (CSPs) are important for clarifying how structures make problem instances hard to solve. For the graph 3-colorability (3COL), which is one of the typical CSPs, the method to systematically generate hard problem instances by embedding original minimal unsolvable structures has been proposed, whereas many research reports are based on random generate-and-test approaches. In this paper, we extend the systematic method, enabling to generate a hard 3COL instances with a higher-order connectivity. We demonstrate that the computational cost to solve 3COL instances generated by our method is of an exponential order of the number of vertices by using a few coloring algorithms and constraint satisfaction algorithms.
{"title":"Constructive Generation of 3-COL Instances Focusing on Vertex Connectivity of Minimal Unsolvable Structures","authors":"Yoshitaka Nagasawa, Kazunori Mizuno, H. Sasaki, S. Nishihara","doi":"10.1109/KSE.2010.19","DOIUrl":"https://doi.org/10.1109/KSE.2010.19","url":null,"abstract":"Phase trainsition phenomena observed in most combinatorial search problems including constraint satisfaction problems (CSPs) are important for clarifying how structures make problem instances hard to solve. For the graph 3-colorability (3COL), which is one of the typical CSPs, the method to systematically generate hard problem instances by embedding original minimal unsolvable structures has been proposed, whereas many research reports are based on random generate-and-test approaches. In this paper, we extend the systematic method, enabling to generate a hard 3COL instances with a higher-order connectivity. We demonstrate that the computational cost to solve 3COL instances generated by our method is of an exponential order of the number of vertices by using a few coloring algorithms and constraint satisfaction algorithms.","PeriodicalId":158823,"journal":{"name":"2010 Second International Conference on Knowledge and Systems Engineering","volume":"2014 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128750004","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}
Khang Nguyen, Tung Pham, Nga Le, Nguyen Dang, Nuong Tran
Educational timetabling is known to be hard combinatorial optimization problem. In this paper, a Simulated Annealing - based algorithm with an intensification strategy is applied to a real world high school timetabling problem. The obtained results are better than the Tabu Search algorithm's results published before and the handmade timetables created by experts.
{"title":"Simulated Annealing-Based Algorithm for a Real-World High School Timetabling Problem","authors":"Khang Nguyen, Tung Pham, Nga Le, Nguyen Dang, Nuong Tran","doi":"10.1109/KSE.2010.31","DOIUrl":"https://doi.org/10.1109/KSE.2010.31","url":null,"abstract":"Educational timetabling is known to be hard combinatorial optimization problem. In this paper, a Simulated Annealing - based algorithm with an intensification strategy is applied to a real world high school timetabling problem. The obtained results are better than the Tabu Search algorithm's results published before and the handmade timetables created by experts.","PeriodicalId":158823,"journal":{"name":"2010 Second International Conference on Knowledge and Systems Engineering","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117340259","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}
D. Nguyen, Chung-Tuyen Luu, Anh-Hoang Truong, N. Radics
The introduction of combined fragments to UML 2.x sequence diagrams makes it much harder for programmers to check manually the correctness of an implementation, especially when the fragments are nested. We develop an extension for Symbolic Java Path Finder (SPF) to verify if a Java program correctly implements its sequence diagram specification. Our main contribution is an algorithm to follow SPF exploration both when it advances and when it backtracks to find execution paths that are not specified in the specifications. We also generate the test cases that make the implementation go wrong for reproducing and debugging the bugs.
{"title":"Verifying Implementation of UML Sequence Diagrams Using Java PathFinder","authors":"D. Nguyen, Chung-Tuyen Luu, Anh-Hoang Truong, N. Radics","doi":"10.1109/KSE.2010.29","DOIUrl":"https://doi.org/10.1109/KSE.2010.29","url":null,"abstract":"The introduction of combined fragments to UML 2.x sequence diagrams makes it much harder for programmers to check manually the correctness of an implementation, especially when the fragments are nested. We develop an extension for Symbolic Java Path Finder (SPF) to verify if a Java program correctly implements its sequence diagram specification. Our main contribution is an algorithm to follow SPF exploration both when it advances and when it backtracks to find execution paths that are not specified in the specifications. We also generate the test cases that make the implementation go wrong for reproducing and debugging the bugs.","PeriodicalId":158823,"journal":{"name":"2010 Second International Conference on Knowledge and Systems Engineering","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116477337","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}
Clustering gene expression data is an important task in bioinformatics research and biomedical applications. In this paper, we present an effective clustering algorithm for gene expression data. The clustering algorithm is based on the analysis of data's density distribution. We propose an intersecting partition of gene expression data into the supports of data points. Density clusters are maximally connected regions at certain density levels, and thus, can be organized in a hierarchical structure. For interactive visual exploration, we use a 2D radial layout of the hierarchical density cluster tree with linked as well as embedded views of parallel coordinates and heat maps. Our system supports the understanding of the distribution of density clusters and the patterns of the density clusters. Experimental results for common gene expression data sets shows the effectiveness and scalability of the algorithm.
{"title":"Interactive Exploration of Hierarchical Density Clusters in Gene Expression Data","authors":"Tran Van Long, L. Linsen","doi":"10.1109/KSE.2010.22","DOIUrl":"https://doi.org/10.1109/KSE.2010.22","url":null,"abstract":"Clustering gene expression data is an important task in bioinformatics research and biomedical applications. In this paper, we present an effective clustering algorithm for gene expression data. The clustering algorithm is based on the analysis of data's density distribution. We propose an intersecting partition of gene expression data into the supports of data points. Density clusters are maximally connected regions at certain density levels, and thus, can be organized in a hierarchical structure. For interactive visual exploration, we use a 2D radial layout of the hierarchical density cluster tree with linked as well as embedded views of parallel coordinates and heat maps. Our system supports the understanding of the distribution of density clusters and the patterns of the density clusters. Experimental results for common gene expression data sets shows the effectiveness and scalability of the algorithm.","PeriodicalId":158823,"journal":{"name":"2010 Second International Conference on Knowledge and Systems Engineering","volume":"35 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122513066","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}
Pham Ngoc Hung, Viet-Ha Nguyen, Toshiaki Aoki, T. Katayama
This paper presents a minimized assumption generation method and its associated tools for L*-based assume-guarantee verification of component-based software by model checking. The method is not only fitted to component-based software but also has a potential to solve the state space explosion problem in model checking. In the proposed method, a verification target is decomposed into components so that we can model check each of them separately. The key idea of this method is finding the minimal assumptions in the search spaces of the candidate assumptions. The minimal assumptions generated by the proposed method can be used to recheck the whole system at much lower computational cost. Our experience so far indicates that the implemented tools are potential for verifying practical component-based software.
{"title":"Assume-Guarantee Tools for Component-Based Software Verification","authors":"Pham Ngoc Hung, Viet-Ha Nguyen, Toshiaki Aoki, T. Katayama","doi":"10.1109/KSE.2010.18","DOIUrl":"https://doi.org/10.1109/KSE.2010.18","url":null,"abstract":"This paper presents a minimized assumption generation method and its associated tools for L*-based assume-guarantee verification of component-based software by model checking. The method is not only fitted to component-based software but also has a potential to solve the state space explosion problem in model checking. In the proposed method, a verification target is decomposed into components so that we can model check each of them separately. The key idea of this method is finding the minimal assumptions in the search spaces of the candidate assumptions. The minimal assumptions generated by the proposed method can be used to recheck the whole system at much lower computational cost. Our experience so far indicates that the implemented tools are potential for verifying practical component-based software.","PeriodicalId":158823,"journal":{"name":"2010 Second International Conference on Knowledge and Systems Engineering","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126849300","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}
Sentiment analysis is one of the most important tasks in Natural Language Processing. Research in sentiment analysis for Vietnamese is relatively new and most of current work only focus in document level. In this paper, we address this problem at the sentence level and build a rule-based system using the Gate framework. Experimental results on a corpus of computer products reviews are very promising. To the best of our knowledge, this is the first work that analyzes sentiment at sentence level in Vietnamese.
{"title":"Sentiment Analysis for Vietnamese","authors":"Binh Thanh Kieu, S. Pham","doi":"10.1109/KSE.2010.33","DOIUrl":"https://doi.org/10.1109/KSE.2010.33","url":null,"abstract":"Sentiment analysis is one of the most important tasks in Natural Language Processing. Research in sentiment analysis for Vietnamese is relatively new and most of current work only focus in document level. In this paper, we address this problem at the sentence level and build a rule-based system using the Gate framework. Experimental results on a corpus of computer products reviews are very promising. To the best of our knowledge, this is the first work that analyzes sentiment at sentence level in Vietnamese.","PeriodicalId":158823,"journal":{"name":"2010 Second International Conference on Knowledge and Systems Engineering","volume":"370 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126708005","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}
Nguyen Ha Anh Tuan, Ha Tuan Cuong, N. H. Dũng, L. Vinh, Tu Minh Phuong
Multiple sequence alignment is a basic of sequence analysis. In the development of multiple sequence alignment (MSA) approaches, M-Coffee [1] was proposed as a meta-method for assembling outputs from different individual multiple aligners into one single MSA to boost the accuracy. Authors showed that M-Coffee outperformed individual alignment methods. In this paper, we propose an improvement of M-coffee, called EM-Coffee, by introducing a new weighting scheme for combining input alignments. Experiments with benchmark datasets showed that EM-Coffee produced better results than M-Coffee, T-Coffee, Muscle and some other widely used methods. Thus, we provide an alternative option for researchers to align sequences.
{"title":"EM-Coffee: An Improvement of M-Coffee","authors":"Nguyen Ha Anh Tuan, Ha Tuan Cuong, N. H. Dũng, L. Vinh, Tu Minh Phuong","doi":"10.1109/KSE.2010.16","DOIUrl":"https://doi.org/10.1109/KSE.2010.16","url":null,"abstract":"Multiple sequence alignment is a basic of sequence analysis. In the development of multiple sequence alignment (MSA) approaches, M-Coffee [1] was proposed as a meta-method for assembling outputs from different individual multiple aligners into one single MSA to boost the accuracy. Authors showed that M-Coffee outperformed individual alignment methods. In this paper, we propose an improvement of M-coffee, called EM-Coffee, by introducing a new weighting scheme for combining input alignments. Experiments with benchmark datasets showed that EM-Coffee produced better results than M-Coffee, T-Coffee, Muscle and some other widely used methods. Thus, we provide an alternative option for researchers to align sequences.","PeriodicalId":158823,"journal":{"name":"2010 Second International Conference on Knowledge and Systems Engineering","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116598339","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 proposes a model for detecting fire captured in video data by combining the methods of correlation coefficient, Gaussian Mixture Model - GMM and turbulent analysis. The method of correlation efficient is used to determine movement objects. We use GMM to cluster fire-colored pixel in the RGB space. The objective of turbulent analysis is to detect the flame of fire. A model built on three above methods will be presented and the experimental results are discussed in Section III.
{"title":"A Novel Computational Approach for Fire Detection","authors":"Ha Dai Duong, Dao Thanh Tinh","doi":"10.1109/KSE.2010.12","DOIUrl":"https://doi.org/10.1109/KSE.2010.12","url":null,"abstract":"This paper proposes a model for detecting fire captured in video data by combining the methods of correlation coefficient, Gaussian Mixture Model - GMM and turbulent analysis. The method of correlation efficient is used to determine movement objects. We use GMM to cluster fire-colored pixel in the RGB space. The objective of turbulent analysis is to detect the flame of fire. A model built on three above methods will be presented and the experimental results are discussed in Section III.","PeriodicalId":158823,"journal":{"name":"2010 Second International Conference on Knowledge and Systems Engineering","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133777590","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
扫码关注我们
求助内容：
应助结果提醒方式：