Pub Date : 2010-10-09DOI: 10.4108/ICST.COLLABORATECOM.2010.11
Esin Saka, O. Nasraoui
This paper proposes a swarm intelligence based recommender system (FlockRecom) based on the collaborative behavior of bird flocks for generating Top-N recommendations. The flock-based recommender algorithm (FlockRecom) iteratively adjusts the position and speed of dynamic flocks of agents on a visualization panel. By using the neighboring agents on the visualization panel, top-n recommendations are generated. The performance of FlockRecom is evaluated using the Jester Dataset-2 and is compared with a traditional collaborative filtering based recommender system. Experiments on real data illustrate the workings of the recommender system and its advantages over its CF baseline.
{"title":"A recommender system based on the collaborative behavior of bird flocks","authors":"Esin Saka, O. Nasraoui","doi":"10.4108/ICST.COLLABORATECOM.2010.11","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM.2010.11","url":null,"abstract":"This paper proposes a swarm intelligence based recommender system (FlockRecom) based on the collaborative behavior of bird flocks for generating Top-N recommendations. The flock-based recommender algorithm (FlockRecom) iteratively adjusts the position and speed of dynamic flocks of agents on a visualization panel. By using the neighboring agents on the visualization panel, top-n recommendations are generated. The performance of FlockRecom is evaluated using the Jester Dataset-2 and is compared with a traditional collaborative filtering based recommender system. Experiments on real data illustrate the workings of the recommender system and its advantages over its CF baseline.","PeriodicalId":354101,"journal":{"name":"6th International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2010)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121196237","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 : 2010-10-09DOI: 10.4108/ICST.COLLABORATECOM.2010.24
Tyrone Grandison
Protection of personal healthcare information (PHI) has been as a significant hindrance to the acceptance, adoption and continued use of healthcare information technology (HIT). As nations and corporations encourage innovation in the healthcare sector for better outcomes for all its stakeholders, they are proceeding under a latent assumption - the equation of data stewardship with data ownership. This notion relegates the patient to the role of information provider and empowers infrastructure owners with data ownership rights. In this paper, we introduce Patient-Centric Privacy, which refers to 1) the recognition that patients are a fundamental and integral part of the disclosure, access and use processes, and 2) to the ability of the patient to control the release of their healthcare information.
{"title":"Patient-Centric Privacy: Envisioning collaboration between payers, providers & patients with the patient at the core","authors":"Tyrone Grandison","doi":"10.4108/ICST.COLLABORATECOM.2010.24","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM.2010.24","url":null,"abstract":"Protection of personal healthcare information (PHI) has been as a significant hindrance to the acceptance, adoption and continued use of healthcare information technology (HIT). As nations and corporations encourage innovation in the healthcare sector for better outcomes for all its stakeholders, they are proceeding under a latent assumption - the equation of data stewardship with data ownership. This notion relegates the patient to the role of information provider and empowers infrastructure owners with data ownership rights. In this paper, we introduce Patient-Centric Privacy, which refers to 1) the recognition that patients are a fundamental and integral part of the disclosure, access and use processes, and 2) to the ability of the patient to control the release of their healthcare information.","PeriodicalId":354101,"journal":{"name":"6th International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2010)","volume":"282 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131734243","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 : 2010-10-09DOI: 10.4108/ICST.COLLABORATECOM.2010.60
S. Hussain, Dirk Veiel, J. Haake, S. Lukosch
Knowledge work in modern organizations is increasingly performed collaboratively by distributed teams. Such collaboration involves dynamically changing situations. Making the collaboration environment fit the needs of these situations is supported by system-initiated adaptation based on the user and team context. Adaptation in the collaboration environment may confuse the users, because they cannot remember all adaptation policies. In this paper we propose an approach to present context enriched explanations to help them understand the adaptation behavior. Also, we describe a social network analysis strategy to identify socially related and current situation relevant communication partners. Integrated on demand communication is facilitated among these partners for discussion and understanding the adaptation policies.
{"title":"Facilitating understanding of team-based adaptation policies","authors":"S. Hussain, Dirk Veiel, J. Haake, S. Lukosch","doi":"10.4108/ICST.COLLABORATECOM.2010.60","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM.2010.60","url":null,"abstract":"Knowledge work in modern organizations is increasingly performed collaboratively by distributed teams. Such collaboration involves dynamically changing situations. Making the collaboration environment fit the needs of these situations is supported by system-initiated adaptation based on the user and team context. Adaptation in the collaboration environment may confuse the users, because they cannot remember all adaptation policies. In this paper we propose an approach to present context enriched explanations to help them understand the adaptation behavior. Also, we describe a social network analysis strategy to identify socially related and current situation relevant communication partners. Integrated on demand communication is facilitated among these partners for discussion and understanding the adaptation policies.","PeriodicalId":354101,"journal":{"name":"6th International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2010)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134623591","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 : 2010-10-09DOI: 10.4108/ICST.COLLABORATECOM.2010.26
J. Costa, Rafael Martins Feitosa, C. D. Souza
This paper presents RaisAware, a collaborative software development tool aimed at supporting the relationship between software architecture and coordination of software development activities. Our design is based on both dependency analysis of software development artifacts and software developers' activities. We describe the motivations behind this work, detail the design and implementation of RaisAware, and present an evaluation of the tool using open-source project data.
{"title":"Tool support for collaborative software development based on dependency analysis","authors":"J. Costa, Rafael Martins Feitosa, C. D. Souza","doi":"10.4108/ICST.COLLABORATECOM.2010.26","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM.2010.26","url":null,"abstract":"This paper presents RaisAware, a collaborative software development tool aimed at supporting the relationship between software architecture and coordination of software development activities. Our design is based on both dependency analysis of software development artifacts and software developers' activities. We describe the motivations behind this work, detail the design and implementation of RaisAware, and present an evaluation of the tool using open-source project data.","PeriodicalId":354101,"journal":{"name":"6th International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2010)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115487697","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 : 2010-10-09DOI: 10.4108/ICST.COLLABORATECOM.2010.7
A. Masoumzadeh, J. Joshi
A social network is a collection of social entities and the relations among them. Collection and sharing of such network data for analysis raise significant privacy concerns for the involved individuals, especially when human users are involved. To address such privacy concerns, several techniques, such as k-anonymity based approaches, have been proposed in the literature. However, such approaches introduce a large amount of distortion to the original social network graphs, thus raising serious questions about their utility for useful social network analysis. Consequently, these techniques may never be applied in practice. In this paper, we emphasize the use of network structural semantics in the social network analysis theory to address this problem. We propose an approach for enhancing anonymization techniques that preserves the structural semantics of the original social network by using the notion of roles and positions. We present experimental results that demonstrate that our approach can significantly help in preserving graph and social network theoretic properties of the original social networks, and hence improve utility of the anonymized data.
{"title":"Preserving structural properties in anonymization of social networks","authors":"A. Masoumzadeh, J. Joshi","doi":"10.4108/ICST.COLLABORATECOM.2010.7","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM.2010.7","url":null,"abstract":"A social network is a collection of social entities and the relations among them. Collection and sharing of such network data for analysis raise significant privacy concerns for the involved individuals, especially when human users are involved. To address such privacy concerns, several techniques, such as k-anonymity based approaches, have been proposed in the literature. However, such approaches introduce a large amount of distortion to the original social network graphs, thus raising serious questions about their utility for useful social network analysis. Consequently, these techniques may never be applied in practice. In this paper, we emphasize the use of network structural semantics in the social network analysis theory to address this problem. We propose an approach for enhancing anonymization techniques that preserves the structural semantics of the original social network by using the notion of roles and positions. We present experimental results that demonstrate that our approach can significantly help in preserving graph and social network theoretic properties of the original social networks, and hence improve utility of the anonymized data.","PeriodicalId":354101,"journal":{"name":"6th International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2010)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128100145","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 : 2010-10-09DOI: 10.4108/ICST.COLLABORATECOM.2010.54
M. ElGammal, M. Eltoweissy
We foresee the need for dynamically clustering nodes in Wireless Sensor Networks (WSNs) according to a multitude of disparate co-existing contexts. To this end, we propose a distributed, low-overhead context-aware clustering protocol for WSNs. We employ Affinity Propagation (AP) for clustering nodes based on multiple criteria including location, residual energy, and contextual data sensed from the environment. We propose a novel approach for context representation based on potential fields. We discuss the integration of our context representation model with AP and demonstrate using simulation the effectiveness and proficiency of the proposed protocol in satisfying its intended objectives.
{"title":"Distributed context-aware Affinity Propagation clustering in Wireless Sensor Networks","authors":"M. ElGammal, M. Eltoweissy","doi":"10.4108/ICST.COLLABORATECOM.2010.54","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM.2010.54","url":null,"abstract":"We foresee the need for dynamically clustering nodes in Wireless Sensor Networks (WSNs) according to a multitude of disparate co-existing contexts. To this end, we propose a distributed, low-overhead context-aware clustering protocol for WSNs. We employ Affinity Propagation (AP) for clustering nodes based on multiple criteria including location, residual energy, and contextual data sensed from the environment. We propose a novel approach for context representation based on potential fields. We discuss the integration of our context representation model with AP and demonstrate using simulation the effectiveness and proficiency of the proposed protocol in satisfying its intended objectives.","PeriodicalId":354101,"journal":{"name":"6th International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2010)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129615196","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 : 2010-10-09DOI: 10.4108/ICST.COLLABORATECOM.2010.57
P. L. Takecian, J. E. Ferreira, Simon Malkowski, C. Pu
Collaborative applications require understanding of the theoretical foundations. In case of workflow systems, one possibility to achieve this is an accurate description of workflow functionalities. Despite its growing popularity and success, it has not yet been evaluated whether Language of Temporal Ordering Specification (LOTOS) is actually suitable for representing comprehensive workflow functionality in real-world workflow systems describing the behavioral perspective of control-flow. Our primary contribution is the complete mapping of a collection of workflow patterns to LOTOS notation. We further discuss suitability and expressiveness of LOTOS in the context of workflow patterns. This study can be used for pattern-based workflow execution, reasoning, and simulation as well as for future research on theoretical aspects of workflows for collaborative applications.
{"title":"Using LOTOS for rigorous specifications of workflow patterns","authors":"P. L. Takecian, J. E. Ferreira, Simon Malkowski, C. Pu","doi":"10.4108/ICST.COLLABORATECOM.2010.57","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM.2010.57","url":null,"abstract":"Collaborative applications require understanding of the theoretical foundations. In case of workflow systems, one possibility to achieve this is an accurate description of workflow functionalities. Despite its growing popularity and success, it has not yet been evaluated whether Language of Temporal Ordering Specification (LOTOS) is actually suitable for representing comprehensive workflow functionality in real-world workflow systems describing the behavioral perspective of control-flow. Our primary contribution is the complete mapping of a collection of workflow patterns to LOTOS notation. We further discuss suitability and expressiveness of LOTOS in the context of workflow patterns. This study can be used for pattern-based workflow execution, reasoning, and simulation as well as for future research on theoretical aspects of workflows for collaborative applications.","PeriodicalId":354101,"journal":{"name":"6th International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2010)","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133140369","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 : 2010-10-01DOI: 10.4108/ICST.COLLABORATECOM.2010.25
Guoqiang Gao, Ruixuan Li, X. Gu, Kunmei Wen, Zhengding Lu, Kun Yan
In order to access sensitive documents shared over government, army and enterprise intranets, users rely on an indexing facility where they can quickly locate relevant documents they are allowed to access, (1) without leaking information about the remaining documents, (2) without imposing large load on the receptionist, and (3) with a balanced load on the index servers. To address this problem, we propose Mimir, a distributed cipher retrieval system for sensitive documents. Mimir constructs the distributed indexes based on load balanced term distribution for better search efficiency and load balanced query. Mimir utilizes encryption with random key, partial key update, and access control based on role and user to protect sensitive data and improve query efficiency. Mimir uses dynamic pipelined search strategy to balance the load of the management server and reduce the search delay. Our experiments show that Mimir can effectively protect secret data and answer queries nearly as fast as an ordinary inverted index.
{"title":"Mimir: Term-distributed indexing and search for secret documents","authors":"Guoqiang Gao, Ruixuan Li, X. Gu, Kunmei Wen, Zhengding Lu, Kun Yan","doi":"10.4108/ICST.COLLABORATECOM.2010.25","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM.2010.25","url":null,"abstract":"In order to access sensitive documents shared over government, army and enterprise intranets, users rely on an indexing facility where they can quickly locate relevant documents they are allowed to access, (1) without leaking information about the remaining documents, (2) without imposing large load on the receptionist, and (3) with a balanced load on the index servers. To address this problem, we propose Mimir, a distributed cipher retrieval system for sensitive documents. Mimir constructs the distributed indexes based on load balanced term distribution for better search efficiency and load balanced query. Mimir utilizes encryption with random key, partial key update, and access control based on role and user to protect sensitive data and improve query efficiency. Mimir uses dynamic pipelined search strategy to balance the load of the management server and reduce the search delay. Our experiments show that Mimir can effectively protect secret data and answer queries nearly as fast as an ordinary inverted index.","PeriodicalId":354101,"journal":{"name":"6th International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2010)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124155293","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 : 2010-10-01DOI: 10.4108/ICST.COLLABORATECOM.2010.36
Mikyung Kang, Yun-Seung Nam, Ji-Seung Nam
Recently broadcasts on the Internet, Internet movie theaters and the growing stream of service-oriented Internet services have increased. The bottleneck created to enhance network performance to meet the needs of service users has also increased, while accommodating the needs of the system for the performance of multimedia server capacity cannot meet the server specifications. To provide Distributed Interactive Applications (DIAs) such as IPTV, Teleconferencing and NetGames service in a real environment it is required to have a large amount of system resource and network bandwidth. Our analysis results show that proposed scheme can reduce the network overhead for the multicast routing tree construction and uses minimal bandwidth for data delivery.
{"title":"An overlay multicast scheme for Distributed Interactive Applications","authors":"Mikyung Kang, Yun-Seung Nam, Ji-Seung Nam","doi":"10.4108/ICST.COLLABORATECOM.2010.36","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM.2010.36","url":null,"abstract":"Recently broadcasts on the Internet, Internet movie theaters and the growing stream of service-oriented Internet services have increased. The bottleneck created to enhance network performance to meet the needs of service users has also increased, while accommodating the needs of the system for the performance of multimedia server capacity cannot meet the server specifications. To provide Distributed Interactive Applications (DIAs) such as IPTV, Teleconferencing and NetGames service in a real environment it is required to have a large amount of system resource and network bandwidth. Our analysis results show that proposed scheme can reduce the network overhead for the multicast routing tree construction and uses minimal bandwidth for data delivery.","PeriodicalId":354101,"journal":{"name":"6th International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2010)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130100970","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 : 2010-10-01DOI: 10.4108/ICST.TRUSTCOL.2010.5
Zhengping Wu, Lifeng Wang
This paper proposes an enforcement architecture and develop a simulation framework for cross-domain policy enforcement. The entire simulation environment is used to solve the problem of enforcing policies across domain boundaries when permanent or temporary collaborations have to span over multiple domains. In reality, different systems from different organizations or domains have very different high-level policy representations and various low-level enforcement mechanisms, such as high-level security policies, privacy configurations, and low-level system calls (services). To make sure the compatibility and enforceability of one policy set in another domain, a simulation environment is needed before actual policy deployment and code development. The framework developed in this simulation environment can also be used to generate policy enforcement code directly for permanent integrations or temporary interactions. This framework provides various functions to enforce policies automatically or semi-automatically across domains as by-products. A case study in healthcare information systems confirms the advantages of these new functions and facilities in this simulation environment.
{"title":"Model-driven simulation for cross-domain policy enforcement","authors":"Zhengping Wu, Lifeng Wang","doi":"10.4108/ICST.TRUSTCOL.2010.5","DOIUrl":"https://doi.org/10.4108/ICST.TRUSTCOL.2010.5","url":null,"abstract":"This paper proposes an enforcement architecture and develop a simulation framework for cross-domain policy enforcement. The entire simulation environment is used to solve the problem of enforcing policies across domain boundaries when permanent or temporary collaborations have to span over multiple domains. In reality, different systems from different organizations or domains have very different high-level policy representations and various low-level enforcement mechanisms, such as high-level security policies, privacy configurations, and low-level system calls (services). To make sure the compatibility and enforceability of one policy set in another domain, a simulation environment is needed before actual policy deployment and code development. The framework developed in this simulation environment can also be used to generate policy enforcement code directly for permanent integrations or temporary interactions. This framework provides various functions to enforce policies automatically or semi-automatically across domains as by-products. A case study in healthcare information systems confirms the advantages of these new functions and facilities in this simulation environment.","PeriodicalId":354101,"journal":{"name":"6th International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2010)","volume":"144 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133423955","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
扫码关注我们
求助内容：
应助结果提醒方式：