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 325 records · Page 18
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Structural inference of networked dynamical systems with universal differential equations

Networked dynamical systems are common throughout science in engineering; e.g., biological networks, reaction networks, power systems, and the like. For many such systems, nonlinearity drives populations of identical (or near-identical) units to exhibit a wide range of nontrivial behaviors, such as the emergence of coherent structures (e.g., waves and patterns) or otherwise notable dynamics (e.g., synchrony and chaos). Here, we seek to infer (i) the intrinsic physics of a base unit of a population, (ii) the underlying graphical structure shared between units, and (iii) the coupling physics of a given networked dynamical system given observations of nodal states. These tasks are formulated around the notion of the Universal Differential Equation, whereby unknown dynamical systems can be approximated with neural networks, mathematical terms known a priori (albeit with unknown parameterizations), or combinations of the two. We demonstrate the value of these inference tasks by investigating not only future state predictions but also the inference of system behavior on varied network topologies. The effectiveness and utility of these methods are shown with their application to canonical networked nonlinear coupled oscillators.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Allosteric prediction via convolutional neural networks and protein structural and dynamical features

Allostery is the phenomenon whereby a binding event or covalent modification at one site in a protein modulates function at a distal site, thus changing a protein’s functional state. As such, it is a ubiquitous aspect of protein functional regulation. Computationally predicting allosteric states is important as part of the broader challenge of functional annotation, but it also has practical implications for drug development, as targeting an allosteric site often affords greater specificity compared with targeting an orthosteric site. This study introduces a machine learning approach to predict the allosteric functional state using the small G-protein KRas as the model system, due to its implication in many types of cancer and being well studied as a result with many x-ray crystallographic structures of KRas available with different mutations and ligands bound. Using structural and dynamical features that can be cast as images, namely interatomic distances, contact maps, covariance, and mutual information, supervised learning was performed using convolutional neural networks. Two pretrained convolutional neural network architectures, GoogLeNet and ResNet18, were fine-tuned to classify KRas into active or inactive states based on these features. Across training regimes, atomic contact maps emerged as the most effective structural feature, whereas linearized mutual information outperformed covariance in capturing dynamical correlations relevant to allostery. Models achieved significant validation accuracy, with atomic contact maps yielding up to 90% accuracy. In conclusion, the findings suggest that integrating global structural rearrangements and correlated motion patterns with deep learning can reliably predict protein allosteric states, offering a promising framework for understanding allosteric regulation and developing targeted therapeutics.

Rajeshwar T., Rajitha [Oak Ridge National Laborato↗
DOE OSTI2022

Pose Classification Using Three-Dimensional Atomic Structure-Based Neural Networks Applied to Ion Channel–Ligand Docking

The identification of promising lead compounds showing pharmacological activities toward a biological target is essential in early stage drug discovery. With the recent increase in available small-molecule databases, virtual high-throughput screening using physics-based molecular docking has emerged as an essential tool in assisting fast and cost-efficient lead discovery and optimization. However, the best scored docking poses are often suboptimal, resulting in incorrect screening and chemical property calculation. We address the pose classification problem by leveraging data-driven machine learning approaches to identify correct docking poses from AutoDock Vina and Glide screens. To enable effective classification of docking poses, we present two convolutional neural network approaches: a three-dimensional convolutional neural network (3D-CNN) and an attention-based point cloud network (PCN) trained on the PDBbind refined set. We demonstrate the effectiveness of our proposed classifiers on multiple evaluation data sets including the standard PDBbind CASF-2016 benchmark data set and various compound libraries with structurally different protein targets including an ion channel data set extracted from Protein Data Bank (PDB) and an in-house KCa3.1 inhibitor data set. Our experiments show that excluding false positive docking poses using the proposed classifiers improves virtual high-throughput screening to identify novel molecules against each target protein compared to the initial screen based on the docking scores.

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

De novo design of protein structure and function with RFdiffusion

Abstract There has been considerable recent progress in designing new proteins using deep-learning methods 1–9 . Despite this progress, a general deep-learning framework for protein design that enables solution of a wide range of design challenges, including de novo binder design and design of higher-order symmetric architectures, has yet to be described. Diffusion models 10,11 have had considerable success in image and language generative modelling but limited success when applied to protein modelling, probably due to the complexity of protein backbone geometry and sequence–structure relationships. Here we show that by fine-tuning the RoseTTAFold structure prediction network on protein structure denoising tasks, we obtain a generative model of protein backbones that achieves outstanding performance on unconditional and topology-constrained protein monomer design, protein binder design, symmetric oligomer design, enzyme active site scaffolding and symmetric motif scaffolding for therapeutic and metal-binding protein design. We demonstrate the power and generality of the method, called RoseTTAFold diffusion (RFdiffusion), by experimentally characterizing the structures and functions of hundreds of designed symmetric assemblies, metal-binding proteins and protein binders. The accuracy of RFdiffusion is confirmed by the cryogenic electron microscopy structure of a designed binder in complex with influenza haemagglutinin that is nearly identical to the design model. In a manner analogous to networks that produce images from user-specified inputs, RFdiffusion enables the design of diverse functional proteins from simple molecular specifications.

Science & Technology - Other Topics↗
DOE OSTI2021

Functional traits driving species role in the structure of terrestrial vertebrate scavenger networks

Abstract Species assemblages often have a non‐random nested organization, which in vertebrate scavenger (carrion‐consuming) assemblages is thought to be driven by facilitation in competitive environments. However, not all scavenger species play the same role in maintaining assemblage structure, as some species are obligate scavengers (i.e., vultures) and others are facultative, scavenging opportunistically. We used a database with 177 vertebrate scavenger species from 53 assemblages in 22 countries across five continents to identify which functional traits of scavenger species are key to maintaining the scavenging network structure. We used network analyses to relate ten traits hypothesized to affect assemblage structure with the “role” of each species in the scavenging assemblage in which it appeared. We characterized the role of a species in terms of both the proportion of monitored carcasses on which that species scavenged, or scavenging breadth (i.e., the species “normalized degree”), and the role of that species in the nested structure of the assemblage (i.e., the species “paired nested degree”), therefore identifying possible facilitative interactions among species. We found that species with high olfactory acuity, social foragers, and obligate scavengers had the widest scavenging breadth. We also found that social foragers had a large paired nested degree in scavenger assemblages, probably because their presence is easier to detect by other species to signal carcass occurrence. Our study highlights differences in the functional roles of scavenger species and can be used to identify key species for targeted conservation to maintain the ecological function of scavenger assemblages.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2020

SympNets: Intrinsic structure-preserving symplectic networks for identifying Hamiltonian systems

Here, we propose new symplectic networks (SympNets) for identifying Hamiltonian systems from data based on a composition of linear, activation and gradient modules. In particular, we define two classes of SympNets: the LA-SympNets composed of linear and activation modules, and the G-SympNets composed of gradient modules. Correspondingly, we prove two new universal approximation theorems that demonstrate that SympNets can approximate arbitrary symplectic maps based on appropriate activation functions. We then perform several experiments including the pendulum, double pendulum and three-body problems to investigate the expressivity and the generalization ability of SympNets. The simulation results show that even very small size SympNets can generalize well, and are able to handle both separable and non-separable Hamiltonian systems with data points resulting from short or long time steps. In all the test cases, SympNets outperform the baseline models, and are much faster in training and prediction. We also develop an extended version of SympNets to learn the dynamics from irregularly sampled data. This extended version of SympNets can be thought of as a universal model representing the solution to an arbitrary Hamiltonian system.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Code Demonstration: Approximation of nearly-periodic symplectic maps via structure-preserving neural networks

In this notebook, we use the symplectic gyroceptron architecture from [Duruisseaux et al., 2022] to learn a surrogate map for the nearly-periodic symplectic flow map associated to a nearly-periodic Hamiltonian system composed of two nonlinearly coupled oscillators, where one of them oscillates significantly faster than the other: $\Big\lbrace$ $ {\dot{q}_1 = p_1 \hspace{5mm} \dot{p}_1 = -q_1 - \epsilon \partial_{q1}U(q_1 , q_2 )} \atop {\dot{q}_2 = \epsilon p_2 \hspace{4mm} \dot{p}_2 = -\epsilon q_2 - \epsilon \partial_{q2}U(q_1 , q_2 )}$. These equations of motion are the Hamilton's equations associated to the Hamiltonian $H_{\epsilon}(q_1,q_2,p_1,p_2)=\frac{1}{2}(q^2_1+p^2_1)+\frac{1}{2}\epsilon(q^2_2+p^2_2)+\epsilon$$U(q_1,q_2)$.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1996

Modular, Hierarchical Learning By Artificial Neural Networks

Modular and hierarchical approach to supervised learning by artificial neural networks leads to neural networks more structured than neural networks in which all neurons fully interconnected. These networks utilize general feedforward flow of information and sparse recurrent connections to achieve dynamical effects. The modular organization, sparsity of modular units and connections, and fact that learning is much more circumscribed are all attractive features for designing neural-network hardware. Learning streamlined by imitating some aspects of biological neural networks.

Baldi, Pierre F.↗
NASA NTRSDate not supplied

Sampling Functions from Gaussian Processes and Structured Covariance Gaussian Networks

When learning aerodynamic models from data, it is critical to incorporate estimates of model uncertainty. This motivates the design of probabilistic aerodynamic databases which can be sampled to generate physically and statistically plausible aerodynamic models. In this talk we discuss how to sample deterministic functions from two different kinds of probabilistic models and demonstrate their use. First, Gaussian Process Regressors (GPRs) are a widely used probabilistic kernel-based model which can be thought of as Gaussian distributions over functions. GPRs are generally trained by maximizing the marginal likelihood of seeing the training data over the kernel parameter space. Sample functions are easily generated by drawing points from the Gaussian distribution at desired input points. However, when the points are not known ahead of time, the classical sampling approach is not possible since successive function samples will generate different function realizations. We present an approach for sampling consistent function evaluations from a GPR over multiple samples. Second, we describe a neural network architecture which learns a conditional Gaussian distribution by maximizing the marginal likelihood at each point in the input space. We then discuss and compare several options for generating sample functions which match this distribution. Finally, we demonstrate the use of these probabilistic aerodynamic models in an atmospheric reentry simulation.

Gaussian process regression↗
DOE OSTI2024

Spike-and-Slab Shrinkage Priors for Structurally Sparse Bayesian Neural Networks

Network complexity and computational efficiency have become increasingly significant aspects of deep learning. Sparse deep learning addresses these challenges by recovering a sparse representation of the underlying target function by reducing heavily overparameterized deep neural networks. Specifically, deep neural architectures compressed via structured sparsity (e.g., node sparsity) provide low-latency inference, higher data throughput, and reduced energy consumption. In this article, we explore two well-established shrinkage techniques, Lasso and Horseshoe, for model compression in Bayesian neural networks (BNNs). To this end, we propose structurally sparse BNNs, which systematically prune excessive nodes with the following: 1) spike-and-slab group Lasso (SS-GL) and 2) SS group Horseshoe (SS-GHS) priors, and develop computationally tractable variational inference, including continuous relaxation of Bernoulli variables. We establish the contraction rates of the variational posterior of our proposed models as a function of the network topology, layerwise node cardinalities, and bounds on the network weights. Furthermore, we empirically demonstrate the competitive performance of our models compared with the baseline models in prediction accuracy, model compression, and inference latency.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Evaluating disease surveillance strategies for early outbreak detection in contact networks with varying community structure

Disease surveillance systems allow public health agencies to respond to emerging diseases before they become widespread. Developing such systems requires identifying optimal ways to monitor in the context of an epidemic outbreak; this problem is known as sensor selection. Contact networks represent the dynamics of interaction in a population and are used to model how a disease spreads in a population and to explore strategies of sensor selection. We evaluated five sensor selection strategies on their ability to provide an early warning of a COVID-like outbreak in synthetic contact networks encapsulated in four network scenarios. Three of these scenarios assessed different aspects of community structure. The fourth scenario employed a contact network representing the population and interactions of 6.8 million people in New York City, constructed from an agent-based simulation using census and transportation data. This scenario exemplifies how sensor selection strategies may perform in a real-world, urban context. Our findings suggest that the choice of the optimal strategy depends heavily on the community structure of the network. Strategies that select highly connected nodes or maximize network coverage are the optimal surveillance strategy for outbreak detection in many network community structures. However, a naive implementation of these strategies may fail to provide an early warning at all—including in the New York City scenario. Moreover, these methods are impractical for real-world use as they require knowledge of the underlying contact network. Instead, a selection strategy that starts with a set of random nodes and then performs a random walk through a chain of neighbors reliably provides early warnings without requiring prior knowledge of the network. We find this method, called “random chain”, to be the most pragmatic for implementation in a real-world disease surveillance context.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2020

Anomalous Anisotropic Nanoparticle Aggregation in Cu 2 (OH) 3 Br Gels

Aerogels are of interest for their ability to uniformly incorporate nanoscale features into macroscopic assemblies, which enabled applications that require low density, high surface area, and/or bicontinuous networks. The structure of the nanoporous network is intrinsically linked to the macroscopic properties of aerogels. Hence, control of this structure is of paramount importance. Small-angle X-ray scattering (SAXS) is used here to monitor nanoparticle aggregation in situ in Cu 2 (OH) 3 Br aerogels formed via epoxide-assisted gelation. Anomalous anisotropic aggregation is observed in the absence of templating agents and is attributed to the molecular structure of the inorganic nanoparticles themselves. This is a fundamental departure from the models currently used to describe traditional inorganic sol–gel chemistry where nanoparticles are believed to undergo isotropic diffusion- and/or kinetically limited aggregation. Time-resolved SAXS indicates that Cu 2 (OH) 3 Br nanoparticles nucleate rapidly from solution to form unbranched chain-like aggregates rather than branched mass-fractal aggregates. Sizes of primary particles (~1.5 nm) and the chain-like structure of their aggregates are independent of particle concentration (gel density), while rates of particle aggregation, gelation time, and aggregate size are strongly dependent upon particle concentration, which implies that the chemistry of particle formation and the physics of particle aggregation are independent processes. Because the conditions necessary for creating anisotropic structures are not unique to Cu 2 (OH) 3 Br, these results could provide insight into the structure and gelation mechanisms of other inorganic aerogels.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRS2003

Tensegrity I. Cell structure and hierarchical systems biology

In 1993, a Commentary in this journal described how a simple mechanical model of cell structure based on tensegrity architecture can help to explain how cell shape, movement and cytoskeletal mechanics are controlled, as well as how cells sense and respond to mechanical forces (J. Cell Sci. 104, 613-627). The cellular tensegrity model can now be revisited and placed in context of new advances in our understanding of cell structure, biological networks and mechanoregulation that have been made over the past decade. Recent work provides strong evidence to support the use of tensegrity by cells, and mathematical formulations of the model predict many aspects of cell behavior. In addition, development of the tensegrity theory and its translation into mathematical terms are beginning to allow us to define the relationship between mechanics and biochemistry at the molecular level and to attack the larger problem of biological complexity. Part I of this two-part article covers the evidence for cellular tensegrity at the molecular level and describes how this building system may provide a structural basis for the hierarchical organization of living systems--from molecule to organism. Part II, which focuses on how these structural networks influence information processing networks, appears in the next issue.

NASA Program Fundamental Space Biology↗
NASA NTRS1972

Satellite networks for education.

Consideration of satellite-based educational networking. The characteristics and structure of networks are reviewed, and pressures within the educational establishment that are providing motivation for various types of networks are discussed. A number of studies are cited in which networking needs for educational sectors and services are defined. The current status of educational networking for educational radio and television, instructional television fixed services, inter- and intrastate educational communication networks, computer networks, cable television for education, and continuing and proposed educational experiments using NASA's Applications Technology Satellites is reviewed. Possible satellite-based educational telecommunication services and three alternatives for implementing educational satellite systems are described. Some remarks are made concerning public policy aspects of future educational satellite system development.

Singh, J. P.↗
NASA NTRS1990

Fiber optic smart structures and skins II; Proceedings of the Meeting, Boston, MA, Sept. 5-8, 1989

The present conference on embedded fiber-optics incorporating 'smart' structural systems and structural surfaces discusses topics in the nature and current status of university- and government-sponsored smart-structure development programs, manufacturing and cure-monitoring for composite smart structures, smart-structure damage assessment, smart-structure actuators, and smart-structure sensors and components. Attention is given to fiber-optic sensor selection, the optical properties of curing epoxies, the automated production of smart structures, damage-detection in composites with embedded fiber-optic interferometers, fiber-optic strain and impact sensors, dynamically-tunable smart composites, smart structures incorporating artificial neural networks, active structural acoustic control with smart structures, and fiber-optic shape sensing for flexible structures.

Udd, Eric↗
NASA NTRS2004

Selected Flight Test Results for Online Learning Neural Network-Based Flight Control System

The NASA F-15 Intelligent Flight Control System project team has developed a series of flight control concepts designed to demonstrate the benefits of a neural network-based adaptive controller. The objective of the team is to develop and flight-test control systems that use neural network technology to optimize the performance of the aircraft under nominal conditions as well as stabilize the aircraft under failure conditions. Failure conditions include locked or failed control surfaces as well as unforeseen damage that might occur to the aircraft in flight. This report presents flight-test results for an adaptive controller using stability and control derivative values from an online learning neural network. A dynamic cell structure neural network is used in conjunction with a real-time parameter identification algorithm to estimate aerodynamic stability and control derivative increments to the baseline aerodynamic derivatives in flight. This set of open-loop flight tests was performed in preparation for a future phase of flights in which the learning neural network and parameter identification algorithm output would provide the flight controller with aerodynamic stability and control derivative updates in near real time. Two flight maneuvers are analyzed a pitch frequency sweep and an automated flight-test maneuver designed to optimally excite the parameter identification algorithm in all axes. Frequency responses generated from flight data are compared to those obtained from nonlinear simulation runs. An examination of flight data shows that addition of the flight-identified aerodynamic derivative increments into the simulation improved the pitch handling qualities of the aircraft.

Williams, Peggy S.↗