{"title":"RFID-Based Location Information Management System with Privacy Awareness","authors":"M. Iwai, H. Tokuda","doi":"10.1109/SAINTW.2005.101","DOIUrl":"https://doi.org/10.1109/SAINTW.2005.101","url":null,"abstract":"Recently, many types of RFID products has been developed and used to tightly bind the ID tag to users’ personal information in an application. This has brought up new social problems where RFID tags can be detected from other RFID readers without the user being conscious of the transaction. In this paper, we provide a location management system named Tachyon. Tachyon defines policy files which describe the privacy of the user’s location information. In Tachyon, users can expose their location information with a privacy policy. Additionally, Tachyon can reduce the cost of building distributed location management system.","PeriodicalId":220913,"journal":{"name":"2005 Symposium on Applications and the Internet Workshops (SAINT 2005 Workshops)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122343928","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":"Dynamic User Interface Adaptation for Mobile Computing Devices","authors":"Mario Bisignano, G. Modica, O. Tomarchio","doi":"10.1109/SAINTW.2005.60","DOIUrl":"https://doi.org/10.1109/SAINTW.2005.60","url":null,"abstract":"A large number of heterogeneous and mobile computing devices nowadays are employed by users to access services they have subscribed to. The work of application developers, which have to maintain several versions of user interface for a single application, is becoming more and more difficult, error-prone and time consuming. New software development models, able to easily adapt the application to the client execution context, have to be exploited. In this work we present a framework that allows developers to specify the user interaction with the application, in an independent manner with respect to the specific execution context, by using an XML-based language. Starting from such a specification, the system will subsequently \"render\" the actual user’s application interface on a specific execution environment, adapting it to the used terminal characteristics.","PeriodicalId":220913,"journal":{"name":"2005 Symposium on Applications and the Internet Workshops (SAINT 2005 Workshops)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126846988","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}
Naoki Fukuta, T. Osawa, T. Iijima, Takahira Yamaguchi
{"title":"On Implementing Ontology-Based Semantic Application Integration Framework for Web-Based Portals","authors":"Naoki Fukuta, T. Osawa, T. Iijima, Takahira Yamaguchi","doi":"10.1109/SAINTW.2005.87","DOIUrl":"https://doi.org/10.1109/SAINTW.2005.87","url":null,"abstract":"One of the goals of computational intelligence is to coordinate various distributed data sources and services to compose more complex services that cover more than provided by a single service. The semantic grid [4] is proposed that integrates grid technologies and semanticWeb technologies by providing semantic annotations of grid services and data sources. We argue that technologies for automated composition of services are also useful for constructing statically composed service cooperating system(called ‘services integration system’). In this paper, we propose a framework that supports the development of services integration systems. It helps portal site developers to discover, evaluate, and execute service chaining paths for services integration systems. Semi-automated source code generation will reduce the cost of services integration system development.","PeriodicalId":220913,"journal":{"name":"2005 Symposium on Applications and the Internet Workshops (SAINT 2005 Workshops)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124077923","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":"Perfect Simulation of Queueing Networks with Blocking and Rejection","authors":"J. Vincent","doi":"10.1109/SAINTW.2005.95","DOIUrl":"https://doi.org/10.1109/SAINTW.2005.95","url":null,"abstract":"Traditional product form property of Markovian queueing networks usually is vanished when capacity of queues are finite and clients are blocked or rejected. A new efficient simulation method, derived from Propp & Wilson [11] perfect simulation, is applied to the finite capacity queues context. We present an algorithm to sample directly states of the network according to stationary distribution. This method has been applied to large queueing networks and some examples are given : loss estimation on Erlang models, usage of the last queue in a line of queues with blocking, saturation estimation for a multi-stage interconnection switch.","PeriodicalId":220913,"journal":{"name":"2005 Symposium on Applications and the Internet Workshops (SAINT 2005 Workshops)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124157609","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":"Some Results for GIX/M/s/c Queues","authors":"F. Ferreira, A. Pacheco","doi":"10.1109/SAINTW.2005.106","DOIUrl":"https://doi.org/10.1109/SAINTW.2005.106","url":null,"abstract":"We address the time dependent and steady-state analysis of the number of customers in a GIX/M/s/c queuing system at prearrivals of batches. As a corollary, we derive the continuous time steady-state distribution of the number of customers in the system in continuous time. The obtained closed form solutions are easy to compute, as they involve only combinatorial calculations and mixed-Poisson probabilities or mixed-Poisson expected values. Finally, the steady-state distribution of the number of customers seen by customers at their arrival to the system, blocking probability and mean and variance of the waiting times in queue of non-blocked costumers are derived.","PeriodicalId":220913,"journal":{"name":"2005 Symposium on Applications and the Internet Workshops (SAINT 2005 Workshops)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126416152","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":"Numerical Construction and Social Fracture","authors":"Aldo Levy","doi":"10.1109/SAINTW.2005.86","DOIUrl":"https://doi.org/10.1109/SAINTW.2005.86","url":null,"abstract":"The world digitalization of the economic exchanges and the deficit of individual competences that it generated, dug a new social ditch. Formerly only economic, it was more or less reabsorbed by financial remedies. But the development of the means of communication henceforth rejects populations which cannot communicate any more between them. However there exists for the moment no solution human or technological and this social fracture weighs down until the unbearable one, the cost of the numerical construction.","PeriodicalId":220913,"journal":{"name":"2005 Symposium on Applications and the Internet Workshops (SAINT 2005 Workshops)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127961266","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}
T. Okuda, T. Miyamoto, Susumu Takeuchi, K. Harumoto, S. Shimojo
{"title":"Unified Architecture for Managing User Profiles","authors":"T. Okuda, T. Miyamoto, Susumu Takeuchi, K. Harumoto, S. Shimojo","doi":"10.1109/SAINTW.2005.115","DOIUrl":"https://doi.org/10.1109/SAINTW.2005.115","url":null,"abstract":"Most of ubiquitous applications use proprietary information source to make user’s profile. And these information sources are not inter-operable with other applications. We developed the unified architecture for managing user’s profiles which can provides integrated access to the various information source as a form of user’s profiles and provides unified method to obtain user’s profile for the application. Using proposed architecture, ubiquitous applications can be developed more easily, and newly developed service or sensor can be integrated into existing applications quickly.","PeriodicalId":220913,"journal":{"name":"2005 Symposium on Applications and the Internet Workshops (SAINT 2005 Workshops)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134243120","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":"Computing Closed-Form Stochastic Bounds on Transient Distributions of Markov Chains","authors":"M. B. Mamoun, N. Pekergin","doi":"10.1109/SAINTW.2005.1620025","DOIUrl":"https://doi.org/10.1109/SAINTW.2005.1620025","url":null,"abstract":"In {3, 2} we have defined a particular class of time homogeneous discrete time Markov chains, called class C, having closed-form steady-state solution. In this paper, we show that transient distributions of this particular class have also closed-form solutions. Therefore, it is possible to apply the stochastic comparison approach to compute bounds on transient distributions by means of the closed-form solutions. This approach may be attractive for high-speed networks, where QoS requirements are the thresholds and exact values are not necessary.","PeriodicalId":220913,"journal":{"name":"2005 Symposium on Applications and the Internet Workshops (SAINT 2005 Workshops)","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124553104","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":"Optimization of Scheduling Algorithms Parameters in a DiffServ Environment","authors":"D. Adami, S. Giordano, M. Pagano, R. Secchi","doi":"10.1109/SAINTW.2005.91","DOIUrl":"https://doi.org/10.1109/SAINTW.2005.91","url":null,"abstract":"In this paper, we evaluate the performance achieved by DWRR and WFQ, the widespread implementations of frame-based and sorted-priority schedulers respectively, in a high speed DiffServ environment. Using deterministic upper bounds of the end-to-end delay, we evaluate the schedulers behavior for a wide range of bandwidth configurations. Our analysis highlights the drawbacks of using frame-based scheduling with respect to sorted-priority when dealing with multiple classes of service. As a consequence, we propose a configuration of scheduler weights, which allows to contain the loss in performance of frame-based schemes, while minimizing the end-to-end delay for premium classes. Extensive simulations confirm our theoretical propositions and show the effectiveness of our method in satisfying hard quality of service requirements even in highly congested networks.","PeriodicalId":220913,"journal":{"name":"2005 Symposium on Applications and the Internet Workshops (SAINT 2005 Workshops)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128606648","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":"Semantic Platform for Context-Aware Publish/Subscribe M-Commerce","authors":"S. Berkovsky, Yaniv Eytani","doi":"10.1109/SAINTW.2005.103","DOIUrl":"https://doi.org/10.1109/SAINTW.2005.103","url":null,"abstract":"With the increasing popularity of mobile handheld devices, there is a pressing need for context-aware publish/subscribe systems over mobile environment. Publish/subscribe systems connect between information providers (publishing information in form of events) and the interested information consumers (subscribing to a particular category of events). We propose a novel approach for semantic context-aware publish/subscribe systems. Our approach replaces the traditional notion of manual subscription with a new form of automatic context-aware subscription, based on the user's location, personal preferences and interests. This has a potential of raising the quality of use in mobile publish/subscribe applications.","PeriodicalId":220913,"journal":{"name":"2005 Symposium on Applications and the Internet Workshops (SAINT 2005 Workshops)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115420913","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}