RHOD Site - PNNL Surface Flux Station at 4m / Derived Data
This dataset contains a compilation of 30-minute estimates of preliminary processed turbulent fluxes for one day.
17 WIND ENERGY↗
SEARCH · Engineering Papers
Results for “compilation”
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.
PV Module BOM and Test Data
This dataset contains compiled results from annual PV Module Reliability Scorecards published by PV Evolution Labs – also known as PVEL. These scorecards show summary results of PV module testing performed by PVEL and name specific models of PV modules as "Top Performers" in various tests. Full details on testing, Top Performer status and other criteria for inclusion in Scorecards are documented in reports and online documentation available from https://www.modulescorecard.pvel.com. This dataset is not affiliated with PVEL and is intended only to simplify sorting and filtering Scorecard data and finding specific PV module models and Top Performer results. Note that data included in Scorecards has evolved over time, so not all data is available for all years, and testing protocols and Scorecard criteria have been changed over time.
14 SOLAR ENERGY↗
Cost of Mitigating the Environmental Impacts of Hydropower Projects
The "Cost of Mitigating the Environmental Impacts of Hydropower Projects Database" compiles data on environmental impacts mitigation costs for 182 hydropower projects based on documents obtained from the U.S. Federal Energy Regulatory Commission (FERC).
13 HYDRO ENERGY↗
Cost of Fish Exclusion Technologies for Hydropower
This dataset compiles data on the costs of environmental mitigations related to fish exclusion for 35 hydropower projects based on documents obtained from the U.S Federal Energy Regulatory Commission (FERC). Data for all measures and their associated project-specific information, including installed and hydraulic capacities, were manually extracted from environmental impact statements and/or environmental assessment (EIS/EA) documents. All data were consolidated in a comma-separated (.csv) file, referred to as the Cost of Fish Exclusion Technologies for Hydropower Database.
13 HYDRO ENERGY↗
U.S. Hydropower Development Pipeline Data, 2026
The U.S. Hydropower Development Pipeline dataset provides a comprehensive, regularly updated view of proposed and potential hydropower projects across the United States. This resource compiles information from federal agencies and other public sources to track non-powered dams considered for electrification, proposed hydropower facilities at stream reaches with no existing dams, conduit exemptions, and emerging pumped storage hydropower proposals. The dataset includes project characteristics such as location, development status, technology type, ownership category, and other attributes that support analysis of future hydropower trends. It is designed to help researchers, planners, policymakers, and stakeholders assess national‑scale development patterns, understand the evolving hydropower landscape, and explore opportunities and challenges associated with new hydropower deployment. The dataset is updated annually to reflect changes in project status, new proposals entering the pipeline, and projects that are cancelled, completed, or otherwise removed from active consideration. Note: Capacity additions to existing hydropower plants are not included in this database due to reliance on a proprietary data source.
Johnson, Megan [ORNL] (ORCID:0000000290141741)↗
U.S. Hydropower Relicensing and License Surrender Data and Metadata, 2026
The U.S. Hydropower Relicensing and License Surrender Database (2026) provides a comprehensive, nationwide snapshot (as of December 31, 2025) of hydropower projects across the United States that are undergoing Federal Energy Regulatory Commission (FERC) relicensing or license surrender processes. Compiled by Oak Ridge National Laboratory, the dataset includes detailed project-level attributes such as geographic location, ownership type, waterway, project type (hydropower or pumped storage), regulatory milestones (e.g., Notice of Intent, application dates, FERC issuance dates), licensing process type (ILP, TLP, ALP), operational characteristics, capacity changes, settlement agreements, construction or turbine‑generator investments, and project status categories spanning relicensing, surrenders, exemptions, and terminations. Together, the relicensing and surrender records offer a detailed view of regulatory trends, infrastructure transitions, dam removals, and economic drivers influencing the evolution of the U.S. hydropower fleet.
Johnson, Megan [ORNL] (ORCID:0000000290141741)↗
Hydropower Fish Passage Webmap
The National Fish Passage Webmap application provides an environment that allows users to visualize information information on fish passage facility existence, type, and direction at hydropower developments across the conterminous United States. It was developed through collaborative partnerships with fish passage engineers and biologists at both the US Fish and Wildlife Service (USFWS) and the National Marine Fisheries Service (NMFS), and hydropower experts at the Low Impact Hydropower Institute (LIHI). Data on fish passage facilities at hydropower features were compiled from numerous sources including published and non-published datasets, published reports, email communications with federal and state resource managers and hydropower operators, and by extracting information from regulatory documents within the FERC eLibrary. The number of sources for a given feature varied, which occasionally resulted in conflicting information regarding the existence of fish passage facilities or in the type or sub-type of passage technologies. Such discrepancies were reviewed and resolved individually, based on the weight of evidence or, when available, on direct observations from information providers or aerial imagery.
13 HYDRO ENERGY↗
ORNL Hydropower Cost Database Extract from FERC Form-1
The ORNL FERC Form 1 Hydropower Cost Database Extract is a cleaned and compiled version of the hydropower component of the Federal Energy Regulatory Commission’s (FERC) Electric Utility Annual Report, also known as Form-1. The database includes conventional and pumped storage hydropower plants owned by non-federal major utilities that submitted the Form 1 data from 1994-2020, representing about 22% of existing conventional hydropower capacity and 61% of pumped storage capacity. The database includes the escalation factors and describes the methods used to scale costs to a common data year, as well as tables of identifiers necessary to link the hydropower plants to two other relevant databases, the National Inventory of Dams and the ORNL Existing Hydropower Assets database. This database provides historical capital and operating costs for three schedules/classes defined in Form 1: Large Hydro, Pumped Storage Hydro, and Small Hydro. The Large Hydro and Pumped Storage Hydro data include cost items, such as land, structures, facilities, etc.
13 HYDRO ENERGY↗
An Adaptive Optimizer for Measurement-Frugal Variational Algorithms
Variational hybrid quantum-classical algorithms (VHQCAs) have the potential to be useful in the era of near-term quantum computing. However, recently there has been concern regarding the number of measurements needed for convergence of VHQCAs. Here, we address this concern by investigating the classical optimizer in VHQCAs. We introduce a novel optimizer called individual Coupled Adaptive Number of Shots (iCANS). This adaptive optimizer frugally selects the number of measurements (i.e., number of shots) both for a given iteration and for a given partial derivative in a stochastic gradient descent. We numerically simulate the performance of iCANS for the variational quantum eigensolver and for variational quantum compiling, with and without noise. In all cases, and especially in the noisy case, iCANS tends to out-perform state-of-the-art optimizers for VHQCAs. We therefore believe this adaptive optimizer will be useful for realistic VHQCA implementations, where the number of measurements is limited.
97 MATHEMATICS AND COMPUTING↗
Ancilla-free continuous-variable SWAP test
We propose a continuous-variable (CV) SWAP test that requires no ancilla register, thereby generalizing the ancilla-free SWAP test for qubits. In this ancilla-free CV SWAP test, the computational basis measurement is replaced by photon number-resolving measurement, and we calculate an upper bound on the error of the overlap estimate obtained from a finite Fock cutoff in the detector. As an example, we show that estimation of the overlap of pure, centered, single-mode Gaussian states of energy E and squeezed in opposite quadratures can be obtained to error ϵ using photon statistics below a Fock basis cutoff O(Elnϵ –1 ). This cutoff is greatly reduced to E + O(√ Elnϵ –1 ) when the states have rapidly decaying Fock tails, such as coherent states. We show how the ancilla-free CV SWAP test can be extended to many modes and applied to quantum algorithms such as variational compiling and entanglement spectroscopy in the CV setting. For the latter we also provide a new algorithm which does not have an analog in qubit systems. The ancilla-free CV SWAP test is implemented on Xanadu's 8-mode photonic processor in order to estimate the vacuum probability of a two-mode squeezed state.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Binary Control Pulse Optimization for Quantum Systems
Quantum control aims to manipulate quantum systems toward specific quantum states or desired operations. Designing highly accurate and effective control steps is vitally important to various quantum applications, including energy minimization and circuit compilation. In this paper we focus on discrete binary quantum control problems and apply different optimization algorithms and techniques to improve computational efficiency and solution quality. Specifically, we develop a generic model and extend it in several ways. We introduce a squared L 2 -penalty function to handle additional side constraints, to model requirements such as allowing at most one control to be active. We introduce a total variation (TV) regularizer to reduce the number of switches in the control. We modify the popular gradient ascent pulse engineering (GRAPE) algorithm, develop a new alternating direction method of multipliers (ADMM) algorithm to solve the continuous relaxation of the penalized model, and then apply rounding techniques to obtain binary control solutions. We propose a modified trust-region method to further improve the solutions. Our algorithms can obtain high-quality control results, as demonstrated by numerical studies on diverse quantum control examples.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Sample-efficient verification of continuously-parameterized quantum gates for small quantum processors
Most near-term quantum information processing devices will not be capable of implementing quantum error correction and the associated logical quantum gate set. Instead, quantum circuits will be implemented directly using the physical native gate set of the device. These native gates often have a parameterization (e.g., rotation angles) which provide the ability to perform a continuous range of operations. Verification of the correct operation of these gates across the allowable range of parameters is important for gaining confidence in the reliability of these devices. In this work, we demonstrate a procedure for sample-efficient verification of continuously-parameterized quantum gates for small quantum processors of up to approximately 10 qubits. This procedure involves generating random sequences of randomly-parameterized layers of gates chosen from the native gate set of the device, and then stochastically compiling an approximate inverse to this sequence such that executing the full sequence on the device should leave the system near its initial state. We show that fidelity estimates made via this technique have a lower variance than fidelity estimates made via cross-entropy benchmarking. This provides an experimentally-relevant advantage in sample efficiency when estimating the fidelity loss to some desired precision. We describe the experimental realization of this technique using continuously-parameterized quantum gate sets on a trapped-ion quantum processor from Sandia QSCOUT and a superconducting quantum processor from IBM Q, and we demonstrate the sample efficiency advantage of this technique both numerically and experimentally.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Encoding trade-offs and design toolkits in quantum algorithms for discrete optimization: coloring, routing, scheduling, and other problems
Challenging combinatorial optimization problems are ubiquitous in science and engineering. Several quantum methods for optimization have recently been developed, in different settings including both exact and approximate solvers. Addressing this field of research, this manuscript has three distinct purposes. First, we present an intuitive method for synthesizing and analyzing discrete (i.e., integer-based) optimization problems, wherein the problem and corresponding algorithmic primitives are expressed using a discrete quantum intermediate representation (DQIR) that is encoding-independent. This compact representation often allows for more efficient problem compilation, automated analyses of different encoding choices, easier interpretability, more complex runtime procedures, and richer programmability, as compared to previous approaches, which we demonstrate with a number of examples. Second, we perform numerical studies comparing several qubit encodings; the results exhibit a number of preliminary trends that help guide the choice of encoding for a particular set of hardware and a particular problem and algorithm. Our study includes problems related to graph coloring, the traveling salesperson problem, factory/machine scheduling, financial portfolio rebalancing, and integer linear programming. Third, we design low-depth graph-derived partial mixers (GDPMs) up to 16-level quantum variables, demonstrating that compact (binary) encodings are more amenable to QAOA than previously understood. We expect this toolkit of programming abstractions and low-level building blocks to aid in designing quantum algorithms for discrete combinatorial problems.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Mapping Spiking Neural Networks to Heterogeneous Crossbar Architectures using Integer Linear Programming
Advances in novel hardware devices and architectures allow Spiking Neural Network (SNN) evaluation using ultra-low power, mixed-signal, memristor crossbar arrays. As individual network sizes quickly scale beyond the dimensional capabilities of single crossbars, networks must be mapped onto multiple crossbars. Crossbar sizes within modern Memristor Crossbar Architectures (MCAs) are determined predominately not by device technology but by network topology; more, smaller crossbars consume less area thanks to the high structural sparsity found in larger, brain-inspired SNNs. Motivated by continuing increases in SNN sparsity due to improvements in training methods, we propose utilizing heterogeneous crossbar sizes to further reduce area consumption. This approach was previously unachievable as prior compiler studies only explored solutions targeting homogeneous MCAs. Our work improves on the state-of-the-art by providing Integer Linear Programming (ILP) formulations supporting arbitrarily heterogeneous architectures. By modeling axonal interactions between neurons, our methods produce better mappings while removing inhibitive a priori knowledge requirements. We first show a 16.7-27.6% reduction in area consumption for square-crossbar homogeneous architectures. Then, we demonstrate 66.9-72.7% further reduction when using a reasonable configuration of heterogeneous crossbar dimensions. Next, we present a new optimization formulation capable of minimizing the number of inter-crossbar routes. When applied to solutions already near-optimal in area, an 11.9-26.4% routing reduction is observed without impacting area consumption. Finally, we present a profile-guided optimization capable of minimizing the number of runtime spikes between crossbars. Compared to the best-area-then-route optimized solutions, we observe a further 0.5-14.8% inter-crossbar spike reduction while requiring 1–3 orders of magnitude less solver time.
Pohl, Devin [ORNL] (ORCID:0009000040149027)↗
Using Numba for GPU acceleration of Neutron Beamline Digital Twins
Digital twins of neutron instruments using Monte Carlo ray tracing have proven to be useful in neutron data analysis and verifying instrument and sample designs. However, these simulations can become quite complex and computationally demanding with tens of billions of neutrons. In this paper, we present a GPU accelerated version of MCViNE using Python and Numba to balance user extensibility with performance. Numba is an open-source just-in-time (JIT) compiler for Python using LLVM to generate efficient machine code for CPUs and GPUs with NVIDIA CUDA. The JIT nature of Numba allowed complex instrument kernels to be generated easily. Initial simulations have shown a speedup between 200-1000x over the original CPU implementation. The performance gain with Numba enables more sophisticated data analysis and impacts neutron scattering science and instrument design.
Kendrick, Coleman↗
2D Modeling of Plasma Streamer and Glow Phases at Ammonia-Air Flame Conditions
Streamer and glow plasma phases have been modeled at two thermochemical states of an ammonia-air flame: fresh reactants and burnt products. A new AMReX-based solver has been verified against benchmarks in the literature and has been used to perform these simulations. A Helmholtz-equation based photoionization model with parameters accounting for the presence of NH3 in air has been coupled with the solver to accurately model the streamer propagation phase. A detailed plasma kinetics mechanism has been compiled and used to predict the evolution of electrons, excited states, ions, and radicals during streamer propagation and glow formation. The propagation velocity of streamers was found increase by almost two-fold when the mixture was changed from the fresh reactants to the burnt products. Moreover, vibrational excitation was found to be limited to the streamer body, whereas ionization predominantly occurred at the streamer head, as is expected. Finally, the differences in the pathways of O and H radical production during the streamer propagation and glow phases have been briefly discussed.
ammonia-air flame↗
Caffeine: CoArray Fortran Framework of Efficient Interfaces to Network Environments
This paper provides an introduction to the CoArray Fortran Framework of Efficient Interfaces to Network Environments (Caffeine), a parallel runtime library built atop the GASNet-EX exascale networking library. Caffeine leverages several non-parallel Fortran features to write type- and rank-agnostic interfaces and corresponding procedure definitions that support parallel Fortran 2018 features, including communication, collective operations, and related services. One major goal is to develop a runtime library that can eventually be considered for adoption by LLVM Flang, enabling that compiler to support the parallel features of Fortran. The paper describes the motivations behind Caffeine's design and implementation decisions, details the current state of Caffeine's development, and previews future work. We explain how the design and implementation offer benefits related to software sustainability by lowering the barrier to user contributions, reducing complexity through the use of Fortran 2018 C-interoperability features, and high performance through the use of a lightweight communication substrate.
Rouson, Damian↗
Agile Acceleration of LLVM Flang Support for Fortran 2018 Parallel Programming
The LLVM Flang compiler ("Flang") is currently Fortran 95 compliant, and the frontend can parse Fortran 2018. However, Flang does not have a comprehensive 2018 test suite and does not fully implement the static semantics of the 2018 standard. We are investigating whether agile software development techniques, such as pair programming and test-driven development (TDD), can help Flang to rapidly progress to Fortran 2018 compliance. Because of the paramount importance of parallelism in high-performance computing, we are focusing on Fortran’s parallel features, commonly denoted “Coarray Fortran.” We are developing what we believe are the first exhaustive, open-source tests for the static semantics of Fortran 2018 parallel features, and contributing them to the LLVM project. A related effort involves writing runtime tests for parallel 2018 features and supporting those tests by developing a new parallel runtime library: the CoArray Fortran Framework of Efficient Interfaces to Network Environments (Caffeine).
Rasmussen, Katherine↗