Search NASA⌕ Search

SEARCH · Search NASA

Results for “Domain Overlapping”

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 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
NASA NTRS2001

Cloud Overlapping Detection Algorithm Using Solar and IR Wavelengths with GOES Data Over ARM/SGP Site

One of the most perplexing problems in satellite cloud remote sensing is the overlapping of cloud layers. Although most techniques assume a one layer cloud system in a given retrieval of cloud properties, many observations are affected by radiation from more than one cloud layer. As such, cloud overlap can cause errors in the retrieval of many properties including cloud height, optical depth, phase, and particle size. A variety of methods have been developed to identify overlapped clouds in a given satellite imager pixel. Baum et al used CO2 slicing and a spatial coherence method to demonstrate a possible analysis method for nighttime detection of multilayered clouds. Jin and Rossow also used a multispectral CO2 slicing technique for a global analysis of overlapped cloud amount. Lin et al. used a combination infrared (IR), visible (VIS), and microwave data to detect overlapped clouds over water. Recently, Baum and Spinhirne proposed a 1.6 and 11 micron bispectral threshold method. While all of these methods have made progress in solving this stubborn problem none have yet proven satisfactory for continuous and consistent monitoring of multilayer cloud systems. It is clear that detection of overlapping clouds from passive instruments such as satellite radiometers is in an immature stage of development and requires additional research. Overlapped cloud systems also affect the retrievals of cloud properties over the Atmospheric Radiation Measurement (ARM) domains and hence should be identified as accurately as possible. To reach this goal, it is necessary to determine which information can be exploited for detecting multilayered clouds from operational meteorological satellite data used by ARM. This paper examines the potential information available in spectral data available on the Geostationary Operational Environmental Satellite (GOES) imager and the National Oceanic Atmospheric Administration (NOAA) Advanced Very High Resolution Radiometer (AVHRR) used over the ARM Program's Southern Great Plains (SGP), and North Slope of Alaska (NSA) sites to study the capability of detecting overlapping clouds.

Kawamoto, K.↗
DOE OSTI2025

Quantum Computing Technology Roadmaps and Capability Assessment for Scientific Computing - An analysis of use cases from the NERSC workload

The National Energy Research Scientific Computing Center (NERSC), as the high-performance computing (HPC) facility for the Department of Energy’s Office of Science, recognizes the essential role of quantum computing in its future mission. In this report, we analyze the NERSC workload and identify materials science, quantum chemistry, and high-energy physics as the science domains and application areas that stand to benefit most from quantum computers. These domains jointly make up over 50% of the current NERSC production workload, which is illustrative of the impact quantum computing could have on NERSC’s mission going forward. We perform an extensive literature review and determine the quantum resources required to solve classically intractable problems within these science domains. This review also shows that the quantum resources required have consistently decreased over time due to algorithmic improvements and a deeper understanding of the problems. At the same time, public technology roadmaps from a collection of ten quantum computing companies predict a dramatic increase in capabilities over the next five to ten years. Our analysis reveals a significant overlap emerging in this time frame between the technological capabilities and the algorithmic requirements in these three scientific domains. We anticipate that the execution time of large-scale quantum workflows will become a major performance parameter and propose a simple metric, the Sustained Quantum System Performance (SQSP), to compare system-level performance and throughput for a heterogeneous workload.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1996

An Efficient Means of Adaptive Refinement Within Systems of Overset Grids

An efficient means of adaptive refinement within systems of overset grids is presented. Problem domains are segregated into near-body and off-body fields. Near-body fields are discretized via overlapping body-fitted grids that extend only a short distance from body surfaces. Off-body fields are discretized via systems of overlapping uniform Cartesian grids of varying levels of refinement. a novel off-body grid generation and management scheme provides the mechanism for carrying out adaptive refinement of off-body flow dynamics and solid body motion. The scheme allows for very efficient use of memory resources, and flow solvers and domain connectivity routines that can exploit the structure inherent to uniform Cartesian grids.

Meakin, Robert L.↗
DOE OSTI2026

Feature-Based PMU Event Classification under Variable PMU Participation and Overlapping Events

Danovo Energy Solution's presented its paper named: Feature-Based PMU Event Classification under Variable PMU Participation and Overlapping Events at the 2026 Georgia Tech Fault & Disturbance Analysis Conference. The full paper can be found at OSTI ID# 3169150 Paper Abstract—Phasor Measurement Units (PMUs) stream time synchronized, high-resolution measurements from the grid, enabling data-driven techniques for event detection and classification. Accurate event classification improves grid reliability and stability. Events can be detected by varying numbers of PMUs and exhibit different durations depending on the event type. This variability challenges standard classifiers that require uniform input sizes. Moreover, multiple events may coincide, which increases classification complexity. Standard classifiers assign each instance to the class with the highest predicted probability, whereas overlapping events may exhibit comparable probabilities across multiple classes. In this study, to handle data size variability, we extract a wide range of time–frequency domain features from all available PMUs for each event into a fixed-length vector, facilitating the application of standard machine learning classifiers, including Random Forest, XGBoost, LightGBM, Support Vector Machine, and Multilayer Perceptron. To account for overlapping events, a probabilistic post-processing step is applied. For a given data instance, if multiple predicted class probabilities exceed 30% and the differences between them are less than 10%, the event is assigned to multiple classes. Experiments using real-world PMU data demonstrate that the Random Forest and XGBoost models achieve the highest accuracy, while the proposed post-processing method yields perfect classification performance on external unseen test sets.

Nematirad, Reza [Danova Energy Solutions]↗
DOE OSTI2026

Feature-Based PMU Event Classification under Variable PMU Participation and Overlapping Events

This paper is the basis for a presentation help at the 2026 Georgia Tech Fault & Disturbance Analysis Conference, which can be found at OSTI # 3168287 Paper Abstract—Phasor Measurement Units (PMUs) stream time synchronized, high-resolution measurements from the grid, enabling data-driven techniques for event detection and classification. Accurate event classification improves grid reliability and stability. Events can be detected by varying numbers of PMUs and exhibit different durations depending on the event type. This variability challenges standard classifiers that require uniform input sizes. Moreover, multiple events may coincide, which increases classification complexity. Standard classifiers assign each instance to the class with the highest predicted probability, whereas overlapping events may exhibit comparable probabilities across multiple classes. In this study, to handle data size variability, we extract a wide range of time–frequency domain features from all available PMUs for each event into a fixed-length vector, facilitating the application of standard machine learning classifiers, including Random Forest, XGBoost, LightGBM, Support Vector Machine, and Multilayer Perceptron. To account for overlapping events, a probabilistic post-processing step is applied. For a given data instance, if multiple predicted class probabilities exceed 30% and the differences between them are less than 10%, the event is assigned to multiple classes. Experiments using real-world PMU data demonstrate that the Random Forest and XGBoost models achieve the highest accuracy, while the proposed post-processing method yields perfect classification performance on external unseen test sets.

Nematirad, Reza [Danovo Energy Solutions]↗
DOE OSTI2020

Two VHH Antibodies Neutralize Botulinum Neurotoxin E1 by Blocking Its Membrane Translocation in Host Cells

Botulinum neurotoxin serotype E (BoNT/E) is one of the major causes of human botulism, which is a life-threatening disease caused by flaccid paralysis of muscles. After receptor-mediated toxin internalization into motor neurons, the translocation domain (HN) of BoNT/E transforms into a protein channel upon vesicle acidification in endosomes and delivers its protease domain (LC) across membrane to enter the neuronal cytosol. It is believed that the rapid onset of BoNT/E intoxication compared to other BoNT serotypes is related to its swift internalization and translocation. We recently identified two neutralizing single-domain camelid antibodies (VHHs) against BoNT/E1 termed JLE-E5 and JLE-E9. Here, we report the crystal structures of these two VHHs bound to the LCHN domain of BoNT/E1. The structures reveal that these VHHs recognize two distinct epitopes that are partially overlapping with the putative transmembrane regions on HN, and therefore could physically block membrane association of BoNT/E1. This is confirmed by our in vitro studies, which show that these VHHs inhibit the structural change of BoNT/E1 at acidic pH and interfere with BoNT/E1 association with lipid vesicles. Therefore, these two VHHs neutralize BoNT/E1 by preventing the transmembrane delivery of LC. Furthermore, structure-based sequence analyses show that the 3-dimensional epitopes of these two VHHs are largely conserved across many BoNT/E subtypes, suggesting a broad-spectrum protection against the BoNT/E family. In summary, this work improves our understanding of the membrane translocation mechanism of BoNT/E and paves the way for developing VHHs as diagnostics or therapeutics for the treatment of BoNT/E intoxication.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2023

The molecular basis of the neutralization breadth of the RBD-specific antibody CoV11

SARS-CoV-2, the virus behind the COVID-19 pandemic, has changed over time to the extent that the current virus is substantially different from what originally led to the pandemic in 2019–2020. Viral variants have modified the severity and transmissibility of the disease and continue do so. How much of this change is due to viral fitness versus a response to immune pressure is hard to define. One class of antibodies that continues to afford some level of protection from emerging variants are those that closely overlap the binding site for angiotensin-converting enzyme 2 (ACE2) on the receptor binding domain (RBD). Some members of this class that were identified early in the course of the pandemic arose from the VH 3-53 germline gene (IGHV3-53*01) and had short heavy chain complementarity-determining region 3s (CDR H3s). Here, we describe the molecular basis of the SARS-CoV-2 RBD recognition by the anti-RBD monoclonal antibody CoV11 isolated early in the COVID-19 pandemic and show how its unique mode of binding the RBD determines its neutralization breadth. CoV11 utilizes a heavy chain VH 3-53 and a light chain VK 3-20 germline sequence to bind to the RBD. Two of CoV11’s four heavy chain changes from the VH 3-53 germline sequence, $Thr^{28}_{FWRH1}$ to Ile and $Ser^{31}_{CDRH1}$ to Arg, and some unique features in its CDR H3 increase its affinity to the RBD, while the four light chain changes from the VK 3-20 germline sequence sit outside of the RBD binding site. Antibodies of this type can retain significant affinity and neutralization potency against variants of concern (VOCs) that have diverged significantly from original virus lineage such as the prevalent omicron variant. We also discuss the mechanism by which VH 3-53 encoded antibodies recognize spike antigen and show how minimal changes to their sequence, their choice of light chain, and their mode of binding influence their affinity and impact their neutralization breadth.

60 APPLIED LIFE SCIENCES↗
NASA NTRS1996

Domain Decomposition Algorithms for First-Order System Least Squares Methods

Least squares methods based on first-order systems have been recently proposed and analyzed for second-order elliptic equations and systems. They produce symmetric and positive definite discrete systems by using standard finite element spaces, which are not required to satisfy the inf-sup condition. In this paper, several domain decomposition algorithms for these first-order least squares methods are studied. Some representative overlapping and substructuring algorithms are considered in their additive and multiplicative variants. The theoretical and numerical results obtained show that the classical convergence bounds (on the iteration operator) for standard Galerkin discretizations are also valid for least squares methods.

Pavarino, Luca F.↗
NASA NTRS1984

Multigrid techniques for the numerical solution of the diffusion equation

An accurate numerical solution of diffusion problems containing large local gradients can be obtained with a significant reduction in computational time by using a multigrid computational scheme. The spatial domain is covered with sets of uniform square grids of different sizes. The finer grid patterns overlap the coarse grid patterns. The finite-difference expressions for each grid pattern are solved independently by iterative techniques. Two interpolation methods were used to establish the values of the potential function on the fine grid boundaries with information obtained from the coarse grid solution. The accuracy and computational requirements for solving a test problem by a simple multigrid and a multilevel-multigrid method were compared. The multilevel-multigrid method combined with a Taylor series interpolation scheme was found to be best.

Phillips, R. E.↗
NASA NTRS1984

Iterative and function-continuation Fourier deconvolution methods for enhancing mass spectrometer resolution

Mass spectrometer data in the form of ion current versus mass-to-charge ratio often include overlapping mass peaks, especially in low- and medium-resolution instruments. Numerical deconvolution of such data effectively enhances the resolution by decreasing the overlap of mass peaks. In this paper two approaches to deconvolution are presented: a function-domain iterative technique and a Fourier transform method which uses transform-domain function-continuation. Both techniques include data smoothing to reduce the sensitivity of the deconvolution to noise. The efficacy of these methods is demonstrated through application to representative mass spectrometer data and the deconvolved results are discussed and compared to data obtained from a spectrometer with sufficient resolution to achieve separation of the mass peaks studied. A case for which the deconvolution is seriously affected by Gibbs oscillations is analyzed.

Ioup, J. W.↗
NASA NTRS1992

Parallel algorithms for geometric connected component labeling on a hypercube multiprocessor

Different algorithms for the geometric connected component labeling (GCCL) problem are defined each of which involves d stages of message passing, for a d-dimensional hypercube. The major idea is that in each stage a hypercube multiprocessor increases its knowledge of domain. The algorithms under consideration include the QUAD algorithm for small number of processors and the Overlap Quad algorithm for large number of processors, subject to the locality of the connected sets. These algorithms differ in their run time, memory requirements, and message complexity. They were implemented on an Intel iPSC2/D4/MX hypercube.

Belkhale, K. P.↗
NASA NTRS2003

Parallel Subconvolution Filtering Architectures

These architectures are based on methods of vector processing and the discrete-Fourier-transform/inverse-discrete- Fourier-transform (DFT-IDFT) overlap-and-save method, combined with time-block separation of digital filters into frequency-domain subfilters implemented by use of sub-convolutions. The parallel-processing method implemented in these architectures enables the use of relatively small DFT-IDFT pairs, while filter tap lengths are theoretically unlimited. The size of a DFT-IDFT pair is determined by the desired reduction in processing rate, rather than on the order of the filter that one seeks to implement. The emphasis in this report is on those aspects of the underlying theory and design rules that promote computational efficiency, parallel processing at reduced data rates, and simplification of the designs of very-large-scale integrated (VLSI) circuits needed to implement high-order filters and correlators.

Gray, Andrew A.↗
DOE OSTI2022

Molecular basis for antiviral activity of two pediatric neutralizing antibodies targeting SARS-CoV-2 Spike RBD

Neutralizing antibodies (NAbs) hold great promise for clinical interventions against SARS-CoV-2 variants of concern (VOCs). Understanding NAb epitopedependent antiviral mechanisms is crucial for developing vaccines and therapeutics against VOCs. Here we characterized two potent NAbs, EH3 and EH8, isolated from an unvaccinated pediatric patient with exceptional plasma neutralization activity. EH3 and EH8 cross-neutralize the early VOCsandmediatestrong Fc-dependent effector activity in vitro. Structural analyses of EH3 and EH8 in complex with the receptor-binding domain (RBD) revealed the molecular determinantsoftheepitope-drivenprotectionandVOCevasion.WhileEH3represents the prevalent IGHV3-53 NAb whose epitope substantially overlaps with the ACE2 binding site, EH8 recognizes a narrow epitope exposed in both RBD-up and RBD-down conformations. When tested in vivo, a single-dose prophylactic administration of EH3 fully protected stringent K18-hACE2 micefrom lethal challenge with Delta VOC. Our study demonstrates that protective NAbs responses converge in pediatric and adult SARS-CoV-2 patients.

60 APPLIED LIFE SCIENCES↗
NASA NTRS1993

Multi-grid domain decomposition approach for solution of Navier-Stokes equations in primitive variable form

The new multigrid (or adaptive) pseudospectral element method was carried out for the solution of incompressible flow in terms of primitive variable formulation. The desired features of the proposed method include the following: (1) the ability to treat complex geometry; (2) high resolution adapted in the interesting areas; (3) requires minimal working space; and (4) effective in a multiprocessing environment. The approach for flow problems, complex geometry or not, is to first divide the computational domain into a number of fine-grid and coarse-grid subdomains with the inter-overlapping area. Next, it is necessary to implement the Schwarz alternating procedure (SAP) to exchange the data among subdomains, where the coarse-grid correction is used to remove the high frequency error that occurs when the data interpolation from the fine-grid subdomain to the coarse-grid subdomain is conducted. The strategy behind the coarse-grid correction is to adopt the operator of the divergence of the velocity field, which intrinsically links the pressure equation, into this process. The solution of each subdomain can be efficiently solved by the direct (or iterative) eigenfunction expansion technique with the least storage requirement, i.e. O(N(exp 3)) in 3-D and O(N(exp 2)) in 2-D. Numerical results of both driven cavity and jet flow will be presented in the paper to account for the versatility of the proposed method.

Ku, Hwar-Ching↗
NASA NTRS2005

Single-Chip FPGA Azimuth Pre-Filter for SAR

A field-programmable gate array (FPGA) on a single lightweight, low-power integrated-circuit chip has been developed to implement an azimuth pre-filter (AzPF) for a synthetic-aperture radar (SAR) system. The AzPF is needed to enable more efficient use of data-transmission and data-processing resources: In broad terms, the AzPF reduces the volume of SAR data by effectively reducing the azimuth resolution, without loss of range resolution, during times when end users are willing to accept lower azimuth resolution as the price of rapid access to SAR imagery. The data-reduction factor is selectable at a decimation factor, M, of 2, 4, 8, 16, or 32 so that users can trade resolution against processing and transmission delays. In principle, azimuth filtering could be performed in the frequency domain by use of fast-Fourier-transform processors. However, in the AzPF, azimuth filtering is performed in the time domain by use of finite-impulse-response filters. The reason for choosing the time-domain approach over the frequency-domain approach is that the time-domain approach demands less memory and a lower memory-access rate. The AzPF operates on the raw digitized SAR data. The AzPF includes a digital in-phase/quadrature (I/Q) demodulator. In general, an I/Q demodulator effects a complex down-conversion of its input signal followed by low-pass filtering, which eliminates undesired sidebands. In the AzPF case, the I/Q demodulator takes offset video range echo data to the complex baseband domain, ensuring preservation of signal phase through the azimuth pre-filtering process. In general, in an SAR I/Q demodulator, the intermediate frequency (fI) is chosen to be a quarter of the range-sampling frequency and the pulse-repetition frequency (fPR) is chosen to be a multiple of fI. The AzPF also includes a polyphase spatial-domain pre-filter comprising four weighted integrate-and-dump filters with programmable decimation factors and overlapping phases. To prevent aliasing of signals, the bandwidth of the AzPF is made 80 percent of fPR/M. The choice of four as the number of overlapping phases is justified by prior research in which it was shown that a filter of length 4M can effect an acceptable transfer function. The figure depicts prototype hardware comprising the AzPF and ancillary electronic circuits. The hardware was found to satisfy performance requirements in real-time tests at a sampling rate of 100 MHz.

Gudim, Mimi↗
NASA NTRS1995

Investigation of dispersion-relation-preserving scheme and spectral analysis methods for acoustic waves

Important characteristics of the aeroacoustic wave propagation are mostly encoded in their dispersion relations. Hence, a computational aeroacoustic (CAA) algorithm, which reasonably preserves these relations, was investigated. It was derived using an optimization procedure to ensure, that the numerical derivatives preserved the wave number and angular frequency of the differential terms in the linearized, 2-D Euler equations. Then, simulations were performed to validate the scheme and a compatible set of discretized boundary conditions. The computational results were found to agree favorably with the exact solutions. The boundary conditions were transparent to the outgoing waves, except when the disturbance source was close to a boundary. The time-domain data generated by such CAA solutions were often intractable until their spectra was analyzed. Therefore, the relative merits of three different methods were included in the study. For simple, periodic waves, the periodogram method produced better estimates of the steep-sloped spectra than the Blackman-Tukey method. Also, for this problem, the Hanning window was more effective when used with the weighted-overlapped-segment-averaging and Blackman-Tukey methods gave better results than the periodogram method. Finally, it was demonstrated that the representation of time domain-data was significantly dependent on the particular spectral analysis method employed.

Vanel, Florence O.↗
DOE OSTI2024

Accelerating Multivariate Functional Approximation Computation with Domain Decomposition Techniques⋆

Modeling large datasets through Multivariate Functional Approximations (MFA) provide an elegant way to handle many visualization and scientific analysis workflows. The process necessitates scalable data partitioning methods to compute MFA representations efficiently without compromising the accuracy or continuity of the reconstructed solution. We propose a domain -decomposed method for computing the MFA with B -spline bases, which reduces the total work per task and uses a restricted Additive Schwarz (RAS) method to converge the control point data degrees -of -freedom along subdomain boundaries. We provide an in-depth analysis of the parallel approach with domain decomposition solvers, aiming to minimize local subdomain error residuals and recover high -order continuity at subdomain interfaces with appropriate choices of knot overlaps. The communication cost, determined by the overlap regions in the RAS implementation, is optimized to recover the numerical error profile of the single subdomain case. Our proposed method stands in contrast to previous methods, which typically only recover either C 0 or at best C 1 continuity for arbitrary B -spline degree expansions, or those that require post -processing to blend discontinuities in the reconstructed data. We demonstrate the effectiveness of our approach using analytical and real -world datasets in 1D, 2D, and 3D through both strong and weak scaling studies. The performance results indicate that the overall cost of computing the approximation is directly proportional to the underlying nearest -neighbor communication implementation, and is only weakly dependent on the overlap region size that determines the size of the messages. This finding underscores the efficiency and scalability of our proposed method, making it a promising solution for handling large datasets in scientific workflows.

additive Schwarz solvers↗
NASA NTRSDate not supplied

A Dynamic PCA and Machine Learning Tool for Automated Identification of Solar Wind Disturbances Impacting Earth’s Magnetosphere

Earth’s magnetosphere is continuously impacted by solar wind and interplanetary magnetic field (IMF) disturbances, such as shocks, discontinuities, magnetic clouds and more. Understanding how such disturbances propagate from the Sun and what is their impact on the different magnetospheric domains is key to understanding and forecasting energy transfer from the solar wind to Earth. The large number of overlapping solar wind and magnetospheric missions carrying magnetometers and the recent advances in communications and data storage technologies have enabled an unprecedented quantity of high-fidelity magnetic field data captured by in-situ spacecraft to be available at the click of a button. However, this massive quantity of available data can prove unwieldy for researchers, limiting the identification of interesting phenomena and disturbances to a relatively small percentage of the total dataset. Several techniques have been previously developed for automated identification of specific types of magnetic anomalies, but these methods are typically mission-specific and can be difficult to generalize. We present initial results for a generic method of automated anomaly detection in magnetic field measurements based on dimensionality reduction and unsupervised clustering via machine learning. The benefit of our technique is its high degree of generalizability and flexibility which make it a most useful data survey tool for a wide range of magnetic field datasets. This method can also be applied simultaneously to other observed time-series properties like plasma density, pressure, and velocity for more accurate event identification. Additionally, the application of this method to data captured by multiple spacecraft enables the simultaneous identification of disturbances and the determination of their propagation characteristics. Initial evaluation of this technique has been performed using data from Magnetospheric MultiScale (MMS) and THEMIS-ARTEMIS missions, providing a testbed scenario for the future Heliophysics Environmental and Radiation Measurement Experiment Suite (HERMES) platform instruments that will measure solar wind and IMF properties from lunar orbit onboard the Gateway station.

Miguel Martinez-Ledesma↗