Search NASA⌕ Search

SEARCH · Search NASA

Results for “Graph Methods”

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,477 records · Page 82
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Learning Distributed Geometric Koopman Operator for Sparse Networked Dynamical Systems

Koopman operator theory provides an alternative to study nonlinear networked dynamical systems by mapping the state space to an abstract higher dimensional space where the system evolution is linear. Recent works show the application of graph neural networks (GNNs) to learn state to object-centric embeddings and achieve centralized block-wise computation of Koopman operator (KO) under additional assumptions on the underlying agents properties and constraints on the KO structure. However, the computational complexity of learning the Koopman increases exponentially for networked systems where the number of possible system states grows in a combinatorial fashion with the number of nodes. The learning challenge is further amplified for sparse networks by two factors: 1) sample sparsity for learning the Koopman operator in the non-linear space, and 2) the divergence in the dynamics of individual nodes or from one subgraph to another. Our work aims to address these challenge by formulating the representation learning of networked dynamical systems into a multi-agent paradigm and learning the Koopman operator in a distributive manner. The computational as well as performance advantages of distributed Koopman is predominant for sparse networks whereas for fully connected networks, it is shown to coincide with the centralized one. The empirical study on rope system, network of oscillators and a synthetic power system show comparable and superior performance along with computational benefits with the state-of-the-art methods.

Mukherjee, Sayak↗
DOE OSTI2018

Eigenvector centrality for characterization of protein allosteric pathways

Determining the principal energy-transfer pathways responsible for allosteric communication in biomolecules remains challenging, partially due to the intrinsic complexity of the systems and the lack of effective characterization methods. In this work, we introduce the eigenvector centrality metric based on mutual information to elucidate allosteric mechanisms that regulate enzymatic activity. Moreover, we propose a strategy to characterize the range of correlations that underlie the allosteric processes. We use the V-type allosteric enzyme imidazole glycerol phosphate synthase (IGPS) to test the proposed methodology. The eigenvector centrality method identifies key amino acid residues of IGPS with high susceptibility to effector binding. The findings are validated by solution NMR measurements yielding important biological insights, including direct experimental evidence for interdomain motion, the central role played by helix h α 1 , and the short-range nature of correlations responsible for the allosteric mechanism. Beyond insights on IGPS allosteric pathways and the nature of residues that could be targeted by therapeutic drugs or site-directed mutagenesis, the reported findings demonstrate the eigenvector centrality analysis as a general cost-effective methodology to gain fundamental understanding of allosteric mechanisms at the molecular level.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2016

Development of a Smart Signal Detection Method for Cyclic Voltammetry via Artificial Neural Intelligence

The electrorefiner (ER) is the heart of pyroprocessing technology which is a high-temperature method for separating uranium from Used Nuclear Fuel (UNF). It is important to improve this technology with respect to nuclear materials detection and accountability. Artificial Neural Intelligence (ANI) is a novel data analysis and simulation method that can be applied to electrochemical data sets. This computational code, which has been performed using the commercial software MATLAB, can be trained to generalize adequate electrical current and potential simulated data sets for the unseen data with a high accuracy of prediction. For this purpose, a massive collection of cyclic voltammetry (CV) data sets by Hoover (2014), for 0.5, 1, 2.5, and 5 wt% of zirconium chloride in LiCl-KCl molten salt with different scan rates at 773 K has been considered. The computer is trained via ANI to predict the unseen data after providing suitable hidden layers and validation numbers. In addition, this work can trace the CV plot for a blind condition by interpolating between two simulated data set. The different hidden layers with various neurons (from 5 to 30) at several validation numbers (from 5 to 30) has been studied and the average percent error between experimental and theoretical data for 0.5 wt% with 200 and 450 mV/s has been calculated. Preliminary results demonstrate that if the number of hidden layers increases from one to three, the average error falls down from 44% to around 8%. The best condition which gives a minimum average percent error has been discovered and the simulated CV graph has been compared with the experimental data. (authors)

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2024

Fox Trails

1. This software utilizes python pandas to pull data from P6 databases or XER files. The software transforms the datasets into multiple main tables by joining, filtering, iteratively flattening hierarchical structured data, and pivoting datasets to give simple flat output tables. The activity table includes all of the information related to an activity including activity codes, global, EPS, and project codes, UDFs, and WBS information as separate columns. This includes the code id, code value and sequence number for all levels in hierarchical codes. The resource table is similar to the activity table and includes all of the information related to resources on activities including UPFs and resource codes. The resource time phased table takes the resource information and time phases it for the budget, forecast, late, and actual dates/units/costs that closely matches P6's user interface's values as it implements the resource curve and calendars. The wbs table contains the WBS structure broken out by levels and includes UDFs, codes, and notebook topics. The final P6 data table is the relationships table which simply contains the relationships. 2. When a user updates the tool with data (via giving it P6 project names with database username/password information or XER files) the system creates the data in #1, then creates a networkx graph with the activity data imbedded in the node data and the relationships added as edges. Each edge also has it's float calculated (working time distance between the predecessor and successor) and attached to the edge. Activities are also tagged as a potential start of a path based on their constraints, constraint dates, remaining start date, and activity status. When a user enters an activity ID into the UI, it runs a shortest path calculation on the network graph between each node tagged as potential start to the entered activity id based on the float tagged on the edge. Each path returned by the algorithm contains all of the nodes on the path in order, as well as the total float of the edges that make the path. This data is then collected and returned to the user in the form of a gantt chart with groupings for each path that includes the total float for each group. 3. Similar to 2, if the user passes through a reference dataset each activity set in the path is checked to see if it had a path in the reference dataset, if that path was the primary path between the start and end activities, and what has changed regarding logic and durations. These changes are color coded and summarized before sent to the user to be displayed by the UI for simple discovery. 4. Utilizing the data from #1, the user can submit desired grouping code(s) and filters to the system. The system will then pull the activities, resources, and relationships and create a gantt chart based on the groupings sent and filtered based on the filters sent. 5. The system will produce a gantt chart in a similar method to #4, but allows interactivity with the data. As the user interacts with the gantt chart, the software captures the changes and stores it with the user making the change so that project controls and implement those changes in P6.

Fox, Ben↗
NASA NTRS2016

Augmenting Parametric Optimal Ascent Trajectory Modeling with Graph Theory

It has been well documented that decisions made in the early stages of Conceptual and Pre-Conceptual design commit up to 80% of total Life-Cycle Cost (LCC) while engineers know the least about the product they are designing [1]. Once within Preliminary and Detailed design however, making changes to the design becomes far more difficult to enact in both cost and schedule. Primarily this has been due to a lack of detailed data usually uncovered later during the Preliminary and Detailed design phases. In our current budget-constrained environment, making decisions within Conceptual and Pre-Conceptual design which minimize LCC while meeting requirements is paramount to a program's success. Within the arena of launch vehicle design, optimizing the ascent trajectory is critical for minimizing the costs present within such concerns as propellant, aerodynamic, aeroheating, and acceleration loads while meeting requirements such as payload delivered to a desired orbit. In order to optimize the vehicle design its constraints and requirements must be known, however as the design cycle proceeds it is all but inevitable that the conditions will change. Upon that change, the previously optimized trajectory may no longer be optimal, or meet design requirements. The current paradigm for adjusting to these updates is generating point solutions for every change in the design's requirements [2]. This can be a tedious, time-consuming task as changes in virtually any piece of a launch vehicle's design can have a disproportionately large effect on the ascent trajectory, as the solution space of the trajectory optimization problem is both non-linear and multimodal [3]. In addition, an industry standard tool, Program to Optimize Simulated Trajectories (POST), requires an expert analyst to produce simulated trajectories that are feasible and optimal [4]. In a previous publication the authors presented a method for combatting these challenges [5]. In order to bring more detailed information into Conceptual and Pre-Conceptual design, knowledge of the effects originating from changes to the vehicle must be calculated. In order to do this, a model capable of quantitatively describing any vehicle within the entire design space under consideration must be constructed. This model must be based upon analysis of acceptable fidelity, which in this work comes from POST. Design space interrogation can be achieved with surrogate modeling, a parametric, polynomial equation representing a tool. A surrogate model must be informed by data from the tool with enough points to represent the solution space for the chosen number of variables with an acceptable level of error. Therefore, Design Of Experiments (DOE) is used to select points within the design space to maximize information gained on the design space while minimizing number of data points required. To represent a design space with a non-trivial number of variable parameters the number of points required still represent an amount of work which would take an inordinate amount of time via the current paradigm of manual analysis, and so an automated method was developed. The best practices of expert trajectory analysts working within NASA Marshall's Advanced Concepts Office (ACO) were implemented within a tool called multiPOST. These practices include how to use the output data from a previous run of POST to inform the next, determining whether a trajectory solution is feasible from a real-world perspective, and how to handle program execution errors. The tool was then augmented with multiprocessing capability to enable analysis on multiple trajectories simultaneously, allowing throughput to scale with available computational resources. In this update to the previous work the authors discuss issues with the method and solutions.

Patrick D Dees↗
DOE OSTI2025

Learning nuclear cross sections across the chart of nuclides with graph neural networks

We explore the use of deep learning techniques to learn how nuclear cross sections change as we add or remove protons and neutrons. As a proof of principle, we focus on the neutron-induced reactions in the fast energy regime. Our approach follows a two-stage learning framework. First, we apply representation learning to encode cross section data into a latent space using either variational autoencoders (VAEs) or implicit neural representations (INRs). Then, we train graph neural networks (GNNs) on the resulting embeddings to predict missing values across the nuclear chart by leveraging the topological structure of neighboring isotopes. We demonstrate accurate cross section predictions within a 9 × 9 block of missing nuclei. We also find that the optimal GNN training strategy depends on the type of latent representation used, with VAE embeddings performing best under end-to-end optimization in the original space, while INR embeddings achieve better results when the GNN is trained only in the latent space. Furthermore, using clustering algorithms, we map groups of latent vectors into regions of the nuclear chart and show that VAEs and INRs can discover some of the neutron magic numbers. These findings suggest that deep-learning models based on the representation encoding of cross sections combined with graph neural networks hold significant potential in augmenting nuclear theory models, e.g., by providing reliable estimates of covariances of cross sections, including cross-material covariances.

Machine learning↗
DOE OSTI2021

Bacterial diversity dynamics in microbial consortia selected for lignin utilization

Lignin is nature’s largest source of phenolic compounds. Its recalcitrance to enzymatic conversion is still a limiting step to increase the value of lignin. Although bacteria are able to degrade lignin in nature, most studies have focused on lignin degradation by fungi. To understand which bacteria are able to use lignin as the sole carbon source, natural selection over time was used to obtain enriched microbial consortia over a 12-week period. The source of microorganisms to establish these microbial consortia were commercial and backyard compost soils. Cultivation occurred at two different temperatures, 30°C and 37°C, in defined culture media containing either Kraft lignin or alkaline-extracted lignin as carbon source. iTag DNA sequencing of bacterial 16S rDNA gene was performed for each of the consortia at six timepoints (passages). The initial bacterial richness and diversity of backyard compost soil consortia was greater than that of commercial soil consortia, and both parameters decreased after the enrichment protocol, corroborating that selection was occurring. Bacterial consortia composition tended to stabilize from the fourth passage on. After the enrichment protocol, Firmicutes phylum bacteria were predominant when lignin extracted by alkaline method was used as a carbon source, whereas Proteobacteria were predominant when Kraft lignin was used. Bray-Curtis dissimilarity calculations at genus level, visualized using NMDS plots, showed that the type of lignin used as a carbon source contributed more to differentiate the bacterial consortia than the variable temperature. The main known bacterial genera selected to use lignin as a carbon source were Altererythrobacter , Aminobacter , Bacillus , Burkholderia , Lysinibacillus , Microvirga , Mycobacterium , Ochrobactrum , Paenibacillus , Pseudomonas , Pseudoxanthomonas , Rhizobiales and Sphingobium . These selected bacterial genera can be of particular interest for studying lignin degradation and utilization, as well as for lignin-related biotechnology applications.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2019

Materials design of perovskite solid solutions for thermochemical applications

Perovskites are excellent candidate materials as oxygen carriers in thermochemical processes. Due to their versatile composition, it is possible to fine-tune the perovskite's properties. Here, we present a method for the rational design of AMO 3– δ perovskite solid solutions with two different species on the Msite in order to tune their redox behavior. To account for the different ionic radii of different transition metal species M, two distinct ions are used in a solid solution on the A site, allowing tolerance-factor adjusted materials design. Using this methodology, we can create stable perovskites over a large range of different compositions. Leveraging the infrastructure of Materials Project, we calculate redox enthalpies for the reduction of over 240 of these $(\text {A}^{\prime}_x\text {A}^{\prime\prime}_{1-x})(\text {M}^{\prime}_y\text {M}^{\prime\prime}_{1-y})$O 3 perovskites to their brownmillerite phases based on density functional theory (DFT). We compare this data to experimentally measured data on thermodynamics of 24 of these materials to verify our theoretical framework. An empirical model is formulated for predicting the enthalpy and entropy changes as a function of the perovskites non-stoichiometry δ , which can be used to simulate the equilibrium composition as a function of temperature and oxygen partial pressure and to create a perovskite search engine based on an energetic analysis of the redox cycles. The data has been added as a contribution to MPContribs, which now includes publicly available user-controlled interactive graphs based on our theoretical and experimental data.

36 MATERIALS SCIENCE↗
NASA NTRS2011

Superpixel-Augmented Endmember Detection for Hyperspectral Images

Superpixels are homogeneous image regions comprised of several contiguous pixels. They are produced by shattering the image into contiguous, homogeneous regions that each cover between 20 and 100 image pixels. The segmentation aims for a many-to-one mapping from superpixels to image features; each image feature could contain several superpixels, but each superpixel occupies no more than one image feature. This conservative segmentation is relatively easy to automate in a robust fashion. Superpixel processing is related to the more general idea of improving hyperspectral analysis through spatial constraints, which can recognize subtle features at or below the level of noise by exploiting the fact that their spectral signatures are found in neighboring pixels. Recent work has explored spatial constraints for endmember extraction, showing significant advantages over techniques that ignore pixels relative positions. Methods such as AMEE (automated morphological endmember extraction) express spatial influence using fixed isometric relationships a local square window or Euclidean distance in pixel coordinates. In other words, two pixels covariances are based on their spatial proximity, but are independent of their absolute location in the scene. These isometric spatial constraints are most appropriate when spectral variation is smooth and constant over the image. Superpixels are simple to implement, efficient to compute, and are empirically effective. They can be used as a preprocessing step with any desired endmember extraction technique. Superpixels also have a solid theoretical basis in the hyperspectral linear mixing model, making them a principled approach for improving endmember extraction. Unlike existing approaches, superpixels can accommodate non-isometric covariance between image pixels (characteristic of discrete image features separated by step discontinuities). These kinds of image features are common in natural scenes. Analysts can substitute superpixels for image pixels during endmember analysis that leverages the spatial contiguity of scene features to enhance subtle spectral features. Superpixels define populations of image pixels that are independent samples from each image feature, permitting robust estimation of spectral properties, and reducing measurement noise in proportion to the area of the superpixel. This permits improved endmember extraction, and enables automated search for novel and constituent minerals in very noisy, hyperspatial images. This innovation begins with a graph-based segmentation based on the work of Felzenszwalb et al., but then expands their approach to the hyperspectral image domain with a Euclidean distance metric. Then, the mean spectrum of each segment is computed, and the resulting data cloud is used as input into sequential maximum angle convex cone (SMACC) endmember extraction.

Thompson, David R.↗
DOE OSTI2021

A graph-based network for predicting chemical reaction pathways in solid-state materials synthesis

Abstract Accelerated inorganic synthesis remains a significant challenge in the search for novel, functional materials. Many of the principles which enable “synthesis by design” in synthetic organic chemistry do not exist in solid-state chemistry, despite the availability of extensive computed/experimental thermochemistry data. In this work, we present a chemical reaction network model for solid-state synthesis constructed from available thermochemistry data and devise a computationally tractable approach for suggesting likely reaction pathways via the application of pathfinding algorithms and linear combination of lowest-cost paths in the network. We demonstrate initial success of the network in predicting complex reaction pathways comparable to those reported in the literature for YMnO 3 , Y 2 Mn 2 O 7 , Fe 2 SiS 4 , and YBa 2 Cu 3 O 6.5 . The reaction network presents opportunities for enabling reaction pathway prediction, rapid iteration between experimental/theoretical results, and ultimately, control of the synthesis of solid-state materials.

36 MATERIALS SCIENCE↗
DOE OSTI2026

ChemGraph as an agentic framework for computational chemistry workflows

Atomistic simulations are essential in chemistry and materials science but remain challenging to run due to the expert knowledge required for the setup, execution, and validation stages of these calculations. We present ChemGraph, an agentic framework powered by artificial intelligence and state-of-the-art simulation tools to streamline and automate computational chemistry and materials science workflows. ChemGraph leverages graph neural network-based foundation models for accurate yet computationally efficient calculations and large language models (LLMs) for natural language understanding, task planning, and scientific reasoning to provide an intuitive and interactive interface. We evaluate ChemGraph across 13 benchmark tasks and demonstrate that smaller LLMs (GPT-4o-mini, Claude-3.5-haiku, Qwen-2.5-14B) perform well on simple workflows, while more complex tasks benefit from using larger models. Importantly, we show that decomposing complex tasks into smaller subtasks through a multi-agent framework enables GPT-4o to reach perfect accuracy and smaller LLMs to match or exceed single-agent GPT-4o's performance in these benchmarks.

Computational chemistry↗
DOE OSTI2020

Compare linear-system solver and preconditioner stacks with emphasis on GPU performance and propose phase-2 NGP solver development pathway

The goal of the ExaWind project is to enable predictive simulations of wind farms comprised of many megawatt-scale turbines situated in complex terrain. Predictive simulations will require computational fluid dynamics (CFD) simulations for which the mesh resolves the geometry of the turbines and captures the rotation and large deflections of blades. Whereas such simulations for a single turbine are arguably petascale class, multi-turbine wind farm simulations will require exascale-class resources. The primary physics codes in the ExaWind project are Nalu-Wind, which is an unstructured-grid solver for the acoustically incompressible Navier-Stokes equations, and OpenFAST, which is a whole-turbine simulation code. The Nalu-Wind model consists of the mass-continuity Poisson-type equation for pressure and a momentum equation for the velocity. For such modeling approaches, simulation times are dominated by linear-system setup and solution for the continuity and momentum systems. For the ExaWind challenge problem, the moving meshes greatly affect overall solver costs as reinitialization of matrices and recomputation of preconditioners is required at every time step. In this report we evaluated GPU-performance baselines for the linear solvers in the Trilinos and hypre solver stacks using two representative Nalu-Wind simulations: an atmospheric boundary layer precursor simulation on a structured mesh, and a fixed-wing simulation using unstructured overset meshes. Both strong-scaling and weak-scaling experiments were conducted on the OLCF supercomputer Summit and similar proxy clusters. We focused on the performance of multi-threaded Gauss-Seidel and two-stage Gauss-Seidel that are extensions of classical Gauss-Seidel; of one-reduce GMRES, a communication-reducing variant of the Krylov GMRES; and algebraic multigrid methods that incorporate the afore-mentioned methods. The team has established that AMG methods are capable of solving linear systems arising from the fixed-wing overset meshes on CPU, a critical intermediate result for ExaWind FY20 Q3 and Q4 milestones. For the fixed-wing strong-scaling study (model with 3M grid-points), the team identified that Nalu-Wind simulations with the new Trilinos and hypre solvers scale to modest GPU counts, maintaining above 70% efficiency up to 6 GPUs. However, there still remain significant bottlenecks to performance: matrix assembly (hypre), AMG setup (hypre and Trilinos) In the weak-scaling experiments (going from 0.4M to 211M gridpoints), it's shown that the solver apply phases are faster on GPUs, but that Nalu-Wind simulation times grow, primarily due to the multigrid-setup process. Finally, based on the report outcomes, we propose a linear solver path-forward for the remainder of the ExaWind project. Near term, the NREL team will continue their work on GPU-based linear-system assembly. They will also investigate how the use of alternatives to the NVIDIA UVM (unified virtual memory) paradigm affects performance. Longer term, the NREL team will evaluate algorithmic performance on other types of accelerators and merge their improvements back to the main hypre repository branch. Near term, the Trilinos team will address performance bottlenecks identified in this milestone, such as implementing a GPU-based segregated momentum solve and reusing matrix graphs across linear-system assembly phases. Longer term, the Trilinos team will do detailed analysis and optimization of multigrid setup.

17 WIND ENERGY↗
NASA NTRS1991

Path planning for assembly of strut-based structures

A path planning method with collision avoidance for a general single chain nonredundant or redundant robot is proposed. Joint range boundary overruns are also avoided. The result is a sequence of joint vectors which are passed to a trajectory planner. A potential field algorithm in joint space computes incremental joint vectors delta-q = delta-q(sub a) + delta-q(sub c) + delta-q(sub r). Adding delta-q to the robot's current joint vector leads to the next step in the path. Delta-q(sub a) is obtained by computing the minimum norm solution of the underdetermined linear system J delta-q(sub a) = x(sub a) where x(sub a) is a translational and rotational force vector that attracts the robot to its goal position and orientation. J is the manipulator Jacobian. Delta-q(sub c) is a collision avoidance term encompassing collisions between the robot (links and payload) and obstacles in the environment as well as collisions among links and payload of the robot themselves. It is obtained in joint space directly. Delta-q(sub r) is a function of the current joint vector and avoids joint range overruns. A higher level discrete search over candidate safe positions is used to provide alternatives in case the potential field algorithm encounters a local minimum and thus fails to reach the goal. The best first search algorithm A* is used for graph search. Symmetry properties of the payload and equivalent rotations are exploited to further enlarge the number of alternatives passed to the potential field algorithm.

Muenger, Rolf↗
NASA NTRSDate not supplied

Biological Data for Deep Space Mission Support

Increased biomedical risks and challenges associated with deep space missions (cis-Lunar, Mars transit, Mars surface) require new knowledge discovery and development of novel ecosystem and biomedical support capabilities. This paradigm shift supporting distant and long-duration missions requires biological data to be findable, accessible, interoperable, reusable (FAIR), and maximally open-access (i.e., there is a data governance continuum from closed to mediated to embargoed to open). The NASA “Open Science Data Repositories” (OSDR) aims to meet scientific, technical, and operational spaceflight needs, and offers the ability to upload, download, search, share, analyze, and visualize data across physiological, behavioral, ‘omics, and environmental monitoring telemetry datasets. OSDR includes NASA GeneLab, NASA Ames Life Sciences Data Archive (ALSDA), and NASA Biological Institutional Scientific Collection (NBISC). In the past year, ALSDA has undergone a transformation in its data collection, curation, and architecture methods. Standardizing non-genomic (phenotypic) datasets was, and will continue to be, a challenge because of their diverse nature (e.g., molecular, cellular, tissue, whole organism behavior; micro-computed tomography, intraocular pressure, fluorescence microscopy, western blot, ultrasonography; tabular, images, video). This year ALSDA, alongside GeneLab, introduced the Biological Data Management Environment (BDME) with the purpose to accept submission of data from space relevant experiments including spaceflight, radiation, simulated gravity, gravitropism, isolation and confinement, hostile closed environments and/or distance from Earth. In addition to bringing together omics, phenotypic, physiological, bioimaging, and behavioral data into one repository. By integrating with GeneLab a multi-project submission portal aims to reduce the burden on PIs submitting data and enabling the discovery of both omics and phenotypic data. The purpose of ALSDA is to collect, curate, and make all non-human space-relevant biological data maximally findable, accessible, interoperable, and reusable (FAIR). These scope of ALSDA data collected and submitted by PIs include study design metadata, subject metadata, assay metadata (parameters), raw and processed assay data, assay imagery/video, and subject-experienced mission data telemetry (radiation, temperature, humidity, acoustics, vibrations, etc.). In 2021, a community of researchers rallied to form the ALSDA Analysis Working Group (AWG) and provided scientific consensus on dataset sample and assay metadata. The community and excitement around the ALSDA/OSDR system has already led to several data reuse studies, demonstrating value using machine learning (ML), knowledge graphs, and meta-analysis approaches.

space biology↗
NASA NTRSDate not supplied

Biological Data for Deep Space Mission Support

Increased biomedical risks and challenges associated with deep space missions (cis-Lunar, Mars transit, Mars surface) require new knowledge discovery and development of novel ecosystem and biomedical support capabilities. This paradigm shift supporting distant and long-duration missions requires biological data to be findable, accessible, interoperable, reusable (FAIR), and maximally open-access (i.e., there is a data governance continuum from closed to mediated to embargoed to open). The NASA “Open Science Data Repositories” (OSDR) aims to meet scientific, technical, and operational spaceflight needs, and offers the ability to upload, download, search, share, analyze, and visualize data across physiological, behavioral, ‘omics, and environmental monitoring telemetry datasets. OSDR includes NASA GeneLab, NASA Ames Life Sciences Data Archive (ALSDA), and NASA Biological Institutional Scientific Collection (NBISC). In the past year, ALSDA has undergone a transformation in its data collection, curation, and architecture methods. Standardizing non-genomic (phenotypic) datasets was, and will continue to be, a challenge because of their diverse nature (e.g., molecular, cellular, tissue, whole organism, behavior; micro-computed tomography, intraocular pressure, fluorescence microscopy, western blot, ultrasonography; tabular, images, video). This year ALSDA, alongside GeneLab, introduced the Biological Data Management Environment (BDME) with the purpose to accept submission of data from space relevant experiments including spaceflight, radiation, simulated gravity, gravitropism, isolation and confinement, hostile closed environments and/or distance from Earth. In addition to bringing together omics, phenotypic, physiological, bioimaging, and behavioral data into one repository. By integrating with GeneLab a multi-project submission portal aims to reduce the burden on PIs submitting data and enabling the discovery of both omics and phenotypic data. The purpose of ALSDA is to collect, curate, and make all non-human space-relevant biological data maximally findable, accessible, interoperable, and reusable (FAIR). These scope of ALSDA data collected and submitted by PIs include study design metadata, subject metadata, assay metadata (parameters), raw and processed assay data, assay imagery/video, and subject-experienced mission data telemetry (radiation, temperature, humidity, acoustics, vibrations, etc.). In 2021, a community of researchers rallied to form the ALSDA Analysis Working Group (AWG) and provided scientific consensus on dataset sample and assay metadata. The community and excitement around the ALSDA/OSDR system has already led to several data reuse studies, demonstrating value using machine learning (ML), knowledge graphs, and meta-analysis approaches.

space biology↗
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↗
DOE OSTI2024

Hybrid programming-model strategies for GPU offloading of electronic structure calculation kernels

To address the challenge of performance portability and facilitate the implementation of electronic structure solvers, we developed the basic matrix library (BML) and Parallel, Rapid O(N), and Graph-based Recursive Electronic Structure Solver (PROGRESS) library. The BML implements linear algebra operations necessary for electronic structure kernels using a unified user interface for various matrix formats (dense and sparse) and architectures (CPUs and GPUs). Focusing on density functional theory and tight-binding models, PROGRESS implements several solvers for computing the single-particle density matrix and relies on BML. In this paper, we describe the general strategies used for these implementations on various computer architectures, using OpenMP target functionalities on GPUs, in conjunction with third-party libraries to handle performance critical numerical kernels. In this study, we demonstrate the portability of this approach and its performance in benchmark problems.

36 MATERIALS SCIENCE↗
NASA NTRSDate not supplied

Development and Testing of Pulse Guns for Combustion Instability Testing

To test liquid rocket engines (LREs) for combustion instabilities, devices such as bombs are often used to create pressure wave disturbances. Bombs, while effective, are inherently dangerous, expensive, and difficult to procure. Over the years, pulse guns have been used as a safer and more cost-effective way to generate controlled pressure disturbances in engine chambers. In anticipation of the need for stability testing of prototype LREs at NASA Marshall Space Flight Center (MSFC), a set of pulse guns have been designed, fabricated, tested, and characterized. The pulse gun program is funded by the RS-25 Engine Program managed out of MSFC and funded by NASA’s Space Launch System (SLS) through the MSFC Liquid Engines Office (LEO). A pulse gun is a simple device – like a traditional gun, it has a breech and barrel section. However, unlike a traditional gun, there is no bullet, as the purpose of the pulse gun is strictly to fire a high pressure pulse. Instead of a firing pin and primer that would normally be used in a traditional gun, an initiator is used to activate the gun powder. The initiator is a highly reliable pyrotechnic initiator. For this study, clone versions of the NASA Standard Initiator (NSI) were used. The initiator is used to ignite a pre-measured amount of gun powder loaded into the breech. When the pressure of the burnt gun powder exceeds the set point of a downstream burst disk, the disk ruptures, allowing the high pressure pulse to travel downstream through the barrel section. A ballistic pressure transducer located in the breech section is used to measure the short duration, high pressure pulse. Some configurations of the pulse gun have barrel sections that include one or more additional ballistic pressure transducers. These additional pressure measurements help track the degradation and damping of the pulse as it travels out of the barrel section. The measurements may also be used to determine the velocity of pulse. The objective of this paper is to present the different variants of this newly-developed pulse gun and characterize performance over a range of parameters. The parameters include breech diameter, barrel length, amount of gun powder used, the way the gun powder is packed, and the pressure setting of the burst disk. There are a total of six pulse guns: three with the 0.25 inch breech and three different length barrels, and three with the 0.40 inch breech and three different length barrels. For both breech sizes, the associated barrels are referred to as standard, one-port, and two-port barrels. The standard barrel has no instrumentation and is likely the barrel that will be used for engine stability testing. The one- and two-port barrels were designed specifically for pulse gun component testing to allow measurements of the magnitude and timing of the high pressure pulse as it makes its way through the pulse gun. The burst disks tested were commercially-available burst disks designed to rupture at 8,000, 16,000, and 24,000 psid. Testing was accomplished by firing the pulse gun into a test chamber pressurized with nitrogen at about 2300 psig. A total of four Model 113B23 High frequency ICP® pressure sensors (10k psi) were mounted in the test chamber, in the same plane as the pulse gun. Two of the sensors had “trimmed” adapters, and two did not. Given the symmetrical configuration of the sensors within the test chamber, different amplitudes of pressure measurements are attributed to the use of trimmed versus untrimmed adapters. The untrimmed adapters, with their narrower passages, tended to amplify the pressure amplitudes by as much as 50%. In total, 41 pulse gun tests have been conducted.Data are still being analyzed, but some trends are apparent. For example, measurements taken within the pulse gun are shown in Figures 3 and 4 for Hot-fires (HFs) # 11 and 39, respectively. Both tests were identical in that the 0.40 inch ID breech, two-port barrel, 8,000 psid burst disk, and same amount of gunpowder (6.639 grains for HF# 11, and 6.576 grains for HF# 39) were used, and the back pressure in the nitrogen test chamber was ~2300 psig. Despite keeping all these variables constant, the results from these two tests look quite different. For both tests, the first pressure peak shown in the P2111 trace within the breech is the firing of the initiator. The second peak and any subsequent peaks are from the combustion of the gunpowder. It should be noted that because the sensors are dynamic, the ~2300 psig baseline static pressure is not shown in the figures. For HF# 11, the burst disk clearly ruptured in a little over 0.1 ms from the time the initiator was fired. This is evident from the abrupt rise in pressure for P2112 followed by another abrupt rise in pressure for P2113. The sensors track the movement of the high pressure pulse through the pulse gun. For HF# 39, however, there was nearly 1 ms delay between the initiator firing and the burst disk rupturing. The only difference between these two tests was the way in which the gunpowder was packed within the breech. For HF# 11, the gunpowder was poured directly into the breech, atop the initiator, and held in place with a vegetable fiber wad appropriately sized for the barrel diameter. Once in place, the wad firmly held the gunpowder in place. For HF# 39, the gunpowder was rolled within cigarette paper with the ends of the paper twisted. The rolled gunpowder was gently pushed down into the breech, toward the initiator, and no wad was used. This method of loading the gunpowder consistently produced longer delays in the rupture of the burst disk, presumably because there was a steady, fuller burning of the gunpowder. The burst disk was rated for 8,000 psid, which means that the burst disk should not have opened until the pressure in the breech reached ~10,300 since there was ~2300 psig back pressure in the test chamber. In the case of HF# 11, the breech pressure only reached roughly 4200 psi before there was leakage either through or past the burst disk, but for HF#39, the breech pressure reached 10,600 psi prior to the burst disk opening. The temperature of the burst disk is certainly a factor in determining when the burst disk will rupture. A sharp rise in the burst disk temperature could weaken it and cause it to stray from the designed set point burst pressure. The burst disks are manufactured of Inconel to try to reduce their sensitivity to temperature, but how the burst disks perform above 900°F is not documented. All burst disks were engineered and tested by the manufacturer for ambient temperature conditions. One theory for why rolling the gunpowder in cigarette paper may produce better results is related to a more controlled temperature environment. The cigarette paper may act as a sheath that protects the burst disk from excessive temperatures during the rapid buildup of pressure in the breech. The ultimate benefit of not breeching the burst disk prematurely is shown in Figures 5 and 6, which graphs the resultant pressure pulse produced in the test chamber. For HF #11, the peak pressure on the P2123 trimmed adapter is about 270 psi, while for HF# 39 it is 343 psi, which is about 1.27 times greater in magnitude. In either case, the pressure pulse is ~20 μs in width once it reaches the test chamber. Another pressure rise about 100 μs later can be seen on the sensors located across from the pulse gun port, P2124 and P2121. These pressures are lower due to attenuation of the pressure wave as it moves across the test chamber. After the wave encounters the wall, it reflects back and forth within the chamber until it completely dissipates.

Pulse Gun↗