Search NASA⌕ Search

SEARCH · Search NASA

Results for “static graph”

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 55 records · Page 3

Rolling flow wind tunnel tests of F-18 aircraft

The lateral directional characteristics of an F-18 aircraft was investigated. Aerodynamic derivatives associated with pure roll rate, or the 'p' derivatives were obtained. The model is described and the procedures used to obtain and correct the data, and a graphical presentation of the results are presented. These results include graphs of the lateral directional static stability derivatives versus angle of attack, and the lateral directional force and moment coefficients versus nondimensional roll rate. Results are presented for several configurations including complete, complete without vertical tails, complete without horizontal tails, fuselage wing and fuselage alone. Each of these configuations was tested with and without wing leading edge extensions. The basic control surfaces were deflected and the results were investigated.

Lutze, F. H.↗

An experimental study of the lift, drag and static longitudinal stability for a three lifting surface configuration

The experimental procedure and aerodynamic force and moment measurements for wind tunnel testing of the three lifting surface configuration (TLC) are described. The influence of nonelliptical lift distributions on lift, drag, and static longitudinal stability are examined; graphs of the lift coefficient versus angle of attack, the pitching moment coefficient, drag coefficient, and lift to drag ratio versus lift coefficient are provided. The TLC data are compared with the conventional tail-aft configuration and the canard-wing configuration; it is concluded that the TLC has better lift and high-lift drag characteristics, lift to drag ratio, and zero-lift moments than the other two configurations. The effects of variations in forward and tail wind incidence angles, gap, stagger, and forward wind span on the drag, lift, longitudinal stability, and zero-lift moments of the configuration are studied.

Ostowari, C.↗

Mechanisms of Rotating Instability in Axial Compressors Investigated

Rotating instability is a phenomenon that occurs in the tip flow region of axial compressor stages during stable operation. It can be observed in highly staggered rotors with significant tip clearance and is strongest at high-load operating points where the characteristic levels off. In this condition, the single-stage fan under investigation radiates an audible, whistling tone, and wall pressure spectra in the vicinity of the rotor disk exhibit nonrotational components. The graph shows the spectrum of static pressure at a point on the endwall near the leading edge. A hump appears at roughly half of the blade passing frequency (BPF) and is characteristic of rotating instability. A computational model was developed at the NASA Glenn Research Center to investigate the mechanism behind this phenomenon. A three-dimensional steady Navier-Stokes code that has been successfully tested for a wide range of turbomachinery flows was modified to execute a time-accurate simulation of the full annulus of the compressor. At the inlet of the computational domain, the total pressure, total temperature, and two velocity components are specified. Since no unsteady measurements of static pressure or other flow variables were available downstream of the rotor, circumferentially averaged static pressure was specified on the shroud at the outlet of the computational domain. A three-dimensional view of the vortex from the numerical model is shown. Particle traces released near the leading edge tip have rolled up to illustrate the tip clearance vortex. Flow near the trailing edge is pushed forward by the axially reversed flow. It then interacts with the tip clearance flow and the incoming flow and results in the rotating instability vortex, the core of which is illustrated by total pressure shading on planes located successively downstream. The rotating instability vortex is formed periodically midway between the blades and moves toward the pressure side of the passage. The unsteady behavior of this vortex structure is the main mechanism of the rotating instability is shown. The numerical model can be used to detect any possible occurrence of rotating instability when the tip clearance increases during engine service.

Hah, Chunill↗

GPU-Based Static Data-Flow Analysis for Fast and Scalable Android App Vetting

Many popular vetting tools for Android applications use static code analysis techniques. In particular, Interprocedural Data-Flow Graph (IDFG) construction is the computation at the core of Android static data-flow analysis and consumes most of the analysis time. Many analysis tools use a worklist algorithm, an iterative fixed-point approach, to construct the IDFG. In this paper, we observe that a straightforward GPU parallelization of the worklist algorithm leads to significant underutilization of the GPU resources. We identify four performance bottlenecks, namely, frequent dynamic memory allocations, high branch divergence, workload imbalance, and irregular memory access patterns. Accordingly, we propose GDroid, a GPU-based worklist algorithm implementation with multiple fine-grained optimizations tailored to common characteristics of Android applications. The optimizations considered are: matrix-based data structure, memory access-based node grouping, and worklist merging. Our experimental evaluation, performed on 1000 Android applications, shows that the proposed optimizations are beneficial to performance, and GDroid can achieve up to 128X speedups against a plain GPU implementation.

Android security↗

Reduced-Order Models of Static Power Grids based on Spectral Clustering

For large-scale interconnected power systems that cover large geographical areas, certain electrical studies are required so that appropriate decisions ensure system reliability and low cost. For such studies, it is often neither practical nor necessary to model in detail the entire power system, which is increasingly complex due to a more diverse range of grid assets to choose from in both short and long-term planning. The goal of this paper is to present a methodology to reduce the order of large-scale power networks based on spectral graph theory given that current methods for static network reduction are not scalable. A brief analysis of some spectral clustering properties to determine which graph Laplacian matrix should be used and why is included. The analysis shows that the utilization of the normalized graph Laplacian is more advantageous for clustering purposes. Techniques are proposed to approximate cost functions for the aggregated generators. This is done via linear regression. The reduced-order model obtained with the proposed methodology has an accuracy above 94% and solves the scalability issue commonly present in other reduction methods. If the utilization of the reduced-order model is either constrained to load levels above mid-peak demand, or cost functions of aggregated units are approximated via a piecewise quadratic approach, then the error distribution is in the order of 10^-3. .

Baquedano-Aguilar, Mario D.↗

Software Development for SonicSonde Instrumentation Suite

The SonicSonde is an innovative weather instrumentation suite for boundary layer sampling. Software development included creating a graphical user interface (GUI) to receive, process, archive, and display data in real-time. Targeted at the Windows operating system but with multi-platform extensibility in mind, the GUI was developed using Qt 5.14 in C++. A key design consideration was to allow for tailored displays and analysis while also permitting additional sensors to be added to the platform. As such, the application relies heavily on flexible interfaces and multithreading processing for capturing, modelling, and plotting data. The object-oriented nature of Qt made it ideal for this purpose. The application supports input through live serial streams and static .csv or .dat files, custom meteorological graphs, and user-dictated panel views and output intervals. Additionally, the GUI displays real-time information about the state of the instrument. The versatility of the SonicSonde will allow meteorologists and researchers to perform or better support a variety of aeronautic and atmospheric missions.

meterology↗

LSAFE: a Lightweight Static Analysis Framework for binary Executables

Static analysis is a widely used technique for analyzing various aspects of programs. However, as programs become more complex, static analysis tools require larger resources, such as CPU time and memory, to perform the same tasks. Moreover, the source code of programs may not always be accessible, requiring static analysis to be performed on the binary executable code directly. To overcome these challenges, we propose a lightweight static analysis framework called LSAFE, which constructs control flow graphs (CFGs) and data dependency graphs (DDGs) of target programs with optimized performance in terms of CPU and memory usage. We evaluated the proposed framework using both Spec benchmark programs and real-world industrial applications, and found that it outperformed Angr, an existing state-of-the-art static analysis tool. Additionally, we demonstrate a case study that utilizes the CFG generated by LSAFE to detect memory leaks.

Qu, Guangzhi↗

Curved flow wind tunnnel test of F-18 aircraft

The curved flow capability of a stability wind tunnel was used to investigate the lateral directional characteristics of an F-18 aircraft. The model is described and the procedures used to obtain and correct the data and a graphical presentation of the results are presented. The results include graphs of lateral directional derivatives versus sideslip or static plots, the lateral directional static stability derivatives versus angle of attack, and finally the lateral directional derivatives versus nondimensional yaw rate for different angles of attack and sideslip. Results are presented for several configurations including complete, complete without vertical tails, complete without horizontal tails, fuselage wing and fuselage alone. Each of these were tested with and without wing leading edge extensions.

Lutze, F. H.↗

pnnl/SLiCE

Subgraph Based Learning of Contextual Embedding a framework bridging static representation learning methods using global information from the entire graph with localized attention driven mechanisms to learn contextual node representations.

Ham, Colby↗

From computer images to video presentation: Enhancing technology transfer

With NASA placing increased emphasis on transferring technology to outside industry, NASA researchers need to evaluate many aspects of their efforts in this regard. Often it may seem like too much self-promotion to many researchers. However, industry's use of video presentations in sales, advertising, public relations and training should be considered. Today, the most typical presentation at NASA is through the use of vu-graphs (overhead transparencies) which can be effective for text or static presentations. For full blown color and sound presentations, however, the best method is videotape. In fact, it is frequently more convenient due to its portability and the availability of viewing equipment. This talk describes techniques for creating a video presentation through the use of a combined researcher and video professional team.

Beam, Sherilee F.↗

PANTHER. Pattern ANalytics To support High-performance Exploitation and Reasoning.

Sandia has approached the analysis of big datasets with an integrated methodology that uses computer science, image processing, and human factors to exploit critical patterns and relationships in large datasets despite the variety and rapidity of information. The work is part of a three-year LDRD Grand Challenge called PANTHER (Pattern ANalytics To support High-performance Exploitation and Reasoning). To maximize data analysis capability, Sandia pursued scientific advances across three key technical domains: (1) geospatial-temporal feature extraction via image segmentation and classification; (2) geospatial-temporal analysis capabilities tailored to identify and process new signatures more efficiently; and (3) domain- relevant models of human perception and cognition informing the design of analytic systems. Our integrated results include advances in geographical information systems (GIS) in which we discover activity patterns in noisy, spatial-temporal datasets using geospatial-temporal semantic graphs. We employed computational geometry and machine learning to allow us to extract and predict spatial-temporal patterns and outliers from large aircraft and maritime trajectory datasets. We automatically extracted static and ephemeral features from real, noisy synthetic aperture radar imagery for ingestion into a geospatial-temporal semantic graph. We worked with analysts and investigated analytic workflows to (1) determine how experiential knowledge evolves and is deployed in high-demand, high-throughput visual search workflows, and (2) better understand visual search performance and attention. Through PANTHER, Sandia's fundamental rethinking of key aspects of geospatial data analysis permits the extraction of much richer information from large amounts of data. The project results enable analysts to examine mountains of historical and current data that would otherwise go untouched, while also gaining meaningful, measurable, and defensible insights into overlooked relationships and patterns. The capability is directly relevant to the nation's nonproliferation remote-sensing activities and has broad national security applications for military and intelligence- gathering organizations.

58 GEOSCIENCES↗

An Automated Method for Identifying Inconsistencies within Diagrammatic Software Requirements Specifications

The development of large-scale, composite software in a geographically distributed environment is an evolutionary process. Often, in such evolving systems, striving for consistency is complicated by many factors, because development participants have various locations, skills, responsibilities, roles, opinions, languages, terminology and different degrees of abstraction they employ. This naturally leads to many partial specifications or viewpoints. These multiple views on the system being developed usually overlap. From another aspect, these multiple views give rise to the potential for inconsistency. Existing CASE tools do not efficiently manage inconsistencies in distributed development environment for a large-scale project. Based on the ViewPoints framework the WHERE (Web-Based Hypertext Environment for requirements Evolution) toolkit aims to tackle inconsistency management issues within geographically distributed software development projects. Consequently, WHERE project helps make more robust software and support software assurance process. The long term goal of WHERE tools aims to the inconsistency analysis and management in requirements specifications. A framework based on Graph Grammar theory and TCMJAVA toolkit is proposed to detect inconsistencies among viewpoints. This systematic approach uses three basic operations (UNION, DIFFERENCE, INTERSECTION) to study the static behaviors of graphic and tabular notations. From these operations, subgraphs Query, Selection, Merge, Replacement operations can be derived. This approach uses graph PRODUCTIONS (rewriting rules) to study the dynamic transformations of graphs. We discuss the feasibility of implementation these operations. Also, We present the process of porting original TCM (Toolkit for Conceptual Modeling) project from C++ to Java programming language in this thesis. A scenario based on NASA International Space Station Specification is discussed to show the applicability of our approach. Finally, conclusion and future work about inconsistency management issues in WHERE project will be summarized.

Zhang, Zhong↗

Spike-based graph centrality measures

We derive several spike-based routines that compute or establish bounds on radial centrality measures for undirected graphs and trees without the use of matrix multiplication. These spike-based centrality measures utilize a direct embedding of graph nodes and edges into neurons and synapses, can be implemented with static synapses or plastic synapses, and rely on minimal post-processing of spike rasters. This work contributes to the growing set of graphical applications for neuromorphic hardware.

Hamilton, Kathleen↗

Adaptive Runtime Features For Distributed Graph Algorithms

Performance of distributed graph algorithms can benefit greatly by forming rapport between algorithmic abstraction and the underlying runtime system that is responsible for scheduling work and exchanging messages. However, due to their dynamic and irregular nature of computation, distributed graph algorithms written in different programming models impose varying degree of workload pressure on the runtime. To cope with such vastly different workload characteristics, a runtime has to make several trade-offs. One such trade-off arises, for example, when the runtime scheduler has to choose among alternatives such as whether to execute algorithmic work, or progress the network by probing network buffers, or throttle sending messages (termed flow control). This tradeoff decides between optimizing the throughput of a runtime scheduler by increasing the rate of execution of algorithmic work, and reducing the latency of the network messages. Another trade-off exists when a decision has to be made about when to send aggregated messages in buffers (message coalescing). This decision chooses between trading off latency for network bandwidth and vice versa. At any instant, such trade-offs emphasize either on improving the quantity of work being executed (by maximizing the scheduler throughput) or on improving the quality of work (by prioritizing better work). However, encoding static policies for different runtime features (such as flow control, coalescing) can prevent graph algorithms from achieving their full potential, thus can undermine the actual performance of a distributed graph algorithm . In this paper, we investigate runtime support for distributed graph algorithms in the context of two paradigms: variants of wellknown Bulk-Synchronous Parallel model and asynchronous programming model. We explore generic runtime features such as message coalescing (aggregation) and flow control and show that execution policies of these features need to be adjusted over time to make a positive impact on the execution time of a distributed graph algorithm. Since synchronous and asynchronous graph algorithms have different workload characteristics, not all of such runtime features may be good candidates for adaptation. Each of these algorithmic paradigms may require different set of features to be adapted over time. We demonstrate which set of feature(s) can be useful in each case to achieve the right balance of work in the runtime layer. Existing implementation of different graph algorithms can benefit from adapting dynamic policies in the underlying runtime.

Firoz, Jesun S.↗

Harnessing distributed GPU computing for generalizable graph convolutional networks in power grid reliability assessments

Although machine learning (ML) has emerged as a powerful tool for rapidly assessing grid contingencies, prior studies have largely considered a static grid topology in their analyses. This limits their application, since they need to be re-trained for every new topology. Here, this paper explores the development of generalizable graph convolutional network (GCN) models by pre-training them across a range of grid topologies and contingency types. We found that a GCN model with auto-regressive moving average (ARMA) layers with a line graph representation of the grid offered the best predictive performance in predicting voltage magnitudes (VM) and voltage angles (VA). We introduced the concept of phantom nodes to consider disparate grid topologies with a varying number of nodes and lines. For pre-training the GCN ARMA model across a variety of topologies, distributed graphics processing unit (GPU) computing afforded us significant training scalability. The predictive performance of this model on grid topologies that were part of the training data is substantially better than the direct current (DC) approximation. Although direct application of the pre-trained model to topologies that are not part of the grid is not particularly satisfactory, fine-tuning with small amounts of data from a specific topology of interest significantly improves predictive performance. In general, this paper highlights the feasibility of training large-scale GNN models to assess the reliability of power grids by considering a wide variety of grid topologies and contingency types. With the advent of foundational models in ML and the exponential increase in GPU computing clusters, generalizable ML models will significantly enhance how utilities manage power systems and make decisions in real-time or near-real-time.

24 - POWER TRANSMISSION AND DISTRIBUTION↗

Methods for Dynamic Analysis of Distribution Feeders with High Penetration of PV Generators

An increase in the number of inverter-interfaced photovoltaic (PV) generators on existing distribution feeders affects the design, operation, and control of the distribution systems. Existing distribution system analysis tools are capable of supporting only snapshot and quasi-static analyses. Capturing the dynamic effects of PV generators during the variation in distribution system states is necessary when studying the effects of controller bandwidths, multiple voltage correction devices, and anti-islanding. This work explores the use of dynamic phasors and differential algebraic equations (DAE) for impact analysis of PV generators on the existing distribution feeders.

14 SOLAR ENERGY↗

Algorithms for Automatic Alignment of Arrays

Aggregate data objects (such as arrays) are distributed across the processor memories when compiling a data-parallel language for a distributed-memory machine. The mapping determines the amount of communication needed to bring operands of parallel operations into alignment with each other. A common approach is to break the mapping into two stages: an alignment that maps all the objects to an abstract template, followed by a distribution that maps the template to the processors. This paper describes algorithms for solving the various facets of the alignment problem: axis and stride alignment, static and mobile offset alignment, and replication labeling. We show that optimal axis and stride alignment is NP-complete for general program graphs, and give a heuristic method that can explore the space of possible solutions in a number of ways. We show that some of these strategies can give better solutions than a simple greedy approach proposed earlier. We also show how local graph contractions can reduce the size of the problem significantly without changing the best solution. This allows more complex and effective heuristics to be used. We show how to model the static offset alignment problem using linear programming, and we show that loop-dependent mobile offset alignment is sometimes necessary for optimum performance. We describe an algorithm with for determining mobile alignments for objects within do loops. We also identify situations in which replicated alignment is either required by the program itself or can be used to improve performance. We describe an algorithm based on network flow that replicates objects so as to minimize the total amount of broadcast communication in replication.

Chatterjee, Siddhartha↗

Memristive networks: From graph theory to statistical physics

In this work, we provide an introduction to a very specific toy model of memristive networks, for which an exact differential equation for the internal memory which contains the Kirchhoff laws is known. In particular, we highlight how the circuit topology enters the dynamics via an analysis of directed graph. We try to highlight in particular the connection between the asymptotic states of memristors and the Ising model, and the relation to the dynamics and statics of disordered systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗