Pub Date : 2006-11-17DOI: 10.1109/COLCOM.2006.361881
Michael Chuang, S. Phoomvuthisarn, J. Joshi
An important requirement of systems or application domains in emerging open environments is the capability to share information and services with other application domains that have different sets of protection requirements. When a domain needs to allow entities from previously unknown domains to access its resources, mechanisms should be in place to allow negotiating trust and services based on the sharing requirements of the interacting domains. We emphasize that a holistic framework for requirements-driven trust based secure interoperation is needed to facilitate interacting domains to access each other's local resources through access control policy mapping between the domains. In this paper, we present our ongoing work on developing a comprehensive framework for a trust based access control for secure interoperation, which tightly integrates role-based access control and inter-domain policy mapping mechanism with an integrated, game-theory based trust and service negotiation process. The framework being developed aims to address the complex requirements of an environment that represents the convergence of grid, peer-to-peer and mobile environments and workflow and multimedia technologies.
{"title":"An Integrated Framework for Trust-Based Access Control for Open Systems","authors":"Michael Chuang, S. Phoomvuthisarn, J. Joshi","doi":"10.1109/COLCOM.2006.361881","DOIUrl":"https://doi.org/10.1109/COLCOM.2006.361881","url":null,"abstract":"An important requirement of systems or application domains in emerging open environments is the capability to share information and services with other application domains that have different sets of protection requirements. When a domain needs to allow entities from previously unknown domains to access its resources, mechanisms should be in place to allow negotiating trust and services based on the sharing requirements of the interacting domains. We emphasize that a holistic framework for requirements-driven trust based secure interoperation is needed to facilitate interacting domains to access each other's local resources through access control policy mapping between the domains. In this paper, we present our ongoing work on developing a comprehensive framework for a trust based access control for secure interoperation, which tightly integrates role-based access control and inter-domain policy mapping mechanism with an integrated, game-theory based trust and service negotiation process. The framework being developed aims to address the complex requirements of an environment that represents the convergence of grid, peer-to-peer and mobile environments and workflow and multimedia technologies.","PeriodicalId":315775,"journal":{"name":"2006 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133627342","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-17DOI: 10.1109/COLCOM.2006.361900
M. O. Shafiq, F. Scharffe, Reto Krummenacher, Ying Ding, D. Fensel
Triple space computing is an emerging technology for communication and coordination of different semantic technologies. It has been achieved by extending tuple space computing to support RDF as triple space computing. It can play an important role by acting as global middleware providing support for collaboration of different semantic technologies. Several participants from semantic Web and semantic Web services applications, distributed worldwide communicate with each other via triple space due to which the possibility of heterogeneity in the RDF schemas and instances among the communicating participants may arise. In order to resolve this heterogeneity issue, data mediation becomes an important part of the triple space computing architecture. In this paper we introduce data mediation support for triple space computing and further explain how mismatches occur in RDF data, presents an abstract mapping language to specify mapping to cover the heterogeneity, defines architecture of the mediation engine and its interfaces, processing of mediation mapping rules, grounding of mediation rules as RDF triples and finally evaluates with examples
{"title":"Data Mediation Support for Triple Space Computing","authors":"M. O. Shafiq, F. Scharffe, Reto Krummenacher, Ying Ding, D. Fensel","doi":"10.1109/COLCOM.2006.361900","DOIUrl":"https://doi.org/10.1109/COLCOM.2006.361900","url":null,"abstract":"Triple space computing is an emerging technology for communication and coordination of different semantic technologies. It has been achieved by extending tuple space computing to support RDF as triple space computing. It can play an important role by acting as global middleware providing support for collaboration of different semantic technologies. Several participants from semantic Web and semantic Web services applications, distributed worldwide communicate with each other via triple space due to which the possibility of heterogeneity in the RDF schemas and instances among the communicating participants may arise. In order to resolve this heterogeneity issue, data mediation becomes an important part of the triple space computing architecture. In this paper we introduce data mediation support for triple space computing and further explain how mismatches occur in RDF data, presents an abstract mapping language to specify mapping to cover the heterogeneity, defines architecture of the mediation engine and its interfaces, processing of mediation mapping rules, grounding of mediation rules as RDF triples and finally evaluates with examples","PeriodicalId":315775,"journal":{"name":"2006 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114680980","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-17DOI: 10.1109/COLCOM.2006.361864
S. Papadopoulou, C. Ignat, G. Oster, M. Norrie
Awareness of the activities of other users and also document evolution is an important part of collaborative authoring. We introduce the concept of an editing profile that can be used to maintain and visualise measures of the changes made across a document by different users in both synchronous and asynchronous collaborative editing. It provides a simple means of making users aware of ¿hot areas¿ and also who is or has been active in various parts of the document, as well as a quick access point into parts of the document that have been changed. The profile can be adapted to display the most relevant information based on both user preference and situation.
{"title":"Increasing Awareness in Collaborative Authoring through Edit Profiling","authors":"S. Papadopoulou, C. Ignat, G. Oster, M. Norrie","doi":"10.1109/COLCOM.2006.361864","DOIUrl":"https://doi.org/10.1109/COLCOM.2006.361864","url":null,"abstract":"Awareness of the activities of other users and also document evolution is an important part of collaborative authoring. We introduce the concept of an editing profile that can be used to maintain and visualise measures of the changes made across a document by different users in both synchronous and asynchronous collaborative editing. It provides a simple means of making users aware of ¿hot areas¿ and also who is or has been active in various parts of the document, as well as a quick access point into parts of the document that have been changed. The profile can be adapted to display the most relevant information based on both user preference and situation.","PeriodicalId":315775,"journal":{"name":"2006 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126067394","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-17DOI: 10.1109/COLCOM.2006.361855
Colum Foley, A. Smeaton, Hyowon Lee
Collaboration has been identified as an important aspect in information seeking. People meet to discuss and share ideas and through this interaction an information need is quite often identified. However the process of resolving this information need, through interacting with a search engine and performing a search task, is still an individual activity. We propose an environment which allows users to collaborate to satisfy a shared information need. We discuss ways to divide the search task amongst collaborators and propose the use of relevance feedback, a common information retrieval process, to enable the transfer of knowledge across collaborators during a search session. We describe the process by which co-searchers can collaborate effectively with little redundancy and how we can combine relevance judgements from multiple searchers into a coherent model for synchronous collaborative information retrieval
{"title":"Synchronous Collaborative Information Retrieval with Relevance Feedback","authors":"Colum Foley, A. Smeaton, Hyowon Lee","doi":"10.1109/COLCOM.2006.361855","DOIUrl":"https://doi.org/10.1109/COLCOM.2006.361855","url":null,"abstract":"Collaboration has been identified as an important aspect in information seeking. People meet to discuss and share ideas and through this interaction an information need is quite often identified. However the process of resolving this information need, through interacting with a search engine and performing a search task, is still an individual activity. We propose an environment which allows users to collaborate to satisfy a shared information need. We discuss ways to divide the search task amongst collaborators and propose the use of relevance feedback, a common information retrieval process, to enable the transfer of knowledge across collaborators during a search session. We describe the process by which co-searchers can collaborate effectively with little redundancy and how we can combine relevance judgements from multiple searchers into a coherent model for synchronous collaborative information retrieval","PeriodicalId":315775,"journal":{"name":"2006 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132841089","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-17DOI: 10.1109/COLCOM.2006.361872
T. Catarci, F. Rosa, M. Leoni, Massimo Mecella, M. Angelaccio, S. Dustdar, Begoña Gonzalvez, G. Iiritano, A. Krek, G. Vetere, Zdenek M. Zalis
In this paper, we present a recently funded European research project, namely WORKPAD, that aims at designing and developing an innovative software infrastructure (software, models, services, etc.) for supporting collaborative work of human operators in emergency/disaster scenarios. In such scenarios, different teams, belonging to different organizations, need to collaborate with one other to reach a common goal; each team member is equipped with handheld devices (PDAs) and communication technologies, and should carry on specific tasks. In such a case we can consider the whole team as carrying on a process, and the different teams (of the different organizations) collaborate through the "interleaving" of all the different processes (macro-process). Each team is supported by some back-end centre, and the different centres need to cooperate at an inter-organizational level to reach an effective coordination among teams. The project investigates a 2-level framework for such scenarios: a back-end peer-to-peer community, providing advanced services requiring high computational power, data & knowledge & content integration, and a set of front-end peer-to-peer communities, that provide services to human workers, mainly by adaptively enacting processes on mobile ad-hoc networks
{"title":"WORKPAD: 2-Layered Peer-to-Peer for Emergency Management through Adaptive Processes","authors":"T. Catarci, F. Rosa, M. Leoni, Massimo Mecella, M. Angelaccio, S. Dustdar, Begoña Gonzalvez, G. Iiritano, A. Krek, G. Vetere, Zdenek M. Zalis","doi":"10.1109/COLCOM.2006.361872","DOIUrl":"https://doi.org/10.1109/COLCOM.2006.361872","url":null,"abstract":"In this paper, we present a recently funded European research project, namely WORKPAD, that aims at designing and developing an innovative software infrastructure (software, models, services, etc.) for supporting collaborative work of human operators in emergency/disaster scenarios. In such scenarios, different teams, belonging to different organizations, need to collaborate with one other to reach a common goal; each team member is equipped with handheld devices (PDAs) and communication technologies, and should carry on specific tasks. In such a case we can consider the whole team as carrying on a process, and the different teams (of the different organizations) collaborate through the \"interleaving\" of all the different processes (macro-process). Each team is supported by some back-end centre, and the different centres need to cooperate at an inter-organizational level to reach an effective coordination among teams. The project investigates a 2-level framework for such scenarios: a back-end peer-to-peer community, providing advanced services requiring high computational power, data & knowledge & content integration, and a set of front-end peer-to-peer communities, that provide services to human workers, mainly by adaptively enacting processes on mobile ad-hoc networks","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-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126131658","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-17DOI: 10.1109/COLCOM.2006.361867
G. Oster, P. Molli, Pascal Urso, Abdessamad Imine
In collaborative editing, consistency maintenance of the copies of shared data is a critical issue. In the last decade, operational transformation (OT) approach revealed as a suitable mechanism for maintaining consistency. Unfortunately, none of the published propositions relying on this approach are able to satisfy the mandatory correctness properties TP1 and TP2 defined in the Ressel's framework. This paper addresses this correctness issue by proposing a new way to model shared state by retaining tombstones when elements are removed. An instantiation of the proposed model for a linear data structure and the related transformation functions are provided
{"title":"Tombstone Transformation Functions for Ensuring Consistency in Collaborative Editing Systems","authors":"G. Oster, P. Molli, Pascal Urso, Abdessamad Imine","doi":"10.1109/COLCOM.2006.361867","DOIUrl":"https://doi.org/10.1109/COLCOM.2006.361867","url":null,"abstract":"In collaborative editing, consistency maintenance of the copies of shared data is a critical issue. In the last decade, operational transformation (OT) approach revealed as a suitable mechanism for maintaining consistency. Unfortunately, none of the published propositions relying on this approach are able to satisfy the mandatory correctness properties TP1 and TP2 defined in the Ressel's framework. This paper addresses this correctness issue by proposing a new way to model shared state by retaining tombstones when elements are removed. An instantiation of the proposed model for a linear data structure and the related transformation functions are provided","PeriodicalId":315775,"journal":{"name":"2006 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"179 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131419956","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-17DOI: 10.1109/COLCOM.2006.361839
S. Aguirre, J. Salvachúa, J. Quemada, A. Fumero, A. Tapiador
In order to allow the development of joint degrees through heterogeneous e-learning systems, we propose a federation services architecture whose implementation will be based on Web services. Our main objective is to allow e-learning systems to be able to work in a collaborative way; combining their data and functionality through the integration of their services. These services will be combined and federated, according to collaboration agreements between Universities. Joint degrees through e-learning systems will allow the development of new joint curricula and the participation in the convergence of higher education
{"title":"Joint Degrees in E-Learning Systems: A Web Services Approach","authors":"S. Aguirre, J. Salvachúa, J. Quemada, A. Fumero, A. Tapiador","doi":"10.1109/COLCOM.2006.361839","DOIUrl":"https://doi.org/10.1109/COLCOM.2006.361839","url":null,"abstract":"In order to allow the development of joint degrees through heterogeneous e-learning systems, we propose a federation services architecture whose implementation will be based on Web services. Our main objective is to allow e-learning systems to be able to work in a collaborative way; combining their data and functionality through the integration of their services. These services will be combined and federated, according to collaboration agreements between Universities. Joint degrees through e-learning systems will allow the development of new joint curricula and the participation in the convergence of higher education","PeriodicalId":315775,"journal":{"name":"2006 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122911019","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.361887
Qi Li, Xinwen Zhang, S. Qing, Mingwei Xu
With the increasing accessibility of information and data, role-based access control (RBAC) has become a popular technique for security and privacy purposes. However, trusted collaboration between different groups in large corporate Intranets is still an unresolved problem. The challenge is how to extend existing access control model for efficient security management and administration to allow trusted collaboration between different groups. In this paper, we propose a group-based RBAC model (GB-RBAC) for this purpose. In particular, virtual group is proposed in our model to allow secure information and resource sharing in multi-group collaboration environments. All the members of a virtual group build trust relation between themselves and are authorized to join the collaborative work. The scheme and strategies provided in this paper meet the requirements of security, autonomy, and privacy for collaborations. As a result, our scheme provides an easy way to employ RBAC policies to secure ad-hoc collaboration
{"title":"Supporting Ad-hoc Collaboration with Group-based RBAC Model","authors":"Qi Li, Xinwen Zhang, S. Qing, Mingwei Xu","doi":"10.1109/COLCOM.2006.361887","DOIUrl":"https://doi.org/10.1109/COLCOM.2006.361887","url":null,"abstract":"With the increasing accessibility of information and data, role-based access control (RBAC) has become a popular technique for security and privacy purposes. However, trusted collaboration between different groups in large corporate Intranets is still an unresolved problem. The challenge is how to extend existing access control model for efficient security management and administration to allow trusted collaboration between different groups. In this paper, we propose a group-based RBAC model (GB-RBAC) for this purpose. In particular, virtual group is proposed in our model to allow secure information and resource sharing in multi-group collaboration environments. All the members of a virtual group build trust relation between themselves and are authorized to join the collaborative work. The scheme and strategies provided in this paper meet the requirements of security, autonomy, and privacy for collaborations. As a result, our scheme provides an easy way to employ RBAC policies to secure ad-hoc collaboration","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":"134084886","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.361843
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(enalpha(k) log k + n log n + mn log m), where alpha(k) denotes the extremely slowly growing inverse Ackermann function
我们正在研究为一组与会者确定合适的会议时间和地点的问题，这些与会者希望安排一次新的会议，但不包括可能在若干不同地点举行的已安排的会议。每个与会者必须能够到达新的会议地点，参加整个会议期间，并按时到达下一个会议地点。特别地，我们给出了一个问题实例的解决方案，其中每个参与者都有两个由空闲时间间隔分开的预定会议。对于一个几何模型，其中n个参与者可以沿着欧几里得平面上的直线路径行进，我们提出了一个O(n log n)算法来确定最长的会议持续时间和适合所有参与者的位置。在基于图的模型中，运输是由平面上m个节点和e条边的几何网络提供的。参与者可以有个人的体重。此外，可以有k组参与者，这样每个组中只有一名成员必须参加会议。在该模型中，可以在O(enalpha(k) log k + n log n + mn log m)时间内确定可能持续时间最长的会议地点，其中alpha(k)表示极其缓慢增长的逆Ackermann函数
{"title":"How to Fit In Another Meeting","authors":"R. Klein, D. Nussbaum, J. Sack, Jiehua Yi","doi":"10.1109/COLCOM.2006.361843","DOIUrl":"https://doi.org/10.1109/COLCOM.2006.361843","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(enalpha(k) log k + n log n + mn log m), where alpha(k) denotes the extremely slowly growing inverse Ackermann function","PeriodicalId":315775,"journal":{"name":"2006 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"150 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":"114892268","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.361859
J. Chastine, Ying Zhu, J. Preston
For collaborative environments to be successful, a fundamental requirement is that they provide support for inter-referential awareness - or the ability for one participant to refer to a set of objects, and for that reference to be understood by others. Participants in co-located collaboration benefit from the availability of non-verbal communication, including gestures, eye gaze and body movements. However, when geographically separated, they can experience difficulty in communicating - as computer-mediated cues are often compromised. Given the heterogeneity of media and myriad of interaction techniques that exist in groupware, supporting inter-referential awareness can be difficult. We present a unified and systematic way of encapsulating the numerous factors related to this form of awareness through the creation of process-driven ontology. Our framework provides a formal method for describing inter-referential awareness, and serves as approach that interface designers can use to better comprehend the relevant factors involved. This research stems from our previous investigations in inter-referential awareness in collaborative augmented reality environments
{"title":"A Framework for Inter-referential Awareness in Collaborative Environments","authors":"J. Chastine, Ying Zhu, J. Preston","doi":"10.1109/COLCOM.2006.361859","DOIUrl":"https://doi.org/10.1109/COLCOM.2006.361859","url":null,"abstract":"For collaborative environments to be successful, a fundamental requirement is that they provide support for inter-referential awareness - or the ability for one participant to refer to a set of objects, and for that reference to be understood by others. Participants in co-located collaboration benefit from the availability of non-verbal communication, including gestures, eye gaze and body movements. However, when geographically separated, they can experience difficulty in communicating - as computer-mediated cues are often compromised. Given the heterogeneity of media and myriad of interaction techniques that exist in groupware, supporting inter-referential awareness can be difficult. We present a unified and systematic way of encapsulating the numerous factors related to this form of awareness through the creation of process-driven ontology. Our framework provides a formal method for describing inter-referential awareness, and serves as approach that interface designers can use to better comprehend the relevant factors involved. This research stems from our previous investigations in inter-referential awareness in collaborative augmented reality environments","PeriodicalId":315775,"journal":{"name":"2006 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"23 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":"114093645","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
扫码关注我们
求助内容：
应助结果提醒方式：