This article, from the prospect of P2P e-commerce advantages and challenges, discusses the risks of P2P e-commerce issues, and points out that trust is the basis of all business activities. Business organizations should take certain measures against risks from P2P e-commerce. The effective confidence-building mechanism can enable e-commerce more secure, reduce the risk of people's expectations, and enhance confidence in the P2P e-commerce. Taking into account the needs of e-commerce data security, this paper provides P2P-based e-commerce trust model. This model has inherited the advantages of traditional P2P model, combined with confidence-building mechanism to check for the main business in order to provide a highly reliable low-cost application.
{"title":"P2P-based E-commerce Trust Model and Strategies","authors":"Chen Xin","doi":"10.1109/NSWCTC.2009.372","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.372","url":null,"abstract":"This article, from the prospect of P2P e-commerce advantages and challenges, discusses the risks of P2P e-commerce issues, and points out that trust is the basis of all business activities. Business organizations should take certain measures against risks from P2P e-commerce. The effective confidence-building mechanism can enable e-commerce more secure, reduce the risk of people's expectations, and enhance confidence in the P2P e-commerce. Taking into account the needs of e-commerce data security, this paper provides P2P-based e-commerce trust model. This model has inherited the advantages of traditional P2P model, combined with confidence-building mechanism to check for the main business in order to provide a highly reliable low-cost application.","PeriodicalId":433291,"journal":{"name":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124564737","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}
Real-time task now emerges in various reliable systems; however, most existing schedulers of real-time tasks are limited to fixed priority scheduling. A dynamic priority scheduling model is derived for the preemptive earliest deadline first scheduling of periodic real-time tasks in the real-time reliable system. Moreover, a heuristic algorithm is present for the schedulability test, which is effective when the priority inheritance protocol is considered to prevent priority inversion.
{"title":"A Dynamic Scheduling Model for Real-Time Tasks in Reliable System","authors":"Zhang Jie, Y. Fumin, Tu Gang","doi":"10.1109/NSWCTC.2009.207","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.207","url":null,"abstract":"Real-time task now emerges in various reliable systems; however, most existing schedulers of real-time tasks are limited to fixed priority scheduling. A dynamic priority scheduling model is derived for the preemptive earliest deadline first scheduling of periodic real-time tasks in the real-time reliable system. Moreover, a heuristic algorithm is present for the schedulability test, which is effective when the priority inheritance protocol is considered to prevent priority inversion.","PeriodicalId":433291,"journal":{"name":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125598316","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}
Beam forming has been greatly applied in TD-SCDMA, but in the 3G long-term evolution (LTE), multi-antenna solution aims to use multi-input-multi-output (MIMO). Usually MIMO requires enough large antenna space to ensure uncorrelated multi-channels, whereas beam forming antennas need small antenna space. But this years’ research has shown the combination feasibility of beam forming and MIMO. In this paper, the 3GPP special channel model (SCM) has been researched and the beam forming is added to the LTE. Because of the beam forming combination, the number of transmitted antennas can not be restricted by 3GPP specification about LTE. Simulation results validate the efficiency. This gives a smooth evolution path from TD-SCDMA to LTE, and the advantage of beam forming can be inherited.
{"title":"An Enhanced Multi-antenna Solution through Beamforming to 3G Long-Term Evolution","authors":"Ken Long, Weilin Wu","doi":"10.1109/NSWCTC.2009.216","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.216","url":null,"abstract":"Beam forming has been greatly applied in TD-SCDMA, but in the 3G long-term evolution (LTE), multi-antenna solution aims to use multi-input-multi-output (MIMO). Usually MIMO requires enough large antenna space to ensure uncorrelated multi-channels, whereas beam forming antennas need small antenna space. But this years’ research has shown the combination feasibility of beam forming and MIMO. In this paper, the 3GPP special channel model (SCM) has been researched and the beam forming is added to the LTE. Because of the beam forming combination, the number of transmitted antennas can not be restricted by 3GPP specification about LTE. Simulation results validate the efficiency. This gives a smooth evolution path from TD-SCDMA to LTE, and the advantage of beam forming can be inherited.","PeriodicalId":433291,"journal":{"name":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","volume":"157 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122467422","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 proposed an object packaging based cache scheme for GPRS network. Our study demonstrated that better performance can be achieved when packaging utilized. In addition, the scheme can be used for other resource limited networks.
{"title":"An Object Packaging Based Cache Scheme for GPRS Network","authors":"Xiaohui Chen, Weidong Wang, Xiaowei Qin, Guo Wei","doi":"10.1109/NSWCTC.2009.139","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.139","url":null,"abstract":"In this paper, we proposed an object packaging based cache scheme for GPRS network. Our study demonstrated that better performance can be achieved when packaging utilized. In addition, the scheme can be used for other resource limited networks.","PeriodicalId":433291,"journal":{"name":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122935493","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}
Because of the limitations of condition configuration and execution mechanism, the exiting access control models are not flexible and can not support multi-policy. Focusing on this, the paper presents a policy-based access control model (PBAC). Different from the traditional models which restrict session only with subject authorization, PBAC realizes policy-based access control by defining attribute to describe session property, performing a new policy management method that is free from application logic, and advocating an independent access control decision mechanism. As a consequence, PBAC is more flexible on restricting session, and makes great progress on multi-policy supporting. The comparison analysis indicates that PBAC is superior to the current access control models.
{"title":"Research on Policy-based Access Control Model","authors":"Lin Zhi, Wang Jing, Chen Xiao-su, Jia Lian-xing","doi":"10.1109/NSWCTC.2009.313","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.313","url":null,"abstract":"Because of the limitations of condition configuration and execution mechanism, the exiting access control models are not flexible and can not support multi-policy. Focusing on this, the paper presents a policy-based access control model (PBAC). Different from the traditional models which restrict session only with subject authorization, PBAC realizes policy-based access control by defining attribute to describe session property, performing a new policy management method that is free from application logic, and advocating an independent access control decision mechanism. As a consequence, PBAC is more flexible on restricting session, and makes great progress on multi-policy supporting. The comparison analysis indicates that PBAC is superior to the current access control models.","PeriodicalId":433291,"journal":{"name":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121345015","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}
Junk code fuzzy transformation (JCFT) is one of the effective approaches of the code obfuscation technology. Based on the analysis of current junk code strategies, this paper presents a new method named junk code encryption algorithm of subroutine, and depicts the algorithm with formalized language. The paper studies how to prove the logic invariability of subroutine’s JCFT with formalized method. After studying the formalized definition of subroutine’s JCFT, some lemmas are extracted. With these lemmas, and from three aspects such as "XOR and CMP Expansion", "False Embranchment Construction" and "JNE Append Junk Code", the paper proves that the procedure which transforms with subroutine’s JCFT has the same logicality with the original procedure.
{"title":"Study the Logic Invariability in Subroutine's Junk Code Fuzzy Transformation","authors":"Guo-zi Sun, Baobing Wang, Dan-wei Chen, Qiang Cai","doi":"10.1109/NSWCTC.2009.204","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.204","url":null,"abstract":"Junk code fuzzy transformation (JCFT) is one of the effective approaches of the code obfuscation technology. Based on the analysis of current junk code strategies, this paper presents a new method named junk code encryption algorithm of subroutine, and depicts the algorithm with formalized language. The paper studies how to prove the logic invariability of subroutine’s JCFT with formalized method. After studying the formalized definition of subroutine’s JCFT, some lemmas are extracted. With these lemmas, and from three aspects such as \"XOR and CMP Expansion\", \"False Embranchment Construction\" and \"JNE Append Junk Code\", the paper proves that the procedure which transforms with subroutine’s JCFT has the same logicality with the original procedure.","PeriodicalId":433291,"journal":{"name":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","volume":"455 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116410926","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 SC-FDE (single carrier with frequency domain equalization) systems, timing offset brings ISI (inter-symbol interference). In order to obtain better timing precision in multi-path, a new timing offset estimation method applied to SC-FDE systems is proposed based on the analysis of Schmidl & Cox’s and Minn’s algorithms. By designing new training symbols and introducing corresponding calculation method, performance of timing synchronization can be improved obviously. Finally, three algorithms are compared by computer simulations and the comparison results confirm the effectiveness of the proposed algorithm.
{"title":"A New Timing Offset Estimation Method for SC-FDE Systems","authors":"Li-jun Sun, L. Huang","doi":"10.1109/NSWCTC.2009.176","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.176","url":null,"abstract":"In SC-FDE (single carrier with frequency domain equalization) systems, timing offset brings ISI (inter-symbol interference). In order to obtain better timing precision in multi-path, a new timing offset estimation method applied to SC-FDE systems is proposed based on the analysis of Schmidl & Cox’s and Minn’s algorithms. By designing new training symbols and introducing corresponding calculation method, performance of timing synchronization can be improved obviously. Finally, three algorithms are compared by computer simulations and the comparison results confirm the effectiveness of the proposed algorithm.","PeriodicalId":433291,"journal":{"name":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126911458","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 reveal the impact of knowledge sharing in virtual communities on consumer behavior is an important work of current. This paper is designed to explore the relationship between knowledge sharing in virtual communities and consumers’ brand trust by empirical methods. A relationship model of content of sharing, sharing degree and consumers’ brand trust was constructed. The results show: sharing degree in virtual community affects consumers’ brand trust by their trust in brand goodwill; the content of sharing in virtual community affects consumers’ brand trust by their trust in brand capability.
{"title":"The Influence of Knowledge Sharing in Virtual Communities on Consumers' Brand Trust: An Empirical Study","authors":"D. Zhu, Y. Chang","doi":"10.1109/NSWCTC.2009.106","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.106","url":null,"abstract":"To reveal the impact of knowledge sharing in virtual communities on consumer behavior is an important work of current. This paper is designed to explore the relationship between knowledge sharing in virtual communities and consumers’ brand trust by empirical methods. A relationship model of content of sharing, sharing degree and consumers’ brand trust was constructed. The results show: sharing degree in virtual community affects consumers’ brand trust by their trust in brand goodwill; the content of sharing in virtual community affects consumers’ brand trust by their trust in brand capability.","PeriodicalId":433291,"journal":{"name":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126051277","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 joint subcarrier and power allocation in uplink OFDMA systems with incomplete channel state information is proposed. The subcarrier allocation problem is considered as a multi-player discrete, stochastic and finite strategy game, and equal power is allocated to the subcarriers of each user. Particularly, the utility function is based on the channel capability and adds the pricing scheme to guarantee the fairness. The subcarrier allocation is different from the traditional scheme in which the subcarriers are allocated passively. In our process, each of the subcarriers is viewed as a learning automaton to choose the most satisfying user. We adopt the linear reward-inaction algorithm to obtain the Nash equilibrium. Theoretic analysis is given. Simulation results show our allocation scheme has good convergence, and the performance gap is tolerated compared with the complete channel state case.
{"title":"Joint Subcarrier and Power Allocation in Uplink OFDMA Systems with Incomplete Channel State Information","authors":"Dan Wu, Yueming Cai, Chengkang Pan","doi":"10.1109/NSWCTC.2009.58","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.58","url":null,"abstract":"A joint subcarrier and power allocation in uplink OFDMA systems with incomplete channel state information is proposed. The subcarrier allocation problem is considered as a multi-player discrete, stochastic and finite strategy game, and equal power is allocated to the subcarriers of each user. Particularly, the utility function is based on the channel capability and adds the pricing scheme to guarantee the fairness. The subcarrier allocation is different from the traditional scheme in which the subcarriers are allocated passively. In our process, each of the subcarriers is viewed as a learning automaton to choose the most satisfying user. We adopt the linear reward-inaction algorithm to obtain the Nash equilibrium. Theoretic analysis is given. Simulation results show our allocation scheme has good convergence, and the performance gap is tolerated compared with the complete channel state case.","PeriodicalId":433291,"journal":{"name":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125250531","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 present a uniform signal model of two combined modulation schemes in ultra-wideband (UWB) system, which are combined bi-phase shift keying and pulse shape modulation (BPSK-PSM) and combined on-off keying and pulse shape modulation (OOK-PSM). Both analytical expressions and simulation results for the power spectral density (PSD) of the proposed schemes with time hopping code are provided. The contrast analysis between two schemes and the impact of different time hopping code on the PSD are also discussed. Theoretical analyses and simulation results show that designing a set of proper orthogonal pulses is very important in UWB system based on pulse shape modulation (PSM) scheme.
{"title":"Spectral Analysis of UWB Signal Based on Combined Modulation Scheme with Time-Hopping Code","authors":"Lin Zhang, Shu Wang, Taoping Zou, Zhen Qin","doi":"10.1109/NSWCTC.2009.247","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.247","url":null,"abstract":"This paper present a uniform signal model of two combined modulation schemes in ultra-wideband (UWB) system, which are combined bi-phase shift keying and pulse shape modulation (BPSK-PSM) and combined on-off keying and pulse shape modulation (OOK-PSM). Both analytical expressions and simulation results for the power spectral density (PSD) of the proposed schemes with time hopping code are provided. The contrast analysis between two schemes and the impact of different time hopping code on the PSD are also discussed. Theoretical analyses and simulation results show that designing a set of proper orthogonal pulses is very important in UWB system based on pulse shape modulation (PSM) scheme.","PeriodicalId":433291,"journal":{"name":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127798397","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
扫码关注我们
求助内容：
应助结果提醒方式：