Pub Date : 2009-12-31DOI: 10.1109/ICNIDC.2009.5360824
Wen-Xia Ma, Yingzhuo Xu, H. Xie
Addressing flaws in the traditional Dijkstra Algorithm, this paper proposes an improved optimal path algorithm applicable to the GIS drilling accident emergency rescue system. To begin, the paper uses the modified Comprehensive Analytic Hierarchy Process to analyze various factors of road conditions, considers the element of urgency, then sets up the digraph with weights of the running time of the traffic network. On this basis, we use the improved Dijkstra Algorithm based on quad-heap and inverse adjacency list to the optimal path search. Finally, application to real traffic networks substantiates the effectiveness of our developed method.
{"title":"The optimal path algorithm for emergency rescue for drilling accidents","authors":"Wen-Xia Ma, Yingzhuo Xu, H. Xie","doi":"10.1109/ICNIDC.2009.5360824","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360824","url":null,"abstract":"Addressing flaws in the traditional Dijkstra Algorithm, this paper proposes an improved optimal path algorithm applicable to the GIS drilling accident emergency rescue system. To begin, the paper uses the modified Comprehensive Analytic Hierarchy Process to analyze various factors of road conditions, considers the element of urgency, then sets up the digraph with weights of the running time of the traffic network. On this basis, we use the improved Dijkstra Algorithm based on quad-heap and inverse adjacency list to the optimal path search. Finally, application to real traffic networks substantiates the effectiveness of our developed method.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115364144","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 : 2009-12-31DOI: 10.1109/ICNIDC.2009.5360940
Suqin Liu, Xingsheng Li
Combined with the grid development, this article analyzed the current widespread adoption of authentication mechanisms and researched GSI program and KX.509 program in different grid environment. With the proxy idea of KX.509, using and implementing a Web-login module to build the grid authentication model in the Globus environment. The module provides the transparent user certificate generation, use and management for campus grid users. Web-login module generates digital proxy certificates automatically for users in the registration and certification process, so that users do not have their own digital certificate.
{"title":"Notice of RetractionResearch and implement of the grid security authentication model","authors":"Suqin Liu, Xingsheng Li","doi":"10.1109/ICNIDC.2009.5360940","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360940","url":null,"abstract":"Combined with the grid development, this article analyzed the current widespread adoption of authentication mechanisms and researched GSI program and KX.509 program in different grid environment. With the proxy idea of KX.509, using and implementing a Web-login module to build the grid authentication model in the Globus environment. The module provides the transparent user certificate generation, use and management for campus grid users. Web-login module generates digital proxy certificates automatically for users in the registration and certification process, so that users do not have their own digital certificate.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127481291","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 : 2009-12-31DOI: 10.1109/ICNIDC.2009.5360869
Peng Liu, Fang Liu, Yinan Dou, Zhenming Lei
The classification of Network users is very important in user behavior analysis. The algorithm which was based entropy and latent Dirichlet allocation (LDA) was used in this paper. It is important but difficult to select an appropriate number of topics for a specific dataset. Entropy was first used to solve the problem. A concept named difference-entropy was built to determine the number of topics. Experiments show that the proposed method can achieve performance matching the best of LDA without manually tuning the number of topics.
{"title":"Classification model of network users based on optimized LDA and entropy","authors":"Peng Liu, Fang Liu, Yinan Dou, Zhenming Lei","doi":"10.1109/ICNIDC.2009.5360869","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360869","url":null,"abstract":"The classification of Network users is very important in user behavior analysis. The algorithm which was based entropy and latent Dirichlet allocation (LDA) was used in this paper. It is important but difficult to select an appropriate number of topics for a specific dataset. Entropy was first used to solve the problem. A concept named difference-entropy was built to determine the number of topics. Experiments show that the proposed method can achieve performance matching the best of LDA without manually tuning the number of topics.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114295156","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 : 2009-12-31DOI: 10.1109/ICNIDC.2009.5360891
Bin Zhang, Zhiqiang He, K. Niu, Li Zhang, Xuzhen Wang
This paper address the problem of designing jointly the linear transmitters and receiver in a non-regenerative MIMO relay system, where linear processing is applied at the source, relay and destination node, using minimum mean square error (MMSE) criterion. Under the average power constraints at both the source and relay node, the iterative optimization method is presented and a low-complexity block optimization method is proposed. Simulation results show that the proposed methods perform better than other existing relaying schemes, and the performance gain is very significant when the signal-to-noise ratio (SNR) is high.
{"title":"Joint linear transceiver design in amplify-and-forward mimo relay system using an MMSE criterion","authors":"Bin Zhang, Zhiqiang He, K. Niu, Li Zhang, Xuzhen Wang","doi":"10.1109/ICNIDC.2009.5360891","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360891","url":null,"abstract":"This paper address the problem of designing jointly the linear transmitters and receiver in a non-regenerative MIMO relay system, where linear processing is applied at the source, relay and destination node, using minimum mean square error (MMSE) criterion. Under the average power constraints at both the source and relay node, the iterative optimization method is presented and a low-complexity block optimization method is proposed. Simulation results show that the proposed methods perform better than other existing relaying schemes, and the performance gain is very significant when the signal-to-noise ratio (SNR) is high.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"231 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122068482","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 : 2009-12-31DOI: 10.1109/ICNIDC.2009.5360886
P. Gong, K. Yu, Yumei Wang
In this paper, we investigate the problem of resource allocation with fairness constraints for OFDMA distributed antenna system (DAS). We formulate this problem as a binary integer programming problem, and transform it into a generated directed graph with the linear optimal distributed method to solve. Some simulation results compare the proposed algorithm with a given heuristic algorithm for purpose of verifying its performance. Consequently, other simulation results are provided to show that DAS outperforms the conventional central multi-antenna systems.
{"title":"Radio resource allocation for multiuser OFDMA distributed antenna systems","authors":"P. Gong, K. Yu, Yumei Wang","doi":"10.1109/ICNIDC.2009.5360886","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360886","url":null,"abstract":"In this paper, we investigate the problem of resource allocation with fairness constraints for OFDMA distributed antenna system (DAS). We formulate this problem as a binary integer programming problem, and transform it into a generated directed graph with the linear optimal distributed method to solve. Some simulation results compare the proposed algorithm with a given heuristic algorithm for purpose of verifying its performance. Consequently, other simulation results are provided to show that DAS outperforms the conventional central multi-antenna systems.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116732879","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 : 2009-12-31DOI: 10.1109/ICNIDC.2009.5360986
Jinbo Zhang, Zhiqing Lin, Bo Xiao, Chuang Zhang
Collaborative filtering is a very important technology in E-commerce. Unfortunately, with the increase of users and commodities, the user rating data is extremely sparse, which leads to the low efficient collaborative filtering recommendation system. To address these issues, an optimized collaborative filtering recommendation algorithm based on item is proposed. While calculating the similarity of two items, we obtain the ratio of users who rated both items to those who rated each of them. The ratio is taken into account in this method. The experimental results show that the proposed algorithm can improve the quality of collaborative filtering.
{"title":"An optimized item-based collaborative filtering recommendation algorithm","authors":"Jinbo Zhang, Zhiqing Lin, Bo Xiao, Chuang Zhang","doi":"10.1109/ICNIDC.2009.5360986","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360986","url":null,"abstract":"Collaborative filtering is a very important technology in E-commerce. Unfortunately, with the increase of users and commodities, the user rating data is extremely sparse, which leads to the low efficient collaborative filtering recommendation system. To address these issues, an optimized collaborative filtering recommendation algorithm based on item is proposed. While calculating the similarity of two items, we obtain the ratio of users who rated both items to those who rated each of them. The ratio is taken into account in this method. The experimental results show that the proposed algorithm can improve the quality of collaborative filtering.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128474081","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 : 2009-12-31DOI: 10.1109/ICNIDC.2009.5360838
He Kejia, Liu Gang, Tang Jie, Guo Jun
In this paper we present an approach for automatic alignment of long audio data with varied acoustic conditions to their corresponding transcripts in an effective manner. Accurate time-aligned transcripts provide easier access to audio materials by aiding applications such as the indexing, summarizing and retrieving of audio segments. Accurate time alignments are also necessary for labeling the training data for a speech recognizer's acoustic model. We provide an improved recursive technique of speech recognition with a gradually self-adaptive language model and acoustic model.
{"title":"An improved recursive algorithm for automatic alignment of complex long audio","authors":"He Kejia, Liu Gang, Tang Jie, Guo Jun","doi":"10.1109/ICNIDC.2009.5360838","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360838","url":null,"abstract":"In this paper we present an approach for automatic alignment of long audio data with varied acoustic conditions to their corresponding transcripts in an effective manner. Accurate time-aligned transcripts provide easier access to audio materials by aiding applications such as the indexing, summarizing and retrieving of audio segments. Accurate time alignments are also necessary for labeling the training data for a speech recognizer's acoustic model. We provide an improved recursive technique of speech recognition with a gradually self-adaptive language model and acoustic model.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124691776","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 : 2009-12-31DOI: 10.1109/ICNIDC.2009.5360821
You-sheng Zhou, Feng Wang, Yang Xin, Shoushan Luo, S. Qing, Yixian Yang
In this paper, we consider the application of Near-MDS codes in cryptography. Near-MDS codes have some important properties that can be used to construct secret sharing schemes. The proposed secret sharing schemes in this paper have good security properties such as cheating detection and cheaters identification when recovering the secret. In addition, the number of participants in our proposed scheme is more than previous results.
{"title":"A secret sharing scheme based on Near-MDS codes","authors":"You-sheng Zhou, Feng Wang, Yang Xin, Shoushan Luo, S. Qing, Yixian Yang","doi":"10.1109/ICNIDC.2009.5360821","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360821","url":null,"abstract":"In this paper, we consider the application of Near-MDS codes in cryptography. Near-MDS codes have some important properties that can be used to construct secret sharing schemes. The proposed secret sharing schemes in this paper have good security properties such as cheating detection and cheaters identification when recovering the secret. In addition, the number of participants in our proposed scheme is more than previous results.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"497 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130365412","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 : 2009-12-31DOI: 10.1109/ICNIDC.2009.5360876
Ye Zhu, Yueming Lu, Yuefeng Ji
It is important to keep the network working in synchronization when TDM services are transported across packet transmission network (PTN). Service clock of the destination must be the same as the source. An improved adaptive clock recovery scheme based on packet arrival time interval is proposed in this paper. This scheme is designed to remove the stochastic jitter introduced by the PTN in the clock recovery process. Furthermore, this scheme is compared with the traditional clock recovery scheme in simulation. The result shows that this method not only enables the destination clock to be synchronized with the source faster and more accurate but also avoids the buffer overflow or underflow.
{"title":"Packet arrival timestamp based selfadaptive clock recovery scheme","authors":"Ye Zhu, Yueming Lu, Yuefeng Ji","doi":"10.1109/ICNIDC.2009.5360876","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360876","url":null,"abstract":"It is important to keep the network working in synchronization when TDM services are transported across packet transmission network (PTN). Service clock of the destination must be the same as the source. An improved adaptive clock recovery scheme based on packet arrival time interval is proposed in this paper. This scheme is designed to remove the stochastic jitter introduced by the PTN in the clock recovery process. Furthermore, this scheme is compared with the traditional clock recovery scheme in simulation. The result shows that this method not only enables the destination clock to be synchronized with the source faster and more accurate but also avoids the buffer overflow or underflow.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"33 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130557597","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 : 2009-12-31DOI: 10.1109/ICNIDC.2009.5360809
Peng Fan, Aidong Men, Mengyang Chen, Bo Yang
SIFT (Scale Invariant Feature Transform) is an important local invariant feature descriptor. Since its expensive computation, SURF (Speeded-Up Robust Features) is proposed. Both of them are designed mainly for gray images. However, color provides valuable information in object description and matching tasks. To overcome the drawback and to increase the descriptor's distinctiveness, this paper presents a novel feature descriptor which combines local kernel color histograms and Haar wavelet responses to construct the feature vector. So the descriptor is a two elements vector. In image matching process, SURF descriptor is first compared, then the unmatched points are computed by Bhattacharyya distance between their local kernel color histograms. Extensive experimental evaluations show that the method has better robustness than the original SURF. The ratio of correct matches is increased by about 8.9% in the given dataset.
{"title":"Color-SURF: A surf descriptor with local kernel color histograms","authors":"Peng Fan, Aidong Men, Mengyang Chen, Bo Yang","doi":"10.1109/ICNIDC.2009.5360809","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360809","url":null,"abstract":"SIFT (Scale Invariant Feature Transform) is an important local invariant feature descriptor. Since its expensive computation, SURF (Speeded-Up Robust Features) is proposed. Both of them are designed mainly for gray images. However, color provides valuable information in object description and matching tasks. To overcome the drawback and to increase the descriptor's distinctiveness, this paper presents a novel feature descriptor which combines local kernel color histograms and Haar wavelet responses to construct the feature vector. So the descriptor is a two elements vector. In image matching process, SURF descriptor is first compared, then the unmatched points are computed by Bhattacharyya distance between their local kernel color histograms. Extensive experimental evaluations show that the method has better robustness than the original SURF. The ratio of correct matches is increased by about 8.9% in the given dataset.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126900165","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
扫码关注我们
求助内容：
应助结果提醒方式：