In this paper, we propose the use of layered forward error correction (FEC) as an error control mechanism in a layered video protocol known as "SPLIT". By organizing FEC into multiple layers, a receiver can obtain different level of protection with respect to the channel capacity. By effectively dropping data layers, overall effective bandwidth can also be achieved. In our work, we integrated Reed-Solomon based FEC error control into SPLIT protocol, which is a priority based protocol. We used NS-2 simulator to evaluate FEC on SPLIT protocol and the results show that the video quality can be significantly improved at the same communication rate when layered FEC is used
{"title":"Multimedia Multicast Using SPLIT and Layered FEC","authors":"N. Chilamkurti, B. Soh","doi":"10.1109/ICITA.2005.185","DOIUrl":"https://doi.org/10.1109/ICITA.2005.185","url":null,"abstract":"In this paper, we propose the use of layered forward error correction (FEC) as an error control mechanism in a layered video protocol known as \"SPLIT\". By organizing FEC into multiple layers, a receiver can obtain different level of protection with respect to the channel capacity. By effectively dropping data layers, overall effective bandwidth can also be achieved. In our work, we integrated Reed-Solomon based FEC error control into SPLIT protocol, which is a priority based protocol. We used NS-2 simulator to evaluate FEC on SPLIT protocol and the results show that the video quality can be significantly improved at the same communication rate when layered FEC is used","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127196708","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}
In the online retrieving valuable information in special databases, it is important to protect the privacy of users preventing the server from knowing the information what the users retrieve. The problem was not solved until the privacy information retrieval (PIR) schemes were presented. A PIR scheme allows a user to retrieve a date item from online database while hiding the index of the data item from the database server. However, retrieving valuable information is another problem needs to be solved. Most transactions are completed by credit card through delivering its number and membership in the Internet to the server. Then the server knows the privacy of users. It becomes a challenge to private information retrieval (PIR) schemes considering the e-payment need. In this paper, we propose a new PIR scheme, which use a secure coprocessor (SC), with e-payment scheme for protecting the privacy of customers in querying valuable information. The scheme does not reveal personal information or buying information of customers in the Internet environment, it can really protect the customers' privacy. Comparing with previous PIR schemes, the scheme, combined with e-payment scheme in retrieving valuable information in special database, is more practical than previous PIR schemes in the Internet applications because of considering e-payment need
{"title":"Protecting Customer’s Privacy in Querying Valuable Information Combined with E-Payment Scheme","authors":"Chun-Hua Chen, Chi-Min Lan, G. Horng","doi":"10.1109/ICITA.2005.222","DOIUrl":"https://doi.org/10.1109/ICITA.2005.222","url":null,"abstract":"In the online retrieving valuable information in special databases, it is important to protect the privacy of users preventing the server from knowing the information what the users retrieve. The problem was not solved until the privacy information retrieval (PIR) schemes were presented. A PIR scheme allows a user to retrieve a date item from online database while hiding the index of the data item from the database server. However, retrieving valuable information is another problem needs to be solved. Most transactions are completed by credit card through delivering its number and membership in the Internet to the server. Then the server knows the privacy of users. It becomes a challenge to private information retrieval (PIR) schemes considering the e-payment need. In this paper, we propose a new PIR scheme, which use a secure coprocessor (SC), with e-payment scheme for protecting the privacy of customers in querying valuable information. The scheme does not reveal personal information or buying information of customers in the Internet environment, it can really protect the customers' privacy. Comparing with previous PIR schemes, the scheme, combined with e-payment scheme in retrieving valuable information in special database, is more practical than previous PIR schemes in the Internet applications because of considering e-payment need","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"52 27","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113990528","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}
The information explosion on the Internet makes it hard for users to obtain required information from the Web searched results in a more personalized way. For the same input word, most search engines return the same result to each user without taking into consideration user preference. For many users, it is no longer sufficient to get non-customized results. It is crucial to analyze users' search and browsing behaviors based on searching keywords entered by users, the clicking rate of each link in the result and the time they spend on each site. To this end, we have proposed a method to derive user searching profiles. We have also proposed a mechanism to derive document profiles, based on similarity score of documents. In this paper, we discuss how to use our model to combine the user searching profiles and the document profile, with a view to presenting customized search results to the users.
{"title":"Personalized Web search results with profile comparisons","authors":"J. Lai, B. Soh","doi":"10.1109/ICITA.2005.217","DOIUrl":"https://doi.org/10.1109/ICITA.2005.217","url":null,"abstract":"The information explosion on the Internet makes it hard for users to obtain required information from the Web searched results in a more personalized way. For the same input word, most search engines return the same result to each user without taking into consideration user preference. For many users, it is no longer sufficient to get non-customized results. It is crucial to analyze users' search and browsing behaviors based on searching keywords entered by users, the clicking rate of each link in the result and the time they spend on each site. To this end, we have proposed a method to derive user searching profiles. We have also proposed a mechanism to derive document profiles, based on similarity score of documents. In this paper, we discuss how to use our model to combine the user searching profiles and the document profile, with a view to presenting customized search results to the users.","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"193 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122507922","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}
Multi-carrier direct sequence code division multiple access (MC/DS CDMA) technique is one of the optimum technique for the reverse link mobile transmission. However, because of multi-carrier property, large PAPR (peak to average ratio) may be generated in MC/DS CDMA system. In this paper, DFT spreading code is applied to reduce high PAPR efficiently. As results, about 6 dB PAPR can be achieved at CCDF of 10 -3 in the MC/DS CDMA system with 12 data carriers. SER performance can be improved significantly compared with conventional MC/DS CDMA system with nonlinear HPA
{"title":"PAPR Reduction in MC/DS CDMA System by DFT Spreading Codes","authors":"Yingshan Li, Ju-Hyun Kyung, Jong-Won Son, H. Ryu","doi":"10.1109/ICITA.2005.205","DOIUrl":"https://doi.org/10.1109/ICITA.2005.205","url":null,"abstract":"Multi-carrier direct sequence code division multiple access (MC/DS CDMA) technique is one of the optimum technique for the reverse link mobile transmission. However, because of multi-carrier property, large PAPR (peak to average ratio) may be generated in MC/DS CDMA system. In this paper, DFT spreading code is applied to reduce high PAPR efficiently. As results, about 6 dB PAPR can be achieved at CCDF of 10 -3 in the MC/DS CDMA system with 12 data carriers. SER performance can be improved significantly compared with conventional MC/DS CDMA system with nonlinear HPA","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121605402","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}
Ying-Hong Wang, Jenhui Chen, Chih-Feng Chao, Chien-Min Lee
Mobile ad hoc networks (MANETs) enable all mobile nodes to communicate each other without base stations or access points, and the transfer of data packets is completed through the relay among all mobile nodes. However, a MANET is a self-organizing and adaptive wireless network formed by the dynamic gathering of mobile nodes, and the topology of a MANET frequently changes. To cope with the intrinsic properties of MANETs, a transparent cache-based mechanism is proposed in this paper. With the aid of the mechanism, the repetition of data and data path occurring in a MANET could be cached in some special mobile nodes. Routes and time span to access data are therefore shortened, and the data reusable rate is enhanced to reduce the use of bandwidth and the power consumption of battery
{"title":"A Transparent Cache-Based Mechanism for Mobile Ad Hoc Networks","authors":"Ying-Hong Wang, Jenhui Chen, Chih-Feng Chao, Chien-Min Lee","doi":"10.1109/ICITA.2005.47","DOIUrl":"https://doi.org/10.1109/ICITA.2005.47","url":null,"abstract":"Mobile ad hoc networks (MANETs) enable all mobile nodes to communicate each other without base stations or access points, and the transfer of data packets is completed through the relay among all mobile nodes. However, a MANET is a self-organizing and adaptive wireless network formed by the dynamic gathering of mobile nodes, and the topology of a MANET frequently changes. To cope with the intrinsic properties of MANETs, a transparent cache-based mechanism is proposed in this paper. With the aid of the mechanism, the repetition of data and data path occurring in a MANET could be cached in some special mobile nodes. Routes and time span to access data are therefore shortened, and the data reusable rate is enhanced to reduce the use of bandwidth and the power consumption of battery","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"138 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122915540","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}
Iris feature extraction is the crucial stage of the whole iris recognition process for personal identification. A brief survey is made firstly in this paper on the methods that feasibly implemented in iris feature extraction. Because the iris capture devices in use are mostly exposed to the natural scene, so the natural illumination or other variant conditions sometimes can greatly influence the iris images captured and further impact the recognition result. Out of this consideration, we made some experimental try to extract the iris feature using the 2D phase congruency, which invariant to changes in intensity or contrast, to try to avoid those problems
{"title":"Iris Feature Extraction Using 2D Phase Congruency","authors":"Xiaoyan Yuan, P. Shi","doi":"10.1109/ICITA.2005.166","DOIUrl":"https://doi.org/10.1109/ICITA.2005.166","url":null,"abstract":"Iris feature extraction is the crucial stage of the whole iris recognition process for personal identification. A brief survey is made firstly in this paper on the methods that feasibly implemented in iris feature extraction. Because the iris capture devices in use are mostly exposed to the natural scene, so the natural illumination or other variant conditions sometimes can greatly influence the iris images captured and further impact the recognition result. Out of this consideration, we made some experimental try to extract the iris feature using the 2D phase congruency, which invariant to changes in intensity or contrast, to try to avoid those problems","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"175 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126941413","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}
The proposed neural network controller (NNC) is for user/server level dynamic buffer tuning. It eliminates overflow by making the buffer length always cover the queue length adaptively on the fly. The NNC and the AQM (active queue management) mechanism(s) at the system/router level together form a unified buffer overflow prevention solution for the TCP channels. The NNC provides the following advantages: a) it prevents the AQM resources dished out already at the system level from being wasted, b) it shortens the service roundtrip time (RTT) by eliminating the chance of retransmission due to user-level overflow, and c) it alleviates network congestion. The NNC operates by the {0,/spl Delta/}/sup 2/ objective function and the principle is to maintain the given /spl Delta/ safety margin about the reference point symbolically represented by the "0" in {0,/spl Delta/}/sup 2/. The NNC stability and precision are traffic pattern independent for its statistical nature. This independence makes the NNC immensely suitable for Internet applications because Internet traffic can be LRD (long-range dependence), SRD (short-range dependence) or multifractal, and switch suddenly.
{"title":"A novel traffic independent NNC for dynamic buffer tuning to shorten the RTT of a TCP channel","authors":"Wilfred W. K. Lin, Allan K. Y. Wong, T. Dillon","doi":"10.1109/ICITA.2005.39","DOIUrl":"https://doi.org/10.1109/ICITA.2005.39","url":null,"abstract":"The proposed neural network controller (NNC) is for user/server level dynamic buffer tuning. It eliminates overflow by making the buffer length always cover the queue length adaptively on the fly. The NNC and the AQM (active queue management) mechanism(s) at the system/router level together form a unified buffer overflow prevention solution for the TCP channels. The NNC provides the following advantages: a) it prevents the AQM resources dished out already at the system level from being wasted, b) it shortens the service roundtrip time (RTT) by eliminating the chance of retransmission due to user-level overflow, and c) it alleviates network congestion. The NNC operates by the {0,/spl Delta/}/sup 2/ objective function and the principle is to maintain the given /spl Delta/ safety margin about the reference point symbolically represented by the \"0\" in {0,/spl Delta/}/sup 2/. The NNC stability and precision are traffic pattern independent for its statistical nature. This independence makes the NNC immensely suitable for Internet applications because Internet traffic can be LRD (long-range dependence), SRD (short-range dependence) or multifractal, and switch suddenly.","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"149 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131309997","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}
Pervasive computing is one of the hottest research areas in development of information technology. Among the identified key requirements for the software infrastructure of pervasive computing, such as adaptability, configurability, context and environment awareness, we focus the effort of study on the technology of reflection. In this paper, we introduce PURPLE, a reflective middleware platform which is designed and implemented to fit the very requirement of pervasive computing. And a performance analysis is given to evaluate the work.
{"title":"PURPLE: a reflective middleware for pervasive computing","authors":"Zhang Kuo, Wang Xiaoge, Wu Yanni, Zheng Zhenkun","doi":"10.1109/ICITA.2005.225","DOIUrl":"https://doi.org/10.1109/ICITA.2005.225","url":null,"abstract":"Pervasive computing is one of the hottest research areas in development of information technology. Among the identified key requirements for the software infrastructure of pervasive computing, such as adaptability, configurability, context and environment awareness, we focus the effort of study on the technology of reflection. In this paper, we introduce PURPLE, a reflective middleware platform which is designed and implemented to fit the very requirement of pervasive computing. And a performance analysis is given to evaluate the work.","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"121 15","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114046471","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}
In this paper, adaptive identification and control of nonlinear dynamical systems are investigated using two synaptic weight neural networks (TSWNN). Firstly, a novel approach to train the TWSWNN is introduced, which employs an adaptive fuzzy generalized learning vector quantization (AFGLVQ) technique and recursive least squares algorithm with variable forgetting factor (VRLS). The AFGLVQ adjusts the kernels of the TSWNN while the VRLS updates the connection weights of the network. The identification algorithm has the properties of rapid convergence and persistent adaptability that make it suitable for real-time control. Secondly, on the basis of the one-step ahead TSWNN predictor, the control law is optimized iteratively through a numerical stable Davidon's least squares-based (SDLS) minimization approach. A nonlinear example is simulated to demonstrate the effectiveness of the identification and control algorithms
{"title":"Application of Two Synaptic Weight Neural Networks for Nonlinear Control","authors":"Wenming Cao, Shoujue Wang","doi":"10.1109/ICITA.2005.72","DOIUrl":"https://doi.org/10.1109/ICITA.2005.72","url":null,"abstract":"In this paper, adaptive identification and control of nonlinear dynamical systems are investigated using two synaptic weight neural networks (TSWNN). Firstly, a novel approach to train the TWSWNN is introduced, which employs an adaptive fuzzy generalized learning vector quantization (AFGLVQ) technique and recursive least squares algorithm with variable forgetting factor (VRLS). The AFGLVQ adjusts the kernels of the TSWNN while the VRLS updates the connection weights of the network. The identification algorithm has the properties of rapid convergence and persistent adaptability that make it suitable for real-time control. Secondly, on the basis of the one-step ahead TSWNN predictor, the control law is optimized iteratively through a numerical stable Davidon's least squares-based (SDLS) minimization approach. A nonlinear example is simulated to demonstrate the effectiveness of the identification and control algorithms","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122856889","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}
Image shape coding is a core technique in MPEG-4. In the paper, we present a quad-tree-based technique for image object shape coding. Quad tree has been used to represent the image content since long time ago, it describes the hierarchy of various sizes of rectangular blocks that collectively constitute the image object area. Quad tree structure can be quite complicate to describe an image object with unsmooth boundary. We propose a block compensation and a run-length scheme to effectively attack the problem. Experimental results show that the algorithm is quite efficient in comparison with other methods.
{"title":"Quad-tree-based image shape coding with block compensation","authors":"Lih-Yang Wang, Ching-Hui Lai, Kuan-Ren Pan","doi":"10.1109/ICITA.2005.227","DOIUrl":"https://doi.org/10.1109/ICITA.2005.227","url":null,"abstract":"Image shape coding is a core technique in MPEG-4. In the paper, we present a quad-tree-based technique for image object shape coding. Quad tree has been used to represent the image content since long time ago, it describes the hierarchy of various sizes of rectangular blocks that collectively constitute the image object area. Quad tree structure can be quite complicate to describe an image object with unsmooth boundary. We propose a block compensation and a run-length scheme to effectively attack the problem. Experimental results show that the algorithm is quite efficient in comparison with other methods.","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122993470","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
扫码关注我们
求助内容：
应助结果提醒方式：