Results 1 - 10
of
13
A.,Issarny, V.: Yarta: A Middleware for Managing Mobile Social Ecosystems
- In: Advances in Grid and Pervasive Comp
, 2011
"... Abstract. With the increased prevalence of advanced mobile devices (the so-called “smart ” phones), interest has grown in mobile social ecosys-tems, where users not only access traditional Web-based social networks using their mobile devices, but are also able to use the context infor-mation provide ..."
Abstract
-
Cited by 12 (1 self)
- Add to MetaCart
(Show Context)
Abstract. With the increased prevalence of advanced mobile devices (the so-called “smart ” phones), interest has grown in mobile social ecosys-tems, where users not only access traditional Web-based social networks using their mobile devices, but are also able to use the context infor-mation provided by these devices to further enrich their interactions. In complex mobile social ecosystems of the future the heterogeneity of software platforms on constituent nodes, combined with their intrinsic distributed nature and heterogeneity of representation of data and con-text raises the need for middleware support for the development of mobile social applications. In this paper, we propose Yarta, a novel middleware designed for mobile social ecosystems (MSE), which takes into account the heterogeneity of both deployment nodes and available data, the intrinsic decentralized nature of mobile social applications, as well as users ’ privacy concerns. To validate our approach, we show how we developed two mobile social applications over Yarta, and report on both its efficiency and ease-of use by way of extensive evaluation on smart phones and laptops. 1
Analysis of fusing online and co-presence social networks
- in Pervasive Computing and Communications Workshops (PERCOM Workshops), 2011 IEEE International Conference on, Mar 2011
"... Abstract—This paper explores how online social networks and co-presence social networks complement each other to form global, fused social relations. We collected Bluetoothbased co-presence data from mobile phones and Facebook social data from a shared set of 104 students. For improved analysis accu ..."
Abstract
-
Cited by 8 (2 self)
- Add to MetaCart
(Show Context)
Abstract—This paper explores how online social networks and co-presence social networks complement each other to form global, fused social relations. We collected Bluetoothbased co-presence data from mobile phones and Facebook social data from a shared set of 104 students. For improved analysis accuracy, we created weighted social graphs based on meeting frequency and duration for co-presence data, and based on wall writing and photo tagging for Facebook data. By analyzing the overall structural properties, we show the two networks represent two different levels of social engagement which complement each other. By fusing them together, the average path length and network diameter is shortened, and consequently the social connectivity increases significantly. By quantifying the contribution of each social network to the fused network in terms of node degree, edge weight, and community overlap, we discovered that the co-presence network improves social connectivity, while the online network brings greater cohesiveness to social communities. Keywords-Social computing, social network analysis, copresence traces, smart phones.
Vulnerability in sociallyinformed peer-to-peer systems
- in 4th ACM Workshop on Social Network Systems
, 2011
"... All in-text references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately. ..."
Abstract
-
Cited by 7 (5 self)
- Add to MetaCart
(Show Context)
All in-text references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately.
Inferring peer centrality in socially-informed peer-to-peer systems
- in 11th IEEE Int. Conf. on Peer-to-Peer Computing
, 2011
"... Abstract—Social applications implemented on a peer-to-peer (P2P) architecture mine the social graph of their users for improved performance in search, recommendations, resource sharing and others. In such applications, the social graph that connects their users is distributed on the peer-to-peer sys ..."
Abstract
-
Cited by 6 (5 self)
- Add to MetaCart
(Show Context)
Abstract—Social applications implemented on a peer-to-peer (P2P) architecture mine the social graph of their users for improved performance in search, recommendations, resource sharing and others. In such applications, the social graph that connects their users is distributed on the peer-to-peer system: the traversal of the social graph translates to a socially-informed routing in the peer-to-peer layer. In this work we introduce the model of a projection graph that is the result of mapping a social graph onto a peer-to-peer network. We analytically formulate the relation between metrics in the social graph and in the projection graph. We focus on three such graph metrics: degree centrality, node betweenness central-ity, and edge betweenness centrality. We evaluate experimentally the feasibility of estimating these metrics in the projection graph from the metrics of the social graph. Our experiments on real networks show that when mapping communities of 50-150 users on a peer, there is an optimal organization of the projection graph with respect to degree and node betweenness centrality. In this range, the association between the properties of the social graph and the projection graph is the highest, and thus the properties of the (dynamic) projection graph can be inferred from the properties of the (slower changing) social graph. We discuss the applicability of our findings to aspects of peer-to-peer systems such as data dissemination, social search, peer vulnerability, and data placement and caching. I.
On the Design of Socially-Aware Distributed Systems
, 2012
"... Dedication To my beloved parents Panayiota and Ioannis Kourtellis for teaching me the importance of an education, and always motivating me to pursue my dreams. Acknowledgments I would like to thank Dr. Adriana Iamnitchi for being my major professor and academic advisor for the past six years. Her he ..."
Abstract
-
Cited by 5 (5 self)
- Add to MetaCart
Dedication To my beloved parents Panayiota and Ioannis Kourtellis for teaching me the importance of an education, and always motivating me to pursue my dreams. Acknowledgments I would like to thank Dr. Adriana Iamnitchi for being my major professor and academic advisor for the past six years. Her help and guidance inspired me to overcome any diffi-culties in my research, and her persistence motivated me throughout my doctoral studies.
Tie: Temporal interaction explorer for co-presence communities
- in: Dependable, Autonomic and Secure Computing (DASC), 2011 IEEE Ninth International Conference on
"... Abstract—The widespread adoption of smart phones allows for the seamless capture of social interactions on a scale that was once impossible. Co-presence, collected using Bluetooth on the phones, faithfully represents such real-world social interactions. This social information can be transformed int ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
(Show Context)
Abstract—The widespread adoption of smart phones allows for the seamless capture of social interactions on a scale that was once impossible. Co-presence, collected using Bluetooth on the phones, faithfully represents such real-world social interactions. This social information can be transformed into communities, which can be leveraged into applications such as recommender systems and collaborative tools. However, correctly identifying communities is difficult. This paper presents TIE, a visualization tool that enables effective review of detected communities. With TIE, we can visualize the social interaction of a set of people over time. Also, TIE can overlay detected community events in a usable way over the underlying social interactions. Further, it allows us to investigate specific social interaction events and see how well detected communities match those events. Lastly, it enables the comparison of different sets of detected communities by interactively switching between overlays. TIE has proven useful in evaluating our community detection algorithms and has been invaluable in identifying strengths and weaknesses of these algorithms. Beyond our needs, TIE is usable for other data sets that can be reduced to temporal interaction events such as multiplayer game communities, SMS interactions, and paper co-authorship. Keywords-visualization of co-presence communities; smart phones; time-series events I.
Measurement, Simulation
"... The recent increase in the volume of recorded social interactions has the potential to enable a large class of innovative social applications and services. The decentralized management of such social information as a social graph distributed on a user-contributed peer-to-peer network is appealing du ..."
Abstract
- Add to MetaCart
The recent increase in the volume of recorded social interactions has the potential to enable a large class of innovative social applications and services. The decentralized management of such social information as a social graph distributed on a user-contributed peer-to-peer network is appealing due to privacy concerns. This paper studies the vulnerability of such a peer-to-peer system to attacks staged by malicious users who try to manipulate the graph or by malicious peers who try to manipulate the mining of the social graph. We discuss the effects and limitations of such attacks and we show experimentally how the distribution of the social data onto peers affects the system’s resilience. CR-number [subcat-
1Leveraging Peer Centrality in the Design of Socially-Informed Peer-to-Peer Systems
"... Abstract—Social applications mine user social graphs to improve performance in search, provide recommendations, allow resource sharing and increase data privacy. When such applications are implemented on a peer-to-peer (P2P) architecture, the social graph is distributed on the P2P system: the traver ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract—Social applications mine user social graphs to improve performance in search, provide recommendations, allow resource sharing and increase data privacy. When such applications are implemented on a peer-to-peer (P2P) architecture, the social graph is distributed on the P2P system: the traversal of the social graph translates into a socially-informed routing in the peer-to-peer layer. In this work we introduce the model of a projection graph that is the result of decentralizing a social graph onto a peer-to-peer network. We focus on three social network metrics: degree, node betweenness and edge betweenness centrality and analytically formulate the relation between metrics in the social graph and in the projection graph. Through experimental evaluation on real networks, we demonstrate that when mapping user communities of sizes up to 50-150 users on each peer, the association between the properties of the social graph and the projection graph is high, and thus the properties of the (dynamic) projection graph can be inferred from the properties of the (slower changing) social graph. Furthermore, we demonstrate with two application scenarios on large-scale social networks the usability of the projection graph in designing social search applications and unstructured P2P overlays. F 1
1Enabling Social Applications via Decentralized Social Data Management
"... Abstract—Online social networks and user-generated content sharing applications produce an unprecedented amount of social information, which is further augmented by location or collocation data collected from mobile phones. This wealth of social information is currently fragmented across many differ ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract—Online social networks and user-generated content sharing applications produce an unprecedented amount of social information, which is further augmented by location or collocation data collected from mobile phones. This wealth of social information is currently fragmented across many different proprietary applications. Combined, it could provide a more accurate representation of the social world that can be leveraged to enable novel socially-aware applications. We present Prometheus, a peer-to-peer service that collects social information from multiple sources and exposes it through an interface that implements non-trivial social inferences. The social information is stored in a multigraph which is managed in a decentralized fashion on user-contributed nodes. The access to social data is controlled by user-defined policies. The system’s socially-aware design serves multiple purposes. First, it allows users to store and manage their social information via socially-trusted peers, thus improving service availability. Second, it exploits naturally-formed social groups for improved end-to-end social inference performance and reduced message overhead. Third, it reduces the opportunity of malicious peers to influence requests in the system, thus constituting a resilient solution to malicious attacks. We tested our prototype on PlanetLab under workloads from emulated applications. We also built a mobile social application to assess Prometheus ’ performance under real-time constraints and show that Prometheus ’ overhead is practical for real applications. Our experimental results show that a socially-aware distribution of social data onto Prometheus nodes leads to significant improvements in end-to-end response time, reduced communication overhead, and improved resilience to malicious attacks. Index Terms—social data management, decentralized social graph, P2P networks, social sensors, social inferences F 1
PLEASE SCROLL DOWN FOR ARTICLE
, 2014
"... Publication details, including instructions for authors and subscription information: ..."
Abstract
- Add to MetaCart
(Show Context)
Publication details, including instructions for authors and subscription information:
