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 217 records · Page 12
All sourcesNASA NTRSDOE OSTI
NASA NTRS1977

Implications of outer-zone radiations on operations in the geostationary region utilizing the AE4 environmental model

The radiation exposure in the region of geostationary orbits is examined in search for means of optimizing human performance. It is found that the use of slightly inclined circular orbits is one means by which exposure and spacesuit thickness requirements can be reduced. Another effective technique is to limit the extravehicular activity to those days when the short term fluctuations result in low exposure. Space-suit shielding approaching 1/2 sq cm or less may be possible by utilizing work stoppages and inclined orbits. If aluminum and other low-atomic-number materials are used to construct the habitat, then excessive wall thicknesses are required. If special bremsstrahlung shielding is used, then the habitat shield may be reduced to as low as 2 g/sq cm. Numerous tables and graphs are presented for future analysis of dose in the geostationary region.

Wilson, J. W.↗
NASA NTRS1985

Control of solidification boundary in continuous casting by asymmetric cooling and mold offset

A solution, developed to obtain solidification-interface shapes for complex situations in which both the ingot cooling and mold geometry are asymmetric, is analyzed. The effect of mold offsett and of unequal ingot side temperatures on the interface shapes is illustrated in graphs. The results of the analysis show how the solidification interface in continuous casting can be controlled by asymmetries in both mold geometry and cooling of the ingot sides.

Siegel, R.↗
NASA NTRS1988

An optical study of stars and dust in the Andromeda galaxy

The distribution of light in M 31 is characterized on the basis of the UBVR surface photometry reported by Walterbos and Kennicutt (1987). The results of the data analysis are presented in extensive graphs, maps, and tables and discussed in detail, considering the outer disk regions, the decomposition into bulge and disk, the global disk and bulge colors, and dust and gas in two spiral arms. Principal findings examined include: (1) position-angle changes at radial distances beyond about 18 kpc (consistent with SW disk warping); (2) a bulge profile well described by an r exp 1/4 power law; (3) a bulge contribution to total light of about 40 percent; (4) increasing blueness in the outer disk (color gradient 0.02 mag/kpc in B-R); (5) an extinction law similar to that for the Galaxy; and (6) a significant correlation between dust and H I distributions.

Walterbos, R. A. M.↗
DOE OSTI2020

Evaluation of Graph Analytics Frameworks Using the GAP Benchmark Suite

The analysis of connected data is an increasingly important application in high-performance computing. Such analyses can reveal fraudulent patterns in financial transactions, optimize telecommunications networks, predict information flow in social networks, etc. However, the landscape of graph analytics is highly diverse. Graph algorithms stress processor architectures differently, and no one graph can represent all topologies. Consequently, no single approach or framework is expected to be optimal for all graph analytics problems. To help make sense of this diverse landscape, we evaluated four approaches to graph analytics: GraphBLAS, Galois, BGL17, GraphIt; and compare them against hand-tuned implementations that take advantage of hardware features on our test platform. Graph- BLAS formulates graph analytics as sparse linear algebra. Galois provides syntactic constructs for data parallelism over irregular data structures. BGL17 is a generic C++ template library for implementing graph algorithms. GraphIt provides a domain- specific language to describe and optimize graph algorithms. We use the GAP Benchmark Suite to establish baseline performance and guide the side-by-side evaluation of each framework. GAP consists of 30 tests: six graph analytics algorithms (breadth- first search, single-source shortest path, PageRank, betweenness centrality, connected components, and triangle counting) run on five graphs, each with different topological characteristics (e.g., high diameter, skewed degree distribution, high average degree). High-performance reference implementations are included for each benchmark algorithm. Because a graph can be loaded into memory a number of ways (e.g., flat file on disk, compressed sparse format, data frames, retrieved from SQL or NoSQL databases), our evaluation focused on computational performance rather than I/O. Our results show the relative strengths of each framework.

Graph algorithms, Benchmarking, shared-memory prog↗
DOE OSTI2022

On the integration of molecular dynamics, data science, and experiments for studying solvent effects on catalysis

Computational workflows that combine molecular dynamics (MD) simulations and emerging data-centric (DC) methods can accelerate the screening and analysis of solvent systems experimentally and computationally. Here, MD simulations provide atomic positions and velocities of reactant, solvent, and catalyst materials that can be manipulated into data representations that in turn can be used by DC techniques to conduct predictive modeling, feature extraction, and experimental design. For liquid-phase catalytic applications, emerging DC techniques such as Convolutional and Graph Neural Networks (CNN/GNN), Topological Data Analysis (TDA), and Active Learning (AL) can leverage MD and experimental data to quickly predict solvent effects on reaction outcomes. For instance, in recent studies, 3D solvent environments obtained with MD have been exploited by CNNs to predict experimental reaction rates for homogeneous acid-catalyzed lignocellulosic processes. In this perspective, we discuss basic principles of DC methods and how these can be combined with MD to enable high-throughput screening of solvent selection for diverse catalysis applications.

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

PersGNN: Applying Topological Data Analysis and Geometric Deep Learning to Structure-Based Protein Function Prediction

Understanding protein structure-function relationships is a key challenge in computational biology, with applications across the biotechnology and pharmaceutical industries. While it is known that protein structure directly impacts protein function, many functional prediction tasks use only protein sequence. In this work, we isolate protein structure to make functional annotations for proteins in the Protein Data Bank in order to study the expressiveness of different structure-based prediction schemes. We present PersGNN - an end-to-end trainable deep learning model that combines graph representation learning with topological data analysis to capture a complex set of both local and global structural features. While variations of these techniques have been successfully applied to proteins before, we demonstrate that our hybridized approach, PersGNN, outperforms either method on its own as well as a baseline neural network that learns from the same information. PersGNN achieves a 9.3% boost in area under the precision recall curve (AUPR) compared to the best individual model, as well as high F1 scores across different gene ontology categories, indicating the transferability of this approach.

Swenson, Nicolas↗
NASA NTRS1988

Multiple directed graph large-class multi-spectral processor

Numerical analysis techniques for the interpretation of high-resolution imaging-spectrometer data are described and demonstrated. The method proposed involves the use of (1) a hierarchical classifier with a tree structure generated automatically by a Fisher linear-discriminant-function algorithm and (2) a novel multiple-directed-graph scheme which reduces the local maxima and the number of perturbations required. Results for a 500-class test problem involving simulated imaging-spectrometer data are presented in tables and graphs; 100-percent-correct classification is achieved with an improvement factor of 5.

Casasent, David↗
DOE OSTI2022

Topological Simplifications of Hypergraphs

Here we study hypergraph visualization via its topological simplification. We explore both vertex simplification and hyperedge simplification of hypergraphs using tools from topological data analysis. In particular, we transform a hypergraph into its graph representations, known as the line graph and clique expansion. A topological simplification of such a graph representation induces a simplification of the hypergraph. In simplifying a hypergraph, we allow vertices to be combined if they belong to almost the same set of hyperedges, and hyperedges to be merged if they share almost the same set of vertices. Our proposed approaches are general and mathematically justifiable, and put vertex simplification and hyperedge simplification in a unifying framework.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Generating and Analyzing Program Call Graphs using Ontology

Call graph or caller-callee relationships have been used for various kinds of static program analysis, performance analysis and profiling, and for program safety or security analysis such as detecting anomalies of program execution or code injection attacks. However, different tools generate call graphs in different formats, which prevents efficient reuse of call graph results. In this paper, we present an approach of using ontology and resource description framework (RDF) to create knowledge graphs for specifying call graphs to facilitate the construction of full-fledged and complex call graphs of computer programs, realizing more interoperable and scalable program analyses than conventional approaches. We create a formal ontology-based specification of call graph information to capture concepts and properties of both static and dynamic call graphs so different tools can collaboratively contribute to more comprehensive analysis results. Our experiments show that ontology enables merging of call graphs generated from different tools and flexible queries using a standard query interface. Index Terms—Callgraph, ontology, knowl

Dorta, E.↗
DOE OSTI2020

Connectivity, Centrality, and Bottleneckedness: On Graph Theoretic Methods for Power Systems

This report provides an introduction to selected graph theoretic topics with pertinence to the structural analysis of electric power grid and communication systems. We focus on methodologies for defining, scoring, and identifying connectivity, spectral, and bottleneckeness properties in graphs, as well as vertex and edge importance measures such as centrality. We apply these measures to power systems and communications graph data, discuss and visualize the results, and comment on computational aspects of these methods. We show that graph theoretic methods can provide useful insights into grid and communication network structure, leading to tools and methods that could be used by electric utility engineers to improve key grid and communication network characteristics, such as resilience and scalability.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

Machine learning for single-ended event reconstruction in PROSPECT experiment

The Precision Reactor Oscillation and Spectrum Experiment, PROSPECT, was a segmented antineutrino detector that successfully operated at the High Flux Isotope Reactor in Oak Ridge, TN, during its 2018 run. Despite challenges with photomultiplier tube base failures affecting some segments, innovative machine learning approaches were employed to perform position and energy reconstruction, and particle classification. This work highlights the effectiveness of convolutional neural networks and graph convolutional networks in enhancing data analysis. By leveraging these techniques, a 3.3% increase in effective statistics was achieved compared to traditional methods, showcasing their potential to improve analysis performance. Furthermore, these machine learning methodologies offer promising applications for other segmented particle detectors, underscoring their versatility and impact.

47 OTHER INSTRUMENTATION↗
DOE OSTI2020

Quantum simulation of hyperbolic space with circuit quantum electrodynamics: From graphs to geometry

We show how quantum many-body systems on hyperbolic lattices with nearest-neighbor hopping and local interactions can be mapped onto quantum field theories in continuous negatively curved space. Here, the underlying lattices have recently been realized experimentally with superconducting resonators and therefore allow for a table-top quantum simulation of quantum physics in curved background. Our mapping provides a computational tool to determine observables of the discrete system even for large lattices, where exact diagonalization fails. As an application and proof of principle we quantitatively reproduce the ground state energy, spectral gap, and correlation functions of the noninteracting lattice system by means of analytic formulas on the Poincaré disk, and show how conformal symmetry emerges for large lattices. This sets the stage for studying interactions and disorder on hyperbolic graphs in the future. Importantly, our analysis reveals that even relatively small discrete hyperbolic lattices emulate the continuous geometry of negatively curved space, and thus can be used to experimentally resolve fundamental open problems at the interface of interacting many-body systems, quantum field theory in curved space, and quantum gravity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Parallel String Graph Construction and Transitive Reduction for De Novo Genome Assembly

One of the most computationally intensive tasks in computational biology is de novo genome assembly, the decoding of the sequence of an unknown genome from redundant and erroneous short sequences. A common assembly paradigm identifies overlapping sequences, simplifies their layout, and creates consensus. Despite many algorithms developed in the literature, the efficient assembly of large genomes is still an open problem. In this work, we introduce new distributed-memory parallel algorithms for overlap detection and layout simplification steps of de novo genome assembly, and implement them in the diBELLA 2D pipeline. Our distributed memory algorithms for both overlap detection and layout simplification are based on linear-algebra operations over semirings using 2D distributed sparse matrices. Our layout step consists of performing a transitive reduction from the overlap graph to a string graph. We provide a detailed communication analysis of the main stages of our new algorithms. diBELLA 2D achieves near linear scaling with over 80% parallel efficiency for the human genome, reducing the runtime for overlap detection by 1.2-1.3× for the human genome and 1.5-1.9× for C.elegans compared to the state-of-the-art. Our transitive reduction algorithm outperforms an existing distributed-memory implementation by 10.5-13.3× for the human genome and 18-29× for the C. elegans. Our work paves the way for efficient de novo assembly of large genomes using long reads in distributed memory.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2020

Quantile-dependent expressivity of postprandial lipemia

“Quantile-dependent expressivity” describes an effect of the genotype that depends upon the level of the phenotype (e.g., whether a subject’s triglycerides are high or low relative to its population distribution). Prior analyses suggest that the effect of a genetic risk score (GRS) on fasting plasma triglyceride levels increases with the percentile of the triglyceride distribution. Postprandial lipemia is well suited for testing quantile-dependent expressivity because it exposes each individual’s genotype to substantial increases in their plasma triglyceride concentrations. Ninety-seven published papers were identified that plotted mean triglyceride response vs. time and genotype, which were converted into quantitative data. Separately, for each published graph, standard least-squares regression analysis was used to compare the genotype differences at time t (dependent variable) to average triglyceride concentrations at time t (independent variable) to assess whether the genetic effect size increased in association with higher triglyceride concentrations and whether the phenomenon could explain purported genetic interactions with sex, diet, disease, BMI, and drugs.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2020

The IsoGenie database: an interdisciplinary data management solution for ecosystems biology and environmental research

Modern microbial and ecosystem sciences require diverse interdisciplinary teams that are often challenged in “speaking” to one another due to different languages and data product types. Here we introduce the IsoGenie Database, a de novo developed data management and exploration platform, as a solution to this challenge of accurately representing and integrating heterogenous environmental and microbial data across ecosystem scales. The IsoGenieDB is a public and private data infrastructure designed to store and query data generated by the IsoGenie Project, a ~10 year DOE-funded project focused on discovering ecosystem climate feedbacks in a thawing permafrost landscape. The IsoGenieDB provides (i) a platform for IsoGenie Project members to explore the project’s interdisciplinary datasets across scales through the inherent relationships among data entities, (ii) a framework to consolidate and harmonize the datasets needed by the team’s modelers, and (iii) a public venue that leverages the same spatially explicit, disciplinarily integrated data structure to share published datasets. The IsoGenieDB is also being expanded to cover the NASA-funded Archaea to Atmosphere (A2A) project, which scales the findings of IsoGenie to a broader suite of Arctic peatlands, via the umbrella A2A Database (A2A-DB). The IsoGenieDB’s expandability and flexible architecture allow it to serve as an example ecosystems database.

54 ENVIRONMENTAL SCIENCES↗