Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithm timings”

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 1,315 records · Page 73

Transitory sensitivity in automatic chemical kinetic mechanism analysis

Abstract Detailed chemical kinetic mechanisms are necessary for resolving many important chemical processes. As the chemistry of smaller molecules has become better grounded and quantum chemistry calculations have become cheaper, kineticists have become interested in constructing progressively larger kinetic mechanisms to model increasingly complex chemical processes. These large kinetic mechanisms prove incredibly difficult to refine and time‐consuming to interpret. Traditional sensitivity analysis on a large mechanism can range from inconvenient to practically impossible without special techniques to reduce the computational cost. We first present a new time‐local sensitivity analysis we term transitory sensitivity analysis. Transitory sensitivity analysis is demonstrated in an example to accurately identify traditionally sensitive reactions at an 18,000x speed up over traditional sensitivities. By fusing transitory sensitivity analysis with more traditional time‐local branching, pathway, and cluster analyses, we develop an algorithm for efficient automatic mechanism analysis. This automatic mechanism analysis at a time point is able to identify the reactions a target is most sensitive to using transitory sensitivity analysis and then propose hypotheses why the reaction might be sensitive using branching, pathway, and cluster analyses. We implement these algorithms within the reaction mechanism simulator (RMS) package, which enables us to report the automatic mechanism analysis results in highly readable text formats and in molecular flux diagrams.

Johnson, Matthew S.↗

A new method for imaging nuclear threats using cosmic ray muons

Muon tomography is a technique that uses cosmic ray muons to generate three-dimensional images of volumes using information contained in the Coulomb scattering of the muons. Advantages of this technique are the ability of cosmic rays to penetrate significant overburden and the absence of any additional dose delivered to subjects under study beyond the natural cosmic ray flux. Disadvantages include the relatively long exposure times and poor position resolution and complex algorithms needed for reconstruction. Furthermore, we demonstrate a new method for obtaining improved position resolution and statistical precision for objects with spherical symmetry.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

A software-based x-ray scatter correction method for breast tomosynthesis

Purpose: To develop a software-based scatter correction method for digital breast tomosynthesis (DBT) imaging and investigate its impact on the image quality of tomosynthesis reconstructions of both phantoms and patients. Methods: A Monte Carlo (MC) simulation of x-ray scatter, with geometry matching that of the cranio-caudal (CC) view of a DBT clinical prototype, was developed using the Geant4 toolkit and used to generate maps of the scatter-to-primary ratio (SPR) of a number of homogeneous standard-shaped breasts of varying sizes. Dimension-matched SPR maps were then deformed and registered to DBT acquisition projections, allowing for the estimation of the primary x-ray signal acquired by the imaging system. Noise filtering of the estimated projections was then performed to reduce the impact of the quantum noise of the x-ray scatter. Three dimensional (3D) reconstruction was then performed using the maximum likelihood-expectation maximization (MLEM) method. This process was tested on acquisitions of a heterogeneous 50/50 adipose/glandular tomosynthesis phantom with embedded masses, fibers, and microcalcifications and on acquisitions of patients. The image quality of the reconstructions of the scatter-corrected and uncorrected projections was analyzed by studying the signal-difference-to-noise ratio (SDNR), the integral of the signal in each mass lesion (integrated mass signal, IMS), and the modulation transfer function (MTF). Results: The reconstructions of the scatter-corrected projections demonstrated superior image quality. The SDNR of masses embedded in a 5 cm thick tomosynthesis phantom improved 60%-66%, while the SDNR of the smallest mass in an 8 cm thick phantom improved by 59% (p < 0.01). The IMS of the masses in the 5 cm thick phantom also improved by 15%-29%, while the IMS of the masses in the 8 cm thick phantom improved by 26%-62% (p < 0.01). Some embedded microcalcifications in the tomosynthesis phantoms were visible only in the scatter-corrected reconstructions. The visibility of the findings in two patient images was also improved by the application of the scatter correction algorithm. The MTF of the images did not change after application of the scatter correction algorithm, indicating that spatial resolution was not adversely affected. Conclusions: Our software-based scatter correction algorithm exhibits great potential in improving the image quality of DBT acquisitions of both phantoms and patients. The proposed algorithm does not require a time-consuming MC simulation for each specific case to be corrected, making it applicable in the clinical realm.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

A New Method of Prompt Fission Neutron Energy Spectrum Unfolding

The prompt neutron emission in spontaneous fission of {sup 252}Cf has been investigated applying digital signal electronics along with associated digital signal processing algorithms. The goal was to find out the reasons of a long time existing discrepancy between theoretical calculations and the measurements of prompt fission neutron (PFN) emission dependence on the total kinetic energy (TKE) of fission fragments (FF). On the one hand the {sup 252}Cf(sf) reaction is one of the main references for nuclear data, on the other hand the understanding of PFN emission mechanism is very important for nuclear fission theory. Using a twin Frisch-grid ionization chamber for fission fragment (FF) detection and a NE213-equivalent neutron detector in total about 10{sup 7} fission fragment-neutron coincidences have been registered. Fission fragment kinetic energy, mass and angular distribution, neutron time-of-flight and pulse shape have been investigated using a 12 bit waveform digitizer. The signal waveforms have been analyzed using digital signal processing algorithms. For the first time the dependence of the number of emitted neutrons as a function of total kinetic energy (TKE) of the fragments is in very good agreement with theoretical calculations in the range of TKE from 140-220 MeV.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

CHEMNODE: CHEMICAL KINETICS SOLVER APPROACH BASED ON NEURAL ORDINARY DIFFERENTIAL EQUATIONS

This software contains an algorithm to model and predict the time evolution of chemical kinetics in reacting flow simulations using neural ordinary differential equations (NODEs). The approach works by using artificial neural networks to predict the chemical source terms. It achieves this by using forward-mode automatic differentiation and the Levenberg-Marquardt algorithm to adjust the neural network parameters, such that the discrepancies between the actual and predicted species profiles are minimized.

OWOYELE, OPEOLUWA↗

Optimal sensor network design for multi-scale, time-varying differential algebraic equation systems: Application to an entrained-flow gasifier refractory brick

An algorithm for optimal sensor network design for multi-scale, time-varying differential algebraic equation systems with non-separable dynamics is presented. As the process is time-varying, an integral normalized posterior error covariance of a multi-scale filter is minimized to obtain the optimal sensor locations. For reducing the computational cost, an adaptive sampling rate approach is considered for the slowly-varying variables. The algorithm is applied to a smart refractory brick with embedded sensors as part of an entrained-flow gasifier. Thermistors and interdigital capacitors are considered as candidate measurement technologies for estimating temperature and slag penetration profile along the gasifier wall. Finally, when the optimal set of sensors obtained from the algorithm is used for estimating temperature and slag penetration profiles in a multi-scale Kalman filter framework, satisfactory estimates are obtained despite high measurement noise and model mismatch.

42 ENGINEERING↗

Real Time - Optimal Power Flow Based Distributed Energy Resources Management System (DERMS) (CRADA Number CRD-20-16909 Final Report)

The integration of behind-the-meter distributed energy resources (DERs) into distribution systems brings transformative changes to power systems. This requires operators and planners to find solutions to modernize electric grids and to effectively manage DERs for grid services. NREL developed novel DER management algorithms (referred to as Real-Time Optimal Power Flow, RT-OPF) through U.S. Department of Energy (DOE)-funded efforts, including Advanced Research Projects Agency–Energy (ARPA-E) Network Optimized Distributed Energy Systems (NODES) funding. This cutting-edge control technology aims to modernize distribution systems with large amounts of DER integration, which will help utilities solve issues brought by renewable integration and build resilient and renewable-based electric grids nationwide. Utilidata worked with NREL to investigate the commercialization opportunity of this RT-OPF-based distributed energy resource management system (DERMS). In this project, NREL performs the technology transfer of the RT-OPF to Utilidata to help them fully understand the RT-OPF solution, to identify potential engineering hurdles, and to assess the expected commercial value of various RT-OPF use cases and deployment. The technology transfer work includes two major tasks. First, NREL performs an in-depth knowledge transfer of the entire RT-OPF solution to Utilidata to help them gain an extensive and detailed understanding of the complete RT-OPF solution. In this task, NREL provides exhaustive information (e.g., documentation, code packages, laboratory and field trial data, performance results) while conducting in-depth training sessions to provide a thorough explanation of the entire solution. NREL hosts meetings to present different topics related to the RT-OPF solution, and question-and-answer sessions are included in each meeting to better explain the RT-OPF-related work. Second, the RT-OPF simulations are performed in a laboratory environment. The main objectives of this task are to walk through with Utilidata engineers how to set up a simulation of RT-OPF, identifying each RT-OPF code block/component in operation, learning how these components interact with each other, and eventually running RT-OPF simulations under various system conditions. This task helps Utilidata engineers understand performance limitations and constraints while also quantifying the commercial value of the RT-OPF for different use cases. Based on these two tasks, Utilidata engineers should be able to define and prioritize the next steps of RT-OPF implementation with an eye toward commercial success and scalability of the solution. The next steps are expected to be part of a new project following the conclusion of this project.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Analysis and Benchmarking of feature reduction for classification under computational constraints

Abstract Machine learning is most often expensive in terms of computational and memory costs due to training with large volumes of data. Current computational limitations of many computing systems motivate us to investigate practical approaches, such as feature selection and reduction, to reduce the time and memory costs while not sacrificing the accuracy of classification algorithms. In this work, we carefully review, analyze, and identify the feature reduction methods that have low costs/overheads in terms of time and memory. Then, we evaluate the identified reduction methods in terms of their impact on the accuracy, precision, time, and memory costs of traditional classification algorithms. Specifically, we focus on the least resource intensive feature reduction methods that are available in Scikit-Learn library. Since our goal is to identify the best performing low-cost reduction methods, we do not consider complex expensive reduction algorithms in this study. In our evaluation, we find that at quadratic-scale feature reduction, the classification algorithms achieve the best trade-off among competitive performance metrics. Results show that the overall training times are reduced 61%, the model sizes are reduced 6×, and accuracy scores increase 25% compared to the baselines on average with quadratic scale reduction.

97 MATHEMATICS AND COMPUTING↗

An MPI + $X$ implementation of contact global search using Kokkos

This paper describes an approach that seeks to parallelize the spatial search associated with computational contact mechanics. In contact mechanics, the purpose of the spatial search is to find “nearest neighbors,” which is the prelude to an imprinting search that resolves the interactions between the external surfaces of contacting bodies. In particular, we are interested in the contact global search portion of the spatial search associated with this operation on domain-decomposition-based meshes. Specifically, we describe an implementation that combines standard domain-decomposition-based MPI-parallel spatial search with thread-level parallelism (MPI-X) available on advanced computer architectures (those with GPU coprocessors). Our goal is to demonstrate the efficacy of the MPI-X paradigm in the overall contact search. Standard MPI-parallel implementations typically use a domain decomposition of the external surfaces of bodies within the domain in an attempt to efficiently distribute computational work. This decomposition may or may not be the same as the volume decomposition associated with the host physics. The parallel contact global search phase is then employed to find and distribute surface entities (nodes and faces) that are needed to compute contact constraints between entities owned by different MPI ranks without further inter-rank communication. Key steps of the contact global search include computing bounding boxes, building surface entity (node and face) search trees and finding and distributing entities required to complete on-rank (local) spatial searches. To enable source-code portability and performance across a variety of different computer architectures, we implemented the algorithm using the Kokkos hardware abstraction library. While we targeted development towards machines with a GPU accelerator per MPI rank, we also report performance results for OpenMP with a conventional multi-core compute node per rank. Results here demonstrate a 47 % decrease in the time spent within the global search algorithm, comparing the reference ACME algorithm with the GPU implementation, on an 18M face problem using four MPI ranks. As a result, while further work remains to maximize performance on the GPU, this result illustrates the potential of the proposed implementation.

97 MATHEMATICS AND COMPUTING↗

A Digital Twin Framework Utilizing Machine Learning for Robust Predictive Maintenance: Enhancing Tire Health Monitoring

We introduce a novel digital twin (DT) framework for the predictive maintenance of long-term physical systems. Using monitoring tire health as an application, we show how the DT framework can be used to enhance automotive safety and efficiency, and how the technical challenges can be overcome using a three-step approach. First, to manage the data complexity over a long operation span, we employ data reduction techniques to concisely represent physical tires using historical performance and usage data. Relying on these data, for fast real-time prediction, we train a transformer-based model offline on our concise dataset to predict future tire health over time, represented as remaining casing potential (RCP). Based on our architecture, our model quantifies both epistemic and aleatoric uncertainties, providing reliable confidence intervals around predicted RCP. Second, to incorporate real-time data, we update the predictive model in the DT framework, ensuring its accuracy throughout its lifespan with the aid of hybrid modeling and the use of the discrepancy function. Third, to assist decision-making in predictive maintenance, we implement a tire state decision algorithm, which strategically determines the optimal timing for tire replacement based on RCP forecasted by our transformer model. This approach ensures that our DT accurately predicts system health, continually refines its digital representation, and supports predictive maintenance decisions. Furthermore, our framework effectively embodies a physical system, leveraging big data and machine learning (ML) for predictive maintenance, model updates, and decision-making.

advanced computing infrastructure↗

Technical Note: Improving the VMERGE treatment planning algorithm for rotational radiotherapy

Purpose: The authors revisit the VMERGE treatment planning algorithm by Craft et al. [“Multicriteria VMAT optimization,” Med. Phys. 39, 686–696 (2012)] for arc therapy planning and propose two changes to the method that are aimed at improving the achieved trade-off between treatment time and plan quality at little additional planning time cost, while retaining other desirable properties of the original algorithm. Methods: The original VMERGE algorithm first computes an “ideal,” high quality but also highly time consuming treatment plan that irradiates the patient from all possible angles in a fine angular grid with a highly modulated beam and then makes this plan deliverable within practical treatment time by an iterative fluence map merging and sequencing algorithm. We propose two changes to this method. First, we regularize the ideal plan obtained in the first step by adding an explicit constraint on treatment time. Second, we propose a different merging criterion that comprises of identifying and merging adjacent maps whose merging results in the least degradation of radiation dose. Results: The effect of both suggested modifications is evaluated individually and jointly on clinical prostate and paraspinal cases. Details of the two cases are reported. Conclusions: In the authors’ computational study they found that both proposed modifications, especially the regularization, yield noticeably improved treatment plans for the same treatment times than what can be obtained using the original VMERGE method. The resulting plans match the quality of 20-beam step-and-shoot IMRT plans with a delivery time of approximately 2 min.

60 APPLIED LIFE SCIENCES↗

Cooperative and Integrated Vehicle and Intersection Control for Energy Efficiency (CIVIC-E²)

Recent advances in connected vehicle technologies enable vehicles and signal controllers to cooperate and improve the traffic management at intersections. This paper explores the opportunity for cooperative and integrated vehicle and intersection control for energy efficiency (CIVIC-E 2 ) to contribute to a more sustainable transportation system. We propose a two-level approach that jointly optimizes the traffic signal timing and vehicles' approach speed, with the objective being to minimize total energy consumption for all vehicles passing through an isolated intersection. More specifically, at the intersection level, a dynamic programming algorithm is designed to find the optimal signal timing by explicitly considering the arrival time and energy profile of each vehicle. At the vehicle level, a model predictive control strategy is adopted to ensure that vehicles pass through the intersection in a timely fashion. Our simulation study has shown that the proposed CIVIC-E 2 system can significantly improve intersection performance under various traffic conditions. Furthermore, compared with conventional fixed-time and actuated signal control strategies, the proposed algorithm can reduce energy consumption and queue length by up to 31% and 95%, respectively.

33 ADVANCED PROPULSION SYSTEMS↗

Tractable flux-driven temperature, density, and rotation profile evolution with the quasilinear gyrokinetic transport model QuaLiKiz

Quasilinear turbulent transport models are a successful tool for prediction of core tokamak plasma profiles in many regimes. Their success hinges on the reproduction of local nonlinear gyrokinetic fluxes. We focus on significant progress in the quasilinear gyrokinetic transport model QuaLiKiz (Bourdelle et al 2016 Plasma Phys. Control. Fusion 58 014036), which employs an approximated solution of the mode structures to significantly speed up computation time compared to full linear gyrokinetic solvers. Optimisation of the dispersion relation solution algorithm within integrated modelling applications leads to flux calculations $\times {10}^{6-7}$ faster than local nonlinear simulations. This allows tractable simulation of flux-driven dynamic profile evolution including all transport channels: ion and electron heat, main particles, impurities, and momentum. Furthermore, QuaLiKiz now includes the impact of rotation and temperature anisotropy induced poloidal asymmetry on heavy impurity transport, important for W-transport applications. Application within the JETTO integrated modelling code results in 1 s of JET plasma simulation within 10 h using 10 CPUs. Simultaneous predictions of core density, temperature, and toroidal rotation profiles for both JET hybrid and baseline experiments are presented, covering both ion and electron turbulence scales. The simulations are successfully compared to measured profiles, with agreement mostly in the 5%–25% range according to standard figures of merit. QuaLiKiz is now open source and available at www.qualikiz.com.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Real Time Pulse Pile-up Recovery in a High Throughput Digital Pulse Processor

Detection and measurement of radiation is used extensively for non-invasive material characterization in a range of industries. However, many practical applications are frustrated by pulse pile-up within the detector. Pulse pile-up, which occurs when multiple radiation events arrive within the temporal resolving time of the detector, degrades the fidelity of subsequent material analysis. Traditional pulse processing techniques use fast digital filters and logic circuits to detect piled-up events and discard the corrupted data, however, this leads to substantial detector dead time. Consequently, there is considerable interest in more complex signal-processing algorithms to extend the performance of pulse processors and improve material characterization techniques. We present a technology for real-time decoding of pulse pile-up events. It is a model-based signal-processing algorithm able to accurately characterize the number, time-of-arrival and energy of all events in the detector output. Even in the presence of severe multi-pulse pile-up, the composite events are decoded and the energy and time-of-arrival recovered. The technology has been evaluated using a range of detectors, sources and count rates. An exceptional improvement over traditional pulse processing techniques is demonstrated.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

A Feynman-Kac based numerical method for the exit time probability of a class of transport problems

The exit time probability, which gives the likelihood that an initial condition leaves a prescribed region of the phase space of a dynamical system at, or before, a given time, is arguably one of the most natural and important transport problems. In this work, we present an accurate and efficient numerical method for computing this probability for systems described by non-autonomous (time-dependent) stochastic differential equations (SDEs) or their equivalent Fokker-Planck partial differential equations. The method is based on the direct approximation of the Feynman-Kac formula that establishes a link between the adjoint Fokker-Planck equation and the forward SDE. The Feynman-Kac formula is approximated using the Gauss-Hermite quadrature rules and piecewise cubic Hermite interpolating polynomials, and a GPU accelerated matrix representation is used to compute the entire time evolution of the exit time probability using a single pass of the algorithm. The method is unconditionally stable, exhibits second order convergence in space, first order convergence in time, and it is straightforward to parallelize. Applications are presented to the advection diffusion of a passive tracer in a fluid flow exhibiting chaotic advection, and to the runaway acceleration of electrons in a plasma in the presence of an electric field, collisions, and radiation damping. Benchmarks against analytical solutions as well as comparisons with explicit and implicit finite difference standard methods for the adjoint Fokker-Planck equation are presented.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Phase-retrieval algorithm for the characterization of broadband single attosecond pulses

Recent progress in high-order harmonic generation with few-cycle mid-infrared wavelength lasers has pushed light pulses into the water-window region and beyond. These pulses have the bandwidth to support single attosecond pulses down to a few tens of attoseconds. However, the present available techniques for attosecond pulse measurement are not applicable to such pulses. Here we report a phase-retrieval method using the standard photoelectron streaking technique where an attosecond pulse is converted into its electron replica through photoionization of atoms in the presence of a time-delayed infrared laser. The iterative algorithm allows accurate reconstruction of the spectral phase of light pulses, from the extreme-ultraviolet (XUV) to soft x-rays, with pulse durations from hundreds down to a few tens of attoseconds. At the same time, the streaking laser fields, including short pulses that span a few octaves, can also be accurately retrieved. Furthermore, such well-characterized single attosecond pulses in the XUV to the soft-x-ray region are required for time-resolved probing of inner-shell electronic dynamics of matter at their own timescale of a few tens of attoseconds.

74 ATOMIC AND MOLECULAR PHYSICS↗

Non-intrusive, high-resolution, real-time, two-dimensional imaging of multiphase materials using acoustic array sensors

Two parallel multi-element ultrasonic acoustic arrays combined with sets of focal laws for acoustic signal generation and a classical tomographic inversion algorithm are used to generate real-time two-dimensional micro seismic acoustic images of multiphase materials. Proof of concept and calibration measurements were performed for single phase and two phase liquids, uniform polyvinyl chloride (PVC) plates, and aluminum cylinders imbedded in PVC plates. Measurement artefacts, arising from the limited range of viewing angles, and the compromise between data acquisition rate and image quality are discussed. The angle range of scanning and the image resolution were varied, and the effects on the quality of the reproduction of the speed of sound profiles of model solids and liquids with known geometries and compositions were analysed in detail. The best image quality results were obtained for a scanning angle range of [−35°, 35°] at a step size of 2.5° post processed to generate images on a 40 μm square grid. The data acquisition time for high quality images with a 30 mm × 40 mm view field is 10 min. Representation of two-phase solids with large differences in speed of sound between phases and where one phase is dispersed in the form of macroscopic objects (greater than 1 mm in diameter) proved to be the most difficult to image accurately. Liquid-liquid and liquid-vapor phase boundaries, in micro porous solids by contrast, were more readily defined. Displacement of air by water and water by heptane in natural porous limestone provides illustrative kinetic examples. Measurement results with these realistic cases demonstrate the feasibility of the technique to monitor in real time and on the micrometer length scale local composition and flow of organic liquids in inorganic porous media, one of many envisioned engineering applications. Improvement of data acquisition rate is an area for future collaborative study.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Reconstructing three-dimensional protein crystal intensities from sparse unoriented two-axis X-ray diffraction patterns

Recently, there has been a growing interest in adapting serial microcrystallography (SMX) experiments to existing storage ring (SR) sources. For very small crystals, however, radiation damage occurs before sufficient numbers of photons are diffracted to determine the orientation of the crystal. The challenge is to merge data from a large number of such `sparse' frames in order to measure the full reciprocal space intensity. To simulate sparse frames, a dataset was collected from a large lysozyme crystal illuminated by a dim X-ray source. The crystal was continuously rotated about two orthogonal axes to sample a subset of the rotation space. With the EMC algorithm [expand–maximize–compress; Loh & Elser (2009). Phys. Rev. E , 80 , 026705], it is shown that the diffracted intensity of the crystal can still be reconstructed even without knowledge of the orientation of the crystal in any sparse frame. Moreover, parallel computation implementations were designed to considerably improve the time and memory scaling of the algorithm. The results show that EMC-based SMX experiments should be feasible at SR sources.

Chemistry↗