Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Graph”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

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

At least 1,369 records · Page 76
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Convergence of nuclear effective field theory with perturbative pions

The classic paper by Fleming, Mehen, and Stewart (FMS) cast doubts on the convergence of spin-triplet nucleon-nucleon partial wave scattering amplitudes when following the proposal of Kaplan, Savage, and Wise to construct nuclear effective field theory (EFT) around the unitary fermion limit with perturbative pion exchange. FMS identified the subclass of iterated one-pion exchange potential graphs as the cause of this poor convergence, which they showed persisted in the chiral limit. Theoretical tools are developed in this work to compute these Feynman graphs analytically to high order in all angular momentum channels simultaneously, examining the amplitudes computed to seven loops in the $\textit{L = J}$ channels and three loops in the coupled $\textit{L = J}$ ± 1 channels. One finds that there is nothing pathological about the perturbative expansion of a 1/$r^3$ potential in general and that the expansion converges satisfactorily in all partial waves except those with the lowest angular momentum, particularly the $^3P_0$ and the coupled $^3S_1 - ^3D_1$ channels. The results corroborate work by Birse, which suggests possible avenues to explore for improving the range of validity of the EFT expansion.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2021

Screening two-dimensional materials with topological flat bands

The topological flat band (TFB) has been proposed theoretically in various lattice models, to exhibit a rich spectrum of intriguing physical behaviors. However, the experimental demonstration of flat band (FB) properties has been severely hindered by the lack of materials realization. In this study, by screening materials from a first-principles materials database, we identify a group of two-dimensional materials with TFBs near the Fermi level, covering some simple line-graph and generalized line-graph FB lattice models. These include the kagome sublattice of O in Ti O 2 yielding a spin-unpolarized TFB, and that of V in ferromagnetic V 3 F 8 yielding a spin-polarized TFB. The monolayer Nb 3 Te Cl 7 and its counterparts from element substitution are found to be breathing-kagome-lattice crystals. The family of monolayer II I 2 V I 3 compounds exhibit a TFB representing the coloring-triangle lattice model. Re F 3 , Mn F 3 , and Mn Br 3 are all predicted to be diatomic-kagome-lattice crystals, with TFB transitions induced by atomic substitution. Finally, Hg F 2 , Cd F 2 , and Zn F 2 are discovered to host dual TFBs in the diamond-octagon lattice. Our findings pave the way to further experimental exploration of eluding FB materials and properties.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Understanding random-walk dynamical phase coexistence through waiting times

We study the appearance of first-order dynamical phase transitions (DPTs) as “intermittent” coexisting phases in the fluctuations of random walks on graphs. We show that the diverging timescale leading to critical behavior is the waiting time to jump from one phase to another. This timescale is crucial for observing the system's relaxation to stationarity and demonstrate ergodicity of the system at criticality. We illustrate these results through three analytical examples which provide insights into random walks exploring random graphs. Published by the American Physical Society 2024

Stuhrmann, David C. (ORCID:0009000726916649)↗
DOE OSTI2023

Artificial Intelligence Designer of Materials and Processes for Advanced Power Generation

In this presentation, ‘deep-freeze’ graphs, ‘convoluted filtering’ networks, ‘mirror-image’ graphs, and adversarial ensemble methods are utilized to support inversion modeling for optimization of the complex compositions and complex processes in design of high-performing alloys, with their properties tailored to the energy application specifications.

Romanov, Vyacheslav↗
DOE OSTI2020

DC Microgrids Under Denial of Service Attacks: Feasibility and Stability Issues

Distributed control has been extensively studied for a DC microgrid to coordinate multiple grid assets where each asset can generate its own control decisions based on communications within its neighborhood. Nevertheless, such a control strategy usually has a strong dependence on active information exchange and needs to always maintain a pre-determined communication graph. This makes it vulnerable to cyber attacks, especially denial of service (DoS) attacks that block communication channels that effectively change the communication graph. In this paper, we study two potential impacts of DoS attacks: the inability to maintain steady-state and dynamical generation-demand balance, i.e. the feasibility and stability issues. We develop a mathematical model to describe the cyber-induced system steady-state and dynamical performance. The model reveals the impacts of DoS attacks and enables formal analysis. Case studies are shown to verify the proposed work.

41 EE - Solar Energy Technologies Office (EE-4S)↗
DOE OSTI2022

A Framework for Neural Network Inference on FPGA-Centric SmartNICs

FPGA-based SmartNICs offer great potential to significantly improve the performance of high-performance computing and warehouse data processing by tightly coupling support for reconfigurable data-intensive computation with cross-node communication, thereby mitigating the von Neumann bottleneck. Existing work, however, has been generally been limited in that it assumes an accelerator model where kernels are offloaded to SmartNICs, but most control tasks are left to the CPUs. This leads to frequent waiting, inferior performance, and scaling challenges. In this work, we propose a new distributive data-centric computing framework, named FCsN, for reconfigurable SmartNIC-based systems. Through a lightweight task circulation execution model and its implementation architecture, FCsN allows the complete detaching of kernel execution, control logic, system scheduling, and network communication to the SmarNICs. This boosts performance by: (i) avoiding the control dependency with CPUs and (ii) supporting streaming kernel execution and network communication at line rate and in a very fine-grained manner. We demonstrate the efficiency and flexibility of FCsN using various types of neural network applications including graph neural networks; as these last are both irregular and data intensive they offer an especially robust demonstration. Evaluations using commonly-used neural network models and graph datasets show that a system with the support of FCsN can achieve, on average, 144 speedups over the MPI-based standard CPU baselines.

Guo, Anqi↗
DOE OSTI2025

IRIS-MEMFLOW: Data Flow-Enabled Portable Memory Orchestration in IRIS Runtime for Diverse Heterogeneity

Task-based programming models and execution paradigms provide a means to decompose a computation by expressing it as a graph in which each node represents a specific computation operating on memory objects and the edges define the dependencies in the execution flow. In this execution model, independent nodes in the graph can be executed concurrently in different computing devices, making it suitable for heterogeneous systems in which computing devices with different architectures coexist. However, careful memory orchestration across heterogeneous devices is needed because copies of the same memory object may reside in multiple devices during execution. Manually ensuring such an orchestration is quite challenging. Not only must an application developer guard against race conditions, but they must also optimize data movement between the host and devices because unnecessary data movement significantly impacts performance. To mitigate these challenges, we enhance the IRIS heterogeneous runtime and introduce IRIS-MEMFLOW–a data flow–enabled portable memory abstraction for seamlessly orchestrating memory in diverse heterogeneous computing environments. By using data-flow analysis, IRIS-MEMFLOW guards against race conditions while multiple heterogeneous devices access memory objects. IRIS-MEMFLOW also optimizes data movement between the host and devices without manual intervention. As a result, IRIS provides improved programming productivity, performance, and portability for multidevice heterogeneous executions in high-performance computing and cloud systems that run diverse architectures from different vendors. The efficacy of IRIS-MEMFLOW is evaluated through experiments that show its capability in terms of programming productivity, multidevice heterogeneity, portability, and low overhead versus the state of the art.

Monil, M. A. H. [ORNL] (ORCID:0000000334194037)↗
DOE OSTI2024

IRIS: Exploring Performance Scaling of the Intelligent Runtime System and its Dynamic Scheduling Policies

High-Performance Computing is becoming increasingly heterogeneous, relying on a diverse mix of hardware to achieve good performance. Paradoxically, current drivers and frameworks for these devices typically require separate languages and implementations for each vendor. Furthermore, there are few tools and little support to schedule codes between these devices in a truly heterogeneous manner-partly because of this fragmentation between vendors and the languages each supports. To overcome both limitations, the Intelligent Runtime System (IRIS) was developed. It allows a common task abstraction to automatically be shared among contemporary vendors and is run from a single host-side API. At runtime, IRIS queries the host system and registers which frameworks and drivers are available, these determine which kernels can be used by the scheduler-CPUs via OpenMP, Nvidia GPUs (CUDA), AMD GPUs (HIP), and Intel and Xilinx FPGAs with OpenCL. IRIS enables tasks to be scheduled to any heterogeneous device and resolves to the appropriate kernel binary at runtimeit only uses the devices supported by the system on which it is run. IRIS supports single-task and graph-based expressions of dependencies of tasks. Additionally, IRIS features a range of dynamic scheduling policies, allowing complex chains of tasks and interactions to be executed, relieving the programmer/user from considering the system to assign tasks to devices optimally. This paper presents the peak performance attainable by IRIS over a range of systems-each with different numbers and types of accelerator devices, it highlights the flexibility of IRIS since these devices are truly heterogeneous, relying on different backends (drivers, frameworks, and languages) which historically required unique implementations to utilize them. We then use this peak performance as a baseline to compare increasingly complex chains of tasks (with increasingly complex task dependencies) and evaluate how IRIS copes. Finally, we consider the performance of different IRIS scheduling policies on this range of task graphs.

Johnston, Beau↗
DOE OSTI2021

The Utility in Conjoint Analysis as a Fast Expert Elicitation Technique

This paper presents an interface and analysis technique for quickly conducting expert elicitation with the goal of determining entity importance. Our interface deploys a two-alternative choice experiment that is capable of representing knowledge graphs in an easy to interpret fashion for users with limited experience with knowledge graphs. Our analysis methodology takes advantage of conjoint analysis techniques and provides entity weights for many SMEs simultaneously. The results largely align with individual participant fits.

Conjoint Analysis, interface, Expert Elicitation, ↗
DOE OSTI2025

Optimizing Traffic Signal Control to Enhance Transportation Efficiency and Maximize Pedestrian Benefits in the Road Network

Increasing urban mobility requirements demand efficient transportation system strategies for both vehicular and pedestrian movement. This study enhances the Decentralized Graph-based Multi-Agent Reinforcement Learning (DGMARL) approach, originally tailored for vehicular traffic signal timing, to incorporate pedestrian traffic dynamics. The improved algorithm considers crucial metrics such as Eco_PI, assesses vehicle fuel consumption by factoring in stops and delays, and addresses pedestrian waiting time, crucial for system efficiency while acknowledging driver waiting time impact. Utilizing Digital Twin simulation along the MLK Smart Corridor in Chattanooga, Tennessee, the algorithm's performance is compared for various pedestrian control scenarios. To evaluate the effectiveness of DGMARL, this study compared DGMARL-enabled signal management with automated pedestrian traffic detection and an actuated signal management system (real-word baseline) with pedestrian recall, which predetermingly enforces a pedestrian phase every cycle. Findings indicate substantial improvements with DGMARL, showing a 28.29% enhancement in vehicle Eco_PI, a 60.55 % reduction in pedestrian waiting time, and a 55.74% decrease in driver stop delay, on average, compared to the baseline actuated signal timing plan.

Kumarasamy, Vijayalakshmi K [The University of Ten↗
DOE OSTI2020

Steady-State Analysis of Microgrid Distributed Control Under Denial of Service Attacks

Distributed control is an effective method to coordinate multiple components in a microgrid. It usually has mandatory requirements for communication graph topology; changing the topology unexpectedly could disrupt the operation of a distributed controller. A denial of service (DoS) attack blocks communication channels to cause variations in communication graph. Unforeseen topology changes render a controller to receive incomplete system information. Control decisions made based on incorrect information can lead to significantly reduced grid supporting capability. As a result, the vital power balance between generation and load may be challenged. Determining power balance requires steady-state power flow analysis; however, the cyber-induced steady-state analysis is not well studied in the literature. Here, in this article, we show that a cyber–physical microgrid with unknown DoS attacks has augmented uncertain power flow equations, whose special structure creates new computational issue to determining power balance. To deal with the issue, we develop a novel cyber-induced microgrid model: the cyber–physical system is transformed into a pure physical model, where the disruption effects of DoS in the cyber layer are shown to be equivalent to the variations of the physical model parameters. With the transformed system, we develop a sufficient condition to ascertain the system power balance under unknown DoS attacks. In addition, practical insights for resilient distributed control design are shown as well.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2021

Structural Controllability Assessment for Inverter-Based Microgrids

Enhanced inverter-based controls are considered for microgrids, which use additional actuation beyond a droop-like term. Shaping of the microgrid’s small-signal dynamics using such enhanced controls is posed as a structural controllability problem. A graph-theoretic characterization of structural controllability is obtained, in terms of the concept of zero-forcing sets.Two benchmark test systems are used to illustrate the selection of locations where enhanced controls should be applied, based on the graph-theoretic analysis. These examples indicate that small-signal characteristics can be shaped using a relatively small number of enhanced controls

microgrids, zero-forcing, structural controlabilit↗
DOE OSTI2021

A Benchmark Case for the Grid Survivability Analysis

Among current priorities of the power system analysis is the development of metrics and computational tools for the resilience analysis during catastrophic events. New methods and tools are required for such an analysis and they have to be validated prior application to real systems. However, benchmark problems are not readily available due to the analysis novelty. The current paper presents a case based on the IEEE 14-bus system for this purpose. The grid is simplified to a graph with nodes representing generators, loads, and buses. Power inputs are imported from real-time simulations of the IEEE 14-bus system. Outcomes of all possible combinations of failed elements are presented in terms of probabilities for the grid to survive, partially survive, or fail. Only the power grid's ability to withstand adverse events (survivability) is analyzed. The grid's recoverability, the other part of the resilience analysis, is not considered.

power system↗
DOE OSTI2023

A Fast and Scalable Genetic Algorithm-Based Approach for Planning of Microgrids in Distribution Networks

As a result of climate change, extreme weather events are occurring more frequently and with increasing impact. This trend poses a significant challenge for distribution utilities and system operators to ensure that there is uninterrupted power supply to critical loads in their networks; thus, the level of proactive preparation of the distribution system to be able to handle severe impacts of extreme weather events represents the system's resilience. One method that distribution system planners can use to prepare for future extreme events is to plan multiple microgrids which can use local generation as much as possible to supply critical loads. But partitioning an existing distribution system such that multiple feasible islands are planned and which are capable of supporting critical loads is still challenging for distribution systems - first, because of the size of the network graph partitioning problem and, second, because of the difficulty in properly formulating the desired attributes of such islands or microgrids. Therefore, this paper presents a genetic algorithm based approach that facilitates incorporating multiple objectives for grid partitioning by formulating two types of problems - node allocation and edge elimination - and it considers multiple topological and resilience-enhancing objectives. The performance of the proposed genetic algorithm-based approach is numerically evaluated on multiple test systems as well as on a real distribution feeder in Colorado, United States.

genetic algorithm↗
DOE OSTI2024

A Performance and Energy Study of GPU-Resident Preconditioners for Conjugate Gradient Solvers: In the Context of Existing and Novel Approaches

Optimizing a particular subprogram out of the set of Basic (sparse) Linear Algebra Subprograms (BLAS) for a given architecture is a common topic of research. In applications, however, these BLAS functions rarely appear in isolation; usually, many of them are used together, in various combinations and with varying inputs. As the need to solve a large, sparse linear system is ubiquitous throughout HPC applications, linear solvers constitute a realistic, sufficiently complex and well-defined representative use case for composite BLAS routines. To this end, based on a representative set of matrices drawn from a diverse set of fields, we present a framework to study, from the performance and energy perspective, the efficacy of GPU- resident parallel Conjugate Gradient (CG) linear solver with different preconditioner options, including Gauss-Seidel, Jacobi, and incomplete Cholesky. We also propose a novel GPU-based preconditioner, in which the triangular solves are approximated by an iterative process. The development of this preconditioner was motivated by solving large graph Laplacian linear systems, for which the existing preconditioners either perform slow on GPU-based platforms or are not applicable. We compare the performance of these preconditioners on different hardware accelerator architectures, i.e., AMD MI250X, MI100, Nvidia A100, V100, and Jetson. Our experiments reveal performance trade-offs and provide information on how to select the best strategy for the given linear system, dictated by its properties, and the platform of interest. We demonstrate the application of our novel preconditioner for solving CG and graph Laplacian systems. Overall, the framework can be utilized as a benchmark to guide informed decisions in choosing a specific preconditioner, i.e., whether it is better to rely on the performance of a triangular solver or on the performance of sparse matrix-vector product. Finally, by considering power consumption to solve the linear systems, we report the energy footprint for the solvers.

Preconditioned Conjugate Gradient, GPUs, iterative↗
DOE OSTI2023

An Incremental Gradient Method for Optimization Problems With Variational Inequality Constraints

We consider minimizing a sum of agent-specific nondifferentiable merely convex functions over the solution set of a variational inequality (VI) problem in that each agent is associated with a local monotone mapping. This problem finds an application in computation of the best equilibrium in nonlinear complementarity problems arising in transportation networks. We develop an iteratively regularized incremental gradient method where at each iteration, agents communicate over a directed cycle graph to update their solution iterates using their local information about the objective and the mapping. The proposed method is single-timescale in the sense that it does not involve any excessive hard-to-project computation per iteration. We derive nonasymptotic agent-wise convergence rates for the suboptimality of the global objective function and infeasibility of the VI constraints measured by a suitably defined dual gap function. Finally, the proposed method appears to be the first fully iterative scheme equipped with iteration complexity that can address distributed optimization problems with VI constraints over cycle graphs.

convergence↗
DOE OSTI2025

Self-Supervised and Interpretable Anomaly Detection Using Network Transformers

Machine learning and deep neural networks (DNNs) have been proposed as a tool to identify anomalies in computer network communications. However, due the obfuscated nature of off-the-shelf machine learning models, their output often does not provide enough information to isolate the source of the anomaly to take corrective measures. In this article, we introduce the network transformer (NeT), a DNN model for anomaly detection that incorporates the graph structure of the communication network in order to improve interpretability. Further, the presented approach has the following advantages: first, enhanced interpretability by incorporating the graph structure of computer networks; second, provides a hierarchical set of features that enables analysis at different levels of granularity; second, self-supervised training that does not require labeled data. The NeT model was evaluated on a set of anomalous scenarios executed in a real industrial control system. The presented approach successfully identified the anomalies, the devices affected, and the specific connections causing the anomalies, providing a data-driven hierarchical approach to analyze the behavior of a cyber network.

97 MATHEMATICS AND COMPUTING↗