Abstract
Neonatal seizures represent a critical medical issue that requires prompt diagnosis and treatment. Typically, at-risk newborns undergo a Magnetic Resonance Imaging (MRI) brain assessment followed by continuous seizure monitoring using multichannel EEG. Visual analysis of multichannel electroencephalogram (EEG) recordings remains the standard modality for seizure detection; however, it is limited by fatigue and delayed seizure identification. Advances in machine and deep learning have led to the development of powerful neonatal seizure detection algorithms that may help address these limitations. Nevertheless, their performance remains relatively low and often disregards the non-stationary attributes of EEG signals, especially when learned from weakly labeled EEG data. In this context, the present paper proposes a novel deep-learning approach for neonatal seizure detection. The method employs rigorous preprocessing to reduce noise and artifacts, along with a recently developed time-frequency distribution (TFD) derived from a separable compact support kernel to capture the fast spectral changes associated with neonatal seizures. The high-resolution TFD diagrams are then converted into RGB images and used as inputs to a pre-trained ResNet-18 model. This is followed by the training of an attention-based multiple-instance learning (MIL) mechanism. The purpose is to perform a spatial time-frequency analysis that can highlight which channels exhibit seizure activity, thereby reducing the time required for secondary evaluation by a doctor. Additionally, per-instance learning (PIL) is performed to further validate the robustness of our TFD and methodology. Tested on the Helsinki public dataset, the PIL model achieved an area under the curve (AUC) of 96.8%, while the MIL model attained an average AUC of 94.1%, surpassing similar attention-based methods.

Abstract
Rising industrial complexity demands efficient mobile robots to drive automation and productivity. Effective navigation relies on perception, localization, mapping, path planning, and motion control, with path planning being key. The Time Enhanced A* (TEA*) algorithm extends A* by adding time as a dimension to resolve temporal conflicts in multi-robot coordination. However, inconsistencies in edge lengths within the graph can hinder optimal path calculation. To address this, a Graph Decomposition submodule was developed to standardize edge lengths and temporal costs. Integrated into a ROS-based fleet coordination system, this approach significantly reduces execution time and improves coordination capacity.

Abstract
In today's highly competitive fashion retail market, it is crucial to have accurate demand forecasting systems, namely for new products. Many experts have used machine learning techniques to forecast product sales. However, sales that do not happen due to lack of product availability are often ignored, resulting in censored demand and service levels that are lower than expected. Motivated by the relevance of this issue, we developed a two-stage approach to forecast the demand for new products in the fashion retail industry. In the first stage, we compared four methods of transforming historical sales into historical demand for products already commercialized. Three methods used sales-weighted averages to estimate demand on the days with stock-outs, while the fourth method employed an Expectation-Maximization (EM) algorithm to account for potential substitute products affected by stock-outs of preferred products. We then evaluated the performance of these methods and selected the most accurate one for calculating the primary demand for these historical products. In the second stage, we predicted the demand for the products of the following collection using Random Forest, Deep Neural Networks, and Support Vector Regression algorithms. In addition, we applied a model that consisted of weighting the demands previously calculated for the products of past collections that were most similar to the new products. We validated the proposed methodology using a European fashion retailer case study. The results revealed that the method using the Expectation-Maximization algorithm had the highest potential, followed by the Random Forest algorithm. We believe that this approach will lead to more assertive and better-aligned decisions in production management.

Abstract

Abstract

Abstract
Renewable energy resources are crucial for addressing global economic and environmental challenges. Energy communities, which unite consumers to pursue shared energy goals, present a promising solution for reducing energy costs and enhancing sustainability. This study analyzes the optimal sizing and operation of energy community resources, formulating the problem as mixed-integer linear programming (MILP) models. Two tools are employed: one for daily operation, calculating energy setpoints for community assets such as battery energy storage systems (BESS) and electric vehicles (EVs), and another for sizing photovoltaic (PV) panels and BESS capacities to minimize costs while optimizing local energy trades. Due to the high computational demands of MILP, three optimization methods are compared: deterministic, hybrid particle swarm optimization (PSO), and evolutionary PSO (EPSO). The hybrid PSO method handles binary and continuous variables efficiently, while EPSO introduces diversity to improve solution quality in complex scenarios. These metaheuristic approaches address the trade-off between solution accuracy and computational effort, providing reliable tools for decision-makers in energy communities.