Results for “algorithm timings” — Page 18

DOE OSTI2026

Ensemble Federated Machine Learning‐Based Cybersecurity Situational Awareness in Microgrid Network

Cyber-physical microgrids are vulnerable to stealthy cybersecurity threats that disguise their actions through the exploitation of system knowledge. Such actions can severely impacts microgrids deployed in defense bases, slowing the response time of military forces during national emergencies. Several machine-learning algorithms have been proposed to detect intrusions in the grid networks; however, these traditional machine-learning algorithms lack data privacy and are subject to several adversarial machine-learning threats. This paper proposes a novel federated machine learning (FML)-based three-model framework to detect and identify stealthy data-integrity attacks while ensuring data privacy in microgrid networks. The proposed architecture uses a variational mode decomposition technique to extract derived features from incoming measurement and control datasets. The extraction of these derived features allows FML models to learn minute variations in data patterns that allow them to perform significantly better than the models trained with generic datasets consisting of raw features. Our experimental results show the efficient performance of the proposed methodology against different types of data integrity attacks while considering primary and secondary controllers in microgrids. Further, the applied FML-integrated random forest ensemble algorithm outperforms the existing generic FML algorithms during noisy and noise-free datasets with prediction latencies of only 91–134 µs per sample within the 0.1 s sampling interval and requires communication bandwidth of around ∼8.25 KB/s at the control center and ∼2.7 KB/s per edge client for communication.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2025

Unified ELM Suppression on KSTAR and DIII-D via Adaptive Feedback Control Strategies

This paper reports on the extension of our amplitude-based resonant magnetic perturbation (RMP) edge localized mode (ELM) controller to support phasing control (relative toroidal phases of RMP waveforms between rows of coils), multiple toroidal mode numbers, and new ‘jump’ and ‘probing’ strategies, all deployed on KSTAR and DIII-D. By treating the control algorithm as device-independent and adjusting only the real-time interfaces to sensors and power supplies, we have confirmed that the same finite state machine—based feedback logic can be ported between machines with minor modifications. In experiments using n = 2 RMPs on KSTAR and n = 3 on DIII-D, the controller successfully modulated RMP amplitudes in real time to sustain ELM suppression while minimizing confinement degradation. Phasing control broadened the suppression window, as it permitted the system to avoid locked-mode regions and safely access ELM-free conditions. A rotating RMP phasing scheme, integrated into the same framework, distributes divertor heat loads more uniformly, making it a promising strategy for protecting plasma-facing components during long discharges. New ‘jump’ and ‘probing’ techniques demonstrate the possibility for the controller to preempt imminent ELMs and refine the minimum required RMP amplitude without returning to ELMy conditions. Taken together, these upgrades enable extended ELM-free operation while mitigating confinement degradation, providing a practical framework for real-time ELM control in future high-performance tokamaks.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2025

SVM-Based Synchronized Fault Detection for 100% Renewable Microgrids

Traditional protection schemes face significant challenges when applied to microgrids with high penetrations of renewables with inverter-based resources (IBRs). The proliferation of advanced sensing and communication technologies has generated copious data, offering an opportunity to overcome these limitations using data-driven machine learning approaches. This work proposes a novel approach based on a support vector machine (SVM) for detecting faults within a 100% renewable microgrid. The approach encompasses a systematic offline training stage for the development of a linear SVM-based fault detection algorithm. This process covers offline data collection from the microgrid under study, the extraction of features such as positive- and negative-sequence components and the total harmonic distortion of the voltage and current measurements of the relays, and the design of the linear SVM-based classifier. During the online implementation, however, different classifiers can exhibit asynchronicity in detecting the fault inception at different subcycle-to-cycle period-level delays. To circumvent this asynchronicity issue, a separate algorithm is developed for each relay to estimate the fault inception time as close to the real fault time. The performance of the proposed SVM-based synchronized fault detection method is evaluated using online time-domain simulation studies on a microgrid test system. The results corroborate the reliability of the fault detection scheme when tested under various fault cases (fault types, locations, and impedances) and non-fault cases during both grid-tied and islanded operation modes.

100% microgrid↗

DOE OSTI2024

SVM-Based Synchronized Fault Detection for 100% Renewable Microgrids: Preprint

Traditional protection schemes face significant challenges when applied to microgrids with high penetrations of renewables with inverter-based resources (IBRs). The proliferation of advanced sensing and communication technologies has generated copious data, offering an opportunity to overcome these limitations using data-driven machine learning approaches. This work proposes a novel approach based on a support vector machine (SVM) for detecting faults within a 100% renewable microgrid. The approach encompasses a systematic offline training stage for the development of a linear SVM-based fault detection algorithm. This process covers offline data collection from the microgrid under study, the extraction of features such as positive- and negative-sequence components and the total harmonic distortion of the voltage and current measurements of the relays, and the design of the linear SVM-based classifier. During the online implementation, however, different classifiers can exhibit asynchronicity in detecting the fault inception at different subcycle-to-cycle period-level delays. To circumvent this asynchronicity issue, a separate algorithm is developed for each relay to estimate the fault inception time as close to the real fault time. The performance of the proposed SVM-based synchronized fault detection method is evaluated using online time-domain simulation studies on a microgrid test system. The results corroborate the reliability of the fault detection scheme when tested under various fault cases (fault types, locations, and impedances) and non-fault cases during both grid-tied and islanded operation modes.

100% microgrid↗

DOE OSTI2024

AI/ML Expo Boosting Job Performance with AI: Innovative Approaches and Success Stories

Our technology leverages artificial intelligence (AI) to enhance the user experience in High Performance Computing (HPC) environments. By analyzing user behavior and providing personalized recommendations, our AI system helps HPC users optimize their workflows and improve productivity. Additionally, we offer an advanced image similarity search feature, which utilizes AI algorithms to identify and retrieve visually similar images, saving users valuable time and effort in their research and analysis.

97 - MATHEMATICS AND COMPUTING↗

DOE OSTI2025

ENnUI : Exemplar Navigator Using Inertial Sensors

SAND2025-04794O ENnUI: Exemplar Navigator Using Inertial Sensors helps users understand and compare different navigation algorithms that rely on inertial sensors. This reference library offers a collection of reference mechanization equations and methods for estimating the position and movement of vehicles over time. Rather than aiming for the highest precision or performance, ENnUI focuses on creating a user-friendly framework that allows users to benchmark their own algorithms against a standard set of tools. It is useful for post-processing data and real-time navigation solutions. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.

Walker II, Michael [Sandia National Lab. (SNL-CA),↗

DOE OSTI2024

A second-order-in-time, explicit approach addressing the redundancy in the low-Mach, variable-density Navier-Stokes equations

A novel algorithm for explicit temporal discretization of the variable-density, low-Mach Navier-Stokes equations is presented here in this study. Recognizing there is a redundancy between the mass conservation equation, the equation of state, and the transport equation(s) for the scalar(s) which characterize the thermochemical state, and that it destabilizes explicit methods, we demonstrate how to analytically eliminate the redundancy and propose an iterative scheme to solve the resulting transformed scalar equations. The method obtains second-order accuracy in time regardless of the number of iterations, so one can terminate this subproblem once stability is achieved. Hence, flows with larger density ratios can be simulated while still retaining the efficiency, low cost, and parallelizability of an explicit scheme. The temporal discretization algorithm is used within a pseudospectral direct numerical simulation which extends the method of Kim, Moin, and Moser for incompressible flow to the variable-density, low-Mach setting, where we demonstrate stability for density ratios up to ~25.7.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2026

Resilience Through Data-Driven, Intelligent Designed Control: A Formal Methods Approach

The PNNL and GTRI team developed a strategy to integrate temporal logic rule specification for detection of cyber-intrusion in the source code and control algorithms of CPS using advanced cyber-data. The GTRI team utilized its capabilities in rule synthesis and temporal logic specifications for software assurance and verification to detect and predict impact of cyber-intrusions and malware in the computational and control algorithms of cyber-physical systems. The team also developed a testing and verification approach that could be used to validate the suggested approach against a realistic use-case CPS showcasing improvements in system impact prediction performance. Temporal logic offers a compact expression of events in absolute and relative time and has a formalized translation to state machines. As such, temporal logic rules can feasibly be synthesized to any system as a rule engine, with the process being formally verified to be correct. The goal here is to utilize temporal logic rules to detect cyber-attacks and manipulations in the computational algorithms and provide real-time software assurance and verification guarantees.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Aboveground Biomass Estimation Using NISAR Simulated ALOS-2 Time Series Data

Aboveground biomass (AGB) is a critical parameter to better understand the global carbon cycle and to develop sustainable forest management. However, a large uncertainty prevails. L-band SAR data have demonstrated strong potential to accurately retrieve AGB over low-biomass regions (<100 Mg ha-1). The upcoming NASA-ISRO Synthetic Aperture Radar mission will collect data at L- and S-band over earth’s landmass with a repeat period of 12 days, allowing us to have ample data for monitoring biomass and its dynamics. One of the key science requirements of the mission is to produce annual AGB maps at 1-ha resolution with RMS accuracy of 20 Mg/ha for 80 percentage of area over low-biomass regions in Calibration/Validation sites. The NISAR biomass algorithm will generate AGB maps based on the parameterization of semi-empirical model along with NISAR time-series dual pol data (HH and HV). To calibrate and validate the model for mission requirements, the mission will use reference estimates of AGB produced from ground inventory plots and airborne LiDAR data collected over selected sites distributed across different global ecoregions. This paper presents the initial results of the calibration/validation of the NISAR AGB retrieval algorithm over the Lenoir Landing (LENO), Alabama, USA site using NISAR simulated ALOS-2 time series data. Five multi-temporal dual-pol HH and HV NISAR Simulated ALOS 2 data collections were used as input to assess the performance of the model. The model AGB retrieval results shows that the NISAR model was able to achieve RMS accuracy within 20 Mg/ha.

Ramachandran, Naveen [Jet Propulsion Laboratory, C↗

DOE OSTI2025

Direct structural retrieval from gas-phase ultrafast diffraction data using a genetic algorithm

Ultrafast scattering techniques such as ultrafast electron diffraction and ultrafast x-ray diffraction have been utilized to elucidate the structural dynamics, reaction intermediates, and final products in molecular reactions following photoexcitation. The time-dependent structures are typically not directly retrieved from the experimental data, but they rely on comparison with calculations. The genetic algorithm (GA), a global optimization strategy, can be used to retrieve the molecular structures directly from diffraction patterns without any theoretical input. However, the robustness of the GA with respect to real experimental conditions such as a limited momentum transfer range, noise, and artifacts has not been studied in detail. In this work, we characterize the performance of the GA with simulated data that mimic realistic experimental conditions. We have developed and implemented a variant of the GA specific to diffraction measurements which performs better in the presence of imperfect data compared to the standard implementation of the GA. We demonstrate this method with both synthetic data and experimental ultrafast electron diffraction data on the UV-induced photodissociation of trifluoroiodomethane (C⁢F 3⁡ I) molecules.

74 ATOMIC AND MOLECULAR PHYSICS↗

DOE OSTI2025

Time-resolved atomic-resolution Brownian tomography of single nanocrystals reveals size-dependent dynamics

Atomic-resolution structure identification of nanocrystals by graphene liquid cell electron microscopy (GLC-EM) has revealed that small, solubilized platinum nanocrystals consist of an ordered crystalline core surrounded by mobile surface atoms, which dissociate during oxidative etching, resulting in distinct temporal structural states. Requirements imposed by the 3D reconstruction algorithm limit the number of structural states that can be resolved. We introduce a regularized 3D reconstruction algorithm that exploits the redundancy inherent in the experimental data, allowing us to improve the time resolution. Our developments provide a comprehensive molecular picture at unprecedented spatial and temporal resolution of the nonlinear, linear, and fluctuating dynamic phenomena that single nanocrystals undergo during the GLC-EM experiment. We determined atomic structures of 66 temporal structural states, extracted from 15 time trajectories of individual nanocrystals. Large (478 to 698 atoms) and small (<300 atoms) nanocrystals show etching that preserves a stable core, whereas mid-sized (351 to 571 atoms) nanocrystals present dynamics that change the coordination of the core.

Meana-Pañeda, Rubén↗

DOE OSTI2024

Automated Operational Forecasting of Monsoon Low Pressure Systems

Monsoon low pressure systems (LPSs) are the dominant rain-bearing weather system of South Asia, often producing extreme precipitation and hydrological disasters in a region inhabited by nearly two billion people. Despite the importance of these storms, no operational system has automatically identified and tracked LPS in real time in numerical weather prediction model output; many commonly used vortex-tracking algorithms are ill suited for monsoon LPS because of the weak winds and cold cores of these systems. Here, we describe a new system that uses optimized algorithms to identify monsoon LPS in short- to medium-range forecasts from the U.S. Global Ensemble Forecast System (GEFS) and a version of the deterministic Global Forecast System (GFS) adapted and used operationally by the Indian Institute of Tropical Meteorology (IITM). We also assess the historical performance of these models in forecasting South Asian monsoon LPS, comparing this with the performance of the Integrated Forecasting System of the ECMWF. We assess the accuracy of model predictions of LPS genesis, position, intensity, and precipitation rates for forecast lead times of 1–5 days, yielding quantitative information on model biases to guide operational forecasters and disaster managers. The system we introduce here could be extended to other low-latitude regions affected by dynamically weak, heavily precipitating atmospheric vortices that are often not included in tropical cyclone inventories.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2026

A multigigabit link layer protocol for single picosecond latency determinism using AMD ultrascale+ GTH and GTY transreceivers

recision timing distribution systems require determin istic and repeatable high speed serial data link latency. The EIC Timing Data Link will employ a specialized link layer protocol for deterministic multigigabit communication us ing AMD Ultrascale+ GTH and GTY transceivers. Link la tency must also be measurable to accurately compensate in real time for latency variations of the physical medium. The point-to-point link is full duplex and fully synchronous with a latency control algorithm to align the internal clocks of each system with picosecond resolution. Deterministic clock domain crossing between systems is ensured using static timing analysis of the elastic buffer control signals.

43 PARTICLE ACCELERATORS↗

DOE OSTI2025

Filling data analysis gaps in time-resolved crystallography by machine learning

There is a growing understanding of the structural dynamics of biological molecules fueled by x-ray crystallography experiments. Time-resolved serial femtosecond crystallography (TR-SFX) with x-ray Free Electron Lasers allows the measurement of ultrafast structural changes in proteins. Nevertheless, this technique comes with some limitations. One major challenge is the quality of data from TR-SFX measurements, which often faces issues like data sparsity, partial recording of Bragg reflections, timing errors, and pixel noise. To overcome these difficulties, conventionally, large volumes of data are collected and grouped into a few temporal bins. The data in each bin are then averaged and paired with the mean of their corresponding jittered timestamps. This procedure provides one structure per bin, resulting in a limited number of averaged structures for the entire time interval spanned by the experiment. Therefore, the information on ultrafast structural dynamics at high temporal resolution is lost. This has initiated research for advanced methods of analyzing experimental TR-SFX data beyond the standard binning and averaging method. To address this problem, we use a machine learning algorithm called Nonlinear Laplacian Spectral Analysis (NLSA), which has emerged as a promising technique for studying the dynamics of complex systems. In this work, we demonstrate the power of this algorithm using synthetic x-ray diffraction snapshots from a protein with significant data incompleteness, timing uncertainties, and noise. Our study confirms that NLSA is a suitable approach that effectively mitigates the effects of these artifacts in TR-SFX data and recovers accurate structural dynamics information hidden in such data.

Trujillo, Justin (ORCID:0000000285505360)↗

DOE OSTI2025

Quantum computing for energy correlators

In recent years, energy correlators have emerged as powerful observables for probing the fragmentation dynamics of high-energy collisions. We introduce the first numerical strategy for calculating energy correlators using the Hamiltonian lattice approach, providing access to the intriguing nonperturbative dynamics of these observables. Furthermore, motivated by rapid advances in quantum computing hardware and algorithms, we propose a quantum algorithm for calculating energy correlators in quantum field theories. This algorithm includes ground state preparation, the application of source, sink, energy flux and real-time evolution operators, and the Hadamard test. We validate our approach by applying it to the SU(2) pure gauge theory in 2 + 1 dimensions on 3 × 3 and 5 × 5 honeycomb lattices with 𝑗 max = $\frac{1}{2}$ at various couplings, utilizing both classical methods and the quantum algorithm, the latter tested using the IBM emulator for specific configurations. The results are consistent with the expected behavior of the strong coupling regime and motivate a more comprehensive study to probe the confinement dynamics across the weak and strong coupling regimes.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2024

Cross-correlation image analysis for real-time single particle tracking

Accurately measuring the translations of objects between images is essential in many fields, including biology, medicine, chemistry, and physics. One important application is tracking one or more particles by measuring their apparent displacements in a series of images. Popular methods, such as the center of mass, often require idealized scenarios to reach the shot noise limit of particle tracking and, therefore, are not generally applicable to multiple image types. More general methods, such as maximum likelihood estimation, reliably approach the shot noise limit, but are too computationally intense for use in real-time applications. These limitations are significant, as real-time, shot-noise-limited particle tracking is of paramount importance for feedback control systems. To fill this gap, we introduce a new cross-correlation-based algorithm that approaches shot-noise-limited displacement detection and a graphics processing unit-based implementation for real-time image analysis of a single particle.

Instruments & Instrumentation↗

DOE OSTI2024

Development of Segregated Thermal-Hydraulics Solvers in MOOSE

The simulation of fluid flows is an essential part of the design and analysis of nuclear systems. Algorithms able to simulate flows at different fidelity levels are available in the Multiphysics Object-Oriented Simulation Environment (MOOSE) and MOOSE-based applications such as Pronghorn \cite{novak2018pronghorn}, Pronghorn-Subchannel, RELAP-7, and SAM. Currently, significant effort is being invested in the development of coarse-mesh Computational Fluid Dynamics (CFD) capabilities within MOOSE and Pronghorn for the simulation of Generation IV nuclear reactors. Traditionally, the solution algorithms in MOOSE have relied on Newton or quasi-Newton methods (such as the preconditioned Jacobian-free Newton-Krylov method) where residuals and Jacobians (or approximations thereof) are constructed. Both Newton and quasi-Newton methods require the solution of a linear system at each nonlinear Newton iteration with the Jacobian as the system matrix. The Jacobian contains blocks originating from all variables in the problem (i.e., for thermal-hydraulics at least pressure, velocities, and temperature). Due to the formulation of the problem in a general multiphysics setting on unstructured mesh, creating a good preconditioner for the linear system can be challenging, thus many fluid applications have utilized direct solver-based methods such as LU factorization. However, with increasing system size and complexity in multi-dimensional problems, the direct solution of linear systems becomes computationally expensive both in execution time and and memory. For this reason, recent effort has focused on adapting segregated solution algorithms for CFD problems in MOOSE. These algorithms use fixed-point iteration between segregated systems whose assembly and preconditioning are easier those of the monolithic system. Initial results show that the segregated solution algorithm outperforms the monolithic approach in terms of memory usage and for large 3D problems in terms of CPU time as well.

42 ENGINEERING↗

DOE OSTI2024

Development of Segregated Thermal-Hydraulics Solvers in MOOSE

The simulation of fluid flows is an essential part of the design and analysis of nuclear systems. Algorithms able to simulate flows at different fidelity levels are available in the Multiphysics Object-Oriented Simulation Environment (MOOSE) and MOOSE-based applications such as Pronghorn \cite{novak2018pronghorn}, Pronghorn-Subchannel, RELAP-7, and SAM. Currently, significant effort is being invested in the development of coarse-mesh Computational Fluid Dynamics (CFD) capabilities within MOOSE and Pronghorn for the simulation of Generation IV nuclear reactors. Traditionally, the solution algorithms in MOOSE have relied on Newton or quasi-Newton methods (such as the preconditioned Jacobian-free Newton-Krylov method) where residuals and Jacobians (or approximations thereof) are constructed. Both Newton and quasi-Newton methods require the solution of a linear system at each nonlinear Newton iteration with the Jacobian as the system matrix. The Jacobian contains blocks originating from all variables in the problem (i.e., for thermal-hydraulics at least pressure, velocities, and temperature). Due to the formulation of the problem in a general multiphysics setting on unstructured mesh, creating a good preconditioner for the linear system can be challenging, thus many fluid applications have utilized direct solver-based methods such as LU factorization. However, with increasing system size and complexity in multi-dimensional problems, the direct solution of linear systems becomes computationally expensive both in execution time and and memory. For this reason, recent effort has focused on adapting segregated solution algorithms for CFD problems in MOOSE. These algorithms use fixed-point iteration between segregated systems whose assembly and preconditioning are easier those of the monolithic system. Initial results show that the segregated solution algorithm outperforms the monolithic approach in terms of memory usage and for large 3D problems in terms of CPU time as well.

42 ENGINEERING↗