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 559 records · Page 31

Identification and Validation of Ifit1 as an Important Innate Immune Bottleneck

The innate immune system plays important roles in a number of disparate processes. Foremost, innate immunity is a first responder to invasion by pathogens and triggers early defensive responses and recruits the adaptive immune system. The innate immune system also responds to endogenous damage signals that arise from tissue injury. Recently it has been found that innate immunity plays an important role in neuroprotection against ischemic stroke through the activation of the primary innate immune receptors, Toll-like receptors (TLRs). Using several large-scale transcriptomic data sets from mouse and mouse macrophage studies we identified targets predicted to be important in controlling innate immune processes initiated by TLR activation. Targets were identified as genes with high betweenness centrality, so-called bottlenecks, in networks inferred from statistical associations between gene expression patterns. A small set of putative bottlenecks were identified in each of the data sets investigated including interferon-stimulated genes (Ifit1, Ifi47, Tgtp and Oasl2) as well as genes uncharacterized in immune responses (Axud1 and Ppp1r15a). We further validated one of these targets, Ifit1, in mouse macrophages by showing that silencing it suppresses induction of predicted downstream genes by lipopolysaccharide (LPS)-mediated TLR4 activation through an unknown direct or indirect mechanism. Our study demonstrates the utility of network analysis for identification of interesting targets related to innate immune function, and highlights that Ifit1 can exert a positive regulatory effect on downstream genes.

59 BASIC BIOLOGICAL SCIENCES↗

Evaluating Trade-offs in Potential Exascale Interconnect Technologies

This report details work to study trade-offs in topology and network bandwidth for potential interconnects in the exascale (2021-2022) timeframe. The work was done using multiple interconnect models across two parallel discrete event simulators. Results from each independent simulator are shown and discussed and the areas of agreement and disagreement are explored.

97 MATHEMATICS AND COMPUTING↗

A Data Processing Pipeline for Socio-Technical Network Analysis [Slides]

With the rapid adoption of emerging technologies, there is a need to catalog and model sociotechnical interdependencies that have been historically used to influence the operation of Critical Infrastructure networks including the impacts of mergers and acquisitions, hostile takeovers, and foreign investment. Our research intends to address this need with two primary contributions. First, we have developed a data curation and processing pipeline to generate sociotechnical networks extracted from a variety of data sources including SEC filings and infrastructure asset databases. The pipeline, implemented in Apache Airflow, extracts and normalizes the representation of entities and relations, specified within ontologies. Second, networks produced by our pipeline enable the development of graph-theoretic metrics that consider the properties of network components in addition to its topology. Measures of network complexity, such as degree distribution, reachability analyses, temporal analysis, and community detection may be adapted to indicate adversarial organizational influence. Our intent is to provide an extensible, machine-actionable approach to quickly communicate such models, reproduce previous results, and adapt them to new, unanticipated situations.

97 MATHEMATICS AND COMPUTING↗

FTS2000 network architecture

The network architecture of FTS2000 is graphically depicted. A map of network A topology is provided, with interservice nodes. Next, the four basic element of the architecture is laid out. Then, the FTS2000 time line is reproduced. A list of equipment supporting FTS2000 dedicated transmissions is given. Finally, access alternatives are shown.

Klenart, John↗

Toward biologically inspired self healing digital embedded devices: BIO-SymPle - 388

One of the more interesting concepts being postulated for next gen power plants, is the notion of highly resilient and survivable I and C systems. While resilience and survivability are 'cross system attributes', resilience and robustness will rely on highly robust and fault resilient devices as a foundation. This paper presents a new self-healing digital I and C architecture inspired by the operation of two biological concepts: human immune system and embryonic stem cells. The purpose of this research is look at different bio-inspired paradigms for organizing system functions so that they become inherently resilient due to device organization and behaviors. Our current proposed approach (called BIO-SymPle) is organized in two levels: critical service layer, which is providing the intended service of critical application, and healing layer, that supervises the operation of all repair mechanisms. To facilitate coordination, organized behavior among cells we employ network-based topology structures which is comprised of four active cells, four pre-generated redundant cells, and one embryonic stem cell. Collectively, the ensemble represents the building block that executes the local functionality based on the expression for DNA genetic codes stored inside each cell. The four bio-operational active cells are protected by their neighboring spare cells that imitate how white blood cells are distributed around the antigens in their locations. Ultimately, the proposed multi-layer architecture is able to cover a significant number of coincident faults and we believe architectures like BIO-SymPLe can positively impact the next generation digital I and C system. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Topology for efficient information dissemination in ad-hoc networking

In this paper, we explore the information dissemination problem in ad-hoc wirless networks. First, we analyze the probability of successful broadcast, assuming: the nodes are uniformly distributed, the available area has a lower bould relative to the total number of nodes, and there is zero knowledge of the overall topology of the network. By showing that the probability of such events is small, we are motivated to extract good graph topologies to minimize the overall transmissions. Three algorithms are used to generate topologies of the network with guaranteed connectivity. These are the minimum radius graph, the relative neighborhood graph and the minimum spanning tree. Our simulation shows that the relative neighborhood graph has certain good graph properties, which makes it suitable for efficient information dissemination.

network topology↗

Topological Power Grid Statistics from a Network-of-Networks Perspective

In this work we provide novel tools to evaluate the ``realism'' of a power system topology based combining ideas from the study of complex networks with electrical system parameters. Specifically, we show that the recent network-of-networks approach of Halappanavar, et al.\ can be used to gain insight into reasonable ranges for topological properties of a power system such as, diameter, average shortest path length, core size, and clustering.

Young, Stephen J.↗

The behaviour of basic autocatalytic signalling modules in isolation and embedded in networks

In this paper, we examine the behaviour of basic autocatalytic feedback modules involving a species catalyzing its own production, either directly or indirectly. We first perform a systematic study of the autocatalytic feedback module in isolation, examining the effect of different factors, showing how this module is capable of exhibiting monostable threshold and bistable switch-like behaviour. We then study the behaviour of this module embedded in different kinds of basic networks including (essentially) irreversible cycles, open and closed reversible chains, and networks with additional feedback. We study the behaviour of the networks deterministically and also stochastically, using simulations, analytical work, and bifurcation analysis. We find that (i) there are significant differences between the behaviour of this module in isolation and in a network: thresholds may be altered or destroyed and bistability may be destroyed or even induced, even when the ambient network is simple. The global characteristics and topology of this network and the position of the module in the ambient network can play important and unexpected roles. (ii) There can be important differences between the deterministic and stochastic dynamics of the module embedded in networks, which may be accentuated by the ambient network. This provides new insights into the functioning of such enzymatic modules individually and as part of networks, with relevance to other enzymatic signalling modules as well.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Enhancing Power Distribution System Resilience with Fusion-GNN: A Dynamic Graph Representation Learning Approach

This paper explores the applications of Fusion Graph Neural Network (FuGNN) on power distribution systems. FuGNN effectively models dynamic networks with evolving topology and features. Applied to power system network reconfiguration, FuGNN demonstrates its feasibility in optimizing switch configurations to minimize unserved loads and operational costs during extreme events. Additionally, FuGNN supports various downstream tasks, such as node feature prediction, further enhancing its versatility and applicability in power system resilience.

Liu, Boming↗

Wireless Indoor Location Estimation Based on Neural Network RSS Signature Recognition (LENSR)

Location Based Services (LBS), context aware applications, and people and object tracking depend on the ability to locate mobile devices, also known as localization, in the wireless landscape. Localization enables a diverse set of applications that include, but are not limited to, vehicle guidance in an industrial environment, security monitoring, self-guided tours, personalized communications services, resource tracking, mobile commerce services, guiding emergency workers during fire emergencies, habitat monitoring, environmental surveillance, and receiving alerts. This paper presents a new neural network approach (LENSR) based on a competitive topological Counter Propagation Network (CPN) with k-nearest neighborhood vector mapping, for indoor location estimation based on received signal strength. The advantage of this approach is both speed and accuracy. The tested accuracy of the algorithm was 90.6% within 1 meter and 96.4% within 1.5 meters. Several approaches for location estimation using WLAN technology were reviewed for comparison of results.

99 GENERAL AND MISCELLANEOUS↗

An evidential path logic for multi-relational networks

Multi-relational networks are used extensively to structure knowledge. Perhaps the most popular instance, due to the widespread adoption of the Semantic Web, is the Resource Description Framework (RDF). One of the primary purposes of a knowledge network is to reason; that is, to alter the topology of the network according to an algorithm that uses the existing topological structure as its input. There exist many such reasoning algorithms. With respect to the Semantic Web, the bivalent, axiomatic reasoners of the RDF Schema (RDFS) and the Web Ontology Language (OWL) are the most prevalent. However, nothing prevents other forms of reasoning from existing in the Semantic Web. This article presents a non-bivalent, non-axiomatic, evidential logic and reasoner that is an algebraic ring over a multi-relational network and two binary operations that can be composed to perform various forms of inference. Given its multi-relational grounding, it is possible to use the presented evidential framework as another method for structuring knowledge and reasoning in the Semantic Web. The benefits of this framework are that it works with arbitrary, partial, and contradictory knowledge while, at the same time, supporting a tractable approximate reasoning process.

99 GENERAL AND MISCELLANEOUS↗

Multi-Level Optimal Power Flow Solver in Large Distribution Networks: Preprint

Solving optimal power flow (OPF) problem for large distribution networks incurs high computational complexity. We consider a large multi-phase distribution networks of tree topology with deep penetration of active devices. We divide the network into collaborating areas featuring subtree topology and subareas featuring subsubtree topology. We design a multi-level implementation of the primal-dual gradient algorithm for solving the voltage regulation OPF problems while preserving nodal voltage information and topological information within areas and subareas. Numerical results on a 4,521-node system verifies that the proposed algorithm can significantly improve computational speed without compromising any optimality.

41 EE - Solar Energy Technologies Office (EE-4S)↗

Multi-Level Optimal Power Flow Solver in Large Distribution Networks

Solving optimal power flow (OPF) problems for large distribution networks incurs high computational complexity. We consider a large multi-phase distribution network of tree topology with a deep penetration of active devices. We divide the network into collaborating areas featuring subtree topology and subareas featuring subsubtree topology. We design a multilevel implementation of the primal-dual gradient algorithm to solve the voltage regulation OPF problems while preserving nodal voltage information and topological information within areas and subareas. Numerical results on a 4,521-node system verify that the proposed algorithm can significantly improve the computational speed without compromising any optimality.

41 EE - Solar Energy Technologies Office (EE-4S)↗

Short-Term Load Forecasting-Based Automatic Distribution Network Reconfiguration

In a traditional dynamic network reconfiguration study, the optimal topology is determined at every scheduled time point by using the real load data measured at that time. The development of the load forecasting technique can provide an accurate prediction of the load power that will happen in a future time and provide more information about load changes. With the inclusion of load forecasting, the optimal topology can be determined based on the predicted load conditions during a longer time period instead of using a snapshot of the load at the time when the reconfiguration happens; thus, the distribution system operator can use this information to better operate the system reconfiguration and achieve optimal solutions. This paper proposes a short-term load forecasting approach to automatically reconfigure distribution systems in a dynamic and pre-event manner. Specifically, a short-term and high-resolution distribution system load forecasting approach is proposed with a forecaster based on support vector regression and parallel parameters optimization. The network reconfiguration problem is solved by using the forecasted load continuously to determine the optimal network topology with the minimum amount of loss at the future time. The simulation results validate and evaluate the proposed approach.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A survey of routing techniques in store-and-forward and wormhole interconnects.

This paper presents an overview of algorithms for directing messages through networks of varying topology. These are commonly referred to as routing algorithms in the literature that is presented. In addition to providing background on networking terminology and router basics, the paper explains the issues of deadlock and livelock as they apply to routing. After this, there is a discussion of routing algorithms for both store-and-forward and wormhole-switched networks. The paper covers both algorithms that do and do not adapt to conditions in the network. Techniques targeting structured as well as irregular topologies are discussed. Following this, strategies for routing in the presence of faulty nodes and links in the network are described.

97 MATHEMATICS AND COMPUTING↗

An optimization framework for the network design of advanced district thermal energy systems

In this work, a topology optimization framework for district thermal energy systems is presented. The framework seeks to address the questions, for a given district, "What is the best subset of buildings to connect to a district thermal energy system, and by what network should they be connected, to minimize life cycle cost?" A particle swarm optimization approach is validated to address the selection of the subset of buildings, and a graph theory-based heuristic is validated for selection of the network topology for any candidate subset of buildings. The framework is applied to a prototypical urban district for illustrative purposes. Additionally, modeling of prototypical districts revealed reductions in source energy use intensity for heating and cooling of 21-25% through the use of advanced district energy systems relative to code-compliant, building level systems. The framework identifies solutions with life cycle cost values 14% to 72% lower than that of base case scenarios based on conventional design approaches, depending on the base case scenario selected. Analysis of the search space indicates that topology optimization facilitates reductions in life cycle cost, source energy use intensity, and carbon emissions.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

APHiD: Hierarchical Task Placement to Enable a Tapered Fat Tree Topology for Lower Power and Cost in HPC Networks

The power and procurement cost of bandwidth in system-wide networks has forced a steady drop in the byte/flop ratio. This trend of computation becoming faster relative to the network is expected to hold. In this paper, we explore how cost-oriented task placement enables reducing the cost of system-wide networks by enabling high performance even on tapered topologies where more bandwidth is provisioned at lower levels. We describe APHiD, an efficient hierarchical placement algorithm that uses new techniques to improve the quality of heuristic solutions and reduces the demand on high-level, expensive bandwidth in hierarchical topologies. We apply APHiD to a tapered fat-tree, demonstrating that APHiD maintains application scalability even for severely tapered network configurations. Using simulation, we show that for tapered networks APHiD improves performance by more than 50% over random placement and even 15% in some cases over costlier, state-of-the-art placement algorithms.

Michelogiannakis, George↗