Collections in this community

Recent Submissions

  • A Lightweight Container Middleware for Edge Cloud Architectures 

    von Leon D; Miori L; Sanin J; El Ioini N; Helmer S; Pahl C (Wiley, 2018)
    Containers form the basis of a middleware platform that suits the needs of platform‐as‐a‐service (PaaS) clouds, where application packaging and orchestration are key issues. This chapter introduces architecture requirements ...
  • Do you need infinite time? 

    Artale A; Mazzullo A; Ozaki A (IJCAI, 2019)
    Linear temporal logic over finite traces is used as a formalism for temporal specification in automated planning, process modelling and (runtime) verification. In this paper, we investigate first-order temporal logic over ...
  • Temporal DL-Lite over finite traces (preliminary results) 

    Artale A; Mazzullo A; Ozaki A (CEUR-WS, 2019)
    We transfer results on the temporal DL-Lite family of logics, moving from infinite models of linear time to the case of finite traces. In particular, we investigate the complexity of the satisfiability problem in various ...
  • Prediction of music pairwise preferences from facial expressions 

    Tkalčič M; Elahi M; Maleki N; Ricci F; Pesek M; Marolt M (ACM, 2019)
    Users of a recommender system may be requested to express their preferences about items either with evaluations of items (e.g. a rating) or with comparisons of item pairs. In this work we focus on the acquisition of pairwise ...
  • Identifying Innovative Idea Proposals with Topic Models—A Case Study from SPA Tourism 

    Sottocornola G; Stella F; Symeonidis P; Zanker M; Krajger I; Faullant R; Schwarz E (Springer, 2019)
    This chapter builds on a dataset where online users of a spa platform participated in an online idea contest providing free-text descriptions of their proposals for spa services. A panel of domain experts annotated these ...
  • A model of Requirements Engineering in Software Startups 

    Melegati J; Goldman A; Kon F; Wang X (2019)
    Context: Over the past 20 years, software startups have created many products that have changed human life. Since these companies are creating brand-new products or services, requirements are difficult to gather and highly ...
  • Distributed CTL model checking using MapReduce: theory and practice 

    Bellettini C; Camilli M; Capra L; Monga M (2016)
    The recent extensive availability of 'cloud' computing platforms is very appealing for the formal verification community. In fact, these platforms represent a great opportunity to run massively parallel jobs and analyze ...
  • Evaluating compliance: From LTL to abductive logic programming 

    Chesani F; Gavanelli M; Lamma E; Mello P; Montali M (2018)
    The compliance verification task amounts to establishing if the execution of a system, given in terms of observed happened events, does respect a given property. In the past both the frameworks of Temporal Logics and Logic ...
  • Cloud Computing and the new EU General Data Protection Regulation 

    Russo B; Valle L; Tosi D; Locatello D; Bonzagni G; Pancaldi M (2018)
    Disclosing personal data for a purpose not known by data subjects is a practice that the 2018 EU General Data Protection Regulation (GDPR) is supposed to prevent. This article overviews the major aspects of the GDPR related ...
  • MapReduce and Streaming Algorithms for Diversity Maximization in Metric Spaces of Bounded Doubling Dimension 

    Ceccarello M; Pietracaprina A; Pucci G; Upfal E (2017)
    Given a dataset of points in a metric space and an integer k, a diversity maximization problem requires determining a subset of k points maximizing some diversity objective measure, e.g., the minimum or the average distance ...
  • Ubiquitous technologies for older people 

    Cozza M; De Angeli A; Tonolli L (2017)
    In this paper, we present a close reading of work in ubicomp of applications for older people. Starting from three lines of enquiry defined in the inaugural issue of this journal, we discuss how ubicomp research has presented ...
  • Clustering Uncertain Graphs 

    Ceccarello M; Fantozzi C; Pietracaprina A; Pucci G; Vandin F (2017)
    An uncertain graph G = (V, E, p : E -> (0, 1]) can be viewed as a probability space whose outcomes (referred to as possible worlds) are subgraphs of G where any edge e is an element of E occurs with probability p(e), ...
  • Hybrid deterministic/stochastic simulation of complex biochemical systems 

    Lecca P; Bagagiolo F; Scarpa M (2017)
    In a biological cell, cellular functions and the genetic regulatory apparatus are implemented and controlled by complex networks of chemical reactions involving genes, proteins, and enzymes. Accurate computational models ...
  • Biography of a Design Project through the Lens of a Facebook Page 

    Menendez Blanco M; De Angeli A; Teli M (2017)
    This paper presents spazioD, a design case around the topic of dyslexia. Building on selected contributions from the literature on infrastructuring in participatory design and publics, it proposes that digital platforms ...
  • Strategies and systems towards grids and clouds integration: A DBMS-based solution 

    Mariotti M; Gervasi O; Vella F; Cuzzocrea A; Costantini A (Elsevier B.V., 2018)
    Cloud and Grid computing share some essential driving ideas although the computing and economic models are very different. In this paper, we propose different strategies for the Batch-oriented and Service-oriented computing ...
  • Multilevel parallelism for the exploration of large-scale graphs 

    Bernaschi M; Bisson M; Mastrostefano E; Vella F (Institute of Electrical and Electronics Engineers Inc., 2018)
    We present the most recent release of our parallel implementation of the BFS and BC algorithms for the study of large scale graphs. Although our reference platform is a high-end cluster of new generation NVIDIA GPUs and ...
  • Dynamic merging of frontiers for accelerating the evaluation of betweenness centrality 

    Vella F; Bernaschi M; Carbone G (Association for Computing Machinery, 2018)
    Betweenness Centrality (BC) is a widely used metric of the relevance of a node in a network. The fastestknown algorithm for the evaluation of BC on unweighted graphs builds a tree representing information about the shortest ...
  • Research Directions for Principles of Data Management (Dagstuhl Perspectives Workshop 16151) 

    Abiteboul S; Arenas M; Barceló P; Bienvenu M; Calvanese D; David C; Hull R; Hüllermeier E; Kimelfeld B; Libkin L; Martens W; Milo T; Murlak F; Neven F; Ortiz M; Schwentick T; Stoyanovich J; Su J; Suciu D; Vianu V; Yi K (2018)
    The area of Principles of Data Management (PDM) has made crucial contributions to the development of formal frameworks for understanding and managing data and knowledge.  This work has involved a rich cross-fertilization ...
  • A Methodology for Improving Vegetation Representation and Health Exploiting a Semantic Robotic System and Its Dynamic Stability Control 

    D’Auria D; Persia F (2018)
    Precision farming technologies have been increasingly recognized for their potential ability for improving agricultural productivity, reducing production cost, and minimizing damage to the environment. In this context, the ...
  • Modeling time, probability, and configuration constraints for continuous cloud service certification 

    Anisetti M; Ardagna CA; Damiani E; El Ioini N; Gaudenzi F (ELSEVIER ADVANCED TECHNOLOGY, 2018)
    Cloud computing proposes a paradigm shift where resources and services are allocated, provisioned, and accessed at runtime and on demand. New business opportunities emerge for service providers and their customers, at a ...

View more