Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “applied computing”

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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Provable bounds for noise-free expectation values computed from noisy samples

Quantum computing has emerged as a powerful computational paradigm capable of solving problems beyond the reach of classical computers. However, today’s quantum computers are noisy, posing challenges to obtaining accurate results. Here, we explore the impact of noise on quantum computing, focusing on the challenges in sampling bit strings from noisy quantum computers and the implications for optimization and machine learning. We formally quantify the sampling overhead to extract good samples from noisy quantum computers and relate it to the layer fidelity, a metric to determine the performance of noisy quantum processors. Further, we show how this allows us to use the conditional value at risk of noisy samples to determine provable bounds on noise-free expectation values. We discuss how to leverage these bounds for different algorithms and demonstrate our findings through experiments on real quantum computers involving up to 127 qubits. The results show strong alignment with theoretical predictions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Automated Image Segmentation and Processing Pipeline Applied to X–Ray Computed Tomography Studies of Pitting Corrosion in Aluminum Wires

Understanding pitting corrosion is critical, yet its kinetics and morphology remain challenging to study from X-ray computed tomography (XCT) due to manual segmentation barriers. To address this, an automated pipeline leveraging deep learning for efficient large-scale XCT analysis is developed, revealing new corrosion insights. The pipeline enables pit segmentation, 3D reconstruction, statistical characterization, and a topological transformation for visualization. Here, the pipeline is applied to 87 648 XCT images capturing commercial purity aluminum (1100 Al) wire exposed to sodium chloride (NaCl) salt particles over a period of 122 h. The pipeline achieves complete feature extraction and statistical quantification across the entire XCT dataset, leveraging distributed computing environment for high efficiency. Global growth kinetics such as high-level stepwise sigmoidal volume loss patterns and granular individual pit developments are both captured for 36 detected pits. By combining automation, computer vision, and extensive XCT datasets, this research accelerates precise corrosion assessment to enable materials science discoveries at scale.

36 MATERIALS SCIENCE↗
DOE OSTI2021

Lipkin model on a quantum computer

Atomic nuclei are important laboratories for exploring and testing new insights into the universe, such as experiments to directly detect dark matter or explore properties of neutrinos. The targets of interest are often heavy, complex nuclei that challenge our ability to reliably model them (as well as quantify the uncertainty of those models) with classical computers. Hence there is great interest in applying quantum computation to nuclear structure for these applications. As an early step in this direction, especially with regards to the uncertainties in the relevant quantum calculations, we develop circuits to implement variational quantum eigensolver (VQE) algorithms for the Lipkin-Meshkov-Glick model, which is often used in the nuclear physics community as a testbed for many-body methods. Here, we present quantum circuits for VQE for two and three particles and discuss the construction of circuits for more particles. Implementing the VQE for a two-particle system on the IBM Quantum Experience, we identify initialization and two-qubit gates as the largest sources of error. We find that error mitigation procedures reduce the errors in the results significantly, but additional quantum hardware improvements are needed for quantum calculations to be sufficiently accurate to be competitive with the best current classical methods.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Machine learning and deep learning tools for the automated capture of cancer surveillance data

The National Cancer Institute and the Department of Energy strategic partnership applies advanced computing and predictive machine learning and deep learning models to automate the capture of information from unstructured clinical text for inclusion in cancer registries. Applications include extraction of key data elements from pathology reports, determination of whether a pathology or radiology report is related to cancer, extraction of relevant biomarker information, and identification of recurrence. With the growing complexity of cancer diagnosis and treatment, capturing essential information with purely manual methods is increasingly difficult. These new methods for applying advanced computational capabilities to automate data extraction represent an opportunity to close critical information gaps and create a nimble, flexible platform on which new information sources, such as genomics, can be added. This will ultimately provide a deeper understanding of the drivers of cancer and outcomes in the population and increase the timeliness of reporting. These advances will enable better understanding of how real-world patients are treated and the outcomes associated with those treatments in the context of our complex medical and social environment.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2021

Individual Wave Detection and Tracking within a Rotating Detonation Engine through Computer Vision Object Detection applied to High-Speed Images

Known for their simplistic design and continuous detonation, rotating detonation engines (RDEs) constitute a majority of current pressure gain combustion (PGC) research efforts. Experimental RDE operation times have been continuously extended through the use of rig cooling techniques. As the window of observable behavior is expanded, and as the technology matures toward eventual integration within gas turbines, monitoring techniques must evolve to better match industrial diagnostics. High-speed image analysis techniques prove useful to capture and evaluate the unsteady detonation behavior within the RDE. Traditional image analysis techniques, however, require extensive processing times which prohibit simultaneous monitoring. To better address this problem, a computer vision object detection methodology is proposed to quickly detect individual detonation waves within a single down-axis image. Detonation waves are detected in individual images by the implemented computer vision method You Only Look Once (YOLO) object detection network. In order to detect detonation waves, the network must first be trained using RDE images of interest, for which each required phase of network development is outlined. Detection of waves is improved through proper treatment of the collected image set, variation of Intersection over Union (IoU) and confidence thresholding, and through a parametric study of annotation dimensions. Each detected wave is described by its location and rotational direction, and locations are tracked to calculate wave velocity across each frame, leading to a timestep resolution of 20 µs. Wave velocities are also calculated through a series of frames, leading to a suitable average velocity estimation using as few as 10 frames. Uncertainty analysis accounting for variation in camera framerate, pixel width and annotation centroid locations estimates a total uncertainty of ±4.3% for velocity calculations, using the smallest annotation boxes. This method offers great reductions in processing times, as a step toward real-time monitoring of detonation waves within an RDE. Improving on previous studies, this technique is impartial to wave modes not included in the original training set and calculates wave velocities independent of high-speed pressure data. The ability to isolate waves within predicted bounding boxes will likely facilitate analysis of pixel intensity variation as an estimation of wave strength in future work.

Johnson, Kristyn↗
DOE OSTI2025

Model-based iterative reconstruction with adaptive regularization for artifact reduction in electron tomography

Obtaining high-quality 3D reconstructions from electron tomography of crystalline particles embedded in lighter support elements is crucial for various material systems such as catalysts for fuel cell applications. However, significant challenges arise due to the limited tilt range, sparse and low signal-to-noise ratio of the measurements. In addition, small metal particles can cause strong streaking and shading artifacts in the 3D reconstructions when using conventional reconstruction algorithms due to the presence of Bragg diffraction and the large scattering cross-section difference between the materials of the particles and the background support regions. These artifacts lead to errors in the downstream characterization affecting extraction of critical features such as the size of the metal particles, their distribution and the volume of the lighter support regions. In this paper, we present a two-stage algorithm based on metal artifact reduction, utilizing model-based iterative reconstruction methods with adaptive adjustment of regularization parameters. Our approach yields high-quality 3D reconstructions compared to traditional algorithms, accurately capturing both the metal particles as well as the background support. We demonstrate the effectiveness of our algorithm through simulated and experimental bright-field electron tomography data, showing significant improvements in reconstruction quality compared to traditional methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

A Generic Advanced Computing Framework for Executing Windows-based Dynamic Contingency Analysis Tool in Parallel on Cluster Machines

Dynamic contingency analysis tool (DCAT) has been developed to assess the impact and likelihood of extreme contingencies and potential cascading events across their systems and interconnections. By including more customized protection models and corrective actions into the Windows-based commercial tools, DCAT can help operators understand the cascading behavior and find mitigation approaches to reduce the risk of cascading outages in a more realistic manner. In order to further enhance the capability of DCAT, this paper presents a design of an advanced computing framework that enables DCAT to run on a cluster machine to improve its computational performance. This framework is generic and can be applied to other Windows-based simulation tools to fill the technical gap of applying advanced computing technology to vendors' Windows-based tools. The preliminary tests using medium to large power systems have shown the effectiveness of this framework and its potential for accelerating the adoption of advanced computing in utilities.

Advanced computing, dynamic contingency analysis, ↗
DOE OSTI2020

Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers

As the growing availability of computational power slows, there has been an increasing reliance on algorithmic advances. However, faster algorithms alone will not necessarily bridge the gap in allowing computational scientists to study problems at the edge of scientific discovery in the next several decades. Often, it is necessary to simplify or precondition solvers to accelerate the study of large systems of linear equations commonly seen in a number of scientific fields. Preconditioning a problem to increase efficiency is often seen as the best approach; yet, preconditioners which are fast, smart, and efficient do not always exist. Following the progress of [1], we present a new preconditioner for symmetric diagonally dominant (SDD) systems of linear equations. These systems are common in certain PDEs, network science, and supervised learning among others. Based on spectral support graph theory, this new preconditioner builds off of the work of [2], computing and applying a V-cycle chain of approximate inverse matrices. This preconditioner approach is both algebraic in nature as well as hierarchically-constrained depending on the condition number of the system to be solved. Due to its generation of an Approximate Inverse Chain of matrices, we refer to this as the AIC preconditioner. We further accelerate the AIC preconditioner by utilizing precomputations to simplify setup and multiplications in the con-text of an iterative Krylov-subspace solver. While these iterative solvers can greatly reduce solution time, the number of iterations can grow large quickly in the absence of good preconditioners. Initial results for the AIC preconditioner have shown a very large reduction in iteration counts for SDD systems as compared to standard preconditioners such as Incomplete Cholesky (ICC) and Multigrid (MG). We further show significant reduction in iteration counts against the more advanced Combinatorial Multigrid (CMG) preconditioner. We have further developed no-fill sparsification techniques to ensure that the computational cost of applying the AIC preconditioner does not grow prohibitively large as the depth of the V-cycle grows for systems with larger condition numbers. Our numerical results have shown that these sparsifiers maintain the sparsity structure of our system while also displaying significant reductions in iteration counts.1 2

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers

As the growing availability of computational power slows, there has been an increasing reliance on algorithmic advances. However, faster algorithms alone will not necessarily bridge the gap in allowing computational scientists to study problems at the edge of scientific discovery in the next several decades. Often, it is necessary to simplify or precondition solvers to accelerate the study of large systems of linear equations commonly seen in a number of scientific fields. Preconditioning a problem to increase efficiency is often seen as the best approach; yet, preconditioners which are fast, smart, and efficient do not always exist. Following the progress of [1], we present a new preconditioner for symmetric diagonally dominant (SDD) systems of linear equations. These systems are common in certain PDEs, network science, and supervised learning among others. Based on spectral support graph theory, this new preconditioner builds off of the work of [2], computing and applying a V-cycle chain of approximate inverse matrices. This preconditioner approach is both algebraic in nature as well as hierarchically-constrained depending on the condition number of the system to be solved. Due to its generation of an Approximate Inverse Chain of matrices, we refer to this as the AIC preconditioner. We further accelerate the AIC preconditioner by utilizing precomputations to simplify setup and multiplications in the con-text of an iterative Krylov-subspace solver. While these iterative solvers can greatly reduce solution time, the number of iterations can grow large quickly in the absence of good preconditioners. Initial results for the AIC preconditioner have shown a very large reduction in iteration counts for SDD systems as compared to standard preconditioners such as Incomplete Cholesky (ICC) and Multigrid (MG). We further show significant reduction in iteration counts against the more advanced Combinatorial Multigrid (CMG) preconditioner. We have further developed no-fill sparsification techniques to ensure that the computational cost of applying the AIC preconditioner does not grow prohibitively large as the depth of the V-cycle grows for systems with larger condition numbers. Our numerical results have shown that these sparsifiers maintain the sparsity structure of our system while also displaying significant reductions in iteration counts.1 2

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Los Alamos National Laboratory High Performance Computing Overview [Slides]

We need such big computers because without testing, we don't understand the health of the AGING stockpile. Our big computers store a wealth of test data. We model weapons as they were tested and see if we can match the results to validate models, and we then use validated models along with dismantlement information on aging to certify the stockpile. Sometimes the results of tests can’t be explained well, so even that part requires massive computations, but applying the model to future use is an astonishing amount of computing.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Accurate real space iterative reconstruction (RESIRE) algorithm for tomography

Tomography has made a revolutionary impact on the physical, biological and medical sciences. The mathematical foundation of tomography is to reconstruct a three-dimensional (3D) object from a set of two-dimensional (2D) projections. As the number of projections that can be measured from a sample is usually limited by the tolerable radiation dose and/or the geometric constraint on the tilt range, a main challenge in tomography is to achieve the best possible 3D reconstruction from a limited number of projections with noise. Over the years, a number of tomographic reconstruction methods have been developed including direct inversion, real-space, and Fourier-based iterative algorithms. Here, we report the development of a real-space iterative reconstruction (RESIRE) algorithm for accurate tomographic reconstruction. RESIRE iterates between the update of a reconstructed 3D object and the measured projections using a forward and back projection step. The forward projection step is implemented by the Fourier slice theorem or the Radon transform, and the back projection step by a linear transformation. Our numerical and experimental results demonstrate that RESIRE performs more accurate 3D reconstructions than other existing tomographic algorithms, when there are a limited number of projections with noise. Furthermore, RESIRE can be used to reconstruct the 3D structure of extended objects as demonstrated by the determination of the 3D atomic structure of an amorphous Ta thin film. We expect that RESIRE can be widely employed in the tomography applications in different fields. Finally, to make the method accessible to the general user community, the MATLAB source code of RESIRE and all the simulated and experimental data are available at https://zenodo.org/record/7273314.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Deep-Learning-Derived Evaluation Metrics Enable Effective Benchmarking of Computational Tools for Phosphopeptide Identification

Tandem mass spectrometry (MS/MS)-based phosphoproteomics is a powerful technology for global phosphorylation analysis. However, applying four computational pipelines to a typical mass spectrometry (MS)-based phosphoproteomic dataset from a human cancer study, we observed a large discrepancy among the reported phosphopeptide identification and phosphosite localization results, underscoring a critical need for benchmarking. While efforts have been made to compare performance of computational pipelines using data from synthetic phosphopeptides, evaluations involving real application data have been largely limited to comparing the numbers of phosphopeptide identifications due to the lack of appropriate evaluation metrics. We investigated three deep learning-derived features as potential evaluation metrics: phosphosite probability, Delta RT and spectral similarity. Predicted phosphosite probability is computed by MusiteDeep, which provides high accuracy as previously reported; Delta RT is defined as the absolute retention time (RT) difference between RTs observed and predicted by AutoRT; and spectral similarity is defined as the Pearson’s correlation coefficient between spectra observed and predicted by pDeep2. Using a synthetic peptide dataset, we found that both Delta RT and spectral similarity provided excellent discrimination between correct and incorrect peptide-spectrum matches (PSMs) both when incorrect PSMs involved wrong peptide sequences and even when incorrect PSMs were caused by only incorrect phosphosite localization. Based on these results, we used all the three deep learning-derived features as evaluation metrics to compare different computational pipelines on diverse set of phosphoproteomic datasets and showed their utility in benchmarking performance of the pipelines. The benchmark metrics demonstrated in this study will enable users to select computational pipelines and parameters for routine analysis of phosphoproteomics data and will offer guidance for developers to improve computational methods.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2021

An adaptive approach to machine learning for compact particle accelerators

Abstract Machine learning (ML) tools are able to learn relationships between the inputs and outputs of large complex systems directly from data. However, for time-varying systems, the predictive capabilities of ML tools degrade if the systems are no longer accurately represented by the data with which the ML models were trained. For complex systems, re-training is only possible if the changes are slow relative to the rate at which large numbers of new input-output training data can be non-invasively recorded. In this work, we present an approach to deep learning for time-varying systems that does not require re-training, but uses instead an adaptive feedback in the architecture of deep convolutional neural networks (CNN). The feedback is based only on available system output measurements and is applied in the encoded low-dimensional dense layers of the encoder-decoder CNNs. First, we develop an inverse model of a complex accelerator system to map output beam measurements to input beam distributions, while both the accelerator components and the unknown input beam distribution vary rapidly with time. We then demonstrate our method on experimental measurements of the input and output beam distributions of the HiRES ultra-fast electron diffraction (UED) beam line at Lawrence Berkeley National Laboratory, and showcase its ability for automatic tracking of the time varying photocathode quantum efficiency map. Our method can be successfully used to aid both physics and ML-based surrogate online models to provide non-invasive beam diagnostics.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Scattering using real-time path integrals

Background: Path integrals are a powerful tool for solving problems in quantum theory that are not amenable to a treatment by perturbation theory. Most path integral computations require an analytic continuation to imaginary time. While imaginary time treatments of scattering are possible, imaginary time is not a natural framework for treating scattering problems. More importantly, quantum algorithms for calculating path integrals require real-time evolution. Purpose: Here, we test a recently introduced method for performing direct calculations of scattering observables using real-time path integrals in order to understand the challenges facing real-time path integral calculations of scattering observables. Method: The computations are based on a new interpretation of the path integral as the expectation value of a potential functional on cylinder sets of continuous paths with respect to a complex probability distribution. The method can in principle be applied to arbitrary short-range potentials. Results: The method is applied to compute matrix elements of Møller wave operators applied to narrow wave packets. These are used to calculate half-shell sharp-momentum transition matrix elements for one-dimensional potential scattering. The calculations for half-shell transition operator matrix elements converge to the numerical solution of the Lippmann-Schwinger equation. Conclusions: This work presents a proof in principle that scattering observables can be computed using real-time Feynman path integrals. While the computational method is not efficient, it can be improved. It provides a laboratory for studying quantum computational algorithms that are applicable to scattering problems.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2024

Addressing the data and real-time challenges in large scale particle physics experiments through AI and in situ computing technologies

Modern high energy physics experiments are faced not only with the challenge of having to deal with extremely high data rates but with the need to process data quickly to meet real time constraints. At Fermilab, we explore the use of novel computing technologies and techniques to address these challenges. I will discuss my R&D efforts in applying such computing solutions to enhance the multi-messenger astronomy capabilities and improve the overall physics performance of large-scale LArTPC based neutrino experiments. These efforts offer excellent opportunities for fruitful collaboration.

43 PARTICLE ACCELERATORS↗
DOE OSTI2024

Planet Formation by Gas-assisted Accretion of Small Solids

We compute the accretion efficiency of small solids, with radii 1 cm ≤ R s ≤ 10 m, on planets embedded in gaseous disks. Planets have masses 3 ≤ M p ≤ 20 Earth masses (M ⊕ ) and orbit within 10 au of a solar mass star. Disk thermodynamics is modeled via 3D radiation-hydrodynamics calculations that typically resolve the planetary envelopes. Both icy and rocky solids are considered, explicitly modeling their thermodynamic evolution. The maximum efficiencies of 1 ≤ R s ≤ 100 cm particles are generally ≲10%, whereas 10 m solids tend to accrete efficiently or be segregated beyond the planet’s orbit. A simplified approach is applied to compute the accretion efficiency of small cores, with masses M p ≤ 1 M ⊕ and without envelopes, for which efficiencies are approximately proportional to $M^{2/3}_{p}$. The mass flux of solids, estimated from unperturbed drag-induced drift velocities, provides typical accretion rates dM p /dt ≲ 10 -5 M ⊕ yr -1 . In representative disk models with an initial gas-to-dust mass ratio of 70–100 and total mass of 0.05–0.06 M ⊙ , the solids’ accretion falls below 10 -6 M ⊕ yr -1 after 1–1.5 Myr. The derived accretion rates, as functions of time and planet mass, are applied to formation calculations that compute dust opacity self-consistently with the delivery of solids to the envelope. Assuming dust-to-solid coagulation times of ≈0.3 Myr and disk lifetimes of ≈3.5 Myr, heavy-element inventories in the range 3–7 M ⊕ require that ≈90–150 M ⊕ of solids cross the planet’s orbit. The formation calculations encompass a variety of outcomes, from planets a few times M ⊕ , predominantly composed of heavy elements, to giant planets. The peak luminosities during the epoch of the solids’ accretion range from ≈10 -7 to ≈10 -6 L ⊙ .

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2023

Controlling Molecular Structure and Spin with Multiconfigurational Quantum Chemistry (Final Technical Report)

For many first-row transition metal complexes, structure-property relationships can be obtained from high-level molecular geometry optimizations and subsequent electronic structure studies. The project funded under this award utilized newly implemented fully internally contracted (FIC) nuclear gradients for extended multi-state (XMS) complete active space second-order multireference perturbation theory (CASPT2) to explore geometry changes in first-row transition metal coordination complexes. At the start of the project, only one full geometry optimization using FIC-CASPT2 analytical gradients had been reported (J. Chem. Theory Comput., 2016, 12 (8), 3781), and many open-questions regarding the performance and achievable accuracy in applying such computations to larger complexes persisted. Key deliverables in the report include the implementation of the numerical Hessian and subsequent vibrational analysis in the BAGEL program package. This includes both full Hessian vibrational analysis (FHVA) and a partial Hessian vibrational analysis (PHVA). The latter of which allows us to reduce the significant cost of computing the vibrational frequencies in a large molecule by focusing on the modes of highest interest. The gradient code also proved useful in the development of an approach to improve the Hubbard-U correction by removing bias in predicting spin-splitting in Fe(II) complexes via plane-wave density functional theory (DFT). Finally, we showed for three families of complexes (spin-crossover (SCO) complexes, metallocorroles complexes, and those with metal-metal bonds) that CASPT2 can result in good molecular geometries and established best practices in undertaking this work. We are now using this approach in collaborative projects with experimental groups, which would not have been possible at the start of this project. A common theme also arose through this work that static and dynamic correlation must be recovered in a balanced way to yield quantitative results. By systematically varying how both effects were included, we were able to make key chemical insights. This work supported the training of two postdoctoral scholars, one graduate student, and one undergraduate student in applying high-level wavefunction based methods to challenging systems.

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

Brochure for the DOE Office of Science Workshop on Envisioning Frontiers in AI and Computing for Biological Research

In February of 2025 a joint ASCR/BER workshop was held to identify key transformational research directions for understanding biology using artificial intelligence (AI), digital twins and high-performance (HPC) computational methods to facilitate scientific discovery and innovation in support of the Department of Energy mission. AI technologies offer exciting new groundbreaking methods to analyze large volumes of complex biological data, thereby greatly accelerating the ability to understand, predict, and design biological processes for beneficial purposes. In the laboratory, the bridging of AI-enabled automated experimental technologies, HPC and digital twins will provide potent tools for researchers to explore the fundamental nature of biology and harness its inherent metabolic potential for a variety of beneficial purposes. The focus of this workshop was on how high-performance computational methods can impact this objective by exploring digital twins, foundational models, and data-driven approaches with applications to advance automated laboratory experiments, modeling of complex living systems and engineering new functions into plants and microbial systems relevant to DOE mission. Workshop attendees with expertise in plant science, microbiology, mathematics, computer science, and AI assessed the current state of the science, trends, and AI challenges at the interface of plant and microbial systems biology and computational science to identify opportunities for high-impact research. This collaborative effort capitalized on ASCR's advancements in applied mathematics, computer science, and Exascale systems, and BER's expertise in basic genomics-enabled research on DOE relevant plant and microbial systems. The workshop culminated in four key priority research directions to guide future research and development within DOE Office of Science programs.

59 BASIC BIOLOGICAL SCIENCES↗