Search NASA⌕ Search

SEARCH · Search NASA

Results for “Graph Processing”

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 811 records · Page 45
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Global horizontal spectral irradiance and module spectral response measurements: an open dataset for PV research

This report describes the creation process and final content of a spectral irradiance dataset for Albuquerque, New Mexico accompanied by a set of spectral response measurements for modules deployed at the same location. The spectral irradiance measurements were made using horizontally mounted spectroradiometers; therefore, they represent global horizontal irradiance. The dataset combines non-continuous spectroradiometer and weather measurements from a two-year period into a single calendar year. The data files are accompanied by extensive metadata as well as example calculations and graphs to demonstrate the potential uses of this database. The spectral response measurements were carried out by the National Renewable Energy Laboratory using 12 commercial silicon modules types that are undergoing long-term evaluation at Sandia National Laboratories in Albuquerque.

14 SOLAR ENERGY↗
NASA NTRS1973

Stimulated emission in multiple-photon-pumped xenon and argon excimers.

A pumping process involving the multiphoton absorption of laser radiation at 3547 and 2660 A is employed in the investigation. Typically, about 25% of the incident pumping radiation is absorbed and effective in producing excimer fluorescence. The four cases studied include 2660-A-pumped argon, 2660-A-pumped xenon, 3547-A-pumped xenon, and 3547-A-pumped argon. Results concerning the on-axis and off-axis fluorescence obtained from the excimers are presented in a graph.

Harris, S. E.↗
NASA NTRS2004

Stirling Engine Dynamic System Modeling

The Thermo-Mechanical systems branch at the Glenn Research Center focuses a large amount time on Stirling engines. These engines will be used on missions where solar power is inefficient, especially in deep space. I work with Tim Regan and Ed Lewandowski who are currently developing and validating a mathematical model for the Stirling engines. This model incorporates all aspects of the system including, mechanical, electrical and thermodynamic components. Modeling is done through Simplorer, a program capable of running simulations of the model. Once created and then proven to be accurate, a model is used for developing new ideas for engine design. My largest specific project involves varying key parameters in the model and quantifying the results. This can all be done relatively trouble-free with the help of Simplorer. Once the model is complete, Simplorer will do all the necessary calculations. The more complicated part of this project is determining which parameters to vary. Finding key parameters depends on the potential for a value to be independently altered in the design. For example, a change in one dimension may lead to a proportional change to the rest of the model, and no real progress is made. Also, the ability for a changed value to have a substantial impact on the outputs of the system is important. Results will be condensed into graphs and tables with the purpose of better communication and understanding of the data. With the changing of these parameters, a more optimal design can be created without having to purchase or build any models. Also, hours and hours of results can be simulated in minutes. In the long run, using mathematical models can save time and money. Along with this project, I have many other smaller assignments throughout the summer. My main goal is to assist in the processes of model development, validation and testing.

Nakis, Christopher G.↗
DOE OSTI2021

A Survey: Handling Irregularities in Neural Network Acceleration with FPGAs

In the last decade, Artificial Intelligence (AI) through Deep Neural Networks (DNNs) has penetrated virtually every aspect of science, technology, and business. Many types of DNNs have been and continue to be developed, including Convolutional Neural Networks (CNNs), Recurrent Neural Net- works (RNNs), and Graph Neural Networks (GNNs). The overall problem for all of these Neural Networks (NNs) is that their target applications generally pose stringent constraints on latency and throughput, while also having strict accuracy requirements. There have been many previous efforts in creating hardware to accelerate NNs. The problem designers face is that optimal NN models typically have significant irregularities, making them hardware-unfriendly. In this paper, we first define the problems in NN acceleration by characterizing common irregularities in NN processing into 4 types; then we summarize the existing works that handle the four types of irregularities efficiently using hardware, especially FPGAs; finally, we provide a new vision of next-generation FPGA-based NN acceleration: that the emerging heterogeneity in the next-generation FPGAs is the key to achieving higher performance.

Geng, Tong↗
NASA NTRS1990

Space Data for Crop Management

CROPIX, Inc., formed in 1984 by Frank Lamb, president of the Eastern Oregon Farming Company, monitors primarily potato crops in a 20,000 square mile area of northern Oregon and central Washington. Potatoes are a high value specialty crop that can be more profitable to the farmer if he has advance knowledge of market conditions, knows when to harvest, and when to take it to market. By processing and collecting data collected by the NASA-developed Landsat Earth Resources survey satellites, Lamb is able to provide accurate information on crop acreage and conditions on a more timely basis than the routine estimates by the USDA. CROPIX uses Landsat data to make acreage estimates of crops, and to calculate a field-by-field vegetative index number. CROPIX then distributes to its customers a booklet containing color-coded maps, an inventory of crops, plus data and graphs on crop conditions and other valuable information.

Source record↗
DOE OSTI2018

Random Walk on a Perturbation of the Infinitely-Fast Mixing Interchange Process

We consider a random walk in dimension d≥1 in a dynamic random environment evolving as an interchange process with rate γ>0. We prove that, if we choose γ large enough, almost surely the empirical velocity of the walker X{sub t}/t eventually lies in an arbitrary small ball around the annealed drift. This statement is thus a perturbation of the case γ=+∞ where the environment is refreshed between each step of the walker. We extend three-way part of the results of Huveneers and Simenhaus (Electron J Probab 20(105):42, 2015), where the environment was given by the 1-dimensional exclusion process: (i) We deal with any dimension d≥1; (ii) We treat the much more general interchange process, where each particle carries a transition vector chosen according to an arbitrary law μ; (iii) We show that X{sub t}/t is not only in the same direction of the annealed drift, but that it is also close to it.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Effects of Dead‐End Fractures on Non‐Fickian Transport in Three‐Dimensional Discrete Fracture Networks

Abstract Understanding mechanistic causes of non‐Fickian transport in fractured media is important for many hydrogeologic processes and subsurface applications. This study elucidates the effects of dead‐end fractures on non‐Fickian transport in three‐dimensional (3D) fracture networks. Although dead‐end fractures have been identified as low‐velocity regions that could delay solute transport, the direct relation between dead‐end fractures and non‐Fickian transport has been elusive. We systematically generate a large number of 3D discrete fracture networks with different fracture length distributions and fracture densities. We then identify dead‐end fractures using a novel graph‐based method. The effect of dead‐end fractures on solute residence time maximizes at the critical fracture density of the percolation threshold, leading to strong late‐time tailing. As fracture density increases beyond the percolation threshold, the network connectivity increases, and dead‐end fractures diminish. Consequently, the increase in network connectivity leads to a reduction in the degree of late‐time tailing. We also show that dead‐end fractures can inform about main transport paths, such as the mean tortuosity of particle trajectories. This study advances our mechanistic understanding of solute transport in 3D fracture networks.

58 GEOSCIENCES↗
DOE OSTI2019

STEMDL

The code "STEMDL" provides highly-optimized multi-gpu implementations of DL models of applicability in electron microscopy via the use of mixed-precision arithmetic, native graph construction and evaluation in Tensorflow, and adaptive scaling of learning parameters to avoid numerical instabilities due to reduced precision. STEMDL also uses low-level methods from the Horovod library for gradient communication and reduction and adds an additional optimization by allowing the user to scheduling the gradient reduction operations based on their position within the layers of a neural net. STEMDL provides optimized I/O routines for data staging and data reading/writing in both Tensorflow and Pytorch using multi-processing and asynchronous transfer between host and device. .

Laanait, Nouamane↗
DOE OSTI2019

An Agile Design-to-Simulation Workflow Using a New Conforming Moving Least Squares Method

This report summarizes the accomplishments and challenges of a two year LDRD effort focused on improving design-to-simulation agility. The central bottleneck in most solid mechanics simulations is the process of taking CAD geometry and creating a discretization of suitable quality, i.e., the "meshing" effort. This report revisits meshfree methods and documents some key advancements that allow their use on problems with complex geometries, low quality meshes, nearly incompressible materials or that involve fracture. The resulting capability was demonstrated to be an effective part of an agile simulation process by enabling rapid discretization techniques without increasing the time to obtain a solution of a given accuracy. The first enhancement addressed boundary-related challenges associated with meshfree methods. When using point clouds and Euclidean metrics to construct approximation spaces, the boundary information is lost, which results in low accuracy solutions for non-convex geometries and mate rial interfaces. This also complicates the application of essential boundary conditions. The solution involved the development of conforming window functions which use graph and boundary information to directly incorporate boundaries into the approximation space.

42 ENGINEERING↗
NASA NTRS1973

SD-4060OCPLT4 program, user's guide

A brief description of the Orbit Comparison Plot (OCPLT4) program is presented, along with user information and a source program listing. In addition to correcting several errors that existed in the original program, this program incorporates the following new features: (1) For any satellite whose observations are processed by the Definitive Orbit Determination System (DODS), the orbital uncertainty estimates (OUE) can be obtained via appropriate card input with no major modification to the program. (2) All satellite-related information (e.g., plotter scales, cutoff limits, plotting frequencies) is user controlled via card input. (3) Not all components of OUE must be obtained. The user has the option of obtaining only the radial component if there is no need for the other two components. (4) The altitude and time graph formats are controlled by the user and are not stored for specific satellites.

Glazer, J.↗
NASA NTRS1990

Experiment Document Information System (EDIS) evolution

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

Moorhead, Jane↗
NASA NTRS2005

Safety and Mission Assurance Performance Metric

The safety and mission assurance (S&MA) performance metric is a method that provides a process through which the managers of a large, complex program can readily understand and assess the accepted risk, the problems, and the associated reliability of the program. Conceived for original use in helping to assure the safety and success of the International Space Station (ISS) program, the S&MA performance metric also can be applied to other large and complex programs and projects. The S&MA-performance-metric data products comprise one or more tables (possibly also one or more graphs) that succinctly display all of the information relevant (and no information that is irrelevant) to management decisions that must be made to assure the safety and success of a program or project, thereby facilitating such decisions.

Holsomback, Jerry↗
NASA NTRS2012

HURON (HUman and Robotic Optimization Network) Multi-Agent Temporal Activity Planner/Scheduler

HURON solves the problem of how to optimize a plan and schedule for assigning multiple agents to a temporal sequence of actions (e.g., science tasks). Developed as a generic planning and scheduling tool, HURON has been used to optimize space mission surface operations. The tool has also been used to analyze lunar architectures for a variety of surface operational scenarios in order to maximize return on investment and productivity. These scenarios include numerous science activities performed by a diverse set of agents: humans, teleoperated rovers, and autonomous rovers. Once given a set of agents, activities, resources, resource constraints, temporal constraints, and de pendencies, HURON computes an optimal schedule that meets a specified goal (e.g., maximum productivity or minimum time), subject to the constraints. HURON performs planning and scheduling optimization as a graph search in state-space with forward progression. Each node in the graph contains a state instance. Starting with the initial node, a graph is automatically constructed with new successive nodes of each new state to explore. The optimization uses a set of pre-conditions and post-conditions to create the children states. The Python language was adopted to not only enable more agile development, but to also allow the domain experts to easily define their optimization models. A graphical user interface was also developed to facilitate real-time search information feedback and interaction by the operator in the search optimization process. The HURON package has many potential uses in the fields of Operations Research and Management Science where this technology applies to many commercial domains requiring optimization to reduce costs. For example, optimizing a fleet of transportation truck routes, aircraft flight scheduling, and other route-planning scenarios involving multiple agent task optimization would all benefit by using HURON.

Hua, Hook↗
DOE OSTI2020

Evaluation of Methods for Causal Discovery in Hydrometeorological Systems

Understanding causal relations is of utmost importance in hydrology and climate research for systems identification, prediction, and understanding systems behavior in a changing climate. Traditionally, researchers in hydrometeorology attempted to study causal questions by conducting controlled experiments using numerical models. This approach, however, in most cases of interest provides uncertain results because the models are approximate representation of the natural system. An alternative approach that has recently drawn significant attention in several fields is to infer causal relations from purely observational data. It possesses several traits to its utility particularly in hydrometeorology due to the rapid accumulation of in situ and remotely sensed data records. The first objective of this study is to present a brief description of four causal discovery methods (Granger causality, Transfer Entropy, graph-based algorithms, and Convergent Cross Mapping) with special emphasis on the assumptions on which they are built. Second, using synthetic data generated from a hydrological model, we assess their performance in retrieving causal information taking into account sensitivity to sample size and presence of noise. Last, we use causal analysis to examine and formulate hypotheses on causal drivers of evapotranspiration in a shrubland region during summer and winter seasons. An interpretation of the hypotheses based on canopy seasonal dynamics and evapotranspiration processes is presented. It is hoped that the results presented here can be useful in guiding researchers studying hydrometeorological systems as to which causal method is most appropriate to the characteristics of the system under study.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2022

MOFSimplify, machine learning models with extracted stability data of three thousand metal–organic frameworks

Abstract We report a workflow and the output of a natural language processing (NLP)-based procedure to mine the extant metal–organic framework (MOF) literature describing structurally characterized MOFs and their solvent removal and thermal stabilities. We obtain over 2,000 solvent removal stability measures from text mining and 3,000 thermal decomposition temperatures from thermogravimetric analysis data. We assess the validity of our NLP methods and the accuracy of our extracted data by comparing to a hand-labeled subset. Machine learning (ML, i.e. artificial neural network) models trained on this data using graph- and pore-geometry-based representations enable prediction of stability on new MOFs with quantified uncertainty. Our web interface, MOFSimplify, provides users access to our curated data and enables them to harness that data for predictions on new MOFs. MOFSimplify also encourages community feedback on existing data and on ML model predictions for community-based active learning for improved MOF stability models.

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

High performance Data Driven Agent-based Modeling Framework for Simulation of Commute Mode Choices in Metropolitan Area

Active transportation, human-powered transportation modes such as walking and bicycling, not only reduces the carbon footprint from the transportation sector but also promotes healthy living by offering opportunities for people to build physical activity into their daily routine. To encourage active transportation through urban planning and public campaigns, it is of significant importance to infer factors that substantially influence commuters in their transportation mode choice process. This necessitates a flexible and repeatable tool that can evaluate how a policy is perceived by individual commuters and convert their decisions into macro level understanding. This paper introduces one such effort that is specifically designed for studies of transportation mode choices in metropolitan areas. It provides results from a high-resolution data driven simulation based on high performance computing implementation of the agent-based model framework for home-to-work commute trips. The framework uses a graph-partition based technique that can leverage the interaction structure of agents within a geographic proximity and can boost the simulation execution time. Further, based on a flexible design, it can run ABM with different levels of computing resources-from multi core workstations to an HPC grid. The framework has been tested on the Titan Cray XK7 supercomputer of the Oak Ridge Leadership Computing Facility.

Park, Byung↗
DOE OSTI2019

Parsl: Pervasive Parallel Programming in Python

High-level programming languages such as Python are increasingly used to provide intuitive interfaces to libraries written in lower-level languages and for assembling applications from various components. This migration towards orchestration rather than implementation, coupled with the growing need for parallel computing (e.g., due to big data and the end of Moore's law), necessitates rethinking how parallelism is expressed in programs. Here, we present Parsl, a parallel scripting library that augments Python with simple, scalable, and flexible constructs for encoding parallelism. These constructs allow Parsl to construct a dynamic dependency graph of components that it can then execute efficiently on one or many processors. Parsl is designed for scalability, with an extensible set of executors tailored to different use cases, such as low-latency, high-throughput, or extreme-scale execution. We show, via experiments on the Blue Waters supercomputer, that Parsl executors can allow Python scripts to execute components with as little as 5 ms of overhead, scale to more than 250000 workers across more than 8000 nodes, and process upward of 1200 tasks per second. Other Parsl features simplify the construction and execution of composite programs by supporting elastic provisioning and scaling of infrastructure, fault-tolerant execution, and integrated wide-area data management. We show that these capabilities satisfy the needs of many-task, interactive, online, and machine learning applications in fields such as biology, cosmology, and materials science.

parallel programming↗
NASA NTRS2003

Analysis of ETMS Data Quality for Traffic Flow Management Decisions

The data needed for air traffic flow management decision support tools is provided by the Enhanced Traffic Management System (ETMS). This includes both the tools that are in current use and the ones being developed for future deployment. Since the quality of decision support provided by all these tools will be influenced by the quality of the input ETMS data, an assessment of ETMS data quality is needed. Motivated by this desire, ETMS data quality is examined in this paper in terms of the unavailability of flight plans, deviation from the filed flight plans, departure delays, altitude errors and track data drops. Although many of these data quality issues are not new, little is known about their extent. A goal of this paper is to document the magnitude of data quality issues supported by numerical analysis of ETMS data. Guided by this goal, ETMS data for a 24-hour period were processed to determine the number of aircraft with missing flight plan messages at any given instant of time. Results are presented for aircraft above 18,000 feet altitude and also at all altitudes. Since deviation from filed flight plan is also a major cause of trajectory-modeling errors, statistics of deviations are presented. Errors in proposed departure times and ETMS-generated vertical profiles are also shown. A method for conditioning the vertical profiles for improving demand prediction accuracy is described. Graphs of actual sector counts obtained using these vertical profiles are compared with those obtained using the Host data for sectors in the Fort Worth Center to demonstrate the benefit of preprocessing. Finally, results are presented to quantify the extent of data drops. A method for propagating track positions during ETMS data drops is also described.

Chatterji, Gano B.↗