Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “regularity”

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,171 records · Page 65

EQC: Ensembled Quantum Computing for Variational Quantum Algorithms

Variational quantum algorithms (VQA), which are comprised of a classical optimizer and a parameterized quantum circuit, emerges as one of the most promising approaches of harvesting quantum power in the noisy-intermediate-scale-quantum (NISQ) era. However, the deployment of VQAs on today's NISQ devices often faces considerable system noise and prohibitively slow training speeds. On the other hand, the expensive supporting sources and infrastructure make quantum computers extremely keen on high utilization. In this paper, we propose a novel way of thinking about a quantum backend: rather than relying on one physical device which tends to introduce platform-specific noise and bias, a quantum ensemble, which distributes quantum tasks across parallel devices, can serve as a virtualized quantum computer for offering reduced noise levels through an adaptive mixture and also provide significantly improved training speeds through parallelization. With this idea, we build a distributive VQA optimization framework called DVQA, serving as the first effort in adopting parallel quantum devices for cooperative VQA training. To further constraint noise and speed-up convergence, we design a model for individual NISQ devices concerning their properties and running conditions, and propose a weighting mechanism for regularizing the returned gradients. Extensive evaluations on 10 IBM-Q quantum devices using the VQE example show that the distributive VQA training framework can substantially boost the training speed by 10.5x on average (up to 86x and at least 5.2x) with improved training accuracy.

Stein, Samuel A.↗

RAPIDS: Reconciling Availability, Accuracy, and Performance in Managing Geo-Distributed Scientific Data

In modern science, big data plays an increasingly important role. Many scientific applications, such as running simulations on supercomputers or conducting experiments on advanced instruments, produce huge amount of data at unprecedented speed. Analyzing and understanding such big data is the key for scientists to make scientific breakthroughs. However, data might become unavailable for scientists to access when outages or maintenance of the storage system occur, which severely hinders scientific discovery. To improve the data availability, data duplication and erasure coding (EC) are often used. But as the scientific data gets larger, using these two methods can cause considerable storage and network overhead.In this paper, we propose RAPIDS, a hybrid approach that combines the multigrid-based error-bounded lossy compression with erasure coding, to significantly reduce the storage and network overhead required for maintaining high data availability. Our experiments show that RAPIDS reduces the storage overhead by up to 7.5x and network overhead by up to 3x to achieve the same level of availability compared to the regular EC method. We improve RAPIDS by building two models to optimize the fault tolerance configurations and data gathering strategy. We demonstrate that RAPIDS significantly improves performance when running on many CPU cores in parallel or on GPUs.

Wan, Lipeng↗

HQ-Sim: High-performance State Vector Simulation of Quantum Circuits on Heterogeneous HPC Systems

Quantum circuit simulations are applied in more and more circum- stances as the quantum computing community becomes broader. It helps researchers to evaluate quantum algorithms and relieve the burden of limited quantum computing resources. However, most of the state-of-the-art quantum simulators utilize either CPU or GPU to store and calculate the state vector, which results in resource starvation. Moreover, the maximum number of qubits supported by the simulator is bounded by the memory, since the memory utilization increases exponentially with the number of qubits. In this study, we leverage Heterogeneous computing to utilize both CPU and GPU to store and update state vectors. We also integrate lossy data compression to reduce memory requirements. Specifically, we develop a heterogeneous framework that has a dynamic scheduler to fully utilize the computing resources. We apply lossy compression to chunked state vector to make the maximum number of qubits higher than the regular simulators, the compression also benefits the data movement between CPU and GPU.

Zhang, Boyuan↗

Efficient QAOA Optimization using Directed Restarts and Graph Lookup

Variational Quantum Algorithms (VQA) aim to enhance the capabilities of Noisy Intermediate-Scale Quantum (NISQ) devices. These algorithms utilize parameterized circuits and classical optimizers to iteratively execute circuits with varying parameters. However, VQA faces computational overheads due to repeated iterations and random restarts. Prior work suggests using basic sub-graphs to transfer parameters for the input graph, reducing optimizer overheads but limiting applicability to structured regular graphs. In real-world applications, random irregular graphs are common, and existing methods are not scalable or practical for such graphs. This paper presents a framework that aims to improve random irregular graphs in VQA. The framework uses graph similarity and important features like total edge counts, average edge counts, and variance. It follows an iterative process to choose basis sub-graphs from a small database and adjust parameters accordingly. Classical optimizers then utilize these parameters to determine when to restart and perform gradient descent. This approach increases the chances of reaching global maximum points.

Wang, Meng↗

Improved Water Sound Synthesis using Coupled Bubbles

We introduce a practical framework for synthesizing bubble-based water sounds that captures the rich inter-bubble coupling effects responsible for low-frequency acoustic emissions from bubble clouds. We propose coupled-bubble oscillator models with regularized singularities, and techniques to reduce the computational cost of time stepping with dense, time-varying mass matrices. Airborne acoustic emissions are estimated using finite-difference time-domain (FDTD) methods. We propose a simple, analytical surface-acceleration model, and a sample-and-hold GPU wavesolver that is simple and faster than prior CPU wavesolvers. Sound synthesis results are demonstrated using bubbly flows from incompressible, two-phase simulations, as well as procedurally generated examples using single-phase FLIP fluid animations. Our results demonstrate sound simulations with hundreds of thousands of bubbles, and perceptually significant frequency transformations with fuller low-frequency content.

Computer Science↗

Understanding GPU Memory Corruption at Extreme Scale: The Summit Case Study

GPU memory corruption and in particular double-bit errors (DBEs) remain one of the least understood aspects of HPC system reliability. Albeit rare, their occurrences always lead to job termination and can potentially cost thousands of node-hours, either from wasted computations or as the overhead from regular checkpointing needed to minimize the losses. As supercomputers and their components simultaneously grow in scale, density, failure rates, and environmental footprint, the efficiency of HPC operations becomes both an imperative and a challenge. We examine DBEs using system telemetry data and logs collected from the Summit supercomputer, equipped with 27,648 Tesla V100 GPUs with 2nd-generation high-bandwidth memory (HBM2). Using exploratory data analysis and statistical learning, we extract several insights about memory reliability in such GPUs. We find that GPUs with prior DBE occurrences are prone to experience them again due to otherwise harmless factors, correlate this phenomenon with GPU placement, and suggest manufacturing variability as a factor. On the general population of GPUs, we link DBEs to short- and long-term high power consumption modes while finding no significant correlation with higher temperatures. We also show that the workload type can be a factor in memory’s propensity to corruption.

Oles, Vlad↗

Algorithm 1049: The Delaunay Density Diagnostic

Accurate approximation of a real-valued function depends on two aspects of the available data: the density of inputs within the domain of interest and the variation of the outputs over that domain. There are few methods for assessing whether the density of inputs is sufficient to identify the relevant variations in outputs—i.e., the “geometric scale” of the function—despite the fact that sampling density is closely tied to the success or failure of an approximation method. In this article, we introduce a general purpose, computational approach to detecting the geometric scale of real-valued functions over a fixed domain using a deterministic interpolation technique from computational geometry. The algorithm is intended to work on scalar data in moderate dimensions (2–10). Our algorithm is based on the observation that a sequence of piecewise linear interpolants will converge to a continuous function at a quadratic rate (in L 2 norm) if and only if the data are sampled densely enough to distinguish the feature from noise (assuming sufficiently regular sampling). We present numerical experiments demonstrating how our method can identify feature scale, estimate uncertainty in feature scale, and assess the sampling density for fixed (i.e., static) datasets of input–output pairs. Finally, we include analytical results in support of our numerical findings and have released lightweight code that can be adapted for use in a variety of data science settings.

97 MATHEMATICS AND COMPUTING↗

ORBIT-2: Scaling Exascale Vision Foundation Models for Weather and Climate Downscaling

Sparse observations and coarse-resolution climate models limit effective regional decision-making, underscoring the need for robust downscaling. However, existing AI methods struggle with generalization across variables and geographies and are constrained by the quadratic complexity of Vision Transformer (ViT) self-attention. We introduce ORBIT-2, a scalable foundation model for global, hyper-resolution climate downscaling. ORBIT-2 incorporates two key innovations: (1) Residual Slim ViT (Reslim), a lightweight architecture with residual learning and Bayesian regularization for efficient, robust prediction; and (2) TILES, a tile-wise sequence scaling algorithm that reduces self-attention complexity from quadratic to linear, enabling long-sequence processing and massive parallelism. ORBIT-2 scales to 10 billion parameters across 65,536 GPUs, achieving up to 4.1 ExaFLOPS sustained throughput and 74–98% strong scaling efficiency. It supports downscaling to 0.9 km global resolution and processes sequences up to 4.2 billion tokens. On 7 km resolution benchmarks, ORBIT-2 achieves high accuracy with R2 scores in range of 0.98–0.99 against observation data.

Wang, Xiao [ORNL] (ORCID:0000000165451943)↗

ObstacleSense: Low-Power Neuromorphic Vision for Corridor Obstacle Awareness in Low-Level ADAS

The automotive industry’s pursuit of Level 5 autonomy is constrained by substantial perception-compute power requirements, often reaching 1, 000 + watts in full autonomy stacks. Reducing this energy burden requires rethinking perception not only at the high-end autonomy level, but also at the foundational Advanced Driver Assistance Systems (ADAS) level where low-power, safety-critical sensing can have broad impact. Neuromorphic vision provides a promising starting point: HD Dynamic Vision Sensors (DVS) can operate below 100 mW at the sensor level by reporting only asynchronous brightness changes. However, low-power sensing alone is insufficient if downstream perception reintroduces dense, energy-intensive computation. In particular, many event-driven object-detection pipelines still rely on CNN backbones, while purely spiking alternatives often trade away accuracy or ignore deployment constraints. We introduce ObstacleSense, a highly compact, CNN-free hybrid ANN–SNN framework for Level 0–1 forward-corridor obstacle awareness. Instead of performing full-scene object detection with a convolutional feature backbone, ObstacleSense targets the safety-critical question of whether the ego corridor is occupied and how far the nearest obstacle is. The architecture combines polarity-conditioned event encoding, lightweight temporal spiking dynamics, axial spatial mixing, and coarse-to-fine range estimation within a regular fixed-grid compute pattern. This design avoids the dense CNN backbone commonly used in event-based detection while maintaining a small state footprint suitable for eventual small-FPGA deployment. Before hardware mapping, we evaluate the software implementation using a model-side power proxy derived from MACs, weight and activation traffic, and spiking state updates under shared FP16 assumptions. On simulated CARLA event corpora, the deployment-oriented model achieves 0.9464 objectness F1, 0.9978 grid-level mAP, and 0.8987 m distance Mean Absolute Error at an estimated 1.92 mW proxy cost, while maintaining performance on unseen generalization test sequences.

Johnson-Scott, Zac [ORNL]↗

Understanding Evolution of Lithium Trivanadate Cathodes During Cycling via Reformulated Physics-Based Models and Experiments

Degradation of lithium trivanadate ( Li x V 3 O 8 ) cathodes has been widely reported in the literature, but studies have offered little insight towards developing a detailed understanding of the evolution of the active material, and have been inconclusive as to the root cause of degradation. Here, we refit a validated physics-based model to discharge curves over the course of cycling at C/5, and use the evolution of the model parameters to track evolution of the cathode. A regularization penalty for adjusting model parameters from the validated model is introduced as a framework to identify which model parameters can explain a significant portion of the observed change in the voltage profile over the course of cycling. SEM reveals that lithium trivandate particles fracture upon cycling at C/5, consistent with the results of the parameter estimation, deactivation of lithium trivanadate and faster diffusion of lithium within the active particles. The physics-based model is then used to design modified cycling protocols which identify the phase transformation during discharge of lithium trivanadate as the driver of the particle fracture and capacity fade.

25 ENERGY STORAGE↗

Electrolyte Takeover Strategy for Performance Recovery in Polysulfide-Permanganate Flow Batteries

The abundance of active material precursors for a polysulfide-permanganate flow battery makes it a compelling chemistry for large-scale, and potentially long-duration (>10 h), grid electricity storage. Precipitation, arising from either reactant crossover or electrolyte side reactions, decrease cell efficiencies during charge/discharge cycling. Regardless of the abundance and low cost of active materials, a system without high cyclability cannot meet grid electricity storage economic targets for applications that cycle regularly. Precipitated species can be removed, and reactor efficiency performance restored, by using an electrolyte takeover process, or ETP. Two ETP methods are investigated. One ETP uses the negative electrolyte, an alkaline polysulfide (pS) solution, as takeover solution, and another uses dilute acidic peroxide (DAP) as the takeover solution. Both ETPs maintain functional cell operation within an acceptable performance range over >1000 h and >200 cycles, a duration over which cells that do not undergo ETPs clog and fail. The DAP ETP proves especially effective and limits irrecoverable voltage efficiency fade below 0.02%/cycle. These ETPs, either individually, or in combination, can enable the requisite cyclability for practical polysulfide-permanganate flow battery systems.

25 ENERGY STORAGE↗

Metabolomic and transcriptomic remodeling of bone marrow myeloid cells in response to maternal obesity

Maternal obesity puts the offspring at high risk of developing obesity and cardiometabolic diseases in adulthood. Here, we utilized a mouse model of maternal high-fat diet (HFD)-induced obesity that recapitulates metabolic perturbations seen in humans. We show increased adiposity in the offspring of HFD-fed mothers (Off-HFD) when compared with the offspring of regular diet-fed mothers (Off-RD). We have previously reported significant immune perturbations in the bone marrow of newly weaned Off-HFD. Here, we hypothesized that lipid metabolism is altered in the bone marrow of Off-HFD versus Off-RD. To test this hypothesis, we investigated the lipidomic profile of bone marrow cells collected from 3-week-old Off-RD and Off-HFD. Diacylglycerols (DAGs), triacylglycerols (TAGs), sphingolipids, and phospholipids were remarkably different between the groups, independent of fetal sex. Levels of cholesteryl esters were significantly decreased in Off-HFD, suggesting reduced delivery of cholesterol. These were accompanied by age-dependent progression of mitochondrial dysfunction in bone marrow cells. We subsequently isolated CD11b+ myeloid cells from 3-wk-old mice and conducted metabolomic, lipidomic, and transcriptomic analyses. The lipidomic profiles of myeloid cells were similar to those of bone marrow cells and included increases in DAGs and decreased TAGs. Transcriptomics revealed altered expression of genes related to immune pathways, including macrophage alternative activation, B-cell receptors, and transforming growth factor-β signaling. All told, this study revealed lipidomic, metabolomic, and gene expression abnormalities in bone marrow cells broadly, and in bone marrow myeloid cells particularly, in the newly weaned offspring of mothers with obesity, which might at least partially explain the progression of metabolic and cardiovascular diseases in their adulthood.

RNA sequencing↗

TiO 2 Nanocoatings with Controllable Crystal Type and Nanoscale Topography on Zirconia Implants to Accelerate Bone Formation

In dentistry, zirconia implants have emerged as a promising alternative for replacing missing teeth due to their superior aesthetic performance and chemical stability. To improve the osseointegration of zirconia implants, modifying their surface with hierarchical micro/nanotopography and bioactive chemical composition are two effective ways. In this work, a microscale topography was prepared on a zirconia surface using hydrofluoric acid etching, and then a 50 nm TiO 2 nanocoating was deposited via atomic layer deposition (ALD). Subsequently, an annealing treatment was used to transform the TiO 2 from amorphous to anatase and simultaneously generate nanoscale topography. Various investigations into the coating surface morphology, topography, wettability, and chemical composition were carried out using scanning electron microscopy, white light interferometry, contact‐angle measurement, X‐ray diffraction, and X‐ray photoelectron spectroscopy. In addition, in vitro cytocompatibility and osteogenic potential performance of the coatings were evaluated by human bone marrow mesenchymal stem cells (hBMSCs), and in vivo osseointegration performance was assessed in a rat femoral condyle model. Moreover, the possible mechanism was also investigated. The deposition of TiO 2 film with/without annealing treatment did not alter the microscale roughness of the zirconia surface, whereas the nanotopography changed significantly after annealing. The in vitro studies revealed that the anatase TiO 2 coating with regular wavelike nanostructure could promote the adhesion and proliferation of osteoblasts and further improve the osteogenic potential in vitro and osseointegration in vivo. These positive effects may be caused by nanoscale topography via the canonical Wnt/ β ‐catenin pathway. The results suggest that using ALD in combination with annealing treatment to fabricate a nanotopographic TiO 2 coating is a promising way to improve the osteogenic properties of zirconia implants.

Li, Nan (ORCID:0000000255156737)↗

Geometric concepts for stellarator permanent magnet arrays

The development of stellarators that use permanent magnet arrays to shape their confining magnetic fields has been a topic of recent interest, but the requirements for how such magnets must be shaped, manufactured, and assembled remain to be determined. To address these open questions, we have performed a study of geometric concepts for magnet arrays with the aid of the newly developed MAGPIE code. A proposed experiment similar to the National Compact Stellarator Experiment (NCSX) is used as a test case. Two classes of magnet geometry are explored: curved bricks that conform to a regular grid in cylindrical coordinates, and hexahedra that conform to the toroidal plasma geometry. In addition, we test constraints on the magnet polarization. While magnet configurations constrained to be polarized normally to a toroidal surface around the plasma are unable to meet the required magnetic field parameters when subject to physical limitations on the strength of present-day magnets, configurations with unconstrained polarizations are shown to satisfy the physics requirements for a targeted plasma.

stellarator, permanent magnet, optimization↗

miniWeather

The code “miniWeather” solves the 2-D Euler equations with a Finite-Volume method on a regular Cartesian grid with Runge-Kutta time stepping, 4th-order hypervisocisty, and 4th-order spatial accuracy. The code is primarily a parallel programming training mini application in Fortran, C, and C++ with MPI, OpenMP, OpenMP offload, OpenACC, and C++ portability approaches. It can also serve as a mini application for acceptance testing for new machines and compilers for both functionality and performance.

Norman, MatthewR↗

Consistent Space Runtime (CSPACER) v1.0

This software provides a runtime for communication-bound applications, especially with irregular communication patterns. The target programming abstraction for the runtime is the space consistency model, which defines consistency guarantees at the granularity of memory spaces. This model has relaxed consistency semantics that enables a wide range of runtime optimizations. The runtime leverages threading to accelerate communication primitives, especially collective operations. It also allows efficient pipelining of communication operations and enable constructing a consistent state of multiple unordered communication activities targeting a memory space. The runtime uses a reduced API design that decomposes complex communication primitives in traditional general-purpose runtime into a sequence of simpler steps. To improve the productivity of using this runtime, we provide communication patterns commonly used for regular scientific computing applications and irregular data analytics. These communication patterns offer skeletons for the integration with application computation to allow efficient overlap.

Ibrahim, Khaled↗

AADL: Anderson Accelerated Deep Learning

We propose a stable, distributed approach to perform AA that accelerates the convergence rate of stochastic first-order optimizers to train neural networks. Differently from previous works, we do not alter neither the scheme to perform AA nor the loss function minimized during the training. To improve robustness against stagnation, we customize general guidelines that suggest to relax the frequency of AA corrections by performing AA only at the end of an entire training epoch. To improve robustness of AA against the stochastic oscillations of first-order optimizers, we average the gradients computed on consecutive stochastic optimization updates. The improved regularity of the converging sequence and the reduced amplitude of stochastic oscillations across consecutive optimization steps allows AA to efficiently extrapolate an improved converging sequence, thereby overcoming limitations of existing approaches to perform AA on stochastic optimization.

Lupo Pasini, Massimiliano [Oak Ridge National Lab.↗

RADA

The code for regularized adversarial domain adaption is provided here. The RADA methodology is developed for correcting climate model biases using an adversarial learning strategy. The code here covers the data processing, the algorithm, the baseline models, and the evaluation.

Anderson, GemmaJ.↗