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 55 records · Page 3

Real-Time Identifiability of Power Distribution Network Topologies With Limited Monitoring

Recovering the distribution grid topology in real time is essential to perform several distribution system operator (DSO) functions. DSOs often do not have any direct monitoring of switch statuses to track reconfiguration. At the same time, installing real-time meters at a large number of buses is challenging due to the cost of endowing every metered bus with a real-time communication channel. The goal of this letter is to develop a meter placement strategy allowing DSOs to deploy only few real-time meters. After casting the topology recovery task as an optimization problem, a meter placement strategy ensuring unique recovery of the true topology is devised. A graph-theoretical approach is pursued to partition the grid into connected portions called observable islands . The proposed strategy then simply requires installing a meter in the path between every pair of boundary nodes , i.e., ends of edges connecting two different islands. Under some ideal assumptions, this placement strategy ensures unique recovery of the topology. The approach is also validated through numerical simulations under realistic scenarios using a standard IEEE benchmark feeder.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Space station common module power system network topology and hardware development

Candidate power system newtork topologies for the space station common module are defined and developed and the necessary hardware for test and evaluation is provided. Martin Marietta's approach to performing the proposed program is presented. Performance of the tasks described will assure systematic development and evaluation of program results, and will provide the necessary management tools, visibility, and control techniques for performance assessment. The plan is submitted in accordance with the data requirements given and includes a comprehensive task logic flow diagram, time phased manpower requirements, a program milestone schedule, and detailed descriptions of each program task.

Landis, D. M.↗

Phylogenetic Molecular Ecological Network of Soil Microbial Communities in Response to Elevated CO 2

Understanding the interactions among different species and their responses to environmental changes, such as elevated atmospheric concentrations of CO 2 , is a central goal in ecology but is poorly understood in microbial ecology. Here we describe a novel random matrix theory (RMT)-based conceptual framework to discern phylogenetic molecular ecological networks using metagenomic sequencing data of 16S rRNA genes from grassland soil microbial communities, which were sampled from a long-term free-air CO 2 enrichment experimental facility at the Cedar Creek Ecosystem Science Reserve in Minnesota. Our experimental results demonstrated that an RMT-based network approach is very useful in delineating phylogenetic molecular ecological networks of microbial communities based on high-throughput metagenomic sequencing data. The structure of the identified networks under ambient and elevated CO 2 levels was substantially different in terms of overall network topology, network composition, node overlap, module preservation, module-based higher-order organization, topological roles of individual nodes, and network hubs, suggesting that the network interactions among different phylogenetic groups/populations were markedly changed. Also, the changes in network structure were significantly correlated with soil carbon and nitrogen contents, indicating the potential importance of network interactions in ecosystem functioning. In addition, based on network topology, microbial populations potentially most important to community structure and ecosystem functioning can be discerned. The novel approach described in this study is important not only for research on biodiversity, microbial ecology, and systems microbiology but also for microbial community studies in human health, global change, and environmental management.

59 BASIC BIOLOGICAL SCIENCES↗

Finding Your Niche: An Evolutionary Approach to HPC Topologies

Traditional interconnection network design approaches focus on building general network topologies by optimizing the bisection bandwidth or minimizing the network’s diameter to reduce the maximum distance between any two nodes, thus amortizing the overall execution time of the HPC workloads. While such network topologies may accommodate a wide variety of applications in general, this may result in sub-optimal performance for many frequently-executed or dynamic workloads. In this paper, instead of focusing on designing an all-encompassing, general-purpose network topology, we develop a methodology to design customized network interconnects, evolved by “finding” the optimal topologies for a particular target workload given by its communication and contention profiles. To this end, we implement a Genetic Algorithm (GA)-based approach for network topology design tailored to improve the overall execution time of a particular workload of interest. We conducted extensive experiments with well-known motifs in physics-based workloads (Sweep3D and FFT), as well as with a representative graph application (MiniVite), using the well-known Structural Simulation Toolkit (SST) Macroscale Element Library (SST/macro) simulator for network interconnect evaluation. We demonstrate that our genetic algorithm-based approach is robust enough to find the underlying optimal topology of a particular workload.

network interconnects, graph search, meta-heuristi↗

Topological solution of bilateral switching networks

Topological method uses the eye as pattern detector to trace path of transmission on truth table. Pathway selection is continually supervised by logician, allowing him to seek planar iterative solution desirable for fabrication of monolithic circuits. Method applies to parity generators, multiple output functions, full adders, and bit comparators.

Mazer, L.↗

A topology for computer networks with good survivability characteristics and low transmission delays between node computers

Various network topologies are developed which have not appeared in the literature before which result in minimum diameter graphs for computer networks having connectivity four. The topologies presented have good survivability characteristics and result in more topologies being available for computer network designers which achieve the minimum diameter resulting in small transmission delays.

Kelly, G. L.↗

A class of topological nodal rings and its realization in carbon networks

Topological nodal rings can be classified into three types according to the slopes in their energy dispersion. Type-I nodal rings consist of type-I points, type-II rings consist of type-II points, and type-III rings consist of anisotropic points. Taking carbon networks as an example, this study shows that all three types can exist and transform from one to another under experimentally realizable strain. Within a given type, a transition between a topological metal phase and a semiconductor phase also takes place, and each type of nodal rings shrinks into the corresponding type of semi-Dirac points, including novel type-II and -III semi-Dirac points. These topological features are expected to exhibit diverse electron-hole pocket patterns and Landau levels, giving rise to unusual transport properties.

36 MATERIALS SCIENCE↗

Networked Microgrid Topology Reconfiguration to Promote Fairness in Proactive Load Shedding

Increasing occurrences of natural disasters and grid emergency events consistently challenge the safe and reliable operations of power systems. During such emergency situations, system operators may proactively shed load to mitigate risks. However, uncoordinated implementation of load shedding may disrupt electricity supply and even lead to cascading failures. Meanwhile, it is crucial to address potential biases affecting different customers when executing load shedding. This paper addresses the dynamic topology reconfiguration problem for networked microgrids with distributed energy resources under emergency conditions. Specifically, we propose a novel rolling-horizon optimization model that integrates fairness-aware constraints into the networked microgrid topology reconfiguration. Unlike existing approaches that focus solely on efficiency or apply fairness considerations in static settings, our method explicitly incorporates temporal fairness constraints to restrict repeated or excessive load curtailment for load blocks. Moreover, the fairness-aware constraints are specifically developed for the context of dynamic networked microgrid topology reconfiguration, and are designed to be convex or amenable to linear reformulations, which offers a more tractable alternative to traditional models with non-convex formulations. Numerical studies on a modified IEEE 13-bus system and a larger-sized SMART-DS networked microgrid system demonstrate the performance of the proposed algorithm towards more fairness-aware networked microgrid topology reconfiguration decision-making.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Topology Inference of Unknown Networks Based on Robust Virtual Coordinate Systems

Learning and exploring the connectivity of unknown networks represent an important problem in practical applications of communication networks and social-media networks. Modeling large-scale networks as connected graphs is highly desirable to extract their connectivity information among nodes to visualize network topology, disseminate data, and improve routing efficiency. This paper investigates a simple measurement model in which a small subset of source nodes collect hop distance information from networked nodes in order to generate a virtual coordinate system (VCS) for networks of unknown topology. We establish the VCS to define logical distance among nodes based on principal component analysis and to determine connectivity relationship and effective routing methods. More importantly, we present a robust analytical algorithm to derive the VCS against practical issues of missing and corrupted measurements. We also develop a connectivity inference method which classifies nodes into layers based on the hop distances and derives partial information on network connectivity.

97 MATHEMATICS AND COMPUTING↗