Pub Date : 2004-03-29DOI: 10.1109/AINA.2004.1283946
Young-Gab Kim, Chang-Joo Moon, Dae-Ha Park, D. Baik
The services in the OSGi framework environment are deployed dynamically according to the service gateway and the life-cycle of a service bundle. Services also have interactions with other services. In this paper, we propose a bundle authentication mechanism considering characteristics for the home gateway environment. We design the key exchange mechanism for exchanging a key and propose the service bundle authentication mechanism based on MAC that use a shared secret created in the bootstrapping step. Service bundle authentication mechanism we propose is more efficient than PKI-based bundle authentication mechanism or RSH protocol in the service platform, which has restricted resources such as storage space and operations.
{"title":"A service bundle authentication mechanism in the OSGi service platform","authors":"Young-Gab Kim, Chang-Joo Moon, Dae-Ha Park, D. Baik","doi":"10.1109/AINA.2004.1283946","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283946","url":null,"abstract":"The services in the OSGi framework environment are deployed dynamically according to the service gateway and the life-cycle of a service bundle. Services also have interactions with other services. In this paper, we propose a bundle authentication mechanism considering characteristics for the home gateway environment. We design the key exchange mechanism for exchanging a key and propose the service bundle authentication mechanism based on MAC that use a shared secret created in the bootstrapping step. Service bundle authentication mechanism we propose is more efficient than PKI-based bundle authentication mechanism or RSH protocol in the service platform, which has restricted resources such as storage space and operations.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132165487","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 multimedia museum guide system is developed and presented in the paper. In contrast with conventional cassette audio tape exhibition tours, the presented museum guide system is implemented on palm-based personal digital assistants (PDAs), so as to provide a multimedia touring experience for visitors. Moreover, the museum guide system is capable of being aware of the current position of the visitor, and then automatically retrieves the related multimedia information of the exhibit that the visitor is gazing at. As the visitor walks up to another exhibit, without any clicks or operations, the screen on the PDA will be changed to the related multimedia information of that exhibit automatically. Basically, the developed museum guide system plays the role of a personal guide assistant, so as to construct the mobile learning environment in museums.
{"title":"Requirement analysis and implementation of palm-based multimedia museum guide systems","authors":"Li-Der Chou, Chia-Hsieh Wu, Shih-Pang Ho, Chen-Chow Lee, Jui-Ming Chen","doi":"10.1109/AINA.2004.1283936","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283936","url":null,"abstract":"A multimedia museum guide system is developed and presented in the paper. In contrast with conventional cassette audio tape exhibition tours, the presented museum guide system is implemented on palm-based personal digital assistants (PDAs), so as to provide a multimedia touring experience for visitors. Moreover, the museum guide system is capable of being aware of the current position of the visitor, and then automatically retrieves the related multimedia information of the exhibit that the visitor is gazing at. As the visitor walks up to another exhibit, without any clicks or operations, the screen on the PDA will be changed to the related multimedia information of that exhibit automatically. Basically, the developed museum guide system plays the role of a personal guide assistant, so as to construct the mobile learning environment in museums.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127850758","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 : 2004-03-29DOI: 10.1109/AINA.2004.1283906
Y. Chan, Chinchen Chang
The similarity video retrieval problem is traditionally solved by calculating all the possible distances of image matching between each frame v in the database video frame sequences and each frame q in the query frame sequence. Obviously, it is a time-consuming strategy. This paper offers a new technique called the piecewise method to overcome this drawback. The basic concept of this method is that the image matching distance between the pair of frames q and v is computed only if q is similar to v. In most cases, the executive time of this method is less than that of traditional methods. However, the piecewise method cannot accurately retrieve the videos satisfying the requirement of the query frame sequence from the database. This paper provides another more precise video retrieval method based on video shot, that is the piecewise refinement method, to remedy this shortcoming. It is a revision of the piecewise method. Experimental results show that the piecewise refinement method gives an impressive performance not only in processing time but also in storage space.
{"title":"Spatial video retrieval based on the piecewise method","authors":"Y. Chan, Chinchen Chang","doi":"10.1109/AINA.2004.1283906","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283906","url":null,"abstract":"The similarity video retrieval problem is traditionally solved by calculating all the possible distances of image matching between each frame v in the database video frame sequences and each frame q in the query frame sequence. Obviously, it is a time-consuming strategy. This paper offers a new technique called the piecewise method to overcome this drawback. The basic concept of this method is that the image matching distance between the pair of frames q and v is computed only if q is similar to v. In most cases, the executive time of this method is less than that of traditional methods. However, the piecewise method cannot accurately retrieve the videos satisfying the requirement of the query frame sequence from the database. This paper provides another more precise video retrieval method based on video shot, that is the piecewise refinement method, to remedy this shortcoming. It is a revision of the piecewise method. Experimental results show that the piecewise refinement method gives an impressive performance not only in processing time but also in storage space.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"27 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133791744","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 : 2004-03-29DOI: 10.1109/AINA.2004.1283968
Tao-Ku Chang, Gwan-Hwan Hwang
XSLT is a very popular and flexible language for transforming XML documents which provides a powerful implementation of a tree-oriented transformation language for transmuting instances of XML using a single vocabulary into a desired output. In this paper, we propose a processing model that enables the XSLT processor to encrypt and decrypt XML documents. Our model supports a more general encryption scope than previous models. The implementation and experimental results demonstrate the practicality of the proposed model.
{"title":"Using the extension function of XSLT and DSL to secure XML documents","authors":"Tao-Ku Chang, Gwan-Hwan Hwang","doi":"10.1109/AINA.2004.1283968","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283968","url":null,"abstract":"XSLT is a very popular and flexible language for transforming XML documents which provides a powerful implementation of a tree-oriented transformation language for transmuting instances of XML using a single vocabulary into a desired output. In this paper, we propose a processing model that enables the XSLT processor to encrypt and decrypt XML documents. Our model supports a more general encryption scope than previous models. The implementation and experimental results demonstrate the practicality of the proposed model.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114843665","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 : 2004-03-29DOI: 10.1109/AINA.2004.1283912
Ren-Junn Hwang, Chinchen Chang
An efficient (v, r, n)-fairness secret sharing scheme is proposed in this paper. In the proposed scheme, all participants have an equal probability to recover the shared secret, even if there exist v cheaters, v < r/2, among the n participants. To put it another way, if the cheater can recover the shared secret in the recovery phase, the honest participants can recover the shared secret too, and vice versa. Furthermore, we show that our (v, r, n)-fairness secret sharing scheme is more efficient than Lee and Laih's scheme.
{"title":"Enhancing the efficiency of (v, r, n)-fairness secret sharing scheme","authors":"Ren-Junn Hwang, Chinchen Chang","doi":"10.1109/AINA.2004.1283912","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283912","url":null,"abstract":"An efficient (v, r, n)-fairness secret sharing scheme is proposed in this paper. In the proposed scheme, all participants have an equal probability to recover the shared secret, even if there exist v cheaters, v < r/2, among the n participants. To put it another way, if the cheater can recover the shared secret in the recovery phase, the honest participants can recover the shared secret too, and vice versa. Furthermore, we show that our (v, r, n)-fairness secret sharing scheme is more efficient than Lee and Laih's scheme.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"61 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117223397","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 : 2004-03-29DOI: 10.1109/AINA.2004.1283935
L. S. Lam, Jack Y. B. Lee, S. Liew, Wei Wang
The lack of end-to-end quality of service support in the current Internet has caused significant difficulties to ensuring playback continuity in video streaming applications. This study addresses this challenge by investigating a new adaptation algorithm to adjust the bit-rate of video data in response to the network bandwidth available to improve playback continuity. Unlike previous works, the proposed algorithm is transparent to the video client, requires no parameter tuning, and yet can outperform existing algorithms. This paper presents this algorithm, evaluates and compares its performance with the best algorithm currently available using extensive trace-driven simulations.
{"title":"A transparent rate adaptation algorithm for streaming video over the Internet","authors":"L. S. Lam, Jack Y. B. Lee, S. Liew, Wei Wang","doi":"10.1109/AINA.2004.1283935","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283935","url":null,"abstract":"The lack of end-to-end quality of service support in the current Internet has caused significant difficulties to ensuring playback continuity in video streaming applications. This study addresses this challenge by investigating a new adaptation algorithm to adjust the bit-rate of video data in response to the network bandwidth available to improve playback continuity. Unlike previous works, the proposed algorithm is transparent to the video client, requires no parameter tuning, and yet can outperform existing algorithms. This paper presents this algorithm, evaluates and compares its performance with the best algorithm currently available using extensive trace-driven simulations.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127182051","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 : 2004-03-29DOI: 10.1109/AINA.2004.1283954
C. Bouras, A. Gkamas, D. Primpas, K. Stamos
OpenH323 is an open source H.323 implementation that has been ported to IPv6. In this paper we briefly introduce the library architecture and the performance criteria with which the ported version should be evaluated. We then present a variety of experiments that we conducted in order to comparatively evaluate the IPv4 and IPv6 protocol stacks. We also present the results of some initial experiments comparing IPv4 and IPv6 performance under congested network links and the conclusions that they lead us to.
{"title":"Performance evaluation of an IPv6-capable H323 application","authors":"C. Bouras, A. Gkamas, D. Primpas, K. Stamos","doi":"10.1109/AINA.2004.1283954","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283954","url":null,"abstract":"OpenH323 is an open source H.323 implementation that has been ported to IPv6. In this paper we briefly introduce the library architecture and the performance criteria with which the ported version should be evaluated. We then present a variety of experiments that we conducted in order to comparatively evaluate the IPv4 and IPv6 protocol stacks. We also present the results of some initial experiments comparing IPv4 and IPv6 performance under congested network links and the conclusions that they lead us to.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"141 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127329265","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 : 2004-03-29DOI: 10.1109/AINA.2004.1283847
K. Go, Yasuaki Takamoto, John Millar Carroll
We report a case study of designing a mobile phone of the future, involving participatory requirements elicitation using a form of scenario-based design. Participants took photographs and wrote essays that illustrate their personal interests and perspectives on given themes. They then analyzed the photos and essays. They created scenarios and posed questions about the scenarios to envision contexts of future use. The participants produced novel design concepts and provided design insights even though they had no design training.
{"title":"Designing a mobile phone of the future: requirements elicitation using photo essays and scenarios","authors":"K. Go, Yasuaki Takamoto, John Millar Carroll","doi":"10.1109/AINA.2004.1283847","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283847","url":null,"abstract":"We report a case study of designing a mobile phone of the future, involving participatory requirements elicitation using a form of scenario-based design. Participants took photographs and wrote essays that illustrate their personal interests and perspectives on given themes. They then analyzed the photos and essays. They created scenarios and posed questions about the scenarios to envision contexts of future use. The participants produced novel design concepts and provided design insights even though they had no design training.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130107803","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 : 2004-03-29DOI: 10.1109/AINA.2004.1283918
T. Nakashima
In this paper, we will show the experimental analysis of network load propagation properties of Internet paths using our IP performance active measurement method. This method sends ICMP T1MESTAMP messages and receives reply messages to and from each node along the path. After collecting and analyzing the delay fluctuations and loss occurrences, we extracted following results. First, delays are classified two types, burst-type delays and cyclic delays. Second, burst-type delays caused by loads on intermediate routers were propagated to each node throughout the path. Third, cyclic delays were peculiar to each node and had time intervals of 30 or 60 seconds. Fourth, forward trip time included cyclic delays and backward trip time included burst-type delays. Finally, scattered losses occurred along paths through one of the providers.
{"title":"Experimental analysis of propagation properties implementing the path-based measurement","authors":"T. Nakashima","doi":"10.1109/AINA.2004.1283918","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283918","url":null,"abstract":"In this paper, we will show the experimental analysis of network load propagation properties of Internet paths using our IP performance active measurement method. This method sends ICMP T1MESTAMP messages and receives reply messages to and from each node along the path. After collecting and analyzing the delay fluctuations and loss occurrences, we extracted following results. First, delays are classified two types, burst-type delays and cyclic delays. Second, burst-type delays caused by loads on intermediate routers were propagated to each node throughout the path. Third, cyclic delays were peculiar to each node and had time intervals of 30 or 60 seconds. Fourth, forward trip time included cyclic delays and backward trip time included burst-type delays. Finally, scattered losses occurred along paths through one of the providers.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130585908","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 : 2004-03-29DOI: 10.1109/AINA.2004.1283810
Hui Guo, Jing-li Zhou, Ou Yangkai, Sheng-sheng Yu
With the number of users wanting to share and access data across enterprise networks and the Internet is increasing dramatically, network administrators now find that their server and network backbones lack the capacity to handle the increased traffic. To achieve highly efficient connectivity between backbones and servers, and higher bandwidth of server network interface, we provide a method named as Ethernet links bundling technology (EIB). It is a high-speed networking solution that builds upon fast Ethernet technology to provide a dramatic increase in network performance. The implementation methods of the EIB technology are given and performance experiments are conducted. The results show that the network bandwidth can be scaled by the bundling of multiple Ethernet links and more reliable network connectivity can be guaranteed. And we also demonstrated that the EIB technology can be practically used in real applications such as FTP and SAMBA.
{"title":"A design and evaluation of Ethernet links bundling systems","authors":"Hui Guo, Jing-li Zhou, Ou Yangkai, Sheng-sheng Yu","doi":"10.1109/AINA.2004.1283810","DOIUrl":"https://doi.org/10.1109/AINA.2004.1283810","url":null,"abstract":"With the number of users wanting to share and access data across enterprise networks and the Internet is increasing dramatically, network administrators now find that their server and network backbones lack the capacity to handle the increased traffic. To achieve highly efficient connectivity between backbones and servers, and higher bandwidth of server network interface, we provide a method named as Ethernet links bundling technology (EIB). It is a high-speed networking solution that builds upon fast Ethernet technology to provide a dramatic increase in network performance. The implementation methods of the EIB technology are given and performance experiments are conducted. The results show that the network bandwidth can be scaled by the bundling of multiple Ethernet links and more reliable network connectivity can be guaranteed. And we also demonstrated that the EIB technology can be practically used in real applications such as FTP and SAMBA.","PeriodicalId":186142,"journal":{"name":"18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004.","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130713171","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
扫码关注我们
求助内容：
应助结果提醒方式：