Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Mathematics and Computing, Information sciences”

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 613 records · Page 34
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

A Modular System for Increasing Predictiveness for Extreme Climate Predictions

We know that climate change is poised to reshape our world, but we lack clear enough predictions about precisely how. The preponderance of these changes is associated with human activity, specifically the emission of CO 2 and other greenhouse gases. Problematically, projections of climate change continue to be marred by unacceptably large uncertainties which hamper informed decision-making and cost society a chance to adapt proactively and effectively. These uncertainties stem from deficiencies in predictions of future greenhouse gas emissions, but also from inaccuracies in the representation of the physical models used to predict the climate response to such emissions. The uncertainties in projections associated with the inaccurate representation of climate physics, chemistry and biology are similar to those that plagued the first global climate models developed fifty years ago, despite more than a factor 10 8 increase in computer performance. Our transformational question is then, how can the accuracy of climate projections be dramatically improved by applying recent advances in the computational and data sciences to train the models with the wealth of data being constantly collected about the ongoing changes in the climate system?

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2023

Physics constrained unsupervised deep learning for rapid, high resolution scanning coherent diffraction reconstruction

By circumventing the resolution limitations of optics, coherent diffractive imaging (CDI) and ptychography are making their way into scientific fields ranging from X-ray imaging to astronomy. Yet, the need for time consuming iterative phase recovery hampers real-time imaging. While supervised deep learning strategies have increased reconstruction speed, they sacrifice image quality. Furthermore, these methods’ demand for extensive labeled training data is experimentally burdensome. Here, we propose an unsupervised physics-informed neural network reconstruction method, PtychoPINN, that retains the factor of 100-to-1000 speedup of deep learning-based reconstruction while improving reconstruction quality by combining the diffraction forward map with real-space constraints from overlapping measurements. In particular, PtychoPINN gains a factor of 4 in linear resolution and an 8 dB improvement in PSNR while also accruing improvements in generalizability and robustness. This blend of performance and computational efficiency offers exciting prospects for high-resolution real-time imaging in high-throughput environments such as X-ray free electron lasers (XFELs) and diffraction-limited light sources.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

CSGL: chemical synthesis graph learning for molecule representation

Abstract Motivation Molecule representation learning (MRL) translates molecules into a real vector space, serving as input to downstream tasks in biology, chemistry, and computer science. This article introduces a chemical synthesis graph learning (CSGL) framework, which enhances MRL by considering both the atomic structures of molecules and their roles in chemical reactions through a hierarchical graph representation. Specifically, molecules are first modeled based on their molecular graphs, which capture atomic-level structural information. They are then further refined using a chemical synthesis graph, where nodes represent reactant and product molecule sets, and edges encode chemical transformations between reactants and products (e.g. changes in molecular structures). CSGL optimizes molecular embeddings of reactant and product nodes in a fashion that ensures the embeddings conform to a chemical balance constraint. Results Experimental results show that our method CSGL achieves strong performance on a variety of tasks, including product prediction, reaction classification, and molecular property prediction. Availability and implementation https://github.com/li-2023/CSGL.

Biochemistry & Molecular Biology↗
DOE OSTI2024

Deep operator network surrogate for phase-field modeling of metal grain growth during solidification

A deep operator network (DeepONet) has been constructed that generates accurate representations of phase-field model simulations for evolving two dimensional metal grain morphology growing from melt. These representations serve as lower resolution, computationally efficient stand-ins for quick parameter space exploration of solutions to the the Allen-Cahn equations that dictate the phase-field model simulations. The experimental target for the phase-field model is a uranium casting system cooling a 434 g uranium charge from a maximum temperature of 1400° C at an average rate of 30° C / min , traversing the crystallographic phases of the pure metal. Experimental parameters inform the phase-field model, whose higher resolution computational model solutions are used to train the DeepONet in a given parameter space with the aim of developing a faster, more efficient method for predicting the solidifying metal's microstructure at different potential experimental values. The final DeepONet generates high accuracy, lower resolution predictions with cumulative relative approximation error over all timesteps of less than 0.5%, while ensuring solutions remain within physically feasible ranges. Further, these relative error values are comparable with other state-of-the-art DeepONet models for microstructure evolution, while significantly reducing the amount of training data required. Training a convolutional neural network simultaneously with the DeepONet, enforcing realistic values at the complex metal grain boundaries, and mathematically encoding boundary conditions into the structure of the DeepONet improved prediction accuracy and computational efficiency over a standard DeepONet model.

36 MATERIALS SCIENCE↗
DOE OSTI2021

White Box Access to Quantum Testbeds for Co-Design

At Lawrence Livermore National Laboratory (LLNL), we operate and maintain the Quantum Device and Integration Testbed (QuDIT) facility, a small quantum testbed that supports about 10 active research teams (including our own) and over 50 internal and external collaborators. This testbed is designed to give remote white box access to users for research, training, and outreach. A guiding principle behind the development of our testbed infrastructure, software and user interfaces is to empower users to perform experiments at the cutting edge of quantum information science at any level of abstraction, from materials studies, device physics and control and characterization techniques to algorithm development and quantum operating system design. Our testbed targets a multilevel quantum system (qudit) to expand the accessible Hilbert space of a simple-to-manufacture quantum device and focuses on quantum simulation, typically implemented through custom gates designed with quantum optimal control methods, rather than on a universal computing framework with a fixed gate set. We leverage the Lab’s high-performance computing (HPC) program and related expertise to simulate quantum systems, develop hybrid algorithms, and generate gates optimized for given simulations. Additionally, we have adopted a co-design philosophy from the HPC community in designing new hardware, so that the systems we develop are optimized for the specific physics simulations we plan to use them for.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Combining Reactive Quantum-Mechanical Molecular-Dynamics Simulations with Mutagenesis, Crystallography, and Enzyme Kinetics to Reveal Plausible Steps of Isocyanide Hydratase Catalysis

A complete understanding of enzyme mechanisms requires atomistic details of chemical reactions. Quantum-based molecular dynamics simulations (QMD) are a potential source of this information, but trade-offs between accuracy and computational cost have limited their use. We previously developed extended Lagrangian Born–Oppenheimer molecular dynamics (XL-BOMD) methods that leverage a negligible compromise in accuracy to substantially decrease the cost of QMD simulations. Here, we develop a reactive QMD approach using the latest XL-BOMD formulation, which enables efficient simulations of highly reactive systems, and use it to investigate mechanisms of intermediate formation in isocyanide hydratase (ICH) catalysis. In QMD simulations, molecular analogs of ICH active site residues reacted with para-nitrophenyl isocyanide, forming a thioimidate. Analysis of simulated atomic configurational and charge dynamics revealed a pathway where protonation of the isocyanide carbon occurs prior to thioimidate formation and suggested a possible role of Asp17 as a proton donor in the early phase of ICH catalysis. To test whether the pathway seen using the reactive QMD approach might be relevant to ICH catalysis, we performed X-ray crystallography and pre-steady-state enzyme kinetics studies of wild-type and D17N mutant ICH. Both the structure and kinetics are sensitive to the D17N mutation in a manner that is consistent with the order of the reaction steps seen in the simulations. Mobile protons play essential roles in many enzymes, yet they are difficult to observe experimentally, making the ordering of proton-dependent steps ambiguous in many enzyme mechanisms. The ability to directly simulate model reactions for the design of experiments that provide information about enzyme mechanisms involving mobile protons demonstrates the significance of our reactive QMD approach and motivates further biological applications.

36 MATERIALS SCIENCE↗
DOE OSTI2025

AutoTandemML: Active Learning Enhanced Tandem Neural Networks for Inverse Design Problems

Inverse design in science and engineering involves determining optimal design parameters that achieve desired performance outcomes, a process often hindered by the complexity and high dimensionality of design spaces, leading to significant computational costs. To tackle this challenge, we propose a novel hybrid approach that combines active learning with Tandem Neural Networks to enhance the efficiency and effectiveness of solving inverse design problems. Active learning allows to selectively sample the most informative data points, reducing the required dataset size without compromising accuracy. We investigate this approach using three benchmark problems: airfoil inverse design, photonic surface inverse design, and scalar boundary condition reconstruction in diffusion partial differential equations. We demonstrate that integrating active learning with Tandem Neural Networks outperforms standard approaches across the benchmark suite, achieving better accuracy with fewer training samples.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Accelerating Thermochemical Equilibrium Calculations for Nuclear Reactor Applications

Thermochemical properties play a key role in modeling and simulation of several key phenomena in nuclear reactors. There has been an increasing interest in incorporating CALPHAD-based formulations in multiphysics simulations including for Molten Salt Reactors where knowledge of phase evolution of the salt and the chemical potentials of various elements are of utmost importance in source term analyses and redox control. However, the size of such simulations is often limited by the high computational cost of full thermodynamic equilibrium calculations. This work discusses the current efforts aimed at accelerating thermochemical equilibrium calculations for multiphysics simulations performed using the open-source finite element / finite volume code Multiphysics Object Oriented Simulation Environment (MOOSE) [1]. While several methods have been proposed for accelerating phase equilibrium calculations [2], most focus on relatively small systems and often rely on a- priori knowledge of the state-space of the system. Nuclear materials, however, are often multi-component systems owing to the evolution of composition under irradiation and an approach based on a-priori mapping of phase diagram is often not enough. This work is aimed at demonstrating an on-the-fly surrogate modeling framework that uses active learning to reduce the number of full equilibrium calculations that must be performed. By combining with efficient coupling approaches, the surrogate framework helps in reducing the computational cost of thermodynamic equilibrium informed multiphysics simulations of nuclear materials. The performance is benchmarked against full coupling with the thermochemistry library Thermochimica [3]. This work uses a machine learning based approach for constructing surrogate models to predict the stable phases in a multicomponent system. The surrogates were constructed using neural networks and Gaussian process classification. In this work, we compare the relative performance of the two methods. We also demonstrate the use of caching previous calculations by interpolating the values from nearest neighbors. References [1] Lindsay, A.D., et al. "2.0 – MOOSE: Enabling massively parallel multiphysics simulation", SoftwareX, 20 (2022): 101202. [2] Roos, W.A. and Zietsman J.H. "Accelerating complex chemical equilibrium calculations – A Review", Calphad, 77 (2022): 102380. [3] Piro, M.H.A., et al. "The thermochemistry library Thermochimica", Computational Materials Science, 67 (2013): 266-272.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Unifying principles for catalytic hydrotreating processes (Final Technical Report)

This project builds on the hypothesis that the hydrotreating processes for the removal of oxygen and sulfur are fundamentally similar at the atomic-scale and existing knowledge from the treatment of petroleum derived feedstock can be leveraged for the design of novel catalysts for the upgrade of bio-oil. We tested this hypothesis by comparing computed potential energy diagrams for hydrodesulfurization (HDS) of thiophene over MoS 2 with hydrodeoxygenation (HDO) of furan over MoO 3 and concluded that certain aspects, such as catalyst promotion with transition metals, are valid strategies for both reactions. On the other hand, we also noticed significant differences in the mechanism for hydrogen (H 2 ) activation, which requires sites with metallic character. While MoS 2 is known to have metallic edge states that can catalyze H 2 dissociation, this elementary step is prohibitively slow on defect-free oxides. Only in the presence of vacancies or by creating metal/oxide interfaces can efficient H 2 activation sites during HDO be formed. The need for bifunctional catalyst when it comes to efficient and selective HDO or dehydrogenation reactions was further corroborated in joint experimental and theoretical studies of the Guerbet reaction for the coupling of biomass derived oxygenates over PdCu alloys, nitrate reduction over In-promoted Pd nanoparticles, and ethylene dehydroaromatization over Ga-exchanged ZSM-5 zeolites. All of these catalytic systems have in common that catalytic sites with distinct functional requirements are needed to create a working catalyst. Detailed computational studies were carried out for HDO of m -cresol and phenol on Ru-modified TiO 2 surfaces, which allowed us to attribute catalytic activity to the metal/oxide interface. A surprising finding was that heterolytic cleavage of the H-H bond across the Ru/TiO 2 interface was critically important, despite lower barriers for homolytic H 2 activation on Ru metal. The explanation lies in the high barriers for hydrogen spillover from Ru to TiO 2 , which becomes unnecessary in the heterolytic activation pathway. Moreover, we also reported that proton transfer steps between metal and oxide sites are mediated by weakly adsorbed surface water. During attempts to develop and validate a kinetic Monte Carlo (kMC) model for HDO reactions at the Ru/TiO 2 interface, it became clear that lateral interactions are paramount to describe realistic surface chemistry and without these interactions, the reduction and hydroxylation behavior from our simulations was inconsistent with reported experiments. To assess the importance of lateral interactions in popular computational catalyst design strategies relying on the identification of reactivity descriptors, which can be used along with Brønsted–Evans–Polanyi (BEP) and scaling relations as input to a microkinetic model (MKM) to make predictions for activity or selectivity trends, we compared predicted trends with those obtained from descriptor-based kMC models. We critically evaluated the benefits of kMC over MKM in terms of trend predictions and computational cost when using only a small set of input parameters. After confirming that in the absence of lateral interactions the kMC and MKM approaches yield identical trends and mechanistic information, we observed substantial differences between the two kinetic models when lateral interactions were introduced. The mean-field implementation applies coverage corrections directly to the descriptors, causing an artificial overprediction of the activity of strongly binding metals. In contrast, the cluster expansion in kMC implementation can differentiate among the highly active metals but it is very sensitive to the set of included interaction parameters. Considering that computational screening relies on a minimal set of descriptors, for which MKM makes reasonable trend predictions at a ca. three orders of magnitude lower computational cost than kMC, we concluded that the MKM approach does provide an overall better entry point for computational catalyst design. Overall, this project has led to 11 peer-reviewed publications, and their scientific is impact is well illustrated by their combined 702 citations.

08 HYDROGEN↗
NASA NTRS2000

On The Computational Capabilities of Physical Systems: Relationship With Conventional Computer Science - Part 2

In the first of this pair of papers, it was proven that there cannot be a physical computer to which one can properly pose any and all computational tasks concerning the physical universe. It was then further proven that no physical computer C can correctly carry out all computational tasks that can be posed to C. As a particular example, this result means that no physical computer that can, for any physical system external to that computer, take the specification of that external system's state as input and then correctly predict its future state before that future state actually occurs; one cannot build a physical computer that can be assured of correctly "processing information faster than the universe does". These results do not rely on systems that are infinite, and/or non-classical, and/or obey chaotic dynamics. They also hold even if one uses an infinitely fast, infinitely dense computer, with computational powers greater than that of a Turing Machine. This generality is a direct consequence of the fact that a novel definition of computation - "physical computation" - is needed to address the issues considered in these papers, which concern real physical computers. While this novel definition does not fit into the traditional Chomsky hierarchy, the mathematical structure and impossibility results associated with it have parallels in the mathematics of the Chomsky hierarchy. This second paper of the pair presents a preliminary exploration of some of this mathematical structure. Analogues of Chomskian results concerning universal Turing Machines and the Halting theorem are derived, as are results concerning the (im)possibility of certain kinds of error-correcting codes. In addition, an analogue of algorithmic information complexity, "prediction complexity", is elaborated. A task-independent bound is derived on how much the prediction complexity of a computational task can differ for two different reference universal physical computers used to solve that task, a bound similar to the "encoding" bound governing how much the algorithm information complexity of a Turing machine calculation can differ for two reference universal Turing machines. Finally, it is proven that either the Hamiltonian of our universe proscribes a certain type of computation, or prediction complexity is unique (unlike algorithmic information complexity), in that there is one and only version of it that can be applicable throughout our universe.

Wolpert, David H.↗
DOE OSTI2022

Two-dimensional materials for bio-realistic neuronal computing networks

Two-dimensional (2D) van der Waals materials have found broad utility in a diverse range of applications including electronics, optoelectronics, renewable energy, and quantum information technologies. Meanwhile, exponentially growing digital data coupled with the ubiquity of artificial intelligence algorithms have generated significant interest in edge neuromorphic computing as an alternative to centralized cloud computing. The drive to incorporate neuroscience principles into computing hardware is motivated by the low power consumption, parallel processing, and reconfigurability of the human brain. The diverse library of 2D materials with atomic-level thicknesses, exceptional electrostatic tunability, and integration versatility is particularly well-suited for realizing bio-realistic synaptic and neuronal functionality. Here, we summarize past and present work in this field and outline the frontier challenges that have not yet been overcome. Here we also delineate potential solutions and suggest that the neuroscience principles of criticality and synchrony have the potential to inspire breakthrough applications of 2D materials in neuronal computing networks.

36 MATERIALS SCIENCE↗
DOE OSTI2022

CAPG: comprehensive allopolyploid genotyper

Genotyping by sequencing is a powerful tool for investigating genetic variation in plants, but many economically important plants are allopolyploids, where homoeologous similarity obscures the subgenomic origin of reads and confounds allelic and homoeologous SNPs. Recent polyploid genotyping methods use allelic frequencies, rate of heterozygosity, parental cross or other information to resolve read assignment, but good subgenomic references offer the most direct information. The typical strategy aligns reads to the joint reference, performs diploid genotyping within each subgenome, and filters the results, but persistent read misassignment results in an excess of false heterozygous calls. We introduce the Comprehensive Allopolyploid Genotyper (CAPG), which formulates an explicit likelihood to weight read alignments against both subgenomic references and genotype individual allopolyploids from whole-genome resequencing data. We demonstrate CAPG in allotetraploids, where it performs better than Genome Analysis Toolkit’s HaplotypeCaller applied to reads aligned to the combined subgenomic references.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2021

Safeguards-Informed Hybrid Imagery Dataset [Poster]

Deep Learning computer vision models require many thousands of properly labelled images for training, which is especially challenging for safeguards and nonproliferation, given that safeguards-relevant images are typically rare due to the sensitivity and limited availability of the technologies. Creating relevant images through real-world staging is costly and limiting in scope. Expert-labeling is expensive, time consuming, and error prone. We aim to develop a data set of both realworld and synthetic images that are relevant to the nuclear safeguards domain that can be used to support multiple data science research questions. In the process of developing this data, we aim to develop a novel workflow to validate synthetic images using machine learning explainability methods, testing among multiple computer vision algorithms, and iterative synthetic data rendering. We will deliver one million images – both real-world and synthetically rendered – of two types uranium storage and transportation containers with labelled ground truth and associated adversarial examples.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Efficient numerical methods to solve sparse linear equations with application to PageRank

Over the last two decades, the PageRank problem has received increased interest from the academic community as an efficient tool to estimate web-page importance in information retrieval. Despite numerous developments, the design of efficient optimization algorithms for the PageRank problem is still a challenge. Here, we propose three new algorithms with a linear time complexity for solving the problem over a bounded-degree graph. The idea behind them is to set up the PageRank as a convex minimization problem over a unit simplex, and then solve it using iterative methods with small iteration complexity. Our theoretical results are supported by an extensive empirical justification using real-world and simulated data.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Fast and accurate machine learning prediction of phonon scattering rates and lattice thermal conductivity

Abstract Lattice thermal conductivity is important for many applications, but experimental measurements or first principles calculations including three-phonon and four-phonon scattering are expensive or even unaffordable. Machine learning approaches that can achieve similar accuracy have been a long-standing open question. Despite recent progress, machine learning models using structural information as descriptors fall short of experimental or first principles accuracy. This study presents a machine learning approach that predicts phonon scattering rates and thermal conductivity with experimental and first principles accuracy. The success of our approach is enabled by mitigating computational challenges associated with the high skewness of phonon scattering rates and their complex contributions to the total thermal resistance. Transfer learning between different orders of phonon scattering can further improve the model performance. Our surrogates offer up to two orders of magnitude acceleration compared to first principles calculations and would enable large-scale thermal transport informatics.

36 MATERIALS SCIENCE↗
NASA NTRS2004

The New Approach to Self-Achievement (N.A.S.A.) Project 2004

The New Approach to Self-Achievement Program is designed to target rising seventh, eighth, and ninth grade students who require assistance in refining their mathematical skills, science awareness and knowledge, and test taking strategies. During the six week duration of the program, students are challenged in these areas through the application of robotic and aeronautic projects which encourage the students to practically apply their mathematical and science awareness accordingly. The first three weeks of my tenure were designated to assisting Mrs. Tammy Allen in the preparation of the 2004 NASA Project. As her assistant, I was held accountable for organizing, filing, preparing, analyzing, and completing the applications for the NASA Project. Additionally, I constructed the apposite databases which contained imperative information which aided in the selection of our participants. During the latter portion of those three weeks, Mrs. Allen, various staff members, and I, interviewed the numerous first-time applicants of the NASA Project. Furthermore, I was assigned to contact the accepted applicants of the program and provide all necessary information for the initiation of the child into the NASA Project. During the six week duration of the program, I will be working as a Project Leader at the Lorain Middle School site located in Lorain, Oh, with Mr. Fondriest Fountain. Mr. Fountain and I Will work with the eighth and ninth grade students in constructing robots, in which the students are told are made for NASA research which is being conducted on the surface of planet Mars. The robots, which are built from LEGOS and programmed through RoboLab computer software, are prepared to complete assigned Missions such as running obstacle courses; plowing and retrieving LEGOS; and scanning surfaces for intense regions of light.

Thomas, Candace J.↗
DOE OSTI2021

NEXTorch: A Design and Bayesian Optimization Toolkit for Chemical Sciences and Engineering

Automation and optimization of chemical systems require well-informed decisions on what experiments to run to reduce time, materials, and/or computations. Data-driven active learning algorithms have emerged as valuable tools to solve such tasks. Bayesian optimization, a sequential global optimization approach, is a popular active-learning framework. Past studies have demonstrated its efficiency in solving chemistry and engineering problems. Here we introduce NEXTorch, a library in Python/PyTorch, to facilitate laboratory or computational design using Bayesian optimization. NEXTorch offers fast predictive modeling, flexible optimization loops, visualization capabilities, easy interfacing with legacy software, and multiple types of parameters and data type conversions. It provides GPU acceleration, parallelization, and state-of-the-art Bayesian optimization algorithms and supports both automated an d human-in-the-loop optimization. The comprehensive online documentation introduces Bayesian optimization theory and several examples from catalyst synthesis, reaction condition optimization, parameter estimation, and reactor geometry optimization. NEXTorch is open-source and available on GitHub

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

The future of computing beyond Moore’s Law

Moore’s Law is a techno-economic model that has enabled the information technology industry to double the performance and functionality of digital electronics roughly every 2 years within a fixed cost, power and area. Advances in silicon lithography have enabled this exponential miniaturization of electronics, but, as transistors reach atomic scale and fabrication costs continue to rise, the classical technological driver that has underpinned Moore’s Law for 50 years is failing and is anticipated to flatten by 2025. Here, this article provides an updated view of what a post-exascale system will look like and the challenges ahead, based on our most recent understanding of technology roadmaps. It also discusses the tapering of historical improvements, and how it affects options available to continue scaling of successors to the first exascale machine. Lastly, this article covers the many different opportunities and strategies available to continue computing performance improvements in the absence of historical technology drivers. This article is part of a discussion meeting issue ‘Numerical algorithms for high-performance computational science’.

97 MATHEMATICS AND COMPUTING↗