H. Liying, T. Hongmei, Zhang Ruoyan, Zhang Cunshan, Zhao Hongdong
An optimization method for power/ground network based on genetic algorithm was presented in this paper. The method could deal with the problem from the VLSI placement stage combined with the characteristic of the power/ground network. It had optimized the power/ground network floor planning by the improvement of the placement of the modules. The simulation proved that the anticipant result was achieved.
{"title":"An Optimization Method for Power/Ground Network Based on Genetic Algorithm","authors":"H. Liying, T. Hongmei, Zhang Ruoyan, Zhang Cunshan, Zhao Hongdong","doi":"10.1109/ICCCS.2009.17","DOIUrl":"https://doi.org/10.1109/ICCCS.2009.17","url":null,"abstract":"An optimization method for power/ground network based on genetic algorithm was presented in this paper. The method could deal with the problem from the VLSI placement stage combined with the characteristic of the power/ground network. It had optimized the power/ground network floor planning by the improvement of the placement of the modules. The simulation proved that the anticipant result was achieved.","PeriodicalId":103274,"journal":{"name":"2009 International Conference on Computer and Communications Security","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129896397","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}
Circulant matrix is important since it is an active research field of applied mathematic and computation mathematic increasingly . R-circulant matrices have applied in numerical computation, signal processing, coding theory and oil investigation in recent years, and so on. In this paper, motivated by [1], we give some discriminations by using only the elements in the first row of the r-circulant matrix in the diagonal matrix on non singularity, and give two examples at last.
{"title":"The Nonsingularity on the Symmetric r-Circulant Matrices","authors":"C. Dong","doi":"10.1109/ICCCS.2009.33","DOIUrl":"https://doi.org/10.1109/ICCCS.2009.33","url":null,"abstract":"Circulant matrix is important since it is an active research field of applied mathematic and computation mathematic increasingly . R-circulant matrices have applied in numerical computation, signal processing, coding theory and oil investigation in recent years, and so on. In this paper, motivated by [1], we give some discriminations by using only the elements in the first row of the r-circulant matrix in the diagonal matrix on non singularity, and give two examples at last.","PeriodicalId":103274,"journal":{"name":"2009 International Conference on Computer and Communications Security","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132585069","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 introduces improving rate and proposes the incremental mining algorithm with the weighted model for optimizing association rules based on CBA mining algorithm. The risk analysis of the strong association rules is proposed for trend forecasting. And the risk degree of the lost rules based on the incremental mining is also analyzed. Comparing with the traditional algorithm, the improved algorithm is fast, efficient in incremental data mining and can find trends in association rules. The decision making reliability is enhanced by the association rules obtained from the improved algorithm. The algorithm was used in bank cost analysis with test results showing that the prediction precision of the algorithm is better than that of the traditional algorithm.
{"title":"An Improved Incremental Mining Algorithm Based on Risk Analysis of the Association Rules for Bank Cost Analysis","authors":"Mei Chunguo, Mei Ying","doi":"10.1109/ICCCS.2009.35","DOIUrl":"https://doi.org/10.1109/ICCCS.2009.35","url":null,"abstract":"This paper introduces improving rate and proposes the incremental mining algorithm with the weighted model for optimizing association rules based on CBA mining algorithm. The risk analysis of the strong association rules is proposed for trend forecasting. And the risk degree of the lost rules based on the incremental mining is also analyzed. Comparing with the traditional algorithm, the improved algorithm is fast, efficient in incremental data mining and can find trends in association rules. The decision making reliability is enhanced by the association rules obtained from the improved algorithm. The algorithm was used in bank cost analysis with test results showing that the prediction precision of the algorithm is better than that of the traditional algorithm.","PeriodicalId":103274,"journal":{"name":"2009 International Conference on Computer and Communications Security","volume":"282 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114944524","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}
The aim of this paper is to investigate how the energies of Independent Components (ICs) of multichannel Local Field Potentials (LFPs) code a stimulus. In this research, 13-channel pre- and post-stimulus LFPs are decomposed into 13 ICs, the energies of which are computed in a 100-ms window. By sliding the window with a step of 25ms, a dynamic energy mapping of the 13 ICs is established. The results show that the energies of 3 ICs present step response at the onset of the stimulus, which indicates that the ICs’ energies of LFPs on the particular directions can code a stimulus.
{"title":"A Study on Coding Stimulus via Independent Components Energies of Multichannel Local Field Potentials","authors":"Duan Xufei, Mai Meifang, L. Baoming, Tian Xin","doi":"10.1109/ICCCS.2009.39","DOIUrl":"https://doi.org/10.1109/ICCCS.2009.39","url":null,"abstract":"The aim of this paper is to investigate how the energies of Independent Components (ICs) of multichannel Local Field Potentials (LFPs) code a stimulus. In this research, 13-channel pre- and post-stimulus LFPs are decomposed into 13 ICs, the energies of which are computed in a 100-ms window. By sliding the window with a step of 25ms, a dynamic energy mapping of the 13 ICs is established. The results show that the energies of 3 ICs present step response at the onset of the stimulus, which indicates that the ICs’ energies of LFPs on the particular directions can code a stimulus.","PeriodicalId":103274,"journal":{"name":"2009 International Conference on Computer and Communications Security","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122776605","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}
Enhancement and promotion of RFID technology, making RFID a growing range of application areas, for cost and technical considerations, the current RFID system, the security of information transmitted under consideration, for people to develop a variety of authentication protocol, for information security to a certain extent improved. However, the current authentication protocols are still some gaps, so we are considering the introduction of the existing authentication protocol chaotic algorithm, the plaintext information transmitted encrypted, thus increasing the RFID system's information security.
{"title":"Discussion of Chaos Algorithm Apply in RFID Authentication Protocol","authors":"Li Heng, Gao-lei Fei, Xue Yanming, F. Shuo","doi":"10.1109/ICCCS.2009.22","DOIUrl":"https://doi.org/10.1109/ICCCS.2009.22","url":null,"abstract":"Enhancement and promotion of RFID technology, making RFID a growing range of application areas, for cost and technical considerations, the current RFID system, the security of information transmitted under consideration, for people to develop a variety of authentication protocol, for information security to a certain extent improved. However, the current authentication protocols are still some gaps, so we are considering the introduction of the existing authentication protocol chaotic algorithm, the plaintext information transmitted encrypted, thus increasing the RFID system's information security.","PeriodicalId":103274,"journal":{"name":"2009 International Conference on Computer and Communications Security","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125819245","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}
Through the research and analysis of the intrusion detection techniques and data mining, this paper presents a intrusion detection model which is based on cluster analysis K-means algorithm.
通过对入侵检测技术和数据挖掘技术的研究和分析，提出了一种基于聚类分析k -均值算法的入侵检测模型。
{"title":"The Research of Intrusion Detection Model Based on Clustering Analysis","authors":"Liang Bo, Dong-Dong Jiang","doi":"10.1109/ICCCS.2009.40","DOIUrl":"https://doi.org/10.1109/ICCCS.2009.40","url":null,"abstract":"Through the research and analysis of the intrusion detection techniques and data mining, this paper presents a intrusion detection model which is based on cluster analysis K-means algorithm.","PeriodicalId":103274,"journal":{"name":"2009 International Conference on Computer and Communications Security","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117043295","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 describes the reasons of congestion in networks and the typical congestion control strategy briefly first, and then study on chaos characteristics of the internet traffic and discussion on causes. And then put forth a network congestion control strategy based on chaos theory which promises to open new avenues to network congestion control.
{"title":"Research on Congestion Control in Networks Based on Chaos Theory","authors":"Zhang Baojian, Zhu Kunhua","doi":"10.1109/ICCCS.2009.12","DOIUrl":"https://doi.org/10.1109/ICCCS.2009.12","url":null,"abstract":"This paper describes the reasons of congestion in networks and the typical congestion control strategy briefly first, and then study on chaos characteristics of the internet traffic and discussion on causes. And then put forth a network congestion control strategy based on chaos theory which promises to open new avenues to network congestion control.","PeriodicalId":103274,"journal":{"name":"2009 International Conference on Computer and Communications Security","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114344797","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}
The Elliptic Curve Cryptography (ECC) is widely deployed into embedded cryptographic devices. However, straightforward implementations of ECC are prone to side-channel analysis attacks. A number of countermeasures against side-channel analysis attacks exist with different effectiveness and efficiency. How to evaluate these countermeasures with a unified and quantitative criterion becomes a challenging task. This paper presents an evaluation criterion using the ratio between the security factor and the computational cost, to assess the efficiency and effectiveness of side-channel countermeasures. The security factor statistically measures the similarity between operations processing bit ‘0’ and those processing bit ‘1’. The computation cost measures the number of atomic operations in the scalar multiplication. Experiment results on smart cards with three different countermeasures demonstrate the feasibility of the proposed evaluation criterion.
{"title":"Evaluation Criterion of Side-Channel Countermeasures for Elliptic Curve Cryptography Devices","authors":"Tingding Chen, Huiyun Li, Keke Wu, Fengqi Yu","doi":"10.1109/ICCCS.2009.13","DOIUrl":"https://doi.org/10.1109/ICCCS.2009.13","url":null,"abstract":"The Elliptic Curve Cryptography (ECC) is widely deployed into embedded cryptographic devices. However, straightforward implementations of ECC are prone to side-channel analysis attacks. A number of countermeasures against side-channel analysis attacks exist with different effectiveness and efficiency. How to evaluate these countermeasures with a unified and quantitative criterion becomes a challenging task. This paper presents an evaluation criterion using the ratio between the security factor and the computational cost, to assess the efficiency and effectiveness of side-channel countermeasures. The security factor statistically measures the similarity between operations processing bit ‘0’ and those processing bit ‘1’. The computation cost measures the number of atomic operations in the scalar multiplication. Experiment results on smart cards with three different countermeasures demonstrate the feasibility of the proposed evaluation criterion.","PeriodicalId":103274,"journal":{"name":"2009 International Conference on Computer and Communications Security","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127854295","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}
To address the defect of the simplex digital signature in E-Commerce and E-Government, the paper presents a method of electronic seal based on the digital watermark technology. The method combines one-way hash function and digital watermarking, implements the tamper-proofing of electronic documents, anti-copy of e-seal and secure access control function, can effectively to meet the basic needs of electronic document and security requirements. This paper shows experimental results and the future direction of development.
{"title":"Electronic Seal Based on Hash Function and Digital Watermark","authors":"Li Bo, Li Wei","doi":"10.1109/ICCCS.2009.41","DOIUrl":"https://doi.org/10.1109/ICCCS.2009.41","url":null,"abstract":"To address the defect of the simplex digital signature in E-Commerce and E-Government, the paper presents a method of electronic seal based on the digital watermark technology. The method combines one-way hash function and digital watermarking, implements the tamper-proofing of electronic documents, anti-copy of e-seal and secure access control function, can effectively to meet the basic needs of electronic document and security requirements. This paper shows experimental results and the future direction of development.","PeriodicalId":103274,"journal":{"name":"2009 International Conference on Computer and Communications Security","volume":"259 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133450648","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 studies the relationship between amounts of new stockholders and share index in Chinese stock market. We analyze behavior characters of investors, construct a model to forecast the amounts based on polynomial fitness such as quintic, nine times’, eleven times’ polynomial fitness ordinally. Comparing with factual data, we apply polynomial simulation method to review the fitness of model, and confirm sensitivities of thedata. The result proves the validity of the simulation method.
{"title":"Polynomial Fitness Simulation of Chinese New Stockholders","authors":"Deng Wei, Shao Xiaoyi","doi":"10.1109/ICCCS.2009.48","DOIUrl":"https://doi.org/10.1109/ICCCS.2009.48","url":null,"abstract":"This paper studies the relationship between amounts of new stockholders and share index in Chinese stock market. We analyze behavior characters of investors, construct a model to forecast the amounts based on polynomial fitness such as quintic, nine times’, eleven times’ polynomial fitness ordinally. Comparing with factual data, we apply polynomial simulation method to review the fitness of model, and confirm sensitivities of thedata. The result proves the validity of the simulation method.","PeriodicalId":103274,"journal":{"name":"2009 International Conference on Computer and Communications Security","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129956412","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
扫码关注我们
求助内容：
应助结果提醒方式：