Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Network structure”

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 487 records · Page 27
All sourcesNASA NTRSDOE OSTI
NASA NTRSDate not supplied

Sheaf Theoretic Models for Routing in Delay Tolerant Networks

One key to communications scalability is routing; as such the goal of this paper is to build upon successful efforts towards general routing for space-based networks. With the ever-increasing accessibility of space, the number of assets is increasing, which becomes a critical communications burden in terms of scheduling, spectrum allocation, and resource allocation. In order to mitigate these concerns, a true networking approach is necessary; a standard approach for space systems is Delay Tolerant Networking (DTN). For DTN to be a meaningful answer to the Solar System Internet (SSI) question, DTN must offer meaningful routing solutions that span the heterogeneous collection of links and nodes. This, in turn, depends on the general structure of these disconnected networks -- a structure that remains largely unknown. In ground communications networks, routing decisions are made based on several pathfinding algorithms working in tandem. In previous work, we modeled Dijkstra's pathfinding algorithm using sheaves and provided a more general framework for determining paths using sheaves over graphs. Continuing our sheaf-theoretic approach, we introduce here an expansion of our pathfinding sheaf to handle more general information, and we expand on additional pathfinding algorithms that can be represented using sheaves. Moreover, we demonstrate means of combining multiple algorithms into a single sheaf structure so that changes of scale can be presented in the language of sheaves. In addition, space communications networks rely upon radio transmitter antennas which can establish broadcast and multicast communications options, rather than the primarily unicast options available to wired networks. Last year, we also introduced a multicast routing sheaf for presenting broadcast, unicast, and multicast communications over a graph. Extending that work, we also introduce queuing sheaves so that we can blend these communications options together to simulate a variety of routing options across space networks. In addition, we include examples to illustrate the applicability of this abstract theory to routing in disconnected networks.

Robert Short↗
DOE OSTI2023

Harnessing Neural Networks for Elucidating X-ray Absorption Structure–Spectrum Relationships in Amorphous Carbon

Improved understanding of structural and chemical properties through local experimental probes, such as X-ray absorption near-edge structure (XANES) spectroscopy, is crucial for the understanding and design of functional materials. In recent years, significant advancements have been made in the development of data science approaches for the automated interpretation of XANES structure–spectrum relationships. However, existing studies have primarily focused on crystalline solids and small molecules, while fewer efforts have been devoted to disordered systems. Thus, in this work, we demonstrate the development of neural network models for predicting and interpreting XANES spectra of amorphous carbon (a-C) from local structural descriptors. Comparison between different structural descriptors expectedly shows that the inclusion of both bond length and bond angle information is necessary for an accurate prediction of the spectra. Among the descriptors considered in this work, we find that the local many-body tensor representation yields the highest accuracy and greatest interpretability so that it can be leveraged to understand the importance of structural motifs in determining XANES spectra. Furthermore, we also discuss performance of neural network models for predicting both local structure features, such as bond lengths and bond angles, and global chemical composition, such as the sp:sp 2 :sp 3 ratio.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Latent code-based fusion: A Volterra neural network approach

We propose a deep structure encoder using Volterra Neural Networks (VNNs) to seek a latent representation of multi-modal data whose features are jointly captured by a union of subspaces. The so-called self-representation embedding of the latent codes leads to a simplified fusion which is driven by a similarly constructed decoding. The Volterra Filter architecture achieved reduction in parameter complexity is primarily due to controlled non-linearities being introduced by the higher-order convolutions in lieu of generalized activation functions. Experimental results on two different datasets have shown a significant improvement in the clustering performance for VNNs auto-encoder over conventional Convolutional Neural Networks (CNNs) auto-encoder. In addition, we also show that the proposed approach demonstrates a much-improved sample complexity over CNN-based auto-encoder with a robust classification performance.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Testing the reliability of interpretable neural networks in geoscience using the Madden–Julian oscillation

Abstract. We test the reliability of two neural network interpretation techniques, backward optimization and layerwise relevance propagation, within geoscientific applications by applying them to a commonly studied geophysical phenomenon, the Madden–Julian oscillation. The Madden–Julian oscillation is a multi-scale pattern within the tropical atmosphere that has been extensively studied over the past decades, which makes it an ideal test case to ensure the interpretability methods can recover the current state of knowledge regarding its spatial structure. The neural networks can, indeed, reproduce the current state of knowledge and can also provide new insights into the seasonality of the Madden–Julian oscillation and its relationships with atmospheric state variables. The neural network identifies the phase of the Madden–Julian oscillation twice as accurately as a linear regression approach, which means that nonlinearities used by the neural network are important to the structure of the Madden–Julian oscillation. Interpretations of the neural network show that it accurately captures the spatial structures of the Madden–Julian oscillation, suggest that the nonlinearities of the Madden–Julian oscillation are manifested through the uniqueness of each event, and offer physically meaningful insights into its relationship with atmospheric state variables. We also use the interpretations to identify the seasonality of the Madden–Julian oscillation and find that the conventionally defined extended seasons should be shifted later by 1 month. More generally, this study suggests that neural networks can be reliably interpreted for geoscientific applications and may thereby serve as a dependable method for testing geoscientific hypotheses.

58 GEOSCIENCES↗
DOE OSTI2021

Detecting hidden layers from spreading dynamics on complex networks

When dealing with spreading processes on networks it can be of the utmost importance to test the reliability of data and identify potential unobserved spreading paths. In this paper we address these problems and propose methods for hidden layer identification and reconstruction. We also explore the interplay between difficulty of the task and the structure of the multilayer network describing the whole system where the spreading process occurs. Our methods stem from an exact expression for the likelihood of a cascade in the susceptible-infected model on an arbitrary graph. We then show that by imploring statistical properties of unimodal distributions and simple heuristics describing joint likelihood of a series of cascades one can obtain an estimate of both existence of a hidden layer and its content with success rates far exceeding those of a null model. Furthermore, we conduct our analyses on both synthetic and real-world networks providing evidence for the viability of the approach presented.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Combining protein sequences and structures with transformers and equivariant graph neural networks to predict protein function

Abstract Motivation Millions of protein sequences have been generated by numerous genome and transcriptome sequencing projects. However, experimentally determining the function of the proteins is still a time consuming, low-throughput, and expensive process, leading to a large protein sequence-function gap. Therefore, it is important to develop computational methods to accurately predict protein function to fill the gap. Even though many methods have been developed to use protein sequences as input to predict function, much fewer methods leverage protein structures in protein function prediction because there was lack of accurate protein structures for most proteins until recently. Results We developed TransFun—a method using a transformer-based protein language model and 3D-equivariant graph neural networks to distill information from both protein sequences and structures to predict protein function. It extracts feature embeddings from protein sequences using a pre-trained protein language model (ESM) via transfer learning and combines them with 3D structures of proteins predicted by AlphaFold2 through equivariant graph neural networks. Benchmarked on the CAFA3 test dataset and a new test dataset, TransFun outperforms several state-of-the-art methods, indicating that the language model and 3D-equivariant graph neural networks are effective methods to leverage protein sequences and structures to improve protein function prediction. Combining TransFun predictions and sequence similarity-based predictions can further increase prediction accuracy. Availability and implementation The source code of TransFun is available at https://github.com/jianlin-cheng/TransFun.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2023

Multifunctional Fiber-Reinforced Polymer Composites for Damage Detection and Memory

Self-structural health monitoring (SHM) functionalities for fiber-reinforced polymer composites have become highly sought after to ensure the structural safety of newly advancing components in the automotive, civil, mechanical, and aerospace industries. This paper introduces a self-damage detection and memory (SDDM) hybrid composite material, where the structural carbon fiber tow is transformed into a piezoresistive sensor network, and the structural glass fiber operates as electrical insulation. In this study, SDDM specimens were fabricated, and tensile and impact tests were performed. The tensile tests of SDDM specimens find two distinct loading peaks: first where the carbon fiber fails, and second where the glass fiber fails. A linear correlation was observed between the carbon fiber resistance and composite strain up to a threshold, beyond which a sharp nonlinear increase in resistance occurred. The resistance then approached infinity, coinciding with the first loading peak and failure of the carbon fiber elements. This demonstrates the potential for a damage early warning threshold. Additionally, the effect of stitching the sensor tow in a zig-zag pattern over a large area was investigated using tailored fiber placement (TFP) of 1-loop, 3-loop, and 5-loop specimens. Tensile testing found that increasing the number of loops improved the sensor’s accuracy for strain sensing. Furthermore, impact tests were conducted, and as the impact energy progressively increased, the sensor resistance permanently increased. This illustrates a capability for self-memory of microdamage throughout the life cycle of the structure, potentially useful for predicting the remaining life of the composite.

Demo, Luke B. (ORCID:0000000208806522)↗
DOE OSTI2022

Using Hyperoptimized Tensor Networks and First-Principles Electronic Structure to Simulate the Experimental Properties of the Giant {Mn 84 } Torus

The single-molecule magnet {Mn 84 } is a challenge to theory because of its high nuclearity. Here, we directly compute two experimentally accessible observables, the field-dependent magnetization up to 75 T and the temperature-dependent heat capacity, using parameter-free theory. In particular, we use first-principles calculations to derive short- and long-range exchange interactions and compute the exact partition function of the resulting classical Potts and Ising spin models for all 84 Mn S = 2 spins to obtain observables. The latter computation is made possible by using hyperoptimized tensor network contractions, a technique developed to simulate quantum supremacy circuits. We also synthesize the magnet and measure its heat capacity and magnetization, observing qualitative agreement between theory and experiment and identifying an unusual bump in the heat capacity and a plateau in the magnetization. Our work also identifies some limitations of current theoretical modeling in large magnets, such as sensitivity to small, long-range exchange couplings.

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

Self-Supervised and Interpretable Anomaly Detection Using Network Transformers

Machine learning and deep neural networks (DNNs) have been proposed as a tool to identify anomalies in computer network communications. However, due the obfuscated nature of off-the-shelf machine learning models, their output often does not provide enough information to isolate the source of the anomaly to take corrective measures. In this article, we introduce the network transformer (NeT), a DNN model for anomaly detection that incorporates the graph structure of the communication network in order to improve interpretability. Further, the presented approach has the following advantages: first, enhanced interpretability by incorporating the graph structure of computer networks; second, provides a hierarchical set of features that enables analysis at different levels of granularity; second, self-supervised training that does not require labeled data. The NeT model was evaluated on a set of anomalous scenarios executed in a real industrial control system. The presented approach successfully identified the anomalies, the devices affected, and the specific connections causing the anomalies, providing a data-driven hierarchical approach to analyze the behavior of a cyber network.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2007

Revealing the ISO/IEC 9126-1 Clique Tree for COTS Software Evaluation

Previous research has shown that acyclic dependency models, if they exist, can be extracted from software quality standards and that these models can be used to assess software safety and product quality. In the case of commercial off-the-shelf (COTS) software, the extracted dependency model can be used in a probabilistic Bayesian network context for COTS software evaluation. Furthermore, while experts typically employ Bayesian networks to encode domain knowledge, secondary structures (clique trees) from Bayesian network graphs can be used to determine the probabilistic distribution of any software variable (attribute) using any clique that contains that variable. Secondary structures, therefore, provide insight into the fundamental nature of graphical networks. This paper will apply secondary structure calculations to reveal the clique tree of the acyclic dependency model extracted from the ISO/IEC 9126-1 software quality standard. Suggestions will be provided to describe how the clique tree may be exploited to aid efficient transformation of an evaluation model.

Morris, A. Terry↗
DOE OSTI2021

Tunable Stochasticity in an Artificial Spin Network

Metamaterials present the possibility of artificially generating advanced functionalities through engineering of their internal structure. Artificial spin networks, in which a large number of nanoscale magnetic elements are coupled together, are promising metamaterial candidates that enable the control of collective magnetic behavior through tuning of the local interaction between elements. In this work, the motion of magnetic domain-walls in an artificial spin network leads to a tunable stochastic response of the metamaterial, which can be tailored through an external magnetic field and local lattice modifications. This type of tunable stochastic network produces a controllable random response exploiting intrinsic stochasticity within magnetic domain-wall motion at the nanoscale. An iconic demonstration used to illustrate the control of randomness is the Galton board. In this system, multiple balls fall into an array of pegs to generate a bell-shaped curve that can be modified via the array spacing or the tilt of the board. A nanoscale recreation of this experiment using an artificial spin network is employed to demonstrate tunable stochasticity. Furthermore, this type of tunable stochastic network opens new paths toward post-Von Neumann computing architectures such as Bayesian sensing or random neural networks, in which stochasticity is harnessed to efficiently perform complex computational tasks.

Artificial spin network↗
DOE OSTI2026

Assessing the Application of a Genomic Network Analysis in Population Ecology: Inferring Patterns of Dispersal and Geographic Structure in the Emerging Pathogen, Coccidioides

A challenge in population ecology studies is identifying how to best group individuals into populations, especially when individual origin is unknown. Machine learning has improved upon traditional methods of identifying population structure and is more efficient at handling large, complex datasets. We demonstrate the applicability of a machine learning method to identify hierarchical population structure in an emerging pathogen, Coccidioides spp., the causative agent of Valley fever. We compared the network clusters to structure identified by traditional tools as a validation of the network performance. We used publicly available whole-genome data for 48 C. immitis and 102 C. posadasii, resulting in 168,211 genome-wide SNPs among the two species. The network analysis grouped samples into populations comparable to the literature for these species but also identified fine-scale geographic structure and travel-associated cases not reported thus far. Exploring different resolutions in the network made it easy to identify unique genotypes specific to California and possibly Nevada, as well as Phoenix- and Tucson-acquired infections in non-endemic areas, regardless of reported travel history. The present study provides a promising example of how a ML-based network analysis can improve our ability to understand pathogen ecology, group cases into populations and infer travel-associated infections.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2020

Microsolvation in V + (H 2 O) n Clusters Studied with Selected-Ion Infrared Spectroscopy

Gas phase ion-molecule clusters of the form V + (H 2 O) n (n = 1-30) are produced by laser vaporization in a supersonic expansion. These ions are analyzed and mass-selected with a time-of-flight mass spectrometer and investigated with infrared laser photodissociation spectroscopy. The small clusters (n ≤ 7) are studied with argon tagging, while the larger clusters are studied via the elimination of water molecules. The vibrational spectra for the small clusters include only free O-H stretching vibrations, while larger clusters exhibit red-shifted hydrogen bonding vibrations. The spectral patterns reveal that the coordination around V + ions is completed with four water molecules. A symmetric square-planar structure forms for the n = 4 ion, and this becomes the core ion in larger structures. Clusters up to n = 8 have mostly two-dimensional structures, but hydrogen bonding networks evolve to three-dimensional structures in larger clusters. The free O-H vibration of AAD (acceptor-acceptor-donor) coordinated surface molecules converges to a frequency near that of bulk water by the cluster size of n = 30. However, the splitting of this vibration for AAD- versus AD-coordinated molecules is still different compared to other singly-charged or doubly-charged cation-water clusters. Finally, this indicates that cation identity and charge-site location in the cluster can produce discernible spectral differences for clusters in this size range.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗