2025
Authors
Teixeira, C; Gomes, I; Cunha, L; Soares, C; van Rijn, N;
Publication
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Abstract
As machine learning technologies are increasingly adopted, the demand for responsible AI practices to ensure transparency and accountability grows. To better understand the decision-making processes of machine learning models, GASTeN was developed to generate realistic yet ambiguous synthetic data near a classifier’s decision boundary. However, the results were inconsistent, with few images in the low-confidence region and noise. Therefore, we propose a new GASTeN version with a modified architecture and a novel loss function. This new loss function incorporates a multi-objective measure with a Gaussian loss centered on the classifier probability, targeting the decision boundary. Our study found that while the original GASTeN architecture yields the highest Fréchet Inception Distance (FID) scores, the updated version achieves lower Average Confusion Distance (ACD) values and consistent performance across low-confidence regions. Both architectures produce realistic and ambiguous images, but the updated one is more reliable, with no instances of GAN mode collapse. Additionally, the introduction of the Gaussian loss enhanced this architecture by allowing for adjustable tolerance in image generation around the decision boundary. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.
2025
Authors
Urjais Gomes, R; Soares, C; Reis, LP;
Publication
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Abstract
DeepAR is a popular probabilistic time series forecasting algorithm. According to the authors, DeepAR is particularly suitable to build global models using hundreds of related time series. For this reason, it is a common expectation that DeepAR obtains poor results in univariate forecasting [10]. However, there are no empirical studies that clearly support this. Here, we compare the performance of DeepAR with standard forecasting models to assess its performance regarding 1 step-ahead forecasts. We use 100 time series from the M4 competition to compare univariate DeepAR with univariate LSTM and SARIMAX models, both for point and quantile forecasts. Results show that DeepAR obtains good results, which contradicts common perception. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.
2025
Authors
Castro, JT; Pinheiro, I; Marques, MN; Moura, P; dos Santos, FN;
Publication
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Abstract
In nature, and particularly in agriculture, pollination is fundamental for the sustainability of our society. In this context, pollination is a vital process underlying crop yield quality and is responsible for the biodiversity and the standards of the flora. Bees play a crucial role in natural pollination; however, their populations are declining. Robots can help maintain pollination levels while humans work to recover bee populations. Swarm robotics approaches appear promising for robotic pollination. This paper proposes the cooperation between multiple Unmanned Aerial Vehicles (UAVs) and an Unmanned Ground Vehicle (UGV), leveraging the advantages of collaborative work for pollination, referred to as Pollinationbots. Pollinationbots is based in swarm behaviors and methodologies to implement more effective pollination strategies, ensuring efficient pollination across various scenarios. The paper presents the architecture of the Pollinationbots system, which was evaluated using the Webots simulator, focusing on path planning and follower behavior. Preliminary simulation results indicate that this is a viable solution for robotic pollination. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.
2025
Authors
Homayouni, SM; Fontes, DBMM;
Publication
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH
Abstract
This paper addresses a job shop scheduling problem with peak power constraints, in which jobs can be processed once or multiple times on either all or a subset of the machines. The latter characteristic provides additional flexibility, nowadays present in many manufacturing systems. The problem is complicated by the need to determine both the operation sequence and starting time as well as the speed at which machines process each operation. Due to the adherence to renewable energy production and its intermittent nature, manufacturing companies need to adopt power-flexible production schedules. The proposed power control strategies, that is, adjusting processing speed and timing to reduce peak power requirements may impact production time (makespan) and energy consumption. Therefore, we propose a bi-objective approach that minimizes both objectives. A linear programming model is developed to provide a formal statement of the problem, which is solved to optimality for small-sized instances. We also proposed a multi-objective biased random key genetic algorithm framework that evolves several populations in parallel. Computational experiments provide decision and policymakers with insights into the implications of imposing or negotiating power consumption limits. Finally, the several trade-off solutions obtained show that as the power limit is lowered, the makespan increases at an increasing rate and a similar trend is observed in energy consumption but only for very small makespan values. Furthermore, peak power demand reductions of about 25% have a limited impact on the minimum makespan value (4-6% increase), while at the same time allowing for a small reduction in energy consumption.
2025
Authors
dos Santos, SS; Mendes, P; Pastoriza Santos, I; Juste, J; de Almeida, MMM; Coelho, CC;
Publication
Sensors and Actuators B: Chemical
Abstract
The lower refractive index sensitivity (RIS) of plasmonic nanoparticles (NP) in comparison to their plasmonic thin films counterparts hindered their wide adoption for wavelength-based sensor designs, wasting the NP characteristic field locality. In this context, high aspect-ratio colloidal core-shell Ag@Au nanorods (NRs) are demonstrated to operate effectively at telecommunication wavelengths, showing RIS of 1720 nm/RIU at 1350 nm (O-band) and 2325 nm/RIU at 1550 nm (L-band), representing a five-fold improvement compared to similar Au NRs operating at equivalent wavelengths. Also, these NRs combine the superior optical performance of Ag with the Au chemical stability and biocompatibility. Next, using a side-polished optical fiber, we detected glyphosate, achieving a detection limit improvement from 724 to 85 mg/L by shifting from the O to the C/L optical bands. This work combines the significant scalability and cost-effective advantages of colloidal NPs with enhanced RIS, showing a promising approach suitable for both point-of-care and long-range sensing applications at superior performance than comparable thin film-based sensors in either environmental monitoring and other fields. © 2024 The Authors
2025
Authors
Almeida, PS;
Publication
ACM COMPUTING SURVEYS
Abstract
Conflict-free Replicated Data Types (CRDTs) allow optimistic replication in a principled way. Different replicas can proceed independently, being available even under network partitions and always converging deterministically: Replicas that have received the same updates will have equivalent state, even if received in different orders. After a historical tour of the evolution from sequential data types to CRDTs, we present in detail the two main approaches to CRDTs, operation-based and state-based, including two important variations, the pure operation-based and the delta-state based. Intended for prospective CRDT researchers and designers, this article provides solid coverage of the essential concepts, clarifying some misconceptions that frequently occur, but also presents some novel insights gained from considerable experience in designing both specific CRDTs and approaches to CRDTs.
The access to the final selection minute is only available to applicants.
Please check the confirmation e-mail of your application to obtain the access code.