Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Algorithm Development”

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,711 records · Page 95

A Proposal for User-defined Reductions in OpenMP

Reductions are commonly used in parallel programs to produce a global result from partial results computed in parallel. Currently, OpenMP only supports reductions for primitive data types and a limited set of base language operators. This is a significant limitation for those applications that employ user-defined data types (e. g., objects). Implementing manual reduction algorithms makes software development more complex and error-prone. Additionally, an OpenMP runtime system cannot optimize a manual reduction algorithm in ways typically applied to reductions on primitive types. In this paper, we propose new mechanisms to allow the use of most pre-existing binary functions on user-defined data types as User-Defined Reduction (UDR) operators. Our measurements show that our UDR prototype implementation provides consistently good performance across a range of thread counts without increasing general runtime overheads.

97 MATHEMATICS AND COMPUTING↗

An algorithm for charge-integration, pulse-shape discrimination and estimation of neutron/photon misclassification in organic scintillators

Organic scintillators are frequently used for measurements that require sensitivity to both photons and fast neutrons because of their pulse shape discrimination capabilities. In these measurement scenarios, particle identification is commonly handled using the charge-integration pulse shape discrimination method. This method works particularly well for high-energy depositions, but is prone to misclassification for relatively low-energy depositions. A novel algorithm has been developed for automatically performing charge-integration pulse shape discrimination in a consistent and repeatable manner. The algorithm is able to estimate the photon and neutron misclassification corresponding to the calculated discrimination parameters, and is capable of doing so using only the information measured by a single organic scintillator. This paper describes the algorithm and assesses its performance by comparing algorithm-estimated misclassification to values computed via a more traditional time-of-flight estimation. A single data set was processed using four different low-energy thresholds: 40, 60, 90, and 120 keVee. Overall, the results compared well between the two methods; in most cases, the algorithm-estimated values fell within the uncertainties of the TOF-estimated values.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Implicitly charge-conserving solver for Boltzmann electrons

An implicitly charge-conserving algorithm has been developed for solving the nonlinear Poisson equation that results from the use of Boltzmann electrons. The new algorithm solves for the Boltzmann density parameter and, in the case of a Neumann boundary condition, the surface-charge density, simultaneously as it solves for the discretized electrostatic potential. Numerical stability is demonstrated for time steps exceeding the electron plasma period and spatial resolutions much coarser than the Debye length.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Novel challenges in tracking self-interacting dark matter subhalos

Cosmological N-body simulations are among the primary tools for studying structure formation in the Universe. Analyses of these simulations critically depend on accurately identifying and tracking dark matter subhalos over time. In recent years, several new algorithms have been developed to improve the accuracy and consistency of subhalo tracking in cold dark matter (CDM) simulations. These algorithms should be revisited in the context of new physics beyond gravity, which can modify the evolution and final properties of subhalo populations. In this work, we apply the particle-tracking-based subhalo finder Symfind to velocity-dependent self-interacting dark matter (SIDM) simulations with large cross section amplitudes to assess the performance of particle-tracking methods beyond the CDM paradigm. We find that the core-particle-tracking technique, which is key to the success of these algorithms in CDM, does not always yield accurate results in SIDM. In particular, the interplay between dark matter self-interactions and tidal stripping can cause the diffusion of core particles to larger radii, leading particle-tracking-based algorithms to prematurely lose track of SIDM subhalos. For massive core-expansion subhalos and core-collapse subhalos that experience close or repeated pericentric passages, a significant fraction of core particles can be lost, and particle-tracking-based finders such as Symfind offer no clear advantage over traditional methods that rely on identifying phase-space overdensities. On the other hand, for subhalos with large pericentric distances or fewer, more distant passages, Symfind tends to outperform. These differences depend sensitively on the cross section amplitude and turnover velocity of the underlying SIDM model. We therefore recommend a hybrid approach that leverages the strengths of both techniques to produce complete and robust catalogs of core-expansion and core-collapse SIDM subhalos.

cosmological simulations↗

Gamma-ray raster imaging with robotic data collection. FY18 report

This project has developed an alternative imaging capability for measuring radioactive materials in situ. This approach uses a robotic-mounted gamma-ray detector which can move around an area of interest, sampling the space at a high frequency. By rastering across the area, an image can be created with no collimation and a high efficiency. A regression model was developed to map out material distribution as the robot moves through the environment. An informative path planning algorithm was also developed to maximize the information collected throughout the movement path. The use of a robotic mount allows data collection for long periods of time unattended, and it will also eliminate uncertainties in positioning typically introduced by personnel. This approach will be particularly relevant for gloveboxes, shielded cells, or process piping which may have complex, non-uniform distributions of material.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

NONPARAMETRIC BAYESIAN ESTIMATION OF PERIODIC LIGHT CURVES

Many astronomical phenomena exhibit patterns that have periodic behavior. An important step when analyzing data from such processes is the problem of identifying the period: estimating the period of a periodic function based on noisy observations made at irregularly spaced time points. This problem is still a difficult challenge despite extensive study in different disciplines. This paper makes several contributions toward solving this problem. First, we present a nonparametric Bayesian model for period finding, based on Gaussian Processes (GPs), that does not make assumptions on the shape of the periodic function. As our experiments demonstrate, the new model leads to significantly better results in period estimation especially when the light curve does not exhibit sinusoidal shape. Second, we develop a new algorithm for parameter optimization for GP which is useful when the likelihood function is very sensitive to the parameters with numerous local minima, as in the case of period estimation. The algorithm combines gradient optimization with grid search and incorporates several mechanisms to overcome the high computational complexity of GP. Third, we develop a novel approach for using domain knowledge, in the form of a probabilistic generative model, and incorporate it into the period estimation algorithm. Experimental results validate our approach showing significant improvement over existing methods.

79 ASTRONOMY AND ASTROPHYSICS↗

InfraPy: Python-Based Signal Analysis Tools for Infrasound

InfraPy is a Python-based analysis toolkit being development at LANL. The algorithms are intended for ground-based nuclear detonation detection applications to detect, locate, and characterize explosive sources using infrasonic observations. The implementation is usable as a stand-alone Python library or as a command line driven tool operating directly on a database. With multiple scientists working on the project, we've begun using a LANL git repository for collaborative development and version control. Current and planned work on InfraPy focuses on the development of new algorithms and propagation models. Collaboration with Southern Methodist University (SMU) has helped identify bugs and limitations of the algorithms. The current focus of usage development is focused on library imports and CLI.

97 MATHEMATICS AND COMPUTING↗

Network Algorithms for Detection of Radiation Sources

In support of national defense, Domestic Nuclear Detection Office’s (DNDO) Intelligent Radiation Sensor Systems (IRSS) program supported the development of networks of radiation counters for detecting, localizing and identifying low-level, hazardous radiation sources. Industry teams developed the first generation of such networks with tens of counters, and demonstrated several of their capabilities in indoor and outdoor characterization tests. Subsequently, these test measurements have been used in algorithm replays using various sub-networks of counters. Test measurements combined with algorithm outputs are used to extract Key Measurements and Benchmark (KMB) datasets. We present two selective analyses of these datasets: (a) a notional border monitoring scenario that highlights the benefits of a network of counters compared to individual detectors, and (b) new insights into the Sequential Probability Ratio Test (SPRT) detection method, which lead to its adaptations for improved detection. Using KMB datasets from an outdoor test, we construct a notional border monitoring scenario, wherein twelve 2”*2” NaI detectors are deployed on the periphery of 21*21meter square region. A Cs-137 (175 uCi) source is moved across this region, starting several meters from outside and finally moving away. The measurements from individual counters and the network were processed using replays of a particle filter algorithm developed under IRSS program. The algorithm outputs from KMB datasets clearly illustrate the benefits of combining measurements from all networked counters: the source was detected before it entered the region, during its trajectory inside, and until it moved several meters away. When individual counters are used for detection, the source was detected for much shorter durations, and sometimes was missed in the interior region. The application of SPRT for detecting radiation sources requires choosing the detection threshold, which in turn requires a source strength estimate, typically specified as a multiplier of the background radiation level. A judicious selection of this source multiplier is essential to achieve optimal detection probability at a specified false alarm rate. Typically, this threshold is chosen from the Receiver Operating Characteristic (ROC) by varying the source multiplier estimate. ROC is expected to have a monotonically increasing profile between the detection probability and false alarm rate. We derived ROCs for multiple indoor tests using KMB datasets, which revealed an unexpected loop shape: as the multiplier increases, detection probability and false alarm rate both increase until a limit, and then both contract. Consequently, two detection probabilities correspond to the same false alarm rate, and the higher is achieved at a lower multiplier, which is the desired operating point. Using the Chebyshev’s inequality we analytically confirm this shape. Then, we present two improved network-SPRT methods by (a) using the threshold off-set as a weighting factor for the binary decisions from individual detectors in a weighted majority voting fusion rule, and (b) applying a composite SPRT derived using measurements from all counters.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗

An unstructured body-of-revolution electromagnetic particle-in-cell algorithm with radial perfectly matched layers and dual polarizations

A novel electromagnetic particle-in-cell algorithm has been developed for fully kinetic plasma simulations on unstructured (irregular) meshes in complex body-of-revolution geometries. The algorithm, implemented in the BORPIC++ code, utilizes a set of field scalings and a coordinate mapping, reducing the Maxwell field problem in a cylindrical system to a Cartesian finite element Maxwell solver in the meridian plane. The latter obviates the cylindrical coordinate singularity in the symmetry axis. The choice of an unstructured finite element discretization enhances the geometrical flexibility of the BORPIC++ solver compared to the more traditional finite difference solvers. Symmetries in Maxwell’s equations are explored to decompose the problem into two dual polarization states with isomorphic representations that enable code reuse. The particle-in-cell scatter and gather steps preserve charge conservation at the discrete level. Our previous algorithm (BORPIC+) discretized the E and B field components of TE Φ and TM Φ polarizations on the finite element (primal) mesh. Here, we employ a new field-update scheme. Using the same finite element (primal) mesh, this scheme advances two sets of field components independently: (1) E and B of TE Φ polarized fields, (E z , E ρ , B Φ ) and (2) D and H of TM Φ polarized fields, (D Φ , H z , H ρ ). Since these field updates are not explicitly coupled, the new field solver obviates the coordinate singularity, which otherwise arises at the cylindrical symmetric axis, ρ = 0 when defining the discrete Hodge matrices (generalized finite element mass matrices). Here, a cylindrical perfectly matched layer is implemented as a boundary condition in the radial direction to simulate open space problems, with periodic boundary conditions in the axial direction. We investigate effects of charged particles moving next to the cylindrical perfectly matched layer. We model azimuthal currents arising from rotational motion of charged rings, which produce TMΦ polarized fields. Several numerical examples are provided to illustrate the first application of the algorithm.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Development and experimental qualification of novel disruption prevention techniques on DIII-D

Novel disruption prevention solutions spanning a range of control regimes are being developed and tested on DIII-D to enable ITER success. First, a new real-time control algorithm has been developed and tested for regulating nearness to stability limits and maintaining safety-margins. Its first application has been for reliable prevention of vertical displacement events (VDEs) by adjusting plasma elongation (κ) and the inner-gap between the plasma and inner-wall in response to real- time open-loop VDE growth rate (γ) estimators. VDEs were robustly prevented up to average open-loop growth rates of 800 rad/s with initial tunings, with only applying shape modification when near safety limits. Second, the disruption risk during fast, emergency shutdown after large tearing and locked modes can be significantly improved by transitioning to a limited topology during shutdown. More than 50% of emergency limited shutdowns after locked modes reach a final normalized current I_N < 0.3 before terminating, scaling to the 3 MA ITER requirement. Furthermore, this is in contrast to diverted shutdowns, the majority of which disrupt at I_N > 0.8. Despite improvements, these results highlight the critical importance of early prevention. Third, a novel emergency shut down method has been developed which excites instabilities to form a warm, helical core post-thermal quench. The current quench extends to ~100ms and avoids VDEs and runaway electron generation. Novel real-time machine learning disruption prediction has been integrated with the DIII-D proximity controller, and a real- time compatible multi-mode MHD spectroscopy technique has been developed. Results presented here were enabled by a focused effort, the Disruption Free Protocol, in DIII-D’s 2019-20 campaign to complement disruption prevention experiments with a large piggy-back program. In addition to testing novel techniques, it is estimated to have helped avoid 32 potential disruptions in piggyback operations with rapid, early shutdowns after large rotating n=1 or locked modes.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Cardiac motion correction based on partial angle reconstructed images in x-ray CT

Purpose: Cardiac x-ray CT imaging is still challenging due to heart motion, which cannot be ignored even with the current rotation speed of the equipment. In response, many algorithms have been developed to compensate remaining motion artifacts by estimating the motion using projection data or reconstructed images. In these algorithms, accurate motion estimation is critical to the compensated image quality. In addition, since the scan range is directly related to the radiation dose, it is preferable to minimize the scan range in motion estimation. In this paper, the authors propose a novel motion estimation and compensation algorithm using a sinogram with a rotation angle of less than 360°. The algorithm estimates the motion of the whole heart area using two opposite 3D partial angle reconstructed (PAR) images and compensates the motion in the reconstruction process. Methods: A CT system scans the thoracic area including the heart over an angular range of 180° + α + β, where α and β denote the detector fan angle and an additional partial angle, respectively. The obtained cone-beam projection data are converted into cone-parallel geometry via row-wise fan-to-parallel rebinning. Two conjugate 3D PAR images, whose center projection angles are separated by 180°, are then reconstructed with an angular range of β, which is considerably smaller than a short scan range of 180° + α. Although these images include limited view angle artifacts that disturb accurate motion estimation, they have considerably better temporal resolution than a short scan image. Hence, after preprocessing these artifacts, the authors estimate a motion model during a half rotation for a whole field of view via nonrigid registration between the images. Finally, motion-compensated image reconstruction is performed at a target phase by incorporating the estimated motion model. The target phase is selected as that corresponding to a view angle that is orthogonal to the center view angles of two conjugate PAR images. To evaluate the proposed algorithm, digital XCAT and physical dynamic cardiac phantom datasets are used. The XCAT phantom datasets were generated with heart rates of 70 and 100 bpm, respectively, by assuming a system rotation time of 300 ms. A physical dynamic cardiac phantom was scanned using a slowly rotating XCT system so that the effective heart rate will be 70 bpm for a system rotation speed of 300 ms. Results: In the XCAT phantom experiment, motion-compensated 3D images obtained from the proposed algorithm show coronary arteries with fewer motion artifacts for all phases. Moreover, object boundaries contaminated by motion are well restored. Even though object positions and boundary shapes are still somewhat different from the ground truth in some cases, the authors see that visibilities of coronary arteries are improved noticeably and motion artifacts are reduced considerably. The physical phantom study also shows that the visual quality of motion-compensated images is greatly improved. Conclusions: The authors propose a novel PAR image-based cardiac motion estimation and compensation algorithm. The algorithm requires an angular scan range of less than 360°. The excellent performance of the proposed algorithm is illustrated by using digital XCAT and physical dynamic cardiac phantom datasets.

60 APPLIED LIFE SCIENCES↗

Effective Padding of Multi-Dimensional Arrays to Avoid Cache Conflict Misses

Caches are used to significantly improve performance. Even with high degrees of set-associativity, the number of accessed data elements mapping to the same set in a cache can easily exceed the degree of associativity, causing conflict misses and lowered performance, even if the working set is much smaller than cache capacity. Array padding (increasing the size of array dimensions) is a well known optimization technique that can reduce conflict misses. In this paper, we develop the first algorithms for optimal padding of arrays for a set associative cache for arbitrary tile sizes, In addition, we develop the first solution to padding for nested tiles and multi-level caches. The techniques are in implemented in PAdvisor tool. Experimental results with multiple benchmarks demonstrate significant performance improvement from use of PAdvisor for padding.

array padding↗

Alignment of Short Reads: A Crucial Step for Application of Next-Generation Sequencing Data in Precision Medicine

Precision medicine or personalized medicine has been proposed as a modernized and promising medical strategy. Genetic variants of patients are the key information for implementation of precision medicine. Next-generation sequencing (NGS) is an emerging technology for deciphering genetic variants. Alignment of raw reads to a reference genome is one of the key steps in NGS data analysis. Many algorithms have been developed for alignment of short read sequences since 2008. Users have to make a decision on which alignment algorithm to use in their studies. Selection of the right alignment algorithm determines not only the alignment algorithm but also the set of suitable parameters to be used by the algorithm. Understanding these algorithms helps in selecting the appropriate alignment algorithm for different applications in precision medicine. Here, we review current available algorithms and their major strategies such as seed-and-extend and q-gram filter. We also discuss the challenges in current alignment algorithms, including alignment in multiple repeated regions, long reads alignment and alignment facilitated with known genetic variants.

59 BASIC BIOLOGICAL SCIENCES↗

Retrieval of temperature and humidity profiles from ground-based high-resolution infrared observations using an adaptive fast iterative algorithm

Various retrieval algorithms have been developed for retrieving temperature and water vapor profiles from Atmospheric Emitted Radiance Interferometer (AERI) observations. The physical retrieval algorithm, named AERI Optimal Estimation (AERIoe), outperforms other retrieval algorithms in many aspects except the retrieval time, which is significantly increased due to the complex radiative transfer process. The calculation of the Jacobian matrix is the most computationally intensive step of the physical retrieval algorithm. Interestingly, an analysis of the change in AERI observations' information content with respect to Jacobians revealed that the AERIoe algorithm's performance presents negligible dependence on these metrics. Thus, the Jacobian matrix could remain unchanged when the variation in the atmospheric state is small in the retrieval process to reduce the most time-consuming computation. On the basis of the above findings, a fast physical–iterative retrieval algorithm was proposed by adaptively recalculating Jacobians in keeping with the changes in the atmospheric state. Experiments with synthetic observations demonstrate that the proposed method experiences an average reduction in retrieval time by an impressive 59 % compared to the original AERIoe algorithm while achieving maximum root-mean-square errors of less than 0.95 K and 0.22 log(ppmv) for heights below 3 km for the temperature and water vapor profile, respectively. Further analyses revealed that the fast-retrieval algorithm reached an acceptable convergence rate of 98.7 %, marginally lower than AERIoe's 99.9 % convergence rate for the 826 cases used in this study.

54 ENVIRONMENTAL SCIENCES↗

Development and experimental qualification of novel disruption prevention techniques on DIII-D

Novel disruption prevention solutions spanning a range of control regimes are being developed and tested on DIII-D to enable ITER success. First, a new real-time control algorithm has been developed and tested for regulating nearness to stability limits and maintaining safety-margins. Its first application has been for reliable prevention of vertical displacement events (VDEs) by adjusting plasma elongation (κ) and the inner-gap between the plasma and inner-wall in response to real- time open-loop VDE growth rate (γ) estimators. VDEs were robustly prevented up to average open-loop growth rates of 800 rad/s with initial tunings, with only applying shape modification when near safety limits. Second, the disruption risk during fast, emergency shutdown after large tearing and locked modes can be significantly improved by transitioning to a limited topology during shutdown. More than 50% of emergency limited shutdowns after locked modes reach a final normalized current I N < 0.3 before terminating, scaling to the 3 MA ITER requirement. This is in contrast to diverted shutdowns, the majority of which disrupt at I N > 0.8. Despite improvements, these results highlight the critical importance of early prevention. Third, a novel emergency shut down method has been developed which excites instabilities to form a warm, helical core post-thermal quench. The current quench extends to ~100ms and avoids VDEs and runaway electron generation. Novel real-time machine learning disruption prediction has been integrated with the DIII-D proximity controller, and a real- time compatible multi-mode MHD spectroscopy technique has been developed. Results presented here were enabled by a focused effort, the Disruption Free Protocol, in DIII-D’s 2019-20 campaign to complement disruption prevention experiments with a large piggy-back program. In addition to testing novel techniques, it is estimated to have helped avoid 32 potential disruptions in piggyback operations with rapid, early shutdowns after large rotating n=1 or locked modes.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Muon momentum reconstruction in ICARUS-T600 LArTPC via Multiple Scattering

The SBN program at Fermilab investigates the possible existence of eV-scale sterile neutrinos. This work focuses on reconstructing muon momentum in $\nu$-Ar interactions within the ICARUS-T600 LArTPC detector using Multiple Coulomb Scattering (MCS), the only viable method for non-contained muons. Two algorithms are evaluated: the Gran Sasso algorithm (2D, Collection view) and the MicroBooNE algorithm (3D angles), applied to 2391 simulated and 2255 real stopping muon tracks (0.4-1 GeV/c). Performance is assessed via bias and resolution, using range-based momentum as a reference. Two enhanced versions of the Gran Sasso algorithm are also developed: one combining all three wire plane views, and one using 3D angles. Results show that the MicroBooNE algorithm performs slightly better, with resolution down to 14\% in simulation and 16\% in real data. These improvements significantly boost $\nu_\mu$ CC statistics, enhancing sensitivity to $\nu_\mu$ disappearance and 3+1 oscillation signals.

Chiello, Giovanni [Pisa U.] (ORCID:000900064571071↗

Multivariate analysis of gamma spectra to characterize used nuclear fuel

Abstract—The Multi-Isotope Process (MIP) Monitor provides an efficient approach to monitoring the process conditions in used nuclear fuel reprocessing facilities to support process verification and validation. The MIP Monitor applies multivariate analysis to gamma spectroscopy of reprocessing streams in order to detect small changes in the gamma spectrum, which may indicate changes in process conditions. This research extends the MIP Monitor by characterizing a used fuel sample after initial dissolution according to the type of reactor of origin (pressurized or boiling water reactor), initial enrichment, burn up, and cooling time. Simulated gamma spectra were used to develop and test three fuel characterization algorithms. The classification and estimation models employed are based on the partial least squares regression (PLS) algorithm. A PLS discriminate analysis model was developed which perfectly classified reactor type. Locally weighted PLS models were fitted on-the-fly to estimate continuous fuel characteristics. Burn up was predicted within 0.1% root mean squared percent error (RMSPE) and both cooling time and initial enrichment within approximately 2% RMSPE. This automated fuel characterization can be used to independently verify operator declarations of used fuel characteristics and inform the MIP Monitor anomaly detection routines at later stages of the fuel reprocessing stream to improve sensitivity to changes in operational parameters and material diversions.

Multivariate Analysis for Characterization of Used↗

A Positive-Definite, WENO-Limited, High-Order Finite Volume Solver for 2-D Transport on the Cubed Sphere Using an ADER Time Discretization

Modern computer architectures reward added computation if it reduces algorithmic dependence, reduces data movement, increases accuracy/robustness, and improves memory accesses. The driving motive for this study is to develop a numerical algorithm that respects these constraints while improving accuracy and robustness. This study introduces the ADER-DT (Arbitrary DERivatives in time and space-differential transform) time discretization to positive-definite, weighted essentially nonoscillatory (WENO)-limited, finite volume transport on the cubed sphere in lieu of semidiscrete integrators. The cost of the ADER-DT algorithm is significantly improved from previous implementations without affecting accuracy. A new function-based WENO implementation is also detailed for use with the ADER-DT time discretization. While ADER-DT costs about 1.5 times more than a fourth-order, five-stage strong stability preserving Runge-Kutta (SSPRK4) method, it is far more computationally dense (which is advantageous on accelerators such as graphics processing units), and it has a larger effective maximum stable time step. ADER-DT errors converge more quickly with grid refinement than SSPRK4, giving 6.5 times less error in the L ∞ norm than SSPRK4 at the highest refinement level for smooth data. For nonsmooth data, ADER-DT resolves C 0 discontinuities more sharply. For a complex flow field, ADER exhibits less phase error than SSPRK4. In conclusion, improving both accuracy and robustness as well as better respecting modern computational efficiency requirements, we believe the method presented herein is competitive for efficiently transporting tracers over the sphere for applications targeting modern computing architectures.

97 MATHEMATICS AND COMPUTING↗