Ricerc@Sapienza

Urban planning has long been introduced into the territorial classification elements as belonging to integrated waste cycle management. Within such framework, types of urban hygiene are defined and described. In particular, the General Regulatory Plan of the City of Rome has established that areas and facilities for separate collection of waste belong to the secondary urbanization works to be identified by executive planning, as well as for temporary collection, compacting and conveying inert and bulky waste.

In this paper, we describe Combinatorial visuaL Analytics system for Information Retrieval Evaluation (CLAIRE), a Visual Analytics (VA) system for exploring and making sense of the performances of a large amount of Information Retrieval (IR) systems, in order to quickly and intuitively grasp which system configurations are preferred, what are the contributions of the different components and how these components interact together.

In this work, the notion of reduction is introduced for discrete-time nonlinear input-delayed systems. The retarded dynamics is reduced to a new system which is free of delays and equivalent (in terms of stabilizability) to the original one. Different stabilizing strategies are proposed over the reduced model. Connections with existing predictor-based methods are discussed. The methodology is also worked out over particular classes of time-delay systems as sampled-data dynamics affected by an entire input delay.

Management and assessment of homework assignments in programming courses is a challenging topic both for researchers and practitioners. In the current paper we propose a solution based on the blending of automated evaluation and peer learning. More specifically, we introduce a platform called Q2A-I, which provides two main features: (1) automated management and assessment of homework submissions; and (2) peer interaction support on the programming tasks, by exchanging questions and answers through dedicated micro-forums.

At ICS 2010, Dziembowski, Pietrzak and Wichs introduced the notion of non-malleable codes, a weaker form of error-correcting codes guaranteeing that the decoding of a tampered codeword either corresponds to the original message or to an unrelated value. The last few years established non-malleable codes as one of the recently invented cryptographic primitives with the highest impact and potential, with very challenging open problems and applications. In this work, we focus on so-called continuously non-malleable codes in the split-state model, as proposed by Faust et al.

Non-malleable codes for the split-state model allow to encode a message into two parts, such that arbitrary independent tampering on each part, and subsequent decoding of the corresponding modified codeword, yields either the same as the original message, or a completely unrelated value. Continuously non-malleable codes further allow to tolerate an unbounded (polynomial) number of tampering attempts, until a decoding error happens. The drawback is that, after an error happens, the system must self-destruct and stop working, otherwise generic attacks become possible.

The Fiat–Shamir (FS) transformation (Fiat and Shamir, Crypto ‘86) is a popular paradigm for constructing very efficient non-interactive zero-knowledge (NIZK) arguments and signature schemes from a hash function and any three-move interactive protocol satisfying certain properties. Despite its wide-spread applicability both in theory and in practice, the known positive results for proving security of the FS paradigm are in the random oracle model only, i.e., they assume that the hash function is modeled as an external random function accessible to all parties.

A multi-objective deterministic hybrid algorithm (MODHA) is introduced for efficient simulation-based design optimization. The global exploration capability of multi-objective deterministic particle swarm optimization (MODPSO) is combined with the local search accuracy of a derivative-free multi-objective (DFMO) linesearch method. Six MODHA formulations are discussed, based on two MODPSO formulations and three DFMO activation criteria. Forty five analytical test problems are solved, with two/three objectives and one to twelve variables.

In this paper, we describe a navigation system requiring very few computational resources, but still providing performance comparable with commonly used tools in the ROS universe. This lightweight navigation system is thus suitable for robots with low computational resources and provides interfaces for both ROS and NAOqi middlewares.

In 58 Italian Public Comprehensive Institutes (Istituti Comprensivi), that include Primary and Elementary schools, 2911 students experimented the use of a mobile robot, Sapientino Doc by Clementoni, to learn curricula matters such as Mathematics, Geometry and Geography (MGG). The project “A scuola di coding con Sapientino” was developed during the 2016/2017 regular school year for about 3 months (April–June 2017). The schools were distributed throughout Italy and involved 2911 students from 5 to 8 years old, 155 classes, and 163 teachers.