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 253 records · Page 14

Graphical models for optimal power flow

Optimal power flow (OPF) is the central optimization problem in electric power grids. Although solved routinely in the course of power grid operations, it is known to be strongly NP-hard in general, and weakly NP-hard over tree networks. In this paper, we formulate the optimal power flow problem over tree networks as an inference problem over a tree-structured graphical model where the nodal variables are low-dimensional vectors. We adapt the standard dynamic programming algorithm for inference over a tree-structured graphical model to the OPF problem. Combining this with an interval discretization of the nodal variables, we develop an approximation algorithm for the OPF problem. Further, we use techniques from constraint programming (CP) to perform interval computations and adaptive bound propagation to obtain practically efficient algorithms. Compared to previous algorithms that solve OPF with optimality guarantees using convex relaxations, our approach is able to work for arbitrary tree-structured distribution networks and handle mixed-integer optimization problems. Further, it can be implemented in a distributed message-passing fashion that is scalable and is suitable for “smart grid” applications like control of distributed energy resources. In conclusion, numerical evaluations on several benchmark networks show that practical OPF problems can be solved effectively using this approach.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Differentially Private Generation of Social Networks via Exponential Random Graph Models

Many social networks contain sensitive relational information. One approach to protect the sensitive relational information while offering flexibility for social network research and analysis is to release synthetic social networks at a pre-specified privacy risk level, given the original observed network. In this work, we propose the DP-ERGM procedure that synthesizes networks that satisfy the differential privacy (DP) via the exponential random graph model (EGRM). We apply DP-ERGM to a college student friendship network and compare its original network information preservation in the generated private networks with two other approaches: differentially private DyadWise Randomized Response (DWRR) and Sanitization of the Conditional probability of Edge given Attribute classes (SCEA). The results suggest that DP-EGRM preserves the original information significantly better than DWRR and SCEA in both network statistics and inferences from ERGMs and latent space models. In addition, DP-ERGM satisfies the node DP, a stronger notion of privacy than the edge DP that DWRR and SCEA satisfy.

97 MATHEMATICS AND COMPUTING↗

AI-driven Neutrino Beam Diagnostics for Next-Generation Neutrino Experiments

The accelerator-driven beam uncertainty limits oscillation measurements in long-baseline neutrino experiments. Spill-resolved beam diagnostics and real-time inference are necessary to address these neutrino flux systematics. As such, we present a machine-learning-based beam monitoring framework developed and validated using data from the T2K experiment. Our approach uses downstream, spill-by-spill muon monitor observables to predict upstream parameters such as proton beam position and width. We achieve high predictive accuracy on nominal runs, demonstrating robust baseline performance whether the model is trained on stable runs or systematically varied conditions. The framework is designed to be robust against domain shifts, allowing the neural network architectures and inference strategies developed with T2K data to be retrained and validated using LBNF simulations, with the goal of eventual deployment under real LBNF/DUNE operating conditions. This scalable approach to real-time beam inference offers a pathway toward reducing flux systematics for next-generation neutrino experiments such as DUNE.

Aney, Noah [Fermilab; U. Chicago (main)]↗

An ANFIS-based on B2C electronic commerce transaction

The purpose of this study is to use an adaptive-network-based fuzzy inference system to model a fuzzy logic-based system (FIS) for supporting decision-making process in B2C electronic commerce transaction. Firstly we introduce FIS in B2C electronic commerce transaction and ANFIS. Then we use ANFIS to model FIS with different membership functions(MF). Lastly we give a conclusion.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

AWB-GCN: A Graph Convolutional Network Accelerator with Runtime Workload Rebalancing

The recent development of deep learning has been mostly focusing on Euclidean data, such as images, videos, audios, etc. However, most real-world information and relation are often expressed as graphs. To efficiently learn from graph data, graph convolutional networks (GCNs) emerge as a promising approach, showing advantages in several practical applications such as social network analysis, knowledge discovery, 3D modeling, motion capturing, etc. Real-world graphs are usually extremely large and imbalanced, posting significant performance demand and design challenges on the hardware dedicated for GCN inference. In this paper, we propose an architecture design called UW-GCN to accelerate graph convolutional network inference. To tackle the major performance bottleneck from workload imbalance, we propose dynamic neighborhood stealing and remote chunk shuffling techniques, relying on hardware flexibility to achieve hardware auto-tuning under negligible area or delay overhead. Specifically, UW-GCN is able to smartly profile the sparse graph pattern while continuously adjusting the workload distribution via routing reconfiguration among parallel processing elements (PEs). The ideal configuration is then reused in the remaining iterations. To the best of our knowledge, this is the first accelerator design particularly for GCN and the first work relying on hardware auto-tuning, which is normally based on software, to achieve near-optimal workload balance in processing sparse structures.

Geng, Tong↗

An implementation of neural simulation-based inference for parameter estimation in ATLAS

Neural simulation-based inference (NSBI) is a powerful class of machine-learning-based methods for statistical inference that naturally handles high-dimensional parameter estimation without the need to bin data into low-dimensional summary histograms. Such methods are promising for a range of measurements, including at the Large Hadron Collider, where no single observable may be optimal to scan over the entire theoretical phase space under consideration, or where binning data into histograms could result in a loss of sensitivity. This work develops a NSBI framework for statistical inference, using neural networks to estimate probability density ratios, which enables the application to a full-scale analysis. It incorporates a large number of systematic uncertainties, quantifies the uncertainty due to the finite number of events in training samples, develops a method to construct confidence intervals, and demonstrates a series of intermediate diagnostic checks that can be performed to validate the robustness of the method. As an example, the power and feasibility of the method are assessed on simulated data for a simplified version of an off-shell Higgs boson couplings measurement in the four-lepton final states. This approach represents an extension to the standard statistical methodology used by the experiments at the Large Hadron Collider, and can benefit many physics analyses.

frequentist statistics↗

Computational Analysis of Interactions of the Oral Microbiota

The human oral microbiome is a complex site containing many hundreds of species with the community response of this microbiome having a large effect on human health. The complexity of this site has spoken to the need for applying –omics techniques to better understand which microbial species are present, their contribution to the microbiome and how this may change as a function of disease. The kinds of datasets that emerge from these –omics studies require computational analysis to gain robust results. New research has also been focused on applying these methods to build computational networks and models that better describe the myriad of interactions between microbial species of the oral cavity and how this changes as a result of infection. In this work, I describe the state of the field at this point, what kinds of computational networks have been inferred and what they show. I also describe where the field is heading in the next few years and how more in depth –omics analysis can lead to more detailed models of interactions at this site and improve human health.

-omics↗

Breaking the Window of Detection: Using Multi-Scale Solute Tracer Studies to Assess Mass Recovery at the Detection Limit

Stream solute tracers are commonly injected to assess transport and transformation in study reaches, but results are biased toward the shortest and fastest storage locations. While this bias has been understood for decades, the impact of an experimental constraint on our understanding has yet to be considered. Here, we ask how different our understanding of reach- and segment-scale transport would be if our empirical limits were extended. We demonstrate a novel approach to manipulate experimental conditions and observe mass that is stored at timescales beyond the traditional reach-scale window of detection. We are able to explain the fate of an average of 26% of solute tracer mass that would have been considered as “lost” in a traditional study design across our 14 replicates, extending our detection limits to characterize flowpaths that would have been previously unmeasured. We demonstrate how this formerly lost mass leads to predicting lower magnitudes of gross gains and losses in individual reaches, and ultimately show that the network turnover we infer from solute tracers represents an upper limit on actual, expected behavior. Finally, we review the evolution of tracer studies and their interpretation including this approach and provide a proposed future direction to extend empirical studies to not-before-seen timescales.

54 ENVIRONMENTAL SCIENCES↗

Nutrient supply controls the linkage between species abundance and ecological interactions in marine bacterial communities

Nutrient scarcity is pervasive for natural microbial communities, affecting species reproduction and co-existence. However, it remains unclear whether there are general rules of how microbial species abundances are shaped by biotic and abiotic factors. Here we show that the ribosomal RNA gene operon (rrn) copy number, a genomic trait related to bacterial growth rate and nutrient demand, decreases from the abundant to the rare biosphere in the nutrient-rich coastal sediment but exhibits the opposite pattern in the nutrient-scarce pelagic zone of the global ocean. Both patterns are underlain by positive correlations between community-level rrn copy number and nutrients. Furthermore, inter-species co-exclusion inferred by negative network associations is observed more in coastal sediment than in ocean water samples. Nutrient manipulation experiments yield effects of nutrient availability on rrn copy numbers and network associations that are consistent with our field observations. Based on these results, we propose a “hunger games” hypothesis to define microbial species abundance rules using the rrn copy number, ecological interaction, and nutrient availability.

59 BASIC BIOLOGICAL SCIENCES↗

Improving nuclear data evaluations with predictive reaction theory and indirect measurements

Nuclear reaction data required for astrophysics and applications is incomplete, as not all nuclear reactions can be measured or reliably predicted. Neutron-induced reactions involving unstable targets are particularly challenging, but often critical for simulations. In response to this need, indirect approaches, such as the surrogate reaction method, have been developed. Nuclear theory is key to extract reliable cross sections from such indirect measurements. We describe ongoing efforts to expand the theoretical capabilities that enable surrogate reaction measurements. We focus on microscopic predictions for charged-particle inelastic scattering, uncertainty-quantified optical nucleon-nucleus models, and neural-network enhanced parameter inference.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Rewiring the specificity of extracytoplasmic function sigma factors

Significance Bacterial phenotypes require the concerted expression of multiple genes, usually coordinated by a transcriptional regulator. Although the functions of many genes in sequenced bacterial genomes can be inferred, the regulatory networks that coordinate their expression are only known in a few model systems. Using a bioinformatic and experimental approach, we solve the DNA-specificity code of extracytoplasmic function sigma factors (ECF σs), a major class of bacterial regulators. We develop and use a high-stringency pipeline to predict the genes regulated by 67% of ECF σs in >10,000 species, providing a comprehensive look at the role of a broadly distributed family of gene regulatory proteins. This conceptual and computational framework is potentially applicable to other bacterial regulators.

59 BASIC BIOLOGICAL SCIENCES↗

Inferring dark matter substructure with astrometric lensing beyond the power spectrum

Abstract Astrometry—the precise measurement of positions and motions of celestial objects—has emerged as a promising avenue for characterizing the dark matter population in our Galaxy. By leveraging recent advances in simulation-based inference and neural network architectures, we introduce a novel method to search for global dark matter-induced gravitational lensing signatures in astrometric datasets. Our method based on neural likelihood-ratio estimation shows significantly enhanced sensitivity to a cold dark matter population and more favorable scaling with measurement noise compared to existing approaches based on two-point correlation statistics. We demonstrate the real-world viability of our method by showing it to be robust to non-trivial modeled as well as unmodeled noise features expected in astrometric measurements. This establishes machine learning as a powerful tool for characterizing dark matter using astrometric data.

convolutional neural networks (1938)↗

Evaluating In-Clique and Topological Parallelism Strategies for Junction Tree-Based Bayesian Inference Algorithm on the Cray XMT

Long viewed as a strong statistical inference technique, Bayesian networks have emerged to be an important class of applications for high-performance computing. We have applied an architecture-conscious approach to parallelizing the Lauritzen-Spiegelhalter Junction Tree algorithm for exact inferencing in Bayesian networks. In optimizing the Junction Tree algorithm, we have implemented both in-clique and topological parallelism strategies to best leverage the fine-grained synchronization and massive-scale multithreading of the Cray XMT architecture. Two topological techniques were developed to parallelize the evidence propagation process through the Bayesian network. One technique involves performing intelligent scheduling of junction tree nodes based on its topology and relative size. The second technique involves decomposing the junction tree into a much finer tree-like representation to offer much more opportunities for parallelism. We evaluate these optimizations on five different Bayesian networks and report our findings and observations. Another important contribution of this paper is to demonstrate the application of massive-scale multithreading for load balancing and use of implicit parallelism-based compiler optimizations in designing scalable inferencing algorithms.

99 GENERAL AND MISCELLANEOUS↗

Deep-Learning-Based Koopman Modeling for Online Control Synthesis of Nonlinear Power System Transient Dynamics

Power system stability and control have become more challenging due to the increasing uncertainty associated with renewable generation. Here, the performance of conventional control is highly driven by the physics-based offline-developed dynamic models that can deviate from the actual system characteristics under different operating conditions and/or configurations. Data-driven approaches based on online measurements can be a better solution to addressing these issues by capturing real-time operation conditions. This article describes a novel fully data-driven probabilistic framework to derive a linear representation of postcontingency grid dynamics and online prescribe control based on the derived model to enhance transient stability. The complex nonlinear power system dynamics is approximated by a linear model by using multiple neural network modules that infer distributions of the observations and introducing a Koopman layer to sample possible Koopman linear models from the inferred distributions. The trained model features linearity that can be easily incorporated into the existing linear control design paradigm and ease the controller design process. The effectiveness of Koopman-based control designs is validated through comparative case studies, which demonstrate increased prediction accuracy and control performance when applied to a power system with heterogeneous generator dynamics.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Redox transistors for neuromorphic computing

Efficiency bottlenecks inherent to conventional computing in executing neural algorithms have spurred the development of novel devices capable of “in-memory” computing. Commonly known as “memristors,” a variety of device concepts including conducting bridge, vacancy filament, phase change, and other types have been proposed as promising elements in artificial neural networks for executing inference and learning algorithms. In this article, we review the recent advances in memristor technology for neuromorphic computing and discuss strategies for addressing the most significant performance challenges, including nonlinearity, high read/write currents, and endurance. As an alternative to two-terminal memristors, we introduce the three-terminal electrochemical memory based on the redox transistor (RT), which uses a gate to tune the redox state of the channel. Decoupling the “read” and “write” operations using a third terminal and storage of information as a charge-compensated redox reaction in the bulk of the transistor enables high-density information storage. These properties enable low-energy operation without compromising analog performance and nonvolatility. Finally, we discuss the RT operating mechanisms using organic and inorganic materials, approaches for array integration, and prospects for achieving the device density and switching speeds necessary to make electrochemical memory competitive with established digital technology.

97 MATHEMATICS AND COMPUTING↗

Neural Network Export Package (nexport) v0.1.0

nexport is a lightweight python 3 package which enables neural network developers to export the weights and biases of trained networks to useful file types. It provides I/O support for applications which require specific data types for instantiating neural networks in various inference environments. It was initially developed to support exporting to the data structure used by 'inference-engine', a Fortran inference package.

Welsman, Jordan↗

ecospec v0.1.0

Bespoke software for segmenting plants in ecoFABs to monitor growth and health. Contains python libraries for image alignment, training neural networks and running inference.

Zwart, PetrusH [Lawrence Berkeley National Laborat↗

FastBNNs

FastBNNs is a Python package implementing open-source algorithms for fast Bayesian inference of neural networks.

Schodt, David↗