Engineering Papers⌕ Search

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.

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

At least 181 records · Page 10

Supersonic aerodynamics of delta wings

Through the empirical correlation of experimental data and theoretical analysis, a set of graphs has been developed which summarize the inviscid aerodynamics of delta wings at supersonic speeds. The various graphs which detail the aerodynamic performance of delta wings at both zero-lift and lifting conditions were then employed to define a preliminary wing design approach in which both the low-lift and high-lift design criteria were combined to define a feasible design space.

Wood, Richard M.↗

Modeling and analysis of multiprocessor architectures

Some technologies developed for system level modeling and analysis of algorithms/architectures using an architecture design and development system are reviewed. Modeling and analysis is described with attention given to modeling constraints and analysis using constrained software graphs. An example is presented of an ADAS graph and its associated attributes, such as firing delay, token consume rate, token produce rate, firing threshold, firing condition, arc queue lengths, associated C or Ada functional model, and stochastic behavior.

Yalamanchili, S.↗

Program Finds Minimal Cut Sets

CUTSETS computer program identifies all minimal cut sets for given node. Software package contains subprograms that solve for minimal cut sets of fault trees and digraphs by use of object-oriented programming techniques. Cut-set codes used to solve graph models for reliability analysis and identify potential single-point failures in modeled system. Includes utility subprogram that converts popular COD-format diagraph-model-description files into text input files suitable for use with other CUT-SETS subprograms. FEAT (MSC-21873) and FIRM (MSC-21860). Written in C language.

Iverson, D. L.↗

Design tool for multiprocessor scheduling and evaluation of iterative dataflow algorithms

A graph-theoretic design process and software tool is defined for selecting a multiprocessing scheduling solution for a class of computational problems. The problems of interest are those that can be described with a dataflow graph and are intended to be executed repetitively on a set of identical processors. Typical applications include signal processing and control law problems. Graph-search algorithms and analysis techniques are introduced and shown to effectively determine performance bounds, scheduling constraints, and resource requirements. The software tool applies the design process to a given problem and includes performance optimization through the inclusion of additional precedence constraints among the schedulable tasks.

Jones, Robert L., III↗

Dataflow Design Tool: User's Manual

The Dataflow Design Tool is a software tool for selecting a multiprocessor scheduling solution for a class of computational problems. The problems of interest are those that can be described with a dataflow graph and are intended to be executed repetitively on a set of identical processors. Typical applications include signal processing and control law problems. The software tool implements graph-search algorithms and analysis techniques based on the dataflow paradigm. Dataflow analyses provided by the software are introduced and shown to effectively determine performance bounds, scheduling constraints, and resource requirements. The software tool provides performance optimization through the inclusion of artificial precedence constraints among the schedulable tasks. The user interface and tool capabilities are described. Examples are provided to demonstrate the analysis, scheduling, and optimization functions facilitated by the tool.

Jones, Robert L., III↗

High Temperature Dielectric Properties and Differential Scanning Calorimetry of Lunar Simulants

To guide development of microwave process technology that could be used during in situ construction on the Moon, we measured the high-temperature basic dielectric properties (εʹ and εʺ) of 17 lunar simulants and related materials. In order to confidently use these data one needs to understand the data’s strengths and weaknesses. Therefore, a goal of this publication is to provide insights into the comparative effects of sample composition, pre-treatments, experimental variables, high temperatures, and other factors on the measured response. The dielectric measurements were performed using the cavity perturbation method over a temperature range between room temperature to 1000 °C, or higher, and provided the real and imaginary components of permittivity at six frequencies. The utility of the original values was limited by the varying density of the pellets used in the measurement. Therefore, all of the εʹ and εʺ measurements at the frequency of 2466 MHz have been scaled to a constant density, 1.75 g/cm 3 . Here the data are presented as graphs chosen to aid analysis within and across simulant groups. To gain additional insight into the processes happening at the elevated temperatures in the dielectric measurements, heat capacity data was obtained using differential scanning calorimetry (DSC) on several of the simulant materials. Our data show that over the frequency range 397 MHz – 2985 MHz a material’s behavior does not greatly change, as compared to the scale of differences observed between lunar mare and highland simulants at high temperatures. For example at 1000 °C, the mare simulant JSC-1A absorbs 10 times more power than the highland simulant NUW-LHT-5M. We observe that as melting temperatures are reached both permittivity and dielectric loss rise non-linearly, helping to explain thermal runaway during microware heating. Our data show that even less than a few weight % of many non-lunar minerals, and the use of mixtures in simulants can affect the dielectric behavior at higher temperatures. A comparison of our results with published dielectric data for Apollo samples and with remote sensing of the Moon supports the conclusion the simulants and lunar material at room temperature have very similar dielectric values.

Differential Scanning Calorimetry↗

Modern chemical graph theory

Abstract Graph theory has a long history in chemistry. Yet as the breadth and variety of chemical data is rapidly changing, so too do graph encoding methods and analyses that yield qualitative and quantitative insights. Using illustrative cases within a basic mathematical framework, we showcase modern chemical graph theory's utility in Chemists' analysis and model development toolkit. The encoding of both experimental and simulation data is discussed at various levels of granularity of information. This is followed by a discussion of the two major classes of graph theoretical analyses: identifying connectivity patterns and partitioning methods. Measures, metrics, descriptors, and topological indices are then introduced with an emphasis upon enhancing interpretability and incorporation into physical models. Challenging data cases are described that include strategies for studying time dependence. Throughout, we incorporate recent advancements in computer science and applied mathematics that are propelling chemical graph theory into new domains of chemical study. This article is categorized under: Molecular and Statistical Mechanics > Molecular Dynamics and Monte‐Carlo Methods Structure and Mechanism > Computational Materials Science Structure and Mechanism > Molecular Structures

Leite, Leonardo S. G.↗

Computer-aided system design

A technique has been developed for combining features of a systems architecture design and assessment tool and a software development tool. This technique reduces simulation development time and expands simulation detail. The Architecture Design and Assessment System (ADAS), developed at the Research Triangle Institute, is a set of computer-assisted engineering tools for the design and analysis of computer systems. The ADAS system is based on directed graph concepts and supports the synthesis and analysis of software algorithms mapped to candidate hardware implementations. Greater simulation detail is provided by the ADAS functional simulator. With the functional simulator, programs written in either Ada or C can be used to provide a detailed description of graph nodes. A Computer-Aided Software Engineering tool developed at the Charles Stark Draper Laboratory (CSDL CASE) automatically generates Ada or C code from engineering block diagram specifications designed with an interactive graphical interface. A technique to use the tools together has been developed, which further automates the design process.

Walker, Carrie K.↗

Tackling the Challenges in Scene Graph Generation With Local-to-Global Interactions

In this work, we seek new insights into the underlying challenges of the scene graph generation (SGG) task. Quantitative and qualitative analysis of the visual genome (VG) dataset implies: 1) ambiguity: even if interobject relationship contains the same object (or predicate), they may not be visually or semantically similar; 2) asymmetry: despite the nature of the relationship that embodied the direction, it was not well addressed in previous studies; and 3) higher-order contexts: leveraging the identities of certain graph elements can help generate accurate scene graphs. Motivated by the analysis, we design a novel SGG framework, Local-to-global interaction networks (LOGINs). Locally, interactions extract the essence between three instances of subject, object, and background, while baking direction awareness into the network by explicitly constraining the input order of subject and object. Globally, interactions encode the contexts between every graph component (i.e., nodes and edges). Finally, Attract and Repel loss is utilized to fine-tune the distribution of predicate embeddings. By design, our framework enables predicting the scene graph in a bottom-up manner, leveraging the possible complementariness. To quantify how much LOGIN is aware of relational direction, a new diagnostic task called Bidirectional Relationship Classification (BRC) is also proposed. Overall, experimental results demonstrate that LOGIN can successfully distinguish relational direction than existing methods (in BRC task), while showing state-of-the-art results on the VG benchmark (in SGG task).

97 MATHEMATICS AND COMPUTING↗

An uncertainty-aware strategy for plasma mechanism reduction with directed weighted graphs

In this work, we present a framework for the analysis and reduction of plasma mechanisms by means of weighted directed graphs, in which reactions and species are both treated as nodes. The methodology consists of two distinct analyses. The first, which is qualitative, relies on graph spatializations via force-directed algorithms to discover the predominant global patterns in the chemical model. The second ranks the reactions based on their shortest paths' lengths from/to the species of interest and their relative contributions to the power balance. Further, this quantitative investigation enables a strategy for mechanism reduction that is fully automatized, as it does not require any expert knowledge, highly effective, as it generates reduced mechanisms that are highly accurate while relying on a small number of processes, and easily interpretable, as the algorithm justifies the importance of the retained reactions by outputting their related chemical pathways. Additionally, the work proposes a methodology extension that employs ensembles of graphs to improve the robustness of the reduced mechanism to reaction parameter uncertainties. The approach, here tested for steady-state predictions of a plasma system characterizing negative hydrogen ion sources, is general and can be used in a wide variety of applications outside the particular nuclear fusion context demonstrated in this work.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

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.↗

The future evolution of energy-water-agriculture interconnectivity across the US

Abstract Energy, water, and agricultural resources across the globe are highly interconnected. This interconnectivity poses science challenges, such as understanding and modeling interconnections, as well as practical challenges, such as efficiently managing interdependent resource systems. Using the US as an example, this study seeks to define and explore how interconnectivity evolves over space and time under a range of influences. Concepts from graph theory and input–output analysis are used to visualize and quantify key intersectoral linkages using two new indices: the ‘Interconnectivity Magnitude Index’ and the ‘Interconnectivity Spread Index’. Using the Global Change Analysis Model (GCAM-USA), we explore the future evolution of these indices under four scenarios that explore a range of forces, including socioeconomic and technological change. Analysis is conducted at both national and state level spatial scales from 2015 to 2100. Results from a Reference scenario show that resource interconnectivity in the US is primarily driven by water use amongst different sectors, while changes in interconnectivity are driven by a decoupling of the water and electricity systems, as power plants become more water-efficient over time. High population and GDP growth results in relatively more decoupling of sectors, as a larger share of water and energy is used outside of interconnected sector feedback loops. Lower socioeconomic growth results in the opposite trend. Transitioning to a low-carbon economy increases interconnectivity because of the expansion of purpose-grown biomass, which strengthens the connections between water and energy. The results highlight that while some regions may experience similar sectoral stress projections, the composition of the intersectoral connectivity leading to that sectoral stress may call for distinctly different multi-sector co-management strategies. The methodology we introduce here can be applied in diverse geographical and sectoral contexts to enable better understanding of where, when, and how coupling or decoupling between sectors could evolve and be better managed.

Khan, Zarrar (ORCID:0000000281478553)↗

Distortions in memory for visual displays

Systematic errors in perception and memory present a challenge to theories of perception and memory and to applied psychologists interested in overcoming them as well. A number of systematic errors in memory for maps and graphs are reviewed, and they are accounted for by an analysis of the perceptual processing presumed to occur in comprehension of maps and graphs. Visual stimuli, like verbal stimuli, are organized in comprehension and memory. For visual stimuli, the organization is a consequence of perceptual processing, which is bottom-up or data-driven in its earlier stages, but top-down and affected by conceptual knowledge later on. Segregation of figure from ground is an early process, and figure recognition later; for both, symmetry is a rapidly detected and ecologically valid cue. Once isolated, figures are organized relative to one another and relative to a frame of reference. Both perceptual (e.g., salience) and conceptual factors (e.g., significance) seem likely to affect selection of a reference frame. Consistent with the analysis, subjects perceived and remembered curves in graphs and rivers in maps as more symmetric than they actually were. Symmetry, useful for detecting and recognizing figures, distorts map and graph figures alike. Top-down processes also seem to operate in that calling attention to the symmetry vs. asymmetry of a slightly asymmetric curve yielded memory errors in the direction of the description. Conceptual frame of reference effects were demonstrated in memory for lines embedded in graphs. In earlier work, the orientation of map figures was distorted in memory toward horizontal or vertical. In recent work, graph lines, but not map lines, were remembered as closer to an imaginary 45 deg line than they had been. Reference frames are determined by both perceptual and conceptual factors, leading to selection of the canonical axes as a reference frame in maps, but selection of the imaginary 45 deg as a reference frame in graphs.

Tversky, Barbara↗

An ontology-based knowledge graph for representing interactions involving RNA molecules

The "RNA world" represents a novel frontier for the study of fundamental biological processes and human diseases and is paving the way for the development of new drugs tailored to each patient's biomolecular characteristics. Although scientific data about coding and non-coding RNA molecules are constantly produced and available from public repositories, they are scattered across different databases and a centralized, uniform, and semantically consistent representation of the "RNA world" is still lacking. We propose RNA-KG, a knowledge graph (KG) encompassing biological knowledge about RNAs gathered from more than 60 public databases, integrating functional relationships with genes, proteins, and chemicals and ontologically grounded biomedical concepts. To develop RNA-KG, we first identified, pre-processed, and characterized each data source; next, we built a meta-graph that provides an ontological description of the KG by representing all the bio-molecular entities and medical concepts of interest in this domain, as well as the types of interactions connecting them. Finally, we leveraged an instance-based semantically abstracted knowledge model to specify the ontological alignment according to which RNA-KG was generated. RNA-KG can be downloaded in different formats and also queried by a SPARQL endpoint. A thorough topological analysis of the resulting heterogeneous graph provides further insights into the characteristics of the "RNA world". RNA-KG can be both directly explored and visualized, and/or analyzed by applying computational methods to infer bio-medical knowledge from its heterogeneous nodes and edges. The resource can be easily updated with new experimental data, and specific views of the overall KG can be extracted according to the bio-medical problem to be studied.

59 BASIC BIOLOGICAL SCIENCES↗

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.↗

Open Source Software Prevalence Ingest Tool

The OSSP Ingest Tool accepts user-input organizational information, ingests IT/OT asset lists in Excel format, and ingests the associated CycloneDX SBOM's. It then performs analytics demonstrating the ability to answer the follow research questions: o RQ1. Ability to identify all OSS services running on, and all OSS components present within, an OT device o RQ1a: Ability to differentiate multiple versions of the same OSS component within each OT device. o RQ1b: Ability to differentiate running from not-running OSS components. o RQ1c: Ability to differentiate based on the originator of the component, because a supplier may have modified it after retrieval from the upstream software source. o RQ2. Ability to correlate the identity of a single OSS component across multiple OT devices, mitigating common name variations such as differences in capitalization, '-' vs '_', and so on. o RQ3. Ability to perform subset analysis of OSS components across multiple OT devices o RQ3a: Ability to perform subset analysis across OSS libraries, generating density & distribution graphs to identify commonly-used libraries and outliers. o RQ3b: Ability to perform subset analysis of a single OSS library, generating density & distribution by CI sector, by device type, by device make/model, and/or by firmware version. o RQ3c: Ability to perform subset analysis by grouping OSS libraries according to programming language, then overlay with RQ4b. o RQ3d: Ability to perform subset analysis by OSS upstream source, providing insight into degree of modifications performed by suppliers. o RQ4. Ability to identify dependencies (transitive and direct) of each differentiated OSS library within each OT device, and enable RQ1,2,3 iteratively for dependencies. o RQ1. Ability to identify all OSS services running on, and all OSS components present within, an OT device o RQ1a: Ability to differentiate multiple versions of the same OSS component within each OT device. o RQ1b: Ability Page

Kapadia, Shayna [Lawrence Livermore National Labor↗

Temporal Analysis and Scene Change Detection in Multispectral Overhead Imagery

Scene change detection can be a tedious and time consuming process especially when concerning large geographical areas, and the process can be even more cumbersome when analyzing changes in an area over large spans of time. Developing a useful way to help analysts recognize at what points in time significant changes to a scene have occurred can allow them to better focus their efforts in characterizing events. Applications include: Facility monitoring, Construction chronology, Monitoring of vehicle/aircraft activity, Characterization of larger sequences of events. In large areas exceeding hundreds to thousands of square kilometers in size, it can be difficult localizing when scene changes have occurred. Analysts can spend hours going through imagery to try to identify new construction, monitor facility activities, monitor vehicle movement, etc. where the object of interest may only be a few square meters. Our goal is to help cut down this time by giving analysts change maps with hot spots of change, allowing them to focus on regions that have experienced actual change in time frames they're interested in. Additionally, by combining these change maps into layers within a data cube, analysts can examine the change maps from a temporal perspective, allowing events to be characterized over spans of time. By opening the data cube in an imaging software capable of separating the layers, we can analyze the change maps sequentially, allowing us to examine scene changes occurring over time. As an example, we examined overhead imagery from Planet Labs of what appears to be a parking lot on Fort Irwin over the course of a year using ENVI, a geospatial satellite imagery analysis software. Using ENVI, we generate a graph of changes over time, and notice a particular segment near the end of our analysis window where no changes are detected. Examination of the actual satellite imagery reveals that during this time span, the parking lot was empty. This could be due to facility shutdown for maintenance or upgrades, or possibly even total workforce/vehicle fleet movement. Information like this could help analysts better characterize events, as well as to help create clearer timelines in larger sequences of events. Workflow steps: - Collect multiple maps of the same AOI (Area of Interest) during a time span of interest; - Generate change maps from AOI maps; - Generate data cube from change maps. An analyst can use the data cube to help inspect an AOI for activities within a time span of interest. If an event of interest is discovered, the analyst can then refer to the maps corresponding to the appropriate dates and times in the data cube to see precisely what is transpiring. The biggest objective being worked on is improving the change detection methodology employed. We currently use PCA-EM (Principal Component Analysis with Expectation Maximization), but we are currently focusing on implementing IR-MAD (Iteratively Reweighted Multivariate Alteration Detection) to be used in conjunction with PCA-EM in an effort to decrease false positivity and noise in the change maps we generate.

42 ENGINEERING↗