Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Mathematics and Computing, Computer science”

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 325 records · Page 18
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Linking metabolic phenotypes to pathogenic traits among “ Candidatus Liberibacter asiaticus” and its hosts

Candidatus Liberibacter asiaticus (CLas) has been associated with Huanglongbing, a lethal vector-borne disease affecting citrus crops worldwide. While comparative genomics has provided preliminary insights into the metabolic capabilities of this uncultured microorganism, a comprehensive functional characterization is currently lacking. Here, we reconstructed and manually curated genome-scale metabolic models for the six CLas strains A4, FL17, gxpsy, Ishi-1, psy62, and YCPsy, in addition to a model of the closest related culturable microorganism, L. crescens BT-1. Predictions about nutrient requirements and changes in growth phenotypes of CLas were confirmed using in vitro hairy root-based assays, while the L. crescens BT-1 model was validated using cultivation assays. Host-dependent metabolic phenotypes were revealed using expression data obtained from CLas-infected citrus trees and from the CLas-harboring psyllid Diaphorina citri Kuwayama. These results identified conserved and unique metabolic traits, as well as strain-specific interactions between CLas and its hosts, laying the foundation for the development of model-driven Huanglongbing management strategies.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2020

Standardized phylogenetic and molecular evolutionary analysis applied to species across the microbial tree of life

There is growing interest in reconstructing phylogenies from the copious amounts of genome sequencing projects that target related viral, bacterial or eukaryotic organisms. To facilitate the construction of standardized and robust phylogenies for disparate types of projects, we have developed a complete bioinformatic workflow, with a web-based component to perform phylogenetic and molecular evolutionary (PhaME) analysis from sequencing reads, draft assemblies or completed genomes of closely related organisms. Furthermore, the ability to incorporate raw data, including some metagenomic samples containing a target organism (e.g. from clinical samples with suspected infectious agents), shows promise for the rapid phylogenetic characterization of organisms within complex samples without the need for prior assembly.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2020

Early prediction of antigenic transitions for influenza A/H3N2

Influenza A/H3N2 is a rapidly evolving virus which experiences major antigenic transitions every two to eight years. Anticipating the timing and outcome of transitions is critical to developing effective seasonal influenza vaccines. Using a published phylodynamic model of influenza transmission, we identified indicators of future evolutionary success for an emerging antigenic cluster and quantified fundamental trade-offs in our ability to make such predictions. The eventual fate of a new cluster depends on its initial epidemiological growth rate––which is a function of mutational load and population susceptibility to the cluster––along with the variance in growth rate across co-circulating viruses. Logistic regression can predict whether a cluster at 5% relative frequency will eventually succeed with ~80% sensitivity, providing up to eight months advance warning. As a cluster expands, the predictions improve while the lead-time for vaccine development and other interventions decreases. However, attempts to make comparable predictions from 12 years of empirical influenza surveillance data, which are far sparser and more coarse-grained, achieve only 56% sensitivity. By expanding influenza surveillance to obtain more granular estimates of the frequencies of and population-wide susceptibility to emerging viruses, we can better anticipate major antigenic transitions. This provides added incentives for accelerating the vaccine production cycle to reduce the lead time required for strain selection.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2020

Gigatonne One [Slides]

Multi-scenario roadmap for national-scale BECCS (bioenergy with CO₂ capture & storage)--ethanol, biopower, biomaterials (e.g., paper/pulpboard)--based on emerging tools, bioeconomy, & thousands of simulations.

09 BIOMASS FUELS↗
DOE OSTI2024

Artificial Intelligence for Climate Change Mitigation Roadmap (Second Edition)

The first ICEF Artificial Intelligence for Climate Change Mitigation Roadmap was released in December 2023. Since that time, attention to artificial intelligence (AI) has continued to grow at a rapid pace. Tens of billions of dollars have poured into AI projects, policymakers around the world have considered new AI policies, and OpenAI reports that each month more than 200 million people now use ChatGPT. Signs of a changing climate continue to grow as well. Based on global average temperatures, July 22, 2024 was the warmest day ever recorded; 2023 was the warmest year ever recorded; and the 10 warmest years on record are the past 10 years. Yet global emissions of greenhouse gases continue to climb. Can AI help cut emissions of greenhouse gases? This Roadmap explores that question. In this second edition of the Artificial Intelligence for Climate Change Mitigation Roadmap, a team of 25 co-authors builds on last year’s roadmap—comprehensively updating all old chapters, adding six new chapters and offering 5–10 specific, actionable recommendations in each chapter. Our goal is to provide a useful resource for experts and non-experts alike. In Part I of this Roadmap, we provide brief introductions to both AI and climate change. In Part II, we explore eight sectors in which AI is helping respond to climate change and could do much more. In Part III, we explore crosscutting issues. We close with findings and recommendations.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2023

Rheological Properties of Small-Molecular Liquids at High Shear Strain Rates

Molecular-scale understanding of rheological properties of small-molecular liquids and polymers is critical to optimizing their performance in practical applications such as lubrication and hydraulic fracking. We combine nonequilibrium molecular dynamics simulations with two unsupervised machine learning methods: principal component analysis (PCA) and t-distributed stochastic neighbor embedding (t-SNE), to extract the correlation between the rheological properties and molecular structure of squalane sheared at high strain rates (10 6 –10 10 s -1 ) for which substantial shear thinning is observed under pressures P ϵ 0.1–955 MPa at 293 K. Intramolecular atom pair orientation tensors of 435 × 6 dimensions and the intermolecular atom pair orientation tensors of 61 × 6 dimensions are reduced and visualized using PCA and t-SNE to assess the changes in the orientation order during the shear thinning of squalane. Dimension reduction of intramolecular orientation tensors at low pressures P = 0.1,100 MPa reveals a strong correlation between changes in strain rate and the orientation of the side-backbone atom pairs, end-backbone atom pairs, short backbone-backbone atom pairs, and long backbone-backbone atom pairs associated with a squalane molecule. At high pressures P ≥ 400 MPa, the orientation tensors are better classified by these different pair types rather than strain rate, signaling an overall limited evolution of intramolecular orientation with changes in strain rate. Dimension reduction also finds no clear evidence of the link between shear thinning at high pressures and changes in the intermolecular orientation. The alignment of squalane molecules is found to be saturated over the entire range of rates during which squalane exhibits substantial shear thinning at high pressures.

36 MATERIALS SCIENCE↗
NASA NTRS2002

[ICASE Semiannual Report]

This report summarizes research conducted at ICASE in applied mathematics, fluid mechanics, computer science, and structures and material sciences during the period October 1, 2001 through March 31, 2002.

Bushnell, Dennis M.↗
NASA NTRS2019

Complex Dynamics of Air Traffic Flow

Air traffic in the United States has continued to grow at a steady pace since 1980, except for a dip immediately after the tragic events of September 11, 2001. There are different growth scenarios associated both with the magnitude and the composition of the future air traffic. The Terminal Area Forecast (TAF), prepared every year by the FAA, projects the growth of traffic in the United States. Both Boeing and Airbus publish market outlooks for air travel annually. Although predicting the future growth of traffic is difficult, there are two significant trends: heavily congested major airports continue to see an increase in traffic, and the emergence of regional jets and other smaller aircraft with fewer passengers operating directly between non-major airports. The interaction between air traffic demand and the ability of the system to provide the necessary airport and airspace resources can be modeled as a network. The size of the resulting network varies depending on the choice of its nodes. It would be useful to understand the properties of this network to guide future design and development. Many questions, such as the growth of delay with increasing traffic demand and impact of the en route weather on future air traffic, require a systematic understanding of the properties of the air traffic network. There has been a major advance in the understanding of the behavior of networks with a large number of components. Several theories have been advanced about the evolution of large biological and engineering networks by authors in diversified disciplines like physics, mathematics, biology and computer science. Several networks exhibit a scale-free property in the sense that the probabilistic distribution of their nodes as a function of connections decreases slower than an exponential. These networks are characterized by the fact that a small number of components have a disproportionate influence on the performance of the network. Scale-free networks are tolerant to random failure of components, but are vulnerable to selective attack on components. This paper examines two network representations for the baseline air traffic system. A network defined with the 40 major airports as nodes and with standard flight routes as links has a characteristic scale: all nodes have 60 or more links and no node has more than 460 links. Another network is defined with baseline aircraft routing structure exhibits an exponentially truncated scale-free behavior. Its degree ranges from 2 connections to 2900 connections, and 225 nodes have more than 250 connections. Furthermore, those high-degree nodes are homogeneously distributed in the airspace. A consequence of this scale-free behavior is that the random loss of a single node has little impact, but the loss of multiple high-degree nodes (such as occurs during major storms in busy airspace) can adversely impact the system. Two future scenarios of air traffic growth are used to predict the growth of air traffic in the United States. It is shown that a three-times growth in the overall traffic may result in a ten-times impact on the density of traffic in certain parts of the United States.

Scale-free Networks↗
DOE OSTI2025

Increasing the hardness of posiform planting using random QUBOs for programmable quantum annealer benchmarking

Posiform planting is a method for constructing QUBO instances with a unique planted solution that can be tailored to arbitrary connectivity graphs. In this study we investigate making posiform planted QUBOs computationally harder by fusing many smaller random Ising models, whose global minimum is computed classically, with posiform planted QUBOs. The unique ground state of the resulting QUBO is the concatenation of (exactly one of) the ground states of each smaller problem. Our method generates QUBO instances that have a unique solution, are native to the hardware graph, and have tunable computational hardness. We use our QUBOs to benchmark three D-Wave quantum annealing processors (with 563–5627 qubits), and compare them against simulated annealing and Gurobi. Surprisingly, we find that the D-Wave ground state sampling success rate is not dependent on the glued random QUBO size, and that some QUBO classes are solved at high success rates at short annealing times on the Zephyr processors.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Exact hopfion vortices in a 3D Heisenberg ferromagnet

Here, we find exact static soliton solutions for the unit spin vector field of an inhomogeneous, anisotropic three-dimensional Heisenberg ferromagnet. Each soliton is labeled by two integers n and m. It is a (modified) skyrmion in the z = 0 plane with winding number n, which twists out of the plane m times in the z-direction to become a 3D soliton. Here m arises due to the periodic boundary condition at the z-boundaries. We use Whitehead’s integral expression to find that the Hopf invariant of the soliton is an integer H = nm. It represents a hopfion vortex. Plots of the preimages of this topological soliton show that they are either unknots or nontrivial knots, depending on n and m. Any pair of preimage curves links H times, corroborating the interpretation of H as a linking number. We also calculate the exact energy of the hopfion vortex, and show that its topological lower bound has a sublinear dependence on H. Using Derrick’s scaling analysis, we demonstrate that the presence of a spatial inhomogeneity in the anisotropic interaction, which in turn introduces a characteristic length scale in the system, leads to the stability of the hopfion vortex.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Anisotropic MagnetoMemristance

Abstract In the last decade, nanoscale resistive devices with memory have been the subject of intense study because of their possible use in brain-inspired computing. However, operational endurance is one of the limiting factors in the adoption of such technology. For this reason, we discuss the emergence of current-induced memristance in magnetic materials, known for their durability. We show analytically and numerically that a single ferromagnetic layer can possess GHz memristance, due to a combination of two factors: a current-induced transfer of angular momentum (Zhang-Li torque) and the anisotropic magnetoresistance (AMR). We term the resulting effect the anisotropic magneto-memristance (AMM). We connect the AMM to the topology of the magnetization state, within a simple model of a one-dimensional annulus-shaped magnetic layer, confirming the analytical results with micromagnetic simulations for permalloy. Our results open a new path towards the realization of single-layer magnetic memristive devices operating at GHz frequencies.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Performance Analysis of Speculative Parallel Adaptive Local Timestepping for Conservation Laws

Stable simulation of conservation laws, such as those used to model fluid dynamics and plasma physics applications, requires the satisfaction of the so-called Courant-Friedrichs-Lewy condition. By allowing regions of the mesh to advance with different timesteps that locally satisfy this stability constraint, significant work reduction can be attained when compared to a time integration scheme using a single timestep size. However, parallelizing this algorithm presents considerable difficulty. Since the stability condition depends on the state of the system, dependencies become dynamic and potentially non-local. In this article, we present an adaptive local timestepping algorithm using an optimistic (Timewarp-based) parallel discrete event simulation. We introduce waiting heuristics to limit misspeculation and a semi-static load balancing scheme to eliminate load imbalance as parts of the mesh require finer or coarser timesteps. Last, we outline an interface for separating the physics of the specific conservation law from the temporal integration allowing for productive adoption of our proposed algorithm. We present a misspeculation study for three conservation laws, demonstrating both the productivity of the local timestepping API, for which 74% of the lines of code are reused across different conservation laws, and the robustness of the waiting heuristics—at most 1.5% of element updates are rolled back. Our performance studies demonstrate up to a 2.8× speedup versus a baseline unoptimized local timestepping approach, a 4x improvement in per-node throughput compared to an MPI parallelization of synchronous timestepping, and scalability up to 3,072 cores on NERSC’s Cori Haswell partition.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Inverse Analysis with Variational Autoencoders: A Comparison of Shallow and Deep Networks

Inverse problems are applied to determine unknown properties by matching observational data with a physical model that often takes many parameters as input. To overcome the underconstrained nature of inverse problems and achieve good performance, an approach is presented involving regularization with a technique known as a variational autoencoder (VAE), which is trained to map a high-dimensional parameter space with a complex structure to a low-dimensional latent space with a simple structure. We apply this approach to unconditioned realizations of the parameters (heterogeneous hydraulic fields) for a hydrogeological inverse problem. Two types of hydraulic conductivity fields are used to evaluate the characterization for the different levels of heterogeneity complexity of the physical inputs. This approach keeps the computational cost of generating the training data low. The reason is unconditioned realizations neither rely on the observational data used to perform the inverse analysis nor require any groundwater flow model forward runs. In addition, this approach applies regularization on a low-dimensional latent space from the VAE and increases optimization efficiency through automatic differentiation. Furthermore, two different neural network (NN) structures are tested for their utility in using the VAE for inverse analysis. The performance of a deep, convolutional neural network strongly depends on the dimensionality of the latent space, which requires tuning. In contrast, a shallow, dense neural network provides consistently accurate characterization without tuning. Furthermore, our approach evaluates the advantages of the shallow, dense neural network over the deep, convolutional one and enables future application to a wide range of inverse problems.

97 MATHEMATICS AND COMPUTING↗