发布求助
文献互助 智能选刊 最新文献

2007 International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2007)最新文献

筛选
英文 中文
The TLC-PP framework for delivering a Privacy Augmented Collaborative Environment (PACE) 提供隐私增强协作环境(PACE)的TLC-PP框架
2007 International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2007) Pub Date : 2007-11-12 DOI: 10.1109/COLCOM.2007.4553844
G. Skinner
{"title":"The TLC-PP framework for delivering a Privacy Augmented Collaborative Environment (PACE)","authors":"G. Skinner","doi":"10.1109/COLCOM.2007.4553844","DOIUrl":"https://doi.org/10.1109/COLCOM.2007.4553844","url":null,"abstract":"In order to preserve privacy in electronic collaborative environments a comprehensive multidimensional privacy protecting framework is required. Such information privacy and personal data management solutions for collaborations must incorporate a number of factors and influences in order to provide a holistic information privacy solution. Our technical, legal, and community privacy protecting (TLC-PP) framework addresses the problems associated with the multi-facetted notion of privacy. The three key components of the TLC-PP framework are merged together to provide robust privacy solutions for collaborative environment stakeholders and users alike. The application of the TLC-PP framework provides a significant contribution to the delivery of a privacy augmented collaborative environment (PACE).","PeriodicalId":340691,"journal":{"name":"2007 International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2007)","volume":"2015 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127705247","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}
引用次数: 9
Modeling trust in collaborative information systems 协作信息系统中的信任建模
2007 International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2007) Pub Date : 2007-11-12 DOI: 10.1109/COLCOM.2007.4553846
S. Javanmardi, C. Lopes
{"title":"Modeling trust in collaborative information systems","authors":"S. Javanmardi, C. Lopes","doi":"10.1109/COLCOM.2007.4553846","DOIUrl":"https://doi.org/10.1109/COLCOM.2007.4553846","url":null,"abstract":"Collaborative systems available on the Web allow millions of users to share information through a growing collection of tools and platforms such as wikis, blogs and shared forums. All of these systems contain information and resources with different degrees of sensitivity. However, the open nature of such infrastructures makes it difficult for users to determine the reliability of the available information and trustworthiness of information providers. Hence, integrating trust management systems to open collaborative systems can play a crucial role in the growth and popularity of open information repositories. In this paper, we present a trust model for collaborative systems, namely for platforms based on Wiki technology. This model, based on hidden Markov models, estimates the reputation of the contributors and the reliability of the content dynamically. The focus of this paper is on reputation estimation. Evaluation results based on a subset of Wikipedia shows that the model can effectively be used for identifying vandals, and users with high quality contributions.","PeriodicalId":340691,"journal":{"name":"2007 International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2007)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116986668","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}
引用次数: 31
Kademlia for data storage and retrieval in enterprise networks 用于企业网络数据存储和检索的kdemlia
2007 International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2007) Pub Date : 2007-11-12 DOI: 10.1109/COLCOM.2007.4553860
N. Fedotova, S. Fanti, L. Veltri
{"title":"Kademlia for data storage and retrieval in enterprise networks","authors":"N. Fedotova, S. Fanti, L. Veltri","doi":"10.1109/COLCOM.2007.4553860","DOIUrl":"https://doi.org/10.1109/COLCOM.2007.4553860","url":null,"abstract":"Centralized organization of current enterprise networks doesnpsilat represent an ideal solution in terms of information security and reliability. Denial of service, packet filtering and low resistance to failure are frequent shortcomings of centralized systems. To avoid the above problems we introduce a distributed P2P data organization system to the enterprise environment. We propose to apply Kademlia-based distributed Hash tables to organize data storage and retrieval systems of enterprise networks. Due to a tree-like structure of the identifier space and a prefix matching lookup algorithm, Kademlia is easy adaptable to the context of enterprise hierarchy, e.g. it facilitates the assignment of different privileges regarding data access, to various system entities. We present a solution that provides geographically separated users of enterprise networks with possibility to share, modify and publish data in parallel way.","PeriodicalId":340691,"journal":{"name":"2007 International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2007)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127204480","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}
引用次数: 4
Collaborative motion planning of autonomous robots 自主机器人协同运动规划
2007 International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2007) Pub Date : 2007-11-12 DOI: 10.1109/COLCOM.2007.4553851
T. Okada, R. Beuran, J. Nakata, Yasuo Tan, Y. Shinoda
{"title":"Collaborative motion planning of autonomous robots","authors":"T. Okada, R. Beuran, J. Nakata, Yasuo Tan, Y. Shinoda","doi":"10.1109/COLCOM.2007.4553851","DOIUrl":"https://doi.org/10.1109/COLCOM.2007.4553851","url":null,"abstract":"In disaster areas, office buildings, or at home, multiple autonomous networked mobile robots may act instead of human beings. These robots have to move to their destiantion so as to perform their function. For this purpose they need to be able to recognize the changes in the surrounding environment. They are equipped with a motion-planning method in order to avoid in real time collisions with other robots or obtacles. In this paper we propose a motion planning method based on PRM (Probabilistic Roadmap) algorithm. To evaluate our method, we constructed an experiment platform based on StarBED, which is a large-scale network testbed. By using the virtual environment manager Map Manager, the WLAN emulator QOMET, and the experiment-support software RUNE we are able to perform emulation of large-scale autonomous networked mobile robot systems. The experimental results confirm the usefulness of collaborative motion planning, which results in reaching faster the estimation and in less frequent re-planning.","PeriodicalId":340691,"journal":{"name":"2007 International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2007)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130832313","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}
引用次数: 15
Controlled sharing of identity attributes for better privacy 控制身份属性的共享，以获得更好的隐私
2007 International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2007) Pub Date : 2007-11-12 DOI: 10.1109/COLCOM.2007.4553801
R. Lopes, Dongwan Shin
{"title":"Controlled sharing of identity attributes for better privacy","authors":"R. Lopes, Dongwan Shin","doi":"10.1109/COLCOM.2007.4553801","DOIUrl":"https://doi.org/10.1109/COLCOM.2007.4553801","url":null,"abstract":"In recent years user centricity has drawn a lot of attention as a promising component to advance federated identity management (FIM) systems. The basic notion is to give users a larger degree of control over their attribute data that comprises digital identities on a federated network, thus providing an ideal mechanism for upholding user privacy. One of the fundamental problems facing user centricity in this context is how a user can selectively share her identity attributes certified by an identity provider (IdP) to a service provider (SP). In this paper we present an approach to addressing the problem, which allows a user to share only selected attributes from a larger set of attributes that form his digital identity credential for better privacy. Our approach enables such sharing to occur without IdPpsilas intervention in every transaction.","PeriodicalId":340691,"journal":{"name":"2007 International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2007)","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133341530","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}
引用次数: 3
Maintaining constraints expressed as formulas in collaborative systems 在协作系统中维护以公式形式表达的约束
2007 International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2007) Pub Date : 2007-11-12 DOI: 10.1109/COLCOM.2007.4553850
Kai Lin, David Chen, R. Dromey, Chengzheng Sun
{"title":"Maintaining constraints expressed as formulas in collaborative systems","authors":"Kai Lin, David Chen, R. Dromey, Chengzheng Sun","doi":"10.1109/COLCOM.2007.4553850","DOIUrl":"https://doi.org/10.1109/COLCOM.2007.4553850","url":null,"abstract":"Constraints allow users to declare relationships among objects and let the constraint systems maintain and satisfy these relationships. Formulas have been adopted to express constraints in a wide variety of single-user applications, because of their simplicity, efficiency and manageability. The needs and benefits of supporting formula-defined constraints in collaborative environments have long been recognized. However, maintaining both constraints and consistency in the presence of concurrency in collaborative systems is a challenge. In these systems, users may concurrently define formulas, which could result in that different formulas are defined to express the same object attribute at different sites. In this article, we discuss the issues and techniques in maintaining formula-defined constraints in collaborative systems. In particular, we also proposed a method that is able to maintain both constraints and system consistency in concurrent environments based on the existing consistency maintenance approaches. This method extends the application of these approaches from collaborative systems without constraint to systems that support formulas. The proposed method has been applied to implement a collaborative Visio system, called CoVisio, which leverages single-user Microsoft Visio for multi-user collaboration. Specific issues related to CoVisio are also discussed in detail.","PeriodicalId":340691,"journal":{"name":"2007 International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2007)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124876144","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}
引用次数: 3
A random projection approach to subscription covering detection in publish/subscribe systems 发布/订阅系统中订阅覆盖检测的随机投影方法
2007 International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2007) Pub Date : 2007-11-12 DOI: 10.1109/COLCOM.2007.4553856
D. Tran, Thinh P. Q. Nguyen
{"title":"A random projection approach to subscription covering detection in publish/subscribe systems","authors":"D. Tran, Thinh P. Q. Nguyen","doi":"10.1109/COLCOM.2007.4553856","DOIUrl":"https://doi.org/10.1109/COLCOM.2007.4553856","url":null,"abstract":"Subscription covering detection is useful to improving the performance of any publish/subscribe system. However, an exact solution to querying coverings among a large set of subscriptions in high dimension is computationally too expensive to be practicable. Therefore, we are interested in an approximate approach. We focus on spherical subscriptions and propose a solution based on random projections. Our complexities are substantially better than that of the exact approach. The proposed solution can potentially find exact coverings with a success probability 100% asymptotically approachable.","PeriodicalId":340691,"journal":{"name":"2007 International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2007)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125847954","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}
引用次数: 7
Shadow document sets for synchronously-aware asynchronous collaboration 用于同步感知异步协作的影子文档集
2007 International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2007) Pub Date : 2007-11-12 DOI: 10.1109/COLCOM.2007.4553822
S. Papadopoulou, M. Norrie
{"title":"Shadow document sets for synchronously-aware asynchronous collaboration","authors":"S. Papadopoulou, M. Norrie","doi":"10.1109/COLCOM.2007.4553822","DOIUrl":"https://doi.org/10.1109/COLCOM.2007.4553822","url":null,"abstract":"Although extensive research has been conducted in recent years to provide awareness information for collaborative authoring in synchronous and semi-synchronous modes, this is not the case for asynchronous collaboration. Users involved in collaborative writing tasks often choose to work in isolation in order to keep their changes private until committed. However, the fact that other users are unaware of these changes can result in unnecessary work being done by other users or conflicts to be resolved. We address this problem and propose a solution based on the notion of Shadow Documents. We monitor in real-time changes made to a document by all users working in privacy in order to compute and present awareness information based on the changes. We present our approach in detail, along with a prototype of a shared workspace for asynchronous collaboration based on Shadow Document Sets.","PeriodicalId":340691,"journal":{"name":"2007 International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2007)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116906565","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}
引用次数: 5
Index distribution in a group-based resource sharing application 基于组的资源共享应用程序中的索引分布
2007 International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2007) Pub Date : 2007-11-12 DOI: 10.1109/COLCOM.2007.4553854
N. Beijar
{"title":"Index distribution in a group-based resource sharing application","authors":"N. Beijar","doi":"10.1109/COLCOM.2007.4553854","DOIUrl":"https://doi.org/10.1109/COLCOM.2007.4553854","url":null,"abstract":"This paper presents an application for locating resources, such as files or media streams, shared by users of a mobile network. The application is fully distributed without centralized components in the fixed network. The paper proposes a simple method to define groups using local information about each userpsilas social contacts. The groups are used in combination with user-defined policies to control the distribution of shared resources. The paper further provides an evaluation whether an index-driven approach is feasible for the given purpose. The approach aims to minimize traffic, which is particularly important in the mobile environment. To achieve this, a unique method is proposed for efficiently distributing the index by replacing flooding with direct updates. Bloom filters are used to compress the index in order to reduce the bandwidth and storage space. The solutions are evaluated analytically and compared using simulation.","PeriodicalId":340691,"journal":{"name":"2007 International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2007)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126802366","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}
引用次数: 1
How a structured document model can support awareness in collaborative authoring 结构化文档模型如何支持协作创作中的感知
2007 International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2007) Pub Date : 2007-11-12 DOI: 10.1109/COLCOM.2007.4553820
Christos Papadopoulou, M. Norrie
{"title":"How a structured document model can support awareness in collaborative authoring","authors":"Christos Papadopoulou, M. Norrie","doi":"10.1109/COLCOM.2007.4553820","DOIUrl":"https://doi.org/10.1109/COLCOM.2007.4553820","url":null,"abstract":"Although awareness is important in collaboration, user studies have shown that many groupware tools fail to meet user requirements or expectations in this respect. We show how richer documents models can lead to richer forms of awareness and present a general awareness framework based on a metamodel for structured documents and associated metrics. We describe how the framework was used to extend a collaborative authoring system to provide awareness information at variable levels of granularity according to user requirements. We also discuss how the framework could be used with other forms of collaborative tools.","PeriodicalId":340691,"journal":{"name":"2007 International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2007)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129313543","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}
引用次数: 8
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信