{"title":"Bounded Relative Efficiency in Rare Event Simulation","authors":"H. Cancela, G. Rubino, B. Tuffin","doi":"10.1109/SAINTW.2005.43","DOIUrl":"https://doi.org/10.1109/SAINTW.2005.43","url":null,"abstract":"This paper investigates the robustness of rare event simulation estimators when rarity increases. The literature had up to now focused on bounded relative error (BRErr) or bounded normal approximation properties stating respectively that the relative size and the coverage error of the confidence interval are bounded whatever the rarity is. Using a reliability estimation problem, we show that there exists some efficient estimators for which BRErr is not verified. The efficiency is due to the fact that the number of estimations during a given simulation time increases with the rarity. We thus define a property called bounded relative efficiency ecompassing the examples of estimators verifying BRErr, and representing the actual property an analyst has to look at.","PeriodicalId":220913,"journal":{"name":"2005 Symposium on Applications and the Internet Workshops (SAINT 2005 Workshops)","volume":"251 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":"131450224","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 Framework of Numerical Basket Analysis","authors":"T. Washio, Atsushi Fujimoto, H. Motoda","doi":"10.1109/SAINTW.2005.9","DOIUrl":"https://doi.org/10.1109/SAINTW.2005.9","url":null,"abstract":"Basket Analysis is mathematically characterized and extended to search families of sets in this paper. These theories indicate the possibility of various new approaches of data mining. We demonstrate the potential through proposal of a novel approach QARMINT. It performs complete mining of generic QARs within a low time complexity which has not been well addressed in the past work. Its performance evaluation shows high practicality.","PeriodicalId":220913,"journal":{"name":"2005 Symposium on Applications and the Internet Workshops (SAINT 2005 Workshops)","volume":"18 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":"131257199","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":"IPv6 over the Silk Satellite Network","authors":"P. Kirstein, W. Fritsche, H. Frese, V. Lavrov","doi":"10.1109/SAINTW.2005.74","DOIUrl":"https://doi.org/10.1109/SAINTW.2005.74","url":null,"abstract":"The Silk network is a VSAT-based network connecting a number of NRENs in Central Asia and the Caucasus into the Internet. While most of the network uses IPv4, this paper discusses how it was possible to provide native IPv6 facilities onto the Network. Our initial experiences with that system are described.","PeriodicalId":220913,"journal":{"name":"2005 Symposium on Applications and the Internet Workshops (SAINT 2005 Workshops)","volume":"EI-17 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":"128165687","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":"Peculiarity Oriented Multi-Aspect Brain Data Analysis for Studying Human Multi-Perception Mechanism","authors":"Ning Zhong, S. Motomura, Jing-long Wu","doi":"10.1109/SAINTW.2005.94","DOIUrl":"https://doi.org/10.1109/SAINTW.2005.94","url":null,"abstract":"In order to investigate the structure of advanced human brain activities, various brain analysis methods are required. It has been observed that multiple brain data such as fMRI brain images and EEG brain waves extracted from human multi-perception mechanism involved in a particular task are peculiar ones with respect to the specific state or the relatedpart of a stimulus. Based on this point of view, we propose a way of peculiarity oriented mining for multi-aspect analysis in multiple human brain data, without using conventional image processing to fMRI brain images and frequency analysis to brain waves. The proposed approach provides a new wayfor automatic analysis and understanding of human brain data to replace human-expert centric visualization. We attempt to change the perspective of cognitive scientists from a single type of experimental data analysis towards a holistic view.","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":"122808034","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 Vector Space Retrieval Method with Causal Relationship Computation Functions for Event Data","authors":"Taizo Zushi, Kosuke Takano, Y. Kiyoki","doi":"10.1109/SAINTW.2005.23","DOIUrl":"https://doi.org/10.1109/SAINTW.2005.23","url":null,"abstract":"In this paper, we propose a vector space retrieval method with causal relationship computation functions for event data. The method is used for the domain in which a query given by a user can be regarded as an event. By expressing an event as a vector, causal relationships between events can be described as numerical values. This feature enables to set a level of importance on a specific event flexibly. The method can be applied to document retrieval with causal relationship computation. We clarify effectiveness of the method by showing several experimental results using synthetic event and document data sets.","PeriodicalId":220913,"journal":{"name":"2005 Symposium on Applications and the Internet Workshops (SAINT 2005 Workshops)","volume":"67 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120989891","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":"Electronic Patent Information: An Overview and Research Issues","authors":"V. Hassler","doi":"10.1109/SAINTW.2005.62","DOIUrl":"https://doi.org/10.1109/SAINTW.2005.62","url":null,"abstract":"The importance of intellectual property rights (IPR) protection in the world of e-economy is growing faster than ever. This paper gives some insights into one important IPR aspect, namely the online publication of patent information, and an overview of some related open issues, which represent interesting topics for further research.","PeriodicalId":220913,"journal":{"name":"2005 Symposium on Applications and the Internet Workshops (SAINT 2005 Workshops)","volume":"6 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":"130572366","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":"Experiences from Development and Operation of the UK6x Internet Exchange","authors":"J. King","doi":"10.1109/SAINTW.2005.63","DOIUrl":"https://doi.org/10.1109/SAINTW.2005.63","url":null,"abstract":"The theme of this paper centres on the experiences that have been gained from developing and operating an IPv6 Internet Exchange (IX). The UK6x has been in operation since 2001 and has become a well-respected connection point into the emerging IPv6 Internet. As will be illustrated, architecturally and operationally an IPv6 IX may be very different from a traditional IPv4 IX. Since 2002, the UK6x has been a key entity within the pan-European Euro6IX IPv6 network.","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":"115150631","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. Morita, Mitsuhiro Yuitou, T. Hidaka, Y. Hirakawa
{"title":"Visualization Methods Using Three-Dimensional Space for Auctions","authors":"T. Morita, Mitsuhiro Yuitou, T. Hidaka, Y. Hirakawa","doi":"10.1109/SAINTW.2005.117","DOIUrl":"https://doi.org/10.1109/SAINTW.2005.117","url":null,"abstract":"In auction services such as eBay or yahoo, bidders can select interesting items from among many different items. It takes a long time, however, to investigate various items’ attributes, such as the price, the bids, and the time left. On the other hand, it is possible to circulate large quantities of rich content such as image data by using broadband networks. To reduce the time required for investigating items in an auction service, we suggest three visualization methods using three-dimensional space, in which items are shown visually and the values of the items’ various attributes are mapped into positional information. We also show the results of an evaluation experiment indicating the effectiveness of the proposed methods.","PeriodicalId":220913,"journal":{"name":"2005 Symposium on Applications and the Internet Workshops (SAINT 2005 Workshops)","volume":"87 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":"115660155","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":"Context-Driven Adaptation of Trust Relationships in Pervasive Collaborative Environments","authors":"Antonio Corradi, R. Montanari, Daniela Tibaldi","doi":"10.1109/SAINTW.2005.46","DOIUrl":"https://doi.org/10.1109/SAINTW.2005.46","url":null,"abstract":"The growing diffusion of portable devices with wireless connectivity and the integration of telecommunication systems and the Internet enable users to benefit from anytime and anywhere impromptu collaboration. Security is crucial to ensure secure sharing of information, but calls for novel solutions capable of establishing trust relationships on-the-fly among previously unknown entities. Traditional trust solutions seem to be inappropriate in dynamic mobile environments. They typically rely on centralised trust certification authorities and assign to entities levels of trust that depend on static entity attributes, such as entity identity or role. However, entity identities/roles are often either not sufficiently informative or too limited to take adequate collaborative decisions. This paper presents a novel trust model that rules the assignment of trust to entities based on various dynamic context information, e.g., user/device location, device properties, user needs, local operating conditions. As key features, this model allows to determine, to associate and to adapt entity levels of trust depending on the contexts where users operate and users acquire/lose a level of trust when entering/leaving a specific context. The proposed model facilitates the update of trust relationships as relevant changes in context information occur. The paper also shows the implementation of the proposed model in the COMITY framework that provides support facilities for defining and enforcing context-based trust policies.","PeriodicalId":220913,"journal":{"name":"2005 Symposium on Applications and the Internet Workshops (SAINT 2005 Workshops)","volume":"45 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":"123796449","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":"P2P Contents Searching Method Using Evaluation of Semantic Vectors","authors":"Y. Yamato","doi":"10.1109/SAINTW.2005.93","DOIUrl":"https://doi.org/10.1109/SAINTW.2005.93","url":null,"abstract":"In the near future, since the huge amounts of contents (-Exa byte) are distributed over the networks, not only index server searching but also Peer-to-Peer (P2P) searching has been emphasized. Typical P2P search technologies have some problems, such as low search precision ratio and traffic explosions. In this paper, with ideas of the vector space method and CAN topology, I propose a new P2P contents searching method in which a query is effectively forwarded only to contents that are semantically similar to the desired contents and not forwarded to the same peer more than once. The effect of this method is estimated analytically, and a qualitative evaluation is conducted by simulation experiments.","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":"121105039","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}