Abstract
The entrepreneurs responsible for establishing university spinoffs are incessantly looking for new ways to leverage existing technology or create an entirely new product or service market. The creation of disruptive innovative solutions has assumed a key role in enhancing the role of university spinoffs in the global marketplace. This study aims to characterize and explore the phenomenon of disruptive innovation in university spinoffs and identify how university spinoffs recognize and evaluate low-end and new-market disruptive technologies. The findings reveal that university spin-offs have essentially privileged new-market disruptive technologies. Participation in trade fairs, conferences and journals have been the main methods adopted by these organizations to identify disruptive technologies, while the evaluation of the potential of these disruptive technologies is essentially based on the experience and scientific knowledge of the founders of the university spin-offs. Furthermore, the size and number of years of activity of university spinoffs are two factors that allow us to understand the greater proximity of the younger and smaller spinoffs with universities and research centers, whereas the larger organizations prioritize mainly market analysis and product research techniques.

Abstract
This paper proposes an energy community management system for local energy sharing with grid flexibility services to solve the potential grid constraints of the local distribution network. A three-stage model is proposed. Stage 1 is the individual minimization of the energy bill of each prosumer by optimizing the schedules of its battery. The second stage optimizes the energy bill of the energy community by sharing internally the prosumers energy surplus and re-dispatching their batteries, while guaranteeing that each new individual prosumer energy bill is always equal or less than its stage 1 bill. The third stage is performed by the DSO to solve the grid constraints by re-dispatching the batteries, curtailing local generation or reducing consumption. Stage 3 minimizes the impact on stage 2 by minimizing the loss of profit or utility of every prosumer which is compensated accordingly.

Abstract
Even while the scientific community has shown great interest in the analysis of meta-heuristics, the analysis of their parameterization has received little attention. It is the parameterization that will adapt a meta-heuristic to a problem, but it is still performed, mostly, empirically. There are multiple parameterization techniques; however, they are time-consuming, requiring considerable computational effort and they do not take advantage of the meta-heuristics that they parameterize. In order to approach the parameterization of meta-heuristics, in this paper, a self-parameterization framework is proposed. It will automatize the parameterization as an optimization problem, precluding the user from spending too much time on parameterization. The model will automate the parameterization through two meta-heuristics: A meta-heuristic of the solution space and one of the parameter space. To analyze the performance of the framework, a self-parameterization prototype was implemented. The prototype was compared and analyzed in a SP (scheduling problem) and in the TSP (traveling salesman problem). In the SP, the prototype found better solutions than those of the manually parameterized meta-heuristics, although the differences were not statistically significant. In the TSP, the self-parameterization prototype was more effective than the manually parameterized meta-heuristics, this time with statistically significant differences.

Abstract
Facility Location Problems are widely studied problems in the literature with several practical applications, reaching areas such as telecommunications, design of a supply chain management, transport utilities and water distribution networks. In this paper, we address the Capacitated Facility Location Problems (CFLP), whose general goal is to determine where to locate a set of facilities to serve a particular set of customers with minimum cost. The CFLP problem has been widely studied for the past decades with the development of exact and heuristics methods. We propose a new heuristic algorithm for the Capacitated Facility Location Problem (CFLP) based on the RAMP (Relaxation Adaptive Memory Programming) framework. In the dual side of the method, the RAMP framework uses a Dual-Ascent procedure and a simple improvement method based on Tabu Search was used to explore the primal side, making this algorithm a very robust RAMP approach. The RAMP algorithm for the CFLP obtained excellent results, demonstrating its potential for new applications to other extensions and variations of Facility Location Problems. © 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.

Abstract
Simple Summary Nowadays, colorectal cancer is the third most incident cancer worldwide and, although it can be detected by imaging techniques, diagnosis is always based on biopsy samples. This assessment includes neoplasia grading, a subjective yet important task for pathologists. With the growing availability of digital slides, the development of robust and high-performance computer vision algorithms can help to tackle such a task. In this work, we propose an approach to automatically detect and grade lesions in colorectal biopsies with high sensitivity. The presented model attempts to support slide decision reasoning in terms of the spatial distribution of lesions, focusing the pathologist's attention on key areas. Thus, it can be integrated into clinical practice as a second opinion or as a flag for details that may have been missed at first glance. Colorectal cancer (CRC) diagnosis is based on samples obtained from biopsies, assessed in pathology laboratories. Due to population growth and ageing, as well as better screening programs, the CRC incidence rate has been increasing, leading to a higher workload for pathologists. In this sense, the application of AI for automatic CRC diagnosis, particularly on whole-slide images (WSI), is of utmost relevance, in order to assist professionals in case triage and case review. In this work, we propose an interpretable semi-supervised approach to detect lesions in colorectal biopsies with high sensitivity, based on multiple-instance learning and feature aggregation methods. The model was developed on an extended version of the recent, publicly available CRC dataset (the CRC+ dataset with 4433 WSI), using 3424 slides for training and 1009 slides for evaluation. The proposed method attained 90.19% classification ACC, 98.8% sensitivity, 85.7% specificity, and a quadratic weighted kappa of 0.888 at slide-based evaluation. Its generalisation capabilities are also studied on two publicly available external datasets.

Abstract
After publishing an in-depth study that analyzed the ability of computerized methods to assist or replace human experts in obtaining carotid intima-media thickness (CIMT) measurements leading to correct therapeutic decisions, here the same consortium joined to present technical outlooks on computerized CIMT measurement systems and provide considerations for the community regarding the development and comparison of these methods, including considerations to encourage the standardization of computerized CIMT measurements and results presentation. A multi-center database of 500 images was collected, upon which three manual segmentations and seven computerized methods were employed to measure the CIMT, including traditional methods based on dynamic programming, deformable models, the first order absolute moment, anisotropic Gaussian derivative filters and deep learning-based image processing approaches based on U-Net convolutional neural networks. An inter- and intra-analyst variability analysis was conducted and segmentation results were analyzed by dividing the database based on carotid morphology, image signal-to-noise ratio, and research center. The computerized methods obtained CIMT absolute bias results that were comparable with studies in literature and they generally were similar and often better than the observed inter- and intra-analyst variability. Several computerized methods showed promising segmentation results, including one deep learning method (CIMT absolute bias = 106 +/- 89 mu m vs. 160 +/- 140 mu m intra-analyst variability) and three other traditional image processing methods (CIMT absolute bias = 139 +/- 119 mu m, 143 +/- 118 mu m and 139 +/- 136 mu m). The entire database used has been made publicly available for the community to facilitate future studies and to encourage an open comparison and technical analysis