In this paper, we propose an efficient approach to maintaining data consistency of broadcast data in mobile computing environments. At the server a special read-only transaction, the broadcast transaction, is scheduled to read data entities from the database for broadcasting data. Obviously, traditional concurrency control algorithms are inadequate and inefficient as the broadcast transaction creates numerous data conflicts with other update transactions, which are concurrently accessing the same set of data entities. Some algorithms for global-reading of databases, Shade Test and Color Test could be a solution. However, we observe that they have also some deficiencies. Therefore, we devise a new and efficient algorithm called Look-Ahead Protocol (LAP) to address this problem. The simulation results show that our algorithm outperforms all existing algorithms
{"title":"Using Look-Ahead Protocol for Mobile Data Broadcast","authors":"K. Lam, C. Wong, William Leung","doi":"10.1109/ICITA.2005.299","DOIUrl":"https://doi.org/10.1109/ICITA.2005.299","url":null,"abstract":"In this paper, we propose an efficient approach to maintaining data consistency of broadcast data in mobile computing environments. At the server a special read-only transaction, the broadcast transaction, is scheduled to read data entities from the database for broadcasting data. Obviously, traditional concurrency control algorithms are inadequate and inefficient as the broadcast transaction creates numerous data conflicts with other update transactions, which are concurrently accessing the same set of data entities. Some algorithms for global-reading of databases, Shade Test and Color Test could be a solution. However, we observe that they have also some deficiencies. Therefore, we devise a new and efficient algorithm called Look-Ahead Protocol (LAP) to address this problem. The simulation results show that our algorithm outperforms all existing algorithms","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":"114681302","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 novel RTPD/MACSC model proposed in this paper tunes the cache size adoptively on the fly. It combines the extant MACSC (model for adaptive cache size control) and the novel RTPD (real-time traffic pattern detection) capability. Similar to its MACSC predecessor, the new RTPD/MACSC tuner maintains the given cache hit ratio consistently and persistently. It, however, differs from its predecessor because it adapts itself to compensate for the ill effects on the cache hit ratio by the Internet traffic, which embeds various patterns over time. The automatic adaptation (self-tuning) capability in response to traffic pattern changes detected by the RTPD is called self-reconfiguration in the RTPD/MACSC context
{"title":"Using Real-Time Traffic Pattern Detection for Dynamic Cache Size Tuning in Information Retrieval","authors":"Richard S. L. Wu, Allan K. Y. Wong, T. Dillon","doi":"10.1109/ICITA.2005.301","DOIUrl":"https://doi.org/10.1109/ICITA.2005.301","url":null,"abstract":"The novel RTPD/MACSC model proposed in this paper tunes the cache size adoptively on the fly. It combines the extant MACSC (model for adaptive cache size control) and the novel RTPD (real-time traffic pattern detection) capability. Similar to its MACSC predecessor, the new RTPD/MACSC tuner maintains the given cache hit ratio consistently and persistently. It, however, differs from its predecessor because it adapts itself to compensate for the ill effects on the cache hit ratio by the Internet traffic, which embeds various patterns over time. The automatic adaptation (self-tuning) capability in response to traffic pattern changes detected by the RTPD is called self-reconfiguration in the RTPD/MACSC context","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"4 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":"116970170","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 complexity of the ubiquitous constant modulus algorithm (CMA) can be reduced by applying a sign operation to the CMA error function, while a sign operator generally can be seen as a 1-bit (two-level) mid-riser quantization. However, in order to preserve the information lost as a result of quantization processes, dithering is commonly used. In this paper, we evaluate the performance of dithered signed-error CMA utilizing a dithering signal that has sinusoidal probability density function. The algorithm has also been applied for equalization in wireless communication channel, which is distorted by multi-path propagation. Simulation results show that dithering using sinusoidal distribution outperforms the dithering using uniform distribution in terms of convergence speed.
{"title":"Performance of sinusoidally-distributed dithering for signed-error constant modulus algorithm","authors":"J. Jusak, Z. M. Hussain","doi":"10.1109/ICITA.2005.214","DOIUrl":"https://doi.org/10.1109/ICITA.2005.214","url":null,"abstract":"The complexity of the ubiquitous constant modulus algorithm (CMA) can be reduced by applying a sign operation to the CMA error function, while a sign operator generally can be seen as a 1-bit (two-level) mid-riser quantization. However, in order to preserve the information lost as a result of quantization processes, dithering is commonly used. In this paper, we evaluate the performance of dithered signed-error CMA utilizing a dithering signal that has sinusoidal probability density function. The algorithm has also been applied for equalization in wireless communication channel, which is distorted by multi-path propagation. Simulation results show that dithering using sinusoidal distribution outperforms the dithering using uniform distribution in terms of convergence speed.","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"92 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":"117296897","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 a mobile agent based environment personal data can be stolen, leaked or sent out to unauthorized persons by malicious mobile agents. In this paper we describe a new architecture and mechanism for user privacy protection in mobile agent based service domain. Agents meet at a protected and encapsulated agent computing environment from where they are not allowed to communicate with the outside world and also are not allowed to leave the platform. All the agents are killed at the host and the computation result is sent to respective parties by the trusted agent meeting and executing platform
{"title":"Privacy Protection in Mobile Agent Based Service Domain","authors":"M. N. Huda, S. Yamada, E. Kamioka","doi":"10.1109/ICITA.2005.218","DOIUrl":"https://doi.org/10.1109/ICITA.2005.218","url":null,"abstract":"In a mobile agent based environment personal data can be stolen, leaked or sent out to unauthorized persons by malicious mobile agents. In this paper we describe a new architecture and mechanism for user privacy protection in mobile agent based service domain. Agents meet at a protected and encapsulated agent computing environment from where they are not allowed to communicate with the outside world and also are not allowed to leave the platform. All the agents are killed at the host and the computation result is sent to respective parties by the trusted agent meeting and executing platform","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"114 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":"115124326","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}
Dynamic environments such as that of any public and private infrastructure, workplace and even home consist of multiple entities that continuously interact with each other. Integrating an intelligent security system in such an environment necessitates the need for a soft systems approach that gives perspective to such interactions through identifying associated holons. The holonic analysis allows characterisation of ill-defined and often problematic situations that are resultant of the human activity system. This paper discusses some techniques that can be adopted to resolve scenarios that are plagued with uncertainty in reasoning and the continuously varying nature of interrelationship between native entities. The technical aspect of this system encompasses the mode of query processing and surveillance through a structured sensor network set up with the aid of distributed services and network protocols
{"title":"SAFE Model Approach to Construction of Intelligent Security Systems","authors":"Z. Chaczko, S. Sinha","doi":"10.1109/ICITA.2005.243","DOIUrl":"https://doi.org/10.1109/ICITA.2005.243","url":null,"abstract":"Dynamic environments such as that of any public and private infrastructure, workplace and even home consist of multiple entities that continuously interact with each other. Integrating an intelligent security system in such an environment necessitates the need for a soft systems approach that gives perspective to such interactions through identifying associated holons. The holonic analysis allows characterisation of ill-defined and often problematic situations that are resultant of the human activity system. This paper discusses some techniques that can be adopted to resolve scenarios that are plagued with uncertainty in reasoning and the continuously varying nature of interrelationship between native entities. The technical aspect of this system encompasses the mode of query processing and surveillance through a structured sensor network set up with the aid of distributed services and network protocols","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"1 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":"123272382","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 near future, people will be able to access information and resources on the public open network environment. However, few current network environments seem to have unified method for protection of information and resource. This paper proposes a unified resource protection scheme on the basis of fusion of two multi-agent systems called Kodama and VPC. Kodama has the power of constructing flexible hierarchical logical spaces, and VPC has the ability to dynamically change its behavior according to the circumstance of user. As a protection scheme, two kinds of policies called public policy and private policy are introduced into the fused multi-agent system. Combination of these policies makes it possible to realize an open and secure information sharing system. We show practical sample applications using the scheme
{"title":"Rights Sensitive Information Sharing Space Based on Multi-Agent System","authors":"S. Amamiya, M. Amamiya","doi":"10.1109/ICITA.2005.239","DOIUrl":"https://doi.org/10.1109/ICITA.2005.239","url":null,"abstract":"In the near future, people will be able to access information and resources on the public open network environment. However, few current network environments seem to have unified method for protection of information and resource. This paper proposes a unified resource protection scheme on the basis of fusion of two multi-agent systems called Kodama and VPC. Kodama has the power of constructing flexible hierarchical logical spaces, and VPC has the ability to dynamically change its behavior according to the circumstance of user. As a protection scheme, two kinds of policies called public policy and private policy are introduced into the fused multi-agent system. Combination of these policies makes it possible to realize an open and secure information sharing system. We show practical sample applications using the scheme","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"37 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":"123306019","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}
IPv6 site multihoming discussed at the Multi6 working group is one of the hottest topics among many IPv6 related issues in the IETF. We have already proposed a variant of end-to-end multihoming (E2E-MH), where an outgoing packet from a site is routed to a site-exit router by source address dependent (SAD) routing so that it goes out to the transit provider that gives the address prefix of the source address of it. In this paper, we first show that such SAD routing can be implemented with acceptable cost when we apply SAD routing only to default route entries on each router. Next we propose a hierarchical subdivision method for automatic address prefix assignment to links in a site. Connecting the SAD routing setting up on each router with the hierarchical address assignment, all needed configuration of routers can automatically be done, without any pre-configurations about IP address or routing information.
{"title":"Automatic address assignment for IPv6 end-to-end multihoming sites","authors":"K. Ohira, Youichi Koyama, K. Fujikawa, Y. Okabe","doi":"10.1109/ICITA.2005.79","DOIUrl":"https://doi.org/10.1109/ICITA.2005.79","url":null,"abstract":"IPv6 site multihoming discussed at the Multi6 working group is one of the hottest topics among many IPv6 related issues in the IETF. We have already proposed a variant of end-to-end multihoming (E2E-MH), where an outgoing packet from a site is routed to a site-exit router by source address dependent (SAD) routing so that it goes out to the transit provider that gives the address prefix of the source address of it. In this paper, we first show that such SAD routing can be implemented with acceptable cost when we apply SAD routing only to default route entries on each router. Next we propose a hierarchical subdivision method for automatic address prefix assignment to links in a site. Connecting the SAD routing setting up on each router with the hierarchical address assignment, all needed configuration of routers can automatically be done, without any pre-configurations about IP address or routing information.","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"1 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":"123688721","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}
This paper describes an attempt to develop a fuzzy data aggregation technique for analyzing data collected during a groupware usability study. We show the formal parallelism between the decision making problem and that of ranking alternatives in a usability study. This equivalence allows using a combination of decision under uncertainty and multi-criteria decision making (MCDM) techniques for ranking alternatives for developing an approach for ranking alternatives within a usability study. The effectiveness of such approach is then illustrated with experimental data gathered during a usability study conducted by the Ambient Technology Group in Middlesex University.
{"title":"Using fuzzy functions to aggregate usability study data: a novel approach","authors":"S. Ramalingam, D. Iourinski","doi":"10.1109/ICITA.2005.296","DOIUrl":"https://doi.org/10.1109/ICITA.2005.296","url":null,"abstract":"This paper describes an attempt to develop a fuzzy data aggregation technique for analyzing data collected during a groupware usability study. We show the formal parallelism between the decision making problem and that of ranking alternatives in a usability study. This equivalence allows using a combination of decision under uncertainty and multi-criteria decision making (MCDM) techniques for ranking alternatives for developing an approach for ranking alternatives within a usability study. The effectiveness of such approach is then illustrated with experimental data gathered during a usability study conducted by the Ambient Technology Group in Middlesex University.","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"294 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":"124173532","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}
Dynamic composing Web services provides an efficient mechanism to offer complex large systems. Substantial progress has already been made towards composing Web services. Unfortunately, these approaches cannot build a model of the whole life cycle of composed Web services. In order to solve this problem, we designed a model named Service-Cloud model based on the forming picture of clouds in nature. Service-Cloud model can describe the whole life cycle of the composed Web services: discovery, compose, publish, and terminate. Based on Service-Cloud model, we also designed and implemented a prototype
{"title":"Service-Cloud Model of Composed Web Services","authors":"Yanping Chen, Zeng-zhi Li, Li Wang, Huaizhou Yang","doi":"10.1109/ICITA.2005.251","DOIUrl":"https://doi.org/10.1109/ICITA.2005.251","url":null,"abstract":"Dynamic composing Web services provides an efficient mechanism to offer complex large systems. Substantial progress has already been made towards composing Web services. Unfortunately, these approaches cannot build a model of the whole life cycle of composed Web services. In order to solve this problem, we designed a model named Service-Cloud model based on the forming picture of clouds in nature. Service-Cloud model can describe the whole life cycle of the composed Web services: discovery, compose, publish, and terminate. Based on Service-Cloud model, we also designed and implemented a prototype","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"58 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":"126344339","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
扫码关注我们
求助内容：
应助结果提醒方式：