Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “network design”

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 73 records · Page 4

Continuous automatic polarization channel stabilization from heterodyne detection of coexisting dim reference signals

Quantum networking continues to encode information in polarization states due to ease and precision. The variable environmental polarization transformations induced by deployed fiber need correction for deployed quantum networking. Here, we present a method for automatic polarization compensation (APC) and demonstrate its performance on a metropolitan quantum network. Designing an APC involves many design decisions as indicated by the diversity of previous solutions in the literature. Our design leverages heterodyne detection of wavelength-multiplexed dim classical references for continuous high-bandwidth polarization measurements used by newly developed multi-axis (non-)linear control algorithm(s) for complete polarization channel stabilization with no downtime. This enables continuous relatively high-bandwidth correction without significant added noise from classical reference signals. We demonstrate the performance of our APC using a variety of classical and quantum characterizations. Finally, we use C-band and L-band APC versions to demonstrate continuous high-fidelity entanglement distribution on a metropolitan quantum network with an average relative fidelity of 0.94 ± 0.03 for over 30 hrs.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Identification of Dynamic Force Coefficients for an Additively Manufactured Hermetic Squeeze Film Bearing Support Damper Utilizing a Pass-Through Channel

Abstract The following paper presents breakthrough experimental results for a new hermetic squeeze film damper (HSFD) concept that is integrally designed within an externally pressurized tilting-pad radial gas bearing support. The flexibly damped gas bearing module was designed for a 7.2″ (183 mm) diameter shaft and fabricated using direct metal laser melting (DMLM); also known as additive manufacturing. The bearing and HSFD were sized based on ongoing studies for oil-free supercritical carbon dioxide (sCO2) power turbines in the 8.5 MW–10 MW power range. The development of the new damper concept was motivated by past dynamic testing on HSFD, which generated frequency-dependent stiffness and damping force coefficients. In efforts to eliminate the frequency dependency, a new HSFD architecture was conceived that adds accumulator volumes and a pass-through channel to previously conceived HSFD flow network designs. The other motivation for the work is the need to develop a cost-effective and reliable oil-free bearing technology that is scalable to large power turbomachinery applications. There were several objectives for the following work. The first objective was to successfully design and fabricate a single piece bearing-damper using additive manufacturing, while dimensionally controlling critical design features. The paper discusses the manufacturing steps and shows cut-ups that reveal adequate clearance control capability with internal damper clearances. The second objective was to perform experimental testing with the new HSFD design in efforts to extract stiffness and damping coefficients for excitation frequencies within 20–160 Hz and peak vibration amplitudes between 0.25 mils (6.35 microns) to 1 mil (25.4 microns). The test results for a single HSFD bearing module indicated that the design modifications to the HSFD architecture were successful in eliminating nearly all the frequency dependencies for the stiffness force coefficient. The dynamic tests yielded a stiffness coefficient that varied between 112 klb/in. (19.6 MN/m) and 96 klb/in. (16.8 MN/m). The damping force coefficient however, exhibited relatively more variation with frequency with values residing between 175 lb-s/in. (31 kN-s/m) to 214 lb-s/in. (37 kN-s/m). Finally, the paper advances a three-dimensional fluid-structure interaction (FSI) model using transient finite element analysis (FEA) coupled to a computational fluid dynamics (CFD) model. The FSI analysis performed between 20 Hz and 80 Hz was used to predict the stiffness and damping of the HSFD using a quarter-section model of the damper. The FSI analysis was able to support test results by showing only a 6–7.4% change in the magnitude of force coefficients. Stiffness predictions agree reasonably well with experiments whereas damping is underpredicted.

Engineering↗

Extending quantum key distribution through proxy re-encryption

Modern quantum key distribution (QKD) network designs are based on sending photons from one node to another and require free-space or dedicated fiber optic cables between nodes. The purpose of this is to co-generate secret key material on both sides of the quantum channel. In addition to this quantum link, there are several insecure classical channels that allow QKD algorithms to exchange book-keeping information and send symmetrically encrypted data. The attenuation of photons transmitted through fiber becomes too high to practically generate key material over fiber at distances of more than 100 km. Free-space transmission through the atmosphere or the vacuum of space can reduce attenuation, but at the cost of system complexity and sensitivity to other impairments, such as weather. To extend the effective range of QKD networks, we present a method that combines QKD algorithms with post-quantum, homomorphic key-switching to allow multiple parties to effectively share secret key material over longer distances through semi-trusted relay nodes. We define how such a system should work for arbitrary network topologies and provide proofs that our scheme is both correct and secure. We assess the feasibility of this solution by building and evaluating two implementations based on lattice-based cryptography: learning with errors.

97 MATHEMATICS AND COMPUTING↗

Using Neural Networks to Identify Mixture Components in Hyperspectral Reflectance Data

Neural networks have been employed to identify materials of interest from hyperspectral data (generally imagery) based on their unique spectral signatures. This approach assumes that there is a single material that is standing out from the rest of the spectrum to be identified. However, pixels often contain more than one material, or a material of interest may itself be a mixture of multiple materials. Neural networks are only as good as the data used to train them, and it takes a great deal of work in the laboratory to identify, make, and measure all potential mixtures of interest. Thus, researchers often calculate synthetic spectra using algorithms with varying degrees of fidelity to the physics that govern the interactions between light and multiple materials. In this work, we have (1) adapted a neural network designed to identify mixture components from Raman spectroscopy to work with visible to near‐infrared reflectance data and (2) tested three common mixture algorithms to determine the most accurate and least computationally expensive method to build synthetic training datasets. With our initial test dataset, we have achieved accuracies of > 90% and found that the synthetic training dataset produced using the Hapke mixture model provides the best results.

99 GENERAL AND MISCELLANEOUS↗

Optimizing lane reversals in transportation networks to reduce traffic congestion: A global optimization approach

This paper studies how to reduce the overall travel time of commuters in a transportation network by reversing the direction of some lanes in the network using a macroscopic network-wide perspective. Similar to the Network Design Problem, the lane reversal problem has been shown to be NP-hard given the dependence of the users’ route selection on the lane direction decision. Herein, we propose and compare three efficient methods to solve the routing and lane reversal problem jointly. First, we introduce an alternating method that decouples the routing and lane assignment problems. Second, we propose a Frank–Wolfe method that jointly takes gradient steps to adjust both the lane assignment and routing decisions. Third, we propose a convex approximation method that uses a threshold-based approach to convexify the joint routing and lane reversal objective. The convex approximation method is advantageous since it finds a global optimum solution for the approximated problem and it enables the possibility to include linear constraints. Using this method, we extend the main formulation to be able to limit a maximum number of reversed lanes, as well as to incorporate multiple origin–destination (OD) patterns. We test the proposed methods in a case study using the transportation network of Eastern Massachusetts where our results indicate an overall reduction in travel times of 4.7% by selecting the best 15 reversals. Moreover, using a small test network, we investigate the performance of the lane reversal strategies as a function of the OD demand symmetry. As expected, we observe that when the OD demand is very asymmetric (e.g., for a single OD pair, evacuations, large events), the reduction in travel times is larger than the symmetric case, reaching travel time reductions of 60%.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

From PINNs to PIKANs: recent advances in physics-informed machine learning

Physics-Informed Neural Networks (PINNs) have emerged as a key tool in Scientific Machine Learning since their introduction in 2017, enabling the efficient solution of ordinary and partial differential equations using sparse measurements. Over the past few years, significant advancements have been made in the training and optimization of PINNs, covering aspects such as network architectures, adaptive refinement, domain decomposition, and the use of adaptive weights and activation functions. A notable recent development is the Physics-Informed Kolmogorov-Arnold Networks (PIKANS), which leverage a representation model originally proposed by Kolmogorov in 1957, offering a promising alternative to traditional PINNs. In this review, we provide a comprehensive overview of the latest advancements in PINNs, focusing on improvements in network design, feature expansion, optimization techniques, uncertainty quantification, and theoretical insights. We also survey key applications across a range of fields, including biomedicine, fluid and solid mechanics, geophysics, dynamical systems, heat transfer, chemical engineering, and beyond. Lastly, we review computational frameworks and software tools developed by both academia and industry to support PINN research and applications.

Kolmogorov-Arnold networks↗

Regularizing Invertible Neural Networks for Airfoil Design Through Dimension Reduction

This work examines how dimension reduction can improve the performance of invertible neural networks (INN) for airfoil design. Design workflows are typically expensive, relying on many evaluations of high fidelity computational fluid dynamics (CFD) models. Furthermore, the inverse design problem is typically ill-posed. That is, multiple valid solutions exist that satisfy the design criteria. Regularization can reduce this inverse design space and simplify the problem. We study the use of subspace-based input dimension reduction to act as a regularizer for the INN model and improve the recovery of new airfoil shapes with desired performance characteristics. We find that the dimension reduction identifies two dominant modes, relating to airfoil thickness and camber, that optimally determine the airfoil's aerodynamics. We demonstrate the capability of the proposed INN model to generate 100 airfoils that satisfy the specific aerodynamic and structural characteristics.

airfoil design↗

Baseflow Identification via Explainable AI With Kolmogorov‐Arnold Networks

Abstract Hydrological models often involve constitutive laws that may not be optimal in every application. We propose to replace such laws with the Kolmogorov‐Arnold networks (KANs), a class of neural networks designed to identify symbolic expressions. We demonstrate KAN's potential on the problem of baseflow identification, a notoriously challenging task plagued by significant uncertainty. KAN‐derived functional dependencies of the baseflow components on the aridity index outperform their original counterparts; they demonstrate that water availability, rather than potential evapotranspiration, drives baseflow by constraining actual evapotranspiration under arid conditions. On a test set, they increase the Nash‐Sutcliffe efficiency (NSE) by 65%, decrease the root mean squared error by 29%, and increase the Kling‐Gupta efficiency by 34%. This superior performance is achieved while reducing the number of fitting parameters from three to two. Next, we use data from 378 catchments across the continental United States to refine the water‐balance equation at the mean‐annual scale. The KAN‐derived equations based on the refined water balance outperform both the current aridity index model, with up to a 105% increase in NSE, and the KAN‐derived equations based on the original water balance. While the performance of our model and tree‐based machine learning methods is similar, KANs offer the advantage of simplicity and transparency and require no specific software or computational tools. This case study focuses on the aridity index formulation, but the approach is flexible and transferable to other hydrological processes. Plain Language Summary Equations used in hydrologic model are often suboptimal, resulting in reduced prediction accuracy and efficiency. We implemented Kolmogorov‐Arnold networks (KAN), a machine learning algorithm for deriving symbolic formulations, to estimate groundwater recharge and showed that it outperforms an existing state‐of‐the‐art semi‐empirical formulation. In hydrology, Nash‐Sutcliffe efficiency (NSE), root mean squared error (RMSE), and Kling‐Gupta efficiency (KGE) are commonly used to evaluate model performance. Higher NSE and KGE values indicate better performance, while lower RMSE values are preferable. Our results show that NSE increased by 71%, RMSE decreased by 32%, and KGE improved by 25%. In addition, KAN identifies an optimal functional form and can be used to derive new analytical formulas using the prior knowledge. The KAN‐inspired equation outperformed the original formulation and reduced the fitting parameters. Furthermore, we refined the water‐balance equation at the mean‐annual scale and showed that, based on the new water‐balance equation, KAN can derive new formulations that are superior to the original aridity index formulations (up to 105% increase in NSE) and KAN‐derived equations based on the original water balance. These findings highlight the significant potential of KAN to advance the scientific understanding of a wide range of hydrologic processes. Key Points Kolmogorov‐Arnold networks (KANs) enhance interpretability of machine‐learned hydrological models KAN‐derived symbolic formulations outperform state‐of‐the‐art semi‐empirical aridity indices KAN‐identified functional form yields an analytical index with fewer fitting parameters and improved performance

baseflow↗

Modular supply chain optimization considering demand uncertainty to manage risk

Supply chain under demand uncertainty has been a challenging problem due to increased competition and market volatility in modern markets. Flexibility in planning decisions makes modular manufacturing a promising way to address this problem. We report the problem of multiperiod process and supply chain network design is considered under demand uncertainty. A mixed integer two-stage stochastic programming problem is formulated with integer variables indicating the process design and continuous variables to represent the material flow in the supply chain. The problem is solved using a rolling horizon approach. Benders decomposition is used to reduce the computational complexity of the optimization problem. To promote risk-averse decisions, a downside risk measure is incorporated in the model. The results demonstrate the several advantages of modular designs in meeting product demands. A pareto-optimal curve for minimizing the objectives of expected cost and downside risk is obtained.

42 ENGINEERING↗

Pyomo.GDP: an ecosystem for logic based modeling and optimization development

We present three core principles for engineering-oriented integrated modeling and optimization tool sets—intuitive modeling contexts, systematic computer-aided reformulations, and flexible solution strategies—and describe how new developments in Pyomo.GDP for Generalized Disjunctive Programming (GDP) advance this vision. We describe a new logical expression system implementation for Pyomo.GDP allowing for a more intuitive description of logical propositions. The logical expression system supports automated reformulation of these logical constraints to linear constraints. We also describe two new logic-based global optimization solver implementations built on Pyomo.GDP that exploit logical structure to avoid “zero-flow” numerical difficulties that arise in nonlinear network design problems when nodes or streams disappear. These new solvers also demonstrate the capability to link to external libraries for expanded functionality within an integrated implementation. We present these new solvers in the context of a flexible array of solution paths available to GDP models. Finally, we present results on a new library of GDP models demonstrating the value of multiple solution approaches.

42 ENGINEERING↗

STSR-INR: Spatiotemporal super-resolution for multivariate time-varying volumetric data via implicit neural representation

Implicit neural representation (INR) has surfaced as a promising direction for solving different scientific visualization tasks due to its continuous representation and flexible input and output settings. We present STSR-INR, an INR solution for generating simultaneous spatiotemporal super-resolution for multivariate time-varying volumetric data. Inheriting the benefits of the INR-based approach, STSR-INR supports unsupervised learning and permits data upscaling with arbitrary spatial and temporal scale factors. Unlike existing GAN- or INR-based super-resolution methods, STSR-INR focuses on tackling variables or ensembles and enabling joint training across datasets of various spatiotemporal resolutions. Here we achieve this capability via a variable embedding scheme that learns latent vectors for different variables. In conjunction with a modulated structure in the network design, we employ a variational auto-decoder to optimize the learnable latent vectors to enable latent-space interpolation. To combat the slow training of INR, we leverage a multi-head strategy to improve training and inference speed with significant speedup. We demonstrate the effectiveness of STSR-INR with multiple scalar field datasets and compare it with conventional tricubic+linear interpolation and state-of-the-art deep-learning-based solutions (STNet and CoordNet).

97 MATHEMATICS AND COMPUTING↗

Integrating risk assessment methods for carbon storage: A case study for the quest carbon capture and storage facility

This paper documents how tools developed by the National Risk Assessment Partnership (NRAP) complement the Bowtie risk assessment approach through the demonstration of a risk-based Area of Review (AoR) determination for the Quest Carbon Capture and Storage (CCS) facility near Edmonton, Alberta with the NRAP Open-Source Integrated Assessment Model (NRAP Open-IAM). The Bowtie risk assessment for the Quest CCS site was developed by Shell Canada Ltd., who operates the asset on behalf of the Athabasca Oil Sand Project — a joint venture, owned by Canadian Natural Resources Ltd, Chevron Canada and Shell Canada Ltd. The Quest Bowtie treats site risk comprehensively – considering a large set of technical and project risks (e.g., operational risks, above ground infrastructure, public perception, etc.). NRAP tools, methods, and analyses are focused on quantitative assessment of subsurface technical risks. NRAP-Open-IAM was used to evaluate potential groundwater impacts at the Quest site, i.e., a sufficient change above background groundwater quality levels to be measurable, should CO 2 and/or brine leak from the reservoir via a faulty and/or compromised wellbore. Our results show there is a low potential for groundwater impact and support a further reduction (from ~460 to 100 km 2 ) to the established AoR for the Quest site. Integrating both approaches early in the site characterization period could significantly benefit commercial-scale projects by drastically reducing the region over which leakage risks (e.g., legacy wells) need to be evaluated, i.e., the AoR. This is especially true for brownfield sites, which could contain hundreds to thousands of legacy wells. Further, basing monitoring network design on those regions where impacts are most likely to occur has the potential to facilitate more efficient deployment of monitoring technologies and improve the likelihood of detecting a leak should one occur.

58 GEOSCIENCES↗

A survey of techniques for optimizing transformer inference

Recent years have seen a phenomenal rise in the performance and applications of transformer neural networks. The family of transformer networks, including Bidirectional Encoder Representations from Transformer (BERT), Generative Pretrained Transformer (GPT) and Vision Transformer (ViT), have shown their effectiveness across Natural Language Processing (NLP) and Computer Vision (CV) domains. Transformer-based networks such as ChatGPT have impacted the lives of common men. However, the quest for high predictive performance has led to an exponential increase in transformers' memory and compute footprint. Researchers have proposed techniques to optimize transformer inference at all levels of abstraction. Further, this paper presents a comprehensive survey of techniques for optimizing the inference phase of transformer networks. We survey techniques such as knowledge distillation, pruning, quantization, neural architecture search and lightweight network design at the algorithmic level. We further review hardware-level optimization techniques and the design of novel hardware accelerators for transformers. We summarize the quantitative results on the number of parameters/FLOPs and the accuracy of several models/techniques to showcase the tradeoff exercised by them. We also outline future directions in this rapidly evolving field of research. We believe that this survey will educate both novice and seasoned researchers and also spark a plethora of research efforts in this field.

97 MATHEMATICS AND COMPUTING↗

Cross-Linker Selection Controls Glass Transition Elevation or Reduction in Dynamic Covalently Bonded Polymer Networks

Introducing cross-links is a powerful approach to improve polymeric material performance relevant to controlling viscoelasticity, thermal and creep resistance, degradability, and efficient membrane separations. The chemically specific glass transition temperature T g is of fundamental importance in determining the time scales of key dynamical processes and physical state of the material in such applications. Here, we study experimentally how the introduction of relatively large cross-linking molecules in slowly exchanging dynamic bond-forming polymers (vitrimers) impacts vitrification for diverse polymer chemistries and a wide range of cross-link fractions. We find T g can increase, decrease, or even remain essentially unchanged, in qualitative contrast to the generic elevation of T g in traditional permanent polymer networks. We formulate an effective terpolymer network model to understand this rich behavior, which emerges as a consequence of a competition between pure cross-linking and generalized plasticization effects. The latter is associated with the tunable cross-linker size and intrinsic dynamic mobility that can offset slowing down due to traditional permanent cross-linking constraints. Here, a new strategy for functional polymer network design is suggested based on adjusting the relative importance of the two competing physical effects, which potentially can significantly enhance energy savings in applications while retaining other intrinsic properties germane to advanced materials performance.

Copolymers↗

DONUT: physics-aware machine learning for real-time X-ray nanodiffraction analysis

Coherent X-ray scattering techniques are critical for investigating the fundamental structural properties of materials at the nanoscale. While advancements have made these experiments more accessible, real-time analysis remains a significant bottleneck, often hindered by artifacts and computational demands. In scanning X-ray nanodiffraction microscopy, which is widely used to spatially resolve structural heterogeneities, this challenge is compounded by the convolution of the divergent beam with the sample’s local structure. To address this, we introduce DONUT (Diffraction with Optics for Nanobeam by Unsupervised Training), a physics-aware neural network designed for the rapid and automated analysis of nanobeam diffraction data. By incorporating a differentiable geometric diffraction model directly into its architecture, DONUT learns to predict crystal lattice strain and orientation in real-time. Crucially, this is achieved without reliance on labeled datasets or pre-training, overcoming a fundamental limitation for supervised machine learning in X-ray science. We demonstrate experimentally that DONUT accurately extracts all features within the data over 200 times more efficiently than conventional fitting methods.

Materials science↗

Prediction of vacancy defect diffusion paths in high entropy alloys via machine learning on molecular dynamics data

Identifying the diffusion path of point defects is a critical step in understanding their evolution and the mechanisms of related phenomena. Defect diffusion occurs at small length and time scales, with impacts on material properties that may continue to evolve over ns to μs, ms, and the continuum scale (s, min, etc., and cm, m, etc.). The time scale accessible to molecular dynamics (MD) simulations is limited by small step sizes, typically in the fs range. Thus, surrogate models of MD simulations through machine learning (ML)-based algorithms are of great interest, especially for complex systems such as high entropy alloys (HEAs). In this work, dynamics governing vacancy migration in HEA were approximated with graph convolutional network (GCN) models as ansatzes for kinetic Monte Carlo (KMC) rate catalogs. Network design considered that diffusion in crystalline solids generally depends on interactions between defects and their immediate neighbor atoms. Graphs represented the vacancy surroundings, MD-generated trajectories provided training and comparison datasets, and unsupervised GCN models approximated interatomic dynamics governing vacancy migration in HEAs as ansatzes for KMC. A proof-of-concept model trained on MD data for the Fe, Ni, Cr, Co, and Cu HEA environment was used with two different neighbor interactions to assess the feasibility of training a GCN to predict vacancy defect transition rates in the HEA environment. The resulting setup rapidly generated MD-formatted synthetic trajectories based on dynamics learned from the MD training set, with a time acceleration of roughly two orders of magnitude and a similar diffusion coefficient to MD observations. Additionally, Nudged Elastic Band (NEB) calculations were performed on randomly generated FeNiCrCoCu HEA structures to determine vacancy migration barriers across nearest-neighbor sites. Transition probabilities for each jump, categorized by atomic type, were extracted from these calculations. NEB-based and GCN-based approaches led to similar outcomes.

Reimer, C↗

An Efficient Power Flexibility Aggregation Framework via Coordinate Transformation and Chebyshev Centering Optimization

The large-scale integration of distributed energy resources (DERs) converts the role of a distribution system from a customer to a prosumer. In this context, the controllable DERs are expected to provide capacity support for the transmission system, which can be considered as power flexibility aggregation. Specifically, it is a process of controlling the power output of DERs to fulfill the desired capacity or flexibility. However, the power output of DERs as control variables is redundant. That is, a power flexibility command can be realized by multiple dispatch alternatives, which may hinder efficient design of control rules and flexibility evaluation schemes. Therefore, this paper introduces a conception of the artificial power flexibility controller to avoid the redundancy issue, which is a converted control variable after reconstructing the DER power region. Through this reconstruction, the DERs can be indirectly controlled by the proposed artificial power flexibility controller. In addition, a Chebyshev centering optimization model is developed to approximate the power flexibility region. At last, the proposed method is verified on an artificially-designed network with multiple DERs.

Chebyshev centering optimization↗

Development of HELICS-Based High-Performance Cyber-Physical Co-Simulation Framework for Distributed Energy Resources Applications

The rapid growth of distributed energy resources (DERs) has prompted increasing interest in the monitoring and control of DERs through hybrid smart grid communications resulting in the typical smart grid cyber-physical system. To fully understand the interdependency between them, we propose to integrate the Network Simulator 3 (NS3) into the High Engine for Large-Scale Infrastructure Co-Simulation (HELICS), a new open-source, cyber-physical-energy co-simulation platform. This paper aims to the development and case study of the HELICS-based high performance distribution-communication co-simulation framework for the DER coordination. The novel co-simulation framework for the NS3 integrating into the HELICS is developed. The DER monitoring application about hybrid smart grid communication network design is simulated and validated on this proposed HELICS-based cyber-physical co-simulation platform.

41 EE - Solar Energy Technologies Office (EE-4S)↗