Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Network topologies”

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 109 records · Page 6

Real-Time Model-Adaptive Relaying Applied to Microgrid Protection

In microgrids, the short-circuit current magnitude is significantly limited by more than an order of magnitude due to the relatively small inverter-based resources. Commercially available protective devices for distribution cannot reliably protect a microgrid due to their dependence on the magnitude of the fault current. Moreover, overcurrent relays typically cannot function properly for a microgrid because they are incapable of detecting faults and/or performing the coordination between the relays in inverter-based microgrids operated in the islanded mode. This paper proposes a model-adaptive relay designed to adjust the relay curves based on the available generation and the network topology. The proposed method runs a real-time model of the microgrid, which gathers information from the network to calculate the available short-circuit current in the specified node. The fault current from the model is then used for the adaptive algorithm to calculate the relay settings, considering coordination with the downstream fuses and upstream reclosers. This work presents the validation of the proposed method in Hardware-in-the-Loop, in a hardware testbed as well as field deployed in a real microgrid in East-Tennessee.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Optimal Network Reconfiguration and Scheduling With Hardware-in-the-Loop Validation for Improved Microgrid Resilience

With the increased occurrence of various major extreme weather events, power outages and prompt power system restorations have recently drawn more attention to the resilience and recovery of power systems. From the perspective of a more resilient power delivery at the distribution grid, system restoration using network topology reconfiguration together with optimal scheduling of distributed energy resources are adopted in this paper. The proposed optimization model aims at minimizing the total load shedding cost and other operational costs, in which linearized topological constraints borrowed from graph theory and linearized DistFlow models are respectively used to maintain the radial network topology and power flow balance after system contingencies. To demonstrate the applicability of the proposed strategy, a real-world case study of a networked three-microgrid system in Adjuntas, Puerto Rico, is used with the consideration of different independent/interconnected microgrid scenarios, contingencies, and fairness settings. Furthermore, hardware-in-the-loop testing is conducted for the same three-microgrid network, where the closely matched results with the simulated ones have validated the effectiveness of the proposed restoration strategy, which is now ready to move one step forward towards field deployment. Finally, to test the proposed restoration strategy in a larger networked system, the modified IEEE-33 bus test distribution system is considered, and the results show a more resilient power delivery for critical loads under three and four line outages.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Luminescent pillared Ln{sup III}–Zn{sup II} heterometallic coordination frameworks with two kinds of N-heterocyclic carboxylate ligands

In our efforts toward rational design and systematic synthesis of ‘pillar-layer’ structure coordination frameworks, four new Ln{sup III}–Zn{sup II} heterometallic coordination polymers (CPs) based on two kinds of N-heterocyclic carboxylic ligands with formula ([LnZn(L1){sub 2}(L2)(H{sub 2}O){sub m}]·nH{sub 2}O){sub ∞} (Ln=La (1), Eu (2), Gd (3) and Dy (4), m=3 (for 1) and 2 (for 2–4), n=8 (for 1) and 7 (for 2–4), H{sub 2}L1=pyridine-2,3-dicarboxylate acid, HL2=isonicotinic acid), have been synthesized under hydrothermal reaction of Ln{sub 2}O{sub 3}, ZnO, H{sub 2}L1 and HL2. CP 1 has a three-dimensional (3D) structure with a (3,6)-connected sit topology network, while CPs 2–4 are isostructural with 3D single-node pcu alpha-Po topology network. Also, luminescent properties of these CPs have also been investigated. The emission of 1 and 3 should be attributed to the coordination-perturbed ligand-centered luminescence and the emission spectra of 2 and 4 show the characteristic bands of the corresponding Ln{sup III} ions. - Graphical abstract: Four new 3D Ln{sup III}–Zn{sup II} coordination frameworks with “pillar-layer” sit or pcu alpha-Po topology have been successfully obtained. Moreover, the photoluminescent properties of compounds 1–4 have also been investigated. - Highlights: • Four new Ln{sup III}–Zn{sup II} heterometallic coordination frameworks with two types of topologies have been synthesized. • Metal oxides and two kinds of N-heterocyclic carboxylate ligands were used for the construction of targeted coordination polymers. • The luminescent properties of the coordination polymers are investigated.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Evaluation of low-exergy heating and cooling systems and topology optimization for deep energy savings at the urban district level

District energy systems have the potential to achieve deep energy savings by leveraging the density and diversity of loads in urban districts. However, planning and adoption of district thermal energy systems is hindered by the analytical burden and high infrastructure costs. It is hypothesized that network topology optimization would enable wider adoption of advanced (ambient temperature) district thermal energy systems, resulting in energy savings. In this study, energy modeling is used to compare the energy performance of “conventional” and “advanced” district thermal energy systems at the urban district level, and a partial exhaustive search is used to evaluate a heuristic for the topology optimization problem. For the prototypical district considered, advanced district thermal energy systems mated with low-exergy building heating and cooling systems achieved a source energy use intensity that was 49% lower than that of conventional systems. The minimal spanning tree heuristic was demonstrated to be effective for the network topology optimization problem in the context of a prototypical district, and contributes to mitigating the problem’s computational complexity. The work presented in this paper demonstrates the potential of advanced district thermal energy systems to achieve deep energy savings, and advances to addressing barriers to their adoption through topology optimization.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Hierarchical Network Partitioning for Solution of Potential-Driven, Steady-State Nonlinear Network Flow Equations

The solution of potential-driven steady-state flow in large networks is a task which manifests in various engineering applications, such as transport of natural gas or water through pipeline networks. The resultant system of nonlinear equations depends on the network topology, and in general, there is no numerical algorithm that offers guaranteed convergence to the solution (assuming a solution exists). Some methods offer guarantees in cases where the network topology satisfies certain assumptions, but these methods fail for larger networks. On the other hand, the Newton-Raphson algorithm offers a convergence guarantee if the starting point lies close to the (unknown) solution. It would be advantageous to compute the solution of the large nonlinear system through the solution of smaller nonlinear sub-systems wherein the solution algorithms (Newton-Raphson or otherwise) are more likely to succeed. Here, this letter proposes and describes such a procedure, a hierarchical network partitioning algorithm that enables the solution of large nonlinear systems corresponding to potential-driven steady-state network flow equations.

42 ENGINEERING↗

Synchronization in Complex Oscillator Networks and Smart Grids

The emergence of synchronization in a network of coupled oscillators is a fascinating topic in various scientific disciplines. A coupled oscillator network is characterized by a population of heterogeneous oscillators and a graph describing the interaction among them. It is known that a strongly coupled and sufficiently homogeneous network synchronizes, but the exact threshold from incoherence to synchrony is unknown. Here we present a novel, concise, and closed-form condition for synchronization of the fully nonlinear, non-equilibrium, and dynamic network. Our synchronization condition can be stated elegantly in terms of the network topology and parameters, or equivalently in terms of an intuitive, linear, and static auxiliary system. Our results significantly improve upon the existing conditions advocated thus far, they are provably exact for various interesting network topologies and parameters, they are statistically correct for almost all networks, and they can be applied equally to synchronization phenomena arising in physics and biology as well as in engineered oscillator networks such as electric power networks. We illustrate the validity, the accuracy, and the practical applicability of our results in complex networks scenarios and in smart grid applications.

36 MATERIALS SCIENCE↗

Parallel Simulation of Quantum Networks with Distributed Quantum State Management

Quantum network simulators offer the opportunity to cost-efficiently investigate potential avenues for building networks that scale with the number of users, communication distance, and application demands by simulating alternative hardware designs and control protocols. Several quantum network simulators have been recently developed with these goals in mind. As the size of the simulated networks increases, however, sequential execution becomes time-consuming. Parallel execution presents a suitable method for scalable simulations of large-scale quantum networks, but the unique attributes of quantum information create unexpected challenges. In this work, we identify requirements for parallel simulation of quantum networks and develop the first parallel discrete-event quantum network simulator by modifying the existing serial simulator SeQUeNCe. Our contributions include the design and development of a quantum state manager (QSM) that maintains shared quantum information distributed across multiple processes. We also optimize our parallel code by minimizing the overhead of the QSM and decreasing the amount of synchronization needed among processes. Using these techniques, we observe a speedup of 2 to 25 times when simulating a 1,024-node linear network topology using 2 to 128 processes. We also observe an efficiency greater than 0.5 for up to 32 processes in a linear network topology of the same size and with the same workload. We repeat this evaluation with a randomized workload on a caveman network. We also introduce several methods for partitioning networks by mapping them to different parallel simulation processes. We have released the parallel SeQUeNCe simulator as an open source tool alongside the existing sequential version.

97 MATHEMATICS AND COMPUTING↗

A resilient network recovery framework against cascading failures with deep graph learning

Because of the increasing importance and dependencies of infrastructure networks and the potential for massive cascading failures in real-world network systems, maintenance optimization to effectively reduce system performance loss caused by diverse disruptions is of significant interest among researchers and practitioners. In this work, a new recovery framework was developed to rapidly identify important system components for maintenance to improve network resilience against cascading failures. Here this work provides distinct advantages to determine an optimal maintenance priority by combining real-time network structure importance with other maintenance prioritization based on customer preference. This approach adopts structural graph embedding and deep reinforcement learning to extract real-time network topology information (such as minimum vertex cover) to update the maintenance priority during the recovery process. Based on the case studies on synthetic networks and a US airport network, the proposed recovery framework with real-time network topology awareness shows better performance than other maintenance prioritization strategies regarding resilience enhancement. This work improves the understanding of how the changing network structure influences maintenance effects. It also provides insights of the practical usefulness of advanced deep learning on helping optimal maintenance prioritization to effectively reduce the intensity and extent of cascading failures.

42 ENGINEERING↗

Topological effects on separation of alkane isomers in metal–organic frameworks

Polymorphism in metal–organic frameworks (MOFs) means that the same chemical building blocks (nodes and linkers) can be used to construct isomeric MOFs with different topological networks. The choice of topology can substantially impact the pore network of the MOF, changing the sizes and shapes of the pores, which has implications for adsorption and separation applications. Here, we look at the influence of topology in 38 polymorphic MOFs on the separation of linear and branched C4–C6 alkane isomers, a separation of great importance to the petrochemical industry. We find that the MOF Cu 2 (1,4-benzenedicarboxylate) in nbo topology (nbo-Cu 2 BDC) has particularly high affinity for linear alkanes due to its small pore size, which excludes the branched isomers. Upon studying this MOF in further detail, we find that it can take either of two conformations: a cubic conformation, which is typical of nbo MOFs, and a unique star conformation that contains 1D triangular and hexagonal channels. The determination of which conformation the MOF will adopt depends on steric effects between the nodes and linkers.

42 ENGINEERING↗

Development of a topology analysis tool for fifth-generation district heating and cooling networks

Fifth generation district heating and cooling networks are characterized by supply temperatures in the ambient range of 15-25 degrees C, which not only reduces heat loss but also allows for integrating various kinds of low-temperature waste heat sources. The ability of these networks to absorb waste heat that is normally unrecoverable makes them an attractive solution for the future energy supply of urban areas. To enhance the adoption of these networks, this paper describes the development of a software tool to analyze the feasibility of fifth-generation of district heating and cooling systems in both new and existing districts. The research attempts to answer the question: 'Which buildings should be connected to a low-temperature hydraulic network given both the incremental benefits and costs relative to the scenario of decentralized (dedicated) heating and cooling systems for each building?' Therefore, all possible network layouts of the buildings are considered where the heating and cooling demands of each building are met by the fifth-generation of district heating and cooling network. For the heating and cooling load characterization of the buildings, reduced-order models are used while renewable energy and waste heat sources are included in the network. The focus of the research lies in the development of a hydraulic model for flexible use in the urban energy modeling and the optimization of the fifth-generation of district heating and cooling network topology for a given urban district. This research displays simulation results that quantify the performance of the fifth-generation of district heating and cooling network based on various output metrics, including primary energy usage, carbon dioxide emissions, and network implementation cost.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Sensitivity-Informed Bayesian Inference for Home PLC Network Models with Unknown Parameters

Bayesian inference is used to calibrate a bottom-up home PLC network model with unknown loads and wires at frequencies up to 30 MHz. A network topology with over 50 parameters is calibrated using global sensitivity analysis and transitional Markov Chain Monte Carlo (TMCMC). The sensitivity-informed Bayesian inference computes Sobol indices for each network parameter and applies TMCMC to calibrate the most sensitive parameters for a given network topology. A greedy random search with TMCMC is used to refine the discrete random variables of the network. This results in a model that can accurately compute the transfer function despite noisy training data and a high dimensional parameter space. The model is able to infer some parameters of the network used to produce the training data, and accurately computes the transfer function under extrapolative scenarios.

42 ENGINEERING↗

Improving Attack Graph Visualization through Data Reduction and Attack Grouping

Various tools exist to analyze enterprise network systems and to produce attack graphs detailing how attackers might penetrate into the system. These attack graphs, however, are often complex and difficult to comprehend fully, and a human user may find it problematic to reach appropriate configuration decisions. This paper presents methodologies that can 1) automatically identify portions of an attack graph that do not help a user to understand the core security problems and so can be trimmed, and 2) automatically group similar attack steps as virtual nodes in a model of the network topology, to immediately increase the understandability of the data. We believe both methods are important steps toward improving visualization of attack graphs to make them more useful in configuration management for large enterprise networks. We implemented our methods using one of the existing attack-graph toolkits. Initial experimentation shows that the proposed approaches can 1) significantly reduce the complexity of attack graphs by trimming a large portion of the graph that is not needed for a user to understand the security problem, and 2) significantly increase the accessibility and understandability of the data presented in the attack graph by clearly showing, within a generated visualization of the network topology, the number and type of potential attacks to which each host is exposed.

99 GENERAL AND MISCELLANEOUS↗

Criteria for stochastic pinning control of networks of chaotic maps

This paper investigates the controllability of discrete-time networks of coupled chaotic maps through stochastic pinning. In this control scheme, the network dynamics are steered towards a desired trajectory through a feedback control input that is applied stochastically to the network nodes. The network controllability is studied by analyzing the local mean square stability of the error dynamics with respect to the desired trajectory. Through the analysis of the spectral properties of salient matrices, a toolbox of conditions for controllability are obtained, in terms of the dynamics of the individual maps, algebraic properties of the network, and the probability distribution of the pinning control. We demonstrate the use of these conditions in the design of a stochastic pinning control strategy for networks of Chirikov standard maps. To elucidate the applicability of the approach, we consider different network topologies and compare five different stochastic pinning strategies through extensive numerical simulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Network Offoaded Hierarchical Collectives Using ConnectX-2's CORE-Direct Capabilities

As the scale of High Performance Computing (HPC) systems continues to increase, demanding that we extract even more parallelism from applications, the need to move communication management away from the Central Processing Unit (CPU) becomes even greater. Moving this management to the network, frees up CPU cycles for computation, making it possible to overlap computation and communication. In this paper we continue to investigate how to best use the new CORE-Direct support added in the ConnectX-2 Host Channel Adapter (HCA) for creating high performance, asynchronous collective operations that are managed by the HCA. Specifically we consider the network topology, creating a two-level communication hierarchy, reducing the MPI Barrier completion time by 45%, from 26.59 microseconds, when not considering network topology, to 14.72 microseconds, with the CPU based collective barrier operation completing in 19.04 microseconds. The nonblocking barrier algorithm has similar performance, with about 50% of that time available for computation.

99 GENERAL AND MISCELLANEOUS↗

Network reconfiguration and distributed energy resource scheduling for improved distribution system resilience

Electric utility companies work to restore as much load as possible after power outages caused by extreme weather events. In this paper, an outage management strategy is proposed to enhance distribution system resilience through network reconfiguration and distributed energy resources (DERs) scheduling. After a line fault, the proposed algorithm can identify radial network topology based on the rank of the incidence matrix. The reconfiguration is implemented by switching tie lines and sectionalizing lines. With the new network topology, an optimal DER scheduling problem is solved to minimize the accumulative cost for dispatchable DER operation and load reduction. Finally, the optimal topology that minimizes the accumulative cost is selected from all radial topologies. The computational workload is relatively low because only linear programming needs to be solved. Using the case studies of the IEEE 69-bus and IEEE 123-bus systems, we consider the worst-case scenarios in which faults occur in the upstream feeder. The simulation results demonstrate that the proposed strategy allows for a relatively high percentage of the load to remain in service after line faults. Furthermore, compared with microgrid-formation approaches, the proposed strategy has advantages when applied to the distribution systems with several normally-open tie lines and low DER penetration.

42 ENGINEERING↗

TGE: Machine Learning Based Task Graph Embedding for Large-Scale Topology Mapping

Task mapping is an important problem in parallel and distributed computing. The goal in task mapping is to find an optimal layout of the processes of an application (or a task) onto a given network topology. We target this problem in the context of staging applications. A staging application consists of two or more parallel applications (also referred to as staging tasks) which run concurrently and exchange data over the course of computation. Task mapping becomes a more challenging problem in staging applications, because not only data is exchanged between the staging tasks, but also the processes of a staging task may exchange data with each other. We propose a novel method, called Task Graph Embedding (TGE), that harnesses the observable graph structures of parallel applications and network topologies. TGE employs a machine learning based algorithm to find the best representation of a graph, called an embedding, onto a space in which the task-to-processor mapping problem can be solved. We evaluate and demonstrate the effectiveness of TGE experimentally with the communication patterns extracted from runs of XGC, a large-scale fusion simulation code, on Titan.

Choi, Jong Youl↗

Investigating Resiliency of Transportation Network under Targeted and Potential Climate Change Disruptions

Ensuring robustness and resilience in intermodal transportation systems is essential for the continuity and reliability of global logistics. These systems are vulnerable to various disruptions, including natural disasters and technical failures. Despite significant research on freight transportation resilience, investigating the robustness of the system after targeted and climate-change-driven disruption remains a crucial challenge. Drawing on network science methodologies, this study models the interdependencies within the rail and water transport networks and simulates different disruption scenarios to evaluate system responses. Here, we use the data from the U.S. Department of Energy Volpe Center for network topology and tonnage projections. The proposed framework quantifies deliberate, stochastic, and climate-driven infrastructure failure, using higher resolution downscaled multiple Earth System Models’ simulations from Coupled Model Intercomparison Project Phase version 6. We show that the disruptions of a few nodes could have a larger impact on the total tonnage of freight transport than on network topology. For example, the removal of targeted 20 nodes can bring the total tonnage carrying capacity to 30% with about 75% of the rail freight network intact. This research advances the theoretical understanding of transportation resilience and provides practical applications for infrastructure managers and policymakers. By implementing these strategies, stakeholders and policymakers can better prepare for and respond to unexpected disruptions, ensuring sustained operational efficiency in transportation networks.

Climate Change Disruptions↗

A novel 4{sup 4}.6{sup 6} 5-connected metal-organic framework with strong fluorescent emission constructed by m-thioacetatebenzoic acid

A novel uninodal 5-connected metal-organic framework (MOF), [Cd{sub 2}L{sub 2}(4,4'-bipy){sub 3/2}(H{sub 2}O){sub 2}]{sub n} (H{sub 2}L=m-thioacetatebenzoic acid and 4,4'-bipy=4,4'-bipyridine), was prepared under hydrothermal condition. It features an unusual brick-wall shape layer by 4,4'-bipy, which consists of right- and left-handed helical chains arrayed alternatively and finally expands by L{sup 2-} to a rare 5-connected nov (4{sup 4}.6{sup 6}) topology network. Photoluminescence study reveals that it displays intense structure-related fluorescent emission bands ({lambda}{sub ex}=355 nm) at 450 nm in the solid state at room temperature. - Graphical abstract: A novel 5-connected nov (4{sup 4}.6{sup 6}) topology network, [Cd{sub 2}L{sub 2}(4,4'-bipy){sub 3/2}(H{sub 2}O){sub 2}]{sub n} (H{sub 2}L=m-thioacetatebenzoic acid and 4,4'-bipy=4,4'-bipyridine), was prepared under hydrothermal condition and it displays intense structure-related fluorescent emission.

36 MATERIALS SCIENCE↗