Search NASA⌕ Search

SEARCH · Search NASA

Results for “knowledge 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 361 records · Page 20
All sourcesNASA NTRSDOE OSTI
DOE OSTI2019

State-based network similarity visualization

We introduce an approach for the interactive visual analysis of weighted, dynamic networks. These networks arise in areas such as computational neuroscience, sociology, and biology. Network analysis remains challenging due to complex time-varying network behavior. For example, edges disappear/reappear, communities grow/vanish, or overall network topology changes. Our technique, TimeSum, detects the important topological changes in graph data to abstract the dynamic network and visualize one summary representation for each temporal phase, a state. We define a network state as a graph with similar topology over a specific time interval. To enable a holistic comparison of networks, we use a difference network to depict edge and community changes. Here, we present case studies to demonstrate that our methods are effective and useful for extracting and exploring complex dynamic behavior of networks.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗
NASA NTRS1990

NASA/DOD Aerospace Knowledge Diffusion Research Project. Paper 5: Aerospace librarians and technical information specialists as information intermediaries: A report of phase 2 activities of the NASA/DOD Aerospace Knowledge Diffusion Research Project

The flow of U.S. government-funded and foreign scientific and technical information (STI) through libraries and related facilities to users in government and industry is examined, summarizing preliminary results of Phase 2 of the NASA/DOD Aerospace Knowledge Diffusion Research Project (NAKDRP). The design and objectives of NAKDRP are reviewed; the NAKDRP model of STI transfer among producers, STI intermediaries, surrogates (technical report repositories or clearinghouses), and users is explained and illustrated with diagrams; and particular attention is given to the organization and operation of aerospace libraries. In a survey of North American libraries it was found that 25-30 percent of libraries regularly receive technical reports from ESA and the UK; the corresponding figures for Germany and for France, Sweden, and Japan are 18 and 5 percent, respectively. Also included is a series of bar graphs showing the librarians' assessments of the quality and use of NASA Technical Reports.

Pinelli, Thomas E.↗
NASA NTRS2004

"We Burn to Learn" About Fuel-Air Mixing Within Aircraft Powerplants

I am working with my branch s advanced diagnostics team to investigate fuel-air mixing in jet-fueled gas turbine combustors and jet-fuel reformers. Our data acquisition begins with bench-top experiments which will help with calibration of equipment for facility testing. While conducting the bench-top experiments I learned to align laser and optical equipment to collect data, to use the data acquisition software, and to process the data into graphs and images. which jet he1 is to be reformed into hydrogen. Testing will commence shortly, after which we will obtain and analyze data and meet a critical milestone for the end of September. I am also designing the layout for a Schlieren system that will be used during that time frame. A Schlieren instrument records changes in the refractive index distribution of transparent media like air flows. The refractive index distribution can then be related to density, temperature, or pressure distributions within the flow. I am working on a scheme to quantify this information and add to the knowledge of the fuel-air mixing process.

Robinson, Heidi N.↗
DOE OSTI2024

Graph-learning approach to combine multiresolution seismic velocity models

SUMMARY The resolution of velocity models obtained by tomography varies due to multiple factors and variables, such as the inversion approach, ray coverage, data quality, etc. Combining velocity models with different resolutions can enable more accurate ground motion simulations. Toward this goal, we present a novel methodology to fuse multiresolution seismic velocity maps with probabilistic graphical models (PGMs). The PGMs provide segmentation results, corresponding to various velocity intervals, in seismic velocity models with different resolutions. Further, by considering physical information (such as ray path density), we introduce physics-informed probabilistic graphical models (PIPGMs). These models provide data-driven relations between subdomains with low (LR) and high (HR) resolutions. Transferring (segmented) distribution information from the HR regions enhances the details in the LR regions by solving a maximum likelihood problem with prior knowledge from HR models. When updating areas bordering HR and LR regions, a patch-scanning policy is adopted to consider local patterns and avoid sharp boundaries. To evaluate the efficacy of the proposed PGM fusion method, we tested the fusion approach on both a synthetic checkerboard model and a fault zone structure imaged from the 2019 Ridgecrest, CA, earthquake sequence. The Ridgecrest fault zone image consists of a shallow (top 1 km) high-resolution shear-wave velocity model obtained from ambient noise tomography, which is embedded into the coarser Statewide California Earthquake Center Community Velocity Model version S4.26-M01. The model efficacy is underscored by the deviation between observed and calculated traveltimes along the boundaries between HR and LR regions, 38 per cent less than obtained by conventional Gaussian interpolation. The proposed PGM fusion method can merge any gridded multiresolution velocity model, a valuable tool for computational seismology and ground motion estimation.

Geochemistry & Geophysics↗
NASA NTRS1988

An analysis of the Kalman filter in the Gamma Ray Observatory (GRO) onboard attitude determination subsystem

The Gamma Ray Observatory (GRO) spacecraft needs a highly accurate attitude knowledge to achieve its mission objectives. Utilizing the fixed-head star trackers (FHSTs) for observations and gyroscopes for attitude propagation, the discrete Kalman Filter processes the attitude data to obtain an onboard accuracy of 86 arc seconds (3 sigma). A combination of linear analysis and simulations using the GRO Software Simulator (GROSS) are employed to investigate the Kalman filter for stability and the effects of corrupted observations (misalignment, noise), incomplete dynamic modeling, and nonlinear errors on Kalman filter. In the simulations, on-board attitude is compared with true attitude, the sensitivity of attitude error to model errors is graphed, and a statistical analysis is performed on the residuals of the Kalman Filter. In this paper, the modeling and sensor errors that degrade the Kalman filter solution beyond mission requirements are studied, and methods are offered to identify the source of these errors.

Snow, Frank↗
NASA NTRS1981

Evaluation and universal curves of the photon loss probability

In the transfer of radiation in a plasma, an important parameter (which measures the coupling between the radiation field and the electron gas) is the photon loss probability per scattering epsilon, defined as the ratio of collisional de-excitation to total de-excitation. The evaluation of epsilon requires normally knowledge of specific collisional excitation rates and radiative transition rate coefficients. In the considered investigation a general formula for epsilon is obtained which depends only on electron density, temperature, and line wavelength. Use is made of a simple Bethe-Coulomb expression recently derived by Kastner (1980) for the collisional excitation rate coefficient. Epsilon is obtained as a function of the three variables, and universal curves of it can be constructed with one of the variables as parameter. As an example of the application of the considered procedure, the variation of epsilon with height h in the solar atmosphere is shown in a graph for several solar lines.

Kastner, S. O.↗
DOE OSTI2020

Compiler and Runtime Approaches to Enable Large-Scale Irregular Programs. Final report, July 2013 - July 2019

While regular algorithms, characterized by operations on dense matrices and arrays, have long been the mainstay of scientific, high-performance computing, irregular algorithms, which feature unpredictable accesses to pointer-based data structures, are becoming increasingly common in high performance computing, arising in graph analysis, data mining and visualization, among other domains. Unfortunately, the defining characteristics of irregular applications, their dynamic, unpredictable, data-dependent access patterns and data layouts, make achieving high performance on large scale systems difficult. Scaling applications to peta- and exa-scale requires carefully controlling communication and data movement and placement, an inherently difficult task when access patterns and data layouts are unpredictable! Most irregular applications that attain high performance must be painstakingly hand-written and hand-tuned, with few common principles or paradigms uniting various implementations and easing future development. Despite the increasing importance of irregular applications, there is little programmer knowledge, and even less compiler ability, devoted to optimizing them. This project aims to solve these problems. By allowing programmers to write irregular applications in high level forms, with at most a few annotations highlighting key structural properties, programmers can focus on developing their algorithms and methods. The compiler and run-time system can take on the tedious task of optimizing the application for execution at large scales, and can automatically provide efficient implementations. This will provide portability and ease maintenance for existing irregular applications, but, more importantly, open up whole new domains of computational science to large-scale, high-performance simulation codes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Importance of Engineered and Learned Molecular Representations in Predicting Organic Reactivity, Selectivity, and Chemical Properties

Machine-readable chemical structure representations are foundational in all attempts to harness machine learning for the prediction of reactivities, selectivities, and chemical properties directly from molecular structure. The featurization of discrete chemical structures into a continuous vector space is a critical phase undertaken before model selection, and the development of new ways to quantitatively encode molecules is an active area of research. Here, we highlight the application and suitability of different representations, from expert-guided “engineered” descriptors to automatically “learned” features, in different prediction tasks relevant to organic and organometallic chemistry, where differing amounts of training data are available. These tasks include statistical models of stereo- and enantioselectivity, thermochemistry, and kinetics developed using experimental and quantum chemical data. The use of expert-guided molecular descriptors provides an opportunity to incorporate chemical knowledge, domain expertise, and physical constraints into statistical modeling. In applications to stereoselective organic and organometallic catalysis, where data sets may be relatively small and 3D-geometries and conformations play an important role, mechanistically informed features can be used successfully to obtain predictive statistical models that are also chemically interpretable. We provide an overview of several recent applications of this approach to obtain quantitative models for reactivity and selectivity, where topological descriptors, quantum mechanical calculations of electronic and steric properties, along with conformational ensembles, all feature as essential ingredients of the molecular representations used. Alternatively, more flexible, general-purpose molecular representations such as attributed molecular graphs can be used with machine learning approaches to learn the complex relationship between a structure and prediction target. This approach has the potential to out-perform more traditional representation methods such as “hand-crafted” molecular descriptors, particularly as data set sizes grow. One area where this is particularly relevant is in the use of large sets of quantum mechanical data to train quantitative structure–property relationships. A general approach toward curating useful data sets and training highly accurate graph neural network models is discussed in the context of organic bond dissociation enthalpies, where this strategy outperforms regression using precomputed descriptors. Finally, we describe how graph neural network predictions can be incorporated into mechanistically informed statistical models of chemical reactivity and selectivity. Once trained, this approach avoids the expensive computational overhead associated with quantum mechanical calculations, while maintaining chemical interpretability. We illustrate examples for which fast predictions of bond dissociation enthalpy and of the identities of radicals formed through cleavage of a molecule’s weakest bond are used in simple physical models of site-selectivity and reactivity.

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

Deepmod: An Over-the-Air Trainable Machine Modem for Resilient PHY Layer Communications

Traditional physical layer protocols (e.g. WiFi, WiMax, etc.) are well established and are often optimal in a wide variety of channel conditions including heterogenous links and in tactical communications. Unfortunately, this same optimality encourages ubiquity in wireless communication technology and enhances the potential for catastrophic cyber or physical attacks due to prolific knowledge of underlying physical layers. Any truly resilient communications protocol must be capable of immediate redeployment to meet quality of service (QoS) demands in a wide variety of possible channel media. This work proposes an approach to communications that is contrary to much traditional approaches in that processing blocks are generated real-time and only relevant to the particular channel medium being used. Rather than creating man-made ubiquitous blocks of signal processing, we examine using processing that is immediately expendable once it has been used. This is achieved through software-defined radios, and deep modulation, where system blocks are replaced with machine learning graphs that can be trained, used, and then discarded as needed. Simulation and experimental hardware show how deep modulation can converge to viable communications links, using the same machine intelligence, in vastly different channels.

Anderson, Adam L↗
DOE OSTI2015

Information processing systems, reasoning modules, and reasoning system design methods

Information processing systems, reasoning modules, and reasoning system design methods are described. According to one aspect, an information processing system includes working memory comprising a semantic graph which comprises a plurality of abstractions, wherein the abstractions individually include an individual which is defined according to an ontology and a reasoning system comprising a plurality of reasoning modules which are configured to process different abstractions of the semantic graph, wherein a first of the reasoning modules is configured to process a plurality of abstractions which include individuals of a first classification type of the ontology and a second of the reasoning modules is configured to process a plurality of abstractions which include individuals of a second classification type of the ontology, wherein the first and second classification types are different.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗
DOE OSTI2024

Cluster expansion by transfer learning for phase stability predictions

Recent progress towards universal machine-learned interatomic potentials holds considerable promise for materials discovery. Yet the accuracy of these potentials for predicting phase stability may still be limited. In contrast, cluster expansions provide accurate phase stability predictions but are computationally demanding to parameterize from first principles, especially for structures of low dimension or with a large number of components, such as interfaces or multimetal catalysts. We overcome this trade-off via transfer learning. Using Bayesian inference, we incorporate prior statistical knowledge from machine-learned and physics-based potentials, enabling us to sample the most informative configurations and to efficiently fit first-principles cluster expansions. Furthermore, this algorithm is tested on Pt:Ni, showing robust convergence of the mixing energies as a function of sample size with reduced statistical fluctuations.

36 MATERIALS SCIENCE↗
NASA NTRS1995

Coronal Structures Observed by Radio Propagation Measurements

This paper summarizes (1) advances in our knowledge of coronal structures inferred from radio propagation measurements, and (2) gains in our understanding of the relationship between radio propagation and white-light coronagraph measurements. Radio propagation measurements confirm that streamers are ray-like structures as depicted in coronagraph pictures, but also reveal a hierarchy of filamentary structures throughout the corona, extending from the size of streamers down to scale sizes as small as about 1 km at the Sun (10(ghe) arcsec). Doppler scintillation measurements, therefore, open a new window on small-scale structure that has long eluded coronagraph measurements. In addition, high precision ranging measurements make it possible to investigate large-scale structures not yet observed in corona graphs, such as plumes in equatorial coronal regions.

Sun↗
NASA NTRSDate not supplied

Increasing Discovery and Usability of Earth Science Satellite Data with My NASA Data

For 20 years, the My NASA Data project at NASA Langley Research Center has developed innovative approaches to increase the use of NASA’s satellite data by learners. My NASA Data offers a variety of authentic Earth Science datasets and a data visualization tool, eliminating the need for educators and/or learners to obtain specialized knowledge of GIS data formats and software to access and use authentic Earth Science data. While there is no shortage of available data, as federal government agencies such as NASA house petabytes of freely accessible Earth Science datasets, much of the data are only available for download and visualization in specialized formats and software, limiting their accessibility to educators and learners, especially those in primary and secondary school. Using the Google Earth Engine platform, the My NASA Data team has recently reinvented their data visualization tool, called the Earth System Data Explorer (ESDE). The ESDE gives users the capability to explore over 60 Earth Science satellite datasets in a multitude of formats such as maps, graphs, and data table Its new and improved user interface design was developed based on the preferences of educators, whom the My NASA Data project has over 20 years’ experience working with. Earth Science and GIS Subject Matter Experts (SMEs) structured the data in a professional and scientific manner. During Fiscal Year 2023, the My NASA Data website received over 1 million digital engagements, with over one-third being visitors to the data visualization tool. These metrics highlight the interest in a visualization tool that is simple and free to use with reliable and trusted datasets. The ESDE empowers users to readily relate and analyze NASA Earth Science data within their area of interest. The team used a user-centered design (UCD) framework to receive and incorporate feedback into the application’s design. Core requested features include the ability to create time series graphs, comparative analysis of maps, and download the data as CSV file. Responses indicate that advances in data visualization tools such as the ESDE make authentic Earth Science data more accessible. This presentation will cover how the My NASA Data project develops tools to enhance data discovery and accessibility, as well as how SME and user suggestions are incorporated.

Desiray Wilson↗
DOE OSTI2021

Systematic planning of moving target defence for maximising detection effectiveness against false data injection attacks in smart grid

Abstract Moving target defence (MTD) has been gaining traction to thwart false data injection attacks against state estimation (SE) in the power grid. MTD actively perturbs the reactance of transmission lines equipped with distributed flexible AC transmission system (D‐FACTS) devices to falsify the attacker's knowledge about the system configuration. However, the existing literature has not systematically studied what influences the detection effectiveness of MTD and how it can be improved based on the topology analysis. These problems are tackled here from the perspective of an MTD plan in which the D‐FACTS placement is determined. We first exploit the relation between the rank of the composite matrix and the detecting effectiveness. Then, we rigorously derive upper and lower bounds on the attack detecting probability of MTDs with a given rank of the composite matrix. Furthermore, we analyse existing planning methods and highlight the importance of bus coverage by D‐FACTS devices. To improve the detection effectiveness, we propose a novel graph theory–based planning algorithm to retain the maximum rank of the composite matrix while covering all necessary buses. Comparative results on multiple systems show the high detecting effectiveness of the proposed algorithm in both DC‐ and AC‐SE.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2019

Beyond Hosting Capacity: Using Shortest-Path Methods to Minimize Upgrade Cost Pathways

This paper presents a graph-based forward looking algorithm applied to distribution planning in the context of distributed photovoltaic penetration. We study the target hosting capacity problem where the objective is to find the least-cost sequence of system upgrades to reach a predefined hosting capacity target value. We show that commonly used short-term cost minimization approaches often lead to suboptimal long-term solutions. By comparing our method against such myopic techniques on real distribution systems, we show that our algorithm is able to reduce the overall integration costs by looking at future decisions. Because hosting capacity is hard to compute, this problem requires efficient methods to search the space. We demonstrate that heuristics using domain-specific knowledge can be efficiently used to improve the algorithm performance, such that real distribution systems can be studied.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2018

Beyond Hosting Capacity: Using Shortest Path Methods to Minimize Upgrade Cost Pathways: Preprint

We present in this paper a graph based forwardlooking algorithm applied to distribution planning in the context of distributed PV penetration. We study the target hosting capacity (THC) problem where the objective is to find the cheapest sequence of system upgrades to reach a predefined hosting capacity target value. We show in this paper that commonly used short-term cost minimization approaches lead most of the time to suboptimal solutions. By comparing our method against such myopic techniques on real distribution systems, we show that our algorithm is able to reduce the overall integration costs by looking at future decisions. Because hosting capacity is hard to compute, this problem requires efficient methods to search the space. We demonstrate here that heuristics using domain specific knowledge can be efficiently used to improve the algorithm performance such that real distribution systems can be studied.

14 SOLAR ENERGY↗
DOE OSTI2021

UPC++ v1.0 Specification, Revision 2021.9.0

UPC++ is a C++ library providing classes and functions that support Partitioned Global Address Space (PGAS) programming. The key communication facilities in UPC++ are one-sided Remote Memory Access (RMA) and Remote Procedure Call (RPC). All communication operations are syntactically explicit and default to non-blocking; asynchrony is managed through the use of futures, promises and continuation callbacks, enabling the programmer to construct a graph of operations to execute asynchronously as high-latency dependencies are satisfied. A global pointer abstraction provides system-wide addressability of shared memory, including host and accelerator memories. The parallelism model is primarily process-based, but the interface is thread-safe and designed to allow efficient and expressive use in multi-threaded applications. The interface is designed for extreme scalability throughout, and deliberately avoids design features that could inhibit scalability.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗
NASA NTRS2015

Analysis of Human-Spacesuit Interaction

Astronauts sustain injuries of various natures such as finger delamination, joint pain, and redness due to their interaction with the space suit. The role of the Anthropometry and Biomechanics Facility is to understand the biomechanics, environmental variables, and ergonomics of the suit. This knowledge is then used to make suggestions for improvement in future iterations of the space suit assembly to prevent injuries while allowing astronauts maneuverability, comfort, and tactility. The projects I was involved in were the Extravehicular Mobility Unit (EMU) space suit stiffness study and the glove feasibility study. The EMU project looked at the forces exerted on the shoulder, arm, and wrist when subjects performed kinematic tasks with and without a pressurized suit. The glove study consisted of testing three conditions - the Series 4000 glove, the Phase VI glove, and the no glove condition. With more than forty channels of sensor data total, it was critical to develop programs that could analyze data with basic descriptive statistics and generate relevant graphs to help understand what happens within the space suit and glove. In my project I created a Graphical User Interface (GUI) in MATLAB that would help me visualize what each sensor was doing within a task. The GUI is capable of displaying overlain plots and can be synchronized with video. This was helpful during the stiffness testing to visualize how the forces on the arm acted while the subject performed tasks such as shoulder adduction/abduction and bicep curls. The main project of focus, however, was the glove comparison study. I wrote MATLAB programs which generated movies of the strain vectors during specific tasks. I also generated graphs that summarized the differences between each glove for the strain, shear and FSR sensors. Preliminary results indicate that the Phase VI glove places less strain and shear on the hand. Future work includes continued data analysis of surveys and sensor data. In the end, the ideal glove is one that provides more tactility for the astronauts but lessens injuries. Often times, a more tactile glove transmits forces better to the hand; thus, achieving a balance of both a tactile and safe glove is the main challenge present.

Thomas, Neha↗