Pub Date : 2014-11-11DOI: 10.4108/ICST.COLLABORATECOM.2014.257552
Jie Cao, Lingmei Ren, Weisong Shi, Zhifeng Yu
Wireless sensor network-based technologies and applications have attracted a lot of attention in the past two decades because of their huge potential to change people's way of life. These applications usually need close collaboration among multiple sensors, gateways, services and end users. When developing these applications, system designers and practitioners usually face several performance requirements such as the accuracy, battery life and system reliability. Given the hard requirements in system performance, how to choose an optimal combination from various sensors, algorithms and collaborative systems to form the application is the most important problem that practitioners need to address. Ad hoc solutions were proposed in specific applications in the past; however, a general methodology that can be easily applied to future applications is lacking. In this paper, we take the challenge and propose a general framework aiming to address the component selection problem, illustrate how this framework can be applied to real life applications through a case study, and discuss challenging issues and two interesting finds from our implementation.
{"title":"A framework for component selection in collaborative sensing application development","authors":"Jie Cao, Lingmei Ren, Weisong Shi, Zhifeng Yu","doi":"10.4108/ICST.COLLABORATECOM.2014.257552","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM.2014.257552","url":null,"abstract":"Wireless sensor network-based technologies and applications have attracted a lot of attention in the past two decades because of their huge potential to change people's way of life. These applications usually need close collaboration among multiple sensors, gateways, services and end users. When developing these applications, system designers and practitioners usually face several performance requirements such as the accuracy, battery life and system reliability. Given the hard requirements in system performance, how to choose an optimal combination from various sensors, algorithms and collaborative systems to form the application is the most important problem that practitioners need to address. Ad hoc solutions were proposed in specific applications in the past; however, a general methodology that can be easily applied to future applications is lacking. In this paper, we take the challenge and propose a general framework aiming to address the component selection problem, illustrate how this framework can be applied to real life applications through a case study, and discuss challenging issues and two interesting finds from our implementation.","PeriodicalId":432345,"journal":{"name":"10th IEEE International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128501957","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 : 2014-11-11DOI: 10.4108/ICST.COLLABORATECOM.2014.257706
Alana Libonati, Kelly E. Caine, Apu Kapadia, M. Reiter
People increasingly rely on mobile phones for storing sensitive information and credentials for access to services. Because these devices are vulnerable to theft, security of this data is put at higher risk-once the attacker is in physical possession of the device, recovering these credentials and impersonating the owner of the phone is hard to defend by purely local means. We introduce the concept of `notarization', a process by which a remote notary verifies the identity of the device user through video chat. We describe the design and implementation of a system that leverages notarization to protect cryptographic keys that the device uses to decrypt device data (e.g., website passwords) or perform signatures in support of client-side TLS, without trusting the notary with these keys. Through a lab-based study with 56 participants, we show that notarization even by strangers is effective for combating device theft.
{"title":"Defending against device theft with human notarization","authors":"Alana Libonati, Kelly E. Caine, Apu Kapadia, M. Reiter","doi":"10.4108/ICST.COLLABORATECOM.2014.257706","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM.2014.257706","url":null,"abstract":"People increasingly rely on mobile phones for storing sensitive information and credentials for access to services. Because these devices are vulnerable to theft, security of this data is put at higher risk-once the attacker is in physical possession of the device, recovering these credentials and impersonating the owner of the phone is hard to defend by purely local means. We introduce the concept of `notarization', a process by which a remote notary verifies the identity of the device user through video chat. We describe the design and implementation of a system that leverages notarization to protect cryptographic keys that the device uses to decrypt device data (e.g., website passwords) or perform signatures in support of client-side TLS, without trusting the notary with these keys. Through a lab-based study with 56 participants, we show that notarization even by strangers is effective for combating device theft.","PeriodicalId":432345,"journal":{"name":"10th IEEE International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130494090","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 : 2014-11-11DOI: 10.4108/ICST.COLLABORATECOM.2014.257769
A. M. Mustafa, Ahsanul Haque, L. Khan, M. Baron, B. Thuraisingham
Classifying instances in evolving data stream is a challenging task because of its properties, e.g., infinite length, concept drift, and concept evolution. Most of the currently available approaches to classify stream data instances divide the stream data into fixed size chunks to fit the data in memory and process the fixed size chunk one after another. However, this may lead to failure of capturing the concept drift immediately. We try to determine the chunk size dynamically by exploiting change point detection (CPD) techniques on stream data. In general, the distribution families before and after the change point are unknown over the stream, therefore non-parametric CPD algorithms are used in this case. We propose a multi-dimensional non-parametric CPD technique to determine chunk boundary over data streams dynamically which leads to better models to classify instances of evolving data streams. Experimental results show that our approach can detect the change points and classify instances of evolving data stream with high accuracy as compared to other baseline approaches.
{"title":"Evolving stream classification using change detection","authors":"A. M. Mustafa, Ahsanul Haque, L. Khan, M. Baron, B. Thuraisingham","doi":"10.4108/ICST.COLLABORATECOM.2014.257769","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM.2014.257769","url":null,"abstract":"Classifying instances in evolving data stream is a challenging task because of its properties, e.g., infinite length, concept drift, and concept evolution. Most of the currently available approaches to classify stream data instances divide the stream data into fixed size chunks to fit the data in memory and process the fixed size chunk one after another. However, this may lead to failure of capturing the concept drift immediately. We try to determine the chunk size dynamically by exploiting change point detection (CPD) techniques on stream data. In general, the distribution families before and after the change point are unknown over the stream, therefore non-parametric CPD algorithms are used in this case. We propose a multi-dimensional non-parametric CPD technique to determine chunk boundary over data streams dynamically which leads to better models to classify instances of evolving data streams. Experimental results show that our approach can detect the change points and classify instances of evolving data stream with high accuracy as compared to other baseline approaches.","PeriodicalId":432345,"journal":{"name":"10th IEEE International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121765880","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 : 2014-11-11DOI: 10.4108/ICST.COLLABORATECOM.2014.257269
Michael Zeising, Stefan Schönig, S. Jablonski
The spectrum of an organization's business processes ranges from routine processes with a well-defined flow to agile processes with a degree of uncertainty. The Process Navigation platform aims at supporting both types of processes as well as combinations of them. It offers execution support for traditional flow-oriented notations like BPMN as they are well-suited for the routine type of processes. Rule-based notations for agile processes like CMMN are on the way of getting established but still have a number of weaknesses. As a consequence, the platform's agile part does not target one single notation but relies on a rule-based cross-perspective and modal intermediate language. CMMN models are then translated to the intermediate language for execution. The contribution of this paper is built up in three parts: first of all, the overall architecture of the execution platform is explained. In a second step, the intermediate language is evaluated on the basis of a comprehensive and acknowledged framework of business process requirements. And finally, the translation of CMMN to the intermediate language is described by means of an example.
{"title":"Towards a common platform for the support of routine and agile business processes","authors":"Michael Zeising, Stefan Schönig, S. Jablonski","doi":"10.4108/ICST.COLLABORATECOM.2014.257269","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM.2014.257269","url":null,"abstract":"The spectrum of an organization's business processes ranges from routine processes with a well-defined flow to agile processes with a degree of uncertainty. The Process Navigation platform aims at supporting both types of processes as well as combinations of them. It offers execution support for traditional flow-oriented notations like BPMN as they are well-suited for the routine type of processes. Rule-based notations for agile processes like CMMN are on the way of getting established but still have a number of weaknesses. As a consequence, the platform's agile part does not target one single notation but relies on a rule-based cross-perspective and modal intermediate language. CMMN models are then translated to the intermediate language for execution. The contribution of this paper is built up in three parts: first of all, the overall architecture of the execution platform is explained. In a second step, the intermediate language is evaluated on the basis of a comprehensive and acknowledged framework of business process requirements. And finally, the translation of CMMN to the intermediate language is described by means of an example.","PeriodicalId":432345,"journal":{"name":"10th IEEE International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127467410","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 : 2014-11-11DOI: 10.4108/ICST.COLLABORATECOM.2014.257848
A. Khalifa, M. Azab, M. Eltoweissy
The emergence of Mobile Ad-hoc Clouds (MACs) promises more effective and collaborative elastic resource-infinite computing. However, the highly dynamic, mobile, heterogeneous, fractionized, and scattered nature of computing resources coupled with the isolated non-cooperative nature of current resource management systems make it impossible for current virtualization and resource management techniques to guarantee resilient cloud service delivery. In this paper, we present PlanetCloud, our MAC management platform with an intrinsic support for resilient, highly mobile, cooperative, and dynamically-configurable MACs. We use PlanetCloud for the construction and management of resilient hybrid MACs (HMACs) over mobile and stationary computing resources. PlanetCloud comprises a trustworthy fine-grained virtualization layer and a task management layer. PlanetCloud employs the concepts of application virtualization and fractionation using intrinsically-resilient and aware micro virtual machines, or Cells in our terminology, to encapsulate executable applicationfractions. Such employment isolates the running application from the underlying physical resource enabling seamless execution over heterogeneous resources, lightweight load migration, and low cost of failure. Integral to PlanetCloud is resource forecasting and selection mechanism, which provide a MAC with future appropriate resource availability in space and time. Further, these features enable a large set of mobile, heterogeneous, and scattered resources to collaborate through PlanetCloud smart management platforms that seamlessly consolidates such resources into a resilient HMAC. Using analysis and simulation, we evaluate a PlanetCloud-managed resilient HMAC. Results show that PlanetCloud can provision high level of resource availability transparently maintaining the applications' QoS while preventing service disruption even in highly dynamic environments. Additionally, results showed that our approach to minimizing the cost of failure and facilitating easy load migration elevates the resilience of the HMAC to a great extent.
{"title":"Resilient hybrid Mobile Ad-hoc Cloud over collaborating heterogeneous nodes","authors":"A. Khalifa, M. Azab, M. Eltoweissy","doi":"10.4108/ICST.COLLABORATECOM.2014.257848","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM.2014.257848","url":null,"abstract":"The emergence of Mobile Ad-hoc Clouds (MACs) promises more effective and collaborative elastic resource-infinite computing. However, the highly dynamic, mobile, heterogeneous, fractionized, and scattered nature of computing resources coupled with the isolated non-cooperative nature of current resource management systems make it impossible for current virtualization and resource management techniques to guarantee resilient cloud service delivery. In this paper, we present PlanetCloud, our MAC management platform with an intrinsic support for resilient, highly mobile, cooperative, and dynamically-configurable MACs. We use PlanetCloud for the construction and management of resilient hybrid MACs (HMACs) over mobile and stationary computing resources. PlanetCloud comprises a trustworthy fine-grained virtualization layer and a task management layer. PlanetCloud employs the concepts of application virtualization and fractionation using intrinsically-resilient and aware micro virtual machines, or Cells in our terminology, to encapsulate executable applicationfractions. Such employment isolates the running application from the underlying physical resource enabling seamless execution over heterogeneous resources, lightweight load migration, and low cost of failure. Integral to PlanetCloud is resource forecasting and selection mechanism, which provide a MAC with future appropriate resource availability in space and time. Further, these features enable a large set of mobile, heterogeneous, and scattered resources to collaborate through PlanetCloud smart management platforms that seamlessly consolidates such resources into a resilient HMAC. Using analysis and simulation, we evaluate a PlanetCloud-managed resilient HMAC. Results show that PlanetCloud can provision high level of resource availability transparently maintaining the applications' QoS while preventing service disruption even in highly dynamic environments. Additionally, results showed that our approach to minimizing the cost of failure and facilitating easy load migration elevates the resilience of the HMAC to a great extent.","PeriodicalId":432345,"journal":{"name":"10th IEEE International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114817709","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 : 2014-11-11DOI: 10.4108/ICST.COLLABORATECOM.2014.257844
Rizwana Rizia, Nadiyah Johnson, A. Patwary, G. Ahsan, Sheikh Iqbal Ahamed, Zeno Franco, Katinka Hooyer, Bob Curry, M. Flower
Veterans often face great difficulties during the community and family reintegration after military deployment. Mental health problems resulting from war related traumatic experiences often make social readjustment very difficult. Many research suggests that peer-mentorship can be very effective for mental-health problems. Dryhootch (DH), a community organization led by veterans, has implemented a veteran peer-mentor program. The primary objective of DH program is to provide peer-mentor support to veterans going through social readjustment. In this paper we propose to expand DH's paper-based peer-mentor program with a mobile-based system, iPeer. The proposed expansion improves the efficiency of the current DH approach by augmenting the existing social process with mobile technologies used extensively by younger veterans returning from Afghanistan and Iraq. We provide a description of the evolution of this mobile-based peer-mentor support tool through collaborative design research. We also present our initial usability findings in order to demonstrate the improved efficiency offered by the augmented technology.
{"title":"Mobile peer-mentoring: An approach to make veterans seek mental health-care support a normality","authors":"Rizwana Rizia, Nadiyah Johnson, A. Patwary, G. Ahsan, Sheikh Iqbal Ahamed, Zeno Franco, Katinka Hooyer, Bob Curry, M. Flower","doi":"10.4108/ICST.COLLABORATECOM.2014.257844","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM.2014.257844","url":null,"abstract":"Veterans often face great difficulties during the community and family reintegration after military deployment. Mental health problems resulting from war related traumatic experiences often make social readjustment very difficult. Many research suggests that peer-mentorship can be very effective for mental-health problems. Dryhootch (DH), a community organization led by veterans, has implemented a veteran peer-mentor program. The primary objective of DH program is to provide peer-mentor support to veterans going through social readjustment. In this paper we propose to expand DH's paper-based peer-mentor program with a mobile-based system, iPeer. The proposed expansion improves the efficiency of the current DH approach by augmenting the existing social process with mobile technologies used extensively by younger veterans returning from Afghanistan and Iraq. We provide a description of the evolution of this mobile-based peer-mentor support tool through collaborative design research. We also present our initial usability findings in order to demonstrate the improved efficiency offered by the augmented technology.","PeriodicalId":432345,"journal":{"name":"10th IEEE International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121492100","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 : 2014-11-11DOI: 10.4108/ICST.COLLABORATECOM.2014.257317
Biswajyoti Pal, Anupama Pasumarthy, K. Dhara, V. Krishnaswamy
Research studies have shown that the effectiveness of collaboration and the choice of communication modality is intricately linked with the perceived presence and availability of the collaborating parties. Most collaboration systems offer users the ability to publish their presence for effective collaboration. However, a close observation of users' behavioral data shows a divergence such as in a published `busy' state a user is actually willing to collaborate with certain people or in a published `available' state a user is unwilling to collaborate with certain people. This behavior makes the notion of presence in collaboration systems ineffectual and often unreliable. In this paper, we propose a new predictive model of behavioral presence for collaborative messaging systems that automatically infers multiple presence states based on users expected collaboration behavior towards a contact. We present a novel confirmatory data mining technique that overlays a `cluster of interest' on standard clustering techniques such as k-means, fuzzy k-means, and consensus clustering. We present validation results of our predictive model on data obtained from real-world deployed enterprise servers across multiple locations over a period of seven months.
{"title":"Enhancing message collaboration through predictive modeling of user behavior","authors":"Biswajyoti Pal, Anupama Pasumarthy, K. Dhara, V. Krishnaswamy","doi":"10.4108/ICST.COLLABORATECOM.2014.257317","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM.2014.257317","url":null,"abstract":"Research studies have shown that the effectiveness of collaboration and the choice of communication modality is intricately linked with the perceived presence and availability of the collaborating parties. Most collaboration systems offer users the ability to publish their presence for effective collaboration. However, a close observation of users' behavioral data shows a divergence such as in a published `busy' state a user is actually willing to collaborate with certain people or in a published `available' state a user is unwilling to collaborate with certain people. This behavior makes the notion of presence in collaboration systems ineffectual and often unreliable. In this paper, we propose a new predictive model of behavioral presence for collaborative messaging systems that automatically infers multiple presence states based on users expected collaboration behavior towards a contact. We present a novel confirmatory data mining technique that overlays a `cluster of interest' on standard clustering techniques such as k-means, fuzzy k-means, and consensus clustering. We present validation results of our predictive model on data obtained from real-world deployed enterprise servers across multiple locations over a period of seven months.","PeriodicalId":432345,"journal":{"name":"10th IEEE International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"271 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124394299","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 : 2014-11-11DOI: 10.4108/ICST.COLLABORATECOM.2014.257585
Zhe Wang, N. Minsky
Dependability of heterogeneous distributed systems is an important issue. Coordination failures may occur even if the given coordination protocol is adhered to by all participants. The fault tolerance (FT) properties of systems are difficult to achieve, especially at application level. What is common to current FT-techniques is their reliance on the code of the various system components, which are often required to be written in a specific language. From the viewpoint of distributed systems, such techniques are feasible for homogeneous systems, or at least systems that are designed and maintained by a single administrative domain. But such code-based techniques are generally unreliable for open systems, due to the lack of overall control over the code of components. This leaves open distributed systems vulnerable to their own faults and to attack on them. However, certain types of FT measures can be established in distributed systems by controlling the flow of messages between system components, independently of the code of system components-which we plan to do via a distributed coordination and control mechanism called Law-Governed Interaction. We demonstrate in this paper, there is a substantial range of FT measures that can be established completely by controlling messaging. Moreover, although the FT-measures to be developed are meant mostly for open systems, some of them can be useful for distributed systems in general, even where traditional code-based techniques are feasible.
{"title":"Fault tolerance in heterogeneous distributed systems","authors":"Zhe Wang, N. Minsky","doi":"10.4108/ICST.COLLABORATECOM.2014.257585","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM.2014.257585","url":null,"abstract":"Dependability of heterogeneous distributed systems is an important issue. Coordination failures may occur even if the given coordination protocol is adhered to by all participants. The fault tolerance (FT) properties of systems are difficult to achieve, especially at application level. What is common to current FT-techniques is their reliance on the code of the various system components, which are often required to be written in a specific language. From the viewpoint of distributed systems, such techniques are feasible for homogeneous systems, or at least systems that are designed and maintained by a single administrative domain. But such code-based techniques are generally unreliable for open systems, due to the lack of overall control over the code of components. This leaves open distributed systems vulnerable to their own faults and to attack on them. However, certain types of FT measures can be established in distributed systems by controlling the flow of messages between system components, independently of the code of system components-which we plan to do via a distributed coordination and control mechanism called Law-Governed Interaction. We demonstrate in this paper, there is a substantial range of FT measures that can be established completely by controlling messaging. Moreover, although the FT-measures to be developed are meant mostly for open systems, some of them can be useful for distributed systems in general, even where traditional code-based techniques are feasible.","PeriodicalId":432345,"journal":{"name":"10th IEEE International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"314 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120930650","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 : 2014-11-11DOI: 10.4108/ICST.COLLABORATECOM.2014.257666
Mohamed Abdellatif, Iman Saleh, M. Blake
Businesses and government agencies are continuously generating and collecting huge amounts of data and building related Big Data applications. Big Data applications involve the collaborative integration of APIs from different providers. A challenge in this domain is to guarantee the conformance of the integration to privacy terms and regulations. In this paper, we present JPrivacy, a privacy profiling framework for Big Data applications. JPrivacy proposes a model for privacy rules and provide the algorithms and related tools to check Java code against these rules. We show through experimentation that JPrivacy can effectively detect privacy violations by statically analyzing a piece of code.
{"title":"JPrivacy: A java privacy profiling framework for Big Data applications","authors":"Mohamed Abdellatif, Iman Saleh, M. Blake","doi":"10.4108/ICST.COLLABORATECOM.2014.257666","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM.2014.257666","url":null,"abstract":"Businesses and government agencies are continuously generating and collecting huge amounts of data and building related Big Data applications. Big Data applications involve the collaborative integration of APIs from different providers. A challenge in this domain is to guarantee the conformance of the integration to privacy terms and regulations. In this paper, we present JPrivacy, a privacy profiling framework for Big Data applications. JPrivacy proposes a model for privacy rules and provide the algorithms and related tools to check Java code against these rules. We show through experimentation that JPrivacy can effectively detect privacy violations by statically analyzing a piece of code.","PeriodicalId":432345,"journal":{"name":"10th IEEE International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"179 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125814760","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 : 2014-11-11DOI: 10.4108/ICST.COLLABORATECOM.2014.257674
V. Sharma, Kyumin Lee, Jin-Wook Chung
Planning a trip can be a tedious task. One has to search for what places to visit at a destination (i.e. area) and what time to visit the destination. Sometimes this can be a time-consuming task because there are too much information available, and it is hard for one to choose which information to trust. In this paper we present a recommendation system clustering geo-tagged social data in a destination from each information source - Flickr and Foursquare - and combining the results from these diverse information sources to recommend places to visit. Our experimental results show that our recommendation system automatically suggests prime spots in Yellowstone national park with 0.83 precision and 0.927 NDCG, and in Yosemite national park with 0.8 precision and 0.912 NDCG. In addition, visualizing temporal information of social data helps travelers to decide when to visit a destination.
{"title":"Recommending prime spots of a destination and time to visit from geo-tagged social data","authors":"V. Sharma, Kyumin Lee, Jin-Wook Chung","doi":"10.4108/ICST.COLLABORATECOM.2014.257674","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM.2014.257674","url":null,"abstract":"Planning a trip can be a tedious task. One has to search for what places to visit at a destination (i.e. area) and what time to visit the destination. Sometimes this can be a time-consuming task because there are too much information available, and it is hard for one to choose which information to trust. In this paper we present a recommendation system clustering geo-tagged social data in a destination from each information source - Flickr and Foursquare - and combining the results from these diverse information sources to recommend places to visit. Our experimental results show that our recommendation system automatically suggests prime spots in Yellowstone national park with 0.83 precision and 0.927 NDCG, and in Yosemite national park with 0.8 precision and 0.912 NDCG. In addition, visualizing temporal information of social data helps travelers to decide when to visit a destination.","PeriodicalId":432345,"journal":{"name":"10th IEEE International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128523034","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
扫码关注我们
求助内容：
应助结果提醒方式：