Pub Date : 2009-12-31DOI: 10.1109/ICNIDC.2009.5360888
Jing Ning, Yaojun Qiao, Yuefeng Ji
A novel baseband OFDM optical SSB transmission scheme using parallel optical SSB modulation is proposed for long-haul optical transmission. Since the proposed scheme adopts the traditional SSB modulation theory and only uses the even sub-carriers to transmit data, simulations show that it has higher tolerance to the signal-signal beat interference and the nonlinearity effects comparing to the known baseband direct detection OFDM schemes.
{"title":"Baseband ofdm optical single-sideband transmission with parallel optical SSB modulation for direct detection","authors":"Jing Ning, Yaojun Qiao, Yuefeng Ji","doi":"10.1109/ICNIDC.2009.5360888","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360888","url":null,"abstract":"A novel baseband OFDM optical SSB transmission scheme using parallel optical SSB modulation is proposed for long-haul optical transmission. Since the proposed scheme adopts the traditional SSB modulation theory and only uses the even sub-carriers to transmit data, simulations show that it has higher tolerance to the signal-signal beat interference and the nonlinearity effects comparing to the known baseband direct detection OFDM schemes.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"2 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":"133293034","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.5360924
Duck-Ho Bae, J. Baek, Hyun-Kyo Oh, Ju-Won Song, Sang-Wook Kim
Owing to the GIS technology, a vast volume of spatial data has been accumulated, thereby incurring the necessity of spatial data mining techniques. In this paper, we propose a new spatial data mining system named SD-Miner. SD-Miner consists of three parts: a graphical user interface for inputs and outputs, a data mining module that processes spatial data mining functionalities, a data storage model that stores and manages spatial as well as non-spatial data by using a DBMS. In particular, the data mining module provides major spatial data mining functionalities such as spatial clustering, spatial classification, spatial characterization, and spatio-temporal association rule mining. SD-Miner has its own characteristics: (1) It supports users to perform non-spatial data mining functionalities as well as spatial data mining functionalities intuitively and effectively; (2) It provides users with spatial data mining functions as a form of libraries, thereby making applications conveniently use those functions. (3) It inputs parameters for mining as a form of database tables to increase flexibility.
{"title":"SD-Miner: A spatial data mining system","authors":"Duck-Ho Bae, J. Baek, Hyun-Kyo Oh, Ju-Won Song, Sang-Wook Kim","doi":"10.1109/ICNIDC.2009.5360924","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360924","url":null,"abstract":"Owing to the GIS technology, a vast volume of spatial data has been accumulated, thereby incurring the necessity of spatial data mining techniques. In this paper, we propose a new spatial data mining system named SD-Miner. SD-Miner consists of three parts: a graphical user interface for inputs and outputs, a data mining module that processes spatial data mining functionalities, a data storage model that stores and manages spatial as well as non-spatial data by using a DBMS. In particular, the data mining module provides major spatial data mining functionalities such as spatial clustering, spatial classification, spatial characterization, and spatio-temporal association rule mining. SD-Miner has its own characteristics: (1) It supports users to perform non-spatial data mining functionalities as well as spatial data mining functionalities intuitively and effectively; (2) It provides users with spatial data mining functions as a form of libraries, thereby making applications conveniently use those functions. (3) It inputs parameters for mining as a form of database tables to increase flexibility.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"22 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":"134257177","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.5360799
Bo Xu, Ming Chen, Chao Hu
Identification of various P2P flows accurately is fundamental for network management. To obtain P2P flow information in real-time and low price, a distributed extensible architecture for P2P flows identification called DEAPFI is proposed. DEAPFI decentralizes functions of flow identification and statistic on different PC, which is composed of Identification System (IS) and Statistic System (SS) respectively. IS integrates many independent P2P flow identification techniques and arranges their running order following optimizing sequence. By utilizing the identification results of IS, SS can extract P2P flow information from NetFlow records generated by NetFlow enabled equipment, which effectively reduces the requirement of PC's operation ability. The experiment results of the prototype system verified DEAPFI can reduce the disposal burden of IS and SS, and provide a feasible scheme for online identifying P2P flow information in high speed network.
{"title":"DEAPFI: A distributed extensible architecture for P2P flows identification","authors":"Bo Xu, Ming Chen, Chao Hu","doi":"10.1109/ICNIDC.2009.5360799","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360799","url":null,"abstract":"Identification of various P2P flows accurately is fundamental for network management. To obtain P2P flow information in real-time and low price, a distributed extensible architecture for P2P flows identification called DEAPFI is proposed. DEAPFI decentralizes functions of flow identification and statistic on different PC, which is composed of Identification System (IS) and Statistic System (SS) respectively. IS integrates many independent P2P flow identification techniques and arranges their running order following optimizing sequence. By utilizing the identification results of IS, SS can extract P2P flow information from NetFlow records generated by NetFlow enabled equipment, which effectively reduces the requirement of PC's operation ability. The experiment results of the prototype system verified DEAPFI can reduce the disposal burden of IS and SS, and provide a feasible scheme for online identifying P2P flow information in high speed network.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"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":"133044543","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.5360806
Zhichao Yang, Bin Zhang, Guohui Li, Yan Li, Xuesong Gao
NETCONF is a new network management protocol, based on the XML encoding method, which was proposed by IETF in 2006. It aims to overcome the shortcomings of SNMP predominantly used for configuration tasks at present. In the NETCONF protocol, subtree filtering mechanism and XPath capability is defined, both used to allow a client to select particular XML subtrees of the data model of the server. In this paper, we describe how we implement the two mechanisms and evaluate them from two aspects of functionality and performance. We find that the subtree filtering is not as flexible as XPath capability, but has better performance.
{"title":"The implementation and comparison analysis of subtree filtering and Xpath capability in NETCONF","authors":"Zhichao Yang, Bin Zhang, Guohui Li, Yan Li, Xuesong Gao","doi":"10.1109/ICNIDC.2009.5360806","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360806","url":null,"abstract":"NETCONF is a new network management protocol, based on the XML encoding method, which was proposed by IETF in 2006. It aims to overcome the shortcomings of SNMP predominantly used for configuration tasks at present. In the NETCONF protocol, subtree filtering mechanism and XPath capability is defined, both used to allow a client to select particular XML subtrees of the data model of the server. In this paper, we describe how we implement the two mechanisms and evaluate them from two aspects of functionality and performance. We find that the subtree filtering is not as flexible as XPath capability, but has better performance.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"117 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":"114055391","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.5360794
Yan Bai, Ke Ma, Guangsi Ma
Based on Grey theory, a combined wavelet-GM (1,1) forecasting model is proposed. The random properties of some non-stationary time series can be reduced by wavelet decomposition into many series according to different scales. Decomposed time series are predicted with GM (1,1) model to obtain forecasted results of the original time series. Experiments on network traffic show that the combined model is more effective than the common grey model. The application of the proposed combined model to network traffic forecasting may offer scientific rationale to Internet routing decision, LAN virus detection and illegal invasion prevention.
{"title":"An analysis of the combined wavelet-GM (1,1) model for network traffic forecasting","authors":"Yan Bai, Ke Ma, Guangsi Ma","doi":"10.1109/ICNIDC.2009.5360794","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360794","url":null,"abstract":"Based on Grey theory, a combined wavelet-GM (1,1) forecasting model is proposed. The random properties of some non-stationary time series can be reduced by wavelet decomposition into many series according to different scales. Decomposed time series are predicted with GM (1,1) model to obtain forecasted results of the original time series. Experiments on network traffic show that the combined model is more effective than the common grey model. The application of the proposed combined model to network traffic forecasting may offer scientific rationale to Internet routing decision, LAN virus detection and illegal invasion prevention.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"100 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":"115592906","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 forward-secure threshold proxy re-signature scheme in the standard model is firstly proposed in this paper. The scheme has the property that it is infeasible to forge valid proxy re-signatures relating to the past even if more than or equal to the threshold proxies are corrupted. Re-signature keys are updated at regular periods of time. It implies that past proxy re-signatures remain secure if the current re-signature key is leaked. The scheme is provably robust, forward-secure and unforgettable without relying on the random oracle model. The scheme has many attractive applications, such as the construction of the interoperable system of digital rights management (DRM).
{"title":"A new forward-secure threshold proxy re-signature scheme","authors":"Xiaodong Yang, Caifen Wang, Yulei Zhang, Weiyi Wei","doi":"10.1109/ICNIDC.2009.5360842","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360842","url":null,"abstract":"A forward-secure threshold proxy re-signature scheme in the standard model is firstly proposed in this paper. The scheme has the property that it is infeasible to forge valid proxy re-signatures relating to the past even if more than or equal to the threshold proxies are corrupted. Re-signature keys are updated at regular periods of time. It implies that past proxy re-signatures remain secure if the current re-signature key is leaked. The scheme is provably robust, forward-secure and unforgettable without relying on the random oracle model. The scheme has many attractive applications, such as the construction of the interoperable system of digital rights management (DRM).","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"68 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":"116753611","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.5360885
Yun-Cai Wang, Ju-Fen Niu
This article studies copyright protection system, and generalize system framework, Firstly, it introduces the technological base of digital copyright protection systems, outlined several digital content encrypting algorithms and one-way hash function; Secondly, it introduces system design, security requirements and working principle. Finally, it introduces digital copyright protection system framework, and designs a secure transaction system for digital content.
{"title":"Notice of RetractionResearch on digital content copyright protection system","authors":"Yun-Cai Wang, Ju-Fen Niu","doi":"10.1109/ICNIDC.2009.5360885","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360885","url":null,"abstract":"This article studies copyright protection system, and generalize system framework, Firstly, it introduces the technological base of digital copyright protection systems, outlined several digital content encrypting algorithms and one-way hash function; Secondly, it introduces system design, security requirements and working principle. Finally, it introduces digital copyright protection system framework, and designs a secure transaction system for digital content.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"114 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":"117203373","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.5360864
Shilin Zhang, Shuwu Zhang, Heping Li
Web mining has become an important field of research. However, there is an important challenge to applying the technique to NLP applications. An integrated data mining system for NLP in Chinese Commercial Web Sites is presented in this paper. It presented the data mining process in detail. More importantly, it puts forward a new enhanced method to Acquire User Preferences. Web mining applied to NLP provides a scientific basis for ebusiness and decision-making.
{"title":"Applying data miming and NLP techniques to automatically acquire user preferences in Chinese web sites","authors":"Shilin Zhang, Shuwu Zhang, Heping Li","doi":"10.1109/ICNIDC.2009.5360864","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360864","url":null,"abstract":"Web mining has become an important field of research. However, there is an important challenge to applying the technique to NLP applications. An integrated data mining system for NLP in Chinese Commercial Web Sites is presented in this paper. It presented the data mining process in detail. More importantly, it puts forward a new enhanced method to Acquire User Preferences. Web mining applied to NLP provides a scientific basis for ebusiness and decision-making.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"20 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":"123627727","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.5360890
Dong Wei, Caili Guo, Fangfang Liu, Zhimin Zeng
A scheme based on optimal polarization receiving (OPR) is proposed for the cognitive radios to improve the signal to interference and noise ratio (SINR) of the cognitive user. This OPR-Based scheme will not produce extra interference to the licensed user. The simulation results show that without increasing the transmitting power of the cognitive user, the cognitive receiver with OPR-Based scheme can improve the SINR by over 30dB at most compared with the traditional cognitive receiver.
{"title":"A SINR improving scheme based on optimal polarization receiving for the cognitive radios","authors":"Dong Wei, Caili Guo, Fangfang Liu, Zhimin Zeng","doi":"10.1109/ICNIDC.2009.5360890","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360890","url":null,"abstract":"A scheme based on optimal polarization receiving (OPR) is proposed for the cognitive radios to improve the signal to interference and noise ratio (SINR) of the cognitive user. This OPR-Based scheme will not produce extra interference to the licensed user. The simulation results show that without increasing the transmitting power of the cognitive user, the cognitive receiver with OPR-Based scheme can improve the SINR by over 30dB at most compared with the traditional cognitive receiver.","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":"114978131","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.5360871
Mengyang Chen, Aidong Men, Peng Fan, Bo Yang
Bad weather, such as fog and haze can significantly degrade the visibility of a scene. In order to overcome it, some approaches have been proposed. In this paper, we proposed a novel defogging algorithm just based on a single image. Firstly, we employ the method of dark channel prior as a foundation of our algorithm. After experimental analysis about the dark channel prior haze removal, we find that although dark channel prior behaves well in most situations, it also results in larger saturation values in some specific situations. Then, focusing on these situations, we propose an iterative algorithm to adjust the color distortion effected by higher saturation. Actually, this kind of global or local rectification can achieve a relatively ideal compromise between natural color and image definition. Experiments show that the algorithm proposed in this paper is good at dealing with the similarity-to-atmospheric-light objects defogging problem.
{"title":"Single image defogging","authors":"Mengyang Chen, Aidong Men, Peng Fan, Bo Yang","doi":"10.1109/ICNIDC.2009.5360871","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360871","url":null,"abstract":"Bad weather, such as fog and haze can significantly degrade the visibility of a scene. In order to overcome it, some approaches have been proposed. In this paper, we proposed a novel defogging algorithm just based on a single image. Firstly, we employ the method of dark channel prior as a foundation of our algorithm. After experimental analysis about the dark channel prior haze removal, we find that although dark channel prior behaves well in most situations, it also results in larger saturation values in some specific situations. Then, focusing on these situations, we propose an iterative algorithm to adjust the color distortion effected by higher saturation. Actually, this kind of global or local rectification can achieve a relatively ideal compromise between natural color and image definition. Experiments show that the algorithm proposed in this paper is good at dealing with the similarity-to-atmospheric-light objects defogging problem.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"41 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":"114061865","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}