{"title":"The BDD-based assessment method of project safety risk","authors":"Liqiong Yang, Shirong Li, Yufeng Xiao","doi":"10.1109/CSAE.2011.5952801","DOIUrl":"https://doi.org/10.1109/CSAE.2011.5952801","url":null,"abstract":"To assess project safety risk, this paper proposes a quantitative method based on BDD(Binary Decision Diagram). After constructing the BDD with fault tree of safety risk event, the method traverses the BDD and computes the occurrence probability of risk event. For the convenient implementation with computer program, it can get analysis results efficiently and accurately. So it is very suitable for the risk assessment of large projects.","PeriodicalId":138215,"journal":{"name":"2011 IEEE International Conference on Computer Science and Automation Engineering","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130495495","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":"Recognition of manipulated posts based on SVM classification on bulletin board system","authors":"Biao Wang, Qian Gao, Yueqin Liu, Yuhong Guo, Yangcao Wu","doi":"10.1109/CSAE.2011.5952640","DOIUrl":"https://doi.org/10.1109/CSAE.2011.5952640","url":null,"abstract":"Inspired by the fact that online Public Relations (online PR) companies manipulate the online information and confuse people about the truth of information, a novel problem of identifying messages that are controlled by online PR companies is presented. Combined with the knowledge of characteristics of opinion leaders, methods of agenda setting and strategy patterns of online PR companies, a set of features which can identify manipulated posts on bulletin board system (BBS) is proposed and verified by using classification methods. Experiments with data from real-world BBS are conducted to evaluate the ability of the feature set. The verification using Support Vector Machines proves that the feature set can be used for identification with the accuracy surpassing 74%.","PeriodicalId":138215,"journal":{"name":"2011 IEEE International Conference on Computer Science and Automation Engineering","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126805552","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":"Multiobjective optimization by Artificial Fish Swarm Algorithm","authors":"M. Jiang, Kongcun Zhu","doi":"10.1109/CSAE.2011.5952729","DOIUrl":"https://doi.org/10.1109/CSAE.2011.5952729","url":null,"abstract":"Artificial Fish Swarm Algorithm (AFSA) is a kind of swarm intelligence algorithm, which has the features of fast convergence, good global search capability, strong robustness and so on. In this paper, an approach using AFSA to solve the multiobjective optimization problem is proposed. In this algorithm, the concept of Pareto dominance is used to evaluate the pros and cons of Artificial Fish (AF). Artificial fish swarm search the solution space in parallel and External Record Set is used to save the found Pareto optimal solutions. The simulation results of 4 benchmark test functions illustrate the effectiveness of the proposed algorithm.","PeriodicalId":138215,"journal":{"name":"2011 IEEE International Conference on Computer Science and Automation Engineering","volume":"57 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130645020","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":"Quantitative threat assessment of denial of service attacks on service availability","authors":"Xiuzhen Chen, Shenghong Li, Jin Ma, Jianhua Li","doi":"10.1109/CSAE.2011.5953208","DOIUrl":"https://doi.org/10.1109/CSAE.2011.5953208","url":null,"abstract":"With increasing denial of service attacks on network infrastructure, there is an urgent need to develop technique to assess the threat of attacks on network security online. A novel model of security threat assessment relying on several predefined metrics of network performance is proposed to measure the impact of denial of service attacks on service availability in real time. This model applies the technique of D-S evidence reasoning to fuse three metrics of network performance, which are designed carefully to reflect the reliability of service availability in three perspectives. Our approach includes three steps: determining performance parameters, calculating threat index and characterizing the threat state of service availability. Compared with other methods, this method avoids the unilateral result obtained from single sensor, helps administrators to determine security threat state, and provides threat evolution of service availability over time. Testing in a real network environment shows that this method greatly improves the accuracy of threat assessment, demonstrates the impact of denial of service attacks on network security is different from the beginning to the end of DoS attacks, and provides administrators with threat evolution picture macroscopically. Moreover, it lays the foundation for administrators to adopt security response policies in real time for reliable and robust network.","PeriodicalId":138215,"journal":{"name":"2011 IEEE International Conference on Computer Science and Automation Engineering","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130667354","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}
Chenguang Guo, Yanlong Zhang, Zhiping Wen, Lei Chen, Xuewu Li, Zengrong Liu, Min Wang
{"title":"A novel configurable boundary-scan circuit design of SRAM-based FPGA","authors":"Chenguang Guo, Yanlong Zhang, Zhiping Wen, Lei Chen, Xuewu Li, Zengrong Liu, Min Wang","doi":"10.1109/CSAE.2011.5952482","DOIUrl":"https://doi.org/10.1109/CSAE.2011.5952482","url":null,"abstract":"This paper presents a novel configurable boundary-scan circuit (CBSC) of SRAM-based field programmable gate array (FPGA). The embedded SRAM cells of FPGA have been used to modify the original structure of boundary-scan circuit (BSC). Users only need to change the data stored in the embedded SRAM cell during the configuration of the FPGA chip. In this way, the boundary-scan chain can be configured to any desired length. Compared with the original structure of BSC, this circuit using 0.25µm CMOS process can be part of a standard digital cell library and has been used in the BQV series FPGAs of BMTI.","PeriodicalId":138215,"journal":{"name":"2011 IEEE International Conference on Computer Science and Automation Engineering","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124206270","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":"Using non-rigid image registration and Thin-Plate Spline warping for lung cancer progression assessment","authors":"Dawood M. S. Almasslawi, E. Kabir","doi":"10.1109/CSAE.2011.5952518","DOIUrl":"https://doi.org/10.1109/CSAE.2011.5952518","url":null,"abstract":"Among different types of cancer the lung cancer is the most aggressive and best practice to its accurate prognosis is the determination of the current stage of the disease. Three main factors in cancer staging are primary tumor, regional lymph nodes and metastasis. Accurate determination of the cancer stage is not a trivial task, however utilization of computerized diagnostic tools can help the cancer experts to better diagnose the cancer status. Image registration is one of the main tools used for cancer diagnosis by experts. In this paper a new approach based on image registration is proposed to help the experts in better diagnosis of the lung cancer which is an improved method based on a previously proposed approach by the authors. In a multistep process the similarity between a pair of images acquired during past and current cancer stages is maximized with regards to the fact that tumor changes should be preserved during the deformation process. The similarity measure used during the registration process is Normalized Mutual Information. In the non-rigid image registration phase constraints are enforced on the optimization criteria, number of iterations and number of B-Spline grid nodes to preserve the tumor change. Control points which are transformation parameters for the Thin-Plate Spline warping are extracted from edge detected images in a semiautomatic manner. In the final step subtraction of sequential CT images is performed to detect the changes in the lung including the tumor change. Using the Insight Toolkit framework improved the quality of the final results and also ensured a more robust application. Experiments conducted on 8 pairs of CT lung volumes proved to have a satisfactory quality for change detection of the lung cancer.","PeriodicalId":138215,"journal":{"name":"2011 IEEE International Conference on Computer Science and Automation Engineering","volume":"167 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121308932","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-chip debug architecture for MCU-DSP Core based system-on-chip","authors":"Wang Gang, Zhang Shengbing","doi":"10.1109/CSAE.2011.5952543","DOIUrl":"https://doi.org/10.1109/CSAE.2011.5952543","url":null,"abstract":"The migration from system on printed circuit boards (PCBs) to system-on-chips (SoCs) has moved more and more components onto SoCs. An unintended side effect of this higher integration level is the decreasing system observability and controllability, and consequently resulting in novel debug challenges for embedded system development [1]. This paper presents an on-chip debug architecture that can help conquer the challenges. The on-chip debug architecture is integrated into the 32-bit static superscalar MCU-DSP Core based SoC and includes three main components: the JTAG Controller, the On-chip Debug Module and the Core Debug Module. This modular architecture can support the following typical debug features with low hardware overhead: real-time run control, access internal registers and local memory on the fly, complex hardware breakpoints and single-stepping.","PeriodicalId":138215,"journal":{"name":"2011 IEEE International Conference on Computer Science and Automation Engineering","volume":"264 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121407481","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":"Study of predictive modeling of machining speed in ceramics grinding","authors":"Jianzhong Li, R. Shan, Yuhui Zhao, Zuyuan Yu","doi":"10.1109/CSAE.2011.5952631","DOIUrl":"https://doi.org/10.1109/CSAE.2011.5952631","url":null,"abstract":"This paper presents a predictive modeling of machining speed in the process of ceramics grinding based on the theory of indentation, ideal grinding grain shape, wheel microstructure and dynamic effects. Machining parameters such as grinding force, wheel rotation speed and the depth of cut are included in this model. A series of experiments have been carried out to verify this model. It was found that the theoretical analysis agrees reasonably with the experimental results.","PeriodicalId":138215,"journal":{"name":"2011 IEEE International Conference on Computer Science and Automation Engineering","volume":"117 12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114085130","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 adaptive genetic algorithm for facility layout problem in cylinder block line","authors":"Liyun Xu, Shouyin Yang, Aiping Li, A. Matta","doi":"10.1109/CSAE.2011.5952782","DOIUrl":"https://doi.org/10.1109/CSAE.2011.5952782","url":null,"abstract":"Nowadays, manufacturing enterprises should have the abilities to be response quickly to the changes in product variety, mix and volume while minimizing material handling cost. For achieving this, enterprises have to adapt their production system to the new circumstance by adjusting facilities layout. In some cases, both the material handling cost and workshop utilization are critical factors for facilities layout problem (FLP). In this paper, an adaptive genetic algorithm (AGA) is proposed to optimize the above two objectives. A facilities layout of cylinder block line is illustrated to deal with the multi-objectives model. The results show that the algorithm is effective and accurate.","PeriodicalId":138215,"journal":{"name":"2011 IEEE International Conference on Computer Science and Automation Engineering","volume":"214 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116489379","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":"Development of automation path selection system for vehicle","authors":"Yunfeng Lou, Xin Zhao, H. Ogai","doi":"10.1109/CSAE.2011.5953311","DOIUrl":"https://doi.org/10.1109/CSAE.2011.5953311","url":null,"abstract":"The main object of this paper is to design and realize a real-time autonomous driving system for intelligent vehicles by using the map information. By appointing the destination, the intelligent vehicle selects the optimal route in real-time, and reaches the specific destination without ordering the course of the travel. In addition, a simulation study which contains a number of map instances was made to confirm the algorithm. Finally, the performance and accuracy of the proposed system was verified by real-time experiment result.","PeriodicalId":138215,"journal":{"name":"2011 IEEE International Conference on Computer Science and Automation Engineering","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116510886","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}