Abstract
Recommender systems position themselves as powerful tools in the support of relevance and personalization, presenting remarkable potential in the area of marketing. The cold-start customer problematic presents a challenge within this topic, leading to the need of distinguishing user features and preferences based on a restricted set of transactional information. This paper proposes a hybrid recommender system that aims to leverage transactional and portfolio information as indicating characteristics of customer behaviour. Four independent systems are combined through a parallelised weighted hybrid design. The first individual system utilises the price, target age, and brand of each product to develop a content-based recommender system, identifying item similarities. Secondly, a keyword-based content system uses product titles and descriptions to identify related groups of items. The third system utilises transactional data, defining similarity between products based on purchasing patterns, categorised as a collaborative model. The fourth system distinguishes itself from the previous approaches by leveraging association rules, using transactional information to establish antecedent and precedence relationships between items through a market basket analysis. Two datasets were analysed: product portfolio and transactional datasets. The product portfolio had 17,118 unique products and the included 4,408,825 instances from 2 June 2021 until 2 June 2022. Although the collaborative system demonstrated the best evaluation metrics when comparing all systems individually, the hybridisation of the four systems surpassed each of the individual systems in performance, with a 8.9% hit rate, 6.6% portfolio coverage, and with closer targeting of customer preferences and smaller bias.

Abstract
The sharing of cyberthreat information within a community or group of entities is possible due to solutions such as the Malware Information Sharing Platform (MISP). However, the MISP was considered limited if its information was deemed as classified or shared only for a given period of time. A solution using searchable encryption techniques that better control the sharing of information was previously proposed by the same authors. This paper describes a prototype implementation for two key functionalities of the previous solution, considering multiple entities sharing information with each other: the symmetric key generation of a sharing group and the functionality to update a shared index. Moreover, these functionalities are evaluated regarding their performance, and enhancements are proposed to improve the performance of the implementation regarding its execution time. As the main result, the duration of the update process was shortened from around 2922 s to around 302 s, when considering a shared index with 100,000 elements. From the security analysis performed, the implementation can be considered secure, thus confirming the secrecy of the exchanged nonces. The limitations of the current implementation are depicted, and future work is pointed out.

Abstract
This study aims at solving a harvesting scheduling optimization problem with constraints on the clearcut area with additional constraints on clearcut proximity. The objective function is defined as the net present value generated by harvesting discounted by a penalty for each clearcut. This problem arises to reduce the negative environmental impact of excessive harvesting. We propose the connected-bucket model, the so-called bucket model with additional constraints on bucket connectivity and two definitions of stand adjacency, and a Dantzig-Wolfe decomposition. The decomposed model is solved by branch-and-price and the connected-bucket model by a general-purpose mixed integer programming solver (CPLEX). We compare the quality of the solutions obtained with both approaches for real instances. The branch-and-price approach found better solutions for the majority of the instances.

Abstract
Long-term operation of robots creates new challenges to Simultaneous Localization and Mapping (SLAM) algorithms. Long-term SLAM algorithms should adapt to recent changes while preserving older states, when dealing with appearance variations (lighting, daytime, weather, or seasonal) or environment reconfiguration. When also operating robots for long periods and trajectory lengths, the map should readjust to environment changes but not grow indefinitely. The map size should depend only on updating the map with new information of interest, not on the operation time or trajectory length. Although several studies in the literature review SLAM algorithms, none of the studies focus on the challenges associated to lifelong SLAM. Thus, this paper presents a systematic literature review on long-term localization and mapping following the Preferred Reporting Items for Systematic reviews and Meta-Analysis guidelines. The review analyzes 142 works covering appearance invariance, modeling the environment dynamics, map size management, multisession, and computational topics such as parallel computing and timing efficiency. The analysis also focus on the experimental data and evaluation metrics commonly used to assess long-term autonomy. Moreover, an overview over the bibliographic data of the 142 records provides analysis in terms of keywords and authorship co-occurrence to identify the terms more used in long-term SLAM and research networks between authors, respectively. Future studies can update this paper thanks to the systematic methodology presented in the review and the public GitHub repository with all the documentation and scripts used during the review process.

Abstract

Abstract