Search NASA⌕ Search

SEARCH · Search NASA

Results for “binary network”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 73 records · Page 4

Multi-input and binary reproducible, high bandwidth floating point adder in a collective network

To add floating point numbers in a parallel computing system, a collective logic device receives the floating point numbers from computing nodes. The collective logic devices converts the floating point numbers to integer numbers. The collective logic device adds the integer numbers and generating a summation of the integer numbers. The collective logic device converts the summation to a floating point number. The collective logic device performs the receiving, the converting the floating point numbers, the adding, the generating and the converting the summation in one pass. One pass indicates that the computing nodes send inputs only once to the collective logic device and receive outputs only once from the collective logic device.

97 MATHEMATICS AND COMPUTING↗

Synergistic learning with multi-task DeepONet for efficient PDE problem solving

Multi-task learning (MTL) is an inductive transfer mechanism designed to leverage useful information from multiple tasks to improve generalization performance compared to single-task learning. It has been extensively explored in traditional machine learning to address issues such as data sparsity and overfitting in neural networks. In this work, we apply MTL to problems in science and engineering governed by partial differential equations (PDEs). However, implementing MTL in this context is complex, as it requires task-specific modifications to accommodate various scenarios representing different physical processes. To this end, we present a multi-task deep operator network (MT-DeepONet) to learn solutions across various functional forms of source terms in a PDE and multiple geometries in a single concurrent training session. We introduce modifications in the branch network of the vanilla DeepONet to account for various functional forms of a parameterized coefficient in a PDE. Additionally, we handle parameterized geometries by introducing a binary mask in the branch network and incorporating it into the loss term to improve convergence and generalization to new geometry tasks. Our approach is demonstrated on three benchmark problems: (1) learning different functional forms of the source term in the Fisher equation; (2) learning multiple geometries in a 2D Darcy Flow problem and showcasing better transfer learning capabilities to new geometries; and (3) learning 3D parameterized geometries for a heat transfer problem and demonstrate the ability to predict on new but similar geometries. Finally, our MT-DeepONet framework offers a novel approach to solving PDE problems in engineering and science under a unified umbrella based on synergistic learning that reduces the overall training cost for neural operators.

42 ENGINEERING↗

Structure and stability of an amorphous water–methane mixture produced by cold compression of methane hydrate

In a process similar to the formation of high-density amorphous ice, amorphous methane hydrate was formed by the pressure-induced collapse of crystalline methane clathrate at 32 kbar and 100 K. This produced a regular array of methane embedded within cavities in an amorphous water network. In situ annealing results in further densification into a more disordered and higher density amorphous state before crystallization into ice VIII and hexagonal clathrate. Whereas the very high-density amorphous form of pure water undergoes a glass transition near 130 K at low pressure and crystallizes over a broad pressure range at ~160 K, the amorphous network of the water–methane binary system exhibits a region of metastability that persists up to 220 K between 15 and 40 kbar. It appears that in this system the connectivity of the water network exhibits sufficiently low mobility so as to inhibit the diffusion and phase separation of the constituents until 220 K, where the high-pressure ice VIII crystallization can occur. The structure of the amorphous form is studied by neutron diffraction and the hydration of methane in this disordered water network is more closely related to the small clathrate cage than the large.

Tulk, Christopher↗

Connectivity-informed drainage network generation using deep convolution generative adversarial networks

Abstract Stochastic network modeling is often limited by high computational costs to generate a large number of networks enough for meaningful statistical evaluation. In this study, Deep Convolutional Generative Adversarial Networks (DCGANs) were applied to quickly reproduce drainage networks from the already generated network samples without repetitive long modeling of the stochastic network model, Gibb’s model. In particular, we developed a novel connectivity-informed method that converts the drainage network images to the directional information of flow on each node of the drainage network, and then transforms it into multiple binary layers where the connectivity constraints between nodes in the drainage network are stored. DCGANs trained with three different types of training samples were compared; (1) original drainage network images, (2) their corresponding directional information only, and (3) the connectivity-informed directional information. A comparison of generated images demonstrated that the novel connectivity-informed method outperformed the other two methods by training DCGANs more effectively and better reproducing accurate drainage networks due to its compact representation of the network complexity and connectivity. This work highlights that DCGANs can be applicable for high contrast images common in earth and material sciences where the network, fractures, and other high contrast features are important.

42 ENGINEERING↗

Hybrid Quantum-Classical Neural Networks

Deep learning is one of the most successful and far-reaching strategies used in machine learning today. However, the scale and utility of neural networks is still greatly limited by the current hardware used to train them. These concerns have become increasingly pressing as conventional computers are soon expected to approach the physical limitations that will slow their performance improvements in the near future. For these reasons, scientists have begun to explore alternative computing platforms, like quantum computers, for training neural networks. In recent years, variational quantum circuits have emerged as one of the most successful approaches to quantum deep learning on noisy intermediate scale quantum devices. We propose a hybrid quantum-classical neural network architecture where each neuron is a variational quantum circuit. We empirically analyze the performance of this hybrid neural network on a series of binary classification data sets using a simulated IBM universal quantum computer and a state-of-the-art IBM universal quantum computer. On the simulated hardware, we observe that the hybrid neural network achieves around 10% higher classification accuracy and 20% better minimization of the cost function than an individual variational quantum circuit. On the quantum hardware, we observe that each model only performs well when the qubit and gate count is sufficiently small.

Arthur, Davis↗

Gravitational Waves from Coalescing Binary Black Holes: Theoretical and Experimental Challenges

A network of ground-based interferometric gravitational wave detectors (LIGO/VIRGO/GEO/...) is currently taking data near its planned sensitivity. Coalescing black hole binaries are among the most promising, and most exciting, gravitational wave sources for these detectors. The talk will review the theoretical and experimental challenges that must be met in order to successfully detect gravitational waves from coalescing black hole binaries, and to be able to reliably measure the physical parameters of the source (masses, spins, ...).

79 ASTRONOMY AND ASTROPHYSICS↗

Dynamics on modular networks with heterogeneous correlations

We develop a new ensemble of modular random graphs in which degree-degree correlations can be different in each module, and the inter-module connections are defined by the joint degree-degree distribution of nodes for each pair of modules. We present an analytical approach that allows one to analyze several types of binary dynamics operating on such networks, and we illustrate our approach using bond percolation, site percolation, and the Watts threshold model. The new network ensemble generalizes existing models (e.g., the well-known configuration model and Lancichinetti-Fortunato-Radicchi networks) by allowing a heterogeneous distribution of degree-degree correlations across modules, which is important for the consideration of nonidentical interacting networks.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Seasonal and Morphological Controls on Nitrate Retention in Arctic Deltas

Abstract Estimates of nitrate loading to the Arctic Ocean are limited by the lack of field observations within deltas partly due to logistical constraints. To overcome this limitation, we use a remote sensing framework to estimate retention of nitrate in Arctic deltas. We achieve this by coupling hydrological and biogeochemical process models at the network scale for five major Arctic deltas. Binary masks of delta channels were used to simulate flow direction and magnitude through networks. Models were parameterized using historical and seasonal observations. Simulated nitrate retention ranged from 2.9% to 15% of the incoming load. Retention rates were largest during winter but smallest during spring conditions when increased discharges export large nitrate masses to the coast. Under future climate scenarios, retention rates fall by ∼1%–10%. Arctic deltas have an important effect on the magnitude of nitrate entering Arctic seas and the inclusion of processing in deltas can improve flux estimates.

54 ENVIRONMENTAL SCIENCES↗

Evaluation of artificial neural network performance for classification of potato plants infected with potato virus Y using spectral data on multiple varieties and genotypes

Potato virus Y (Potyviridae, PVY) is a plant virus that poses a significant threat to potato producers on a global basis. The pathogen has disrupted seed potato supplies and negatively impacted yield and quality of commercial potato crops. The potato industry currently manages PVY infection levels via insecticide applications, regional seed certification programs that rely on field scouting to visually assess individual plants for infection status, and destructive and costly tissue sampling coupled with laboratory assays. Despite these efforts, PVY continues to confound potato industry stakeholders resulting in economic harm. Remote sensing and machine learning provide for the development of new tools to more accurately detect and spatially quantify PVY-infected plants versus the current state of the art. However, there is a need to understand how the occurrence of many different potato varieties impact the dynamics of developing models to detect potato plants impacted with PVY and their potential effectiveness. This study evaluates classification modelling outcomes using spectral datasets collected in different temporal and spatial environments (greenhouse and a production field) on multiple potato varieties consisting of labelled instances of plants infected with PVY and those not infected with the virus. A modelling framework was developed to support iterative modelling runs using artificial neural network (ANN) architectures configured as binary classifiers to develop sample populations to support statistical analysis on model performance using specific spectral subsets. When using spectral data to detect PVY-infected plants, ANN models achieved the highest mean accuracy of 0.894 on a single variety. Conversely, the same ANN model architecture only achieved a mean accuracy of 0.575 on a spectral data set representing 29 potato breeding lines. Additionally, statistical analysis indicates spectral regions including the red edge, near infrared and shortwave infrared contain more important spectral features for the ANN classifier introduced in this research.

60 APPLIED LIFE SCIENCES↗

Modeling the AC Power Flow Equations with Optimally Compact Neural Networks: Application to Unit Commitment

Nonlinear power flow constraints render a variety of power system optimization problems computationally intractable. Emerging research shows, however, that the nonlinear AC power flow equations can be successfully modeled using neural networks. These neural networks can be exactly transformed into mixed integer linear programs and embedded inside challenging optimization problems, thus replacing nonlinearities that are intractable for many applications with tractable piecewise linear approximations. Such approaches, though, suffer from an explosion of the number of binary variables needed to represent the neural network. Accordingly, this paper develops a technique for training an "optimally compact'' neural network, i.e., one that can represent the power flow equations with a sufficiently high degree of accuracy while still maintaining a tractable number of binary variables. We demonstrate the use of this neural network as an approximator of the nonlinear power flow equations by embedding it in the AC unit commitment problem, transforming the problem from a mixed integer nonlinear program into a more manageable mixed integer linear program. We use the 14-, 57-, and 89-bus networks as test cases and compare the AC-feasibility of commitment decisions resulting from the neural network, DC, and linearized power flow approximations. Our results show that the neural network model outperforms both the DC and linearized power flow approximations when embedded in the unit commitment problem. The neural network formulation most often selects a feasible unit commitment schedule, and furthermore, it only s

AC power flow↗

Largely enhanced dielectric properties of carbon nanotubes/polyvinylidene fluoride binary nanocomposites by loading a few boron nitride nanosheets

The ternary nanocomposites of boron nitride nanosheets (BNNSs)/carbon nanotubes (CNTs)/polyvinylidene fluoride (PVDF) are fabricated via a combination of solution casting and extrusion-injection processes. The effects of BNNSs on the electrical conductivity, dielectric behavior, and microstructure changes of CNTs/PVDF binary nanocomposites are systematically investigated. A low percolation value (f{sub c}) for the CNTs/PVDF binary system is obtained due to the integration of solution and melting blending procedures. Two kinds of CNTs/PVDF binary systems with various CNTs contents (f{sub CNTs}) as the matrix are discussed. The results reveal that compared with CNTs/PVDF binary systems at the same f{sub CNTs}, the ternary BNNSs/CNTs/PVDF nanocomposites exhibit largely enhanced dielectric properties due to the improvement of the CNTs dispersion state and the conductive network. The dielectric constant of CNTs/PVDF binary nanocomposite with 6 vol. % CNTs (f{sub CNTs} < f{sub c}) shows a 79.59% enhancement from 49 to 88 after the incorporation of 3 vol. % BNNSs. For the other CNTs/PVDF system with 8 vol. % CNTs (f{sub CNTs} > f{sub c}), it displays a 43.32% improvement from 1325 to 1899 after the addition of 3 vol. % BNNSs. The presence of BNNSs facilitates the formation of the denser conductive network. Meanwhile, the ternary BNNSs/CNTs/PVDF systems exhibit a low dielectric loss. The adjustable dielectric properties could be obtained by employing the ternary systems due to the microstructure changes of nanocomposites.

36 MATERIALS SCIENCE↗

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↗

Microstructure, Transport, and Mechanics of Compacted Clay Simulated at the 0.1 μm Scale (1400 Smectite Clay Particles) Using a Coarse-Grained Model with Explicit Counterions

Clay-rich geomaterials play a critical role in many subsurface systems. The macroscale properties of these materials (low permeability, high ionic conductivity, high swelling pressure, etc.) are sensitive to molecular-level adsorption and hydration interactions at clay−water interfaces. Efforts to develop multiscale simulation approaches to predict these properties reveal a scale gap between atomistic simulations (typically limited to systems smaller than 10 nm) and continuum-scale models (which use computational grid elements with dimensions ≳ 10 μm). In this study, we present a coarse-grained (CG) framework that partly bridges this gap by simulating compacted smectite clay assemblages with dimensions of 0.1 μm containing 1,400 clay particles across a range of dry densities (1,050 to 1,850 kg·m −3 ) and Na/Ca counterion compositions (Na fraction ranging from 0.2 to 1). The simulated systems, along with their reconstructed binary three-dimensional pore networks, are used to evaluate the microstructure, pore size distribution, tortuosity, ion diffusivity, and swelling pressure of compacted smectite clay. Results show that our approach captures important features of the mesoscale heterogeneity of compacted clays, including tactoid formation, hierarchical porosity, and anisotropic pore networks. Results also reveal how compaction and counterion composition govern emergent behaviors, including dominant pore sizes, directional transport, and electrochemical response. This work highlights the potential of CG simulations to bridge molecular and continuum scales and to advance geotechnical and environmental applications involving clay-rich materials as well as related nanoporous media such as geopolymers and calcium-silicate-hydrate. However, the results also suggest that accurate prediction of certain microstructural and mechanical properties (e.g., swelling pressure) may require even larger-scale systems on the order of 1 μm.

02 PETROLEUM↗

TOWARD EARLY-WARNING DETECTION OF GRAVITATIONAL WAVES FROM COMPACT BINARY COALESCENCE

Rapid detection of compact binary coalescence (CBC) with a network of advanced gravitational-wave detectors will offer a unique opportunity for multi-messenger astronomy. Prompt detection alerts for the astronomical community might make it possible to observe the onset of electromagnetic emission from CBC. We demonstrate a computationally practical filtering strategy that could produce early-warning triggers before gravitational radiation from the final merger has arrived at the detectors.

79 ASTRONOMY AND ASTROPHYSICS↗

Short gamma-ray burst formation rate from BATSE data using E{sub p} -L{sub p} correlation and the minimum gravitational-wave event rate of a coalescing compact binary

Using 72 short gamma-ray bursts (SGRBs) with well determined spectral data observed by BATSE, we determine their redshift and luminosity by applying the E{sub p} -L{sub p} correlation for SGRBs found by Tsutsui et al. For 53 SGRBs with an observed flux brighter than 4 × 10{sup –6} erg cm{sup –2} s{sup –1}, the cumulative redshift distribution up to z = 1 agrees well with that of 22 Swift SGRBs. This suggests that the redshift determination by the E{sub p} -L{sub p} correlation for SGRBs works well. The minimum event rate at z = 0 is estimated as R{sub on−axis}{sup min}=6.3{sub −3.9}{sup +3.1}× 10{sup −10} events Mpc{sup −3} yr{sup −1}, so that the minimum beaming angle is 0.°6-7.°8 assuming a merging rate of 10{sup –7}- 4 × 10{sup –6} events Mpc{sup –3} yr{sup –1} suggested from the binary pulsar data. Interestingly, this angle is consistent with that for SGRB 130603B of ∼4°-8°. On the other hand, if we assume a beaming angle of ∼6° suggested from four SGRBs with the observed beaming angle value, then the minimum event rate including off-axis SGRBs is estimated as R{sub all}{sup min}=1.15{sub −0.66}{sup +0.56} × 10{sup −7} events Mpc{sup −3} yr{sup −1}. If SGRBs are induced by the coalescence of binary neutron stars (NSs) and/or black holes (BHs), then this event rate leads to a minimum gravitational-wave detection rate of 3.8{sub −2.2}{sup +1.8} (146{sub −83}{sup +71}) events yr{sup −1} for an NS-NS (NS-BH) binary, respectively, by a worldwide network with KAGRA, advanced-LIGO, advanced-VIRGO, and GEO.

79 ASTRONOMY AND ASTROPHYSICS↗

Bayesian Segmentation (BCNN) v.1

Deep learning has been applied with great success to the segmentation of 3D X-Ray Computed Tomography (CT) scans. Establishing the credibility of these segmentations requires uncertainty quantification (UQ) to identify problem areas. Bayesian neural networks (BNNs), which use variational inference to learn the posterior distribution of the neural network weights, have been proposed to incorporate UQ into deep learning models. This software is an implementation of a novel 3D Bayesian convolutional neural network (BCNN) that provides accurate binary segmentations and uncertainty maps for 3D volumes. In particular, the uncertainty maps generated by this BCNN capture continuity and visual gradients, making them interpretable as confidence intervals for segmentation usable in numerical simulations. SAND2019-12927 M Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy's National Nuclear Security Administration under contract DE-NA0003525.

LaBonte, TylerMatthew↗

Uncertainty Quantification of Classifying Mechanical Breach in the Crash and Burn Problem

The prediction of mechanical breach in the Crash and Burn problem is important for designing the full system to minimize the probability of loss of containment. Due to uncertainties in the impact angle, material properties, and material models, it is not possible to define an exact critical impact speed at which the system breaches. Furthermore, the cost of running a large scale sampling study to determine the empirical probability of breach is prohibitive. In this work, surrogate models from machine learning, namely logistic regression and artificial neural networks, are introduced to predict binary classification of pass versus breach from a limited set of samples. The structure and calibration of these classifiers is discussed, and a set of metrics for describing the performance of the classifiers is introduced. The classifiers are used on the UUR version of the Crash model to attempt prediction of failure probability and perform variable sensitivity analysis. Where a single sample of the computational model can take hundreds of CPU-hours, training and evaluating a classifier can take seconds or less, thus giving high predictive power in a relatively short time.

42 ENGINEERING↗

The updated DESGW processing pipeline for the third LIGO/VIRGO observing run

The DESGW group seeks to identify electromagnetic counterpartsof gravitational wave events seen by the LIGO-VIRGO network, such as thoseexpected from binary neutron star mergers or neutron star- black hole mergers.DESGW was active throughout the first two LIGO observing seasons, followingup several binary black hole mergers and the first binary neutron star merger,GW170817. We describe the modifications to the observing strategy generationand image processing pipeline between the second (ending in August 2017)and third (beginning in April 2019) LIGO observing seasons. The modifica-tions include a more robust observing strategy generator, further parallelizationof the image reduction software and dierence imaging processing pipeline,data transfer streamlining, and a web page listing identified counterpart candi-dates that updates in real time. Taken together, the additional parallelizationsteps enable us to identify potential electromagnetic counterparts within fullycalibrated search images in less than one hour, compared to the 3-5 hours itwould typically take during the first two seasons. These performance improve-ments are critical to the entire EM followup community, as rapid identification(or rejection) of candidates enables detailed spectroscopic followup by multipleinstruments as soon as possible, leading to more information about the environ-ment immediately following such gravitational wave events.

Herner, Kenneth R.↗