Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “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 271 records · Page 15

Navigation path planning for autonomous aircraft - Voronoi diagram approach

The present technique for generating a search graph depicting topologically unique paths around mountain boundaries at constant altitudes involves a description of mountain boundaries as polygons; the search graph is then generated on the basis of a geometric construct. All nodes and arcs of the search graph are guaranteed to lie in free space, thereby ensuring an autonomous aircraft's avoidance of mountain obstacles. The solution path is generated by searching the graph for the optimal path from a start location to a finish location.

Krozel, Jimmy↗

Advanced software development workstation. Engineering scripting language graphical editor: DRAFT design document

The Engineering Scripting Language (ESL) is a language designed to allow nonprogramming users to write Higher Order Language (HOL) programs by drawing directed graphs to represent the program and having the system generate the corresponding program in HOL. The ESL system supports user generation of HOL programs through the manipulation of directed graphs. The components of this graphs (nodes, ports, and connectors) are objects each of which has its own properties and property values. The purpose of the ESL graphical editor is to allow the user to create or edit graph objects which represent programs.

Source record↗

Simulator for enhanced ATAMM multiprocessing

A simulator is introduced which follows the rules of the enhanced Algorithm to Architecture Mapping Model (ATAMM) multiprocessing strategy. ATAMM is a method for embedding an algorithm into a multiprocessing system in addition to providing system performance prediction capabilities. A discussion of the inner workings of the Architecture Design and Assessment System (ADAS) hosted simulator is introduced to illustrate how the simulator follows the ATAMM rule set. A sample 5-node algorithm graph is given as an example to illustrate: (1) entering of a graph into the simulator and how to run the graph using a graph entry tool; (2) how to analyze the data; and (3) a comparison of the simulation results with the predicted results from ATAMM.

Andrews, Asa M.↗

Simulator for heterogeneous dataflow architectures

A new simulator is developed to simulate the execution of an algorithm graph in accordance with the Algorithm to Architecture Mapping Model (ATAMM) rules. ATAMM is a Petri Net model which describes the periodic execution of large-grained, data-independent dataflow graphs and which provides predictable steady state time-optimized performance. This simulator extends the ATAMM simulation capability from a heterogenous set of resources, or functional units, to a more general heterogenous architecture. Simulation test cases show that the simulator accurately executes the ATAMM rules for both a heterogenous architecture and a homogenous architecture, which is the special case for only one processor type. The simulator forms one tool in an ATAMM Integrated Environment which contains other tools for graph entry, graph modification for performance optimization, and playback of simulations for analysis.

Malekpour, Mahyar R.↗

Learning In networks

Intelligent systems require software incorporating probabilistic reasoning, and often times learning. Networks provide a framework and methodology for creating this kind of software. This paper introduces network models based on chain graphs with deterministic nodes. Chain graphs are defined as a hierarchical combination of Bayesian and Markov networks. To model learning, plates on chain graphs are introduced to model independent samples. The paper concludes by discussing various operations that can be performed on chain graphs with plates as a simplification process or to generate learning algorithms.

Buntine, Wray L.↗

Analysis of Vegetation Within A Semi-Arid Urban Environment Using High Spatial Resolution Airborne Thermal Infrared Remote Sensing Data

High spatial resolution (5 m) remote sensing data obtained using the airborne Thermal Infrared Multispectral Scanner (TIMS) sensor for daytime and nighttime have been used to measure thermal energy responses for 2 broad classes and 10 subclasses of vegetation typical of the Salt Lake City, Utah urban landscape. Polygons representing discrete areas corresponding to the 10 subclasses of vegetation types have been delineated from the remote sensing data and are used for analysis of upwelling thermal energy for day, night, and the change in response between day and night or flux, as measured by the TIMS. These data have been used to produce three-dimensional graphs of energy responses in W/ sq m for day, night, and flux, for each urban vegetation land cover as measured by each of the six channels of the TIMS sensor. Analysis of these graphs provides a unique perspective for both viewing and understanding thermal responses, as recorded by the TIMS, for selected vegetation types common to Salt Lake City. A descriptive interpretation is given for each of the day, night, and flux graphs along with an analysis of what the patterns mean in reference to the thermal properties of the vegetation types surveyed in this study. From analyses of these graphs, it is apparent that thermal responses for vegetation can be highly varied as a function of the biophysical properties of the vegetation itself, as well as other factors. Moreover, it is also seen where vegetation, particularly trees, has a significant influence on damping or mitigating the amount of thermal radiation upwelling into the atmosphere across the Salt Lake City urban landscape. Published by Elsevier Science Ltd.

Quattrochi, Dale A.↗

A Tool for Automatic Data Distribution for CFD Applications on Structured Grids

Development of HPF versions of NPB and ARC3D has shown that HPF provides an efficient, concise way to express parallelism and to organize data traffic. The use of HPF, as noted in the papers, requires an intimate knowledge of the applications and a detailed analysis of data affinity, data movement, and data granularity. To simplify and accelerate the task of developing HPF versions of existing CFD applications we have designed and implemented ADAPT (Automatic Data Alignment and Placement Tool). ADAPT analyzes a CFD application working on a single structured grid and generates HPF TEMPLATE, (RE)DISTRIBUTION, ALIGNMENT, and INDEPENDENT directives. The directives can be generated on the nest level, subroutine level, application level, or on the application interface level. ADAPT annotates an existing CFD FORTRAN application, performing computations on single or multiple grids. On each grid the application is considered as a sequence of operators, each applied to a set of variables defined in a particular grid domain. ADAPT automatically detects implicit operators (i.e., having data dependences) and explicit operators (without data dependences). For parallelization of an explicit operator ADAPT creates a template for the operator domain, aligns arrays used in the operator with the template, distributes the template, and declares the loops over the distributed dimensions as INDEPENDENT. For parallelization of an implicit operator, the distribution of the operator's domain should be consistent with the operator's dependences. Any dependence between sections distributed on different processors would preclude parallelization if the compiler does not have an ability to pipeline computations. If a data distribution is "orthogonal" to the dependences of an implicit operator, then the loop which implements the operator can be declared as INDEPENDENT. ADAPT starts with an analysis of array index expressions of the loop nests. For each pair of arrays referenced in an assignment statement, it generates an arc in the alignment graph and annotates it with an affinity relation. The template, alignment, and distribution directives for a particular loop nest are then derived from a transitive closure of the affinity relation. A compromise of data distributions in different nests and subroutines is achieved by merging annotated alignment graphs for adjacent nests/stibroutine calls in the nest/call graph of the application in the process called distribution lifting. ADAPT has been implemented as a C++ program running in conjunction with a parallelization tool called CAPTools. ADAPT uses the parse tree, interprocedural analysis and application database generated by CAPTools. It also uses the Directed Graph class, initially implemented in p2d2 (parallel debugger oi distributed programs), and some other classes supporting symbolic computations. ADAPT uses data distribution techniques described. ADAPT was tested with ARC3D and the FT benchmark and has demonstrated a code performance within a factor of 1.5 of handwritten versions.

Frumkin, Michael↗

JavaGenes and Condor: Cycle-Scavenging Genetic Algorithms

A genetic algorithm code, JavaGenes, was written in Java and used to evolve pharmaceutical drug molecules and digital circuits. JavaGenes was run under the Condor cycle-scavenging batch system managing 100-170 desktop SGI workstations. Genetic algorithms mimic biological evolution by evolving solutions to problems using crossover and mutation. While most genetic algorithms evolve strings or trees, JavaGenes evolves graphs representing (currently) molecules and circuits. Java was chosen as the implementation language because the genetic algorithm requires random splitting and recombining of graphs, a complex data structure manipulation with ample opportunities for memory leaks, loose pointers, out-of-bound indices, and other hard to find bugs. Java garbage-collection memory management, lack of pointer arithmetic, and array-bounds index checking prevents these bugs from occurring, substantially reducing development time. While a run-time performance penalty must be paid, the only unacceptable performance we encountered was using standard Java serialization to checkpoint and restart the code. This was fixed by a two-day implementation of custom checkpointing. JavaGenes is minimally integrated with Condor; in other words, JavaGenes must do its own checkpointing and I/O redirection. A prototype Java-aware version of Condor was developed using standard Java serialization for checkpointing. For the prototype to be useful, standard Java serialization must be significantly optimized. JavaGenes is approximately 8700 lines of code and a few thousand JavaGenes jobs have been run. Most jobs ran for a few days. Results include proof that genetic algorithms can evolve directed and undirected graphs, development of a novel crossover operator for graphs, a paper in the journal Nanotechnology, and another paper in preparation.

Globus, Al↗

Analysis of Return and Forward Links from STARS' Flight Demonstration 1

Space-based Telemetry And Range Safety (STARS) is a Kennedy Space Center (KSC) led proof-of-concept demonstration, which utilizes NASA's space network of Tracking and Data Relay Satellites (TDRS) as a pathway for launch and mission related information streams. Flight Demonstration 1 concluded on July 15,2003 with the seventh flight of a Low Power Transmitter (LPT) a Command and Data Handler (C&DH), a twelve channel GPS receiver and associated power supplies and amplifiers. The equipment flew on NASA's F-I5 aircraft at the Dryden Flight Research Center located at Edwards Air Force Base in California. During this NASA-ASEE Faculty Fellowship, the author participated in the collection and analysis of data from the seven flights comprising Flight Demonstration 1. Specifically, the author examined the forward and return links bit energy E(sub B) (in Watt-seconds) divided by the ambient radio frequency noise N(sub 0) (in Watts / Hertz). E(sub b)/N(sub 0) is commonly thought of as a signal-to-noise parameter, which characterizes a particular received radio frequency (RF) link. Outputs from the data analysis include the construction of time lines for all flights, production of graphs of range safety values for all seven flights, histograms of range safety E(sub b)/N(sub 0) values in five dB increments, calculation of associated averages and standard deviations, production of graphs of range user E(sub b)/N(sub 0) values for the all flights, production of graphs of AGC's and E(sub b)/N(sub 0) estimates for flight 1, recorded onboard, transmitted directly to the launch head and transmitted through TDRS. The data and graphs are being used to draw conclusions related to a lower than expected signal strength seen in the range safety return link.

Gering, James A.↗

Probabilistic Survivability Versus Time Modeling

This technical paper documents Kennedy Space Centers Independent Assessment team work completed on three assessments for the Ground Systems Development and Operations (GSDO) Program to assist the Chief Safety and Mission Assurance Officer (CSO) and GSDO management during key programmatic reviews. The assessments provided the GSDO Program with an analysis of how egress time affects the likelihood of astronaut and worker survival during an emergency. For each assessment, the team developed probability distributions for hazard scenarios to address statistical uncertainty, resulting in survivability plots over time. The first assessment developed a mathematical model of probabilistic survivability versus time to reach a safe location using an ideal Emergency Egress System at Launch Complex 39B (LC-39B); the second used the first model to evaluate and compare various egress systems under consideration at LC-39B. The third used a modified LC-39B model to determine if a specific hazard decreased survivability more rapidly than other events during flight hardware processing in Kennedys Vehicle Assembly Building (VAB).Based on the composite survivability versus time graphs from the first two assessments, there was a soft knee in the Figure of Merit graphs at eight minutes (ten minutes after egress ordered). Thus, the graphs illustrated to the decision makers that the final emergency egress design selected should have the capability of transporting the flight crew from the top of LC 39B to a safe location in eight minutes or less. Results for the third assessment were dominated by hazards that were classified as instantaneous in nature (e.g. stacking mishaps) and therefore had no effect on survivability vs time to egress the VAB. VAB emergency scenarios that degraded over time (e.g. fire) produced survivability vs time graphs that were line with aerospace industry norms.

Joyner, James J., Sr.↗

Evaluating Mineral Lattices as Evolutionary Proxies for Metalloprotein Evolution

Protein coordinated iron-sulfur clusters drive electron flow within metabolic pathways for organisms throughout the tree of life. It is not known how iron-sulfur clusters were first incorporated into proteins. Structural analogies to iron-sulfde minerals present on early Earth, suggest a connection in the evolution of both proteins and minerals. The availability of large protein and mineral crystallographic structure data sets, provides an opportunity to explore co-evolution of proteins and minerals on a large-scale using informatics approaches. However, quantitative comparisons are confounded by the infnite, repeating nature of the mineral lattice, in contrast to metal clusters in proteins, which are fnite in size. We address this problem using the Niggli reduction to transform a mineral lattice to a fnite, unique structure that when translated reproduces the crystal lattice. Protein and reduced mineral structures were represented as quotient graphs with the edges and nodes corresponding to bonds and atoms, respectively. We developed a graph theory-based method to calculate the maximum common connected edge subgraph (MCCES) between mineral and protein quotient graphs. MCCES can accommodate differences in structural volumes and easily allows additional chemical criteria to be considered when calculating similarity. To account for graph size differences, we use the Tversky similarity index. Using consistent criteria, we found little similarity between putative ancient iron-sulfur protein clusters and iron-sulfur mineral lattices, suggesting these metal sites are not as evolutionarily connected as once thought. We discuss possible evolutionary implications of these findings in addition to suggesting an alternative proxy, mineral surfaces, for better understanding the coevolution of the geosphere and biosphere

Kenneth N. McGuinness↗

Universal Coating by 3D Hybrid Programmable Matter

Motivated by the prospect of nano-robots that assist human physiological functions at the nanoscale, we investigate the coating problem in the three-dimensional model for hybrid programmable matter. In this model, a single agent with strictly limited viewing range and the computational capability of a deterministic finite automaton can act on passive tiles by picking up a tile, moving, and placing it at some spot. The goal of the coating problem is to fill each node of some surface graph of size n with a tile. We first solve the problem on a restricted class of graphs with a single tile type, and then use constantly many tile types to encode this graph in certain surface graphs capturing the surface of 3D objects. Our algorithm requires O(n^2) steps, which is worst-case optimal compared to an agent with global knowledge and no memory restrictions.

programmable matter↗

Formal Verification of Termination Criteria for First-Order Recursive Functions

This paper presents a formalization of several termination criteria for first-order recursive functions. The formalization, which is developed in the Prototype Verification System (PVS), includes the specification and proof of equivalence of semantic termination, Turing termination, size change principle, calling context graphs, and matrix-weighted graphs. These termination criteria are defined on a computational model that consists of a basic functional language called PVS0, which is an embedding of recursive first-order functions. Through this embedding, the native mechanism for checking termination of recursive functions in PVS could be soundly extended with semi-automatic termination criteria such as calling contexts graphs. As a proof of concept, this paper illustrates how such an extension can be implemented using proof strategies based on computational reflection.

Formal Verification↗

Machine Learning for the Validation of Expert-Elicited Causal Risk Diagrams

Exposure to spaceflight poses risk to human health in complex ways. To help manage this risk, the Human Systems Risk Board (HSRB) at the National Aeronautics and Space Administration (NASA) maintains a set of causal diagrams that attempt to explain how spaceflight hazards generate health risks and lead to adverse outcomes both in-mission, immediately post-mission, and over the long term. These causal risk diagrams are formulated as directed acyclic graphs (DAGs) and can function as knowledge graphs of connected risks and outcomes. These DAGs have proven useful for communication, and, through network analysis, have allowed for the identification of structurally important factors in the risk network. However, the utility these DAGs provide is directly proportional to their verisimilitude, making assessment of this trait using empirical data – whether from actual human spaceflight or various spaceflight analogue exposures and model organisms – a high priority. In this research we explore the use of machine learning algorithms to learn DAG structure from empirical data as a means of evaluating human-elicited DAG structures. To do so, we test several different graph structure-learning algorithms on data concerning changes in the bones of rats and mice after exposure to either spaceflight or a spaceflight analogue. We explore potential methods for indexing the similarity between each algorithm’s output DAG with all the others and with that of the expert-elicited DAG. We discuss next steps in this ongoing line of research and open science initiatives underway to complete them.

directed acyclic graphs↗

Developing Concepts of Operations Using Multi-Step Tool Techniques With Large Language Models

The National Aeronautics and Space Administration (NASA) Air Mobility Pathfinders (AMP) project is developing and evaluating concepts of operations (ConOps) for safe, secure, and scalable Urban Air Mobility (UAM) operations. The AMP project’s Operational Concepts, Architecture, and Requirements Integration (OCARI) Team is using a Model Based System Engineering (MBSE) approach for integration, interoperability, and traceability of Advanced Air Mobility (AAM) ecosystems centered around urban air taxi services. The team’s goal is to define structures and behaviors needed for system feasibility, readiness, and interoperability, establish a UAM knowledge base, and trace and validate assumptions and requirements relevant to AAM. NASA Langley Research Center (LaRC) is spearheading an innovative digital engineering approach to integrate, communicate, and facilitate the research of multi-modal transportation systems. The Knowledge-based Digital Platform (KbDP) is a concept being developed that ties the workflows of Project Managers (PM), Principal Investigators (PI), and System Engineers together across organizational boundaries. It does so through the management of an information database defined by mathematical, data science, and system engineering principles. Machine Learning (ML) algorithms play a key role in this concept by extracting meaningful knowledge from relational and graph databases, document repositories, and system artifacts, which the human user leverages to greatly improve the efficiency and effectiveness of their research. Recent advancements in the field of Large Language Models (LLMs), specifically models trained for tool use, such as Command-R , now allow for the reliable implementation of single-step and multi-step tool-centric systems. These techniques provide the LLM with a set of tools, in our case Python functions, that can be called on to answer a much wider range of questions compared to LLMs implemented using a traditional single-source or Retrieval Augmented Generation (RAG) approach. Through this method, the LLM can pull information from multiple data sources, such as relational or graph databases, document repositories, application programming interfaces (APIs), and SysML artifacts depending on the user’s question. The LLM can also output the information in a variety of different formats, using output generation tools, such as CSV, UML, or SysML artifacts. Additionally, tools can be assigned roles and can work together to provide answers to queries in an “agent” like approach, similar to that implemented by Microsoft’s AutoGen framework where different agents can converse with each other to accomplish tasks. Previously, our team developed a chatbot system with “agent like” functionality in the form of different “modes” the user could select from a user interface (UI), this architecture can be seen on the left in figure 1. Three different modes were implemented, the first mode allowed the LLM to utilize the structures and algorithms within a graph database to trace UAM requirements. The second mode gave the LLM access to a vector search capable of providing relevant information from thousands of document pages related to UAM ConOps and requirements. The third mode served as a general assistant where users could enter open-ended questions and custom prompts to utilize the LLM for different use-cases. This system improved the process surrounding generating and analyzing information related to UAM requirements, however, the implementation provided a clunky user experience. Users were required to know what mode to select within the UI in advance before entering their question to the selected tool. Moreover, the different tools were isolated from each other, they lacked bidirectional links that would allow for tools to collaborate to generate better responses. Our team is working on a new architecture, seen on the right in the below figure, with the goal to address many of the UX shortcomings of our original system while improving the accuracy and depth of responses from the LLM. This new system will automatically select the appropriate tool to use based off the user’s question. Each tool will be capable of calling on any of the other tools available to the LLM, resulting in a collaborative pipeline where tools can pass data between other tools until enough data is received to generate an answer to the user’s question. Using a locally deployed, open-source, LLM, the NASA OCARI team, in collaboration with Collins Aerospace, will implement a prototype application that will bridge knowledge across multiple sources to assist System Engineers (SEs) with requirements discovery and tracing, research question and use case identification, and assumption validation. Such a system will also allow SEs to more easily, and intuitively, explore the AAM ecosystem, ultimately improving the efficiency and effectiveness of the SE's research and decision-making processes surrounding ConOps development and validation. In this session, our team will provide a video demonstration of our new prototype architecture in action. We will also present an overview of our prototype system architecture and talk about its advantages over traditional LLM deployments along with how those advantages can provide additional value to the field of System Engineering.

systems engineering↗

Graphical method for analyzing digital computer efficiency

Analysis method utilizes graph-theoretic approach for evaluating computation cost and makes logical distinction between linear graph of a computation and linear graph of a program. It applies equally well to other processes which depend on quatitative edge nomenclature and precedence relationships between edges.

Chan, S. P.↗

The NASA earth resources spectral information system: A data compilation

The NASA Earth Resources Spectral Information System and the information contained therein are described. It contains an ordered, indexed compilation of natural targets in the optical region from 0.3 to 45.0 microns. The data compilation includes approximately 100 rock and mineral, 2600 vegetation, 1000 soil, and 60 water spectral reflectance, transmittance, and emittance curves. Most of the data have been categorized by subject, and the curves in those subject areas have been plotted on a single graph. Those categories with too few curves and miscellaneous categories have been plotted as single-curve graphs. Each graph, composite of single, is fully titled to indicate curve source and is indexed by subject to facilitate user retrieval.

Leeman, V.↗

An Analysis of Texture on Lunar Ground Photos

An experiment was performed in an attempt to evaluate autocorrelation as an indicator of texture using five small patches representing varying distances on each of four lunar photos. Each patch was scanned at 50 micron increments on a 64-level gray scale. Several problems were involved in using the ordinary autocorrelation value but a rougher autocorrelation measure, the percentage of neighboring pairs (at a given lag distance) which fell within one graylevel of one another, yielded very encouraging results. As the distance to the feature decreased, initial slope of the graph of percentage against lag increased, and the general level of the graph decreased. When a crestline was present, the graph tended to continue to decrease at higher lags as well, rather than leveling off after the initial steep slope.

Olson, J. M.↗