PI's cv

Postdoctoral Researcher

Freie Universität Bozen

Bridging Data Integration for Energy Efficiency with Business Process Management

• Business Process Management
• Conformance Checking
• Database

Teaching Fellow, Lecturer (November)

School of Computing, Newcastle University

Teaching Real-Time technologies for Videogames in C++

• In-Silico Learning
• C++ Programming
• Game Technology

PostDoc Researcher

Herbert Wertheim College of Engineering, University of Florida

Development of new technologies for data integration and resolution of intrinsic system errors. This issue was linked to artificial intelligence as the answer to textual questions of users on digital data requires the ability to interpret and deduct/infer, together with the treatment of numerical and probabilistic values.

• Inconsistency Metrics
• Java Programming
• C++ Programming
• Data Science Pipelines

Visiting PhD Student

Universität Leipzig

University of Bologna requires each PhD candidate to conduct the last year of research in a foreign research centre to develop new skills and networking. I worked on NoSQL data management (graph) with Java distributed technologies (Hadoop+Apache Flink).

• Graph Algorithms
• Distributed Computation
• Gradoop

PhD in Computer Science and Engineering

University of Bologna

Diss. Title: A new Nested Graph Model for Data Integration

• Framing the graph join and nesting operators in the broader context of Data Integration. Generalising such concepts in the context of a general data model and query language

MSc in Computer Science

University of Bologna

Diss. Title: Hypergraph Mining for Social Networks

• Leveraging the Relational Algebra for Data Mining in the context of Hypergraph Networks, while providing suitable use case scenarios for its applicability.

BSc in Computer Science

University of Bologna

Diss. Title: Pjproject on Android: a clash over multiple layers

• Porting of a SIP-communication GNU/Linux application on Android required to provide an in-depth analysis of the Android Operative System.

Best Paper Award

eHPWAS 2024

Best paper award for 'Approximating Real-Time IoT Interaction through Connection Counting: A QoS Perspective'.

Best Paper Award

IDEAS 2024

Best paper award for 'Predicting Dyskinetic Events through Verified Multivariate Time Series Classification'.

'Francesco Viviani' Recognition

Ferrara's Chamber of Commerce, IT

For obtaining the high school diploma with top marks and merit.

EPSRC Doctoral Training Programme studentships

Ensuring one 3 and a half year PhD scholarship on formal methods for dealing with real data containing uncertainties and inconsistencies. This includes a tuition fee, a stipend, and lab equipment and consumables costs.

• Graph Query Languages
• NLP

National Edge AI Hub for Real Data: Edge Intelligence for Cyberdisturbances and Data Quality

In coordination with the principal investigator (Prof. Rajiv Ranjan), we have £1 billion for a project shared between different UK universities, for which Newcastle has received £4 million. This project concerns the application of AI in a distributed environment and on the Edge.

• Smart-Cities
• eHealth
• Osmotic Simulator

DECLAREd: A Polytime LTLf Fragment

Logics

This paper considers a specification rewriting meachanism for a specific fragment of Linear Temporal Logic for Finite traces, DECLAREd, working through an equational logic and rewriting mechanism under customary practitioner assumptions from the Business Process Management literature. By rewriting the specification into an equivalent formula which might be easier to compute, we aim to streamline current state-of-the-art temporal artificial intelligence algorithms working on temporal logic. As this specification rewriting mechanism is ultimately also able to determine with the provided specification is a tautology (always true formula) or a formula containing a temporal contradiction, by detecting the necessity of a specific activity label to be both present and absent within a log, this implies that the proved mechanism is ultimately a SAT-solver for DECLAREd. We prove for the first time, to the best of our knowledge, that this fragment is a polytime fragment of LTLf, while all the previously-investigated fragments or extensions of such a language were in polyspace. We test these considerations over formal synthesis (Lydia), SAT-Solvers (AALTAF) and formal verification (KnoBAB) algorithms, where formal verification can be also run on top of a relational database and can be therefore expressed in terms of relational query answering. We show that all these benefit from the aforementioned assumptions, as running their tasks over a rewritten equivalent specification will improve their running times, thus motivating the pressing need of this approach for practical temporal artificial intelligence scenarios. We validate such claims by testing such algorithms over a Cybersecurity dataset.

Towards a Generalised Semistructured Data Model and Query Language

Association for Computing Machinery

Although current efforts are all aimed at re-defining new ways to harness old data representations, possibly with new schema features, the challenges still open provide evidence of the need for a "diametrically opposite" approach: in fact, all information generated in real contexts is to be understood lacking of any form of schema, where the schema associated with such data is only determined a posteriori based on either a specific application context, or from some data's facets of interest. This solution should still enable recommendation systems to manipulate the aforementioned data semantically. After providing evidence of these limitations from current literature, we propose a new Generalized Semistructured data Model that makes possible queries expressible in any data representation through a Generalised Semistructured Query Language, both relying upon script v2.0 as a MetaModel language manipulating types as terms as well as allowing structural aggregation functions.

On Efficiently Equi-Joining Graphs

Association for Computing Machinery

Despite the growing popularity of techniques related to graph summarization, a general operator for joining graphs on both the vertices and the edges is still missing. Current languages such as Cypher and SPARQL express binary joins through the non-scalable and inefficient composition of multiple traversal and graph creation operations. In this paper, we propose an efficient equi-join algorithm that is able to perform vertex and path joins over a secondary memory indexed graph, also the resulting graph is serialised in secondary memory. The results show that the implementation of the proposed model outperforms solutions based on graphs, such as Neo4J and Virtuoso, and the relational model, such as PostgreSQL. Moreover, we propose two ways how edges can be combined, namely the conjunctive and disjunctive semantics, Preliminary experiments on the graph conjunctive join are also carried out with incremental updates, thus suggesting that our solution outperforms materialized views over PostgreSQL.

Internal Examiner

Dr. Yiang Lu’s Viva

Providing a mediating position with the External Examinator for the dissertation defense of the candidate supervised by Prof. Graham Morgan.

Member

PhD Progression and Completion Committee

Sitting as a panel member for PhD yearly progressions and project proposals. This deals with addressing questions to the PhD students in terms of both the project plan and research directions.