Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Graphs”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,261 records · Page 70

Sparse invariant domain preserving discontinuous Galerkin methods with subcell convex limiting

In this paper, we develop high-order nodal discontinuous Galerkin (DG) methods for hyperbolic conservation laws that satisfy invariant domain preserving properties using subcell flux corrections and convex limiting. These methods are based on a subcell flux corrected transport (FCT) methodology that involves blending a high-order target scheme with a robust, low-order invariant domain preserving method that is obtained using a graph viscosity technique. Furthermore, the new low-order discretizations are based on sparse stencils which do not increase with the polynomial degree of the high-order DG method. As a result, the accuracy of the low-order method does not degrade when used with high-order target methods. The method is applied to both scalar conservation laws, for which the discrete maximum principle is naturally enforced, and to systems of conservation laws such as the Euler equations, for which positivity of density and a minimum principle for specific entropy are enforced. Numerical results are presented on a number of benchmark test cases.

97 MATHEMATICS AND COMPUTING↗

Physics-based stabilized finite element approximations of the Poisson–Nernst–Planck equations

We present and analyze two stabilized finite element methods for solving numerically the Poisson–Nernst–Planck equations. The stabilization we consider is carried out by using a shock detector and a discrete graph Laplacian operator for the ion equations, whereas the discrete equation for the electric potential need not be stabilized. Discrete solutions stemmed from the first algorithm preserve both maximum and minimum discrete principles. For the second algorithm, its discrete solutions are conceived so that they hold discrete principles and obey an entropy law provided that an acuteness condition is imposed for meshes. Remarkably the latter is found to be unconditionally stable. We validate our methodology through transient numerical experiments that show convergence toward steady-state solutions.

97 MATHEMATICS AND COMPUTING↗

On the integration of molecular dynamics, data science, and experiments for studying solvent effects on catalysis

Computational workflows that combine molecular dynamics (MD) simulations and emerging data-centric (DC) methods can accelerate the screening and analysis of solvent systems experimentally and computationally. Here, MD simulations provide atomic positions and velocities of reactant, solvent, and catalyst materials that can be manipulated into data representations that in turn can be used by DC techniques to conduct predictive modeling, feature extraction, and experimental design. For liquid-phase catalytic applications, emerging DC techniques such as Convolutional and Graph Neural Networks (CNN/GNN), Topological Data Analysis (TDA), and Active Learning (AL) can leverage MD and experimental data to quickly predict solvent effects on reaction outcomes. For instance, in recent studies, 3D solvent environments obtained with MD have been exploited by CNNs to predict experimental reaction rates for homogeneous acid-catalyzed lignocellulosic processes. In this perspective, we discuss basic principles of DC methods and how these can be combined with MD to enable high-throughput screening of solvent selection for diverse catalysis applications.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Towards physics-informed explainable machine learning and causal models for materials research

From emergent material descriptions to estimation of properties stemming from structures to optimization of process parameters for achieving best performance – all key facets of materials science and related fields have experienced tremendous growth with the introduction of data-driven models. This gradual progression goes at par with developments of machine learning workflows, from purely data-driven shallow models to those that are well-capable in encoding more complex graphs, symbolic representations, invariances, and positional embeddings. Furthermore, this perspective aims at summarizing strategic aspects of such transitions while providing insights into the requirements of bringing in explainable, interpretable predictive models, and causal learning to aid in materials design and discovery. Although the focus remains on a variety of functional materials by providing a handful of case studies, the applications of such integrated methodologies are universal to facilitate fundamental understandings of materials physics while enabling autonomous experiments.

36 MATERIALS SCIENCE↗

Applying machine learning and quantum chemistry to predict the glass transition temperatures of polymers

Glass transition temperature (T g ) is important for understanding the physical and mechanical properties of a polymer material because it relates to the thermal energy required to transition between a hard glassy state and a soft rubbery one. Over the years, various models have been developed for predicting this thermal property from molecular structure to aid in designing novel polymers in selected classes. This work builds on those efforts by utilizing both machine learning (ML) and quantum chemistry (QC) techniques to develop models that can predict T g values from the molecular structure under different data availability scenarios and for a wide variety of polymer types. For the ML model, a graph convolutional network (GCN) was used to map topological polymer features; this model was trained against a dataset of more than 7500 T g values and resulted in a root mean square error (RMSE) of 38.1 °C. The QC-based regression model was trained on 83 T g values and produced an RMSE of 34.5 °C. In conclusion, this work demonstrated that while both model techniques produce accurate predictions and are suitable for different data availability scenarios, the QC-based regression model offered a more interpretable model framework with significantly less training data.

36 MATERIALS SCIENCE↗

Adaptive continuity-preserving simplification of street networks

Street network data is widely used to study human-based activities and urban structure. Often, these data are geared towards transportation applications, which require highly granular, directed graphs that capture the complex relationships of potential traffic patterns. While this level of network detail is critical for certain fine-grained mobility models, it represents a hindrance for studies concerned with the morphology of the street network. For the latter case, street network simplification — the process of converting a highly granular input network into its most simple morphological form — is a necessary, but highly tedious preprocessing step, especially when conducted manually. In this manuscript, we develop and present a novel adaptive algorithm for simplifying street networks that is both fully automated and able to mimic results obtained through a manual simplification routine. The algorithm — available in the neatnet Python package — outperforms current state-of-the-art procedures when comparing those methods to manually, human-simplified data, while preserving network continuity.

Python↗

Machine learning in materials research: Developments over the last decade and challenges for the future

The number of studies that apply machine learning (ML) to materials science has been growing at a rate of approximately 1.67 times per year over the past decade. In this review, I examine this growth in various contexts. First, I present an analysis of the most commonly used tools (software, databases, materials science methods, and ML methods) used within papers that apply ML to materials science. The analysis demonstrates that despite the growth of deep learning techniques, the use of classical machine learning is still dominant as a whole. It also demonstrates how new research can effectively build upon past research, particular in the domain of ML models trained on density functional theory calculation data. Next, I present the progression of best scores as a function of time on the matbench materials science benchmark for formation enthalpy prediction. In particular, a dramatic improvement of 7 times reduction in error is obtained when progressing from feature-based methods that use conventional ML (random forest, support vector regression, etc.) to the use of graph neural network techniques. Finally, I provide views on future challenges and opportunities, focusing on data size and complexity, extrapolation, interpretation, access, and relevance.

36 MATERIALS SCIENCE↗

tapir: A tool for topologies, amplitudes, partial fraction decomposition and input for reductions

The demand for precision predictions in the field of high energy physics has dramatically increased over recent years. Experiments conducted at the LHC, as well as precision measurements at the intensity frontier such as Belle II require equally precise theoretical predictions to make full use of the acquired data. To match the experimental precision, second-, third- and, for certain quantities, even higher-order calculations in perturbative quantum field theory are required. To facilitate such calculations, computer software automating as many steps as possible is required. Yet, each calculation poses different challenges and thus, a high level of configurability is required. In this context we present tapir: a tool for identification, manipulation and minimization of Feynman integral families. It is designed to integrate in toolchains based on the computer algebra system FORM, the use of which is common practice in the field. tapir can be used to reduce the complexity of multi-loop problems with cut-filters, topology mapping, partial fraction decomposition and alike. Program Title:tapir CPC Library link to program files:https://doi.org/10.17632/ptc9t46xyn.1 Developer's repository link:https://gitlab.com/tapir-devs/tapir Licensing provisions: GPLv3 Programming language:python 3, C++ Nature of problem: Multi-loop computations require the automatization of a large number of different tasks related to Feynman integral topologies. Among them are the identification and minimization of integral topologies, partial fraction decomposition of topologies in the case of linearly dependent propagators as well as mapping scalar products of loop momenta to scalar functions. Solution method: The minimization of topologies is performed by comparison of their respective Nickel indices [1], even further minimization utilizes Pak's algorithm [2]. To efficiently map scalar products of loop momenta to scalar functions FORM [3] code is generated. Additional comments including restrictions and unusual features: Minimization based on Pak's algorithm slows down for many lines and scales. A coarser minimization using the Nickel indices, however, is still possible. [1]B. Nickel, D. Meiron, G.A.J. Baker, Compilation of 2-pt and 4-pt graphs for continuous spin model, Report, University of Guelph, 1977.[2]A. Pak, J. Phys. Conf. Ser. 368 (2012) 012049, https://doi.org/10.1088/1742-6596/368/1/012049, arXiv:1111.0868.[3]B. Ruijl, T. Ueda, J. Vermaseren, FORM version 4.2, arXiv:1707.06453, 7 2017.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Automated descriptor selection, volcano curve generation, and active site determination using the DescMAP software

The material space for catalyst discovery is expansive. Volcano curves are traditionally employed to provide physical insights into optimal catalyst characteristics for new material selection. Their generation lies on a single descriptor picked using expert knowledge. Here we present DescMAP, a Python-based software, to automate the selection of descriptors, the generation of volcano maps, and the identification of active sites for structure-sensitive reactions. Here, we consider traditional energy-based and geometric descriptors for structure-sensitive reactions. DescMAP is integrated with the Virtual Kinetic Laboratory (VLab) to provide multiple functionalities. It inputs spreadsheets or template files for flexibility and outputs interactive graphs for post-processing. We demonstrate its features using the non-oxidative dehydrogenation of ethane to ethylene over (111) closed-packed surfaces and the methane total oxidation over various Pt facets. It can be easily applied to other complex chemistries and achieves quick screening of potential catalysts.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

OpenSn: A massively parallel, open-source simulation environment for discrete ordinates radiation transport

OpenSn is an open-source, massively parallel deterministic radiation transport code for solving the discrete-ordinates ( S N ) form of the Boltzmann transport equation on unstructured, arbitrary polyhedral meshes. It supports high-fidelity simulations involving steady-state, eigenvalue, and adjoint problems for neutral particles (e.g., neutrons, photons, multi-particles), using the multigroup approximation in energy. OpenSn combines angular discretization via discrete ordinates with a discontinuous Galerkin finite element method (DGFEM) in space, enabling accurate resolution of transport physics on arbitrary polyhedral cells, included locally refined spatial grids. It includes multiple angular quadrature types, including locally refined angular quadratures. Written in modern C++ with a Python API, OpenSn runs efficiently on platforms ranging from laptops to supercomputers. The transport sweep algorithm is implemented using a task-based, directed-acyclic-graph (DAG) approach for each angle and supports asynchronous parallelism across thousands of MPI ranks. Group-set aggregation improves compute intensity, and synthetic acceleration techniques (e.g., diffusion synthetic acceleration, second-moment method) enhance solver convergence. OpenSn has been verified on reactor physics problems and demonstrated excellent weak and strong scaling performance on more than 32,768 processes, making it a versatile and robust platform for large-scale transport simulations in complex geometries.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Protein conformational switch discerned via network centrality properties

Network analysis has emerged as a powerful tool for examining structural biology systems. The spatial organization of the components of a biomolecular structure has been rendered as a graph representation and analyses have been performed to deduce the biophysical and mechanistic properties of these components. For proteins, the analysis of protein structure networks (PSNs), especially via network centrality measurements and cluster coefficients, has led to identifying amino acid residues that play key functional roles and classifying amino acid residues in general. Whether these network properties examined in various studies are sensitive to subtle (yet biologically significant) conformational changes remained to be addressed. Here, we focused on four types of network centrality properties (betweenness, closeness, degree, and eigenvector centralities) for conformational changes upon ligand binding of a sensor protein (constitutive androstane receptor) and an allosteric enzyme (ribonucleotide reductase). We found that eigenvector centrality is sensitive and can distinguish salient structural features between protein conformational states while other centrality measures, especially closeness centrality, are less sensitive and rather generic with respect to the structural specificity. We also demonstrated that an ensembleinformed, modified PSN with static edges removed (which we term PSN*) has enhanced sensitivity at discerning structural changes.

59 BASIC BIOLOGICAL SCIENCES↗

An optimization framework for the network design of advanced district thermal energy systems

In this work, a topology optimization framework for district thermal energy systems is presented. The framework seeks to address the questions, for a given district, "What is the best subset of buildings to connect to a district thermal energy system, and by what network should they be connected, to minimize life cycle cost?" A particle swarm optimization approach is validated to address the selection of the subset of buildings, and a graph theory-based heuristic is validated for selection of the network topology for any candidate subset of buildings. The framework is applied to a prototypical urban district for illustrative purposes. Additionally, modeling of prototypical districts revealed reductions in source energy use intensity for heating and cooling of 21-25% through the use of advanced district energy systems relative to code-compliant, building level systems. The framework identifies solutions with life cycle cost values 14% to 72% lower than that of base case scenarios based on conventional design approaches, depending on the base case scenario selected. Analysis of the search space indicates that topology optimization facilitates reductions in life cycle cost, source energy use intensity, and carbon emissions.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

A survey on checkpointing strategies: Should we always checkpoint à la Young/Daly?

The Young/Daly formula provides an approximation of the optimal checkpointing period for a parallel application executing on a supercomputing platform. It was originally designed to handle fail-stop errors for preemptible tightly-coupled applications, but has been extended to other application and resilience frameworks. Here, we provide some background and survey various scenarios to assess the usefulness and limitations of the formula, both for preemptible applications and workflow applications represented as a graph of tasks. We also discuss scenarios with uncertainties, and extend the study to silent errors. We exhibit cases where the optimal period is of a different order than that dictated by the Young/Daly formula, and finally we explain how checkpointing can be further combined with replication.

97 MATHEMATICS AND COMPUTING↗

Analyzing inference workloads for spatiotemporal modeling

Ensuring power grid resiliency, forecasting climate conditions, and optimization of transportation infrastructure are some of the many application areas where data is collected in both space and time. Spatiotemporal modeling is about modeling those patterns for forecasting future trends and carrying out critical decision-making by leveraging machine learning/deep learning. Once trained offline, field deployment of trained models for near real-time inference could be challenging because performance can vary significantly depending on the environment, available compute resources and tolerance to ambiguity in results. Users deploying spatiotemporal models for solving complex problems can benefit from analytical studies considering a plethora of system adaptations to understand the associated performance-quality trade-offs. To facilitate the co-design of next-generation hardware architectures for field deployment of trained models, it is critical to characterize the workloads of these deep learning (DL) applications during inference and assess their computational patterns at different levels of the execution stack. In this paper, we develop several variants of deep learning applications that use spatiotemporal data from dynamical systems. We study the associated computational patterns for inference workloads at different levels, considering relevant models (Long short-term Memory, Convolutional Neural Network and Spatio-Temporal Graph Convolution Network), DL frameworks (Tensorflow and PyTorch), precision (FP16, FP32, AMP, INT16 and INT8), inference runtime (ONNX and AI Template), post-training quantization (TensorRT) and platforms (Nvidia DGX A100 and Sambanova SN10 RDU). Overall, our findings indicate that although there is potential in mixed-precision models and post-training quantization for spatiotemporal modeling, extracting efficiency from contemporary GPU systems might be challenging. Instead, co-designing custom accelerators by leveraging optimized High Level Synthesis frameworks (such as SODA High-Level Synthesizer for customized FPGA/ASIC targets) can make workload-specific adjustments to enhance the efficiency.

97 MATHEMATICS AND COMPUTING↗

Refined views of ancient ocean chemistry: Tracking trace element incorporation in pyrite framboids using atom probe tomography

The trace element chemistry of pyrite can be used to determine the origin, timing, and conditions of formation of ore deposits; as a vectoring tool for mineral exploration; and to determine the evolution of the Earth’s oceanic and atmospheric chemistry. However, little is known about whether trace elements are held with the pyrite structure or within nano-inclusions of other phases. This distinction is important for two primary reasons. First, trace element incorporation into the pyrite structure can affect the partitioning of other trace elements. Second, if trace elements are held within nano-inclusions, the partition coefficient of the mineral phases that make up the nano-inclusion, rather than pyrite, are the critical consideration in related interpretations. Previous studies addressing this topic have used laser ablation inductively coupled plasma mass spectrometry; however, the resulting data do not provide sufficient spatial resolution to delineate trace element distributions unless the inclusions are large. Further, they use these flat element profiles in time resolved laser ablation output graphs to argue that pyrite trace element content provides a direct relationship between trace element content of seawater and pyrite trace element content. To improve resolution, we have used atom probe tomography to characterize trace element distributions in pyrite framboids from the Cariaco Basin and Demerara Rise in three-dimensions at sub-nanometer resolution. Manganese was found to be concentrated in the pyrite nanocrystal part of the original framboid structure. In contrast, Ni was mostly found along the grain boundary, though it still appeared to be contained within the pyrite structure. Copper was concentrated in later pyrite overgrowths, and As varied in its location. These observations suggest that some important trace elements are incorporated into pyrite during early diagenesis, even in euxinic settings dominated by water-column pyrite formation. Statistical analysis was used to determine whether trace elements were incorporated in the lattice or within nanoscale inclusions (referred to here are nano-inclusions). We found that As, Ni, Cu, and Mn were commonly held within the pyrite structure, but As, Ni, and Cu can also be held as nano-inclusions or within grain interfaces. Incorporation of As is known to enhance the incorporation of other trace elements and in this case appears to correlated to elevated Ni and Cu concentrations in the Cariaco Basin samples. Furthermore, understanding these relationships strongly impacts our ability to utilize pyrite trace metal concentrations to analyze and quantify early ocean chemistry and its evolution through time.

54 ENVIRONMENTAL SCIENCES↗

Towards data-driven constitutive modelling for granular materials via micromechanics-informed deep learning

The analytical description of path-dependent elastic-plastic responses of a granular system is highly complicated because of continuously evolving microstructures and strain localisation within the system undergoing deformation. This study offers an alternative to the current analytical paradigm by developing micromechanics-informed machine-learning based constitutive modelling approaches for granular materials. A set of critical variables associated with the constitutive behaviour of granular materials are identified through an incremental stress-strain relationship analysis. Depending on the strategy to exploit the priori micromechanical knowledge, three different training strategies are explored. The first model uses only the measurable external variables to make stress predictions; the second model utilises a directed graph to link all the external strain sequences and internal microstructural evolution variables into a single prediction model comprised of a series of sub-mappings, and the third model explicitly integrates the physically important non-temporal properties with external strain paths into training through an enhanced Gated Recurrent Unit (GRU). These three models show satisfactory agreement with unseen test specimens based on multi-directional loading cases. The basic features and potential applications of each model are explained. Lastly, the key factors for constitutive training and limitations of the current work are also discussed in detail.

36 MATERIALS SCIENCE↗

Network analysis uncovers the communication structure of SARS-CoV-2 spike protein identifying sites for immunogen design

The COVID-19 pandemic, caused by the SARS-CoV-2 virus, has triggered myriad efforts to understand the structure and dynamics of this complex pathogen. The spike glycoprotein of SARS-CoV-2 is a significant target for immunogens as it is the means by which the virus enters human cells, while simultaneously sporting mutations responsible for immune escape. These functional and escape processes are regulated by complex molecular-level interactions. Our study presents quantitative insights on domain and residue contributions to allosteric communication, immune evasion, and local- and global-level control of functions through the derivation of a weighted graph representation from all-atom MD simulations. Focusing on the ancestral form and the D614G-variant, we provide evidence of the utility of our approach by guiding the selection of a mutation that alters the spike’s stability. Taken together, the network approach serves as a valuable tool to evaluate communication “hot-spots” in proteins to guide design of stable immunogens.

60 APPLIED LIFE SCIENCES↗