scispace - formally typeset
Search or ask a question
Author

Jon Crowcroft

Bio: Jon Crowcroft is an academic researcher from University of Cambridge. The author has contributed to research in topics: The Internet & Multicast. The author has an hindex of 87, co-authored 672 publications receiving 38848 citations. Previous affiliations of Jon Crowcroft include Memorial University of Newfoundland & Information Technology University.


Papers
More filters
Proceedings ArticleDOI
13 May 2013
TL;DR: There is concrete evidence for a tendency that users predominantly share like-minded news articles and avoid conflicting ones, and partisans are more likely to do that in social media.
Abstract: The hypothesis of selective exposure assumes that people crave like-minded information and eschew information that conflicts with their beliefs, and that has negative consequences on political life. Yet, despite decades of research, this hypothesis remains theoretically promising but empirically difficult to test. We look into news articles shared on Facebook and examine whether selective exposure exists or not in social media. We find a concrete evidence for a tendency that users predominantly share like-minded news articles and avoid conflicting ones, and partisans are more likely to do that. Building tools to counter partisanship on social media would require the ability to identify partisan users first. We will show that those users cannot be distinguished from the average user as the two subgroups do not show any demographic difference.

49 citations

Proceedings ArticleDOI
22 Jun 2012
TL;DR: Upon analyzing 34,012 Facebook relationships, it is found that, on average, a relationship is more likely to break if it is not embedded in the same social circle,if it is between two people whose ages differ, and if one of the two is neurotic or introvert.
Abstract: Recent analyses of self-reported data (mainly survey data) seem to suggest that social rules for ending relationships are transformed on Facebook. There seem to be a radical difference between offline and online worlds: reasons for ending online relationships are different than those for ending offline ones. These preliminary findings are, however, not supported by any quantitative evidence, and that is why we put them to test. We consider a variety of factors (e.g., age, gender, personality traits) that studies in sociology have found to be associated with friendship dissolution in the real world and study whether these factors are still important in the context of Facebook. Upon analyzing 34,012 Facebook relationships, we found that, on average, a relationship is more likely to break if it is not embedded in the same social circle, if it is between two people whose ages differ, and if one of the two is neurotic or introvert. Interestingly, we also found that a relationship with a common female friend is more robust than that with a common male friend. These findings are in line with previous analyses of another popular social-networking platform, that of Twitter. All this goes to suggest that there is not much difference between offline and online worlds and, given this predictability, one could easily build tools for monitoring online relations.

49 citations

Proceedings Article
26 May 2006
TL;DR: The response to the Call for Papers has shown that the REALMAN community is steadily increasing both in number and in quality, and shows that, following the success of the first edition, REALMAN is establishing as a premiere forum for presenting and discussing measurement studies and experiences based on real ad hoc network test-beds and prototypes.
Abstract: Welcome to the second edition of the Workshop on Multi-hop Ad hoc Networks: from Theory to Reality, REALMAN 2006 This year the workshop is co-located with ACM MobiHoc 2006 and is sponsored by ACM SIGMOBILEAd hoc networking technologies have big potentialities for innovative applications of great impact on our everyday life To exploit these potentialities, simulation modeling and theoretical analyses have to be complemented by real experiences (eg, measurements on real prototypes), which provide both a direct evaluation of ad hoc networks and, at the same time, precious information to realistically model these systemsIn the last few years, researchers have increasingly regarded experimental studies as a key approach to understand the very features of multi-hop ad hoc networks, and eventually enable the adoption of this technology in the mass market This stimulated a new community of researchers combining theoretical research on ad hoc networking with experiences/measurements obtained by implementing ad hoc network prototypes The aim of REALMAN is to bring together these researchersThe response to the Call for Papers has shown that the REALMAN community is steadily increasing both in number and in quality In response to the Call for Papers, we received 68 papers, addressing topics related to all fields of multi-hop ad hoc networking Out of them, the Program Committee selected 12 papers for presentation in the workshop sessions In addition, 3 papers have been selected for presentation in the poster session In response to a separate Call for Demos, we received several interesting demo proposals We have selected 10 proposals out of them to be demonstrated during the workshop Finally, the REALMAN Program also includes a Keynote Speech given by Prof Nitin H Vaidya of the University of Illinois at Urbana-Champaign, and a panel These figures show that, following the success of the first edition, REALMAN is establishing as a premiere forum for presenting and discussing measurement studies and experiences based on real ad hoc network test-beds and prototypes

48 citations

Book ChapterDOI
TL;DR: This paper defines the Application Layer Routing problem and shows that, in contrast to IP, it is a multimetric problem, and proposes an architecture that helps conceptualise the problem and build solutions.
Abstract: We have previously proposed, implemented and demonstrated an Application Layer Active Network (ALAN) infrastructure. This infrastructure permits the dynamic deployment of active services in the network, but at the application level rather than the router level. Thus the advantages of active networking are realised, without the disadvantages of router level implementation. However we have previously left unsolved the issue of appropriate placement of ALAN supported services. This is an Application Layer Routing problem. In this paper we define this problem and show that, in contrast to IP, it is a multimetric problem. We then propose an architecture that helps conceptualise the problem and build solutions. We propose detailed approaches to the active node discovery and state maintenance aspects of Application Layer Routing (ALR).

47 citations

Journal ArticleDOI
01 Jan 2017
TL;DR: In this article, the authors review the research challenges in building personal Databoxes that hold personal data and enable data access by other parties and potentially thus sharing of data with other parties.
Abstract: The Internet of Things is expected to generate large amounts of heterogeneous data from diverse sources including physical sensors, user devices and social media platforms. Over the last few years, significant attention has been focused on personal data, particularly data generated by smart wearable and smart home devices. Making personal data available for access and trade is expected to become a part of the data-driven digital economy. In this position paper, we review the research challenges in building personal Databoxes that hold personal data and enable data access by other parties and potentially thus sharing of data with other parties. These Databoxes are expected to become a core part of future data marketplaces. Copyright © 2016 The Authors Transactions on Emerging Telecommunications Technologies Published by John Wiley & Sons, Ltd.

47 citations


Cited by
More filters
Journal ArticleDOI

[...]

08 Dec 2001-BMJ
TL;DR: There is, I think, something ethereal about i —the square root of minus one, which seems an odd beast at that time—an intruder hovering on the edge of reality.
Abstract: There is, I think, something ethereal about i —the square root of minus one. I remember first hearing about it at school. It seemed an odd beast at that time—an intruder hovering on the edge of reality. Usually familiarity dulls this sense of the bizarre, but in the case of i it was the reverse: over the years the sense of its surreal nature intensified. It seemed that it was impossible to write mathematics that described the real world in …

33,785 citations

Journal ArticleDOI
TL;DR: In this paper, Imagined communities: Reflections on the origin and spread of nationalism are discussed. And the history of European ideas: Vol. 21, No. 5, pp. 721-722.

13,842 citations

Journal ArticleDOI
TL;DR: A thorough exposition of community structure, or clustering, is attempted, from the definition of the main elements of the problem, to the presentation of most methods developed, with a special focus on techniques designed by statistical physicists.
Abstract: The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices of the same cluster and comparatively few edges joining vertices of different clusters. Such clusters, or communities, can be considered as fairly independent compartments of a graph, playing a similar role like, e. g., the tissues or the organs in the human body. Detecting communities is of great importance in sociology, biology and computer science, disciplines where systems are often represented as graphs. This problem is very hard and not yet satisfactorily solved, despite the huge effort of a large interdisciplinary community of scientists working on it over the past few years. We will attempt a thorough exposition of the topic, from the definition of the main elements of the problem, to the presentation of most methods developed, with a special focus on techniques designed by statistical physicists, from the discussion of crucial issues like the significance of clustering and how methods should be tested and compared against each other, to the description of applications to real networks.

9,057 citations

Journal ArticleDOI
TL;DR: A thorough exposition of the main elements of the clustering problem can be found in this paper, with a special focus on techniques designed by statistical physicists, from the discussion of crucial issues like the significance of clustering and how methods should be tested and compared against each other, to the description of applications to real networks.

8,432 citations