Search NASA⌕ Search

SEARCH · Search NASA

Results for “directed 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 289 records · Page 16
All sourcesNASA NTRSDOE OSTI
NASA NTRS1968

Use of a Magnetic Azimuth-Indicator System Developed for Balloon Payloads of the Planetary Entry Parachute Program

An azimuth-sensing system was used for continuous ground monitoring of the azimuth orientation of the balloon-borne Planetary Entry Parachute Program (PEPP) spacecraft. The system utilized two magnetic field sensors located in the spacecraft so as to produce a unique set of voltage outputs for any azimuth. Electronics onboard the spacecraft encoded the magnetometer outputs and fed the encoded signal to a C-band modulator which imposed the intelligence onto the radar tracking beacon pulses. A conveniently located ground radar received the modulated pulses and the magnetometer outputs were reproduced after demodulation. For fast, direct readout, an X-Y plotter was calibrated to cross plot the reproduced signal of the two magnetometers on a combination rectangular-polar graph indicating the correct true azimuth in real time. The method was used successfully on three of the PEPP balloon-borne spacecraft to determine when the spacecraft was pointed in the most advantageous direction for release from the balloon, at 130,000 ft altitude. The use of such a system of azimuth monitoring is suitable to balloon payloads which are virtually stable with respect to the horizontal but may be rotating about the vertical axis. Angular accuracies within plus or minus 10 deg. could generally be expected.

Darnell, Wayne L.↗
DOE OSTI2024

Current and future directions in network biology

Network biology is an interdisciplinary field bridging computational and biological sciences that has proved pivotal in advancing the understanding of cellular functions and diseases across biological systems and scales. Although the field has been around for two decades, it remains nascent. It has witnessed rapid evolution, accompanied by emerging challenges. These stem from various factors, notably the growing complexity and volume of data together with the increased diversity of data types describing different tiers of biological organization. We discuss prevailing research directions in network biology, focusing on molecular/cellular networks but also on other biological network types such as biomedical knowledge graphs, patient similarity networks, brain networks, and social/contact networks relevant to disease spread. In more detail, we highlight areas of inference and comparison of biological networks, multimodal data integration and heterogeneous networks, higher-order network analysis, machine learning on networks, and network-based personalized medicine. Following the overview of recent breakthroughs across these five areas, we offer a perspective on future directions of network biology. Additionally, we discuss scientific communities, educational initiatives, and the importance of fostering diversity within the field. This article establishes a roadmap for an immediate and long-term vision for network biology.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2025

Knowledge Oriented Graph Unified Transformer (KOGUT) v0.1

KOGUT — Knowledge Oriented Graph Unified Transformer KOGUT implements the Relational Graph Transformer (RelGT) architecture for knowledge graph link prediction in biological domains, with a primary focus on microbial growth media prediction. While the original RelGT (arXiv:2505.10960) targets relational tables, time series, and multi-table databases, KOGUT adapts this architecture for heterogeneous biological knowledge graphs, providing first-in-class AI predictive models for microbial cultivation. Key Adaptations Beyond Original RelGT: - Knowledge Graph Focus: Applied to biological KGs with semantic node types (taxa, chemicals, media, phenotypes, environments) versus generic relational database tables, trained on the KG-Microbe knowledge graph (1.3M entities, 2.9M edges, 24 relation types). - Multimodal Node Encoding: Integrates node labels, categories, descriptions, and synonyms from KG metadata through learned embedding layers—adapting relational column features to graph node attributes with textual semantics. - Extended K-Hop Subgraph Strategy: Optimized neighborhood sampling (3-hop default, configurable up to 200 nodes) tuned for sparse biological networks, building on the original local-global attention framework with biological relation preservation. - Biolink Predicate Preservation: Type-specific transformations for 24 biological edge semantics (occurs_in, consumes, produces, has_phenotype, subclass_of) beyond standard relational foreign keys, enabling multi-relation link prediction. - Inductive Learning Support: Enables zero-shot predictions for novel taxa through feature-based embeddings (temperature, oxygen requirements, gram stain, cell shape), extending the original transductive relational benchmark scope to uncultured microorganisms. CheapSOTA Performance Optimizations (This Distribution): - VQ-EMA Centroid Attention: Vector quantization with exponential moving average for improved global context modeling (+5-10% MRR improvement). - HDF5 Precomputed Data Loading: One-time preprocessing of k-hop subgraphs to eliminate redundant graph traversals (2-5× training speedup). - Distributed Data Parallel Training: Multi-GPU support for scaling to larger knowledge graphs (tested on 4× NVIDIA A100 GPUs at NERSC Perlmutter). - Mixed Precision Training: Automatic mixed precision (AMP) for memory efficiency and faster training. Advantages Over Standard Knowledge Graph Embedding Models: Combines RelGT's proven multi-element tokenization (features, type, hop, structure) with graph-native biological representations, enabling interpretable link prediction across heterogeneous entities that standard embedding models (TransE, RotatE, ComplEx) and table-based transformers cannot directly model. Achieves near-perfect performance on microbial growth media prediction (MRR: 0.9966, Precision@1: 0.9932, Hit@10: 1.0000) while maintaining explainability through attention-based reasoning over biological pathways. Training Data: - KG-Microbe merged knowledge graph: 1,379,337 nodes, 2,960,472 edges - 24 biological relation types including taxonomic hierarchies, metabolic interactions, phenotype associations, and environmental relationships - Primary prediction task: Growth media suitability for microbial taxa (biolink:occurs_in, 50K edges) - Multi-relation capability: Predicts links for any of the 24 relation types, including chemical consumption/production, phenotype associations, and taxonomic classification Citation: Original RelGT Architecture: Dwivedi et al., "Relational Graph Transformer", arXiv:2505.10960, 2025 KOGUT Implementation: Knowledge Oriented Graph Unified Transformer for Microbial Growth Media Prediction Developed at Lawrence Berkeley National Laboratory (LBNL) Trained on NERSC Perlmutter supercomputer

Joachimiak, Marcin [Lawrence Berkeley National Lab↗
DOE OSTI2020

Flying Blind, or Just Flying Under the Radar? The Underappreciated Power of De Novo Methods of Mass Spectrometric Peptide Identification

Mass spectrometry-based proteomics is a popular and powerful method for precise and highly multiplexed protein identification. The most common method of analyzing untargeted proteomics data is called database searching, where the database is simply a collection of protein sequences from the target organism, derived from genome sequencing. Experimental peptide tandem mass spectra are compared to simplified models of theoretical spectra calculated from the translated genomic sequences. However, in several interesting application areas, such as forensics, archaeology, venomics and others, a genome sequence may not be available, or the correct genome sequence to use is not known. In these cases, de novo peptide identification can play an important role. De novo peptide identification infers peptide sequence directly from the tandem mass spectrum without reference to a sequence database, usually using graph-based or machine learning algorithms. In this review, we provide a basic overview of de novo peptide identification methods and applications, briefly covering de novo algorithms and tools, and focusing in more depth on recent applications from venomics, metaproteomics, forensics, and characterization of antibody drugs.

proteomics, mass spectrometry, forensics, de novo ↗
DOE OSTI2021

krowkee

krowkee is a toolkit for scalably and efficiently summarizing many data streams in distributed memory. krowkee is intended for applications where one needs to summarize huge loosely structured data, such as matrices or graphs, where individual components such rows/columns or vertex adjacency information are impractical to store and directly inspect. krowkee ingests these objects as data streams - unstructured, arbitrarily ordered lists of updates - and accumulates summaries thereof in the form of data sketches.

Dunton, AlecM.↗
NASA NTRS1977

Types of rotor failure and characteristics of fragments

Noncontained rotor failures in U.K. engines resulting from low cycle fatigue, low cycle fatigue with superimposed high cycle fatigue, and overheating and-or overspeeding were analyzed. The size, shape, weight, velocity, energy, and direction of the fragments released from turbines and compressors were studied and are presented in graph.

Mccarthy, D.↗
NASA NTRS1988

Parafrase restructuring of FORTRAN code for parallel processing

Parafrase transforms a FORTRAN code, subroutine by subroutine, into a parallel code for a vector and/or shared-memory multiprocessor system. Parafrase is not a compiler; it transforms a code and provides information for a vector or concurrent process. Parafrase uses a data dependency to reveal parallelism among instructions. The data dependency test distinguishes between recurrences and statements that can be directly vectorized or parallelized. A number of transformations are required to build a data dependency graph.

Wadhwa, Atul↗
NASA NTRS1989

Real-Time MENTAT programming language and architecture

Real-time MENTAT, a programming environment designed to simplify the task of programming real-time applications in distributed and parallel environments, is described. It is based on the same data-driven computation model and object-oriented programming paradigm as MENTAT. It provides an easy-to-use mechanism to exploit parallelism, language constructs for the expression and enforcement of timing constraints, and run-time support for scheduling and exciting real-time programs. The real-time MENTAT programming language is an extended C++. The extensions are added to facilitate automatic detection of data flow and generation of data flow graphs, to express the timing constraints of individual granules of computation, and to provide scheduling directives for the runtime system. A high-level view of the real-time MENTAT system architecture and programming language constructs is provided.

Grimshaw, Andrew S.↗
DOE OSTI2023

Molecular Hypernetworks for Exploration of Multi-Dimensional Metabolomics Data (Chyper)

Orthogonal separations of data from high-resolution mass spectrometry can provide insight into sample composition and help address the challenge of complete annotation of molecules in untargeted metabolomics. “Molecular networks” (MNs), as used, for example, in the Global Natural Products Social Molecular Networking platform, are an increasingly popular computational strategy for exploring and visualizing molecular relationships and improving annotation. MNs use graph representations to show the relationships between measured multidimensional data features. MNs also show promise for using network science algorithms to automatically identify targets for annotation candidates and to dereplicate features associated to a single molecular identity. However, more advanced methods may better represent the complexity present in samples. Our work aims to increase confidence in annotation propagation by extending molecular network methods to include “molecular hypernetworks” (MHNs), able to natively represent multiway relationships among observations supporting both human and analytical processing. In this paper we first introduce MHNs illustrated with simple examples, and demonstrate how to build them from liquid chromatography- and ion mobility spectrometry- separated MS data. We then describe a method to construct MHNs directly from existing MNs as their “clique reconstructions”, demonstrating their utility by comparing examples of previously published graph-based MNs to their respective MHNs.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2024

Introducing Molecular Hypernetworks for Discovery in Multidimensional Metabolomics Data

Orthogonal separations of data from high-resolution mass spectrometry can provide insight into sample composition and address challenges of complete annotation of molecules in untargeted metabolomics. “Molecular networks” (MNs), as used in the Global Natural Products Social Molecular Networking platform, are a prominent strategy for exploring and visualizing molecular relationships and improving annotation. MNs are mathematical graphs showing the relationships between measured multidimensional data features. MNs also show promise for using network science algorithms to automatically identify targets for annotation candidates and to dereplicate features associated with a single molecular identity. Here, this paper introduces “molecular hypernetworks” (MHNs) as more complex MN models able to natively represent multiway relationships among observations. Compared to MNs, MHNs can more parsimoniously represent the inherent complexity present among groups of observations, initially supporting improved exploratory data analysis and visualization. MHNs also promise to increase confidence in annotation propagation, for both human and analytical processing. We first illustrate MHNs with simple examples, and build them from liquid chromatography- and ion mobility spectrometry-separated MS data. We then describe a method to construct MHNs directly from existing MNs as their “clique reconstructions”, demonstrating their utility by comparing examples of previously published graph-based MNs to their respective MHNs.

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

A graph neural network-state predictive information bottleneck (GNN-SPIB) approach for learning molecular thermodynamics and kinetics

Molecular dynamics simulations offer detailed insights into atomic motions but face timescale limitations. Enhanced sampling methods have addressed these challenges but even with machine learning, they often rely on pre-selected expert-based features. Here, in this work, we present a Graph Neural Network-State Predictive Information Bottleneck (GNN-SPIB) framework, which combines graph neural networks and the state predictive information bottleneck to automatically learn low-dimensional representations directly from atomic coordinates. Tested on three benchmark systems, our approach predicts essential structural, thermodynamic and kinetic information for slow processes, demonstrating robustness across diverse systems. The method shows promise for complex systems, enabling effective enhanced sampling without requiring pre-defined reaction coordinates or input features.

Zou, Ziyue↗
DOE OSTI2025

powersqueeze

powersqueeze (psqz) is a truncated power iteration library intended for high-performance computing platforms. psqz efficiently produces low-dimensional, linear measurements of graph matrix spectra by combining classical power iteration with sparse Johnson-Lindenstrauss transforms. psqz is intended to produce high-quality, fast, data-oblivious low-dimensional representations of high-dimensional sparse data such as graphs and term-document matrices. psqz is intended to replace similar workflows that depend on directly approximating a truncated eigendecomposition (e.g., the first step of spectral clustering), which is a much more expensive operation.

Priest, BenjaminW [Lawrence Livermore National Lab↗
DOE OSTI2021

Design, Synthesis, and Utility of Defined Molecular Scaffolds

A growing theme in chemistry is the joining of multiple organic molecular building blocks to create functional molecules. Diverse derivatizable structures—here termed “scaffolds” comprised of “hubs”—provide the foundation for systematic covalent organization of a rich variety of building blocks. This review encompasses 30 tri- or tetra-armed molecular hubs (e.g., triazine, lysine, arenes, dyes) that are used directly or in combination to give linear, cyclic, or branched scaffolds. Each scaffold is categorized by graph theory into one of 31 trees to express the molecular connectivity and overall architecture. Rational chemistry with exacting numbers of derivatizable sites is emphasized. The incorporation of water-solubilization motifs, robust or self-immolative linkers, enzymatically cleavable groups and functional appendages affords immense (and often late-stage) diversification of the scaffolds. Altogether, 107 target molecules are reviewed along with 19 syntheses to illustrate the distinctive chemistries for creating and derivatizing scaffolds. The review covers the history of the field up through 2020, briefly touching on statistically derivatized carriers employed in immunology as counterpoints to the rationally assembled and derivatized scaffolds here, although most citations are from the past two decades. The scaffolds are used widely in fields ranging from pure chemistry to artificial photosynthesis and biomedical sciences.

Sato, Daisuke (ORCID:0000000305472659)↗
NASA NTRS2003

Radial Clearance Found To Play a Key Role in the Performance of Compliant Foil Air Bearings

Compliant foil air bearings are at the forefront of the Oil-Free turbomachinery revolution, which supports gas turbine engines with hydrodynamic bearings that use air instead of oil as the working fluid. These types of bearings have been around for almost 50 years and have found a home in several commercial applications, such as in air cycle machines, turbocompressors, and microturbines, but are now being aggressively pursued for use in small and midrange aircraft gas turbine engines. Benefits include higher operating speeds and temperatures, lower maintenance costs, and greater reliability. The Oil-Free Turbomachinery team at the NASA Glenn Research Center is working to foster the transition of Oil-Free technology into gas turbine engines by performing in-house experiments on foil air bearings in order to gain a greater insight into their complex operating principles. A research program recently undertaken at Glenn focused on the concept of radial clearance and its influence on bearing performance. The tests were conducted on foil bearings with different radial clearances. As defined for a foil bearing, radial clearance is a measure of the small amount of shaft radial motion that is present from play that exists in the elastic support structure, such as between the top and bump foils and the bump foils and bearing shell (see the drawing). With an insufficient amount of radial clearance, the bearing imparts a high preload on the shaft, which when excessive, can reduce the loadcarrying capability of the bearing. On the other hand, systems using foil bearings with excessive radial clearance may experience rotordynamic instabilities because of low bearing preload. Therefore, without a more thorough understanding of radial clearance, it is difficult to accurately predict the performance of a given bearing design. The test program demonstrated that there is a direct correlation between radial clearance and the performance of foil air bearings. As shown in the graph, an optimum radial clearance exists that will maximize the amount of load that the bearing is capable of supporting. With respect to this optimum, two different performance regimes were observed that are a function of the amount of radial clearance. Tests showed that bearings with radial clearances below the optimum in regime I were susceptible to sudden seizure, a failure mode indicative of thermal runaway caused by high preload. The high preload is in response to an insufficient amount of radial clearance available to accommodate the thermal growth of the bearing and shaft. However, radial clearances greater than the optimum in regime II resulted in low bearing preloads that did not cause any heat-related problems, and the failure mode was due to fluid-film breakdown. In fact, bearings operating with radial clearances twice as much as the optimum suffered a decrease in the maximum load capacity of only about 20 percent. Therefore, special attention has to be given to the range of operating conditions expected in the bearing/shaft system since changes in temperature, centrifugal, and hydrodynamic effects can all affect radial clearance. This enhanced understanding of foil air bearing behavior will greatly aid our efforts to transition Oil-Free technology to future aircraft engines.

Radil, Kevin C.↗
NASA NTRS2004

Method Developed for Noninterference Measurement of Blade Damping

Although noninterference optical instrumentation has been previously used to monitor and measure rotor blade vibrations, it has not been used at the NASA Glenn Research Center for the determination of damping. This article describes such a measurement in Glenn's Spin Rig facility. The optical system was chosen because installation of the slip rig for this particular configuration was not feasible, ruling out strain gauge instrumentation. The shaft in this facility was suspended with two radial magnetic bearings, and the excitation was supplied to the bearings by a signal generator. For the first mode, the direction of excitation force was always perpendicular to the blade as described by Morrison. The preceding graph shows blade displacements, as measured by an optical probe during a frequency sweep designed to locate the first mode resonance. The resonance determines the frequency at which the shaft is excited. Because the sampling rate was fixed to only once per revolution with these transducers, and the first mode frequency was much larger than the rotational frequency, the data in this figure were undersampled with an apparent frequency that was only 1 Hz at the beginning of the sweep, about 14 Hz at the maximum amplitude, and about 20 Hz at the end of the sweep. The true excitation frequency varied during the sweep from 320 to 340 Hz, and the resonance occurred at 334 Hz. Damping is determined by applying a frequency burst to the shaft. Upon cessation of the burst, the blade undergoes free decay. The apparent damping is then obtained by a least squares fit of the theoretical cosine decay function through the experimental points. The following graph illustrates this procedure. Because of frequency aliasing, the apparent measured damping must be divided by the ratio of the true resonant frequency to the apparent measured frequency to obtain the true damping. Note that the contribution of the shaft vibration to the blade vibration could be neglected because it was shown that it is an order of magnitude smaller and that its decay is an order of magnitude faster.

Kurkov, Anatole P.↗
DOE OSTI2024

Robust training of machine learning interatomic potentials with dimensionality reduction and stratified sampling

Abstract Machine learning interatomic potentials (MLIPs) enable accurate simulations of materials at scales beyond that accessible by ab initio methods and play an increasingly important role in the study and design of materials. However, MLIPs are only as accurate and robust as the data on which they are trained. Here, we present DImensionality-Reduced Encoded Clusters with sTratified (DIRECT) sampling as an approach to select a robust training set of structures from a large and complex configuration space. By applying DIRECT sampling on the Materials Project relaxation trajectories dataset with over one million structures and 89 elements, we develop an improved materials 3-body graph network (M3GNet) universal potential that extrapolates more reliably to unseen structures. We further show that molecular dynamics (MD) simulations with the M3GNet universal potential can be used instead of expensive ab initio MD to rapidly create a large configuration space for target systems. We combined this scheme with DIRECT sampling to develop a reliable moment tensor potential for titanium hydrides without the need for iterative augmentation of training structures. This work paves the way for robust high-throughput development of MLIPs across any compositional complexity.

Qi, Ji (ORCID:0000000158089931)↗
DOE OSTI2022

Geometric learning for computational mechanics Part II: Graph embedding for interpretable multiscale plasticity

The history-dependent behaviors of classical plasticity models are often driven by internal variables evolved according to phenomenological laws. The difficulty to interpret how these internal variables represent a history of deformation, the lack of direct measurement of these internal variables for calibration and validation, and the weak physical underpinning of those phenomenological laws have long been criticized as barriers to creating realistic models. In this work, geometric machine learning on graph data (e.g. finite element solutions) is used as a means to establish a connection between nonlinear dimensional reduction techniques and plasticity models. Geometric learning-based encoding on graphs allows the embedding of rich time-history data onto a low-dimensional Euclidean space such that the evolution of plastic deformation can be predicted in the embedded feature space. Finally, a corresponding decoder can then convert these low-dimensional internal variables back into a weighted graph such that the dominating topological features of plastic deformation can be observed and analyzed.

42 ENGINEERING↗
DOE OSTI2026

Seamlessly joining length scales: From atomistic thermal graphs to anisotropic continuum conductivity

Thermal transport in complex solids is governed by local structure, defects, and anisotropy, yet most continuum models still rely on oversimplified and homogenized conductivities. Here, we bridge atomistic and continuum descriptions by building finite element (FE) models directly from the site-projected thermal conductivity (SPTC), an atomic-level decomposition of the Green–Kubo thermal conductivity. We introduce a toolkit, the “Simulator Collection for Atomic-to-Continuum Scales (SCACS)”, which uses a graph neural network to predict SPTC on large atomic structures, coarse-grains these fields into anisotropic conductivity tensors, and embeds them into the heat-flow FE equation with a customized, anisotropy-aware adaptive mesh refinement scheme. Applied to silicon nanostructures, the resulting FE models act as representative volume elements, reproduce bulk conductivities, and capture interfacial and defect-driven anisotropy while maintaining thermodynamic consistency. Additionally, SCACS predicts experimental conductance trends and fields. This work demonstrates a general route for transferring atomistic transport information into device-scale thermal simulations with physics-based approximations.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗