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 451 records · Page 25
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Service-Based, Segmented, 5G Network-Based Architecture for Securing Distributed Energy Resources: Preprint

As the number of connected devices in the energy grid increase exponentially, so too are the cybersecurity risks. With the development of modern communications standards such as 5G and beyond the extent to which devices will continue to connect will continue to increase exponentially along with the inherent risks. However, 5G also includes features to help address cybersecurity concerns and therefore helping to mitigate many of these risks. This paper proposes a new service-based network architecture implementing network-slicing capabilities for connected systems and devices to improve performance, availability, security, and reliability of the grid devices and services. This paper considers the quality of service requirements and criticality of services needed for securely monitoring, operating, and securing Distributed Energy Resource (DER) devices. From developed use cases, network slicing is implemented based on these requirements and resource allocations. This work then highlights examples of how slicing can help prevent standard existing attack methods such as a denial-of-service or similar attack which limits resource availability and network bandwidth to the service and thus limiting its ability to affect other services by misbehaving. The designed network architecture use case will be further tested on a local virtualized testbed to verify secure operation and availability of services. Using hardware-in-the-loop devices and systems on this local testbed, this fully segmented, secure network may be realized and evaluated. Finally, this paper presents the results of this testing.

5G↗
DOE OSTI2020

Wide neural networks with bottlenecks are deep Gaussian processes

There has recently been much work on the "wide limit" of neural networks, where Bayesian neural networks (BNNs) are shown to converge to a Gaussian process (GP) as all hidden layers are sent to infinite width. However, these results do not apply to architectures that require one or more of the hidden layers to remain narrow. In this paper, we consider the wide limit of BNNs where some hidden layers, called "bottlenecks", are held at finite width. The result is a composition of GPs that we term a "bottleneck neural network Gaussian process" (bottleneck NNGP). Although intuitive, the subtlety of the proof is in showing that the wide limit of a composition of networks is in fact the composition of the limiting GPs. We also analyze theoretically a single-bottleneck NNGP, finding that the bottleneck induces dependence between the outputs of a multi-output network that persists through extreme post-bottleneck depths, and prevents the kernel of the network from losing discriminative power at extreme post-bottleneck depths.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Fault location in High Voltage Multi-terminal dc Networks Using Ensemble Learning

Precise location of faults for large distance power transmission networks is essential for faster repair and restoration process. High Voltage direct current (HVdc) networks using modular multi-level converter (MMC) technology has found its prominence for interconnected multi-terminal networks. This allows for large distance bulk power transmission at lower costs. However, they cope with the challenge of dc faults. Fast and efficient methods to isolate the network under dc faults have been widely studied and investigated. After successful isolation, it is essential to precisely locate the fault. The post-fault voltage and current signatures are a function of multiple factors and thus accurately locating faults on a multi-terminal network is challenging. In this paper, we discuss a novel data-driven ensemble learning based approach for accurate fault location. Here we utilize the eXtreme Gradient Boosting (XGB) method for accurate fault location. The sensitivity of the proposed algorithm to measurement noise, fault location, resistance and current limiting inductance are performed on a radial three-terminal MTdc network designed in Power System Computer Aided Design (PSCAD)/Electromagnetic Transients including dc (EMTdc).

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

Reverse-mode differentiation in arbitrary tensor network format: with application to supervised learning.

This paper describes an efficient reverse-mode differentiation algorithm for contraction operations of tensor networks that may have arbitrary and unconventional network topologies. The approach leverages the tensor contraction tree of Evenbly and Pfeifer (2014), which provides an instruction set for the contraction sequence of a network. We show that this tree can be efficiently leveraged for differentiation of a full tensor network contraction using a recursive scheme that exploits (1) the bilinear property of contraction and (2) the property that trees have single path from root to leaves. While differentiation of tensor-tensor contraction is already possible in most automatic differentiation packages, we show that exploiting these two additional properties in the specific context of contraction sequences can improve efficiency. Following a description of the algorithm and computational complexity analysis, we investigate its utility for gradient-based supervised learning for low-rank function recovery and for fitting real-world unstructured datasets. We demonstrate improved performance over alternating least-squares optimization approaches and the capability to handle heterogeneous and arbitrary tensor network formats. When compared to alternating minimization algorithms, we find that the gradient-based approach requires a smaller oversampling ratio (number of samples compared to number model parameters) for recovery. This increased efficiency extends to fitting unstructured data of varying dimensionality and when employing a variety of tensor network formats. Here, we show improved learning using the hierarchical Tucker method over the tensor-train in high-dimensional settings on a number of benchmark problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Comparative Analysis of HEATNETS for Geothermal Network Performance: Preprint

Thermal energy networks (TENs), also known as 5th generation district energy systems, or more specifically geothermal networks when exchanging heat with geothermal boreholes, are an important technology for decarbonization. In these networks an ambient loop connects buildings and thermal sources, such as a borehole field, to exchange energy and maintain a desired loop temperature. Water-source heat pumps are used at the buildings to connect to the ambient or thermal loop to meet to the building heating and cooling loads and maintain comfort. A semi-transient, reduced-order technical model and techno-economic model, called HEATNETS, has been developed at NREL that captures the flow of energy around a TEN. In this work, a comparison of the HEATNETS technical model and a well-known coding platform used for modeling geothermal networks, TRNSYS, has been completed for a proposed geothermal network as a verification process. Hourly data provided from the TRNSYS simulation included building loads, pumping power, heat pump power, temperature entering and leaving the borehole field, and mass flow rates. The hourly borehole temperatures were used to create a linear regression model utilized in HEATNETS to estimate the borehole field heat exchange. The building loads and mass flow rates were direct inputs to HEATNETS while the pumping power, heat pump power, borehole temperatures, and coefficients of performance were all simulated and calculated by HEATNETS, allowing for direct comparison of the thermal energy transfer, rather than also comparing control systems responses. HEATNETS considers the full process from design inputs to economic outputs and can provide modeling options for high-level initial system design and operational optimization. This study shows that HEATNETS, while not intended to replace other modeling tools, can be a unique modeling tool for the performance of a full geothermal network system.

15 GEOTHERMAL ENERGY↗
DOE OSTI2021

Protein conformational switch discerned via network centrality properties

Network analysis has emerged as a powerful tool for examining structural biology systems. The spatial organization of the components of a biomolecular structure has been rendered as a graph representation and analyses have been performed to deduce the biophysical and mechanistic properties of these components. For proteins, the analysis of protein structure networks (PSNs), especially via network centrality measurements and cluster coefficients, has led to identifying amino acid residues that play key functional roles and classifying amino acid residues in general. Whether these network properties examined in various studies are sensitive to subtle (yet biologically significant) conformational changes remained to be addressed. Here, we focused on four types of network centrality properties (betweenness, closeness, degree, and eigenvector centralities) for conformational changes upon ligand binding of a sensor protein (constitutive androstane receptor) and an allosteric enzyme (ribonucleotide reductase). We found that eigenvector centrality is sensitive and can distinguish salient structural features between protein conformational states while other centrality measures, especially closeness centrality, are less sensitive and rather generic with respect to the structural specificity. We also demonstrated that an ensembleinformed, modified PSN with static edges removed (which we term PSN*) has enhanced sensitivity at discerning structural changes.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2025

Gene network centrality analysis identifies key regulators coordinating day-night metabolic transitions in Synechococcus elongatus PCC 7942 despite limited accuracy in predicting direct regulator-gene interactions

Synechococcus elongatus PCC 7942 is a model organism for studying circadian regulation and bioproduction, where precise temporal control of metabolism significantly impacts photosynthetic efficiency and CO 2 -to-bioproduct conversion. Despite extensive research on core clock components, our understanding of the broader regulatory network orchestrating genome-wide metabolic transitions remains incomplete. We address this gap by applying machine learning tools and network analysis to investigate the transcriptional architecture governing circadian-controlled gene expression. While our approach showed moderate accuracy in predicting individual transcription factor-gene interactions - a common challenge with real expression data - network-level topological analysis successfully revealed the organizational principles of circadian regulation. Our analysis identified distinct regulatory modules coordinating day-night metabolic transitions, with photosynthesis and carbon/nitrogen metabolism controlled by day-phase regulators, while nighttime modules orchestrate glycogen mobilization and redox metabolism. Through network centrality analysis, we identified potentially significant but previously understudied transcriptional regulators: HimA as a putative DNA architecture regulator, and TetR and SrrB as potential coordinators of nighttime metabolism, working alongside established global regulators RpaA and RpaB. This work demonstrates how network-level analysis can extract biologically meaningful insights despite limitations in predicting direct regulatory interactions. The regulatory principles uncovered here advance our understanding of how cyanobacteria coordinate complex metabolic transitions and may inform metabolic engineering strategies for enhanced photosynthetic bioproduction from CO 2 .

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2024

A multilayer network analysis of Alzheimer's disease pathogenesis: Roles for p‐tau, synaptic peptides, and physical activity

INTRODUCTION: In the aging brain, cognitive abilities emerge from the coordination of complex pathways arising from a balance between protective lifestyle and environmental factors and accumulation of neuropathologies. METHODS: As part of the Rush Memory and Aging Project (n = 440), we measured accelerometer-based actigraphy, cognitive performance, and after brain autopsy, selected reaction monitoring mass spectrometry. Multilevel network analysis was used to examine the relationships among the molecular machinery of vesicular neurotransmission, Alzheimer's disease (AD) neuropathology, cognition, and late-life physical activity. RESULTS: Synaptic peptides involved in neuronal secretory function were the most influential contributors to the multilayer network, reflecting the complex interdependencies among AD pathology, synaptic processes, and late-life cognition. Older adults with lower physical activity evidenced stronger adverse relationships among phosphorylated tau peptides, markers of synaptic integrity, and tangle pathology. DISCUSSION: Network-based approaches simultaneously model interdependent biological processes and advance understanding of the role of physical activity in age-associated cognitive impairment. Highlights: Network-based approaches simultaneously model interdependent biological processes. Secretory synaptic peptides were influential contributors to the multilayer network. Older adults with lower physical activity had adverse relationships among pathology. There was interdependence among phosphorylated tau, synaptic integrity, and tangles. Network methods elucidate the role of physical activity in cognitive impairment.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2024

Shortest path network interdiction with asymmetric uncertainty

Abstract This paper considers an extension of the shortest path network interdiction problem that incorporates robustness to account for parameter uncertainty. The shortest path interdiction problem is a game of two players with conflicting agendas and capabilities: an evader, who traverses the arcs of a network from a source node to a sink node using a path of shortest length, and an interdictor, who maximizes the length of the evader's shortest path by interdicting arcs on the network. It is usually assumed that the parameters defining the network are known exactly by both players. We consider the situation where the evader assumes the nominal parameter values while the interdictor uses robust optimization techniques to account for parameter uncertainty or sensor degradation. We formulate this problem as a nonlinear mixed‐integer semi‐infinite bilevel program and show that it can be converted into a mixed‐integer linear program with a second order cone constraint. We use random geometric networks and transportation networks to perform computational studies and demonstrate the unique decision strategies that our variant produces. Solving the shortest path interdiction problem with asymmetric uncertainty protects the interdictor from investing in a strategy that hinges on key interdictions performing as promised. It also provides an alternate strategy that mitigates the risk of these worst‐case possibilities.

Punla‐Green, She'ifa Z.↗
DOE OSTI2021

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↗
DOE OSTI2022

How deep to dig: effects of web-scraping search depth on hyperlink network analysis of environmental stewardship organizations

Abstract Social network analysis (SNA) tools and concepts are essential for addressing many environmental management and sustainability issues. One method to gather SNA data is to scrape them from environmental organizations’ websites. Web-based research can provide important opportunities to understand environmental governance and policy networks while potentially reducing costs and time when compared to traditional survey and interview methods. A key parameter is ‘search depth,’ i.e., how many connected pages within a website to search for information. Existing research uses a variety of depths and no best practices exist, undermining research quality and case study comparability. We therefore analyze how search depth affects SNA data collection among environmental organizations, if results vary when organizations have different objectives, and how search depth affects social network structure. We find that scraping to a depth of three captures the majority of relevant network data regardless of an organization’s focus. Stakeholder identification (i.e., who is in the network) may require less scraping, but this might under-represent network structure (i.e., who is connected). We also discuss how scraping web-pages of local programs of larger organizations may lead to uncertain results and how our work can combine with mixed methods approaches.

Sayles, Jesse S. (ORCID:0000000218378920)↗
DOE OSTI2020

Resiliency-based restoration optimization for dependent network systems against cascading failures

Due to the increasing importance of large-scale and complex network systems and the potential for massive cascading failures in these real-world systems, modeling of system resiliency and optimization of restoration strategies to mitigate system performance loss caused by diverse disruptions is of significant interest among researchers and practitioners. Although society has experienced many incidents that demonstrate the influence of cascading failures aggravated by dependencies inside network systems, existing resiliency-based restoration optimization research rarely if ever jointly considers the impact of system dependencies on cascading failures. In this paper, different restoration prioritization strategies are applied to network systems subject to cascading failures that take into account system dependencies. By conducting case studies on synthetic networks and the U.S. airport network system, the effects of restoration strategies are evaluated using a system resiliency metric and two system performance measurements. Furthermore, the influence of system dependency characteristics and the interplay between them and restoration strategies on system resiliency regarding cascading failures are also investigated. This work demonstrates the distinct effects of restoration prioritization actions against cascading failures to mitigate the performance loss in network systems with different properties. It also provides insights about restoration improvement by considering dependency impacts to effectively reduce the intensity and extent of cascading failures.

42 ENGINEERING↗
DOE OSTI2022

Reprocessable and Recyclable Polymer Network Electrolytes via Incorporation of Dynamic Covalent Bonds

Mechanically durable polymer network electrolytes are desirable for batteries; however, covalent cross-linking adversely affects their large-scale manufacturing, and they are difficult to recycle post-lifespan. In this work, we address the electrolyte reprocessability and recyclability challenges through the use of dynamic covalent bonds for polymer network solid electrolytes. Specifically, the associative dynamic vinylogous urethane motif is incorporated into a poly(ethylene oxide) network electrolyte containing lithium bis(fluorosulfonyl)imide (LiFSI) salt. The resulting dynamic covalent network electrolyte possesses a modest ion conductivity (~10–5 S/cm at room temperature) and good reprocessability. Stress–relaxation studies indicate that the LiFSI salt can catalyze the bond exchange and enhance the network dynamics. Furthermore, the reprocessability associated with bond exchange can be tuned by simply adjusting the formulation of reagent compositions, in which increasing the amount of excess amine or using a shorter chain of PEO prepolymer can further enhance the network dynamics and corresponding reprocessability.

25 ENERGY STORAGE↗
DOE OSTI2021

A Direct Probe of the Hydrogen Bond Network in Aqueous Glycerol Aerosols

The properties of aerosols are of paramount importance in atmospheric chemistry and human health. The hydrogen bond network of glycerol-water aerosols generated from an aqueous solution with different mixing ratios is probed directly with X-ray photoelectron spectroscopy. The carbon and oxygen X-ray spectra reveal contributions from gas and condensed phase components of the aerosol. It is shown that water suppresses glycerol evaporation up to a critical mixing ratio. A dielectric analysis using terahertz spectroscopy coupled with infrared spectroscopy of the bulk solutions provides a picture of the microscopic heterogeneity prevalent in the hydrogen bond network when combined with the photoelectron spectroscopy analysis. The hydrogen bond network is composed of three intertwined regions. At low concentrations, glycerol molecules are surrounded by water forming a solvated water network. Adding more glycerol leads to a confined water network, maximizing at 22 mol %, beyond which the aerosol resembles bulk glycerol. This microscopic view of hydrogen bonding networks holds promise in probing evaporation, diffusion dynamics, and reactivity in aqueous aerosols.

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

Hydrogen-Bonding Bottlebrush Networks: Self-Healing Materials from Super-Soft to Stiff

The impact of polymer architecture on network dynamics and self-healing is presented using bottlebrushes containing side chains that are end-functionalized with 2-ureido-4[1H]-pyrimidinone (UPy). The synthesis of these materials is straightforward through a three-step process: (1) synthesizing rubbery poly(4-methylcaprolactone) macromonomers (p4MCL–OH) with a norbornene-based initiator, (2) functionalizing the terminal hydroxyl group with UPy–isocyanate (p4MCL–UPy), and (3) statistically copolymerizing p4MCL–OH and p4MCL–UPy via ring-opening metathesis polymerization (ROMP) to form hydrogen-bonding bottlebrushes having a fraction (p) of side chains functionalized with UPy. Attaching UPy to the free end of bottlebrush side chains dilutes the impact of friction from complementary UPy interactions on segmental dynamics, leading to a much weaker dependence of the glass-transition temperature (T g ) on p than observed in linear analogues, while the activation energy to dissociate UPy–UPy bonds (41–47 kJ/mol) remains mostly unchanged. Longer side chains result in a competition between reducing T g and inducing entanglements that influence hydrogen-bonded network dynamics. Increasing the backbone length extends the sticky Rouse region without affecting the network modulus (G x ) or UPy–UPy dissociation time (τ s ). Gx scales linearly with p and ranges from 27 kPa to 1.6 MPa, while τs remains nearly constant in contrast to linear telechelic ionomers, implying a similar self-healability across bottlebrush networks containing different amounts of UPy. Furthermore, these stretchable networks with p ≤ 0.25 undergo self-healing upon repeated rupture and melt pressing at ≤100 °C while retaining similar tensile properties. In summary, decorating bottlebrush polymers with hydrogen bonds creates opportunities to independently manipulate associative network dynamics and mechanical moduli.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Supramolecular meso -Trick: Ambidextrous Mirror Symmetry Breaking in a Liquid Crystalline Network with Tetragonal Symmetry

Bicontinuous and multicontinuous network phases are among nature's most complex structures in soft matter systems. Here, a chiral bicontinuous tetragonal phase is reported as a new stable liquid crystalline intermediate phase at the transition between two cubic phases, the achiral double gyroid and the chiral triple network cubic phase with an I 23 space group, both formed by dynamic networks of helices. The mirror symmetry of the double gyroid, representing a meso -structure of two enantiomorphic networks, is broken at the transition to this tetragonal phase by retaining uniform helicity only along one network while losing it along the other one. This leads to a conglomerate of enantiomorphic tetragonal space groups, P 4 1 2 1 2 and P 4 3 2 1 2. Phase structures and chirality were analyzed by small-angle X-ray scattering (SAXS), grazing-incidence small-angle X-ray scattering (GISAXS), resonant soft X-ray scattering (RSoXS) at the carbon K-edge, and model-dependent SAXS/RSoXS simulation. In conclusion, our findings not only lead to a new bicontinuous network-type three-dimensional mesophase but also reveal a mechanism of mirror symmetry breaking in soft matter by partial meso -structure racemization at the transition from enantiophilic to enantiophobic interhelical self-assembly.

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

Spatiotemporal Variability in Transport and Reactive Processes Across a First- to Fifth-Order Fluvial Network

Fluvial networks integrate and transport constituents from terrestrial and aquatic ecosystems. To date, most research on water quality dynamics has focused on process understanding at individual streams and, as a result, there is a lack of studies analyzing how small-scale, physical and biogeochemical drivers scale across fluvial networks. We performed tracer tests in five stream orders of the Jemez River continuum in New Mexico, USA, to quantify reach-scale hyporheic exchange during two different seasonal periods to address: how do hyporheic zone contributions to riverine processing change with space and time? And does the spatiotemporal variability of hyporheic exchange scale across fluvial networks? Combining conservative (i.e., bromide) and reactive (i.e., resazurin) tracer analyses with solute transport modeling, we found a dominance of reaction-limited transport conditions in space (for all stream orders) and time (two contrasting flow regimes). Moreover, we found a trend toward more reaction-limited conditions with increasing discharge across all stream orders. While our studied fluvial network did not consistently follow the expectations of decreasing hyporheic exchange contributions with increasing stream order, as it has been previously suggested from modeling studies, we found that processing rate coefficients and Damköhler numbers consistently decreased along the continuum with increasing discharge. Our findings suggest that knowledge transferability of hyporheic zone processing along fluvial networks may be possible if the scaling patterns that we found hold true in other catchments. Thus, more research on scaling patterns along fluvial networks is highly needed.

Gootman, Kaylyn S.↗
DOE OSTI2022

Spatiotemporal Graph Convolutional Networks for Earthquake Source Characterization

Abstract Accurate earthquake location and magnitude estimation play critical roles in seismology. Recent deep learning frameworks have produced encouraging results on various seismological tasks (e.g., earthquake detection, phase picking, seismic classification, and earthquake early warning). Many existing machine learning earthquake location methods utilize waveform information from a single station. However, multiple stations contain more complete information for earthquake source characterization. Inspired by recent successes in applying graph neural networks (GNNs) in graph‐structured data, we develop a Spatiotemporal Graph Neural Network (STGNN) for estimating earthquake locations and magnitudes. Our graph neural network leverages geographical and waveform information from multiple stations to construct graphs automatically and dynamically by adaptive message passing based on graphs' edges. Using a recent graph neural network and a fully convolutional neural network as baselines, we apply STGNN to earthquakes recorded by the Southern California Seismic Network from 2000 to 2019 and earthquakes collected in Oklahoma from 2014 to 2015. STGNN yields more accurate earthquake locations than those obtained by the baseline models and performs comparably in terms of depth and magnitude prediction, though the ability to predict depth and magnitude remains weak for all tested models. Our work demonstrates the potential of using GNNs and multiple stations for better automatic estimation of earthquake epicenters.

58 GEOSCIENCES↗