Sorting rate of current methods is not high and too sensitive to the signal noise ratio (SNR), in order to solve this problem, a novel algorithm for sorting radar radiating-source signal is proposed. The ambiguity function of received signal is extracted and predigested to two-dimension characteristic, then decomposed into eight wavelet package transformation (WPT) characteristic parameters whose WPT2 and WPT5 have the best separability and be used as the sorting parameters at last. For ambiguity function of different signal is distinguishing and not sensitive to SNR, the 2 WPT and 5 are divisible and steady. The advantage of this new method is validated by simulation result, and the lowest sorting rate is 90% at SNR=10dB.
{"title":"A Novel Method for Sorting Radar Radiating-Source Signal Based on Ambiguity Function","authors":"Jun Han, M. He, Yuan-qing Zhu, Bin-gang Zhu","doi":"10.1109/NSWCTC.2009.342","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.342","url":null,"abstract":"Sorting rate of current methods is not high and too sensitive to the signal noise ratio (SNR), in order to solve this problem, a novel algorithm for sorting radar radiating-source signal is proposed. The ambiguity function of received signal is extracted and predigested to two-dimension characteristic, then decomposed into eight wavelet package transformation (WPT) characteristic parameters whose WPT2 and WPT5 have the best separability and be used as the sorting parameters at last. For ambiguity function of different signal is distinguishing and not sensitive to SNR, the 2 WPT and 5 are divisible and steady. The advantage of this new method is validated by simulation result, and the lowest sorting rate is 90% at SNR=10dB.","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":"126753110","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}
Due to perceived high risk in the first transaction and Internet low switching cost, building consumer initial trust is crucial for online vendors. Extant research has often examined determinants of initial trust from the perspectives of TAM and trust transference, and seldom considered the initial trust building from dual-routes. Drawing on ELM, we analyzed the different effect of argument quality via the central route and source credibility via the peripheral route on initial trust. We collected 193 valid papers and conducted data analysis with LISREL. The results show that argument quality, source credibility and self-efficacy have significant effect on initial trust. Moreover, self-efficacy positively moderates the effect of argument quality on initial trust, whereas it negatively moderates the effect of source credibility on initial trust.
{"title":"An Empirical Analysis of Online Consumer Initial Trust Building Based on ELM","authors":"Tao Zhou, Yanjun Sun","doi":"10.1109/NSWCTC.2009.305","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.305","url":null,"abstract":"Due to perceived high risk in the first transaction and Internet low switching cost, building consumer initial trust is crucial for online vendors. Extant research has often examined determinants of initial trust from the perspectives of TAM and trust transference, and seldom considered the initial trust building from dual-routes. Drawing on ELM, we analyzed the different effect of argument quality via the central route and source credibility via the peripheral route on initial trust. We collected 193 valid papers and conducted data analysis with LISREL. The results show that argument quality, source credibility and self-efficacy have significant effect on initial trust. Moreover, self-efficacy positively moderates the effect of argument quality on initial trust, whereas it negatively moderates the effect of source credibility on initial trust.","PeriodicalId":433291,"journal":{"name":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","volume":"31 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":"126989657","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}
Nowadays, more and more singers published various songs. There are about 50,000 songs in the internet. The songs are refreshed everyday, so we need a real-time chart of music. In this paper, our study is based on the real-time search charts of music. We studied the algorithm of the charts and analyzed the ranking of the charts. According to the ranking of the charts, we got some special characters. Those characters can not be seen from other music charts,such as selling charts and other week’s charts of music.While, there are also some problems about the realtime charts, like special users of charts. Those problems need us to solve. We will get more impersonality charts after solving those problems.
{"title":"The Measurement of the Search Charts of Music","authors":"Yue Yang, Changjia Chen, Yishuai Chen","doi":"10.1109/NSWCTC.2009.295","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.295","url":null,"abstract":"Nowadays, more and more singers published various songs. There are about 50,000 songs in the internet. The songs are refreshed everyday, so we need a real-time chart of music. In this paper, our study is based on the real-time search charts of music. We studied the algorithm of the charts and analyzed the ranking of the charts. According to the ranking of the charts, we got some special characters. Those characters can not be seen from other music charts,such as selling charts and other week’s charts of music.While, there are also some problems about the realtime charts, like special users of charts. Those problems need us to solve. We will get more impersonality charts after solving those problems.","PeriodicalId":433291,"journal":{"name":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","volume":"13 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":"121631425","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}
High energy-efficiency and low transmission delay are most important for periodical data gathering applications in wireless sensor networks (WSNs). Therefore, the product of energy consumption and transmission delay, EnergyxDelay is a good metric for such performance evaluation. This paper presents a distributed energy-efficient and delay-aware data gathering protocol, which is efficient in the ways that it prolongs the lifetime of network, as well as takes less time to finish a transmission round. The simulation results show that it improves the average EnergyxDelay metric compared to other protocols.
{"title":"A Distributed Energy-Efficient and Delay-Aware Data Gathering Protocol for Wireless Sensor Networks","authors":"Z. Fan","doi":"10.1109/NSWCTC.2009.73","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.73","url":null,"abstract":"High energy-efficiency and low transmission delay are most important for periodical data gathering applications in wireless sensor networks (WSNs). Therefore, the product of energy consumption and transmission delay, EnergyxDelay is a good metric for such performance evaluation. This paper presents a distributed energy-efficient and delay-aware data gathering protocol, which is efficient in the ways that it prolongs the lifetime of network, as well as takes less time to finish a transmission round. The simulation results show that it improves the average EnergyxDelay metric compared to other protocols.","PeriodicalId":433291,"journal":{"name":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","volume":"340 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":"124311185","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}
Web Data Mining is a new important research field in data mining. In this paper, the conception and characteristic of data mining based on Web are introduced the process and the general methods of data mining based on Web are expatiated.At present many websites are built with HTML, which is difficult to achieve real effective and accurate web mining. The appearance of XML has brought convenience for it. Based on the research of web mining, XML is used to transform semi-structured data to well structured data, and a model of web mining system which has basic data mining function and faces multi—data on the Web is built .At the same time, the problem in data mining is analyzed and studied. An example is put forward to prove the solution¿
{"title":"Research of Web Mining Technology Based on XML","authors":"Lan Li, Q. Rong","doi":"10.1109/NSWCTC.2009.339","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.339","url":null,"abstract":"Web Data Mining is a new important research field in data mining. In this paper, the conception and characteristic of data mining based on Web are introduced the process and the general methods of data mining based on Web are expatiated.At present many websites are built with HTML, which is difficult to achieve real effective and accurate web mining. The appearance of XML has brought convenience for it. Based on the research of web mining, XML is used to transform semi-structured data to well structured data, and a model of web mining system which has basic data mining function and faces multi—data on the Web is built .At the same time, the problem in data mining is analyzed and studied. An example is put forward to prove the solution¿","PeriodicalId":433291,"journal":{"name":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","volume":"83 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":"124420907","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 the networking technology greatly advanced in past decades, Wireless Sensor Networks (WSN) have been widely deployed and utilized in various areas. Security issues on WSN devices thus draw much attention. In order to ensure the security of IEEE802.15.4 WSN and to fulfill the strict limitations of area and energy, we propose an efficient scheme for AES-CCM architecture. We implement AES-CCM by taking into account the tradeoff among throughput, area and power consumption. Our design employs a full-hardware implementation to offload CPU. Meanwhile, we parallelize CTR and CBC-MAC processing to cut down duty cycles and energy-consumption. An appropriate 8-bit data path AES architecture is chosen to guarantee rigorous requirements of the area and energy. Furthermore, a shared key expansion is applied to reduce the die-size. Experimental results based on the United Microelectronics Corporation (UMC) 0.25 micrometers 1.8 volts technology library show that our implementation is compact and energy-efficient, which would be suitable for resource-constrained WSN devices.
{"title":"An Energy-Efficient AES-CCM Implementation for IEEE802.15.4 Wireless Sensor Networks","authors":"Lian Huai, X. Zou, Zhenglin Liu, Yu Han","doi":"10.1109/NSWCTC.2009.246","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.246","url":null,"abstract":"As the networking technology greatly advanced in past decades, Wireless Sensor Networks (WSN) have been widely deployed and utilized in various areas. Security issues on WSN devices thus draw much attention. In order to ensure the security of IEEE802.15.4 WSN and to fulfill the strict limitations of area and energy, we propose an efficient scheme for AES-CCM architecture. We implement AES-CCM by taking into account the tradeoff among throughput, area and power consumption. Our design employs a full-hardware implementation to offload CPU. Meanwhile, we parallelize CTR and CBC-MAC processing to cut down duty cycles and energy-consumption. An appropriate 8-bit data path AES architecture is chosen to guarantee rigorous requirements of the area and energy. Furthermore, a shared key expansion is applied to reduce the die-size. Experimental results based on the United Microelectronics Corporation (UMC) 0.25 micrometers 1.8 volts technology library show that our implementation is compact and energy-efficient, which would be suitable for resource-constrained WSN devices.","PeriodicalId":433291,"journal":{"name":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","volume":"23 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":"126268514","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 real world, there are many important applications for the secret sharing with the quasi-threshold multipartite access structure. But there was still not a very efficient scheme proposed in the past. In this paper, we combine the multi-secret sharing and the quasi-threshold multipartite access structure, and present an efficient multi-secret sharing scheme with the quasi-threshold multipartite access structure based on Shamir’s secret sharing scheme. In this scheme, the participants of any authorized subset can reconstruct multiple secrets by repeatedly using the Lagrange interpolation formula during a sharing process, but any non-authorized subset cannot recover any secret. In addition, the share is the same size of the single shared secret. Thus, it is an efficient and ideal multi-secret sharing scheme with the quasi-threshold multipartite access structure.
{"title":"An Efficient Multi-secret Sharing Scheme with the Quasi-threshold Multipartite Access Structure","authors":"Run-hua Shi, Liusheng Huang, Wei Yang, Hong Zhong","doi":"10.1109/NSWCTC.2009.263","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.263","url":null,"abstract":"In real world, there are many important applications for the secret sharing with the quasi-threshold multipartite access structure. But there was still not a very efficient scheme proposed in the past. In this paper, we combine the multi-secret sharing and the quasi-threshold multipartite access structure, and present an efficient multi-secret sharing scheme with the quasi-threshold multipartite access structure based on Shamir’s secret sharing scheme. In this scheme, the participants of any authorized subset can reconstruct multiple secrets by repeatedly using the Lagrange interpolation formula during a sharing process, but any non-authorized subset cannot recover any secret. In addition, the share is the same size of the single shared secret. Thus, it is an efficient and ideal multi-secret sharing scheme with the quasi-threshold multipartite access structure.","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":"126364333","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 mathematical analysis, the primary components analysis (PCA) is used to analyze the effect of influential factors on campus network security (CNS). Based on PCA model and, the results are computed. Through case study, it can be seen that some factors and characteristics play very important role in influencing CNS and all factors should be considered because the effect depends on the factors interaction. Through analysis and discussion, it is concluded that, under the premise of minimizing the information loss, the application of PCA in analyzing effect on CNS is approved to be practicable and applicable.
{"title":"Application Research on Primary Components Analysis in Assessing Influential Factors of Campus Network Security","authors":"Zhiming Qu, Xiaoli Wang","doi":"10.1109/NSWCTC.2009.46","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.46","url":null,"abstract":"Through mathematical analysis, the primary components analysis (PCA) is used to analyze the effect of influential factors on campus network security (CNS). Based on PCA model and, the results are computed. Through case study, it can be seen that some factors and characteristics play very important role in influencing CNS and all factors should be considered because the effect depends on the factors interaction. Through analysis and discussion, it is concluded that, under the premise of minimizing the information loss, the application of PCA in analyzing effect on CNS is approved to be practicable and applicable.","PeriodicalId":433291,"journal":{"name":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","volume":"15 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":"128062956","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 subcarrier and power allocation algorithm for Multiple-Input-Multiple-Output Orthogonal-Frequency-Division-Multiple-Access (MIMO-OFD MA) systems with channel state information available at the transmitter. Fairness constraint is applied to limit the maximum and minimum number of subcarriers for all users. A Lagrange multiplier method is applied to solve the constrained optimization problem. Solving this optimization problem require multi-dimensional searching. A modified searching method is proposed to improve the convergence speed.
{"title":"Lagrange Multiplier Based Fair Resource Allocation for MIMO-OFDMA Systems","authors":"Dou Ni, Fangjiong Chen, Cunmei Ji","doi":"10.1109/NSWCTC.2009.146","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.146","url":null,"abstract":"In this paper, we propose a subcarrier and power allocation algorithm for Multiple-Input-Multiple-Output Orthogonal-Frequency-Division-Multiple-Access (MIMO-OFD MA) systems with channel state information available at the transmitter. Fairness constraint is applied to limit the maximum and minimum number of subcarriers for all users. A Lagrange multiplier method is applied to solve the constrained optimization problem. Solving this optimization problem require multi-dimensional searching. A modified searching method is proposed to improve the convergence speed.","PeriodicalId":433291,"journal":{"name":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","volume":"17 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":"115776721","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 presents the robust Adaptive Digital Beamforming algorithm used in Cognitive Radios spectrum detection scheme, which is based on worst-case performance optimization criterion for processing the cyclostationary signals. The algorithm theory and its implementation steps are discussed. By simulated results show that this algorithm provides efficient solutions to the robustness problems including the array response mismatch and data nonstationarity problems.
{"title":"Robust Adaptive Beamforming for Cyclostationary Signals in Spectrum Detection of Cognitive Radios","authors":"Xiaolong Ma, Guican Chen","doi":"10.1109/NSWCTC.2009.16","DOIUrl":"https://doi.org/10.1109/NSWCTC.2009.16","url":null,"abstract":"This paper presents the robust Adaptive Digital Beamforming algorithm used in Cognitive Radios spectrum detection scheme, which is based on worst-case performance optimization criterion for processing the cyclostationary signals. The algorithm theory and its implementation steps are discussed. By simulated results show that this algorithm provides efficient solutions to the robustness problems including the array response mismatch and data nonstationarity problems.","PeriodicalId":433291,"journal":{"name":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","volume":"148 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":"115913914","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
扫码关注我们
求助内容：
应助结果提醒方式：