Formation of a chromospheric network and structure of the magnetic field obrazovaniye khromosfernoy setki i struktura magnitnogo polya
Explore the source record for details and available documents.
Pikelner, S. B.↗
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.
BUTTER-E - Energy Consumption Data for the BUTTER Empirical Deep Learning Dataset
The BUTTER-E - Energy Consumption Data for the BUTTER Empirical Deep Learning Dataset adds node-level energy consumption data from watt-meters to the primary sweep of the BUTTER - Empirical Deep Learning Dataset. This dataset contains energy consumption and performance data from 63,527 individual experimental runs spanning 30,582 distinct configurations: 13 datasets, 20 sizes (number of trainable parameters), 8 network "shapes", and 14 depths on both CPU and GPU hardware collected using node-level watt-meters. This dataset reveals the complex relationship between dataset size, network structure, and energy use, and highlights the impact of cache effects. BUTTER-E is intended to be joined with the BUTTER dataset (see "BUTTER - Empirical Deep Learning Dataset on OEDI" resource below) which characterizes the performance of 483k distinct fully connected neural networks but does not include energy measurements.
Array↗
RAMP - A fault tolerant distributed microcomputer structure for aircraft navigation and control
Design methodologies for realizing future high authority autoflight control systems are being investigated, taking into account also the study of distributed microcomputer architectures. Attention is given to the redundant asynchronous microprocessor (RAMP) structure. RAMP comprises a connected network of microcomputers which has as input command and sensor information, and which generates servo information to drive actuators, and thrust linkages. Tolerance to hardware failures is achieved by static redundancy. Results of a failed microcomputer are simply rejected. This is done in lieu of dynamic redundancy wherein the distributed computer system performs real time fault detection and reconfiguration of the system. Attention is given to the RAMP network structure and operation, flight control with parallel asynchronous computers, and intermittent fault tolerance.
Dunn, W. R.↗
Experiments on neural network architectures for fuzzy logic
The use of fuzzy logic to model and manage uncertainty in a rule-based system places high computational demands on an inference engine. In an earlier paper, the authors introduced a trainable neural network structure for fuzzy logic. These networks can learn and extrapolate complex relationships between possibility distributions for the antecedents and consequents in the rules. Here, the power of these networks is further explored. The insensitivity of the output to noisy input distributions (which are likely if the clauses are generated from real data) is demonstrated as well as the ability of the networks to internalize multiple conjunctive clause and disjunctive clause rules. Since different rules with the same variables can be encoded in a single network, this approach to fuzzy logic inference provides a natural mechanism for rule conflict resolution.
Keller, James M.↗
Protein conformational switch discerned via network centrality properties
Network analysis has emerged as a powerful tool for examining structural biology systems. The spatial organization of the components of a biomolecular structure has been rendered as a graph representation and analyses have been performed to deduce the biophysical and mechanistic properties of these components. For proteins, the analysis of protein structure networks (PSNs), especially via network centrality measurements and cluster coefficients, has led to identifying amino acid residues that play key functional roles and classifying amino acid residues in general. Whether these network properties examined in various studies are sensitive to subtle (yet biologically significant) conformational changes remained to be addressed. Here, we focused on four types of network centrality properties (betweenness, closeness, degree, and eigenvector centralities) for conformational changes upon ligand binding of a sensor protein (constitutive androstane receptor) and an allosteric enzyme (ribonucleotide reductase). We found that eigenvector centrality is sensitive and can distinguish salient structural features between protein conformational states while other centrality measures, especially closeness centrality, are less sensitive and rather generic with respect to the structural specificity. We also demonstrated that an ensembleinformed, modified PSN with static edges removed (which we term PSN*) has enhanced sensitivity at discerning structural changes.
59 BASIC BIOLOGICAL SCIENCES↗
Nonlinear thermodynamic computing out of equilibrium
We present the design for a thermodynamic computer that can perform arbitrary nonlinear calculations in or out of equilibrium. Simple thermodynamic circuits, fluctuating degrees of freedom in contact with a thermal bath and confined by a quartic potential, display an activity that is a nonlinear function of their input. Such circuits can therefore be regarded as thermodynamic neurons, and can serve as the building blocks of networked structures that act as thermodynamic neural networks, universal function approximators whose operation is powered by thermal fluctuations. We simulate a digital model of a thermodynamic neural network, and show that its parameters can be adjusted by genetic algorithm to perform nonlinear calculations at specified observation times, regardless of whether the system has attained thermal equilibrium. This work expands the field of thermodynamic computing beyond the regime of thermal equilibrium, enabling fully nonlinear computations, analogous to those performed by classical neural networks, at specified observation times.
Whitelam, Stephen [Lawrence Berkeley National Labo↗
RivGraph: Automatic extraction and analysis of river and delta channel network topology
River networks sustain life and landscapes by carrying and distributing water, sediment, and nutrients throughout ecosystems and communities. At the largest scale, river networks drain continents through tree-like tributary networks. At typically smaller scales, river deltas and braided rivers form loopy, complex distributary river networks via avulsions and bifurcations.In order to model flows through these networks or analyze network structure, the topology, or connectivity, of the network must be resolved. Additionally, morphologic properties of each river channel as well as the direction of flow through the channel inform how fluxes travel through the network’s channels. Riv Graphis a Python package that automates the extraction and characterization of river channel networks from a user-provided binary image, or mask, of a channel network (Fig. 1). Masks may be derived from (typically remotely-sensed) imagery, simulations, or even hand-drawn. RivGraph will create explicit representations of the channel network by resolving river centerlines as links, and junctions as nodes. Flow directions are solved for each link of the network without using auxiliary data, e.g., a digital elevation model (DEM). Morphologic properties are computed as well, including link lengths, widths, sinuosities, branching angles,and braiding indices. If provided,RivGraph will preserve georeferencing information of the mask and will export results as ESRI shapefiles, GeoJSONs, and GeoTIFFs for easy import into GIS software.RivGraph can also return extracted networks as networkx objects for convenient interfacing with the full-featured networkx package (Hagberg et al., 2008). Finally, RivGraph offers a suite of topologic metrics that were specifically designed for river channel network analysis (Tejedor et al., 2015b).
54 ENVIRONMENTAL SCIENCES↗
Model-free distributed learning
Model-free learning for synchronous and asynchronous quasi-static networks is presented. The network weights are continuously perturbed, while the time-varying performance index is measured and correlated with the perturbation signals; the correlation output determines the changes in the weights. The perturbation may be either via noise sources or orthogonal signals. The invariance to detailed network structure mitigates large variability between supposedly identical networks as well as implementation defects. This local, regular, and completely distributed mechanism requires no central control and involves only a few global signals. Thus it allows for integrated on-chip learning in large analog and optical networks.
Dembo, Amir↗
Statistical generic design of glass and optimization: Selective review on oxide glasses
Designing a single glass composition for a multidimensional property space is challenging, and the difficulty increases with the number of design criteria. Traditionally, the task is accomplished using multiple statistical models that describe the relationships between composition (C) and property (P) values, i.e., C-P models. Recently, the structure (S)-property (P) statistical modeling has emerged as a complementary approach. The S-P modeling approach has also been shown to be a preferred method for modeling glass properties, particularly when a small data set is available, such as in single-component studies, or when strong nonlinearities exist between composition and properties. The combined model package, C-S-P, implements the concept of generic glass design, i.e., designing glass for performance by first selecting a specific or optimized set of glass network structural groups using S-P models and then transferring the designed structures (genes) to a particular composition using C-S models. This article reviews a set of supporting cases from the previous C-S-P modeling studies of phosphate, silicate, and borosilicate glasses, which are relevant for many critical commercial applications. The methodology for developing the statistical C-S-P database is presented, enabling the application of P?S?C to achieve a generic glass design and optimization, targeting multiple design criteria for both performance and processing properties simultaneously.
Network structure↗
Effect of penetrant–polymer interactions and shape on the motion of molecular penetrants in dense polymer networks
The diffusion of dilute molecular penetrants within polymers plays a crucial role in the advancement of material engineering for applications such as coatings and membrane separations. The potential of highly cross-linked polymer networks in these applications stems from their capacity to adjust the size and shape selectivity through subtle changes in network structures. In this paper, we use molecular dynamics simulation to understand the role of penetrant shape (aspect ratios) and its interaction with polymer networks on its diffusivity. We characterize both local penetrant hopping and the long-time diffusive motion for penetrants and consider different aspect ratios and penetrant–network interaction strengths at a variety of cross-link densities and temperatures. The shape affects the coupling of penetrant motion to the cross-link density- and temperature-dependent structural relaxation of networks and also affects the way a penetrant experiences the confinement from the network meshes. The attractive interaction between the penetrant and network primarily affects the former since only the system of dilute limit is of present interest. These results offer fundamental insights into the intricate interplay between penetrant characteristics and polymer network properties and also suggest future directions for manipulating polymer design to enhance the separation efficiency.
Chemistry↗
Statistical analysis and degradation pathway modeling of photovoltaic minimodules with varied packaging strategies
Degradation pathway models constructed using network structural equation modeling (netSEM) are used to study degradation modes and pathways active in photovoltaic (PV) system variants in exposure conditions of high humidity and temperature. This data-driven modeling technique enables the exploration of simultaneous pairwise and multiple regression relationships between variables in which several degradation modes are active in specific variants and exposure conditions. Durable and degrading variants are identified from the netSEM degradation mechanisms and pathways, along with potential ways to mitigate these pathways. A combination of domain knowledge and netSEM modeling shows that corrosion is the primary cause of the power loss in these glass/backsheet PV minimodules. We show successful implementation of netSEM to elucidate the relationships between variables in PV systems and predict a specific service lifetime. The results from pairwise relationships and multiple regression show consistency. This work presents a greater opportunity to be expanded to other materials systems.
electrical measurements↗
Mixed Precision Fermi-Operator Expansion on Tensor Cores from a Machine Learning Perspective
Here we present a second-order recursive Fermi-operator expansion scheme using mixed precision floating point operations to perform electronic structure calculations using tensor core units. A performance of over 100 teraFLOPs is achieved for half-precision floating point operations on Nvidia’s A100 tensor core units. The second-order recursive Fermi-operator scheme is formulated in terms of a generalized, differentiable deep neural network structure, which solves the quantum mechanical electronic structure problem. We demonstrate how this network can be accelerated by optimizing the weight and bias values to substantially reduce the number of layers required for convergence. We also show how this machine learning approach can be used to optimize the coefficients of the recursive Fermi-operator expansion to accurately represent the fractional occupation numbers of the electronic states at finite temperatures.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
Multi-resolution partial differential equations preserved learning framework for spatiotemporal dynamics
Traditional data-driven deep learning models often struggle with high training costs, error accumulation, and poor generalizability in complex physical processes. Physics-informed deep learning (PiDL) addresses these challenges by incorporating physical principles into the model. Most PiDL approaches regularize training by embedding governing equations into the loss function, yet this depends heavily on extensive hyperparameter tuning to weigh each loss term. To this end, we propose to leverage physics prior knowledge by “baking” the discretized governing equations into the neural network architecture via the connection between the partial differential equations (PDE) operators and network structures, resulting in a PDE-preserved neural network (PPNN). This method, embedding discretized PDEs through convolutional residual networks in a multi-resolution setting, largely improves the generalizability and long-term prediction accuracy, outperforming conventional black-box models. The effectiveness and merit of the proposed methods have been demonstrated across various spatiotemporal dynamical systems governed by spatiotemporal PDEs, including reaction-diffusion, Burgers’, and Navier-Stokes equations.
97 MATHEMATICS AND COMPUTING↗
SPIKANs: separable physics-informed Kolmogorov–Arnold networks
Physics-Informed Neural Networks (PINNs) have emerged as a promising method for solving partial differential equations (PDEs) in scientific computing. While PINNs typically use multilayer perceptrons (MLPs) as their underlying architecture, recent advancements have explored alternative neural network structures. One such innovation is the Kolmogorov–Arnold Network (KAN), which has demonstrated benefits over traditional MLPs, including faster neural scaling and better interpretability. The application of KANs to physics-informed learning has led to the development of Physics-Informed KANs (PIKANs), enabling the use of KANs to solve PDEs. However, despite their advantages, KANs often suffer from slower training speeds, particularly in higher-dimensional problems where the number of collocation points grows exponentially with the dimensionality of the system. To address this challenge, we introduce Separable Physics-Informed Kolmogorov–Arnold Networks (SPIKANs). This novel architecture applies the principle of separation of variables to PIKANs, decomposing the problem such that each dimension is handled by an individual KAN. This approach drastically reduces the computational complexity of training without sacrificing accuracy, facilitating their application to higher-dimensional PDEs. Through a series of benchmark problems, we demonstrate the effectiveness of SPIKANs, showcasing their superior scalability and performance compared to PIKANs and highlighting their potential for solving complex, high-dimensional PDEs in scientific computing.
Kolmogorov-Arnold networks↗
Data-Driven Learning of Nonautonomous Systems
In this work, we present a numerical framework for recovering unknown nonautonomous dynamical systems with time-dependent inputs. To circumvent the difficulty presented by the nonautonomous nature of the system, our method transforms the solution state into piecewise integration of the system over a discrete set of time instances. The time-dependent inputs are then locally parameterized by using a proper model, for example, polynomial regression, in the pieces determined by the time instances. This transforms the original system into a piecewise parametric system that is locally time invariant. We then design a deep neural network structure to learn the local models. Once the network model is constructed, it can be iteratively used over time to conduct global system prediction. We provide theoretical analysis of our algorithm and present a number of numerical examples to demonstrate the effectiveness of the method.
97 MATHEMATICS AND COMPUTING↗
Adaptive Recovery Model: Designing Systems for Testing Tracing and Vaccination to Support COVID-19 Recovery Planning.
This report documents a new approach to designing disease control policies that allocate scarce testing, contact tracing, and vaccination resources to better control community transmission of COVID19 or similar diseases. The Adaptive Recovery Model (ARM) combines a deterministic compartmental disease model with a stochastic network disease propagation model to enable us to simulate COVID-19 community spread through the lens of two complementary modeling motifs. ARM contact networks are derived from cell-phone location data that have been anonymized and interpreted as individual arrivals to specic public locations. Modeling disease spread over these networks allows us to identify locations within communities conducive to rapid disease spread. ARM applies this model- and data-derived abstractions of community transmission to evaluate the effectiveness of disease control measures including targeted social distancing, contact tracing, testing and vaccination. The architecture of ARM provides a unique capacity to help decision makers understand how best to deploy scarce testing, tracing and vaccination resources to minimize disease-spread potential in a community. This document details the novel mathematical formulations underlying ARM, presents a dynamical stability analysis of the deterministic model components, a sensitivity analysis of control parameters and network structure, and summarizes a process for deriving contact networks from cell-phone location data. An example use case steps through applying ARM to evaluate three targeted social distancing policies using Bernalillo County, New Mexico as an exemplar test locale. This step-by-step analysis demonstrates how ARM can be used to measure the relative performance of competing public health policies. Initial scenario tests of ARM shows that ARMs design focus on resource utilization rather than simple incidence prediction can provide decision makers with additional quantitative guidance for managing ongoing public health emergencies and planning future responses.
29 ENERGY PLANNING, POLICY, AND ECONOMY↗
Data-Driven Learning of Non-Autonomous Systems
We present a numerical framework for recovering unknown non-autonomous dynamical systems with time-dependent inputs. To circumvent the difficulty presented by the non-autonomous nature of the system, our method transforms the solution state into piecewise integration of the system over a discrete set of time instances. The time-dependent inputs are then locally parameterized by using a proper model, for example, polynomial regression, in the pieces determined by the time instances. This transforms the original system into a piecewise parametric system that is locally time invariant. We then design a deep neural network structure to learn the local models. Once the network model is constructed, it can be iteratively used over time to conduct global system prediction. We provide theoretical analysis of our algorithm and present a number of numerical examples to demonstrate the effectiveness of the method.
97 MATHEMATICS AND COMPUTING↗
Minimizing distortion in truss structures -- a Hopfield network solution
Distortions in truss structures can result from random errors in elemental lengths that are typical of a manufacturing process. These distortions may be minimized by an optimal selection of elements from those available for placement between the prescribed nodes -- a combinatorial optimization problem requiring significant investment of computational resource for all but the smallest problems. The present paper describes a formulation in which near-optimal element assignments are obtained as minimum energy, stable states, of an analogous Hopfield neural network. This requires mapping of the optimization problem into an energy function of the appropriate Lyapunov form. The computational architecture is ideally suited to a parallel processor implementation and offers significant savings in computational effort. A numerical implementation of the approach is discussed with reference to planar truss problems.
Fu, B.↗