Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “NETWORK”

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 1,099 records · Page 61

Networked Microgrid Topology Reconfiguration to Promote Fairness in Proactive Load Shedding

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

24 POWER TRANSMISSION AND DISTRIBUTION↗

Adaptive Activation Functions Accelerate Convergence in Deep and Physics-informed Neural Networks

We employ adaptive activation functions for regression in deep and physics-informed neural networks (PINNs) to approximate smooth and discontinuous functions as well as solutions of linear and nonlinear partial differential equations. In particular, we solve the nonlinear Klein-Gordon equation, which has smooth solutions, the nonlinear Burgers equation, which can admit high gradient solutions, and the Helmholtz equation. We introduce a scalable hyper-parameter in the activation function, which can be optimized to achieve best performance of the network as it changes dynamically the topology of the loss function involved in the optimization process. The adaptive activation function has better learning capabilities than the traditional one (fixed activation) as it improves greatly the convergence rate, especially at early training, as well as the solution accuracy. To better understand the learning process, we plot the neural network solution in the frequency domain to examine how the network captures successively different frequency bands present in the solution. We consider both forward problems, where the approximate solutions are obtained, as well as inverse problems, where parameters involved in the governing equation are identified. Our simulation results show that the proposed method is a very simple and effective approach to increase the efficiency, robustness and accuracy of the neural network approximation of nonlinear functions as well as solutions of partial differential equations, especially for forward problems. We theoretically prove that in the proposed method, gradient descent algorithms are not attracted to suboptimal critical points or local minima.

machine leaning, Bad minima, Inverse problems, Phy↗

Explicitly antisymmetrized neural network layers for variational Monte Carlo simulation

The combination of neural networks and quantum Monte Carlo methods has arisen as a promising path forward for highly accurate electronic structure calculations. Previous proposals have combined equivariant neural network layers with a final antisymmetric layer in order to satisfy the antisymmetry requirements of the electronic wavefunction. However, to date it is unclear if one can represent antisymmetric functions of physical interest, and it is difficult to precisely measure the expressiveness of the antisymmetric layer. Here, this work attempts to address this problem by introducing explicitly antisymmetrized universal neural network layers. This approach has a computational cost which increases factorially with respect to the system size, but we are nonetheless able to apply it to small systems to better understand how the structure of the antisymmetric layer affects its performance. We first introduce a generic antisymmetric (GA) neural network layer, which we use to replace the entire antisymmetric layer of the highly accurate ansatz known as the FermiNet. We demonstrate that the resulting FermiNet-GA architecture can yield effectively the exact ground state energy for small atoms and molecules. We then consider a factorized antisymmetric (FA) layer which more directly generalizes the FermiNet by replacing the products of determinants with products of antisymmetrized neural networks. We find, interestingly, that the resulting FermiNet-FA architecture does not significantly outperform the FermiNet. This strongly suggests that the sum of products of antisymmetries is a key limiting aspect of the FermiNet architecture. To explore this further, we investigate a slight modification of the FermiNet, called the full determinant mode, which replaces each product of determinants with a single combined determinant. We find that the full single-determinant FermiNet closes a large part of the gap between the standard single-determinant FermiNet and FermiNet-GA on small atomic and molecular problems. Surprisingly, on the nitrogen molecule at a dissociating bond length of 4.0 Bohr, the full single-determinant FermiNet can outperform the largest standard FermiNet calculation with 64 determinants.

97 MATHEMATICS AND COMPUTING↗

A differentiable approach to the maximum independent set problem using dataless neural networks

The success of machine learning solutions for reasoning about discrete structures has brought attention to its adoption within combinatorial optimization algorithms. Such approaches generally rely on supervised learning by leveraging datasets of the combinatorial structures of interest drawn from some distribution of problem instances. Reinforcement learning has also been employed to find such structures. Here, in this paper, we propose a different approach in that no data is required for training the neural networks that produce the solution. In this sense, what we present is not a machine learning solution, but rather one that is dependent on neural networks and where backpropagation is applied to a loss function defined by the structure of the neural network architecture as opposed to a training dataset. In particular, we reduce the popular combinatorial optimization problem of finding a maximum independent set to a neural network and employ a dataless training scheme to refine the parameters of the network such that those parameters yield the structure of interest. Additionally, we propose a universal graph reduction procedure to handle large-scale graphs. The reduction exploits community detection for graph partitioning and is applicable to any graph type and/or density. Experimental results on both real and synthetic graphs demonstrate that our proposed method performs on par or outperforms state-of-the-art learning-based methods in terms of the size of the found set without requiring any training data.

97 MATHEMATICS AND COMPUTING↗

A scalable algorithm for the optimization of neural network architectures

In this work, we propose a new scalable method to optimize the architecture of an artificial neural network. The proposed algorithm, called Greedy Search for Neural Network Architecture, aims to determine a neural network with minimal number of layers that is at least as performant as neural networks of the same structure identified by other hyperparameter search algorithms in terms of accuracy and computational cost. Numerical results performed on benchmark datasets show that, for these datasets, our method outperforms state-of-the-art hyperparameter optimization algorithms in terms of attainable predictive performance by the selected neural network architecture, and time-to-solution for the hyperparameter optimization to complete.

97 MATHEMATICS AND COMPUTING↗

Deep reinforcement learning assisted co-optimization of Volt-VAR grid service in distribution networks

With the increasing penetration of distributed energy resources in distribution networks, Volt-VAR control and optimization (VVC/VVO) have become very important to ensure an acceptable quality of service to all customers. System operators can rely on slow-responding utility devices, including capacitor banks and on-load tap changing transformers, along with fast-responding battery and photovoltaic (PV) inverters for the VVC/VVO implementation. Because of variations in response time of these two classes of devices, and different control actions (discrete versus continuous), coordinated and optimal scheduling and operation have become of utmost importance. Here, this paper develops a look-ahead deep reinforcement learning (DRL)-based multi-objective VVO technique to improve the voltage profile of active distribution networks, decrease network and inverter power loss, and save the operational cost of the grid. It proposes a deep deterministic policy gradient (DDPG)-based approach to schedule the optimal reactive and/or active power set-points of fast-responding inverters, and a deep Q-network (DQN)-based DRL agent to schedule the discrete decisions variables of slow-responding assets. The reactive power output of PV and battery smart inverters are scheduled at 30-minute intervals and the capacitors’ commitment status is scheduled with several hour intervals. The proposed framework is validated on the modified IEEE 34-bus and 123-bus test cases with embedded PV and PV-plus-storage. To validate the efficacy of the proposed VVO, it is compared with several scenarios, including the base case without VVO, localized droop control of DERs, DDPG-only, and twin delayed DDPG (TD3) agent-based DRL techniques. The results justify the superior performance of the proposed method to improve the voltage profile, reduce network power loss, and minimize the look-ahead grid operational cost while minimizing the undesirable power losses in inverters as a result of power factor adjustments.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A link-node reformulation of ridesharing user equilibrium with network design

Though the conventional network design is extensively studied, the network design problem for ridesharing, in particular, the deployment of high-occupancy toll (HOT) lanes, remains understudied. Here this paper focuses on one type of network design problem as to whether existing roads should be retrofit into HOT lanes. It is a continuous bi-level mathematical program with equilibrium constraints. The lower level problem is ridesharing user equilibrium (RUE). To reduce the problem size and facilitate computation, we reformulate RUE in the link-node representation. Then we extend the RUE framework to accommodate the presence of HOT lanes and tolls. Algorithms are briefly discussed and numerical examples are illustrated on the Braess network and the Sioux Falls network, respectively. Results show that carefully selecting the deployment of HOT lanes can improve the overall system travel time.

42 ENGINEERING↗

Understanding the perceptions, roles and interactions of stakeholder networks managing health-care waste: A case study of the Gaza Strip

Highlights: • We systematically review scientific literature about health-care waste management. • We identify and discuss gaps, trends, efforts, and key-factors. • We suggest areas for improvement and best practices reported in literature. • We include recommendations for policy makers, practitioners and researchers. • We promote a holistic and harmonized approach to health-care waste management. - Abstract: The sustainable management of waste requires a holistic approach involving a range of stakeholders. What can often be difficult is to understand the manner in which different types of stakeholder networks are composed and work, and how best to enhance their effectiveness. Using social network analysis and stakeholder analysis of healthcare waste management stakeholders in the case study region of the Gaza Strip, this study aimed to understand and examine the manner in which the networks functioned. The Ministry of Health was found to be the most important stakeholder, followed by municipalities and solid waste management councils. Some international agencies were also mentioned, with specific roles, while other local institutions had a limited influence. Finally while health-care facilities had a strong interest in waste management, they were generally poorly informed and had limited links to each other. The manner in which the networks operated was complicated and influenced by differences in perception, sharing of information, access to finance and levels of awareness. The lack of a clear legal framework generated various mistakes about roles and responsibilities in the system, and evidently regulation was not an effective driver for improvement. Finally stakeholders had different priorities according to the waste management issues they were involved with, however segregation at the source was identified as a key requirement by most. Areas for improving the effectiveness of the networks are suggested. The analysis utilized an innovative methodology, which involved a large number of stakeholders. Such an approach served to raise interest and awareness at different levels (public authorities, health providers, supporting actors, others), stimulate the discussion about the adoption of specific policies, and identify the effective way forward.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Development of Steady-State and Dynamic Mass and Energy Constrained Neural Networks for Distributed Chemical Systems Using Noisy Transient Data

The paper presents the development of algorithms for mass and energy constrained neural network models that can exactly conserve the overall mass and energy of distributed chemical process systems, even though the noisy transient data used for optimal model training violate the same. In contrast to approximately satisfying mass and energy balance constraints of a system by soft penalization of objective function, algorithms have been developed for solving equality-constrained nonlinear optimization problems, thus providing the guarantee of exactly satisfying the system mass and energy conservation laws. For developing dynamic mass-energy constrained network models for distributed systems, hybrid series and parallel dynamic-static neural networks have been leveraged. The developed algorithms for solving both the training and forward problems are validated using both steady-state and dynamic data in the presence of various noise characteristics. The developed data-driven algorithms are flexible to exactly satisfy mass and energy balance constraints for dynamic chemical processes if the system holdup information is available. The proposed network structures and algorithms are applied to the development of data-driven lumped and distributed models of an adiabatic superheater/reheater system, a nonisothermal continuous stirred tank reactor, as well as an electrically heated plug-flow reactor system where one form of energy gets transformed to another. It has been observed that the mass-energy constrained neural networks yield a root mean squared error of <1% with respect to the system truth for the case studies evaluated in this work.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Bottlebrush-Guided Polymer Crystallization Resulting in Supersoft and Reversibly Moldable Physical Networks

The goal of this study is to use ABA triblock copolymers with central bottlebrush B segments and crystalline linear chain A segments to demonstrate the effect of side chains on the formation and mechanical properties of physical networks cross-linked by crystallites. For this purpose, a series of bottlebrush copolymers was synthesized consisting of central amorphous bottlebrush polymer segments with a varying degree of polymerization (DP) of poly(n-butyl acrylate) (PnBA) side chains and linear tail blocks of crystallizable poly(octadecyl acrylate-stat-docosyl acrylate) (poly(ODA-stat-DA)). The materials were generated by sequential atom transfer radical polymerization (ATRP) steps starting with a series of bifunctional macroinitiators followed by the growth of two ODA-stat-DA linear-chain tails and eventually growing poly(nBA) side chains with increasing DPs. Crystallization of the poly(ODA-stat-DA) tails resulted in a series of reversible physical networks with bottlebrush strands bridging crystalline cross-links. They displayed very low moduli of elasticity of the order of 10 3 –10 4 Pa. These distinct properties are due to the bottlebrush architecture, wherein densely grafted side chains play a dual role by facilitating disentanglement of the network strands and confining crystallization of the linear-chain tails. This combination leads to physical cross-linking of supersoft networks without percolation of the crystalline phase. The cross-link density was effectively controlled by the DP of the side chains with respect to the DP of the linear tails (n A ). Furthermore, shorter side chains allowed for crystallization of the linear tails of neighboring bottlebrushes, while steric repulsion between longer side chains hindered the phase separation and crystallization process and prevented network formation.

36 MATERIALS SCIENCE↗

Creation of Self-Semi-Interpenetrating Network Structures in PIM-1 Membranes for Enhanced Physical Aging Resistance

A series of self-semi-interpenetrating network (ssIPN) thin films based on PIM-1 structure were developed by end-cross-linking telechelic PIM-1 oligomers end-capped with curable carboxylic acid groups to form model networks, which are penetrated by linear high-molecular-weight PIM-1 chains. ssIPN films with systematically varied network content ranging from 10 to 30 wt % were comprehensively examined on their microstructure and gas permeation properties. Fresh PIM-1 ssIPN films exhibited gas separation performances close to those of as-cast linear PIM-1, where the films closely followed the upper bound trade-off line, gaining as much selectivity as they lose gas permeability as the network content increases. This indicates that gas permeability is largely preserved despite cross-linking. Wide-angle X-ray scattering supported this observation, with peaks shifting toward lower d-spacing as oligomer content increased, suggesting tighter chain packing with higher cross-linkable oligomer loading. In physical aging studies over two months, all ssIPN films outperform linear PIM-1 for H 2 /CH 4 and O 2 /N 2 separations. Notably, the PIM-1 ssIPN with 10 wt % network content showed the best physical aging resistance, with negligible permeability loss even after one month. Finally, these findings highlight a promising macromolecular strategy for enhancing the physical aging resistance of microporous polymer membranes for gas separation.

PIM-1↗

Degrees of Rate Control in Interconnected Reaction Networks

Overall reactions in interconnected networks exhibit net, forward, and reverse rates that are governed by both constitutive elementary steps in the pathway of interest and branching elementary steps that lead to alternative products. Accordingly, steps in branching pathways exhibit negative net, forward, and reverse degrees of rate control, as they reduce reaction flux to the desired product. We here contextualize the forward and reverse degrees of rate control in terms of kinetic resistances (inverse of rates) and leverage the additive nature of kinetic resistance to decouple kinetic driving forces contributed by constitutive elementary steps and branching points (nodal species) in interconnected networks. Regardless of the network connectivity, forward and reverse degrees of rate control are shown to converge at equilibrium. Away from equilibrium, we identify two critical features of interconnected networks: stoichiometric regularity─condition where all stoichiometric numbers are unity─and pathway symmetry around nodal species─condition where branching pathways share the same rate constants, stoichiometry, and species concentrations/activities─that result in (i) equal forward, reverse, and consequently net degrees of rate control and (ii) forward and reverse degrees of rate control that exhibit constant offsets, respectively, across all extents of reaction. Furthermore, our discourse further provides a mathematical description for the influence of stoichiometric irregularity and pathway asymmetry on forward and reverse degrees of rate control. Altogether, the presented work details the effects of network (inter)connectivity and stoichiometry on reaction kinetics and, in doing so, establishes general protocols for capturing these effects as additive terms in the formulation of forward and reverse degrees of rate control.

10 SYNTHETIC FUELS↗

Interplay of River and Tidal Forcings Promotes Loops in Coastal Channel Networks

We report the dense populations that inhabit global coastlines have an uncertain future due to increased flooding, storms, and human modification. The channel networks of deltas and marshes that plumb these coastlines present diverse architectures, including well-studied dendritic topologies. However, the quasi-stable loops that exist in nearly all coastal networks have not yet been explained. We present a model for self-organizing networks inspired by vascular biophysics to show that loops emerge when the relative forcings between rivers and tides are comparable, resulting in interplay between hydrodynamic forcings at short time scales relative to network evolution. Using field data and satellite imaging, we confirm this control on 21 field networks. Our comparison provides compelling evidence that hydrodynamic fluctuations are capable of stabilizing loops in geophysical systems.

54 ENVIRONMENTAL SCIENCES↗

Reactive Transport Modeling of Mineral Precipitation and Carbon Trapping in Discrete Fracture Networks

In this study we use numerical experiments to analyze reactive flow and transport behavior in discrete intersecting fracture networks, focusing on (a) how reaction-induced changes in physical and chemical properties affect flow connectivity and (b) how fracture networks developed in the Earth's critical zone contribute to carbon sequestration via mineral weathering reactions. In the first part of the study, we used two-dimensional reactive flow and transport simulations to analyze the impacts of mixing in a natural discrete fracture network. We concluded that reaction-induced changes can substantially alter the flow connectivity, especially at fracture intersections. The second set of simulations considered the problem of natural weathering of fractured mafic and ultramafic rocks in the partially saturated Earth's critical zone as a function of infiltration rates, fracture permeability, and partially saturated flow parameters. As a model system, we considered an incongruent reaction network with dissolution of forsterite and precipitation of magnesite. The behavior is complex in terms of the rate-controlling processes because of the multicomponent nature of the system as shown by the grid Peclet number: the CO 2 behavior is gas diffusion-controlled in the partially saturated zone, while the rate of water flow via the Damkӧhler number controls Mg 2+ transport through the fracture network. The amounts of carbon that can be trapped are modest, but the naturally fractured domain considered here provides a useful “base case” against which various engineered solutions can be compared.

58 GEOSCIENCES↗

A Dynamic Pore Network Model for Imbibition Simulation Considering Corner Film Flow

Wetting films can develop in the corners of angular pores under strong wetting conditions. Modeling the dynamics of corner film remains elusive using direct numerical simulations because of the significant scale difference between main meniscus and corner film flow. In this paper, the modified interacting capillary bundle model (ICB), developed in our previous work to describe accurately corner film dynamics in a single square tube, is incorporated into a single-pressure dynamic pore network model (DPNM) to simulate imbibition in strongly wetting porous media with corner film flow. The traditional pore network is decomposed into several layers of interacting subpore networks where the 0th layer of subpore network simulates the main meniscus flow and higher layers the corner film flow. The fluid flow between different layers is captured by interlayer throats. In addition, the snap-off mechanism caused by the thickening of wetting corner film is considered. The accuracy of the developed model is validated for four cases: spontaneous imbibition in a single square tube, wetting fluid redistribution through corner films under a capillary pressure difference, snap off in a narrow throat connecting two large pores, and imbibition dynamics in a real microfluidic porous geometry. The validated model is then used to simulate both spontaneous and controlled imbibition in a pore network with random pore size distribution. Finally, the interaction between corner film and main meniscus flow in porous media is analyzed from a pore-scale perspective.

58 GEOSCIENCES↗

Effects of Dead‐End Fractures on Non‐Fickian Transport in Three‐Dimensional Discrete Fracture Networks

Abstract Understanding mechanistic causes of non‐Fickian transport in fractured media is important for many hydrogeologic processes and subsurface applications. This study elucidates the effects of dead‐end fractures on non‐Fickian transport in three‐dimensional (3D) fracture networks. Although dead‐end fractures have been identified as low‐velocity regions that could delay solute transport, the direct relation between dead‐end fractures and non‐Fickian transport has been elusive. We systematically generate a large number of 3D discrete fracture networks with different fracture length distributions and fracture densities. We then identify dead‐end fractures using a novel graph‐based method. The effect of dead‐end fractures on solute residence time maximizes at the critical fracture density of the percolation threshold, leading to strong late‐time tailing. As fracture density increases beyond the percolation threshold, the network connectivity increases, and dead‐end fractures diminish. Consequently, the increase in network connectivity leads to a reduction in the degree of late‐time tailing. We also show that dead‐end fractures can inform about main transport paths, such as the mean tortuosity of particle trajectories. This study advances our mechanistic understanding of solute transport in 3D fracture networks.

58 GEOSCIENCES↗

Engineering regulatory networks for complex phenotypes in E. coli

Regulatory networks describe the hierarchical relationship between transcription factors, associated proteins, and their target genes. Regulatory networks respond to environmental and genetic perturbations by reprogramming cellular metabolism. Here we design, construct, and map a comprehensive regulatory network library containing 110,120 specific mutations in 82 regulators expected to perturb metabolism. We screen the library for different targeted phenotypes, and identify mutants that confer strong resistance to various inhibitors, and/or enhanced production of target compounds. These improvements are identified in a single round of selection, showing that the regulatory network library is universally applicable and is convenient and effective for engineering targeted phenotypes. The facile construction and mapping of the regulatory network library provides a path for developing a more detailed understanding of global regulation in E. coli , with potential for adaptation and use in less-understood organisms, expanding toolkits for future strain engineering, synthetic biology, and broader efforts.

59 BASIC BIOLOGICAL SCIENCES↗

Network Analysis of Academic Medical Center Websites in the United States

Healthcare resources are published annually in repositories such as the AHA Annual Survey Database TM . However, these data repositories are created via manual surveying techniques which are cumbersome in collection and not updated as frequently as website information of the respective hospital systems represented. Also, this resource is not widely available to patients in an easy-to-use format. Network analysis techniques have the potential to create topological maps which serve to aid in pathfinding for patients in their search for healthcare services. This study explores the topological structure of forty United States academic health center websites. Network analysis is utilized to analyze and visualize 48,686 webpages. Several elements of network structure are examined including basic network properties, and centrality measures distributions. The Louvain community detection algorithm is used to examine the extent to which these techniques allow identification of healthcare resources within networks. The results indicate that websites with related healthcare services tend to form observable clusters useful in mapping key resources within a hospital system.

97 MATHEMATICS AND COMPUTING↗