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 181 records · Page 10
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Load Shed Recovery With Transmission Switching and Intentional Islanding Methods After (N-2) Line Contingencies

Changing power system configuration may result in load shed recovery (LSR) because topology change can provide power flow control in meshed network. Some topologies may favor generation redispatch as compared to others and can eliminate line congestion which leads to LSR. One of the known methods for topology change is called transmission switching (TS) and research conducted in the past showed that TS is an effective means of mitigating load shedding. Another method of topology control is intentional islanding (IIS). In this manuscript, we explore IIS as a potential solution for LSR. IIS based on generator coherency has been presented in literature for mitigating cascading failures. However, IIS has not been explored solely as a LSR mechanism. In this paper, we compare the LSR based on IIS with well known LSR algorithm based on TS. The comparison is performed for IEEE 39-bus system and IEEE 118- bus system. The results show that IIS has a potential to perform better than TS in terms of computational efficiency and LSR.

42 ENGINEERING↗
DOE OSTI2022

SMALE: Enhancing Scalability of Machine Learning Algorithms on Extreme-Scale Computing Platforms

Deployment and execution of machine learning tasks on extreme-scale computing platforms face several significant technical challenges: 1) High computing cost incurred by dense networks – The computing workload of deep networks with densely-connected topology increases rapidly with the network size, imposing a non-scalable computing model of extreme-scale computing platforms; 2) Non-optimized workload distribution – Many advanced deep learning algorithms, e.g., sparsification and irregular net-work topology, produce very unbalanced workload distribution on extreme-scale computing platforms. The computation efficiency is greatly hindered by the incurred data and computation redundancies as well as long tails of the node with extensive workload; 3) Constraints in data movement and I/O bottle-neck – Inter-node data movement in extreme-scale computing platforms are associated with high energy and latency costs, and subject to the constraints of I/O bandwidth; and 4) Generalization of algorithm realization and acceleration on computing platforms – The large varieties of machine learning algorithms and structures of extreme-scale computing platforms make the derivation of a generalized algorithm realization and acceleration method very challenging, which, however, is the requirement by domain scientists and interested users. We call the above challenges Smale’s Problems in Machine Learning and Understanding for High-Performance Computing Scientific Discovery. The objective of our three-year research project is to develop a holistic innovation set at structure, assembly, and acceleration layers of machine learning algorithms to address the above challenges in algorithm deployment and execution. Three tasks are particularly performed, including: At the algorithm structure level, we investigate the techniques that can structurally sparsify on the topology of deep networks for computing workload reduction. We also study clustering and pruning techniques that can optimize the workload distributions over the extreme-scale computing platforms; At the algorithm assembly level, we derive a unified learning framework for unsupervised transfer learning and dynamic growing capabilities. Novel training methods are also exploited to enhance the training efficiency of the proposed framework; At the algorithm acceleration level, we will develop a series of techniques that can accelerate the computation of sparse matrix operations, which are one of the core executions in deep learning and optimize memory access of the concerned platforms. Our proposed techniques attack the fundamental problems in machine learning algorithms running on extreme-scale computing platforms by vertically integrating the solutions at three closely entangled layers, paving the long-term scaling path of machine learning applications under DOE context. Three tasks corresponding to the above respective research orientations are performed during the three-year project period with our collaborators at ORNL. The outcome of the proposed project is anticipated to form a holistic solution set of novel algorithms and network topologies, efficient training techniques, and fast acceleration methods to promote the computing scalability of the machine learning applications of particular interest to DOE.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Switch Opening and Exchange Method for Stochastic Distribution Network Reconfiguration

The purpose of distribution network reconfiguration (DNR) is to determine the optimal topology of an electricity distribution network, which is an efficient measure to reduce network power losses. Electricity load demand and photovoltaic (PV) output are uncertain and vary with time of day, and will affect the optimal network topology. Single-hour deterministic DNR is incapable of handling this uncertainty and variability. Therefore, this paper proposes to solve a multi-hour stochastic DNR (SDNR). Existing solution methods for DNR are either inaccurate or excessively time-consuming, and are therefore incapable of solving multi-hour SDNRs for large distribution networks. In this regard, a switch opening and exchange (SOE) method is proposed. Starting from a looped network with all switches closed, the SOE consists of three steps. The first step is to sequentially open the switches until all of the loops are opened. The second and third steps modify the status of branches obtained in the first step to obtain better radial topologies. Five test systems are used to validate the accuracy and fast solution speed of the SOE and the superiority of multi-hour SDNR over single-hour deterministic DNR.

distribution network reconfiguration↗
DOE OSTI2020

Active Betweenness Cardinality: Algorithms and Applications

Centrality rankings such as degree, closeness, betweenness, Katz, PageRank, etc. are commonly used to identify critical nodes in a graph. These methods are based on two assumptions that restrict their wider applicability. First, they assume the exact topology of the network is available. Secondly, they do not take into account the activity over the network and only rely on its topology. However, in many applications, the network is autonomous, vast, and distributed, and it is hard to collect the exact topology. At the same time, the underlying pairwise activity between node pairs is not uniform and node criticality strongly depends on the activity on the underlying network. In this paper, we propose active betweenness cardinality, as a new measure, where the node criticalities are based on not the static structure, but the activity of the network. We show how this metric can be computed efficiently by using only local information for a given node and how we can find the most critical nodes starting from only a few nodes. We also show how this metric can be used to monitor a network and identify failed nodes. We present experimental results to show effectiveness by demonstrating how the failed nodes can be identified by measuring active betweenness cardinality of a few nodes in the system.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Shuttling Majorana zero modes in disordered and noisy topological superconductors

The braiding of Majorana zero modes (MZMs) forms the fundamental building block for topological quantum computation. Braiding protocols which involve the physical exchange of MZMs are typically envisioned on a network of topological superconducting wires. An important component of these protocols is the transport of MZMs, which can be performed by using electric gates to locally tune sections of the wire between topologically trivial and nontrivial phases. In this work, we numerically simulate this transport by tuning a single section of a superconducting wire which contains either disorder (uncorrelated and correlated) or noise. We focus on the impact of these additional effects on the diabatic error, which describes unwanted transitions between the ground state and excited states. We show that the behavior of the average diabatic error is predominantly controlled by the statistics of the minimum bulk energy gap which is suppressed in the presence of disorder. The increase in diabatic error can be several orders of magnitude and is most deleterious when the disorder correlation length is a finite fraction of the transport distance and negligible when these lengths are far apart. In the presence of noise, the diabatic error is significantly enhanced due to optical transitions which depend on the minimum bulk energy gap as well as the frequency modes present in the noise. The results presented here serve to further characterize the diabatic error in disordered and noisy settings, which are important considerations in practical implementations of physical braiding schemes.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2023

Ensemble models for circuit topology estimation, fault detection and classification in distribution systems

This paper presents a methodology for simultaneous fault detection, classification, and topology estimation for adaptive protection of distribution systems. The methodology estimates the probability of the occurrence of each one of these events by using a hybrid structure that combines three sub-systems, a convolutional neural network for topology estimation, a fault detection based on predictive residual analysis, and a standard support vector machine with probabilistic output for fault classification. The input to all these sub-systems is the local voltage and current measurements. A convolutional neural network uses these local measurements in the form of sequential data to extract features and estimate the topology conditions. The fault detector is constructed with a Bayesian stage (a multitask Gaussian process) that computes a predictive distribution (assumed to be Gaussian) of the residuals using the input. Since the distribution is known, these residuals can be transformed into a Standard distribution, whose values are then introduced into a one-class support vector machine. The structure allows using a one-class support vector machine without parameter cross-validation, so the fault detector is fully unsupervised. Finally, a support vector machine uses the input to perform the classification of the fault types. All three sub-systems can work in a parallel setup for both performance and computation efficiency. In conclusion, we test all three sub-systems included in the structure on a modified IEEE123 bus system, and we compare and evaluate the results with standard approaches.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

Interface diagnostics platform for thin-film solid-state batteries

Understanding the impedances of battery materials and their interfaces remains a major challenge, usually addressed by electrochemical impedance spectroscopy (EIS) where frequency-dependent complex impedance of full battery cells is measured and then modeled by a network of connected electrical elements. As conventionally applied, this approach produces ambiguity in that (1) multiple different network configurations may fit the data convincingly and (2) the method offers no direct association of the electrical elements with physical features of the battery. Here we present a new methodology that resolves both sources of ambiguity, enabled by expanding the experimental scope to directly inform the configuration of elements and their parameters in the network model. We demonstrate this methodology using thin film fabrication of solid state battery devices patterned by shadow masked sputter deposition, so that diagnostic devices corresponding to individual interface and material components can be fabricated simultaneously with full cell batteries. EIS models for the diagnostic devices can then be connected to form full cell networks whose topology matches the well-known physical configuration of the battery. When connected in this way, the full network model – made from connecting the diagnostic device EIS models – fits the full cell EIS data. For the case of a thin film solid state battery composed of amorphous silicon anode, lithium phosphorus oxynitride (LiPON) solid electrolyte, and lithium vanadium oxide (Li x V 2 O 5 ) cathode, we show that the approach allows us to identify ionic impedance/conductivity of the cathode/electrolyte as a limiting impedance and the anode/electrolyte interface cycling instability as a primary degradation factor.

25 ENERGY STORAGE↗
DOE OSTI2022

Deep Reinforcement Learning based Model-free On-line Dynamic Multi-Microgrid Formation to Enhance Resilience

Multi-microgrid formation (MMGF) is a promising solution for enhancing power system resilience. This paper proposes a new deep reinforcement learning (RL) based model-free on-line dynamic MMGF scheme. Additionally, the dynamic MMGF problem is formulated as a Markov decision process, and a complete deep RL framework is specially designed for the topologytransformable micro-grids. In order to reduce the large action space caused by flexible switch operations, a topology transformation method is proposed and an action-decoupling Q-value is applied. Then, a convolutional neural network (CNN) based multi-buffer double deep Q-network (CM-DDQN) is developed to further improve the learning ability of the original DQN method. The proposed deep RL method provides real-time computing to support the on-line dynamic MMGF scheme, and the scheme handles a long-term resilience enhancement problem using an adaptive on-line MMGF to defend changeable conditions. The effectiveness of the proposed method is validated using a 7-bus system and the IEEE 123-bus system. The results show strong learning ability, timely response for varying system conditions and convincing resilience enhancement.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2026

A Review of Software for Designing and Operating Quantum Networks

Quantum networks development is crucial to realizing a production-grade network that can support distributed sensing, secure communication, and utility-scale quantum computation. However, the transition from laboratory demonstration to deployable networks requires software implementations of architectures and protocols tailored to the unique constraints of quantum systems. This paper reviews the current state of software implementations for quantum networks, organized around a three-plane abstraction of infrastructure, logical, and control/service planes. We cover software for both designing quantum network protocols (e.g., SeQUeNCe, QuISP, and NetSquid) and operating testbeds, with a focus on essential control/service plane functions such as entanglement, topology, and resource management, in a proposed taxonomy. Our review highlights a persistent gap between theoretical architecture and protocol proposals and their realization in simulators or testbeds, particularly in dynamic topology and network management. We conclude by outlining open challenges and proposing a roadmap for developing scalable software architectures to enable hybrid, large-scale quantum networks.

Network Design↗
DOE OSTI2020

Flow-Driven Branching in a Frangible Porous Medium

Channel formation and branching is widely seen in physical systems where movement of fluid through a porous structure causes the spatiotemporal evolution of the medium. We provide a simple theoretical framework that embodies this feedback mechanism in a multiphase model for flow through a frangible porous medium with a dynamic permeability. Numerical simulations of the model show the emergence of branched networks whose topology is determined by the geometry of external flow forcing. Furthermore, this allows us to delineate the conditions under which splitting and/or coalescing branched network formation is favored, with potential implications for both understanding and controlling branching in soft frangible media.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Cuboidal Liquid Crystal Phases Under Multiaxial Geometrical Frustration.

Cuboidal liquid crystal phases - the so-called blue phases - consist of a network of topological defects arranged into a cubic symmetry. They exhibit striking optical properties, including Bragg reflection in the visible range and fast response times. Confining surfaces can interfere with the packing of such a network, leading to structures that have not been explored before. In this work, a Landau-de Gennes free energy formalism for the tensor alignment field Q is used to investigate the behavior of chiral liquid crystals under non-isotropic confinement. The underlying free energy functional is solved by relying on a Monte Carlo method that facilitates efficient exploration of configuration space. The results of simulations are expressed in terms of phase diagrams as a function of chirality and temperature for three families of spheroids: oblate, spherical, and prolate. Upon deformation, blue phases adapt and transform to accommodate the geometrical constraints, thereby resulting in a wider range of thermal stability. For oblate spheroids, confinement interferes with the development of a full blue phase structure, resulting on a combination of half skyrmions. For prolate spheroids, the blue phases are hybridized and exhibit features of blue phases I and II. More generally, it is shown that mechanical deformation provides an effective means to control, manipulate and stabilize blue phases and cholesterics confined in tactoids.

Palacio-Betancur, Viviana↗
DOE OSTI2026

Graph Identification of Proteins in Tomograms (GRIP-Tomo) 2.0: Topologically aware classification for proteins

Cryo-electron tomography (cryo-ET) enables structural characterization of biomolecules under near-native conditions. Existing approaches for interpreting the resulting three-dimensional volumes are computationally expensive and have difficulty interpreting density associated with small proteins/complexes. To explore alternate approaches for identifying proteins in cryo-ET data we pursued a Graph Network and topologically invariant approach. Here, we report on a fast algorithm that classifies particles by searching for nuances of evolutionarily conversed motifs and the geometrical characteristics of protein structure. GRIP-Tomo 2.0 is a machine-learning pipeline that extracts interpretable topological features of protein structures within noisy experimental backgrounds. Compared to version 1.0, the new pipeline includes three upgrades that significantly improve performance including synthetic tomogram generation simulating realistic noise, graph-based persistent feature extraction as protein fingerprints, and high-performance computing acceleration. GRIP-Tomo 2.0 achieves over 90% accuracy in classifying between proteins and noise using both real and synthetic datasets which represents a foundational step toward advancing cryo-ET workflows and empowering automated visual proteomics.

Li, Chengxuan↗
DOE OSTI2025

Gene network centrality analysis identifies key regulators coordinating day-night metabolic transitions in Synechococcus elongatus PCC 7942 despite limited accuracy in predicting direct regulator-gene interactions

Synechococcus elongatus PCC 7942 is a model organism for studying circadian regulation and bioproduction, where precise temporal control of metabolism significantly impacts photosynthetic efficiency and CO 2 -to-bioproduct conversion. Despite extensive research on core clock components, our understanding of the broader regulatory network orchestrating genome-wide metabolic transitions remains incomplete. We address this gap by applying machine learning tools and network analysis to investigate the transcriptional architecture governing circadian-controlled gene expression. While our approach showed moderate accuracy in predicting individual transcription factor-gene interactions - a common challenge with real expression data - network-level topological analysis successfully revealed the organizational principles of circadian regulation. Our analysis identified distinct regulatory modules coordinating day-night metabolic transitions, with photosynthesis and carbon/nitrogen metabolism controlled by day-phase regulators, while nighttime modules orchestrate glycogen mobilization and redox metabolism. Through network centrality analysis, we identified potentially significant but previously understudied transcriptional regulators: HimA as a putative DNA architecture regulator, and TetR and SrrB as potential coordinators of nighttime metabolism, working alongside established global regulators RpaA and RpaB. This work demonstrates how network-level analysis can extract biologically meaningful insights despite limitations in predicting direct regulatory interactions. The regulatory principles uncovered here advance our understanding of how cyanobacteria coordinate complex metabolic transitions and may inform metabolic engineering strategies for enhanced photosynthetic bioproduction from CO 2 .

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2025

Improving Cyber Situational Understanding

Effective cybersecurity operations require the ability to analyze large amounts of information to assess security risks and formulate defensive strategies against adversaries. This has become more complex in recent years as the sprawl and interconnectivity of devices grows through implementation of virtualization, cloud computing, and Internet of Things (IoT). The amount of data and analysis required for effective cybersecurity command and control decisions far exceeds humans’ capacity to perform manually. We characterize the analysis problem as cyber situational understanding. The research presented to improve cyber situational understanding focuses on vulnerability analysis and threat intelligence. Regarding vulnerabilities, entities must analyze and plan work for between thousands and tens of thousands of software vulnerabilities annually. Entities heavily use network firewalls to limit vulnerability exposure. As a result, some of these vulnerabilities permit exposure to adversarial exploitation, whereas others are inaccessible and therefore present negligible risk of exploitation. Distinguishing between high and low risk software vulnerabilities requires a deep understanding of the vulnerability, network firewall protection, and characteristics of the targeted device. This problem is solved by extracting network service features from vulnerability data features using both machine-learning and natural language processing. Then, the network firewall topology is parsed to determine which vulnerabilities are reachable by adversaries. Ultimately, a state-based safety analysis ascertains which vulnerabilities are unsafe. A related vulnerability analysis problem occurs in cybersecurity operations when associating an entity’s hardware and software assets to public vulnerability databases. Assets often reveal hardware and software through installation artifacts and network service identification, and entities store these artifacts in inventory databases. However, software and hardware vendors apply a standard Common Platform Enumeration (CPE) naming convention when publicly reporting vulnerabilities. Associating these two datasets often requires many hours to days of manual inspection. The proposed solution automates the mapping approach of human analysts using fuzzy matching techniques, natural language processing, and, ultimately, machine learning to present a small set of recommendations for mapping the two datasets. The result significantly reduces human analysis time and reduces the occurrence of false positives in vulnerability notifications. Finally, cyber threat intelligence (CTI) requires associating cyber observable artifacts, such as IP addresses, URIs, and file hashes, with cyber threat tactics, techniques, and procedures. Unfortunately, most CTI data is compartmentalized across multiple organizations and cannot be shared due to the legal and reputational risk with cyber threat being associated with the entity. The approach to solving this problem inovlves using a distributed ledger with anonymous token spending and authentication. This allows a consortium of semi-trusted entities to share the workload of curating CTI for a threat sharing community’s cooperative benefit.

Huff, Philip↗
DOE OSTI2021

Multisource Data Fusion Outage Location in Distribution Systems via Probabilistic Graphical Models

Efficient outage location is critical to enhancing the resilience of power distribution systems. However, accurate outage location requires combining massive evidence received from diverse data sources, including smart meter (SM) last gasp signals, customer trouble calls, social media messages, weather data, vegetation information, and physical parameters of the network. This is a computationally complex task due to the high dimensionality of data in distribution grids. In this paper, we propose a multi-source data fusion approach to locate outage events in partially observable distribution systems using Bayesian networks (BNs). A novel aspect of the proposed approach is that it takes multi-source evidence and the complex structure of distribution systems into account using a probabilistic graphical method. Our method can radically reduce the computational complexity of outage location inference in high-dimensional spaces. The graphical structure of the proposed BN is established based on the network’s topology and the causal relationship between random variables, such as the states of branches/customers and evidence. Utilizing this graphical model, accurate outage locations are obtained by leveraging a Gibbs sampling (GS) method, to infer the probabilities of de-energization for all branches. Compared with commonly-used exact inference methods that have exponential complexity in the size of the BN, GS quantifies the target conditional probability distributions in a timely manner. As a result, a case study of several real-world distribution systems is presented to validate the proposed method.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2020

Bus Clustering for Distribution Grid Topology Identification

Recovering the distribution grid topology is essential to perform several distribution system operator functions. Many algorithms that address the topology recovery problem have already been proposed in the literature. Most are based on a priori information regarding which buses are fed by which substation; however, this information might not be available because frequent grid reconfigurations change the distribution grid portion connected to each substation. This paper addresses the problem of assigning every substation the set of buses that it is feeding, given field data. First, the aforementioned task is cast as a nonconvex optimization problem. Second, a relaxed version of the optimization problem is solved via the alternating direction method of multipliers. Finally, the performance of our approach is validated through numerical simulations of realistic scenarios using a standard IEEE benchmark feeder.

bus clustering↗
DOE OSTI2024

Wormholes without averaging

After averaging over fermion couplings, SYK has a collective field description that sometimes has “wormhole” solutions. We study the fate of these wormholes when the couplings are fixed. Working mainly in a simple model, we find that the wormhole saddles persist, but that new saddles also appear elsewhere in the integration space — “half-wormholes.” The wormhole contributions depend only weakly on the specific choice of couplings, while the half-wormhole contributions are strongly sensitive. The half-wormholes are crucial for factorization of decoupled systems with fixed couplings, but they vanish after averaging, leaving the non-factorizing wormhole behind.

1/N Expansion↗
DOE OSTI2022

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

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

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗