Abstract
Nowadays, Automated Guides Vehicles and Autonomous Mobile Robots are equipped with electromagnetic or optical automatic guiding devices and can navigate, interact, perform path planning and avoid obstacles. It is crucial to develop applications to support the teaching by real and/or simulated robots. In this paper the authors propose a simulation of an AGV system, that uses localization based on mounted cameras for positioning and control by a central system. Also, a real robot prototype is proposed. The mobile robot should reach the destination point precisely and kept inside the desired margins, avoiding collisions. The presented results show the developed system in operation. © 2023, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

Abstract
Reconhecendo as discussões em andamento no movimento da Economia Popular Solidáriano Brasil e tomando como base a pesquisa desenvolvida com a Rede de padariascomunitárias Fermento na Massa, este artigo conta sobre o retorno das atividades da Redepós Covid-19, a aproximação das pesquisadoras com a Rede e a troca que fizemos entreconhecimentos de design gráfico das pesquisadoras e as experiências como trabalhadorasda Economia Solidária. A partir disso buscamos discutir as relações entre a prática do designe a Economia Solidária, dialogando com os conceitos de design participativo e autogestãona prática da Economia Solidária buscamos refletir sobre as possibilidades de uma práticade um design mais solidário, co-produzido e buscando maior autonomia das trabalhadorasnos processos de comunicação e venda.

Abstract
The scoping review reported by this article aimed to analyse how security and privacy mechanism are being integrated with Fast Health Interoperability Resources (FHIR). An electronic search was conducted, and 37 studies were included in the review. The results show that 19 studies (i.e., more than half of the included studies) reported on the use of blockchain technology to (i) assure secure data sharing, (ii) provide secure Personal Health Records, (iii) support authentication and auditing mechanisms, (iv) support smart legal contracts, and (v) monitor the access to clinical data. The remainder 18 articles reported on the implementation of security and privacy mechanisms related to (i) data security at transmission, (ii) data security at storage, (iii) access control; (iv) data anonymization, and (v) management of informed consents. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

Abstract
Gastric cancer (GC) is still a significant public health issue, among the most common and deadly cancers globally. The identification and characterization of precancerous lesions of the stomach using endoscopy are crucial for determining the risk of cancer and guiding appropriate surveillance. In this scenario, deep learning (DL)-based computer vision methods have the potential to help us classify and identify particular patterns in endoscopic images, leading to a more accurate classification of these types of lesions. The quantity and quality of the data used heavily influence the classification performance of DL networks. However, one of the major setbacks for developing high-performance DL classification models is the typical need for more available data in the medical field. This review explores the use of Generative Adversarial Networks (GANs) and classical data augmentation techniques for improving the classification of precancerous stomach lesions. GANs are DL models that have shown promising results in generating synthetic data, which can be used to augment limited medical datasets. This review discusses recent studies that have implemented GANs and classical data augmentation methods to improve the accuracy of cancerous lesion classification. The results indicate that GANs can effectively increase the dataset's size, enhance the classification models' performance. In specific applications, such as the augmentation of endoscopic images depicting gastrointestinal polyps and Barrett's esophagus Adenocarcinoma, our review reveals instances where GANs, including models like Deep Convolutional GANs and conditional GANs, outperform classical data augmentation methods. Furthermore, this review highlights the challenges and limitations of the recent works using GANs and classical data augmentation techniques in medical imaging analysis and proposes directions for future research.

Abstract
In industrial environments, the measurement and monitoring of filling levels (FL) in refilling stations (RS) are critical for quality control processes. Traditional methods used for this purpose, such as manual inspection and sensor-based techniques, have proven to be costly and time-consuming. As an alternative, this paper proposes a novel approach that leverages computer vision (CV) and advanced image processing techniques. This approach provides a more efficient and accurate method for monitoring filling levels in refilling stations, thereby reducing operational costs. The system operates through a comprehensive five-stage pipeline, including pre-processing, perspective transformation, thresholding and edge detection, post-processing and filling level calculation. The performance evaluation of this approach demonstrated promising results in accurately determining filling levels in most scenarios. However, we also identified challenges such as overlapping columns and occlusions in the camera’s field of view that require further improvements. By addressing these challenges, our research aims to develop a streamlined and automated method for filling level measurement in refilling stations, thereby enhancing productivity in industrial environments. Ultimately, this proposed approach holds potential to significantly improve the efficiency of refilling stations across multiple sectors. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

Abstract
A new algorithm based on the ant colony optimization (ACO) method for the multiple traveling salesman problem (mTSP) is presented and defined as ACO-BmTSP. This paper addresses the problem of solving the mTSP while considering several salesmen and keeping both the total travel cost at the minimum and the tours balanced. Eleven different problems with several variants were analyzed to validate the method. The 20 variants considered three to twenty salesmen regarding 11 to 783 cities. The results were compared with best-known solutions (BKSs) in the literature. Computational experiments showed that a total of eight final results were better than those of the BKSs, and the others were quite promising, showing that with few adaptations, it will be possible to obtain better results than those of the BKSs. Although the ACO metaheuristic does not guarantee that the best solution will be found, it is essential in problems with non-deterministic polynomial time complexity resolution or when used as an initial bound solution in an integer programming formulation. Computational experiments on a wide range of benchmark problems within an acceptable time limit showed that compared with four existing algorithms, the proposed algorithm presented better results for several problems than the other algorithms did.