Pub Date : 2008-12-01DOI: 10.1109/KAMW.2008.4810609
Huijuan Zhou, L. Jia, Yong Qin
The railway transportation safety system is a complex dynamic system with spatio-temporal characteristics. Taking railway line section as the research object, we propose a new cellular automation (CA) model - a safety system model for railway (SSM-R) - to simulate the railway safety. In the proposed CA model, we consider a railway line section as a cell and the neighbouring sections as the neighbors, and emphasize particularly on the transition rules including train speed limit rules, train update rules, Signal update rules, block section rules, etc. Then a simulation experiment is carried out with ArcGIS Engine 9.1 and Dot Net, the results show that the model can interpret the evolutional law of the railway transportation safety system.
{"title":"Cellar Automaton Model for Railway Transportation Safety System","authors":"Huijuan Zhou, L. Jia, Yong Qin","doi":"10.1109/KAMW.2008.4810609","DOIUrl":"https://doi.org/10.1109/KAMW.2008.4810609","url":null,"abstract":"The railway transportation safety system is a complex dynamic system with spatio-temporal characteristics. Taking railway line section as the research object, we propose a new cellular automation (CA) model - a safety system model for railway (SSM-R) - to simulate the railway safety. In the proposed CA model, we consider a railway line section as a cell and the neighbouring sections as the neighbors, and emphasize particularly on the transition rules including train speed limit rules, train update rules, Signal update rules, block section rules, etc. Then a simulation experiment is carried out with ArcGIS Engine 9.1 and Dot Net, the results show that the model can interpret the evolutional law of the railway transportation safety system.","PeriodicalId":375613,"journal":{"name":"2008 IEEE International Symposium on Knowledge Acquisition and Modeling Workshop","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115727434","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}
Pub Date : 2008-12-01DOI: 10.1109/KAMW.2008.4810675
Zhitong Su, Wei Song, Danyang Cao, Jinhong Li
The application of association rule mining to classification has led to a new family of classifiers which are often referred to as associative classifiers (ACs). An advantage of ACs is that they are rule-based and thus lend themselves to an easier interpretation. However, it is common knowledge that association rule mining typically yields a sheer number of rules defeating the purpose of a human readable model. Hence, selecting and ranking a small subset of high-quality rules without jeopardizing the classification accuracy is paramount but very challenging. In this paper, Entropy-AC, a new associative classifier based on entropy, is proposed. Information gain and informative rules are defined at first. Then, the algorithm for constructing associative classifier based on informative rules is presented. Experimental results show the proposed associative classifier is effective.
{"title":"Discovering Informative Association Rules for Associative Classification","authors":"Zhitong Su, Wei Song, Danyang Cao, Jinhong Li","doi":"10.1109/KAMW.2008.4810675","DOIUrl":"https://doi.org/10.1109/KAMW.2008.4810675","url":null,"abstract":"The application of association rule mining to classification has led to a new family of classifiers which are often referred to as associative classifiers (ACs). An advantage of ACs is that they are rule-based and thus lend themselves to an easier interpretation. However, it is common knowledge that association rule mining typically yields a sheer number of rules defeating the purpose of a human readable model. Hence, selecting and ranking a small subset of high-quality rules without jeopardizing the classification accuracy is paramount but very challenging. In this paper, Entropy-AC, a new associative classifier based on entropy, is proposed. Information gain and informative rules are defined at first. Then, the algorithm for constructing associative classifier based on informative rules is presented. Experimental results show the proposed associative classifier is effective.","PeriodicalId":375613,"journal":{"name":"2008 IEEE International Symposium on Knowledge Acquisition and Modeling Workshop","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127515225","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}
Pub Date : 2008-12-01DOI: 10.1109/KAMW.2008.4810580
Siqun Ma, Jun Yu Li
The urgent issues for automobile, aircraft and trains companies today are how to reduce the time and cost required for developing a new car. CAE(computer aided engineering) has been regarded as an efficient way to solve these issues. Currently, the courseware for CAE is not enough, which limits education and training for this domain. The paper basing on "Web-based e-learning courseware for CAE" introduces the idea of design, system structure and development of process.
{"title":"The Design and Development of Web-Based E-Learning Courseware for CAE","authors":"Siqun Ma, Jun Yu Li","doi":"10.1109/KAMW.2008.4810580","DOIUrl":"https://doi.org/10.1109/KAMW.2008.4810580","url":null,"abstract":"The urgent issues for automobile, aircraft and trains companies today are how to reduce the time and cost required for developing a new car. CAE(computer aided engineering) has been regarded as an efficient way to solve these issues. Currently, the courseware for CAE is not enough, which limits education and training for this domain. The paper basing on \"Web-based e-learning courseware for CAE\" introduces the idea of design, system structure and development of process.","PeriodicalId":375613,"journal":{"name":"2008 IEEE International Symposium on Knowledge Acquisition and Modeling Workshop","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125270584","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}
Pub Date : 2008-12-01DOI: 10.1109/KAMW.2008.4810519
Feng-jie Yin, Jian-sheng Xue, Xiu-li Ren
A novel active queue management (AQM) scheme based on fuzzy sliding mode controller is designed to tackle network congestion problem with modelling uncertainties, time varying parameter fluctuations and external disturbances. Stability analysis is given to this system. Simulation results demonstrate that it can lead to the convergence of the queue length to the desired value quickly and maintain the oscillation small.
{"title":"Design a Stabilizing AQM Controller Based on Fuzzy Sliding Mode Control","authors":"Feng-jie Yin, Jian-sheng Xue, Xiu-li Ren","doi":"10.1109/KAMW.2008.4810519","DOIUrl":"https://doi.org/10.1109/KAMW.2008.4810519","url":null,"abstract":"A novel active queue management (AQM) scheme based on fuzzy sliding mode controller is designed to tackle network congestion problem with modelling uncertainties, time varying parameter fluctuations and external disturbances. Stability analysis is given to this system. Simulation results demonstrate that it can lead to the convergence of the queue length to the desired value quickly and maintain the oscillation small.","PeriodicalId":375613,"journal":{"name":"2008 IEEE International Symposium on Knowledge Acquisition and Modeling Workshop","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126948477","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}
Pub Date : 2008-12-01DOI: 10.1109/KAMW.2008.4810654
Zhang Jun, Gao Wei
The ant system is a new meta-heuristic mainly for hard combinatorial optimization problems. It has been unexpectedly successful and known as ant colony optimization (ACO) in recent years. Nowadays, a series of improvements have been made to the ACO, most of which focus on the exploitation of gather information to guide the search of ant colony towards better solution space but neglect the exploration of new tours. In order to enlarge the ants' searching space and diversify the searching solutions, Meeting ACO is proposed here. The main strategy used in this new algorithm is to combine pairs of searching ants together to expand the diversification of the search. To make up the influence caused by limited number of meeting ants, a threshold constant is applied to make the algorithm function normally. As proved by the simulation experiments, the Meeting ACO is ranked among the best ACO for tackling the TSP problems.
{"title":"Meeting Ant Colony Optimization","authors":"Zhang Jun, Gao Wei","doi":"10.1109/KAMW.2008.4810654","DOIUrl":"https://doi.org/10.1109/KAMW.2008.4810654","url":null,"abstract":"The ant system is a new meta-heuristic mainly for hard combinatorial optimization problems. It has been unexpectedly successful and known as ant colony optimization (ACO) in recent years. Nowadays, a series of improvements have been made to the ACO, most of which focus on the exploitation of gather information to guide the search of ant colony towards better solution space but neglect the exploration of new tours. In order to enlarge the ants' searching space and diversify the searching solutions, Meeting ACO is proposed here. The main strategy used in this new algorithm is to combine pairs of searching ants together to expand the diversification of the search. To make up the influence caused by limited number of meeting ants, a threshold constant is applied to make the algorithm function normally. As proved by the simulation experiments, the Meeting ACO is ranked among the best ACO for tackling the TSP problems.","PeriodicalId":375613,"journal":{"name":"2008 IEEE International Symposium on Knowledge Acquisition and Modeling Workshop","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122911321","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}
Pub Date : 2008-12-01DOI: 10.1109/KAMW.2008.4810584
Shixiang Li, Hong-da Fan, Yuli Wang
Finding one of the smallest non-standard ellipse containing a given point set, is very useful in image and picture labeling. The paper presents an approach to seek the ellipse. The paper was not going to seek the equation of the ellipse, it solved the 5 elliptical parameters (the long axis a, the short axis b, the elliptical center and the rotation k) for determining the ellipse, instead. In order to reduce the problem complexity, the search of non-standard ellipse was turned into the standard ellipse's search through spatial coordinate transformation. And the genetic algorithms are adopted to optimize the ultimate aim to solve the smallest non-standard ellipse. The experiment results show that the approach is effective.
{"title":"Finding the Smallest Ellipse Containing a Point Set based on Genetic Algorithms","authors":"Shixiang Li, Hong-da Fan, Yuli Wang","doi":"10.1109/KAMW.2008.4810584","DOIUrl":"https://doi.org/10.1109/KAMW.2008.4810584","url":null,"abstract":"Finding one of the smallest non-standard ellipse containing a given point set, is very useful in image and picture labeling. The paper presents an approach to seek the ellipse. The paper was not going to seek the equation of the ellipse, it solved the 5 elliptical parameters (the long axis a, the short axis b, the elliptical center and the rotation k) for determining the ellipse, instead. In order to reduce the problem complexity, the search of non-standard ellipse was turned into the standard ellipse's search through spatial coordinate transformation. And the genetic algorithms are adopted to optimize the ultimate aim to solve the smallest non-standard ellipse. The experiment results show that the approach is effective.","PeriodicalId":375613,"journal":{"name":"2008 IEEE International Symposium on Knowledge Acquisition and Modeling Workshop","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114420743","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}
Pub Date : 2008-12-01DOI: 10.1109/KAMW.2008.4810616
Huang Zhi-hua, Yi Ben-shun
Transmission of compressed video over error prone channels may result in packet losses or errors, which can significantly degrade the image quality. Error concealment is an effective approach to reduce the influence. In this paper, a new temporal error concealment algorithm for the H.264 is presented, which efficiently utilize the motion vectors of neighboring top/bottom macro blocks adjacent to the lost macro block. Firstly, the motion strength of neighboring area (MSNA) is estimated by calculating a ratio involving the motion vectors of adjacent macro blocks. Then the motion vector recovery method either minimum variance of boundary motion vectors method or polynomial interpolation method is employed according to the magnitude of MSNA. Experimental results show that the proposed algorithm improves the subjective video quality and obtains a gain of about 0.2 dB~3 dB in PSNR, compared with conventional temporal error concealment algorithms in the condition of equal packet loss rate.
{"title":"A New Temporal Error Concealment Algorithm for H.264/AVC Using Motion Strength of Neighboring Area","authors":"Huang Zhi-hua, Yi Ben-shun","doi":"10.1109/KAMW.2008.4810616","DOIUrl":"https://doi.org/10.1109/KAMW.2008.4810616","url":null,"abstract":"Transmission of compressed video over error prone channels may result in packet losses or errors, which can significantly degrade the image quality. Error concealment is an effective approach to reduce the influence. In this paper, a new temporal error concealment algorithm for the H.264 is presented, which efficiently utilize the motion vectors of neighboring top/bottom macro blocks adjacent to the lost macro block. Firstly, the motion strength of neighboring area (MSNA) is estimated by calculating a ratio involving the motion vectors of adjacent macro blocks. Then the motion vector recovery method either minimum variance of boundary motion vectors method or polynomial interpolation method is employed according to the magnitude of MSNA. Experimental results show that the proposed algorithm improves the subjective video quality and obtains a gain of about 0.2 dB~3 dB in PSNR, compared with conventional temporal error concealment algorithms in the condition of equal packet loss rate.","PeriodicalId":375613,"journal":{"name":"2008 IEEE International Symposium on Knowledge Acquisition and Modeling Workshop","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117251163","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}
Pub Date : 2008-12-01DOI: 10.1109/KAMW.2008.4810422
Zhijun Zhang, Luxin Tang, Huan Yao, Hui Liu
After analyzing flexibility material processing (such as quilting processing) influencing factor of pattern deformation, the edges of the original image and the deformation image are extracted. Then they are changed into coordinate. On top of it, the data are put into the Elman neural networks to train which has been built and the original image is used to as the teacher signal to tutoring. At last, the matter extenics model is built qua the database's data of the extension decision strategy generator by analysis the simulation result.
{"title":"Simulation of Elman Neural network Extension Strategy Generator to Pattern Deformation Error in Flexibility Material Treating Field","authors":"Zhijun Zhang, Luxin Tang, Huan Yao, Hui Liu","doi":"10.1109/KAMW.2008.4810422","DOIUrl":"https://doi.org/10.1109/KAMW.2008.4810422","url":null,"abstract":"After analyzing flexibility material processing (such as quilting processing) influencing factor of pattern deformation, the edges of the original image and the deformation image are extracted. Then they are changed into coordinate. On top of it, the data are put into the Elman neural networks to train which has been built and the original image is used to as the teacher signal to tutoring. At last, the matter extenics model is built qua the database's data of the extension decision strategy generator by analysis the simulation result.","PeriodicalId":375613,"journal":{"name":"2008 IEEE International Symposium on Knowledge Acquisition and Modeling Workshop","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129564904","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}
Pub Date : 2008-12-01DOI: 10.1109/KAMW.2008.4810562
Huan Li
Over the last four decades, particular interest in software complexities is how to measure and control coupling interactions of the various parts of object-oriented (OO) systems. This paper introduces a novel coupling metric, called global coupling metric, to evaluate coupling interactions between classes of object-oriented systems. The metric differs from the majority of existing metrics in two aspects: it takes into account the strength that one class is dependent on another, it reflects indirect coupling. An empirical comparison of the novel metric with one of the most widely used coupling metrics is described.
{"title":"A Novel Coupling Metric for Object-Oriented Software Systems","authors":"Huan Li","doi":"10.1109/KAMW.2008.4810562","DOIUrl":"https://doi.org/10.1109/KAMW.2008.4810562","url":null,"abstract":"Over the last four decades, particular interest in software complexities is how to measure and control coupling interactions of the various parts of object-oriented (OO) systems. This paper introduces a novel coupling metric, called global coupling metric, to evaluate coupling interactions between classes of object-oriented systems. The metric differs from the majority of existing metrics in two aspects: it takes into account the strength that one class is dependent on another, it reflects indirect coupling. An empirical comparison of the novel metric with one of the most widely used coupling metrics is described.","PeriodicalId":375613,"journal":{"name":"2008 IEEE International Symposium on Knowledge Acquisition and Modeling Workshop","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128807120","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}
Pub Date : 2008-12-01DOI: 10.1109/KAMW.2008.4810659
Yushui Geng, Zhonghua Zhao, Xiangcui Kong
By studying the current mainstream database system, with message queue method mechanism and JMS messaging services, we designed a data synchronization system model. We introduced the model's major technology and work processes in detail. Finally, we analyzed the system's inadequacy and made some improvements.
{"title":"Synchronization System among Remote Heterogeneous Database Systems","authors":"Yushui Geng, Zhonghua Zhao, Xiangcui Kong","doi":"10.1109/KAMW.2008.4810659","DOIUrl":"https://doi.org/10.1109/KAMW.2008.4810659","url":null,"abstract":"By studying the current mainstream database system, with message queue method mechanism and JMS messaging services, we designed a data synchronization system model. We introduced the model's major technology and work processes in detail. Finally, we analyzed the system's inadequacy and made some improvements.","PeriodicalId":375613,"journal":{"name":"2008 IEEE International Symposium on Knowledge Acquisition and Modeling Workshop","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130312422","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
扫码关注我们
求助内容：
应助结果提醒方式：