{"title":"Agent frameworks in FCVW","authors":"E. Shakshuki, I. Tomek, Omkarnath Prabhu","doi":"10.1109/AINA.2005.79","DOIUrl":"https://doi.org/10.1109/AINA.2005.79","url":null,"abstract":"The need for frameworks in the software engineering field is being realized as the complexities and cost of software is increasing. Frameworks will provide an edge for any software industry in the 21st century. Frameworks of various kinds have been developed for many object oriented applications in the past but there have been very few attempts to develop agent frameworks in collaborative virtual environments. This paper presents the ongoing research to build agent frameworks for the federated collaborative virtual workspace (FCVW), our extension of MITRE's CVW (collaborative virtual workspace). We propose two types of agent frameworks namely the middleware and client framework. This paper focuses on client framework development and shows several types of agents that are in preparation for the development of a more general framework.","PeriodicalId":394157,"journal":{"name":"19th International Conference on Advanced Information Networking and Applications (AINA'05) Volume 1 (AINA papers)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121809813","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 scheme for authentication and authorization in a grid application","authors":"Heping Hu, Hanbing Yao","doi":"10.1109/AINA.2005.59","DOIUrl":"https://doi.org/10.1109/AINA.2005.59","url":null,"abstract":"One of the problems of designing a grid application is that, as the number of machines on the grid increases, it becomes very difficult to manage security and access control lists in a distributed and highly dynamic environment. In this article, we'll look at how to authentication and authorization in a grid application where machines can disconnect from the network at any time, and presents a scheme that allows users to register once and yet still provides the grid node the information they need to authenticate and authorize.","PeriodicalId":394157,"journal":{"name":"19th International Conference on Advanced Information Networking and Applications (AINA'05) Volume 1 (AINA papers)","volume":"119 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120818392","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":"Global indexing scheme for location-dependent queries in multi channels mobile broadcast environment","authors":"A. Waluyo, B. Srinivasan, D. Taniar","doi":"10.1109/AINA.2005.194","DOIUrl":"https://doi.org/10.1109/AINA.2005.194","url":null,"abstract":"Broadcast indexing is necessary to be applied in a wireless broadcast environment as such the scheme helps mobile clients to find the desired data instances efficiently. This is particularly important considering the inherent limitations in mobile environment. In this paper, we present a global indexing scheme for location dependent queries. The proposed scheme is designed to serve queries in which the query result is relevant to client's location. Global indexing scheme aims to minimise index access time while having all the advantages of index broadcasting. We develop a simulation model to find out the access time performance of global indexing scheme as compared to non-global indexing scheme. Additionally, we analyse the efficiency of valid scope used in the global index scheme as compared with an existing valid scope. It is found that global index performs substantially better than the existing indexing concept.","PeriodicalId":394157,"journal":{"name":"19th International Conference on Advanced Information Networking and Applications (AINA'05) Volume 1 (AINA papers)","volume":"224 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127003478","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":"Location-based-service roaming based on Web services","authors":"Chun-Te Wu, Hsing Mei","doi":"10.1109/AINA.2005.235","DOIUrl":"https://doi.org/10.1109/AINA.2005.235","url":null,"abstract":"Due to the rapid growth of personal mobile communication devices, more and more wireless mobile applications are developed. Location-based mobile application, one of the wireless mobile applications, becomes the future trend. However, the application execution environment is not complete. How to integrate the services among multiple telecommunication service providers? How to support the original location-based services for the mobile roaming users? This project is aimed at solving these problems efficiently. This paper proposes to integrate the roaming services into Web services infrastructure. In this case, the mobile users could get the location-based service during roaming. Integrating the location-based application into the Web services also solves the mobile roaming problem.","PeriodicalId":394157,"journal":{"name":"19th International Conference on Advanced Information Networking and Applications (AINA'05) Volume 1 (AINA papers)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115543623","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}
Jun-Ming Su, S. Tseng, Jui-Feng Weng, Kuan-Ting Chen, Yi-Lin Liu, Yi-Ta Tsai
{"title":"An object based authoring tool for creating SCORM compliant course","authors":"Jun-Ming Su, S. Tseng, Jui-Feng Weng, Kuan-Ting Chen, Yi-Lin Liu, Yi-Ta Tsai","doi":"10.1109/AINA.2005.115","DOIUrl":"https://doi.org/10.1109/AINA.2005.115","url":null,"abstract":"In this paper, based upon the concept of object oriented methodology (OOM), the complicated sequencing rules can be modularized into several basic components with corresponding sequencing rules in SN, called sequencing object (SO). Each SO is like a middleware, which represents a basic sequencing building block as a cluster in activity tree (AT) with some corresponding sequencing rules on the SCORM view and represents a basic sequencing graph on the users' view. By appropriately combining these SOs, users can easily construct a complex structure of course with desired learning guidance. Then, a transformation algorithm is also proposed to firstly transform the created graph based course structure into activity tree (AT) with related sequencing rules, and then package the transformed activity tree and related physical learning resources into a SCORM compliant course file. Moreover, the authoring tool can be easily upgraded by importing a new SO instead of redesigning the tool only for new SCORM version. Finally, a SCORM compliant course built by the object based authoring tool is executed on the SCORM RTE system. The results show that our approach is workable and efficient.","PeriodicalId":394157,"journal":{"name":"19th International Conference on Advanced Information Networking and Applications (AINA'05) Volume 1 (AINA papers)","volume":"195 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123033059","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}
Jeanne Chen, Tung-Shou Chen, Tzu-Hsin Tsai, H. Tsai, M. Hsieh, Shih-Shan Tang
{"title":"Using the ACM technique to refine protein spots in 2DGE images","authors":"Jeanne Chen, Tung-Shou Chen, Tzu-Hsin Tsai, H. Tsai, M. Hsieh, Shih-Shan Tang","doi":"10.1109/AINA.2005.339","DOIUrl":"https://doi.org/10.1109/AINA.2005.339","url":null,"abstract":"For a biologist, accurate protein information on 2DGE images is very important for making decisive diagnostics. The proposed scheme in this paper is to combine a local threshold technique with the ACM technique to enhance detections for protein spots. First, the 2DGE image is normalized with thresholds calculated using Otsu's algorithm. The normalized image is then transformed into a black-and-white local threshold image where the ACM technique is applied to increase detections for protein spots. With this technique, more lighter-colored protein spots can be detected.","PeriodicalId":394157,"journal":{"name":"19th International Conference on Advanced Information Networking and Applications (AINA'05) Volume 1 (AINA papers)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116995913","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":"Secure OLSR","authors":"Fan Hong, Liang Hong, Cai Fu","doi":"10.1109/AINA.2005.305","DOIUrl":"https://doi.org/10.1109/AINA.2005.305","url":null,"abstract":"Mobile ad hoc networks (MANET) is a new networking paradigm for wireless hosts. Because of infrastructureless, self-organization, dynamic topology and openness of wireless links, the routing security problem in MANET is more seriously than in wired networks. Optimized link state routing (OLSR) (T. Clausen et al., 2003) is proposed by IETF's MANET Group at 2003. In OLSR, neighbor detection is not invulnerable when two bad nodes perform wormhole attack. Furthermore, OLSR's security cannot simply rely on IPSec, because OLSR's packets are often broadcasted and IPsec provides end-to-end security. In this paper, we propose a solution to secure OLSR, which apply the wormhole detective mechanism and authentication to strengthen the neighbor relationship establishment, and use hash-chain and digital signature to protect the routing packets.","PeriodicalId":394157,"journal":{"name":"19th International Conference on Advanced Information Networking and Applications (AINA'05) Volume 1 (AINA papers)","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117099401","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 practical modelling notation for secure distributed computation","authors":"Yih-Jiun Lee, P. Henderson","doi":"10.1109/AINA.2005.48","DOIUrl":"https://doi.org/10.1109/AINA.2005.48","url":null,"abstract":"Mobile code computation has lead to a new paradigm of distributed computation. A mobile process can move from site to site and interact with the resources as a local process. To prevent the misuse of resources, authentication and authorization need to be dealt with. Many modeling languages have been proposed to model distributed computation; Ambient Calculus (Cardelli, 1998) is one of them. Ambient Calculus, a type of process calculus, can be used to model boundary crossing activities in a mathematical notation. SJAN, a modeling language, extends the basic idea of Ambient Calculus, but it has a simple notation, design and representation. SJAN can be verified by J-Ambient, a JAVA implementation, to certify the correctness of the model. In this paper, the authors introduced SJAN notation and J-Ambient. SJAN could be also used to model grid computation and provides the security consideration. Thus, finally, several security scenarios in SJAN were addressed to show its functionality.","PeriodicalId":394157,"journal":{"name":"19th International Conference on Advanced Information Networking and Applications (AINA'05) Volume 1 (AINA papers)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129861559","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 of relationship between video contents and subjective video quality for Internet broadcasting","authors":"Y. Kato, Atsushi Honda, K. Hakozaki","doi":"10.1109/AINA.2005.90","DOIUrl":"https://doi.org/10.1109/AINA.2005.90","url":null,"abstract":"This paper analyzes relationship between video contents and subjective video quality for Internet broadcasting, and applies the results to the rate control methods. In this analysis, we classify video programs into some groups in which a large majority of users feel the same subjective video quality. We investigate the relationship by conducting an experiment with method of paired comparisons, and express that as equations by multiple linear regression analysis.","PeriodicalId":394157,"journal":{"name":"19th International Conference on Advanced Information Networking and Applications (AINA'05) Volume 1 (AINA papers)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128247309","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":"Efficient key management based on the subset difference method for secure group communication","authors":"Yuichi Nakamura, H. Kikuchi","doi":"10.1109/AINA.2005.172","DOIUrl":"https://doi.org/10.1109/AINA.2005.172","url":null,"abstract":"A new algorithm for efficient key management for secure group communication in wireless ad hoc network with mobile nodes is presented. In order to address the dynamic receiver update operations such as leave or join, the subset difference (SD) method proposed by Naor et al. is introduced. The SD method allows senders to reduce drastically the size of ciphertext to be sent to 2r-1 using a pseudo random number generator, where r is the number of revoked users (who leave the group). In the SD method, the subsets of authorized users are represented by some differences of two subsets such that i covers valid users and j excludes the revoked users in i. To have all subsets (i,j) necessary to cover all valid users in a tree, a sender has to test all possible combinations of revoked users. A naive exhaustive search for the purpose takes O(r/sup 3/) time. This is a drawback of the SD method. Hence, to address the issue for finding the cover, we propose a new efficient algorithm to reduce the cost up to O(rlog r logn) by introducing the technique for indexing nodes to be dealt with in the necessary subsets. In addition, we implement the proposed algorithm and demonstrate the performance in terms of processing time in this paper.","PeriodicalId":394157,"journal":{"name":"19th International Conference on Advanced Information Networking and Applications (AINA'05) Volume 1 (AINA papers)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125166146","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}