Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computation time”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 883 records · Page 49
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Breaking the Million-Electron and 1 EFLOP/s Barriers: Biomolecular-Scale Ab Initio Molecular Dynamics Using MP2 Potentials

The accurate simulation of complex biochemical phenomena has historically been hampered by the computational requirements of high-fidelity molecular-modeling techniques. Quantum mechanical methods, such as ab initio wave-function (WF) theory, deliver the desired accuracy, but have impractical scaling for modeling biosystems with thousands of atoms. Combining molecular fragmentation with MP2 perturbation theory, this study presents an innovative approach that enables biomolecular-scale ab initio molecular dynamics (AIMD) simulations at WF theory level. Leveraging the resolution-of-the-identity approximation for Hartree-Fock and MP2 gradients, our approach eliminates computationally intensive four-center integrals and their gradients, while achieving near-peak performance on modern GPU architectures. The introduction of asynchronous time steps minimizes time step latency, overlapping computational phases and effectively mitigating load imbalances. Utilizing up to 9,400 nodes of Frontier and achieving 59% (1006.7 PFLOP/s) of its double-precision floating-point peak, our method enables us to break the million-electron and 1EFLOP/s barriers for AIMD simulations with quantum accuracy.

Kurzak, Jakub↗
DOE OSTI2021

Computing Free Energies with Fluctuation Relations on Quantum Computers

One of the most promising applications for quantum computers is the dynamic simulation of quantum materials. Current hardware, however, sets stringent limitations on how long such simulations can run before decoherence begins to corrupt results. The Jarzynski equality, a fluctuation theorem that allows for the computation of equilibrium free energy differences from an ensemble of short, non-equilibrium dynamics simulations, can make use of such short-time simulations on quantum computers. Here, we present a quantum algorithm based on the Jarzynski equality for computing free energies of quantum materials. We demonstrate our algorithm using the transverse field Ising model on both a quantum simulator and real quantum hardware. As the free energy is a central thermodynamic property that allows one to compute virtually any equilibrium property of a physical system, the ability to perform this algorithm for larger quantum systems in the future has implications for a wide range of applications including the construction of phase diagrams, prediction of transport properties and reaction constants, and computer-aided drug design.

Bassman, Lindsay↗
DOE OSTI2025

Optical neural engine for solving scientific partial differential equations

Abstract Solving partial differential equations (PDEs) is the cornerstone of scientific research and development. Data-driven machine learning (ML) approaches are emerging to accelerate time-consuming and computation-intensive numerical simulations of PDEs. Although optical systems offer high-throughput and energy-efficient ML hardware, their demonstration for solving PDEs is limited. Here, we present an optical neural engine (ONE) architecture combining diffractive optical neural networks for Fourier space processing and optical crossbar structures for real space processing to solve time-dependent and time-independent PDEs in diverse disciplines, including Darcy flow equation, the magnetostatic Poisson’s equation in demagnetization, the Navier-Stokes equation in incompressible fluid, Maxwell’s equations in nanophotonic metasurfaces, and coupled PDEs in a multiphysics system. We numerically and experimentally demonstrate the capability of the ONE architecture, which not only leverages the advantages of high-performance dual-space processing for outperforming traditional PDE solvers and being comparable with state-of-the-art ML models but also can be implemented using optical computing hardware with unique features of low-energy and highly parallel constant-time processing irrespective of model scales and real-time reconfigurability for tackling multiple tasks with the same architecture. The demonstrated architecture offers a versatile and powerful platform for large-scale scientific and engineering computations.

Tang, Yingheng (ORCID:0009000153622546)↗
DOE OSTI2023

Multigrid Reduction in Time for Chaotic and Hyperbolic Problems (Final Report)

The coming massive parallelism of exascale computing presents a pressing challenge for the many DOE simulations of time-dependent partial differential equations (PDEs), which typically use traditional sequential time stepping methods. Since this traditional approach is inherently serial, it presents a sequential bottleneck when moving to exascale computing, because future performance gains will come through greater concurrency, not faster clock speeds. Thus, the goal of this work is to research parallelism in time, i.e., methods that compute multiple time values simultaneously, not sequentially. The focus will be on hyperbolic and chaotic problems of interest to DOE, with the goal of enabling scalable simulations of time-dependent hyperbolic and chaotic problems on future architectures. The chosen methodology for solving these problems parallel-in-time is multigrid, because multigrid (when it works) is a powerful, optimal, and scalable solver for discretized PDEs. Multigrid is already commonly used in many DOE simulations for scalably and optimally solving space-only PDE problems. The areas of hyperbolic and chaotic problems are chosen because of their relevance to problems of programmatic interest to DOE. However, these problems are also well-known to be difficult for parallelin-time methods, with the most common method, parareal, diverging in many cases. The current state-of-the-art for parallel-in-time at LLNL is the multigrid reduction in time (MGRIT) XBraid package, which also struggles for such problems, while still showing some improvement over parareal. In summary, new methods are needed for an efficient parallel-in-time scheme for hyperbolic and chaotic problems, and this work shall research promising new multigrid methods in this area. In particular, this work shall continue researching the directions from the current collaboration with Dr. Falgout, which are laid out in the work Toward Parallel in Time for Chaotic Dynamical Systems and showed the first known results of a parallel-in-time speedup for a chaotic problem. This work outlines two key improvements to XBraid for chaotic problems, the so-called “theta” and “delta-correction” methods. Here, these two improvements will be implemented in a high-performance but general way in XBraid and explored for more complicated problems. We will additionally research, as time allows, improvements to these techniques, as well as multigrid relaxation techniques based on Least Squares Shadowing (LSS by Wang) and a nonintrusive block tridiagonal solver based on MGRIT, called TriMGRIT.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

A Practical Approach to Wave Function Propagation, Hopping Probabilities, and Time Steps in Surface Hopping Calculations

We compare several established approaches for propagating wave functions and calculating hopping probabilities within the fewest switches surface hopping (FSSH) algorithm for difficult cases with many electronic states and many trivial crossings. If only a single time step (Δt c ) is employed, we find that no published approach can accurately capture the dynamics correctly unless Δt c → 0 (which is not computationally feasible). If multiple time steps are employed, for a fixed classical time step (Δt c ), a robust scheme can be found for dynamically choosing quantum time steps (δt q1 and δt q2 ) and calculating hopping probabilities so that one can systematically reduce all errors and achieve maximally efficient accuracy; scattering calculations confirm that one can choose a fairly large classical time step. Furthermore, the robust scheme presented here uses both the “local diabatic” and adiabatic interpolation and thus borrows elements from both the Granucci/Persico and Meek/Levine algorithms. Our findings should be broadly applicable in the future.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2024

Multigrid Reduction in Time for Chaotic and Hyperbolic Problems (Final Report)

The coming massive parallelism of exascale computing presents a pressing challenge for the many DOE simulations of time-dependent partial differential equations (PDEs), which typically use traditional sequential time stepping methods. Since this traditional approach is inherently serial, it presents a sequential bottleneck when moving to exascale computing, because future performance gains will come through greater concurrency, not faster clock speeds. Thus, the goal of this work is to research parallelism in time, i.e., methods that compute multiple time values simultaneously, not sequentially. The focus will be on hyperbolic and chaotic problems of interest to DOE, with the goal of enabling scalable simulations of time-dependent hyperbolic and chaotic problems on future architectures. The chosen methodology for solving these problems parallel-in-time is multigrid, because multigrid (when it works) is a powerful, optimal, and scalable solver for discretized PDEs. Multigrid is already commonly used in many DOE simulations for scalably and optimally solving space-only PDE problems. The areas of hyperbolic and chaotic problems are chosen because of their relevance to problems of programmatic interest to DOE. However, these problems are also well-known to be difficult for parallel-in-time methods, with the most common method, parareal, diverging in many cases. The current state of-the-art for parallel-in-time at LLNL is the multigrid reduction in time (MGRIT) XBraid package, which also struggles for such problems, while still showing some improvement over parareal. In summary, new methods are needed for an efficient parallel-in-time scheme for hyperbolic and chaotic problems, and this work shall research promising new multigrid methods in this area. In particular, this work shall continue researching the directions from the current collaboration with Dr. Falgout, which are laid out in the work Toward Parallel in Time for Chaotic Dynamical Systems and showed the first known results of a parallel-in-time speedup for a chaotic problem. This work outlines two key improvements to XBraid for chaotic problems, the so-called “theta” and “delta-correction” methods. Here, these two improvements will be further researched and improved (including with a new relaxation method inspired by on Least Squares Shadowing (LSS)) and explored for more complicated problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Quantum utility in simulating the real-time dynamics of the Fermi–Hubbard model using superconducting quantum computers

The Fermi–Hubbard model is a fundamental model in condensed matter physics that describes strongly correlated electrons. On the other hand, quantum computers are emerging as powerful tools for exploring the complex dynamics of these quantum many-body systems. In this work, we demonstrate the quantum simulation of the one-dimensional Fermi–Hubbard model using IBM's superconducting quantum computers, employing over 100 qubits. We introduce a first-order Trotterization scheme and extend it to an optimized second-order Trotterization for the time evolution in the Fermi–Hubbard model, specifically tailored for the limited qubit connectivity of quantum architectures, such as IBM's platforms. Notably, both Trotterization approaches are scalable and maintain a constant circuit depth at each Trotter step, regardless of the qubit count, enabling us to precisely investigate the relaxation dynamics in the Fermi–Hubbard model by measuring the expectation value of the Néel observable (staggered magnetization) for time-evolved quantum states. Lastly, our successful measurement of expectation values in such large-scale quantum many-body systems, especially at longer time scales with larger entanglement, highlights the quantum utility of superconducting quantum platforms over conventional classical approximation methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

QuYBE - An Algebraic Compiler for Quantum Circuit Compression

QuYBE is an open-source algebraic compiler for the compression of quantum circuits. It has been applied for the efficient simulation of the Heisenberg Hamiltonian on quantum computers. Currently, it can simulate the time dynamics of one-dimensional chains. It includes modules to generate the quantum circuits for the above as well as produce the compressed circuits, which are independent of the time step. It utilizes the Yang-Baxter equation (YBE) to perform the compression. QuYBE enables users to seamlessly design, execute, and analyze the time dynamics of the Heisenberg Hamiltonian on quantum computers. QuYBE is the first step toward making the YBE technique available to a broader community of scientists from multiple domains. The QuYBE compiler is available at https://github.com/ZichangHe/QuYBE.

Gulania, Sahil↗
DOE OSTI2024

Development of Real-Time High-Density Pulsar Data Transmission and Processing for Grid Synchronization

Taking advantage of the extreme stability of the pulsar period, it can serve as the timing source for grid synchronization to compensate for the timing drift instigated by the loss of GPS signal. Nevertheless, the real-time transmission and processing of the pulsar data suffer from its high-frequency data rate, varying from megahertz to gigahertz, resulting in reduced computing speed and increased time delay. To mitigate this issue, the hardware and software frameworks are implemented for the high-density pulsar data transmission and processing for grid synchronization in this research. Initially, the high-density pulsar data is transferred using open-source software. The complementary duty cycle timing module is designed to coordinate the operation of the dual-channel high-speed interface and software. Subsequently, the multiple-threading is applied to the receiving, parsing, and splicing pulsar data. Next, the pulsar signal extraction method is implemented based on the polyphase filterbank and time of arrival estimation. Ultimately, real-time performance verification experiments are carried out for different components under two hardware platforms. Finally, the results demonstrate that only 0.482 s is required for processing 4 Gigabyte data through multiple-threading, which is 3.8 times faster than the single thread. The pulsar signal extraction can also be executed within 707 ms for 4.8 seconds of data, thereby indicating that real-time requirements can be met.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2020

Outcomes of the DOE Workshop on Atmospheric Challenges for the Wind Energy Industry

The U.S. Department of Energy-funded Mesoscale-to-Microscale Coupling (MMC) project team planned and conducted a virtual Workshop on Atmospheric Challenges for the Wind Energy Industry on October 19 and 20, 2020. The goal of the workshop was to forge a dialog with the community, including industry representatives, on how modeling tools are currently being used, the present active atmospheric modeling research in support of wind energy, and required advancements in capabilities and technology to continue to advance wind energy deployment. The workshop was planned in collaboration with an industry advisory panel that included representatives from wind power plant developers, turbine manufacturers, and companies that provide resource assessment and forecasting services. The format of the workshop included panels from government research sponsors, visionaries from industry, and mixed panels of researchers discussing research status and needs. A shared keynote presentation from the Technical University of Denmark experts anchored the second day of the workshop. An emphasis was placed on understanding the research needs in the offshore environment. In addition, breakout opportunities were provided each day. On the first day, the breakout discussions addressed predesigned questions configured to elicit participants’ thoughts on needed research directions. The second-day breakouts treated three important technical topics through a combination of presentations and group conversations. Each workshop participant chose their breakout preference from among downscaling details, modeling for turbines, and using artificial intelligence for atmospheric modeling. The discussions were robust and productive. The outcomes of the workshop include archiving a series of recommendations from industry and the research community on research directions required to further advance wind energy deployment. Discussions confirmed the need for high-fidelity modeling but that there are specific areas of applicability and other areas where the time and cost of computation is prohibitive. In those cases, the high-fidelity models can inform low-order models that are more practical for real-time or widely deployed applications. Industry must consider the financial cost of performing more expensive modeling approaches, but industry engineers and researchers are using these approaches where there appears to be a return on investment. An emerging type of low-order model is based on machine learning (ML). Participants confirmed that there are many atmospheric phenomena that need to be modeled better, including low-level jets, cold air outbreaks, land-sea induced circulations, diurnal variability, thin stable boundary layers, dynamic changes such as from frontal passage, interaction of wakes and blockage, and more. For the offshore environment, there is wide agreement that some level of ocean-wave-atmospheric coupling is necessary to capture variations in rotor-level winds needed to plan and operate offshore wind plants. Another recurring recommendation is that more observations are needed, particularly for the offshore environment. Those observations should consider the needs for model improvement, both for physically based models and for ML models. Observations must capture atmospheric profiles of variables that are important to understanding and modeling atmospheric and oceanic phenomena that impact boundary layer winds. Models must be validated with data and the uncertainty quantified, particularly those that are sensitive to initial and boundary conditions. Finally, a repeated request was to consider the holistic needs of hybrid plants of wind, solar, and storage resources because those types of plants are likely to be the wave of the future. In addition, industry wishes to understand impacts of the resource under a changing climate for long-term planning.

17 WIND ENERGY↗
DOE OSTI2020

Cutting the Deployment Costs of Physics-Based MPC in Buildings by Simulation-Based Imitation Learning

It has been shown that model predictive control (MPC) is a promising solution for energy-efficient building operations. However, the deployment of MPC in a large portion of the building stock has not been possible partially because of high installation costs. Every building is unique and requires a tailored MPC solution. The best performing solutions are often based on physics-based modeling, which is, however, computationally expensive and requires dedicated software. A promising direction that tackles this problem is to train a neural network-based optimal control policy to imitate the behavior of physics-based MPC from the simulation data generated offline. The neural networks give control actions that closely approximate those produced by physics-based MPC, but with a fraction of the computational and memory requirements and without the need for licensed software. The main advantage of the proposed approach stems from simple evaluation at execution time, leading to low computational footprints and easy deployment on embedded HW platforms. In the case study, we present the energy savings potential of physics-based MPC applied to an office building in Belgium. We demonstrate how neural network approximators can be used to cut the implementation and maintenance costs of MPC deployment without compromising performance. We also critically assess the presented approach by pointing out the remaining challenges and open research questions.

Drgona, Jan↗
DOE OSTI2021

Autoignition of Premixed Liquefied Petroleum Gas in a Rapid Compression Machine: Experimental Results and Chemical Kinetic Mechanism Reduction

Liquefied petroleum gas (LPG) has many properties that make it an attractive alternative fuel such as lower cost than conventional fuels and an established distribution infrastructure. The development of high efficiency, spark ignited LPG engines is currently limited by engine knock and misfire. The knock and misfire limits are further complicated by the wide range of chemical reactivity in LPG, particularly in international markets. In this study, a rapid compression machine (RCM) was used to characterize the effects of variation in LPG fuel reactivity, equivalence ratio, and exhaust gas recirculation (EGR) on autoignition of LPG/oxidizer/inert/EGR blends. Experiments were conducted with 100% propane (C3H8) and blends of propane with propene, ethane, isobutane, and n-butane. EGR was simulated with mixtures of Ar, CO2, CO, and NO at substitution percentages from 0 to 30 mass percent. Equivalence ratio was varied from 0.75 to 1.5. Ignition delay period under homogeneous autoignition conditions was measured at compressed pressures and temperatures of 23 to 25 bar and 701 to 921 K, respectively. Zero-dimensional simulations of the RCM experiments were performed using Chemkin with several detailed chemical kinetic mechanisms to determine their suitability at predicting ignition delay periods. Multiple reduced chemical kinetic mechanisms were created from the NUIGMech1.1 mechanism to determine the optimal balance between accuracy and computational efficiency for future three-dimensional, time-dependent spark-ignited engine computations.

42 ENGINEERING↗
DOE OSTI2026

Image processing workflow yielding high contrast synchrotron nanoscale computed tomography data from Ni-YSZ electrodes

The operating lifetime of Ni-YSZ fuel electrodes used in solid oxide electrolysis cells and fuel cells (SOECs and SOFCs) is limited by Ni redistribution, one of the primary degradation mechanisms that must be overcome to extend the longevity and maximize the performance of SOECs and SOFCs. To achieve this, 3D microstructural data is needed to relate both initial performance and performance loss over time to microstructural properties and their evolution throughout operation under various conditions. However, 3D microstructure data remains relatively scarce within the literature due to multiple challenges in acquiring and analyzing such data reliably. This work presents a workflow for acquiring and processing synchrotron X-ray nanoscale computed tomography (nano-CT) data from Ni-YSZ electrodes. Parameters for each step in the nano-CT workflow are described up to the final result (a 3D reconstruction), with particular emphasis on image alignment using freely available software. Following the results of a parametric sweep of the image alignment step, high contrast, low signal-to-noise 3D nano-CT data is obtained with relatively short compute times. While the exact methods best suited to samples with different microstructural qualities, or similar Ni-YSZ nano-CT data obtained from other sources may deviate from the solution found herein, this work also generalizes the decision points and evaluation of each step to provide a starting point to adapt this workflow to other datasets.

08 HYDROGEN↗
DOE OSTI2025

Coupling flux balance analysis with reactive transport modeling through machine learning for rapid and stable simulation of microbial metabolic switching

Integrating genome-scale metabolic networks with reactive transport models (RTMs) provides a detailed description of the dynamic changes in microbial growth and metabolism. Despite promising demonstrations in the past, computational inefficiency has been pointed out as a critical issue to overcome because it requires repeated application of linear programming (LP) to obtain flux balance analysis (FBA) solutions in every time step and spatial grid. To address this challenge, we propose a new simulation method where we train and validate artificial neural networks (ANNs) using randomly sampled FBA solutions and incorporate the resulting surrogate FBA model (represented as algebraic equations) into RTMs as source/sink terms. We demonstrate the efficiency of our method via a case study of Shewanella oneidensis MR-1. During aerobic growth on lactate, S. oneidensis produces metabolic byproducts (such as pyruvate and acetate), which are subsequently consumed as alternative carbon sources when the preferred nutrients are depleted. To effectively simulate these complex dynamics, we used a cybernetic approach that models metabolic switches as the outcome of dynamic competition among multiple growth options. In both zero-dimensional batch and one-dimensional column configurations, the ANN-based surrogate models achieved substantial reduction of computational time by several orders of magnitude compared to the original LP-based FBA models. Moreover, the ANN models produced robust solutions without any special measures to prevent numerical instability. These developments significantly promote our ability to utilize genome-scale networks in complex, multi-physics, and multi-dimensional ecosystem modeling.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2022

WinnowML: Stable feature selection for maximizing prediction accuracy of time-based system modeling

Online deep learning (ODL) has become an important methodology for modeling time-based performance of computer systems. An open problem is the intelligent selection of features from raw workload traces of computer systems. The best methods are overly sensitive to noisy data, causing frequent feature changes and re-training. Using all available features inflates training time and introduces model artifacts if some features should have been dropped. We present WinnowML, a method for automatically determining the most relevant feature subset for a predictive time-series model. WinnowML combines existing feature ranking algorithms and a history of each feature's ranking to iteratively rank a feature set to lower prediction error and maximize long term relevance. From this ranked feature set, the most relevant and stable subset is selected to train a model. Experimentally, we show how WinnowML can lower a model's mean absolute relative error up to 42% on average compared to the closest performing approach. Additionally, we lower the fluctuation in feature ranking and selection up to 65%. We also demonstrate how to combine WinnowML and a model search tool to provide improvements in performance of up to 14.5% when compared to using all the feature available.

Bel, Oceane MS↗
DOE OSTI2024

Advancements in Multiphysics Microdepletion Analysis of an eVinci TM -like Microreactor Leveraging OpenMC-CRAB Workflow

Nuclear microreactors (MRs) are a class of nuclear reactor technology, characterized by reduced dimensions, modular design, and reduced power output in contrast to conventional Light Water Reactors (LWRs). MRs are proposed for supplying electricity and eventual process heat to remote locations, such as military installations and disaster-affected areas. Current research work sponsored by the US Department of Energy Microreactor Program (MRP) is devoted to the development of novel modeling and simulation tools to better support MR vendors and regulatory bodies. Notably, the NRC is projected to utilize the CRAB multiphysics software driver for executing both design and beyond-design-basis accident analyses. Furthermore, the NRC has been utilizing the MELCOR code to calculate mechanistic source terms during accidents. Since MELCOR relies on isotopic inventory and reactor temperature/power profiles under accident conditions, which theoretically can be derived from CRAB, the goal is to establish a comprehensive CRAB-MELCOR computational framework. Past work was focused on testing and demonstrating CRAB's capability to generate results that can be used to inform mechanistic source term calculations in MELCOR. In particular, a computational workflow leveraging OpenMC-generated microscopic cross sections and CRAB was first applied to perform multiphysics microscopic depletion calculation followed by an accident scenario for a stylized microreactor problem. In fiscal year 2024, the research work has been focused on applying the OpenMC-CRAB workflow, which was first tested in fiscal year 2023, to a realistic 3D heat-pipe cooled MR problem representative of the eVinci TM design. The latter computational problem was developed with inputs from WEC to conserve selected neutronic and thermal characteristics of the eVinci TM design without releasing proprietary data. The results of this simulation, encompassing isotopic inventory, power density distribution, and kinetic parameters, will inform both MELCOR and the WEC-developed FATE code for mechanistic source terms calculations. The results from the two codes will then be compared for code verification purposes. This report contains the design characteristics of the realist heat pipe cooled microreactor developed as a use-case for the verification exercise, and the current results for the multiphysics microscopic depletion performed with the OpenMC-CRAB workflow. The results include eigenvalue as a function of time, power distribution at EOL, in addition to nuclides inventory's time evolution and spatial distribution. Finally, we report improvements to the workflow efficiency achieved through a collaboration with the NEAMS programs. Through this collaborative effort, we were able to strongly decrease the computational time for the multiphysics microdepletion calculation (i.e., from 17.4 hours to 5.7 hours on 280 processors) in addition to simplifying the interface to generate isotopics spatial distribution utilizable by FATE and MELCOR. Future work, including the improvement of the current microscopic cross-sections' library and the simulation of an accident scenario at EOL, is also discussed.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2022

Multi-Fidelity Stochastic Economic Dispatch for Operating Low Carbon Power Grids

Grid operators can address the inherently stochastic nature of renewables by solving a two-stage stochastic programming model that minimizes the cost of dispatch decisions while accounting for the complex grid dynamics. It is common to use a sample average approximation to estimate the expectation of the second stage costs in this model. However, the large sample count needed for numerical accuracy makes effective modeling large-scale electric grids computationally intractable. We introduce a control variate multi-fidelity estimator for the second-stage recourse that enables high quality dispatch decisions in real-time with a reduced computational burden. We obtain a hierarchy of model fidelities by linearizing the AC power flow system representation to DC power flow, and by relaxing transmission and voltage network constraints. We evaluate the performance of our proposed method on a synthetic grid with 73 buses against a deterministic baseline with persistence forecast and a high-fidelity reference. Our analysis shows a computational speed-up of 7.62x with a minimal loss in accuracy. The multi-fidelity method is well suited to fidelity combinations that use a simplified network topology in their lower fidelity model and is an attractive option for applications where accurate grid modeling needed on a limited computational budget.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

Network Anomaly Detection Using Federated Learning

The internet is turning out to be an integral part of every-one's lives as more and more devices are being connected to serve societal needs. Our work is motivated by two ma-jor observations. Firstly, one drawback of connecting to the network is the threat of network attacks that can compromise users' private information, leading to data loss and adversely affecting productivity. There are several traditional security mechanisms to defend against these attacks, such as firewalls, virtual private networks (VPNs), demilitarized zones (DMZs), and vulnerability scanners. One way to prevent these attacks is early detection and prevention. However, these kinds of architecture do not scale very well because of their centralized nature. Secondly, we observe from heuristics and data set distributions that the majority of the requests made to a server are innocuous. Therefore, almost all server request data sets are highly imbalanced, weighted highly towards the harmless requests.

Marfo, William↗