Cookies Policy
The website need some cookies and similar means to function. If you permit us, we will use those means to collect data on your visits for aggregated statistics to improve our service. Find out More
Accept Reject
  • Menu
Publications

2025

Mind the gap: The missing features of the tools to support user studies in software engineering

Authors
Costa, L; Barbosa, S; Cunha, J;

Publication
JOURNAL OF COMPUTER LANGUAGES

Abstract
User studies are paramount for advancing research in software engineering, particularly when evaluating tools and techniques involving programmers. However, researchers face several barriers when performing them despite the existence of supporting tools. We base our study on a set of tools and researcher-reported barriers identified in prior work on user studies in software engineering. In this work, we study how existing tools and their features cope with previously identified barriers. Moreover, we propose new features for the barriers that lack support. We validated our proposal with 102 researchers, achieving statistically significant positive support for all but one feature. We study the current gap between tools and barriers, using features as the bridge. We show there is a significant lack of support for several barriers, as some have no single tool to support them.

2025

A MILP Approach to Optimising Energy Storage in a Commercial Building

Authors
Tomás Barosa Santos; Filipe Tadeu Oliveira; Hermano Bernardo;

Publication
RE&PQJ

Abstract
To achieve carbon neutrality by 2050, commercial buildings have installed photovoltaic systems to reduce carbon emissions and operational costs. Nevertheless, PV generation does not always match the building’s energy demand profile, therefore storage systems are needed to store excess energy and supply it when necessary. This paper presents a Mixed Integer Linear Programming optimisation algorithm designed to schedule the operation of the electric storage system, aiming to minimise the building’s energy-related costs. An annual hourly simulation of the optimised system was performed to assess the cost reduction. To prevent excessive operation of the electric storage system, an approach to penalise low energy charging was studied, with results showing a significant increase in the system’s lifespan.

2025

A three-phase algorithm for the three-dimensional loading vehicle routing problem with split pickups and time windows

Authors
Leloup, E; Paquay, C; Pironet, T; Oliveira, JF;

Publication
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH

Abstract
In a survey of Belgian logistics service providers, the efficiency of first-mile pickup operations was identified as a key area for improvement, given the increasing number of returns in e-commerce, which has a significant impact on traffic congestion, carbon emissions, energy consumption and operational costs. However, the complexity of first-mile pickup operations, resulting from the small number of parcels to be collected at each pickup location, customer time windows, and the need to efficiently accommodate the highly heterogeneous cargo inside the vans, has hindered the development of real-world solution approaches. This article tackles this operational problem as a vehicle routing problem with time windows, time-dependent travel durations, and split pickups and integrates practical 3D container loading constraints such as vertical and horizontal stability as well as amore realistic reachability constraint to replace the classical Last In First Out (LIFO) constraint. To solve it, we propose a three-phase heuristic based on a savings constructive heuristic, an extreme point concept for the loading aspect and a General Variable Neighborhood Search as an improvement phase for both routing and packing. Numerical experiments are conducted to assess the performance of the algorithm on benchmark instances and new instances are tested to validate the positive managerial impacts oncost when allowing split pickups and on driver working duration when extending customer time windows. In addition, we show the impacts of considering the reachability constraint oncost and of the variation of speed during peak hours on schedule feasibility.

2025

Revisiting the Security and Privacy of FIDO2

Authors
Barbosa, M; Boldyreva, A; Chen, S; Cheng, K; Esquível, L;

Publication
IACR Cryptol. ePrint Arch.

Abstract

2025

Improving LIBS-based mineral identification with Raman imaging and spectral knowledge distillation

Authors
Lopes, T; Cavaco, R; Capela, D; Dias, F; Teixeira, J; Monteiro, CS; Lima, A; Guimaraes, D; Jorge, PAS; Silva, NA;

Publication
TALANTA

Abstract
Combining data from different sensing modalities has been a promising research topic for building better and more reliable data-driven models. In particular, it is known that multimodal spectral imaging can improve the analytical capabilities of standalone spectroscopy techniques through fusion, hyphenation, or knowledge distillation techniques. In this manuscript, we focus on the latter, exploring how one can increase the performance of a Laser-induced Breakdown Spectroscopy system for mineral classification problems using additional spectral imaging techniques. Specifically, focusing on a scenario where Raman spectroscopy delivers accurate mineral classification performance, we show how to deploy a knowledge distillation pipeline where Raman spectroscopy may act as an autonomous supervisor for LIBS. For a case study concerning a challenging Li-bearing mineral identification of spodumene and petalite, our results demonstrate the advantages of this method in improving the performance of a single-technique system. LIBS trained with labels obtained by Raman presents an enhanced classification performance. Furthermore, leveraging the interpretability of the model deployed, the workflow opens opportunities for the deployment of assisted feature discovery pipelines, which may impact future academic and industrial applications.

2025

NoIC: PAKE from KEM without Ideal Ciphers

Authors
Arriaga, A; Barbosa, M; Jarecki, S;

Publication
IACR Cryptol. ePrint Arch.

Abstract

  • 4
  • 4212