Abstract
There are Optimization Problems that are too complex to be solved efficiently by deterministic methods. For these problems, where deterministic methods have proven to be inefficient, if not completely unusable, it is common to use approximate methods, that is, optimization methods that solve the problems quickly, regardless of their size or complexity, even if they do not guarantee optimal solutions. In other words, methods that find acceptable solutions, efficiently. One particular type of approximate method, which is particularly effective in complex problems, are metaheuristics. Particle Swarm Optimization is a population-based metaheuristic, which has been particularly successful. In order to broaden the application and overcome the limitation of Particle Swarm Optimization, a discrete version of the metaheuristics is proposed. The Discrete Particle Swarm Optimization, DPSO, will change the PSO algorithm so it can be applied to discrete optimization problems. This alteration will focus on the velocity update equation. The DPSO was tested in an instance of the Traveling Salesman Problem, att48, 48 points problems proposed by Padberg and Rinaldi, which showed some promising results.

Abstract
We propose a new approach for the lastmile delivery problem where, besides serving as collecting points of orders for customers, parcel lockers are also used as transshipment nodes in a 2-echelon delivery system. Moreover, we consider that a customer (occasional courier) visiting a locker may accept a compensation to make a delivery to another customer on their regular traveling path. The proposed shared use of the locker facilities - by customers that prefer to self-pick up their orders, and also as a transfer deposit for customers that prefer home delivery - will contribute to better usage of an already available storage capacity. Furthermore, the use of occasional couriers (OCs) brings an extra layer of flexibility to the delivery process and may positively contribute to achieving some environmental goals: although non-consolidation of deliveries may, at first sight, seem negative, by only considering OCs that would go to the locker independently of making or not a delivery on their way home, and their selection being constrained by a maximum detour, the carbon footprint can be potentially reduced when compared to that of dedicated vehicles. We present a mixed-integer linear programming formulation for the problem that integrates three delivery options - depot to locker, depot to locker followed by final delivery by a professional fleet, and depot to locker followed by final delivery by an OC. Furthermore, to assess the impact of OCs' no show on the delivery process, we extend the formulation to re-schedule the delivery of previous undelivered parcels, and analyze the impact of different no-show rates. Thorough computational experiments show that the use of OCs has a positive impact both on the delivery cost and on the total distance traveled by the dedicated fleets. Experiments also show that the negative impact of no-shows may be reduced by using lockers with higher capacities.

Abstract
Container orchestration tools supporting infrastructure-as-code allow new forms of collaboration between developers and operatives. Still, their text-based nature permits naive mistakes and is more difficult to read as complexity increases. We can find few examples of low-code approaches for defining the orchestration of containers, and there seems to be a lack of empirical studies showing the benefits and limitations of such approaches. We hypothesize that a complete visual notation for Docker-based orchestrations could reduce the effort, the error rate, and the development time. Therefore, we developed a tool featuring such a visual notation for Docker Compose configurations, and we empirically evaluated it in a controlled experiment with novice developers. The results show a significant reduction in development time and error-proneness when defining Docker Compose files, supporting our hypothesis. The participants also thought the prototype easier to use and useful, and wanted to use it in the future.

Abstract
X-ray bone semantic segmentation is one crucial task in medical imaging. Due to deep learning's emergence, it was possible to build high-precision models. However, these models require a large quantity of annotated data. Furthermore, semantic segmentation requires pixel-wise labeling, thus being a highly time-consuming task. In the case of hip joints, there is still a need for increased anatomic knowledge due to the intrinsic nature of the femur and acetabulum. Active learning aims to maximize the model's performance with the least possible amount of data. In this work, we propose and compare the use of different queries, including uncertainty and diversity-based queries. Our results show that the proposed methods permit state-of-the-art performance using only 81.02% of the data, with O(1) time complexity.

Abstract

Abstract
Imbalanced domain learning aims to produce accurate models in predicting instances that, though underrepresented, are of utmost importance for the domain. Research in this field has been mainly focused on classification tasks. Comparatively, the number of studies carried out in the context of regression tasks is negligible. One of the main reasons for this is the lack of loss functions capable of focusing on minimizing the errors of extreme (rare) values. Recently, an evaluation metric was introduced: Squared Error Relevance Area (SERA). This metric posits a bigger emphasis on the errors committed at extreme values while also accounting for the performance in the overall target variable domain, thus preventing severe bias. However, its effectiveness as an optimization metric is unknown. In this paper, our goal is to study the impacts of using SERA as an optimization criterion in imbalanced regression tasks. Using gradient boosting algorithms as proof of concept, we perform an experimental study with 36 data sets of different domains and sizes. Results show that models that used SERA as an objective function are practically better than the models produced by their respective standard boosting algorithms at the prediction of extreme values. This confirms that SERA can be embedded as a loss function into optimization-based learning algorithms for imbalanced regression scenarios.