Abstract
Predictive maintenance applications have increasingly been approached with deep learning techniques in recent years due to their high predictive performance. However, as in other real-world application scenarios, the need for explainability is often stated but not sufficiently addressed, which can limit adoption in practice. In this study, we will focus on predicting failures of trains operating in Porto, Portugal. While recent works have found high-performing deep neural network architectures that feature a parallel explainability pipeline, we find that the generated explanations can be hard to comprehend in practice due to their low support over the failure range. In this work, we propose a novel online rule-learning approach that is able to generate simple rules that cover the entirety of the detected failures. We evaluate our method against AMRules, a state-of-the-art online rule-learning approach, on two datasets gathered from trains operated by Metro do Porto. Our experiments show that our approach consistently generates rules with very high support that are simultaneously short and interpretable.

Abstract
In the evolving field of machine learning, ensuring group fairness has become a critical concern, prompting the development of algorithms designed to mitigate bias in decision-making processes. Group fairness refers to the principle that a model's decisions should be equitable across different groups defined by sensitive attributes such as gender or race, ensuring that individuals from privileged groups and unprivileged groups are treated fairly and receive similar outcomes. However, achieving fairness in the presence of group-specific concept drift remains an unexplored frontier, and our research represents pioneering efforts in this regard. Group-specific concept drift refers to situations where one group experiences concept drift over time, while another does not, leading to a decrease in fairness even if accuracy (ACC) remains fairly stable. Within the framework of federated learning (FL), where clients collaboratively train models, its distributed nature further amplifies these challenges since each client can experience group-specific concept drift independently while still sharing the same underlying concept, creating a complex and dynamic environment for maintaining fairness. The most significant contribution of our research is the formalization and introduction of the problem of group-specific concept drift and its distributed counterpart, shedding light on its critical importance in the field of fairness. In addition, leveraging insights from prior research, we adapt an existing distributed concept drift adaptation algorithm to tackle group-specific distributed concept drift, which uses a multimodel approach, a local group-specific drift detection mechanism, and continuous clustering of models over time. The findings from our experiments highlight the importance of addressing group-specific concept drift and its distributed counterpart to advance fairness in machine learning.

Abstract
Today, logistics activities are driven by the pressing need to simultaneously increase efficiency, reduce costs, and promote sustainability. In our research, we tackle this challenge by adapting a general vehicle routing problem with deliveries and pickups to accommodate different types of customers. Customers requiring both delivery and pickup services are mandatory, while those needing only a pickup service (backhaul customers) are optional and are only visited if profitable. A mixed-integer linear programming model is formulated to minimize fuel consumption. This model can address various scenarios, such as allowing mandatory customers to be served with combined or separate delivery or pickup visits, and visiting optional customers either during or only after mandatory customer visits. An adaptive large neighborhood search is developed to solve instances adapted from the literature as well as to solve a real-case study of a beverage distributor. The results show the effectiveness of our approach, demonstrating the potential to utilize the available capacity on vehicles returning to the depot to create profitable and environmentally friendly routes, and so enhancing efficient, cost-effective, and sustainable logistics activities.

Abstract
This paper explores a Cycle-GAN architecture based on diffusion models for translating cardiac CT images with and without contrast, aiming to enhance the quality and accuracy of medical imaging. The combination of GANs and diffusion models has demonstrated promising results, particularly in generating high-quality, visually similar contrast-enhanced cardiac images. This effectiveness is evidenced by metrics such as a PSNR of 32.85, an SSIM of 0.766, and an FID of 42.348, highlighting the model's capability for accurate and detailed image generation. Although these results indicate substantial potential for improving diagnostic accuracy, challenges remain, particularly concerning the generation of image artefacts and brightness inconsistencies, which could affect the clinical validation of these images. These issues have important implications for the reliability of the images in real medical diagnoses. The results of this study suggest that future research should focus on optimizing these aspects, improving the handling of artefacts, and investigating alternative architectures further to enhance the quality and reliability of the generated images, ensuring their applicability in clinical settings

Abstract
The gold standard real-time core temperature (CT) monitoring methods are invasive and cost-inefficient. The application of the Kalman filter for an indirect estimation of CT has been explored in the literature for more than 10 years. This paper presents a comparative study between different state-of-the-art Extended Kalman Filter (EKF) approaches. Moreover, we proposed the addition of an extra layer to the pipeline that applies a pre-emptive mapping concept based on the physiological response of the heart rate (HR) signal, before using it as input to the EKF. The algorithm was trained and tested using two datasets (18 subjects). The best-performing approach with the novel pre-emptive mapping achieved an average Root Mean Squared Error (RMSE) of 0.34 ^?C, while without pre-emptive mapping, it resulted in an RMSE of 0.41 ^?C, leading to a performance improvement of 17%. Given these favorable outcomes, it is compelling to assess the efficacy of this method on a larger dataset in the future.

Abstract
Identifying influential spreaders in temporal networks is crucial for understanding and controlling the dynamics of spreading. However, existing methods, such as temporal betweenness, closeness, pagerank, degree, and local path-based centrality, face several limitations, including high computational complexity, reliance on shortest paths, convergence issues, inability to capture influence dynamics with insufficient neighboring nodes, and a primary focus on local structural information. This paper presents PathSAGE, a novel method that addresses these problems. It integrates GraphSAGE, a deep learning model, to capture global node information while incorporating temporal local path counts as a key feature. Unlike other global feature-capturing methods, PathSAGE optimises computational complexity. Experimental results on thirteen real-world temporal networks demonstrate that PathSAGE outperforms the state-of-the-art methods in accurately identifying influential spreaders. PathSAGE exhibits a strong correlation with the Temporal Susceptible-Infected-Recovered (TSIR) model and achieves a relative improvement percentage (eta%) ranging from 0.12% to 70.70%. Additionally, PathSAGE attains the lowest average robustness value of 0.17, highlighting its effectiveness in identifying influential spreaders within temporal networks.