Mattia D'Emidio

Prof. Mattia D'Emidio

Department of Information Engineering, Computer Science and Mathematics, University of L’Aquila, Via Vetoio, I-67100 L’Aquila, Italy
orcid

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 December 2018 in Information and Computation
Verified
Journal Article
Closed access
MDMattia D'Emidio
Mattia D'Emidio
GSGabriele Di Stefano
Gabriele Di Stefano
DFDaniele Frigioni
Daniele Frigioni
ANAlfredo Navarra
Alfredo Navarra

30 January 2019 in ACM Journal of Experimental Algorithmics
Verified
Journal Article
Open access
PDF file
Gianlorenzo D'AngeloGianlorenzo D'Angelo
Gianlorenzo D'Angelo
MDMattia D'Emidio
Mattia D'Emidio
DFDaniele Frigioni
Daniele Frigioni
The 2-hop Cover labeling of a graph is currently the best data structure for answering shortest-path distance queries on large-scale networks, since it combines low query times, affordable space occupancy, and reasonable preprocessing effort. Its main limit resides in not being suited for dynamic networks since, after a network change, (1) queries on the distance can return incorrect values and (2) recomputing the labeling from scratch yields unsustainable time overhead. In this article, we overcome this limit by introducing the first decremental algorithm able to update 2-hop Cover labelings under node/edge removals and edge weight increases . We prove the new algorithm to be (1) correct, i.e., after each update operation queries on the updated labeling return exact values; (2) efficient with respect to the number of nodes that change their distance as a consequence of a graph update; and (3) able to preserve the minimality of the labeling, a desirable property that impacts on both query time and space occupancy. Furthermore, we provide an extensive experimental study to demonstrate the effectiveness of the new method. We consider it both alone and in combination with the unique known incremental approach (Akiba et al. 2014), thus obtaining the first fully dynamic algorithm for updating 2-hop Cover labelings under general graph updates. Our experiments show that the new dynamic algorithms are orders of magnitude faster than the from-scratch approach while at the same time being able to preserve the quality of the labeling in terms of query time and space occupancy, thus allowing one to employ the 2-hop Cover labeling approach in dynamic networks with practical performance.

16 November 2020 in IEEE Access
Verified
Journal Article
Open access
Gianlorenzo D'AngeloGianlorenzo D'Angelo
Gianlorenzo D'Angelo
MDMattia D'Emidio
Mattia D'Emidio
SDShantanu Das
Shantanu Das
ANAlfredo Navarra
Alfredo Navarra
Giuseppe PrencipeGiuseppe Prencipe
Giuseppe Prencipe
We study models and algorithms for Programmable Matter (PM), that is matter with the ability to change its physical properties (e.g., shape or optical properties) in a programmable fashion. PM can be implemented by assembling a system of weak self-organizing computational elements, called particles , that can be programmed via distributed algorithms to collectively achieve some global task. Recent advances in the production of nanotechnologies have rendered such systems increasingly possible in practice, thus triggering research interests from many areas of computer science. The most established models for PM assume that particles: are modeled as finite state automata; are all identical, executing the same algorithm based on local observation of the surroundings; live and operate in the cells of a hexagonal grid; can move from one cell to another by repeatedly alternating between a contracted state (a particle occupies one cell) and an expanded state (a particle occupies two neighboring cells). Given these elementary features, it is rather hard to design distributed algorithms even for basic tasks and, in fact, all existing solutions to solve fundamental problems via PM have resorted to endowing PM systems with various capabilities to overcome such hardness, thus assuming quite unrealistic features. In this paper, we move toward more realistic computational models for PM. Specifically, we first introduce ${\sf SILBOT}$ , a new modeling approach that relaxes several assumptions used in previous ones. Second, we present a distributed algorithm to solve, in the ${\sf SILBOT}$ model, a foundational primitive for PM, namely Leader Election . This algorithm works in $O(n)$ rounds for all initial configurations of $n$ particles that are both connected (i.e. particles induce a connected graph) and compact (i.e. without holes , that is no empty cells surrounded by particles occur). As usual in asynchronous contexts, a round is intended as the time within which all particles have been activated at least once. Third, we show that, if the initial configuration admits holes, it is impossible to achieve leader election while preserving connectivity. Finally, by slightly empowering the robots, we design an algorithm to handle initial configurations admitting holes that in $O(n^{2})$ rounds solves the leader election problem while obtaining also compaction.

2 January 2019 in Journal of Combinatorial Optimization
Verified
Journal Article
Closed access
PDF file
MDMattia D'Emidio
Mattia D'Emidio
LFLuca Forlizzi
Luca Forlizzi
DFDaniele Frigioni
Daniele Frigioni
SLStefano Leucci
Stefano Leucci
GPGuido Proietti
Guido Proietti

1 April 2018
Verified
Conference Paper
Closed access
DADavide Arcelli
Davide Arcelli
VCVittorio Cortellessa
Vittorio Cortellessa
MDMattia D'Emidio
Mattia D'Emidio
DPDaniele Di Pompeo
Daniele Di Pompeo
Multi-objective optimization has demonstrated, in the last few years, to be an effective paradigm to tackle different architectural problems, such as service selection, composition and deployment. In particular, multi-objective approaches for searching architectural configurations that optimize quality properties (such as performance, reliability and cost) have been introduced in the last decade. However, a relevant amount of complexity is introduced in this context when performance are considered, often due to expensive iterative generation of performance models and interpretation of results. In this paper we introduce EASIER (Evolutionary Approach for multi-objective Software archItecturE Refactoring), that is an approach for optimizing architecture refactoring based on performance and on the intensity of changes. We focus on the actionable aspects of architectural optimization, instead of merely searching over a set of alternatives. We also start to investigate on the potential influence of performance antipatterns on such process. We have implemented our approach on AEmilia ADL, so to carry out performance analysis and architecture refactoring within the same environment. We demonstrate the effectiveness and applicability of our approach through its experimentation on a case study.

1 September 2019 in Robotics and Autonomous Systems
Verified
Journal Article
Closed access
MDMattia D'Emidio
Mattia D'Emidio
IKImran Khan
Imran Khan