Network-Forming Liquids from Metal-Bis(acetamide) Frameworks with Low Melting Temperatures
Explore the source record for details and available documents.
99 GENERAL AND MISCELLANEOUS↗
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.
Neural network assisted analysis of bimetallic nanocatalysts using X-ray absorption near edge structure spectroscopy
Explore the source record for details and available documents.
99 GENERAL AND MISCELLANEOUS↗
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↗
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↗
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↗
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↗
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)↗
Tunable core-shell single-walled carbon nanotube-Cu 2 S networked nanocomposites as high-performance cathodes for lithium-ion batteries
Explore the source record for details and available documents.
energy storage (including batteries and capacitors↗
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↗
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↗
The State of the Art in Visualizing Dynamic Multivariate Networks
Abstract Most real‐world networks are both dynamic and multivariate in nature, meaning that the network is associated with various attributes and both the network structure and attributes evolve over time. Visualizing dynamic multivariate networks is of great significance to the visualization community because of their wide applications across multiple domains. However, it remains challenging because the techniques should focus on representing the network structure, attributes and their evolution concurrently. Many real‐world network analysis tasks require the concurrent usage of the three aspects of the dynamic multivariate networks. In this paper, we analyze current techniques and present a taxonomy to classify the existing visualization techniques based on three aspects: temporal encoding, topology encoding, and attribute encoding. Finally, we survey application areas and evaluation methods; and discuss challenges for future research.
Kale, Bharat↗
Virtual Environment for Testing Software-Defined Networking Solutions for Scientific Workflows
Recent developments in software-defined infrastructures promise that scientific workflows utilizing supercomputers, instruments, and storage systems will be dynamically composed and orchestrated using software at unprecedented speed and scale in the near future. Testing of the underlying networking software, particularly during initial exploratory stages, remains a challenge due to potential disruptions, and resource allocation and coordination needed over the multi-domain physical infrastructure. To overcome these challenges, we develop the Virtual Science Network Environment (VSNE) that emulates the multi-site host, storage, and network infrastructure using Virtual Machines (VMs), wherein the production and nascent software can be tested. Within each VM, which represents a site, the hosts and local-area networks are emulated using Mininet, and the Software-Defined Network (SDN) controllers and service daemon codes are natively run to support dynamic provisioning of network connections. Additionally, Lustre filesystem support at the sites and an emulation of the long-haul network using Mininet, are provided using separate VMs. As case studies, we describe Lustre file transfers using XDD, Red5 streaming service demonstration, and an emulated experiment with remote monitoring and steering modules, all supported over dynamically configured connections using SDN controllers.
97 MATHEMATICS AND COMPUTING↗
Resource constrained design of artificial neural networks using comparator neural network
We present a systematic design method executed under resource constraints for automating the design of artificial neural networks using the back error propagation algorithm. Our system aims at finding the best possible configuration for solving the given application with proper tradeoff between the training time and the network complexity. The design of such a system is hampered by three related problems. First, there are infinitely many possible network configurations, each may take an exceedingly long time to train; hence, it is impossible to enumerate and train all of them to completion within fixed time, space, and resource constraints. Second, expert knowledge on predicting good network configurations is heuristic in nature and is application dependent, rendering it difficult to characterize fully in the design process. A learning procedure that refines this knowledge based on examples on training neural networks for various applications is, therefore, essential. Third, the objective of the network to be designed is ill-defined, as it is based on a subjective tradeoff between the training time and the network cost. A design process that proposes alternate configurations under different cost-performance tradeoff is important. We have developed a Design System which schedules the available time, divided into quanta, for testing alternative network configurations. Its goal is to select/generate and test alternative network configurations in each quantum, and find the best network when time is expended. Since time is limited, a dynamic schedule that determines the network configuration to be tested in each quantum is developed. The schedule is based on relative comparison of predicted training times of alternative network configurations using comparator network paradigm. The comparator network has been trained to compare training times for a large variety of traces of TSSE-versus-time collected during back-propagation learning of various applications.
Wah, Benjamin W.↗
Complementary workflows for identifying one-hop network behavior and multi-hop network dependencies
A network analysis tool evaluates network flow information in complementary workflows to identify one-hop behavior of network assets and also identify multi-hop dependencies between network assets. In one workflow (e.g., using association rule learning), the network analysis tool can identify significant one-hop communication patterns to and/or from network assets, taken individually. Based on the identified one-hop behavior, the network analysis tool can discover patterns of similar communication among different network assets, which can inform decisions about deploying patch sets, mitigating damage, configuring a system, or detecting anomalous behavior. In a different workflow (e.g., using deep learning or cross-correlation analysis), the network analysis tool can identify significant multi-hop communication patterns that involve network assets in combination. Based on the identified multi-hop dependencies, the network analysis tool can discover functional relationships between network assets, which can inform decisions about configuring a system, managing critical network assets, or protecting critical network assets.
97 MATHEMATICS AND COMPUTING↗
Dispersion and Mixing in Three-Dimensional Discrete Fracture Networks: Nonlinear Interplay Between Structural and Hydraulic Heterogeneity: DISPERSION AND MIXING-REGULAR VERSUS DISORDERED NETWORKS
We investigate the relative impact of topological, geometric, and hydraulic heterogeneity on transport processes in three-dimensional fracture networks. Focusing on the two largest scales of heterogeneity in these systems, individual fracture and network structure, we compare transport through analogous structured and disordered three-dimensional fracture networks with varying degrees of hydraulic heterogeneity. For the moderate levels of hydraulic heterogeneity we consider, network structure is the dominant control of transport through the networks. Less dispersion, both longitudinal and transverse, is observed in structured networks than in disordered networks, due in part to the higher connectivity in the former, independent of the level of hydraulic heterogeneity. However, increases in dispersion with higher hydraulic heterogeneity are larger in the disordered networks than in the structured networks, thereby indicating that the interplay between structural and hydraulic heterogeneity is nonlinear. Here, we propose a measure of disorder in fracture networks by computing the Shannon entropy of the spectrum of the Laplacian of a weighted graph representation of the networks, where the weights are given by a combination of topological, geometric, and hydraulic properties. Finally, this metric, as a relative indicator by comparison between two networks, is a first approach to the dispersion potential and “mixing capacity” of a fracture network.
58 GEOSCIENCES↗
Connectivity-informed drainage network generation using deep convolution generative adversarial networks
Abstract Stochastic network modeling is often limited by high computational costs to generate a large number of networks enough for meaningful statistical evaluation. In this study, Deep Convolutional Generative Adversarial Networks (DCGANs) were applied to quickly reproduce drainage networks from the already generated network samples without repetitive long modeling of the stochastic network model, Gibb’s model. In particular, we developed a novel connectivity-informed method that converts the drainage network images to the directional information of flow on each node of the drainage network, and then transforms it into multiple binary layers where the connectivity constraints between nodes in the drainage network are stored. DCGANs trained with three different types of training samples were compared; (1) original drainage network images, (2) their corresponding directional information only, and (3) the connectivity-informed directional information. A comparison of generated images demonstrated that the novel connectivity-informed method outperformed the other two methods by training DCGANs more effectively and better reproducing accurate drainage networks due to its compact representation of the network complexity and connectivity. This work highlights that DCGANs can be applicable for high contrast images common in earth and material sciences where the network, fractures, and other high contrast features are important.
42 ENGINEERING↗
One network metric datastore to track them all: the OSG network metric service
The Open Science Grid (OSG) relies upon the network as a critical part of the distributed infrastructures it enables. In 2012, OSG added a new focus area in networking with a goal of becoming the primary source of network information for its members and collaborators. This includes gathering, organizing, and providing network metrics to guarantee effective network usage and prompt detection and resolution of any network issues, including connection failures, congestion, and traffic routing. In September of 2015, this service was deployed into the OSG production environment. We will report on the creation, implementation, testing, and deployment of the OSG Networking Service. Starting from organizing the deployment of perfSONAR toolkits within OSG and its partners, to the challenges of orchestrating regular testing between sites, to reliably gathering the resulting network metrics and making them available for users, virtual organizations, and higher level services, all aspects of implementation will be reviewed. In particular, several higher-level services were developed to bring the OSG network service to its full potential. These include a web-based mesh configuration system, which allows central scheduling and management of all the network tests performed by the instances; a set of probes to continually gather metrics from the remote instances and publish it to different sources; a central network datastore (esmond), which provides interfaces to access the network monitoring information in close to real time and historically (up to a year) giving the state of the tests; and a perfSONAR infrastructure monitor system, ensuring the current perfSONAR instances are correctly configured and operating as intended. We will also describe the challenges we encountered in ongoing operations of the network service and how we have evolved our procedures to address those challenges. Finally we will describe our plans for future extensions and improvements to the service.
73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
Network Coronal Bright Points: Coronal Heating Concentrations Found in the Solar Magnetic Network
We examine the magnetic origins of coronal heating in quiet regions by combining SOHO/EIT Fe xii coronal images and Kitt Peak magnetograms. Spatial filtering of the coronal images shows a network of enhanced structures on the scale of the magnetic network in quiet regions. Superposition of the filtered coronal images on maps of the magnetic network extracted from the magnetograms shows that the coronal network does indeed trace and stem from the magnetic network. Network coronal bright points, the brightest features in the network lanes, are found to have a highly significant coincidence with polarity dividing lines (neutral lines) in the network and are often at the feet of enhanced coronal structures that stem from the network and reach out over the cell interiors. These results indicate that, similar to the close linkage of neutral-line core fields with coronal heating in active regions (shown in previous work), low-lying core fields encasing neutral lines in the magnetic network often drive noticeable coronal heating both within themselves (the network coronal bright points) and on more extended field lines rooted around them. This behavior favors the possibility that active core fields in the network are the main drivers of the heating of the bulk of the quiet corona, on scales much larger than the network lanes and cells.
Falconer, D. A.↗