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 145 records · Page 8

Avalaunch

Avalaunch implements a tree-based process launcher. It first bootstraps itself on to a set of compute nodes by launching children processes, which immediately connect back to the parent process to acquire info needed t launch their own children. Once the tree is established, user processes are started by broadcasting commands and application binaries through the tree. All communication flows over high-performance network protocols via spawnnet. The goal is to start MPI jobs having hundreds of thousands of processes within seconds.

Moody, A. T.↗

Effect of eccentricity on searches for gravitational waves from coalescing compact binaries in ground-based detectors

Inspiralling compact binaries are expected to circularize before their gravitational-wave signals reach the sensitive frequency band of ground-based detectors. Current searches for gravitational waves from compact binaries using the LIGO and Virgo detectors therefore use circular templates to construct matched filters. Binary formation models have been proposed which suggest that some systems detectable by the LIGO-Virgo network may have non-negligible eccentricity. We investigate the ability of the restricted 3.5 post-Newtonian order TaylorF2 template bank, used by LIGO and Virgo to search for gravitational waves from compact binaries with masses M{<=}35M{sub {center_dot},} to detect binaries with nonzero eccentricity. We model the gravitational waves from eccentric binaries using the x-model post-Newtonian formalism proposed by Hinder et al.[I. Hinder, F. Hermann, P. Laguna, and D. Shoemaker, arXiv:0806.1037v1]. We find that small residual eccentricities (e{sub 0} < or approx. 0.05 at 40 Hz) do not significantly affect the ability of current LIGO searches to detect gravitational waves from coalescing compact binaries with total mass 2M{sub {center_dot}<}M<15M{sub {center_dot}.} For eccentricities e{sub 0} > or approx. 0.1, the loss in matched filter signal-to-noise ratio due to eccentricity can be significant and so templates which include eccentric effects will be required to perform optimal searches for such systems.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A Guide to Conquer the Biological Network Era Using Graph Theory

Networks are one of the most common ways to represent biological systems as complex sets of binary interactions or relations between different bioentities. In this article, we discuss the basic graph theory concepts and the various graph types, as well as the available data structures for storing and reading graphs. In addition, we describe several network properties and we highlight some of the widely used network topological features. We briefly mention the network patterns, motifs and models, and we further comment on the types of biological and biomedical networks along with their corresponding computer- and human-readable file formats. Finally, we discuss a variety of algorithms and metrics for network analyses regarding graph drawing, clustering, visualization, link prediction, perturbation, and network alignment as well as the current state-of-the-art tools. We expect this review to reach a very broad spectrum of readers varying from experts to beginners while encouraging them to enhance the field further.

59 BASIC BIOLOGICAL SCIENCES↗

A Comprehensive Comparative Study of Active Learning Schemes for Nanophotonics Design

We present a benchmarking study of active learning (AL) schemes for designing planar multilayer nanophotonic metamaterials, where the design tasks are formulated as binary optimization problems. Different surrogate models, including factorization machine (FM), Gaussian process regression (GPR), and convolutional neural network (CNN), combined with different optimization methods, including exhaustive enumeration, discrete particle swarm optimization (DPSO), quantum annealing (QA), hybrid QA, and simulated annealing are studied. The benchmark cases investigated range from small problems with short binary lengths (N = 25) to large problems with N up to 100, focusing on the design of two classes of photonic structures, including antireflective coatings for the long-wavelength infrared region and transparent radiative coolers. For small problems, CNN coupled with DPSO in AL achieves the best performance. As N increases, FM with QA outperforms GPR and CNN. For FM-based AL, hybrid QA yields the best optimization results, particularly in high-dimensional cases (N = 100). These results demonstrate that the optimization method can significantly affect in AL performance as N increases, and that QA-based optimization can provide practical routes for mitigating the optimization bottleneck in high-dimensional problems.

Jung, Serang [Kyung Hee University, Korea]↗

Fast and Accurate Predictions of Total Energy for Solid Solution Alloys with Graph Convolutional Neural Networks

We use graph convolutional neural networks (GCNNs) to produce fast and accurate predictions of the total energy of solid solution binary alloys. GCNNs allow us to abstract the lattice structure of a solid material as a graph, whereby atoms are modeled as nodes and metallic bonds as edges. This representation naturally incorporates information about the structure of the material, thereby eliminating the need for computationally expensive data pre-processing which would be required with standard neural network (NN) approaches. We train GCNNs on ab-initio density functional theory (DFT) for copper-gold (CuAu) and iron-platinum (FePt) data that has been generated by running the LSMS-3 code, which implements a locally self-consistent multiple scattering method, on OLCF supercomputers Titan and Summit. GCNN outperforms the ab-initio DFT simulation by orders of magnitude in terms of computational time to produce the estimate of the total energy for a given atomic configuration of the lattice structure. We compare the predictive performance of GCNN models against a standard NN such as dense feedforward multi-layer perceptron (MLP) by using the root-mean-squared errors to quantify the predictive quality of the deep learning (DL) models. We find that the attainable accuracy of GCNNs is at least an order of magnitude better than that of the MLP.

Lupo Pasini, Massimiliano↗

Fundamental effective temperature measurements for eclipsing binary stars – IV. Selection of new benchmark stars and first results for HD 22064

I describe the selection and initial characterization of 20 eclipsing binary stars that are suitable for calibration and testing of stellar models and data analysis algorithms used by the PLATO mission and spectroscopic surveys. The binary stars selected are F-/G-type dwarf stars with M-type dwarf companions that contribute less than 2 per cent of the flux at optical wavelengths. The light curves typically show well-defined total eclipses with very little variability between the eclipses. I have used near-infrared spectra obtained by the APOGEE survey to measure the spectroscopic orbit for both stars in HD 22064. Combined with an analysis of the TESS light curve, I derive the following masses and radii: M 1 = 1.35 ± 0.03M ⊙ , M 2 = 0.58 ± 0.01M ⊙ , R 1 = 1.554 ± 0.014R ⊙ , R 2 = 0.595 ± 0.008R ⊙ . Using R 1 and the parallax from Gaia EDR3, I find that the primary star’s angular diameter is θ = 0.1035 ± 0.0009 mas. The apparent bolometric flux of the primary star is ${\mathcal {F}}_{{\oplus },0} = (7.51\pm 0.09)\times 10^{-9}$ erg cm -2 s -1 . Hence, this F2V star has an effective temperature $T_{\rm eff,1} = 6763{\rm \, K} \pm 39{\rm \, K}$. HD 22064 is an ideal benchmark star that can be used for ‘end-to-end’ tests of the stellar parameters measured by large-scale spectroscopic surveys or stellar parameters derived from asteroseismology with PLATO. The techniques described here for HD 22064 can be applied to the other eclipsing binaries in the sample in order to create an all-sky network of such benchmark stars.

79 ASTRONOMY AND ASTROPHYSICS↗

Input specific neural networks

Neural networks have emerged as powerful tools for mapping between inputs and outputs. However, their black-box nature limits the ability to encode or impose specific structural relationships between inputs and outputs. Many scientific and engineering problems, such as constitutive modeling in solid mechanics, require networks that can enforce convexity, monotonicity, or other structural constraints to ensure physical consistency. Here, we introduce the Input Specific Neural Network (ISNN), a new architecture that enables multiple, distinct constraints to be imposed on different input subsets for scalar-valued outputs. This framework unifies convex, monotone–convex, monotone, and arbitrary mappings within a single network for the first time. Two ISNN architectures with analytical first- and second-order derivatives are developed. We demonstrate the performance on synthetic toy problems, inverse problems in isotropic hyperelasticity, and finite element simulations. ISNNs achieve improved extrapolation behavior, require fewer invariant inputs than standard input convex networks for polyconvex potentials, and enable significant computational savings via manual differentiation. We also show how ISNNs can be used to learn structural relationships between inputs and outputs via a binary gating mechanism. Particularly, ISNNs are employed to model a homogenized anisotropic free energy potential in a decoupled multiscale setting. The network learns whether or not the potential should be modeled as polyconvex and retains only the relevant layers while using the minimum number of inputs. ISNNs provide a flexible foundation for embedding structural priors into neural networks, enhancing both interpretability and stability. They are broadly applicable across computational mechanics and other scientific domains requiring constrained functional relationships.

Jadoon, Asghar A. [Univ. of Texas, Austin, TX (Uni↗

A QUBO formulation for top-τ eigencentrality nodes

The efficient calculation of the centrality or “hierarchy” of nodes in a network has gained great relevance in recent years due to the generation of large amounts of data. The eigenvector centrality (aka eigencentrality) is quickly becoming a good metric for centrality due to both its simplicity and fidelity. In this work we lay the foundations for solving the eigencentrality problem of ranking the importance of the nodes of a network with scores from the eigenvector of the network, using quantum computational paradigms such as quantum annealing and gate-based quantum computing. The problem is reformulated as a quadratic unconstrained binary optimization (QUBO) that can be solved on both quantum architectures. The results focus on correctly identifying a given number of the most important nodes in numerous networks given by the sparse vector solution of our QUBO formulation of the problem of identifying the top- τ highest eigencentrality nodes in a network on both the D-Wave and IBM quantum computers.

97 MATHEMATICS AND COMPUTING↗

A novel machine learning based identification of potential adopter of rooftop solar photovoltaics

With the proliferation of rooftop solar photovoltaic installations, there is a need to proactively predict consumer potential for solar photovoltaic adoption, for improved electric utility planning and operation. Traditional analytical modeling approaches are limited to a few survey features and a larger part of the survey would remain untouched by the decision model. This article presents a novel, data-driven modeling approach that strategically prunes a large set of consumer profile features using a machine learning framework to train a model for predicting potential solar adoption. The approach utilizes the Gradient Boosting Decision Tree model through a Light Gradient Boosting framework that improves significantly over the poor prediction accuracy of the existing approaches. Model training using focal-loss based supervision is used to overcome the difficulty in identifying the potential adopters that is inherent in conventional data-driven models. In addition, to overcome possible data sparsity in a limited survey sample, a Generative Adversarial Network is presented to create synthetic user samples and its effectiveness on model performance is assessed. A Bayesian optimization approach is used to systematically arrive at the hyperparameters of the proposed model. Validation of the presented approach on a survey data collected by the National Rural Electric Cooperative Association in Virginia in 2018 demonstrates the excellent predictive capability of the machine learning based approach to modeling solar adoption reliably.

14 SOLAR ENERGY↗

Establishing Malware Attribution and Binary Provenance Using Multicompilation Techniques

Malware is a serious problem for computer systems and costs businesses and customers billions of dollars a year in addition to compromising their private information. Detecting malware is particularly difficult because malware source code can be compiled in many different ways and generate many different digital signatures, which causes problems for most anti-malware programs that rely on static signature detection. Our project uses a convolutional neural network to identify malware programs but these require large amounts of data to be effective. Towards that end, we gather thousands of source code files from publicly available programming contest sites and compile them with several different compilers and flags. Building upon current research, we then transform these binary files into image representations and use them to train a long-term recurrent convolutional neural network that will eventually be used to identify how a malware binary was compiled. This information will include the compiler, version of the compiler and the options used in compilation, information which can be critical in determining where a malware program came from and even who authored it.

97 MATHEMATICS AND COMPUTING↗

Resiliency of Distribution Systems Incorporating Asynchronous Information for System Restoration

Resiliency of distribution systems under extreme operating conditions is critical, especially when the utility is not available. With the large-scale deployment of distributed resources, it becomes possible to restore critical loads with local non-utility resources. Distribution system operators (DSOs) need to determine the critical loads to be restored, considering limited resources and distribution facilities. Several studies on resiliency have been conducted for the restoration of distribution systems. However, the inherent asynchronous characteristic on the information availability has not been incorporated. With incomplete and asynchronous information, decisions may be made that result in underutilization of generation resources. In this paper, a new distribution system restoration approach is proposed, considering uncertain devices and associated asynchronous information. It uses a two-module architecture that efficiently optimizes restoration actions using a binary linear programming model and evaluates their feasibility with unbalanced optimal power flow. Networked microgrids are included in the model. The IEEE 123-node test feeder is used for validation. Results show that asynchronous messages may affect the restoration actions significantly and the impacts can be mitigated by the proposed decision support tool for the DSOs.

Bedoya, Juan C.↗

Graph link prediction in computer networks using Poisson matrix factorisation

Graph link prediction is an important task in cybersecurity: relationships between entities within a computer network, such as users interacting with computers or system libraries and the corresponding processes that use them, can provide key insights into adversary behaviour. Poisson matrix factorisation (PMF) is a popular model for link prediction in large networks, particularly useful for its scalability. In this article PMF is extended to include scenarios that are commonly encountered in cybersecurity applications. Specifically, an extension is proposed to explicitly handle binary adjacency matrices and include known categorical covariates associated with the graph nodes. A seasonal PMF model is also presented to handle seasonal networks. To allow the methods to scale to large graphs, variational methods are discussed for performing fast inference. The results show an improved performance over the standard PMF model and other statistical network models.

97 MATHEMATICS AND COMPUTING↗

THE DISTRIBUTION OF COALESCING COMPACT BINARIES IN THE LOCAL UNIVERSE: PROSPECTS FOR GRAVITATIONAL-WAVE OBSERVATIONS

Merging compact binaries are the most viable and best-studied candidates for gravitational-wave (GW) detection by the fully operational network of ground-based observatories. In anticipation of the first detections, the expected distribution of GW sources in the local universe is of considerable interest. Here we investigate the full phase-space distribution of coalescing compact binaries at z = 0 using dark matter simulations of structure formation. The fact that these binary systems acquire large barycentric velocities at birth ('kicks') results in merger site distributions that are more diffusely distributed with respect to their putative hosts, with mergers occurring out to distances of a few Mpc from the host halo. Redshift estimates based solely on the nearest galaxy in projection can, as a result, be inaccurate. On the other hand, large offsets from the host galaxy could aid the detection of faint optical counterparts and should be considered when designing strategies for follow-up observations. The degree of isotropy in the projected sky distributions of GW sources is found to be augmented with increasing kick velocity and to be severely enhanced if progenitor systems possess large kicks as inferred from the known population of pulsars and double compact binaries. Even in the absence of observed electromagnetic counterparts, the differences in sky distributions of binaries produced by disparate kick-velocity models could be discerned by GW observatories, within the expected accuracies and detection rates of advanced LIGO-in particular with the addition of more interferometers.

79 ASTRONOMY AND ASTROPHYSICS↗

VLBI DETECTION OF AN ACTIVE GALACTIC NUCLEUS PAIR IN THE BINARY BLACK HOLE CANDIDATE SDSS J1536+0441

We present the first pc-scale radio imaging of the radio-quiet candidate binary black hole system SDSS J1536+0441. The observations were carried out by the European VLBI Network at a frequency of 5 GHz, allowing the imaging of SDSS J1536+0441 with a resolution of {approx}10 mas ({approx}50 pc). Two compact radio cores are detected at the position of the kpc-scale components VLA-A and VLA-B, proving the presence of two compact active nuclei with radio luminosity L{sub R} {approx} 10{sup 40} erg s{sup -1}, thus ruling out the possibility that both radio sources are powered by a 0.1 pc binary black hole. From a comparison with published 8.5 GHz flux densities, we derived an estimate of the radio spectral index of the two pc-scale cores. Both cores have a flat or an inverted spectral index, and at least for the case of VLA-A we can rule out the possibility that synchrotron self-absorption is responsible for the inverted radio spectrum. We suggest that thermal free-free emission from an X-ray-heated disk wind may be powering the radio emission in VLA-A.

79 ASTRONOMY AND ASTROPHYSICS↗

Performance Evaluation of Vertical Federated Machine Learning Against Adversarial Threats on Wide-Area Control System: Preprint

Federated machine learning (FL) is gaining significant popularity to develop cybersecurity solutions in power grids because of its advanced capability to support decentralized data handing at local devices, its privacy preservation, and its low-bandwidth requirement. However, the evolving adversarial machine learning (AML) threats raise significant concerns for the cybersecurity of FL architectures. The FL-based split neural network (SplitNN) achieves high performance through the decentralized training of local neural network models while preserving data privacy across multiple entities. In this paper, we propose a methodology for evaluating the performance of a vertical FLbased anomaly detector against different types of AML attacks, including denial-of-service attacks, adversarial data injection attacks, and replay attacks on the trained local models deployed in the grid network. For a case study, we consider the modified IEEE 13-bus system, and we develop SplitNN-based binary and multiclass classification models to detect, locate, and identify different types of data integrity attacks on the volt-watt control with two pooling layers: maximum pooling and AvgPool. Our experimental results, computed through performance metrics, reveal that the severity of these AML attacks varies with the integrated pooling mechanism, the type of classification model, and the nature of the cyberattack. Further, the AML attacks negatively impacted the prediction time per sample for the pretrained SplitNN during the online testing.

adversarial threats↗

Binary operations on neuromorphic hardware with application to linear algebraic operations and stochastic equations

Abstract Non-von Neumann computational hardware, based on neuron-inspired, non-linear elements connected via linear, weighted synapses—so-called neuromorphic systems—is a viable computational substrate. Since neuromorphic systems have been shown to use less power than CPUs for many applications, they are of potential use in autonomous systems such as robots, drones, and satellites, for which power resources are at a premium. The power used by neuromorphic systems is approximately proportional to the number of spiking events produced by neurons on-chip. However, typical information encoding on these chips is in the form of firing rates that unarily encode information. That is, the number of spikes generated by a neuron is meant to be proportional to an encoded value used in a computation or algorithm. Unary encoding is less efficient (produces more spikes) than binary encoding. For this reason, here we present neuromorphic computational mechanisms for implementing binary two’s complement operations. We use the mechanisms to construct a neuromorphic, binary matrix multiplication algorithm that may be used as a primitive for linear differential equation integration, deep networks, and other standard calculations. We also construct a random walk circuit and apply it in Brownian motion simulations. We study how both algorithms scale in circuit size and iteration time.

97 MATHEMATICS AND COMPUTING↗

End-to-End Pipeline for Trigger Detection on Hit and Track Graphs

There has been a surge of interest in applying deep learning in particle and nuclear physics to replace labor-intensive offline data analysis with automated online machine learning tasks. This paper details a novel AI-enabled triggering solution for physics experiments in Relativistic Heavy Ion Collider and future Electron-Ion Collider. The triggering system consists of a comprehensive end-to-end pipeline based on Graph Neural Networks that classifies trigger events versus background events, makes online decisions to retain signal data, and enables efficient data acquisition. Here, the triggering system first starts with the coordinates of pixel hits lit up by passing particles in the detector, applies three stages of event processing (hits clustering, track reconstruction, and trigger detection), and labels all processed events with the binary tag of trigger versus background events. By switching among different objective functions, we train the Graph Neural Networks in the pipeline to solve multiple tasks: the edge-level track reconstruction problem, the edge-level track adjacency matrix prediction, and the graph-level trigger detection problem. We propose a novel method to treat the events as track-graphs instead of hit-graphs. This method focuses on intertrack relations and is driven by underlying physics processing. As a result, it attains a solid performance (around 72% accuracy) for trigger detection and outperforms the baseline method using hit-graphs by 2% higher accuracy.

97 MATHEMATICS AND COMPUTING↗

Machine learning elastic constants of multi-component alloys

The present manuscript explores application of machine learning methods for determining elastic constants and other derived mechanical properties of multi-component alloys. Here, a number of machine learning models, including linear regression, neural network and random forest based models, are trained and tested on a dataset of binary alloys generated using density functional theory (DFT) calculations and spanning over a large number of elemental species in the periodic table. Starting with a wide range of simple and easily accessible compositionally-averaged elemental features, a correlation-based feature selection strategy was used to systematically down-select a set of most relevant features towards the prediction of the elasticity tensor components. The true predictive performance and the associated uncertainties of the models were established by testing on unseen data and bootstrapping, respectively. A single and pair-wise feature partial dependence analysis was performed to visualize the average property trends in the multi-dimensional feature space in order to further understand the achieved predictive performance. The utility of the trained model is further demonstrated by obtaining sufficiently accurate yet highly efficient approximations for bulk modulus, Young’s modulus, shear modulus and Poisson’s ratio for alloys beyond the binary space (i.e., two-component alloys) on which the model was originally trained. More importantly, we test and validate the predictive performance of the developed model directly against the experimentally measured elastic constants of technologically relevant multi-component alloys (such as, Ni- and Ti-based alloys). Finally, utility of such a data-enabled route is demonstrated by predicting the possible range of various elastic properties for vast composition space available within the five component Ni-Cr-Fe-Mo-W alloy system in a high-throughput manner.

36 MATERIALS SCIENCE↗