Search NASA⌕ Search

SEARCH · Search NASA

Results for “Network generation”

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
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

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↗
DOE OSTI2025

SAGIPS: a physics-inspired scalable asynchronous generative inverse-problem solver

Abstract Solving large-scale inverse problems using deep-learning algorithms have become an essential part of modern research and industrial applications. The complexity of the underlying inverse problem may require the utilization of high performance computing systems which poses a challenge on the algorithmic design of the inverse problem solver. Most deep learning algorithms require, due to their design, custom parallelization techniques in order to be resource efficient while showing a reasonable convergence. In this paper we introduce a S calable A synchronous G enerative I nverse P roblem S olver (SAGIPS) on high-performance computing systems. We present a workflow that utilizes an asynchronous ring-allreduce algorithm to transfer the gradients of the generator network across multiple GPUs. Experiments with a scientific proxy application demonstrate that SAGIPS shows near linear weak scaling, together with a convergence quality that is comparable to traditional methods. The approach presented here allows leveraging Generative Adverserial Network across multiple GPUs, promising advancements in solving complex inverse problems at scale.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Generating Co-expression Networks for Three Cyanobacteria: Synechococcus sp. PCC 7942, Synechococcus sp. PCC 7002, Synechocystis sp. PCC 6803

Cyanobacteria are photosynthetic organisms capable of high growth rate and represent a promising bioplatform for harnessing the sun’s energy to make biofuel. Additionally, the process of photosynthesis absorbs CO2 from the environment. Understanding the metabolic processes involved in photosynthesis could lead to solutions to the recent rise of CO2 concentration in Earth’s atmosphere and the associated climate change. More research on the transcriptional regulation of these cells is needed to learn how to harness the untapped potential of cyanobacteria for these applications. Transcriptional analysis via RNA-seq provides an understanding of how gene expression changes at the mRNA level under diverse growing conditions. I systematically collected and analyzed RNA-Seq data obtained under a variety of conditions and available on the NCBI database for three cyanobacteria model organisms: Synechococcus elongatus sp. PCC 7942, Synechococcus sp. PCC 7002, and Synechocystis sp. PCC 6803. For each organism, the data was mapped to a reference genome to characterize the RNA expression profile. Samples were checked for quality based on the number of reads and the correlation of the expression profile between labeled replicates. All samples were transformed into transcripts per million reads, followed by a log transformation to account for the wide range of sample sizes. Gene co-expression networks were generated and analyzed for each species using Cytoscape. These networks provide a base level of gene expression for each species. The network topology and high-betweeness nodes of these networks need to be analyzed further to provide insight on potential ways to harness cyanobacteria genetics. Additionally, these datasets can be used together to form a core genome network analysis- one that includes only the genes that are homologous between the three species. This project has prepared the way for a more in-depth study on photosynthetic microbes on a genetic level.

59 BASIC BIOLOGICAL SCIENCES↗
NASA NTRS1993

Software For Graphical Representation Of A Network

System Visualization Tool (SVT) computer program developed to provide systems engineers with means of graphically representing networks. Generates diagrams illustrating structures and states of networks defined by users. Provides systems engineers powerful tool simplifing analysis of requirements and testing and maintenance of complex software-controlled systems. Employs visual models supporting analysis of chronological sequences of requirements, simulation data, and related software functions. Applied to pneumatic, hydraulic, and propellant-distribution networks. Used to define and view arbitrary configurations of such major hardware components of system as propellant tanks, valves, propellant lines, and engines. Also graphically displays status of each component. Advantage of SVT: utilizes visual cues to represent configuration of each component within network. Written in Turbo Pascal(R), version 5.0.

Mcallister, R. William↗
DOE OSTI2022

NDNSEG (Named Data Network Scalable Environment Generator) [SWR-21-91]

NDNSEG (Named Data Network Scalable Environment Generator) automates the deployment of NDN environments in NREL's Cyber-Energy Emulation Platform (CEEP). Specifying the number of clients, servers, gateways, and pv_inverters and running NDNSEG will automate the generation of required files to deploy the number of specified virtual machines, the underlying networking infrastructure, and configuration for GitLab CI/CD.

Peterson, Jordan↗
DOE OSTI2020

NAPAbench 2: A network synthesis algorithm for generating realistic protein-protein interaction (PPI) network families

Comparative network analysis provides effective computational means for gaining novel insights into the structural and functional compositions of biological networks. In recent years, various methods have been developed for biological network alignment, whose main goal is to identify important similarities and critical differences between networks in terms of their topology and composition. A major impediment to advancing network alignment techniques has been the lack of gold-standard benchmarks that can be used for accurate and comprehensive performance assessment of such algorithms. The original NAPAbench (network alignment performance assessment benchmark) was developed to address this problem, and it has been widely utilized by many researchers for the development, evaluation, and comparison of novel network alignment techniques. In this work, we introduce NAPAbench 2—a major update of the original NAPAbench that was introduced in 2012. NAPAbench 2 includes a completely redesigned network synthesis algorithm that can generate protein-protein interaction (PPI) network families whose characteristics closely match those of the latest real PPI networks. Furthermore, the network synthesis algorithm comes with an intuitive GUI that allows users to easily generate PPI network families with an arbitrary number of networks of any size, according to a flexible user-defined phylogeny. In addition, NAPAbench 2 provides updated benchmark datasets—created using the redesigned network synthesis algorithm—which can be used for comprehensive performance assessment of network alignment algorithms and their scalability.

42 ENGINEERING↗
NASA NTRS1990

3-D components of a biological neural network visualized in computer generated imagery. II - Macular neural network organization

Computer-assisted reconstructions of small parts of the macular neural network show how the nerve terminals and receptive fields are organized in 3-dimensional space. This biological neural network is anatomically organized for parallel distributed processing of information. Processing appears to be more complex than in computer-based neural network, because spatiotemporal factors figure into synaptic weighting. Serial reconstruction data show anatomical arrangements which suggest that (1) assemblies of cells analyze and distribute information with inbuilt redundancy, to improve reliability; (2) feedforward/feedback loops provide the capacity for presynaptic modulation of output during processing; (3) constrained randomness in connectivities contributes to adaptability; and (4) local variations in network complexity permit differing analyses of incoming signals to take place simultaneously. The last inference suggests that there may be segregation of information flow to central stations subserving particular functions.

Ross, Muriel D.↗
DOE OSTI2024

Measuring neutron star radius with second and third generation gravitational wave detector networks

The next generation of ground-based interferometric gravitational wave detectors will observe mergers of black holes and neutron stars throughout cosmic time. A large number of the binary neutron star merger events will be observed with extreme high fidelity, and will provide stringent constraints on the equation of state of nuclear matter. In this paper, we investigate the systematic improvement in the measurability of the equation of state with increase in detector sensitivity by combining constraints obtained on the radius of a 1.4 M ⊙ neutron star from a simulated source population. Since the measurability of the equation of state depends on its stiffness, we consider a range of realistic equations of state that span the current observational constraints. We show that a single 40 km Cosmic Explorer detector can pin down the neutron star radius for a soft, medium and stiff equation of state with a precision of 10 m within a decade, whereas the current generation of ground-based detectors like the Advanced LIGO-Virgo network would take $\mathcal{O}(10_5)$ years to do so for a soft equation of state.

79 ASTRONOMY AND ASTROPHYSICS↗
NASA NTRS1988

Strain accumulation in quasicrystalline solids

The relaxation of two-dimensional quasicrystalline elastic networks when their constituent bonds are perturbed homogeneously is studied. Whereas ideal, quasi-periodic networks are stable against such perturbations, significant accumulations of strain in a class of disordered networks generated by a growth process are found. The grown networks are characterized by root mean square phason fluctuations which grow linearly with system size. The strain accumulation observed in these networks also grows linearly with system size. Finally, dependence of strain accumulation on cooling rate is found.

Nori, Franco↗
DOE OSTI2025

GRUMDN: A Multi-Task Model for Predicting Human Patterns-of-Life from Stay Transition Data

Understanding human patterns-of-life (PoL) is essential towards ensuring safe and secure indoor facility environment as well as outdoor urban environment. Prediction of human movement in between places of interest is vital in understanding human PoL. Movement between spaces maybe represented and detected in one of the two forms: 1) trajectories: locations measured at regular time intervals by mobile sensors, bluetooth or GPS sensors; or 2) stay transitions: semantic PoI (points of interest) and stay duration data measurable by eventbased sensors that collect data when a check-in or check-out event is detected. Stay transition data provides a more compressed data format compared to trajectories data, especially in situations with longer stay durations, while preserving the information necessary for PoL analysis. Now as introduced briefly in the paper, our deployed end application (Digital Twin of a facility with non-player characters, besides the interactive user in virtual reality) needed a well-performing and validated AI/ML model for simulating high quality stay transitions behavior. In this study we thus primarily present our findings with developing and validating that model, which is a multi-task neural network for stay transition prediction. The neural network consists of two heads, for corresponding two tasks of stay category prediction and stay duration prediction. We evaluated gated recurrent units and multi-layer perceptrons of varying network sizes for stay category prediction; while mixture density networks, noisy generator-only networks, and generative adversarial networks of varying network sizes for stay duration prediction. We have then evaluated four multi-task models, constructed by combining these specialized models, on their ability to predict stay transition data. We tested our models on datasets from two different cases: 1) a simulation-generated dataset of indoor movement within the HFIR (high flux isotope reactor) nuclear reactor facility at Oak Ridge National Laboratory (ORNL); and 2) the GeoLife human mobility dataset of outdoor urban movement available in literature. Our results indicate that GRUMDN, which combines gated recurrent units (GRU) for stay category prediction task, and mixture density networks (MDN) for stay duration prediction task, did overall outperform other multitask models and the current state-of-the-art.

Gunaratne, Chathika [ORNL] (ORCID:0000000225088745↗
DOE OSTI2023

Developing Synthetic Distribution Models Using Open-Source Data Sets

The deployment of distributed generation resources at scale with the distribution side of the power system network over the last two decades has spurred a lot of research interest in distribution networks. Given, the sensitive nature of power system data sets, utilities are still reluctant to open-source distribution networks. Although some open-source data sets are available, they may not cover the region of interest. In this paper, we introduce the Synthetic dIstribution Network Generator (SING), new software that allows users to develop synthetic distribution models, using open-source data sets, in any region of interest within the continental US.

data set↗
DOE OSTI2026

Forecasting generative amplification

Generative networks are perfect tools to enhance the speed and precision of LHC simulations. Especially when generating events beyond the size of the training dataset, it is important to understand their statistical precision. We present two complementary methods to estimate the amplification factor without large holdout datasets. Averaging amplification uses Bayesian networks or ensembling to estimate amplification from the precision of integrals over given phase-space volumes. Differential amplification uses hypothesis testing to quantify amplification without any resolution loss. Applied to state-of-the-art event generators, both methods indicate that amplification is already possible in specific regions of phase space.

Bahl, Henning [Heidelberg Univ. (Germany)] (ORCID:↗
DOE OSTI2022

Vertex finding in neutrino-nucleus interaction: a model architecture comparison

We compare different neural network architectures for machine learning algorithms designed to identify the neutrino interaction vertex position in the MINERvA detector. The architectures developed and optimized by hand are compared with the architectures developed in an automated way using the package “Multi-node Evolutionary Neural Networks for Deep Learning” (MENNDL), developed at Oak Ridge National Laboratory. While the domain-expert hand-tuned network was the best performer, the differences were negligible and the auto-generated networks performed as well. There is always a trade-off between human, and computer resources for network optimization and this work suggests that automated optimization, assuming resources are available, provides a compelling way to save significant expert time.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2022

Stable parallel training of Wasserstein conditional generative adversarial neural networks

In this work, we propose a stable, parallel approach to train Wasserstein conditional generative adversarial neural networks (W-CGANs) under the constraint of a fixed computational budget. Differently from previous distributed GANs training techniques, our approach avoids inter-process communications, reduces the risk of mode collapse and enhances scalability by using multiple generators, each one of them concurrently trained on a single data label. The use of the Wasserstein metric also reduces the risk of cycling by stabilizing the training of each generator. We illustrate the approach on the CIFAR10, CIFAR100, and ImageNet1k datasets, three standard benchmark image datasets, maintaining the original resolution of the images for each dataset. Performance is assessed in terms of scalability and final accuracy within a limited fixed computational time and computational resources. To measure accuracy, we use the inception score, the Fréchet inception distance, and image quality. An improvement in inception score and Fréchet inception distance is shown in comparison to previous results obtained by performing the parallel approach on deep convolutional conditional generative adversarial neural networks as well as an improvement of image quality of the new images created by the GANs approach. Weak scaling is attained on both datasets using up to 2000 NVIDIA V100 GPUs on the OLCF supercomputer Summit.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Scalable balanced training of conditional generative adversarial neural networks on image data

Here, we propose a distributed approach to train deep convolutional generative adversarial neural network (DC-CGANs) models. Our method reduces the imbalance between generator and discriminator by partitioning the training data according to data labels, and enhances scalability by performing a parallel training where multiple generators are concurrently trained, each one of them focusing on a single data label. Performance is assessed in terms of inception score, Fréchet inception distance, and image quality on MNIST, CIFAR10, CIFAR100, and ImageNet1k datasets, showing a significant improvement in comparison to state-of-the-art techniques to training DC-CGANs. Weak scaling is attained on all the four datasets using up to 1000 processes and 2000 NVIDIA V100 GPUs on the OLCF supercomputer Summit.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Virtualizing Industrial Control Networks for Cyber Resilience Experiments

Industrial control systems (ICS) networks are undergoing constant shifts to accommodate new security measures. It is challenging to test varying network configurations and security tools with physical systems as they typically include large, expensive equipment. Not only this, but researchers often do not have access to this type of equipment for development of new security tools and techniques. As a solution to these issues, this work presents a set of tools for utilizing GNS3 and Docker as a virtual ICS network. Additionally, the virtual network can be attached to physical devices including network switches, hardware simulations, and intelligent electronic devices (IEDs). Two case studies showcase a relatively complex automatically generated network and an attack on a simple ICS network with an example mitigation.

42 ENGINEERING↗
DOE OSTI2024

Carbodiimide‐Driven Toughening of Interpenetrated Polymer Networks

Abstract Recent work has demonstrated that temporary crosslinks in polymer networks generated by chemical “fuels” afford materials with large, transient changes in their mechanical properties. This can be accomplished in carboxylic‐acid‐functionalized polymer hydrogels using carbodiimides, which generate anhydride crosslinks with lifetimes on the order of minutes to hours. Here, the impact of the polymer network architecture on the mechanical properties of transiently crosslinked materials was explored. Single networks (SNs) were compared to interpenetrated networks (IPNs). Notably, semi‐IPN precursors that give IPNs on treatment with carbodiimide give much higher fracture energies (i.e., resistance to fracture) and superior resistance to compressive strain compared to other network architectures. A precursor semi‐IPN material featuring acrylic acid in only the free polymer chains yields, on treatment with carbodiimide, an IPN with a fracture energy of 2400 J/m 2 , a fourfold increase compared to an analogous semi‐IPN precursor that yields a SN. This resistance to fracture enables the formation of macroscopic complex cut patterns, even at high strain, underscoring the pivotal role of polymer architecture in mechanical performance.

Rajawasam, Chamoni W. H.↗