Search NASA⌕ Search

SEARCH · Search NASA

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 613 records · Page 34

Networks of silicon nanowires: A large-scale atomistic electronic structure analysis

Networks of silicon nanowires possess intriguing electronic properties surpassing the predictions based on quantum confinement of individual nanowires. Employing large-scale atomistic pseudopotential computations, as yet unexplored branched nanostructures are investigated in the subsystem level as well as in full assembly. The end product is a simple but versatile expression for the bandgap and band edge alignments of multiply-crossing Si nanowires for various diameters, number of crossings, and wire orientations. Further progress along this line can potentially topple the bottom-up approach for Si nanowire networks to a top-down design by starting with functionality and leading to an enabling structure.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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

A continuous-time dynamical system with parameter ε is nearly-periodic if all its trajectories are periodic with nowhere-vanishing angular frequency as ε approaches 0. Nearly-periodic maps are discrete-time analogues of nearly-periodic systems, defined as parameter-dependent diffeomorphisms that limit to rotations along a circle action, and they admit formal U(1) symmetries to all orders when the limiting rotation is non-resonant. For Hamiltonian nearly-periodic maps on exact presymplectic manifolds, the formal U(1) symmetry gives rise to a discrete-time adiabatic invariant. In this paper, we construct a novel structure-preserving neural network to approximate nearly-periodic symplectic maps. This neural network architecture, which we call symplectic gyroceptron, ensures that the resulting surrogate map is nearly-periodic and symplectic, and that it gives rise to a discrete-time adiabatic invariant and a long-time stability. This new structure-preserving neural network provides a promising architecture for surrogate modeling of non-dissipative dynamical systems that automatically steps over short timescales without introducing spurious instabilities.

97 MATHEMATICS AND COMPUTING↗

Synthesis and Structural Characterization of Magnesium Based Coordination Networks in Different Solvents

Three magnesium based metal-organic frameworks, Mg{sub 3}(3,5-PDC){sub 3}(DMF){sub 3} {center_dot} DMF [1], Mg(3,5-PDC)(H{sub 2}O) {center_dot} (H{sub 2}O) [3], and Mg4(3,5-PDC)4(DMF){sub 2}(H{sub 2}O){sub 2} {center_dot} 2DMF {center_dot} 4.5H{sub 2}O [4], and a 2-D coordination polymer, [Mg(3,5-PDC)(H{sub 2}O){sub 2}] [2] [PDC = pyridinedicarboxylate], were synthesized using a combination of DMF, methanol, ethanol, and water. Compound 1 [space group P2{sub 1}/n, a = 12.3475(5) {angstrom}, b = 11.1929(5) {angstrom}, c = 28.6734(12) {angstrom}, {beta} = 98.8160(10){sup o}, V = 3916.0(3) {angstrom}{sup 3}] consists of a combination of isolated and corner-sharing magnesium octahedra connected by the organic linkers to form a 3-D network with a 12.2 {angstrom} x 4.6 {angstrom} 1-D channel. The channel contains coordinated and free DMF molecules. In compound 2 [space group C2/c, a = 9.964(5) {angstrom}, b = 12.0694(6) {angstrom}, c = 7.2763(4) {angstrom}, {beta} = 106.4970(6){sup o}, V = 836.70(6) {angstrom}{sup 3}], PDC connects isolated seven coordinated magnesium polyhedra into a layered structure. Compound 3 [space group P6{sub 1}22, a = 11.479(1) {angstrom}, c = 14.735(3) {angstrom}, V = 1681.7(4) {angstrom}{sup 3}] (previously reported) contains isolated magnesium octahedra connected by the organic linker with each other forming a 3D network. Compound 4 [space group P2{sub 1}/c, a = 13.7442(14) {angstrom}, b = 14.2887(15) {angstrom}, c = 14.1178(14) {angstrom}, {beta} = 104.912(2){sup o}, V = 2679.2(5) {angstrom}{sup 3}] also exhibits a 3D network based on isolated magnesium octahedra with square cavities containing both disordered DMF and water molecules. The structural topologies originate due to the variable coordination ability of solvent molecules with the metal center. Water molecules coordinate with the magnesium metal centers preferably over other polar solvents (DMF, methanol, ethanol) used to synthesize the coordination networks. Despite testing multiple desolvation routes, we were unable to measure BET surface areas greater than 51.9 m{sup 2}/g for compound 1.

Banerjee, Debasis↗

Collective network for computer structures

A system and method for enabling high-speed, low-latency global collective communications among interconnected processing nodes. The global collective network optimally enables collective reduction operations to be performed during parallel algorithm operations executing in a computer structure having a plurality of the interconnected processing nodes. Router devices are included that interconnect the nodes of the network via links to facilitate performance of low-latency global processing operations at nodes of the virtual network. The global collective network may be configured to provide global barrier and interrupt functionality in asynchronous or synchronized manner. When implemented in a massively-parallel supercomputing structure, the global collective network is physically and logically partitionable according to the needs of a processing algorithm.

97 MATHEMATICS AND COMPUTING↗

Synthesis, structure and optical properties of two isotypic crystals, Na{sub 3}MO{sub 4}Cl (M=W, Mo)

Two isotypic compounds, Na{sub 3}MO{sub 4}Cl (M = W, Mo) have been obtained from the high temperature solution, and their structures were determined by single-crystal X-ray diffraction. Both of them crystallize in the space group P4/nmm of tetragonal system with the unit cells: a=7.5181(15), c=5.360(2) for Na{sub 3}WO{sub 4}Cl and a=7.4942(12), c=5.3409(18) for Na{sub 3}MoO{sub 4}Cl. The structure exhibits a 3D network built up by the ClNa{sub 6} groups, and the MO{sub 4} groups reside in the tunnels of the 3D network. The structural similarities and differences between Na{sub 3}MO{sub 4}Cl (M=W, Mo) and Sr{sub 3}MO{sub 4}F (M=Al, Ga) have been discussed. Meanwhile, detailed structure comparison analyses between Na{sub 3}MO{sub 4}Cl (M=W, Mo) and Na{sub 3}MO{sub 4}F (M=W, Mo) indicate that the different connection modes of ClNa{sub 6} and FNa{sub 6} make Na{sub 3}MO{sub 4}Cl and Na{sub 3}MO{sub 4}F crystallize in different structures. The IR spectra were used to verify the validity of the structure. The diffuse reflectance spectra show that the UV absorption edges are about 249 nm (4.99 eV) and 265 nm (4.69 eV) for Na{sub 3}WO{sub 4}Cl and Na{sub 3}MoO{sub 4}Cl, respectively. In addition, the first-principles theoretical studies are also carried out to aid the understanding of electronic structures and linear optical properties. - Graphical abstract: Two isotypic compounds, Na{sub 3}MO{sub 4}Cl (M=W, Mo) have been obtained from the high temperature solution. Both of them crystallize in the space group P4/nmm of tetragonal system. The structure exhibits a 3D network built up by the ClNa{sub 6} groups, and the MO{sub 4} groups reside in the tunnels of the 3D network. - Highlights: • Structure and properties of Na{sub 3}MO{sub 4}Cl (M=W, Mo) are reported for the first time. • They show a 3D network built by ClNa{sub 6}, and WO{sub 4} lies in the tunnels of the network. • IR spectra were used to verify the validity of the structure. • Band structures and density of states have been calculated.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

The Graph Laplacian and the Dynamics of Complex Networks [Slides]

In this talk, we explore the structure of networks from a spectral graph-theoretic perspective by analyzing the properties of the Laplacian matrix associated with the graph induced by a network. We will see how the eigenvalues of the graph Laplacian relate to the underlying network structure and dynamics and provides insight into a phenomenon frequently observed in real world networks - the emergence of collective behavior from purely local interactions seen in the coordinated motion of animals and phase transitions in biological networks, to name a few.

97 MATHEMATICS AND COMPUTING↗

Structure-preserving neural networks for the regularized entropy-based closure of a linear, kinetic, radiative transport equation

The main challenge of large-scale numerical simulation of radiation transport is the high memory and computation time requirements of discretization methods for kinetic equations. In this work, we derive and investigate a neural network-based approximation to the entropy-based closure method to accurately compute the solution of the multi-dimensional moment system with a low memory footprint and competitive computational time. We extend methods developed for the standard entropy-based closure to the regularized entropy-based closures. The main idea is to interpret structure-preserving neural network approximations of the regularized entropy-based closure as a two-stage approximation to the original entropy-based closure. We conduct a numerical analysis of this approximation and investigate optimal parameter choices. Our numerical experiments demonstrate that the method has a much lower memory footprint than traditional methods with competitive computation times and simulation accuracy. The code and all trained networks are provided on GitHub.

entropy closure↗

Structured Covariance Gaussian Networks for Orion Crew Module Aerodynamic Uncertainty Quantification

In this paper we propose a new approach for nonlinear regression and uncertainty quantification. The method is based on a pair of neural networks which parameterize mean and dense covariance functions of a multivariate Gaussian process, trained together to maximize the log-likelihood of observing the given data. The covariance matrix is made positive definite at every input by construction. We also propose a sampling approach that produces viable surrogate function realizations from the Gaussian process. We call the proposed model a Structured Covariance Gaussian Network (SCGN). We illustrate the use of SCGNs for learning an aerodynamic response surface with built-in uncertainty for the Orion crew module. We find that SCGN provides an efficient and systematic way to learn nonlinear functional relationships and dense covariances. We compare results to a baseline Gaussian process regressor and observe that the SCGN provides comparable uncertainty descriptions with improved scalability to dataset size. The sample functions generated by SCGN are fast to evaluate online and are therefore convenient for use in trajectory simulations. These results suggest that SCGN may be a viable computational method for aerodynamic uncertainty quantification.

machine learning↗

Structured Covariance Gaussian Networks for Orion Crew Module Aerodynamic Uncertainty Quantification

In this paper we propose a new approach for nonlinear regression and uncertainty quantification. The method is based on a pair of neural networks which parameterize mean and dense covariance functions of a multivariate Gaussian process, trained together to maximize the log-likelihood of observing the given data. The covariance matrix is made positive definite at every input by construction. We also propose a sampling approach that produces viable surrogate function realizations from the Gaussian process. We call the proposed model a Structured Covariance Gaussian Network (SCGN). We illustrate the use of SCGNs for learning an aerodynamic response surface with built-in uncertainty for the Orion crew module. We find that SCGN provides an efficient and systematic way to learn nonlinear functional relationships and dense covariances. We compare results to a baseline Gaussian process regressor and observe that the SCGN provides comparable uncertainty descriptions with improved scalability to dataset size. The sample functions generated by SCGN are fast to evaluate online and are therefore convenient for use in trajectory simulations. These results suggest that SCGN may be a viable computational method for aerodynamic uncertainty quantification.

machine learning↗

Identifying the Critical Links in Road Transportation Networks: Centrality-based approach utilizing structural properties

Surface transportation road networks share structural properties similar to other complex networks (e.g., social networks, information networks, biological networks, and so on). This research investigates the structural properties of road networks for any possible correlation with the traffic characteristics such as link flows those determined independently. Additionally, we define a criticality index for the links of the road network that identifies the relative importance in the network. We tested our hypotheses with two sample road networks. Results show that, correlation exists between the link flows and centrality measures of a link of the road (dual graph approach is followed) and the criticality index is found to be effective for one test network to identify the vulnerable nodes.

99 GENERAL AND MISCELLANEOUS↗

Hierarchical, rotation‐equivariant neural networks to select structural models of protein complexes

Abstract Predicting the structure of multi‐protein complexes is a grand challenge in biochemistry, with major implications for basic science and drug discovery. Computational structure prediction methods generally leverage predefined structural features to distinguish accurate structural models from less accurate ones. This raises the question of whether it is possible to learn characteristics of accurate models directly from atomic coordinates of protein complexes, with no prior assumptions. Here we introduce a machine learning method that learns directly from the 3D positions of all atoms to identify accurate models of protein complexes, without using any precomputed physics‐inspired or statistical terms. Our neural network architecture combines multiple ingredients that together enable end‐to‐end learning from molecular structures containing tens of thousands of atoms: a point‐based representation of atoms, equivariance with respect to rotation and translation, local convolutions, and hierarchical subsampling operations. When used in combination with previously developed scoring functions, our network substantially improves the identification of accurate structural models among a large set of possible models. Our network can also be used to predict the accuracy of a given structural model in absolute terms. The architecture we present is readily applicable to other tasks involving learning on 3D structures of large atomic systems.

Eismann, Stephan↗

Effect of Ligand Structural Isomerism in Formation of Calcium Coordination Networks

Using different structural isomers (2,5-; 2,4-; 2;6-; 3,4-; 3,5-) of pyridinedicarboxylic acid, nine calcium-based coordination networks were synthesized under hydro-/solvothermal conditions and/or were produced via solvent recrystallization of previously synthesized compounds. The coordination networks reported were characterized using single crystal X-ray diffraction and thermal methods. They show diverse structural topologies, depending on the ligand geometry and coordinated solvent molecules, with inorganic connectivity motifs ranging from isolated octahedra to infinite chains, layer and a three-dimensional dense framework. The as-synthesized and desolvated networks further show structural transformation to hydrated phases through dissolution/reformation pathways. The process is likely driven by the high hydration energy of the calcium metal center.

36 MATERIALS SCIENCE↗

Structures of neural network effective theories

We develop a diagrammatic approach to effective field theories (EFTs) corresponding to deep neural networks at initialization, which dramatically simplifies computations of finite-width corrections to neuron statistics. The structures of EFT calculations make it transparent that a single condition governs criticality of all connected correlators of neuron preactivations. Understanding of such EFTs may facilitate progress in both deep learning and field theory simulations. Published by the American Physical Society 2024

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Actuator tuning for nonlinear truss structures - A neural network approach

The optimal actuator placement problem encompasses finding their best locations and best gains. The latter is referred to as tuning the actuators. This paper deals with tuning a given set of actuators in presence of known structural nonlinearities arising from gaps at some joints. For this purpose, an efficient neural network-based algorithm is proposed and illustrated using numerical simulations.

Toomarian, N.↗

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↗

Algorithms and data structures to accelerate network analysis

As the sheer amount of computer generated data continues to grow exponentially, new bottlenecks are unveiled that require rethinking our traditional software and hardware architectures. Here in this paper we present five algorithms and data structures (long queue emulation, lockless bimodal queues, tail early dropping, LFN tables, and multiresolution priority queues) designed to optimize the process of analyzing network traffic. We integrated these optimizations on R-Scope, a high performance network appliance that runs the Bro network analyzer, and present benchmarks showcasing performance speed ups of 5X at traffic rates of 10 Gbps.

97 MATHEMATICS AND COMPUTING↗

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↗