Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “dynamic 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 685 records · Page 38

Interaction dynamics of multiple autonomous mobile robots in bounded spatial domains

A general navigation strategy for multiple autonomous robots in a bounded domain is developed analytically. Each robot is modeled as a spherical particle (i.e., an effective spatial domain about the center of mass); its interactions with other robots or with obstacles and domain boundaries are described in terms of the classical many-body problem; and a collision-avoidance strategy is derived and combined with homing, robot-robot, and robot-obstacle collision-avoidance strategies. Results from homing simulations involving (1) a single robot in a circular domain, (2) two robots in a circular domain, and (3) one robot in a domain with an obstacle are presented in graphs and briefly characterized.

Wang, P. K. C.↗

Stochastic thermodynamic cycles of a mesoscopic thermoelectric engine

Here, we analyze a steady-state thermoelectric engine, whose working substance consists of two capacitively coupled quantum dots. One dot is tunnel-coupled to a hot reservoir serving as a heat source, the other one to two electrically biased reservoirs at a colder temperature, such that work is extracted under the form of a steady-state current against the bias. In single realizations of the dynamics of this steady-state engine autonomous, four-stroke cycles can be identified. The cycles are purely stochastic, in contrast to mechanical autonomous engines which exhibit self-oscillations. In particular, these cycles fluctuate in direction and duration and occur in competition with other spurious cycles. Using a stochastic thermodynamic approach, we quantify the cycle fluctuations and relate them to the entropy produced during individual cycles. We identify the cycle mainly responsible for the engine performance and quantify its statistics with tools from graph theory. We show that such stochastic cycles are made possible because the work extraction mechanism is itself stochastic instead of the periodic time dependence in the working-substance Hamiltonian which can be found in conventional mechanical engines. Our investigation brings new perspectives about the connection between cyclic and steady-state engines.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

A Performance-Portable MultiGPU Implementation of 3D Euler Equations using ProtoX and IRIS

Computational scientists often face challenges when developing and optimizing code for high-performance computing (HPC), especially when trying to leverage GPUs. Given the heterogeneity of the nodes that comprise many modern HPC facilities, considerable demand exists for performance portable solutions for the core computational kernels used in many scientific computing libraries. In this work, we demonstrate a fourth-order finite volume method–based implementation of the Euler equations, which are an integral part of computational fluid dynamics. Our performance-portable multiGPU implementation for Euler equations uses ProtoX to generate kernels and IRIS for portability. ProtoX is a domain-specific language that uses a structured-grid partial differential equation library called Proto as its front end and the SPIRAL code generation system as its back end to generate optimized kernels for different architectures. Optimized kernels generated by ProtoX are orchestrated through the IRIS intelligent runtime system to provide portability. Two levels of optimizations within the IRIS runtime— directed acyclic graph fusion and task fusion—are explored to efficiently utilize computing resources in a multiGPU environment. Performance improvement through these optimizations is showcased by comparing the base ProtoX-IRIS implementation on AMD GPUs (Frontier node) and on NVIDIA GPUs (NVIDIA DGX-1).

Mankad, Het↗

Random walk of magnetic field lines in dynamical turbulence: A field line tracing method. I. Slab turbulence

To study the wandering of magnetic field lines is an important subject in theoretical physics. Results of field line random walk theories can be applied in plasma physics as well as astrophysics. Previous investigations are based on magnetostatic models. These models have been used in analytical work as well as in computer simulations to warrant mathematical and numerical tractability. To replace the magnetostatic model by a dynamical turbulence model is a difficult task. In the present article, a field line tracing method is used to describe field line wandering in dynamical magnetic turbulence. As examples different models are employed, namely, the plasma wave model, the damping model of dynamical turbulence, and the random sweeping model. It is demonstrated that the choice of the turbulence model has a very strong influence on the field line structure. It seems that if dynamical turbulence effects are included, Markovian diffusion can be found for other forms of the wave spectrum as in the magnetostatic model. Therefore, the results of the present paper are useful to specify turbulence models. As a further application we consider charged particle transport at early times.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Software Defined Architectures for Data Analytics

Data analytics applications increasingly are complex workflows composed of phases with very different program behaviors (e.g., graph algorithms and machine learning, algorithms operating on sparse an dense data structures, etc). To reach the levels of efficiency required to process these workflows in real time, upcoming architectures will need to leverage even more workload specialization. If, at one end, we may find even more heterogenous processors composed by a myriad of specialized processing elements, at the other end we may see novel reconfigurable architectures, composed of sets of functional units and memories interconnected with (re)configurable on-chip networks, able to adapt dynamically to adapt the workload characteristics. Field Programmable Gate Arrays are more and more used for accelerating various workloads and, in particular, inferencing in machine learning, providing higher efficiency than other solutions. However, their fine grained nature still leads to issues for the design software and still makes dynamic reconfiguration impractical. Future, more coarse-grained architectures could offer the features to execute diverse workloads at high efficiency while providing better reconfiguration mechanisms for dynamic adaptability. Nevertheless, we argue that the challenges for reconfigurable computing remain in the software. In this position paper, we describe a possible toolchain for reconfigurable architectures targeted at data analytics.

FPGA, Dataflow, Reconfigurable Architectures, Soft↗

Pulse Detonation Engine Modeled

Pulse Detonation Engine Technology is currently being investigated at Glenn for both airbreathing and rocket propulsion applications. The potential for both mechanical simplicity and high efficiency due to the inherent near-constant-volume combustion process, may make Pulse Detonation Engines (PDE's) well suited for a number of mission profiles. Assessment of PDE cycles requires a simulation capability that is both fast and accurate. It should capture the essential physics of the system, yet run at speeds that allow parametric analysis. A quasi-one-dimensional, computational-fluid-dynamics-based simulation has been developed that may meet these requirements. The Euler equations of mass, momentum, and energy have been used along with a single reactive species transport equation, and submodels to account for dominant loss mechanisms (e.g., viscous losses, heat transfer, and valving) to successfully simulate PDE cycles. A high-resolution numerical integration scheme was chosen to capture the discontinuities associated with detonation, and robust boundary condition procedures were incorporated to accommodate flow reversals that may arise during a given cycle. The accompanying graphs compare experimentally measured and computed performance over a range of operating conditions for a particular PDE. Experimental data were supplied by Fred Schauer and Jeff Stutrud from the Air Force Research Laboratory at Wright-Patterson AFB and by Royce Bradley from Innovative Scientific Solutions, Inc. The left graph shows thrust and specific impulse, Isp, as functions of equivalence ratio for a PDE cycle in which the tube is completely filled with a detonable hydrogen/air mixture. The right graph shows thrust and specific impulse as functions of the fraction of the tube that is filled with a stoichiometric mixture of hydrogen and air. For both figures, the operating frequency was 16 Hz. The agreement between measured and computed values is quite good, both in terms of trend and magnitude. The error is under 10 percent everywhere except for the thrust value at an equivalence ratio of 0.8 in the left figure, where it is 14 percent. The simulation results shown were made using 200 numerical cells. Each cycle of the engine, approximately 0.06 sec, required 2.0 min of CPU time on a Sun Ultra2. The simulation is currently being used to analyze existing experiments, design new experiments, and predict performance in propulsion concepts where the PDE is a component (e.g., hybrid engines and combined cycles).

Paxson, Daniel E.↗

Predicting Small Molecule Transfer Free Energies by Combining Molecular Dynamics Simulations and Deep Learning

Accurately predicting small molecule partitioning and hydrophobicity is critical in the drug discovery process. There are many heterogeneous chemical environments within a cell and entire human body. For example, drugs must be able to cross the hydrophobic cellular membrane to reach their intracellular targets, and hydrophobicity is an important driving force for drug–protein binding. Atomistic molecular dynamics (MD) simulations are routinely used to calculate free energies of small molecules binding to proteins, crossing lipid membranes, and solvation but are computationally expensive. Machine learning (ML) and empirical methods are also used throughout drug discovery but rely on experimental data, limiting the domain of applicability. We present atomistic MD simulations calculating 15,000 small molecule free energies of transfer from water to cyclohexane. This large data set is used to train ML models that predict the free energies of transfer. We show that a spatial graph neural network model achieves the highest accuracy, followed closely by a 3D-convolutional neural network, and shallow learning based on the chemical fingerprint is significantly less accurate. A mean absolute error of ~4 kJ/mol compared to the MD calculations was achieved for our best ML model. We also show that including data from the MD simulation improves the predictions, tests the transferability of each model to a diverse set of molecules, and show multitask learning improves the predictions. This work provides insight into the hydrophobicity of small molecules and ML cheminformatics modeling, and our data set will be useful for designing and testing future ML cheminformatics methods.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Design and testing of a coaxial linear magnetic spring with integral linear motor

The design of a coaxial linear magnetic spring which incorporates a linear motor to control axial motion and overcome system damping is presented, and the results of static and dynamic tests are reported. The system has nominal stiffness 25,000 N/m and is designed to oscillate a 900-g component over a 4.6-mm stroke in a Stirling-cycle cryogenic refrigerator being developed for long-service (5-10-yr) space applications (Stolfi et al., 1983). Mosaics of 10 radially magnetized high-coercivity SmCO5 segments enclosed in Ti cans are employed, and the device is found to have quality factor 70-100, corresponding to energy-storage efficiency 91-94 percent. Drawings, diagrams, and graphs are provided.

Patt, P. J.↗

The upper atmosphere of Uranus - EUV occultations observed by Voyager 2

EUV (52-170 nm) solar and stellar occultation observations of the Uranian atmosphere from 500 microbar to about 1 pbar, obtained with the UV spectrometer on Voyager 2 during its encounter with Uranus in January 1986, are reported. The data are presented in extensive tables and graphs and characterized in detail. The atmosphere is found to be dominated by H2 (with very small hydrocarbon mixing ratios) out to about 1.25 Uranian radii, where atomic H becomes important. Also noted are a small (relative to Jupiter and Saturn) homopause eddy-diffusion coefficient, little difference between the atmospheres of the day and night hemispheres, high temperatures (800 + or - 100 K) above about 1-10 nbar, and number densities of several hundred H/cu cm at 2 Uranian radii. The implications of the latter finding for ring dynamics and plasma populations are explored.

Herbert, Floyd↗

ON-OFF neuromorphic ISING machines using Fowler-Nordheim annealers

We introduce NeuroSA, a neuromorphic architecture specifically designed to ensure asymptotic convergence to the ground state of an Ising problem using a Fowler-Nordheim quantum mechanical tunneling based threshold-annealing process. The core component of NeuroSA consists of a pair of asynchronous ON-OFF neurons, which effectively map classical simulated annealing dynamics onto a network of integrate-and-fire neurons. The threshold of each ON-OFF neuron pair is adaptively adjusted by an FN annealer and the resulting spiking dynamics replicates the optimal escape mechanism and convergence of SA, particularly at low-temperatures. To validate the effectiveness of our neuromorphic Ising machine, we systematically solved benchmark combinatorial optimization problems such as MAX-CUT and Max Independent Set. Across multiple runs, NeuroSA consistently generates distribution of solutions that are concentrated around the state-of-the-art results (within 99%) or surpass the current state-of-the-art solutions for Max Independent Set benchmarks. Furthermore, NeuroSA is able to achieve these superior distributions without any graph-specific hyperparameter tuning. For practical illustration, we present results from an implementation of NeuroSA on the SpiNNaker2 platform, highlighting the feasibility of mapping our proposed architecture onto a standard neuromorphic accelerator platform.

42 ENGINEERING↗

On the Suitability of MPI as a PGAS Runtime

Partitioned Global Address Space (PGAS) models are emerging as a popular alternative to MPI models for designing scalable applications. At the same time, MPI remains a ubiquitous communication subsystem due to its standardization, high performance, and availability on leading platforms. In this paper, we explore the suitability of using MPI as a scalable PGAS communication subsystem. We focus on the Remote Memory Access (RMA) communication in PGAS models which typically includes {\em get, put,} and {\em atomic memory operations}. We perform an in-depth exploration of design alternatives based on MPI. These alternatives include using a semantically-matching interface such as MPI-RMA, as well as not-so-intuitive interfaces such as MPI two-sided with a combination of multi-threading and dynamic process management. With an in-depth exploration of these alternatives and their shortcomings, we propose a novel design which is facilitated by the data-centric view in PGAS models. This design leverages a combination of highly tuned MPI two-sided semantics and an automatic, user-transparent split of MPI communicators to provide asynchronous progress. We implement the asynchronous progress ranks approach and other approaches within the Communication Runtime for Exascale which is a communication subsystem for Global Arrays. Our performance evaluation spans pure communication benchmarks, graph community detection and sparse matrix-vector multiplication kernels, and a computational chemistry application. The utility of our proposed PR-based approach is demonstrated by a 2.17x speed-up on 1008 processors over the other MPI-based designs.

Computational modeling↗

Sensory stimulation for upper limb amputations modulates adaptability of cortical large-scale systems and combination of somatosensory and visual inputs

Abstract Touch-like phantom limb sensations can be elicited through targeted transcutaneous electrical nerve stimulation (tTENS) in individuals with upper limb amputation. The corresponding impact of sensory stimulation on cortical activity remains an open question. Brain network research shows that sensorimotor cortical activity is supported by dynamic changes in functional connections between relevant brain regions. These groups of interconnected regions are functional modules whose architecture enables specialized function and related neural processing supporting individual task needs. Using electroencephalographic (EEG) signals to analyze modular functional connectivity, we investigated changes in the modular architecture of cortical large-scale systems when participants with upper limb amputations performed phantom hand movements before, during, and after they received tTENS. We discovered that tTENS substantially decreased the flexibility of the default mode network (DMN). Furthermore, we found increased interconnectivity (measured by a graph theoretic integration metric) between the DMN, the somatomotor network (SMN) and the visual network (VN) in the individual with extensive tTENS experience. While for individuals with less tTENS experience, we found increased integration between DMN and the attention network. Our results provide insights into how sensory stimulation promotes cortical processing of combined somatosensory and visual inputs and help develop future tools to evaluate sensory combination for individuals with amputations.

60 APPLIED LIFE SCIENCES↗

An application of MSC/NASTRAN in the interdisciplinary analysis of large space-based structures

The Integrated Multidisciplinary Analysis Tool (IMAT), a computer software system developed at NASA Langley to analyze and simulate the dynamics of space-structure/control-system interactions, is described, and its application to the MAST problem (a 60-m truss with fundamental frequency less than 200 mHz and equipped with linear proof-mass actuators, to be deployed from the Space Shuttle as part of COFS-I flight experiment) is demonstrated. Particular attention is given to the IMAT procedures which facilitate the use of the MCS/NASTRAN code to recover physical results from time-domain state-space solutions obtained with an FEM control-design code. Diagrams, drawings, and graphs are provided.

Stockwell, Alan E.↗

The influence of bulk composition and dynamic melting conditions on olivine chondrule textures

The effects of the bulk composition and the dynamic melting conditions on the texture of olivine chondrules were investigated in a series of heating experiments. It is shown that variations in the olivine chondrule textures can be produced by varying the FeO/(FeO + MgO) ratio between the average Type IA and Type II chondrule compositions, could affect the texture of a chondrule at a constant initial melting temperature and heating time. A range of the heating times and the masses of precursor spheres caused variations in the degree of melting and in chondrule textures. Chondrule textures were distributed on a graph of initial temperatures vs. FeO/(FeO + MgO) ratios as bands parallel to the olivine disappearance curve. This graph could be used to predict chondrule textures from Fe/(FeO + MgO) ratios at specific initial melting temperatures.

Connolly, Harold C., Jr.↗

iDDS: intelligent distributed dispatch and scheduling for workflow orchestration

The intelligent distributed dispatch and scheduling (iDDS) service is a versatile workflow orchestration system designed for large-scale, distributed scientific computing. iDDS extends traditional workload and data management by integrating data-aware execution, conditional logic, and programmable workflows, enabling automation of complex and dynamic processing pipelines. Originally developed for the ATLAS experiment at the large hadron collider, iDDS has evolved into an experiment-agnostic platform that supports both template-driven workflows and a Function-as-a-Task model for Python-based orchestration. This paper presents the architecture and core components of iDDS, highlighting its scalability, modular message-driven design, and integration with systems such as PanDA and Rucio. We demonstrate its versatility through real-world use cases: fine-grained tape resource optimization for ATLAS, orchestration of large Directed Acyclic Graph (DAG) workflows for the Rubin Observatory, distributed hyperparameter optimization for machine learning applications, active learning for physics analyses, and AI-assisted detector design at the electron–ion collider. By unifying workload scheduling, data movement, and adaptive decision-making, iDDS reduces operational overhead and enables reproducible, high-throughput workflows across heterogeneous infrastructures. We conclude with current challenges and future directions, including interactive, cloud-native, and serverless workflow support.

97 MATHEMATICS AND COMPUTING↗

Short-Depth QAOA circuits and Quantum Annealing on Higher-Order Ising Models (Rev.2)

The Quantum Alternating Operator Ansatz (QAOA) and Quantum Annealing (QA) are quantum algorithms that are both based on the adiabatic theorem and both have the goal of sampling the optimal solution(s) of combinatorial optimization problems. Quantum annealing has been physically instantiated on D-Wave devices using superconducting flux qubits, and QAOA can be programmed on digital gate-model quantum computers such as the programmable superconducting transmon qubits devices of the IBMQ series, for instance ibm washington. QAOA and QA address the same types of problems, but it is unclear how they will scale to large problem sizes and to larger and higher-fidelity quantum computers. In this article, we present a direct comparison between QAOA, one and two rounds, run on all 127 qubits of ibm washington and QA run on D-Wave Advantage system4.1 and Advantage system6.1. The problems which allow for this comparison are random Ising model problems whose connectivity matches the heavy hexagonal lattice topology of ibm washington and the Pegasus graph connectivity of the two D-Wave devices. We create two classes of problem instances for this comparison: one with higher order terms (ZZZ variable interactions), linear terms, and quadratic terms, and a separate problem type with only linear and quadratic terms. Our QAOA circuits are novel and extremely short depth, with a CNOT depth of 6 per round, which allows whole chip usage of ibm washington’s heavy hexagonal lattice and can be applied to future heavy-hex chips. We also test the effectiveness of the error suppression technique digital dynamical decoupling on the QAOA circuits. The QAOA circuits compiled to ibm washington are composed of several thousand circuit instructions, approximately 3, 000 depending on the details of the circuit, making these some the largest quantum circuits ever executed on a digital quantum processor. QAOA and QA are compared against the classical heuristic algorithm of simulated annealing and all problem instances are exactly solved using CPLEX in order to evaluate which samplers, if any, correctly found the ground state solution(s) of the problem instances. We find that (i) QA outperforms QAOA on all problem instances, (ii) QAOA samples the problems better than random sampling, and (iii) QAOA angle computation exhibits clear parameter concentration across the ensemble of Ising models.

127 Qubits↗

An artificial spiking quantum neuron

Abstract Artificial spiking neural networks have found applications in areas where the temporal nature of activation offers an advantage, such as time series prediction and signal processing. To improve their efficiency, spiking architectures often run on custom-designed neuromorphic hardware, but, despite their attractive properties, these implementations have been limited to digital systems. We describe an artificial quantum spiking neuron that relies on the dynamical evolution of two easy to implement Hamiltonians and subsequent local measurements. The architecture allows exploiting complex amplitudes and back-action from measurements to influence the input. This approach to learning protocols is advantageous in the case where the input and output of the system are both quantum states. We demonstrate this through the classification of Bell pairs which can be seen as a certification protocol. Stacking the introduced elementary building blocks into larger networks combines the spatiotemporal features of a spiking neural network with the non-local quantum correlations across the graph.

Kristensen, Lasse Bjørn (ORCID:0000000239398170)↗

Developing a complete AI-accelerated workflow for superconductor discovery

The quest to identify new superconducting materials with enhanced properties is hindered by the prohibitive cost of computing electron-phonon spectral functions, severely limiting the materials space that can be explored. Here, we introduce a Bootstrapped Ensemble of Equivariant Graph Neural Networks (BEE-NET), a machine-learning model trained to predict the Eliashberg spectral function and superconducting critical temperature with a mean-absolute-error of 0.87 K relative to DFT-based Allen-Dynes calculations. Intriguingly, BEE-NET achieves a true-negative-rate of 99.4%, enabling highly efficient screening for the rare property of superconductivity. Integrated into a multi-stage, AI-accelerated discovery pipeline that incorporates elemental-substitution strategies and machine-learned interatomic potentials, our workflow reduced over 1.3 million candidate structures to 741 dynamically and thermodynamically stable compounds with DFT-confirmed T c > 5 K. We report the successful synthesis and experimental confirmation of superconductivity in two of these previously unreported compounds. This study establishes a data-driven framework that integrates machine learning, quantum calculations, and experiments to systematically accelerate superconductor discovery.

Gibson, Jason B. [Quantum Formatics, Cambridge, MA↗