Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “space 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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Navigating high-dimensional process-structure–property relations in nanocrystalline Pt-Au alloys with machine learning

For decades, materials scientists have relied on the process-structure–property paradigm to guide investigations into material behaviors. Traditional studies often examine a limited number of process-structure–property variables, striving to elucidate mechanisms governing material response. However, this approach is time consuming and can limit exploration, as well as the discovery of process-structure–property relations in novel materials. In this paper, we combined combinatorial sputter deposition and multi-modal high-throughput materials characterization with feedforward neural networks to establish high-dimensional process-structure–property relations in Pt-Au alloys, yielding nanocrystalline alloys with high hardness and low resistivity relevant to electrical contact switch applications. We mapped three indicators of process conditions (composition and two atomic deposition characteristics) onto four indicators of material structure (X-ray diffraction, film thickness, density, and surface roughness) and two indicators of material properties (hardness and resistivity), resulting in 784 unique combinations evaluated over a 13-dimensional space. The neural networks predicted Pt-Au alloys with 18–24 at.% Au, when deposited at specific conditions, to have a nanoindentation hardness up to 7.2 GPa. This high hardness value, comparable to some steels, represents a 3-fold improvement in hardness over “hard gold”, a commonly used electrical contact alloy, while maintaining requisite electrical conductivity. The neural network models provide an avenue to identify expected process windows capable of maximizing material performance.

Electrical contact materials↗
DOE OSTI2025

Optical neural engine for solving scientific partial differential equations

Abstract Solving partial differential equations (PDEs) is the cornerstone of scientific research and development. Data-driven machine learning (ML) approaches are emerging to accelerate time-consuming and computation-intensive numerical simulations of PDEs. Although optical systems offer high-throughput and energy-efficient ML hardware, their demonstration for solving PDEs is limited. Here, we present an optical neural engine (ONE) architecture combining diffractive optical neural networks for Fourier space processing and optical crossbar structures for real space processing to solve time-dependent and time-independent PDEs in diverse disciplines, including Darcy flow equation, the magnetostatic Poisson’s equation in demagnetization, the Navier-Stokes equation in incompressible fluid, Maxwell’s equations in nanophotonic metasurfaces, and coupled PDEs in a multiphysics system. We numerically and experimentally demonstrate the capability of the ONE architecture, which not only leverages the advantages of high-performance dual-space processing for outperforming traditional PDE solvers and being comparable with state-of-the-art ML models but also can be implemented using optical computing hardware with unique features of low-energy and highly parallel constant-time processing irrespective of model scales and real-time reconfigurability for tackling multiple tasks with the same architecture. The demonstrated architecture offers a versatile and powerful platform for large-scale scientific and engineering computations.

Tang, Yingheng (ORCID:0009000153622546)↗
DOE OSTI2024

QSpace - An open-source tensor library for Abelian and non-Abelian symmetries

This is the documentation for the tensor library QSpace (v4.0), a toolbox to exploit ‘quan tum symmetry spaces’ in tensor network states in the quantum many-body context. QSpace permits arbitrary combinations of symmetries including the abelian symmetries $\mathbb{Z}_n$ and U(1), as well as all non-abelian symmetries based on the semisimple classical Lie algebras: A n , B n , C n , and D n , or respectively, the special unitary group SU(n), the odd orthogonal group SO(2n+1), the symplectic group Sp(2n), and the even orthogonal group SO(2n). The code (C++ embedded via the MEX interface into Matlab) is available open source as of QSpace v4.0 on bitbucket under the Apache 2.0 license. QSpace is designed as a bottom-up approach for non-abelian symmetries. It starts from the defining representation and the respective Lie algebra. By explicitly comput ing and tabulating generalized Clebsch-Gordan coefficient tensors, QSpace is versatile in the type of operations that it can perform across all symmetries. At the level of an ap plication, much of the symmetry-related details are hidden within the QSpace C++ core libraries. Hence when developing tensor network algorithms with QSpace, these can be coded (nearly) as if there are no symmetries at all, despite being able to fully exploit general non-abelian symmetries.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
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 OSTI2024

Connected Traffic Signal Coordination Optimization Framework through Network-Wide Adaptive Linear Quadratic Regulator–Based Control Strategy

Traffic congestion in metropolitan areas causes several significant challenges, such as longer travel times, decreased productivity, increased fuel consumption and vehicle emissions, and even severe injuries during crashes. Traffic signal control is a management approach to reduce traffic congestion and allocate the appropriate right of way for safety and mobility efficiency, both in temporal and spatial domains. Here, this study proposes a network-wide adaptive signal control coordination optimization framework based on the linear quadratic regulator algorithm. The traffic flow conditions driven by signal control inputs are formulated based on their network-wide state-space representation. After modeling traffic control regulation constraints, an adaptive linear quadratic regulator algorithm is designed to maximize the network-wide total throughput under the current conditions. Optimal signal control split time durations for multiple intersections in the network are derived by solving the algebraic Riccati equation. Furthermore, the recursive least square parameter estimation method is employed to quantify dynamic traffic condition changes. To verify the effectiveness of this proposed signal control framework, both simulation and real-world experimental tests are conducted for multiple intersections in downtown Chattanooga, Tennessee, United States. In preparation for real-world experimental tests, pipelines for real-time data processing implementation and historical traffic flow data analysis are conducted. The test results demonstrate that the proposed control framework achieves a decrease in travel time by up to 19.4%, total time spent (TTS) by up to 11.9%, and relative queue balance (RQB) by up to 15.6%. The research findings indicate that the proposed signal control framework can be generalized to handle large scale signal control optimization network-wide.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Watersheds and stream networks viewed longitudinally: Example insights from novel spatial portrayals of watershed characteristics

Abstract Longitudinal depictions of watershed structure and characteristics, including topography, stream networks, wetlands, ground water levels, and land use, can provide watershed knowledge and understanding unavailable from standard plan view maps. Three case studies provide examples of knowledge gained by applying longitudinal views of stream networks, watershed hydrologic behavior, and land use distributions. Longitudinal views of mountain stream networks show extreme variability in the slope‐area relationships of low Strahler order streams, large discontinuities in drainage area (large parts of drainage area space are absent in networks), and large variations in network curvature. Longitudinal views of a groundwater‐dominated headwater watershed increase the inference available from limited groundwater observations and clearly reveal how groundwater connections affect the permanence of surface water features and the distribution of vadose zone storage in the landscape. Plotting land uses longitudinally illuminates and allows a quantitative analysis of how land uses are distributed relative to topographic position. Viewing watersheds and stream networks longitudinally can provide new insights into watershed forms and processes and motivate new questions and research.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2024

Venturing into Unexplored Phase Space: Synthesis, Structure, and Properties of MgCo 3 B 2 Featuring a Rumpled Kagomé Network

MgCo 3 B 2 , a novel ternary boride in a previously unexplored phase space, was synthesized using the hydride route. In situ powder X-ray diffraction and DFT calculations aided in the discovery of this compound, whose structure was then determined by single-crystal X-ray diffraction. Like the closely related CeCo 3 B 2 , MgCo 3 B 2 crystallizes in centrosymmetric space group P6/mmm (a = 4.883(2) Å, c = 2.926(2) Å at 210 K, Z = 1). Unlike CeCo 3 B 2 , however, it adopts a disordered structure that features a rumpled Kagomé network of Co atoms, and Mg atoms fill the channels of a Co–B framework. Although the structural disorder leads to motifs that are similar to those observed in MgNi 3 B 2 and other related ternary borides, no evidence of an ordered superstructure was found by single-crystal X-ray diffraction or high-resolution powder X-ray diffraction. In the case of CeCo 3 B 2 , boron atoms occupy the center of regular Co 6 trigonal prisms; in MgCo 3 B 2 , boron atoms are shifted from the center of the prism to form B–B dimers with roughly the same length as those found in MgNi 3 B 2 . Magnetic susceptibility data exhibit an unusual temperature dependence that cannot be convincingly modeled by the modified Curie–Weiss equation, consistent with DFT calculations predicting a nonmagnetic ground state. Intrinsic susceptibility at 300 K is 1.42 × 10 –3 emu/mol Oe, which is comparable to that of paramagnetic YCo 3 B 2 and CeCo 3 B 2 with a similar structure and composition. Here, this study showcases the efficacy of combining several methodologies to discover new solids in unexplored phase spaces. This approach includes in situ PXRD data to monitor reactions of precursors upon heating, a diffusion-enhanced synthesis method, and DFT assessment of compound stability.

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

A Comparative Study of Deep Learning Models for Fracture and Pore Space Segmentation in Synthetic Fractured Digital Rocks

This study focuses on the comparative study of deep learning (DL) models for pore space and discrete fracture networks (DFNs) segmentation in synthetic fractured digital rocks, specifically targeting low-permeability rock formations, such as shale and tight sandstones. Accurate characterization of pore space and DFNs is critical for subsequent property analysis and fluid flow modeling. Four DL models, SegNet, U-Net, U-Net-wide, and nested U-Net (i.e., U-Net++), were trained, validated, and tested using synthetic datasets, including input and label image pairs with varying properties. The model performance was assessed regarding pixel-wise metrics, including the F1 score and pixel-wise difference maps. In addition, the physics-based metrics were considered for further analysis, including sample porosity and absolute permeability. Particularly, We first simulated the permeability of porous media containing only pore space and then simulated the permeability of porous media with DFNs added. The difference between these two values is used to quantify the connectivity of segmented DFNs, which is an important parameter for low-permeability rocks. The pixel-wise metrics showed that the nested U-Net model outperformed the rest of the DL models in pore space and DFNs segmentation, with the SegNet model exhibiting the second-best performance. Particularly, nested U-Net enhanced segmentation accuracy for challenging boundary pixels affected by partial volume effects. The U-Net-wide model achieved improved accuracy compared to the U-Net model, which indicated the influence of parameter numbers. Similarly, nested U-Net has the closest match to the ground truth of physics-based metrics, including the porosity of pore space and DFNs, and the permeability difference quantifying the connectivity of DFNs. The findings highlight the effectiveness of DL models, especially the U-Net++ model with nested architecture and redesigned skip connections, in accurately segmenting pore spaces and DFNs, which are crucial for pore-scale fluid flow and transport simulation in low-permeability rocks.

Wang, Hongsheng↗
DOE OSTI2021

Critical values of cyber parameters in a dynamic microgrid system

An islanded microgrid can be used to serve critcal load as a resiliency source when a severe outage occurs. In an islanded mode, control of a microgrid relies on the communication system significantly. Hence, microgrids are cyberphysical systems and, therefore, the cyber system plays a crucial role in the performance of the cyber-power system. A microgrid control scheme is proposed for power dispatch and regulation based on the droop and proportional-integral (PI) feedback control. The proposed control strategy is validated for transient stability following dynamic events. To evaluate the impact of a networked control system on control performance, a cyber model is developed to represent data acquisition periods and communication delays. An analytical method is proposed to determine the critical values for the data reporting periods and communication delays. The analytical method based on a state space model of a networked control system is applicable for large-scale systems. A 2-dimensional stability region of a microgrid in the space of cyber parameters can be obtained by the proposed method, and the critical values of cyber parameters are determined based on the stability region. Simulation results validate that the design of a microgrid as a cyber-physical system needs to be guided by critical values for the data reporting period and communication delay to prevent system instability.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

A framework for strategic discovery of credible neural network surrogate models under uncertainty

The widespread integration of deep neural networks in developing data-driven surrogate models for high-fidelity simulations of complex physical systems highlights the critical necessity for robust uncertainty quantification techniques and credibility assessment methodologies, ensuring the reliable deployment of surrogate models in consequential decision-making. Here, this study presents the Occam Plausibility Algorithm for surrogate models (OPAL-surrogate), providing a systematic framework to uncover predictive neural network-based surrogate models within the large space of potential models, including various neural network classes and choices of architecture and hyperparameters. The framework is grounded in hierarchical Bayesian inferences and employs model validation tests to evaluate the credibility and prediction reliability of the surrogate models under uncertainty. Leveraging these principles, OPAL-surrogate introduces a systematic and efficient strategy for balancing the trade-off between model complexity, accuracy, and prediction uncertainty. The effectiveness of OPAL-surrogate is demonstrated through two modeling problems, including the deformation of porous materials for building insulation and turbulent combustion flow for ablation of solid fuels within hybrid rocket motors.

42 ENGINEERING↗
DOE OSTI2022

Challenges in Markov Chain Monte Carlo for Bayesian Neural Networks

Markov chain Monte Carlo (MCMC) methods have not been broadly adopted in Bayesian neural networks (BNNs). This paper initially reviews the main challenges in sampling from the parameter posterior of a neural network via MCMC. Such challenges culminate to lack of convergence to the parameter posterior. Nevertheless, this paper shows that a nonconverged Markov chain, generated via MCMC sampling from the parameter space of a neural network, can yield via Bayesian marginalization a valuable posterior predictive distribution of the output of the neural network. Further, classification examples based on multilayer perceptrons showcase highly accurate posterior predictive distributions. The postulate of limited scope for MCMC developments in BNNs is partially valid; an asymptotically exact parameter posterior seems less plausible, yet an accurate posterior predictive distribution is a tenable research avenue.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Nonlocal Kernel Network (NKN): a Stable and Resolution-Independent Deep Neural Network.

Neural operators have recently become popular tools for designing solution maps between function spaces in the form of neural networks. Differently from classical scientific machine learning approaches that learn parameters of a known partial differential equation (PDE) for a single instance of the input parameters at a fixed resolution, neural operators approximate the solution map of a family of PDEs [6, 7]. Despite their success, the uses of neural operators are so far restricted to relatively shallow neural networks and confined to learning hidden governing laws. In this work, we propose a novel nonlocal neural operator, which we refer to as nonlocal kernel network (NKN), that is resolution independent, characterized by deep neural networks, and capable of handling a variety of tasks such as learning governing equations and classifying images. Our NKN stems from the interpretation of the neural network as a discrete nonlocal diffusion reaction equation that, in the limit of infinite layers, is equivalent to a parabolic nonlocal equation, whose stability is analyzed via nonlocal vector calculus. The resemblance with integral forms of neural operators allows NKNs to capture long-range dependencies in the feature space, while the continuous treatment of node-to-node interactions makes NKNs resolution independent. The resemblance with neural ODEs, reinterpreted in a nonlocal sense, and the stable network dynamics between layers allow for generalization of NKN’s optimal parameters from shallow to deep networks. This fact enables the use of shallow-to-deep initialization techniques [8]. Our tests show that NKNs outperform baseline methods in both learning governing equations and image classification tasks and generalize well to different resolutions and depths.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Streamlining latent spaces in machine learning using moment pooling

Many machine learning applications involve learning a latent representation of data, which is often high-dimensional and difficult to directly interpret. In this work, we propose “moment pooling,” a natural extension of deep sets networks which drastically decreases the latent space dimensionality of these networks while maintaining or even improving performance. Moment pooling generalizes the summation in deep sets to arbitrary multivariate moments, which enables the model to achieve a much higher effective latent dimensionality for a fixed learned latent space dimension. We demonstrate moment pooling on the collider physics task of quark/gluon jet classification by extending energy flow networks (EFNs) to moment EFNs. We find that moment EFNs with latent dimensions as small as 1 perform similarly to ordinary EFNs with higher latent dimension. This small latent dimension allows for the internal representation to be directly visualized and interpreted, which in turn enables the learned internal jet representation to be extracted in closed form. Published by the American Physical Society 2024

Gambhir, Rikab (ORCID:0000000251080448)↗
DOE OSTI2024

Cross-Feature Transfer Learning for Efficient Tensor Program Generation

Tuning tensor program generation involves navigating a vast search space to find optimal program transformations and measurements for a program on the target hardware. The complexity of this process is further amplified by the exponential combinations of transformations, especially in heterogeneous environments. This research addresses these challenges by introducing a novel approach that learns the joint neural network and hardware features space, facilitating knowledge transfer to new, unseen target hardware. A comprehensive analysis is conducted on the existing state-of-the-art dataset, TenSet, including a thorough examination of test split strategies and the proposal of methodologies for dataset pruning. Leveraging an attention-inspired technique, we tailor the tuning of tensor programs to embed both neural network and hardware-specific features. Notably, our approach substantially reduces the dataset size by up to 53% compared to the baseline without compromising Pairwise Comparison Accuracy (PCA). Furthermore, our proposed methodology demonstrates competitive or improved mean inference times with only 25–40% of the baseline tuning time across various networks and target hardware. The attention-based tuner can effectively utilize schedules learned from previous hardware program measurements to optimize tensor program tuning on previously unseen hardware, achieving a top-5 accuracy exceeding 90%. This research introduces a significant advancement in autotuning tensor program generation, addressing the complexities associated with heterogeneous environments and showcasing promising results regarding efficiency and accuracy.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Perivascular network segmentations derived from high-field MRI and their implications for perivascular and parenchymal mass transport in the rat brain

A custom segmentation workflow was applied to ex vivo high-field MR images of rat brains acquired following in vivo intraventricular contrast agent infusion to generate maps of the perivascular spaces (PVS). The resulting perivascular network segmentations enabled analysis of perivascular connections to the ventricles, parenchymal solute clearance, and dispersive solute transport within PVS. Numerous perivascular connections between the brain surface and the ventricles suggest the ventricles integrate into a PVS-mediated clearance system and raise the possibility of cerebrospinal fluid (CSF) return from the subarachnoid space to the ventricles via PVS. Assuming rapid solute exchange between the PVS and CSF spaces primarily by advection, the extensive perivascular network decreased the mean clearance distance from parenchyma to the nearest CSF compartment resulting in an over 21-fold reduction in the estimated diffusive clearance time scale, irrespective of solute diffusivity. This corresponds to an estimated diffusive clearance time scale under 10 min for amyloid-beta which suggests that the widespread distribution of PVS may render diffusion an effective parenchymal clearance mechanism. Additional analysis of oscillatory solute dispersion within PVS indicates that advection rather than dispersion is likely the primary transport mechanism for dissolved compounds greater than 66 kDa in the long (> 2 mm) perivascular segments identified here, although dispersion may be significant for smaller compounds in shorter perivascular segments.

59 BASIC BIOLOGICAL SCIENCES↗