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 343 records · Page 19

Final Report: Sampling-Based Algorithms for Estimating Structure in Big Data.

The purpose of this project was to develop sampling-based algorithms to discover hidden struc- ture in massive data sets. Inferring structure in large data sets is an increasingly common task in many critical national security applications. These data sets come from myriad sources, such as network traffic, sensor data, and data generated by large-scale simulations. They are often so large that traditional data mining techniques are time consuming or even infeasible. To address this problem, we focus on a class of algorithms that do not compute an exact answer, but instead use sampling to compute an approximate answer using fewer resources. The particular class of algorithms that we focus on are streaming algorithms , so called because they are designed to handle high-throughput streams of data. Streaming algorithms have only a small amount of working storage - much less than the size of the full data stream - so they must necessarily use sampling to approximate the correct answer. We present two results: * A streaming algorithm called HyperHeadTail , that estimates the degree distribution of a graph (i.e., the distribution of the number of connections for each node in a network). The degree distribution is a fundamental graph property, but prior work on estimating the degree distribution in a streaming setting was impractical for many real-world application. We improve upon prior work by developing an algorithm that can handle streams with repeated edges, and graph structures that evolve over time. * An algorithm for the task of maintaining a weighted subsample of items in a stream, when the items must be sampled according to their weight, and the weights are dynamically changing. To our knowledge, this is the first such algorithm designed for dynamically evolving weights. We expect it may be useful as a building block for other streaming algorithms on dynamic data sets.

97 MATHEMATICS AND COMPUTING↗

CheKiPEUQ

Parameter estimation for complex physical problems often suffers from finding 'solutions' that are not physically realistic. The CheKiPEUQ software provides tools for finding physically realistic parameter estimates.and CheKiPEUQ provide tools for making graphs of the parameter positions within parameter space as well as plots of the final simulation results. The primary purpose of the CheKiPEUQ software is to enable more physically realistic parameter estimation from comparing simulations to experiments. Specifically, when prior knowledge is available about the region of parameter space which is physically realistic and when the level of uncertainty from experiment can be estimated. The software is intentionally general and can be used for almost any type of simulation. The software is made in a user friendly manner so that users can simply enter the required data and then run the program, following guidelines provided by the authors along with some trial and error. Examples are provided. Users do not need to understand the methodology that will be namedi in the following sentences. While CheKiPEUQ can be used for conventional parameter estimation and other uses, the primary uses for CheKiPEUQ are: 1) Bayesian Parameter Estimation, 2) Bayesian Model Discrimination, 3) Bayesian Design of Experiments. For more information see the project website, documentation, examples, and related publications.

Savara, Aditya [Oak Ridge National Lab. (ORNL), Oa↗

Atmospheres and ionospheres of the outer planets and their satellites

Essential aspects of physical and chemical processes in the atmospheres and ionospheres of the outer planets are examined in an introductory overview of current knowledge, intended both for graduate students of planetary science and for practicing scientists. Chapters are devoted to bulk atmospheric compositions, thermal structures, cloud structures, vertical mixing, photochemistry, the ionospheres, and the satellites. Measurement data are compiled in tables, and extensive graphs and diagrams are provided.

Atreya, Sushil K.↗

Approximate Weighted Matching On Emerging Manycore and Multithreaded Architectures

Graph matching is a prototypical combinatorial problem with many applications in computer science and scientific computing, but algorithms for computing optimal matchings are challenging to parallelize. Approximate matching algorithms provide an alternate route for parallelization, and in many contexts compute near-optimal matchings for large-scale graphs. We present sharedmemory parallel implementations for computing half-approximate weighted matching on state-of-the-art multicore (Intel Nehalem and AMD Magny-Cours), manycore (Nvidia Tesla and Nvidia Fermi) and massively multithreaded (Cray XMT) platforms. We provide two implementations: the first implementation uses shared work queues, and is suited to all these platforms; the second implementation is based on dataflow principles, and exploits the architectural features of the Cray XMT. Using a carefully chosen dataset that exhibits characteristics from a wide range of real-world applications, we show scalable performance across different platforms. In particular, for one instance of the input, an R-MAT graph (RMAT-G), we show speedups of: about 32 on 48 cores of an AMD Magny-Cours; 7 on 8 cores of Intel Nehalem; 3 on Nvidia Tesla and 10 on Nvidia Fermi relative to one core of Intel Nehalem; and 60 on 128 processors of Cray XMT. We demonstrate good weak and strong scaling for graphs with up to a billion edges using up to 12, 800 threads. Given the breadth of this work, we focus on simplicity and portability of software rather than excessive fine-tuning for each platform. To the best of our knowledge, this is the first such large-scale study of the half-approximate weighted matching problem on shared-memory platforms. Driven by the critical enabling role of combinatorial algorithms such as matching in scientific computing and the emergence of informatics applications, there is a growing demand to support irregular computations on current and future computing platforms. In this context, we evaluate the capability of emerging multithreaded platforms to tolerate latency induced by irregular memory access patterns, and to support fine-grained parallelism via light-weight synchronization mechanisms. By contrasting the architectural features of these platforms against the Cray XMT, which is specifically designed to support irregular memory-intensive applications, we delineate the impact of these choices on performance.

Halappanavar, Mahantesh↗

ASK Magazine; No. 21

THIS ISSUE FEATURES A VISUAL DEPICTION OF THE ACADEMY of Program and Project Leadership (APPL). I imagine a variety of initial reactions to the drawing. One might be, "What is a cartoon doing in a magazine about project management?" Or perhaps, "Wow, nice colors-and fun." Another may be to closely search the image for signs, symbols and meaning. Still another, to read a new level of innovation and creativity into the picture. Undoubtedly, some readers will raise questions about the cost. Of course, any reaction is a sign of engagement. The stronger, the more energized the emotional and cognitive processing, the better. It is a sign of attention and interaction. For I've heard it said, "You only need to worry if they don t care one way or the other." So what is the point of the picture? To stimulate interest, raise questions, promote discussion, and maybe raise a smile.. .That, at least, was my initial reaction when I was introduced to the work of Nancy Hegedus, who helps to create these drawings for Root Learning Inc. At the NASA PM Conference, I was first shown the work Nancy had been doing with the help of Goddard s Knowledge Management Architect, Dr. Ed Rogers. I was immediately drawn into the power of visualization as a tool for more effective learning, communicating, and conveying complex knowledge concepts. We need new tools in today s world, where information and data overwhelms by sheer volume. There are articles, pamphlets, communications, and white papers-all aiming to convince and influence. Reactions to these tend to be either avoidance or mind-numbing, heavy-eyed consent; the message never registers or enters the soul. That s one of the reasons that APPL s Knowledge Sharing Initiative (KSI) has turned to storytelling as a memorable way of transfer- ring knowledge, inspiring imitation of best practices, and spurring reflection. ASK Magazine s recent fourth birthday marks an important milestone in APPL s continuing quest to provide ongoing support to project managers and to promote mission success. And similar to storytelling, the power of visualization is receiving increasing attention in recent years as a way to stimulate engagement. Pictures and visual graphs are viewed as one of the most effective ways for displaying, describing, and generating discussion about quantitative and technically complex information. Prototypes, models, and simulations are considered essential for stimulating innovation through open and engaging discussions. There has also been extensive writing on the use of visual graphics, pictures, and cartoons to facilitate memory, creativity, openness, attention-and even well-being. For many of these reasons, I am excited to have a colorful visual depiction of the APPL world included in ASK. Without the addition of text or slides, the intent is to invite people into the world of the APPL mission-as well as its products, services, customers, and partners- in a fun and engaging manner. As project leaders strive to find ways to encourage engagement, learning, and transmission of knowledge, traditional technologies are proving to be as valuable as modern technologies. (But for those who want more information in the form of texts and slide presentations, we certainly have an abundance of those as well.)

Laufer, Alexander↗

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↗

Spatial deadlocks in task-level planning

We will formulate the problem of resolving spatial (space occupancy and support-stability) interactions in terms of tools developed in Operating Systems for the problems of deadlocks and synchronization. We show how to construct state graphs and to detect resource contentions and deadlocks from these state graphs. We describe an algorithm, called CONTAC, to deal with deadlocks where 'processes' represent the ordered motions of parts. The algorithm is a monitor-like process using preventative preemptive protocol to resolve higher-degree deadlocks. We develop the representation for knowledge about current allocations, pending requests, and synchronization constraints, to generate a contention-free sequence of actions. In this paper we focus on modeling deadlocks which are manifestations of spatial interactions.

Doshi, Rajkumar S.↗

Scenario Driven Data Modelling: A Method for Integrating Diverse Sources of Data and Data Streams

Background Biology is rapidly becoming a data intensive, data-driven science. It is essential that data is represented and connected in ways that best represent its full conceptual content and allows both automated integration and data driven decision-making. Recent advancements in distributed multi-relational directed graphs, implemented in the form of the Semantic Web make it possible to deal with complicated heterogeneous data in new and interesting ways. Results This paper presents a new approach, scenario driven data modelling (SDDM), that integrates multi-relational directed graphs with data streams. SDDM can be applied to virtually any data integration challenge with widely divergent types of data and data streams. In this work, we explored integrating genetics data with reports from traditional media. SDDM was applied to the New Delhi metallo-beta-lactamase gene (NDM-1), an emerging global health threat. The SDDM process constructed a scenario, created a RDF multi-relational directed graph that linked diverse types of data to the Semantic Web, implemented RDF conversion tools (RDFizers) to bring content into the Sematic Web, identified data streams and analytical routines to analyse those streams, and identified user requirements and graph traversals to meet end-user requirements. Conclusions We provided an example where SDDM was applied to a complex data integration challenge. The process created a model of the emerging NDM-1 health threat, identified and filled gaps in that model, and constructed reliable software that monitored data streams based on the scenario derived multi-relational directed graph. The SDDM process significantly reduced the software requirements phase by letting the scenario and resulting multi-relational directed graph define what is possible and then set the scope of the user requirements. Approaches like SDDM will be critical to the future of data intensive, data-driven science because they automate the process of converting massive data streams into usable knowledge.

Griffith, Shelton D↗

A Mass‐Conserving‐Perceptron for Machine‐Learning‐Based Modeling of Geoscientific Systems

Although decades of effort have been devoted to building Physical-Conceptual (PC) models for predicting the time-series evolution of geoscientific systems, recent work shows that Machine Learning (ML) based Gated Recurrent Neural Network technology can be used to develop models that are much more accurate. However, the difficulty of extracting physical understanding from ML-based models complicates their utility for enhancing scientific knowledge regarding system structure and function. Here, we propose a physically interpretable Mass-Conserving-Perceptron (MCP) as a way to bridge the gap between PC-based and ML-based modeling approaches. The MCP exploits the inherent isomorphism between the directed graph structures underlying both PC models and GRNNs to explicitly represent the mass-conserving nature of physical processes while enabling the functional nature of such processes to be directly learned (in an interpretable manner) from available data using off-the-shelf ML technology. As a proof of concept, we investigate the functional expressivity (capacity) of the MCP, explore its ability to parsimoniously represent the rainfall-runoff (RR) dynamics of the Leaf River Basin, and demonstrate its utility for scientific hypothesis testing. To conclude, we discuss extensions of the concept to enable ML-based physical-conceptual representation of the coupled nature of mass-energy-information flows through geoscientific systems.

58 GEOSCIENCES↗

SU-F-BRB-16: A Spreadsheet Based Automatic Trajectory GEnerator (SAGE): An Open Source Tool for Automatic Creation of TrueBeam Developer Mode Robotic Trajectories

Purpose: To automate creation and delivery of robotic linac trajectories with TrueBeam Developer Mode, an open source spreadsheet-based trajectory generation tool has been developed, tested and made freely available. The computing power inherent in a spreadsheet environment plus additional functions programmed into the tool insulate users from the underlying schema tedium and allow easy calculation, parameterization, graphical visualization, validation and finally automatic generation of Developer Mode XML scripts which are directly loadable on a TrueBeam linac. Methods: The robotic control system platform that allows total coordination of potentially all linac moving axes with beam (continuous, step-and-shoot, or combination thereof) becomes available in TrueBeam Developer Mode. Many complex trajectories are either geometric or can be described in analytical form, making the computational power, graphing and programmability available in a spreadsheet environment an easy and ideal vehicle for automatic trajectory generation. The spreadsheet environment allows also for parameterization of trajectories thus enabling the creation of entire families of trajectories using only a few variables. Standard spreadsheet functionality has been extended for powerful movie-like dynamic graphic visualization of the gantry, table, MLC, room, lasers, 3D observer placement and beam centerline all as a function of MU or time, for analysis of the motions before requiring actual linac time. Results: We used the tool to generate and deliver extended SAD “virtual isocenter” trajectories of various shapes such as parameterized circles and ellipses. We also demonstrated use of the tool in generating linac couch motions that simulate respiratory motion using analytical parameterized functions. Conclusion: The SAGE tool is a valuable resource to experiment with families of complex geometric trajectories for a TrueBeam Linac. It makes Developer Mode more accessible as a vehicle to quickly translate research ideas into machine readable scripts without programming knowledge. As an open source initiative, it also enables researcher collaboration on future developments. I am a full time employee at Varian Medical Systems, Palo Alto, California.

43 PARTICLE ACCELERATORS↗

Computational Estimation by Scientific Data Mining with Classical Methods to Automate Learning Strategies of Scientists

Experimental results are often plotted as 2-dimensional graphical plots (aka graphs) in scientific domains depicting dependent versus independent variables to aid visual analysis of processes. Repeatedly performing laboratory experiments consumes significant time and resources, motivating the need for computational estimation. The goals are to estimate the graph obtained in an experiment given its input conditions, and to estimate the conditions that would lead to a desired graph. Existing estimation approaches often do not meet accuracy and efficiency needs of targeted applications. We develop a computational estimation approach called AutoDomainMine that integrates clustering and classification over complex scientific data in a framework so as to automate classical learning methods of scientists. Knowledge discovered thereby from a database of existing experiments serves as the basis for estimation. Challenges include preserving domain semantics in clustering, finding matching strategies in classification, striking a good balance between elaboration and conciseness while displaying estimation results based on needs of targeted users, and deriving objective measures to capture subjective user interests. These and other challenges are addressed in this work. The AutoDomainMine approach is used to build a computational estimation system, rigorously evaluated with real data in Materials Science. Our evaluation confirms that AutoDomainMine provides desired accuracy and efficiency in computational estimation. It is extendable to other science and engineering domains as proved by adaptation of its sub-processes within fields such as Bioinformatics and Nanotechnology.

Computer Science↗

Self-contamination and environment of an orbiting satellite.

The flux of molecules emitted by the satellite and subsequently returning to its surface is investigated. The reflection occurs upon collision of these with ambient molecules. The evaluation of this flux is carried out from a knowledge of the outgassing rate of the satellite, its dimensions, and the orbit parameters. Condensation rates and adsorption layers on critical surfaces are calculated from the knowledge of this flux, and from the natures and temperatures of the gas and the surface. The calculation of these parameters, based on estimated and in some cases measured emission rates, has been carried out for a number of satellites. These developed relationships and graphs allow the estimation of several important parameters for an orbiting satellite. This report presents the pressures and densities at various distances from the satellite as produced by the surrounding ambient molecules and by the outgassing of the satellite.

Scialdone, J. J.↗

Properties of Ap stars in the ultraviolet

A review is presented of the current state of knowledge concerning the emitted flux distributions of Ap stars and their ultraviolet photometric variability especially as it relates to photometric and spectrum variability observed in the visible. A table of Ap stars observed in the ultraviolet from space vehicles is presented along with a graph which shows the observed flux distributions, normalized to unity flux at 3320 A, for the Si star theta Aur and for the normal stars 134 Tau and gamma UMa. Attention is given to ultraviolet color indices and ultraviolet light curves for variable Ap stars.

Leckrone, D. S.↗

Expert systems for automated maintenance of a Mars oxygen production system

Application of expert system concepts to a breadboard Mars oxygen processor unit have been studied and tested. The research was directed toward developing the methodology required to enable autonomous operation and control of these simple chemical processors at Mars. Failure detection and isolation was the key area of concern, and schemes using forward chaining, backward chaining, knowledge-based expert systems, and rule-based expert systems were examined. Tests and simulations were conducted that investigated self-health checkout, emergency shutdown, and fault detection, in addition to normal control activities. A dynamic system model was developed using the Bond-Graph technique. The dynamic model agreed well with tests involving sudden reductions in throughput. However, nonlinear effects were observed during tests that incorporated step function increases in flow variables. Computer simulations and experiments have demonstrated the feasibility of expert systems utilizing rule-based diagnosis and decision-making algorithms.

Huang, Jen-Kuang↗

Space Station Freedom science utilization: 2000 and beyond

The Office of Space Science and Applications (OSSA) Goals are: (1) to advance scientific knowledge of the Earth, the Solar System, and the Universe; (2) to understand the effects of the space environment on biological and physical processes; and (3) to expand the human presence beyond the Earth into the Solar System. The topics covered are presented in view graph form and include the following: (1) a strategic plan; (2) evolving U.S. space science capabilities; (3) life science goals; (4) OSSA Space Station Payload Traffic Model May 1991; and (5) microgravity science and applications goals.

Source record↗

AtomSets as a hierarchical transfer learning framework for small and large materials datasets

Abstract Predicting properties from a material’s composition or structure is of great interest for materials design. Deep learning has recently garnered considerable interest in materials predictive tasks with low model errors when dealing with large materials data. However, deep learning models suffer in the small data regime that is common in materials science. Here we develop the AtomSets framework, which utilizes universal compositional and structural descriptors extracted from pre-trained graph network deep learning models with standard multi-layer perceptrons to achieve consistently high model accuracy for both small compositional data (<400) and large structural data (>130,000). The AtomSets models show lower errors than the graph network models at small data limits and other non-deep-learning models at large data limits. They also transfer better in a simulated materials discovery process where the targeted materials have property values out of the training data limits. The models require minimal domain knowledge inputs and are free from feature engineering. The presented AtomSets model framework can potentially accelerate machine learning-assisted materials design and discovery with less data restriction.

Chen, Chi (ORCID:0000000180087043)↗

Expert systems for automated maintenance of a Mars oxygen production system

A prototype expert system was developed for maintaining autonomous operation of a Mars oxygen production system. Normal operation conditions and failure modes according to certain desired criteria are tested and identified. Several schemes for failure detection and isolation using forward chaining, backward chaining, knowledge-based and rule-based are devised to perform several housekeeping functions. These functions include self-health checkout, an emergency shut down program, fault detection and conventional control activities. An effort was made to derive the dynamic model of the system using Bond-Graph technique in order to develop the model-based failure detection and isolation scheme by estimation method. Finally, computer simulations and experimental results demonstrated the feasibility of the expert system and a preliminary reliability analysis for the oxygen production system is also provided.

Ash, Robert L.↗

Optimizing FPGA-based Accelerator Design for Large-Scale Molecular Similarity Search (Special Session Paper)

Molecular similarity search has been widely used in drug discovery to rapidly identify structurally similar compounds from large molecular databases. With the increasing size of chemical libraries, there is growing interest in the efficient ac- celeration of large-scale similarity search. Existing works mainly focus on CPU and GPU to accelerate the computation of Tatimoto coefficient in measuring the pairwise similarity between different molecular fingerprints. In this paper, we propose and optimize an FPGA-based accelerator design on exhaustive and approximate search algorithms. On exhaustive search using BitBound & fold- ing, we analyze the similarity cutoff and folding level relationship with search speedup and accuracy, and propose a scalable on- the-fly query engine on FPGAs to reduce the resource utilization and pipeline interval. We achieve a 450 million compounds-per- second processing throughput for a single query engine. On approximate search using hierarchical navigable small world (HNSW), a popular algorithm with high recall and query speed, we propose an FPGA-based graph traversal engine to utilize high throughput register array based priority queue and fine- grained distance calculation engine to increase the processing capability. Experimental results show that the proposed FPGA- based HNSW implementation achieves a 35× speedup than existing works on CPU. To the best of our knowledge, our FPGA- based implementation is the first attempt to accelerate molecular similarity search on FPGA and has the highest performance among existing approaches.

Peng, Hongwu↗