Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “complex network”

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

Social network structure and the spread of complex contagions from a population genetics perspective

Ideas, behaviors, and opinions spread through social networks. If the probability of spreading to a new individual is a non-linear function of the fraction of the individuals’ affected neighbors, such a spreading process becomes a “complex contagion”. This non-linearity does not typically appear with physically spreading infections, but instead can emerge when the concept that is spreading is subject to game theoretical considerations (e.g. for choices of strategy or behavior) or psychological effects such as social reinforcement and other forms of peer influence (e.g. for ideas, preferences, or opinions). Here we study how the stochastic dynamics of such complex contagions are affected by the underlying network structure. Motivated by simulations of complex contagions on real social networks, we present a framework for analyzing the statistics of contagions with arbitrary non-linear adoption probabilities based on the mathematical tools of population genetics. The central idea is to use an effective lower-dimensional diffusion process to approximate the statistics of the contagion. This leads to a tradeoff between the effects of ”selection” (microscopic tendencies for an idea to spread or die out), random drift, and network structure. Our framework illustrates intuitively several key properties of complex contagions: stronger community structure and network sparsity can significantly enhance the spread, while broad degree distributions dampen the effect of selection compared to random drift. Finally, we show that some structural features can exhibit critical values that demarcate regimes where global contagions become possible for networks of arbitrary size. Our results draw parallels between the competition of genes in a population and memes in a world of minds and ideas. Our tools provide insight into the spread of information, behaviors, and ideas via social influence, and highlight the role of macroscopic network structure in determining their fate.

59 BASIC BIOLOGICAL SCIENCES↗
NASA NTRS2003

Optimal Feedback Control of Thermal Networks

An improved approach to the mathematical modeling of feedback control of thermal networks has been devised. Heretofore software for feedback control of thermal networks has been developed by time-consuming trial-and-error methods that depend on engineers expertise. In contrast, the present approach is a systematic means of developing algorithms for feedback control that is optimal in the sense that it combines performance with low cost of implementation. An additional advantage of the present approach is that a thermal engineer need not be expert in control theory. Thermal networks are lumped-parameter approximations used to represent complex thermal systems. Thermal networks are closely related to electrical networks commonly represented by lumped-parameter circuit diagrams. Like such electrical circuits, thermal networks are mathematically modeled by systems of differential-algebraic equations (DAEs) that is, ordinary differential equations subject to a set of algebraic constraints. In the present approach, emphasis is placed on applications in which thermal networks are subject to constant disturbances and, therefore, integral control action is necessary to obtain steady-state responses. The mathematical development of the present approach begins with the derivation of optimal integral-control laws via minimization of an appropriate cost functional that involves augmented state vectors. Subsequently, classical variational arguments provide optimality conditions in the form of the Hamiltonian equations for the standard linear-quadratic-regulator (LQR) problem. These equations are reduced to an algebraic Riccati equation (ARE) with respect to the augmented state vector. The solution of the ARE leads to the direct computation of the optimal proportional- and integral-feedback control gains. In cases of very complex networks, large numbers of state variables make it difficult to implement optimal controllers in the manner described in the preceding paragraph.

Papalexandris, Miltiadis↗
DOE OSTI2022

The effect of differential mineral shrinkage on crack formation and network geometry

Rock, concrete, and other engineered materials are often composed of several minerals that change volumetrically in response to variations in the moisture content of the local environment. Such differential shrinkage is caused by varying shrinkage rates between mineral compositions during dehydration. Using both 3D X-ray imaging of geo-architected samples and peridynamic (PD) numerical simulations, we show that the spatial distribution of the clay affects the crack network geometry with distributed clay particles yielding the most complex crack networks and percent damage (99.56%), along with a 60% reduction in material strength. We also demonstrate that crack formation, growth, coalescence, and distribution during dehydration, are controlled by the differential shrinkage rates between a highly shrinkable clay and a homogeneous mortar matrix. Sensitivity tests performed with the PD models show a clay shrinkage parameter of 0.4 yields considerable damage, and reductions in the parameter can result in a significant reduction in fracturing and an increase in material strength. Additionally, isolated clay inclusions induced localized fracturing predominantly due to debonding between the clay and matrix. These insights indicate differential shrinkage is a source of potential failure in natural and engineered barriers used to sequester anthropogenic waste.

58 GEOSCIENCES↗
NASA NTRS2009

Method and Apparatus for Predicting Unsteady Pressure and Flow Rate Distribution in a Fluid Network

A method and apparatus for analyzing steady state and transient flow in a complex fluid network, modeling phase changes, compressibility, mixture thermodynamics, external body forces such as gravity and centrifugal force and conjugate heat transfer. In some embodiments, a graphical user interface provides for the interactive development of a fluid network simulation having nodes and branches. In some embodiments, mass, energy, and specific conservation equations are solved at the nodes, and momentum conservation equations are solved in the branches. In some embodiments, contained herein are data objects for computing thermodynamic and thermophysical properties for fluids. In some embodiments, the systems of equations describing the fluid network are solved by a hybrid numerical method that is a combination of the Newton-Raphson and successive substitution methods.

Majumdar, Alok K.↗
DOE OSTI2024

Advances in Engineering Nucleotide Sugar Metabolism for Natural Product Glycosylation in Saccharomyces cerevisiae

Glycosylation is a ubiquitous modification present across all of biology, affecting many things such as physicochemical properties, cellular recognition, subcellular localization, and immunogenicity. Nucleotide sugars are important precursors needed to study glycosylation and produce glycosylated products. Saccharomyces cerevisiae is a potentially powerful platform for producing glycosylated biomolecules, but it lacks nucleotide sugar diversity. Nucleotide sugar metabolism is complex, and understanding how to engineer it will be necessary to both access and study heterologous glycosylations found across biology. This review overviews the potential challenges with engineering nucleotide sugar metabolism in yeast from the salvage pathways that convert free sugars to their associated UDP-sugars to de novo synthesis where nucleotide sugars are interconverted through a complex metabolic network with governing feedback mechanisms. Finally, recent examples of engineering complex glycosylation of small molecules in S. cerevisiae are explored and assessed.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2022

Width-Based Discharge Partitioning in Distributary Networks: How Right We Are

River deltas are home to large populations and can be composed of complex channel networks which convey flows of matter to the shoreline. Knowledge of flow within individual channels is needed to quantify the distribution of discharge across the delta, and thus its sustainability over time. Due to a lack of field measurements at the local channel scale, researchers leverage remote sensing data to estimate the partitioning of flow. We compare data from 15 river deltas to discharge partitioning estimates based on channel network graphs derived from remote sensing imagery. We quantify errors in the common width-based method and test alternative partitioning techniques to find that width-based discharge partitioning is universally applicable, suggesting that absent any site-specific information, discharge partitioning by average channel width is an appropriate approach. We also provide networks, streamflow measurements, and flux partitioning estimates for 28 delta networks as the Discharge In Distributary NeTworks (DIDNT) dataset.

58 GEOSCIENCES↗
DOE OSTI2023

Chemical abrasion: the mechanics of zircon dissolution

Chemical abrasion is a technique that combines thermal annealing and partial dissolution in hydrofluoric acid (HF) to selectively remove radiation-damaged portions of zircon crystals prior to U–Pb isotopic analysis, and it is applied ubiquitously to zircon prior to U–Pb isotope dilution thermal ionization mass spectrometry (ID-TIMS). The mechanics of zircon dissolution in HF and the impact of different leaching conditions on the zircon structure, however, are poorly resolved. We present a microstructural investigation that integrates microscale X-ray computed tomography (µCT), scanning electron microscopy, and Raman spectroscopy to evaluate zircon dissolution in HF. We show that µCT is an effective tool for imaging metamictization and complex dissolution networks in three dimensions. Acid frequently reaches crystal interiors via fractures spatially associated with radiation damage zoning and inclusions to dissolve soluble high-U zones, some inclusions, and material around fractures, leaving behind a more crystalline zircon residue. Other acid paths to crystal cores include the dissolution of surface-reaching inclusions and the percolation of acid across zones with high defect densities. In highly crystalline samples dissolution is crystallographically controlled with dissolution proceeding almost exclusively along the c axis. Increasing the leaching temperature from 180 to 210 °C results in deeper etching textures, wider acid paths, more complex internal dissolution networks, and greater volume losses. How a grain dissolves strongly depends on its initial radiation damage content and defect distribution as well as the size and position of inclusions. As such, the effectiveness of any chemical abrasion protocol for ID-TIMS U–Pb geochronology is likely sample-dependent. We also briefly discuss the implications of our findings for deep-time (U-Th)/He thermochronology.

58 GEOSCIENCES↗
NASA NTRS1972

Use of a three-layer distributed RC network to produce two pairs of complex conjugate zeros

The properties of a three layer distributed RC network consisting of two layers of resistive material separated by a dielectric are described. When the three layer network is used as a three terminal element by connecting conducting terminal strips across the ends of one of the resistive layers and the center of the other resistive layer, the network may be used to produce pairs of complex conjugate transmission zeros. The location of these zeros are determined by the parameters of the network. Design charts for determining the zero positions are included as part of the report.

Huelsman, L. P.↗
DOE OSTI2023

Attention for Causal Relationship Discovery from Biological Neural Dynamics

This paper explores the potential of the transformer models for learning Granger causality in networks with complex nonlinear dynamics at every node, as in neurobiological and biophysical networks. Our study primarily focuses on a proof-of-concept investigation based on simulated neural dynamics, for which the ground-truth causality is known through the underlying connectivity matrix. For transformer models trained to forecast neuronal population dynamics, we show that the cross-attention module effectively captures the causal relationship among neurons, with an accuracy equal to or superior to that of the most popular Granger causality discovery method. While we acknowledge that real-world neurobiology data will bring further challenges, including dynamic connectivity and unobserved variability, this research offers an encouraging preliminary glimpse into the utility of the transformer model for causal representation learning in neuroscience.

Lu, Ziyu↗
DOE OSTI2025

Deep Learning without Global Optimization by Random Fourier Neural Networks

Here we introduce a new training algorithm for deep neural networks that utilize random complex exponential activation functions. Our approach employs a Markov chain Monte Carlo sampling procedure to iteratively train network layers, avoiding global and gradient-based optimization while maintaining error control. It consistently attains the theoretical approximation rate for residual networks with complex exponential activation functions, determined by network complexity. Additionally, it enables efficient learning of multiscale and high-frequency features, producing interpretable parameter distributions. Despite using sinusoidal basis functions, we do not observe Gibbs phenomena in approximating discontinuous target functions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Complexes of tubulin oligomers and tau form a viscoelastic intervening network cross-bridging microtubules into bundles

Abstract The axon-initial-segment (AIS) of mature neurons contains microtubule (MT) fascicles (linear bundles) implicated as retrograde diffusion barriers in the retention of MT-associated protein (MAP) tau inside axons. Tau dysfunction and leakage outside of the axon is associated with neurodegeneration. We report on the structure of steady-state MT bundles in varying concentrations of Mg 2+ or Ca 2+ divalent cations in mixtures containing αβ-tubulin, full-length tau, and GTP at 37 °C in a physiological buffer. A concentration-time kinetic phase diagram generated by synchrotron SAXS reveals a wide-spacing MT bundle phase (B ws ), a transient intermediate MT bundle phase (B int ), and a tubulin ring phase. SAXS with TEM of plastic-embedded samples provides evidence of a viscoelastic intervening network (IN) of complexes of tubulin oligomers and tau stabilizing MT bundles. In this model, αβ-tubulin oligomers in the IN are crosslinked by tau’s MT binding repeats, which also link αβ-tubulin oligomers to αβ-tubulin within the MT lattice. The model challenges whether the cross-bridging of MTs is attributed entirely to MAPs. Tubulin-tau complexes in the IN or bound to isolated MTs are potential sites for enzymatic modification of tau, promoting nucleation and growth of tau fibrils in tauopathies.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2021

Learning Sequential Distribution System Restoration via Graph-Reinforcement Learning

We report a distribution service restoration algorithm as a fundamental resilient paradigm for system operators provides an optimally coordinated, resilient solution to enhance the restoration performance. The restoration problem is formulated to coordinate distribution generators and controllable switches optimally. A model-based control scheme is usually designed to solve this problem, relying on a precise model and resulting in low scalability. To tackle these limitations, this work proposes a graph-reinforcement learning framework for the restoration problem. We link the power system topology with a graph convolutional network, which captures the complex mechanism of network restoration in power networks and understands the mutual interactions among controllable devices. Latent features over graphical power networks produced by graph convolutional layers are exploited to learn the control policy for network restoration using deep reinforcement learning. The solution scalability is guaranteed by modeling distributed generators as agents in a multi-agent environment and a proper pre-training paradigm. Comparative studies on IEEE 123-node and 8500-node test systems demonstrate the performance of the proposed solution.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2023

Confidentiality-preserving machine learning algorithms for soft-failure detection in optical communication networks

Automated fault management is at the forefront of next-generation optical communication networks. The increase in complexity of modern networks has triggered the need for programmable and software-driven architectures to support the operation of agile and self-managed systems. In these scenarios, the European Telecommunications Standards Institute zero-touch network and service management approach is imperative. The need for machine learning algorithms to process the large volume of telemetry data brings safety concerns as distributed cloud-computing solutions become the preferred approach for deploying reliable communication network automation. This paper’s contribution is twofold. First, we propose a simple yet effective method to guarantee the confidentiality of the telemetry data based on feature scrambling. The method allows the operation of third-party computational services without direct access to the full content of the collected data. Additionally, the effectiveness of four unsupervised machine learning algorithms for soft-failure detection is evaluated when applied to the scrambled telemetry data. The methods are based on factor analysis, principal component analysis, nonlinear principal component analysis, and singular value decomposition. Most dimensionality reduction algorithms have the common property that they can maintain similar levels of fault classification performance while hiding the data structure from unauthorized access. Evaluations of the proposed algorithms demonstrate this capability.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

SENTRA: A Modular Computational Graph Framework for Critical Mineral and Materials Supply Chains: Part I: Network Construction Latent-Quantity Estimation, and Temporal Graph Forecasting

Global supply chains for critical minerals and materials are complex, evolving networks of countries, products, production stages, and trade relationships. Existing analytical approaches are limited by fragmented data and static network representations that do not capture the dynamic production dependencies linking raw materials, intermediate products, and final goods across multiple countries. Trade and production statistics provide only a partial view of domestic production, inventories, and material flows, making it difficult to identify indirect sourcing pathways, hidden dependencies, and embedded foreign exposures. This paper introduces the Supply Chain Exposure Network Tracking and Risk Assessment (SENTRA) framework, a modular graph-based computational framework for constructing, analyzing, and forecasting dynamic supply chain networks. As the first paper in a three-part methodological series, it establishes the computational foundation of SENTRA by constructing a temporal attributed multi-relational graph whose nodes represent product–country pairs and whose edges encode observed trade and within-country value-chain relationships. Statistical estimation and constrained optimization recover latent production, final demand, and product input dependency coefficients while enforcing economic accounting constraints. Graph-derived exposure measures quantify direct, transshipment, value-chain, and multi-hop supply chain dependencies independently of the forecasting model. A temporal graph forecasting architecture based on a relational graph neural network then forecasts the evolution of the graph under mass-balance constraints with distribution-free conformal uncertainty quantification. Validation on the global aluminum supply chain shows that the learned graph representations recover economically meaningful supply chain structure, accurately forecast out-of-sample trade relationships, and produce well-calibrated prediction intervals. Subsequent papers apply this computational foundation to exposure assessment, disruption analysis, and scenario-based policy analysis, and extend the framework to multimaterial supply chain modeling and decision support.

36 MATERIALS SCIENCE↗
NASA NTRS1992

An image compression technique for use on token ring networks

A low complexity technique for compression of images for transmission over local area networks is presented. The technique uses the synchronous traffic as a side channel for improving the performance of an adaptive differential pulse code modulation (ADPCM) based coder.

Gorjala, B.↗
DOE OSTI2022

Prevalence and scalable control of localized networks

The ability to control network dynamics is essential for ensuring desirable functionality of many technological, biological, and social systems. Such systems often consist of a large number of network elements, and controlling large-scale networks remains challenging because the computation and communication requirements increase prohibitively fast with network size. Here, we introduce a notion of network locality that can be exploited to make the control of networks scalable, even when the dynamics are nonlinear. We show that network locality is captured by an information metric and is almost universally observed across real and model networks. In localized networks, the optimal control actions and system responses are both shown to be necessarily concentrated in small neighborhoods induced by the information metric. This allows us to develop localized algorithms for determining network controllability and optimizing the placement of driver nodes. This also allows us to develop a localized algorithm for designing local feedback controllers that approach the performance of the corresponding best global controllers, while incurring a computational cost orders-of-magnitude lower. Here, we validate the locality, performance, and efficiency of the algorithms in Kuramoto oscillator networks, as well as three large empirical networks: synchronization dynamics in the Eastern US power grid, epidemic spreading mediated by the global air-transportation network, and Alzheimer’s disease dynamics in a human brain network. Taken together, our results establish that large networks can be controlled with computation and communication costs comparable to those for small networks.

42 ENGINEERING↗
NASA NTRS2003

Tensegrity II. How structural networks influence cellular information processing networks

The major challenge in biology today is biocomplexity: the need to explain how cell and tissue behaviors emerge from collective interactions within complex molecular networks. Part I of this two-part article, described a mechanical model of cell structure based on tensegrity architecture that explains how the mechanical behavior of the cell emerges from physical interactions among the different molecular filament systems that form the cytoskeleton. Recent work shows that the cytoskeleton also orients much of the cell's metabolic and signal transduction machinery and that mechanical distortion of cells and the cytoskeleton through cell surface integrin receptors can profoundly affect cell behavior. In particular, gradual variations in this single physical control parameter (cell shape distortion) can switch cells between distinct gene programs (e.g. growth, differentiation and apoptosis), and this process can be viewed as a biological phase transition. Part II of this article covers how combined use of tensegrity and solid-state mechanochemistry by cells may mediate mechanotransduction and facilitate integration of chemical and physical signals that are responsible for control of cell behavior. In addition, it examines how cell structural networks affect gene and protein signaling networks to produce characteristic phenotypes and cell fate transitions during tissue development.

Review↗