Licia Capra
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Licia Capra has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Cecilia Mascolo
Department of Computer Science and Technology, University of Cambridge, Cambridge, United Kingdom
2 shared publications - Sonia Ben Mokhtar
CNRS, INSA Lyon - LIRIS, Villeurbanne, France
2 shared publications - Abdulhameed Alelaiwi
College of Computer and Information Sciences, King Saud University, Riyadh, Saudi Arabia
1 shared publication Afra J. Mashhadi
UCL, Dept Comp Sci, Gower St, London WC1E 6BT, England
1 shared publication- Aitor Urbieta
Ikerlan Technology Research Centre
1 shared publication - Alejandra Gonzalez-Beltran
Oxford e-Research Centre, Department of Engineering Science, University of Oxford, Oxford, UK
1 shared publication
Latest Publications
- 22 July 2015
- Published by Springer Nature in Cluster Computing
- Vol. 18 (3) , 1171-1188
Hybrid service matchmaking in ambient assisted living environments based on context-aware service modeling
- 22 July 2015
- Published by Springer Nature in Cluster Computing
- Vol. 18 (3) , 1171-1188
Hybrid service matchmaking in ambient assisted living environments based on context-aware service modeling
- 1 November 2012
- Published by Elsevier in Ad Hoc Networks
- Vol. 10 (8) , 1633-1645
Fair content dissemination in participatory DTNs
- 1 November 2012
- Published by Elsevier in Ad Hoc Networks
- Vol. 10 (8) , 1633-1645
Fair content dissemination in participatory DTNs
- Open Access
Effective Retrieval of Resources in Folksonomies Using a New Tag Similarity Measure
Social (or folksonomic) tagging has become a very popular way to describe content within Web 2.0 websites. However, as tags are informally defined, continually changing, and ungoverned, it has often been criticised for lowering, rather than increasing, the efficiency of searching. To address this issue, a variety of approaches have been proposed that recommend users what tags to use, both when labeling and when looking for resources. These techniques work well in dense folksonomies, but they fail to do so when tag usage exhibits a power law distribution, as it often happens in real-life folksonomies. To tackle this issue, we propose an approach that induces the creation of a dense folksonomy, in a fully automatic and transparent way: when users label resources, an innovative tag similarity metric is deployed, so to enrich the chosen tag set with related tags already present in the folksonomy. The proposed metric, which represents the core of our approach, is based on the mutual reinforcement principle. Our experimental evaluation proves that the accuracy and coverage of searches guaranteed by our metric are higher than those achieved by applying classical metrics.
Open AccessEffective Retrieval of Resources in Folksonomies Using a New Tag Similarity Measure
Social (or folksonomic) tagging has become a very popular way to describe content within Web 2.0 websites. However, as tags are informally defined, continually changing, and ungoverned, it has often been criticised for lowering, rather than increasing, the efficiency of searching. To address this issue, a variety of approaches have been proposed that recommend users what tags to use, both when labeling and when looking for resources. These techniques work well in dense folksonomies, but they fail to do so when tag usage exhibits a power law distribution, as it often happens in real-life folksonomies. To tackle this issue, we propose an approach that induces the creation of a dense folksonomy, in a fully automatic and transparent way: when users label resources, an innovative tag similarity metric is deployed, so to enrich the chosen tag set with related tags already present in the folksonomy. The proposed metric, which represents the core of our approach, is based on the mutual reinforcement principle. Our experimental evaluation proves that the accuracy and coverage of searches guaranteed by our metric are higher than those achieved by applying classical metrics.
- Open Access
- 23 November 2011
- Published by Sociedade Brasileira de Computação in Journal of Internet Services and Applications
- Vol. 3 (1) , 117-125
Middleware for social computing: a roadmap
Social computing broadly refers to supporting social behaviours using computational systems. In the last decade, the advent of Web 2.0 and its social networking services, wikis, blogs, and social bookmarking has revolutionised social computing, creating new online contexts within which people interact socially (socialnetworking). With the pervasiveness of mobile devices and embedded sensors, we stand at the brink of another major revolution, where the boundary between online and offline social behaviours blurs, providing opportunities for (re)defining social conventions and contexts once again. But opportunities come with challenges: can middleware foster the engineering of social software? We identify threesocietalgrand challenges that are likely to drive future research in social computing and elaborate on how the middleware community can help address them.
- 23 November 2011
- Published by Sociedade Brasileira de Computação in Journal of Internet Services and Applications
- Vol. 3 (1) , 117-125
Open AccessMiddleware for social computing: a roadmap
Social computing broadly refers to supporting social behaviours using computational systems. In the last decade, the advent of Web 2.0 and its social networking services, wikis, blogs, and social bookmarking has revolutionised social computing, creating new online contexts within which people interact socially (socialnetworking). With the pervasiveness of mobile devices and embedded sensors, we stand at the brink of another major revolution, where the boundary between online and offline social behaviours blurs, providing opportunities for (re)defining social conventions and contexts once again. But opportunities come with challenges: can middleware foster the engineering of social software? We identify threesocietalgrand challenges that are likely to drive future research in social computing and elaborate on how the middleware community can help address them.
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-9
TRULLO - local trust bootstrapping for ubiquitous devices
Handheld devices have become sufficiently powerful that it is easy to create, disseminate, and access digital content (e.g., photos, videos) using them. The volume of such content is growing rapidly and, from the perspective of each user, selecting relevant content is key. To this end, each user may run a trust model - a software agent that keeps track of who disseminates content that its user finds relevant. This agent does so by assigning an initial trust value to each producer for a specific category (context); then, whenever it receives new content, the agent rates the content and accordingly updates its trust value for the producer in the content category. However, a problem with such an approach is that, as the number of content categories increases, so does the number of trust values to be initially set. This paper focuses on how to effectively set initial trust values. The most sophisticated of the current solutions employ predefined context ontologies, using which initial trust in a given context is set based on that already held in similar contexts. However, universally accepted (and time invariant) ontologies are rarely found in practice. For this reason, we propose a mechanism called TRULLO (trust bootstrapping by latently lifting context) that assigns initial trust values based only on local information (on the ratings of its user's past experiences) and that, as such, does not rely on third-party recommendations. We evaluate the effectiveness of TRULLO by simulating its use in an informal antique market setting. We also evaluate the computational cost of a J2ME implementation of TRULLO on a mobile phone.
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-9
TRULLO - local trust bootstrapping for ubiquitous devices
Handheld devices have become sufficiently powerful that it is easy to create, disseminate, and access digital content (e.g., photos, videos) using them. The volume of such content is growing rapidly and, from the perspective of each user, selecting relevant content is key. To this end, each user may run a trust model - a software agent that keeps track of who disseminates content that its user finds relevant. This agent does so by assigning an initial trust value to each producer for a specific category (context); then, whenever it receives new content, the agent rates the content and accordingly updates its trust value for the producer in the content category. However, a problem with such an approach is that, as the number of content categories increases, so does the number of trust values to be initially set. This paper focuses on how to effectively set initial trust values. The most sophisticated of the current solutions employ predefined context ontologies, using which initial trust in a given context is set based on that already held in similar contexts. However, universally accepted (and time invariant) ontologies are rarely found in practice. For this reason, we propose a mechanism called TRULLO (trust bootstrapping by latently lifting context) that assigns initial trust values based only on local information (on the ratings of its user's past experiences) and that, as such, does not rely on third-party recommendations. We evaluate the effectiveness of TRULLO by simulating its use in an informal antique market setting. We also evaluate the computational cost of a J2ME implementation of TRULLO on a mobile phone.
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
Content Source Selection in Bluetooth Networks
Large scale market penetration of electronic devices equipped with Bluetooth technology now gives the ability to share content (such as music or video clips) between members of the public in a decentralised manner. Achieved using opportunistic connections, formed when they are colocated, in environments where Internet connectivity is expensive or unreliable, such as urban buses, train rides and coffee shops. Most people have a high degree of regularity in their movements (such as a daily commute), including repeated contacts with others possessing similar seasonal movement patterns. We argue that this behaviour can be exploited in connection selection, and outline a system for the identification of long-term companions and sources that have previously provided quality content, in order to maximise the successful receipt of content flies. We utilise actual traces and existing mobility models to validate our approach, and show how consideration of the colocation history and the quality of previous data transfers leads to more successful sharing of content in realistic scenarios.
- 1 January 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
Content Source Selection in Bluetooth Networks
Large scale market penetration of electronic devices equipped with Bluetooth technology now gives the ability to share content (such as music or video clips) between members of the public in a decentralised manner. Achieved using opportunistic connections, formed when they are colocated, in environments where Internet connectivity is expensive or unreliable, such as urban buses, train rides and coffee shops. Most people have a high degree of regularity in their movements (such as a daily commute), including repeated contacts with others possessing similar seasonal movement patterns. We argue that this behaviour can be exploited in connection selection, and outline a system for the identification of long-term companions and sources that have previously provided quality content, in order to maximise the successful receipt of content flies. We utilise actual traces and existing mobility models to validate our approach, and show how consideration of the colocation history and the quality of previous data transfers leads to more successful sharing of content in realistic scenarios.