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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 595 records · Page 33

All sources NASA NTRS DOE OSTI

DOE OSTI2023

Understanding the Effect of Single Atom Cationic Defect Sites in an Al 2 O 3 (012) Surface on Altering Selenate and Sulfate Adsorption: An Ab Initio Study

Adsorption is a promising under-the-sink selenate remediation technique for distributed water systems. Recently it was shown that adsorption induced water network rearrangement control adsorption energetics on the α-Al 2 O 3 (012) surface. Here, we aim to elucidate the relative importance of the water network effects and surface cation identity on controlling selenate and sulfate adsorption energy using density functional theory calculations. Density functional theory (DFT) calculations predicted the adsorption energies of selenate and sulfate on nine transition metal cations (Sc–Cu) and two alkali metal cations (Ga and In) in the α-Al 2 O 3 (012) surface under simulated acidic and neutral pH conditions. We find that the water network effects had a larger impact on the adsorption energy than the cationic identity. However, cation identity secondarily controlled adsorption. Most cations decreased the adsorption energy, weakening the overall performance, the larger Sc and In cations enabled inner-sphere adsorption in acidic conditions because they relaxed outward from the surface, providing more space for adsorption. Additionally, only Ti induced Se selectivity over S by reducing the adsorbing selenate to selenite but not reducing the sulfate. Altogether, this study indicates that tuning water network structure will likely have a larger impact than tuning cation–selenate interactions for increasing adsorbate effectiveness.

Adsorption↗

DOE OSTI2024

Unifying Combinatorial and Graphical Methods in Artificial Intelligence

Recently, a new graph Laplacian, called the inner product Laplacian, was introduced which generalizes many existing Laplacians, including the normalized and combinatorial Laplacian and their weighted variants. The key observation behind the inner product Laplacian is that by defining appropriate inner product spaces on the vertices and edges, the standard Laplacians can be recovered as Hodge Laplacians over the simplicial complex formed by the edges and vertices. These inner product spaces form a natural way to incorporate non-combinatorial information into the definition of a domain-specific Laplacian. In particular, in contrast to current domain-specific weighting schemes which rely solely on edge weights, information regarding the similarity of non-adjacent vertices and arbitrary pairs of edges can be effectively incorporated into the Laplacian. In order to illustrate this approach we consider the problem of calculating the potential energy of an atomistic configuration using Graph Neural Networks. In comparison with start-of-the-art approaches, such as SchNet, our approach replaces a learned (via auto-encoder) representation of the atom types with an inner product space on atoms based on scientific knowledge (e.g., electronegativity). We will illustrate how this approach captures key chemical properties of the molecules and compare the energy calculations with state-of-the-art neural network approaches. However, to compute the resulting Laplacian involves a mixture of sparse and dense matrix computation and yields a dense matrix as the basis for the graph convolution. This dense convolutional kernel necessitates moving away from the standard message passing framework for graph neural networks and increases the computational cost of applying the kernel. In order to mitigate these costs we investigate means of leveraging the mixed sparse and dense computations to reduce the overall computational cost and how these approaches can be automatically transferred to energy efficient hardware (e.g., field programmable gate arrays (FPGAs)).

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

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↗

DOE OSTI2026

Cyber Halo Innovation Research Program (CHIRP) Handbook: CHIRP Program Document 2026

The Cyber Halo Innovation Research Program (CHIRP) handbook outlines a comprehensive framework designed to advance space cybersecurity education, workforce development, recruitment efforts for United States Space Force (USSF) Space Systems Command (SSC) and the Department of the Airforce, and foster students’ professional growth. It provides an overview of CHIRP's objectives and strategic focus, establishing the foundation for participant engagement through a network of collaborations with academic institutions, contracted industry partners, training and certification organizations, federal agencies, and community organizations. It states a clear participation strategy for SSC and Pacific Northwest National Laboratory (PNNL) for program execution and successful support for student transition to a career in space cybersecurity.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗

DOE OSTI2024

Frustrated Ising charge correlations in the kagome metal ScV 6 Sn 6

Here we resolve the real-space nature of the high-temperature, short-range charge correlations in the kagome metal ScV 6 Sn 6 . Diffuse scattering appears along a frustrated wave vector q H = ($\frac{1}{3}, \frac{1}{3}, \frac{1}{2}$) at temperatures far exceeding the charge order T CO = 92 K, preempting long-range charge order with wave vectors along q$_{\bar{K}}$ = ($\frac{1}{3}, \frac{1}{3}, \frac{1}{3}$). Using a combination of real space and reciprocal space analysis, we resolve the nature of the interactions between the primary out-of-plane Sc-Sn chain instability and the secondary strain-mediated distortion of the in-plane V kagome network. Finally, a minimal model of the diffuse scattering data reveals a high-temperature, short-ranged "zig-zag" phase of in-plane correlations that maps to a frustrated triangular lattice Ising model with antiferromagnetic interactions and provides a real-space understanding of the origin frustrated charge order in this material.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

DOE OSTI2024

Bridging the gap between experiments and simulations using machine learning

The physics of inertial confinement fusion is rich and complex. Simulation codes that are used to design experiments are computationally expensive and lack the predictive capability required for extensive parameter exploration in search of a high-performing design for laser direct drive. In this work we use deep learning to build a fast emulator of experiments. To facilitate the development of the deep-learning model, an autoencoder is used to reduce the dimensionality of the input space. Two deep learning models are developed. One model is trained on a vast array of simulation data and is subsequently calibrated to expensive and limited experimental data using a technique known as “transfer learning.” The other model is trained on a statistical model and is subsequently calibrated using experimental data. A comparative study of the two predictive models is carried out. The models potentially reproduce key experimental observables with high accuracy and unprecedented inference times relative to those achieved with simulation codes. These models facilitate rapid exploration of a high dimensional input parameter space.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2023

Direct prediction of inelastic neutron scattering spectra from the crystal structure*

Abstract Inelastic neutron scattering (INS) is a powerful technique to study vibrational dynamics of materials with several unique advantages. However, analysis and interpretation of INS spectra often require advanced modeling that needs specialized computing resources and relevant expertise. This difficulty is compounded by the limited experimental resources available to perform INS measurements. In this work, we develop a machine-learning based predictive framework which is capable of directly predicting both one-dimensional INS spectra and two-dimensional INS spectra with additional momentum resolution. By integrating symmetry-aware neural networks with autoencoders, and using a large scale synthetic INS database, high-dimensional spectral data are compressed into a latent-space representation, and a high-quality spectra prediction is achieved by using only atomic coordinates as input. Our work offers an efficient approach to predict complex multi-dimensional neutron spectra directly from simple input; it allows for improved efficiency in using the limited INS measurement resources, and sheds light on building structure-property relationships in a variety of on-the-fly experimental data analysis scenarios.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2020

Model Exploration of an Information-Based Healthcare Intervention Using Parallelization and Active Learning

This paper describes the application of a large-scale active learning method to characterize the parameter space of a computational agent-based model developed to investigate the impact of CommunityRx, a clinical information-based health intervention that provides patients with personalized information about local community resources to meet basic and self-care needs. Additionally, the diffusion of information about community resources and their use is modeled via networked interactions and their subsequent effect on agents' use of community resources across an urban population. A random forest model is iteratively fitted to model evaluations to characterize the model parameter space with respect to observed empirical data. We demonstrate the feasibility of using high-performance computing and active learning model exploration techniques to characterize large parameter spaces; by partitioning the parameter space into potentially viable and non-viable regions, we rule out regions of space where simulation output is implausible to observed empirical data. We argue that such methods are necessary to enable model exploration in complex computational models that incorporate increasingly available micro-level behavior data. We provide public access to the model and high-performance computing experimentation code.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

Communication-efficient certificate revocation management for Advanced Metering Infrastructure and IoT Integration

Advanced Metering Infrastructure forms a communication network for the collection of power data from smart meters in Smart Grid. As the communication between smart meters could be secured utilizing public-key cryptography, however, public-key cryptography still has certain challenges in terms of certificate revocation and management particularly related distribution and storage overhead of revoked certificates. To address this challenge, in this work, we propose a novel revocation management approach by utilizing cryptographic accumulators which reduces the space requirements for revocation information significantly and thus enables efficient distribution of such information to all smart meters. We implemented the proposed approach on both ns-3 network simulator and a testbed. We demonstrated its superior performance with respect to traditional methods for revocation management.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Communication Requirements in 5G-Enabled Healthcare Applications: Review and Considerations

Fifth generation (5G) mobile communication technology can enable novel healthcare applications and augment existing ones. However, 5G-enabled healthcare applications demand diverse technical requirements for radio communication. Knowledge of these requirements is important for developers, network providers, and regulatory authorities in the healthcare sector to facilitate safe and effective healthcare. In this paper, we review, identify, describe, and compare the requirements for communication key performance indicators in relevant healthcare use cases, including remote robotic-assisted surgery, connected ambulance, wearable and implantable devices, and service robotics for assisted living, with a focus on quantitative requirements. We also compare 5G-healthcare requirements with the current state of 5G capabilities. Finally, we identify gaps in the existing literature and highlight considerations for this space.

5G networks↗

DOE OSTI2020

Effects of social structure and management on risk of disease establishment in wild pigs

Contact heterogeneity among hosts determines invasion and spreading dynamics of infectious disease, thus its characterization is essential for identifying effective disease control strategies. Yet, little is known about the factors shaping contact networks in many 28 wildlife species and how wildlife management actions might affect contact networks. Wild pigs in North America are an invasive, socially-structured species that pose a health concern for domestic swine given their ability to transmit numerous devastating diseases 2 such as African swine fever (ASF). Using proximity loggers and GPS data from 48 wild pigs in Florida and South Carolina, USA, we employed a probabilistic framework to estimate weighted contact networks. We determined the effects of sex, social group, and spatial distribution (monthly home range overlap and distance) on wild pig contact. We also estimated the impacts of management-induced perturbations on contact and inferred their effects on ASF establishment in wild pigs with simulation. Social group membership was the primary factor influencing contacts. Between-group contacts depended primarily on space use characteristics, with fewer contacts among groups separated by >2 km and no contacts among groups >4 km apart within a month. Modeling ASF dynamics on the contact network demonstrated that indirect contacts resulting from baiting (a typical method of attracting wild pigs or game species to a site to enhance recreational hunting) increased the risk of disease establishment by ~33% relative to direct contact. Low-intensity population reduction (<5.9% of the population) had no detectable impact on contact structure but reduced predicted ASF establishment risk relative to no population reduction. Here, we demonstrate an approach for understanding the relative role of spatial, social, and individual-level characteristics in shaping contact networks and predicting their effects on disease establishment risk, thus providing insight for optimizing disease control in spatially- and socially-structured wildlife species.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2020

Effective entropy of quantum fields coupled with gravity

Entanglement entropy, or von Neumann entropy, quantifies the amount of uncertainty of a quantum state. For quantum fields in curved space, entanglement entropy of the quantum field theory degrees of freedom is well-defined for a fixed background geometry. In this paper, we propose a generalization of the quantum field theory entanglement entropy by including dynamical gravity. The generalized quantity named effective entropy, and its Renyi entropy generalizations, are defined by analytic continuation of a replica calculation. The replicated theory is defined as a gravitational path integral with multiple copies of the original boundary conditions, with a co-dimension-2 brane at the boundary of region we are studying. We discuss different approaches to define the region in a gauge invariant way, and show that the effective entropy satisfies the quantum extremal surface formula. When the quantum fields carry a significant amount of entanglement, the quantum extremal surface can have a topology transition, after which an entanglement island region appears. Our result generalizes the Hubeny-Rangamani-Takayanagi formula of holographic entropy (with quantum corrections) to general geometries without asymptotic AdS boundary, and provides a more solid framework for addressing problems such as the Page curve of evaporating black holes in asymptotic flat spacetime. We apply the formula to two example systems, a closed two-dimensional universe and a four-dimensional maximally extended Schwarzchild black hole. We discuss the analog of the effective entropy in random tensor network models, which provides more concrete understanding of quantum information properties in general dynamical geometries. We show that, in absence of a large boundary like in AdS space case, it is essential to introduce ancilla that couples to the original system, in order for correctly characterizing quantum states and correlation functions in the random tensor network. Using the superdensity operator formalism, we study the system with ancilla and show how quantum information in the entanglement island can be reconstructed in a state-dependent and observer-dependent map. We study the closed universe (without spatial boundary) case and discuss how it is related to open universe.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2021

Hierarchical Inference with Bayesian Neural Networks: An Application to Strong Gravitational Lensing

In the past few years, approximate Bayesian Neural Networks (BNNs) have demonstrated the ability to produce statistically consistent posteriors on a wide range of inference problems at unprecedented speed and scale. However, any disconnect between training sets and the distribution of real-world objects can introduce bias when BNNs are applied to data. This is a common challenge in astrophysics and cosmology, where the unknown distribution of objects in our universe is often the science goal. In this work, we incorporate BNNs with flexible posterior parameterizations into a hierarchical inference framework that allows for the reconstruction of population hyperparameters and removes the bias introduced by the training distribution. We focus on the challenge of producing posterior PDFs for strong gravitational lens mass model parameters given Hubble Space Telescope–quality single-filter, lens-subtracted, synthetic imaging data. We show that the posterior PDFs are sufficiently accurate (statistically consistent with the truth) across a wide variety of power-law elliptical lens mass distributions. We then apply our approach to test data sets whose lens parameters are drawn from distributions that are drastically different from the training set. We show that our hierarchical inference framework mitigates the bias introduced by an unrepresentative training set's interim prior. Simultaneously, we can precisely reconstruct the population hyperparameters governing our test distributions. Our full pipeline, from training to hierarchical inference on thousands of lenses, can be run in a day. The framework presented here will allow us to efficiently exploit the full constraining power of future ground- and space-based surveys (https://github.com/swagnercarena/ovejero).

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2020

Prediction by Convolutional Neural Networks of CO 2 /N 2 Selectivity in Porous Carbons from N 2 Adsorption Isotherm at 77 K

Abstract Porous carbons are an important class of porous materials with many applications, including gas separation. An N 2 adsorption isotherm at 77 K is the most widely used approach to characterize porosity. Conventionally, textual properties such as surface area and pore volumes are derived from the N 2 adsorption isotherm at 77 K by fitting it to adsorption theory and then correlating it to gas separation performance (uptake and selectivity). Here the N 2 isotherm at 77 K was used directly as input (representing feature descriptors for the porosity) to train convolutional neural networks to predict gas separation performance (using CO 2 /N 2 as a test case) for porous carbons. The porosity space for porous carbons was explored for higher CO 2 /N 2 selectivity. Porous carbons with a bimodal pore‐size distribution of well‐separated mesopores (3–7 nm) and micropores (<2 nm) were found to be most promising. This work will be useful in guiding experimental research of porous carbons with the desired porosity for gas separation and other applications.

Wang, Song↗

DOE OSTI2020

Prediction by Convolutional Neural Networks of CO 2 /N 2 Selectivity in Porous Carbons from N 2 Adsorption Isotherm at 77 K

Wang, Song↗

DOE OSTI2024

Efficient estimation of the modified Gromov–Hausdorff distance between unweighted graphs

Abstract Gromov–Hausdorff distances measure shape difference between the objects representable as compact metric spaces, e.g. point clouds, manifolds, or graphs. Computing any Gromov–Hausdorff distance is equivalent to solving an NP-hard optimization problem, deeming the notion impractical for applications. In this paper we propose a polynomial algorithm for estimating the so-called modified Gromov–Hausdorff (mGH) distance, a relaxation of the standard Gromov–Hausdorff (GH) distance with similar topological properties. We implement the algorithm for the case of compact metric spaces induced by unweighted graphs as part of Python library , and demonstrate its performance on real-world and synthetic networks. The algorithm finds the mGH distances exactly on most graphs with the scale-free property. We use the computed mGH distances to successfully detect outliers in real-world social and computer networks.

Oles, Vladyslav (ORCID:0000000188727463)↗

DOE OSTI2023

DDStore: Distributed Data Store for Scalable Training of Graph Neural Networks on Large Atomistic Modeling Datasets

Graph neural networks (GNNs) are a class of Deep Learning models used in designing atomistic materials for effective screening of large chemical spaces. To ensure robust prediction, GNN models must be trained on large volumes of atomistic data on leadership class supercomputers. Even with the advent of modern architectures that consist of multiple storage layers that include node-local NVMe devices in addition to device memory for caching large datasets, extreme-scale model training faces I/O challenges at scale.We present DDStore, an in-memory distributed data store designed for GNN training on large-scale graph data. DDStore provides a hierarchical, distributed, data caching technique that combines data chunking, replication, low-latency random access, and high throughput communication. DDStore achieves near-linear scaling for training a GNN model using up to 1000 GPUs on the Summit and Perlmutter supercomputers, and reaches up to a 6.15x reduction in GNN training time compared to state-of-the-art methodologies.

Choi, Jong Youl↗

DOE OSTI2022

Applying machine learning methods to prediction problems of lattice observables

We discuss the prediction of critical behavior of lattice observables in SU(2) and SU(3) gauge theories. We show that feed-forward neural network, trained on the lattice configurations of gauge fields as input data, finds correlations with the target observable, which is also true in the critical region where the neural network has not been trained. We have verified that the neural network constructs a gauge-invariant function and this property does not change over the entire range of the parameter space.

Gerasimeniuk, Nikolai↗