22,936 research outputs found
Measuring and Managing Answer Quality for Online Data-Intensive Services
Online data-intensive services parallelize query execution across distributed
software components. Interactive response time is a priority, so online query
executions return answers without waiting for slow running components to
finish. However, data from these slow components could lead to better answers.
We propose Ubora, an approach to measure the effect of slow running components
on the quality of answers. Ubora randomly samples online queries and executes
them twice. The first execution elides data from slow components and provides
fast online answers; the second execution waits for all components to complete.
Ubora uses memoization to speed up mature executions by replaying network
messages exchanged between components. Our systems-level implementation works
for a wide range of platforms, including Hadoop/Yarn, Apache Lucene, the
EasyRec Recommendation Engine, and the OpenEphyra question answering system.
Ubora computes answer quality much faster than competing approaches that do not
use memoization. With Ubora, we show that answer quality can and should be used
to guide online admission control. Our adaptive controller processed 37% more
queries than a competing controller guided by the rate of timeouts.Comment: Technical Repor
Ontological Matchmaking in Recommender Systems
The electronic marketplace offers great potential for the recommendation of
supplies. In the so called recommender systems, it is crucial to apply
matchmaking strategies that faithfully satisfy the predicates specified in the
demand, and take into account as much as possible the user preferences. We
focus on real-life ontology-driven matchmaking scenarios and identify a number
of challenges, being inspired by such scenarios. A key challenge is that of
presenting the results to the users in an understandable and clear-cut fashion
in order to facilitate the analysis of the results. Indeed, such scenarios
evoke the opportunity to rank and group the results according to specific
criteria. A further challenge consists of presenting the results to the user in
an asynchronous fashion, i.e. the 'push' mode, along with the 'pull' mode, in
which the user explicitly issues a query, and displays the results. Moreover,
an important issue to consider in real-life cases is the possibility of
submitting a query to multiple providers, and collecting the various results.
We have designed and implemented an ontology-based matchmaking system that
suitably addresses the above challenges. We have conducted a comprehensive
experimental study, in order to investigate the usability of the system, the
performance and the effectiveness of the matchmaking strategies with real
ontological datasets.Comment: 28 pages, 8 figure
Recommended from our members
A Social Learning Space Grid for MOOCs: Exploring a FutureLearn Case
Collaborative and social engagement promote active learning through knowledge intensive interactions. Massive Open Online Courses (MOOCs) are dynamic and diversified learning spaces with varying factors like flexible time frames, student count, demographics requiring higher engagement and motivation to continue learning and for designers to implement novel pedagogies including collaborative learning activities. This paper looks into available and potential collaborative and social learning spaces within MOOCs and proposes a social learning space grid that can aid MOOC designers to implement such spaces, considering the related requirements. Furthermore, it describes a MOOC case study incorporating three collaborative and social learning spaces and discusses challenges faced. Interesting lessons learned from the case give an insight on which spaces to be implemented and the scenarios and factors to be considered
Characterizing the use of mathematical knowledge in boundary crossing situations at work
The first aim of this paper is to present a characterisation of techno-mathematical literacies needed for effective practice in modern, technology-rich workplaces that are both highly automated and increasingly focused on flexible response to customer needs. The second aim is to introduce an epistemological dimension to activity theory, specifically to the notions of boundary object and boundary crossing. In this paper we draw on ethnographic research in a pensions company and focus on data derived from detailed analysis of the diverse perspectives that exist with respect to one symbolic artefact, the annual pension statement. This statement is designed to facilitate boundary crossing between company and customers. Our study showed that the statement routinely failed in this communicative role, largely due to the invisible factors of the mathematical-financial models underlying the statement that are not made visible to customers, or to the customer enquiry team whose task is to communicate with customers. By focusing on this artefact in boundary-crossing situations, we identify and elaborate the nature of the techno-mathematical knowledge required for effective communication between different communities in one financial services workplace, and suggest the implications of our findings for workplaces more generally
Methodological considerations concerning manual annotation of musical audio in function of algorithm development
In research on musical audio-mining, annotated music databases are needed which allow the development of computational tools that extract from the musical audiostream the kind of high-level content that users can deal with in Music Information Retrieval (MIR) contexts. The notion of musical content, and therefore the notion of annotation, is ill-defined, however, both in the syntactic and semantic sense. As a consequence, annotation has been approached from a variety of perspectives (but mainly linguistic-symbolic oriented), and a general methodology is lacking. This paper is a step towards the definition of a general framework for manual annotation of musical audio in function of a computational approach to musical audio-mining that is based on algorithms that learn from annotated data. 1
- …