2009 5th International Conference on Collaborative Computing: Networking, Applications and Worksharing最新文献

筛选
英文 中文
Dynamic data services 动态数据服务
Ruhollah Farchtchi
{"title":"Dynamic data services","authors":"Ruhollah Farchtchi","doi":"10.4108/ICST.COLLABORATECOM2009.8359","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM2009.8359","url":null,"abstract":"Community networks require advanced domain-independent services that can be tailored for their use. Multi-agent architectures have been explored as an architectural approach to achieving a community network or system. Building on the work that was done with, Enterprise Knowledge Agents [6], this paper looks at using data services and the challenges with respect to enabling a platform for query and representation of agent observed knowledge in the enterprise. The EKA paper describes a notional architecture for a multi-agent based system that catalogues and coordinates knowledge and collaboration in the enterprise. In that paper case agents are defined to collect and organize information for an individual in the enterprise. The challenge is that the agents require a method of storing the data as well as allowing the agents to query each other to understand what data may exist with other individuals in the organization. This paper explores the use of dynamic data services in solving the challenges with an environment where data must be shared and where multiple representations of data may exist as in the EKA system.","PeriodicalId":232795,"journal":{"name":"2009 5th International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126826155","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}
引用次数: 0
Online detection of web choreography misuses 网络编排误用在线检测
Murat Gunestas, D. Wijesekera
{"title":"Online detection of web choreography misuses","authors":"Murat Gunestas, D. Wijesekera","doi":"10.4108/ICST.COLLABORATECOM2009.8346","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM2009.8346","url":null,"abstract":"Web service choreographies can be misused or abused in two different ways. The first is to exploit the underlying choreography to attack web services, that we call service misuses. Instantiation flooding is one such attack. The second is using web service choreographies to conduct illegal businesses, that we call business misuses. Ponzi and Pyramidal schemes belong in this second category. Due to the web service interdependencies created in choreographed web services both these kinds are difficult to detect. We show an online detection system that would generate alerts of both these kinds of misuses.","PeriodicalId":232795,"journal":{"name":"2009 5th International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131306849","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}
引用次数: 2
User contribution and trust in Wikipedia 用户对维基百科的贡献和信任
S. Javanmardi, Y. Ganjisaffar, C. Lopes, P. Baldi
{"title":"User contribution and trust in Wikipedia","authors":"S. Javanmardi, Y. Ganjisaffar, C. Lopes, P. Baldi","doi":"10.4108/ICST.COLLABORATECOM2009.8376","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM2009.8376","url":null,"abstract":"Wikipedia, one of the top ten most visited websites, is commonly viewed as the largest online reference for encyclopedic knowledge. Because of its open editing model -allowing anyone to enter and edit content- Wikipedia's overall quality has often been questioned as a source of reliable information. Lack of study of the open editing model of Wikipedia and its effectiveness has resulted in a new generation of wikis that restrict contributions to registered users only, using their real names. In this paper, we present an empirical study of user contributions to Wikipedia. We statistically analyze contributions by both anonymous and registered users. The results show that submissions of anonymous and registered users in Wikipedia suggest a power law behavior. About 80% of the revisions are submitted by less than 7% of the users, most of whom are registered users. To further refine the analyzes, we use the Wiki Trust Model (WTM), a user reputation model developed in our previous work to assign a reputation value to each user. As expected, the results show that registered users contribute higher quality content and therefore are assigned higher reputation values. However, a significant number of anonymous users also contribute high-quality content.We provide further evidence that regardless of a user s' attribution, registered or anonymous, high reputation users are the dominant contributors that actively edit Wikipedia articles in order to remove vandalism or poor quality content.","PeriodicalId":232795,"journal":{"name":"2009 5th International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125740104","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}
引用次数: 57
A scale-free and self-organized P2P overlay for massive multiuser virtual environments 一个无标度和自组织的P2P覆盖大规模多用户虚拟环境
M. Esch, Ingo Scholtes
{"title":"A scale-free and self-organized P2P overlay for massive multiuser virtual environments","authors":"M. Esch, Ingo Scholtes","doi":"10.4108/ICST.COLLABORATECOM2009.8279","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM2009.8279","url":null,"abstract":"Massive Multiuser Virtual Environments have recently grown popular, and commercial virtual online worlds like Second Life or World of Warcraft attract a lot of attention. In this context, for the research on distributed systems, especially the idea of a 3DWeb as a global scale virtual environment is very interesting, since it poses severe technical challenges to the underlying infrastructure. It is generally accepted, that the realization of such a global scale scenario can not be realized in a traditional centralized fashion. For this reason in the course of the HyperVerse project we have developed a two-tier Peer-to-Peer (P2P) architecture as basic infrastructure for a federated and scalable 3D Web. Our approach relies on a concept, that incorporates a loosely-structured P2P overlay of user clients and an overlay that connects a federation of reliable server machines constituting a reliable backbone service. This paper proposes a self-organized and scale-free network overlay for the reliable backbone in the HyperVerse architecture. The overlay incorporates advantages of scale-free networks, self-organization and epidemic aggregation in order to tackle the severe challenges of the scenario in a fully distributed fashion without any central control.","PeriodicalId":232795,"journal":{"name":"2009 5th International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134581578","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
Towards automatic recommendation of friend lists 实现好友列表的自动推荐
Kelli Bacon, P. Dewan
{"title":"Towards automatic recommendation of friend lists","authors":"Kelli Bacon, P. Dewan","doi":"10.4108/ICST.COLLABORATECOM2009.8397","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM2009.8397","url":null,"abstract":"Facebook access-control lists, called friend lists, are difficult to create manually. Previous work on automating these lists has used friend details entered by the user. Our approach automates them by merging virtual friend cliques using certain heuristics that determine if two virtual friend cliques correspond to a single actual friend clique. A small user study found that our lists were more likely to be used by participants than existing automated lists.","PeriodicalId":232795,"journal":{"name":"2009 5th International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115575991","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
A usage control policy specification with Petri nets 一个带有Petri网的使用控制策略规范
Basel Katt, Xinwen Zhang, M. Hafner
{"title":"A usage control policy specification with Petri nets","authors":"Basel Katt, Xinwen Zhang, M. Hafner","doi":"10.1007/978-3-642-05151-7_11","DOIUrl":"https://doi.org/10.1007/978-3-642-05151-7_11","url":null,"abstract":"","PeriodicalId":232795,"journal":{"name":"2009 5th International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114360711","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}
引用次数: 16
SECUND: A protocol for SECUre neighborhooD creation in wireless ad hoc networks 用于在无线自组织网络中创建安全邻居的协议
T. Hayajneh, P. Krishnamurthy, D. Tipper
{"title":"SECUND: A protocol for SECUre neighborhooD creation in wireless ad hoc networks","authors":"T. Hayajneh, P. Krishnamurthy, D. Tipper","doi":"10.4108/ICST.COLLABORATECOM2009.8380","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM2009.8380","url":null,"abstract":"The ability to correctly determine their neighborhood is a fundamental requirement for nodes in ad hoc and sensor networks. Many applications, protocols, and system functionality rely on neighborhood discovery. Malicious nodes that taint neighborhood information using wormholes can significantly disrupt the operation of ad hoc networks. Protocols that depend only on cryptographic techniques (e.g, authentication and encryption) may not be able to detect or prevent such attacks. In this paper we propose SECUND, a protocol for creating a SECUre NeighborhooD, that makes use of discrepancies in routing hop count information to detect ¿true¿ neighbors and remove those links to nodes that appear to be neighbors, but are really not neighbors. SECUND is simple, localized and needs no special hardware, localization, or synchronization. We present approaches to improve the efficiency of the process. We evaluate SECUND using simulations and we demonstrate its effectiveness in the presence of multiple and multi-ended wormholes.","PeriodicalId":232795,"journal":{"name":"2009 5th International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124279993","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
Title page 标题页
S. Ulmer
{"title":"Title page","authors":"S. Ulmer","doi":"10.33546/bnj.612.s187","DOIUrl":"https://doi.org/10.33546/bnj.612.s187","url":null,"abstract":"","PeriodicalId":232795,"journal":{"name":"2009 5th International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133822824","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}
引用次数: 0
Message from the general chairs 来自主席的信息
K. Aberer, J. Joshi
{"title":"Message from the general chairs","authors":"K. Aberer, J. Joshi","doi":"10.1109/ISMAR.2005.40","DOIUrl":"https://doi.org/10.1109/ISMAR.2005.40","url":null,"abstract":"CollaborateCom is an annual international forum for dissemination of original ideas and research results in collaborative computing networks, systems, and applications. A major goal and feature of CollaborateCom is to bring the researchers from networking, systems, CSCW, and collaborative learning, and collaborative education areas together. CollaborateCom 2009 in Washington D.C., is the fifth conference of the series and it reflects the accelerated growth of collaborative computing, both as research and application areas.","PeriodicalId":232795,"journal":{"name":"2009 5th International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127209010","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}
引用次数: 0
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学术文献互助群
群 号:481959085
Book学术官方微信