Pub Date : 2006-11-01DOI: 10.1109/COLCOM.2006.361850
Lakshmish Ramaswamy, A. Iyengar, Jianxia Chen
Cooperation among individual caches has proven to be an effective strategy to improve the scalability and performance of edge cache networks delivering dynamic Web content. To date, research in the area of cooperative edge caching has mainly focused on serving client requests and maintaining freshness of cached documents. However, designing mechanisms to effectively manage the available resources is an important challenge that can have significant impact on the performance of an edge cache network. In this paper we propose a novel data placement scheme, called the utility-based placement scheme, which is not only sensitive to the ongoing cooperation in the edge cache but also takes into account the various costs and benefits of storing a data-item at an individual edge cache. At the heart of proposed scheme is a utility function that quantifies the usefulness of storing a data-item at a particular edge cache. Experiments show that the proposed scheme provides significant performance benefits
{"title":"Cooperative Data Placement and Replication in Edge Cache Networks","authors":"Lakshmish Ramaswamy, A. Iyengar, Jianxia Chen","doi":"10.1109/COLCOM.2006.361850","DOIUrl":"https://doi.org/10.1109/COLCOM.2006.361850","url":null,"abstract":"Cooperation among individual caches has proven to be an effective strategy to improve the scalability and performance of edge cache networks delivering dynamic Web content. To date, research in the area of cooperative edge caching has mainly focused on serving client requests and maintaining freshness of cached documents. However, designing mechanisms to effectively manage the available resources is an important challenge that can have significant impact on the performance of an edge cache network. In this paper we propose a novel data placement scheme, called the utility-based placement scheme, which is not only sensitive to the ongoing cooperation in the edge cache but also takes into account the various costs and benefits of storing a data-item at an individual edge cache. At the heart of proposed scheme is a utility function that quantifies the usefulness of storing a data-item at a particular edge cache. Experiments show that the proposed scheme provides significant performance benefits","PeriodicalId":315775,"journal":{"name":"2006 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114179960","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}
Pub Date : 2006-11-01DOI: 10.1109/COLCOM.2006.361883
W. Claycomb, Dongwan Shin
Impromptu collaboration, often characterized as being opportunistic, spontaneous, proximity-based, and transient, is fast becoming a common way of interactions in mobile and pervasive computing. Though continued research efforts have been made to secure this type of collaboration, the increasing computational and storage capabilities of mobile devices pose a new security challenge of access control for sharing a variety of their resources. In this paper we present a visual framework for securing impromptu collaboration in a pervasive computing environment. The framework incorporates a method of demonstrative identification of mobile devices, key-based capability list, and 2-dimensional visual barcode technology to support a convenient access control service in mobile and pervasive computing. Impromptu collaboration, often characterized as being opportunistic, spontaneous, proximity-based, and transient, is fast becoming a common way of interactions in mobile and pervasive computing. Though continued research efforts have been made to secure this type of collaboration, the increasing computational and storage capabilities of mobile devices pose a new security challenge of access control for sharing a variety of their resources. In this paper we present a visual framework for securing impromptu collaboration in a pervasive computing environment. The framework incorporates a method of demonstrative identification of mobile devices, key-based capability list, and 2-dimensional visual barcode technology to support a convenient access control service in mobile and pervasive computing
{"title":"A Visual Framework for Securing Impromptu Collaboration in Pervasive Computing","authors":"W. Claycomb, Dongwan Shin","doi":"10.1109/COLCOM.2006.361883","DOIUrl":"https://doi.org/10.1109/COLCOM.2006.361883","url":null,"abstract":"Impromptu collaboration, often characterized as being opportunistic, spontaneous, proximity-based, and transient, is fast becoming a common way of interactions in mobile and pervasive computing. Though continued research efforts have been made to secure this type of collaboration, the increasing computational and storage capabilities of mobile devices pose a new security challenge of access control for sharing a variety of their resources. In this paper we present a visual framework for securing impromptu collaboration in a pervasive computing environment. The framework incorporates a method of demonstrative identification of mobile devices, key-based capability list, and 2-dimensional visual barcode technology to support a convenient access control service in mobile and pervasive computing. Impromptu collaboration, often characterized as being opportunistic, spontaneous, proximity-based, and transient, is fast becoming a common way of interactions in mobile and pervasive computing. Though continued research efforts have been made to secure this type of collaboration, the increasing computational and storage capabilities of mobile devices pose a new security challenge of access control for sharing a variety of their resources. In this paper we present a visual framework for securing impromptu collaboration in a pervasive computing environment. The framework incorporates a method of demonstrative identification of mobile devices, key-based capability list, and 2-dimensional visual barcode technology to support a convenient access control service in mobile and pervasive computing","PeriodicalId":315775,"journal":{"name":"2006 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131516869","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}
Pub Date : 2006-11-01DOI: 10.1109/COLCOM.2006.361854
F. Cabitza, M. Locatelli, C. Simone
The paper focuses on collaboration that is achieved inside communities thriving within organizations. The nature of the communities and their connections with the institutional technologies embedding the organizational prescriptions require the construction of places where the communities can construct and maintain their local memory, policies and conventions. The paper proposes a framework (i.e., a model and the related language) supporting the construction of such places (i.e., fulcra) and illustrates its use by means of a scenario derived from previous empirical investigations on communities of practice
{"title":"Designing Computational Places for Communities within Organizations","authors":"F. Cabitza, M. Locatelli, C. Simone","doi":"10.1109/COLCOM.2006.361854","DOIUrl":"https://doi.org/10.1109/COLCOM.2006.361854","url":null,"abstract":"The paper focuses on collaboration that is achieved inside communities thriving within organizations. The nature of the communities and their connections with the institutional technologies embedding the organizational prescriptions require the construction of places where the communities can construct and maintain their local memory, policies and conventions. The paper proposes a framework (i.e., a model and the related language) supporting the construction of such places (i.e., fulcra) and illustrates its use by means of a scenario derived from previous empirical investigations on communities of practice","PeriodicalId":315775,"journal":{"name":"2006 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122305997","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}
Pub Date : 2006-11-01DOI: 10.1109/COLCOM.2006.361903
J. Arnedo-Moreno, J. Herrera-Joancomartí
Peer-to-peer applications enable users to create a communications framework from scratch without the need of a central service provider. This is achievable via the aggregation of resources each one of them provide, creating a completely distributed collaborative environment. Under some circumstances, groups of users operating in a global peer-to-peer network may need to create a closed communities, limiting access to the shared resources only to its members. This can be useful for security reasons or in order to provide scoping within the global overlay network. In order to achieve this scenario, security mechanisms must be implemented. In this paper, a method for peer group access control is presented managed only by the group members in a completely autonomous way without the need of any third parties
{"title":"Providing a collaborative mechanism for peer group access control","authors":"J. Arnedo-Moreno, J. Herrera-Joancomartí","doi":"10.1109/COLCOM.2006.361903","DOIUrl":"https://doi.org/10.1109/COLCOM.2006.361903","url":null,"abstract":"Peer-to-peer applications enable users to create a communications framework from scratch without the need of a central service provider. This is achievable via the aggregation of resources each one of them provide, creating a completely distributed collaborative environment. Under some circumstances, groups of users operating in a global peer-to-peer network may need to create a closed communities, limiting access to the shared resources only to its members. This can be useful for security reasons or in order to provide scoping within the global overlay network. In order to achieve this scenario, security mechanisms must be implemented. In this paper, a method for peer group access control is presented managed only by the group members in a completely autonomous way without the need of any third parties","PeriodicalId":315775,"journal":{"name":"2006 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129397559","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}
Pub Date : 2006-11-01DOI: 10.1109/COLCOM.2006.361852
Soobaek Jang, Tonya M. Green
Wikis have become a hot topic in the world of collaboration tools. Wikipedia.org, a vast, community-driven encyclopedia, has proven to be an invaluable information resource that has been developed through collaboration among thousands of people around the world. Today wikis are increasingly being employed for a wide variety of uses in business. Consequently, one of the key challenges is to enable wikis to interoperate with informational and business process applications. The ability to dynamically change the content of Webpages and reflect the changes within an enterprise application brings the power of collaboration to business applications. This paper includes general information about wikis and describes how to use a wiki solution within an enterprise application. Integrating an enterprise application with a wild permits real-time updates of pages in the application by certain groups of experts, without deploying files from the Web application server
{"title":"Best Practices on Delivering A Wiki Collaborative Solution for Enterprise Applications","authors":"Soobaek Jang, Tonya M. Green","doi":"10.1109/COLCOM.2006.361852","DOIUrl":"https://doi.org/10.1109/COLCOM.2006.361852","url":null,"abstract":"Wikis have become a hot topic in the world of collaboration tools. Wikipedia.org, a vast, community-driven encyclopedia, has proven to be an invaluable information resource that has been developed through collaboration among thousands of people around the world. Today wikis are increasingly being employed for a wide variety of uses in business. Consequently, one of the key challenges is to enable wikis to interoperate with informational and business process applications. The ability to dynamically change the content of Webpages and reflect the changes within an enterprise application brings the power of collaboration to business applications. This paper includes general information about wikis and describes how to use a wiki solution within an enterprise application. Integrating an enterprise application with a wild permits real-time updates of pages in the application by certain groups of experts, without deploying files from the Web application server","PeriodicalId":315775,"journal":{"name":"2006 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126461087","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}
Pub Date : 2006-11-01DOI: 10.1109/COLCOM.2006.361897
Siyuan Liu, Yang Zheng, Haifeng Shen, S. Xia, Chengzheng Sun
Modeling is commonly used in the process of software development. UML (Unified Modeling Language) is a standard software modeling language and has been widely adopted for software analysis and design. As software systems are getting larger and more complex nowadays, software modeling using UML often requires collective and collaborative efforts from multiple software designers. In contrast, most of today's software modeling applications are still single-user-oriented and do not offer much help to coordinate interaction and collaboration among team members. In this paper, we will present the technical challenges and solutions in providing advanced collaboration capabilities and transparently integrating them into mainstream software modeling applications to effectively facilitate collaboration among geographically dispersed software designers. The work has been tested and demonstrated by the design of CoRSA (Collaborative Rational Software Architect) - an experimental collaborative software modeling prototype based on RSA, one of the most widely used commercial software modeling applications in the market
{"title":"Real-Time Collaborative Software Modeling Using UML with Rational Software Architect","authors":"Siyuan Liu, Yang Zheng, Haifeng Shen, S. Xia, Chengzheng Sun","doi":"10.1109/COLCOM.2006.361897","DOIUrl":"https://doi.org/10.1109/COLCOM.2006.361897","url":null,"abstract":"Modeling is commonly used in the process of software development. UML (Unified Modeling Language) is a standard software modeling language and has been widely adopted for software analysis and design. As software systems are getting larger and more complex nowadays, software modeling using UML often requires collective and collaborative efforts from multiple software designers. In contrast, most of today's software modeling applications are still single-user-oriented and do not offer much help to coordinate interaction and collaboration among team members. In this paper, we will present the technical challenges and solutions in providing advanced collaboration capabilities and transparently integrating them into mainstream software modeling applications to effectively facilitate collaboration among geographically dispersed software designers. The work has been tested and demonstrated by the design of CoRSA (Collaborative Rational Software Architect) - an experimental collaborative software modeling prototype based on RSA, one of the most widely used commercial software modeling applications in the market","PeriodicalId":315775,"journal":{"name":"2006 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128442353","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}
Pub Date : 1900-01-01DOI: 10.1109/colcom.2006.361845
R. Klein, D. Nussbaum, J. Sack, Jiehua Yi
We are studying the problem of determining suitable meeting times and locations for a group of participants wishing to schedule a new meeting subject to already scheduled meetings possibly held at a number of different locations. Each participant must be able to reach the new meeting location, attend for the entire duration, and reach the next meeting location on time. In particular, we give a solution to the problem instance where each participant has two scheduled meetings separated by a free time interval. For a geometric model, where n participants can travel along straight paths in the Euclidean plane, we present an O(n log n) algorithm to determine the longest meeting duration and a location suitable to all participants. In a graph-based model, transportation is provided by a geometric network over m nodes and e edges in the plane. Participants can have individual weights. Moreover, there can be k groups of participants, such that only one member of each group must attend the meeting. In this model, a location for a meeting of longest possible duration can be determined in time O(en¿(k) log k + n log n + mn log m), where a (k) denotes the extremely slowly growing inverse Ackermann function.
我们正在研究为一组与会者确定合适的会议时间和地点的问题，这些与会者希望安排一次新的会议，但不包括可能在若干不同地点举行的已安排的会议。每个与会者必须能够到达新的会议地点，参加整个会议期间，并按时到达下一个会议地点。特别地，我们给出了一个问题实例的解决方案，其中每个参与者都有两个由空闲时间间隔分开的预定会议。对于一个几何模型，其中n个参与者可以沿着欧几里得平面上的直线路径行进，我们提出了一个O(n log n)算法来确定最长的会议持续时间和适合所有参与者的位置。在基于图的模型中，运输是由平面上m个节点和e条边的几何网络提供的。参与者可以有个人的体重。此外，可以有k组参与者，这样每个组中只有一名成员必须参加会议。在该模型中，可以在O(en¿(k) log k + n log n + mn log m)时间内确定可能持续时间最长的会议地点，其中a (k)表示极其缓慢增长的逆Ackermann函数。
{"title":"How to Fit In Another Meeting","authors":"R. Klein, D. Nussbaum, J. Sack, Jiehua Yi","doi":"10.1109/colcom.2006.361845","DOIUrl":"https://doi.org/10.1109/colcom.2006.361845","url":null,"abstract":"We are studying the problem of determining suitable meeting times and locations for a group of participants wishing to schedule a new meeting subject to already scheduled meetings possibly held at a number of different locations. Each participant must be able to reach the new meeting location, attend for the entire duration, and reach the next meeting location on time. In particular, we give a solution to the problem instance where each participant has two scheduled meetings separated by a free time interval. For a geometric model, where n participants can travel along straight paths in the Euclidean plane, we present an O(n log n) algorithm to determine the longest meeting duration and a location suitable to all participants. In a graph-based model, transportation is provided by a geometric network over m nodes and e edges in the plane. Participants can have individual weights. Moreover, there can be k groups of participants, such that only one member of each group must attend the meeting. In this model, a location for a meeting of longest possible duration can be determined in time O(en¿(k) log k + n log n + mn log m), where a (k) denotes the extremely slowly growing inverse Ackermann function.","PeriodicalId":315775,"journal":{"name":"2006 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"97 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":"123192855","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}
Pub Date : 1900-01-01DOI: 10.1109/colcom.2006.361906
No one knows how he or she will act in an emergency, but without proper preparations, it's a safe bet things won't go as well as they could! This is particularly true for people with PDDs. Consider...the tendency to obsess on a situation, can be a very devastating thing if the situation is a disastrous one. The inability to deal with sudden change can render an Aspietrade unable to react as quickly as he should when faced with a sudden emergency. The desire for routine in light of nothing routine can make a person with AS overwhelmingly anxious. You get the point. Emergencies are no fun for anyone, but for those of us who need a sense of order and consistency in our lives; emergencies can be uniquely frightening and devastating
{"title":"In Case of an Emergency","authors":"","doi":"10.1109/colcom.2006.361906","DOIUrl":"https://doi.org/10.1109/colcom.2006.361906","url":null,"abstract":"No one knows how he or she will act in an emergency, but without proper preparations, it's a safe bet things won't go as well as they could! This is particularly true for people with PDDs. Consider...the tendency to obsess on a situation, can be a very devastating thing if the situation is a disastrous one. The inability to deal with sudden change can render an Aspietrade unable to react as quickly as he should when faced with a sudden emergency. The desire for routine in light of nothing routine can make a person with AS overwhelmingly anxious. You get the point. Emergencies are no fun for anyone, but for those of us who need a sense of order and consistency in our lives; emergencies can be uniquely frightening and devastating","PeriodicalId":315775,"journal":{"name":"2006 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"14 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":"124777711","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：