2012 Proceeding- Program Chairs:
- Eiko Yoneki,
- Davide Frey,
- Ian Brown
- Sponsor:
- sigops
The Fifth Workshop on Social Network Systems (SNS'12) will gather researchers to discuss novel ideas about computer systems and social networks. Online social networks are among the most popular sites on the Web and continue to grow rapidly. They provide mechanisms to establish identities, share information, and create relationships. The resulting social graphs provide a basis for communicating, distributing and locating content. Broadly, the systems issues of social networks include:
• How can system infrastructures be improved for social networks? Infrastructure includes database systems, operating systems, file systems, and storage systems.
• How can the social graph be leveraged in computer system design? The social graph encodes trust and common interests. How and to what extent can this encoding be used to improve computer systems?
• How can social networks be modelled and characterized? What has been learned from the operation of existing systems?
Proceeding Downloads
Diverging towards the common good: heterogeneous self-organisation in decentralised recommenders
Decentralised social networks promise to deliver highly personalised, privacy-preserving, scalable and robust implementations of key social network features, such as search, query extensions, and recommendations. Such systems go beyond traditional ...
How much do your friends know about you?: reconstructing private information from the friendship graph
After the early land rush and fast exponential growth of online social networking platforms, concerns about how data placed in online social networks may be exploited and abused have begun to appear among mainstream users. Social networking sites have ...
In-time estimation for influence maximization in large-scale social networks
Influence Maximization aims to find the top-K influential individuals to maximize the influence spread within a social network, which remains an important yet challenging problem. Most of the existing studies focus on greedy algorithms and mainly suffer ...
On the impact of users availability in OSNs
Availability of computing resources has been extensively studied in literature with respect to uptime, session lengths and inter-arrival times of hardware devices or software applications. Interestingly enough, information related to the presence of ...
On leveraging social relationships for decentralized privacy-preserving group communication
Millions of people use the Internet today for data exchange of sensitive information. A typical exchange usually occurs within the context of a group of users and often takes place in a centrally managed infrastructure such as Facebook. Evidence has ...
Privacy preserving picture sharing: enforcing usage control in distributed on-line social networks
The problem of usage control, which refers to the control of the data after its publication, is becoming a very challenging problem due to the exponential growth of the number of users involved in content sharing. While the best solution and ...
Shepherding social feed generation with Sheep
Social feeds are used in many popular Web applications. They let users produce events, as well as read feeds containing the events generated by their friends. This paper investigates the design of an in-memory platform to manage social feeds. We show ...
Social piggybacking: leveraging common friends to generate event streams
Social networking systems present users with online event streams that include recent activities of their friends. Materialized per-user views are a common way to generate such event streams on-line and with low latency. We propose improving throughput ...
Towards modeling legitimate and unsolicited email traffic using social network properties
Identifying unsolicited email based on their network-level behavior rather than their content have received huge interest. In this study, we investigate the social network properties of large-scale email networks generated from real email traffic to ...
Towards robust and scalable peer-to-peer social networks
Peer-to-peer Online Social Networks (OSNs) promise to combine the functionalities of centralized OSNs with the good properties of peer-to-peer systems. However, in time, the number of connections between users of OSNs grows super-linearly in the number ...
Who drive people to forward information: publisher or spreader?
The explosive growth in online social networks makes them major platforms of information diffusion. People receive large-scale information from friends, but hardly find what they really want. Understanding influential factors of forwarding behavior can ...
Discovering leaders from social network by action cascade
This paper proposes an approach to discovering community leaders in social network by means of a probabilistic time-based graph propagation model. To conduct the approach, we define an exponential decay function for influence as a function of time, and ...
Faceless: decentralized anonymous group messaging for online social networks
Social networks (SNs) enable physically distributed groups to communicate seamlessly. Unfortunately such communication can be easily mined by adversaries in attempts to breach users' privacy or suppress open discussion on sensitive topics. While ...
Offline social networks: stepping away from the internet
Online Social Networks (OSN) have been revolutionary in the way people interact over the Internet today. Typically in online social networks the information is ephemeral while the relationships between users are sustainable. Yet, this might not always ...
Population protocols on real social networks
In this paper we present an experimental analysis to assess the performance of Population Protocols, a well-known fully decentralized computational model, on a real, evolving social network.