Abstract
In manufacturing chatter is an unwanted phenomenon that can lead to product quality reduction and tool wear. Real time chatter detection is key to preventing these issues and improving overall machining efficiency. In this paper we propose an unsupervised chatter detection method using autoencoders (AE) and Density-Based Spatial Clustering of Applications with Noise (DBSCAN) clustering algorithm that uses internal signals of Computer Numerical Control (CNC) machines. The proposed method starts by using an AE to extract features from raw internal signals collected from CNC machines. This step reduces the dimensionality of the data and captures the underlying patterns of chatter. Then the extracted features are fed into DBSCAN clustering algorithm which is a density based algorithm that groups similar data points and identifies outliers. We tested the proposed method with real world data collected from various CNC machines. The results show that our unsupervised chatter detection method has high accuracy, precision and recall, can detect chatter and distinguish it from normal machining. Also the method is robust to noise and can adapt to dynamic machining conditions. In summary our work presents an unsupervised chatter detection method using AE and DBSCAN clustering that uses internal signals of CNC machines. This method is a reliable and efficient solution for real time chatter detection so manufacturers can improve product quality, optimize machining process and reduce tool wear during machining.

Abstract
This paper introduces the Large Events Model (LEM) for soccer, a novel deep learning framework for generating and analyzing soccer matches. The framework can simulate games from a given game state, with its primary output being the ensuing probabilities and events from multiple simulations. These can provide insights into match dynamics and underlying mechanisms. We discuss the framework's design, features, and methodologies, including model optimization, data processing, and evaluation techniques. The models within this framework are developed to predict specific aspects of soccer events, such as event type, success likelihood, and further details. In an applied context, we showcase the estimation of xP+, a metric estimating a player's contribution to the team's points earned. This work ultimately enhances the field of sports event prediction and practical applications and emphasizes the potential for this kind of method.

Abstract
Self-adaptive Systems (SaS) are becoming increasingly important for adapting to dynamic environments and for optimizing performance on resource-constrained devices. A practical approach to achieving self-adaptability involves using a Pareto-Front (PF) to store the system's hyper-parameters and the outcomes of hyperparameter combinations. This paper proposes a novel method to approximate a PF, offering a configurable number of solutions that can be adapted to the device's limitations. We conducted extensive experiments across various scenarios, where all PF solutions were replaced, and real world scenarios were performed using actual measurements from a Human Activity Recognition (HAR) system. Our results show that our method consistently outperforms previous methods, mainly when the maximum number of PF solutions is in the order of hundreds. The effectiveness of our method is most apparent in real-case scenarios where it achieves, when executed in a Raspberry Pi 5, up to 87% energy consumption reduction and lower execution times than the second-best algorithm. Additionally, our method ensures a more evenly distributed solution across the PF, preventing the high concentration of solutions. © 2024 IEEE.

Abstract
Taxi demand prediction with scarce historic information is among the most encountered challenges of the present decade for the traffic network of a smart city. Lack of sufficient information results in the failure of conventional approaches in prediction for a new city. Additionally, the prevalent Deep Neural Network (DNN) Models resort to ineffectual approaches which fail to meet the required prediction performance for the network. Moreover, existing domain adaptation (DA) models could not sufficiently reap the domain-shared features well from multiple source, questioning the models' applicability. Complex structure of these DA models tends to a nominal performance gain due to inefficient resource utilization of the sources. The present paper introduces a domain adaptation deep neural network model, Bootstrap Zero-Shot (BTS-Z) learning model which focuses on capturing the latent spatio-temporal features of the whole city traffic network shared among every source city and maneuver them to predict for the target city traffic network with no prior information. The presented model proves the efficacy of the bootstrap algorithm in the prediction of demands for the unseen target over the computationally expensive MAML models. The experimental results on three real-world city taxi data on the standard benchmark metrics report a minimum of 23.41% improvement over the best performing competitive system. © 2024 IEEE.

Abstract
Accurate identification of transportation mode distribution is essential for effective urban planning. Recent advancements in machine learning have spurred research on automated Transportation Mode Detection (TMD). While existing TMD methods predominantly employ standard flat classification methods, this paper introduces HiClass4MD, a novel hierarchical approach. By leveraging the misclassification errors from standard flat classifier, HiClass4MD learns the class hierarchy for transportation modes. Although hierarchical met-rics initially indicated performance improvements when applied to real-world GPS trajectories dataset, a subsequent evaluation using conventional metrics revealed inconsistent results. While decision trees benefited marginally, other classifiers exhibited no significant gains or even degraded. This study highlights the complexity of applying hierarchical classification to TMD and underscores the need for further investigation into the factors influencing its effectiveness. © 2024 IEEE.

Abstract
This work extends the energy-efficient job shop scheduling problem with transport resources by considering speed adjustable resources of two types, namely: the machines where the jobs are processed on and the vehicles that transport the jobs around the shop-floor. Therefore, the problem being considered involves determining, simultaneously, the processing speed of each production operation, the sequence of the production operations for each machine, the allocation of the transport tasks to vehicles, the travelling speed of each task for the empty and for the loaded legs, and the sequence of the transport tasks for each vehicle. Among the possible solutions, we are interested in those providing trade-offs between makespan and total energy consumption (Pareto solutions). To that end, we develop and solve a bi-objective mixed-integer linear programming model. In addition, due to problem complexity we also propose a multi-objective biased random key genetic algorithm that simultaneously evolves several populations. The computational experiments performed have show it to be effective and efficient, even in the presence of larger problem instances. Finally, we provide extensive time and energy trade-off analysis (Pareto front) to infer the advantages of considering speed adjustable machines and speed adjustable vehicles and provide general insights for the managers dealing with such a complex problem.