Search NASA⌕ Search

SEARCH · Search NASA

Results for “sampling algorithm”

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 163 records · Page 9
All sourcesNASA NTRSDOE OSTI
NASA NTRS1989

An experimental SMI adaptive antenna array for weak interfering signals

A modified sample matrix inversion (SMI) algorithm designed to increase the suppression of weak interference is implemented on an existing experimental array system. The algorithm itself is fully described as are a number of issues concerning its implementation and evaluation, such as sample scaling, snapshot formation, weight normalization, power calculation, and system calibration. Several experiments show that the steady state performance (i.e., many snapshots are used to calculate the array weights) of the experimental system compares favorably with its theoretical performance. It is demonstrated that standard SMI does not yield adequate suppression of weak interference. Modified SMI is then used to experimentally increase this suppression by as much as 13dB.

Dilsavor, R. L.↗
DOE OSTI2026

Reducing Randomized Quantum Algorithm Cost [Slides]

We derive the optimal sampling strategy for minimizing total resource cost in randomized quantum algorithms. Our framework is completely general, allowing for resources as diverse as gate counts circuit depth, runtime, or even dissipated energy.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1988

Nonuniform Sampling Of Radiation From Antennas

Far-field patterns reconstructed. Nonuniform-sampling technique uses interpolation algorithm to obtain far-field radiation pattern of antenna at any point u, v based on measurements at few sampling points. Applicable to any components of electric field "E" at measurement locations in spherical coordinate system centered at antenna.

Rahmat-Samii, Y.↗
NASA NTRS1991

Intelligent perturbation algorithms for space scheduling optimization

Intelligent perturbation algorithms for space scheduling optimization are presented in the form of the viewgraphs. The following subject areas are covered: optimization of planning, scheduling, and manifesting; searching a discrete configuration space; heuristic algorithms used for optimization; use of heuristic methods on a sample scheduling problem; intelligent perturbation algorithms are iterative refinement techniques; properties of a good iterative search operator; dispatching examples of intelligent perturbation algorithm and perturbation operator attributes; scheduling implementations using intelligent perturbation algorithms; major advances in scheduling capabilities; the prototype ISF (industrial Space Facility) experiment scheduler; optimized schedule (max revenue); multi-variable optimization; Space Station design reference mission scheduling; ISF-TDRSS command scheduling demonstration; and example task - communications check.

Kurtzman, Clifford R.↗
DOE OSTI2025

Accelerating multilevel Markov Chain Monte Carlo using machine learning models

Here, this work presents an efficient approach for accelerating multilevel Markov Chain Monte Carlo (MCMC) sampling for large-scale problems using low-fidelity machine learning models. While conventional techniques for large-scale Bayesian inference often substitute computationally expensive high-fidelity models with machine learning models, thereby introducing approximation errors, our approach offers a computationally efficient alternative by augmenting high-fidelity models with low-fidelity ones within a hierarchical framework. The multilevel approach utilizes the low-fidelity machine learning model (MLM) for inexpensive evaluation of proposed samples thereby improving the acceptance of samples by the high-fidelity model. The hierarchy in our multilevel algorithm is derived from geometric multigrid hierarchy. We utilize an MLM to accelerate the coarse level sampling. Training machine learning model for the coarsest level significantly reduces the computational cost associated with generating training data and training the model. We present an MCMC algorithm to accelerate the coarsest level sampling using MLM and account for the approximation error introduced. We provide theoretical proofs of detailed balance and demonstrate that our multilevel approach constitutes a consistent MCMC algorithm. Additionally, we derive the expression for cost reduction due to machine learning model to facilitate cost analysis of the hierarchical sampling algorithm. Our technique is demonstrated on a standard benchmark inference problem in groundwater flow, where we estimate the probability density of a quantity of interest using a four-level MCMC algorithm. Our proposed algorithm accelerates multilevel sampling by a factor of two while achieving similar accuracy compared to sampling using the standard multilevel algorithm.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2019

Comparison of high-resolution airborne soil moisture retrievals to SMAP soil moisture during the SMAP validation experiment 2016 (SMAPVEX16)

The NASA's Soil Moisture Active Passive (SMAP) mission conducted a field experiment with its partners over two 40-km agricultural domains in Iowa and Manitoba in the summer of 2016 to address concerns observed in SMAP soil moisture (SM) retrievals over agricultural areas. The experiment featured airborne Passive Active L-band System (PALS) flights over each domain with intensive ground measurements and dense networks of SM monitoring stations. With two intensive observation periods separated in time (May 28–June 20 and July 14–August 16), the flights captured both early-season/low vegetation and later-season/high-vegetation conditions. The comparison of the PALS brightness temperature (TB) measurements to the SMAP TB observed over the sites resulted in root mean square difference (RMSD) of 2.8 K and 4.0 K for vertical and horizontal polarizations, respectively. The subsequent SM analysis rescaled the PALS TB with the SMAP TB to allow equitable comparisons between the SM retrievals from the two instruments. The PALS SM retrieval algorithm used the SM sampled by the ground teams during the overpass days for tuning, and was parameterized by a high-resolution vegetation water content product calibrated using vegetation samples collected during the experiment. The tuning process was not able to find a satisfactory result with a temporally constant set of parameters in the single channel algorithm for the two intensive observation periods of the experiment. This result indicated that the rapid change in the vegetation structure during the growth stages and likely variation in the surface roughness conditions were not compatible with rigid parameterization over the entire period. However, using seasonally variable parameters we found that it was possible to retrieve soil moisture with satisfactory accuracy. Comparative analysis with the SMAP SM product included aggregation of the PALS SM to the SMAP pixel-scale. The RMSD between the PALS SM and the aggregated manual field samples was <0.04 m3/m3 with Pearson correlation >0.85 for both sites. The comparison between different in situ sources indicated that the soil moisture network measurements were not the source of the large biases observed for SMAP over the sites reported in earlier studies. Therefore, the results suggested the rapidly growing vegetation and the early-season surface condition changes not captured by the SMAP algorithm caused the SMAP retrieval errors. In addition, the significant deviations of the vegetation water content used by the SMAP product from the calibrated vegetation water content obtained during the experiment compounds the problem.

Andreas Colliander↗
NASA NTRS1994

Operations for Learning with Graphical Models

This paper is a multidisciplinary review of empirical, statistical learning from a graphical model perspective. Well-known examples of graphical models include Bayesian net- works, directed graphs representing a Markov chain, and undirected networks representing a Markov field. These graphical models are extended to model data analysis and empirical learning using the notation of plates. Graphical operations for simplifying and manipulating a problem are provided including decomposition, differentiation, and the manipulation of probability models from the exponential family. These operations adapt existing techniques from statistics and automatic differentiation to graphs. Two standard algorithm schemes for learning are reviewed in a graphical framework: Gibbs sampling and the expectation maximization algorithm. Some algorithms are developed in this graphical framework including a generalized version of linear regression, techniques for feed-forward networks, and learning Gaussian and discrete Bayesian networks from data. The paper concludes by sketching some implications for data analysis and summarizing some popular algorithms that fall within the framework presented. The main original contributions here are the decomposition techniques and the demonstration that graphical models provide a framework for understanding and developing complex learning algorithms.

Buntine, Wray L.↗
NASA NTRS2001

Electronic Thermometer Readings

NASA Stennis' adaptive predictive algorithm for electronic thermometers uses sample readings during the initial rise in temperature and applies an algorithm that accurately and rapidly predicts the steady state temperature. The final steady state temperature of an object can be calculated based on the second-order logarithm of the temperature signals acquired by the sensor and predetermined variables from the sensor characteristics. These variables are calculated during tests of the sensor. Once the variables are determined, relatively little data acquisition and data processing time by the algorithm is required to provide a near-accurate approximation of the final temperature. This reduces the delay in the steady state response time of a temperature sensor. This advanced algorithm can be implemented in existing software or hardware with an erasable programmable read-only memory (EPROM). The capability for easy integration eliminates the expense of developing a whole new system that offers the benefits provided by NASA Stennis' technology.

Source record↗
NASA NTRS2009

Developing Lightning Prediction Tools for the CCAFS Dual-Polarimetric Radar

NASA Marshall Space Flight Center and the University of Alabama Huntsville are collaborating with the 45th Weather Squadron (45WS) to develop improved lightning prediction capabilities for the new C-band dual-polarimetric weather radar being acquired for use by 45WS and launch weather forecasters at Cape Canaveral Air Force Station (CCAFS). In particular, these algorithms will focus on lightning onset, cessation and combined lightning-radar applications for convective winds assessment. Research using radar reflectivity (Z) data for prediction of lightning onset has been extensively discussed in the literature and subsequently applied by launch weather forecasters as it pertains to lightning nowcasting. Currently the forecasters apply a relatively straight forward but effective temperature-Z threshold algorithm for assessing the likelihood of lightning onset in a given storm. In addition, a layered VIL above the freezing level product is used as automated guidance for the onset of lightning. Only limited research and field work has been conducted on lightning cessation using Z and vertically-integrated Z for determining cessation. Though not used operationally vertically-integrated Z (basis for VIL) has recently shown promise as a tool for use in nowcasting lightning cessation. The work discussed herein leverages and expands upon these and similar reflectivity-threshold approaches via the application/addition of over two decades of polarimetric radar research focused on distinct multi-parameter radar signatures of ice/mixed-phase initiation and ice-crystal orientation in highly electrified convective clouds. Specifically, our approach is based on numerous previous studies that have observed repeatable patterns in the behavior of the vertical hydrometeor column as it relates to the temporal evolution of differential reflectivity and depolarization (manifested in either LDR or p(sub hv)), development of in-situ mixed and ice phase microphysics, electric fields, and ensuing lightning in the sub-tropical/tropical convection typical of the southeastern U.S., Maritime Continent, and southwestern Amazon. The polarimetric signatures detected in this setting provide a basis for automated 3-D detection of hydrometeor types in fuzzy logic hydrometeor identification algorithms (HID). Our working hypothesis is that improvement in lightning onset warning lead time and specificity for a given storm, relative to application of a Z-threshold algorithm, should arise as a consequence of the ability of dual-polarimetric radar to unambiguously detect and identify (through HID algorithms) the updraft elevation of rain-water cores above the freezing level and subsequent onset of drop freezing, riming, and robust mixed phase processes leading to significant charge separation and lightning. This type of algorithm, though dependent on the quality of the polarimetric data should be less susceptible to variable Z-calibration that can impact a given Z-threshold approach. To facilitate development of the algorithm while the 45WS dual-pol radar is in its current test stages and to evaluate the impact of polarimetric data quality (e.g., modified scan parameters and sampling) on the ensuing algorithms, we are using the ARMOR C-band dual-pol radar in Huntsville combined with N. Alabama LMA data and ARMOR HID algorithms [NCAR algorithm modified for application at C-band] in a testbed fashion. For lightning cessation we are revisiting the application of differential propagation phase variables for the monitoring of ice crystal alignment driven by in-cloud electric fields combined with metrics of ice water path (i.e., vertically integrated reflectivity). Importantly it should be noted that this approach is still very much a research topic and as such, we will explore operational applications that involve radar frequencies other than C-Band by using the UAH MAX X-band dual-pol radar in slow staring modes.

Petersen, W. A.↗
DOE OSTI2026

Fokker-Planck Equation Governing the Distribution of Walkers in Auxiliary-Field Quantum Monte Carlo

Auxiliary-field quantum Monte Carlo (AFQMC) is typically formulated as an open-ended random walk in an overcomplete space of Slater determinants, implemented through a Langevin equation. However, the explicit form of the underlying Fokker-Planck equation governing the walker population distribution has remained unknown. Here, in this Letter, we derive the Fokker-Planck equation for AFQMC and propose a novel numerical scheme to solve it. The solution of the Fokker-Planck equation reveals the wave function actually sampled by the AFQMC algorithm. Interestingly, we find that even when the exact ground state is used as a guiding wave function in constrained path AFQMC, contrary to the common assumption, the wave function sampled by AFQMC is not exact. Beyond clarifying several fundamental aspects of AFQMC, the availability of a Fokker-Planck equation formulation opens new avenues for systematically improving its accuracy, which we outline in this Letter.

Monte Carlo methods↗
NASA NTRS1981

Determination of surface stress by Seasat-SASS - A case study with JASIN data

The values of sea surface stress determined with the dissipation method and those determined with a surface-layer model from observations on F.S. Meteor during the Joint Air-Sea Interaction (JASIN) Experiment are compared with the backscatter coefficients measured by the scatterometer SASS on the satellite Seasat. This study demonstrates that SASS can be used to determine surface stress directly as well as wind speed. The quality of the surface observations used in the calibration of the retrieval algorithms, however, is important. This sample of measurements disagrees with the predictions by the existing wind retrieval algorithm under non-neutral conditions and the discrepancies depend on atmospheric stability.

Liu, W. T.↗
DOE OSTI2026

Automation of Laser Plasma Focused Ion Beam Microscopy for Next-Gen Energy Materials

Automation can revolutionize the use of ultrafast laser ablation and plasma-focused ion beam (PFIB) techniques for high-throughput, reproducible cross-sectioning and various sample preparation in materials characterization. As these methods become essential for analyzing complex energy materials and next-generation devices, efficient, standardized workflows are needed to minimize variability and enhance precision. This work highlights our advancements in developing automated processes for sample preparation that integrates machine learning, workflow optimization, and large-scale data acquisition to improve efficiency and scalability in applications such as electrolyzers, photovoltaic cells, and microelectronics. To streamline cross-sectioning and lamella fabrication, we have implemented fully automated workflows that standardize laser ablation and PFIB milling sequences. These workflows incorporate pre-programmed protocols for material removal, alignment, and thinning, reducing user intervention and ensuring consistency across different sample types. Machine learning algorithms further enhance automation by predicting optimal milling strategies and adapting parameters based on material properties and sectioning requirements. This approach significantly improves throughput while maintaining the structural integrity of prepared samples for high-resolution imaging and analysis, including transmission electron microscopy. Beyond sample preparation, our automation platform enables the acquisition of large, high-resolution datasets through serial sectioning, image alignment, and 3D reconstruction. These automated routines facilitate multi-scale characterization, capturing structural and compositional details from the nanoscale to the device level. By reducing variability and increasing efficiency, our automated approach enhances defect analysis, failure diagnostics, and process optimization, accelerating advancements in materials research and device engineering.

36 MATERIALS SCIENCE↗
NASA NTRS1997

Design of Neural Networks for Fast Convergence and Accuracy: Dynamics and Control

A procedure for the design and training of artificial neural networks, used for rapid and efficient controls and dynamics design and analysis for flexible space systems, has been developed. Artificial neural networks are employed, such that once properly trained, they provide a means of evaluating the impact of design changes rapidly. Specifically, two-layer feedforward neural networks are designed to approximate the functional relationship between the component/spacecraft design changes and measures of its performance or nonlinear dynamics of the system/components. A training algorithm, based on statistical sampling theory, is presented, which guarantees that the trained networks provide a designer-specified degree of accuracy in mapping the functional relationship. Within each iteration of this statistical-based algorithm, a sequential design algorithm is used for the design and training of the feedforward network to provide rapid convergence to the network goals. Here, at each sequence a new network is trained to minimize the error of previous network. The proposed method should work for applications wherein an arbitrary large source of training data can be generated. Two numerical examples are performed on a spacecraft application in order to demonstrate the feasibility of the proposed approach.

Maghami, Peiman G.↗
NASA NTRS1998

Design of Neural Networks for Fast Convergence and Accuracy

A novel procedure for the design and training of artificial neural networks, used for rapid and efficient controls and dynamics design and analysis for flexible space systems, has been developed. Artificial neural networks are employed to provide a means of evaluating the impact of design changes rapidly. Specifically, two-layer feedforward neural networks are designed to approximate the functional relationship between the component spacecraft design changes and measures of its performance. A training algorithm, based on statistical sampling theory, is presented, which guarantees that the trained networks provide a designer-specified degree of accuracy in mapping the functional relationship. Within each iteration of this statistical-based algorithm, a sequential design algorithm is used for the design and training of the feedforward network to provide rapid convergence to the network goals. Here, at each sequence a new network is trained to minimize the error of previous network. The design algorithm attempts to avoid the local minima phenomenon that hampers the traditional network training. A numerical example is performed on a spacecraft application in order to demonstrate the feasibility of the proposed approach.

Maghami, Peiman G.↗
NASA NTRS1990

Differential Sampling For Fast Acquisition Of Frequency

Algorithm rapidly estimates frequency of sinusoidal signal corrupted by zero-mean, additive, white Gaussian noise. Incorporates differential mathematical model of signal, cyclic sampling of signal, and least-squares best-estimate criterion. Adapts to changing signal frequency. Amount of computation required to obtain estimate increases only linearly with number of successive measurements processed.

Kumar, Rajendra↗
NASA NTRS2015

Assimilation of Wind Profiles from Multiple Doppler Radar Wind Profilers for Space Launch Vehicle Applications

Atmospheric wind data are required by space launch vehicles in order to assess flight vehicle loads and performance on day-of-launch. Space launch ranges at NASA's Kennedy Space Center co-located with the United States Air Force's (USAF) Eastern Range (ER) at Cape Canaveral Air Force Station and USAF's Western Range (WR) at Vandenberg Air Force Base have extensive networks of in-situ and remote sensing instrumentation to measure atmospheric winds. Each instrument's technique to measure winds has advantages and disadvantages in regards to use within vehicle trajectory analyses. Balloons measure wind at all altitudes necessary for vehicle assessments, but two primary disadvantages exist when applying balloon output. First, balloons require approximately one hour to reach required altitudes. Second, balloons are steered by atmospheric winds down range of the launch site that could significantly differ from those winds along the vehicle ascent trajectory. These issues are mitigated by use of vertically pointing Doppler Radar Wind Profilers (DRWPs). However, multiple DRWP instruments are required to provide wind data over altitude ranges necessary for vehicle trajectory assessments. The various DRWP systems have different operating configurations resulting in different temporal and spatial sampling intervals. Therefore, software was developed to combine data from both DRWP-generated profiles into a single profile for use in vehicle trajectory analyses. This paper will present details of the splicing software algorithms and will provide sample output.

Decker, Ryan K.↗
NASA NTRS2005

An Ensemble Approach to Building Mercer Kernels with Prior Information

This paper presents a new methodology for automatic knowledge driven data mining based on the theory of Mercer Kernels, which are highly nonlinear symmetric positive definite mappings from the original image space to a very high, possibly dimensional feature space. we describe a new method called Mixture Density Mercer Kernels to learn kernel function directly from data, rather than using pre-defined kernels. These data adaptive kernels can encode prior knowledge in the kernel using a Bayesian formulation, thus allowing for physical information to be encoded in the model. Specifically, we demonstrate the use of the algorithm in situations with extremely small samples of data. We compare the results with existing algorithms on data from the Sloan Digital Sky Survey (SDSS) and demonstrate the method's superior performance against standard methods. The code for these experiments has been generated with the AUTOBAYES tool, which automatically generates efficient and documented C/C++ code from abstract statistical model specifications. The core of the system is a schema library which contains templates for learning and knowledge discovery algorithms like different versions of EM, or numeric optimization methods like conjugate gradient methods. The template instantiation is supported by symbolic-algebraic computations, which allows AUTOBAYES to find closed-form solutions and, where possible, to integrate them into the code.

Srivastava, Ashok N.↗
NASA NTRSDate not supplied

Improving Computational Efficiency of Prognostics Algorithms in Resource-Constrained Settings

The field of prognostics and health management provides quantitative methods for monitoring and predicting the health of physical systems. Prognostics algorithms are useful in that they can be employed to assess the current state of a system, propagate the system state throughout time, and predict potential anomalies or failures that may occur. However, effective prognosis can be challenging to achieve in resource-constrained settings due to computational limitations and high computational latency, leading to obsolete predictions. Thus, computationally efficient and accurate algorithms are necessary for some prognostics applications. In this work, we implement three new algorithmic approaches to prediction (sampling methods, variable prediction time step, variable prediction sample size) with the goal of improving computational efficiency while minimizing decrease in model accuracy. To quantitatively analyze our results, we examine a use-case of degradation of a Lithium-ion battery. Notably, through this work it was found that none of the sampling approaches had a significant impact on computational efficiency or model accuracy in predicting EOD of the battery. However, our results show that prediction accuracy is highly dependent on the time step used, and that an appropriate time step can optimize both model accuracy and simulation efficiency. Finally, implementing a variable sample size also affected prediction, and our results show that tuning both the magnitude and timing of the sample size adjustment in an application-specific manner may prove useful in some applications. Taken together, our findings highlight the challenge of performing prognostics in resource-constrained settings, and illustrate the potential of developing new prediction algorithms to improve computational efficiency of prognosis.

Prognostics↗