Abstract
This paper is devoted to present the most recent results regarding the ongoing work carried out in the scope of the STC 4.0 HP project, which aims to automate the finishing process of ceramic tableware at the GRESTEL S.A. industry, focusing on non-circular shaped plates. A collaborative robot is in charge of handling the tableware and making it go around its entire perimeter through a sponge, to perform the finishing. An array, with the distances from the center to the different points of the plate, is applied as data to trace the path that the robot must follow. The final goal of this prototype is to obtain an even finish while maintaining a constant force along the entire perimeter of the ceramic tableware. After carrying out a series of tests, it was possible to conclude that the current approach was able to manipulate 3D-printed tableware made for testing and travel its perimeter to carry out the finishing.

Abstract
Innovation is a key driver to address the challenges of sustainability. To achieve this goal, the various entities participating in the innovation process must work together to ensure that research methodologies and results are aligned with the needs and expectations of society. Having a conceptual and practical approach that allows exploring and measuring how projects are fulfilling this expectation is key in this process. In this sense, this study aims to explore the relevance of this phenomenon for the development of innovation practices and to characterize and compare several responsible innovation assessment tools (RIATs) that can be used by research teams. A qualitative methodology is used to identify, map, and compare the characteristics of each RIAT. The main strengths and limitations of each approach are also explored. The findings reveal a total of 18 RIATs and 16 dimensions. The challenge is to get a harmonious balance between these various dimensions and to have this analysis performed in the early stages of each project. This study makes practical contributions by identifying areas that each project must assess and ensure for its innovation activities to be socially desirable and ethically acceptable. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2023.

Abstract
This paper addresses the joint scheduling of production operations, transport tasks, and storage/retrieval activities in flexible job shop systems where the production operations and transport tasks can be done by one of the several resources available. Jobs need to be retrieved from storage and delivered to a load/unload area, from there, they are transported to and between the machines where their operations are processed on. Once all operations of a job are processed, the job is taken back to the load/unload area and then returned to the storage cell. Therefore, the problem under study requires, concurrently, solving job routing, machine scheduling, transport allocation, vehicle scheduling, and shuttle schedule. To this end, we propose a hybrid biased random-key genetic algorithm (BRKGA) in which the mutation operator resorts to six local search heuristics. The computational experiments conducted on a set of benchmark instances show the effectiveness of the proposed mutation operator.

Abstract
In this work, we enhance the EasyCrypt proof assistant to reason about the computational complexity of adversaries. The key technical tool is a Hoare logic for reasoning about computational complexity (execution time and oracle calls) of adversarial computations. Our Hoare logic is built on top of the module system used by EasyCrypt for modeling adversaries. We prove that our logic is sound w.r.t. the semantics of EasyCrypt programs-we also provide full semantics for the EasyCrypt module system, which was lacking previously. We showcase (for the first time in EasyCrypt and in other computer-aided cryptographic tools) how our approach can express precise relationships between the probability of adversarial success and their execution time. In particular, we can quantify existentially over adversaries in a complexity class and express general composition statements in simulation-based frameworks. Moreover, such statements can be composed to derive standard concrete security bounds for cryptographic constructions whose security is proved in a modular way. As a main benefit of our approach, we revisit security proofs of some well-known cryptographic constructions and present a new formalization of universal composability.

Abstract

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.