FBK irst

Trento, Italy
Trento, Italy

Time filter

Source Type

Callaway C.B.,FBK irst
International Conference on Intelligent User Interfaces, Proceedings IUI | Year: 2017

UPDATED - January 20, 2017. Wearables offer an attractive platform for interacting intelligently with our environment and ourselves.commercially available wearables are not aimed at the academic/research environment. They have proprietary protocols, do not willingly share recorded data or information on how it was processed and filtered, and do not have the right combinations of sensors or actuators in the desired positions or sensitivity. Given the scarce resources that academic groups have, their wearables have rarely progressed past a very bulky prototype stage. But it is now possible to create a complete custom wearable within a month at very low cost. This tutorial will teach the skills necessary to design and fabricate a Bluetooth based wrist or ring wearable that can wirelessly send sensor data to a smartphone or computer for data analysis and receive wireless commands to actuate sensors. Given the basic schematics for a circuit, you will learn how to choose and source components, lay out and route a circuit board, send the design off to a local fabrication house, and create the finished device when the printed circuit boards return a week later. I will introduce helpful open source software, teach basic industry standards and the properties of various sensors and actuators, and describe features that are especially useful for wearables. Copyright held by the owner/author(s).


Dragoni M.,FBK IRST
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2015

Ontology mapping is a task aiming to align semantic resources in order to foster the re-use of information and to enable the knowledge and data expressed in the matched ontologies to interoperate. When ontology mapping algorithms are applied in practice, a manual refinement is furtherly necessary for validating the correctness of the resulted resource, especially, as it happens in real-world cases, when a gold standard cannot be exploited for assessing the generated mappings. In this paper, we present a suggestion-based mapping system, integrated as a component of a knowledge management platform, implementing an information retrieval-based (IR-based) approach for generating and validating, by experts, mappings between ontologies. The proposed platform has been evaluated quantitatively (i.e. effectiveness of suggestions, reduction of the user effort, etc.) and qualitatively (i.e. usability) on two use cases: Organic. Lingua and PRESTO, respectively an EU-funded and regional-funded projects. The results demonstrated the effectiveness and usability of the proposed platform in a real-world environment. © Springer International Publishing Switzerland 2015.


Cimatti A.,FBK IRST | Griggio A.,University of Trento | Sebastiani R.,University of Trento
ACM Transactions on Computational Logic | Year: 2010

The problem of computing Craig interpolants has recently received a lot of interest. In this article, we address the problem of efficient generation of interpolants for some important fragments of first-order logic, which are amenable for effective decision procedures, called satisfiability modulo theory (SMT) solvers. We make the following contributions. First, we provide interpolation procedures for several basic theories of interest: the theories of linear arithmetic over the rationals, difference logic over rationals and integers, and UTVPI over rationals and integers. Second, we define a novel approach to interpolate combinations of theories that applies to the delayed theory combination approach. Efficiency is ensured by the fact that the proposed interpolation algorithms extend state-of-the-art algorithms for satisfiability modulo theories. Our experimental evaluation shows that the MathSAT SMT solver can produce interpolants with minor overhead in search, and much more efficiently than other competitor solvers. © 2010 ACM.


Forster A.,University of Applied Sciences and Arts Southern Switzerland | Murphy A.L.,FBK IRST
Ad Hoc Networks | Year: 2011

A growing class of wireless sensor network (WSN) applications require the use of sensed data inside the network at multiple, possibly mobile base stations. Standard WSN routing techniques that move data from multiple sources to a single, fixed base station are not applicable, motivating new solutions that efficiently achieve multicast and handle mobility. This paper explores in depth the requirements of this set of application scenarios and proposes Froms, a machine learning-based multicast routing paradigm. Its primary benefits are flexibility to optimize routing over a variety of properties such as route length, battery levels, ease of recovery after node failures, and native support for sink mobility. We provide theoretical, simulation and experimentation results supporting these claims, showing the benefits of Froms in terms of low routing overhead, extended network lifetime, and other key metrics for the WSN environment. © 2010 Elsevier B.V. All rights reserved.


Schuppan V.,FBK irst
Science of Computer Programming | Year: 2012

Unsatisfiable cores, i.e., parts of an unsatisfiable formula that are themselves unsatisfiable, have important uses in debugging specifications, speeding up search in model checking or SMT, and generating certificates of unsatisfiability. While unsatisfiable cores have been well investigated for Boolean SAT and constraint programming, the notion of unsatisfiable cores for temporal logics such as LTL has not received much attention. In this paper we investigate notions of unsatisfiable cores for LTL that arise from the syntax tree of an LTL formula, from converting it into a conjunctive normal form, and from proofs of its unsatisfiability. The resulting notions are more fine-grained than existing ones. We illustrate the benefits of the more fine-grained notions on examples from the literature. We extend some of the notions to realizability and we discuss the relationship of unsatisfiable and unrealizable cores with the notion of vacuity. © 2010 Elsevier B.V. All rights reserved.


Ghilardi S.,University of Milan | Ranise S.,FBK Irst
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2010

We describe mcmt, a fully declarative and deductive symbolic model checker for safety properties of infinite state systems whose state variables are arrays. Theories specify the properties of the indexes and the elements of the arrays. Sets of states and transitions of a system are described by quantified first-order formulae. The core of the system is a backward reachability procedure which symbolically computes pre-images of the set of unsafe states and checks for safety and fix-points by solving Satisfiability Modulo Theories (SMT) problems. Besides standard SMT techniques, efficient heuristics for quantifier instantiation, specifically tailored to model checking, are at the very heart of the system. mcmt has been successfully applied to the verification of imperative programs, parametrised, timed, and distributed systems. © 2010 Springer-Verlag.


Cimatti A.,FBK irst | Dorigatti M.,FBK irst | Tonetta S.,FBK irst
2013 28th IEEE/ACM International Conference on Automated Software Engineering, ASE 2013 - Proceedings | Year: 2013

Contract-based design enriches a component model with properties structured in pairs of assumptions and guarantees. These properties are expressed in term of the variables at the interface of the components, and specify how a component interacts with its environment: the assumption is a property that must be satisfied by the environment of the component, while the guarantee is a property that the component must satisfy in response. Contract-based design has been recently proposed in many methodologies for taming the complexity of embedded systems. In fact, contract-based design enables stepwise refinement, compositional verification, and reuse of components. However, only few tools exist to support the formal verification underlying these methods. OCRA (Othello Contracts Refinement Analysis) is a new tool that provides means for checking the refinement of contracts specified in a linear-time temporal logic. The specification language allows to express discrete as well as metric real-time constraints. The underlying reasoning engine allows checking if the contract refinement is correct. OCRA has been used in different projects and integrated in CASE tools. © 2013 IEEE.


Zbal G.O..,FBK Irst | Strapparava C.,FBK Irst
50th Annual Meeting of the Association for Computational Linguistics, ACL 2012 - Proceedings of the Conference | Year: 2012

In this paper, we propose a computational approach to generate neologisms consisting of homophonic puns and metaphors based on the category of the service to be named and the properties to be underlined. We describe all the linguistic resources and natural language processing techniques that we have exploited for this task. Then, we analyze the performance of the system that we have developed. The empirical results show that our approach is generally effective and it constitutes a solid starting point for the automation of the naming process. © 2012 Association for Computational Linguistics.


We describe a symbolic procedure for solving the reachability problem of transition systems that use formulae of Effectively Propositional Logic to represent sets of backward reachable states. We discuss the key ideas for the mechanization of the procedure where fix-point checks are reduced to SMT problems. We also show the termination of the procedure on a sub-class of transition systems. Then, we discuss how reachability problems for this sub-class can be used to encode analysis problems of administrative policies in the Role-Based Access Control (RBAC) model that is one of the most widely adopted access control paradigms. An implementation of a refinement of the backward reachability procedure, called asasp, shows better flexibility and scalability than a state-of-the-art tool on a significant set of security problems. © 2012 Springer Science+Business Media, LLC.


Bulo S.R.,FBK irst | Kontschieder P.,Microsoft
Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition | Year: 2016

Randomized classification trees are among the most popular machine learning tools and found successful applications in many areas. Although this classifier was originally designed as offline learning algorithm, there has been an increased interest in the last years to provide an online variant. In this paper, we propose an online learning algorithm for classification trees that adheres to Bayesian principles. In contrast to state-of-the-art approaches that produce large forests with complex trees, we aim at constructing small ensembles consisting of shallow trees with high generalization capabilities. Experiments on benchmark machine learning and body part recognition datasets show superior performance over state-of-the-art approaches.

Loading FBK irst collaborators
Loading FBK irst collaborators