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.5360911
Joohan Lee, Hee-Jun Kang, Sungkwon Park, Taekyoon Kim
Advances in broadcasting technology are generating an increasing demand for Video on Demand (VoD) applications. In a video broadcasting methods, one of the major challenges is how to reduce a viewer's waiting time and client's buffer requirement in a given bandwidth allocation. In order to solve these problems, many significant broadcasting methods had been proposed. In this paper, we propose a Pseudo Harmonic Staggered Broadcasting (PHSB) method which has simple structure and channel efficiency in a given bandwidth. The numerical results demonstrate that viewer's waiting time of the PHSB method converge to that of harmonic method as the bandwidth is increased and the client buffer requirements of this can be decreased below that of the staircase method by adjusting a short front part of a video size.
{"title":"Pseudo Harmonic Staggered Broadcasting method for efficient Video on Demand service","authors":"Joohan Lee, Hee-Jun Kang, Sungkwon Park, Taekyoon Kim","doi":"10.1109/ICNIDC.2009.5360911","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360911","url":null,"abstract":"Advances in broadcasting technology are generating an increasing demand for Video on Demand (VoD) applications. In a video broadcasting methods, one of the major challenges is how to reduce a viewer's waiting time and client's buffer requirement in a given bandwidth allocation. In order to solve these problems, many significant broadcasting methods had been proposed. In this paper, we propose a Pseudo Harmonic Staggered Broadcasting (PHSB) method which has simple structure and channel efficiency in a given bandwidth. The numerical results demonstrate that viewer's waiting time of the PHSB method converge to that of harmonic method as the bandwidth is increased and the client buffer requirements of this can be decreased below that of the staircase method by adjusting a short front part of a video size.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"92 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":"124526646","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.5360919
Sunyoung Lee, Myungjung Lee, Kiho Choi, E. Jang
In this paper, we propose the unified framework of frame skipping and interpolation (UF-FSI) for efficient video compression. Frame skipping and interpolation is one of the efficient approaches to reduce the redundancy of video frames. A joint design of frame skipping and interpolation is made for maximization of compression efficiency, which was not considered from previous research. A good advantage of UF-FSI is that it can be applied to any conventional video codec. Frame skipping in the proposed method is done by selecting key frames through analysis of neighboring frames. In frame interpolation, in-between frames are reconstructed by key frames using motion compensated interpolation. Using with MPEG-4 simple profile, UF-FSI offered additional coding efficiency up to 25 percent with good visual quality.
{"title":"Unified framework of frame skipping and interpolation for efficient video compression","authors":"Sunyoung Lee, Myungjung Lee, Kiho Choi, E. Jang","doi":"10.1109/ICNIDC.2009.5360919","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360919","url":null,"abstract":"In this paper, we propose the unified framework of frame skipping and interpolation (UF-FSI) for efficient video compression. Frame skipping and interpolation is one of the efficient approaches to reduce the redundancy of video frames. A joint design of frame skipping and interpolation is made for maximization of compression efficiency, which was not considered from previous research. A good advantage of UF-FSI is that it can be applied to any conventional video codec. Frame skipping in the proposed method is done by selecting key frames through analysis of neighboring frames. In frame interpolation, in-between frames are reconstructed by key frames using motion compensated interpolation. Using with MPEG-4 simple profile, UF-FSI offered additional coding efficiency up to 25 percent with good visual quality.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"182 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":"124589066","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.5360943
Eun-su Kim, Sooyong Park, Jae-il Jung
In this paper, we studied the multi-hop broadcast algorithms for delivery of safety message in inter vehicle communication environment. In MANET environment, there are three multi-hop broadcasting schemes such as probability based methods, area based methods and topology based methods. We simulate MANET based multi-hop broadcasting schemes and evaluate the performance of our work in order to analyze the suitable of these schemes for vehicular environment.
{"title":"Performance comparison of the multi-hop broadcast schemes for safety message in V2V communication","authors":"Eun-su Kim, Sooyong Park, Jae-il Jung","doi":"10.1109/ICNIDC.2009.5360943","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360943","url":null,"abstract":"In this paper, we studied the multi-hop broadcast algorithms for delivery of safety message in inter vehicle communication environment. In MANET environment, there are three multi-hop broadcasting schemes such as probability based methods, area based methods and topology based methods. We simulate MANET based multi-hop broadcasting schemes and evaluate the performance of our work in order to analyze the suitable of these schemes for vehicular environment.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"6 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":"134432735","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.5360881
Tong-Tao Li, M. Fei
To reduce the energy consumption and extend the network's survival time is the key research problem in the Wireless Sensor Network. Much research work has been done on the placement of nodes and routing protocol, eliminating data redundancy by density controlling and hierarchical clustering algorithm. In this paper, it is proposed that information fusion is an effective way to reduce the communication data, save the energy consumption and thereby extend the life of the network. With the specific analysis an information fusion algorithm based on rough set is designed.
{"title":"Information fusion in Wireless Sensor Network based on rough set","authors":"Tong-Tao Li, M. Fei","doi":"10.1109/ICNIDC.2009.5360881","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360881","url":null,"abstract":"To reduce the energy consumption and extend the network's survival time is the key research problem in the Wireless Sensor Network. Much research work has been done on the placement of nodes and routing protocol, eliminating data redundancy by density controlling and hierarchical clustering algorithm. In this paper, it is proposed that information fusion is an effective way to reduce the communication data, save the energy consumption and thereby extend the life of the network. With the specific analysis an information fusion algorithm based on rough set is designed.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"34 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":"133357195","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.5360828
Junying Sun, Boli Liu
RS (255, 223) is used as the outer code of concatenated system in CCSDS standard and its speed affects the speed of the whole system. This paper designs the decoder in frequency domain and introduces Good-Thomas prime factor algorithm to realize FFT of 255 point and 15 point, which impoves the decoding speed. The flow chart based on DSP is also presented.
{"title":"RS fast decoding in frequency domain based on DSP","authors":"Junying Sun, Boli Liu","doi":"10.1109/ICNIDC.2009.5360828","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360828","url":null,"abstract":"RS (255, 223) is used as the outer code of concatenated system in CCSDS standard and its speed affects the speed of the whole system. This paper designs the decoder in frequency domain and introduces Good-Thomas prime factor algorithm to realize FFT of 255 point and 15 point, which impoves the decoding speed. The flow chart based on DSP is also presented.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"219 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132914849","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.5360950
Sanghyeon Lee, Kyongkuk Cho, Kwanghun Kim, D. Yoon, T. Kim
IMT-Advanced system proposed by ITU-R for next generation mobile communications has the technical requirements of the performances of an improved broadcast, a multicast and a VoIP by supporting the transmission rates up to 100 Mbps for high mobility and 1 Gbps for low mobility. LTE-Advanced system is one of the leading candidates of IMT-Advanced systems and many telecommunications industries will introduce LTE-Advanced system widely. Therefore it is important to examine the performance of the technologies applied in LTE-Advanced system. In this paper, we analyze the performances of the transmission modes in the downlink spatial channel model of LTE-Advanced system.
{"title":"Performance analysis of LTE-Advanced system in the downlink spatial channel model","authors":"Sanghyeon Lee, Kyongkuk Cho, Kwanghun Kim, D. Yoon, T. Kim","doi":"10.1109/ICNIDC.2009.5360950","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360950","url":null,"abstract":"IMT-Advanced system proposed by ITU-R for next generation mobile communications has the technical requirements of the performances of an improved broadcast, a multicast and a VoIP by supporting the transmission rates up to 100 Mbps for high mobility and 1 Gbps for low mobility. LTE-Advanced system is one of the leading candidates of IMT-Advanced systems and many telecommunications industries will introduce LTE-Advanced system widely. Therefore it is important to examine the performance of the technologies applied in LTE-Advanced system. In this paper, we analyze the performances of the transmission modes in the downlink spatial channel model of LTE-Advanced system.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"111 6 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":"117249493","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
扫码关注我们
求助内容：
应助结果提醒方式：