Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithm testing”

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 109 records · Page 6

An algorithmic approach to predicting mechanical draft cooling tower fan speeds from infrasound signals

Mechanical draft cooling towers (MDCTs) serve a critical heat management role in a variety of industries. For nuclear reactors in particular, the consistent, predictable operation of MDCTs is required to avoid damage to infrastructure and reduce the potential for catastrophic failure. Accurate, reliable measurement of MDCT fan speed is therefore an important maintenance and safety requirement. To that end, we have developed an algorithm for automatically predicting the rotational speeds of multiple, simultaneously operating fan rotors using contactless, infrasound measurements. The algorithm is based on identifying the blade passing frequencies (BPFs), their harmonics, as well as the motor frequencies (MFs) for each fan in operation. Using the algorithm, these frequencies can be automatically identified in the acoustic waveform’s short-time Fourier transform spectrogram. Attribution is aided by a set of filters that rely on the unique spectral and temporal characteristics of fan operation, as well as the intrinsic frequency ratios of the BPF harmonics and the BPF/MF signals. The algorithm was tested against infrasound data acquired from infrasound sensors deployed at two research reactors: the Advanced Test Reactor (ATR) located at Idaho National Laboratory (INL) and the High Flux Isotope Reactor (HFIR) located at Oak Ridge National Laboratory (ORNL). After manually identifying the MDCT gearbox ratio, the algorithm was able to quickly yield fan speeds at both reactors in good agreement with ground truth. Ultimately, this work demonstrates the ease by which MDCT fans may be monitored in order to optimize operational conditions and avoid infrastructure damage.

42 ENGINEERING↗

General algorithm for characterization of donor-acceptor pair recombination processes in solid-state materials

Radiative recombination processes can occur in solid-state systems through the pairing of donor and acceptor defects of the lattice. Recently, donor-acceptor pairs (DAP) have been proposed as promising candidates for quantum applications, and their signature has been observed in emerging low-dimensional materials. Therefore, the identification of such processes is gaining interest and requires methods to efficiently and reliably characterize them. Here, we introduce a general algorithm to identify DAP processes starting from the experimental photoluminescence (PL) emission spectrum and basic material parameters, including the lattice structure and dielectric constant. The algorithm recognizes possible DAP transitions from the emission pattern in the spectrum and returns the characteristic energy of the DAP transition and the separation between the donor and acceptor sites. By testing the algorithm on the photoluminescence spectrum of hexagonal boron nitride (hBN), we show that our method is robust against experimental errors and adds new capabilities to the investigation toolbox of semiconductors and their optical properties.

36 MATERIALS SCIENCE↗

An Adaptive Reference Scheme to Extend the Functional Range of Optical Backscatter Reflectometry in Extreme Environments

Optical frequency domain reflectometry (OFDR) measurements are performed by recording the interference pattern of light backscattered by density fluctuations or Bragg gratings along the length of an optical fiber. Changes in local temperature or strain in the fiber cause shifts in the backscattered light spectrum, which can be calibrated to the applied temperature or strain. Comparing the backscattered optical spectra from each reflection site with a reference (unstrained) spectrum allows for quantification of local spectral shifts. While mature OFDR-based technologies can provide high-precision spatially distributed measurements over kilometer lengths, the post-processing approaches used to recover spectral shifts from raw optical intensity data can limit the use of OFDR in harsh environments. This paper presents a novel approach to post-processing OFDR data which extends the usability of optical fibers exposed to harsh environments. This approach is the first to use the spectral shift quality, calculated for two OFDR measurements, to identify an appropriate reference scan from which the spectral shift can be determined. Here, three experimental data sets are used to test the algorithm: (1) an optical fiber heated to >950°C, (2) an aluminum-embedded optical fiber under strain from differential thermal expansion, and (3) an optical fiber exposed to a total neutron flux of 2×10 13 n/cm 2 /s over 40 hours in a nuclear test reactor. Results show that using a metric of quality to select an appropriate reference measurement extends the functional range of OFDR strain and temperature sensors. Furthermore, this algorithm can be applied to existing OFDR data.

47 OTHER INSTRUMENTATION↗

Automated fault detection of residential air-conditioning systems using thermostat drive cycles

Residential air conditioning equipment comprises a significant portion of the total energy consumption of a home. Unfortunately, air-conditioning systems can be susceptible to faulty operation either from installation errors or faults that accrue over the equipment’s lifetime. This paper presents a novel automated fault detection algorithm for residential air-conditioning systems that can alert the homeowner of the presence of these faults. The proposed algorithm utilizes only the home’s thermostat and outside air temperature to perform automated fault detection over the course of the equipment’s lifetime, including immediately after installation. The algorithm uses an extended Kalman filter approach to identify a three-resistor, two-capacitor (3R2C) electrical equivalent thermodynamic model. The identified 3R2C model is used to predict cooling times during a testing period comprising of a series of thermostat drive-cycle experiments. We tested the algorithm on an EnergyPlus™ model of a typical residential building in Orlando, Florida. Duct faults, indoor airflow faults, and refrigerant undercharge faults were introduced into the building model one at a time. The algorithm was able to accurately determine duct-leak faults, 40% airflow faults, 40% undercharge faults, and no-fault cases with an accuracy of 70%, 77%, 82%, and 87%, respectively.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

New particle pusher with hadronic interactions for modeling multimessenger emission from compact objects

We propose novel numerical schemes based on the Boris method in curved spacetime, incorporating both hadronic and radiative interactions for the first time. Once the proton has lost significant energy due to radiative and hadronic losses, and its gyroradius has decreased below typical scales on which the electromagnetic field varies, we apply a guiding center approximation (GCA). We fundamentally simulate collision processes either with a Monte-Carlo method or, where applicable, as a continuous energy loss, contingent on the local optical depth. To test our algorithm for the first time combining the effects of electromagnetic, gravitational, and radiation fields including hadronic interactions, we simulate highly relativistic protons traveling through various electromagnetic fields and proton backgrounds. We provide unit tests in various spatially dependent electromagnetic and gravitational fields and background photon and proton distributions, comparing the trajectory against analytic results. We propose that our method can be used to analyze hadronic interactions in black hole accretion disks, jets, and coronae to study the neutrino abundance from active galactic nuclei.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Adaptive Determination of the Optimal Exchange Location in Wall-Modeled Large-Eddy Simulation

Wall-modeled large-eddy simulation introduces a modeling interface (or exchange location) separating the wall-modeled layer from the rest of the domain. The current state-of-the-art is to rely on user expertise when choosing where to place this modeling interface, whether this choice is tied to the grid or not. This paper presents a postprocessing algorithm that determines the exchange location systematically. The algorithm is based on a model for the error in the predicted wall shear stress and a model for the computational cost, and then finds the exchange location that minimizes a combination of the two. Here, the algorithm is tested both a priori and a posteriori using an equilibrium wall model for the flow over a wall-mounted hump, a boundary layer in an adverse pressure gradient, and a shock/boundary-layer interaction. The algorithm produces exchange locations that mostly agree with what an experienced user would suggest, with thinner wall-modeled layers in nonequilibrium flow regions and thicker wall-modeled layers where the boundary layer is closer to equilibrium. This suggests that the algorithm should be useful in simulations of realistic and highly complex geometries.

42 ENGINEERING↗

Almost-Rigidity of Frameworks

Here, we extend the mathematical theory of rigidity of frameworks (graphs embedded in d-dimensional space) to consider nonlocal rigidity and flexibility properties. We provide conditions on a framework under which (I) as the framework flexes continuously it must remain inside a small ball, a property we call “almost-rigidity”; (II) any other framework with the same edge lengths must lie outside a much larger ball; (III) if the framework deforms by some given amount, its edge lengths change by a minimum amount; (IV) there is a nearby framework that is prestress stable, and thus rigid. The conditions can be tested efficiently using semidefinite programming. The test is a slight extension of the test for prestress stability of a framework, and gives analytic expressions for the radii of the balls and the edge length changes. Examples illustrate how the theory may be applied in practice, and we provide an algorithm to test for rigidity or almost-rigidity. We briefly discuss how the theory may be applied to tensegrities. © 2020 Wiley Periodicals LLC.

97 MATHEMATICS AND COMPUTING↗

Advanced System Thermal Fluids Solver Development for SAM

This work summarizes a feasibility study on testing numerical algorithms that are suitable and efficient for advanced system analysis code development under the mutli-physics framework, MOOSE. The key is the implementation of a high-order one-dimensional staggered-grid finite volume method (SG-FVM), and its direct interaction with the linear/nonlinear solver, PETSc. Leveraging the existing capabilities of the SAM code, significant code coverages were established in the finite volume method code. This in turn allows for a suite of test problems with different problem sizes and levels of complexity to be used to quantify the performance improvement of the finite volume method code. As evidently shown in this study, the implemented SG-FVM demonstrated superior performance improvement against a direct finite element method implementation through MOOSE for the wide range of selected problems. On two computer systems, the speedup was observed to be significant, with at least one order of magnitude of solving time reduction. In addition, for a complex reactor model, transient simulation was performed using the finite volume method code, the results of which agree very well with the reference results from the finite element method code. Overall, this study demonstrates a successful feasibility study on the proposed numerical algorithms and software structure to support advanced system analysis tool development. In this work, short-term priority development and testing items were identified, and long-term code adoption and integration plans were made for the eventual deployment of the finite volume method in the SAM code.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Comparison of Sequence Component-Based Fault Detection and Relay Coordination Algorithms in Inverter-Based Networks

Protection of inverter-based microgrids using sequence component-based relaying schemes is a promising solution. These methods offer several advantages, including lower computational requirements, compatibility with commercial relay systems, and cost-effectiveness compared to communication-based approaches. This article investigate the performance of various sequence component based schemes with the objective of identifying the algorithms that provide the best fault detection and relay coordination, solely relying on local voltages and current at relay terminals. Positive, negative and zero sequence impedance, admittance and power detection algorithms were tested on modified IEEE 13 bus test network for various shunt faults (LG, LL, LLG, LLL). Hardware-in-the-loop validation was achieved using the Typhoon real-time simulator, interfacing with a SEL 751 relay. This research demonstrates that while several algorithms are capable of detecting faults with sufficient accuracy, only a few are effective in achieving proper coordination. Validation results indicate that the negative sequence power approach provides the best performance in both fault detection and coordination.

Patel, Deepika [ORNL] (ORCID:0000000341099994)↗

Using the Gerchberg-Saxton algorithm to reconstruct nonmodulated pyramid wavefront sensor measurements

Adaptive optics (AO) is a technique to improve the resolution of ground-based telescopes by correcting, in real-time, optical aberrations due to atmospheric turbulence and the telescope itself. With the rise of Giant Segmented Mirror Telescopes (GSMT), AO is needed more than ever to reach the full potential of these future observatories. One of the main performance drivers of an AO system is the wavefront sensing operation, consisting of measuring the shape of the above mentioned optical aberrations. Aims. The non-modulated pyramid wavefront sensor (nPWFS) is a wavefront sensor with high sensitivity, allowing the limits of AO systems to be pushed. The high sensitivity comes at the expense of its dynamic range, which makes it a highly non-linear sensor. We propose here a novel way to invert nPWFS signals by using the principle of reciprocity of light propagation and the Gerchberg-Saxton (GS) algorithm. We test the performance of this reconstructor in two steps: the technique is first implemented in simulations, where some of its basic properties are studied. Then, the GS reconstructor is tested on the Santa Cruz Extreme Adaptive optics Laboratory (SEAL) testbed located at the University of California Santa Cruz. This new way to invert the nPWFS measurements allows us to drastically increase the dynamic range of the reconstruction for the nPWFS, pushing the dynamics close to a modulated PWFS. The reconstructor is an iterative algorithm requiring heavy computational burden, which could be an issue for real-time purposes in its current implementation. However, this new reconstructor could still be helpful in the case of many wavefront control operations. In conclusion, this reconstruction technique has also been successfully tested on the Santa Cruz Extreme AO Laboratory (SEAL) bench where it is now used as the standard way to invert nPWFS signal.

47 OTHER INSTRUMENTATION↗

SITCOMTN-154: Initial studies of photometric redshifts with LSSTComCam from DP1

This technote holds reports based on the first analyses of the Data Preview 1 (DP1) data by the Science Unit for photometric redshifts. Although photometric redshifts are not an official DP1 data product, the "Photo-z Science Unit" generated photo-z estimates for every galaxy in DP1 using the available multi-band imaging on a best-effort basis. This work included developing training and test datasets by matching DP1 data to high-quality reference redshifts obtained with spectroscopy, Grism data, and multi-band photometry. The Science Unit used the RAIL software package to make photometric redshift estimates using eight different algorithms, developed simple scientific performance metrics, used those metrics to explore how the performance of the algorithms varied with configuration changes, derived more optimized configurations of the algorithms and tested the performance of those configurations. This work, the resulting data products and expected data distribution mechanism are all described there.

79 ASTRONOMY AND ASTROPHYSICS↗

Explainable physics-based constraints on reinforcement learning for accelerator optimization

We present a reinforcement learning (RL) framework for optimizing particle accelerator experiments that builds explainable physics-based constraints on agent behavior. The goal is to increase transparency and trust by letting users verify that the agent’s decision-making process incorporates suitable physics. Our algorithm uses a learnable surrogate function for physical observables, such as energy, and uses them to fine-tune how actions are chosen. This surrogate can be represented by a neural network or by an interpretable sparse dictionary model. We test our algorithm on a range of particle accelerator optimization environments designed to emulate the Continuous Electron Beam Accelerator Facility at Jefferson Lab. By examining the mathematical form of the learned constraint function, we are able to confirm the agent has learned to use the established physics of each environment. In addition, we find that the introduction of a physics-based surrogate enables our RL algorithms to reliably converge for difficult high-dimensional accelerator optimization environments.

explainability↗

Low-Rank Solution Methods for Stochastic Eigenvalue Problems

In this report, we study efficient solution methods for stochastic eigenvalue problems arising from discretization of self-adjoint partial differential equations with random data, where the underlying operators depend linearly on the random parameters. With the stochastic Galerkin approach, the solutions are represented as generalized polynomial chaos expansions. When these solutions can be approximated well by low-rank objects, we introduce a low-rank variant of the inverse subspace iteration algorithm for computing one or several minimal eigenvalues and corresponding eigenvectors of parameter-dependent matrices. In the algorithm, the iterates are approximated by low-rank matrices, which leads to significant cost savings. Furthermore, the algorithm is tested on two benchmark problems, a stochastic diffusion problem with some poorly separated eigenvalues, and an operator derived from a discrete stochastic Stokes problem whose minimal eigenvalue is related to the inf-sup stability constant. Numerical experiments show that the low-rank algorithm produces accurate solutions compared to the Monte Carlo method, and it uses much less computational time than the original algorithm without low-rank approximation.

97 MATHEMATICS AND COMPUTING↗

Testing Classical Properties from Quantum Data

Many properties of Boolean functions can be tested far more efficiently than the function itself can be learned. However, this dramatic advantage often disappears when testers are limited to random samples of ƒ instead of adaptively chosen queries to f. In this work we investigate the quantum version of this restriction: quantum algorithms that test properties of a Boolean function f solely from copies of either the function state |ƒ⟩ ∝ ∑ x |x, ƒ(x)⟩ or the phase state |(-1) ƒ ⟩ ∝ ∑ x (-1) ƒ(x) |x⟩. For monotonicity, symmetry, and triangle-freeness, we show passive quantum testers are unboundedly or super-polynomially better than their classical passive testing counterparts. They are competitive with classic query -based testers in each case. Our new testers use techniques beyond quantum Fourier sampling, and it turns out this is necessary: we show a certain class of bent functions can be tested from 𝒪(1) function states but has a sample complexity lower bound of 2 Ω(n) for any tester relying exclusively on Fourier and classical samples. Our passive quantum testers are competitive with classical query -based testers, but this isn't universal: we exhibit a testing problem that can be solved from 𝒪(1) classical queries but requires Ω(2 n/2 ) function state copies. The Forrelation problem provides a separation of the same magnitude in the opposite direction, so we conclude that quantum data and classical queries are "maximally incomparable" resources for testing. We also begin the study of lower bounds for testing from quantum data. For quantum monotonicity testing, we prove that the ensembles of [Goldreich et al., 2000; Black, 2024], which give exponential lower bounds for classical sample-based testing, do not yield any nontrivial lower bounds for testing from quantum data. New insights specific to quantum data will be required for proving copy complexity lower bounds for testing in this model.

Boolean Functions↗

Kβ X-ray Emission Spectra Analysis Using Bayesian Optimization

The Kβ X-ray emission spectrum of 3 d transition metals is rich with electronic and structural information due to strong exchange interactions with the valence shell of the metal, and has become crucial for understanding their spin and oxidation states. The spectrum is commonly treated using crystal-field multiplet theory, a semi-empirical theory that uses tunable parameters to control the strength of the effects present in X-ray emission spectroscopy (XES). However, determining the experimental values of these parameters remains a challenge. We present a methodology that applies Bayesian optimization to crystal-field multiplet theory to determine parameter values. The algorithm is tested on the X-ray emission spectra of a collection of Mn, Co, and Ni oxides. We are able to find optimal values for the four most impactful parameters: Slater−Condon reduction factors F dd , F pd , and G pd , and crystal field splitting 10 Dq . The algorithm produces significantly improved accuracy compared to current analysis methods, and probes interparameter dependencies by modeling the error landscape. This advancement enhances XES analysis by offering an approach of obtaining quantitative electronic structural information on 3 d transition metal valence shells, facilitating applications across various scientific fields.

Bayesian optimization↗

Metrics and Methods to Assess Building Fault Detection and Diagnosis Tools

This paper presents the research methodology and findings related to fault definition, input samples, and evaluation metrics. We discuss these findings in light of key considerations for FDD algorithm performance testing, and conclude with recommendations and suggested areas of future work.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Positron annihilation lifetime spectroscopy using fast scintillators and digital electronics

Positron Annihilation Lifetime Spectroscopy (PALS) is a non-destructive radiological technique widely used in material science studies. PALS typically relies on an analog coincidence measurement setup and allows the estimate of the positron lifetime in a material sample under investigation. The positron trapping at vacancies in the material results in an increased positron lifetime. In this work, we have developed and optimized a PALS experimental setup using organic scintillators, fast digitizers, and advanced pulse processing algorithms. We tested three pairs of different organic scintillators: EJ-309 liquid, EJ-276 newly developed plastic, and BC- 418 plastic, and optimized the data processing parameters for each pair separately. Our high-throughput data analysis method is based on single-pulse interpolation and a constant fraction discrimination (CFD) algorithm. The setup based on the BC-418 detector achieved the best time resolution of 198.3 ± 0.8 ps. We used such optimized setup to analyze two single-crystal quartz samples and found lifetimes of 161 ± 4 ps, 343 ± 12 ps and 1.34 ± 0.05 ns, in good agreement with the characteristic time constants of this material. The proposed experimental set up achieves a time resolution comparable to the minimum positron lifetime in quartz, which makes it possible to accurately characterize material vacancies by discriminating between the lifetimes of either the spin singlet or triplet states of positronium. The optimized data processing algorithms are relevant to all the applications where fast timing is important, such as nuclear medicine and radiation imaging

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Approximating Nash Equilibrium in Day-ahead Electricity Market Bidding with Multi-agent Deep Reinforcement Learning

In this paper, a day-ahead electricity market bidding problem with multiple strategic generation company (GEN-CO) bidders is studied. The problem is formulated as a Markov game model, where GENCO bidders interact with each other todevelop their optimal day-ahead bidding strategies. Considering unobservable information in the problem, a model-free and data-driven approach, known as multi-agent deep deterministic policy gradient (MADDPG), is applied for approximating the Nash equilibrium (NE) in the above Markov game. The MADDPG algorithm has the advantage of generalization due to the automatic feature extraction ability of the deep neural networks. The algorithm is tested on an IEEE 30-bus system with three competitive GENCO bidders in both an uncongested caseand a congested case. Comparisons with a truthful bidding strategy and state-of-the-art deep reinforcement learning methods including deep Q network and deep deterministic policy gradient (DDPG) demonstrate that the applied MADDPG algorithm can find a superior bidding strategy for all the market participants with increased profit gains. In addition, the comparison with a conventional model-based method shows that the MADDPG algorithm has higher computational efficiency, which is feasible for real-world applications.

24 POWER TRANSMISSION AND DISTRIBUTION↗