发布求助
文献互助 智能选刊 最新文献

2010 International Conference on Computational Intelligence and Security最新文献

筛选
英文 中文
Research on Game Algorithm for Zhang Chess 张棋博弈算法研究
2010 International Conference on Computational Intelligence and Security Pub Date : 2010-12-11 DOI: 10.1109/CIS.2010.141
Zhenzhen Zhang, Defu Zhang
{"title":"Research on Game Algorithm for Zhang Chess","authors":"Zhenzhen Zhang, Defu Zhang","doi":"10.1109/CIS.2010.141","DOIUrl":"https://doi.org/10.1109/CIS.2010.141","url":null,"abstract":"The Zhang Chess is a newly designed two-person game based on the combination of numbers. The rules of this game are simple and easy to learn. This game is helpful for people to improve the numeracy, thus to develop the intelligence. So far, there is only one research work about this game. This paper first presents a game algorithm for the Zhang Chess. The algorithm is based on the alpha-beta search incorporating the properties of this game, and memorization technology is used to preserve the searched state to improve the efficiency of search. The experimental results show that the proposed game algorithm is efficient, and it is hard for people to defeat the computer based on the presented game algorithm.","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125014242","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}
引用次数: 0
On the Reliability of Unicyclic Networks with Vertex Failure 具有顶点失效的单环网络的可靠性
2010 International Conference on Computational Intelligence and Security Pub Date : 2010-12-11 DOI: 10.1109/CIS.2010.115
Zhanlan Li
{"title":"On the Reliability of Unicyclic Networks with Vertex Failure","authors":"Zhanlan Li","doi":"10.1109/CIS.2010.115","DOIUrl":"https://doi.org/10.1109/CIS.2010.115","url":null,"abstract":"For a graph $G$ with perfectly reliable edges and unreliable vertices, we consider the reliability of $G$ for which vertices fail independently of each other with a constant probability $p$. The reliability of graph $G$, denoted by $P_n(G,p)$, is defined to be the probability that the induced sub graphs of surviving vertices connected. Denote by $Omega(n,m)$ the family of connected graphs with $n$ vertices and $m$ edges. In this paper, we determine the optimal value of each coefficient of $R_n(G, p)$ and the corresponding graphs for $Gin Omega(n,n+1)$ and $nge 6$. As a byproduct, we give the locally optimal graphs in $Omega(n, n + 1)$, for $n ge 8$.","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127556365","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}
引用次数: 0
A Novel Hybrid Particle Swarm Optimization for Feature Selection and Kernel Optimization in Support Vector Regression 一种新的混合粒子群算法用于支持向量回归的特征选择和核优化
2010 International Conference on Computational Intelligence and Security Pub Date : 2010-12-11 DOI: 10.1109/CIS.2010.47
Jiansheng Wu, Enhong Chen
{"title":"A Novel Hybrid Particle Swarm Optimization for Feature Selection and Kernel Optimization in Support Vector Regression","authors":"Jiansheng Wu, Enhong Chen","doi":"10.1109/CIS.2010.47","DOIUrl":"https://doi.org/10.1109/CIS.2010.47","url":null,"abstract":"This study proposed a novel HPSO-SVR model that hybridized the particle swarm optimization (PSO) and support vector regression (SVR) to improve the regression accuracy based on the type of kernel function and kernel parameter value optimization with a small and appropriate feature subset, which is then applied to forecast the monthly rainfall. This optimization mechanism combined the discrete PSO with the continuous-valued PSO to simultaneously optimize the input feature subset selection, the type of kernel function and the kernel parameter setting of SVR. The proposed model was tested at monthly rainfall forecasting in Guangxi, China. The results showed that the new HPSO-SVR model outperforms the previous models. Specifically, the new HPSO-SVR model can correctly select the discriminating input features, also successfully identify the optimal type of kernel function and all the optimal values of the parameters of SVR with the lowest prediction error values in rainfall forecasting.","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127471227","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}
引用次数: 8
Tripartite Key Agreement Protocols Based on Digital Certification 基于数字认证的三方密钥协议
2010 International Conference on Computational Intelligence and Security Pub Date : 2010-12-11 DOI: 10.1109/CIS.2010.83
Junbing Li, Wei Ji
{"title":"Tripartite Key Agreement Protocols Based on Digital Certification","authors":"Junbing Li, Wei Ji","doi":"10.1109/CIS.2010.83","DOIUrl":"https://doi.org/10.1109/CIS.2010.83","url":null,"abstract":"This paper first introduces the characteristic set of tripartite key agreement protocols. Then the relationship between the characteristic set and the security of a tripartite key agreement protocol is discussed. Because all present tripartite key agreement protocols are insecure, new protocols based on digital certification are proposed. The security and efficiency of the new protocols are discussed.","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125892585","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}
引用次数: 0
New Results on H∞ Filter Design for Continue-Time Systems with Time-Varying Delay 时变时滞连续系统H∞滤波器设计的新结果
2010 International Conference on Computational Intelligence and Security Pub Date : 2010-12-11 DOI: 10.1109/CIS.2010.12
Yating Wang, Wuneng Zhou, Jinliang Liu, Da-Yong Luo
{"title":"New Results on H∞ Filter Design for Continue-Time Systems with Time-Varying Delay","authors":"Yating Wang, Wuneng Zhou, Jinliang Liu, Da-Yong Luo","doi":"10.1109/CIS.2010.12","DOIUrl":"https://doi.org/10.1109/CIS.2010.12","url":null,"abstract":"This paper proposes a class of H∞ filter design for continue-time systems with time-varying delay. By using the Lyapunov functional function approach, some delay-dependent stability conditions can be obtained for the asymptotical stability of the H∞ filter systems, which are expressed as a set of Linear Matrix Inequalities (LMIs). Finally, a numerical example is given to demonstrate the effectiveness and the merit of the proposed method.","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"153 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121616407","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}
引用次数: 0
Automatic Speech Corpus Construction from Broadcasting Speech Databases 基于广播语音数据库的自动语音语料库构建
2010 International Conference on Computational Intelligence and Security Pub Date : 2010-12-11 DOI: 10.1109/CIS.2010.145
Wei Zhang, R. Du, Minhui Pang, Qiuhong Wang
{"title":"Automatic Speech Corpus Construction from Broadcasting Speech Databases","authors":"Wei Zhang, R. Du, Minhui Pang, Qiuhong Wang","doi":"10.1109/CIS.2010.145","DOIUrl":"https://doi.org/10.1109/CIS.2010.145","url":null,"abstract":"The speech corpus often needs to be constructed frequently for the diversified speech synthesis. This paper discusses our efforts on construction of speech corpus automatically from broadcasting speech databases for trainable Text-To-Speech (TTS) system. We present a new framework of automatic speech corpus construction from broadcasting speech databases. We select the clean speech audios from the broadcasting audios with a music detector which is based on speech/music discrimination. An automatic speech sentence segmentation system is used to generate the sentence database from the clean speech audios. At last, a text corpus construction method selects appropriate sentences speech which is maximizing the coverage of the sentence database’s diphones. Experiments show that our method can generate a good speech corpus rapidly with minimum manual intervention.","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121959379","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}
引用次数: 3
Game-Based Analysis and Improvement of a Fair Contract Signing Protocol 基于博弈的公平合同签订协议分析与改进
2010 International Conference on Computational Intelligence and Security Pub Date : 2010-12-11 DOI: 10.1109/CIS.2010.76
Xueming Wang, L. Weng
{"title":"Game-Based Analysis and Improvement of a Fair Contract Signing Protocol","authors":"Xueming Wang, L. Weng","doi":"10.1109/CIS.2010.76","DOIUrl":"https://doi.org/10.1109/CIS.2010.76","url":null,"abstract":"Traditional temporal logic regards protocols as close system to analyze. In order to overcome the shortcoming of traditional temporal logic, an game-based analysis method is inducted. This method is applied to formal analyze a fair contract signing protocol, and then some defects of the protocol are found. An improvement protocol is proposed which fixes the flaw by adding some extra time limit information and an abort sub-protocol. The fairness and the timeliness of the improvement protocol are validated by ATL formula and Invariant Checking. It is found that the improvement protocol satisfies the timeliness and the fairness.","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128241494","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}
引用次数: 1
A Revised Discrete Particle Swarm Optimization for Cloud Workflow Scheduling 一种改进的离散粒子群算法用于云工作流调度
2010 International Conference on Computational Intelligence and Security Pub Date : 2010-12-11 DOI: 10.1109/CIS.2010.46
Zhangjun Wu, Zhiwei Ni, Lichuan Gu, Xiao Liu
{"title":"A Revised Discrete Particle Swarm Optimization for Cloud Workflow Scheduling","authors":"Zhangjun Wu, Zhiwei Ni, Lichuan Gu, Xiao Liu","doi":"10.1109/CIS.2010.46","DOIUrl":"https://doi.org/10.1109/CIS.2010.46","url":null,"abstract":"A cloud workflow system is a type of platform service which facilitates the automation of distributed applications based on the novel cloud infrastructure. Compared with grid environment, data transfer is a big overhead for cloud workflows due to the market-oriented business model in the cloud environments. In this paper, a Revised Discrete Particle Swarm Optimization (RDPSO) is proposed to schedule applications among cloud services that takes both data transmission cost and computation cost into account. Experiment is conducted with a set of workflow applications by varying their data communication costs and computation costs according to a cloud price model. Comparison is made on make span and cost optimization ratio and the cost savings with RDPSO, the standard PSO and BRS (Best Resource Selection) algorithm. Experimental results show that the proposed RDPSO algorithm can achieve much more cost savings and better performance on make span and cost optimization.","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114731240","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}
引用次数: 242
Security Flaws and Improvements to a Direct Anonymous Attestation Scheme for Mobile Computing Platforms 移动计算平台直接匿名认证方案的安全缺陷与改进
2010 International Conference on Computational Intelligence and Security Pub Date : 2010-12-11 DOI: 10.1109/CIS.2010.78
Li Yang, Jianfeng Ma, Junwei Zhang
{"title":"Security Flaws and Improvements to a Direct Anonymous Attestation Scheme for Mobile Computing Platforms","authors":"Li Yang, Jianfeng Ma, Junwei Zhang","doi":"10.1109/CIS.2010.78","DOIUrl":"https://doi.org/10.1109/CIS.2010.78","url":null,"abstract":"The security flaws of a direct anonymous attestation scheme proposed by He et al. was analyzed, and the result shows that the authentication protocol of the scheme is vulnerable to reply attacks and platform masquerading attacks when being used for remote attestation. An improved direct anonymous attestation authentication scheme with the involvement of key agreement was proposed to provide the property of mutual authentication. The analysis shows that our proposal can realize direct anonymous attestation with the properties of forgery-resistance and anonymity, and resist reply attacks and platform masquerading attacks, the scheme is effective and suitable for the mobile trusted computing platforms.","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126561315","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}
引用次数: 1
Research of Signal Frequency Domain Resolution Based-EMD 基于emd的信号频域分辨率研究
2010 International Conference on Computational Intelligence and Security Pub Date : 2010-12-11 DOI: 10.1109/CIS.2010.151
Meng Hou, Zeng-li Liu, Haiyan Quan, Yong-de Zhang
{"title":"Research of Signal Frequency Domain Resolution Based-EMD","authors":"Meng Hou, Zeng-li Liu, Haiyan Quan, Yong-de Zhang","doi":"10.1109/CIS.2010.151","DOIUrl":"https://doi.org/10.1109/CIS.2010.151","url":null,"abstract":"Empirical Mode Decomposition (EMD) is an effective, non-linear and non-stationary data analysis method, which can decompose the original signal into several intrinsic mode functions(IMFs). However the frequency resolution of EMD has not been thoroughly investigated so far. In this paper a signal which contains two different frequency components was do composed with EMD, and subsequently the obtained IMFs was compared to evaluate the frequency resolution of EMD.","PeriodicalId":420515,"journal":{"name":"2010 International Conference on Computational Intelligence and Security","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126569855","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}
引用次数: 6
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信