Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “graph states”

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 739 records · Page 41
All sourcesNASA NTRSDOE OSTI
NASA NTRS2004

Geographic Information Systems and Web Page Development

The Facilities Engineering and Architectural Branch is responsible for the design and maintenance of buildings, laboratories, and civil structures. In order to improve efficiency and quality, the FEAB has dedicated itself to establishing a data infrastructure based on Geographic Information Systems, GIs. The value of GIS was explained in an article dating back to 1980 entitled "Need for a Multipurpose Cadastre which stated, "There is a critical need for a better land-information system in the United States to improve land-conveyance procedures, furnish a basis for equitable taxation, and provide much-needed information for resource management and environmental planning." Scientists and engineers both point to GIS as the solution. What is GIS? According to most text books, Geographic Information Systems is a class of software that stores, manages, and analyzes mapable features on, above, or below the surface of the earth. GIS software is basically database management software to the management of spatial data and information. Simply put, Geographic Information Systems manage, analyze, chart, graph, and map spatial information. At the outset, I was given goals and expectations from my branch and from my mentor with regards to the further implementation of GIs. Those goals are as follows: (1) Continue the development of GIS for the underground structures. (2) Extract and export annotated data from AutoCAD drawing files and construct a database (to serve as a prototype for future work). (3) Examine existing underground record drawings to determine existing and non-existing underground tanks. Once this data was collected and analyzed, I set out on the task of creating a user-friendly database that could be assessed by all members of the branch. It was important that the database be built using programs that most employees already possess, ruling out most AutoCAD-based viewers. Therefore, I set out to create an Access database that translated onto the web using Internet Explorer as the foundation. After some programming, it was possible to view AutoCAD files and other GIS-related applications on Internet Explorer, while providing the user with a variety of editing commands and setting options. I was also given the task of launching a divisional website using Macromedia Flash and other web- development programs.

Reynolds, Justin↗
NASA NTRSDate not supplied

QuantifyML: How good is my machine learning model?

This paper presents an approach, QuantifyML, which employs model counting to assess the learnability and robustness of machine learning models. Typically the efficacy of machine learning models is determined by computing their accuracy statistically on test data sets. However, this may be misleading, if the test data is not representative of the problem that is being studied. Further, two different models may have the same accuracy on a given data set, measured statistically, but may be very different in their behavior on unseen data. Also, models with high accuracy could have poor adversarial robustness. In QuantifyML, our goal is to precisely quantify the extent to which machine learning models have learned and generalized from the given data. In QuantifyML, a trained model is translated into a C program, which is fed to the CBMC model checking tool to produce a formula in Conjunctive Normal Form (CNF), which in turn is analyzed with state-of-the-art model counters to efficiently obtain precise counts w.r.t different outputs. QuantifyML enables i) evaluating the learnability of models by comparing the counts for the outputs to ground truth, expressed as logical predicates (if available), ii) comparing the performance of different models that may be built with different machine learning algorithms (e.g., decision-trees vs. neural networks), and iii) quantifying the robustness of trained models around given inputs. Our evaluation demonstrates these applications of QuantifyML on decision trees and neural networks trained to learn relational properties of graphs, for which we know the ground truth, and to perform image classification, for which we do not have the ground truth, but we can quantify local robustness.

Deep Neural Networks↗
DOE OSTI2025

The Analysis Description Language Ecosystem: Latest developments and physics applications

We present latest developments in Analysis Description Language (ADL), a declarative domain-specific language describing the physics algorithm of a HEP data analysis decoupled from software frameworks. Analyses written in ADL can be integrated into any framework for various tasks. ADL is a multipurpose construct with uses ranging from analysis design to preservation, reinterpretation, queries, visualisation, combination, etc. The most advanced infrastructure to execute ADL on events is the CutLang runtime interpreter. Recent technical developments include an automated interface with different data types, generation of the abstract syntax tree, a visualization tool that that auto-converts analysis flows to graphs, incorporation of trained machine learning models and a Jupyter-based plotting tool. We also report physics implications including a large scale LHC analysis implementation and validation effort for beyond the standard model reinterpretation purposes and studies with ATLAS and CMS open data.

Sekmen, Sezen [Kyungpook National Univ., Daegu (Ko↗
DOE OSTI2025

Feynman path integrals for discrete-variable systems: Walks on Hamiltonian graphs

We propose a natural, parameter-free, discrete-variable formulation of Feynman path integrals. We show that for discrete-variable quantum systems, Feynman path integrals take the form of walks on the graph whose weighted adjacency matrix is the Hamiltonian. By working out expressions for the partition function and transition amplitudes of discretized versions of continuous-variable quantum systems, and then taking the continuum limit, we explicitly recover Feynman's continuous-variable path integrals. We also discuss the implications of our result.

Feynman diagrams↗
DOE OSTI2025

Analyzing the Quantum Approximate Optimization Algorithm: Ansätze, Symmetries, and Lie Algebras

The quantum approximate optimization algorithm (QAOA) has been proposed as a method to obtain approximate solutions for combinatorial optimization tasks. In this work, we study the underlying algebraic properties of three QAOA ansätze for the maximum-cut problem on connected graphs, while focusing on the generated Lie algebras as well as their invariant subspaces. Specifically, we analyze the standard QAOA ansatz as well as the orbit and multiangle ansätze. We are able to fully characterize the Lie algebras of the multiangle ansatz across arbitrary connected graphs, finding that they only fall into one of just six families. Aside from the cycle and path graphs, the Lie dimensions for every graph are exponentially large in the system size, meaning that multiangle ansätze are extremely prone to exhibiting barren plateaus. Then, a similar quasi-graph-independent Lie-algebraic characterization beyond the multiangle ansatz is impeded as the circuit exhibits additional “hidden” symmetries besides those naturally arising from a certain parity-superselection operator and all automorphisms of the considered graph. Disregarding the “hidden” symmetries, we can upper bound the dimensions of the orbit and the standard Lie algebras, and the dimensions of the associated invariant subspaces are determined via explicit character formulas. To finish, we conjecture that (for most graphs) the standard Lie algebras have only components that are either exponential or that grow, at most, polynomially with the system size. This would imply that the QAOA is either prone to barren plateaus or classically simulable. More generally, our work provides a symmetry framework and tools to analyze any desired variational quantum algorithm.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Novel Results Visualization for Dynamic PSA and New Modeling Features in EMRALD

The Event Modeling Risk Assessment Linked Diagram (EMRALD) tool, developed at the Idaho National Laboratory (INL), was designed to simplify the creation of dynamic models and support various research projects. One of the primary goals of EMRALD was to provide visual methods for modeling. EMRALD consists of two main components: a web-based user interface for model development and a solve engine for running model simulations. Over time, it has evolved to meet the diverse needs of its users. Initially, EMRALD's results were simple text outputs with final key state percentages and uncertainty bounds. However, because EMRALD utilizes a three-phase discrete event simulation and tracks the paths of each simulation run leading to a key state, there is significant potential to analyze large sets of path results data, including state paths, events, and timing. Visualizing this data meaningfully posed a challenge. To address this, a novel time-based Sankey diagram was developed. EMRALD exports results data in a format that can be opened in this Sankey viewer, allowing users to visualize paths, occurrences, events, and probability data for the entire simulation run in a single diagram. Moreover, when EMRALD was first created, there were limited tools capable of meeting its graphical requirements, many of which are no longer supported. In 2024, a new web-based interface was developed using modern graphing tools, enabling additional modeling features. This paper discusses the new dynamic PSA results visualization capability and the enhanced modeling tools available in EMRALD.

97 - MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Conducting Beyond the Standard Model Searches in the MicroBooNE Detector with Machine Learning

MicroBooNE is one of the three neutrino detectors that comprise the Short Baseline Neutrino program at Fermilab. It utilizes Liquid Argon Time Projection Chamber (LArTPC) technology to probe the anomalous excess of electron-like events seen by its predecessor, MiniBooNE. Additionally, it provides a rich avenue of study for Beyond the Standard Model (BSM) theories. In the GeV energy regime relevant to MicroBooNE's beam neutrino program, many such theories lead to signatures which produce electron-positron (e+e-) final-states in the detector. While photons can pair produce into e+e- pairs with negligible opening angles, BSM theories often predict e+e- pairs with a broader range of opening angles. Thus, developing a tool that can reliably measure the opening angles of e+e- events is crucial for conducting rigorous BSM studies. However, these e+e- pairs result in topologically complex showers instead of clean tracks, making non-machine learning (ML) based methods such as line-fitting unsuitable for this task. This poster discusses the effectiveness of ML, namely a graph neural network called PointNet++, in accomplishing this goal. Our studies show promising results, with a resolution for the opening angle of 5 or less.

Bhelande, Vedang Adutya [Los Alamos]↗
DOE OSTI2026

Vulcan-Forge: Architecture and Design of a Multi-Modal Forensic Analysis Plugin for CALDERA

Forge and VULCAN together describe an open-architecture cybersecurity analysis ecosystem that unifies forensic artifact processing, detection engineering, and vulnerability intelligence within integrated platforms. Forge operates as a plugin for MITRE CALDERA, ingesting diverse evidence formats—including EVTX, PCAP/PCAPNG, CSV, JSON, YAML, XML, binaries, and archives—to construct a unified artifact graph enriched with severity scoring, TLP classification, and audit trails. It provides subsystems for artifact parsing, streaming structured-data visualization, NetworkMiner-based packet inspection, PE/.NET binary analysis, and LLM-assisted triage and rule generation, with outputs validated against CCCS-YARA and pySigma schemas. VULCAN complements this by serving as a cybersecurity analyst platform that integrates a Neo4j knowledge graph, Qdrant vector retrieval, SSVC-based triage, and a local LLM to deliver CVE intelligence and forensic analysis through a multi-source ingest pipeline drawing from NVD, CISA KEV, EPSS, MITRE ATT&CK, and CAPEC. Together, they bridge structured threat intelligence with automated forensic analysis and detection workflows.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2000

Analysis of Complexity Evolution Management and Human Performance Issues in Commercial Aircraft Automation Systems

Autoflight systems in the current generation of aircraft have been implicated in several recent incidents and accidents. A contributory aspect to these incidents may be the manner in which aircraft transition between differing behaviours or 'modes.' The current state of aircraft automation was investigated and the incremental development of the autoflight system was tracked through a set of aircraft to gain insight into how these systems developed. This process appears to have resulted in a system without a consistent global representation. In order to evaluate and examine autoflight systems, a 'Hybrid Automation Representation' (HAR) was developed. This representation was used to examine several specific problems known to exist in aircraft systems. Cyclomatic complexity is an analysis tool from computer science which counts the number of linearly independent paths through a program graph. This approach was extended to examine autoflight mode transitions modelled with the HAR. A survey was conducted of pilots to identify those autoflight mode transitions which airline pilots find difficult. The transitions identified in this survey were analyzed using cyclomatic complexity to gain insight into the apparent complexity of the autoflight system from the perspective of the pilot. Mode transitions which had been identified as complex by pilots were found to have a high cyclomatic complexity. Further examination was made into a set of specific problems identified in aircraft: the lack of a consistent representation of automation, concern regarding appropriate feedback from the automation, and the implications of physical limitations on the autoflight systems. Mode transitions involved in changing to and leveling at a new altitude were identified across multiple aircraft by numerous pilots. Where possible, evaluation and verification of the behaviour of these autoflight mode transitions was investigated via aircraft-specific high fidelity simulators. Three solution approaches to concerns regarding autoflight systems, and mode transitions in particular, are presented in this thesis. The first is to use training to modify pilot behaviours, or procedures to work around known problems. The second approach is to mitigate problems by enhancing feedback. The third approach is to modify the process by which automation is designed. The Operator Directed Process forces the consideration and creation of an automation model early in the design process for use as the basis of the software specification and training.

Vakil, Sanjay S.↗
DOE OSTI2025

Boosting efficiency and reducing graph reliance: Basis adaptation integration in Bayesian multi-fidelity networks

The computational cost of high-fidelity numerical models makes outer-loop analysis, which requires repeated interrogation of the model such as uncertainty quantification, computationally demanding. Multi-fidelity methods, which construct a surrogate model using data from an ensemble of models of varying cost and accuracy, can substantially reduce the cost of outer-loop analysis. However, these methods can be difficult to apply when the model ensemble does not admit a clear hierarchy a priori and the correlations between models are low. Consequently, in this paper, we present a multi-fidelity method that leverages dimension reduction to enhance the correlation between models, thereby reducing the amount of data needed to train a surrogate from an unordered ensemble of models. Our method utilizes basis adaptation to build low-dimensional polynomial chaos expansions of each model and employs Multi-fidelity Networks to encode the relationships among models. We show that the resulting method exhibit two notable advantages over its counterpart: (1) enhanced accuracy (both reduced bias and variance); and (2) reduced dependency on the graph structure encoding relationships among models. We demonstrate the approach on an analytical test problem and a challenging finite element model for a spent nuclear fuel. Our method produces a surrogate model that is significantly more accurate than either a single-fidelity surrogate or a multi-fidelity surrogate constructed without basis adaptation.

42 ENGINEERING↗
DOE OSTI2025

Computational insights into hydrogen adsorption energies on medium-entropy oxides

High entropy oxides (HEOs) have emerged as promising catalysts for several important chemical transformations including alkane activation. Hydrogen adsorption energy (HAE) has been used as a key descriptor for many reactions including methane C–H activation and hydrogen evolution reactions. Hence, understanding the relationship between HAEs and the surface chemistry of HEO surfaces could lay the foundation for meaningful correlations among methane C–H activation, HAE, and the complex, local environment of HEO surfaces. Here, we used a medium-entropy oxide as a prototypical system – Mg 0.25 Ni 0.25 Cu 0.25 Zn 0.25 O with a rock-salt structure – to interrogate these relationships. We sampled 2000 different surfaces of its (100) plane and calculated the HAEs at randomly chosen surface O sites using density functional theory (DFT). Our analysis of the 2000 data points reveals that the HAEs at the surface O sites are significantly influenced by the local environment around the adsorption sites, particularly the nature of the metal atom directly below the surface O site where H adsorbs. After comparing several popular graph-neural-network-based machine learning models, we found that the DimeNet++ model performed best achieving satisfactory accuracy in predicting HAEs for both Mg 0.25 Ni 0.25 Cu 0.25 Zn 0.25 O and slightly varied compositions. Our work underscores the promise of such models and the need for further refinement to address the complexity of HEOs.

Song, Haohong [Vanderbilt Univ., Nashville, TN (Un↗
DOE OSTI2025

Testing CP properties of the Higgs boson coupling to τ leptons with heterogeneous graphs

In this paper we explore the possibility of utilizing Deep Learning in measuring the CP properties of the coupling of Higgs boson to τ leptons at the High Luminosity Large Hadron Collider. We employ three Deep Learning (DL) networks, Multi-Layer Perceptron (MLP), Graph Convolution Network (GCN), and Graph Transformer Network (GTN) to enhance signal-to-background separation. The angle between τ lepton decay planes at the detector level is CP-sensitive observables, and we develop Heterogeneous Graphs that integrate diverse node and edge structures to incorporate the CP-sensitive observable efficiently. Using simplified detector simulations we estimate the reconstruction accuracy of the angle between τ lepton planes at the detector level, considering hadronic τ decay modes and standard model backgrounds. With $\sqrt{s}$ = 14 TeV and $\mathcal{L}$ = 100 fb -1 , MLP excludes CP mixing angles above 20° at 68% confidence level (CL), while GCN and GTN achieve exclusions at 90% CL and 95% CL, respectively. The networks also achieve a 3σ significance in excluding a pure CP-odd state.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
NASA NTRS2015

4.4 Development of a 30-Year Soil Moisture Climatology for Situational Awareness and Public Health Applications

This paper provided a brief background on the work being done at NASA SPoRT and the CDC to create a soil moisture climatology over the CONUS at high spatial resolution, and to provide a valuable source of soil moisture information to the CDC for monitoring conditions that could favor the development of Valley Fever. The soil moisture climatology has multi-faceted applications for both the NOAA/NWS situational awareness in the areas of drought and flooding, and for the Public Health community. SPoRT plans to increase its interaction with the drought monitoring and Public Health communities by enhancing this testbed soil moisture anomaly product. This soil moisture climatology run will also serve as a foundation for upgrading the real-time (currently southeastern CONUS) SPoRT-LIS to a full CONUS domain based on LIS version 7 and incorporating real-time GVF data from the Suomi-NPP Visible Infrared Imaging Radiometer Suite (Vargas et al. 2013) into LIS-Noah. The upgraded SPoRT-LIS run will serve as a testbed proof-of-concept of a higher-resolution NLDAS-2 modeling member. The climatology run will be extended to near real-time using the NLDAS-2 meteorological forcing from 2011 to present. The fixed 1981-2010 climatology shall provide the soil moisture "normals" for the production of real-time soil moisture anomalies. SPoRT also envisions a web-mapping type of service in which an end-user could put in a request for either an historical or real-time soil moisture anomaly graph for a specified county (as exemplified by Figure 2) and/or for local and regional maps of soil moisture proxy percentiles. Finally, SPoRT seeks to assimilate satellite soil moisture data from the current Soil Moisture Ocean Salinity (SMOS; Blankenship et al. 2014) and the recently-launched NASA Soil Moisture Active Passive (SMAP; Entekhabi et al. 2010) missions, using the EnKF capability within LIS. The 9-km combined active radar and passive microwave retrieval product from SMAP (Das et al. 2011) has the potential to provide valuable information about the near-surface soil moisture state for improving land surface modeling output.

land surface modeling↗
DOE OSTI2025

Structural constraint integration in a generative model for the discovery of quantum materials

Billions of organic molecules have been computationally generated, yet functional inorganic materials remain scarce due to limited data and structural complexity. Here, in this work, we introduce Structural Constraint Integration in a GENerative model (SCIGEN), a framework that enforces geometric constraints, such as honeycomb and kagome lattices, within diffusion-based generative models to discover stable quantum materials candidates. SCIGEN enables conditional sampling from the original distribution, preserving output validity while guiding structural motifs. This approach generates ten million inorganic compounds with Archimedean and Lieb lattices, over 10% of which pass multistage stability screening. High-throughput density functional theory calculations on 26,000 candidates shows over 95% convergence and 53% structural stability. A graph neural network classifier detects magnetic ordering in 41% of relaxed structures. Furthermore, we synthesize and characterize two predicted materials, TiPd 0.22 Bi 0.88 and Ti 0.5 Pd 1.5 Sb, which display paramagnetic and diamagnetic behaviour, respectively. Our results indicate that SCIGEN provides a scalable path for generating quantum materials guided by lattice geometry.

36 MATERIALS SCIENCE↗
DOE OSTI2023

cuAlign: Scalable Network Alignment on GPU Accelerators

Given two graphs, the objective of network alignment is to find the best one-to-one mapping of vertices in one graph (??) to vertices in the other (??), such that the number of overlaps is maximized. We say that edges(??, ??) ???and(??', ??') ??? are overlapped if ?? is mapped to ??' and ?? is mapped to??'. Network alignment is an important optimization problem with several applications in bioinformatics, computer vision and ontology matching. Since it is an NP-hard problem, efficient heuristics and scalable implementations are necessary. In this work, we introduce a new framework that combines the concepts of intra-network proximity using vertex embedding,Belief Propagation (BP) and approximate weighted matching, and provides qualitative improvements up to22%over state-of-the-art approaches. We also provide scalable implementations on GPU accelerators, demonstrating up to19×speedup for Belief Propagation and 3× speedup for approximate weighted matching relative to previous multithreaded implementation. A combination of combinatorial and algebraic kernels within the network alignment algorithm poses significant hurdles for parallelization. Load imbalance and irregular DRAM traffic limit achievable performance on GPUs. Our novel approach identifies and exploits unique structural proper-ties of the BP-based algorithm and employs code fusion to reduce data movement between different steps of the algorithm. Using a diverse set of inputs, we demonstrate qualitative improvements of our algorithms, and performance gains of our GPU-accelerated implementation. We believe that our work will enable algorithmic improvements and practical applications of network alignment.

Xiang, Lizhi↗
DOE OSTI2023

PVplr-stGNN 0.1.10

PV Performance Loss Rate Estimation using Spatio-temporal Graph Neural Networks PVplr-stGNN is a Python 3 package developed by the SDLE Research Center at Case Western Reserve University in Cleveland OH. This repository contains the full source PVplr-stGNN package. The package contains the PV-stGAE for missingness data detection and imputation and PV-DynGNN for PLR estimation.

Fan, Yangxin [Case Western Reserve Univ., Clevelan↗
NASA NTRS1986

An optimization model for the US Air-Traffic System

A systematic approach for monitoring U.S. air traffic was developed in the context of system-wide planning and control. Towards this end, a network optimization model with nonlinear objectives was chosen as the central element in the planning/control system. The network representation was selected because: (1) it provides a comprehensive structure for depicting essential aspects of the air traffic system, (2) it can be solved efficiently for large scale problems, and (3) the design can be easily communicated to non-technical users through computer graphics. Briefly, the network planning models consider the flow of traffic through a graph as the basic structure. Nodes depict locations and time periods for either individual planes or for aggregated groups of airplanes. Arcs define variables as actual airplanes flying through space or as delays across time periods. As such, a special case of the network can be used to model the so called flow control problem. Due to the large number of interacting variables and the difficulty in subdividing the problem into relatively independent subproblems, an integrated model was designed which will depict the entire high level (above 29000 feet) jet route system for the 48 contiguous states in the U.S. As a first step in demonstrating the concept's feasibility a nonlinear risk/cost model was developed for the Indianapolis Airspace. The nonlinear network program --NLPNETG-- was employed in solving the resulting test cases. This optimization program uses the Truncated-Newton method (quadratic approximation) for determining the search direction at each iteration in the nonlinear algorithm. It was shown that aircraft could be re-routed in an optimal fashion whenever traffic congestion increased beyond an acceptable level, as measured by the nonlinear risk function.

Mulvey, J. M.↗
DOE OSTI2025

AI-Assisted Conceptual Development of a Pre-Geometric Cosmological Model - An Exercise in AI-Assisted Conceptual Framework Generation, Paper II: Local Geometry and Metric Structure

This paper develops the geometric sector of the replication-driven cosmogenesis framework introduced in Paper I. Starting from a pre-geometric spectral substrate and a minimal set of replication axioms, we show how coherent self-replicating units generate a spatial adjacency graph whose continuum limit acquires an effective Riemannian structure. The replication dynamics determines a characteristic correlation length that seeds the local metric, while overlap relations among coherent units produce an isotropic neighborhood geometry with an emergent dimensionality $d_{\rm eff}\simeq 3$ across a broad range of replication factors. As replication slows and causal order stabilizes, a limiting signal speed $c_\ast$ appears, providing the basis for the Lorentzian structure of spacetime without assuming a pre-existing light cone. We derive conditions under which the adjacency graph converges to a smooth three-dimensional manifold, describe the transition from Euclidean to Lorentzian propagation, and identify geometric invariants controlled by the replication parameters. This work establishes the geometric and causal layer of the replication cosmogenesis program, bridging the spectral axioms of Paper I to the cosmological dynamics explored in Paper III.

79 ASTRONOMY AND ASTROPHYSICS↗