Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “distributed algorithms”

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,279 records · Page 71
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Machine Learning Classification of Molten Salt Heat Exchanger Channel Plugging using Synthetic Data

This report addresses the requirements of Milestone M3.4 AI capability to identify and predict maintenance events. Development of digital twins (DT) for molten salt reactor (MSR) components is crucial for reducing operating and maintenance costs (O&M) and ensuring commercial viability of these reactors. Our focus is on development of DT for MSR primary system heat exchanger (HX), a critical component, the fault in which can reduce operating efficiency and force reactor shutdown. We are investigating the feasibility of a conceptual DT of HX consisting of internal distributed temperature sensing with fiber optics and machine learning (ML) algorithms to detect and localize faults. To determine the optimal approach to detection and localization of channel plugging, we benchmark seven different ML models: Logistic Regression, K-Nearest Neighbors (KNN), Gaussian Naïve Bayes, Support Vector Machines (SVM), Decision Tree Classifier, Random Forest Tree Classifier, and Feed-Forward Neural Network. ML algorithms are benchmarked using synthetic HX plugging data generated with computational fluid dynamics COMSOL software, with added brown noise to represent experimental noise. We show that the best performance is obtained with the Decision Tree classifier.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2021

Probabilistic Data Association for Orbital-Element Estimation Using Multistage Expectation–Maximization

Tracking space objects is important for managing space traffic and predicting collisions, but is difficult in part due to data association and orbit model uncertainty. Expectation–maximization (EM) is a commonly used tracking method that has not been widely considered for tracking space objects. The technique consists of iteratively computing data association probabilities with a set of current element estimates, and updating estimates of the elements by solving a nonlinear weighted least-squares regression problem where the weights are the data association probabilities. In this paper, we demonstrate the use of EM for probabilistic data association and orbital-element estimation by applying the technique to simulated data from two angles-only tracking scenarios. In both scenarios, EM provides correct data associations and accurate maximum likelihood estimates of orbital elements. One scenario considers tracking a single object in clutter and quantifies the improvement of the orbital-element estimates and data associations as the detection probability increases. However, standard application of EM requires knowing the number of objects or may fail when a large number of objects are present. To address these issues, this paper employs a multistage version of EM that is applicable when there are a large and possibly unknown number of objects.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Stochastic microstructural analysis of ceramic matrix composites using a high-fidelity multiscale framework

This paper presents a high-fidelity multiscale framework to simulate the mechanical behavior of ceramic matrix composites (CMCs), accounting for the complex micromorphology captured using detailed material characterization. First, high-resolution micrographs are obtained for the specific carbon fiber silicon-carbide-nitride matrix (C/SiNC) CMC to characterize the variability of the architectural features and manufacturing-induced defects at the microscale. An image processing algorithm is then used to precisely estimate the size and distribution of all subscale features and defects from the micrographs. The information is then used to generate a three-dimensional stochastic representative volume element (SRVE) to reconstruct microscale constituents accounting for the variability. As a result, the generated SRVEs are simulated using the high-fidelity generalized method of cells (HFGMC) micromechanics theory to investigate the effects of defects on the elastic properties of C/SiNC CMCs.

Ceramic Matrix Composites↗
DOE OSTI2012

Probabilistic Change Detection Framework for Analyzing Settlement Dynamics Using Very High-resolution Satellite Imagery

Global human population growth and an increasingly urbanizing world have led to rapid changes in human settlement landscapes and patterns. Timely monitoring and assessment of these changes and dissemination of accurate information is important for policy makers, city planners, and humanitarian relief workers. Satellite imagery provides useful data for the aforementioned applications, and remote sensing can be used to identify and quantify change areas. We explore a probabilistic framework to identify changes in human settlements using very high-resolution satellite imagery. As compared to predominantly pixel-based change detection systems which are highly sensitive to image registration errors, our grid (block) based approach is more robust to registration errors. The presented framework is an automated change detection system applicable to both panchromatic and multi-spectral imagery. The detection system provides comprehensible information about change areas, and minimizes the post-detection thresholding procedure often needed in traditional change detection algorithms.

99 GENERAL AND MISCELLANEOUS↗
DOE OSTI2013

Polytope

Polytope is a library that wraps several algorithms for generating the Voronoi diagram in both serial and distributed parallel.

Source record↗
DOE OSTI2014

SU-E-T-81: Comparison of Microdosimetric Quantities Calculated Using the Track Structure Monte Carlo Algorithms Geant4-DNA and NOREC

Purpose: Microdosimetric quantities, such as the lineal energy, have been shown to correlate with the biological response to radiation and the relative biological effect of different radiation types. Track-structure Monte Carlo simulations are an important tool for investigating these responses and for developing mechanistic models to explain them. However, some of the cross-sectional data used in these algorithms has large uncertainties; thus, it is important to investigate how the implementation of the different codes affects the quantities of interest. Methods: Two of the most widely-used publicly available track-structure Monte Carlo codes, Geant4-DNA and NOREC, were used generate electron tracks for two particle sources. One source was a mono-energetic parallel beam of electrons with energies from 5 to 500-keV, and the lineal energy for each track was calculated in 1-mm-spheres arranged in planar arrays at multiple distances from the source. The second source was mono-energetic, uniformly-distributed, and isotropic source, and the lineal energy was scored in a single 30-mm-sphere for energies between 300-eV and 5-keV. Results: The dose-mean lineal energy for the parallel-beam simulations almost all agreed within 5%. For the uniformly-distributed source, at the lowest energies there was strong agreement between the algorithms, but the Geant4-DNA simulations showed slightly more high-energy events for more energetic electrons, but the dose-mean lineal energy agreed to within 4% for all energies. Conclusion: While there were slight differences in the results between the codes, these were consistent with previous studies of the stopping power and angular scattering distributions. Importantly, the computation time for Geant4-DNA was larger than for NOREC, largely due to approximations used in the NOREC for energies below 10-eV. This study shows that these approximation does not have a major impact on the microdosimetry on the energy and length scales investigated.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2021

Diagnosing Open Cluster Stock 2: Member Candidates and Mass Distribution with Gaia DR2 and LAMOST

We identify 1325 member candidates of the open cluster (OC) Stock 2 using data from Gaia DR2. We use the algorithms Clusterix 2.0 and HDBSCAN to select cluster candidates and further refine the final cluster membership by defining neighbors in 5D phase space (X {sub cp}, Y {sub cp}, Z{sub cp},κ⋅μ{sub α}{sup ∗}/ϖ, κ · μ {sub δ}/ϖ). Among these candidates, less than half have G, G {sub BP}, and G {sub RP} extinctions from Gaia. When Gaia extinctions are unavailable, we compute extiction using empirical formulas and E(B − V) = 0.350. We analyze the spatial distribution and mass profile of Stock 2. Our results reveal Stock 2 is still a bound OC and we find evidence of mass segregation. By comparing initial mass functions, the present-day mass function indicates that Stock 2 is a massive stellar cluster with a mass of 4000 M {sub ⊙}. The core radius and tidal radius, calculated via the radial density profile and total mass, are 3.97 pc and 22.65 pc, respectively. Common stars between our selected member candidates and the Large Sky Area Multi-Object Fiber Spectroscopic Telescope DR7 medium-resolution catalog give a metalliclity of [Fe/H] = −0.040 ± 0.147.

47 OTHER INSTRUMENTATION↗
DOE OSTI2019

Robust, automated sleep scoring by a compact neural network with distributional shift correction

Studying the biology of sleep requires the accurate assessment of the state of experimental subjects, and manual analysis of relevant data is a major bottleneck. Recently, deep learning applied to electroencephalogram and electromyogram data has shown great promise as a sleep scoring method, approaching the limits of inter-rater reliability. As with any machine learning algorithm, the inputs to a sleep scoring classifier are typically standardized in order to remove distributional shift caused by variability in the signal collection process. However, in scientific data, experimental manipulations introduce variability that should not be removed. For example, in sleep scoring, the fraction of time spent in each arousal state can vary between control and experimental subjects. We introduce a standardization method, mixture z-scoring, that preserves this crucial form of distributional shift. Using both a simulated experiment and mouse in vivo data, we demonstrate that a common standardization method used by state-of-the-art sleep scoring algorithms introduces systematic bias, but that mixture z-scoring does not. We present a free, open-source user interface that uses a compact neural network and mixture z-scoring to allow for rapid sleep scoring with accuracy that compares well to contemporary methods. This work provides a set of computational tools for the robust automation of sleep scoring.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2025

FY 2025 End of Year Report: Seismic Monitoring of Underground Vibration Sources using Distributed Acoustic Sensing (DAS) and Seismometers

This end-of-year report summarizes progress on using seismic monitoring to detect, associate, and locate anomalous vibration signals that may indicate potential containment breaches. The work focused on four key tasks: 1. Developing a database of continuous waveforms and ground-truth event data from multiple sensing modalities. 2. Refining and implementing detection and association algorithms to generate a catalog of anomalous underground activities. 3. Testing and improving distributed acoustic sensing amplitude-based geolocation methods to build an event location catalog. 4. Testing and refining seismic array polarization-based geolocation methods to build an event location catalog. This report provides a brief recap of results from the FY25 midyear report (Tasks 1 and 2) and presents new findings from geolocation methods (Tasks 3 and 4).

58 GEOSCIENCES↗
DOE OSTI2022

Multinode Multi-GPU Two-Electron Integrals: Code Generation Using the Regent Language

The computation of two-electron repulsion integrals (ERIs) is often the most expensive step of integral-direct self-consistent field methods. Formally it scales as O(N 4 ), where N is the number of Gaussian basis functions used to represent the molecular wave function. In practice, this scaling can be reduced to O(N 2 ) or less by neglecting small integrals with screening methods. The contributions of the ERIs to the Fock matrix are of Coulomb (J) and exchange (K) type and require separate algorithms to compute matrix elements efficiently. We previously implemented highly efficient GPU-accelerated J-matrix and K-matrix algorithms in the electronic structure code TeraChem. Although these implementations supported the use of multiple GPUs on a node, they did not support the use of multiple nodes. This presents a key bottleneck to cutting-edge ab initio simulations of large systems, e.g., excited state dynamics of photoactive proteins. We present our implementation of multinode multi-GPU J- and K-matrix algorithms in TeraChem using the Regent programming language. Regent directly supports distributed computation in a task-based model and can generate code for a variety of architectures, including NVIDIA GPUs. We demonstrate multinode scaling up to 45 GPUs (3 nodes) and benchmark against hand-coded TeraChem integral code. Finally, we also outline our metaprogrammed Regent implementation, which enables flexible code generation for integrals of different angular momenta.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2016

An Asynchronous Task-based Fan-Both Sparse Cholesky Solver

Systems of linear equations arise at the heart of many scientific and engineering applications. Many of these linear systems are sparse; i.e., most of the elements in the coefficient matrix are zero. Direct methods based on matrix factorizations are sometimes needed to ensure accurate solutions. For example, accurate solution of sparse linear systems is needed in shift-invert Lanczos to compute interior eigenvalues. The performance and resource usage of sparse matrix factorizations are critical to time-to-solution and maximum problem size solvable on a given platform. In many applications, the coefficient matrices are symmetric, and exploiting symmetry will reduce both the amount of work and storage cost required for factorization. When the factorization is performed on large-scale distributed memory platforms, communication cost is critical to the performance of the algorithm. At the same time, network topologies have become increasingly complex, so that modern platforms exhibit a high level of performance variability. This makes scheduling of computations an intricate and performance-critical task. In this paper, we investigate the use of an asynchronous task paradigm, one-sided communication and dynamic scheduling in implementing sparse Cholesky factorization (symPACK) on large-scale distributed memory platforms. Our solver symPACK relies on efficient and flexible communication primitives provided by the UPC++ library. Performance evaluation shows good scalability and that symPACK outperforms state-of-the-art parallel distributed memory factorization packages, validating our approach on practical cases.

Jacquelin, Mathias↗
DOE OSTI2021

DNTTD (Distributed Non-Negative Tensor Train Decomposition)

The era of exascale computing opens new venues for innovations and discoveries in many scientific, engineering, and commercial fields. However, with the exa flops also come the extra-large high-dimensional data generated by high performance computing. High-dimensional data is presented as multidimensional arrays, aka tensors. The presence of latent (not directly observable) structures in the tensor allows a unique representation and compression of the data by classical tensor factorization techniques. However, the classical tensor methods are not always stable or they can be exponential in their memory requirements, which makes them not suitable for high-dimensional tensors. Tensor train (TT) is a state-of-the-art tensor network introduced for factorization of high-dimensional tensors. TT transforms the initial high-dimensional tensor in a network of three-dimensional tensors that requires only a linear storage. Many real-world data, such as, density, temperature, population, probability, etc., are non-negative and for an easy interpretation, the algorithms preserving non-negativity are preferred. Here, we introduce a distributed non-negative tensor-train and demonstrate its scalability and the compression on synthetic and real world big datasets.

Bhattarai, Manish↗
DOE OSTI2021

Adaptive Circuit Learning for Quantum Metrology

Quantum sensing is an important application of emerging quantum technologies. We explore whether a hybrid system of quantum sensors and quantum circuits can surpass the classical limit of sensing. In particular, we use optimization techniques to search for encoder and decoder circuits that scalably improve sensitivity under given application and noise characteristics. Furthermore, our approach uses a variational algorithm that can learn a quantum sensing circuit based on platform-specific control capacity, noise, and signal distribution. The quantum circuit is composed of an encoder which prepares the optimal sensing state and a decoder which gives an output distribution containing information of the signal. We optimize the full circuit to maximize the Signal-to-Noise Ratio (SNR). Furthermore, this learning algorithm can be run on real hardware scalably by using the "parameter-shift" rule which enables gradient evaluation on noisy quantum circuits, avoiding the exponential cost of quantum system simulation. We demonstrate up to 13.12x SNR improvement over existing fixed protocol (GHZ), and 3.19x Classical Fisher Information (CFI) improvement over the classical limit on 15 qubits using IBM quantum computer. More notably, our algorithm overcomes the decreasing performance of existing entanglement-based protocols with increased system sizes.

42 ENGINEERING↗
DOE OSTI2015

SU-E-J-92: Validating Dose Uncertainty Estimates Produced by AUTODIRECT, An Automated Program to Evaluate Deformable Image Registration Accuracy

Purpose: Deformable image registration (DIR) is a powerful tool with the potential to deformably map dose from one computed-tomography (CT) image to another. Errors in the DIR, however, will produce errors in the transferred dose distribution. We have proposed a software tool, called AUTODIRECT (automated DIR evaluation of confidence tool), which predicts voxel-specific dose mapping errors on a patient-by-patient basis. This work validates the effectiveness of AUTODIRECT to predict dose mapping errors with virtual and physical phantom datasets. Methods: AUTODIRECT requires 4 inputs: moving and fixed CT images and two noise scans of a water phantom (for noise characterization). Then, AUTODIRECT uses algorithms to generate test deformations and applies them to the moving and fixed images (along with processing) to digitally create sets of test images, with known ground-truth deformations that are similar to the actual one. The clinical DIR algorithm is then applied to these test image sets (currently 4) . From these tests, AUTODIRECT generates spatial and dose uncertainty estimates for each image voxel based on a Student’s t distribution. This work compares these uncertainty estimates to the actual errors made by the Velocity Deformable Multi Pass algorithm on 11 virtual and 1 physical phantom datasets. Results: For 11 of the 12 tests, the predicted dose error distributions from AUTODIRECT are well matched to the actual error distributions within 1–6% for 10 virtual phantoms, and 9% for the physical phantom. For one of the cases though, the predictions underestimated the errors in the tail of the distribution. Conclusion: Overall, the AUTODIRECT algorithm performed well on the 12 phantom cases for Velocity and was shown to generate accurate estimates of dose warping uncertainty. AUTODIRECT is able to automatically generate patient-, organ- , and voxel-specific DIR uncertainty estimates. This ability would be useful for patient-specific DIR quality assurance.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2015

$xy$ Position Reconstruction in DarkSide-50

The DarkSide-50 experiment seeks to directly detect dark matter in a liquid argon time projection chamber. In this dissertation, I present an algorithm of my design that determines the position of particle interactions with the liquid argon. This position reconstruction algorithm will be used by DarkSide-50 to reject backgrounds, particularly backgrounds from radioactive elements on the detector surface. The position reconstruction algorithm functions by constructing light response functions (LRFs) that map locations in the detector to the expected distribution of signal in DarkSide-50's 38 photomultiplier tubes. Accurate LRFs cannot be produced by simulations of DarkSide-50's optics because such simulations are known to be awed. Instead, this algorithm constructs LRFs using an iterative process driven by data. Initial, awed LRFs are produced using simulated events but then used to produce new LRFs from data events. Multiple generations of LRFs are created from data with each generation driven to better satisfy a known feature of the detector: the dominant argon-39 background is uniformly distributed. I also discuss a method of discriminating against surface background as an alternative to the common approach of ducialization. This method considers the di erence in goodnessof- t between the best- t reconstructed position and the best- t position at the detector's surface. I conclude by presenting results on the performance and validity of this algorithm, including some discussion of reconstruction errors.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2017

Uncertainty analysis of wavelet-based feature extraction for isotope identification on NaI gamma-ray spectra

Low-resolution isotope identifiers are widely deployed for nuclear security purposes, but these detectors currently demonstrate problems in making correct identifications in many typical usage scenarios. While there are many hardware alternatives and improvements that can be made, performance on existing low resolution isotope identifiers should be able to be improved by developing new identification algorithms. We have developed a wavelet-based peak extraction algorithm and an implementation of a Bayesian classifier for automated peak-based identification. The peak extraction algorithm has been extended to compute uncertainties in the peak area calculations. To build empirical joint probability distributions of the peak areas and uncertainties, a large set of spectra were simulated in MCNP6 and processed with the wavelet-based feature extraction algorithm. Kernel density estimation was then used to create a new component of the likelihood function in the Bayesian classifier. Furthermore, identification performance is demonstrated on a variety of real low-resolution spectra, including Category I quantities of special nuclear material.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2020

Local Phasor-Based Control of DER Inverters for Voltage Regulation on Distribution Feeders

We introduce a new control paradigm termed Phasor-Based Control (PBC) to coordinate Distributed Energy Resources (DER) for improved voltage regulation and other objectives. PBC is a multi-layer control framework where the state of the distribution grid is represented by voltage phasors, and Phasor Measurement Units (PMUs) measure the state at critical points in the distribution grid. In the PBC paradigm, a supervisory controller (S-PBC) sets phasor targets which local controllers track. In this paper, we propose a Proportional Integral (PI) implementation for the local control layer (LPBC), to regulate real and reactive power output of distributed inverters to track a voltage phasor target computed by the supervisory layer. We tune the PI controller gains offline with a genetic algorithm that yields better performance than the Ziegler-Nichols method. We benchmark the proposed L-PBC controller against droop volt-var control (DVVC) and observe improved voltage regulation in simulation on the IEEE 13 node unbalanced test feeder (IEEE 13NF). Furthermore, by means of numerical simulation we observe the response of the L-PBC controllers to small and large grid disturbances. Simulations on larger feeders, IEEE 123-node and 647-node, demonstrate challenges with tuning controllers in setups with different amounts of power-voltage coupling.

42 ENGINEERING↗