Abstract
Events like Valentine's Day and Christmas can influence user intent when interacting with search engines. For example, a user searching for gift around Valentine's Day is likely to be looking for Valentine's-themed options, whereas the same query close to Christmas would more likely suggest an interest in Holiday-themed gifts. These shifts in user intent, driven by temporal factors, are often implicit but important to determine the relevance of search results. In this demo, we explore how incorporating temporal awareness can enhance search relevance in an e-commerce setting. We constructed a database of 2K events and, using historical purchase data, developed a temporal model that estimates each event's importance on a specific date. The most relevant events on the date the query was issued are then used to enrich search results with event-specific items. Our demo illustrates how this approach enables a search system to better adapt to temporal nuances, ultimately delivering more contextually relevant products.

Abstract
Games with purposes beyond entertainment, the so-called serious games, have been useful tools in professional training, especially in engaging participants. However, their evaluation and, also, their adaptable characteristics to different scenarios, audiences and contexts remain challenges. This paper examines the application of serious games in professional training, their results and adaptable ways to achieve certain goals. Using the Design Science Research (DSR) methodology, a framework was built to develop and evaluate serious games to improve user experience, learning outcomes, knowledge transfer to work situations, and the application of the skills practised in the game in real professional settings. At this stage, the investigation presents a framework regarding the triangulation of data collected from a systematic literature review, focus groups and interviews. Following the DSR methodology, the next steps of this investigation, listed at the end of the paper, are the demonstration of the framework in serious game development and the evaluation and validation of this artefact.

Abstract
Text simplification converts complex text into simpler language, improving readability and comprehension. This study evaluates the effectiveness of open-source large language models for text simplification across various categories. We created a dataset of 66,620 lead section pairs from English and Simple English Wikipedia, spanning nine categories, and tested Llama 3 for text simplification. We assessed its output for readability, simplicity, and meaning preservation. Results show improved readability, with simplification varying by category. Texts on Time were the most shortened, while Leisurerelated texts had the greatest reduction of words/characters and syllables per sentence. Meaning preservation was most effective for the Objects and Education categories.

Abstract
This paper presents an interactive game designed to improve users' experience related to driving behaviour, as well as to provide decision support in this context. This paper explores machine learning (ML) methods to enhance the decision-making and automation in a gaming environment. It examines various ML strategies, including supervised, unsupervised, and Reinforcement Learning (RL), emphasizing RL's effectiveness in interactive environments and its combination with Deep Learning, culminating in Deep Reinforcement Learning (DRL) for intricate decision-making processes. By leveraging these concepts, a practical application considering a gaming scenario is presented, which replicates vehicle behaviour simulations from real-world driving scenarios. Ultimately, the objective of this research is to contribute to the ML and artificial intelligence (AI) fields by introducing methods that could transform the way player agents adapt and interact with the environment and other agents decisions, leading to more authentic and fluid gaming experiences. Additionally, by considering recreational and serious games as case studies, this work aims to demonstrate the versatility of these methods, providing a rich, dynamic environment for testing the adaptability and responsiveness, while can also offer a context for applying these advancements to simulate and solve real-world problems in the complex and dynamic domain of mobility.

Abstract
The presence of missing data poses a common challenge for time series analysis in general since the most usual requirement is that the data is equally spaced in time and therefore imputation methods are required. For time series of counts, the usual imputation methods which usually produce real valued observations, are not adequate. This work employs Bayesian principles for handling missing data within time series of counts, based on first-order integer-valued autoregressive (INAR) models, namely Approximate Bayesian Computation (ABC) and Gibbs sampler with Data Augmentation (GDA) algorithms. The methodologies are illustrated with synthetic and real data and the results indicate that the estimates are consistent and present less bias when the percentage of missing observations decreases, as expected. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

Abstract
We present an adequacy theorem for a concurrent extension of probabilistic GCL. The underlying denotational semantics is based on the so-called mixed powerdomains, which combine non-determinism with probabilistic behaviour. The theorem itself is formulated via M. Smyth's idea of treating observable properties as open sets of a topological space. The proof hinges on a 'topological generalisation' of Konig's lemma in the setting of probabilistic programming (a result that is proved in the paper as well). One application of the theorem is that it entails semi-decidability w.r.t. whether a concurrent program satisfies an observable property (written in a certain form). This is related to M. Escardo's conjecture about semi-decidability w.r.t. may and must probabilistic testing.