Pub Date : 2012-07-09DOI: 10.1504/IJSCCPS.2012.047699
F. Rahman, Md. Endadul Hoque, F. Kawsar, Sheikh Iqbal Ahamed
Privacy is the most often-cited criticism of context awareness in pervasive environment, and may be the utmost barrier to its enduring success. However, privacy implications associated with pervasive online community-based applications depend on the level of identifiability of the information provided, its possible recipients, and its possible uses. Unfortunately, conventional privacy preservation techniques are not suitable for these types of application. This paper describes our current work in developing a novel privacy sensitive architecture for context obfuscation (PCO) for privacy preservation in pervasive online community-based applications. More specifically, PCO preserves users’ privacy by generalising request parameters as well as the context data provided to the application. To support multiple levels of granularity for the released context data, the obfuscation procedure uses an ontological description that states the granularity of object type instances. We have developed and evaluated a contextual instant messaging application (PCO application) in Android platform that incorporates level-based privacy of the user’s contextual information. We also evaluate our prototype application through user evaluation survey. The PCO architecture can be extended to be used in diverse online community-based applications.
{"title":"User privacy protection in pervasive social networking applications using PCO","authors":"F. Rahman, Md. Endadul Hoque, F. Kawsar, Sheikh Iqbal Ahamed","doi":"10.1504/IJSCCPS.2012.047699","DOIUrl":"https://doi.org/10.1504/IJSCCPS.2012.047699","url":null,"abstract":"Privacy is the most often-cited criticism of context awareness in pervasive environment, and may be the utmost barrier to its enduring success. However, privacy implications associated with pervasive online community-based applications depend on the level of identifiability of the information provided, its possible recipients, and its possible uses. Unfortunately, conventional privacy preservation techniques are not suitable for these types of application. This paper describes our current work in developing a novel privacy sensitive architecture for context obfuscation (PCO) for privacy preservation in pervasive online community-based applications. More specifically, PCO preserves users’ privacy by generalising request parameters as well as the context data provided to the application. To support multiple levels of granularity for the released context data, the obfuscation procedure uses an ontological description that states the granularity of object type instances. We have developed and evaluated a contextual instant messaging application (PCO application) in Android platform that incorporates level-based privacy of the user’s contextual information. We also evaluate our prototype application through user evaluation survey. The PCO architecture can be extended to be used in diverse online community-based applications.","PeriodicalId":220482,"journal":{"name":"Int. J. Soc. Comput. Cyber Phys. Syst.","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128592562","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 : 2012-07-09DOI: 10.1504/IJSCCPS.2012.047698
Aaron Beach, Mike Gartrell, Richard O. Han
This paper discusses why many of the common assumptions made in anonymity research cannot be applied to social network data. In particular, the concepts of ‘public’ and ‘private’ cannot be used to neatly distinguish certain types of social network data from others. It is proposed that social network data should be assumed public and treated private. An alternative anonymity model, q-Anon, is presented, which reconciles the paradox of social network data’s public/private nature. Finally, the feasibility of such an approach is evaluated suggesting that a social network site such as Facebook could practically implement an anonymous API using q-Anon. The paper concludes with a practical discussion of how q-Anon may affect different types of applications.
{"title":"q-Anon: practical anonymity for social networks","authors":"Aaron Beach, Mike Gartrell, Richard O. Han","doi":"10.1504/IJSCCPS.2012.047698","DOIUrl":"https://doi.org/10.1504/IJSCCPS.2012.047698","url":null,"abstract":"This paper discusses why many of the common assumptions made in anonymity research cannot be applied to social network data. In particular, the concepts of ‘public’ and ‘private’ cannot be used to neatly distinguish certain types of social network data from others. It is proposed that social network data should be assumed public and treated private. An alternative anonymity model, q-Anon, is presented, which reconciles the paradox of social network data’s public/private nature. Finally, the feasibility of such an approach is evaluated suggesting that a social network site such as Facebook could practically implement an anonymous API using q-Anon. The paper concludes with a practical discussion of how q-Anon may affect different types of applications.","PeriodicalId":220482,"journal":{"name":"Int. J. Soc. Comput. Cyber Phys. Syst.","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124589813","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 : 2012-07-09DOI: 10.1504/IJSCCPS.2012.047700
Miao Jiang, William L. McGill, Yan Cao
This paper introduces the concept of participatory risk management (PRM), the outsourcing of parts of the risk management process to a wide audience of participants, whether from communities affected by risk or netizens willing to lend a helping (analytic) hand. PRM consists of six parts that closely follows the ISO31000 risk management framework: tasking and requirements, participatory risk identification, participatory risk analysis, participatory risk evaluation, participatory risk mitigation and communication. Each phase leverages one or more modern crowdsourcing concepts, such as participatory sensing, human computation, and games with a purpose. A potential PRM gaming system for incentivising community risk management through rewarding play is presented as an example application of PRM.
{"title":"Participatory risk management: concept and illustration","authors":"Miao Jiang, William L. McGill, Yan Cao","doi":"10.1504/IJSCCPS.2012.047700","DOIUrl":"https://doi.org/10.1504/IJSCCPS.2012.047700","url":null,"abstract":"This paper introduces the concept of participatory risk management (PRM), the outsourcing of parts of the risk management process to a wide audience of participants, whether from communities affected by risk or netizens willing to lend a helping (analytic) hand. PRM consists of six parts that closely follows the ISO31000 risk management framework: tasking and requirements, participatory risk identification, participatory risk analysis, participatory risk evaluation, participatory risk mitigation and communication. Each phase leverages one or more modern crowdsourcing concepts, such as participatory sensing, human computation, and games with a purpose. A potential PRM gaming system for incentivising community risk management through rewarding play is presented as an example application of PRM.","PeriodicalId":220482,"journal":{"name":"Int. J. Soc. Comput. Cyber Phys. Syst.","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133547515","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 : 2012-07-09DOI: 10.1504/IJSCCPS.2012.047701
W. Bamberger, Josef Schlittenlacher, K. Diepold
Future vehicles will exchange much information through a wireless network in order to efficiently maintain their inner model of the environment. Before they can believe received pieces of information, they must evaluate their reliability. Trust is a mechanism to estimate this reliability based on the sender. It depends on friendship-like relations between vehicles, the social structure. Our traffic and network simulation shows that such relations indeed arise, because vehicles often drive the same route. Within this simulation, all vehicles are equipped with the proposed trust model, which continuously monitors the experiences made with others. The model focuses on these direct experiences of the individual and does not depend on a central reputation unit. It continuously evaluates the performance and reputation of other vehicles and includes a feedback loop to faster adapt to changes in the other’s behaviour. Since the performance of a vehicle depends on the abilities of its sensors, like different abilities in velocity measurement or in traffic sign detection, the proposed model develops trust depending on the sender and on the type of the information.
{"title":"Ability-aware trust for vehicular networks","authors":"W. Bamberger, Josef Schlittenlacher, K. Diepold","doi":"10.1504/IJSCCPS.2012.047701","DOIUrl":"https://doi.org/10.1504/IJSCCPS.2012.047701","url":null,"abstract":"Future vehicles will exchange much information through a wireless network in order to efficiently maintain their inner model of the environment. Before they can believe received pieces of information, they must evaluate their reliability. Trust is a mechanism to estimate this reliability based on the sender. It depends on friendship-like relations between vehicles, the social structure. Our traffic and network simulation shows that such relations indeed arise, because vehicles often drive the same route. Within this simulation, all vehicles are equipped with the proposed trust model, which continuously monitors the experiences made with others. The model focuses on these direct experiences of the individual and does not depend on a central reputation unit. It continuously evaluates the performance and reputation of other vehicles and includes a feedback loop to faster adapt to changes in the other’s behaviour. Since the performance of a vehicle depends on the abilities of its sensors, like different abilities in velocity measurement or in traffic sign detection, the proposed model develops trust depending on the sender and on the type of the information.","PeriodicalId":220482,"journal":{"name":"Int. J. Soc. Comput. Cyber Phys. Syst.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122422155","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}
In this work, we study semantic-level precedence relationships between participants in a blog network. Our methodology has two steps: a process to identify units of discussion at the semantic level and a probabilistic framework to estimate temporal relationships between blogs, in terms of the order in which they arrive at those units of discussion. We propose dyadic precursor scores that can be used to construct semantic-level precedence networks. From these scores, we derive global precursor and laggard scores. Dyadic precursor scores are compared with URL linking to show that the semantic-level temporal relationships we estimate are an indicator of influence. Global scores are compared to traditional link degree and PageRank metrics, and we uncover relationships between semantic-level temporal behaviour and popularity. We show that our method reveals information about the network that could not be obtained from structural links alone.
{"title":"Finding the semantic-level precursors on a blog network","authors":"Telmo Menezes, Camille Roth, Jean-Philippe Cointet","doi":"10.1504/IJSCCPS.2011.044170","DOIUrl":"https://doi.org/10.1504/IJSCCPS.2011.044170","url":null,"abstract":"In this work, we study semantic-level precedence relationships between participants in a blog network. Our methodology has two steps: a process to identify units of discussion at the semantic level and a probabilistic framework to estimate temporal relationships between blogs, in terms of the order in which they arrive at those units of discussion. We propose dyadic precursor scores that can be used to construct semantic-level precedence networks. From these scores, we derive global precursor and laggard scores. Dyadic precursor scores are compared with URL linking to show that the semantic-level temporal relationships we estimate are an indicator of influence. Global scores are compared to traditional link degree and PageRank metrics, and we uncover relationships between semantic-level temporal behaviour and popularity. We show that our method reveals information about the network that could not be obtained from structural links alone.","PeriodicalId":220482,"journal":{"name":"Int. J. Soc. Comput. Cyber Phys. Syst.","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115323068","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 : 2011-12-12DOI: 10.1504/IJSCCPS.2011.044174
Georg Groh, Alexander Lehmann
We discuss how time-independent and time-dependent features of human social interaction geometry on small temporal and spatial scales may be used to extract evidence for or against the existence of social situations as a simple form of social context. Aside from providing a new method for quantitative investigation of human interaction behaviour, the ultimate vision motivating this research focuses on mobile devices autonomously measuring and processing data on interaction geometries in order to derive social situation context that can be used in mobile social networking scenarios. Our method is tested via an experiment using an IR tracking method already allowing for the precise determination of interpersonal distances and relative body orientation in a conversational setting. We investigate the performance of time-independent classifiers for the prediction of the involvement of pairs of persons in a social situation using relative distance and orientation. We then discuss results of using HMMs for exploiting the time-dependency of the interaction geometry.
{"title":"Deducing evidence for social situations from dynamic geometric interaction data","authors":"Georg Groh, Alexander Lehmann","doi":"10.1504/IJSCCPS.2011.044174","DOIUrl":"https://doi.org/10.1504/IJSCCPS.2011.044174","url":null,"abstract":"We discuss how time-independent and time-dependent features of human social interaction geometry on small temporal and spatial scales may be used to extract evidence for or against the existence of social situations as a simple form of social context. Aside from providing a new method for quantitative investigation of human interaction behaviour, the ultimate vision motivating this research focuses on mobile devices autonomously measuring and processing data on interaction geometries in order to derive social situation context that can be used in mobile social networking scenarios. Our method is tested via an experiment using an IR tracking method already allowing for the precise determination of interpersonal distances and relative body orientation in a conversational setting. We investigate the performance of time-independent classifiers for the prediction of the involvement of pairs of persons in a social situation using relative distance and orientation. We then discuss results of using HMMs for exploiting the time-dependency of the interaction geometry.","PeriodicalId":220482,"journal":{"name":"Int. J. Soc. Comput. Cyber Phys. Syst.","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115107292","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 : 2011-12-12DOI: 10.1504/IJSCCPS.2011.044171
Stephen Kelley, M. Goldberg, Konstantin Mertsalov, M. Magdon-Ismail, W. Wallace
Traditionally, methods to identify community structure in networks have focused on partitioning the vertex set into a number of disjoint groups. However, recently proposed methods have included mechanisms to account for possible overlap between communities. These approaches have taken a wide variety of forms, resulting in a lack of consensus as to what characteristics overlapping communities should have. Additionally, the application of algorithms which account for community overlap are often justified via intuitive rather than empirical arguments. In this text, each of the issues mentioned above is examined. From previous literature, a minimal set of axioms which overlapping communities should satisfy is presented. Additionally, a modification of a previously published algorithm, iterative scan, is introduced to ensure that these properties are met. Finally, the overlap between communities discovered in a large, real world communication network is examined. The analysis offers empirical justification tha...
{"title":"Overlapping communities in social networks","authors":"Stephen Kelley, M. Goldberg, Konstantin Mertsalov, M. Magdon-Ismail, W. Wallace","doi":"10.1504/IJSCCPS.2011.044171","DOIUrl":"https://doi.org/10.1504/IJSCCPS.2011.044171","url":null,"abstract":"Traditionally, methods to identify community structure in networks have focused on partitioning the vertex set into a number of disjoint groups. However, recently proposed methods have included mechanisms to account for possible overlap between communities. These approaches have taken a wide variety of forms, resulting in a lack of consensus as to what characteristics overlapping communities should have. Additionally, the application of algorithms which account for community overlap are often justified via intuitive rather than empirical arguments. In this text, each of the issues mentioned above is examined. From previous literature, a minimal set of axioms which overlapping communities should satisfy is presented. Additionally, a modification of a previously published algorithm, iterative scan, is introduced to ensure that these properties are met. Finally, the overlap between communities discovered in a large, real world communication network is examined. The analysis offers empirical justification tha...","PeriodicalId":220482,"journal":{"name":"Int. J. Soc. Comput. Cyber Phys. Syst.","volume":"148 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132383051","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 : 2011-11-11DOI: 10.1504/IJSCCPS.2011.043602
Baojun Qiu, K. Ivanova, J. Yen, Peng Liu, F. Ritter
In many social networks, the connections between actors are formed because they participate in the same event, such as a set of scholars co-authoring a paper or colleagues having a teleconference. Therefore, we propose an event-driven model to capture the growth dynamics of social networks through modelling of the social events. We also investigate the evolution of event formation and the joint effect of attachedness and locality on the selection of participants for events in real social networks. We incorporate the evolution of event formation and the joint effect of attachedness and locality into our model. The experimental results suggest that our approach can simulate important network structures, such as hierarchical communities and assortativity, and better characterise the growing process of real networks than non-event driven models.
{"title":"Event-driven modelling of evolving social networks","authors":"Baojun Qiu, K. Ivanova, J. Yen, Peng Liu, F. Ritter","doi":"10.1504/IJSCCPS.2011.043602","DOIUrl":"https://doi.org/10.1504/IJSCCPS.2011.043602","url":null,"abstract":"In many social networks, the connections between actors are formed because they participate in the same event, such as a set of scholars co-authoring a paper or colleagues having a teleconference. Therefore, we propose an event-driven model to capture the growth dynamics of social networks through modelling of the social events. We also investigate the evolution of event formation and the joint effect of attachedness and locality on the selection of participants for events in real social networks. We incorporate the evolution of event formation and the joint effect of attachedness and locality into our model. The experimental results suggest that our approach can simulate important network structures, such as hierarchical communities and assortativity, and better characterise the growing process of real networks than non-event driven models.","PeriodicalId":220482,"journal":{"name":"Int. J. Soc. Comput. Cyber Phys. Syst.","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127038406","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 : 2011-11-11DOI: 10.1504/IJSCCPS.2011.043605
Owen Macindoe, W. Richards
We introduce a novel technique for characterising networks using the structure of their sub-graphs, which we call the network’s fine structure. To judge the similarities between networks we use the earth mover’s distance between the distributions of features of their constituent sub-graphs. This technique is an abstraction of graph edit-distance. Given these similarity measures we explore their use in hierarchical clustering on several networks derived from a variety of sources including social interaction data.
{"title":"Comparing networks using their fine structure","authors":"Owen Macindoe, W. Richards","doi":"10.1504/IJSCCPS.2011.043605","DOIUrl":"https://doi.org/10.1504/IJSCCPS.2011.043605","url":null,"abstract":"We introduce a novel technique for characterising networks using the structure of their sub-graphs, which we call the network’s fine structure. To judge the similarities between networks we use the earth mover’s distance between the distributions of features of their constituent sub-graphs. This technique is an abstraction of graph edit-distance. Given these similarity measures we explore their use in hierarchical clustering on several networks derived from a variety of sources including social interaction data.","PeriodicalId":220482,"journal":{"name":"Int. J. Soc. Comput. Cyber Phys. Syst.","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123428505","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 : 2011-11-11DOI: 10.1504/IJSCCPS.2011.043606
Juuso Karikoski, Matti Nelimarkka
Because people have different levels of engagement with each other, measuring social relations is difficult. In this work, we propose a method of measuring social relations with multiple datasets and demonstrate the differences with empirical evidence. Our empirical findings demonstrate that people use different communication media channels differently. Therefore, we suggest that in order to understand social structures, one should use several kinds of data sources and not just depend on a single dataset. Our datasets include mobile phone data gathered with handset-based measurements and data from OtaSizzle online social media services. By means of social network analysis, we show that the online social media services have a different friendship network than the networks based on mobile phone communication. The mobile phone communication networks, however, have a very similar structure. These results are encouraging as previous research also indicates differences in the communication networks.
{"title":"Measuring social relations with multiple datasets","authors":"Juuso Karikoski, Matti Nelimarkka","doi":"10.1504/IJSCCPS.2011.043606","DOIUrl":"https://doi.org/10.1504/IJSCCPS.2011.043606","url":null,"abstract":"Because people have different levels of engagement with each other, measuring social relations is difficult. In this work, we propose a method of measuring social relations with multiple datasets and demonstrate the differences with empirical evidence. Our empirical findings demonstrate that people use different communication media channels differently. Therefore, we suggest that in order to understand social structures, one should use several kinds of data sources and not just depend on a single dataset. Our datasets include mobile phone data gathered with handset-based measurements and data from OtaSizzle online social media services. By means of social network analysis, we show that the online social media services have a different friendship network than the networks based on mobile phone communication. The mobile phone communication networks, however, have a very similar structure. These results are encouraging as previous research also indicates differences in the communication networks.","PeriodicalId":220482,"journal":{"name":"Int. J. Soc. Comput. Cyber Phys. Syst.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132133321","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
扫码关注我们
求助内容：
应助结果提醒方式：