Computer is the vital element for safety-critical control system. This paper presents a component-based fail-safe computer in railway signal interlocking system (safety interlock computer - SIC). We discuss the methodology and the safety tactics of SIC in detail, moreover, the architecture and safety computation principle are deeply analyzed. The hardware safety integrity level of SIC has been verified according to standard IEC 61508, and the result shows that SIL4 is achieved, and SIC fulfils the rigorous safety requirements of signal interlocking.
{"title":"Component-Based Safety Computer of Railway Signal Interlocking System","authors":"Hai-Feng Wang, Wei Li","doi":"10.1109/CCCM.2008.269","DOIUrl":"https://doi.org/10.1109/CCCM.2008.269","url":null,"abstract":"Computer is the vital element for safety-critical control system. This paper presents a component-based fail-safe computer in railway signal interlocking system (safety interlock computer - SIC). We discuss the methodology and the safety tactics of SIC in detail, moreover, the architecture and safety computation principle are deeply analyzed. The hardware safety integrity level of SIC has been verified according to standard IEC 61508, and the result shows that SIL4 is achieved, and SIC fulfils the rigorous safety requirements of signal interlocking.","PeriodicalId":326534,"journal":{"name":"2008 ISECS International Colloquium on Computing, Communication, Control, and Management","volume":"187 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131811172","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}
An intrusion detection system which can work in IPv6 network environment is designed and implemented based on protocol analysis and pattern match technology in this paper. The system not only can fast detect system vulnerabilities and network intrusion events, but also possesses high accuracy and good performance. Furthermore, the system is tested using IDSwakeup. The test shows that the system can detect 90% of the attacking packets and lost hardly any packet when enormous and different types of vicious data packets generated by data packet generator are sent. So the system is efficient and quick-reacting IDS working in IPv6 environment.
{"title":"Research and Implementation of Next Generation Network Intrusion Detection System Based on Protocol Analysis","authors":"Guo-xiang Yao, Quanlong Guan, Liangjie Lin, Shu-qiang Huang, Guo-cheng Zhu, Hui-ping Zhang, Zhi Gao","doi":"10.1109/CCCM.2008.30","DOIUrl":"https://doi.org/10.1109/CCCM.2008.30","url":null,"abstract":"An intrusion detection system which can work in IPv6 network environment is designed and implemented based on protocol analysis and pattern match technology in this paper. The system not only can fast detect system vulnerabilities and network intrusion events, but also possesses high accuracy and good performance. Furthermore, the system is tested using IDSwakeup. The test shows that the system can detect 90% of the attacking packets and lost hardly any packet when enormous and different types of vicious data packets generated by data packet generator are sent. So the system is efficient and quick-reacting IDS working in IPv6 environment.","PeriodicalId":326534,"journal":{"name":"2008 ISECS International Colloquium on Computing, Communication, Control, and Management","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132652842","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}
Hypercubes utilizing Gray Code are used widely as the interconnection networks of parallel computer systems. But an n-dimensional hypercube has 2n nodes, which limits scalability of networks when the degree of nodes is invariable. The paper puts forward a scalable hypercube based on the Combination Gray Code with Johnson Code (GJCode (s, t)). The GJCode (s, t) has good scalable characteristics and the important properties of both Gray Code and Johnson Code. In the GJCode (s, t), there are two adjustable parameters which offer a good tradeoff between the cost of networks and their performance in terms of the demand of application systems. The paper discusses the performance of several variations of the hypercube and proposes the routing algorithm for the GJCode (s, t), which can make packets pass along the shortest distance path and is simple in hard implementation. The GJCode (s, t) can be applied in parallel computer systems and networks on chip.
{"title":"The GJCode(s, t): A Scalable Hypercube Based on the Combination Gray Code with Johnson Code","authors":"Xiaoqiang Yang, Huimin Du, Jungang Han","doi":"10.1109/CCCM.2008.191","DOIUrl":"https://doi.org/10.1109/CCCM.2008.191","url":null,"abstract":"Hypercubes utilizing Gray Code are used widely as the interconnection networks of parallel computer systems. But an n-dimensional hypercube has 2n nodes, which limits scalability of networks when the degree of nodes is invariable. The paper puts forward a scalable hypercube based on the Combination Gray Code with Johnson Code (GJCode (s, t)). The GJCode (s, t) has good scalable characteristics and the important properties of both Gray Code and Johnson Code. In the GJCode (s, t), there are two adjustable parameters which offer a good tradeoff between the cost of networks and their performance in terms of the demand of application systems. The paper discusses the performance of several variations of the hypercube and proposes the routing algorithm for the GJCode (s, t), which can make packets pass along the shortest distance path and is simple in hard implementation. The GJCode (s, t) can be applied in parallel computer systems and networks on chip.","PeriodicalId":326534,"journal":{"name":"2008 ISECS International Colloquium on Computing, Communication, Control, and Management","volume":"49 12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132791443","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}
A shadow detection algorithm base on spatial features was proposed, in the case of focusing on traffic vehicle detection system. First of all, multi-foreground rectangles were extracted by using Gaussian mixture model (GMM) and edge detection operator of mathematical morphology. Then, histogram of horizontal location - foreground point number of vertical direction was computed, combined with optimum threshold segmentation, shadow areas were removed. To enhance the adaptability, the system learns direction relations between target and its shadow, automatically. Results were presented for several video sequences representing a variety of illumination conditions. Experimental results in different traffic conditions showed our technique robust, self-adaptive, and real-time.
{"title":"Spatial Feature Based Shadow Detection in Visual Traffic Surveillance System","authors":"Shaohua Xu, Yong Zhao, Chunyu Yu, Ling Shen","doi":"10.1109/CCCM.2008.55","DOIUrl":"https://doi.org/10.1109/CCCM.2008.55","url":null,"abstract":"A shadow detection algorithm base on spatial features was proposed, in the case of focusing on traffic vehicle detection system. First of all, multi-foreground rectangles were extracted by using Gaussian mixture model (GMM) and edge detection operator of mathematical morphology. Then, histogram of horizontal location - foreground point number of vertical direction was computed, combined with optimum threshold segmentation, shadow areas were removed. To enhance the adaptability, the system learns direction relations between target and its shadow, automatically. Results were presented for several video sequences representing a variety of illumination conditions. Experimental results in different traffic conditions showed our technique robust, self-adaptive, and real-time.","PeriodicalId":326534,"journal":{"name":"2008 ISECS International Colloquium on Computing, Communication, Control, and Management","volume":"19 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120953087","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}
Mining data streams poses great challenges due to the limited memory availability and real time query response requirement. One of the most important mining tasks is clustering. There already lots of clustering algorithms for data stream have been presented. Fuzzy cluster is an important clustering method. However, to the best of our knowledge, all the clustering algorithms are hard clustering methods, fuzzy clustering algorithm is presently not used directly for data streams. Fuzzy c-means (FCM) is a typical fuzzy clustering algorithm. In this paper, we extend FCM and propose a weighted fuzzy algorithm for clustering data stream. Experimental results on both synthetic and real data sets show its superiority over the traditional FCM algorithms.
{"title":"A Weighted Fuzzy Clustering Algorithm for Data Stream","authors":"Renxia Wan, Xiaoya Yan, Xiaoke Su","doi":"10.1109/CCCM.2008.186","DOIUrl":"https://doi.org/10.1109/CCCM.2008.186","url":null,"abstract":"Mining data streams poses great challenges due to the limited memory availability and real time query response requirement. One of the most important mining tasks is clustering. There already lots of clustering algorithms for data stream have been presented. Fuzzy cluster is an important clustering method. However, to the best of our knowledge, all the clustering algorithms are hard clustering methods, fuzzy clustering algorithm is presently not used directly for data streams. Fuzzy c-means (FCM) is a typical fuzzy clustering algorithm. In this paper, we extend FCM and propose a weighted fuzzy algorithm for clustering data stream. Experimental results on both synthetic and real data sets show its superiority over the traditional FCM algorithms.","PeriodicalId":326534,"journal":{"name":"2008 ISECS International Colloquium on Computing, Communication, Control, and Management","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116623517","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}
Large scale networks are usually hierarchically structured for the reason of scalability and security. Topology aggregation is introduced for the state information reduction of domains, but it also brings distortion of the original state information. The tradeoff between information reduction and distortion is the key to topology aggregation. In this paper, a new topology aggregation algorithm called SA approach is presented for hierarchical networks with delay and bandwidth constraints. This approach uses an approximation staircase generated by a line segment to represent the QoS supported area for the purpose of representing the parameters of a logical link in the full-mesh; furthermore, the spanning tree and star topology are employed to compress the full-mesh. Experimental results show that the new topology aggregation method can reduce more information distortion and achieve a better tradeoff between information reduction and accuracy than existing approaches.
{"title":"A New Topology Aggregation Algorithm in Hierarchical Networks","authors":"Jingjun Zhang, Yuanbin Han, Liguo Wang","doi":"10.1109/CCCM.2008.128","DOIUrl":"https://doi.org/10.1109/CCCM.2008.128","url":null,"abstract":"Large scale networks are usually hierarchically structured for the reason of scalability and security. Topology aggregation is introduced for the state information reduction of domains, but it also brings distortion of the original state information. The tradeoff between information reduction and distortion is the key to topology aggregation. In this paper, a new topology aggregation algorithm called SA approach is presented for hierarchical networks with delay and bandwidth constraints. This approach uses an approximation staircase generated by a line segment to represent the QoS supported area for the purpose of representing the parameters of a logical link in the full-mesh; furthermore, the spanning tree and star topology are employed to compress the full-mesh. Experimental results show that the new topology aggregation method can reduce more information distortion and achieve a better tradeoff between information reduction and accuracy than existing approaches.","PeriodicalId":326534,"journal":{"name":"2008 ISECS International Colloquium on Computing, Communication, Control, and Management","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114758801","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}
As the foundation of service discovery, match, and composition, the solution to semantic description of Web services is the primary issue in semantic Web services. Aiming at adding semantic description to Web services, and solving problems of similarity calculations in Web services semantic annotation, an improved annotation method was developed: using similarities between WSDL and ontology to annotate services. The method improves similarity algorithms from two aspects: on one hand, the most-related concepts are filtered out according to name similarities between concepts so as to reduce the computational work; on the other, setting different weights to different sub-concepts to raise the accuracy of the structural similarity algorithm. Tests annotating dozens of WSDL in weather has an accuracy of 82.5%.
{"title":"An Improved Semantic Annotation Method of Web Services Based on Ontology","authors":"Lei Zhang, Yang Xiaoying, Y. Yanni, Sun Bo","doi":"10.1109/CCCM.2008.73","DOIUrl":"https://doi.org/10.1109/CCCM.2008.73","url":null,"abstract":"As the foundation of service discovery, match, and composition, the solution to semantic description of Web services is the primary issue in semantic Web services. Aiming at adding semantic description to Web services, and solving problems of similarity calculations in Web services semantic annotation, an improved annotation method was developed: using similarities between WSDL and ontology to annotate services. The method improves similarity algorithms from two aspects: on one hand, the most-related concepts are filtered out according to name similarities between concepts so as to reduce the computational work; on the other, setting different weights to different sub-concepts to raise the accuracy of the structural similarity algorithm. Tests annotating dozens of WSDL in weather has an accuracy of 82.5%.","PeriodicalId":326534,"journal":{"name":"2008 ISECS International Colloquium on Computing, Communication, Control, and Management","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114956268","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}
In this paper, applying the theory of stochastic processes and interacting particle systems, including stopping time theory and the stochastic voter model, we model a financial price model that contains two types of investors, and we use this financial model to describe the behavior and fluctuations of a stock price process in a stock market. In the financial model, besides the professional investors, we also consider the general investors or nonprofessional investors, where the stopping time and the voter model are applied to model and study the statistical properties of investment of the nonprofessional investors. Further, we discuss the valuation and hedging of European contingent claims for this price process model.
{"title":"Stock Prices Fluctuations and Analytical Valuation of Contingent Claims by Stochastic Interacting Systems","authors":"Jun Wang, Fang Zhao, C. Wei","doi":"10.1109/CCCM.2008.188","DOIUrl":"https://doi.org/10.1109/CCCM.2008.188","url":null,"abstract":"In this paper, applying the theory of stochastic processes and interacting particle systems, including stopping time theory and the stochastic voter model, we model a financial price model that contains two types of investors, and we use this financial model to describe the behavior and fluctuations of a stock price process in a stock market. In the financial model, besides the professional investors, we also consider the general investors or nonprofessional investors, where the stopping time and the voter model are applied to model and study the statistical properties of investment of the nonprofessional investors. Further, we discuss the valuation and hedging of European contingent claims for this price process model.","PeriodicalId":326534,"journal":{"name":"2008 ISECS International Colloquium on Computing, Communication, Control, and Management","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115360305","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}
According to the unknown control direction strict feedback nonlinear systems, this paper introduced a design process for time-varying nonlinear adaptive controller by introducing the Nussbaum increasing and the dead area revision algorithm. Its stability is proved and analyzed, and its simulation is designed with the LMI MATLAB toolbox, the result shows that the controller has a good performance.
{"title":"A Design of Time-Varying Auto-Adaptive Tracker","authors":"Xianfang Wang, Zhiyong Du, F. Pan","doi":"10.1109/CCCM.2008.29","DOIUrl":"https://doi.org/10.1109/CCCM.2008.29","url":null,"abstract":"According to the unknown control direction strict feedback nonlinear systems, this paper introduced a design process for time-varying nonlinear adaptive controller by introducing the Nussbaum increasing and the dead area revision algorithm. Its stability is proved and analyzed, and its simulation is designed with the LMI MATLAB toolbox, the result shows that the controller has a good performance.","PeriodicalId":326534,"journal":{"name":"2008 ISECS International Colloquium on Computing, Communication, Control, and Management","volume":"206 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116193166","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}
From the view of how to get the biggest benefits by optimizing the project network schedule, the paper uses systemic method of controlling the construction schedule and puts forward a mathematical model which considers the synthetic optimization of the cost, the supply of resources and the influence of latent uncertainties. Then by changing the choose strategy and the local search strategy, the combining ant colony algorithms and particle swarm optimization algorithms (PAAA) is proposed and applied in the process of optimizing the model. Finally, an example is used to prove the method is effective.
{"title":"Network Synthetic Optimization in Project Schedule by Using PAAA Algorithm and Considered of Time Value of Money","authors":"Yuansheng Huang, Qingchao Liu, Zilong Qiu","doi":"10.1109/CCCM.2008.52","DOIUrl":"https://doi.org/10.1109/CCCM.2008.52","url":null,"abstract":"From the view of how to get the biggest benefits by optimizing the project network schedule, the paper uses systemic method of controlling the construction schedule and puts forward a mathematical model which considers the synthetic optimization of the cost, the supply of resources and the influence of latent uncertainties. Then by changing the choose strategy and the local search strategy, the combining ant colony algorithms and particle swarm optimization algorithms (PAAA) is proposed and applied in the process of optimizing the model. Finally, an example is used to prove the method is effective.","PeriodicalId":326534,"journal":{"name":"2008 ISECS International Colloquium on Computing, Communication, Control, and Management","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116346304","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
扫码关注我们
求助内容：
应助结果提醒方式：