Matteo Prata
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Matteo Prata has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Novella Bartolini
Computer Science Department, Sapienza University of Rome, Rome, Italy
4 shared publications - Andrea Coletta
Banca d'Italia, Roma, Italy
2 shared publications - Viviana Arrigoni
Department of Computer Science, Sapienza University of Rome, Rome, Italy
2 shared publications Andrea Coletta
1 shared publication- Domenicomichele Silvestri1 shared publication
Flavio Giorgi
1 shared publication
Latest Publications
- Open Access
- 15 November 2024
- Published by Elsevier in Computer Networks
- Vol. 256
A -UAV: Application-Aware resilient edge-assisted UAV networks- 15 November 2024
- Published by Elsevier in Computer Networks
- Vol. 256
Open AccessA -UAV: Application-Aware resilient edge-assisted UAV networks - Open Access
- 12 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 32 (6) , 5216-5231
Recovering Critical Service After Large-Scale Failures With Bayesian Network Tomography
Massive failures in communication networks result from natural disasters, heavy blackouts, and military and cyber attacks. After these events, an adequate network recovery plan is key to ensuring emergency-critical service restoration and preventing intolerable downtime and performance degradation. We tackle the problem of minimizing the time and number of interventions to sufficiently restore the communication network to support emergency services after large-scale failures. We propose (Progressive RecOvery and Tomography-based mONitoring), an efficient algorithm for progressive recovery of emergency services. Unlike previous work, assuming centralized routing and complete network observability, addresses the more realistic scenario in which the network relies on the existing routing protocols, and knowledge of the network state is partial and uncertain. relies on Network Tomography for monitoring and acquiring information about the state of nodes and links. Simulation results on real topologies show that our algorithm outperforms previous solutions in terms of cumulative routed flow, repair costs and recovery time in static and dynamic failure scenarios.
- 12 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 32 (6) , 5216-5231
Open AccessRecovering Critical Service After Large-Scale Failures With Bayesian Network Tomography
Massive failures in communication networks result from natural disasters, heavy blackouts, and military and cyber attacks. After these events, an adequate network recovery plan is key to ensuring emergency-critical service restoration and preventing intolerable downtime and performance degradation. We tackle the problem of minimizing the time and number of interventions to sufficiently restore the communication network to support emergency services after large-scale failures. We propose (Progressive RecOvery and Tomography-based mONitoring), an efficient algorithm for progressive recovery of emergency services. Unlike previous work, assuming centralized routing and complete network observability, addresses the more realistic scenario in which the network relies on the existing routing protocols, and knowledge of the network state is partial and uncertain. relies on Network Tomography for monitoring and acquiring information about the state of nodes and links. Simulation results on real topologies show that our algorithm outperforms previous solutions in terms of cumulative routed flow, repair costs and recovery time in static and dynamic failure scenarios.
- Open Access
- 13 April 2024
- Published by Springer Nature in Artificial Intelligence Review
- Vol. 57 (5) , 1-45
Lob-based deep learning models for stock price trend prediction: a benchmark study
The recent advancements in Deep Learning (DL) research have notably influenced the finance sector. We examine the robustness and generalizability of fifteen state-of-the-art DL models focusing on Stock Price Trend Prediction (SPTP) based on Limit Order Book (LOB) data. To carry out this study, we developed LOBCAST, an open-source framework that incorporates data preprocessing, DL model training, evaluation, and profit analysis. Our extensive experiments reveal that all models exhibit a significant performance drop when exposed to new data, thereby raising questions about their real-world market applicability. Our work serves as a benchmark, illuminating the potential and the limitations of current approaches and providing insight for innovative solutions.
- 13 April 2024
- Published by Springer Nature in Artificial Intelligence Review
- Vol. 57 (5) , 1-45
Open AccessLob-based deep learning models for stock price trend prediction: a benchmark study
The recent advancements in Deep Learning (DL) research have notably influenced the finance sector. We examine the robustness and generalizability of fifteen state-of-the-art DL models focusing on Stock Price Trend Prediction (SPTP) based on Limit Order Book (LOB) data. To carry out this study, we developed LOBCAST, an open-source framework that incorporates data preprocessing, DL model training, evaluation, and profit analysis. Our extensive experiments reveal that all models exhibit a significant performance drop when exposed to new data, thereby raising questions about their real-world market applicability. Our work serves as a benchmark, illuminating the potential and the limitations of current approaches and providing insight for innovative solutions.
- Open Access
- 25 November 2023
- Published by Association for Computing Machinery (ACM)
- p. 524-532
On Correlated Stock Market Time Series Generation
In this paper, we present CoMeTS-GAN (Correlated Multivariate Time Series GAN), a framework based on Conditional Generative Adversarial Networks (C-GANs), designed to generate mid-prices and volumes time series of correlated stocks. This tool provides a light and responsive solution for realistic stock market simulation. It is able to accurately learn and reproduce inter-asset correlations, a crucial aspect for achieving realness in multi-stock simulation environments. Our experimental campaign assesses the model using acknowledged stylized facts of stock markets as well as additional metrics capturing inter-asset correlations. We compare our model to leading architectures, highlighting our approach’s strengths. These findings suggest the potential of CoMeTS-GAN in realistically simulating correlated price movements, offering a responsive market environment and valuable input for trading strategy formulation.
- 25 November 2023
- Published by Association for Computing Machinery (ACM)
- p. 524-532
Open AccessOn Correlated Stock Market Time Series Generation
In this paper, we present CoMeTS-GAN (Correlated Multivariate Time Series GAN), a framework based on Conditional Generative Adversarial Networks (C-GANs), designed to generate mid-prices and volumes time series of correlated stocks. This tool provides a light and responsive solution for realistic stock market simulation. It is able to accurately learn and reproduce inter-asset correlations, a crucial aspect for achieving realness in multi-stock simulation environments. Our experimental campaign assesses the model using acknowledged stylized facts of stock markets as well as additional metrics capturing inter-asset correlations. We compare our model to leading architectures, highlighting our approach’s strengths. These findings suggest the potential of CoMeTS-GAN in realistically simulating correlated price movements, offering a responsive market environment and valuable input for trading strategy formulation.
- 1 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 23 (5) , 4930-4942
TaMaRA: A Task Management and Routing Algorithm for FANETs
Flying ad-hoc networks (FANETs) are a powerful tool for inspecting safety-critical scenarios, including post-disaster areas or military fields, where they ensure prompt area monitoring and fast detection of events of interest. However, wide area deployment of FANETs requires fast and reliable communications among devices and their base station to ensure prompt intervention upon detection of anomalies. Existing long-range communication technologies are inadequate to meet the data rate requirements and delay constraints of safety-critical applications. Previous solutions to enable ad-hoc communications in mobile networks also fall short of exploiting the controllable mobility of FANETs. To face this challenge, we formulate the connected deployment problem, where we require the FANET to dynamically create connected coverage formations to ensure multi-hop low-latency communications while performing the monitoring task. We show that addressing the above problem under the joint requirement of maximizing event coverage is NP-hard. We propose a joint Task Management and Routing Algorithm called TaMaRA, a polynomial-time solution based on a two-phase approximation of the problem. By means of extensive simulations and real field experiments we show that our approach outperforms existing solutions in terms of monitoring accuracy and system responsiveness.
- 1 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Mobile Computing
- Vol. 23 (5) , 4930-4942
TaMaRA: A Task Management and Routing Algorithm for FANETs
Flying ad-hoc networks (FANETs) are a powerful tool for inspecting safety-critical scenarios, including post-disaster areas or military fields, where they ensure prompt area monitoring and fast detection of events of interest. However, wide area deployment of FANETs requires fast and reliable communications among devices and their base station to ensure prompt intervention upon detection of anomalies. Existing long-range communication technologies are inadequate to meet the data rate requirements and delay constraints of safety-critical applications. Previous solutions to enable ad-hoc communications in mobile networks also fall short of exploiting the controllable mobility of FANETs. To face this challenge, we formulate the connected deployment problem, where we require the FANET to dynamically create connected coverage formations to ensure multi-hop low-latency communications while performing the monitoring task. We show that addressing the above problem under the joint requirement of maximizing event coverage is NP-hard. We propose a joint Task Management and Routing Algorithm called TaMaRA, a polynomial-time solution based on a two-phase approximation of the problem. By means of extensive simulations and real field experiments we show that our approach outperforms existing solutions in terms of monitoring accuracy and system responsiveness.