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 91 records · Page 5

Synthesis, crystal structures and properties of three new mixed-ligand d{sup 10} metal complexes constructed from pyridinecarboxylate and in situ generated amino-tetrazole ligand

Three new metal-organic frameworks, [Zn(atz)(nic)]{sub n}(1), [Zn(atz)(isonic)]{sub n}.nHisonic(2) and [Cd(atz)(isonic)]{sub n}(3) (Hnic=nicotinic acid, Hisonic=isonicotinic acid), have been firstly synthesized by employing mixed-ligand of pyridinecarboxylate with the in situ generated ligand of 5-amino-tetrazolate(atz{sup -}), and characterized by elemental analysis, IR spectroscopy, TGA and single crystal X-ray diffraction. The results revealed that 1 presents a two-dimensional (2D) 'sql' topological network constructed from the linear chain subunit of Zn(nic){sub 2} and atz{sup -} ligand. A remarkable feature of 2 is a 2-fold interpenetrated diamondoid network with free Hisonic molecules locating in the channels formed by the zigzag chain subunits of Zn(isonic){sub 2}. Complex 3 is a 3D non-interpenetrated pillared framework constructed from the double chain subunits of Cd-COO{sup -}Cd. It possesses a rarely observed (4,6)-connected 'fsc' topology. The thermal stabilities and fluorescent properties of the complexes were investigated. All of these complexes exhibited intense fluorescent emissions in the solid state at room temperature. - Graphical abstract: Three new mixed-ligand d{sup 10} metal complexes have been synthesized by employing mixed-ligand synthetic approach. Complex 1 presents a 2D 'sql' topological network. Complex 2 is a 2-fold interpenetrated diamondoid network with microporous channels. Rarely observed (4,6)-connected 'fsc' topological network was found in complex 3.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Graph Convolutional Network-Based Topology Embedded Deep Reinforcement Learning for Voltage Stability Control

Topological variations in power system is a common phenomenon and can impose significant challenges to traditional controllers of power system. Recent study revealed the strength of deep reinforcement learning (DRL) based approaches in power system preventive and corrective control. But topological variations are difficult to capture using classical fully connected neural network (FCN) model and has not been explicitly modeled in previous work. Hence, we develop a Graph Convolutional Network (GCN) based DRL framework to tackle topology changes in control design of power system. The GCN model exploits the graph structure of the power network and helps the DRL agent to embed the topology information during learning process. Our GCN based approach is evaluated using the IEEE-39 bus system and it outperforms the FCN-based DRL scheme in terms of training convergence and control performance considering grid topology changes.

Hossain, Ramij Raja↗

Topological supramolecular network enabled high-conductivity, stretchable organic bioelectronics

Intrinsically stretchable bioelectronic devices based on soft and conducting organic materials have been regarded as the ideal interface for seamless and biocompatible integration with the human body. A remaining challenge is to combine high mechanical robustness with good electrical conduction, especially when patterned at small feature sizes. We develop a molecular engineering strategy based on a topological supramolecular network, which allows for the decoupling of competing effects from multiple molecular building blocks to meet complex requirements. We obtained simultaneously high conductivity and crack-onset strain in a physiological environment, with direct photopatternability down to the cellular scale. We further collected stable electromyography signals on soft and malleable octopus and performed localized neuromodulation down to single-nucleus precision for controlling organ-specific activities through the delicate brainstem.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Efficiency and Scalability of Barrier Synchronization on NoC Based Many-core Architectures

Interconnects based on Networks-on-Chip are an appealing solution to address future microprocessor designs where, very likely, hundreds of cores will be connected on a single chip. A fundamental role in highly parallelized applications running on many-core architectures will be played by barrier primitives used to synchronize the execution of parallel processes. This paper focuses on the analysis of the efficiency and scalability of different barrier implementations in many-core architectures based on NoCs. Several message passing barrier implementations based on four algorithms (all-to-all, master-slave, butterfly and tree) have been implemented and evaluated for a single-chip target architecture composed of a variable number of cores (from 4 to 128) and different network topologies (mesh, torus, ring, clustered-ring and fat-tree). Using a cycle-accurate simulator, we show the scalability of each barrier for every NoC topology, analyzing and comparing theoretical with real behaviors. We observed that some barrier algorithms, when implemented in hardware or software, show a different scaling behavior with respect to those theoretically expected. We evaluate the efficiency of each combination topology-barrier, demonstrating that, in many cases, simple network topologies can be more efficient than complex and highly connected topologies.

97 MATHEMATICS AND COMPUTING↗

Toward Optimal Transport Networks

Strictly evolutionary approaches to improving the air transport system a highly complex network of interacting systems no longer suffice in the face of demand that is projected to double or triple in the near future. Thus evolutionary approaches should be augmented with active design methods. The ability to actively design, optimize and control a system presupposes the existence of predictive modeling and reasonably well-defined functional dependences between the controllable variables of the system and objective and constraint functions for optimization. Following recent advances in the studies of the effects of network topology structure on dynamics, we investigate the performance of dynamic processes on transport networks as a function of the first nontrivial eigenvalue of the network's Laplacian, which, in turn, is a function of the network s connectivity and modularity. The last two characteristics can be controlled and tuned via optimization. We consider design optimization problem formulations. We have developed a flexible simulation of network topology coupled with flows on the network for use as a platform for computational experiments.

Alexandrov, Natalia↗

Communication-Constrained Expansion Planning for Resilient Distribution Systems

Distributed generation and remotely controlled switches have emerged as important technologies to improve the resiliency of distribution grids against extreme weather-related disturbances. Therefore it becomes important to study how best to place them on the grid in order to meet a resiliency criteria, while minimizing costs and capturing their dependencies on the associated communication systems that sustain their distributed operations. This paper introduces the Optimal Resilient Design Problem for Distribution and Communication Systems (ORDPDC) to address this need. The ORDPDC is formulated as a two-stage stochastic mixed-integer program that captures the physical laws of distribution systems, the communication connectivity of the smart grid components, and a set of scenarios that specifies which components are affected by potential disasters. The paper proposes an exact branch-and-price algorithm for the ORDPDC that features a strong lower bound and a variety of acceleration schemes to address degeneracy. The ORDPDC model and branch-and-price algorithm were evaluated on a variety of test cases with varying disaster intensities and network topologies. The results demonstrate the significant impact of the network topologies on the expansion plans and costs, as well as the computational benefits of the proposed approach.

97 MATHEMATICS AND COMPUTING↗

Altered cortical thickness-based structural covariance networks in type 2 diabetes mellitus

Cognitive impairment is a common complication of type 2 diabetes mellitus (T2DM), and early cognitive dysfunction may be associated with abnormal changes in the cerebral cortex. This retrospective study aimed to investigate the cortical thickness-based structural topological network changes in T2DM patients without mild cognitive impairment (MCI). Fifty-six T2DM patients and 59 healthy controls underwent neuropsychological assessments and sagittal 3-dimensional T1-weighted structural magnetic resonance imaging. Then, we combined cortical thickness-based assessments with graph theoretical analysis to explore the abnormalities in structural covariance networks in T2DM patients. Correlation analyses were performed to investigate the relationship between the altered topological parameters and cognitive/clinical variables. T2DM patients exhibited significantly lower clustering coefficient (C) and local efficiency (Elocal) values and showed nodal property disorders in the occipital cortical, inferior temporal, and inferior frontal regions, the precuneus, and the precentral and insular gyri. Moreover, the structural topological network changes in multiple nodes were correlated with the findings of neuropsychological tests in T2DM patients. Thus, while T2DM patients without MCI showed a relatively normal global network, the local topological organization of the structural network was disordered. Moreover, the impaired ventral visual pathway may be involved in the neural mechanism of visual cognitive impairment in T2DM patients. This study enriched the characteristics of gray matter structure changes in early cognitive dysfunction in T2DM patients.

Huang, Yang↗

A Study of Complex Deep Learning Networks on High Performance, Neuromorphic, and Quantum Computers

Current Deep Learning models use highly optimized convolutional neural networks (CNN) trained on large graphical processing units (GPU)-based computers with a fairly simple layered network topology, i.e., highly connected layers, without intra-layer connections. Complex topologies have been proposed, but are intractable to train on current systems. Building the topologies of the deep learning network requires hand tuning, and implementing the network in hardware is expensive in both cost and power.In this paper, we evaluate deep learning models using three different computing architectures to address these problems: quantum computing to train complex topologies, high performance computing (HPC) to automatically determine network topology, and neuromorphic computing for a low-power hardware implementation. Due to input size limitations of current quantum computers we use the MNIST dataset for our evaluation.The results show the possibility of using the three architectures in tandem to explore complex deep learning networks that are untrainable using a von Neumann architecture. We show that a quantum computer can find high quality values of intra-layer connections and weights, while yielding a tractable time result as the complexity of the network increases; a high performance computer can find optimal layer-based topologies; and a neuromorphic computer can represent the complex topology and weights derived from the other architectures in low power memristive hardware.This represents a new capability that is not feasible with current von Neumann architecture. It potentially enables the ability to solve very complicated problems unsolvable with current computing technologies.

97 MATHEMATICS AND COMPUTING↗

A Study of Complex Deep Learning Networks on High Performance, Neuromorphic, and Quantum Computers

Current Deep Learning models use highly optimized convolutional neural networks (CNN) trained on large graphical processing units (GPU)-based computers with a fairly simple layered network topology, i.e., highly connected layers, without intra-layer connections. Complex topologies have been proposed, but are intractable to train on current systems. Building the topologies of the deep learning network requires hand tuning, and implementing the network in hardware is expensive in both cost and power. In this paper, we evaluate deep learning models using three different computing architectures to address these problems: quantum computing to train complex topologies, high performance computing (HPC) to automatically determine network topology, and neuromorphic computing for a low-power hardware implementation. Due to input size limitations of current quantum computers we use the MNIST dataset for our evaluation. The results show the possibility of using the three architectures in tandem to explore complex deep learning networks that are untrainable using a von Neumann architecture. We show that a quantum computer can find high quality values of intra-layer connections and weights, while yielding a tractable time result as the complexity of the network increases; a high performance computer can find optimal layer-based topologies; and a neuromorphic computer can represent the complex topology and weights derived from the other architectures in low power memristive hardware. This represents a new capability that is not feasible with current von Neumann architecture. It potentially enables the ability to solve very complicated problems unsolvable with current computing technologies.

Potok, Thomas E↗

Experimental Observations of the Topology of Convolutional Neural Network Activations

Topological data analysis (TDA) is a branch of computational mathematics, bridging algebraic topology and data science, that provides compact, noise-robust representations of complex structures. Deep neural networks (DNNs) learn millions of parameters associated with a series of transformations defined by the model architecture resulting in high-dimensional, difficult to interpret internal representations of input data. As DNNs become more ubiquitous across multiple sectors of our society, there is increasing recognition that mathematical methods are needed to aid analysts, researchers, and practitioners in understanding and interpreting how these models' internal representations relate to the final classification. In this paper we apply cutting edge techniques from TDA with the goal of gaining insight towards interpretability of convolutional neural networks used for image classification. We use two common TDA approaches to explore several methods for modeling hidden layer activations as high-dimensional point clouds, and provide experimental evidence that these point clouds capture valuable structural information about the model's process. First, we demonstrate that a distance metric based on persistent homology can be used to quantify meaningful differences between layers and discuss these distances in the broader context of existing representational similarity metrics for neural network interpretability. Second, we show that a mapper graph can provide semantic insight as to how these models organize hierarchical class knowledge at each layer. These observations demonstrate that TDA is a useful tool to help deep learning practitioners unlock the hidden structures of their models.

topological data analysis, deep learning↗

A hierarchy of topological tensor network states

We present a hierarchy of quantum many-body states among which many examples of topological order can be identified by construction. We define these states in terms of a general, basis-independent framework of tensor networks based on the algebraic setting of finite-dimensional Hopf C*-algebras. At the top of the hierarchy we identify ground states of new topological lattice models extending Kitaev's quantum double models [Ann. Phys. 303, 2 (2003)]. For these states we exhibit the mechanism responsible for their non-zero topological entanglement entropy by constructing an entanglement renormalization flow. Furthermore, we argue that the hierarchy states are related to each other by the condensation of topological charges.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Two new Zn(II) and Cd(II) coordinastion polymers based on amino-tetrazole and phenylcarboxylate: Syntheses, topological structures and photoluminescent properties

Two Zn(II) and Cd(II) compounds with the in-situ generated ligand of 5-amino-tetrazolate (atz{sup -}) were prepared from the hydrothermal reactions of the corresponding Cd or Zn(II) salts with phenylcarboxylate, and characterized by elemental analysis, IR spectroscopy, and TGA. The results of X-ray crystallographic analysis reveal that compound [Zn{sub 2}(BZA)(atz){sub 2}(OH)]{sub n} (1) (BZA=benzoic acid) presents a two-dimensional (2D) 'hcb' topological network constructed from the ZnN{sub 2}O{sub 2} tetrahedra. In compound [Cd{sub 6}(atz){sub 6}(PTA){sub 3}]{sub n} (2) (PTA=terephthalic acid), the identical [Cd{sub 3}(atz){sub 3})]{sup 3+}{sub n} clusters are connected by atz ligands to generate a 2D cationic layer, and the neighboring cationic layers are pillared by PTA giving birth to 3D network. After simplifying, the complicated 3D network of 2 can be presented as an unprecedented (4, 4, 10)-connected trinodal topology. The formations of the structures show a good example that using the combination of the in-situ generated ligand and other coligand synthetic strategy can construct interesting topological structures. The thermal stabilities and fluorescent properties of the complexes have also been studied. - Graphical abstract: Two d{sup 10} metal complexes have been synthesized by employing mixed-ligand synthetic approach. Complex 1 presents a 2D 'hcb' topological network. Complex 2 shows an unprecedented (4, 4, 10)-connected trinodal topology. Highlights: Black-Right-Pointing-Pointer Coligand synthetic strategy was applied to obtain new MOFs with useful properties. Black-Right-Pointing-Pointer Two new Zn(II) and Cd(II) complexes were constructed from the mixed-ligand. Black-Right-Pointing-Pointer Topologically, compound 2 presented an unprecedented (4, 4, 10)-connected trinodal topology. Black-Right-Pointing-Pointer The two compounds may be excellent candidates for potential photoactive material.

36 MATERIALS SCIENCE↗

Single- and two-phase flow in microfluidic porous media analogs based on Voronoi tessellation

The objective of this study was to create a microfluidic model of complex porous media for studying single and multiphase flows. Most experimental porous media models consist of periodic geometries that lend themselves to comparison with well-developed theoretical predictions. However, most real porous media such as geological formations and biological tissues contain a degree of randomness and complexity that is not adequately represented in periodic geometries. To design an experimental tool to study these complex geometries, we created microfluidic models of random homogeneous and heterogeneous networks based on Voronoi tessellations. These networks consisted of approximately 600 grains separated by a highly connected network of channels with an overall porosity of 0.11 0.20. We found that introducing heterogeneities in the form of large cavities within the network changed the permeability in a way that cannot be predicted by the classical porosity-permeability relationship known as the Kozeny equation. The values of permeability found in experiments were in excellent agreement with those calculated from three-dimensional lattice Boltzmann simulations. In two-phase flow experiments of oil displacement with water we found that the surface energy of channel walls determined the pattern of water invasion, while the network topology determined the residual oil saturation. These results suggest that complex network topologies lead to fluid flow behavior that is difficult to predict based solely on porosity. The microfluidic models developed in this study using a novel geometry generation algorithm based on Voronoi tessellation are a new experimental tool for studying fluid and solute transport problems within complex porous media.

Wu, Mengjie↗

Characterizing Reactive Transport Behavior in a Three-Dimensional Discrete Fracture Network

While several studies have linked network and in-fracture scale properties to conservative transport behavior in subsurface fractured media, studies on reactive transport cases remain relatively underdeveloped. In this study, we explore the behavior of an irreversible kinetic reaction during the interaction of two solute plumes, one consisting of species A and the other species B. When the plumes converge, these species react kinetically to form a new species C via A+B→kC. This reactive system is studied using a three-dimensional discrete fracture network (DFN) model coupled with reactive Lagrangian particle tracking. We find that the interplay of network topology and chemical properties of the reactive solutes controls reactive transport processes. The network topology drives species A and B together, and the chemical properties dictate whether and how quickly a reaction occurs. Results demonstrate that reactions are most likely to occur in high-velocity fractures that make up the network backbone. The interplay between species’ chemical properties and transport is characterized by a non-dimensional Damköhler (Da) number. We show that the spatial distribution of reactions is sensitive to Da, which subsequently influences late-time tailing behavior in outlet breakthrough time distributions. The results of this study provide initial insights into how an irreversible reaction occurs during transport in a fracture network, using a methodology that can be applied to study reactive transport in a wide range of fractured media environments and contexts.

58 GEOSCIENCES↗

Switching Device-Cognizant Sequential Distribution System Restoration

This paper presents an optimization framework for sequential reconfiguration using an assortment of switching devices and repair process in distribution system restoration. Compared to existing studies, this paper considers types, capabilities and operational limits of different switching devices, making it applicable in practice. We develop a novel multi-phase method to find the optimal sequential operation of various switching devices and repair faulted areas. We consider circuit breakers, reclosers, sectionalizers, load breaker switches, and fuses. The switching operation problem is decomposed into two mixed-integer linear programming (MILP) subproblems. The first subproblem determines the optimal network topology and estimates the number of steps to reach that topology, while the second subproblem generates a sequence of switching operations to coordinate the switches. For repairing the faults, we design an MILP model that dispatches repair crews to clear faults and replace melted fuses. After clearing a fault, we update the topology of the network by generating a new sequence of switching operations, and the process continues until all faults are cleared. To improve the computational efficiency, a network reduction algorithm is developed to group line sections, such that only switchable sections are present in the reduced network. The proposed method is validated on the IEEE 123-bus and 8500-bus systems.

distribution system↗

Systems and methods for convex relaxations and linear approximations for optimal power flow in multiphase radial networks

Centralized node controllers in accordance with embodiments of the invention enable linear approximation of optimal power flow. One embodiment includes a centralized node controller including: a network interface, a processor, and a memory containing: a centralized power control application a network topology, where the network is multiphase unbalanced and comprises a plurality of connected nodes; wherein the processor is configured by the centralized controller application to: request node operating parameters from the plurality of connected nodes; calculate network operating parameters using a linear approximation of optimal power flow and the node operating parameters from the plurality of connected nodes; send network operating parameters to the plurality of connected nodes.

97 MATHEMATICS AND COMPUTING↗

Graph-based Simulation Framework for Power Resilience Estimation and Enhancement

The increasing frequency of extreme weather events poses significant risks to power distribution systems, leading to widespread outages and severe economic and social consequences. This paper presents a novel simulation framework for assessing and enhancing the resilience of power distribution networks under such conditions. Resilience is estimated through Monte Carlo simulations, which simulate extreme weather scenarios and evaluate the impact on infrastructure fragility. Due to the proprietary nature of power network topology, a distribution network is synthesized using publicly available data. To generate the weather scenarios, an extreme weather generation method is developed. To enhance resilience, renewable resources such as solar panels and energy storage systems (batteries in this study) are incorporated. A customized Genetic Algorithm is proposed to determine the optimal locations and capacities for solar panels and battery installations, maximizing resilience while balancing cost constraints. Experiment results demonstrate that on a large-scale synthetic distribution network with more than 300,000 nodes and 300,000 edges, the proposed framework can efficiently evaluate the resilience, and enhance the resilience through the installations of distributed energy resources (DERs), providing utilities with valuable insights for community-level power system resilience estimation and enhancement.

Wang, Xuesong [Wayne State Univ., Detroit, MI (Uni↗

Locality-Aware Parallel Process Mapping for Multi-Core HPC Systems

High Performance Computing (HPC) systems are composed of servers containing an ever-increasing number of cores. With such high processor core counts, non-uniform memory access (NUMA) architectures are almost universally used to reduce inter-processor and memory communication bottlenecks by distributing processors and memory throughout a server-internal networking topology. Application studies have shown that the tuning of processes placement in a server s NUMA networking topology to the application can have a dramatic impact on performance. The performance implications are magnified when running a parallel job across multiple server nodes, especially with large scale HPC applications. This paper presents the Locality-Aware Mapping Algorithm (LAMA) for distributing the individual processes of a parallel application across processing resources in an HPC system, paying particular attention to the internal server NUMA topologies. The algorithm is able to support both homogeneous and heterogeneous hardware systems, and dynamically adapts to the available hardware and user-specified process layout at run-time. As implemented in Open MPI, the LAMA provides 362,880 mapping permutations and is able to naturally scale out to additional hardware resources as they become available in future architectures.

99 GENERAL AND MISCELLANEOUS↗