Abstract
The increasing number of connected and autonomous vehicles generates an even greater demand for efficient content delivery in vehicular networks. Estimating the popularity of content is an important task to proactively cache and distribute content throughout the networks to add value to users' experiences and reduce network congestion. This paper presents a novel approach for predicting popular content on vehicular networks based on a Federated Learning-Adversarial Autoencoder model and anonymised data. Unlike prior works that relied on users' raw features, our model protects user privacy through data anonymisation. This allows us to learn from the hidden patterns of content popularity and deliver popular content without compromising user privacy. Experiments showed that our approach exceeded traditional collaborative filtering and deep learning methods in terms of accuracy and robustness, even with sparse data.

Abstract
Nowadays, eXtended Reality (XR) has matured to the point where it seamlessly integrates various input and output modalities, enhancing the way users interact with digital environments. From traditional controllers and hand tracking to voice commands, eye tracking, and even biometric sensors, XR systems now offer more natural interactions. Similarly, output modalities have expanded beyond visual displays to include haptic feedback, spatial audio, and others, enriching the overall user experience. In this vein, as the field of XR becomes increasingly multimodal, the education process must also evolve to reflect these advancements. There is a growing need to incorporate additional modalities into the curriculum, helping students understand their relevance and practical applications. By exposing students to a diverse range of interaction techniques, they can better assess which modalities are most suitable for different contexts, enabling them to design more effective and human-centered solutions. This work describes an Advanced Human-Machine Interaction (HMI) course aimed at Doctoral Students in Computer Science. The primary objective is to provide students with the necessary knowledge in HMI by enabling them to articulate the fundamental concepts of the field, recognize and analyze the role of human factors, identify modern interaction methods and technologies, apply HCD principles to interactive system design and development, and implement appropriate methods for assessing interaction experiences across advanced HMI topics. In this vein, the course structure, the range of topics covered, assessment strategies, as well as the hardware and infrastructure employed are presented. Additionally, it highlights mini-projects, including flexibility for students to integrate their projects, fostering personalized and project-driven learning. The discussion reflects on the challenges inherent in keeping pace with this rapidly evolving field and emphasizes the importance of adapting to emerging trends. Finally, the paper outlines future directions and potential enhancements for the course.

Abstract
The growing reliance on e-commerce and the demand for efficient intralogistics operations have increased the need for automation, while labour shortages continue to pose significant challenges. When combined with the inherent risks of forklift operation, this circumstance prompted businesses to look for robotic solutions for intralogistics tasks. However, robots are still limited when they come across situations that are outside of their programming scope and often need assistance from humans. To achieve the long-term goal of enhancing intralogistics operation, we propose the development of a virtual reality-based teleoperation system that allows remote operation of robot forklifts with minimal latency. Considering the specificities of the teleoperation process and network dynamics, we conduct detailed modelling to analyse latency factors, optimise system performance, and ensure a seamless user experience. Experimental results on a mobile robot have shown that the proposed teleoperation system achieves an average glass-to-glass latency of 368 ms, with capturing latency contributing to approximately 60% of the total delay. The results also indicate that network oscillations significantly impact image quality and user experience, emphasising the importance of a stable network infrastructure.

Abstract
This study investigates the effectiveness of different hyperparameter tuning strategies for peer-to-peer risk management. Ensemble learning techniques have shown superior performance in this field compared to individual classifiers and traditional statistical methods. However, model performance is influenced not only by the choice of algorithm but also by hyperparameter tuning, which impacts both predictive accuracy and computational efficiency. This research compares the performance and efficiency of three widely used hyperparameter tuning methods, Grid Search, Random Search, and Optuna, across XGBoost, LightGBM, and Logistic Regression models. The analysis uses the Lending Club dataset, spanning from 2007 Q1 to 2020 Q3, with comprehensive data preprocessing to address missing values, class imbalance, and feature engineering. Model explainability is assessed through feature importance analysis to identify key drivers of default probability. The findings reveal comparable predictive performance among the tuning methods, evaluated using metrics such as G-mean, sensitivity, and specificity. However, Optuna significantly outperforms the others in computational efficiency; for instance, it is 10.7 times faster than Grid Search for XGBoost and 40.5 times faster for LightGBM. Additionally, variations in feature importance rankings across tuning methods influence model interpretability and the prioritization of risk factors. These insights underscore the importance of selecting appropriate hyperparameter tuning strategies to optimize both performance and explainability in peer-to-peer risk management models.

Abstract
This paper presents a semantic characterization of leakage-freeness through timing side-channels for Jasmin programs. Our characterization covers probabilistic Jasmin programs that are not constant-time. In addition, we provide a characterization in terms of probabilistic relational Hoare logic and prove the equivalence between both definitions. We also prove that our new characterizations are compositional and relate our new definitions to existing ones from prior work, which could only be applied to deterministic programs. To provide practical evidence, we use the Jasmin framework to develop a rejection sampling algorithm and provide an EasyCrypt proof that ensures the algorithm's implementation is leakage-free while not being constant-time.

Abstract