Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “NETWORKING”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Resilient Cooperative Voltage Control for Distribution Network with High Penetration Distributed Energy Resources

Here, this paper considers the problem of designing a resilient distributed voltage control algorithm for distribution systems with high penetration of distributed energy resources in the presence of an unknown cyber-attack. The purpose of the attack is to force the system to violate the operating voltage limit by intercepting its communication channels and inserting exogenous signals to perturb and/or modify the information being exchanged. We first review the cooperative voltage control proposed in our previous work and provide a new stability analysis for it. Next, we present a resilient cooperative voltage control algorithm by introducing a virtual system interconnected with the original system such that the voltage can be maintained within the operational limit under unknown attacks. The resiliency of the proposed algorithm is demonstrated via simulations on the IEEE 8500-node system when subjected to an attack which consists of corrupting the data being exchanged in the communication network between two generation units.

cooperative control↗
DOE OSTI2014

Towards a unified description of the hydrogen bond network of liquid water: A dynamics based approach

The definition of a hydrogen bond (H-bond) is intimately related to the topological and dynamic properties of the hydrogen bond network within liquid water. The development of a universal H-bond definition for water is an active area of research as it would remove many ambiguities in the network properties that derive from the fixed definition employed to assign whether a water dimer is hydrogen bonded. This work investigates the impact that an electronic-structure based definition, an energetic, and a geometric definition of the H-bond has upon both topological and dynamic network behavior of simulated water. In each definition, the use of a cutoff (either geometric or energetic) to assign the presence of a H-bond leads to the formation of transiently bonded or broken dimers, which have been quantified within the simulation data. The relative concentration of transient species, and their duration, results in two of the three definitions sharing similarities in either topological or dynamic features (H-bond distribution, H-bond lifetime, etc.), however no two definitions exhibit similar behavior for both classes of network properties. In fact, two networks with similar local network topology (as indicated by similar average H-bonds) can have dramatically different global network topology (as indicated by the defect state distributions) and altered H-bond lifetimes. A dynamics based correction scheme is then used to remove artificially transient H-bonds and to repair artificially broken bonds within the network such that the corrected network exhibits the same structural and dynamic properties for two H-bond definitions (the properties of the third definition being significantly improved). The algorithm described represents a significant step forward in the development of a unified hydrogen bond network whose properties are independent of the original hydrogen bond definition that is employed.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2011

The Network Completion Problem: Inferring Missing Nodes and Edges in Networks

Network structures, such as social networks, web graphs and networks from systems biology, play important roles in many areas of science and our everyday lives. In order to study the networks one needs to first collect reliable large scale network data. While the social and information networks have become ubiquitous, the challenge of collecting complete network data still persists. Many times the collected network data is incomplete with nodes and edges missing. Commonly, only a part of the network can be observed and we would like to infer the unobserved part of the network. We address this issue by studying the Network Completion Problem: Given a network with missing nodes and edges, can we complete the missing part? We cast the problem in the Expectation Maximization (EM) framework where we use the observed part of the network to fit a model of network structure, and then we estimate the missing part of the network using the model, re-estimate the parameters and so on. We combine the EM with the Kronecker graphs model and design a scalable Metropolized Gibbs sampling approach that allows for the estimation of the model parameters as well as the inference about missing nodes and edges of the network. Experiments on synthetic and several real-world networks show that our approach can effectively recover the network even when about half of the nodes in the network are missing. Our algorithm outperforms not only classical link-prediction approaches but also the state of the art Stochastic block modeling approach. Furthermore, our algorithm easily scales to networks with tens of thousands of nodes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Demand Response for Thermal Fairness in District Heating Networks

District Heating (DH) networks are complex thermal grids wherein a centrally heated fluid is circulated through a network of pipes and heat exchangers to meet the heating needs of residential and commercial buildings. Several factors can lead to inefficient and unfair energy distribution among consumers in these networks. These include varying levels of building insulation, distance of individual buildings from the central energy source, and thermal losses in network pipes. Moreover, shortage of energy at the central energy source and extreme weather conditions can exacerbate these issues, leading to differing levels of thermal comfort and customer disgruntlement in the long run. In this paper, we propose and study a demand response scheme that attempts to ensure thermal fairness among energy consumers in modern thermal grids. We develop optimization formulations based on thermodynamic models of DH networks, which determine optimal energy flow for individual buildings in order to achieve thermal fairness across the network. Our experimental results using physics based models for DH networks show that it is possible to achieve network level thermal fairness based social welfare objectives by controlling network parameters such as mass flow rates of water to the consumer premises and the supply water temperature, even when some network parameters like building thermal characteristics remain unknown.

Bhattacharya, Saptarshi↗
DOE OSTI2014

The application of complex network time series analysis in turbulent heated jets

In the present study, we applied the methodology of the complex network-based time series analysis to experimental temperature time series from a vertical turbulent heated jet. More specifically, we approach the hydrodynamic problem of discriminating time series corresponding to various regions relative to the jet axis, i.e., time series corresponding to regions that are close to the jet axis from time series originating at regions with a different dynamical regime based on the constructed network properties. Applying the transformation phase space method (k nearest neighbors) and also the visibility algorithm, we transformed time series into networks and evaluated the topological properties of the networks such as degree distribution, average path length, diameter, modularity, and clustering coefficient. The results show that the complex network approach allows distinguishing, identifying, and exploring in detail various dynamical regions of the jet flow, and associate it to the corresponding physical behavior. In addition, in order to reject the hypothesis that the studied networks originate from a stochastic process, we generated random network and we compared their statistical properties with that originating from the experimental data. As far as the efficiency of the two methods for network construction is concerned, we conclude that both methodologies lead to network properties that present almost the same qualitative behavior and allow us to reveal the underlying system dynamics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

The Interplay of Binary and Quantitative Structure on the Stability of Mutualistic Networks

Synopsis Understanding how the structure of biological systems impacts their resilience (broadly defined) is a recurring question across multiple levels of biological organization. In ecology, considerable effort has been devoted to understanding how the structure of interactions between species in ecological networks is linked to different broad resilience outcomes, especially local stability. Still, nearly all of that work has focused on interaction structure in presence-absence terms and has not investigated quantitative structure, i.e., the arrangement of interaction strengths in ecological networks. We investigated how the interplay between binary and quantitative structure impacts stability in mutualistic interaction networks (those in which species interactions are mutually beneficial), using community matrix approaches. We additionally examined the effects of network complexity and within-guild competition for context. In terms of structure, we focused on understanding the stability impacts of nestedness, a structure in which more-specialized species interact with smaller subsets of the same species that more-generalized species interact with. Most mutualistic networks in nature display binary nestedness, which is puzzling because both binary and quantitative nestedness are known to be destabilizing on their own. We found that quantitative network structure has important consequences for local stability. In more-complex networks, binary-nested structures were the most stable configurations, depending on the quantitative structures, but which quantitative structure was stabilizing depended on network complexity and competitive context. As complexity increases and in the absence of within-guild competition, the most stable configurations have a nested binary structure with a complementary (i.e., anti-nested) quantitative structure. In the presence of within-guild competition, however, the most stable networks are those with a nested binary structure and a nested quantitative structure. In other words, the impact of interaction overlap on community persistence is dependent on the competitive context. These results help to explain the prevalence of binary-nested structures in nature and underscore the need for future empirical work on quantitative structure.

Zoology↗
DOE OSTI2020

The reservoir network: A new network topology for district heating and cooling

Thermal district networks are effective solutions to substitute fossil fuels with renewable energy sources for heating and cooling. Moreover, thermal networking of buildings allows energy efficiency to be further increased. The waste heat from cooling can be reused for heating in thermal district systems. Because of bidirectional energy flows between prosumers, thermal networks require new hydraulic concepts. In this work, we present a novel network topology for simultaneous heating and cooling: the reservoir network. The reservoir network is robust in operation due to hydraulic decoupling of transfer stations, integrates heat sources and heat sinks at various temperature levels and is flexible in terms of network expansion. Furthermore, we used Modelica simulations to compare the new single-pipe reservoir network to a basecase double-pipe network, taking yearly demand profiles of different building types for heating and cooling. The electric energy consumed by the heat pumps and circulations pumps differs between the reservoir and base case networks by less than 1%. However, if the reservoir network is operated with constant instead of variable mass flow rate, the total electrical consumption can increase by 48% compared to the base case. As with any other network topology, the design and control of such networks is crucial to achieving energy efficient operation. Investment costs for piping and trenching depend on the district layout and dimensioning of the network. If a ring layout is applied in a district, the reservoir network with its single-pipe configuration is more economical than other topologies. For a linear layout, the piping costs are slightly higher for the reservoir network than for the base case because of larger pipe diameters.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2019

DGs for Service Restoration to Critical Loads in a Secondary Network

During a major outage in a secondary network distribution system, distributed generators (DGs) connected to the primary feeders as well as the secondary network can be used to serve critical loads. This paper proposed a resilience-oriented method to determine restoration strategies for secondary network distribution systems after a major disaster. Technical issues associated with the restoration process are analyzed, including the operation of network protectors, inrush currents caused by the energization of network transformers, synchronization of DGs to the network, and circulating currents among DGs. A look-ahead load restoration framework is proposed, incorporating technical issues associated with secondary networks, limits on DG capacity and generation resources, dynamic constraints, and operational limits. The entire outage duration is divided into a sequence of periods. Restoration strategies can be adjusted at the beginning of each period using the latest information. Numerical simulation of the modified IEEE 342-node low voltage networked test system is performed to validate the effectiveness of the proposed method.

Xu, Yin (ORCID:0000000209459024)↗
DOE OSTI2015

Inducing Order from Disordered Copolymers: On Demand Generation of Triblock Morphologies Including Networks

Disordered block copolymers are generally impractical in nanopatterning applications due to their inability to self-assemble into well-defined nanostructures. However, inducing order in low molecular weight disordered systems permits the design of periodic structures with smaller characteristic sizes. Here, we have induced nanoscale phase separation from disordered triblock copolymer melts to form well-ordered lamellae, hexagonally packed cylinders, and a triply periodic gyroid network structure, using a copolymer/homopolymer blending approach, which incorporates constituent homopolymers into selective block domains. This versatile blending approach allows one to precisely target multiple nanostructures from a single disordered material and can be applied to a wide variety of triblock copolymer systems for nanotemplating and nanoscale separation applications requiring nanoscale feature sizes and/or high areal feature densities.

Tureau, Maëva S.↗
DOE OSTI2018

Advance reservation access control using software-defined networking and tokens

Advance reservation systems allow users to reserve dedicated bandwidth connection resources from advanced high-speed networks. A common use case for such systems is data transfers in distributed science environments in which a user wants exclusive access to the reservation. However, current advance network reservation methods cannot ensure exclusive access of a network reservation to the specific flow for which the user made the reservation. We present here a novel network architecture that addresses this limitation and ensures that a reservation is used only by the intended flow. We achieve this by leveraging software-defined networking (SDN) and token-based authorization. We use SDN to orchestrate and automate the reservation of networking resources, end-to-end and across multiple administrative domains, and tokens to create a strong binding between the user or application that requested the reservation and the flows provisioned by SDN. We conducted experiments on the ESNet 100G SDN testbed, and demonstrated that our system effectively protects authorized flows from competing traffic in the network.

admission control↗
DOE OSTI2020

NAPAbench 2: A network synthesis algorithm for generating realistic protein-protein interaction (PPI) network families

Comparative network analysis provides effective computational means for gaining novel insights into the structural and functional compositions of biological networks. In recent years, various methods have been developed for biological network alignment, whose main goal is to identify important similarities and critical differences between networks in terms of their topology and composition. A major impediment to advancing network alignment techniques has been the lack of gold-standard benchmarks that can be used for accurate and comprehensive performance assessment of such algorithms. The original NAPAbench (network alignment performance assessment benchmark) was developed to address this problem, and it has been widely utilized by many researchers for the development, evaluation, and comparison of novel network alignment techniques. In this work, we introduce NAPAbench 2—a major update of the original NAPAbench that was introduced in 2012. NAPAbench 2 includes a completely redesigned network synthesis algorithm that can generate protein-protein interaction (PPI) network families whose characteristics closely match those of the latest real PPI networks. Furthermore, the network synthesis algorithm comes with an intuitive GUI that allows users to easily generate PPI network families with an arbitrary number of networks of any size, according to a flexible user-defined phylogeny. In addition, NAPAbench 2 provides updated benchmark datasets—created using the redesigned network synthesis algorithm—which can be used for comprehensive performance assessment of network alignment algorithms and their scalability.

42 ENGINEERING↗