SEARCH · Search NASA

Results for “evolution graph”

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.

SourceResearch connectionFrom yearThrough year

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

At least 73 records · Page 4

All sources NASA NTRS DOE OSTI

DOE OSTI2025

Structure–Property Linkage in Alloys Using Graph Neural Network and Explainable Artificial Intelligence

Deep learning tools have recently shown significant potential for accelerating the prediction of microstructure–property linkage in materials. While deep neural networks like convolution neural networks (CNNs) can extract physics information from 3D microstructure images, they often require a large network architecture and substantial training time. In this research, we trained a graph neural network (GNN) using phase field generated microstructures of Ni-Al alloys to predict the evolution of mechanical properties. We found that a single GNN is capable of accurately predicting the strengthening of Ni-Al alloys with microstructures of varying sizes and dimensions, which cannot otherwise be done with a CNN. Additionally, GNN requires significantly less GPU utilization than CNN and offers more interpretable explanation of predictions using saliency analysis as features are manually defined in the graph. We also utilize explainable artificial intelligence tool Bayesian Inference to determine the coefficients in the power law equation that governs coarsening of precipitates. Overall, our work demonstrates the ability of the GNN to accurately and efficiently extract relevant information from material microstructures without having restrictions on microstructure size or dimension and offers an interpretable explanation.

Chemistry↗

DOE OSTI2023

Uncovering dark matter density profiles in dwarf galaxies with graph neural networks

Dwarf galaxies are small, dark-matter-dominated galaxies, some of which are embedded within the Milky Way. Their lack of baryonic matter (e.g., stars and gas) makes them perfect test beds for probing the properties of dark matter—understanding the spatial dark matter distribution in these systems can be used to constrain microphysical dark matter interactions that influence the formation and evolution of structures in our Universe. Here, we introduce a new method that leverages simulation-based inference and graph-based machine learning in order to infer the dark matter density profiles of dwarf galaxies from observable kinematics of stars gravitationally bound to these systems. Our approach aims to address some of the limitations of established methods based on dynamical Jeans modeling. We show that this novel method can place stronger constraints on dark matter profiles and, consequently, has the potential to weigh in on some of the ongoing puzzles associated with the small-scale structure of dark matter halos, such as the core-cusp discrepancy.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2026

Finding the Pareto front for high-entropy-alloy catalysts

Finding catalysts that have both high activity and high stability presents a long-standing challenge. Since optimizing activity and stability are conflicting objectives, the best one can do is find the Pareto front that yields optimal tradeoffs between these features. On the Pareto front, there is a trade-off where a portion of catalytic activity must be sacrificed to gain further stability and vice versa . Here, we provide a method to optimize the front by designing a multi-objective genetic algorithm that combines machine learning, graph neural network calculations, and density functional calculations. The application considered is the oxygen evolution reaction catalyzed by high-entropy alloys. We find that the Pareto front generally contains alloys with diverse elements, but that enhancing stability inevitably inflicts a toll on activity. We compare the general conclusions of our work to a survey of 545 experiments.

Zhang, Chengyi [Univ. of Auckland (New Zealand)]↗

NASA NTRS2003

Quantum Adiabatic Optimization and Combinatorial Landscapes

In this paper we analyze the performance of the Quantum Adiabatic Evolution (QAE) algorithm on a variant of Satisfiability problem for an ensemble of random graphs parametrized by the ratio of clauses to variables, gamma = M / N. We introduce a set of macroscopic parameters (landscapes) and put forward an ansatz of universality for random bit flips. We then formulate the problem of finding the smallest eigenvalue and the excitation gap as a statistical mechanics problem. We use the so-called annealing approximation with a refinement that a finite set of macroscopic variables (verses only energy) is used, and are able to show the existence of a dynamic threshold gamma = gammad, beyond which QAE should take an exponentially long time to find a solution. We compare the results for extended and simplified sets of landscapes and provide numerical evidence in support of our universality ansatz.

Smelyanskiy, V. N.↗

DOE OSTI2022

MSASGCN : Multi-Head Self-Attention Spatiotemporal Graph Convolutional Network for Traffic Flow Forecasting

Traffic flow forecasting is an essential task of an intelligent transportation system (ITS), closely related to intelligent transportation management and resource scheduling. Dynamic spatial-temporal dependencies in traffic data make traffic flow forecasting to be a challenging task. Most existing research cannot model dynamic spatial and temporal correlations to achieve well-forecasting performance. The multi-head self-attention mechanism is a valuable method to capture dynamic spatial-temporal correlations, and combining it with graph convolutional networks is a promising solution. Therefore, we propose a multi-head self-attention spatiotemporal graph convolutional network (MSASGCN) model. It can effectively capture local correlations and potential global correlations of spatial structures, can handle dynamic evolution of the road network, and, in the time dimension, can effectively capture dynamic temporal correlations. Experiments on two real datasets verify the stability of our proposed model, obtaining a better prediction performance than the baseline algorithms. The correlation metrics get significantly reduced compared with traditional time series prediction methods and deep learning methods without using graph neural networks, according to MAE and RMSE results. Compared with advanced traffic flow forecasting methods, our model also has a performance improvement and a more stable prediction performance. We also discuss some problems and challenges in traffic forecasting.

Cao, Yang↗

DOE OSTI2024

Clifford orbits from cayley graph quotients

We describe the structure of the $n$-qubit Clifford group $\mathcal{C}_n$ via Cayley graphs, whose vertices represent group elements and edges represent generators. In order to obtain the action of Clifford gates on a given quantum state, we introduce a quotient procedure. Quotienting the Cayley graph by the stabilizer subgroup of a state gives a reduced graph which depicts the state's Clifford orbit. Using this protocol for $\mathcal{C}_2$, we reproduce and generalize the reachability graphs. Since the procedure is state-independent, we extend our study to non-stabilizer states, including the W and Dicke states. Furthermore, our new construction provides a more precise understanding of state evolution under Clifford circuit action.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2023

Degree-preserving graph dynamics: a versatile process to construct random networks

Real-world networks evolve over time via the addition or removal of vertices and edges. In current network evolution models, vertex degree varies or grows arbitrarily. A recently introduced degree-preserving network growth (DPG) family of models preserves vertex degree, resulting in structures significantly different from and more diverse than previous models. Despite its degree preserving property, the DPG model is able to replicate the output of several well-known real-world network growth models. Simulations showed that many real-world networks can also be constructed from small seed graphs via the DPG process. Here, we start the development of a rigorous mathematical theory underlying the DPG family of network growth models. We prove that the degree sequence of the output of some of the well-known, real-world network growth models can be reconstructed via the DPG process, using proper parametrization. We also show that the general problem of deciding whether a simple graph can be obtained via the DPG process from a small seed (DPG feasibility) is, however, NP-complete. In conclusion, it is an intriguing open problem to uncover whether there is a structural reason behind the DPG-constructability of real-world networks.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1982

Planetary science: A lunar perspective

An interpretative synthesis of current knowledge on the moon and the terrestrial planets is presented, emphasizing the impact of recent lunar research (using Apollo data and samples) on theories of planetary morphology and evolution. Chapters are included on the exploration of the solar system; geology and stratigraphy; meteorite impacts, craters, and multiring basins; planetary surfaces; planetary crusts; basaltic volcanism; planetary interiors; the chemical composition of the planets; the origin and evolution of the moon and planets; and the significance of lunar and planetary exploration. Photographs, drawings, graphs, tables of quantitative data, and a glossary are provided.

Taylor, S. R.↗

NASA NTRS1986

On star formation in stellar systems. I - Photoionization effects in protoglobular clusters

The progressive ionization and subsequent dynamical evolution of nonhomogeneously distributed low-metal-abundance diffuse gas after star formation in globular clusters are investigated analytically, taking the gravitational acceleration due to the stars into account. The basic equations are derived; the underlying assumptions, input parameters, and solution methods are explained; and numerical results for three standard cases (ionization during star formation, ionization during expansion, and evolution resulting in a stable H II region at its equilibrium Stromgren radius) are presented in graphs and characterized in detail. The time scale of residual-gas loss in typical clusters is found to be about the same as the lifetime of a massive star on the main sequence.

Tenorio-Tagle, G.↗

NASA NTRS1989

Cosmic strings and galaxy formation

The cosmogonical model proposed by Zel'dovich and Vilenkin (1981), in which superconducting cosmic strings act as seeds for the origin of structure in the universe, is discussed, summarizing the results of recent theoretical investigations. Consideration is given to the formation of cosmic strings, the microscopic structure of strings, gravitational effects, cosmic string evolution, and the formation of galaxies and large-scale structure. Simulation results are presented in graphs, and several outstanding issues are listed and briefly characterized.

Bertschinger, Edmund↗

NASA NTRS1987

Seasonal variability of the OH Meinel bands

The influence of seasonal and latitudinal changes in the distribution of mesospheric components on the OH Meinel-band nightglow is investigated by means of numerical simulations using the two-dimensional dynamical/chemical model of Garcia and Solomon (1985). The processes responsible for the formation and destruction of vibrationally excited OH in the mesosphere are described; the seasonal/latitudinal evolution for the higher (v greater than 6) and lower (v = 1-6) levels is shown in graphs and maps and characterized in detail; and the theoretical results are compared with published observational data. The lower-level emission is shown to depend on both O and H, suggesting that the variation of the Meinel-band nightglow can provide important information on the roles of advection and diffusion in the transport of water vapor and odd oxygen near the mesopause.

Le Texier, H.↗

DOE OSTI2025

Differential equations for cosmological correlators

Cosmological fluctuations retain a memory of the physics that generated them in their spatial correlations. The strength of correlations varies smoothly as a function of external kinematics, which is encoded in differential equations satisfied by cosmological correlation functions. In this work, we provide a broader perspective on the origin and structure of these differential equations. As a concrete example, we study conformally coupled scalar fields in a power-law cosmology. The wavefunction coefficients in this model have integral representations, with the integrands being the product of the corresponding flat-space results and “twist factors” that depend on the cosmological evolution. Similar twisted integrals arise for loop amplitudes in dimensional regularization, and their recent study has led to the discovery of rich mathematical structures and powerful new tools for computing multi-loop Feynman integrals in quantum field theory. The integrals of interest in cosmology are also part of a finite-dimensional basis of master integrals, which satisfy a system of first-order differential equations. We develop a formalism to derive these differential equations for arbitrary tree graphs. The results can be represented in graphical form by associating the singularities of the differential equations with a set of graph tubings. Upon differentiation, these tubings grow in a local and predictive fashion. In fact, a few remarkably simple rules allow us to predict — by hand — the equations for all tree graphs. While the rules of this “kinematic flow” are defined purely in terms of data on the boundary of the spacetime, they reflect the physics of bulk time evolution. We also study the analogous structures in tr ϕ 3 theory, and see some glimpses of hidden structure in the sum over planar graphs. This suggests that there is an autonomous combinatorial or geometric construction from which cosmological correlations, and the associated spacetime, emerge.

Cosmological models↗

DOE OSTI2022

The Evolution of the Peridynamics Co-Authorship Network

We report peridynamics is a relatively new field in continuum mechanics that has developed over the past 20 years. This paper studies the evolution of collaborations in the field of peridynamics since its inception using social network analysis. For this purpose, we construct a network for each year from 2000 to 2019 describing co-authorship between scientists in peridynamics. In these networks, each node represents a scientist and each link connects two co-authoring scientists with a link weight representing the frequency and strength of their collaboration; each network as a whole can be thought of as a graph representation of the peridynamics community for the given year. By constructing a network for each year, we are able to analyze the evolution of the network in time and discuss the implications of this evolution for the peridynamics community. Our study demonstrates that the peridynamics community has been growing exponentially in size in recent years. Centrality metrics are also used to identify the most collaborative scientists in the community. Moreover, we compute link recommendations based on both elevating a scientist’s position in the network with respect to certain centrality metrics or closing structural holes in the network identified with persistent homology. We further extend the analysis to higher-order networks whose nodes represent groups of scientists in the community and whose links connect collaborating groups. In some sense, our work studies the past, present, and future of the peridynamics community.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS2003

Using Bond Graphs for Articulated, Flexible Multi-bodies, Sensors, Actuators, and Controllers with Application to the International Space Station

Conceptually, modeling of flexible, multi-body systems involves a formulation as a set of time-dependent partial differential equations. However, for practical, engineering purposes, this modeling is usually done using the method of Finite Elements, which approximates the set of partial differential equations, thus generalizing the approach to all continuous media. This research investigates the links between the Bond Graph method and the classical methods used to develop system models and advocates the Bond Graph Methodology and current bond graph tools as alternate approaches that will lead to a quick and precise understanding of a flexible multi-body system under automatic control. For long endurance, complex spacecraft, because of articulation and mission evolution the model of the physical system may change frequently. So a method of automatic generation and regeneration of system models that does not lead to implicit equations, as does the Lagrange equation approach, is desirable. The bond graph method has been shown to be amenable to automatic generation of equations with appropriate consideration of causality. Indeed human-interactive software now exists that automatically generates both symbolic and numeric system models and evaluates causality as the user develops the model, e.g. the CAMP-G software package. In this paper the CAMP-G package is used to generate a bond graph model of the International Space Station (ISS) at an early stage in its assembly, Zvezda. The ISS is an ideal example because it is a collection of bodies that are articulated, many of which are highly flexible. Also many reaction jets are used to control translation and attitude, and many electric motors are used to articulate appendages, which consist of photovoltaic arrays and composite assemblies. The Zvezda bond graph model is compared to an existing model, which was generated by the NASA Johnson Space Center during the Verification and Analysis Cycle of Zvezda.

Montgomery, Raymond C.↗

NASA NTRS1988

The formation of interstellar jets

The formation of interstellar jets by convergence of supersonic conical flows and the further dynamical evolution of these jets are investigated theoretically by means of numerical simulations. The results are presented in extensive graphs and characterized in detail. Strong radiative cooling is shown to result in jets with Mach numbers 2.5-29 propagating to lengths 50-100 times their original widths, with condensation of swept-up interstellar matter at Mach 5 or greater. The characteristics of so-called molecular outflows are well reproduced by the simulations of low-Mach-number and quasi-adiabatic jets.

Tenorio-Tagle, G.↗

NASA NTRSDate not supplied

Astrobee's Multi-year Activities at the International Space Station's Japanese Experimental Module

The Astrobee free-flying robots recently completed their third successful year of operations, housed in the Japanese Experimental Module (JEM) on the International Space Station. We summarize the three years of operation, giving special attention to JAXA's 1st and 2nd Kibo Robot Programming Challenge (RPC) and the mapping processes and tools that make Astrobees' autonomous operation possible. The JEM is an ever changing, dynamic environment where light settings, cargo, payloads, and crew members constantly move and interact with one another. The 1st JAXA Kibo RPC event, a collaboration between JAXA and NASA, was held in 2020. Students from several countries in the Asia-Pacific region competed in programming challenges with a simulated Astrobee. The finalists were then invited to run their code on an actual Astrobee in the JEM. For the final round, students programmed Astrobee to visit three different locations to obtain data that would instruct the robot to complete a final task with the participation of ISS crew. The first competition was a tremendous success, leading to an equally successful 2nd JAXA Kibo RPC in 2021 with even larger participation. The 3rd JAXA Kibo RPC will occur in 2022 expanding further to incorporate US participants. These activities led to several firsts in Astrobee’s history: operation of an Astrobee free-flying robot without crew supervision in preparation for on-orbit operations, autonomous image acquisition towards updates of the navigation map, non-NASA code running on the robot (both from JAXA and participating students), two heterogeneous free-flying robots from two different space agencies working together (Int-Ball and Astrobee) during the final event in 2020, the first payload using Astrobee, and having Astrobee controlled from a non-NASA location (Tsukuba Space Center). The preparation towards these activities involved constant evaluation of the different components of Astrobee's systems, specially mapping and localization. The paper describes the evolution of these systems such as the improvements made in localization to reduce localization drift by using graph-based optimization instead of the extended Kalman Filter localizer. Additionally, it reports on the mapping process and analysis tools created to validate map consistency across different activities in the constantly changing JEM environment. These enhancements have enabled the Astrobee facility to successfully execute over 100 ISS activities supporting over a dozen researchers and partners around the world.

Astrobee↗

DOE OSTI2026

Promise of Graph Sparsification and Decomposition for Noise Reduction in QAOA: Analysis for Trapped-Ion Compilations

We develop new approximate compilation schemes that significantly reduce the expense of compiling the Quantum Approximate Optimization Algorithm (QAOA) for solving the Max-Cut problem. Our main focus is on compilation with trapped-ion simulators using Pauli-X operations and all-to-all Ising Hamiltonian HIsing evolution generated by Molmer-Sorensen or optical dipole force interactions, though some of our results also apply to standard gate-based compilations. Our results are based on principles of graph sparsification and decomposition; the former reduces the number of edges in a graph while maintaining its cut structure, while the latter breaks a weighted graph into a small number of unweighted graphs. Though these techniques have been used as heuristics in various hybrid quantum algorithms, there have been no guarantees on their performance, to the best of our knowledge. This work provides the first provable guarantees using sparsification and decomposition to improve quantum noise resilience and reduce quantum circuit complexity. For quantum hardware that uses edge-by-edge QAOA compilations, sparsification leads to a direct reduction in circuit complexity. For trapped-ion quantum simulators implementing all-to-all HIsing pulses, we show that for a (1−ϵ) factor loss in the Max-Cut approximation (ϵ>0), our compilations improve the (worst-case) number of HIsing pulses from O(n2) to O(nlog(n/ϵ)) and the (worst-case) number of Pauli-X bit flips from O(n2) to O(nlog(n/ϵ)ϵ2) for n-node graphs. This is an asymptotic improvement for any constant ϵ>0. We demonstrate that significant improvements to the approximation ratio are obtained using decomposition in simulated trapped-ion experiments with dephasing noise. We further present a generic argument showing that sparsification results in an exponentially improved circuit fidelity lower bound in digital computing schemes based on one- and two-qubit gates, which are relevant to a wide variety of hardwares such as superconducting qubits and certain neutral atom or trapped ion setups, and more sophisticated noise models. We anticipate these approximate compilation techniques will be useful tools in a variety of future quantum computing experiments.

Moondra, Jai [Georgia Institute of Technology]↗

NASA NTRS1990

Experiment Document Information System (EDIS) evolution

The EDIS is the second generation of a system designed to produce and control a document containing large amounts of text in combination with tables and graphs of mathematical/scientific data. The first generation system proved the concept, but the slow, unfriendly user interface resulted in an effort to find an off-the-shelf product to improve the interface capability while maintaining the system requirements. The basic design of that first system was combined with the hypertext concepts inherent in HyperCard to generate the most usable EDIS. Currently in the latter stages of design, the EDIS promises to be the first step in the automation of the process required for defining complete packages of Life Sciences experiments for the Shuttle missions.

Moorhead, Jane↗