Pub Date : 2009-12-31DOI: 10.1109/ICNIDC.2009.5360902
Fuan Wen, Jian Zhang, Yan-ming Tian
This paper designs and implements an individualized multimedia e-learning platform, multi systems based on one platform are published for various learning groups such as primary and middle school students, college students, or students of adult education. It based on J2EE and adopts the popular open source architectures SSH (struts, spring and hibernate). The philosophy of the question and test driven (QTD) are realized in the platform. A set of function for learner guide, the process control and teaching evaluation is provided. The application turns out that the platform is reasonably designed and can fully meet the requirements of school or individual learners.
{"title":"Notice of RetractionDesign and application of an E-learning platform for various learning groups","authors":"Fuan Wen, Jian Zhang, Yan-ming Tian","doi":"10.1109/ICNIDC.2009.5360902","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360902","url":null,"abstract":"This paper designs and implements an individualized multimedia e-learning platform, multi systems based on one platform are published for various learning groups such as primary and middle school students, college students, or students of adult education. It based on J2EE and adopts the popular open source architectures SSH (struts, spring and hibernate). The philosophy of the question and test driven (QTD) are realized in the platform. A set of function for learner guide, the process control and teaching evaluation is provided. The application turns out that the platform is reasonably designed and can fully meet the requirements of school or individual learners.","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":"130114540","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.5360966
Caihong Zhang, Li Guo
This paper focuses on pre-coding schemes for the downlink of multiple user multi-input multi-output (MU-MIMO) system in cognitive radio (CR) network. The spectrum band can be utilized by allowing a number of cognitive users to coexist with primary users (PUs) through a pre-coding scheme. The capacity problems maximize the sum rate of CUs subject to the interference constraint for PUs and total transmitted power constraint can be solved with high complexity. To simplify the problem, this paper presents two suboptimal pre-coding schemes that pre-cancel the co-channel interference to PUs as well as mitigate interference between cognitive users (CUs). Simulation results show that the two suboptimal algorithms are able to achieve high sum rate throughput with low complexity.
{"title":"BD precoding schemes for cognitive MIMO system","authors":"Caihong Zhang, Li Guo","doi":"10.1109/ICNIDC.2009.5360966","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360966","url":null,"abstract":"This paper focuses on pre-coding schemes for the downlink of multiple user multi-input multi-output (MU-MIMO) system in cognitive radio (CR) network. The spectrum band can be utilized by allowing a number of cognitive users to coexist with primary users (PUs) through a pre-coding scheme. The capacity problems maximize the sum rate of CUs subject to the interference constraint for PUs and total transmitted power constraint can be solved with high complexity. To simplify the problem, this paper presents two suboptimal pre-coding schemes that pre-cancel the co-channel interference to PUs as well as mitigate interference between cognitive users (CUs). Simulation results show that the two suboptimal algorithms are able to achieve high sum rate throughput with low complexity.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"96 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":"129723297","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.5360784
Huanlin Liu, Junyu Pang,
An optical buffering architecture based-on traffic load selection was put forward for optical packet switching networks in the paper. For improving the limited fiber delay lines utilization, the segment shared buffering mechanism be used to configure the output fiber delay lines and the output/feedback shared buffer module configuration using degenerate model. When the traffic load is larger than threshold value, the output/feedback buffer module is worked on the feedback buffer mode. Otherwise, the output/feedback module is worked on the output buffer mode. So, the buffer mode can be selected flexible according to the traffic load. The analysis and simulation results show that this buffer architecture can decrease packet loss probability effectively and achieve reasonable average packet delay.
{"title":"A buffering architecture based-on traffic load selection scheduling for optical packet switching networks","authors":"Huanlin Liu, Junyu Pang,","doi":"10.1109/ICNIDC.2009.5360784","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360784","url":null,"abstract":"An optical buffering architecture based-on traffic load selection was put forward for optical packet switching networks in the paper. For improving the limited fiber delay lines utilization, the segment shared buffering mechanism be used to configure the output fiber delay lines and the output/feedback shared buffer module configuration using degenerate model. When the traffic load is larger than threshold value, the output/feedback buffer module is worked on the feedback buffer mode. Otherwise, the output/feedback module is worked on the output buffer mode. So, the buffer mode can be selected flexible according to the traffic load. The analysis and simulation results show that this buffer architecture can decrease packet loss probability effectively and achieve reasonable average packet delay.","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":"129428320","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.5360964
Yun Liu, Wenjie Li, Ran Cai, Qiong Sun, Xiaohua Huang, Yan Ma
Packet classification (PC) is one of the core technologies for next generation network service. The goal is to classify packet into different “flow” and classification result can be applied in Differentiated Service. Though many multi-dimensional classifications have been put forward, few of them could accomplish fast search speed, low storage requirements and fast updates at the same time, especially when these algorithms are revised from IPv4 to IPv6. In this paper, we present an innovative packet classification algorithm, called Partial Paralleled algorithm based on Plus Bits (P3). P3 algorithm begins by two paralleled single-field engines and followed by hash table of the remained 3 fields. A novel structure, Plus Bits, is introduced to reduce hash memory accesses. For a 4k filterset, P3 algorithm can achieve about 9 memory accesses on average, taking 326 KB of memory for its data structure and supporting incremental update. We show that our P3 algorithm can meet the demand of current PC requirements.
{"title":"An innovative paralleled packet algorithm with Plus Bits","authors":"Yun Liu, Wenjie Li, Ran Cai, Qiong Sun, Xiaohua Huang, Yan Ma","doi":"10.1109/ICNIDC.2009.5360964","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360964","url":null,"abstract":"Packet classification (PC) is one of the core technologies for next generation network service. The goal is to classify packet into different “flow” and classification result can be applied in Differentiated Service. Though many multi-dimensional classifications have been put forward, few of them could accomplish fast search speed, low storage requirements and fast updates at the same time, especially when these algorithms are revised from IPv4 to IPv6. In this paper, we present an innovative packet classification algorithm, called Partial Paralleled algorithm based on Plus Bits (P3). P3 algorithm begins by two paralleled single-field engines and followed by hash table of the remained 3 fields. A novel structure, Plus Bits, is introduced to reduce hash memory accesses. For a 4k filterset, P3 algorithm can achieve about 9 memory accesses on average, taking 326 KB of memory for its data structure and supporting incremental update. We show that our P3 algorithm can meet the demand of current PC requirements.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"82 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":"128031973","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.5360913
Eunjo Lee, Beomgu Kang, Sungkwon Park, Hosook Lee
Mobile access networks are being developed to support various multimedia services such as IPTV (Internet Protocol Television), VoD (Video on Demand), and high speed internet services. Especially, these networks are a point-to-multipoint method in which one MAG (Mobile Access Gateway) and many MNs (Mobile Node) are connected. In other words, if a mobile multimedia viewer is joining a specific multicast group over mobile access networks, the others receive the multimedia program at the same time although they do not belong to the same multicast group. However, the traditional IGMP versions do not allow immediate multimedia program sharing as explained about. Also, in traditional IGMP versions, a viewer always needs to send IGMP join report. This paper proposes IGMP extensions which improves group join and leave process in mobile access networks for multimedia services.
{"title":"IGMP extentions for mobile multimedia services","authors":"Eunjo Lee, Beomgu Kang, Sungkwon Park, Hosook Lee","doi":"10.1109/ICNIDC.2009.5360913","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360913","url":null,"abstract":"Mobile access networks are being developed to support various multimedia services such as IPTV (Internet Protocol Television), VoD (Video on Demand), and high speed internet services. Especially, these networks are a point-to-multipoint method in which one MAG (Mobile Access Gateway) and many MNs (Mobile Node) are connected. In other words, if a mobile multimedia viewer is joining a specific multicast group over mobile access networks, the others receive the multimedia program at the same time although they do not belong to the same multicast group. However, the traditional IGMP versions do not allow immediate multimedia program sharing as explained about. Also, in traditional IGMP versions, a viewer always needs to send IGMP join report. This paper proposes IGMP extensions which improves group join and leave process in mobile access networks for multimedia services.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"222 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":"129901960","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.5360791
Q. Meng, Bojin Zhuang, Fei Su
In this paper, a new joint Rate-distortion Optimization model based on texture and mean-error factors (TMJRDM) is proposed. Texture factor implies the subjective factor, giving the texture similarity measure between the original image and the target image. At the same time, mean-error factor gives the objective measure. The joint weighted value of texture and mean-error factors is calculated as the distortion metric, which balances the subjective and objective quality. Experimental results show that our proposed algorithm improves the subjective quality of the reconstructed images without obvious degradation of the objective quality.
{"title":"A new joint Rate-distortion Optimization model based on texture and mean-error factors","authors":"Q. Meng, Bojin Zhuang, Fei Su","doi":"10.1109/ICNIDC.2009.5360791","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360791","url":null,"abstract":"In this paper, a new joint Rate-distortion Optimization model based on texture and mean-error factors (TMJRDM) is proposed. Texture factor implies the subjective factor, giving the texture similarity measure between the original image and the target image. At the same time, mean-error factor gives the objective measure. The joint weighted value of texture and mean-error factors is calculated as the distortion metric, which balances the subjective and objective quality. Experimental results show that our proposed algorithm improves the subjective quality of the reconstructed images without obvious degradation of the objective quality.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"171 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":"128919885","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.5360951
Bin Sun, Wenzhi Zhang, Bin Yu
In this paper, we modify OLSR for MANET nodes to achieve full connection to Internet through multiple mobile gateways. We present a proactive mobile IP approach using Hello message and TC message to maintain the MANET nodes movement. The Mobile Gateway Multiple Metrics Selection algorithm can select the best one among the active multiple mobile gateways. The simulation result shows that our approach keeps the Mobile IP overhead costs lower than the existing schemes.
{"title":"Modify OLSR for MANET/Internet interconnecting with mobile gateways","authors":"Bin Sun, Wenzhi Zhang, Bin Yu","doi":"10.1109/ICNIDC.2009.5360951","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360951","url":null,"abstract":"In this paper, we modify OLSR for MANET nodes to achieve full connection to Internet through multiple mobile gateways. We present a proactive mobile IP approach using Hello message and TC message to maintain the MANET nodes movement. The Mobile Gateway Multiple Metrics Selection algorithm can select the best one among the active multiple mobile gateways. The simulation result shows that our approach keeps the Mobile IP overhead costs lower than the existing schemes.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"289 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":"122823491","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.5360981
Xiaoli Wu, Bo Xiao, Zhiqing Lin
User recommendation problem is important for mobile operators when they provide some new service to users. The traditional methods provide a low success rate. In this paper, we present a novel user selection method of advertising recommendation according to the maximal frequent items discovery theory. The experimental results demonstrate that our method can improve the success rate dramatically and reduce the amount of garbage advertisements.
{"title":"A user selection method in advertising recommendations","authors":"Xiaoli Wu, Bo Xiao, Zhiqing Lin","doi":"10.1109/ICNIDC.2009.5360981","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360981","url":null,"abstract":"User recommendation problem is important for mobile operators when they provide some new service to users. The traditional methods provide a low success rate. In this paper, we present a novel user selection method of advertising recommendation according to the maximal frequent items discovery theory. The experimental results demonstrate that our method can improve the success rate dramatically and reduce the amount of garbage advertisements.","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":"120896686","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
扫码关注我们
求助内容：
应助结果提醒方式：