In this paper, we propose reliability adjustment weighted bit-flipping (RA-WBF) decoding algorithm for low density parity-check (LDPC) codes. By adjusting the reliability of received symbols during iterative decoding, the proposed algorithm can offer better tradeoff between performance, convergence speed and computational complexity. Furthermore, this improvement can easily be extended to other variations of weighted bit-flipping decoding algorithm and obtain noticeable improvement in error performance. Simulation results are shown to verify our conclusions.
{"title":"Reliability Adjustment Weighted Bit-Flipping Decoding for Low-Density Parity-Check Codes","authors":"S. Ding, Jiongcheng Li, Henghui Xiao, H. Huang","doi":"10.1109/CIS.2013.144","DOIUrl":"https://doi.org/10.1109/CIS.2013.144","url":null,"abstract":"In this paper, we propose reliability adjustment weighted bit-flipping (RA-WBF) decoding algorithm for low density parity-check (LDPC) codes. By adjusting the reliability of received symbols during iterative decoding, the proposed algorithm can offer better tradeoff between performance, convergence speed and computational complexity. Furthermore, this improvement can easily be extended to other variations of weighted bit-flipping decoding algorithm and obtain noticeable improvement in error performance. Simulation results are shown to verify our conclusions.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123937224","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 we propose a two-party certificate less authenticated key agreement scheme which has proven to be secure in the random oracle model. The new protocol is secure as long as each party has at least one uncompromised secret. In addition, the new protocol has higher efficiency than several other strongly secure key agreement protocols(such as Lippold[2], protocol[3], protocol[4]).
{"title":"A Two-Party Certificateless Authenticated Key Agreement Protocol with Provable Security","authors":"Liang Guiying, Hou Mengbo, Zhao Chuan, Xu Qiuliang","doi":"10.1109/CIS.2013.124","DOIUrl":"https://doi.org/10.1109/CIS.2013.124","url":null,"abstract":"In this paper we propose a two-party certificate less authenticated key agreement scheme which has proven to be secure in the random oracle model. The new protocol is secure as long as each party has at least one uncompromised secret. In addition, the new protocol has higher efficiency than several other strongly secure key agreement protocols(such as Lippold[2], protocol[3], protocol[4]).","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121491589","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}
Various business models of service-based enterprise exist and are currently used in industry, whilst their definitions, structures, functions, and supporting tools are quite different from each other. For interoperability, the partial semantic interoperability between heterogeneous business models is challenging to achieve. Almost all of the enterprise business models can be described from the four major dimensions: Role, Goal, Process, Service (RGPS), consequently in this paper, a business model of service-based enterprise is actually a specific RGPS model, an approach for measuring the interoperability of RGPS models is proposed. At first, the RGPS interoperability features framework is constructed based on Meta-model Framework of Interoperability (MFI), and it is specified to be the interoperability features set of RGPS models, secondly, the interoperability features set and a mathematical method are proposed to identify and quantify a RGPS model and its interoperability features, then the model instance of the RGPS model is produced, next, we calculate the similarity between two model instances, and obtain the measuring results of interoperability between corresponding RGPS models, which is used to build the interoperability measurement matrix of RGPS models set.
{"title":"MFI Based Interoperability Measurement of Business Models in Service-Based Enterprises","authors":"Zhao Li, Peng Liang, Yi Zhao, K. He","doi":"10.1109/CIS.2013.82","DOIUrl":"https://doi.org/10.1109/CIS.2013.82","url":null,"abstract":"Various business models of service-based enterprise exist and are currently used in industry, whilst their definitions, structures, functions, and supporting tools are quite different from each other. For interoperability, the partial semantic interoperability between heterogeneous business models is challenging to achieve. Almost all of the enterprise business models can be described from the four major dimensions: Role, Goal, Process, Service (RGPS), consequently in this paper, a business model of service-based enterprise is actually a specific RGPS model, an approach for measuring the interoperability of RGPS models is proposed. At first, the RGPS interoperability features framework is constructed based on Meta-model Framework of Interoperability (MFI), and it is specified to be the interoperability features set of RGPS models, secondly, the interoperability features set and a mathematical method are proposed to identify and quantify a RGPS model and its interoperability features, then the model instance of the RGPS model is produced, next, we calculate the similarity between two model instances, and obtain the measuring results of interoperability between corresponding RGPS models, which is used to build the interoperability measurement matrix of RGPS models set.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"213 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121625902","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}
Based on histogram shifting and histogram modification of difference images, this paper proposed a method of histogram shifting reversible data hiding by pixel pair's average predictions on gray images. Under the premise that the average remains changeless after each operation, embedding and extracting operations are completed, utilizing the difference histogram theory. Experimental results demonstrate that the proposed method can keep high image quality and high embedding capacity, and produce little auxiliary information. It is better than the comparative method with good performance.
{"title":"Improving Histogram Shifting Reversible Data Hiding by Pixel Pair's Average Predictions","authors":"Jiajia Zhang, Shuli Zheng, Donghui Hu, Yunling Zhang","doi":"10.1109/CIS.2013.121","DOIUrl":"https://doi.org/10.1109/CIS.2013.121","url":null,"abstract":"Based on histogram shifting and histogram modification of difference images, this paper proposed a method of histogram shifting reversible data hiding by pixel pair's average predictions on gray images. Under the premise that the average remains changeless after each operation, embedding and extracting operations are completed, utilizing the difference histogram theory. Experimental results demonstrate that the proposed method can keep high image quality and high embedding capacity, and produce little auxiliary information. It is better than the comparative method with good performance.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"127 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122130024","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 an important source of logistics demand, the manufacturing industry played a role as demand promoter for the logistics industry. At the same time the level and extent of the development of the logistics industry directly related to the efficiency and effectiveness of the manufacturing enterprise. It is the key to improve the core competitiveness of enterprises. Based on the data of Dongguan logistics and economic development from 1997 to 2011, this paper designs a grey correlation model and analyzes the correlation between manufacturing and logistics industry. The results showing that the Dongguan manufacturing and logistics industry has certain relevance, but have not yet form the benign linkage development mechanism.
{"title":"Analysis on the Grey Correlation between Manufacturing and Logistics Industry in Dongguan","authors":"Wang Xing, Li Wei","doi":"10.1109/CIS.2013.179","DOIUrl":"https://doi.org/10.1109/CIS.2013.179","url":null,"abstract":"As an important source of logistics demand, the manufacturing industry played a role as demand promoter for the logistics industry. At the same time the level and extent of the development of the logistics industry directly related to the efficiency and effectiveness of the manufacturing enterprise. It is the key to improve the core competitiveness of enterprises. Based on the data of Dongguan logistics and economic development from 1997 to 2011, this paper designs a grey correlation model and analyzes the correlation between manufacturing and logistics industry. The results showing that the Dongguan manufacturing and logistics industry has certain relevance, but have not yet form the benign linkage development mechanism.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116664751","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}
Password-based authenticated key exchange (PAKE) is applied widely in modern communication because that password is easy to be remembered and system has good scalability. But most of the existing PAKE protocol cannot meet the proposed security attribute. In this paper, we propose a strongly password-based three-party authenticated key exchange (3PAKE) protocol based on the Diffie-Hellman key exchange idea and a one-way hash function, and give a variant. At last, we show the proposed protocol is secure and it can meet a series of security attributes.
{"title":"Strongly Password-Based Three-Party Authenticated Key Exchange Protocol","authors":"Yuanhui Lin, Mengbo Hou, Qiuliang Xu","doi":"10.1109/CIS.2013.123","DOIUrl":"https://doi.org/10.1109/CIS.2013.123","url":null,"abstract":"Password-based authenticated key exchange (PAKE) is applied widely in modern communication because that password is easy to be remembered and system has good scalability. But most of the existing PAKE protocol cannot meet the proposed security attribute. In this paper, we propose a strongly password-based three-party authenticated key exchange (3PAKE) protocol based on the Diffie-Hellman key exchange idea and a one-way hash function, and give a variant. At last, we show the proposed protocol is secure and it can meet a series of security attributes.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115448029","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 new model of time division duplex long term evolution (TD-LTE) system considering crossed time slot (CTS) interference is proposed in this paper because CTS interference may greatly affect system performance. An improved quantum evolutionary algorithm (QEA) is put forward to solve the model efficiently. The proposed QEA enhances the global search capability and has a good convergence due to the increase of a mutation operator based on controlled-not gate. Simulation experiment shows that the proposed QEA is effective to solve the problem.
{"title":"Dynamic Resource Allocation of TD-LTE System Based on Improved Quantum Evolutionary Algorithm","authors":"Hong-Chao Yan, Hai-Lin Liu, Qiang Wang","doi":"10.1109/CIS.2013.13","DOIUrl":"https://doi.org/10.1109/CIS.2013.13","url":null,"abstract":"A new model of time division duplex long term evolution (TD-LTE) system considering crossed time slot (CTS) interference is proposed in this paper because CTS interference may greatly affect system performance. An improved quantum evolutionary algorithm (QEA) is put forward to solve the model efficiently. The proposed QEA enhances the global search capability and has a good convergence due to the increase of a mutation operator based on controlled-not gate. Simulation experiment shows that the proposed QEA is effective to solve the problem.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122851348","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}
Vehicle tracking is an important part in intelligent transportation surveillance. But now vehicle tracking faces with the problems such as scale change, the interference of similar color, low resolution video data and so on. In this paper an improved Markov chain Monte Carlo(MCMC) named optical flow MCMC(OF-MCMC) sampling tracking algorithm is proposed for vehicle tracking. First, we use the optical flow method to get the moving direction of the vehicle in initial frames, which can solve the problem of scale change, what's more the optical flow method can get the moving speed of the vehicle which replaces the second-order autoregressive motion model owing to the non-parameter characteristic. Second, when calculating whether one particle is accepted or not, a distance factor is considered, which can relieve the interference of similar vehicle nearby. Finally, to deal with vehicle tracking in low resolution of the video data, we generate a more accurate feature template with different features weighted to get better tracking results. Experimental results show that the proposed tracking algorithm has better performance than some traditional ones.
{"title":"Optical Flow Based Urban Road Vehicle Tracking","authors":"Ya Liu, Yao Lu, Qingxuan Shi, Jianhua Ding","doi":"10.1109/CIS.2013.89","DOIUrl":"https://doi.org/10.1109/CIS.2013.89","url":null,"abstract":"Vehicle tracking is an important part in intelligent transportation surveillance. But now vehicle tracking faces with the problems such as scale change, the interference of similar color, low resolution video data and so on. In this paper an improved Markov chain Monte Carlo(MCMC) named optical flow MCMC(OF-MCMC) sampling tracking algorithm is proposed for vehicle tracking. First, we use the optical flow method to get the moving direction of the vehicle in initial frames, which can solve the problem of scale change, what's more the optical flow method can get the moving speed of the vehicle which replaces the second-order autoregressive motion model owing to the non-parameter characteristic. Second, when calculating whether one particle is accepted or not, a distance factor is considered, which can relieve the interference of similar vehicle nearby. Finally, to deal with vehicle tracking in low resolution of the video data, we generate a more accurate feature template with different features weighted to get better tracking results. Experimental results show that the proposed tracking algorithm has better performance than some traditional ones.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123155466","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}
Computing distributional similarity is an effective strategy for finding synonyms. The time complexity of the naive nearest-neighbor approach of computing distributional word similarity is O(n*n*m), it is inefficient for accurately representing synonymy using large corpus. We find a parse property of triple that the growth rate of average triples number of each word leveled off as corpus's size increases. Using this property we design a fast algorithm for computing word similarity whose time complexity is O(n*n). We demonstrate the efficiency of this algorithm based on the English Gig word corpus.
{"title":"A Fast Algorithm of Computing Word Similarity","authors":"Xingyuan Chen, Xia Yang, Bingjun Su","doi":"10.1109/CIS.2013.92","DOIUrl":"https://doi.org/10.1109/CIS.2013.92","url":null,"abstract":"Computing distributional similarity is an effective strategy for finding synonyms. The time complexity of the naive nearest-neighbor approach of computing distributional word similarity is O(n*n*m), it is inefficient for accurately representing synonymy using large corpus. We find a parse property of triple that the growth rate of average triples number of each word leveled off as corpus's size increases. Using this property we design a fast algorithm for computing word similarity whose time complexity is O(n*n). We demonstrate the efficiency of this algorithm based on the English Gig word corpus.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123186457","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}
Although many theoretical methods were developed to price various derivatives, pricing deviation still remains very high. This paper provides a pragmatical option pricing method by combining skew ness and kurtosis adjusted Black-Scholes model of Corrado and Su, time series analysis and Artificial Neural Network (ANN). The empirical tests in FTSE 100 Index options show that pricing deviation calculated by adjusted Black-Scholes model is still high. After the model is modified by time series analysis and ANN methods, the pricing deviation is reduced, which is much smaller than the previous models. It is suggested that time series analysis and Artificial Neural Network methods can be used in the pragmatical work to make the pricing more fast and precise.
{"title":"A Pragmatical Option Pricing Method Combining Black-Scholes Formula, Time Series Analysis and Artificial Neural Network","authors":"Kai Liu, Xiao Wang","doi":"10.1109/CIS.2013.38","DOIUrl":"https://doi.org/10.1109/CIS.2013.38","url":null,"abstract":"Although many theoretical methods were developed to price various derivatives, pricing deviation still remains very high. This paper provides a pragmatical option pricing method by combining skew ness and kurtosis adjusted Black-Scholes model of Corrado and Su, time series analysis and Artificial Neural Network (ANN). The empirical tests in FTSE 100 Index options show that pricing deviation calculated by adjusted Black-Scholes model is still high. After the model is modified by time series analysis and ANN methods, the pricing deviation is reduced, which is much smaller than the previous models. It is suggested that time series analysis and Artificial Neural Network methods can be used in the pragmatical work to make the pricing more fast and precise.","PeriodicalId":294223,"journal":{"name":"2013 Ninth International Conference on Computational Intelligence and Security","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125270931","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
扫码关注我们
求助内容：
应助结果提醒方式：