{"title":"Admission control algorithm of multi-service cellular relay system","authors":"Lijuan Wu, Weiyu Fan, Yuan Ren, P. Gong","doi":"10.1109/ICNIDC.2010.5657822","DOIUrl":"https://doi.org/10.1109/ICNIDC.2010.5657822","url":null,"abstract":"This paper investigated the admission control problem in multi-service cellular relay system with orthogonal frequency division multiplexing access (OFDMA). Subjected to a hard constraint on the quality-of-service (QoS) requirements and the capability of relay, the admission problem could be described as the problem of maximizing the amount of subcarriers saved by relaying transmission. With further consideration of the user's selection of relays and the competence among users, several new algorithms were proposed. Meanwhile, the application in multi-service scenario was taken into account, and the effect caused by the ratio of services with different transmission rate requirements was studied. Simulation results verify that the presented algorithms can obtain more admitted users, less block probability and more saved subcarriers, thus effectively enhancing the system capacity and resource utilization.","PeriodicalId":348778,"journal":{"name":"2010 2nd IEEE InternationalConference on Network Infrastructure and Digital Content","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121026781","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}
{"title":"Closed form expressions of the minimum L2-sensitivity realizations for all-pass digital filters","authors":"Shunsuke Yamaki, M. Abe, M. Kawamata","doi":"10.1109/ICNIDC.2010.5657944","DOIUrl":"https://doi.org/10.1109/ICNIDC.2010.5657944","url":null,"abstract":"This paper presents closed form expressions of the minimum L2-sensitivity realizations of all-pass digital filters. We first prove that the L2-sensitivity minimization problem can be solved analytically if the all second-order modes of a digital filter are equal. We focus on the fact that the second-order modes of all-pass digital filters are all unity. As a result, it is clarified that the minimum L2-sensitivity realization of an all-pass digital filter is equal to the balanced realization, of which closed form expression can be derived analytically.","PeriodicalId":348778,"journal":{"name":"2010 2nd IEEE InternationalConference on Network Infrastructure and Digital Content","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116368301","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}
{"title":"An improved side information refinement using color-texture features for distributed video coding","authors":"Mengjie Hou, Aidong Men, Bo Yang","doi":"10.1109/ICNIDC.2010.5657778","DOIUrl":"https://doi.org/10.1109/ICNIDC.2010.5657778","url":null,"abstract":"Side Information (SI) generation is a key function in the DVC decoder, and plays a critical impact on the compression efficiency. This paper proposes an improved side information generation scheme of transform domain distributed video coding considering a novel content-based side information refinement technique, which is performed with the color and texture features to segment the side information into different regions with different reliance. Then the low-reliance regions' side information could be corrected by 3-D recursive search. In addition, an adaptive overlapped block motion compensation technique is implemented to improve performance on the base of results from the content-based approach. Experiments illustrated that a significant improvement of performance has been achieved by the proposed approach compared to the cases without it.","PeriodicalId":348778,"journal":{"name":"2010 2nd IEEE InternationalConference on Network Infrastructure and Digital Content","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126015476","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}
{"title":"HVS based visual quality assessment for digital cinema environment","authors":"Dongqi Cai, Fang Wei","doi":"10.1109/ICNIDC.2010.5657784","DOIUrl":"https://doi.org/10.1109/ICNIDC.2010.5657784","url":null,"abstract":"Giving a reliable quality assessment to a movie before it is released to the general public can guarantee cinemagoers a satisfying visual sensation, yet there is no assessment algorithm based on human vision system considering the specific viewing conditions. This paper takes into account some viewing conditions, such as image luminance, ambient light, screen size, image resolution and viewing distance, and proposes a novel quality assessment algorithm based on HVS for digital cinema environment. Experiments using contents from the Digital Cinema Initiative (DO) Standard Evaluation Material show that the proposed metric well simulates the subjective assessment and performs more sensitive than traditional objective quality assessment algorithms.","PeriodicalId":348778,"journal":{"name":"2010 2nd IEEE InternationalConference on Network Infrastructure and Digital Content","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123786785","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}
Desheng Li, Na Deng, Gang Tan, Chuanchang Liu, Junliang Chen
{"title":"Algorithm for QOS-aware web service composition based on flow path tree with probabilities","authors":"Desheng Li, Na Deng, Gang Tan, Chuanchang Liu, Junliang Chen","doi":"10.1109/ICNIDC.2010.5657934","DOIUrl":"https://doi.org/10.1109/ICNIDC.2010.5657934","url":null,"abstract":"This paper first presents a novel model for QoS-aware web services composition based on workflow patterns, and an executing path tree with probability. Then a discrete PSO algorithm is proposed to fit our model, which also requires some other preliminary algorithms, such as the generation of all reachable paths and executing path tree. The experiments show the performance of that algorithm and its advantages, compared with genetic algorithm. Finally, we suggest some drawbacks of it and future works.","PeriodicalId":348778,"journal":{"name":"2010 2nd IEEE InternationalConference on Network Infrastructure and Digital Content","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128744175","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}
{"title":"An analysis and improvement of 3GPP SAE AKA protocol based on strand space model","authors":"Jiexiang Fang, R. Jiang","doi":"10.1109/ICNIDC.2010.5657890","DOIUrl":"https://doi.org/10.1109/ICNIDC.2010.5657890","url":null,"abstract":"In this paper, we first analyze the novel 3GPP SAE AKA protocol proposed by Deng et al., and point out the flaws of protocol's authentication, and then we give an attack to the protocol. Moreover, we propose an improved 3GPP SAE AKA protocol, which can keep the frame of the 3GPP's protocol and overcome the security shortages of the D-AKA protocol. Finally, the security of the improved protocol is formally proved with the strand space model and authentication tests.","PeriodicalId":348778,"journal":{"name":"2010 2nd IEEE InternationalConference on Network Infrastructure and Digital Content","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132836875","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}
{"title":"An extended PIM-SM for efficient data transmission in IPTV services","authors":"J. Ko, Sungkwon Park, Eunjo Lee","doi":"10.1109/ICNIDC.2010.5657907","DOIUrl":"https://doi.org/10.1109/ICNIDC.2010.5657907","url":null,"abstract":"IPTV is defined as multimedia services delivered over IP based networks. This can be performed using the PIM-SM multicast routing architecture which enable IP multicast routing on existing IP networks. The RP is required for network running PIM-SM, and the RP location changes the efficiency of multicast data packets. In general, the PIM-SM is consisted of a shared tree for keep-alive packets and a source-based tree for sending out large data. Therefore, the RP utilization is very high when the access network uses PIM-SM. And PIM-SM protocol cannot be applied in different architectures with access networks such as PON, HFC. In this paper, we propose a new PIM-SM protocol which reduces processes of traditional PIM-SM protocol in IPTV services. The proposed a new PIM-SM protocol can reduce the number of processes for RPT configuration and can deliver multicast data packets immediately through the SPT. Therefore, the RP utilization in extended PIM-SM improves than traditional PIM-SM.","PeriodicalId":348778,"journal":{"name":"2010 2nd IEEE InternationalConference on Network Infrastructure and Digital Content","volume":"93 9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130364865","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}
{"title":"Chinese coding type identification based on Kolmogorov complexity theory","authors":"Gang He, Ning Zhu, Xiaochun Wu, Qiuchen Xu","doi":"10.1109/ICNIDC.2010.5657789","DOIUrl":"https://doi.org/10.1109/ICNIDC.2010.5657789","url":null,"abstract":"Identification of Chinese coding type is a major and challenging issue in Chinese web content audit and analysis. In this paper we develop a novel algorithm based on the theory of Kolmogorov complexity to identify the coding type of Chinese characters of a given text segment. An array of text compressors are used as filters to evaluate the information distance of text under examination and the training corpus coded in different coding type. The information distance can be used to decide the coding type according to the Kolmogorov theory. In this paper a particular compressing algorithm is used to minimize computing complexity by separating coding book training stage and compressing stage. Finally, we present the experimental results through which the accuracy and performance of the algorithm is confirmed. The result also proves that this algorithm is especially efficient when short text segment is under examination comparing with the n-gram algorithms.","PeriodicalId":348778,"journal":{"name":"2010 2nd IEEE InternationalConference on Network Infrastructure and Digital Content","volume":"414 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116557986","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}
{"title":"A novel framework for content-based video copy detection","authors":"Hui Zhang, Zhicheng Zhao, A. Cai, Xiaohui Xie","doi":"10.1109/ICNIDC.2010.5657881","DOIUrl":"https://doi.org/10.1109/ICNIDC.2010.5657881","url":null,"abstract":"Content-based copy detection (CBCD) recently has appeared a promising technique for video monitoring and copyright protection. In this paper, a novel framework for CBCD is proposed. Robust global features and local Speeded Up Robust Features (SURF) are first combined to describe video contents, and the density sampling method is proposed to improve the generation of visual codebook. Secondly, Smith-Waterman algorithm is introduced to find the similar video segments, meanwhile, a video matching method based on visual codebook is proposed to calculate the similarity of copy videos. Finally, a hierarchical fusion scheme is used to refine the detection results. Experiments on TRECVID dataset show that the proposed framework gives better results than the average results of CBCD task in TRECVID 2008.","PeriodicalId":348778,"journal":{"name":"2010 2nd IEEE InternationalConference on Network Infrastructure and Digital Content","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116823618","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}
Mingfeng Zhao, Yajian Zhou, Dongxiao Ren, Yixian Yang
{"title":"A minimum power consumption scheme for two-way relay with physical-layer network coding","authors":"Mingfeng Zhao, Yajian Zhou, Dongxiao Ren, Yixian Yang","doi":"10.1109/ICNIDC.2010.5657874","DOIUrl":"https://doi.org/10.1109/ICNIDC.2010.5657874","url":null,"abstract":"In this paper, we discuss physical-layer network coding (PLNC) in the two-way decode-forward (DF) relay to obtain total minimum power consumption (MPC) for the entire transmission process. The MPC and power allocation scheme for each node are obtained under a predetermined constraint of outage probability threshold in a Rayleigh fading channel environment. Numerical experimental results confirm that the proposed MPC scheme achieves much lower power consumption ratio than the existing schemes without PLNC on the condition of the same system outage guarantee.","PeriodicalId":348778,"journal":{"name":"2010 2nd IEEE InternationalConference on Network Infrastructure and Digital Content","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128181523","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}