Search NASA⌕ Search

SEARCH · Search NASA

Results for “Network topology”

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 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Structure and properties of densified silica glass: characterizing the order within disorder

The broken symmetry in the atomic-scale ordering of glassy versus crystalline solids leads to a daunting challenge to provide suitable metrics for describing the order within disorder, especially on length scales beyond the nearest neighbor that are characterized by rich structural complexity. Here, we address this challenge for silica, a canonical network-forming glass, by using hot versus cold compression to (i) systematically increase the structural ordering after densification and (ii) prepare two glasses with the same high-density but contrasting structures. The structure was measured by high-energy X-ray and neutron diffraction, and atomistic models were generated that reproduce the experimental results. The vibrational and thermodynamic properties of the glasses were probed by using inelastic neutron scattering and calorimetry, respectively. Traditional measures of amorphous structures show relatively subtle changes upon compacting the glass. The method of persistent homology identifies, however, distinct features in the network topology that change as the initially open structure of the glass is collapsed. The results for the same high-density glasses show that the nature of structural disorder does impact the heat capacity and boson peak in the low-frequency dynamical spectra. Densification is discussed in terms of the loss of locally favored tetrahedral structures comprising oxygen-decorated SiSi 4<:sub> tetrahedra.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Grand canonically optimized grain boundary phases in hexagonal close-packed titanium

Grain boundaries (GBs) profoundly influence the properties and performance of materials, emphasizing the importance of understanding the GB structure and phase behavior. As recent computational studies have demonstrated the existence of multiple GB phases associated with varying the atomic density at the interface, we introduce a validated, open-source GRand canonical Interface Predictor (GRIP) tool that automates high-throughput, grand canonical optimization of GB structures. While previous studies of GB phases have almost exclusively focused on cubic systems, we demonstrate the utility of GRIP in an application to hexagonal close-packed titanium. We perform a systematic high-throughput exploration of tilt GBs in titanium and discover previously unreported structures and phase transitions. In low-angle boundaries, we demonstrate a coupling between point defect absorption and the change in the GB dislocation network topology due to GB phase transformations, which has important implications for the accommodation of radiation-induced defects.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Computational design of highly signalling-active membrane receptors through solvent-mediated allosteric networks

Abstract Protein catalysis and allostery require the atomic-level orchestration and motion of residues and ligand, solvent and protein effector molecules. However, the ability to design protein activity through precise protein–solvent cooperative interactions has not yet been demonstrated. Here we report the design of 14 membrane receptors that catalyse G protein nucleotide exchange through diverse engineered allosteric pathways mediated by cooperative networks of intraprotein, protein–ligand and –solvent molecule interactions. Consistent with predictions, the designed protein activities correlated well with the level of plasticity of the networks at flexible transmembrane helical interfaces. Several designs displayed considerably enhanced thermostability and activity compared with related natural receptors. The most stable and active variant crystallized in an unforeseen signalling-active conformation, in excellent agreement with the design models. The allosteric network topologies of the best designs bear limited similarity to those of natural receptors and reveal an allosteric interaction space larger than previously inferred from natural proteins. The approach should prove useful for engineering proteins with novel complex protein binding, catalytic and signalling activities.

Chemistry↗
DOE OSTI2026

Imaging supermoiré relaxation in helical trilayer graphene

In twisted van der Waals materials, local atomic relaxation can alter the underlying electronic structure. Characterizing lattice reconstruction and its susceptibility to strain is essential for understanding emergent electronic states, especially in multilayers in which interference between moiré lattices yields larger supermoiré patterns whose energy is highly sensitive to local stacking. Here, in this study, we image spatial modulations in the electronic character of helical trilayer graphene, which indicate relaxation into a superstructure of large domains with uniform moiré periodicity. We show that the supermoiré domain size is increased by strain and can be altered in the same device while preserving the local properties within each domain. Finally, we observe a higher conductance at the domain boundaries, consistent with predictions that they host counterpropagating edge modes. Our work provides a real-space visualization of moiré-periodic domains, reveals two independently tunable length scales and demonstrates strain engineering as a route towards designing correlated topological networks at the supermoiré scale.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Rational design of stable functional metal–organic frameworks

Functional porous metal–organic frameworks (MOFs) have been explored for a number of potential applications in catalysis, chemical sensing, water capture, gas storage, and separation. MOFs are among the most promising candidates to address challenges facing our society related to energy and environment, but the successful implementation of functional porous MOF materials are contingent on their stability; therefore, the rational design of stable MOFs plays an important role towards the development of functional porous MOFs. In this Focus article, we summarize progress in the rational design and synthesis of stable MOFs with controllable pores and functionalities. The implementation of reticular chemistry allows for the rational top-down design of stable porous MOFs with targeted topological networks and pore structures from the pre-selected building blocks. We highlight the reticular synthesis and applications of stable MOFs: (1) MOFs based on high valent metal ions (e.g., Al 3+ , Cr 3+ , Fe 3+ , Ti 4+ and Zr 4+ ) and carboxylate ligands; (2) MOFs based on low valent metal ions (e.g., Ni 2+ , Cu 2+ , and Zn 2+ ) and azolate linkers. We envision that the synthetic strategies, including modulated synthesis and post-synthetic modification, can potentially be extended to other more complex systems like metal-phosphonate framework materials.

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

Modeling Electric Vehicle Charging Load Using Origin-Destination Data

The accelerating adoption of electric vehicles (EVs) poses challenges to the power grid, necessitating precise representation of mobility patterns for effective infrastructure upgrades. Traditional simulation-based charging demand estimation faces limitations in generating trip chains reflective of actual travel patterns without complex network modeling. Hence, an innovative agent-based trip chain generation model is introduced to overcome these challenges. Drawing from the National Household Travel Survey (NHTS) and the NextGen NHTS origin-destination add-on data for Clarke County, Georgia, this study proposes a simulation method capturing both temporal and spatial mobility patterns without relying on extensive network topology data. The resulting trip chains predict EV charging load at the Census Block Group level, validated with a 1.03 correlation to actual trip counts, affirming their reflective accuracy. Two charging scenarios, residential-only and charging-everywhere, reveal distinct demand profiles. The charging-everywhere scenario aligns closely with the trip profile, while the residential-only scenario exhibits an afternoon peak slightly surpassing the former. This study contributes a data-driven charging demand estimation methodology, offering critical insights for grid resiliency planning amid the evolving landscape of EV adoption.

Pan, Melrose↗
DOE OSTI2020

Collective mode Brownian dynamics: A method for fast relaxation of statistical ensembles

Sampling equilibrium configurations of correlated systems of particles with long relaxation times (e.g., polymeric solutions) using conventional molecular dynamics and Monte Carlo methods can be challenging. This is especially true for systems with complicated, extended bond network topologies and other interactions that make the use and design of specialized relaxation protocols infeasible. We introduce a method based on Brownian dynamics simulations that can reduce the computational time it takes to reach equilibrium and draw decorrelated samples. Importantly, the method is completely agnostic to the particle configuration and the specifics of interparticle forces. In particular, we develop a mobility matrix that excites non-local, collective motion of N particles and can be computed efficiently in $\mathcal{O}(N)$ time. Particle motion in this scheme is computed by integrating the overdamped Langevin equation with an Euler–Maruyama scheme, in which Brownian displacements are drawn efficiently using a low-rank representation of the mobility matrix in position and wave space. We demonstrate the efficacy of the method with various examples from the realm of soft condensed matter and release a massively parallel implementation of the code as a plugin for the open-source package HOOMD-blue [J. A. Anderson et al., J. Comput. Phys. 227, 5342 (2008) and J. Glaser et al., Comput. Phys. Commun. 192, 97 (2015)] which runs on graphics processing units

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

An open-source framework for balancing computational speed and fidelity in production cost models

Studies of bulk power system operations need to incorporate uncertainty and sensitivity analyses, especially around exposure to weather and climate variability and extremes, but this remains a computational modeling challenge. Commercial production cost models (PCMs) have shorter runtimes, but also important limitations (opacity, license restrictions) that do not fully support stochastic simulation. Open-source PCMs represent a potential solution. They allow for multiple, simultaneous runs in high-performance computing environments and offer flexibility in model parameterization. Yet, developers must balance computational speed (i.e. runtime) with model fidelity (i.e. accuracy). In this paper, we present Grid Operations (GO), a framework for instantiating open-source, scale-adaptive PCMs. GO allows users to search across parameter spaces to identify model versions that appropriately balance computational speed and fidelity based on experimental needs and resource limits. Results provide generalizable insights on how to navigate the fidelity and computational speed tradeoff through parameter selection. We show that models with coarser network topologies can accurately mimic market operations, sometimes better than higher-resolution models. It is thus possible to conduct large simulation experiments that characterize operational risks related to climate and weather extremes while maintaining sufficient model accuracy.

42 ENGINEERING↗
DOE OSTI2025

Optimization-Based Data-Driven Approach for Detecting Fault Location in Power Systems

In grids with large penetration of converterinterfaced resources (CIRs), measurements of voltage, current, and line parameters can fluctuate significantly during fault conditions. These fluctuations, combined with complex network topologies and extensive system branching, make accurate fault location challenging. Faults, such as short circuits, can cause prolonged outages with serious socio-economic impacts, highlighting the need for rapid fault identification to minimize downtime. However, current fault detection methods—such as relays and digital fault recorders—often relay information too slowly, impeding swift corrective action. Given the limited availability of high-resolution phasor measurement units, this paper introduces an optimization-based observer to estimate fault locations, grid line parameters, and voltages using local CIR measurements. To preserve the confidentiality of CIRs and enhance estimation accuracy, this study uses a black-box model of CIRs. This bottom-up, event-driven approach can enhances protection and control systems through optimized and real-time fault detection. Simulation results show that the optimization-based data-driven observer can accurately detect fault locations and estimate grid states and parameters, providing valuable insights for utilities and operators in grid applications.

Subedi, Sunil [ORNL] (ORCID:000000034069090X)↗
DOE OSTI2020

Deep Generative Models that Solve PDEs: Distributed Computing for Training Large Data-Free Models

Recent progress in scientific machine learning (SciML) has opened up the possibility of training novel neural network architectures that solve complex partial differential equations (PDEs). Several (nearly data free) approaches have been recently reported that successfully solve PDEs, with examples including deep feed forward networks, generative networks, and deep encoder-decoder networks. However, practical adoption of these approaches is limited by the difficulty in training these models, especially to make predictions at large output resolutions (≥1024×1024). Here we report on a software framework for data parallel distributed deep learning that resolves the twin challenges of training these large SciML models - training in reasonable time as well as distributing the storage requirements. Our framework provides several out of the box functionality including (a) loss integrity independent of number of processes, (b) synchronized batch normalization, and (c) distributed higher-order optimization methods. We show excellent scalability of this framework on both cloud as well as HPC clusters, and report on the interplay between bandwidth, network topology and bare metal vs cloud. We deploy this approach to train generative models of sizes hitherto not possible, showing that neural PDE solvers can be viably trained for practical applications. We also demonstrate that distributed higher-order optimization methods are 2-3× faster than stochastic gradient-based methods and provide minimal convergence drift with higher batch-size.

PDEs↗
DOE OSTI2024

Deep Reinforcement Learning for Microgrid Cost Optimization Considering Load Flexibility

This paper proposes a novel Soft-Actor-Critic (SAC) based Deep Reinforcement Learning (DRL) method for optimizing the cost of microgrid operation by leveraging load flexibility. The proposed SAC-DRL method is designed to coordinate the control of distributed energy resources (DERs) and flexible load, addressing practical energy billing formation by power distribution utilities. Key contributions include an innovative reward function to mitigate sparse reward challenges and a mixed control strategy for discrete and continuous variables, ensuring radial network topology and minimizing power loss. We evaluate the proposed method on the model of a real microgrid located in Southern California, U.S.. The SAC-DRL model is tested to demonstrate its efficacy in reducing grid dependence, optimizing resource use, and minimizing costs. The results highlight the potential of DRL in modern energy systems, offering a sustainable and economically efficient solution for energy management in microgrids.

deep reinforcement learning↗
DOE OSTI2023

A Randomization-Based, Zero-Trust Cyberattack Detection Method for Hierarchical Systems

This paper demonstrates a novel randomization-based approach for verifying power system control signals with application to detecting cyberattacks. We consider fully connected hierarchical systems containing multiple local agents and a global "trust" agent. The global agent uses a time-varying randomized assignment scheme to identify corrupt network links based on principles of zero trust and majority rule. To evaluate the performance of this detection approach, we implement our algorithm in MATLAB and run it against nearly 43 million unique attack scenarios spanning a range of system sizes. For each scenario, the algorithm determines whether the identified corruptions satisfy a set of validity constraints reflecting network topology and uses that result to say whether the recovered state value for one or more local agents is malicious. We compare the algorithm's determination to the true state of the system to assess performance and find that classification accuracy converges to 100% as system size increases, suggesting that the validity constraints become more difficult to satisfy for larger systems. We further explore the scenarios that evade detection to understand practical implications for employing this detection approach.

cybersecurity↗
DOE OSTI2020

Computation-Efficient Algorithm for Distributed Feedback Optimization of Distribution Grids

Feedback-based optimization algorithms use real-time measurements to update the optimal control for the underlying system which may not be fully identified. Recently, we have developed a distributed feedback-based algorithm [1] that avoids the requirement of fast communication between central computing and local actuator/sensor agents. This paper extends the work by greatly reducing the number of copies of variables involved in the distributed feedback-based algorithm, which results in faster convergence and lower communication requirement. The main idea is to leverage the specific structural properties of the admittance matrix for distribution systems with tree network topology. We also show the effectiveness of the proposed algorithm in simulations.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2021

Decentralized Collaborative Learning with Probabilistic Data Protection

We discuss future directions of Blockchain as a collaborative value co-creation platform, in which network participants can gain extra insights that cannot be accessed when disconnected from the others. As such, we propose a decentralized machine learning framework that is carefully designed to respect the values of democracy, diversity, and privacy. Specifically, we propose a federated multi-task learning framework that integrates a privacy-preserving dynamic consensus algorithm. We show that a specific network topology called the expander graph dramatically improves the scalability of global consensus building. We conclude the paper by making some remarks on open problems.

Ide, Tsuyoshi↗
DOE OSTI2020

Training Spiking Neural Networks Using Combined Learning Approaches

Spiking neural networks (SNNs), the class of neural networks used in neuromorphic computing, are difficult to train using traditional back-propagation techniques. Spike timingdependent plasticity (STDP) is a biologically inspired learning mechanism that can be used to train SNNs. Evolutionary algorithms have also been demonstrated as a method for training SNNs. In this work, we explore the relationship between these two training methodologies. We evaluate STDP and evolutionary optimization as standalone methods for training networks, and also evaluate a combined approach where STDP weight updates are applied within an evolutionary algorithm. We also apply Bayesian hyperparameter optimization as a meta learner for each of the algorithms. We find that STDP by itself is not an ideal learning rule for randomly connected networks, while the inclusion of STDP within an evolutionary algorithm leads to similar performance, with a few interesting differences. This study suggests future work in understanding the relationship between network topology and learning rules.

Elbrecht, Daniel↗
DOE OSTI2021

TPCPF: Three-Phase Continuation Power Flow Tool for Voltage Stability Assessment of Distribution Networks With Distributed Energy Resources

This article presents a three-phase unbalanced continuation power flow algorithm for voltage stability assessment of distribution systems with high penetration of distributed energy resources (DERs). Analyzing distribution system voltage stability with DER will allow high penetration of renewable energy necessary for the sustainability goals. The developed algorithm can analyze voltage stability for both the meshed and radial systems and the balanced and unbalanced three-phase distribution systems. The developed tool allows the voltage stability analysis to facilitate the planning, operation, control, and distribution system management. The impact of DER on the voltage stability of several test cases has been analyzed considering constant power (P Q) and regulated-voltage (P V ) modes of operation for DER units. Moreover, different voltage stability case studies are presented to demonstrate the impact of unbalance, load increment, and network topology on the maximum loading capacity. Finally, results using the IEEE 13-node feeder, the 18-bus balanced shipboard system, the 13-node CIGRE benchmark system, and the 136-bus redial distribution feeder demonstrate that the developed continuation power flow tool can efficiently perform voltage stability analysis for active distribution systems.

42 ENGINEERING↗
DOE OSTI2021

Online PMU Missing Value Replacement Via Event-Participation Decomposition

We introduce a new method for online Phasor Measurement Unit (PMU) missing value replacement. Our approach allows us to decompose PMU event responses into a non-dynamic component (denoted the participation factor) that can be inferred directly from the past and a dynamic component that can be inferred directly from all other PMUs (denoted the event strength). When missing values occur, we can use these two components, which do not rely on the missing index, to estimate the correct value. The method is extremely fast and can easily be used for online applications. Furthermore, extensive testing on real power system event data reveals that our approach achieves state-of-the-art performance in terms of Mean Absolute Percent Errors (MAPEs) for PMU data dropped during event periods. Here, the method also yields an interpretable and simplified view of events for further analysis and applications. The method relies only on PMU data and does not take outside information such as network topology.

24 POWER TRANSMISSION AND DISTRIBUTION↗