Search NASA⌕ Search

SEARCH · Search NASA

Results for “Complex Network Data”

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 415 records · Page 23

Cadmium-induced testicular injury

Cadmium (Cd) is an environmental toxicant and an endocrine disruptor in humans and rodents. Several organs (e.g., kidney, liver) are affected by Cd and recent studies have illustrated that the testis is exceedingly sensitive to Cd toxicity. More important, Cd and other toxicants, such as heavy metals (e.g., lead, mercury) and estrogenic-based compounds (e.g., bisphenols) may account for the recent declining fertility in men among developed countries by reducing sperm count and testis function. In this review, we critically discuss recent data in the field that have demonstrated the Cd-induced toxicity to the testis is probably the result of interactions of a complex network of causes. This is likely to involve the disruption of the blood-testis barrier (BTB) via specific signal transduction pathways and signaling molecules, such as p38 mitogen-activated protein kinase (MAPK). We also summarize current studies on factors that confer and/or regulate the testis sensitivity to Cd, such as Cd transporters and metallothioneins, the impact of Cd on the testis as an endocrine disruptor and oxidative stress inducer, and how it may disrupt the Zn{sup 2+} and/or Ca{sup 2+} mediated cellular events. While much work is needed before a unified mechanistic pathway of Cd-induced testicular toxicity emerges, recent studies have helped to identify some of the likely mechanisms and/or events that take place during Cd-induced testis injury. Furthermore, some of the recent studies have shed lights on potential therapeutic or preventive approaches that can be developed in future studies by blocking or minimizing the destructive effects of Cd to testicular function in men.

60 APPLIED LIFE SCIENCES↗

In Vitro Calcite Crystal Morphology Is Modulated by Otoconial Proteins Otolin-1 and Otoconin-90

Otoconia are formed embryonically and are instrumental in detecting linear acceleration and gravity. Degeneration and fragmentation of otoconia in elderly patients leads to imbalance resulting in higher frequency of falls that are positively correlated with the incidence of bone fractures and death. In this work we investigate the roles otoconial proteins Otolin-1 and Otoconin 90 (OC90) perform in the formation of otoconia. We demonstrate by rotary shadowing and atomic force microscopy (AFM) experiments that Otolin-1 forms homomeric protein complexes and self-assembled networks supporting the hypothesis that Otolin-1 serves as a scaffold protein of otoconia. Our calcium carbonate crystal growth data demonstrate that Otolin-1 and OC90 modulate in vitro calcite crystal morphology but neither protein is sufficient to produce the shape of otoconia. Coadministration of these proteins produces synergistic effects on crystal morphology that contribute to morphology resembling otoconia.

59 BASIC BIOLOGICAL SCIENCES↗

Dynamic Topology Reconfiguration of Boltzmann Machines on Quantum Annealers

Boltzmann machines have useful roles in deep learning applications, such as generative data modeling, initializing weights for other types of networks, or extracting efficient representations from high-dimensional data. Most Boltzmann machines use restricted topologies that exclude looping connectivity, as such connectivity creates complex distributions that are difficult to sample. We have used an open-system quantum annealer to sample from complex distributions and implement Boltzmann machines with looping connectivity. Further, we have created policies mapping Boltzmann machine variables to the quantum bits of an annealer. These policies, based on correlation and entropy metrics, dynamically reconfigure the topology of Boltzmann machines during training and improve performance.

Liu, Jeremy (ORCID:0000000172299417)↗

Fault diagnosis and severity estimation in nuclear power plants - 196

Signed Directed Graph (SDG) is a type of fault diagnosis method with a capability to display the complex relationship between plant parameters and reveal the potential danger and the propagation path when a fault occurs in a nuclear plant. However, the fault diagnosis method based on qualitative SDG model inevitably has a number of disadvantages, and some of these disadvantages include its inability to identify reoccurring faults; ambiguous reasoning that can result in low resolution; performance that relies on the accuracy of the model; slow diagnosis rate for large systems and poor real-time diagnosis, among others. In this paper, we propose an SDG fault diagnosis methodology based on Granular Computing Theory, referred to as Granular Computing Signed Directed Graph (GCSDG). This paper shows how knowledge reduction nature of granular computing based fault diagnosis can simplify the decision table, reduce the allocation of resources, scale-down the complexity of the problem and improve the efficiency of data processing. Then, we estimate the severity of the fault using Back Propagation (BP) neural network approach. The proposed methodology was verified by considering certain faults in the primary loop of a PWR, using PCTRAN. The result shows a considerable improvement in fault diagnosis and the severity estimated serves as a useful information for the operator, providing a firm foundation for further intervention. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Neural chaos: A spectral stochastic neural operator

Building surrogate models for operators with uncertainty quantification capabilities is essential for many engineering applications where randomness–such as variability in material properties, boundary conditions, and initial conditions–is unavoidable. Polynomial Chaos Expansion (PCE) is widely recognized as a go-to method for constructing stochastic surrogates in both intrusive and non-intrusive ways, and it has recently been used in the context of operator learning. However, its application becomes challenging for complex or high-dimensional processes, as achieving accuracy requires higher-order polynomials, which can increase computational demand and/or the risk of overfitting. Furthermore, PCE requires specialized treatments to manage random variables that are not independent, and these treatments may be problem-dependent or may fail with increasing complexity. Here, in this work, we adopt the same formalism as the spectral expansion used in PCE; however, we replace the classical polynomial basis functions with neural network (NN) basis functions to leverage their expressivity. To achieve this, we propose an algorithm that identifies NN-parameterized basis functions in a purely data-driven manner, without any prior assumptions about the joint distribution of the random variables involved, whether independent or dependent, or about their marginal distributions. The proposed algorithm identifies each NN-parameterized basis function sequentially, ensuring they are orthogonal with respect to the data distribution. The basis functions are constructed directly on the joint stochastic variables without requiring a tensor product structure or assuming independence of the random variables. This approach may offer greater flexibility for complex stochastic models, while simplifying implementation compared to the tensor product structures typically used in PCE to handle random vectors. This is particularly advantageous given the current state of open-source packages, where building and training neural networks can be done with just a few lines of code and extensive community support. We demonstrate the effectiveness of the proposed scheme through several numerical examples of varying complexity and provide comparisons with classical PCE.

Polynomial chaos expansion↗

A Multi-Branch Decoder Network Approach to Adaptive Temporal Data Selection and Reconstruction for Big Scientific Simulation Data

A key challenge in scientific simulation is that the simulation outputs often require intensive I/O and storage space to store the results for effective post hoc analysis. This article focuses on a quality-aware adaptive temporal data selection and reconstruction problem where the goal is to adaptively select simulation data samples at certain key timesteps in situ and reconstruct the discarded samples with quality assurance during post hoc analysis. This problem is motivated by the limitation of current solutions that a significant amount of simulation data samples are either discarded or aggregated during the sampling process, leading to inaccurate modeling of the simulated phenomena. Two unique challenges exist: 1) the sampling decisions have to be made in situ and adapted to the dynamics of the complex scientific simulation data; 2) the reconstruction error must be strictly bounded to meet the application requirement. To address the above challenges, we develop DeepSample , an error-controlled convolutional neural network framework, that jointly integrates a set of coherent multi-branch deep decoders to effectively reconstruct the simulation data with rigorous quality assurance. The results on two real-world scientific simulation applications show that DeepSample significantly outperforms other state-of-the-art methods on both sampling efficiency and reconstructed simulation data quality.

Zhang, Yang↗

Attack-resilient algorithms and testbed federation for wide-area protection and control in smart grid

Today’s energy infrastructure is undergoing a massive transformation across all generation, transmission, and distribution systems to provide reliability, efficiency, and sustainability to the power system network. During the past 10 years, there has been a remarkable enhancement in developing close-loop wide-area protection and control (WAPAC) applications, such as automatic generation control (AGC), wide-area protection scheme (WAPS), synchrophasor-based wide-area voltage control system (WAVCS), etc., in the energy management system (EMS) to provide an adequate situational awareness to control center operators during physical disturbances and natural events. The rapid digitalization, unencrypted communication, and numerous data-sharing devices have increased digital access points that have exposed the grid network to countless cyberattacks pertinent to the WAPAC cybersecurity. Given the amount of complex grid network coupled with legacy infrastructures, it is untrustworthy to completely rely on information technology (IT)-based conventional security measures to defend against evolving cyberattacks. Hence, there is a compelling need to go beyond the traditional paradigm of ‘security by obscurity’ and ‘bolt-on’ security measures, and develop a suite of innovative security solutions at multiple layers to transform the current “fault-resilient” grid into “fault and attack-resilient” grid of the future. This dissertation specifically focuses on developing application-specific attack-resilient solutions for critical WAPAC applications in the smart grid. The first part of the study, Attack-Resilient Wide-Area Protection Scheme, presents a cyber-physical attack-resilient system (CPARS) for WAPS, where two anomaly detection methods are proposed to detect multi-level cyberattacks followed by the rules-based intrusion mitigation system (RIMS) to initiate effective mitigation strategies, tailored to these attacks, to restore the normal grid operation after disturbances. The first anomaly detection component, Machine learning-based Anomaly Detection for Centralized WAPS, discusses a novel architecture and methodology for developing a machine-learning-based anomaly detection system (ADS) for the centralized wide-area protection system (CWAPS) by applying the variational mode decomposition (VMD) technique and decision tree (DT) algorithms using cyber logs and synchrophasor measurements. The second component, Multi-Agent-based Anomaly Detection for Decentralized WAPS, presents a two-level hierarchical multi-agent-based decentralized WAPS against the system-aware stealthy cyber-attacks. Finally, for the RIMS, the state transition diagram-based mitigation measures are defined based on the grid operation states and experimental testing and evaluation are presented in a cyber-physical testbed environment. The second part of the study, Attack-Resilient Wide-Area Voltage Control System, addresses the existing vulnerabilities in the wide-area voltage control system (WAVCS), presents the methodology for performing an impact analysis during data integrity attacks, and proposes a data-driven attackresilient system (DARS) by incorporating machine learning-based ADS and rules-based anomaly mitigation system (RAMS) to detect these attacks and provide necessary mitigation actions to maintain the transient voltage stability after disturbances. Finally, the third part, Networked Federation Testbed (NEFTSec) for Smart Grid Cybersecurity, focuses on developing an interconnected federated testbed through a common network like the internet, describes its conceptual architectures, and also presents its design components for experimental testing, validation, and evaluation. Further, it presents the co-simulation interface algorithm (CIA) to facilitate the geographically-dispersed real-time distributed simulation (GD-RTDS) during the cyber-physical federation. In general, this dissertation presents innovative attack-resilient solutions for WAPAC applications that are experimentally tested and evaluated using the PowerCyber testbed and NEFTSec platform to accelerate the transition of state-of-the-art research works to the real-field deployments.

24 POWER TRANSMISSION AND DISTRIBUTION↗

On Concavity and Utilization Analytics of Wide-Area Network Transport Protocols

Wide-area data transfers in high-performance computing infrastructures and big data applications are increasingly carried over dynamically provisioned dedicated network connections, which provide high capacities with no competing traffic. Throughput of TCP and UDT over wide-area connections depends, often in a complex non-linear way, on the congestion control mechanism, buffer sizes, and the number of parallel streams. In addition, our extensive TCP and UDT throughput measurements and time traces over a suite of physical and emulated 10 Gbps connections with 0-366 ms round-trip times (RTTs) show significant statistical and temporal variations. Consequently, parameter selection and optimization for transport methods require data analytics to complement analytical throughput models. We present analytics based on the concavity-convexity of throughput profiles which provide insights into peak throughput and superior/inferior trend compared to linear interpolations based on RTT. In particular, we propose the utilization-concavity coefficient, a scalar metric that incorporates both utilization and concavity profile to characterize the overall performance of a transport protocol. These measurements-based anaytics enable us to select a transport protocol and its parameters for a given host and connection configuration to achieve high throughput with statistical guarantees.

Rao, Nageswara↗

Challenges and Solutions for Real-Time Phasor Modeling of Large-scale Distribution Network with High PV Penetration

The conversion process of a practical large-scale feeder data from a quasi-static time series (OpenDSS) model into a real-time phasor model (ePHASORSIM in Opal-RT) is discussed in the paper. The process is implemented using an open source Python software. Previous reported implementations for the conversion process lead to several errors when applied to a larger-scale system such as the one considered here. Hence in this work, we describe the common issues in this conversion and propose a customized solution to enhance the efficiency of the conversion and reduce the complexity in the process. A quantitative validation of the enhanced conversion process is presented in this work using an actual high PV penetration feeder model that consists of 2230 buses, and using actual load and PV profile data. After a detailed analysis, this customized conversion software will be made available as an open source tool and is expected to be helpful for researchers who want to pursue a similar conversion. Solutions to various observed issues such as identifying the lines due to islanded network, representation of full impedance model of transformer/lines as sequential models, complexity in the representation of single phase buses/lines as three phase buses/lines to make it compatible with the simulator platform are discussed. Comparison of power flow and time series simulation results obtained from both OpenDSS and ePHASORsim models show very low errors, validating the accuracy of the proposed conversion process.

14 SOLAR ENERGY↗

Predicting rare events using neural networks and short-trajectory data

Estimating the likelihood, timing, and nature of events is a major goal of modeling stochastic dynamical systems. When the event is rare in comparison with the timescales of simulation and/or measurement needed to resolve the elemental dynamics, accurate prediction from direct observations becomes challenging. In such cases a more effective approach is to cast statistics of interest as solutions to Feynman-Kac equations (partial differential equations). Here, we develop an approach to solve Feynman-Kac equations by training neural networks on short-trajectory data. Our approach is based on a Markov approximation but otherwise avoids assumptions about the underlying model and dynamics. This makes it applicable to treating complex computational models and observational data. Additionally, we illustrate the advantages of our method using a low-dimensional model that facilitates visualization, and this analysis motivates an adaptive sampling strategy that allows on-the-fly identification of and addition of data to regions important for predicting the statistics of interest. Finally, we demonstrate that we can compute accurate statistics for a 75-dimensional model of sudden stratospheric warming. This system provides a stringent test bed for our method.

97 MATHEMATICS AND COMPUTING↗

Optimization-Based Data-Driven Approach for Detecting Fault Location in Power Systems

In grids with large penetration of converterinterfaced resources (CIRs), measurements of voltage, current, and line parameters can fluctuate significantly during fault conditions. These fluctuations, combined with complex network topologies and extensive system branching, make accurate fault location challenging. Faults, such as short circuits, can cause prolonged outages with serious socio-economic impacts, highlighting the need for rapid fault identification to minimize downtime. However, current fault detection methods—such as relays and digital fault recorders—often relay information too slowly, impeding swift corrective action. Given the limited availability of high-resolution phasor measurement units, this paper introduces an optimization-based observer to estimate fault locations, grid line parameters, and voltages using local CIR measurements. To preserve the confidentiality of CIRs and enhance estimation accuracy, this study uses a black-box model of CIRs. This bottom-up, event-driven approach can enhances protection and control systems through optimized and real-time fault detection. Simulation results show that the optimization-based data-driven observer can accurately detect fault locations and estimate grid states and parameters, providing valuable insights for utilities and operators in grid applications.

Subedi, Sunil [ORNL] (ORCID:000000034069090X)↗

Physics-informed machine learning

Despite great progress in simulating multiphysics problems using the numerical discretization of partial differential equations (PDEs), one still cannot seamlessly incorporate noisy data into existing algorithms, mesh generation remains complex, and high-dimensional problems governed by parameterized PDEs cannot be tackled. Moreover, solving inverse problems with hidden physics is often prohibitively expensive and requires different formulations and elaborate computer codes. Machine learning has emerged as a promising alternative, but training deep neural networks requires big data, not always available for scientific problems. Instead, such networks can be trained from additional information obtained by enforcing the physical laws (for example, at random points in the continuous space-time domain). Such physics-informed learning integrates (noisy) data and mathematical models, and implements them through neural networks or other kernel-based regression networks. Moreover, it may be possible to design specialized network architectures that automatically satisfy some of the physical invariants for better accuracy, faster training and improved generalization. Furthermore, we review some of the prevailing trends in embedding physics into machine learning, present some of the current capabilities and limitations and discuss diverse applications of physics-informed learning both for forward and inverse problems, including discovering hidden physics and tackling high-dimensional problems.

97 MATHEMATICS AND COMPUTING↗

Pileup Mitigation with Machine Learning (PUMML)

Pileup involves the contamination of the energy distribution arising from the primary collision of interest (leading vertex) by radiation from soft collisions (pileup). We develop a new technique for removing this contamination using machine learning and convolutional neural networks. The network takes as input the energy distribution of charged leading vertex particles, charged pileup particles, and all neutral particles and outputs the energy distribution of particles coming from leading vertex alone. The PUMML algorithm performs remarkably well at eliminating pileup distortion on a wide range of simple and complex jet observables. We test the robustness of the algorithm in a number of ways and discuss how the network can be trained directly on data.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Link statistics of dislocation network during strain hardening

Dislocations are line defects in crystals that multiply and self-organize into a complex network during strain hardening. The length of dislocation links, connecting neighboring nodes within this network, contains crucial information about the evolving dislocation microstructure. By analyzing data from Discrete Dislocation Dynamics (DDD) simulations in face-centered cubic (fcc) Cu, we characterize the statistical distribution of link lengths of dislocation networks during strain hardening on individual slip systems. Here, our analysis reveals that link lengths on active slip systems follow a double-exponential distribution, while those on inactive slip systems conform to a single-exponential distribution. The distinctive long tail observed in the double-exponential distribution is attributed to the stress-induced bowing out of long links on active slip systems, a feature that disappears upon removal of the applied stress. We further demonstrate that both observed link length distributions can be explained by extending a one-dimensional Poisson process to include different growth functions. Specifically, the double-exponential distribution emerges when the growth rate for links exceeding a critical length becomes super-linear, which aligns with the physical phenomenon of long links bowing out under stress. This work advances our understanding of dislocation microstructure evolution during strain hardening and elucidates the underlying physical mechanisms governing its formation.

Crystal plasticity↗

Accelerating defect predictions in semiconductors using graph neural networks

First-principles computations reliably predict the energetics of point defects in semiconductors but are constrained by the expense of using large supercells and advanced levels of theory. Machine learning models trained on computational data, especially ones that sufficiently encode defect coordination environments, can be used to accelerate defect predictions. Here, we develop a framework for the prediction and screening of native defects and functional impurities in a chemical space of group IV, III–V, and II–VI zinc blende semiconductors, powered by crystal Graph-based Neural Networks (GNNs) trained on high-throughput density functional theory (DFT) data. Using an innovative approach of sampling partially optimized defect configurations from DFT calculations, we generate one of the largest computational defect datasets to date, containing many types of vacancies, self-interstitials, anti-site substitutions, impurity interstitials and substitutions, as well as some defect complexes. We applied three types of established GNN techniques, namely crystal graph convolutional neural network, materials graph network, and Atomistic Line Graph Neural Network (ALIGNN), to rigorously train models for predicting defect formation energy (DFE) in multiple charge states and chemical potential conditions. We find that ALIGNN yields the best DFE predictions with root mean square errors around 0.3 eV, which represents a prediction accuracy of 98% given the range of values within the dataset, improving significantly on the state-of-the-art. We further show that GNN-based defective structure optimization can take us close to DFT-optimized geometries at a fraction of the cost of full DFT. The current models are based on the semi-local generalized gradient approximation-Perdew–Burke–Ernzerhof (PBE) functional but are highly promising because of the correlation of computed energetics and defect levels with higher levels of theory and experimental data, the accuracy and necessity of discovering novel metastable and low energy defect structures at the PBE level of theory before advanced methods could be applied, and the ability to train multi-fidelity models in the future with new data from non-local functionals. The DFT-GNN models enable prediction and screening across thousands of hypothetical defects based on both unoptimized and partially optimized defective structures, helping identify electronically active defects in technologically important semiconductors.

Rahman, Md Habibur (ORCID:000000027705984X)↗

Networked Microgrid Ownership, Data, and Control Implications: Challenges and Open Questions

Microgrid deployments increasingly favor the potential to form networks for greater benefits to resilience, reliability, and energy sovereignty. Both independent and networked micro-grids predominantly have a single-entity-ownership and control, where the associations from ownership to data requirements to control functions to microgrid objectives is linear. The emerging model, however, is cyclical, with bidirectional causal impacts between each of the 4 pillars: there are more complex mixed ownership models across the physical, electrical, data, communications, protection, and control boundaries that impact the data requirements for meeting control functions that help realize the use-cases or objectives. This paper is the first to delineate the pillars for effective ownership and controllability of both independent as well as networked microgrids through the cyclical model, and present barriers to the adoption of such a model.

Sundararajan, Aditya↗

PROPERTIES OF INTERSTELLAR TURBULENCE FROM GRADIENTS OF LINEAR POLARIZATION MAPS

Faraday rotation of linearly polarized radio signals provides a very sensitive probe of fluctuations in the interstellar magnetic field and ionized gas density resulting from magnetohydrodynamic (MHD) turbulence. We used a set of statistical tools to analyze images of the spatial gradient of linearly polarized radio emission (|{nabla}P|) for both observational data from a test image of the Southern Galactic Plane Survey (SGPS) and isothermal three-dimensional simulations of MHD turbulence. Visually, in both observations and simulations, a complex network of filamentary structures is seen. Our analysis shows that the filaments in |{nabla}P| can be produced both by interacting shocks and random fluctuations characterizing the non-differentiable field of MHD turbulence. The latter dominates for subsonic turbulence, while the former is only present in supersonic turbulence. We show that supersonic and subsonic turbulence exhibit different distributions as well as different morphologies in the maps of |{nabla}P|. Particularly, filaments produced by shocks show a characteristic 'double jump' profile at the sites of shock fronts resulting from delta function-like increases in the density and/or magnetic field, while those produced by subsonic turbulence show a single jump profile. In order to quantitatively characterize these differences, we use the topology tool known as the genus curve as well as the probability distribution function moments of the image distribution. We find that higher values for the moments correspond to cases of |{nabla}P| with larger sonic Mach numbers. The genus analysis of the supersonic simulations of |{nabla}P| reveals a 'swiss cheese' topology, while the subsonic cases have characteristics of a 'clump' topology. Based on the analysis of the genus and the higher order moments, the SGPS test region data have a distribution and morphology that match subsonic- to transonic-type turbulence, which confirms what is now expected for the warm ionized medium.

79 ASTRONOMY AND ASTROPHYSICS↗

A neural network for determination of latent dimensionality in Nonnegative Matrix Factorization

Non-negative Matrix Factorization (NMF) has proven to be a powerful unsupervised learning method for uncovering hidden features in complex and noisy datasets with applications in data mining, text recognition, dimension reduction, face recognition, anomaly detection, blind source separation, and many other fields. An important input for NMF is the latent dimensionality of the data, that is, the number of hidden features, K, present in the explored dataset. Unfortunately, and this quantity is rarely known a priori. The existing methods for determining latent dimensionality, such as Automatic Relevance Determination (ARD), are mostly heuristic and utilize different characteristics to estimate the number of hidden features. However, all of them require human presence to make a final determination of K. Here we utilize a supervised machine learning approach in combination with a recent method for model determination, called NMFk, to determine the number of hidden features automatically. NMFk performs a set of NMF simulations on an ensemble of matrices, obtained by bootstrapping the initial dataset, and estimates which K produces stable groups of latent features that reconstruct the initial dataset well. We then train a Multi-Layter Perceptron (MLP) classifier network to determine the correct number of latent features utilizing the statistics and characteristics of the NMF solution, obtained from NMFk. In order to train the MLP classifier, a training set of 58,660 matrices with predetermined latent features were factorized with NMFk. The MLP classifier in conjunction with NMFk maintains a greater than 95% success rate when applied to a held out test set. Additionally, when applied to two well-known benchmark datasets, the swimmer and MIT face data, NMFk/MLP correctly recovers the established number of hidden features. Finally, we compare the accuracy of our method to the ARD, AIC and Stability-based methods.

97 MATHEMATICS AND COMPUTING↗