Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “information computation”

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

Plant Metabolic Network 16: expansion of underrepresented plant groups and experimentally supported enzyme data

Abstract The Plant Metabolic Network (PMN) is a free online database of plant metabolism available at https://plantcyc.org. The latest release, PMN 16, provides metabolic databases representing >1200 metabolic pathways, 1.3 million enzymes, >8000 metabolites, >10 000 reactions and >15 000 citations for 155 plant and green algal genomes, as well as a pan-plant reference database called PlantCyc. This release contains 29 additional genomes compared with PMN 15, including species listed by the African Orphan Crop Consortium and nonflowering plant species. Furthermore, 52 new enzymes with experimentally supported function information have been included in this release. The single-species databases contain a combination of experimental information from the literature and computationally predicted information obtained through PMN’s database generation pipeline for a single species, while PlantCyc contains only experimental information but for any species within Viridiplantae. PMN is a comprehensive resource for querying, visualizing, analyzing and interpreting omics data with metabolic knowledge. It also serves as a useful and interactive tool for teaching plant metabolism.

Hawkins, Charles (ORCID:0000000312849047)↗
DOE OSTI2024

Computing in AEC Education: Hindsight, Insight, and Foresight

In the architecture, engineering, and construction (AEC) fields, computing and information technologies play an increasingly prevalent and complex role in day-to-day work. Consequently, educators must adjust and, in many cases, reimagine curricula and teaching methodologies to adapt to the changing landscape. Past research efforts led by the ASCE Computing Division Education Committee, formerly called the Task Committee on Computing Education of the Technical Council on Computing and Information Technology (TCCIT), have regularly surveyed AEC educators to understand computing trends in AEC curricula, with the latest survey taking place nearly a decade ago. This work presents the results of an updated survey that used this prior work as a springboard, providing timely insights into the computing skills and curricular barriers faced by AEC educators today. The results showed that the technical skills used by students have evolved, but the barriers faced in incorporating new skills into curricula have remained largely the same. In addition to comparisons with prior surveys, this work presents the results of an expanded, open-ended portion of the survey that explores educator perspectives on the future of the AEC workforce in a broader lens than used in previous surveys. Thematic analysis of these open-ended responses revealed themes that were common among responses and provided organization to the findings. For example, educators provided their vision of what competencies the future AEC workforce would need, which were thematically organized into a continuum based on the level of interaction between humans and technology. These results suggest an increasingly complex and evolving relationship between the AEC workforce and emerging technology, highlighting the need for educators to encourage the development of technological adaptability and agility. Overall, this work provides a systematic comparison of current educational practices in AEC computing with a decade ago to illustrate educational shifts and adds a prediction of AEC trends from experts in AEC education, providing crucial discussion of curricular transformations that will better position students for success in the workforce.

42 ENGINEERING↗
DOE OSTI2020

Machine learning and serving of discrete field theories

A method for machine learning and serving of discrete field theories in physics is developed. The learning algorithm trains a discrete field theory from a set of observational data on a spacetime lattice, and the serving algorithm uses the learned discrete field theory to predict new observations of the field for new boundary and initial conditions. The approach of learning discrete field theories overcomes the difficulties associated with learning continuous theories by artificial intelligence. The serving algorithm of discrete field theories belongs to the family of structure-preserving geometric algorithms, which have been proven to be superior to the conventional algorithms based on discretization of differential equations. The effectiveness of the method and algorithms developed is demonstrated using the examples of nonlinear oscillations and the Kepler problem. In particular, the learning algorithm learns a discrete field theory from a set of data of planetary orbits similar to what Kepler inherited from Tycho Brahe in 1601, and the serving algorithm correctly predicts other planetary orbits, including parabolic and hyperbolic escaping orbits, of the solar system without learning or knowing Newton’s laws of motion and universal gravitation. The proposed algorithms are expected to be applicable when the effects of special relativity and general relativity are important.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Complexity-calibrated benchmarks for machine learning reveal when prediction algorithms succeed and mislead

Abstract Recurrent neural networks are used to forecast time series in finance, climate, language, and from many other domains. Reservoir computers are a particularly easily trainable form of recurrent neural network. Recently, a “next-generation” reservoir computer was introduced in which the memory trace involves only a finite number of previous symbols. We explore the inherent limitations of finite-past memory traces in this intriguing proposal. A lower bound from Fano’s inequality shows that, on highly non-Markovian processes generated by large probabilistic state machines, next-generation reservoir computers with reasonably long memory traces have an error probability that is at least $$\sim 60\%$$ ∼ 60 % higher than the minimal attainable error probability in predicting the next observation. More generally, it appears that popular recurrent neural networks fall far short of optimally predicting such complex processes. These results highlight the need for a new generation of optimized recurrent neural network architectures. Alongside this finding, we present concentration-of-measure results for randomly-generated but complex processes. One conclusion is that large probabilistic state machines—specifically, large $$\epsilon$$ ϵ -machines—are key to generating challenging and structurally-unbiased stimuli for ground-truthing recurrent neural network architectures.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Estimating the randomness of quantum circuit ensembles up to 50 qubits

Random quantum circuits have been utilized in the contexts of quantum supremacy demonstrations, variational quantum algorithms for chemistry and machine learning, and blackhole information. The ability of random circuits to approximate any random unitaries has consequences on their complexity, expressibility, and trainability. To study this property of random circuits, we develop numerical protocols for estimating the frame potential, the distance between a given ensemble and the exact randomness. Our tensor-network-based algorithm has polynomial complexity for shallow circuits and is high-performing using CPU and GPU parallelism. We study 1. local and parallel random circuits to verify the linear growth in complexity as stated by the Brown–Susskind conjecture, and; 2. hardware-efficient ansätze to shed light on its expressibility and the barren plateau problem in the context of variational algorithms. Our work shows that large-scale tensor network simulations could provide important hints toward open problems in quantum information science.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Uncertainty Quantification for Multiphase Computational Fluid Dynamics Closure Relations with a Physics-Informed Bayesian Approach

Multiphase Computational Fluid Dynamics (MCFD) based on the two-fluid model is considered a promising tool to model complex two-phase flow systems. MCFD simulation can predict local flow features without resolving interfacial information. As a result, the MCFD solver relies on closure relations to describe the interaction between the two phases. Those empirical or semi-mechanistic closure relations constitute a major source of uncertainty for MCFD predictions. In this paper, we leverage a physics-informed uncertainty quantification (UQ) approach to inversely quantify the closure relations’ model form uncertainty in a physically consistent manner. This proposed approach considers the model form uncertainty terms as stochastic fields that are additive to the closure relation outputs. Combining dimensionality reduction and Gaussian processes, the posterior distribution of the stochastic fields can be effectively quantified within the Bayesian framework with the support of experimental measurements. As this UQ approach is fully integrated into the MCFD solving process, the physical constraints of the system can be naturally preserved in the UQ results. Here, in a case study of adiabatic bubbly flow, we demonstrate that this UQ approach can quantify the model form uncertainty of the MCFD interfacial force closure relations, thus effectively improving the simulation results with relatively sparse data support.

42 ENGINEERING↗
DOE OSTI2026

What do physics-informed DeepONets learn? Understanding and improving training for scientific computing applications

Physics-informed deep operator networks (DeepONets) have emerged as a promising approach toward numerically approximating the solution of partial differential equations (PDEs). In this work, we aim to develop further understanding of what is being learned by physics-informed DeepONets by assessing the universality of the extracted basis functions and demonstrating their potential toward model reduction with spectral methods. Results provide clarity about measuring the performance of a physics-informed DeepONet through the decays of singular values and expansion coefficients. In addition, we propose a transfer learning approach for improving training for physics-informed DeepONets between parameters of the same PDE as well as across different, but related, PDEs where these models struggle to train well. This approach results in significant error reduction and learned basis functions that are more effective in representing the solution of a PDE.

Deep operator networks↗
DOE OSTI2025

Cryo-EM Visualization of Intermolecular π-Electron Interactions within π-Conjugated Peptidic Supramolecular Polymers

The self-assembly of “π-peptides” – molecules with π-electron cores substituted with two or more oligopeptide chains – brings organic electronic function into biologically relevant nanomaterials. π-Peptides assemble into fibrillar nanomaterials as driven by enthalpic peptide-based hydrogen bonding networks and pi-core-based quadrupolar interactions. A large body of spectroscopic, morphological and computational studies informs on the nature of the self-assembly process and the resulting nanostructures, but detailed structural information has remained elusive. Here, inspired by the recent use of cryogenic electron microscopy (cryo-EM) to provide high-resolution structures for synthetic peptide nanomaterials, we present here the use of cryo-EM to offer ca. 3 Å resolution of π-peptide nanomaterial assemblies, visualizing for the first time the nature of the intermolecular π-core electronic interactions responsible for energy transport through these supramolecular materials.

Group theory↗
DOE OSTI2023

The learnability of Pauli noise

Recently, several quantum benchmarking algorithms have been developed to characterize noisy quantum gates on today’s quantum devices. A fundamental issue in benchmarking is that not everything about quantum noise is learnable due to the existence of gauge freedom, leaving open the question what information is learnable and what is not, which is unclear even for a single CNOT gate. Here we give a precise characterization of the learnability of Pauli noise channels attached to Clifford gates using graph theoretical tools. Our results reveal the optimality of cycle benchmarking in the sense that it can extract all learnable information about Pauli noise. We experimentally demonstrate noise characterization of IBM’s CNOT gate up to 2 unlearnable degrees of freedom, for which we obtain bounds using physical constraints. In addition, we show that an attempt to extract unlearnable information by ignoring state preparation noise yields unphysical estimates, which is used to lower bound the state preparation noise.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Detecting and tracking drift in quantum information processors

Abstract If quantum information processors are to fulfill their potential, the diverse errors that affect them must be understood and suppressed. But errors typically fluctuate over time, and the most widely used tools for characterizing them assume static error modes and rates. This mismatch can cause unheralded failures, misidentified error modes, and wasted experimental effort. Here, we demonstrate a spectral analysis technique for resolving time dependence in quantum processors. Our method is fast, simple, and statistically sound. It can be applied to time-series data from any quantum processor experiment. We use data from simulations and trapped-ion qubit experiments to show how our method can resolve time dependence when applied to popular characterization protocols, including randomized benchmarking, gate set tomography, and Ramsey spectroscopy. In the experiments, we detect instability and localize its source, implement drift control techniques to compensate for this instability, and then demonstrate that the instability has been suppressed.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Trustworthy Physics-Informed Deep Learning for Predictive Scientific Computing

This project has developed powerful trustworthy physics-informed deep learning (TPiDL) models and methods to fundamentally enhance the scale and power of computational modeling in the scientific and engineering domains. Deep learning (DL) has radically advanced the state-of-the-art in machine learning, computer vision, natural language processing, and also scientific computing. Nevertheless, progress has been driven almost entirely by empirical observations, hacks, and tricks. Under the support of this project, the graph operator learning tools and advanced trustworthy physical informed neural networks have been developed. In addition, stochastic gradient replica-exchange Markov Chain Monte Carlo (MCMC) sampling algorithms have been designed to quantify the uncertainties and speed up the training of large-scale neural networks.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Including frameworks of public health ethics in computational modelling of infectious disease interventions

Decisions on public health interventions to control infectious diseases are often informed by computational models. Interpreting the predicted outcomes of a public health decision requires not only high-quality modelling but also an ethical framework for assessing the benefits and harms associated with different options. The design and specification of ethical frameworks matured independently of computational modelling, so many values recognized as important for ethical decision-making are missing from computational models. We demonstrate a proof-of-concept approach to incorporate multiple public health values into the evaluation of a simple computational model for vaccination against a pathogen such as SARS-CoV-2. By examining a bounded space of alternative prioritizations of three values relevant to public health ethics (aggregate clinical burden, equity in clinical burden, equity in adverse effects from vaccination), we identify value trade-offs, where the outcomes of optimal strategies differ depending on the ethical framework. This work demonstrates an approach to incorporating diverse values into decision criteria used to evaluate outcomes of models of infectious disease interventions.

"Mathematical Biology"↗
DOE OSTI2023

Non-perturbative many-body treatment of molecular magnets

Molecular magnets have received significant attention because of their potential applications in quantum information and quantum computing. A delicate balance of electron correlation, spin–orbit coupling (SOC), ligand field splitting, and other effects produces a persistent magnetic moment within each molecular magnet unit. The discovery and design of molecular magnets with improved functionalities would be greatly aided by accurate computations. However, the competition among the different effects poses a challenge for theoretical treatments. Electron correlation plays a central role since d- or f-element ions, which provide the magnetic states in molecular magnets, often require explicit many-body treatments. SOC, which expands the dimensionality of the Hilbert space, can also lead to non-perturbative effects in the presence of strong interaction. Furthermore, molecular magnets are large, with tens of atoms in even the smallest systems. We show how an ab initio treatment of molecular magnets can be achieved with auxiliary-field quantum Monte Carlo, in which electron correlation, SOC, and material specificity are included accurately and on an equal footing. Furthermore, the approach is demonstrated by an application to compute the zero-field splitting of a locally linear Co 2+ complex.

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

Studies of surface adsorbate electronic structure and femtochemistry at the fundamental length and time scales. Final report

The electronic structure and ultrafast (10-15 s-femtosecond timescale) electron dynamics were investigated for clean and atom/molecule covered metal surfaces. The studies were performed by scanning tunneling microscopy (STM) to measure the structure of adsorbed atoms and molecules on metal surfaces, and to investigate their electronic properties. The electronic structure of the observed molecular networks was calculated by electronic structure theory in collaboration with Prof. Jin Zhao, who is a long-time collaborator, a Professor at the University of Science and Technology of China, and holds an Adjunct Professorship at the University of Pittsburgh. We also investigated the electronic properties of C60 molecules when they are templated by corrugated black phosphorous surfaces. We found unexpected charge delocalization that is enabled by the templating. This research was done in collaboration with Professor Min Feng at the Wuhan University, and who also holds an Adjunct Professorship at the University of Pittsburgh. Moreover, the electronic structure and electron dynamics in metal surfaces were investigated by time-resolved photoemission electron spectroscopy. The focus of ultrafast spectroscopy has been on the plasmonic response of silver surfaces. One direction has been to develop multidimensional (energy, momentum, and time) photoelectron spectroscopy of the coherent response of solid surfaces. This method was applied to study the collective electron excitations known generally as plasmons, which screen optical fields from penetration into metals. Although this collective response has been known for more than 60 years and is used extensively to deposit optical energy into metals, how this happens is poorly known. We investigated the plasmonic response of silver at the point where the dielectric response passes through zero and bulk plasmon is excited by light. We discovered that the plasmon excitation decays by exciting electrons from the Fermi level of a metal, which is contrary to what is believed in the plasmonic science community. This research has been performed in collaboration with Dr. Marcel Reutzel, who was a postdoctoral fellow working on this research at the University of Pittsburgh, and now has a faculty position at the University of Göttingen in Germany. Prof. Branko Gumhalter from the Institute of Physics in Zagreb contributed on the theory of plasmonic decay processes. Furthermore, we investigated the Floquet engineering of electronic bands in metals leading to multiphoton photoemission and above threshold photoemission. Finally, we demonstrated that it is possible to change the electronic structure of metals by application of optical fields. Our studies indicated that this happens on subfemtosecond time scale and could potentially be used in ultrafast information processing and quantum computation. Related document information

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗