Search NASA⌕ Search

SEARCH · Search NASA

Results for “network robustness”

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

Real Space Imaging of Field-Driven Decision-Making in Nanomagnetic Galton Boards

A possible spintronic route to hardware implementation for decision-making involves injecting a domain wall into a bifurcated magnetic nanostrip resembling a Y-shaped junction. A decision is made when the domain wall chooses a particular path through the bifurcation. Recently, it was shown that a structure like a nanomagnetic Galton board, which is essentially an array of interconnected Y-shaped junctions, produces outcomes that are stochastic and therefore relevant to artificial neural networks. However, the exact mechanism leading to the robust nature of randomness is unknown. Here, in this study, we directly image the decision-making process in nanomagnetic Galton boards using Lorentz transmission electron microscopy. We identify that the stochasticity in nanomagnetic Galton boards arises as a culmination of (1) the topology of the injected domain wall, (2) dissimilarly sized vertices, and (3) the strength of the applied field. Our results pave the way to a detailed understanding of stochasticity in nanomagnetic networks.

lorentz microscopy↗

Decreasing wind speed extrapolation error via domain-specific feature extraction and selection

Abstract. Model uncertainty is a significant challenge in the wind energy industry and can lead to mischaracterization of millions of dollars' worth of wind resources. Machine learning methods, notably deep artificial neural networks (ANNs), are capable of modeling turbulent and chaotic systems and offer a promising tool to produce high-accuracy wind speed forecasts and extrapolations. This paper uses data collected by profiling Doppler lidars over three field campaigns to investigate the efficacy of using ANNs for wind speed vertical extrapolation in a variety of terrains, and it quantifies the role of domain knowledge in ANN extrapolation accuracy. A series of 11 meteorological parameters (features) are used as ANN inputs, and the resulting output accuracy is compared with that of both standard log-law and power-law extrapolations. It is found that extracted nondimensional inputs, namely turbulence intensity, current wind speed, and previous wind speed, are the features that most reliably improve the ANN's accuracy, providing up to a 65 % and 52 % increase in extrapolation accuracy over log-law and power-law predictions, respectively. The volume of input data is also deemed important for achieving robust results. One test case is analyzed in depth using dimensional and nondimensional features, showing that the feature nondimensionalization drastically improves network accuracy and robustness for sparsely sampled atmospheric cases.

17 WIND ENERGY↗

Uncertainty quantification for nuclear forensics with population analyses

Although neural networks offer cutting-edge predictive power, their deployment in high-consequence nuclear forensic applications is limited, partly because of their black-box nature. Incorporating robust uncertainty quantification methods into the predictive frameworks of neural networks is progress towards their future deployment in such scenarios. This work integrates uncertainty quantification into neural networks for nuclear reactor core-average burnup estimation from simulated environmental samples. We test two regimes (homogeneous and heterogeneous events) on DeepSets and Set Transformer architectures, we find both quantify predictive uncertainty effectively, but Set Transformer excels in partitioning latent events, offering superior predictive power and more informative uncertainty estimates.

Hatton, Conner [ORNL] (ORCID:0009000804970959)↗

Layered complex networks as fluctuation amplifiers

Abstract In complex networked systems theory, an important question is how to evaluate the system robustness to external perturbations. With this task in mind, I investigate the propagation of noise in multi-layer networked systems. I find that, for a two layer network, noise originally injected in one layer can be strongly amplified in the other layer, depending on how well-connected are the complex networks in each layer and on how much the eigenmodes of their Laplacian matrices overlap. These results allow to predict potentially harmful conditions for the system and its sub-networks, where the level of fluctuations is important, and how to avoid them. The analytical results are illustrated numerically on various synthetic networks.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Data-Driven Affinely Adjustable Robust Volt/VAr Control

Recent years have seen the increasing proliferation of distributed energy resources with intermittent power outputs, posing new challenges to the voltage management in distribution networks. To this end, this paper proposes a data-driven affinely adjustable robust Volt/VAr control (AARVVC) scheme, which modulates the smart inverter’s reactive power in an affine function of its active power, based on the voltage sensitivities with respect to real/reactive power injections. To achieve a fast and accurate estimation of voltage sensitivities, we propose a data-driven method based on deep neural network (DNN), together with a rule-based bus-selection process using the bidirectional search method. Our method only uses the operating statuses of selected buses as inputs to DNN, thus significantly improving the training efficiency and reducing information redundancy. Finally, a distributed consensus-based solution, based on the alternating direction method of multipliers (ADMM), for the AARVVC is applied to decide the inverter’s reactive power adjustment rule with respect to its active power. Only limited information exchange is required between each local agent and the central agent to obtain the slope of the reactive power adjustment rule, and there is no need for the central agent to solve any (sub)optimization problems. Finally, numerical results on the modified IEEE-123 bus system validate the effectiveness and superiority of the proposed data-driven AARVVC method.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Two-stage dynamic deregulation of metabolism improves process robustness & scalability in engineered E. coli.

Here, we report that two-stage dynamic control improves bioprocess robustness as a result of the dynamic deregulation of central metabolism. Dynamic control is implemented during stationary phase using combinations of CRISPR interference and controlled proteolysis to reduce levels of central metabolic enzymes. Reducing the levels of key enzymes alters metabolite pools resulting in deregulation of the metabolic network. Deregulated networks are less sensitive to environmental conditions improving process robustness. Process robustness in turn leads to predictable scalability, minimizing the need for traditional process optimization. We validate process robustness and scalability of strains and bioprocesses synthesizing the important industrial chemicals alanine, citramalate and xylitol. Predictive high throughput approaches that translate to larger scales are critical for metabolic engineering programs to truly take advantage of the rapidly increasing throughput and decreasing costs of synthetic biology.

59 BASIC BIOLOGICAL SCIENCES↗

Vehicular Re-Identification from Uncontrolled Multiple Views

Vehicle re-identification (re-ID) across disparate sensing modalities remains a fundamental challenge for transportation research. In this work, we introduce a deep multi-view vehicle re-ID framework that leverages Siamese networks to compare pairs of vehicle images and produce matching scores, enabling robust association across drastically different viewpoints such as those from UAVs, surveillance cameras, and ground sensors. The model exploits convolutional neural networks to learn features that remain discriminative under changes in angle, distance, and illumination, supporting more generalizable re-ID performance. As part of this effort, we also developed an automated pipeline to synchronize roadside and UAV video streams, producing a multi-perspective dataset that complements preexisting real collections and a synthetic dataset generated in this study. Together, these contributions advance the capability to re-identify vehicles across wide viewing baselines; establish a foundation for scalable, reproducible research in vehicle re-ID; and open pathways for future applications, such as inferring routine behaviors, movement patterns, and daily habits of the individual associated with the vehicle.

convolutional neural networks↗

A Privacy Preserving Distributed Model Identification Algorithm for Power Distribution Systems

Distributed control/optimization is a promising approach for network systems due to its advantages over centralized schemes, such as robustness, cost-effectiveness, and improved privacy. However, distributed methods can have drawbacks, such as slower convergence rates due to limited knowledge of the overall network model. Additionally, ensuring privacy in the communication of sensitive information can pose implementation challenges. To address this issue, we propose a distributed model identification algorithm that enables each agent to identify the sub-model that characterizes the relationship between its local control and the overall system outputs. The proposed algorithm maintains the privacy of local agents by only communicating through dummy variables. We demonstrate the efficacy of our algorithm in the context of power distribution systems by applying it to the voltage regulation of a modified IEEE distribution system. The proposed algorithm is well-suited to the needs of power distribution controls and offers an effective solution to the challenges of distributed model identification in network systems.

data-driven modeling↗

A Privacy Preserving Distributed Model Identification Algorithm for Power Distribution Systems: Preprint

Distributed control/optimization is a promising approach for network systems due to its advantages over centralized schemes, such as robustness, cost-effectiveness, and improved privacy. However, distributed methods can have drawbacks, such as slower convergence rates due to limited knowledge of the overall network model. Additionally, ensuring privacy in the communication of sensitive information can pose implementation challenges. To address this issue, we propose a distributed model identification algorithm that enables each agent to identify the sub-model that characterizes the relationship between its local control and the overall system outputs. The proposed algorithm maintains the privacy of local agents by only communicating through dummy variables. We demonstrate the efficacy of our algorithm in the context of power distribution systems by applying it to the voltage regulation of a modified IEEE distribution system. The proposed algorithm is well-suited to the needs of power distribution controls and offers an effective solution to the challenges of distributed model identification in network systems.

data-driven modeling↗

A Transductive Graph Neural Network learning for Grid Resilience Analysis

Power grids are critical infrastructures that require robust resilience analysis to ensure reliable and uninterrupted electricity supply. Traditional simulation-based methods for grid resilience analysis suffer from computational complexity and limited ability to capture the full spectrum of potential disruptions. This paper presents a novel approach to enhance grid resilience by leveraging transductive graph neural network (GNN) learning to identify critical nodes and links. By leveraging the graph structure and system features, GNNs effectively learn resilience metrics and accurately identify critical nodes based on actual grid operational behavior. The efficacy of the proposed approach is demonstrated through case studies on node criticality scoring and critical node/line identification in cascading outage scenarios. The results highlight the advantages of learning-based methods over traditional simulation-based approaches and their potential to revolutionize grid resilience analysis. The contributions of this paper include a graph-based scalable approach for fast cascading analysis, an inductive formulation for training GNN models, and a transfer learning-based approach to scale the model to largescale power systems.

grid resilience, graph neural networks, transducti↗

Knowledge gaps for neuromorphic ionic computing

BACKGROUND Neuromorphic computing, inspired by the human brain’s ability to process information efficiently, represents a transformative approach to computation. In this Review, we explore the emerging field of neuromorphic ionic computing, which leverages ionic conduction and coupling to mimic neural processes, and identify critical knowledge gaps that must be addressed to realize its full potential. A central theme of the discussion is energy efficiency, a challenge that is both a limitation and an opportunity for this technology. Although complementary metal-oxide semiconductor (CMOS)–based neuromorphic technologies have made strides in scaling to billions of neurons and are increasingly applied in artificial intelligence and numerical computing, they remain orders of magnitude behind the human brain in terms of connectivity and energy efficiency. Neuromorphic ionic computing promises to overcome these limitations by leveraging the distinct architectural and operational principles of the brain. Our brains achieve this energy efficiency by combining several key features: using the same network elements to store and process information; using an incredibly complex and massively interconnected three-dimensional (3D) network of locally active elements that enables sparsity, robustness in the presence of noise, adaptation, and life-long learning; computing at comparatively low voltage and frequency; and last, taking advantage of a plethora of ions and small molecules as information carriers. Here, we propose that ionic computing systems can take advantage of similar features to achieve substantial gains in energy efficiency. ADVANCES Since the first reports of neuromorphic ionic behavior in nanofluidic channels, we have witnessed an explosion of reports that used ionic devices to produce synaptomimetic behaviors. However, achieving the goals of ionic computing requires not only implementation of much more sophisticated device functionality but also overcoming fundamental barriers in materials science, device architecture, and system integration. Current ionic devices, even those incorporating state-of-the-art materials, still suffer from limited functionality and stability, which restrict their performance and increase energy demands. Developing new materials with enhanced ionic properties is essential to overcome these limitations. Similarly, the design of neuromorphic devices must evolve to leverage the particular advantages of ionic processes. Existing architectures often follow a single-information-carrier logic of conventional electronics or are constructed of mesoscale fluidics, failing to capitalize on the energy-efficient mechanisms inherent to ionic systems or implement the multiple-information-carrier paradigm. Current neuromorphic chips focus on large-scale networks of analog memory elements based on mechanisms such as charge trap (flash), filamentary, phase change, or spin, which are built on top of a network of artificial CMOS neurons. Although such prototype networks have achieved impressive performance, it is difficult to envision how they can implement the key features such as massive connectivity, sophisticated plasticity, adaptability, sparsity, and “multichromatic” computing. Although small-scale devices have demonstrated promising results, integrating them, maintaining energy efficiency, and implementing temperature control as systems grow in complexity and size to computationally relevant scale remain major hurdles. Furthermore, interfacing neuromorphic ionic devices with existing computing technologies presents technical and conceptual challenges that will require innovative approaches that combine insights from neuroscience, materials science, and engineering. OUTLOOK Despite these challenges, the potential impact of neuromorphic ionic computing is profound with potential applications ranging from artificial intelligence to robotics and beyond. We also argue that neuromorphic ionic computing systems should not, at least in the beginning, compete with CMOS technologies but rather should focus on applications that require extreme energy efficiency with chemical and/or biological compatibility, such as biomedical applications (for example, brain-computer interfaces), environmental monitoring, and agricultural and food applications. Ultimately, this Review highlights the crucial role of interdisciplinary collaboration in advancing the field. Neuromorphic ionic computing is not merely a technological innovation; it represents a substantial step toward sustainable computation, aligning with the growing demand for energy-conscious solutions in a world that is increasingly reliant on data and computation.

Neuromorphic↗

Subnetwork representation learning for discovering network biomarkers in predicting lymph node metastasis in early oral cancer

Cervical lymph node metastasis is the leading cause of poor prognosis in oral tongue squamous cell carcinoma and also occurs in the early stages. The current clinical diagnosis depends on a physical examination that is not enough to determine whether micrometastasis remains. The transcriptome profiling technique has shown great potential for predicting micrometastasis by capturing the dynamic activation state of genes. However, there are several technical challenges in using transcriptome data to model patient conditions: (1) An Insufficient number of samples compared to the number of genes, (2) Complex dependence between genes that govern the cancer phenotype, and (3) Heterogeneity between patients between cohorts that differ geographically and racially. We developed a computational framework to learn the subnetwork representation of the transcriptome to discover network biomarkers and determine the potential of metastasis in early oral tongue squamous cell carcinoma. Our method achieved high accuracy in predicting the potential of metastasis in two geographically and racially different groups of patients. The robustness of the model and the reproducibility of the discovered network biomarkers show great potential as a tool to diagnose lymph node metastasis in early oral cancer.

59 BASIC BIOLOGICAL SCIENCES↗

Dynamic Diketoenamine Crosslinking Unlocks Vinyl Polymer Vitrimers From β ‐Triketone Chemistry

Covalent adaptable networks (CANs) offer a compelling strategy to unite the mechanical robustness of thermosets with the reprocessability of thermoplastics, yet achieving simultaneous durability, processability, and true recyclability remains challenging. We introduce diketoenamine (DKE) vitrimers derived from β-triketone methacrylate monomers and demonstrate how rational monomer design dictates network processability, viscoelasticity, and recyclability. By systematically varying the spacer length between the β-triketone (TK) moiety and the polymer backbone, we identify a key structure–property relationship that dictates vitrimer behavior. Networks bearing TK pendants minimally displaced from the backbone suppress creep but exhibit limited stress relaxation, whereas extended spacers yield lower glass transition temperatures, higher effective crosslink densities, and efficient stress dissipation, enabling optical transparency and reprocessability. Extending this platform to ultra-high molecular-weight prepolymers introduces physical entanglements as secondary crosslinks, further enhancing dimensional stability without compromising processability. Both mechanical and chemical recycling validate the closed-loop circularity of these materials. Furthermore, these results establish TK methacrylates as a versatile platform for designing high-performance vitrimers that integrate durability, reprocessability, and true closed-loop recyclability.

closed-loop recyclability↗

5G-TSN Architecture Capable of Providing Real-time Situational Awareness to Fossil-Energy (FE) Generation Systems (Final Technical Report)

This final report highlights the comprehensive achievements of the project focused on developing and validating a 5G-Time Sensitive Networking (TSN) architecture tailored for real-time operational awareness in fossil energy systems. The initiative successfully advanced through a series of technical milestones, including the integration of EMI-aware network models, deployment of advanced simulation frameworks, and real-world performance characterization at key sites such as UTEP and Fabens. Through the strategic use of NetSim® software, the team created and validated network configurations for wired and wireless environments, tested under varying congestion conditions, and verified network slicing implementations for URLLC-specific applications. Major accomplishments include the migration of simulation tools to the latest NetSim® version to support accurate modeling of TSN and network slicing, extensive EMI measurement campaigns, and the development of a robust simulation model for end-to-end SCADA system integration. Simulations compared both TDD and FDD duplexing modes, revealing insights into their performance under congested conditions. The wireless network was benchmarked for throughput, jitter, and delay metrics, aligning with 3GPP Release 15/16 and IEEE 802.1-TSN standards. A peer-reviewed conference paper was accepted and published, contributing to the broader academic and industrial discourse on 5G-TSN integration in energy systems, in addition to a journal article. Despite minor delays due to software limitations, the project achieved its objectives and delivered validated architecture ready for deployment in advanced energy network environments.

01 COAL, LIGNITE, AND PEAT↗

Constraining Galaxy-Halo connection using machine learning

We investigate the potential of machine learning (ML) methods to model small-scale galaxy clustering for constraining Halo Occupation Distribution (HOD) parameters. Our analysis reveals that while many ML algorithms report good statistical fits, they often yield likelihood contours that are significantly biased in both mean values and variances relative to the true model parameters. This highlights the importance of careful data processing and algorithm selection in ML applications for galaxy clustering, as even seemingly robust methods can lead to biased results if not applied correctly. ML tools offer a promising approach to exploring the HOD parameter space with significantly reduced computational costs compared to traditional brute-force methods if their robustness is established. Using our ANN-based pipeline, we successfully recreate some standard results from recent literature. Properly restricting the HOD parameter space, transforming the training data, and carefully selecting ML algorithms are essential for achieving unbiased and robust predictions. Among the methods tested, artificial neural networks (ANNs) outperform random forests (RF) and ridge regression in predicting clustering statistics, when the HOD prior space is appropriately restricted. We demonstrate these findings using the projected two-point correlation function (w p (r p )), angular multipoles of the correlation function (ξ ℓ (r)), and the void probability function (VPF) of Luminous Red Galaxies from Dark Energy Spectroscopic Instrument mocks. Our results show that while combining w p (r p ) and VPF improves parameter constraints, adding the multipoles ξ 0 , ξ 2 , and ξ 4 to w p (r p ) does not significantly improve the constraints.

cosmology↗

Optimized active layer morphology toward efficient and polymer batch insensitive organic solar cells

Abstract Morphology control in laboratory and industry setting remains as a major challenge for organic solar cells (OSCs) due to the difference in film-drying kinetics between spin coating and the printing process. A two-step sequential deposition method is developed to control the active layer morphology. A conjugated polymer that self-assembles into a well-defined fibril structure is used as the first layer, and then a non-fullerene acceptor is introduced into the fibril mesh as the second layer to form an optimal morphology. A benefit of the combined fibril network morphology and non-fullerene acceptor properties was that a high efficiency of 16.5% (certified as 16.1%) was achieved. The preformed fibril network layer and the sequentially deposited non-fullerene acceptor form a robust morphology that is insensitive to the polymer batches, solving a notorious issue in OSCs. Such progress demonstrates that the utilization of polymer fibril networks in a sequential deposition process is a promising approach towards the fabrication of high-efficiency OSCs.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Deep neural network uncertainty quantification for LArTPC reconstruction

We evaluate uncertainty quantification (UQ) methods for deep learning applied to liquid argon time projection chamber (LArTPC) physics analysis tasks. As deep learning applications enter widespread usage among physics data analysis, neural networks with reliable estimates of prediction uncertainty and robust performance against overconfidence and out-of-distribution (OOD) samples are critical for their full deployment in analyzing experimental data. While numerous UQ methods have been tested on simple datasets, performance evaluations for more complex tasks and datasets are scarce. Here we assess the application of selected deep learning UQ methods on the task of particle classification using the PiLArNet monte carlo 3D LArTPC point cloud dataset. We observe that UQ methods not only allow for better rejection of prediction mistakes and OOD detection, but also generally achieve higher overall accuracy across different task settings. We assess the precision of uncertainty quantification using different evaluation metrics, such as distributional separation of prediction entropy across correctly and incorrectly identified samples, receiver operating characteristic curves (ROCs), and expected calibration error from observed empirical accuracy. We conclude that ensembling methods can obtain well calibrated classification probabilities and generally perform better than other existing methods in deep learning UQ literature.

47 OTHER INSTRUMENTATION↗

A Bilevel Approach for Identifying the Worst Contingencies for Nonconvex Alternating Current Power Systems

We address the bilevel optimization problem of identifying the most critical attacks to an alternating current (AC) power flow network. The upper-level binary maximization problem consists of choosing an attack that is treated as a parameter in the lower-level defender minimization problem. Instances of the lower-level global minimization problem by themselves are NP-hard due to the nonconvex AC power flow constraints, and bilevel solution approaches commonly apply a convex relaxation or approximation to allow for tractable bilevel reformulations at the cost of underestimating some power system vulnerabilities. Our main contribution is to provide an alternative branch-and-bound algorithm whose upper bounding mechanism (in a maximization context) is based on a reformulation that avoids relaxation of the AC power flow constraints in the lower-level defender problem. Lower bounding is provided with semidefinite programming (SDP) relaxed solutions to the lower-level problem. We establish finite termination with guarantees of either a globally optimal solution to the original bilevel problem, or a globally optimal solution to the SDP-relaxed bilevel problem which is included in a vetted list of upper-level attack solutions, at least one of which is a globally optimal solution to the bilevel problem. We demonstrate through computational experiments applied to IEEE case instances both the relevance of our contribution, and the effectiveness of our contributed algorithm for identifying power system vulnerabilities without resorting to convex relaxations of the lower-level problem. We conclude with a discussion of future extensions and improvements.

97 MATHEMATICS AND COMPUTING↗