SEARCH · Engineering Papers
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.
In this paper we present the Serial-Refine method for quickly finding the optimal yaw angles in wake steering. The method optimizes turbine angles serially from upstream to downstream using a small number of candidate angles. The presented results show that Serial-Refine finds solutions that are at least as good as former conventional optimization approaches but that require much less computation time.
Generation of simulated detector response to collision products is crucial to data analysis in particle physics, but computationally very expensive. One subdetector, the calorimeter, dominates the computational time due to the high granularity of its cells and complexity of the interactions. Generative models can provide more rapid sample production, but currently require significant effort to optimize performance for specific detector geometries, often requiring many models to describe the varying cell sizes and arrangements, without the ability to generalize to other geometries. Here, we develop a geometry-aware autoregressive model, which learns how the calorimeter response varies with geometry, and is capable of generating simulated responses to unseen geometries without additional training. The geometry-aware model outperforms a baseline unaware model by over 50% in several metrics such as the Wasserstein distance between the generated and the true distributions of key quantities which summarize the simulated response. A single geometry-aware model could replace the hundreds of generative models currently designed for calorimeter simulation by physicists analyzing data collected at the Large Hadron Collider. This proof-of-concept study motivates the design of a foundational model that will be a crucial tool for the study of future detectors, dramatically reducing the large upfront investment usually needed to develop generative calorimeter models.
Abstract The co-occurrence of freezing rain, ice accumulation and wind gusts (FZG) poses a significant hazard to infrastructure and transportation. However, quantification of the frequency and intensity of FZG is challenged by the lack of direct icing measurements. In this work, we evaluate and then apply an energy balance model to high-frequency data collected during 2005–2022 to derive hourly ice accumulation at 883 stations across the contiguous USA. These estimates are combined with wind gust observations to compute time series of hourly FZG hazard magnitude using the Sperry–Piltz Ice Accumulation (SPIA) index. Results are evaluated using Storm Reports of damage and economic disruption. The hourly SPIA estimates are also used to (i) derive a geospatial atlas of the hazard including the 50 yr return period event intensities for each US state derived using superstations, and (ii) describe storylines of significant events in terms of meteorological drivers and socioeconomic impacts. The highest values of SPIA during the 18 yr study period occur in a region extending from the Southern Great Plains over the Midwest into the densely populated Northeast. States in these regions also have high 50 yr return period maximum radial ice accumulation of 3–5 cm and co-occurring wind gusts >30 ms −1 . These values are comparable to past estimates for the 500 yr event which may imply this hazard has been previously underestimated. This atlas can be used to inform optimal FZG hazard mitigation strategies for each state/region.
The accurate calculation of phonons and vibrational spectra remains a significant challenge, requiring highly precise evaluations of interatomic forces. Traditional methods based on the quantum description of the electronic structure, while widely used, are computationally expensive and demand substantial expertise. Emerging universal machine learning interatomic potentials (uMLIPs) offer a transformative alternative by employing pre-trained neural network surrogates to predict interatomic forces directly from atomic coordinates. This approach dramatically reduces computation time and minimizes the need for technical knowledge. In this paper, we produce a phonon database comprising nearly 5000 inorganic crystals to benchmark the performance of several leading uMLIPs. We further assess these models in real-world applications by using them to analyze experimental inelastic neutron scattering data collected on a variety of materials. Through detailed comparisons, we identify the strengths and limitations of these uMLIPs, providing insights into their accuracy and suitability for fast calculations of phonons and related properties, as well as the potential for real-time interpretation of neutron scattering spectra. Our findings highlight how the rapid advancement of AI in science is revolutionizing experimental research and data analysis.
Abstract Background The increasing production of genomic data has led to an intensified need for models that can cope efficiently with the lossless compression of DNA sequences. Important applications include long-term storage and compression-based data analysis. In the literature, only a few recent articles propose the use of neural networks for DNA sequence compression. However, they fall short when compared with specific DNA compression tools, such as GeCo2. This limitation is due to the absence of models specifically designed for DNA sequences. In this work, we combine the power of neural networks with specific DNA models. For this purpose, we created GeCo3, a new genomic sequence compressor that uses neural networks for mixing multiple context and substitution-tolerant context models. Findings We benchmark GeCo3 as a reference-free DNA compressor in 5 datasets, including a balanced and comprehensive dataset of DNA sequences, the Y-chromosome and human mitogenome, 2 compilations of archaeal and virus genomes, 4 whole genomes, and 2 collections of FASTQ data of a human virome and ancient DNA. GeCo3 achieves a solid improvement in compression over the previous version (GeCo2) of $2.4\%$, $7.1\%$, $6.1\%$, $5.8\%$, and $6.0\%$, respectively. To test its performance as a reference-based DNA compressor, we benchmark GeCo3 in 4 datasets constituted by the pairwise compression of the chromosomes of the genomes of several primates. GeCo3 improves the compression in $12.4\%$, $11.7\%$, $10.8\%$, and $10.1\%$ over the state of the art. The cost of this compression improvement is some additional computational time (1.7–3 times slower than GeCo2). The RAM use is constant, and the tool scales efficiently, independently of the sequence size. Overall, these values outperform the state of the art. Conclusions GeCo3 is a genomic sequence compressor with a neural network mixing approach that provides additional gains over top specific genomic compressors. The proposed mixing method is portable, requiring only the probabilities of the models as inputs, providing easy adaptation to other data compressors or compression-based data analysis tools. GeCo3 is released under GPLv3 and is available for free download at https://github.com/cobilab/geco3.
In this paper, we predict the covariance matrices of both the power spectrum and the bispectrum, including full non-Gaussian contributions, redshift space distortions, linear bias effects, and shot-noise corrections, using perturbation theory (PT). To quantify the redshift-space distortion effect, we focus mainly on the monopole and quadrupole components of both the power and bispectra. We, for the first time, compute the 5- and 6-point spectra to predict the cross-covariance between the power and bispectra, and the autocovariance of the bispectrum in redshift space. Further, we test the validity of our calculations by comparing them with the covariance matrices measured from the MultiDark-Patchy mock catalogues that are designed to reproduce the galaxy clustering measured from the Baryon Oscillation Spectroscopic Survey Data Release 12. We argue that the simple, leading-order PT works because the shot-noise corrections for the Patchy mocks are more dominant than other higher order terms we ignore. In the meantime, we confirm some discrepancies in the comparison, especially of the cross-covariance. We discuss potential sources of such discrepancies. We also show that our PT model reproduces well the cumulative signal-to-noise ratio of the power spectrum and the bispectrum as a function of maximum wavenumber, implying that our PT model captures successfully essential contributions to the covariance matrices.
We present an algorithm to include the correlation between the production and decay planes of gluons in a parton-shower simulation. The technique is based on identifying the charge currents responsible for the creation and annihilation of the vector field. It is applicable in both the hard-collinear and the soft wide-angle region. As a function of the number of particles, the algorithm scales linear in computing time and memory. We demonstrate agreement with fixed-order perturbative calculations in the relevant kinematical limits, and present a new observable that can be used to probe correlations beyond current-current interactions.
Motivated by the out-of-equilibrium dynamics during an early-Universe first-order phase transition, we perform real-time simulations of fermion-bubble scattering in 1 + 1 dimensions. This nonequilibrium process can generate a charge-conjugation C asymmetry outside the bubble wall, induced by the complex fermion mass profile. The resulting C asymmetry is the 1 + 1 -dimensional analog of the C P asymmetry in 3 + 1 dimensions, a key ingredient in baryon asymmetry generation at the electroweak scale. Using tensor network methods, we track the real-time evolution of the C asymmetry in the charge density as the fermion interacts with the bubble wall, a regime inaccessible to analytic calculations. We further introduce two observables to quantify the asymmetry in the asymptotic region where reflected particles are well separated from the scattering point: one based on the net charge outside the bubble wall, and the other on the spatial displacement between the reflected particle and antiparticle wave packets. Our study represents a first step toward nonperturbative, real-time computations of C P asymmetry in 3 + 1 dimensions for electroweak baryogenesis.
Here, we develop a class of emulators for solving quantum three-body scattering problems. They are based on combining the variational method for scattering observables and the recently proposed eigenvector continuation concept. The emulators are first trained by the exact scattering solutions of the governing Hamiltonian at a small number of points in its parameter space, and then employed to make interpolations and extrapolations in that space. Through a schematic nuclear-physics model with finite-range two and three-body interactions, we demonstrate the emulators to be extremely accurate and efficient. The computing time for emulation is on the scale of milliseconds (on a laptop), with relative errors ranging from 10 –13 to 10 –4 depending on the case. The emulators also require little memory. We argue that these emulators can be generalized to even more challenging scattering problems. Furthermore, this general strategy may be applicable for building the same type of emulators in other fields, wherever variational methods can be developed for evaluating physical models.
This paper formalizes the use of integral and differential cumulants for measurements of multiparticle event-by-event transverse momentum fluctuations, rapidity fluctuations, as well as net-charge fluctuations. This enables the introduction of multiparticle balance functions, defined based on differential correlation functions (factorial cumulants), that suppress two- and three-prong resonance decays effects and enable measurements of underlying long-range correlations obeying quantum number conservation constraints. These multiparticle balance functions satisfy simple sum rules determined by quantum number conservation. It is additionally shown that these multiparticle balance functions arise as an intrinsic component of high-order net-charge cumulants. This implies that the magnitude of these cumulants, measured in a specific experimental acceptance, is strictly constrained by charge conservation and primarily determined by the rapidity and momentum width of these balance functions. The paper also presents techniques to reduce the computation time of differential correlation functions up to order n = 10 based on the methods of moments. Published by the American Physical Society 2024
Accurately evaluating configurational integrals for dense solids remains a central and difficult challenge in the statistical mechanics of condensed systems. Here, we present a tensor network approach that reformulates the high-dimensional configurational integral for identical-particle crystals into a sequence of computationally efficient summations. We represent the integrand as a high-dimensional tensor and apply tensor-train (TT) decomposition together with a custom TT-cross interpolation. This approach circumvents the need to explicitly construct the full tensor. We introduce tailored rank-1 and rank-2 schemes optimized for sharply peaked Boltzmann probability densities, typical for identical-particle crystals. When applied to the calculation of internal energy and pressure-temperature curves for crystalline Cu and Ar at high (GPa) pressures, as well as the alpha-to-beta phase transition diagram of Sn, our method accurately reproduces molecular dynamics simulation results using tight-binding, machine learning, hierarchical interacting particle–neural network, and modified embedded atom method potentials,all within seconds of computation time.
Early but promising results in quantum computing have been enabled by the concurrent development of quantum algorithms, devices, and materials. Classical simulation of quantum programs has enabled the design and analysis of algorithms and implementation strategies targeting current and anticipated quantum device architectures. In this paper, we present a graph-based approach to achieve efficient quantum circuit simulation. Our approach involves partitioning the graph representation of a given quantum circuit into sub-graphs/circuits that exhibit better data locality. Simulation of each sub-circuit is organized hierarchically, with the iterative construction and simulation of smaller state vectors, improving overall performance. Also, this partitioning reduces the number of passes through data, improving the total computation time. We present three partitioning strategies and observe that acyclic graph partitioning typically results in the best time-to-solution. In contrast, other strategies reduce the partitioning time at the expense of potentially increased simulation times. Experimental evaluation demonstrates the effectiveness of our approach.
We introduce the I-24 Mobility Technology Interstate Observation Network (MOTION), a transportation cyber-physical systems testbed under development in Tennessee. It consists of a six-mile freeway segment instrumented with 400 4K resolution cameras, processed by a real-time compute system to enable continuous performance monitoring of freeway traffic. The testbed is being developed to support next generation connected and autonomous vehicle technologies and advanced traffic management. When complete, the testbed will be the longest continuously observed freeway segment in the world. This article introduces the testbed, discusses the core design choices, and outlines the preliminary work conducted to support the design.
The nodal admittance matrix (NAM)-based approach is suitable for analyzing the small-signal stability of large-scale power electronics-based power systems (PEPSs) as it preserves the system structure by utilizing the admittance matrix. Previously, NAM-based area partition has been proposed, which divides the system into various subareas and interconnections for easier analysis of the low-dimension matrix compared to the entire system-based high-dimension matrix. However, no partition algorithm has been presented for the NAM-based area partition method. This paper focuses on implementing the spectral partitioning algorithm for partitioning large-scale PEPSs into a low-dimension matrix to reduce the computation complexity of the analysis. These spectral components facilitate data transformation into a new space, enabling the application of traditional clustering methods like k-means. To evaluate the performance of the partitioning method, the subareas and interconnections obtained from the spectral clustering algorithm are incorporated into the NAM-based area partition method for a large system with 140 buses. The computational times of the original method, where the NAM-based criterion is directly applied to the entire system, are compared with those of the NAM-based partition method in MATLAB. PSCAD simulations of the whole system and the obtained subareas are conducted to validate the effectiveness of the proposed algorithm.
Economic dispatch in multi-microgrid (MMG) systems requires coordinating distributed energy resources (DERs) of different microgrids, which leads to a significant increase in the number of states for energy management. In these cases, traditional reinforcement learning (RL) approaches become computationally expensive or output a solution that causes extra-operating costs for the system. This paper proposes an RL approach that employs local learning agents to interact with microgrid environments in a distributed manner and aggregates the outcomes to train the global agent to learn the policy for the MMG system. This distributed exploration and aggregation process provides an effective solution and guides the global agent to learn the dispatch policy efficiently. Case studies are performed on a system with three microgrids with different types of DERs. Results obtained using the proposed RL and comparisons with conventional methods substantiate the effectiveness of the proposed approach in terms of operation costs, computation time, and peak-to-average ratio.
A conceptual numerical methodology derived from Grid Architecture principles is introduced for deconflicting setpoints issued by multiple advanced distribution management system applications. The methodology applies technical, economic, environmental, and social rules to eliminate non-viable combinations. The concept of temporal equipment controls budgets is introduced to preserve the health of physical assets and avoid equipment damage through repeated controls cycling. The rules are combined with a multi-criteria decision-making framework to select a near-optimal set of deconflicted setpoints using a set of qualitative and quantitative decision criteria selected by the distribution system operator. Numerical results are demonstrated on the IEEE 123-bus test feeder for three competing applications. Three alternative distributed schemes are used to decompose the problem: by topological area, by phase, and fully decentralized. The fully decentralized implementation is shown to yield near-optimal deconfliction results with significantly reduced computational time.
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.
Thermomechanical simulation of photovoltaic (PV) modules using the finite element method (FEM) is a useful tool to evaluate module design features in terms of structural integrity, reliability, and durability. One of the main challenges in the numerical modeling of a PV module is the incorporation of residual stresses induced by the manufacturing process. Modeling assumptions and abstractions are necessary to limit the model complexity and reduce the computational time. However, oversimplifications and incorrect assumptions can lead to erroneous numerical results. Unfortunately, much simulation work still neglects process-induced stresses. This can lead to incorrect predictions of the stress-strain history and erroneous conclusions during the design process. In this work, we review current modeling practices for incorporating process-induced stresses, and contrast numerical models that consider residual stresses with those that neglect them. We find that the simulation objective and available material properties dictate which process steps need to be modeled, and explore in depth the modeling of residual stresses induced by the lamination process. We demonstrate that a simplified cooldown procedure at the beginning of the simulation can increase the model accuracy and discuss appropriate choices for starting and reference temperatures in the finite element model.