Search NASA⌕ Search

SEARCH · Search NASA

Results for “Implementation”

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 829 records · Page 46

Integration of Silica in G4CMP for Phonon Simulations: Framework and Tools for Material Integration

Superconducting detectors with sub-eV energy resolution have demonstrated success setting limits on Beyond the Standard Model (BSM) physics due to their unique sensitivity to low-energy events. G4CMP, a Geant4-based extension for condensed matter physics, provides a comprehensive toolkit for modeling phonon and charge dynamics in cryogenic materials. This paper introduces a technical formalism to support the superconducting qubit and low-threshold detector community in implementing phonon simulations in custom materials into the G4CMP. As a case study, we present the results of a detailed analysis of silica phonon transport properties relevant for simulating substrate backgrounds in Beryllium Electron capture in Superconducting Tunnel junctions (BeEST)-style experiments using G4CMP. Additionally, Python-based tools were developed to aid users in implementing their own materials and are available on the G4CMP repository.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Optimal Power Management for Large-Scale Battery Energy Storage Systems via Bayesian Inference

Large-scale battery energy storage systems (BESS) have found ever-increasing use across industry and society to accelerate clean energy transition and improve energy supply reliability and resilience. However, their optimal power management poses significant challenges: the underlying high-dimensional nonlinear nonconvex optimization lacks computational tractability in real-world implementation, and the uncertainty of the exogenous power demand makes exact optimization difficult. This paper presents a new solution framework to address these bottlenecks. The solution pivots on introducing power-sharing ratios to specify each cell’s power quota from the output power demand. To find the optimal power-sharing ratios, we formulate a nonlinear model predictive control (NMPC) problem to achieve power-loss-minimizing BESS operation while complying with safety, cell balancing, and power supply-demand constraints. We then propose a parameterized control policy for the power-sharing ratios, which utilizes only three parameters, to reduce the computational demand in solving the NMPC problem. This policy parameterization allows us to translate the NMPC problem into a Bayesian inference problem for the sake of 1) computational tractability, and 2) overcoming the nonconvexity of the optimization problem. We leverage the ensemble Kalman inversion technique to solve the parameter estimation problem. Concurrently, a low-level control loop is developed to seamlessly integrate our proposed approach with the BESS to ensure practical implementation. This low-level controller receives the optimal power-sharing ratios, generates output power references for the cells, and maintains a balance between power supply and demand despite uncertainty in output power. We conduct extensive simulations and experiments on a 20-cell prototype to validate the proposed approach.

Battery energy storage systems (BESSs)↗

Closed-Loop Wind Turbine Controllers for Active Wake Mixing Strategies

Wind turbine active wake mixing (AWM) is an exciting new field of research where dynamic actuation, usually on the blade pitch angles, is used to increase wind farm-wide power production. From a controls perspective, the current state-of-the-art AWM strategies are very simple: a dynamic, usually periodic, reference signal is prescribed to actuators in an open-loop (OL) fashion. The actuation is then presumed to have a certain desired effect on the system, i.e., the wind turbine and the flow it affects. However, this system is highly nonlinear and experiences disturbances in the form of wind variations that are not known a priori. As a result, the OL approach might not yield optimal results. In this article, a novel approach is presented, which closes the loop on AWM controllers. A feedback loop is implemented, which uses measurements of the individual blade bending moments that are widely available on modern wind turbines to determine the individual blade pitch angles. A proof of concept of this implementation is presented in this article, and a thorough comparison with the OL method is executed using high-fidelity flow simulations. These simulations show that the novel closed-loop controller does not substantially increase wake mixing but achieves similar performance as the OL controller while reducing fatigue loads on the controlled turbine.

17 WIND ENERGY↗

Development of Real-Time High-Density Pulsar Data Transmission and Processing for Grid Synchronization

Taking advantage of the extreme stability of the pulsar period, it can serve as the timing source for grid synchronization to compensate for the timing drift instigated by the loss of GPS signal. Nevertheless, the real-time transmission and processing of the pulsar data suffer from its high-frequency data rate, varying from megahertz to gigahertz, resulting in reduced computing speed and increased time delay. To mitigate this issue, the hardware and software frameworks are implemented for the high-density pulsar data transmission and processing for grid synchronization in this research. Initially, the high-density pulsar data is transferred using open-source software. The complementary duty cycle timing module is designed to coordinate the operation of the dual-channel high-speed interface and software. Subsequently, the multiple-threading is applied to the receiving, parsing, and splicing pulsar data. Next, the pulsar signal extraction method is implemented based on the polyphase filterbank and time of arrival estimation. Ultimately, real-time performance verification experiments are carried out for different components under two hardware platforms. Finally, the results demonstrate that only 0.482 s is required for processing 4 Gigabyte data through multiple-threading, which is 3.8 times faster than the single thread. The pulsar signal extraction can also be executed within 707 ms for 4.8 seconds of data, thereby indicating that real-time requirements can be met.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Topology-Aware Reinforcement Learning for Voltage Control: Centralized and Decentralized Strategies

Volt-VAR control (VVC) methods based on deep reinforcement learning (DRL) can effectively control distribution grid voltage and minimize power loss by implementing corrective and preventive control measures on the reactive power output of inverter-based distributed energy resources (DERs). However, model-free DRL-based VVC approaches usually cannot capture the important topological feature of the power system since they use a fully-connected network (FCN) to deliver the action. Therefore, this paper proposes a graph convolutional network (GCN)-based DRL approach that can employ the topological information of the network to take better control action for regulating the voltage. Our implementation allows for both centralized and decentralized configurations, utilizing a single agent and multiple agents respectively. Although the centralized GCN-based DRL approach has its advantages of minimizing voltage fluctuation and power loss, it is not suitable for large scale power systems due to its challenges in terms of scalability, computation speed and potential single points of failure. Therefore, these problems can be resolved using the decentralized GCN-based DRL approach. Moreover, to ensure the safe operation of the model, our proposed approach incorporates an exponential barrier function while formulating the reward function for each agent. To validate performance of the proposed approaches, the proposed model is tested on modified IEEE test systems and the performances are measured in terms on voltage fluctuation reduction, minimization of power loss and computational speed. Finally, the results show that the proposed topology-aware approach outperforms the FCN-based DRL approach in terms of reducing voltage fluctuation and minimizing power loss of the network. Moreover, it is shown that the decentralized GCN-based DRL has faster computational speed than other approaches.

42 ENGINEERING↗

Geometric Structure and Transversal Logic of Quantum Reed–Muller Codes

Designing efficient and noise-tolerant quantum computation protocols generally begins with an understanding of quantum error-correcting codes and their native logical operations. The simplest class of native operations are transversal gates, which are naturally fault-tolerant. Here, in this paper, we aim to characterize the transversal gates of quantum Reed–Muller (RM) codes by exploiting the well-studied properties of their classical counterparts. We start our work by establishing a new geometric characterization of quantum RM codes via the Boolean hypercube and its associated subcube complex. More specifically, a set of stabilizer generators for a quantum RM code can be described via transversal X and Z operators acting on subcubes of particular dimensions. This characterization leads us to define subcube operators composed of single-qubit π/2 k Z -rotations that act on subcubes of given dimensions. We first characterize the action of subcube operators on the code space: depending on the dimension of the subcube, these operators either (1) act as a logical identity on the code space, (2) implement non-trivial logic, or (3) rotate a state away from the code space. Second, and more remarkably, we uncover that the logic implemented by these operators corresponds to circuits of multi-controlled-Z gates that have an explicit and simple combinatorial description. Overall, this suite of results yields a comprehensive understanding of a class of natural transversal operators for quantum RM codes.

Reed–Muller (RM) codes↗

Cooperative Merging via Online Speed Replanning: A Model-Free Approach With Vehicle-to-Vehicle Communication Packet Drop Compensation

On-ramp merging is a critical bottleneck in freeway traffic flow, contributing to congestion, accidents, and excessive fuel consumption. Although traditional ramp metering provides macroscopic control, it lacks the granularity for optimizing an individual vehicle’s trajectory. Cooperative merging, enabled by connected and automated vehicles, can potentially enhance traffic efficiency, safety, and fuel economy. However, existing research often neglects the influence of heterogeneous vehicle dynamics, unreliable vehicle-to-vehicle (V2V) communication, and real-time implementation challenges. Here, this paper introduces novel model-free online speed planners for cooperative on-ramp merging. The planners address these limitations by being agnostic to vehicle dynamics, effectively compensating for V2V communication packet drops and incurring only a light computational burden. Comprehensive evaluation, conducted on a real-time traffic-vehicle-communication co-simulation platform integrating high-fidelity vehicle dynamics, a traffic simulator, and recorded V2V communication footprints, demonstrates the effectiveness of the proposed speed planners. Simulation results reveal that the proposed method yields accurate tracking of desired speed and inter-vehicle distance, maintaining low fuel consumption even under high packet drop ratios, and demonstrating real-time implementation efficiency.

Wang, Zejiang [Univ. of Texas at Dallas, Richardso↗

Formal Definitions and Performance Comparison of Consistency Models for Parallel File Systems

The semantics of HPC storage systems are defined by the consistency models to which they abide. Storage consistency models have been less studied than their counterparts in memory systems, with the exception of the POSIX standard and its strict consistency model. The use of POSIX consistency imposes a performance penalty that becomes more significant as the scale of parallel file systems increases and the access time to storage devices, such as node-local solid storage devices, decreases. While some efforts have been made to adopt relaxed storage consistency models, these models are often defined informally and ambiguously as by-products of a particular implementation. Here in this work, we establish a connection between memory consistency models and storage consistency models and revisit the key design choices of storage consistency models from a high-level perspective. Further, we propose a formal and unified framework for defining storage consistency models and a layered implementation that can be used to easily evaluate their relative performance for different I/O workloads. Finally, we conduct a comprehensive performance comparison of two relaxed consistency models on a range of commonly seen parallel I/O workloads, such as checkpoint/restart of scientific applications and random reads of deep learning applications. We demonstrate that for certain I/O scenarios, a weaker consistency model can significantly improve the I/O performance. For instance, in small random reads that are typically found in deep learning applications, session consistency achieved a 5x improvement in I/O bandwidth compared to commit consistency, even at small scales.

97 MATHEMATICS AND COMPUTING↗

Object Proxy Patterns for Accelerating Distributed Applications

Workflow and serverless frameworks have empowered new approaches to distributed application design by abstracting compute resources. However, their typically limited or one-size-fits-all support for advanced data flow patterns leaves optimization to the application programmer—optimization that becomes more difficult as data become larger. The transparent object proxy, which provides wide-area references that can resolve to data regardless of location, has been demonstrated as an effective low-level building block in such situations. Here we propose three high-level proxy-based programming patterns—distributed futures, streaming, and ownership—that make the power of the proxy pattern usable for more complex and dynamic distributed program structures. We motivate these patterns via careful review of application requirements and describe implementations of each pattern. As a result, we evaluate our implementations through a suite of benchmarks and by applying them in three meaningful scientific applications, in which we demonstrate substantial improvements in runtime, throughput, and memory usage.

Distributed Computing↗

Impact of Variable Perpendicular Transport Coefficients in WEST Simulations Using SolEdge-HDG

Plasma–wall interaction is one of the key research topics on the way to controlled fusion. To study the best operational designs with reduced heat and particle fluxes onto tokamak plasma facing components (PFCs) comprehensive plasma simulations are required. A recent implementation of a hybridized discontinuous Galerkin scheme into a new version of SolEdge code has the advantage of using magnetic equilibrium-free mesh. This allows us to conduct pioneering 2-D transport simulations of a full discharge in the WEST tokamak. In this work, we implemented plasma transport coefficients as functions of coordinate in the poloidal plane and neutral diffusion as a function of neutral mean free path. Moreover, the perpendicular convection flux terms were added to the code. Using the new features, a few test cases were investigated. Finally, the influence of nonconstant transport coefficients on the simulated particle and heat fluxes onto the WEST tokamak PFCs are demonstrated.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Speed Variation Based Power Regulation Concept for Dynamic Wireless Charging

On-road wireless charging of electric vehicles (EVs) in-motion could potentially reduce range anxiety or battery size with wide-spread deployment. The planning and implementation of such systems are greatly complicated due to their susceptibility to load variation inherent to traffic flow. Here, this paper proposes a method for derisking the potential for traffic slowdowns by compensating for reduced vehicle speed and investigates how implementation may affect system performance. A load modeling case study is presented at 200kW for a mile of high-speed roadway employing speed-based power regulation with results indicating average power usage and maximum car hosting capability can be reduced by 20% and increased by 30% respectively. An 85kHz power electronics model is developed based on designs and prototypes for an 11kW, 190m airgap static system and a 200kW dynamic wireless track. The simulation is validated in the 11kW experimental prototype and modified for 200kW operation to compare with simulated performance. Sensitivity studies are performed in MATLAB/Simulink to evaluate how parameters influence system performance and confirm the capability to reduce output power and maintain efficiency at 11 and 200kW. The static 11kW experimental system operates at 93.6% efficiency and multiple options exist to reduce power while maintaining efficiency greater than 90%. The capability to dynamically modify power output from WPT coils, in an experimentally validated simulation, enables techniques to significantly mitigate load variability due to reductions in vehicle speed.

42 ENGINEERING↗

Uncertainty Visualization of Critical Points of 2D Scalar Fields for Parametric and Nonparametric Probabilistic Models

This paper presents a novel end-to-end framework for closed-form computation and visualization of critical point uncertainty in 2D uncertain scalar fields. Critical points are fundamental topological descriptors used in the visualization and analysis of scalar fields. The uncertainty inherent in data (e.g., observational and experimental data, approximations in simulations, and compression), however, creates uncertainty regarding critical point positions. Uncertainty in critical point positions, therefore, cannot be ignored, given their impact on downstream data analysis tasks. Here, in this work, we study uncertainty in critical points as a function of uncertainty in data modeled with probability distributions. Although Monte Carlo (MC) sampling techniques have been used in prior studies to quantify critical point uncertainty, they are often expensive and are infrequently used in production-quality visualization software. We, therefore, propose a new end-to-end framework to address these challenges that comprises a threefold contribution. First, we derive the critical point uncertainty in closed form, which is more accurate and efficient than the conventional MC sampling methods. Specifically, we provide the closed-form and semianalytical (a mix of closed-form and MC methods) solutions for parametric (e.g., uniform, Epanechnikov) and nonparametric models (e.g., histograms) with finite support. Second, we accelerate critical point probability computations using a parallel implementation with the VTK-m library, which is platform portable. Finally, we demonstrate the integration of our implementation with the ParaView software system to demonstrate near-real-time results for real datasets.

97 MATHEMATICS AND COMPUTING↗

Beyond the visible: Accounting for ultraviolet and far‐red radiation in vegetation productivity and surface energy budgets

Photosynthetically active radiation (PAR) is typically defined as light with a wavelength within 400–700 nm. However, ultra-violet (UV) radiation within 280–400 nm and far-red (FR) radiation within 700–750 nm can also excite photosystems, though not as efficiently as PAR. Vegetation and land surface models (LSMs) typically do not explicitly account for UV's contribution to energy budgets or photosynthesis, nor FR's contribution to photosynthesis. However, whether neglecting UV and FR has significant impacts remains unknown. Here, we explored how canopy radiative transfer (RT) and photosynthesis are impacted when explicitly implementing UV in the canopy RT model and accounting for UV and FR in the photosynthesis models within a next-generation LSM that can simulate hyperspectral canopy RT. We validated our improvements using photosynthesis measurements from plants under different light sources and intensities and surface reflection from an eddy-covariance tower. Our model simulations suggested that at the whole plant level, after accounting for UV and FR explicitly, chlorophyll content, leaf area index (LAI), clumping index, and solar radiation all impact the modeling of gross primary productivity (GPP). At the global scale, mean annual GPP within a grid would increase by up to 7.3% and the increase is proportional to LAI; globally integrated GPP increases by 4.6 PgC year −1 (3.8% of the GPP without accounting for UV + FR). Further, using PAR to proxy UV could overestimate surface albedo by more than 0.1, particularly in the boreal forests. Our results highlight the importance of improving UV and FR in canopy RT and photosynthesis modeling and the necessity to implement hyperspectral or multispectral canopy RT schemes in future vegetation and LSMs.

energy budget↗

Characterization of Flashback and Flame-Holding in a Jet-in-Crossflow Mixing Configuration With Methane–Hydrogen Fuel Blends

An approach that combines experimental and numerical analyses has been implemented to characterize the fundamentals of flashback events and flame-holding phenomena during high-hydrogen combustion in a jet-in-crossflow (JICF) configuration. Such flame dynamics are visualized experimentally using nanosecond (ns)-based hydroxyl planar laser-induced fluorescence (OH-PLIF) and chemiluminescence diagnostics techniques. The JICF burner has an optically accessible premixing tube allowing the optical diagnostics. The testing was conducted for varied premixer velocities (V) and equivalence ratio (ϕ) for 90–100% (H 2 , by mole) H 2 /CH 4 reactant mixtures at atmospheric temperature and pressure conditions. Two distinct flashback events were identified – conventional rich flashback and lean flashback, recorded while increasing ϕ and decreasing ϕ, respectively. The cause of lean flashback was attributed to lower momentum flux ratio which bends the jet sharply, closer toward the injection plane. The mean OH-PLIF images characterized the flame-holding behavior, where the flame was found to be stabilized on the leeward side only or on both windward and leeward sides as a lifted flame near the fuel port. A large eddy simulation (LES) with detailed chemistry combustion modeling approach was implemented along with an OH* submechanism, and it showed qualitative agreement with the integrated line-of-sight chemiluminescence results as well as the planar OH-PLIF measurements.

chemiluminescence diagnostic↗

Cooperative On-Ramp Merging with Time-Varying Vehicle-to-Vehicle Communication Delay Compensation via a Model-Free Approach

Cooperative merging strategies enabled by vehicle-to-vehicle (V2V) communication have shown promise in addressing congestion, fuel inefficiency, and collision risks. However, their performance can be severely degraded by time-varying and uncertain communication delays-an issue often overlooked in existing research, which primarily focuses on merging sequence determination and trajectory planning. Furthermore, practical considerations such as heterogeneous vehicle dynamics, varying road conditions, and real-time implementation complexities are frequently neglected. This paper presents a model-free, online planning framework for cooperative on-ramp merging of connected and automated vehicles (CAVs), explicitly accounting for time-varying V2V communication delays. Without relying on detailed vehicle dynamics, the proposed method introduces a data-driven delay compensation scheme. A co-simulation platform integrating high-fidelity vehicle dynamics, traffic simulation (SUMO), and V2V communication within MATLAB/Simulink is developed to evaluate the proposed method. Simulation results demonstrate that unaddressed V2V communication delays significantly impair merging performance. In contrast, the proposed framework enhances intervehicle distance tracking and maintains low CO2 emissions and fuel consumption, under communication delay across different communication frequencies. In conclusion, its lightweight design also facilitates real-time implementation, making it well-suited for deployment in practical CAV systems.

Accounting↗

Mask-side Hyper-NA EUV imaging on the SHARP microscope

Hyper-NA, the prospective successor to high-numerical aperture (NA) extreme ultraviolet lithography (EUVL) could be inserted soon after 2030. Hyper-NA poses a number of challenges, including reduced depth of focus, amplified mask three-dimensional effects, and increased mask-side angular range. A Hyper-NA capable extreme ultraviolet (EUV) mask-imaging tool can address these challenges and accelerate research and development toward Hyper-NA. The Sharp High-Numerical Aperture Actinic Reticle Review Project (SHARP) EUV mask microscope is supporting mask-side high-NA imaging since 2015. Implementing mask-side Hyper-NA imaging in 2024 enables research and development toward the corresponding nodes of EUVL. Hyper-NA zoneplates at 0.75 4x/8x NA with a 6.7-deg chief ray angle and 0.85 4x/8x NA with a 7.4-deg chief ray angle are added to the SHARP microscope. Imaging at mask-side Hyper-NA is demonstrated. Imaging of 5-nm half-pitch (wafer scale) horizontal lines and spaces is demonstrated using dipole illumination. Imaging of 5-nm half-pitch (wafer scale) vertical lines and spaces is demonstrated using frequency-doubled imaging of 40-nm hp (mask scale) lines and spaces. Normalized image log slope (NILS) and modulation of Hyper-NA image data match closely to simulations for horizontal lines and spaces. A reduction in NILS of 0.3 or less is observed for vertical lines and spaces in the two-beam imaging regime. Through-focus image data are discussed, comparing different dipole sources and mask-side NAs. Mask-side Hyper-NA photomask imaging has been implemented and demonstrated on the SHARP microscope and is now available to users of the instrument.

Benk, Markus↗

Explicit Quantum Circuits for Block Encodings of Certain Sparse Matrices

Many standard linear algebra problems can be solved on a quantum computer by using recently developed quantum linear algebra algorithms that make use of block encodings and quantum eigenvalue/singular value transformations. A block encoding embeds a properly scaled matrix of interest A in a larger unitary transformation U that can be decomposed into a product of simpler unitaries and implemented efficiently on a quantum computer. Although quantum algorithms can potentially achieve exponential speedup in solving linear algebra problems compared to the best classical algorithm, such a gain in efficiency ultimately hinges on our ability to construct an efficient quantum circuit for the block encoding of A, which is difficult in general, and not trivial even for well structured sparse matrices. Here, in this paper, we give a few examples on how efficient quantum circuits can be explicitly constructed for some well structured sparse matrices and discuss a few strategies used in these constructions. We also provide implementations of these quantum circuits in MATLAB.

97 MATHEMATICS AND COMPUTING↗

Robust Iterative Method for Symmetric Quantum Signal Processing in All Parameter Regimes

Here, this paper addresses the problem of solving nonlinear systems in the context of symmetric quantum signal processing (QSP), a powerful technique for implementing matrix functions on quantum computers. Symmetric QSP focuses on representing target polynomials as products of matrices in SU(2) that possess symmetry properties. We present a novel Newton’s method tailored for efficiently solving the nonlinear system involved in determining the phase factors within the symmetric QSP framework. Our method demonstrates rapid and robust convergence in all parameter regimes, including the challenging scenario with ill-conditioned Jacobian matrices, using standard double precision arithmetic operations. For instance, solving symmetric QSP for a highly oscillatory target function α cos(1000x) (polynomial degree ≈ 1433) takes 6 iterations to converge to machine precision when α = 0.9, and the number of iterations only increases to 18 iterations when α = 1 – 10 -9 with a highly ill-conditioned Jacobian matrix. Leveraging the matrix product state structure of symmetric QSP, the computation of the Jacobian matrix incurs a computational cost comparable to a single function evaluation. Moreover, we introduce a reformulation of symmetric QSP using real-number arithmetics, further enhancing the method’s efficiency. Extensive numerical tests validate the effectiveness and robustness of our approach, which has been implemented in the QSPPACK software package.

97 MATHEMATICS AND COMPUTING↗