Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “network solutions”

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,189 records · Page 66

Stability analysis of spacecraft power systems

The problems in applying standard electric utility models, analyses, and algorithms to the study of the stability of spacecraft power conditioning and distribution systems are discussed. Both single-phase and three-phase systems are considered. Of particular concern are the load and generator models that are used in terrestrial power system studies, as well as the standard assumptions of load and topological balance that lead to the use of the positive sequence network. The standard assumptions regarding relative speeds of subsystem dynamic responses that are made in the classical transient stability algorithm, which forms the backbone of utility-based studies, are examined. The applicability of these assumptions to a spacecraft power system stability study is discussed in detail. In addition to the classical indirect method, the applicability of Liapunov's direct methods to the stability determination of spacecraft power systems is discussed. It is pointed out that while the proposed method uses a solution process similar to the classical algorithm, the models used for the sources, loads, and networks are, in general, more accurate. Some preliminary results are given for a linear-graph, state-variable-based modeling approach to the study of the stability of space-based power distribution networks.

Halpin, S. M.↗

Problem size, parallel architecture and optimal speedup

The communication and synchronization overhead inherent in parallel processing can lead to situations where adding processors to the solution method actually increases execution time. Problem type, problem size, and architecture type all affect the optimal number of processors to employ. The numerical solution of an elliptic partial differential equation is examined in order to study the relationship between problem size and architecture. The equation's domain is discretized into n sup 2 grid points which are divided into partitions and mapped onto the individual processor memories. The relationships between grid size, stencil type, partitioning strategy, processor execution time, and communication network type are analytically quantified. In so doing, the optimal number of processors was determined to assign to the solution, and identified (1) the smallest grid size which fully benefits from using all available processors, (2) the leverage on performance given by increasing processor speed or communication network speed, and (3) the suitability of various architectures for large numerical problems.

Nicol, David M.↗

Problem size, parallel architecture, and optimal speedup

The communication and synchronization overhead inherent in parallel processing can lead to situations where adding processors to the solution method actually increases execution time. Problem type, problem size, and architecture type all affect the optimal number of processors to employ. The numerical solution of an elliptic partial differential equation is examined in order to study the relationship between problem size and architecture. The equation's domain is discretized into n sup 2 grid points which are divided into partitions and mapped onto the individual processor memories. The relationships between grid size, stencil type, partitioning strategy, processor execution time, and communication network type are analytically quantified. In so doing, the optimal number of processors was determined to assign to the solution, and identified (1) the smallest grid size which fully benefits from using all available processors, (2) the leverage on performance given by increasing processor speed or communication network speed, and (3) the suitability of various architectures for large numerical problems.

Nicol, David M.↗

Rational design of semi-interpenetrating network based on hyperbranched polyglycerol grafted MXene/polyurethane–epoxy for compressed hydrogen storage

Here, hydrogen (H 2 ) energy has emerged as a promising alternative in the automotive sector to replace fossil fuel; however, its storage with volumetric efficiency remains a challenge. The latest type IV storage vessel featuring a polymeric liner with composite overwrap incurs hydrogen saturation, which eventually causes failure. To prevent the H 2 dissolution in the liner, we have developed a barrier coating comprised of polyurethane/epoxy semi-interpenetrating network (S-IPN) combined with hyperbranched polyglycerol grafted MXene (h-MXene). The hyperbranched structure facilitated the dispersion of MXene in the coating solution by enhancing the exfoliation and improved the polymer filler interaction by forming covalent and H-bonding through end-terminal hydroxyl groups. Leveraging the dense network of S-IPN combined with the dispersed layer structured h-MXene significantly increased the tortuosity of the spray-coated barrier film applied to the nylon 6 liner. The coating exhibited a 90 % reduction in the H 2 gas permeability at only 2 wt% h-MXene concentration, which further improved to above 98 % at 10 wt% loading. Additionally, the h-MXene considerably improved the adhesion with the liner even in a highly stretched condition, signifying the durability of the coating under cyclic pressurization and depressurization of the storage vessel.

08 HYDROGEN↗

Terminal attractors in neural networks

A new type of attractor (terminal attractors) for content-addressable memory, associative memory, and pattern recognition in artificial neural networks operating in continuous time is introduced. The idea of a terminal attractor is based upon a violation of the Lipschitz condition at a fixed point. As a result, the fixed point becomes a singular solution which envelopes the family of regular solutions, while each regular solution approaches such an attractor in finite time. It will be shown that terminal attractors can be incorporated into neural networks such that any desired set of these attractors with prescribed basins is provided by an appropriate selection of the synaptic weights. The applications of terminal attractors for content-addressable and associative memories, pattern recognition, self-organization, and for dynamical training are illustrated.

Zak, Michail↗

A Two-Stage Quantum Reinforcement Learning Method for Multi-Objective Transmission Switching

Multi-objective transmission switching (MO-TS) problems involve the strategic reconfiguration of network topology to simultaneously optimize multiple objectives. As the system scale increases, finding feasible solutions becomes increasingly challenging due to the problem's nonlinearity and high computational complexity. To address these challenges, this paper proposes a two-stage quantum reinforcement learning method that leverages potential quantum advantages for MO-TS. In the first stage, candidate switching lines are identified using a graph-theoretical approach to reduce the problem's dimensionality. The second stage introduces a quantum-classical reinforcement learning framework, where a learnable measurement-based CNN-ResVQC architecture is developed to effectively reduce the input dimension for quantum processing, mitigate vanishing gradients, and enhance trainability while improving the quantum circuit's flexibility in modeling complex decision policies for MO-TS. Numerical studies on IEEE 14-bus, 57-bus, and 118-bus systems demonstrate that the proposed algorithm achieves superior training stability and faster convergence with approximately 1% of the network parameters required by classical algorithms, highlighting its effectiveness, efficiency, and scalability. Furthermore, the practicality is validated through its stable convergence under three common quantum noise channels.

99 GENERAL AND MISCELLANEOUS↗

Building an ab initio solvated DNA model using Euclidean neural networks

Accurately modeling large biomolecules such as DNA from first principles is fundamentally challenging due to the steep computational scaling of ab initio quantum chemistry methods. This limitation becomes even more prominent when modeling biomolecules in solution due to the need to include large numbers of solvent molecules. We present a machine-learned electron density model based on a Euclidean neural network framework that includes a built-in understanding of equivariance to model explicitly solvated double-stranded DNA. By training the machine learning model using molecular fragments that sample the key DNA and solvent interactions, we show that the model predicts electron densities of arbitrary systems of solvated DNA accurately, resolves polarization effects that are neglected by classical force fields, and captures the physics of the DNA-solvent interaction at the ab initio level.

59 BASIC BIOLOGICAL SCIENCES↗

Molecularly Mixed Composite Membranes: Challenges and Opportunities

The fabrication of porous molecules, such as metal–organic polyhedra (MOPs), porous organic cages (POCs) and others, has given rise to the potential for creating “solid solutions” of molecular fillers and polymers. Such solid solutions circumvent longstanding interface issues associated with mixed matrix membranes (MMMs), and are referred to as molecularly mixed composite membranes (MMCMs) to distinguish them from traditional two-phase MMMs. Early investigations of MMCMs highlight the advantages of solid solutions over MMMs, including dispersion of the filler, anti-plasticization of the polymer network, and removal of deleterious interfacial issues. However, the exact microscopic structure as well as the transport modality in this new class of membrane are not well understood. Moreover, there are clear engineering challenges that need to be addressed for MMCMs to transition into the field. Finally in this Minireview, the authors outline several scientific and technological challenges associated with the aforementioned questions and their suggestions to tackle them.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

High Conductivity Copper–Carbon Nanotube Hybrids via Site-Specific Chemical Vapor Deposition

In this work, site-selective copper nanometal seeding through chemical vapor deposition (CVD) is demonstrated as a viable method in concert with solution electrodeposition of bulk Cu to enhance the electrical conductivity of a porous, low-density (0.12 g/cm 3 , ~9 mg/m) CNT roving. An electrical bias applied directly to the CNT roving promotes Joule heating, which provides the thermal energy necessary for the decomposition of a bis(tert-butylacetoacetato)copper (Cu(tBAOAC) 2 ) precursor. Localized changes in the resistance within the bulk CNT conductor were used to selectively deposit the precursor at thermally active sites, which were evaluated through thermal imaging. The deposition varies from localized Cu deposits at currents producing average temperatures of ~225 °C to a consistent deposition of 10–40 nm Cu particles at applied currents producing average temperatures >300 °C, far above the threshold for the decomposition of the Cu(tBAOAC) 2 precursor. Scanning electron microscopy of a cross section of the roving reveals Cu depositions on the interior of the roving, demonstrating the penetration of the vapor into the CNT network and subsequent decomposition within the roving. A commercial acid-based Cu electroplating solution was used to deposit bulk Cu onto as-prepared and CVD seeded CNT wires, followed by planar densification and H 2 /Ar annealing. The finished conductors with Cu loadings from ~30 to 95% w/w which combine CVD Cu seeding and electrodeposition result in specific conductivity values 3-5 times higher than Cu-CNT conductors produced by electrodeposition alone. Ultimately, a CNT hybrid conductor with 94.2% w/w Cu achieved a specific conductivity of 5632 S m 2 /kg and electrical conductivity of 28.1 MS/m—approaching values previously only seen in metallic conductors. Overall, the present results demonstrate the potential of site-specific CVD toward both seeding metal prior to electroplating and as a possible method toward the enhanced nanometal interconnection of carbon conductors (NICCs).

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Optimal Discrete Net-Load Balancing in Smart Grids with High PV Penetration

Mitigating supply-demand mismatch is essential for smooth power grid operation. Traditionally, load curtailment techniques such as demand response have been used for this purpose. However, these cannot be the only component of a net-load balancing framework for smart grids with high PV penetration. These grids sometimes exhibit supply surplus, causing overvoltages. Currently, these are mitigated using voltage manipulation techniques such as Volt-Var Optimizations, which are computationally expensive, thereby increasing the complexity of grid operations. Taking advantage of recent technological developments that enable rapid selective connection of PV modules of an installation to the grid, we develop a unified net-load balancing framework that performs both load and solar curtailment. We demonstrate that when the available curtailment values are discrete, this problem is NP-hard and we develop bounded approximation algorithms. Our algorithms produce fast solutions, given the tight timing constraints required for grid operation, while ensuring that practical constraints such as fairness, network capacity limits, and so forth are satisfied. We also develop an online algorithm that performs net-load balancing using only data available for the current interval. Using both theoretical analysis and practical evaluations, we show that our net-load balancing algorithms provide solutions that are close to optimal in a small amount of time.

14 SOLAR ENERGY↗

Information Content of a Synergy of Ground-Based and Space-Based Infrared Sounders. Part I: Clear-Sky Environments

Abstract Profiles of atmospheric temperature and water vapor from remotely sensed platforms provide critical observations within the temporal and spatial gaps of the radiosonde network. The 2017 National Academies of Science Decadal Survey highlighted that observations of the planetary boundary layer (PBL) from the current space-based observing system are not of the necessary accuracy or resolution for monitoring and predicting high-impact weather phenomena. One possible solution to improving observations of the PBL is supplementing the existing space-based observing system with a network of ground-based profilers. A synthetic information content study is developed utilizing profiles from the Atmospheric Radiation Measurement (ARM) program sites at the Southern Great Plains (SGP), east North Atlantic (ENA), and North Slope of Alaska (NSA) to assess the benefits, in terms of degrees of freedom (DOF), vertical resolution, and uncertainties, of a synergy between the ground-based Atmospheric Emitted Radiance Interferometer (AERI) with space-based hyperspectral infrared (IR) sounders. A combination of AERI with any of the three polar-orbiting IR sounders: the Atmospheric Infrared Sounder (AIRS), the Cross-track Infrared Sounder (CrIS), or the Infrared Atmospheric Sounding Interferometer (IASI), results in a DOF increase of 30%–40% in the surface-to-700-hPa layer compared to the space-based instrument alone. Introducing AERI measurements to the observing system also results in significant improvements to vertical resolution and uncertainties in the bottom 1000 m of the atmosphere compared to CrIS measurements alone. A synergy of CrIS and AERI exceeds the 1-km-vertical-resolution goal set by the Decadal Survey in the lowest 1000 m.

54 ENVIRONMENTAL SCIENCES↗

A Subsonic Aircraft Design Optimization With Neural Network and Regression Approximators

The Flight-Optimization-System (FLOPS) code encountered difficulty in analyzing a subsonic aircraft. The limitation made the design optimization problematic. The deficiencies have been alleviated through use of neural network and regression approximations. The insight gained from using the approximators is discussed in this paper. The FLOPS code is reviewed. Analysis models are developed and validated for each approximator. The regression method appears to hug the data points, while the neural network approximation follows a mean path. For an analysis cycle, the approximate model required milliseconds of central processing unit (CPU) time versus seconds by the FLOPS code. Performance of the approximators was satisfactory for aircraft analysis. A design optimization capability has been created by coupling the derived analyzers to the optimization test bed CometBoards. The approximators were efficient reanalysis tools in the aircraft design optimization. Instability encountered in the FLOPS analyzer was eliminated. The convergence characteristics were improved for the design optimization. The CPU time required to calculate the optimum solution, measured in hours with the FLOPS code was reduced to minutes with the neural network approximation and to seconds with the regression method. Generation of the approximators required the manipulation of a very large quantity of data. Design sensitivity with respect to the bounds of aircraft constraints is easily generated.

Patnaik, Surya N.↗

Uncertainty-Informed Operation Coordination in a Water-Energy Nexus

The widespread deployment of smart heterogeneous technologies and the growing complexity in our modern society calls for effective coordination of the interdependent lifeline networks. In particular, operation coordination of electric power and water infrastructures is urgently needed as the water system is one of the most energy-intensive networks, an interruption in which may quickly evolve into a dramatic societal concern. This paper develops a novel analytic for uncertainty-aware day-ahead operation optimization of the interconnected power and water systems (PaWS). Joint probabilistic constraint (JPC) programming is employed to capture the uncertainties in wind resources and water demand forecasts. The proposed integrated stochastic model is presented as a non-linear non-convex optimization problem, where the non-linear hydraulic constraints in the water network are linearized using piece-wise linearization technique, and the non-convexity is efficiently tackled with a solution methodology to convert the proposed model with JPCs to a tractable mixed-integer linear programming (MILP) formulation that can be quickly solved to optimality. Here, the suggested framework is applied to a 15-node commercial-scale water network jointly operated with a power transmission system using a modified IEEE 57-bus test system. The numerical results demonstrate the of the proposed stochastic framework, resulting in cost reduction (13% on average when compared to the traditional setting) and energy saving of the integrated model under different realizations of uncertain renewable energy sources (RESs) and water demand scenarios. Additionally, the scalability of the proposed model is tested on a modified IEEE 118-bus test system connected to five water networks.

24 POWER TRANSMISSION AND DISTRIBUTION↗

TNet: A Model-Constrained Tikhonov Network Approach for Inverse Problems

Deep learning (DL), in particular deep neural networks, by default is purely data-driven and in general does not require physics. This is the strength of DL but also one of its key limitations when applied to science and engineering problems in which underlying physical properties—such as stability, conservation, and positivity—and accuracy are required. DL methods in their original forms are often not capable of respecting the underlying mathematical models or achieving desired accuracy even in big-data regimes. On the other hand, many data-driven science and engineering problems, such as inverse problems, typically have limited experimental or observational data, and DL would overfit the data in this case. Leveraging information encoded in the underlying mathematical models, we argue, not only compensates for missing information in low data regimes but also provides opportunities to equip DL methods with the underlying physics, hence promoting better generalization. This paper develops a model-constrained DL approach and its variant TNet—a Tikhonov neural network—which are capable of learning not only information hidden in the training data but also in the underlying mathematical models to solve inverse problems governed by partial differential equations in low data regimes. We provide the constructions and some theoretical results for the proposed approaches for both linear and nonlinear inverse problems. Since TNet is designed to learn inverse solutions with Tikhonov regularization, it is interpretable: in fact it recovers Tikhonov solutions for linear cases while potentially approximating Tikhonov solutions for nonlinear inverse problems. We also prove that data randomization can enhance not only the smoothness of the networks but also their generalizations. Comprehensive numerical results confirm the theoretical findings and show that with even as little as 1 training data sample for one-dimensional (1D) deconvolution, 5 for an inverse 2D heat conductivity problem, 100 for inverse initial conditions for a time-dependent 2D Burgers’s equation, and 50 for inverse initial conditions for 2D Navier–Stokes equations, TNet solutions can be as accurate as Tikhonov solutions while being several orders of magnitude faster. Furthermore, this is possible owing to the model-constrained term, replications, and randomization.

97 MATHEMATICS AND COMPUTING↗

Intercomparison of 3D pore-scale flow and solute transport simulation methods

Multiple numerical approaches have been developed to simulate porous media fluid flow and solute transport at the pore scale. These include methods that 1) explicitly model the three-dimensional geometry of pore spaces and 2) those that conceptualize the pore space as a topologically consistent set of stylized pore bodies and pore throats. In previous work we validated a model of class 1, based on direct numerical simulation using computational fluid dynamics (CFD) codes, against magnetic resonance velocimetry (MRV) measurements of pore-scale velocities. Here we expand that validation to include additional models of class 1 based on the immersed-boundary method (IMB), lattice Boltzmann method (LBM), smoothed particle hydrodynamics (SPH), as well as a model of class 2 (a pore-network model or PNM). The PNM approach used in the current study was recently improved and demonstrated to accurately simulate solute transport in a two-dimensional experiment. While the PNM approach is computationally much less demanding than direct numerical simulation methods, the effect of conceptualizing complex three-dimensional pore geometries on solute transport in the manner of PNMs has not been fully determined. We apply all four approaches (CFD, LBM, SPH and PNM) to simulate pore-scale velocity distributions and nonreactive solute transport, and intercompare the model results with previously reported experimental observations. Experimental observations are limited to measured pore-scale velocities, so solute transport comparisons are made only among the various models. Comparisons are drawn both in terms of macroscopic variables (e.g., permeability, solute breakthrough curves) and microscopic variables (e.g., local velocities and concentrations).

computational fluid dynamics↗

DyG-DPCD: A Distributed Parallel Community Detection Algorithm for Large-Scale Dynamic Graphs

Dynamic (Temporal) graphs capture the valuable evolution of real-world systems, from the continuously evolving patterns of social interactions and genetic pathways to the dynamic fluctuations of economic forces. Detecting communities for such evolving networks poses unique challenges. Detecting and analyzing the evolution of communities within dynamic graphs unlocks valuable insights into the underlying structural and temporal patterns of real-world systems. However, the sheer volume of modern graph data and the inherent complexity of the temporal dimension pose significant challenges to scalable community detection algorithms. Addressing this gap, our work explores the limited landscape of scalable distributed-memory parallel methods specifically designed for dynamic network community detection. We propose a novel parallel algorithm, DyG-DPCD (Dynamic Graph Distributed Parallel Community Detection), to detect communities in dynamic networks using the Message Passing Interface (MPI) framework. We present a vertex-centric approach, allowing us to detect communities through local optimization. Furthermore, we enhance our baseline algorithm by incorporating three heuristics, which improve the algorithm’s performance significantly while maintaining the quality of the solutions. We demonstrate the efficiency of our algorithm by experimenting on several real-world large-scale networks with hundreds of millions of edges spanning diverse domains. Notably, DyG-DPCD achieves speedups between 25× and 30× for large networks that we experimented on using NERSC compute nodes. In conclusion, our algorithm outperforms the STINGER parallel re-agglomeration algorithm by 30×.

97 MATHEMATICS AND COMPUTING↗

Co-templating of polyoxoniobates and silicate/germanate trimer-rings in crystals and inorganic gels

Polyoxometalate (POM) supramolecular gels are a growing family of materials, both for understanding fundamental self-assembly and fabricating flexible monolithic materials that retain the function of metal oxides. Here, we exploited the pH-dependent speciation of polyoxoniobates (PONbs), targeting the formation of PONb-containing supramolecular gels that contain other low molecular weight components (silicate, germanate, phosphate, and carbonate). The introduction of gaseous CO 2 into aqueous hexaniobate solutions resulted in the formation of both new crystalline phases and highly transparent gels. The crystalline phases, formulated Cs 24 [Nb 7 O 22 (NbO(CO 3 ) 2 ) 9 (Si 3 O 9 )]·19.6H 2 O and Cs 21 Na 3 [Nb 7 O 22 (NbO(CO 3 ) 2 ) 9 (Ge 3 O 9 )]·33.6H 2 O are templated by a rare planar [X 3 O 9 ] 6− (X = Si, Ge) ring. Crystalline phases were not obtained with phosphate; instead, the gels contain a mixture of phosphate-centred PONbs and network-forming phosphate. POM speciation within the gels, physical properties, and assembly mechanisms were benchmarked by solution and solid-state nuclear magnetic resonance (NMR) spectroscopy, vibrational spectroscopies, small-angle X-ray scattering (SAXS), and thermogravimetry-mass spectroscopy. Optical analysis and dielectric behavior of the gels confirmed that they are highly transparent ionic and electronic conductors. The alkali and hydroxide concentration controls the formation of crystalline materials or supramolecular gels while maintaining the same network building blocks, providing a rare opportunity to describe the molecular-level structure of inorganic amorphous materials.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Constellation: The autonomous control and data acquisition system for dynamic experimental setups

The operation of instruments and detectors in laboratory or beamline environments presents a complex challenge, requiring stable operation of multiple concurrent devices, often controlled by separate hardware and software solutions. These environments frequently undergo modifications, such as the inclusion of different auxiliary devices depending on the experiment or facility, adding further complexity. The successful management of such dynamic configurations demands a flexible and robust system capable of controlling data acquisition, monitoring experimental setups, enabling seamless reconfiguration, and integrating new devices with limited effort. This paper presents Constellation, a flexible and network-distributed control and data acquisition software framework tailored to laboratory and beamline environments, that addresses the limitations of existing solutions. The framework is designed with a focus on extensibility, providing a streamlined interface for instrument integration. It supports efficient system setup via network discovery mechanisms, promotes stability through autonomous operational features, and provides comprehensive documentation and supporting tools for operators and application developers such as controllers and logging interfaces. At the core of the architectural design is the autonomy of the individual components, called satellites, which can make independent decisions about their operation and communicate these decisions to other components. This paper introduces the design principles and framework architecture of Constellation, presents the available graphical user interfaces, shares insights from initial successful deployments, and provides an outlook on future developments and applications.

Autonomy↗