Abstract
With technological advancements, much data is being captured by sensors, smartphones, wearable devices, and so forth. These vast datasets are stored in data centres and utilized to forge data-driven models for the condition monitoring of infrastructures and systems through future data mining tasks. However, these datasets often surpass the processing capabilities of traditional information systems and methodologies due to their significant size. Additionally, not all samples within these datasets contribute valuable information during the model training phase, leading to inefficiencies. The processing and training of Machine Learning algorithms become time-consuming, and storing all the data demands excessive space, contributing to the Big Data challenge. In this paper, we propose two novel techniques to reduce large time-series datasets into more compact versions without undermining the predictive performance of the resulting models. These methods also aim to decrease the time required for training the models and the storage space needed for the condensed datasets. We evaluated our techniques on five public datasets, employing three Machine Learning algorithms: Holt-Winters, SARIMA, and LSTM. The outcomes indicate that for most of the datasets examined, our techniques maintain, and in several instances enhance, the forecasting accuracy of the models. Moreover, we significantly reduced the time required to train the Machine Learning algorithms employed.

Abstract
Spatio-temporal prediction tasks play a crucial role in facilitating informed decision-making through anticipatory insights. By accurately predicting future outcomes, the ability to strategize, preemptively address risks, and minimize their potential impact is enhanced. The precision in forecasting spatial and temporal patterns holds significant potential for optimizing resource allocation, land utilization, and infrastructure development. While existing review and survey papers predominantly focus on specific forecasting domains such as intelligent transportation, urban planning, pandemics, disease prediction, climate and weather forecasting, environmental data prediction, and agricultural yield projection, limited attention has been devoted to comprehensive surveys encompassing multiple objects concurrently. This article addresses this gap by comprehensively analyzing techniques employed in traffic, pandemics, disease forecasting, climate and weather prediction, agricultural yield estimation, and environmental data prediction. Furthermore, it elucidates challenges inherent in spatio-temporal forecasting and outlines potential avenues for future research exploration.

Abstract
This study investigates the impact of class imbalance and its potential interplay with other factors on machine learning models for transportation mode classification, utilising two real-world GPS trajectory datasets. A Random Forest model serves as the baseline, demonstrating strong performance on the relatively balanced dataset but experiencing significant degradation on the imbalanced one. To mitigate this effect, we explore various state-of-the-art class imbalance learning techniques, finding only marginal improvements. Resampling the fairly balanced dataset to replicate the imbalanced distribution suggests that factors beyond class imbalance are at play. We hypothesise and provide preliminary evidence for class overlap as a potential contributing factor, underscoring the need for further investigation into the broader range of classification difficulty factors. Our findings highlight the importance of balanced class distributions and a deeper understanding of factors such as class overlap in developing robust and generalisable models for transportation mode detection.

Abstract
This paper addresses a job shop scheduling problem with peak power constraints, in which jobs can be processed once or multiple times on either all or a subset of the machines. The latter characteristic provides additional flexibility, nowadays present in many manufacturing systems. The problem is complicated by the need to determine both the operation sequence and starting time as well as the speed at which machines process each operation. Due to the adherence to renewable energy production and its intermittent nature, manufacturing companies need to adopt power-flexible production schedules. The proposed power control strategies, that is, adjusting processing speed and timing to reduce peak power requirements may impact production time (makespan) and energy consumption. Therefore, we propose a bi-objective approach that minimizes both objectives. A linear programming model is developed to provide a formal statement of the problem, which is solved to optimality for small-sized instances. We also proposed a multi-objective biased random key genetic algorithm framework that evolves several populations in parallel. Computational experiments provide decision and policymakers with insights into the implications of imposing or negotiating power consumption limits. Finally, the several trade-off solutions obtained show that as the power limit is lowered, the makespan increases at an increasing rate and a similar trend is observed in energy consumption but only for very small makespan values. Furthermore, peak power demand reductions of about 25% have a limited impact on the minimum makespan value (4-6% increase), while at the same time allowing for a small reduction in energy consumption.

Abstract

Abstract
This paper fits in the theory of international agreements by studying the success of stable coalitions of agents seeking the preservation of a public good. Extending Baliga and Maskin, we consider a model of N homogeneous agents with quasi-linear utilities of the form u(j) (r(j); r) = r(alpha) - r(j), where r is the aggregate contribution and the exponent alpha is the elasticity of the gross utility. When the value of the elasticity alpha increases in its natural range (0, 1), we prove the following five main results in the formation of stable coalitions: (i) the gap of cooperation, characterized as the ratio of the welfare of the grand coalition to the welfare of the competitive singleton coalition grows to infinity, which we interpret as a measure of the urge or need to save the public good; (ii) the size of stable coalitions increases from 1 up to N; (iii) the ratio of the welfare of stable coalitions to the welfare of the competitive singleton coalition grows to infinity; (iv) the ratio of the welfare of stable coalitions to the welfare of the grand coalition decreases (a lot), up to when the number of members of the stable coalition is approximately N/e and after that it increases (a lot); and (v) the growth of stable coalitions occurs with a much greater loss of the coalition members when compared with free-riders. Result (v) has two major drawbacks: (a) A priori, it is difficult to convince agents to be members of the stable coalition and (b) together with results (i) and (iv), it explains and leads to the pessimistic Barrett's paradox of cooperation, even in a case not much considered in the literature: The ratio of the welfare of the stable coalitions against the welfare of the grand coalition is small, even in the extreme case where there are few (or a single) free-riders and the gap of cooperation is large. Optimistically, result (iii) shows that stable coalitions do much better than the competitive singleton coalition. Furthermore, result (ii) proves that the paradox of cooperation is resolved for larger values of.. so that the grand coalition is stabilized.