Search NASA⌕ Search

SEARCH · Search NASA

Results for “Generations”

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 1,513 records · Page 84

Measuring the properties of f - mode oscillations of a protoneutron star by third-generation gravitational-wave detectors

Core-collapse supernovae are among the astrophysical sources of gravitational waves that could be detected by third-generation gravitational-wave detectors. Here, we analyze the gravitational-wave strain signals from two- and three-dimensional simulations of core-collapse supernovae generated using the code FORNAX. A subset of the two-dimensional simulations has non-zero core rotation at the core bounce. A dominant source of time changing quadrupole moment is the l = 2 fundamental mode (f- mode) oscillation of the proto-neutron star. From the time-frequency spectrogram of the gravitational-wave strain we see that, starting ~ 400 ms after the core bounce, most of the power lies within a narrow track that represents the frequency evolution of the f-mode oscillations. The f-mode frequencies obtained from linear perturbation analysis of the angle averaged profile of the protoneutron star corroborate what we observe in the spectrograms of the gravitational wave signal. We explore the measurability of the f-mode frequency evolution of protoneutron star for a supernova signal observed in the third-generation gravitational-wave detectors. Measurement of the frequency evolution can reveal information about the masses, radii, and densities of the proto-neutron stars. We find that if the third generation detectors observe a supernova within 10 kpc, we can measure these frequencies to within ~90% accuracy. Here, we can also measure the energy emitted in the fundamental f-mode using the spectrogram data of the strain signal. We find that the energy in the f-mode can be measured to within 20% error for signals observed by Cosmic Explorer using simulations with successful explosion, assuming source distances within 10 kpc.

79 ASTRONOMY AND ASTROPHYSICS↗

Improving generative model-based unfolding with Schrödinger bridges

Machine learning-based unfolding has enabled unbinned and high-dimensional differential cross section measurements. Two main approaches have emerged in this research area; one based on discriminative models and one based on generative models. The main advantage of discriminative models is that they learn a small correction to a starting simulation while generative models scale better to regions of phase space with little data. We propose to use Schrödinger bridges and diffusion models to create , an unfolding approach that combines the strengths of both discriminative and generative models. The key feature of is that its generative model maps one set of events into another without having to go through a known probability density as is the case for normalizing flows and standard diffusion models. We show that achieves excellent performance compared to state of the art methods on a synthetic Z + jets dataset. Published by the American Physical Society 2024

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Entangling Quantum Generative Adversarial Networks

Generative adversarial networks (GANs) are one of the most widely adopted machine learning methods for data generation. In this work, we propose a new type of architecture for quantum generative adversarial networks (an entangling quantum GAN, EQ-GAN) that overcomes limitations of previously proposed quantum GANs. Leveraging the entangling power of quantum circuits, the EQ-GAN converges to the Nash equilibrium by performing entangling operations between both the generator output and true quantum data. In the first multiqubit experimental demonstration of a fully quantum GAN with a provably optimal Nash equilibrium, we use the EQ-GAN on a Google Sycamore superconducting quantum processor to mitigate uncharacterized errors, and we numerically confirm successful error mitigation with simulations up to 18 qubits. Finally, we present an application of the EQ-GAN to prepare an approximate quantum random access memory and for the training of quantum neural networks via variational datasets.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

SynthNotes: A Generator Framework for High-volume, High-fidelity Synthetic Mental Health Notes

One of the key, emerging challenges that connects the "Big Data" and the AI domain is the availability of sufficient volumes of training data for AI/Machine Learning tasks. SynthNotes is a framework for generating standards-compliant, realistic mental health progress report notes at the very large, population-level scale, and in a strict privacy-preserving manner. Our framework, inspired by the needs to explore, evaluate, and train computational methods for the emerging mental health crisis in the US, is useful for benchmarking, optimization, and training of biomedical natural language processing, information extraction, and machine learning systems intended to operate at "Big Data" scale (billions of notes). The free text notes generated by SynthNotes are based on the literature and public statistical models allowing for realistic, natural language representation of a patient, and his or her mental health characteristics. Additionally, SynthNotes can partially simulate stylistic, grammatical, and expressive characteristics of a licensed mental health professional. SynthNotes is modular and flexible, allowing for representation of variety of conditions, incorporation of alternative foundational models, and parametrization of the variability of the structure, content, and size of the synthetically generated corpus. In this paper, we report on the initial use and performance characteristics of our SynthNotes framework and on the ongoing work for inclusion of content planning and deep learning-based generative methods trained on real data.

Begoli, Edmon↗

Adaptive Generation of Training Data for ML Reduced Model Creation

Machine learning proxy models are often used to speed up or completely replace complex computational models. The greatly reduced and deterministic computational costs enable new use cases such as digital twin control systems and global optimization. The challenge of building these proxy models is generating the training data. A naive uniform sampling of the input space can result in a non-uniform sampling of the output space of a model. This can cause gaps in the training data coverage that can miss finer scale details resulting in poor accuracy. While larger and larger data sets could eventually fill in these gaps, the computational burden of full-scale simulation codes can make this prohibitive. In this paper, we present an adaptive data generation method that utilizes uncertainty estimation to identify regions where training data should be augmented. By targeting data generation to areas of need, representative data sets can be generated efficiently. The effectiveness of this method will be demonstrated on a simple one-dimensional function and a complex multidimensional physics model.

Cianciosa, Mark↗

A Code Generator for High-Performance Tensor Contractions on GPUs

Tensor contractions are higher dimensional generalizations of matrix-matrix multiplication. They form the compute-intensive core for many applications in computational science and data science. Although high-performance library implementations are widely available for dense matrix-matrix multiplication on GPUs, the same is not true for contraction of dense tensors. In this paper, we describe a high- performance GPU code generator for arbitrary tensor contractions. It exploits domain-specific properties about data reuse in tensor contractions to devise an effective code generation schema, coupled with an effective model-driven search to determine parameters for mapping of computation to threads and staging of data through the GPU memory hierarchy. Experimental evaluation using a set of tensor contraction benchmarks demonstrates performance improvement and/or significantly reduced code generation time over other state-of-the-art tensor contraction libraries and code generators.

Kim, Jinsung↗

AXI4MLIR: User-Driven Automatic Host Code Generation for Custom AXI-Based Accelerators

Tensor algebra operations represent an important class of algorithms used across many applications, including machine learning, scientific computing, and data analytics. As a result, the efficient generation of custom accelerators for tensor operations has received increased attention. Previous efforts have produced automated tools enabling users to prototype and explore optimized accelerators. However, little effort has been focused on the host-accelerator interaction in these tools. Efficient use of hardware accelerators requires knowledge about the accelerator's capabilities (operations, data formats, and opcode support), the host CPU microarchitecture (e.g., memory hierarchy), the host-accelerator interface, and the application's features (which code regions should be mapped onto an accelerator). Manually rewriting the original applications to facilitate improved custom accelerator mapping is an error-prone and time-consuming endeavor. To cope with this, we propose AXI4MLIR, a new framework to automatically generate and optimize the communication between the host CPU and arbitrary accelerators that implement linear algebra algorithms. AXI4MLIR extends the MLIR compiler framework to automatically generate efficient host-accelerator driver code for accelerators with AXI-based interfaces. Our compiler extensions enable automatic driver code generation while carefully considering the host's memory hierarchy and target accelerator features. To demonstrate the flexibility and utility of AXI4MLIR, we test it with diverse use cases that include different types of accelerators, tiling scenarios, and dataflow schemes. We compare our experimental results to manual implementations of host-accelerator driver code and find that our approach can reduce CPU cache references by 56% and deliver up to a 1.65x speedup.

Bohm Agostini, Nicolas↗

Benchmark Generation and Simulation at Extreme Scale

The path to extreme scale high-performance computing (HPC) poses several challenges related to power, performance, resilience, productivity, programmability, data movement, and data management. Investigating the performance of parallel applications at scale on future architectures and the performance impact of different architectural choices is an important component of HPC hardware/software co-design. Simulations using models of future HPC systems and communication traces from applications running on existing HPC systems can offer an insight into the performance of future architectures. This work targets technology developed for scalable application tracing of communication events. It focuses on extreme-scale simulation of HPC applications and their communication behavior via lightweight parallel discrete event simulation for performance estimation and evaluation. Instead of simply replaying a trace within a simulator, this work promotes the generation of a benchmark from traces. This benchmark is subsequently exposed to simulation using models to reflect the performance characteristics of future-generation HPC systems. This technique provides a number of benefits, such as eliminating the data intensive trace replay and enabling simulations at different scales. The presented work features novel software co-design aspects, combining the ScalaTrace tool to generate scalable trace files, the ScalaBenchGen tool to generate the benchmark, and the xSim tool to assess the benchmark characteristics within a simulator.

Lagadapati, Mahesh↗

Power Quality Improvement Utilizing Photovoltaic Generation Connected to a Weak Grid

Microgrid research and development in the past decades have been one of the most popular topics. Similarly, the photovoltaic generation has been surging among renewable generation in the past few years, thanks to the availability, affordability, technology maturity of the PV panels and the PV inverter in the general market. Unfortunately, quite often, the PV installations are connected to weak grids and may have been considered as the culprit of poor power quality affecting other loads in particular sensitive loads connected to the same point of common coupling (PCC). This paper is intended to demystify the renewable generation, and turns the negative perception into positive revelation of the superiority of PV generation to the power quality improvement in a microgrid system. The main objective of this work is to develop a control method for the PV inverter so that the power quality at the PCC will be improved under various disturbances. The method is to control the reactive current based on utilizing the grid current to counteract the negative impact of the disturbances. The proposed control method is verified in PSIM platform. Promising results have been obtained.

14 SOLAR ENERGY↗

ScienceSearch: Enabling Search through Automatic Metadata Generation

© 2018 IEEE. Scientific facilities are increasingly generating and handling large amounts of data from experiments and simulations. Next-generation scientific discoveries rely on insights derived from data, especially across domain boundaries. Search capabilities are critical to enable scientists to discover datasets of interest. However, scientific datasets often lack the signals or metadata required for effective searches. Thus, we need formalized methods and systems to automatically annotate scientific datasets from the data and its surrounding context. Additionally, a search infrastructure needs to account for the scale and rate of application data volumes. In this paper, we present ScienceSearch, a system infrastructure that uses machine learning techniques to capture and learn the knowledge, context, and surrounding artifacts from data to generate metadata and enable search. Our current implementation is focused on a dataset from the National Center for Electron Microscopy (NCEM), an electron microscopy facility at Lawrence Berkeley National Laboratory sponsored by the Department of Energy which supports hundreds of users and stores millions of micrographs. In this paper, we describe a) our search infrastructure and model, b) methods for generating metadata using machine learning techniques, and c) optimizations to improve search latency, and deployment on an HPC system. We demonstrate that ScienceSearch is capable of producing valid metadata for NCEM's dataset and providing low-latency good quality search results over a scientific dataset.

Rodrigo, Gonzalo P.↗

Automated Generation of Integrated Digital and Spiking Neuromorphic Machine Learning Accelerators

The growing numbers of application areas for artificial intelligence (AI) methods have led to an explosion of domain-specific accelerators that could support every new machine learning (ML) algorithm advancement, clearly highlighting the need for a capability to quickly and automatically transition from algorithm definition to hardware implementation and explore design space along a variety of SWaP (size, weight and Power). The software defined architectures (SODA) synthesizer implements a compiler-based modular infrastructure for the end-to-end generation of machine learning accelerators from high-level frameworks to hardware description language. At the same time, neuromorphic computing, by mimicking how the brain operates, promises to perform artificial intelligence tasks at efficiencies orders of magnitude higher than the current conventional tensor-processing based accelerators, as demonstrated by a variety of specialized designs leveraging Spiking Neural Networks (SNNs). Nevertheless, the mapping of an artificial neural network (ANN) to solutions supporting SNNs is still a non-trivial and very device-specific task, and completely lack the possibility to design hybrid systems that integrate conventional and spiking neural models. In this paper we discuss the support for such an integrated generation leveraging the SODA Synthesizer framework and its modular structure. In particular, we present a new MLIR dialect (part of the SODA frontend) that allows expressing spiking neural network features (e.g., available resources, spiking sequences, analog signal reading, etc.) and illustrate how it enables mapping to Spiking Neurons and deployment to the related specialized hardware (which, in the digital domain, could be generated through the other existing layers of the SODA Synthesizer). We then discuss the opportunities for even deeper integration afforded by the hardware compilation infrastructure, providing a path towards the generation of complex heterogeneous artificial intelligence systems.

Curzel, Serena↗

Performance of High Voltage Bipolar Pulse Generator with Fast Push-Pull Solid-State Switch Modules

Four identical pulse generators (pulsers) provide fast beam deflection in the Low Energy Beam Transport (LEBT) beam chopping system at the Spallation Neutron Source (SNS) Linac. The existing pulsers have become obsolete and need to be replaced to improve overall performance of the chopper system. A new bipolar pulse generator has been designed, and a prototype has been built and tested at the SNS. The generator uses fast push-pull transistor BEHLKE switch modules. It can produce a 1MHz burst of alternate 2.5kV with adjustable pulse widths during the 1-ms macro-pulse at a burst repetition frequency of 60Hz with rise/fall times of less than 40ns into a 100pF capacitive load. The performance enhancements of this new pulser in comparison with existing and previous versions of the pulse generator are discussed in the paper. The pulser can be used in applications requiring a series of bipolar ±3.5kV pulses, or unipolar pulses of positive or negative polarity with amplitude up to 4.5kV and various pulse widths with a minimum of 150ns. The maximum switching frequency, number of pulses, or burst repetition frequency in burst mode is limited by maximum power dissipation in the switches and other components. The features of this new pulser along with the results of timing control adjustments, timing and temperature measurements, and HV full power testing on the test stand are presented.

Peplov, Vladimir↗

A Data-Driven Framework for Residential Electric Vehicle Charging Load Profile Generation

Residential electric vehicle charging load profile is indispensable to achieve reliable control strategies for mitigating negative effects on power distribution system due to emerging electrified transportation. This paper introduces a data-driven framework of charging load profile generation for residential plug-in electric vehicles. Real world historical residential charging behavior data is utilized to construct empirical charging decision making model by using machine learning algorithm. A multiple channels method with kernel density estimation is proposed to construct probability density functions for estimating charging duration based on parking duration. A generation algorithm considering parking time and travel demand dependency is introduced to generate residential charging behaviors. This framework is extensible to generate various charging load profiles and simulate varied residential charging scenarios under different number of households and charging rates. This will be crucial for designing and validating residential charging control strategies.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

A Digital Three Level Space Vector Modulator for High Frequency Vector Sequence Generation

This letter proposes a digital high-speed three-level space vector pulse width modulator (3L-SVPWM). A conventional 3L-SVPWM is typically computation-based, involving a sequential execution of sub-tasks on a digital signal processor (DSP) based controller. The resulting high computation time of 5.4 μs limits the implementation of additional control blocks for switching frequencies greater than 100 kHz. This is overcome by transforming sub-tasks into digital blocks with 1-0 decisions and simpler arithmetic operations. The sub-task blocks are executed concurrently on a programmable logic device (PLD). Hence, a fast 3L-SVPWM execution in 140 ns is achieved. The proposed digital 3L-SVPWM enables high switching frequency operation of wide bandgap (WBG) device-based 3 L inverters to generate high fundamental frequency waveforms. A finite state machine is an integral part of the proposed implementation with the ability to generate any vector sequence, maximizing the usage of redundant vector states in 3L-SVPWM. Here, the proposed digital 3L-SVPWM operation is demonstrated with a GaN-based 3 L active neutral point clamped (3L-ANPC) inverter. Experimental results are presented at 250 kHz switching frequency to generate vector sequences for center-aligned SVPWM (CA-SVPWM) and common mode voltage reduced SVPWM (CMVR-SVPWM). The results also showcase a high fundamental frequency generation capability of 10 kHz.

active neutral point clamped inverter↗

Robustness: The Missing Ingredient in Generation Scheduling

This article highlights robustness as an essential factor to cope with the ever-increasing levels of uncertainty in generation scheduling under significant renewable energy penetration, as is the case in Brazil and Spain. To that end, robust generation scheduling is framed within the different optimization-based approaches that are available for uncertainty handling. In addition, the suitability of robust optimization to accommodate practical security criteria in generation scheduling is also emphasized. Interestingly, this article points out the existence of an effective algorithm allowing the discovery of critical or so-called umbrella scenarios, which paves the way for the implementation of robust generation scheduling in industry practice.

Street, Alexandre↗

Adaptive building load control to enable high penetration of solar photovoltaic generation

This paper investigates the ability of a collection of deferrable heating, ventilation and air conditioning (HVAC) loads to directly emulate energy storage devices (ESD), that is, to absorb any low frequency fluctuations in solar generation. We find the optimal number of aggregated HVAC loads to absorb solar fluctuation in the same frequency band based on frequency analysis. To guarantee quality of service in afleet of residential buildings, an optimization problem is formed to compute optimal schedule of the HVAC loads considering temperature comfort band and available solar generation. By minimizing the tracking error between solar generation and total consumption, the proposed method also quantifies the minimum capacity of ESD (battery or fly-wheel) . The simulation results show that the proposed techniques are able to achieve good solar tracking performance as well as obtain a minimal ESD capacity. Therefore, we show that most of the renewable generation can be consumed locally through an intelligent coordination of HVAC loads, their impacts on the grid would be minimal and the required ESD capacity can be minimized.

Dong, Jin↗

WfBench: Automated Generation of Scientific Workflow Benchmarks

The prevalence of scientific workflows with high computational demands calls for their execution on various distributed computing platforms, including large-scale leadership-class high-performance computing (HPC) clusters. To handle the deployment, monitoring, and optimization of workflow executions, many workflow systems have been developed over the past decade. There is a need for workflow benchmarks that can be used to evaluate the performance of workflow systems on current and future software stacks and hardware platforms.We present a generator of realistic workflow benchmark specifications that can be translated into benchmark code to be executed with current workflow systems. Our approach generates workflow tasks with arbitrary performance characteristics (CPU, memory, and I/O usage) and with realistic task dependency structures based on those seen in production workflows. We present experimental results that show that our approach generates benchmarks that are representative of production workflows, and conduct a case study to demonstrate the use and usefulness of our generated benchmarks to evaluate the performance of workflow systems under different configuration scenarios.

Coleman, Taina↗

Behind-the-Meter Solar Generation Disaggregation using Consumer Mixture Models

To facilitate deep penetration of solar energy in smart grids, we need high observability of solar generation at the edges of the grid. Current advanced metering infrastructures (AMI) only monitor the aggregated measurements from net-metered households, but disaggregated consumption and solar generation components are required for grid optimizations. We propose an unsupervised disaggregation model for disaggregating solar generation from AMI measurements without the need of training data. The model requires only AMI measurements from consumers in a region and the solar irradiance as input, and models the consumption of consumers by neighboring households without rooftop photovoltaics (PV) to perform the disaggregation. We evaluate our results on a real life dataset from Austin, Texas. We show that our model is able to disaggregate consumption and solar generation measurements with 42.24% and 31.67% less mean squared error, respectively, in comparison to a baseline technique that uses supervised learning. This shows that our model is capable of disaggregating historical data even if the dataset has no training data and only contains minimal exogenous data.

14 SOLAR ENERGY↗