Search NASA⌕ Search

SEARCH · Search NASA

Results for “Network inference”

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 1,063 records · Page 59

Adaptive Classification of Landscape Process and Function: An Integration of Geoinformatics and Self-Organizing Maps

The advanced geospatial information extraction and analysis capabilities of a Geographic Information System (GISs) and Artificial Neural Networks (ANNs), particularly Self-Organizing Maps (SOMs), provide a topology-preserving means for reducing and understanding complex data relationships in the landscape. The Adaptive Landscape Classification Procedure (ALCP) is presented as an adaptive and evolutionary capability where varying types of data can be assimilated to address different management needs such as hydrologic response, erosion potential, habitat structure, instrumentation placement, and various forecast or what-if scenarios. This paper defines how the evaluation and analysis of spatial and/or temporal patterns in the landscape can provide insight into complex ecological, hydrological, climatic, and other natural and anthropogenic-influenced processes. Establishing relationships among high-dimensional datasets through neurocomputing based pattern recognition methods can help 1) resolve large volumes of data into a structured and meaningful form; 2) provide an approach for inferring landscape processes in areas that have limited data available but exhibit similar landscape characteristics; and 3) discover the value of individual variables or groups of variables that contribute to specific processes in the landscape. Classification of hydrologic patterns in the landscape is demonstrated.

58 GEOSCIENCES↗

Toward FAIR Representations of Microbial Interactions

Despite an ever-growing number of data sets that catalog and characterize interactions between microbes in different environments and conditions, many of these data are neither easily accessible nor intercompatible. These limitations present a major challenge to microbiome research by hindering the streamlined drawing of inferences across studies.

59 BASIC BIOLOGICAL SCIENCES↗

Model-Based Method for Sensor Validation

Fault detection, diagnosis, and prognosis are essential tasks in the operation of autonomous spacecraft, instruments, and in situ platforms. One of NASA s key mission requirements is robust state estimation. Sensing, using a wide range of sensors and sensor fusion approaches, plays a central role in robust state estimation, and there is a need to diagnose sensor failure as well as component failure. Sensor validation can be considered to be part of the larger effort of improving reliability and safety. The standard methods for solving the sensor validation problem are based on probabilistic analysis of the system, from which the method based on Bayesian networks is most popular. Therefore, these methods can only predict the most probable faulty sensors, which are subject to the initial probabilities defined for the failures. The method developed in this work is based on a model-based approach and provides the faulty sensors (if any), which can be logically inferred from the model of the system and the sensor readings (observations). The method is also more suitable for the systems when it is hard, or even impossible, to find the probability functions of the system. The method starts by a new mathematical description of the problem and develops a very efficient and systematic algorithm for its solution. The method builds on the concepts of analytical redundant relations (ARRs).

Vatan, Farrokh↗

On the Stochastic Stability of Deep Markov Models

Deep Markov models (DMM) are generative models which are scalable and expressive generalization of Markov models for representation, learning, and inference problems. However, the fundamental stochastic stability guarantees of such models have not been thoroughly investigated. In this paper, we present a novel stability analysis method and provide sufficient conditions of DMM's stochastic stability. The proposed stability analysis is based on the contraction of probabilistic maps modeled by deep neural networks. We make connections between the spectral properties of neural network's weights and different types of used activation function on the stability and overall dynamic behavior of DMMs with Gaussian distributions. Based on the theory, we propose a few practical methods for designing constrained DMMs with guaranteed stability. We empirically substantiate our theoretical results via intuitive numerical experiments using the proposed stability constraints.

Drgona, Jan↗

Microscopy modality transfer of steel microstructures: Inferring scanning electron micrographs from optical microscopy using generative AI

Scanning electron microscopy (SEM) is resource intensive, which limits its throughput in some applications. As an alternative, we propose applying computer vision and machine learning to generate high-quality synthetic SEM micrographs from micrographs obtained using light optical microscopy (LOM). Working with a correlated LOM/SEM dataset of dual-phase steel images, we test generative models of various architectures, including encoder-decoder networks, generative adversarial networks (GANs), and diffusion-based models. We find that the diffusion models significantly outperform other methods on both qualitative and quantitative assessments, while preserving key metallurgical meaning. This work establishes diffusion as the state-of-the-art for microscopy modality transfer and demonstrates the potential of AI-powered microscopy to enhance LOM with micron scale structural recreation.

Computer vision↗

A Statistician’s Overview of Physics-Informed Neural Networks for Spatio-Temporal Data

The recent success of deep neural network models with physical constraints (so-called, Physics-Informed Neural Networks, PINNs) has led to renewed interest in the incorporation of mechanistic information in predictive models. Statisticians and others have long been interested in this problem, which has led to several practical and innovative solutions dating back decades. In this overview, we focus on the problem of data-driven prediction and inference of dynamic spatio-temporal processes that include mechanistic information, such as would be available from partial differential equations, with a strong focus on the quantification of uncertainty associated with data, process, and parameters. Here, we give a brief review of several paradigms and focus our attention on Bayesian implementations given they naturally accommodate uncertainty quantification. We then show that it is straight-forward to include the Bayesian PINN (B-PINN) within the Bayesian hierarchical model (BHM) framework that has long been considered for modeling dynamic spatio-temporal processes. Such a BHM-PINN is illustrated via a simulation study in which a latent nonlinear Burgers’ equation PDE governs the dynamics of Poisson distributed spatio-temporal data. Supplementary materials for this article are available online, including a standardized description of the materials available for reproducing the work.

Bayesian↗

ARM-IRL: Adaptive Resilience Metric Quantification Using Inverse Reinforcement Learning

The resilience of safety-critical systems is gaining importance due to the rise in cyber and physical threats, especially within critical infrastructure. Traditional static resilience metrics may not capture dynamic system states, leading to inaccurate assessments and ineffective responses to cyber threats. This work aims to develop a data-driven, adaptive method for resilience metric learning. We propose a data-driven approach using inverse reinforcement learning (IRL) to learn a single, adaptive resilience metric. The method infers a reward function from expert control actions. Unlike previous approaches using static weights or fuzzy logic, this work applies adversarial inverse reinforcement learning (AIRL), training a generator and discriminator in parallel to learn the reward structure and derive an optimal policy. The proposed approach is evaluated on multiple scenarios: optimal communication network rerouting, power distribution network reconfiguration, and cyber–physical restoration of critical loads using the IEEE 123-bus system. The adaptive, learned resilience metric enables faster critical load restoration in comparison to conventional RL approaches.

97 MATHEMATICS AND COMPUTING↗

Spaceborne Remote Sensing of Aerosol Type: Global Distribution, Model Evaluation and Translation into Chemical Speciation

It is essential to evaluate and refine aerosol classification methods applied to passive satellite remote sensing. We have developed an aerosol classification algorithm (called Specified Clustering and Mahalanobis Classification, SCMC) that assigns an aerosol type to multi-parameter retrievals by spaceborne, airborne or ground-based passive remote sensing instruments [1]. The aerosol types identified by our scheme are pure dust, polluted dust, urban-industrialdeveloped economy, urban-industrialdeveloping economy, dark biomass smoke, light biomass smoke and pure marine. We apply the SCMC method to inversions from the ground-based AErosol RObotic NETwork (AERONET [2]) and retrievals from the space-borne Polarization and Directionality of Earths Reflectances instrument (POLDER, [3]). The POLDER retrievals that we use differ from the standard POLDER retrievals [4] as they make full use of multi-angle, multispectral polarimetric data [5]. We analyze agreement in the aerosol types inferred from both AERONET and POLDER and evaluate GEOS-Chem [6] simulations over the globe. Finally, we use in-situ observations from the SEAC4RS airborne field experiment to bridge the gap between remote sensing-inferred qualitative SCMC aerosol types and their corresponding quantitative chemical speciation. We apply the SCMC method to airborne in-situ observations from the NASA Langley Aerosol Research Group Experiment (LARGE, [7]) and the Differential Aerosol Sizing and Hygroscopicity Spectrometer Probe (DASH-SP, [8]) instruments; we then relate each coarsely defined SCMC type to a sum of percentage of individual aerosol species, using in-situ observations from the Particle Analysis by Laser Mass Spectrometry (PALMS, [9]), the Soluble Acidic Gases and Aerosol (SAGA, [10]), and the High - Resolution Time - of - Flight Aerosol Mass Spectrometer (HR ToF AMS, [11]).

airborne↗

Uncertainty-refined image segmentation under domain shift

A method for digital image segmentation is provided. The method comprises training a neural network for image segmentation with a labeled training dataset from a first domain, wherein a subset of nodes in the neural net are dropped out during training. The neural network receives image data from a second, different domain. A vector of N values that sum to 1 is calculated for each image element, wherein each value represents an image segmentation class. A label is assigned to each image element according to the class with the highest value in the vector. Multiple inferences are performed with active dropout layers for each image element, and an uncertainty value is generated for each image element. The label of any image element with an uncertainty value above a predefined threshold is replaced with a new label corresponding to the class with the next highest value.

Martinez, Carianne↗

A novel application of cosmic rays for spent nuclear fuel monitoring - 15738

Monitoring nuclear waste and controlling spent nuclear fuel at its source is one of the main strategies to minimize the risks of nuclear proliferation and reduce potential homeland threats. Storage of high level waste from a fission reactor typically involves placing spent fuel in sealed dry casks. After the spent nuclear fuel has been placed inside the dry cask, the cask is welded, not allowing for visual inspection. Conventional methods for examining the interior of materials e.g., X-rays, are limited by the fact that they cannot penetrate very dense well-shielded objects. Instead, cosmic ray muons have the potential to allow for assessment of spent nuclear fuel stored within sealed dense dry casks. Objectives: 1.Exploit the ability of cosmic ray muons to penetrate high density materials allowing the distribution of materials within the object to be inferred from the muon tracks. 2. Develop a monitoring system that tracks the path of cosmic ray muons, including their deflection and attenuation, to identify the contents of a closed dry cask. Methods: - Monte-Carlo simulations using Geant4; - Bayesian decision theory for signal classification; - Wavelet analysis for noise cancellation; - Chaotic Neural Networks for signal encryption. Results: 1. Preliminary statistical analysis proved that the method is feasible and has the ability to identify the presence of spent nuclear fuel in a dry cask. 2. Using monoenergetic muons, a dry cask with one fuel assembly missing can be correctly identified with error rate <1%. Broader merit: Once completed, the proposed project for cosmic ray muon transport will enable a new and potentially transformative approach towards efficient, inexpensive and remote cosmic ray muon applications in archaeology, medicine and safeguarding of nuclear materials.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Uncertainty-refined image segmentation under domain shift

Digital image segmentation is provided. The method comprises training a neural network for image segmentation with a labeled training dataset from a first domain, wherein a subset of nodes in the neural net are dropped out during training. The neural network receives image data from a second, different domain. A vector of N values that sum to 1 is calculated for each image element, wherein each value represents an image segmentation class. A label is assigned to each image element according to the class with the highest value in the vector. Multiple inferences are performed with active dropout layers for each image element, and an uncertainty value is generated for each image element. Uncertainty is resolved according to expected characteristics. The label of any image element with an uncertainty above a threshold is replaced with a new label corresponding to a segmentation class based on domain knowledge.

Martinez, Carianne↗

Dark Energy Survey Year 3 results: optimized $w$CDM simulation-based inference with weak lensing map-level hybrid statistics

We present cosmological constraints from the Dark Energy Survey Year 3 (DES Y3) weak lensing data using hierarchical hybrid statistics within a Bayesian simulation-based inference framework that is based on the Gower Street simulations. To maximize the precision of the inference, we have developed a new, information-theory based, data compression of the weak lensing maps to just seven highly informative summary statistics. The hybrid scheme exploits the high information content of the power spectrum, compressing both the power spectrum and neural-based summaries that are designed to extract further information. Our simulation-based approach enables principled forward modelling of all major sources of systematic uncertainty and survey properties into realistic mock observations, including the survey mask, photometric redshift uncertainties, intrinsic galaxy alignments, multiplicative shear calibration bias, source galaxy clustering, non-Gaussian shape noise, and non-linear structure formation. The summary statistics are then used in a Bayesian simulation-based inference pipeline. The inference is validated through coverage tests and checks for robustness against baryonic feedback. Assuming a $w$CDM cosmology, our analysis yields $S_8 = 0.808 \pm 0.017$, $Ω_{\rm m} = 0.325 \pm 0.024$, and $w < -0.766$ (marginalized posterior 68 per cent credible intervals). This rigorous combination of information theory, physics- and neural network-based extreme data compression, and principled Bayesian analysis improves the figure of merit for $(Ω_{\rm m}, S_8, w)$ by 60 per cent over the previous state-of-the-art, and by almost a factor of 3 over two-point analyses of the same data. They are the most precise joint constraints on $(Ω_{\rm m}, S_8, w)$ from weak gravitational lensing data alone of any survey to date. We intend to apply this analysis to the more recent DES Y6 data.

Williamson, J. [University Coll. London]↗

Privacy Vulnerability of Published Anonymous Mobility Traces

Mobility traces of people and vehicles have been collected and published to assist the design and evaluation of mobile networks, such as large-scale urban sensing networks. Although the published traces are often made anonymous in that the true identities of nodes are replaced by random identifiers, the privacy concern remains. This is because in real life, nodes are open to observations in public spaces, or they may voluntarily or inadvertently disclose partial knowledge of their whereabouts. Thus, snapshots of nodes’ location information can be learned by interested third parties, e.g., directly through chance/engineered meetings between the nodes and their observers, or indirectly through casual conversations or other information sources about people. In this paper, we investigate how an adversary, when equipped with a small amount of the snapshot information termed as side information, can infer an extended view of the whereabouts of a victim node appearing in an anonymous trace. Our results quantify the loss of victim nodes’ privacy as a function of the nodal mobility, the inference strategies of adversaries, and any noise that may appear in the trace or the side information. Generally, our results indicate that the privacy concern is significant in that a relatively small amount of side information is sufficient for the adversary to infer the true identity (either uniquely or with high probability) of a victim in a set of anonymous traces. For instance, an adversary is able to identify the trace of 30%-50% of the victims when she has collected 10 pieces of side information about a victim.

97 MATHEMATICS AND COMPUTING↗

Structure Learning and Statistical Estimation in Distribution Networks - Part II

Limited placement of real-time monitoring devices in the distribution grid, recent trends notwithstanding, has prevented the easy implementation of demand-response and other smart grid applications. Part I of this paper discusses the problem of learning the operational structure of the grid from nodal voltage measurements. In this work (Part II), the learning of the operational radial structure is coupled with the problem of estimating nodal consumption statistics and inferring the line parameters in the grid. Based on a Linear-Coupled(LC) approximation of AC power flows equations, polynomial time algorithms are designed to identify the structure and estimate nodal load characteristics and/or line parameters in the grid using the available nodal voltage measurements. Then the structure learning algorithm is extended to cases with missing data, where available observations are limited to a fraction of the grid nodes. The efficacy of the presented algorithms are demonstrated through simulations on several distribution test cases.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Extending Symmetry-Preserving Attention Networks (SPANet) for Jet Assignment in Fully Hadronic \(t\bar{t}\) Events

Fully hadronic \(t\bar{t}\) reconstruction requires assigning reconstructed jets to the two top-quark decay branches, \(t\bar{t}\to(Wb)(Wb)\to(qqb)(qqb)\). This is a combinatorially large, symmetry-rich, and frequently underconstrained set-assignment problem due to detector effects and partial reconstructability. SPANet provides a strong symmetry-preserving baseline for this task, but its standard inference eagerly commits to a single hypothesis and does not explicitly treat branch-level reconstructability decisions. We present a two-stage extension of the SPANet pipeline for fully hadronic \(t\bar{t}\) events: (i) SPANet is modified into a proposal model that generates a shortlist of candidate jet assignments; (ii) a custom dual-head set transformer is trained to re-rank these candidates and identify reconstructible branches. Our extension gives modest improvements in candidate-selection efficiency, with SPANet achieving \(69.9\%\) and our extension achieving \(71.1\%\). Finally, an oracle study of the generated shortlist shows a substantial upper bound of \(88.5\%\) on the evaluated fully reconstructable subset, suggesting that the shortlist contains significant residual information that is not fully exploited.

Lisondodi Tada, Mateo [Puerto Rico U., Mayaguez] (↗

Horizontal crustal motion in the central and eastern Mediterranean inferred from Satellite Laser Ranging measurements

Four campaigns to acquire Satellite Laser Ranging (SLR) measurements at sites in the Mediterranean region have been completed. These measurements to the LAGEOS satellite, made largely by mobile systems, cover a time span beginning in November 1985 and ending in June 1993. The range data from 18 sites in the central and eastern Mediterranean have been simultaneously analyzed with data acquired by the remainder of the global laser tracking network. Estimates of horizontal motion were placed into a regional, northern Europe-fixed, kinematic reference frame. Uncertainties are on the order of 5 mm/yr for sites having at least four occupations by mobile systems and approach 1 mm/yr for permanently located sites with long histories of tracking. The resulting relative motion between sites in the Aegean exhibit characteristics of broadly distributed pattern of radial extension, but at rates that are about 50% larger than those implied from studies of seismic strain rates based on seismicity of magnitude 6 or greater or across the region. The motion estimated for sites in Turkey exhibit velocity components associated with the westward motion of the Anatolian Block relative to Eurasia. These results provide a present-day 'snapshot' of ongoing deformational processes as experienced by the locations occupied by SLR systems.

Smith, David E.↗

Insights into cosmological structure formation with machine learning.

Our modern understanding of cosmological structure formation posits that small matter density fluctuations present in the early Universe, as traced by the cosmic microwave background, grow via gravitational instability to form extended haloes of dark matter. A theoretical understanding of the structure, evolution and formation of dark matter haloes is an essential step towards unravelling the intricate connection between halo and galaxy formation, needed to test our cosmological model against data from upcoming galaxy surveys. Physical understanding of the process of dark matter halo formation is made difficult by the highly non-linear nature of the haloes' evolution. I describe a new approach to gain physical insight into cosmological structure formation based on machine learning. This approach combines the ability of machine learning algorithms to learn non-linear relationships, with techniques that enable us to physically interpret the learnt mapping. I describe applicatio ns of th e method, with the aim of investigating which aspects of the early universe density field impact the later formation of dark matter haloes. First I present a case where the process of halo formation is turned into a binary classification problem; the algorithm predicts whether or not dark matter `particles' in the initial conditions of a simulation will collapse into haloes of a given mass range. Second, I present its generalization to regression, where the algorithm infers the final mass of the halo to which each particle will later belong. I show that the initial tidal shear does not play a significant role compared to the initial density field in establishing final halo masses. Finally, I demonstrate that extending the framework to deep learning algorithms such as convolutional neural networks allows us to explore connections between the early universe and late time haloes beyond those studied by existing analytic approximations of halo collapse.

79 ASTRONOMY AND ASTROPHYSICS↗

Representing Complex Systems as Graphs for Debugging and Predictive Maintenance-Preliminary Thoughts

Representing complex systems as graphs enables use of mathematical tools to identify faults or predict failures. Graph nodes correspond to individual modules or subsystems, and edges link coupled system parts. ‘Probes’ measure the node outputs, monitoring the system health for unexpected behavior. Assuming one cannot probe every point, within a system, the fault correlates to a region—not necessarily the specific location. Bayesian networks trained to understand fault patterns can accurately identify the source. The diagnostic tool described aides debugging by pinpointing system failure causes. For predictive maintenance, probe data develop probability distribution functions describing subsystem mean time to failure. Unit lifetime can be estimated through these probability distributions. Two approaches include using Bayesian classifiers to infer the system failure source and developing maintenance schedules by treating systems as collections of random variables. When failure behavior does not follow a closed form function, use of similarity models is proposed.

97 MATHEMATICS AND COMPUTING↗