Abstract

Abstract
This study investigates the impact of class imbalance and its potential interplay with other factors on machine learning models for transportation mode classification, utilising two real-world GPS trajectory datasets. A Random Forest model serves as the baseline, demonstrating strong performance on the relatively balanced dataset but experiencing significant degradation on the imbalanced one. To mitigate this effect, we explore various state-of-the-art class imbalance learning techniques, finding only marginal improvements. Resampling the fairly balanced dataset to replicate the imbalanced distribution suggests that factors beyond class imbalance are at play. We hypothesise and provide preliminary evidence for class overlap as a potential contributing factor, underscoring the need for further investigation into the broader range of classification difficulty factors. Our findings highlight the importance of balanced class distributions and a deeper understanding of factors such as class overlap in developing robust and generalisable models for transportation mode detection.

Abstract
Due to space and energy restrictions, lightweight autonomous underwater vehicles (AUVs) are usually fitted with low-power processing units, which limits the ability to run demanding applications in real time during the mission. However, several robotic perception tasks reveal a parallel nature, where the same processing routine is applied for multiple independent inputs. In such cases, leveraging parallel execution by offloading tasks to a GPU can greatly enhance processing speed. This article presents a collection of generic matrix manipulation kernels, which can be combined to develop parallelized perception applications. Taking advantage of those building blocks, we report a parallel implementation for the 3DupIC algorithm-a probabilistic scan matching method for sonar scan registration. Tests demonstrate the algorithm's real-time performance, enabling 3D sonar scan matching to be executed in real time onboard the EVA AUV.

Abstract
This article aims to explore menopausal women's views on empowerment in menopause-related femvertising on social media and to examine its outcomes for both women and brands. It includes a qualitative study comprising in-depth interviews with menopausal women who were active social media users (n = 15). The data were subject to content analysis using NVIVO software. The results reveal that menopause empowerment strategies on social media are perceived by women as a source of knowledge, facilitating social support, focusing on self-worth enhancement, and deconstructing stereotypes and taboos. Despite positive impacts such as self-esteem and self-confidence, these messages can also induce discomfort and feelings of segregation. Although the study highlights potential benefits for brands, including improved image and engagement, it also identifies risks such as skepticism, distrust, and customer loss. This research contributes to the femvertising and branding literature by addressing the largely overlooked segment of menopausal women. It highlights knowledge dissemination as a critical and previously underexplored dimension of femvertising and demonstrates that menopause empowerment carries distinct dynamics and consequences for both women and advertising brands, shedding light on the complexity of femvertising strategies. The findings can assist brands and social organizations aiming to develop more effective strategies for engaging menopausal audiences.

Abstract

Abstract
This paper addresses the problem of maximizing the expected size of a matching in the case of unreliable vertices and/or edges. The assumption is that the solution is built in several steps. In a given step, edges with successfully matched vertices are made permanent; but upon edge or vertex failures, the remaining vertices become eligible for reassignment. This process may be repeated a given number of times, and the objective is to end with the overall maximum number of matched vertices. An application of this problem is found in kidney exchange programs, going on in several countries, where a vertex is an incompatible patient–donor pair and an edge indicates cross-compatibility between two pairs; the objective is to match these pairs so as to maximize the number of served patients. A new scheme is proposed for matching rearrangement in case of failure, along with a prototype algorithm for computing the optimal expectation for the number of matched edges (or vertices), considering a possibly limited number of rearrangements. Computational experiments reveal the relevance and limitations of the algorithm, in general terms and for the kidney exchange application. © 2025 The Authors