SEARCH · Engineering Papers

Results for “graph analysis”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 577 records · Page 32

All sources NASA NTRS DOE OSTI

NASA NTRS2001

Electrical Power Distribution and Control Modeling and Analysis

This slide presentation reviews the use of Electrical Power Distribution and Control (EPD&C) Modeling and how modeling can support analysis. The presentation discusses using the EASY5 model to simulate and analyze the Space Shuttle Electric Auxiliary Power Unit. Diagrams of the model schematics are included, as well as graphs of the battery cell impedance, hydraulic load dynamics, and EPD&C response to hydraulic load variations.

Fu, Johnny S.↗

DOE OSTI2025

Benders Decomposition Using Graph Modeling and Multi-Parametric Programming

Benders decomposition is a widely used method for solving large and structured optimization problems, but its performance is affected by the repeated solution of subproblems. We propose a flexible and modular algorithmic framework for accelerating Benders decomposition. Specifically, we express the problem structure by using a graph-theoretic modeling abstraction in which nodes represent optimization subproblems and edges represent connectivity between subproblems. A key innovation of our approach is that we embed multiparametric programming (mp) surrogates for node subproblems, which maps the exact analytical map of the subproblem solution space. The use of mp surrogates allows us to replace subproblem solves with fast look-ups and function evaluations for primal and dual variables during the iterative Benders process. We formally show the equivalence between classical Benders cuts and those derived from the mp solution. We implement our framework in the open-source PlasmoBenders.jl software package. To demonstrate the capabilities of the proposed framework, we apply it to a two-stage stochastic programming problem, which aims to make optimal capacity expansion decisions under market uncertainty. We evaluate both single-cut and multicut variants of Benders decomposition and show that the use of mp surrogates achieves substantial speedups in subproblem solve time, while preserving the convergence guarantees of Benders decomposition. We highlight advantages in solution analysis and interpretability that is enabled by mp critical region tracking; specifically, we show that these reveal how decisions evolve geometrically across the Benders search. Our results aim to demonstrate that combining surrogate modeling with graph modeling offers a promising and extensible foundation for structure-exploiting decomposition. In addition, by decomposing the problem into more tractable subproblems, the proposed approach also aims to overcome scalability issues of mp. Finally, the use of mp surrogates provides a unifying and modular optimization framework that enables the representation of heterogeneous node subproblems as modeling objects with a homogeneous structure.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2023

Topological Relationship–Based Flow Direction Modeling: Mesh–Independent River Networks Representation

River networks are important features in surface hydrology. However, accurately representing river networks in spatially distributed hydrologic and Earth system models is often sensitive to the model's spatial resolution. Specifically, river networks are often misrepresented because of the mismatch between the model's spatial resolution and river network details, resulting in significant uncertainty in the projected flow direction. In this study, we developed a topological relationship-based river network representation method for spatially distributed hydrologic models. This novel method uses (a) graph theory algorithms to simplify real-world vector-based river networks and assist in mesh generation; and (b) a topological relationship-based method to reconstruct conceptual river networks. The main advantages of our method are that (a) it combines the strengths of vector-based and DEM raster-based river network extraction methods; and (b) it is mesh-independent and can be applied to both structured and unstructured meshes. This method paves a path for advanced terrain analysis and hydrologic modeling across different scales.

54 ENVIRONMENTAL SCIENCES↗

NASA NTRS2014

Renewable Energy at NASA's Johnson Space Center

NASA's Johnson Space Center has implemented a great number of renewable energy systems. Renewable energy systems are necessary to research and implement if we humans are expected to continue to grow and thrive on this planet. These systems generate energy using renewable sources - water, wind, sun - things that we will not run out of. Johnson Space Center is helping to pave the way by installing and studying various renewable energy systems. The objective of this report will be to examine the completed renewable energy projects at NASA's Johnson Space Center for a time span of ten years, beginning in 2003 and ending in early 2014. This report will analyze the success of each project based on actual vs. projected savings and actual vs. projected efficiency. Additionally, both positive and negative experiences are documented so that lessons may be learned from past experiences. NASA is incorporating renewable energy wherever it can, including into buildings. According to the 2012 JSC Annual Sustainability Report, there are 321,660 square feet of green building space on JSC's campus. The two projects discussed here are major contributors to that statistic. These buildings were designed to meet various Leadership in Energy and Environmental Design (LEED) Certification criteria. LEED Certified buildings use 30 to 50 percent less energy and water compared to non-LEED buildings. The objectives of this project were to examine data from the renewable energy systems in two of the green buildings onsite - Building 12 and Building 20. In Building 12, data was examined from the solar photovoltaic arrays. In Building 20, data was examined from the solar water heater system. By examining the data from the two buildings, it could be determined if the renewable energy systems are operating efficiently. Objectives In Building 12, the data from the solar photovoltaic arrays shows that the system is continuously collecting energy from the sun, as shown by the graph below. Building 12 has two solar inverters, located on the second floor, that collected the data from the solar photovoltaic arrays. The data displayed here is the total energy produced by the system. These are cumulative amounts, so the last point on the graph shows all of the energy collected from the system since the start of its operation. The data shown here was manually collected from the solar inverters. However, the data is also automatically recorded through EBI. Through analysis of both sets of data it was determined that the EBI data was faulty. For example, from the manually collected data it can be determined that a total of 73 kWh of energy was collected between the dates of 1/16/2014 – 1/22/2014. The EBI data reports that approximately 17800 kWh of energy was collected during the same time frame. Not only does this exceed the time frame examined, but it also exceeds the total energy collected from the start of collection as recorded from the inverters. This leads to the belief that there is a malfunction with the automatic recording of the energy. In Building 20, data was examined from the solar water heater dating back many months and found that the pump for the solar water heater system was not operating properly, as exhibited in the graph shown below. The pump operates on a solar energy system, meaning that it collects energy throughout the day from the sun. Because of this, the system would stop operating shortly after the sun set because of a lack of sunlight. At that point, the graph should show a zero flow rate, but as exhibited in the graph below, that is not the case. It is clearly shown that the pump is continuously operating, even during the night. It was also observed that the majority of the time the pump would not turn on at all, despite good weather conditions. This led to the conclusion that the pump is malfunctioning, and needs to be examined and fixed.

McDowall, Lindsay↗

DOE OSTI2024

Forensic Analysis of SOHO Router Binaries

Small Office/Home Office (SOHO) routers are used by millions of consumers across the United States, and are commensurately vulnerable. Forensic analysis of SOHO router firmware helps to understand and mitigate those vulnerabilities. This poster focused particularly on analysis of BusyBox executables, a software suite that provides several Unix utilities in a single file. Three main tools were used to analyze the binaries. BinWalk was used to extract the files, but also to build entropy graphs, extract Linux kernel images, and identify CPU architectures; WiiBin processed the binaries to find endianness, architecture, the percent compressed/encrypted, and compiler data; and @DisCo, a machine learning tool used to determine function similarity in disassembled binaries, analyzed similarities and determined versions of extracted BusyBox files from each router. These tools found that venders from all five routers utilized the same version of the BusyBox software across different firmware updates, demonstrating the importance of constant firmware scrutiny to protect against security vulnerabilities.

24 POWER TRANSMISSION AND DISTRIBUTION↗

NASA NTRS1999

Tracker: Image-Processing and Object-Tracking System Developed

Tracker is an object-tracking and image-processing program designed and developed at the NASA Lewis Research Center to help with the analysis of images generated by microgravity combustion and fluid physics experiments. Experiments are often recorded on film or videotape for analysis later. Tracker automates the process of examining each frame of the recorded experiment, performing image-processing operations to bring out the desired detail, and recording the positions of the objects of interest. It can load sequences of images from disk files or acquire images (via a frame grabber) from film transports, videotape, laser disks, or a live camera. Tracker controls the image source to automatically advance to the next frame. It can employ a large array of image-processing operations to enhance the detail of the acquired images and can analyze an arbitrarily large number of objects simultaneously. Several different tracking algorithms are available, including conventional threshold and correlation-based techniques, and more esoteric procedures such as "snake" tracking and automated recognition of character data in the image. The Tracker software was written to be operated by researchers, thus every attempt was made to make the software as user friendly and self-explanatory as possible. Tracker is used by most of the microgravity combustion and fluid physics experiments performed by Lewis, and by visiting researchers. This includes experiments performed on the space shuttles, Mir, sounding rockets, zero-g research airplanes, drop towers, and ground-based laboratories. This software automates the analysis of the flame or liquid s physical parameters such as position, velocity, acceleration, size, shape, intensity characteristics, color, and centroid, as well as a number of other measurements. It can perform these operations on multiple objects simultaneously. Another key feature of Tracker is that it performs optical character recognition (OCR). This feature is useful in extracting numerical instrumentation data that are embedded in images. All the results are saved in files for further data reduction and graphing. There are currently three Tracking Systems (workstations) operating near the laboratories and offices of Lewis Microgravity Science Division researchers. These systems are used independently by students, scientists, and university-based principal investigators. The researchers bring their tapes or films to the workstation and perform the tracking analysis. The resultant data files generated by the tracking process can then be analyzed on the spot, although most of the time researchers prefer to transfer them via the network to their offices for further analysis or plotting. In addition, many researchers have installed Tracker on computers in their office for desktop analysis of digital image sequences, which can be digitized by the Tracking System or some other means. Tracker has not only provided a capability to efficiently and automatically analyze large volumes of data, saving many hours of tedious work, but has also provided new capabilities to extract valuable information and phenomena that was heretofore undetected and unexploited.

Klimek, Robert B.↗

DOE OSTI2023

Vectorization of Dynamic Subgraphs via Generative Models (Final Report)

An important class of data analysis tasks stem from comparing subsets of connected records within massive sets of complex relational data. A common approach is to represent each set of connected records with a small graph, or set of data entities (graph vertices) and their relationships (graph edges), and efficient methods to gauge similarity for pairs of graphs are of high interest. This project concentrated on dynamic graphs, where each edge record has an associated timestamp denoting the time of observation. Pre-existing techniques for comparing dynamic graphs concentrate on either computing graph edit distance (number of vertex and edge deletion, addition, and timestamp modifications) or vectorizing the graph with counts of a limited set of dynamic graph motifs (tiny fundamental subgraphs) and computing distances between the vectors. These approaches are less able to see similarities in graphs that are fairly different in size but come from identical graph generation processes. The motif counting approach can be improved for graphs from the same process, but suffers from requiring many types of motifs meaning it is expensive. Moreover, many motifs are not present for small graphs, meaning realizing a a much larger graph came from the same process is difficult.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1976

Noise generated by quiet engine fans. 3: Fan C

A family of fans designed with low noise features was acoustically evaluated, and noise results are documented for a 1.6-pressure-ratio, 472-m/sec (155-ft/sec) tip speed fan. The fan is described and some aerodynamic operating data are given. Far field noise around the fan was measured over a range of operating conditions for a variety of configurations having different arrangements of sound absorbing material in the flow ducts. Complete results of 1.3 octave band analysis of the data are presented in tabular form. Included also are acoustic power spectra and sideline perceived noise levels. Representative 1/3 octave band data are presented graphically, and sample graphs of continuous narrow band spectra are also provided.

Montegan, F. J.↗

NASA NTRS1982

Advanced Very High Resolution Radiometer (AVHRR) data evaluation for use in monitoring vegetation. Volume 1: Channels 1 and 2

Data from the National Oceanic and Atmospheric Administration satellite system (NOAA-6 satellite) were analyzed to study their nonmeteorological uses. A file of charts, graphs, and tables was created form the products generated. It was found that the most useful data lie between pixel numbers 400 and 2000 on a given scan line. The analysis of the generated products indicates that the Gray-McCrary Index can discern vegetation and associated daily and seasonal changes. The solar zenith-angle correction used in previous studies was found to be a useful adjustment to the index. The METSAT system seems best suited for providing large-area analyses of surface features on a daily basis.

Horvath, N. C.↗

NASA NTRS1985

The origin and history of the metal and sulfide components of chondrules

Instrumental and radiochemical neutron activation analysis is used to determine the concentrations of 14 siderophile and other nonlithophilic elements in 31 chondrules from the extremely unequilibrated chondrite Semarkona. The results are presented in tables and graphs, characterized in detail, and compared with the results obtained for lithophile elements in the same samples by Grossman and Wasson (1983). The elements studied are found to be significantly more fractionated than the lithophile elements, with variations in chondrule/whole-rock abundances of up to a factor of 1000, a mean ratio of 0.2, and differences between Ni-rich and Ni-depleted chondrules. It is argued that the metal and sulfides in the chondrules represent the composition of the solar nebula before chondrule formation and already contained the siderophile and chalcophile elements, although some Fe was contained in silicates along with Ni, Co, Au, Ge and Se. The segregation of metals during a molten stage is considered of minor importance.

Grossman, J. N.↗

NASA NTRS1993

Tree Classification Software

This paper introduces the IND Tree Package to prospective users. IND does supervised learning using classification trees. This learning task is a basic tool used in the development of diagnosis, monitoring and expert systems. The IND Tree Package was developed as part of a NASA project to semi-automate the development of data analysis and modelling algorithms using artificial intelligence techniques. The IND Tree Package integrates features from CART and C4 with newer Bayesian and minimum encoding methods for growing classification trees and graphs. The IND Tree Package also provides an experimental control suite on top. The newer features give improved probability estimates often required in diagnostic and screening tasks. The package comes with a manual, Unix 'man' entries, and a guide to tree methods and research. The IND Tree Package is implemented in C under Unix and was beta-tested at university and commercial research laboratories in the United States.

Buntine, Wray↗

NASA NTRS2002

Reducing False Positives in Runtime Analysis of Deadlocks

This paper presents an improvement of a standard algorithm for detecting dead-lock potentials in multi-threaded programs, in that it reduces the number of false positives. The standard algorithm works as follows. The multi-threaded program under observation is executed, while lock and unlock events are observed. A graph of locks is built, with edges between locks symbolizing locking orders. Any cycle in the graph signifies a potential for a deadlock. The typical standard example is the group of dining philosophers sharing forks. The algorithm is interesting because it can catch deadlock potentials even though no deadlocks occur in the examined trace, and at the same time it scales very well in contrast t o more formal approaches to deadlock detection. The algorithm, however, can yield false positives (as well as false negatives). The extension of the algorithm described in this paper reduces the amount of false positives for three particular cases: when a gate lock protects a cycle, when a single thread introduces a cycle, and when the code segments in different threads that cause the cycle can actually not execute in parallel. The paper formalizes a theory for dynamic deadlock detection and compares it to model checking and static analysis techniques. It furthermore describes an implementation for analyzing Java programs and its application to two case studies: a planetary rover and a space craft altitude control system.

Bensalem, Saddek↗

NASA NTRS1990

Object-oriented requirements analysis: A quick tour

Of all the approaches to software development, an object-oriented approach appears to be both the most beneficial and the most popular. The description of the object-oriented approach is presented in the form of the view graphs.

Berard, Edward V.↗

NASA NTRS1993

Performance analysis of a large-grain dataflow scheduling paradigm

A paradigm for scheduling computations on a network of multiprocessors using large-grain data flow scheduling at run time is described and analyzed. The computations to be scheduled must follow a static flow graph, while the schedule itself will be dynamic (i.e., determined at run time). Many applications characterized by static flow exist, and they include real-time control and digital signal processing. With the advent of computer-aided software engineering (CASE) tools for capturing software designs in dataflow-like structures, macro-dataflow scheduling becomes increasingly attractive, if not necessary. For parallel implementations, using the macro-dataflow method allows the scheduling to be insulated from the application designer and enables the maximum utilization of available resources. Further, by allowing multitasking, processor utilizations can approach 100 percent while they maintain maximum speedup. Extensive simulation studies are performed on 4-, 8-, and 16-processor architectures that reflect the effects of communication delays, scheduling delays, algorithm class, and multitasking on performance and speedup gains.

Young, Steven D.↗

DOE OSTI2026

MapsTorch : automatic differentiation for X-ray fluorescence data analysis

X-ray fluorescence (XRF) is a popular spectroscopy technique for elemental analysis. Spectrum fitting and parameter tuning are at the core of XRF analysis and are conventionally manually intensive, especially for synchrotron experiments involving large amounts of diverse samples. This work introduces the automatic differentiation (AD) technique to XRF and an open-source package called MapsTorch. By transforming an analytical model of the XRF spectrum into a differentiable computation graph with AD, MapsTorch enables robust optimization of parameters and elemental intensities. We evaluate MapsTorch by conducting computational experiments on a large number of historical synchrotron XRF datasets and compare its performance with the currently practiced fitting tool NLopt. The results show that MapsTorch consistently achieves high-quality fits and often leads to better fitting quality than NLopt, particularly in tasks such as initial spectrum fitting and elemental intensity refinement. The robust performance of MapsTorch paves the way for developing automated and high-throughput XRF data analysis workflows to handle the increasing data volumes expected from next-generation synchrotron facilities.

X-ray fluorescence↗

DOE OSTI2023

Graph Contractions for Calculating Correlation Functions in Lattice QCD

Computing correlation functions for many-particle systems in Lattice QCD is vital to extract nuclear physics observables like the energy spectrum of hadrons such as protons. However, this type of calculation has long been considered to be very challenging and computing-resource intensive because of the complex nature of a hadron composed of quarks with many degrees of freedom. In particular, a correlation function can be calculated through a sum of all possible pairs of quark contractions, each of which is a batched tensor contraction, dictated by Wick's theorem. Because the number of terms of this sum can be very large for any hadronic system of interest, fast evaluation of the sum faces several challenges: an extremely large number of contractions, a huge memory footprint at runtime, and the speed of tensor contractions. In this paper, we present a Lattice QCD analysis software suite, Redstar, which addresses these challenges by utilizing novel algorithmic and software engineering methods targeting modern computing platforms such as many-core CPUs and GPUs. In particular, Redstar represents every term in the sum of a correlation function by a graph, applies efficient graph algorithms to reduce the number of contractions to lower the cost of computations, and minimizes the total memory footprint. Moreover, Redstar carries out the contractions on either CPUs or GPUs utilizing an internal and highly efficient Hadron contraction library. Specifically, we illustrate some important algorithmic optimizations of Redstar, show various key design features of Hadron library, and present the speedup values due to the optimizations along with performance figures for calculating six correlations functions on four computing platforms.

Chen, Jie↗

DOE OSTI2023

Graph Contractions for Calculating Correlation Functions in Lattice QCD

Chen, Jie↗

DOE OSTI2025

Mesh-based super-resolution of fluid flows with multiscale graph neural networks

A graph neural network (GNN) approach is introduced in this work which enables mesh-based three-dimensional super-resolution of fluid flows. In this framework, the GNN is designed to operate not on the full mesh-based field at once, but on localized meshes of elements (or cells) directly. To facilitate mesh-based GNN representations in a manner similar to spectral (or finite) element discretizations, a baseline GNN layer (termed a message passing layer, which updates local node properties) is modified to account for synchronization of coincident graph nodes, rendering compatibility with commonly used element-based mesh connectivities. Furthermore, the architecture is multiscale in nature, and is comprised of a combination of coarse-scale and fine-scale message passing layer sequences (termed processors) separated by a graph unpooling layer. The coarse-scale processor embeds a query element (alongside a set number of neighboring coarse elements) into a single latent graph representation using coarse-scale synchronized message passing over the element neighborhood, and the fine-scale processor leverages additional message passing operations on this latent graph to correct for interpolation errors. Demonstration studies are performed using hexahedral mesh-based data from Taylor–Green Vortex and backward-facing step flow simulations at Reynolds numbers of 1600 and 3200. Through analysis of both global and local errors, the results ultimately show how the GNN is able to produce accurate super-resolved fields compared to targets in both coarse-scale and multiscale model configurations. Reconstruction errors for fixed architectures were found to increase in proportion to the Reynolds number. Geometry extrapolation studies on a separate cavity flow configuration show promising cross-mesh capabilities of the super-resolution strategy.

Backward-facing step↗