Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “growing random 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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Evolution of Robustness in Growing Random Networks

Networks are widely used to model the interaction between individual dynamic systems. In many instances, the total number of units and interaction coupling are not fixed in time, and instead constantly evolve. In networks, this means that the number of nodes and edges both change over time. Various properties of coupled dynamic systems, such as their robustness against noise, essentially depend on the structure of the interaction network. Therefore, it is of considerable interest to predict how these properties are affected when the network grows as well as their relationship to the growth mechanism. Here, we focus on the time evolution of a network’s Kirchhoff index. We derive closed-form expressions for its variation in various scenarios, including the addition of both edges and nodes. For the latter case, we investigate the evolution where single nodes with one or two edges connecting to existing nodes are added recursively to a network. In both cases, we derive the relations between the properties of the nodes to which the new node connects along with the global evolution of network robustness. In particular, we show how different scalings of the Kirchhoff index can be obtained as a function of the number of nodes. We illustrate and confirm this theory via numerical simulations of randomly growing networks.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Generating Massive Scale-free Networks: Novel Parallel Algorithms using the Preferential Attachment Model

Recently, there has been substantial interest in the study of various random networks as mathematical models of complex systems. As real-life complex systems grow larger, the ability to generate progressively large random networks becomes all the more important. This motivates the need for efficient parallel algorithms for generating such networks. Naïve parallelization of sequential algorithms for generating random networks is inefficient due to inherent dependencies among the edges and the possibility of creating duplicate (parallel) edges. In this article, we present message passing interface-based distributed memory parallel algorithms for generating random scale-free networks using the preferential-attachment model. Our algorithms are experimentally verified to scale very well to a large number of processing elements (PEs), providing near-linear speedups. The algorithms have been exercised with regard to scale and speed to generate scale-free networks with one trillion edges in 6 minutes using 1,000 PEs.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Universality class for loopless invasion percolation models and a percolation avalanche burst model for hydraulic fracturing

Invasion percolation is a model that was originally proposed to describe growing networks of fractures. In this work, we describe a loopless algorithm on random lattices, coupled with an avalanche-based model for bursts. The model reproduces the characteristic b-value seismicity and spatial distribution of bursts consistent with earthquakes resulting from hydraulic fracturing (“fracking”). We test models for both site invasion percolation and bond invasion percolation. These have differences on the scale of site and bond lengths l. But since the networks are characterized by their large-scale behavior, l << L, we find small differences between scaling exponents. Though data may not differentiate between models, our results suggest that both models belong to different universality classes.

58 GEOSCIENCES↗
DOE OSTI2025

Diffusion Codes: Self-Correction from Small(er)-Set Expansion with Tunable Non-locality

Optimal constructions of classical LDPC codes can be obtained by choosing the Tanner graph uniformly at random among biregular graphs. We introduce a class of codes that we call ``diffusion codes'', defined by placing each edge connecting bits and checks on some graph, and acting on that graph with a random SWAP network. By tuning the depth of the SWAP network, we can tune a tradeoff between the amount of randomness -- and hence the optimality of code parameters -- and locality with respect to the underlying graph. For diffusion codes defined on the cycle graph, if the SWAP network has depth $\sim Tn$ with $T> n^{2β}$ for arbitrary $β>0$, then we prove that almost surely the Tanner graph is a lossless ``smaller set'' vertex expander for small sets up size $δ\sim \sqrt T \sim n^β$, with bounded bit and check degree. At the same time, the geometric size of the largest stabilizer is bounded by $\sqrt T$ in graph distance. We argue, based on physical intuition, that this result should hold more generally on arbitrary graphs. By taking hypergraph products of these classical codes we obtain quantum LDPC codes defined on the torus with smaller-set boundary and co-boundary expansion and the same expansion/locality tradeoffs as for the classical codes. These codes are self-correcting and admit single-shot decoding, while having the geometric size of the stabilizer growing as an arbitrarily small power law. Our proof technique establishes mixing of a random SWAP network on small subsystems at times scaling with only the subsystem size, which may be of independent interest.

Combinatorics (math.CO)↗
DOE OSTI2025

Resilient information and inference networks under mixed-trust sensing

With ubiquitous digitization, sensing, and computational intelligence deployed in increasingly more and broader domains, including critical infrastructure, potentially misleading and destabilizing effects of multimodal anomalies and adversarial behavior are growing in importance. Here, we develop randomized and reinforcement learning-based strategies for strategically recruiting and utilizing deployed (and, thus, vulnerable and potentially faulty and/or compromised) nodes from information and inference networks, while defending against adversaries that attempt to misguide assessments of inferred variables. Recognizing that, besides communication and other costs, sampling from any observable node can either provide true data or dangerously expose our inference to misinformation (without being easily distinguishable what actually happens), the proposed strategies proceed by progressively recruiting nodes and cautiously scaling their information contribution based on assumed, or, in our reinforcement learning approach, intelligently weighed trustworthiness, with the learning approach also considering network-wide, threat-inclusive risk/value tradeoffs. While avoiding the hardware, communication, analytical and computational burden of explicit redundancy, the proposed defensive schemes enable on-the-fly assessments of underlying processes, and system-wide situational awareness with demonstrable resilience against adversarial activities.

97 - MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Predicting Biomass Yields of Advanced Switchgrass Cultivars for Bioenergy and Ecosystem Services Using Machine Learning

The production of advanced perennial bioenergy crops within marginal areas of the agricultural landscape is gaining interest due to its potential to sustainably produce feedstocks for biofuels and bioproducts while also improving the sustainability and resilience of commodity crop production. However, predicting the biomass yields of this production system is challenging because marginal areas are often relatively small and spread around agricultural fields and are typically associated with various abiotic conditions that limit crop production. Machine learning (ML) offers a viable solution as a biomass yield prediction tool because it is suited to predicting relationships with complex functional associations. The objectives of this study were to (1) evaluate the accuracy of commonly applied ML algorithms in agricultural applications for predicting the biomass yields of advanced switchgrass cultivars for bioenergy and ecosystem services and (2) determine the most important biomass yield predictors. Datasets on biomass yield, weather, land marginality, soil properties, and agronomic management were generated from three field study sites in two U.S. Midwest states (Illinois and Iowa) over three growing seasons. The ML algorithms evaluated in the study included random forests (RFs), gradient boosting machines (GBMs), artificial neural networks (ANNs), K-neighbors regressor (KNR), AdaBoost regressor (ABR), and partial least squares regression (PLSR). Coefficient of determination (R 2 ) and mean absolute error (MAE) were used to evaluate the predictive accuracy of the tested algorithms. Results showed that the ensemble methods, RF (R 2 = 0.86, MAE = 0.62 Mg/ha), GBM (R 2 = 0.88, MAE = 0.57 Mg/ha), and GBM (R 2 = 0.78, MAE = 0.66 Mg/ha), were the most accurate in predicting biomass yields of the Independence, Liberty, and Shawnee switchgrass cultivars, respectively. This is in agreement with similar studies that apply ML to multi-feature problems where traditional statistical methods are less applicable and datasets used were considered to be relatively small for ANNs. Consistent with previous studies on switchgrass, the most important predictors of biomass yield included average annual temperature, average growing season temperature, sum of the growing season precipitation, field slope, and elevation. This study helps pave the way for applying ML as a management tool for alternative bioenergy landscapes where understanding agronomic and environmental performance of a multifunctional cropping system seasonally and interannually at the sub-field scale is critical.

09 BIOMASS FUELS↗
NASA NTRS1993

Random interactions in higher order neural networks

Recurrent networks of polynomial threshold elements with random symmetric interactions are studied. Precise asymptotic estimates are derived for the expected number of fixed points as a function of the margin of stability. In particular, it is shown that there is a critical range of margins of stability (depending on the degree of polynomial interaction) such that the expected number of fixed points with margins below the critical range grows exponentially with the number of nodes in the network, while the expected number of fixed points with margins above the critical range decreases exponentially with the number of nodes in the network. The random energy model is also briefly examined and links with higher order neural networks and higher order spin glass models made explicit.

Baldi, Pierre↗
NASA NTRS2002

Trends in lignin modification: a comprehensive analysis of the effects of genetic manipulations/mutations on lignification and vascular integrity

A comprehensive assessment of lignin configuration in transgenic and mutant plants is long overdue. This review thus undertook the systematic analysis of trends manifested through genetic and mutational manipulations of the various steps associated with monolignol biosynthesis; this included consideration of the downstream effects on organized lignin assembly in the various cell types, on vascular function/integrity, and on plant growth and development. As previously noted for dirigent protein (homologs), distinct and sophisticated monolignol forming metabolic networks were operative in various cell types, tissues and organs, and form the cell-specific guaiacyl (G) and guaiacyl-syringyl (G-S) enriched lignin biopolymers, respectively. Regardless of cell type undergoing lignification, carbon allocation to the different monolignol pools is apparently determined by a combination of phenylalanine availability and cinnamate-4-hydroxylase/"p-coumarate-3-hydroxylase" (C4H/C3H) activities, as revealed by transcriptional and metabolic profiling. Downregulation of either phenylalanine ammonia lyase or cinnamate-4-hydroxylase thus predictably results in reduced lignin levels and impaired vascular integrity, as well as affecting related (phenylpropanoid-dependent) metabolism. Depletion of C3H activity also results in reduced lignin deposition, albeit with the latter being derived only from hydroxyphenyl (H) units, due to both the guaiacyl (G) and syringyl (S) pathways being blocked. Apparently the cells affected are unable to compensate for reduced G/S levels by increasing the amounts of H-components. The downstream metabolic networks for G-lignin enriched formation in both angiosperms and gymnosperms utilize specific cinnamoyl CoA O-methyltransferase (CCOMT), 4-coumarate:CoA ligase (4CL), cinnamoyl CoA reductase (CCR) and cinnamyl alcohol dehydrogenase (CAD) isoforms: however, these steps neither affect carbon allocation nor H/G designations, this being determined by C4H/C3H activities. Such enzymes thus fulfill subsidiary processing roles, with all (except CCOMT) apparently being bifunctional for both H and G substrates. Their severe downregulation does, however, predictably result in impaired monolignol biosynthesis, reduced lignin deposition/vascular integrity, (upstream) metabolite build-up and/or shunt pathway metabolism. There was no evidence for an alternative acid/ester O-methyltransferase (AEOMT) being involved in lignin biosynthesis.The G/S lignin pathway networks are operative in specific cell types in angiosperms and employ two additional biosynthetic steps to afford the corresponding S components, i.e. through introduction of an hydroxyl group at C-5 and its subsequent O-methylation. [These enzymes were originally classified as ferulate-5-hydroxylase (F5H) and caffeate O-methyltransferase (COMT), respectively.] As before, neither step has apparently any role in carbon allocation to the pathway; hence their individual downregulation/manipulation, respectively, gives either a G enriched lignin or formation of the well-known S-deficient bm3 "lignin" mutant, with cell walls of impaired vascular integrity. In the latter case, COMT downregulation/mutation apparently results in utilization of the isoelectronic 5-hydroxyconiferyl alcohol species albeit in an unsuccessful attempt to form G-S lignin proper. However, there is apparently no effect on overall G content, thereby indicating that deposition of both G and S moieties in the G/S lignin forming cells are kept spatially, and presumably temporally, fully separate. Downregulation/mutation of further downstream steps in the G/S network [i.e. utilizing 4CL, CCR and CAD isoforms] gives predictable effects in terms of their subsidiary processing roles: while severe downregulation of 4CL gave phenotypes with impaired vascular integrity due to reduced monolignol supply, there was no evidence in support of increased growth and/or enhanced cellulose biosynthesis. CCR and CAD downregulation/mutations also established that a depletion in monolignol supply reduced both lignin contents supply reduced both lignin contents and vascular integrity, with a concomitant shift towards (upstream) metabolite build-up and/or shunting.The extraordinary claims of involvement of surrogate monomers (2-methoxybenzaldehyde, feruloyl tyramine, vanillic acid, etc.) in lignification were fully disproven and put to rest, with the investigators themselves having largely retracted former claims. Furthermore analysis of the well-known bm1 mutation, a presumed CAD disrupted system, apparently revealed that both G and S lignin components were reduced. This seems to imply that there is no monolignol specific dehydrogenase, such as the recently described sinapyl alcohol dehydrogenase (SAD) for sinapyl alcohol formation. Nevertheless, different CAD isoforms of differing homology seem to be operative in different lignifying cell types, thereby giving the G-enriched and G/S-enriched lignin biopolymers, respectively. For the G-lignin forming network, however, the CAD isoform is apparently catalytically less efficient with all three monolignols than that additionally associated with the corresponding G/S lignin forming network(s), which can more efficiently use all three monolignols. However, since CAD does not determine either H, G, or S designation, it again serves in a subsidiary role-albeit using different isoforms for different cell wall developmental and cell wall type responses.The results from this analysis contrasts further with speculations of some early investigators, who had viewed lignin assembly as resulting from non-specific oxidative coupling of monolignols and subsequent random polymerization. At that time, though, the study of the complex biological (biochemical) process of lignin assembly had begun without any of the (bio)chemical tools to either address or answer the questions posed as to how its formation might actually occur. Today, by contrast, there is growing recognition of both sophisticated and differential control of monolignol biosynthetic networks in different cell types, which serve to underscore the fact that complexity of assembly need not be confused any further with random formation. Moreover, this analysis revealed another factor which continues to cloud interpretations of lignin downregulation/mutational analyses, namely the serious technical problems associated with all aspects of lignin characterization, whether for lignin quantification, isolation of lignin-enriched preparations and/or in determining monomeric compositions. For example, in the latter analyses, some 50-90% of the lignin components still cannot be detected using current methodologies, e.g. by thioacidolysis cleavage and nitrobenzene oxidative cleavage. This deficiency in lignin characterization thus represents one of the major hurdles remaining in delineating how lignin assembly (in distinct cell types) and their configuration actually occurs.

Review, Academic↗
DOE OSTI2023

Degree-preserving graph dynamics: a versatile process to construct random networks

Real-world networks evolve over time via the addition or removal of vertices and edges. In current network evolution models, vertex degree varies or grows arbitrarily. A recently introduced degree-preserving network growth (DPG) family of models preserves vertex degree, resulting in structures significantly different from and more diverse than previous models. Despite its degree preserving property, the DPG model is able to replicate the output of several well-known real-world network growth models. Simulations showed that many real-world networks can also be constructed from small seed graphs via the DPG process. Here, we start the development of a rigorous mathematical theory underlying the DPG family of network growth models. We prove that the degree sequence of the output of some of the well-known, real-world network growth models can be reconstructed via the DPG process, using proper parametrization. We also show that the general problem of deciding whether a simple graph can be obtained via the DPG process from a small seed (DPG feasibility) is, however, NP-complete. In conclusion, it is an intriguing open problem to uncover whether there is a structural reason behind the DPG-constructability of real-world networks.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2021

An Evaluation of Timely Communications Access Methods Using NASA Space Network

There is a growing interest among scientists to coordinate diverse and temporally responsive measurements from multiple space and ground-based observatories in order to obtain greater insights into transient scientific events than would otherwise be possible. Many transient scientific events of interest occur randomly and the scientific value of follow-up observations decays with time. As a result, transient science operations among distributed observatories require timely access to communications network services. This paper develops two complimentary methods to improve users’ network access timeliness using the NASA Space Network (SN). Descriptive models of each method are developed using Systems Modeling Language. Pathfinder experiments are designed and executed. Suitability of the methods is discussed in light of the experimental results. Innovative applications of the methods are presented. This research establishes that the as-built SN systems have adequate capabilities and capacity to support infusion of the methods to current and future users with emergent time-sensitive service needs. The minimum service access wait time was determined to be approximately 10 min and is achievable 84% of the time. An average access wait time of approximately 14 min is expected when SN resource blocking occurs. A roadmap to improve SN access timeliness is presented.

Space Communications and Navigation↗
NASA NTRS1989

Analysis of random drop for gateway congestion control

Lately, the growing demand on the Internet has prompted the need for more effective congestion control policies. Currently No Gateway Policy is used to relieve and signal congestion, which leads to unfair service to the individual users and a degradation of overall network performance. Network simulation was used to illustrate the character of Internet congestion and its causes. A newly proposed gateway congestion control policy, called Random Drop, was considered as a promising solution to the pressing problem. Random Drop relieves resource congestion upon buffer overflow by choosing a random packet from the service queue to be dropped. The random choice should result in a drop distribution proportional to the bandwidth distribution among all contending TCP connections, thus applying the necessary fairness. Nonetheless, the simulation experiments demonstrate several shortcomings with this policy. Because Random Drop is a congestion control policy, which is not applied until congestion has already occurred, it usually results in a high drop rate that hurts too many connections including well-behaved ones. Even though the number of packets dropped is different from one connection to another depending on the buffer utilization upon overflow, the TCP recovery overhead is high enough to neutralize these differences, causing unfair congestion penalties. Besides, the drop distribution itself is an inaccurate representation of the average bandwidth distribution, missing much important information about the bandwidth utilization between buffer overflow events. A modification of Random Drop to do congestion avoidance by applying the policy early was also proposed. Early Random Drop has the advantage of avoiding the high drop rate of buffer overflow. The early application of the policy removes the pressure of congestion relief and allows more accurate signaling of congestion. To be used effectively, algorithms for the dynamic adjustment of the parameters of Early Random Drop to suite the current network load must still be developed.

Hashem, Emam Salaheddin↗
DOE OSTI2021

Modeling and simulation of vascular tumors embedded in evolving capillary networks

Here in this work, we present a coupled 3D–1D model of solid tumor growth within a dynamically changing vascular network to facilitate realistic simulations of angiogenesis. Additionally, the model includes erosion of the extracellular matrix, interstitial flow, and coupled flow in blood vessels and tissue. We employ continuum mixture theory with stochastic Cahn–Hilliard type phase-field models of tumor growth. The interstitial flow is governed by a mesoscale version of Darcy’s law. The flow in the blood vessels is controlled by Poiseuille flow, and Starling’s law is applied to model the mass transfer in and out of blood vessels. The evolution of the network of blood vessels is orchestrated by the concentration of the tumor angiogenesis factors (TAFs); blood vessels grow towards the increasing TAFs concentrations. This process is not deterministic, allowing random growth of blood vessels and, therefore, due to the coupling of nutrients in tissue and vessels, makes the growth of tumors stochastic. We demonstrate the performance of the model by applying it to a variety of scenarios. Numerical experiments illustrate the flexibility of the model and its ability to generate satellite tumors. Simulations of the effects of angiogenesis on tumor growth are presented as well as sample-independent features of cancer.

3D–1D coupled blood flow models↗
DOE OSTI2025

A Study on the Impact of Temperature-Dependent Ferroelectric Switching Behavior in 3D Memory Architecture

The flourishing development of neural networks that require exponentially growing amounts of data has presented an elevated demand for memory footprint. To address this, researchers have been exploring hardware accelerators with innovative memory architectures like 3D memory. These 3D memory architectures offer enhanced storage capacity and processing capabilities, at a cost of rising on-chip temperature during operation. Hafnium Zirconium Oxide (HZO) based Ferroelectric Random Access Memory (FeRAM) is a promising nonvolatile memory candidate in neural network hardware accelerators for its outstanding write performance and reliability. However, its implementation in the architecture regarding the temperature-dependent ferroelectric switching behavior has not been well studied. In this work, we study the thermal impacts on polarization switching through experimental devices and simulation results. We conduct the circuit and architecture-level simulations to showcase that one can exploit this temperature rise to reduce FeRAM's write voltage and write energy due to its unique temperature-activated polarization switching mechanisms. As the on-chip temperature increases to 351K (ambient temperature at 300K) due to neural network workloads, the access energy per bit can be reduced by 27.6% when a dynamic write voltage is applied.

36 MATERIALS SCIENCE↗
DOE OSTI2025

A framework to evaluate machine learning crystal stability predictions

The rapid adoption of machine learning in various scientific domains calls for the development of best practices and community agreed-upon benchmarking tasks and metrics. We present Matbench Discovery as an example evaluation framework for machine learning energy models, here applied as pre-filters to first-principles computed data in a high-throughput search for stable inorganic crystals. We address the disconnect between (1) thermodynamic stability and formation energy and (2) retrospective and prospective benchmarking for materials discovery. Alongside this paper, we publish a Python package to aid with future model submissions and a growing online leaderboard with adaptive user-defined weighting of various performance metrics allowing researchers to prioritize the metrics they value most. To answer the question of which machine learning methodology performs best at materials discovery, our initial release includes random forests, graph neural networks, one-shot predictors, iterative Bayesian optimizers and universal interatomic potentials. We highlight a misalignment between commonly used regression metrics and more task-relevant classification metrics for materials discovery. Accurate regressors are susceptible to unexpectedly high false-positive rates if those accurate predictions lie close to the decision boundary at 0 eV per atom above the convex hull. The benchmark results demonstrate that universal interatomic potentials have advanced sufficiently to effectively and cheaply pre-screen thermodynamic stable hypothetical materials in future expansions of high-throughput materials databases.

Riebesell, Janosh↗
DOE OSTI2025

Poor reliability of public charging stations can impede the growth of the electric vehicle market

How does the reliability of public charging infrastructure affect electric vehicle (EV) adoption? Substantial public and private investments are expanding EV charging networks, but concerns are growing about the poor reliability of existing chargers and its potential impacts on EV adoption. Using data from a nationwide survey, we employ a choice model to quantify the effects of perceived charging reliability on Americans’ intentions to purchase new or used EVs. By randomly assigning participants to receive information characterizing public charging as either very reliable or very unreliable, we show a causal effect of reliability perceptions on EV purchase intentions. In conclusion, we find that differences in perceived reliability are equivalent to changing price by 32 % of purchasing budget or changing range by 366 miles, underscoring the importance of reliable public charging.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2022

The Evolution of Volatile Memory Forensics

The collection and analysis of volatile memory is a vibrant area of research in the cybersecurity community. The ever-evolving and growing threat landscape is trending towards fileless malware, which avoids traditional detection but can be found by examining a system’s random access memory (RAM). Additionally, volatile memory analysis offers great insight into other malicious vectors. It contains fragments of encrypted files’ contents, as well as lists of running processes, imported modules, and network connections, all of which are difficult or impossible to extract from the file system. For these compelling reasons, recent research efforts have focused on the collection of memory snapshots and methods to analyze them for the presence of malware. However, to the best of our knowledge, no current reviews or surveys exist that systematize the research on both memory acquisition and analysis. We fill that gap with this novel survey by exploring the state-of-the-art tools and techniques for volatile memory acquisition and analysis for malware identification. For memory acquisition methods, we explore the trade-offs many techniques make between snapshot quality, performance overhead, and security. For memory analysis, we examined the traditional forensic methods used, including signature-based methods, dynamic methods performed in a sandbox environment, as well as machine learning-based approaches. We summarize the currently available tools, and suggest areas for more research.

Nyholm, Hannah↗
DOE OSTI2024

Explaining Neural Spike Activity for Simulated Bio-plausible Network through Deep Sequence Learning

With significant improvements in large-scale simulations of brain models, there is a growing need to develop tools for rapid analysis and interpreting the simulation results. In this work, we explore the potential of sequential deep learning models to understand and explain the network dynamics among the neurons extracted from a large-scale neural simulation in STACS (Simulation Tool for Asynchronous Cortical Stream). Our method employs a representative neuroscience model that abstracts the cortical dynamics with a reservoir of randomly connected spiking neurons with a low stable spike firing rate throughout the simulation duration. We subsequently analyze the spike dynamics of the simulated spiking neural network through an autoencoder model and an attention-based mechanism.

Kulkarni, Shruti↗