This year's summer holidays provided me with a stark realisation: how much AI has become an integral part of everyday life. I spent a happy two weeks driving the south of Italy with my family. It was very enjoyable trip and provided a welcome rest. I cannot help but also reflect on the difference in the experience of driving abroad now and from before. Ten years ago, our holiday started in a car full of little people failing to follow the printed route map from the airport towards our Eurocamp site.

The hard-and software that catalysed rapid developments in machine learning In late 2002 and early 2003, the release of the Radeon 9700 and GeForce FX video cards introduced a fully programmable graphics pipeline, extending and later replacing the existing fixed function pipelines. Unlike the fixed function pipeline, which allowed the user to only supply input matrices and parameters to built-in operations, the programmable pipeline introduced the execution of user-written shader programs on the GPU [Contributors, 2015]. This fundamental change allowed programmers and researchers to exploit the intrinsic parallelism of GPUs 2 years before Intel would introduce its first dual-core CPU. Within months of the availability of this new hardware and the accompanying APIs, researchers implemented linear algebra methods on GPUs and introduced programming frameworks to use GPUs for generalpurpose computations [Thompson et al., 2002, Krüger and Westermann, 2003]. This rapid development marked the dawn of general-purpose computing on graphics processing units (GPGPU). In a presentation at ICS '08, Harris presented the successes of GPGPU by highlighting a speed-up in molecular docking, N-body simulations, HD video stream transcoding, or image processing--applications in machine learning were not discussed. However, just one year later, the introduction of GPUs as general-purpose processors catalysed the deep learning explosion of the early 2010s by allowing deep learning algorithms pioneered by Alexey Ivakhnenko in 1971 to be run within practical time on widely available consumer hardware when Rajat et al. showed that GPUs outperform CPUs by an order of magnitude in large-scale deep unsupervised learning tasks [Ivakhnenko, 1971, Raina et al., 2009]. Hardware and energy requirements increase in machine learning research In 2010, Ciresan et al. [2010] introduced a multi-layer perceptron (MLP) with up to 12.11 million free parameters where forward and backward propagation were implemented on a GPU using NVIDIA's proprietary CUDA API introduced by Harris at ICS '08 two

Power system state estimation is being faced with different types of anomalies. These might include bad data caused by gross measurement errors or communication system failures. Sudden changes in load or generation can be considered as anomaly depending on the implemented state estimation method. Additionally, considering power grid as a cyber physical system, state estimation becomes vulnerable to false data injection attacks. The existing methods for anomaly classification cannot accurately classify (discriminate between) the above mentioned three types of anomalies, especially when it comes to discrimination between sudden load changes and false data injection attacks. This paper presents a new algorithm for detecting anomaly presence, classifying the anomaly type and identifying the origin of the anomaly, i.e., measurements that contain gross errors in case of bad data, or buses associated with loads experiencing a sudden change, or state variables targeted by false data injection attack. The algorithm combines analytical and machine learning (ML) approaches. The first stage exploits an analytical approach to detect anomaly presence by combining $\chi^2$-test and anomaly detection index. The second stage utilizes ML for classification of anomaly type and identification of its origin, with particular reference to discrimination between sudden load changes and false data injection attacks. The proposed ML based method is trained to be independent of the network configuration which eliminates retraining of the algorithm after network topology changes. The results obtained by implementing the proposed algorithm on IEEE 14 bus test system demonstrate the accuracy and effectiveness of the proposed algorithm.

Accurate and reliable prediction of Photovoltaic (PV) power output is critical to electricity grid stability and power dispatching capabilities. However, Photovoltaic (PV) power generation is highly volatile and unstable due to different reasons. The Wavelet Transform (WT) has been utilised in time series applications, such as Photovoltaic (PV) power prediction, to model the stochastic volatility and reduce prediction errors. Yet the existing Wavelet Transform (WT) approach has a limitation in terms of time complexity. It requires reconstructing the decomposed components and modelling them separately and thus needs more time for reconstruction, model configuration and training. The aim of this study is to improve the efficiency of applying Wavelet Transform (WT) by proposing a new method that uses a single simplified model. Given a time series and its Wavelet Transform (WT) coefficients, it trains one model with the coefficients as features and the original time series as labels. This eliminates the need for component reconstruction and training numerous models. This work contributes to the day-ahead aggregated solar Photovoltaic (PV) power time series prediction problem by proposing and comprehensively evaluating a new approach of employing WT. The proposed approach is evaluated using 17 months of aggregated solar Photovoltaic (PV) power data from two real-world datasets. The evaluation includes the use of a variety of prediction models, including Linear Regression, Random Forest, Support Vector Regression, and Convolutional Neural Networks. The results indicate that using a coefficients-based strategy can give predictions that are comparable to those obtained using the components-based approach while requiring fewer models and less computational time.

In this study, we propose parameter-varying neural ordinary differential equations (NODEs) where the evolution of model parameters is represented by partition-of-unity networks (POUNets), a mixture of experts architecture. The proposed variant of NODEs, synthesized with POUNets, learn a meshfree partition of space and represent the evolution of ODE parameters using sets of polynomials associated to each partition. We demonstrate the effectiveness of the proposed method for three important tasks: data-driven dynamics modeling of (1) hybrid systems, (2) switching linear dynamical systems, and (3) latent dynamics for dynamical systems with varying external forcing.

To address three significant challenges of massive wireless communications including propagation loss, long-distance transmission, and channel fading, we aim at establishing the hybrid antenna array with bowtie elements in a compact size for beamforming applications. In this work we rigorously demonstrate that bowtie elements allow for a significant improvement in the beamforming performance of the hybrid antenna array compared to not only other available antenna arrays, but also its geometrical counterpart with dipole elements. We have achieved a greater than 15 dB increase in SINR values, a greater than 20% improvement in the antenna efficiency, a significant enhancement in the DoA estimation, and 20 increments in the directivity for the hybrid antenna array with bowtie elements, compared to its geometrical counterpart, by performing a three-class classification LS-SVM (Least-Squares Support Vector Machine) optimization method. The proposed hybrid antenna array has shown a 3D uniform directivity, which is accompanied by its superior performance in the 3D uniform beam-scanning capability. The directivities remain almost constant at 40.83 dBi with the variation of angle θ, and 41.21 dBi with the variation of angle φ. The unrivaled functionality and performance of the hybrid antenna array with bowtie elements makes it a potential candidate for beamforming applications in massive wireless communications. ECENT advances and innovative solutions have been extensively developed for deploying smart array antennas with a highly-directive radiation pattern in order to overcome the long-distance challenges and minimize interference signals, as well as enhance the spherical coverage and capacity in massive wireless communication channels. In this sense, in addition to performing optimization methods, the geometrical configuration, inter-element spacing, excitation phase, and amplitude of the individual array elements of each antenna array have been designed and synthesized for controlling its radiation patterns.

Thousands of residents were left without electricity after a food delivery drone crashed into power lines in Australia. The power company, Energex, had to shut down the network after a crew was called to the incident Thursday in Browns Plains, south of Brisbane. While Energex was able to restore electricity for about 2,000 customers within 45 minutes, 300 remained without power for at least three hours, due to being in close vicinity of the drone crash, ABC News said Friday. Energex spokesman Danny Donald told ABC Radio they had never seen delivery drones hitting the network. "We've never seen these delivery drones hit the network. "This is the first time that I've seen it happen.

Anyone who has followed global news events of late will have noticed the devastating floods that have engulfed pretty much every corner of the world, from the U.S. and Europe, to Africa, Australia and Asia, where India and Pakistan have been hit by some of their worst floods in recent memory. By pretty much all accounts, such climate change-driven disasters are only going to get worse. And while there are varying opinions on what -- if anything -- we can do to avert such catastrophes in the future, some companies are looking at ways to plan for this new reality, and at least go some way toward mitigating the impact of flooding. One of these companies is 7Analytics, a Norwegian startup founded back in 2020 by a team of data scientists and geologists to reduce the risks of flooding for construction and energy infrastructure companies. With its first product, FloodCube, 7Analytics serves customers with AI and advanced machine learning techniques to calculate current surface water and where it's flowing today (the "runoff"), then models how that will look in the future with increased rainfall.

Within the context of topological data analysis, the problems of identifying topological significance and matching signals across datasets are important and useful inferential tasks in many applications. The limitation of existing solutions to these problems, however, is computational speed. In this paper, we harness the state-of-the-art for persistent homology computation by studying the problem of determining topological prevalence and cycle matching using a cohomological approach, which increases their feasibility and applicability to a wider variety of applications and contexts. We demonstrate this on a wide range of real-life, large-scale, and complex datasets. We extend existing notions of topological prevalence and cycle matching to include general non-Morse filtrations. This provides the most general and flexible state-of-the-art adaptation of topological signal identification and persistent cycle matching, which performs comparisons of orders of ten for thousands of sampled points in a matter of minutes on standard institutional HPC CPU facilities.

This paper considers data-driven chance-constrained stochastic optimization problems in a Bayesian framework. Bayesian posteriors afford a principled mechanism to incorporate data and prior knowledge into stochastic optimization problems. However, the computation of Bayesian posteriors is typically an intractable problem, and has spawned a large literature on approximate Bayesian computation. Here, in the context of chance-constrained optimization, we focus on the question of statistical consistency (in an appropriate sense) of the optimal value, computed using an approximate posterior distribution. To this end, we rigorously prove a frequentist consistency result demonstrating the convergence of the optimal value to the optimal value of a fixed, parameterized constrained optimization problem. We augment this by also establishing a probabilistic rate of convergence of the optimal value. We also prove the convex feasibility of the approximate Bayesian stochastic optimization problem. Finally, we demonstrate the utility of our approach on an optimal staffing problem for an M/M/c queueing model.