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,063 records · Page 59

An effective numerical algorithm for intra-granular fission gas release during non-equilibrium trapping and resolution

Both fission gas release and gaseous swelling in nuclear fuel are driven by the transport of fission gas from within the fuel grains to grain boundaries (intra-granular fission gas release). The process involves gas atom diffusion in conjunction with trapping in and resolution from intra-granular bubbles, and is described mathematically by a system of two partial differential equations (PDE). Following Speight, under the assumption of equilibrium between trapping and resolution (quasi-stationary approximation) the system can be reduced to a single diffusion equation with an effective diffusion coefficient. Numerical solutions used in engineering fuel performance calculations invariably rely on this simplification. First, we investigate the validity of the quasi-stationary approximation compared to the solution of the general system of PDEs. Results demonstrate that the approximation is valid under most conditions of practical interest, but is inadequate to model intra-granular fission gas release during rapid transients to relatively high temperatures such as postulated reactivity initiated accidents (RIA). Then, we develop a novel numerical algorithm for the solution of the general problem in time-varying conditions. We verify the PolyPole-2 algorithm against a reference finite difference solution for a large number of randomly generated operation histories including prototypical RIA transients. Results demonstrate that PolyPole-2 captures the solution of the general PDE system with a high accuracy and a low computational cost. As a result, the PolyPole-2 algorithm overcomes the quasi-stationary approximation and the concept of an effective diffusion coefficient for the solution of the intra-granular fission gas release problem in nuclear fuel analysis.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Automatic point Cloud Building Envelope Segmentation (Auto-CuBES) using Machine Learning

Modern retrofit construction practices use 3D point cloud data of the building envelope to obtain the as-built dimensions. However, manual segmentation by a trained professional is required to identify and measure window openings, door openings, and other architectural features, making the use of 3D point clouds labor-intensive. In this study, the Automatic point Cloud Building Envelope Segmentation (Auto-CuBES) algorithm is described, which can significantly reduce the time spent during point cloud segmentation. The Auto-CuBES algorithm inputs a 3D point cloud generated by commonly available surveying equipment and outputs a wire-frame model of the building envelope. Unsupervised machine learning methods were used to identify facades, windows, and doors while minimizing the number of calibration parameters. Additionally, Auto-CuBES generates a heat map of each facade indicating non-planar characteristics that are crucial for the optimization of connections used in overclad envelope retrofits. With a scan resolution of 3 mm, the resulting window dimensions showed a mean absolute error of 4.2 mm compared to manual laser measurements.

Maldonado Puente, Bryan↗

Minimal-memory realization of pearl-necklace encoders of general quantum convolutional codes

Quantum convolutional codes, like their classical counterparts, promise to offer higher error correction performance than block codes of equivalent encoding complexity, and are expected to find important applications in reliable quantum communication where a continuous stream of qubits is transmitted. Grassl and Roetteler devised an algorithm to encode a quantum convolutional code with a ''pearl-necklace'' encoder. Despite their algorithm's theoretical significance as a neat way of representing quantum convolutional codes, it is not well suited to practical realization. In fact, there is no straightforward way to implement any given pearl-necklace structure. This paper closes the gap between theoretical representation and practical implementation. In our previous work, we presented an efficient algorithm to find a minimal-memory realization of a pearl-necklace encoder for Calderbank-Shor-Steane (CSS) convolutional codes. This work is an extension of our previous work and presents an algorithm for turning a pearl-necklace encoder for a general (non-CSS) quantum convolutional code into a realizable quantum convolutional encoder. We show that a minimal-memory realization depends on the commutativity relations between the gate strings in the pearl-necklace encoder. We find a realization by means of a weighted graph which details the noncommutative paths through the pearl necklace. The weight of the longest path in this graph is equal to the minimal amount of memory needed to implement the encoder. The algorithm has a polynomial-time complexity in the number of gate strings in the pearl-necklace encoder.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An inverse source location algorithm for radiation portal monitor applications

Radiation portal monitors are being deployed at border crossings throughout the world to prevent the smuggling of nuclear and radiological materials; however, a tension exists between security and the free-flow of commerce. Delays at ports-of-entry have major economic implications, so it is imperative to minimize portal monitor screening time. We have developed an algorithm to locate a radioactive source using a distributed array of detectors, specifically for use at border crossings. To locate the source, we formulated an optimization problem where the objective function describes the least-squares difference between the actual and predicted detector measurements. The predicted measurements are calculated by solving the 3-D deterministic neutron transport equation given an estimated source position. The source position is updated using the steepest descent method, where the gradient of the objective function with respect to the source position is calculated using adjoint transport calculations. If the objective function is smaller than the convergence criterion, then the source position has been identified. This paper presents the derivation of the underlying equations in the algorithm as well as several computational test cases used to characterize its accuracy.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Electromagnetic self-force in the five dimensional Myers–Perry space–time

We calculate the effects of the electromagnetic self-force on a charged particle outside a five dimensional Myers–Perry space–time. Based on our earlier work (Mirzaiyan et al., 2018), we obtain the self-force using quaternions in Janis–Newman and Giampieri algorithms. In four dimensional rotating space–time the electromagnetic self-force is repulsive at any point, however, in five dimensional rotational space–time, we find a point r{sub 0} where the electromagnetic self-force vanishes. For r r{sub 0}) the electromagnetic self-force is attractive (repulsive).

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Monaco treatment planning system tools and optimization processes

The Monaco treatment planning system combines Monte Carlo dose calculation accuracy with robust optimization tools to provide high-quality radiotherapy treatment plans for three-dimensional conformal radiotherapy (3D CRT), intensity modulated radiotherapy (IMRT), volumetric modulated arc therapy (VMAT), stereotactic radiosurgery (SRS), and stereotactic body radiotherapy (SBRT). Recent technology advances have allowed for fast calculation speeds, which allow clinicians and patients to benefit from the accuracy of the Monte Carlo algorithm while reducing overall planning time. A collection of biological and physical dose-based planning tools and templates simplify the planning process and allow for consistent results across organizations. At the same time, multicriteria optimization (MCO) ensures critical organs are spared to the greatest possible degree while maintaining target coverage. Monaco encompasses a full suite of treatment modalities, including conventional radiotherapy and particle therapy, and is paving the way for real-time adaptive treatments with developments in magnetic resonance (MR)-guided radiation therapy.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Mesh Adaptive Search Optimization in SERPENT2 Stereolithography Geometry

SERPENT2 Monte Carlo program has the capability to model reactor cores by stereolithography (STL) geometry. In this geometry, volumes are defined by the union of triangulated surfaces. Using the STL geometry offers unique benefits, including: 1) the model can be printed on 3D printers; 2) the possibility to use directly geometrical models from Computer-Aided Design (CAD); 3) the capability to perform multi-physics simulations coupling neutronics, thermal-hydraulics, and material science computations. In this work the STL geometry has been created by the CUBIT software, which is designed for finite elements mesh generation. The materials in the STL geometry have been assigned by a simple C program using the colors of the volumes in the CUBIT model. The goal of this work is to minimize the SERPENT2 computing time using mesh adaptive search algorithms. The basic idea is to split the geometry of the core into two zones: one zone containing the fuel elements (including the moderator and the coolant) and the other containing the reflector (and the target zone of the core, if it is driven by an external neutron source). By performing this splitting, two separate meshes are used, which results in a considerable computing time saving. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Ground state energy and magnetization curve of a frustrated magnetic system from real-time evolution on a digital quantum processor

Models of interacting many-body quantum systems that may realize new exotic phases of matter, notably quantum spin liquids, are challenging to study using even state-of-the-art classical methods such as tensor network simulations. Quantum computing provides a promising route for overcoming these difficulties to find ground states, dynamics, and more. In this paper, we argue that recently developed hybrid quantum-classical algorithms based on real-time evolution are promising methods for solving a particularly important model in the search for spin liquids, the antiferromagnetic Heisenberg model on the two-dimensional kagome lattice. We show how to construct efficient quantum circuits to implement time evolution for the model and to evaluate key observables on the quantum computer, and we argue that the method has favorable scaling with increasing system size. We then restrict to a 12-spin star plaquette from the kagome lattice and a related 8-spin system, and we give an empirical demonstration on these small systems that the hybrid algorithms can efficiently find the ground state energy and the magnetization curve. For these demonstrations, we use four levels of approximation: exact state vectors, exact state vectors with statistical noise from sampling, noisy classical emulators, and (for the 8-spin system only) real quantum hardware, specifically the Quantinuum H1-1 processor; for the noisy simulations and hardware demonstration, we also employ error mitigation strategies based on the symmetries of the Hamiltonian. Our results strongly suggest that these hybrid algorithms present a promising direction for studying quantum spin liquids and more generally for resolving important unsolved problems in condensed matter theory and beyond.

97 MATHEMATICS AND COMPUTING↗

Theoretically and practically efficient parallel nucleus decomposition

This paper studies the nucleus decomposition problem, which has been shown to be useful in finding dense substructures in graphs. We present a novel parallel algorithm that is efficient both in theory and in practice. Our algorithm achieves a work complexity matching the best sequential algorithm while also having low depth (parallel running time), which significantly improves upon the only existing parallel nucleus decomposition algorithm (Sariyüce et al. , PVLDB 2018). The key to the theoretical efficiency of our algorithm is a new lemma that bounds the amount of work done when peeling cliques from the graph, combined with the use of a theoretically-efficient parallel algorithms for clique listing and bucketing. We introduce several new practical optimizations, including a new multi-level hash table structure to store information on cliques space-efficiently and a technique for traversing this structure cache-efficiently. On a 30-core machine with two-way hyper-threading on real-world graphs, we achieve up to a 55x speedup over the state-of-the-art parallel nucleus decomposition algorithm by Sariyüce et al. , and up to a 40x self-relative parallel speedup. We are able to efficiently compute larger nucleus decompositions than prior work on several million-scale graphs for the first time.

Computer Science↗

A Fast Algorithm for Computing Zigzag Representatives

Zigzag filtrations of simplicial complexes generalize the usual filtrations by allowing simplex deletions in addition to simplex insertions. The barcodes computed from zigzag filtrations encode the evolution of homological features. Although one can locate a particular feature at any index in the filtration using existing algorithms, the resulting representatives may not be compatible with the zigzag: a representative cycle at one index may not map into a representative cycle at its neighbor. For this, one needs to compute compatible representative cycles along each bar in the barcode. It is known that the barcode for a zigzag filtration with m insertions and deletions can be computed $O(m^ω)$ in time, where $ω < 2.373$ is the matrix multiplication exponent. However, it is not known how to compute the compatible representatives so efficiently. For a non-zigzag filtration, the classical matrix-based algorithm provides representatives in $O(m^3)$ time, which can be improved to $O(m^ω)$. However, no known algorithm for zigzag filtrations computes the representatives with the $O(m^3)$ time bound. We present an $O(m^3 n)$ time algorithm for this problem, where $n ≤ m$ is the size of the largest complex in the filtration.

Persistent homology↗

Recent Developments in Fast Neutron Detection and Multiplicity Counting with Liquid Scintillator

For many years, LLNL researchers have been developing time-correlated neutron detection techniques and algorithms for applications such as Arms Control, Threat Detection and Nuclear Material Assay. Many of the techniques have been developed specifically for the relatively low efficiency (a few percent) attainable by detector systems limited to man-portability. Historically, thermal neutron detectors (mainly {sup 3}He) were used, taking advantage of the high thermal neutron interaction cross sections. More recently, we have been investigating the use of fast neutron detection with liquid scintillators, inorganic crystals, and in the near future, pulse-shape discriminating plastics that respond over 1000 times faster (ns versus tens of {mu}s) than thermal neutron detectors. Fast neutron detection offers considerable advantages since the inherent ns production timescales of spontaneous fission and neutron-induced fission are preserved and measured instead of being lost by thermalization required for thermal neutron detectors. We are now applying fast neutron technology to the safeguards regime in the form of fast portable digital electronics as well as faster and less hazardous scintillator formulations. Faster detector response times and sensitivity to neutron momentum show promise for measuring, differentiating, and assaying samples that have modest to very high count rates, as well as mixed fission sources like Cm and Pu. We report on measured results with our existing liquid scintillator array and progress on the design of a nuclear material assay system that incorporates fast neutron detection, including the surprising result that fast liquid scintillator detectors become competitive and even surpass the precision of {sup 3}He-based counters measuring correlated pairs in modest (kg) samples of plutonium.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Networked Gamma Radiation System for Tactical Deployment

A networked gamma radiation detection system with directional sensitivity and energy spectral data acquisition capability is being developed by the National Security Technologies, LLC, Remote Sensing Laboratory to support the close and intense tactical engagement of law enforcement who carry out counterterrorism missions. In the proposed design, three clusters of 2" × 4" × 16" sodium iodide crystals (4 each) with digiBASE-E (for list mode data collection) would be placed on the passenger side of a minivan. To enhance localization and facilitate rapid identification of isotopes, advanced smart real-time localization and radioisotope identification algorithms like WAVRAD (wavelet-assisted variance reduction for anomaly detection) and NSCRAD (nuisance-rejection spectral comparison ratio anomaly detection) will be incorporated. We will test a collection of algorithms and analysis that centers on the problem of radiation detection with a distributed sensor network. We will study the basic characteristics of a radiation sensor network and focus on the trade-offs between false positive alarm rates, true positive alarm rates, and time to detect multiple radiation sources in a large area. Empirical and simulation analyses of critical system parameters, such as number of sensors, sensor placement, and sensor response functions, will be examined. This networked system will provide an integrated radiation detection architecture and framework with (i) a large nationally recognized search database equivalent that would help generate a common operational picture in a major radiological crisis; (ii) a robust reach back connectivity for search data to be evaluated by home teams; and, finally, (iii) a possibility of integrating search data from multi-agency responders.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Cerenkov radio pulses from electromagnetic showers in the time domain

The electric field of the Cerenkov radio pulse produced by a single charged particle track in a dielectric medium is derived from first principles. An algorithm is developed to obtain the pulse in the time domain for numerical calculations. The algorithm is implemented in a Monte Carlo simulation of electromagnetic showers in dense media (specifically designed for coherent radio emission applications) as might be induced by interactions of ultrahigh energy neutrinos. The coherent Cerenkov radio emission produced by such showers is obtained simultaneously both in the time and frequency domains. A consistency check performed by Fourier transforming the pulse in time and comparing it to the frequency spectrum obtained directly in the simulations yields, as expected, fully consistent results. The reversal of the time structure inside the Cerenkov cone and the signs of the corresponding pulses are addressed in detail. The results, besides testing algorithms used for reference calculations in the frequency domain, shed new light into the properties of the radio pulse in the time domain. The shape of the pulse in the time domain is directly related to the depth development of the excess charge in the shower and its width to the observation angle with respect to the Cerenkov direction. This information can be of great practical importance for interpreting actual data.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

A lattice Maxwell system with discrete space–time symmetry and local energy–momentum conservation

A lattice Maxwell system is developed here with gauge-symmetry, symplectic structure and discrete space–time symmetry. Noether's theorem for Lie group symmetries is generalized to discrete group symmetries for the lattice Maxwell system. As a result, the lattice Maxwell system is shown to admit a discrete local energy–momentum conservation law corresponding to the discrete space–time symmetry. A lattice model that respects all local conservation laws and geometric structures is as good as and probably more preferable than standard models on continuous space–time. It can also be viewed as an effective algorithm for the governing differential equations on continuous space–time.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

IMEX-a :

This report presents an efficient and accurate method for integrating a system of ordinary differential equations, particularly those arising from a spatial discretization of partially differential equations. The algorithm developed, termed the IMEX a algorithm, belongs to a class of algorithms known as implicit-explicit (IMEX) methods. The explicit step is based on a fifth order Runge-Kutta explicit step known as the Dormand-Prince algorithm, which adaptively modifies the time step by calculating the error relative to a fourth order estimation. The implicit step, which follows the explicit step, is based on a backward Euler method, a special case of the generalized trapezoidal method. Reasons for choosing both of these methods, along with the algorithm development are presented. In applications that have less stringent accuracy requirements, several other methods are available through the IMEX a toolbox, each of which simplify the fifth order Dormand-Prince explicit step: the third order Bogacki-Shampine method, the second order Midpoint method, and the first order Euler method. The performance of the algorithm is evaluated on to examples. First, a two pawl system with contact is modeled. Results predicted by the IMEX a algorithm are compared to those predicted by six widely used integration schemes. The IMEX a algorithm is demonstrated to be significantly faster (by up to an order of magnitude) and at least as accurate as all of the other methods considered. A second example, an acoustic standing wave, is presented in order to assess the accuracy of the IMEX a algorithm. Finally, sample code is given in order to demonstrate the implementation of the proposed algorithm.

Brake, Matthew Robert↗

Adiabatic Quantum Programming: Minor Embedding With Hard Faults

Adiabatic quantum programming defines the time-dependent mapping of a quantum algorithm into the hardware or logical fabric. An essential programming step is the embedding of problem-specific information into the logical fabric to define the quantum computational transformation. We present algorithms for embedding arbitrary instances of the adiabatic quantum optimization algorithm into a square lattice of specialized unit cells. Our methods are shown to be extensible in fabric growth, linear in time, and quadratic in logical footprint. In addition, we provide methods for accommodating hard faults in the logical fabric without invoking approximations to the original problem. These hard fault-tolerant embedding algorithms are expected to prove useful for benchmarking the adiabatic quantum optimization algorithm on existing quantum logical hardware. We illustrate this versatility through numerical studies of embeddabilty versus hard fault rates in square lattices of complete bipartite unit cells.

graph theory↗

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↗

Analytic treatment of source photon emission times to reduce noise in implicit Monte Carlo calculations

Statistical uncertainty is inherent to any Monte Carlo simulation of radiation transport problems. In space-angle-frequency independent radiative transfer calculations, the uncertainty in the solution is entirely due to random sampling of source photon emission times. We have developed a modification to the Implicit Monte Carlo algorithm that eliminates noise due to sampling of the emission time of source photons. In problems that are independent of space, angle, and energy, the new algorithm generates a smooth solution, while a standard implicit Monte Carlo solution is noisy. For space- and angle-dependent problems, the new algorithm exhibits reduced noise relative to standard implicit Monte Carlo in some cases, and comparable noise in all other cases. In conclusion, the improvements are limited to short time scales; over long time scales, noise due to random sampling of spatial and angular variables tends to dominate the noise reduction from the new algorithm.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗