Pub Date : 2010-12-01DOI: 10.1109/PIC.2010.5687583
Dazu Huang, Jianquan Xie, Ying Guo
An fast channel polarization is proposed to construct code sequences as an idea splitting input channels to increase the cutoff rate. The proposed code sequences related to the recursive construction of Reed-Muller code (RM) on the basis of the matrix G2n, can achieve the symmetric capacity of arbitrary binary-input discrete memoryless channels under a low complexity successive cancellation decoding strategy. Based on this polar code sequences, we characterize the exponent of any given square matrix O2 and derive upper and lower bounds on achievable exponents. The proposed polarization scheme can be decoded with a belief propagation (BP) decoder, which render the scheme analytically tractable and provide powerful low-complexity coding algorithm.
{"title":"Fast polarization construction on binary discrete memoryless channels","authors":"Dazu Huang, Jianquan Xie, Ying Guo","doi":"10.1109/PIC.2010.5687583","DOIUrl":"https://doi.org/10.1109/PIC.2010.5687583","url":null,"abstract":"An fast channel polarization is proposed to construct code sequences as an idea splitting input channels to increase the cutoff rate. The proposed code sequences related to the recursive construction of Reed-Muller code (RM) on the basis of the matrix G2n, can achieve the symmetric capacity of arbitrary binary-input discrete memoryless channels under a low complexity successive cancellation decoding strategy. Based on this polar code sequences, we characterize the exponent of any given square matrix O2 and derive upper and lower bounds on achievable exponents. The proposed polarization scheme can be decoded with a belief propagation (BP) decoder, which render the scheme analytically tractable and provide powerful low-complexity coding algorithm.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117333795","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}
Pub Date : 2010-12-01DOI: 10.1109/PIC.2010.5687878
Yamin Yang, Chaoli Wang, Y. Sun
For non-independent speech recognition, in order to solve the problem of the assumption that the observation vectors are independent and the amount of data is small in Hidden Markov Model, a weighted autoregressive Hidden Markov Model was presented based on the Continuous Hidden Markov Model in this paper. The weighted autoregressive process was exploited to extract the observation vector, which is more suitable for recognition of the actual voice signals with strong random characteristic.
{"title":"Speech recognition method based on weighed autoregressive HMM","authors":"Yamin Yang, Chaoli Wang, Y. Sun","doi":"10.1109/PIC.2010.5687878","DOIUrl":"https://doi.org/10.1109/PIC.2010.5687878","url":null,"abstract":"For non-independent speech recognition, in order to solve the problem of the assumption that the observation vectors are independent and the amount of data is small in Hidden Markov Model, a weighted autoregressive Hidden Markov Model was presented based on the Continuous Hidden Markov Model in this paper. The weighted autoregressive process was exploited to extract the observation vector, which is more suitable for recognition of the actual voice signals with strong random characteristic.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123507213","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}
Pub Date : 2010-12-01DOI: 10.1109/PIC.2010.5687584
Chungen Xu, Yanjiong Yang
Authentication and key exchange are fundamental for establishing secure communication channels over public insecure networks. Three-party key exchange protocol is an important technique for two clients to agree a session key with the help of a trusted server who shares a human password with each client. Many protocols have been proposed for the requirements of security and efficiency over the years. For security consideration, we are concerned with the off-line password-guessing attack. We make the attack to a three-party key exchange protocol based on Elliptic Curve Discrete Logarithm Problem(ECDLP) and show that it is vulnerable against the off-line password-guessing attack. In fact, the off-line password-guessing attack is available for malicious participants and is effective to similar protocols. To avoid this problem, we give a suggestion to eliminate it and enforce the security.
{"title":"Password guessing attack on a key exchange protocol based on ECDLP","authors":"Chungen Xu, Yanjiong Yang","doi":"10.1109/PIC.2010.5687584","DOIUrl":"https://doi.org/10.1109/PIC.2010.5687584","url":null,"abstract":"Authentication and key exchange are fundamental for establishing secure communication channels over public insecure networks. Three-party key exchange protocol is an important technique for two clients to agree a session key with the help of a trusted server who shares a human password with each client. Many protocols have been proposed for the requirements of security and efficiency over the years. For security consideration, we are concerned with the off-line password-guessing attack. We make the attack to a three-party key exchange protocol based on Elliptic Curve Discrete Logarithm Problem(ECDLP) and show that it is vulnerable against the off-line password-guessing attack. In fact, the off-line password-guessing attack is available for malicious participants and is effective to similar protocols. To avoid this problem, we give a suggestion to eliminate it and enforce the security.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":"30 15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123639634","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}
Pub Date : 2010-12-01DOI: 10.1109/PIC.2010.5687582
Jianbin Zhang, Zhongning Jia
Wireless Sensor Networks (WSN) is a key technology of Internet of Things (IOT). WSN node is commonly powered by battery. However, battery capacity is limited, which affects the overall performance of WSN. The technology of environmental energy harvesting is presented for power supply of WSN node in this paper. Specifically, the basic voltage doubling rectifier circuit is analyzed, then the microwave voltage doubling rectifier circuit is derived in UHF band, and its main components and parameters are analyzed in detail. Lastly, the four-stages voltage doubling rectifier circuit of 900NHz is designed and simulated using ADS software. The simulation results indicated that the design scheme of voltage doubling rectifier circuit is correct and feasible.
{"title":"Design of voltage doubling rectifier circuit in Wireless Sensor Networks","authors":"Jianbin Zhang, Zhongning Jia","doi":"10.1109/PIC.2010.5687582","DOIUrl":"https://doi.org/10.1109/PIC.2010.5687582","url":null,"abstract":"Wireless Sensor Networks (WSN) is a key technology of Internet of Things (IOT). WSN node is commonly powered by battery. However, battery capacity is limited, which affects the overall performance of WSN. The technology of environmental energy harvesting is presented for power supply of WSN node in this paper. Specifically, the basic voltage doubling rectifier circuit is analyzed, then the microwave voltage doubling rectifier circuit is derived in UHF band, and its main components and parameters are analyzed in detail. Lastly, the four-stages voltage doubling rectifier circuit of 900NHz is designed and simulated using ADS software. The simulation results indicated that the design scheme of voltage doubling rectifier circuit is correct and feasible.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128361157","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}
Pub Date : 2010-12-01DOI: 10.1109/PIC.2010.5687987
Chao Liu, Zhengming Li, Wenjuan Li
The Distributed Coordination Function (DCF) in the IEEE 802.11 protocol is a random access scheme based on the carrier sense multiple access with collision avoidance (CSMA/CA). In recent years, there have been numerous research on the performance analysis and model of DCF under the assumption that the transmission queue is always nonempty (i.e. saturation state). In this paper, we propose a dynamic priority back-up algorithm (DPBA) for IEEE802.11 DCF, the basic idea of DPBA is each node should collect statistical data of other node's transmission while sensing the channel, and maintaining a sending data table for all node in network. When the node has data to transmit, it will calculate the dynamic priority and connection window according to the number of successful sending, the number of successful sending and the statistical data in sending table. Simulation results show that DPBA can properly assign channel among nodes in proportion to their dynamic priority as well as enhance the network saturation throughput.
IEEE 802.11协议中的分布式协调函数(Distributed Coordination Function, DCF)是一种基于CSMA/CA (carrier - sense multiple access with collision avoidance)的随机接入方案。近年来，在假设传输队列总是非空(即饱和状态)的情况下，对DCF的性能分析和模型进行了大量的研究。本文针对IEEE802.11 DCF提出了一种动态优先级备份算法(dynamic priority backup algorithm, DPBA)， DPBA的基本思想是每个节点在感知信道的同时收集其他节点的传输统计数据，并维护网络中所有节点的发送数据表。当节点有数据需要传输时，根据发送成功次数、发送成功次数和发送表中的统计数据计算动态优先级和连接窗口。仿真结果表明，DPBA可以根据节点的动态优先级在节点间合理分配信道，提高网络饱和吞吐量。
{"title":"Dynamic priority back-up algorithm based on IEEE802.11 DCF","authors":"Chao Liu, Zhengming Li, Wenjuan Li","doi":"10.1109/PIC.2010.5687987","DOIUrl":"https://doi.org/10.1109/PIC.2010.5687987","url":null,"abstract":"The Distributed Coordination Function (DCF) in the IEEE 802.11 protocol is a random access scheme based on the carrier sense multiple access with collision avoidance (CSMA/CA). In recent years, there have been numerous research on the performance analysis and model of DCF under the assumption that the transmission queue is always nonempty (i.e. saturation state). In this paper, we propose a dynamic priority back-up algorithm (DPBA) for IEEE802.11 DCF, the basic idea of DPBA is each node should collect statistical data of other node's transmission while sensing the channel, and maintaining a sending data table for all node in network. When the node has data to transmit, it will calculate the dynamic priority and connection window according to the number of successful sending, the number of successful sending and the statistical data in sending table. Simulation results show that DPBA can properly assign channel among nodes in proportion to their dynamic priority as well as enhance the network saturation throughput.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128690624","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}
Pub Date : 2010-12-01DOI: 10.1109/PIC.2010.5687587
W. Chen, Gerhard P. Hancke, K. Mayes, Y. Lien, J. Chiu
The increasing technical capabilities of mobile phones have resulted in several m-payment methods being proposed. M-payment applications are being developed for both online and in-store purchases. Near Field Communication (NFC) technology has the potential to greatly impact the way mobile devices are used. NFC is a short range wireless communication interface that allows for the integration of a mobile device in existing contactless application infrastructure, such as using a mobile phone to pay at Point-of-Sale (POS). It is important to provide a simple method for implementing m-payment systems that offer both reasonable security protection as well as ease of use for the user. We propose a system that combines the existing 3G cryptographic primitives and algorithms, in addition to the identification and authentication capabilities of the USIM, with NFC technology to implement a m-payment system. Such a system could easily be integrated into current 3G infrastructure and provide improved scalability and ubiquity for m-payment services. Our proposed scheme focuses on a conventional in-store payment environment, with mutual authentication between entities and a subsequent trustworthy transaction being achieved through 3G and USIM security services.
{"title":"Using 3G network components to enable NFC mobile transactions and authentication","authors":"W. Chen, Gerhard P. Hancke, K. Mayes, Y. Lien, J. Chiu","doi":"10.1109/PIC.2010.5687587","DOIUrl":"https://doi.org/10.1109/PIC.2010.5687587","url":null,"abstract":"The increasing technical capabilities of mobile phones have resulted in several m-payment methods being proposed. M-payment applications are being developed for both online and in-store purchases. Near Field Communication (NFC) technology has the potential to greatly impact the way mobile devices are used. NFC is a short range wireless communication interface that allows for the integration of a mobile device in existing contactless application infrastructure, such as using a mobile phone to pay at Point-of-Sale (POS). It is important to provide a simple method for implementing m-payment systems that offer both reasonable security protection as well as ease of use for the user. We propose a system that combines the existing 3G cryptographic primitives and algorithms, in addition to the identification and authentication capabilities of the USIM, with NFC technology to implement a m-payment system. Such a system could easily be integrated into current 3G infrastructure and provide improved scalability and ubiquity for m-payment services. Our proposed scheme focuses on a conventional in-store payment environment, with mutual authentication between entities and a subsequent trustworthy transaction being achieved through 3G and USIM security services.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129377433","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}
Pub Date : 2010-12-01DOI: 10.1109/PIC.2010.5688017
A. Al-Soud, K. Nakata
Investigating e-government Web-based services and evaluating its development has become one of the evolving research areas in the information systems field. After a decade of launching the e-government program in Jordan, we examined thirty governmental Websites in terms of their accessibility, usability, transparency, and responsiveness to citizens' request. This study found that the majority of the Websites are still in the early stages of development, and there is a noticeable lack in Websites readiness for moving-up to the advanced level fundamental for providing transactional services. Based on the evaluation results and through a manual testing, it was found the majority of the Websites do not employ the same design, where there should be consistent and should be using the same standards and features.
{"title":"Evaluating e-government websites in Jordan: Accessibility, usability, transparency and responsiveness","authors":"A. Al-Soud, K. Nakata","doi":"10.1109/PIC.2010.5688017","DOIUrl":"https://doi.org/10.1109/PIC.2010.5688017","url":null,"abstract":"Investigating e-government Web-based services and evaluating its development has become one of the evolving research areas in the information systems field. After a decade of launching the e-government program in Jordan, we examined thirty governmental Websites in terms of their accessibility, usability, transparency, and responsiveness to citizens' request. This study found that the majority of the Websites are still in the early stages of development, and there is a noticeable lack in Websites readiness for moving-up to the advanced level fundamental for providing transactional services. Based on the evaluation results and through a manual testing, it was found the majority of the Websites do not employ the same design, where there should be consistent and should be using the same standards and features.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130979769","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}
Pub Date : 2010-12-01DOI: 10.1109/PIC.2010.5687857
Haitao Ma, Changyong Yu, Miao Fang
Data exchange is the problem of finding an instance of a target schema, given an instance of a source schema and a specification of the relationship between the source and the target. In this paper, we look into the basic properties of XML data exchange in the presence of probabilistic data. This requires rethinking the very basic concepts of traditional XML data exchange, such as solution, universal solution, and certain answers of target queries. We develop a framework for XML data exchange over probabilistic XML documents, and give a polynomial-time materializing algorithm that computes target probabilistic documents.
{"title":"Probabilistic XML data exchange: An algorithm for materializing probabilistic solutions","authors":"Haitao Ma, Changyong Yu, Miao Fang","doi":"10.1109/PIC.2010.5687857","DOIUrl":"https://doi.org/10.1109/PIC.2010.5687857","url":null,"abstract":"Data exchange is the problem of finding an instance of a target schema, given an instance of a source schema and a specification of the relationship between the source and the target. In this paper, we look into the basic properties of XML data exchange in the presence of probabilistic data. This requires rethinking the very basic concepts of traditional XML data exchange, such as solution, universal solution, and certain answers of target queries. We develop a framework for XML data exchange over probabilistic XML documents, and give a polynomial-time materializing algorithm that computes target probabilistic documents.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127875571","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}
Pub Date : 2010-12-01DOI: 10.1109/PIC.2010.5687916
Shuli Zhao
Ever since its invention, the computer, by virtue of its multimedia capacity and its subsequent network technology, has been widely employed in language teaching and learning. During the process, computer technology has gradually changed its “subsidiary” position to play increasingly significant roles in language education. In the meantime, people are beginning to look at the relationship between language teaching and language learning with fresh new eyes. All these have enriched the theories of modern educational psychology, and given great impetus to the development of theories and applications of language teaching and learning.
{"title":"The evolution of computerized language teaching and learning: A terminological analysis","authors":"Shuli Zhao","doi":"10.1109/PIC.2010.5687916","DOIUrl":"https://doi.org/10.1109/PIC.2010.5687916","url":null,"abstract":"Ever since its invention, the computer, by virtue of its multimedia capacity and its subsequent network technology, has been widely employed in language teaching and learning. During the process, computer technology has gradually changed its “subsidiary” position to play increasingly significant roles in language education. In the meantime, people are beginning to look at the relationship between language teaching and language learning with fresh new eyes. All these have enriched the theories of modern educational psychology, and given great impetus to the development of theories and applications of language teaching and learning.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131330702","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}
Logistics industry is becoming a more and more important field needed to be concentrated for all kinds of enterprises to reduce their own operation cost, and shorten their delivery time and so on. How to change the complicated logistics problem into abstract network model is elucidated here. Firstly, a directed graph G = (V, E) is used to describe the general logistics problem with some common restrictions such as cost and time etc. Secondly, considering the growth of logistics node, an improved network transport model was set forth. Thirdly, the combination of ant colony arithmetic with logistics network transport model is expounded, based on the similarity between logistics network transport model and Travelling Salesman Problem. Finally, the solution and analysis for the improved model is illustrated according to the ant colony arithmetic, and some related conclusions are detailed.
{"title":"Research on a kind of improved network transport model and its application in logistics industry","authors":"Renwang Li, Xinli Wu, Donglong Li, Hao Luo, Sirong Zhang","doi":"10.1109/PIC.2010.5687867","DOIUrl":"https://doi.org/10.1109/PIC.2010.5687867","url":null,"abstract":"Logistics industry is becoming a more and more important field needed to be concentrated for all kinds of enterprises to reduce their own operation cost, and shorten their delivery time and so on. How to change the complicated logistics problem into abstract network model is elucidated here. Firstly, a directed graph G = (V, E) is used to describe the general logistics problem with some common restrictions such as cost and time etc. Secondly, considering the growth of logistics node, an improved network transport model was set forth. Thirdly, the combination of ant colony arithmetic with logistics network transport model is expounded, based on the similarity between logistics network transport model and Travelling Salesman Problem. Finally, the solution and analysis for the improved model is illustrated according to the ant colony arithmetic, and some related conclusions are detailed.","PeriodicalId":142910,"journal":{"name":"2010 IEEE International Conference on Progress in Informatics and Computing","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131702580","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
扫码关注我们
求助内容：
应助结果提醒方式：