Energy
Major AI Trends for Traditional Enterprises in 2023 - DATAVERSITY
Post-pandemic, the demand for AI is surging, as many organizations ascertain the need for AI to keep pace with the current business landscape in the face of a looming recession. AI can help enterprises improve business processes, increase speed and accuracy, and help make predictions to optimize their performance. In 2023, there will be many ways that enterprises can implement AI but for more traditional organizations, we suggest the following trends will play an important role. This includes the need for companies to get their data fabric in place before implementing AI, new and interesting ways to "white-label" AI, and the need to develop a Center of Excellence to ensure the entire company is aligned with an AI strategy. As more enterprises look to implement AI projects in 2023 to increase productivity, gain better insights, and have the ability to make more accurate predictions regarding strategic business decisions, the challenge will be for traditional enterprises to establish a robust data framework that will allow their organizations to leverage data effectively for AI purposes.
UK creates £1.5M fund to support carbon-reducing AI projects
The UK Government has launched a £1.5 million programme to support the use of AI to reduce carbon emissions. "The UK is one of the world's most advanced AI economies, and AI technology is already having a transformative impact on our economy and society," said UK Science Minister George Freeman. "But there is tremendous potential to do more." The AI for Decarbonisation programme is part of the wider £1 billion Net Zero Innovation Portfolio that aims to accelerate the commercialisation of low-carbon technologies, systems and business models. The AI for Decarbonisation programme offers an exciting opportunity to leverage and develop the UK's outstanding expertise in the field," adds Freeman. "Putting this rapidly-evolving technology into action will enable us to save energy costs for businesses and households, create high-value, skilled jobs, and kickstart millions of pounds of private investment while supporting our net-zero targets."
Multivariate Time Series Forecasting with Dynamic Graph Neural ODEs
Jin, Ming, Zheng, Yu, Li, Yuan-Fang, Chen, Siheng, Yang, Bin, Pan, Shirui
Multivariate time series forecasting has long received significant attention in real-world applications, such as energy consumption and traffic prediction. While recent methods demonstrate good forecasting abilities, they have three fundamental limitations. (i) Discrete neural architectures: Interlacing individually parameterized spatial and temporal blocks to encode rich underlying patterns leads to discontinuous latent state trajectories and higher forecasting numerical errors. (ii) High complexity: Discrete approaches complicate models with dedicated designs and redundant parameters, leading to higher computational and memory overheads. (iii) Reliance on graph priors: Relying on predefined static graph structures limits their effectiveness and practicability in real-world applications. In this paper, we address all the above limitations by proposing a continuous model to forecast $\textbf{M}$ultivariate $\textbf{T}$ime series with dynamic $\textbf{G}$raph neural $\textbf{O}$rdinary $\textbf{D}$ifferential $\textbf{E}$quations ($\texttt{MTGODE}$). Specifically, we first abstract multivariate time series into dynamic graphs with time-evolving node features and unknown graph structures. Then, we design and solve a neural ODE to complement missing graph topologies and unify both spatial and temporal message passing, allowing deeper graph propagation and fine-grained temporal information aggregation to characterize stable and precise latent spatial-temporal dynamics. Our experiments demonstrate the superiorities of $\texttt{MTGODE}$ from various perspectives on five time series benchmark datasets.
Simulation-based Forecasting for Intraday Power Markets: Modelling Fundamental Drivers for Location, Shape and Scale of the Price Distribution
During the last years, European intraday power markets have gained importance for balancing forecast errors due to the rising volumes of intermittent renewable generation. However, compared to day-ahead markets, the drivers for the intraday price process are still sparsely researched. In this paper, we propose a modelling strategy for the location, shape and scale parameters of the return distribution in intraday markets, based on fundamental variables. We consider wind and solar forecasts and their intraday updates, outages, price information and a novel measure for the shape of the merit-order, derived from spot auction curves as explanatory variables. We validate our modelling by simulating price paths and compare the probabilistic forecasting performance of our model to benchmark models in a forecasting study for the German market. The approach yields significant improvements in the forecasting performance, especially in the tails of the distribution. At the same time, we are able to derive the contribution of the driving variables. We find that, apart from the first lag of the price changes, none of our fundamental variables have explanatory power for the expected value of the intraday returns. This implies weak-form market efficiency as renewable forecast changes and outage information seems to be priced in by the market. We find that the volatility is driven by the merit-order regime, the time to delivery and the closure of cross-border order books. The tail of the distribution is mainly influenced by past price differences and trading activity. Our approach is directly transferable to other continuous intraday markets in Europe.
Machine Learning for Screening Large Organic Molecules
Gaul, Christopher, Cuesta-Lopez, Santiago
Organic semiconductors are promising materials for cheap, scalable and sustainable electronics, light-emitting diodes and photovoltaics. For organic photovoltaic cells, it is a challenge to find compounds with suitable properties in the vast chemical compound space. For example, the ionization energy should fit to the optical spectrum of sun light, and the energy levels must allow efficient charge transport. Here, a machine-learning model is developed for rapidly and accurately estimating the HOMO and LUMO energies of a given molecular structure. It is build upon the SchNet model (Sch\"utt et al. (2018)) and augmented with a `Set2Set' readout module (Vinyals et al. (2016)). The Set2Set module has more expressive power than sum and average aggregation and is more suitable for the complex quantities under consideration. Most previous models have been trained and evaluated on rather small molecules. Therefore, the second contribution is extending the scope of machine-learning methods by adding also larger molecules from other sources and establishing a consistent train/validation/test split. As a third contribution, we make a multitask ansatz to resolve the problem of different sources coming at different levels of theory. All three contributions in conjunction bring the accuracy of the model close to chemical accuracy.
Bayesian hierarchical modelling for battery lifetime early prediction
Accurate prediction of battery health is essential for real-world system management and lab-based experiment design. However, building a life-prediction model from different cycling conditions is still a challenge. Large lifetime variability results from both cycling conditions and initial manufacturing variability, and this -- along with the limited experimental resources usually available for each cycling condition -- makes data-driven lifetime prediction challenging. Here, a hierarchical Bayesian linear model is proposed for battery life prediction, combining both individual cell features (reflecting manufacturing variability) with population-wide features (reflecting the impact of cycling conditions on the population average). The individual features were collected from the first 100 cycles of data, which is around 5-10% of lifetime. The model is able to predict end of life with a root mean square error of 3.2 days and mean absolute percentage error of 8.6%, measured through 5-fold cross-validation, overperforming the baseline (non-hierarchical) model by around 12-13%.
Online Dynamic Reliability Evaluation of Wind Turbines based on Drone-assisted Monitoring
Kabir, Sohag, Aslansefat, Koorosh, Gope, Prosanta, Campean, Felician, Papadopoulos, Yiannis
The offshore wind energy is increasingly becoming an attractive source of energy due to having lower environmental impact. Effective operation and maintenance that ensures the maximum availability of the energy generation process using offshore facilities and minimal production cost are two key factors to improve the competitiveness of this energy source over other traditional sources of energy. Condition monitoring systems are widely used for health management of offshore wind farms to have improved operation and maintenance. Reliability of the wind farms are increasingly being evaluated to aid in the maintenance process and thereby to improve the availability of the farms. However, much of the reliability analysis is performed offline based on statistical data. In this article, we propose a drone-assisted monitoring based method for online reliability evaluation of wind turbines. A blade system of a wind turbine is used as an illustrative example to demonstrate the proposed approach.
Humans plan for the near future to walk economically on uneven terrain
Humans experience small fluctuations in their gait when walking on uneven terrain. The fluctuations deviate from the steady, energy-minimizing pattern for level walking, and have no obvious organization. But humans often look ahead when they walk, and could potentially plan anticipatory fluctuations for the terrain. Such planning is only sensible if it serves some an objective purpose, such as maintaining constant speed or reducing energy expenditure, that is also attainable within finite planning capacity. Here we show that humans do plan and perform optimal control strategies on uneven terrain. Rather than maintain constant speed, they make purposeful, anticipatory speed adjustments that are consistent with minimizing energy expenditure. A simple optimal control model predicts economical speed fluctuations that agree well with experiments with humans (N = 12) walking on seven different terrain profiles (correlated with model ro=0.55+-0.11, P<0.05 all terrains). Participants made repeatable speed fluctuations starting about six to eight steps ahead of each terrain feature (up to +-7.5 cm height difference each step, up to 16 consecutive features). Nearer features matter more, because energy is dissipated with each succeeding step collision with ground, preventing momentum from persisting indefinitely. A finite horizon of continuous look ahead and motor working space thus suffice to practically optimize for any length of terrain. Humans reason about walking in the near future to plan complex optimal control sequences.
Modelling Direct Messaging Networks with Multiple Recipients for Cyber Deception
Moore, Kristen, Christopher, Cody J., Liebowitz, David, Nepal, Surya, Selvey, Renee
Cyber deception is emerging as a promising approach to defending networks and systems against attackers and data thieves. However, despite being relatively cheap to deploy, the generation of realistic content at scale is very costly, due to the fact that rich, interactive deceptive technologies are largely hand-crafted. With recent improvements in Machine Learning, we now have the opportunity to bring scale and automation to the creation of realistic and enticing simulated content. In this work, we propose a framework to automate the generation of email and instant messaging-style group communications at scale. Such messaging platforms within organisations contain a lot of valuable information inside private communications and document attachments, making them an enticing target for an adversary. We address two key aspects of simulating this type of system: modelling when and with whom participants communicate, and generating topical, multi-party text to populate simulated conversation threads. We present the LogNormMix-Net Temporal Point Process as an approach to the first of these, building upon the intensity-free modeling approach of Shchur et al. to create a generative model for unicast and multi-cast communications. We demonstrate the use of fine-tuned, pre-trained language models to generate convincing multi-party conversation threads. A live email server is simulated by uniting our LogNormMix-Net TPP (to generate the communication timestamp, sender and recipients) with the language model, which generates the contents of the multi-party email threads. We evaluate the generated content with respect to a number of realism-based properties, that encourage a model to learn to generate content that will engage the attention of an adversary to achieve a deception outcome.
A Secure and Intelligent Data Sharing Scheme for UAV-Assisted Disaster Rescue
Wang, Yuntao, Su, Zhou, Xu, Qichao, Li, Ruidong, Luan, Tom H., Wang, Pinghui
Unmanned aerial vehicles (UAVs) have the potential to establish flexible and reliable emergency networks in disaster sites when terrestrial communication infrastructures go down. Nevertheless, potential security threats may occur on UAVs during data transmissions due to the untrusted environment and open-access UAV networks. Moreover, UAVs typically have limited battery and computation capacity, making them unaffordable for heavy security provisioning operations when performing complicated rescue tasks. In this paper, we develop RescueChain, a secure and efficient information sharing scheme for UAV-assisted disaster rescue. Specifically, we first implement a lightweight blockchain-based framework to safeguard data sharing under disasters and immutably trace misbehaving entities. A reputation-based consensus protocol is devised to adapt the weakly connected environment with improved consensus efficiency and promoted UAVs' honest behaviors. Furthermore, we introduce a novel vehicular fog computing (VFC)-based off-chain mechanism by leveraging ground vehicles as moving fog nodes to offload UAVs' heavy data processing and storage tasks. To offload computational tasks from the UAVs to ground vehicles having idle computing resources, an optimal allocation strategy is developed by choosing payoffs that achieve equilibrium in a Stackelberg game formulation of the allocation problem. For lack of sufficient knowledge on network model parameters and users' private cost parameters in practical environment, we also design a two-tier deep reinforcement learning-based algorithm to seek the optimal payment and resource strategies of UAVs and vehicles with improved learning efficiency. Simulation results show that RescueChain can effectively accelerate consensus process, improve offloading efficiency, reduce energy consumption, and enhance user payoffs.