Abstract
These are the short papers proceedings of the 3rd Symposium of Applied Science for Young Researchers – SASYR. This scientific event welcomed works by junior researchers on any research topic covered by the following three research centers: ADiT-lab (from IPVC, Instituto Politécnico de Viana do Castelo), 2Ai (from IPCA, Instituto Politécnico do Cávado e do Ave) and CeDRI (from IPB, Instituto Politécnico de Bragança). The main objective of SASYR is to provide a friendly and relaxed environment for young researchers to present their work, discuss recent results, and develop new ideas. In this way, this event offered an opportunity for the ADiT-lab, 2Ai, and CeDRI research communities to gather synergies and promote collaborations, thus improving the quality of their research. The SASYR 2023 took place at Instituto Politécnico do Cávado e do Ave, Barcelos, Portugal, on the 11th of July, 2023.

Abstract
Several research works have applied Reinforcement Learning (RL) algorithms to solve the Rate Adaptation (RA) problem in Wi-Fi networks. The dynamic nature of the radio link requires the algorithms to be responsive to changes in link quality. Delays in the execution of the algorithm due to implementional details may be detrimental to its performance, which in turn may decrease network performance. These delays can be avoided to a certain extent. However, this aspect has been overlooked in the state of the art when using simulated environments, since the computational delays are not considered. In this paper, we present an analysis of computational delays and their impact on the performance of RL-based RA algorithms, and propose a methodology to incorporate the experimental computational delays of the algorithms from running in a specific target hardware, in a simulation environment. Our simulation results considering the real computational delays showed that these delays do, in fact, degrade the algorithm’s execution and training capabilities which, in the end, has a negative impact on network performance. © ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2024.

Abstract
With the growing connectivity demands, Unmanned Aerial Vehicles (UAVs) have emerged as a prominent component in the deployment of Next Generation On-demand Wireless Networks. However, current UAV positioning solutions typically neglect the impact of Rate Adaptation (RA) algorithms or simplify its effect by considering ideal and non-implementable RA algorithms. This work proposes the Rate Adaptation aware RL-based Flying Gateway Positioning (RARL) algorithm, a positioning method for Flying Gateways that applies Deep Q-Learning, accounting for the dynamic data rate imposed by the underlying RA algorithm. The RARL algorithm aims to maximize the throughput of the flying wireless links serving one or more Flying Access Points, which in turn serve ground terminals. The performance evaluation of the RARL algorithm demonstrates that it is capable of taking into account the effect of the underlying RA algorithm and achieve the maximum throughput in all analysed static and mobile scenarios. © ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2024.

Abstract
The increasing complexity of recent Wi-Fi amendments is making the use of traditional algorithms and heuristics unfeasible to address the Rate Adaptation (RA) problem. This is due to the large combination of configuration parameters along with the high variability of the wireless channel. Recently, several works have proposed the usage of Reinforcement Learning (RL) techniques to address the problem. However, the proposed solutions lack sufficient technical explanation. Also, the lack of standard frameworks enabling the reproducibility of results and the limited availability of source code, makes the fair comparison with state of the art approaches a challenge. This paper proposes a framework, named RateRL, that integrates state of the art libraries with the well-known Network Simulator 3 (ns-3) to enable the implementation and evaluation of RL-based RA algorithms. To the best of our knowledge, RateRL is the first tool available to assist researchers during the implementation, validation and evaluation phases of RL-based RA algorithms and enable the fair comparison between competing algorithms.

Abstract
Future telecommunications aim to be ubiquitous and efficient, as widely deployed connectivity will allow for a variety of edge/fog based services. Challenges are numerous, e.g., spectrum overuse, energy efficiency, latency and bandwidth, battery life and computing power of edge devices. Addressing these challenges is key to compose the backbone for the future Internet-of-Things (IoT). Among IoT applications are Indoor Positioning System and indoor Real-Time-Location-Systems systems, which are needed where GPS is unviable. The Bluetooth Low Energy (BLE) 5.1 specification introduced Direction Finding to the protocol, allowing for BLE devices with antenna arrays to derive the Angle-of-Arrival (AoA) of transmissions. Well known algorithms for AoA calculation are computationally demanding, so recent works have addressed this, since the low-cost of BLE devices may provide efficient solutions for indoor localization. In this paper, we present a system topology and algorithms for self-localization where a receiver with an antenna array utilizes the AoAs from fixed battery powered beacons to self-localize, without a centralized system or wall-power infrastructure. We conduct two main experiments using a BLE receiver of our own design. Firstly, we validate the expected behaviour in an anechoic chamber, computing the AoA with an RMSE of 10.7 degrees conduct a test in an outdoor area of 12 by 12 meters using four beacons, and present pre-processing steps prior to computing the AoAs, followed by position estimations achieving a mean absolute error of 3.6 m for 21 map positions, with a minimum as low as 1.1 m.

Abstract
The C/C++ compilation stack (Intermediate Representations (IRs), compilation passes and backends) is encumbered by a steep learning curve, which we believe can be lowered by complementing it with approaches such as source-to-source compilation. Source-to-source compilation is a technology that is widely used and quite mature in certain programming environments, such as JavaScript, but that faces a low adoption rate in others. In the particular case of C and C++ some of the identified factors include the high complexity of the languages, increased difficulty in building and maintaining C/C++ parsers, or limitations on using source code as an intermediate representation. Additionally, new technologies such as Multi-Level Intermediate Representation (MLIR) have appeared as potential competitors to source-to-source compilers at this level. In this paper, we present what we have identified as current challenges of source-to-source compilation of C and C++, as well as what we consider to be opportunities and possible directions forward. We also present several examples, implemented on top of the Clava source-to-source compiler, that use some of these ideas and techniques to raise the abstraction level of compiler research on complex compiled languages such as C or C++. The examples include automatic parallelization of for loops, high-level synthesis optimisation, hardware/software partitioning with run-time decisions, and automatic insertion of inline assembly for fast prototyping of custom instructions. © João Bispo, Nuno Paulino, and Luís Miguel Sousa.