检索结果-内蒙古大学图书馆

Privacy recovery with disposable Email addresses

IEEE Security and Privacy 2003年第6期1卷 35-39页

作者： Seigneur, Jean-Marc Jensen, Christian Damsgaard Trinity College Dublin Technical University of Denmark Distributed Systems Group Department of Computer Science Trinity College Dublin Informatics Department Technical University of Denmark

The use of the disposable email address (DEA) services as privacy recovery mechanism is discussed. The DEA privacy recovery mechanism provides user protection against spams. The DEA services help user manage the process of using and creating different email addresses. The basic categories of privacy protection mechanism, including awareness, detection, prevention, response and recovery, are also discussed.

关键词： Data privacy

来源：评论

学校读者我要写书评

暂无评论

Harnessing the potential of mobile personal data repositories 36

Harnessing the potential of mobile personal data repositorie...

引用

36th Annual Hawaii International Conference on System sciences, HICSS 2003

作者： Karypidis, A. Lalis, S. Distributed Systems Laboratory Institute of Computer Science Foundation for Research and Technology Hellas Greece Department of Computer and Communications Engineering University of Thessaly Greece

ISBN: (纸本)0769518745

In this paper we argue in favor of remote data access based on the principle of abstract data types. This paradigm has inherent advantages over the traditional file-oriented approach, especially when used in a ubiquitous computing environment, where data producers and consumers can be distributed and emerge dynamically. The 'datlet', a mobile storage device that implements the proposed approach, is presented in detail. We also discuss how a datlet can be embedded in everyday objects to create hybrid information objects, leading to an intuitive information manipulation model. © 2003 IEEE.

关键词： Virtual storage

来源：评论

学校读者我要写书评

暂无评论

Enabling design evolution in software through pattern oriented approach

引用

9th International Conference on Object-Oriented Information systems, OOIS 2003

作者： Ram, D. Janaki Rajasree, M.S. Distributed and Object Systems Lab Department of Computer Science and Engineering Indian Institute of Technology Madras Chennai India

ISBN: (纸本)3540408606

Architectural erosion in software systems results due to the drifting of code from the existing design. This drifting happens because the changes in code supporting evolving requirements, are not reflected back in the design. The ability to control software artifacts produced in various stages of the software development lifecycle is very crucial. Powerful abstractions for modeling software design is essential for supporting evolution. We propose a pattern oriented approach to software development using patterns as building blocks of architecture. We argue that design evolution in software can best be achieved by replacing existing patterns in the design with new patterns addressing present requirements. Support for design evolution by means of a model for pattern substitution is also presented. Using this model, the design is gracefully evolved and the design changes are seamlessly mapped to code thus preventing architectural erosion. © Springer-Verlag Berlin Heidelberg 2003.

关键词： Software design

来源：评论

学校读者我要写书评

暂无评论

Supporting mobility in content-based publish/subscribe middleware

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2003年 2672卷 103-122页

作者： Fiege, Ludger Gärtner, Felix C. Kasten, Oliver Zeidler, Andreas Department of Computer Science Databases Distributed System Group D-64283 Darmstadt Germany School of Computer and Communication Sciences Distributed Programming Laboratory CH-1015 Lausanne Switzerland Department of Computer Science Distributed Systems Group CH-8092 Zurich Switzerland

Publish/subscribe (pub/sub) is considered a valuable middleware architecture that proliferates loose coupling and leverages reconfigurability and evolution. Up to now, existing pub/sub middleware was optimized for static systems where users as well as the underlying system structure were rather fixed. We study the question whether existing pub/sub middleware can be extended to support mobile and location-dependent applications. We first analyze the requirements of such applications and distinguish two orthogonal forms of mobility the system-centric physical mobility and an application-centric logical mobility (where users are aware that they are changing location). We introduce location-dependent subscriptions as a suitable means to exploit the power of the event-based paradigm in mobile applications. Briefly spoken, location-dependency refines a subscription to accept only events related to a mobile user's current location. Implementations for both forms of mobility are presented within the content-based pub/sub middleware REBECA, drawing from its refined routing capabilities (namely, covering and merging). © IFIP International Federation for Information Processing 2003.

关键词： Location

来源：评论

学校读者我要写书评

暂无评论

The applicability of social models for self-organizing real-time systems

The applicability of social models for self-organizing real-...

引用

International Parallel and distributed Processing Symposium, IPDPS 2003

作者： Gu, Dazhang Welch, Lonnie R. Bruggeman, Carl Shelly, Robert Center for Intelligent Distributed and Dependable Systems School of Electrical Engineering and Computer Science Ohio University United States Department of Sociology and Anthropology Ohio University United States

ISBN: (纸本)0769519261

Adaptive resource management (ARM) technology has emerged as a way to: (1) support applications' varying resource needs, and (2) provide reusable solutions to commonly occurring problems. Most existent works on ARM have focused on centralized approaches. However, centralized ARMs are not scalable, which may result in slow responses and wrong allocation decisions based on inaccurate system state information. In this paper, we show how to address these problems with a decentralized resource management approach. Based on social models, the approach appears to have the potential to provide prompt and accurate allocation of resources. © 2003 IEEE.

关键词： Real time systems

来源：评论

学校读者我要写书评

暂无评论

The tangible file system

The tangible file system

引用

International Conference on distributed Computing systems Workshop

作者： A. Karypidis S. Lalis Distributed Systems Laboratory Foundation for Research & Technology Hellas Institute for Computer Science Greece Department of Computer and Communication Engineering University of Thessally Greece

The "tangible file system"/sup 1/ is a document management and access infrastructure for the ubiquitous computing era. It provides a transparent user interface which takes advantage of physical user actions for the purpose of directory management, data sharing and document location tracking. This is achieved by digitally augmenting both documents and document containers to detect the location of physical information and to trigger corresponding update actions in the electronic world. The system is built using the Datlet [9] architecture to allow any 'tool-objects' to be applied to 'data-objects', thereby enabling an even more natural user interaction based on affordances.

关键词： File systems Pervasive computing Ubiquitous computing User interfaces distributed computing Physics computing Laboratories computer science Technology management Engineering management

来源：评论

学校读者我要写书评

暂无评论

Constructing compressed suffix arrays with large alphabets

引用

14th International Symposium on Algorithms and Computation, ISAAC 2003

作者： Hon, Wing-Kai Lam, Tak-Wah Sadakane, Kunihiko Sung, Wing-Kin Department of Computer Science and Informations Systems The University of Hong Kong Hong Kong Department of Computer Science and Communication Engineering Kyushu University Japan School of Computing National University of Singapore Singapore

ISBN: (纸本)9783540206958

Recent research in compressing suffix arrays has resulted in two breakthrough indexing data structures, namely, compressed suffix arrays (CSA) [7] and FM-index [5]. Either of them makes it feasible to store a full-text index in the main memory even for a piece of text data with a few billion characters (such as human DNA). However, constructing such indexing data structures with limited working memory (i.e., without constructing suffix arrays) is not a trivial task. This paper addresses this problem. Currently, only CSA admits a space-efficient construction algorithm [15]. For a text T of length n over an alphabet Σ, this algorithm requires O(|Σ|n log n) time and (2H0 +1+Ε)n bits of working space, where H0 is the 0-th order empirical entropy of T and Ε is any non-zero constant. This algorithm is good enough when the alphabet size |Σ| is small. It is not practical for text data containing protein, Chinese or Japanese, where the alphabet may include up to a few thousand characters. The main contribution of this paper is a new algorithm which can construct CSA in O(n log n) time using (H0 +2+Ε)n bits of working space. Note that the running time of our algorithm is independent of the alphabet size and the space requirement is smaller as it is likely that H0 > 1. This paper also makes contribution to the space-efficient construction of FM-index. We show that FM-index can indeed be constructed from CSA directly in O(n) time. © Springer-Verlag Berlin Heidelberg 2003.

关键词： Data structures

来源：评论

学校读者我要写书评

暂无评论

Succinct data structures for searchable partial sums

引用

14th International Symposium on Algorithms and Computation, ISAAC 2003

作者： Hon, Wing-Kai Sadakane, Kunihiko Sung, Wing-Kin Department of Computer Science and Informations Systems The University of Hong Kong Hong Kong Department of Computer Science and Communication Engineering Kyushu University Japan School of Computing National University of Singapore Singapore

ISBN: (纸本)9783540206958

The Searchable Partial Sums is a data structure problem that maintains a sequence of n non-negative k-bit integers;in addition, it allows us to modify the entries by the update operation, while supporting two types of queries: sum and search. Recently, researchers focus on the succinct representation of the data structure in kn + o(kn) bits. They study the tradeoff in time between the query and the update operations, under the word RAM with word size O(lg U) bits. For the special case where k = 1 (which is known as Dynamic Bit Vector problem), Raman et al. showed that both queries can be supported in O(logb n) time, while update requires O(b) amortized time for any b with lg n/ lg lg n ≤ b ≤ n. This paper generalizes the study and shows that even for k = O(lg lg n), both query and update operations can be maintained using the same time complexities. Also, the time for update becomes worst-case time. For the general case when k = O(lg U), we show a lower bound of (Formula presented)Ω (lg n/ lg lg n) time for the search query. On the other hand, we propose a data structure that supports sum in O(logb n) time, search in O(τ logb n) time, and update in O(b) time, where τ denotes the value of min (Formula presented)_ lg lg n lg lg U/ lg lg lg U, _ lg n/ lg lg n _. When b = nΕ, our data structure achieves optimal time bounds. This paper also extends the Searchable Partial Sums with insert and delete operations, and provides succinct data structure for some cases. © Springer-Verlag Berlin Heidelberg 2003.

关键词： Data structures

来源：评论

学校读者我要写书评

暂无评论

A low-cost infrastructure for high precision high volume performance measurements of web clusters

引用

13th International Conference on Modelling Techniques and Tools for computer Performance Evaluation, TOOLS 2003

作者： Hielscher, Kai-Steffen Jens German, Reinhard Department of Computer Science 7 Computer Networks and Communication Systems University of Erlangen-Nürnberg Martensstraße 3 ErlangenD-91058 Germany

ISBN: (纸本)3540408142

We present a software monitoring infrastructure for distributed web servers for precise measurements of one-way delays of TCP packets to parameterize, validate and verify simulation and state-space based models of the system. A frequency synchronization of the clocks is not sufficient, both frequency and phase (offset) of all clocks have to be in sync to correctly estimate distributions of the involved delays. We present a cost-effective combination of standard methods with own additions and improvements to achieve this goal. The solution we developed is based on using only one GPS receiver in combination with NTP and the PPS-API for the time synchronization of all object systems' clocks with a precision in the range of one microsecond. The timestamping and generation of the event trace is done in a Linux kernel module. In addition, example measurements generated with our infrastructure are presented. © Springer-Verlag Berlin Heidelberg 2003.

关键词： Clocks

来源：评论

学校读者我要写书评

暂无评论

MMASS approach to localization problems

MMASS approach to localization problems

引用

作者： Bandini, Stefania Manzoni, Sara Vizzari, Giuseppe Department of Computer Science Systems and Communication University of Milano-Bicocca Via Bicocca degli Arcimboldi 8 20126 Milan Italy

ISBN: (纸本)0769519318

The paper presents the application of the Multilayered Multi Agent Situated System (MMASS) model to localization problems. In the context of Multi Agent System based modelling and distributed problem solving, the MMASS model allows the explicit representation of the environment structure where agents are situated, and provides spatial dependant agent behavior and interaction mechanisms. These aspects are of particular relevance in problems, like localization, in which the representation of spatial features is unavoidable. In particular, examples of localization problems that will be considered in the paper are: shopping centers localization in extra-urban areas, guide placement in museums, and signs and posters positioning in cities. Moreover, the paper briefly presents the software system that has been developed for the three-dimensional (3D) simulation of virtual worlds inhabited by virtual agents. This tool has been exploited for the 3D representation of the presented MMASS-based models of localization problems. © 2003 IEEE.

关键词： Problem solving

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：