Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 397 records · Page 22

Modelling the Value of Networked, Small-Hydro Generators for Storage and Dispatch Capability on the Grid

Natel Energy, Inc. (Natel), Alameda, California, has developed a new type of fish-friendly, low-head hydropower turbine, the hydroEngine (R), that is designed to provide reliable, dispatchable power and ancillary services at significantly reduced civil works costs. For the U.S. Department of Energy's (DOE) Small Business Voucher for Hydropower, Third Round, Natel and NREL will model and evaluate the potential value streams of a portfolio of networked small hydropower generators. The project is designed to advance the understanding of the value of small hydro generation to the grid of the future. It will help support dialog with potential customers and stakeholders regarding the value of the Natel's technologies and inform future R&D efforts in this area.

13 HYDRO ENERGY↗

Laboratory investigation of hydraulic fracturing in granitic rocks using active and passive seismic monitoring

SUMMARY Knowledge of the fracturing processes can be important for the optimization of pressurized fluid injection operations in the deep underground rock mass. Active and passive seismic monitoring techniques have been used in the field for tracking or mapping the propagating hydraulic fracture. Although both these monitoring techniques provide valuable information about the generated fracture network, it is difficult for either technique to comprehensibly identify the different processes associated with hydraulic fracturing. The combined active and passive monitoring has the potential for better characterization of the complex hydraulic fracturing phenomena. In this study, laboratory hydraulic fracturing experiments with combined active and passive seismic monitoring were conducted on true triaxially loaded Barre granite cubes with different fluid injection rates. The seismic inelastic fracturing was detected by 16 passive acoustic emission sensors, where 3678 and 2370 seismic source events were detected for the high and low injection rate experiments, respectively. For active monitoring, strong variations in the attributes of signals were observed which were transmitted through four source–receiver pairs, placed both perpendicular and parallel to the generated hydraulic fracture. Positive velocity changes were observed for active sensor pairs with ray paths passing through the generated hydraulic fracture indicating fluid permeation, whereas isolated dry deformation was characterized by a slight but permanent velocity decrease. Compared to velocity, the energy of the active signals was 1–2 orders of magnitude more sensitive to different hydraulic fracturing processes. However, the sensitivity and signatures of the active signal attributes were found to be dependent on the frequency range and direction of ray path with respect to the location of the generated fracture network. Using the coupled evaluation of the active and passive signals we were able to systematically identify various hydraulic fracturing processes including: (1) aseismic deformation, (2) fracture initiation and fluid permeation, (3) pressure build-up, (4) fracture propagation and (5) pressure release and leak-off. The results of this study showed that combining the respective advantages of active and passive seismic techniques and using both of them to monitor the failure processes can facilitate a more comprehensive understanding and better control of the hydraulic stimulations in subsurface operations.

Geochemistry & Geophysics↗

Preparing Distribution Utilities for the Future - Unlocking Demand-Side Management Potential: A Novel Analytical Framework

The balance of supply and demand in the power systems has traditionally been served solely through generation and network capacity planning and operations. However, with increased requirements for flexibility due to the uptake in variable renewable generation sources such as wind and solar there is a need to increased demand-side flexibility. In addition, there are increased communications and flexibility capabilities emerging on the demand-side from the adoption of advanced metering infrastructures and smart meter deployment and intelligent loads such as smart thermostats and schedulable white goods (e.g. dishwashers and washing machines). Unlocking demand-side flexibility can bring system benefits from peak load reduction bringing about generation capacity and network upgrade deferral, to reducing demand and more efficient utilization of generation and network capacity. Unlocking demand-side flexibility is an evolving process for utilities and solutions must be tailored to each specific customer group. Demand-side management (DSM) is a broad set of tools that can include demand response (both dispatchable and non-dispatchable), energy efficiency and distributed energy resources and demand-side technologies. The National Renewable Energy Laboratory (NREL), in collaboration with BSES Rajdhani Power Ltd. (BRPL) and Deloitte, examined the potential of DSM in BRPL’s service territory, developing detailed information on customer classes and willingness to participate in DSM. The study developed modeling frameworks for load analysis and the analysis tools to assess the potential of time-of-use tariffs in motivating customers to reduce their peak period energy consumption. The study shows that BRPL customers, specifically their domestic customers, are willing to participate in DSM programs and that time-of-use pricing can help BRPL reduce their peak demand and help unlock demand-side flexibility.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Evolving the NASA Near Earth Network for the Next Generation of Human Space Flight

The purpose of this paper is to present the planned development and evolution of the NASA Near Earth Network (NEN) launch communications services in support of the next generation of human space flight programs. Following the final space shuttle mission in 2011, the two NEN launch communications stations were decommissioned. Today, NASA is developing the next generation of human space flight systems focused on exploration missions beyond low-earth orbit, and supporting the emerging market for commercial crew and cargo human space flight services. The NEN is leading a major initiative to develop a modern high data rate launch communications ground architecture with support from the Kennedy Space Center Ground Systems Development and Operations Program and in partnership with the U.S. Air Force (USAF) Eastern Range. This initiative, the NEN Launch Communications Stations (LCS) development project, successfully completed its System Requirements Review in November 2013. This paper provides an overview of the LCS project and a summary of its progress. The LCS ground architecture, concept of operations, and driving requirements to support the new heavy-lift Space Launch System and Orion Multi-Purpose Crew Vehicle for Exploration Mission-1 are presented. Finally, potential future extensions to the ground architecture beyond EM-1 are discussed.

Launch Communications↗

Genetic Algorithm for Optimization of Neural Networks for Bayesian Inference of Model Uncertainty

The objective of this work was to develop a genetic optimization algorithm that can design a neural network capable of producing uncertainty estimates along with predictions. This algorithm is necessary because the inclusion of uncertainty modeling in a neural network greatly complicates the network’s design space, making the development of a converging model extremely difficult and time consuming. The genetic algorithm presented in this work uses a number of value ranges for various configurable neural network parameters to create a randomly generated population of network architectures. The initially generated population is then evolved over the course of several generations, with the best performing models breeding to produce novel network configurations. Mutations are randomly applied to the network designs to facilitate the development of adaptations beneficial to the task being performed. An experiment was conducted to validate the proposed algorithm, in which the genetic optimizer was tasked with producing a neural network capable of predicting the sound pressure level (SPL) resulting from jet-surface interaction (JSI) noise. The data used for this task was generated at the NASA Glenn Research Center in the Aero-Acoustic Propulsion Laboratory. Starting with an initial population size of 35 randomly generated networks, and evolved over the course of 10 generations, the genetic algorithm produced a design able to predict SPL as a result of JSI noise within 0.272 dB, on average.

Genetic algorithm↗

Deep Generative Models for Materials Discovery and Machine Learning-Accelerated Innovation

Machine learning and artificial intelligence (AI/ML) methods are beginning to have significant impact in chemistry and condensed matter physics. For example, deep learning methods have demonstrated new capabilities for high-throughput virtual screening, and global optimization approaches for inverse design of materials. Recently, a relatively new branch of AI/ML, deep generative models (GMs), provide additional promise as they encode material structure and/or properties into a latent space, and through exploration and manipulation of the latent space can generate new materials. These approaches learn representations of a material structure and its corresponding chemistry or physics to accelerate materials discovery, which differs from traditional AI/ML methods that use statistical and combinatorial screening of existing materials via distinct structure-property relationships. However, application of GMs to inorganic materials has been notably harder than organic molecules because inorganic structure is often more complex to encode. In this work we review recent innovations that have enabled GMs to accelerate inorganic materials discovery. We focus on different representations of material structure, their impact on inverse design strategies using variational autoencoders or generative adversarial networks, and highlight the potential of these approaches for discovering materials with targeted properties needed for technological innovation.

36 MATERIALS SCIENCE↗

CTGAN-TVAE

SAND2026-18914O CTGAN-TVAE (Conditional Tabular Generative Adversarial Networks-Tabular Variational Autoencoders) generates extensive sets of variable generation data through a hybrid framework. It enhances latent space representation by combining TVAE's robust feature-embedding with CTGAN's ability to condition categorical variables such as time. CTGAN-TVAE employs a fully connected neural network within a conditional generative adversarial network framework to manage continuous and categorical data effectively, capturing complex feature interactions without needing sequential modeling. This was developed as part of NNSA-MSIPP: Minority Serving Institution Partnership Program, Grant Number DE-NA0004016. 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.

Newlun, Cody [Sandia National Lab. (SNL-CA), Liver↗

GPU-based parallel algorithm for generating massive scale-free networks using the preferential attachment model

A novel parallel algorithm is presented for generating random scale-free networks using the preferential-attachment model. The algorithm, named cuPPA, is custom-designed for single instruction multiple data (SIMD) style of parallel processing supported by modern processors such as graphical processing units (GPUs). To the best of our knowledge, our algorithm is the first to exploit GPUs, and also the fastest implementation available today, to generate scale-free networks using the preferential attachment model. A detailed performance study is presented to understand the scalability and runtime characteristics of the cuPPA algorithm. In one of the best cases, when executed on an NVidia GeForce 1080 GPU, cuPPA generates a scale-free network of two billion edges in less than 3 seconds.

Alam, Maksudul↗

Generative Ensemble Regression: Learning Particle Dynamics from Observations of Ensembles with Physics-informed Deep Generative Models

Here, we propose a new method for inferring the governing stochastic ordinary differential equations (SODEs) by observing particle ensembles at discrete and sparse time instants, i.e., multiple “snapshots.” Particle coordinates at a single time instant, possibly noisy or truncated, are recorded in each snapshot but are unpaired across the snapshots. By training a physics-informed generative model that generates “fake” sample paths, we aim to fit the observed particle ensemble distributions with a curve in the probability measure space, which is induced from the inferred particle dynamics. We employ different metrics to quantify the differences between distributions, e.g., the sliced Wasserstein distances and the adversarial losses in generative adversarial networks. We refer to this method as generative “ensemble-regression” (GER), in analogy to the classic “point-regression,” where we infer the dynamics by performing regression in the Euclidean space. We illustrate the GER by learning the drift and diffusion terms of particle ensembles governed by SODEs with Brownian motions and Lévy processes up to 100 dimensions. We also discuss how to treat cases with noisy or truncated observations. Apart from systems consisting of independent particles, we also tackle nonlocal interacting particle systems with unknown interaction potential parameters by constructing a physics-informed loss function. Finally, we investigate scenarios of paired observations and discuss how to reduce the dimensionality in such cases by proving a convergence theorem that provides theoretical support.

97 MATHEMATICS AND COMPUTING↗

Leveraging generative AI for urban digital twins: a scoping review on the autonomous generation of urban data, scenarios, designs, and 3D city models for smart city advancement

The digital transformation of modern cities by integrating advanced information, communication, and computing technologies has marked the epoch of data-driven smart city applications for efficient and sustainable urban management. Despite their effectiveness, these applications often rely on massive amounts of high-dimensional and multi-domain data for monitoring and characterizing different urban sub-systems, presenting challenges in application areas that are limited by data quality and availability, as well as costly efforts for generating urban scenarios and design alternatives. As an emerging research area in deep learning, Generative Artificial Intelligence (GenAI) models have demonstrated their unique values in content generation. This paper aims to explore the innovative integration of GenAI techniques and urban digital twins to address challenges in the planning and management of built environments with focuses on various urban sub-systems, such as transportation, energy, water, and building and infrastructure. The survey starts with the introduction of cutting-edge generative AI models, such as the Generative Adversarial Networks (GAN), Variational Autoencoders (VAEs), Generative Pre-trained Transformer (GPT), followed by a scoping review of the existing urban science applications that leverage the intelligent and autonomous capability of these techniques to facilitate the research, operations, and management of critical urban subsystems, as well as the holistic planning and design of the built environment. Based on the review, we discuss potential opportunities and technical strategies that integrate GenAI models into the next-generation urban digital twins for more intelligent, scalable, and automated smart city development and management.

3D city modeling↗

Reification of latent microstructures: On supervised unsupervised and semi-supervised deep learning applications for microstructures in materials informatics

Machine learning (ML), including deep learning (DL), has become increasingly popular in the last few years due to its continually outstanding performance. In this context, we apply machine learning techniques to "learn" the microstructure using both supervised and unsupervised DL techniques. In particular, we focus (1) on the localization problem bridging (micro)structure (localized) property using supervised DL and (2) on the microstructure reconstruction problem in latent space using unsupervised DL. The goal of supervised and semi-supervised DL is to replace crystal plasticity finite element model (CPFEM) that maps from (micro)structure (localized) property, and implicitly the (micro)structure (homogenized) property relationships, while the goal of unsupervised DL is (1) to represent high-dimensional microstructure images in a non-linear low-dimensional manifold, and (2) to discover a way to interpolate microstructures via latent space associating with latent microstructure variables. At the heart of this report is the applications of several common DL architectures, including convolutional neural networks (CNN), autoencoder (AE), and generative adversarial network (GAN), to multiple microstructure datasets, and the quest of neural architecture search for optimal DL architectures.

36 MATERIALS SCIENCE↗

Optimal Network-Topology Design

Candidate network designs tested for acceptability and cost. Optimal Network Topology Design computer program developed as part of study on topology design and analysis of performance of Space Station Information System (SSIS) network. Uses efficient algorithm to generate candidate network designs consisting of subsets of set of all network components, in increasing order of total costs and checks each design to see whether it forms acceptable network. Technique gives true cost-optimal network and particularly useful when network has many constraints and not too many components. Program written in PASCAL.

Li, Victor O. K.↗

CP‐SyNet: A tool for generating customised cyber‐power synthetic network for distribution systems with distributed energy resources

Abstract The integration of distributed energy resources and advancement in information technology has enabled the transition of traditional power distribution systems to active cyber‐physical distribution systems. A growing amount of research has been done on the modelling, analysis, and optimisation of power distribution system behaviour. However, existing publicly available distribution test feeders are limited in numbers and have minimal features. Furthermore, these test feeders do not include cyber models and are not customisable. To bridge this gap, we propose and develop Cyber‐physical synthetic distribution system network (CP‐SyNet), a tool for generating customisable cyber‐physical synthetic distribution test feeders. CP‐SyNet generates three‐phase unbalanced test feeders according to users' requirements, while simultaneously considering both the cyber side and the physical side of the network for cyber‐physical analysis. The physical test network is developed using a graph‐theoretical approach that employs information from existing test feeders. The cyber side considers an equivalent communication network by transforming the physical topology into possible and feasible simulated network. Two examples are presented to demonstrate the feasibility of the proposed framework to generate cyber‐physical test feeders.

Wang, Lusha↗

RuleMonkey: software for stochastic simulation of rule-based models

Background: The system-level dynamics of many molecular interactions, particularly protein-protein interactions, can be conveniently represented using reaction rules, which can be specified using model-specification languages, such as the BioNetGen language (BNGL). A set of rules implicitly defines a (bio)chemical reaction network. The reaction network implied by a set of rules is often very large, and as a result, generation of the network implied by rules tends to be computationally expensive. Moreover, the cost of many commonly used methods for simulating network dynamics is a function of network size. Together these factors have limited application of the rule-based modeling approach. Recently, several methods for simulating rule-based models have been developed that avoid the expensive step of network generation. The cost of these “network-free” simulation methods is independent of the number of reactions implied by rules. Software implementing such methods is now needed for the simulation and analysis of rule-based models of biochemical systems. Results: Here, we present a software tool called RuleMonkey, which implements a network-free method for simulation of rule-based models that is similar to Gillespie’s method. The method is suitable for rule-based models that can be encoded in BNGL, including models with rules that have global application conditions, such as rules for intramolecular association reactions. In addition, the method is rejection free, unlike other network-free methods that introduce null events, i.e., steps in the simulation procedure that do not change the state of the reaction system being simulated. We verify that RuleMonkey produces correct simulation results, and we compare its performance against DYNSTOC, another BNGL-compliant tool for network-free simulation of rule-based models. We also compare RuleMonkey against problem-specific codes implementing network-free simulation methods. Conclusions: RuleMonkey enables the simulation of rule-based models for which the underlying reaction networks are large. It is typically faster than DYNSTOC for benchmark problems that we have examined. RuleMonkey is freely available as a stand-alone application http://public.tgen.org/rulemonkey. It is also available as a simulation engine within GetBonNie, a web-based environment for building, analyzing and sharing rule-based models.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Taming Wild Horses: The Need for Virtual Time-based Scheduling of VMs in Network Simulations

The next generation of scalable network simulators employ virtual machines (VMs) to act as high-fidelity models of traffic producer/consumer nodes in simulated networks. However, network simulations could be inaccurate if VMs are not scheduled according to virtual time, especially when many VMs are hosted per simulator core in a multi-core simulator environment. Since VMs are by default free-running, on the outset, it is not clear if, and to what extent, their untamed execution affects the results in simulated scenarios. Here, we provide the first quantitative basis for establishing the need for generalized virtual time scheduling of VMs in network simulators, based on an actual prototyped implementations. To exercise breadth, our system is tested with multiple disparate applications: (a) a set of message passing parallel programs, (b) a computer worm propagation phenomenon, and (c) a mobile ad-hoc wireless network simulation. We define and use error metrics and benchmarks in scaled tests to empirically report the poor match of traditional, fairness-based VM scheduling to VM-based network simulation, and also clearly show the better performance of our simulation-specific scheduler, with up to 64 VMs hosted on a 12-core simulator node.

99 GENERAL AND MISCELLANEOUS↗

Multiple-objective Reinforcement Learning for Inverse Design and Identification

The aim of inverse chemical design is to develop new molecules with given optimized molecular properties or objectives. Recently, generative deep learning (DL) networks are considered as the state-of-the-art in inverse chemical design and have achieved early success in generating molecular structures with desired properties in the pharmaceutical and material chemistry fields. However, satisfying a large number (> 10 objectives) of molecular objectives is a limitation of current generative models. To improve the model’s ability to handle a large number of molecule design objectives, we developed a Reinforcement Learning (RL) based generative framework to optimize chemical molecule generation. Our use of Curriculum Learning (CL) to fine-tune the pre-trained generative network allowed the model to satisfy up to 21 objectives and increase the generative network’s robustness. The experiments show that the proposed multiple-objective RL-based generative model can correctly identify unknown molecules with an 83% to 100% success rate, compared to the baseline approach of 0%. Additionally, this proposed generative model is not limited to just chemistry research challenges; we anticipate that problems that utilize RL with multiple objectives will benefit from this framework.

reinforcement learning, generative model, inverse ↗

Artificial Intelligence-Enhanced CMIP6 Climate Projections Across the Conterminous United States

This dataset comprises high-resolution climate projections at 1/24 degree grid (~4km) over the conterminous United States (CONUS) based on ten Global Climate Models (GCMs) that are part of the Coupled Models Intercomparison Project phase 6 (CMIP6). The CMIP6 GCMs are downscaled using two artificial intelligence (AI) techniques, primarily based on the computer vision approach called super-resolution. We train two separate networks: super-resolution convolutional neural network (SRCNN) and super-resolution generative adversarial network (SRGAN). The networks are trained using Daymet observations, originally available at a 1 km resolution. For training purposes, the Daymet data is interpolated to 1/24 degree (~4km), 0.25 degree and 1 degree, which serve as high, intermediate and low-resolution inputs respectively. For each of the SRCNN and SRGAN network, we use a two-step resolution enhancement, the first step generates 4x refinement from 1 degree to 0.25 degree and the second step generates 6x refinement from 0.25 degree to 1/24 degree (~4km). We downscale daily scale precipitation, maximum temperature and minimum temperature for the six CMIP6 GCMs for 1980 to 2019 in the historical period and 2020 to 2059 in the near-term future under the shared socioeconomic pathway 585 and 245 (SSP585 and SSP245) emission scenarios. We also perform double bias-correction with Daymet observations using a quantile mapping approach, first for GCMs prior to making predictions at 1 degree grid and second after making final predictions at ~4km.

13 HYDRO ENERGY↗