Search NASA⌕ Search

SEARCH · Search NASA

Results for “sampling algorithms”

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 433 records · Page 24

Frequency response modeling and control of flexible structures: Computational methods

The dynamics of vibrations in flexible structures can be conventiently modeled in terms of frequency response models. For structural control such models capture the distributed parameter dynamics of the elastic structural response as an irrational transfer function. For most flexible structures arising in aerospace applications the irrational transfer functions which arise are of a special class of pseudo-meromorphic functions which have only a finite number of right half place poles. Computational algorithms are demonstrated for design of multiloop control laws for such models based on optimal Wiener-Hopf control of the frequency responses. The algorithms employ a sampled-data representation of irrational transfer functions which is particularly attractive for numerical computation. One key algorithm for the solution of the optimal control problem is the spectral factorization of an irrational transfer function. The basis for the spectral factorization algorithm is highlighted together with associated computational issues arising in optimal regulator design. Options for implementation of wide band vibration control for flexible structures based on the sampled-data frequency response models is also highlighted. A simple flexible structure control example is considered to demonstrate the combined frequency response modeling and control algorithms.

Bennett, William H.↗

"Noiseless" Data-Compression Algorithm

Gamma-ray spectrometer data compressed to enable more frequent sampling. Proposed data-compression algorithm efficiently represents gamma-ray spectrometer spectra at any spectrum collection interval from 5 seconds to 5 minutes. Data representations "noiseless" (Data exactly constructed). Techniques useful in designing datacompression algorithms for other spectral instruments, which have varying data-rate requirements.

Rice, R. F.↗

Ultrasonic Characterization of Cast Austenitic Stainless Steel Microstructure: Discrimination between Equiaxed- and Columnar-Grain Material – An Interim Study

Ultrasonic nondestructive evaluation (NDE) and inspection of cast austenitic stainless steel (CASS) components used in the nuclear power industry is neither as effective nor reliable as is needed due to detrimental effects upon the interrogating ultrasonic beam and interference from ultrasonic backscatter. The root cause is the coarse-grain microstructure inherent to this class of materials. Some ultrasonic techniques perform better for particular microstructural classifications and this has led to the hypothesis that an ultrasonic inspection can be optimized for a particular microstructural class, if a technique exists to reliably classify the microstructure for feedback to the inspection. This document summarizes scoping experiments of in-situ ultrasonic methods for classification and/or characterization of the material microstructures in CASS components from the outside surface of a pipe. The focus of this study was to evaluate ultrasonic methods and provide an interim report that documents results and technical progress. An initial set of experiments were performed to test the hypothesis that in-service characterization of cast austenitic stainless steel (CASS) is feasible, and that, if reliably performed, such data would provide real-time feedback to optimize in-service inspections in the field. With this objective in mind, measurements for the experiment were restricted to techniques that should be robust if carried forward to eventual field implementation. Two parameters were investigated for their ability to discriminate between different microstructures in CASS components. The first parameter was a time-of-flight ratio of a normal incidence shear wave to that of a normal incidence longitudinal wave (TOFRSL). The ratio removed dependency on component thickness which may not be accurately reported in the field. The second parameter was longitudinal wave attenuation. The selected CASS specimens provided five equiaxed-grain material samples and five columnar-grain material samples for a two-class discrimination problem. Qualitative TOFRSL estimates and a threshold algorithm classified all 10 material samples correctly and indicated a reliable and robust technique. Qualitative longitudinal wave attenuation estimates and a threshold algorithm also classified all 10 materials samples correctly; however, the technique was not as robust as TOFRSL. The experiments provided promising results and demonstrated that good potential exists for future development of techniques to implement real-time classification of CASS material. However, the reported measurements need to be substantiated with measurements on additional specimens.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

A three-dimensional reconstruction algorithm for scanning transmission electron microscopy data from thick samples

Increasing interest in three-dimensional nanostructures adds impetus to electron microscopy techniques capable of imaging at or below the nanoscale in three dimensions. We present a reconstruction algorithm that takes as input a focal series of four-dimensional scanning transmission electron microscopy (4D-STEM) data and transcends the prevalent structure retrieval algorithm assumption of a very thin specimen homogenous along the optic axis. We demonstrate this approach by reconstructing the different layers of a lead iridate (Pb$_2$Ir$_2$O$_7$) and yttrium-stabilized zirconia (Y$_{0.095}$Zr$_{0.905}$O$_2$) heterostructure from data acquired with the specimen in a single plan-view orientation, with the epitaxial layers stacked along the beam direction.

Brown, Hamish G↗

On the Green's function of the partially diffusion-controlled reversible ABCD reaction for radiation chemistry codes

Several computer codes simulating chemical reactions in particles systems are based on the Green's functions of the diffusion equation (GFDE). Indeed, many types of chemical systems have been simulated using the exact GFDE, which has also become the gold standard for validating other theoretical models. In this work, a simulation algorithm is presented to sample the interparticle distance for partially diffusion-controlled reversible ABCD reaction. This algorithm is considered exact for 2-particles systems, is faster than conventional look-up tables and uses only a few kilobytes of memory. The simulation results obtained with this method are compared with those obtained with the independent reaction times (IRT) method. This work is part of our effort in developing models to understand the role of chemical reactions in the radiation effects on cells and tissues and may eventually be included in event-based models of space radiation risks. However, as many reactions are of this type in biological systems, this algorithm might play a pivotal role in future simulation programs not only in radiation chemistry, but also in the simulation of biochemical networks in time and space as well.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

High Rate Digital Demodulator ASIC

The architecture of High Rate (600 Mega-bits per second) Digital Demodulator (HRDD) ASIC capable of demodulating BPSK and QPSK modulated data is presented in this paper. The advantages of all-digital processing include increased flexibility and reliability with reduced reproduction costs. Conventional serial digital processing would require high processing rates necessitating a hardware implementation in other than CMOS technology such as Gallium Arsenide (GaAs) which has high cost and power requirements. It is more desirable to use CMOS technology with its lower power requirements and higher gate density. However, digital demodulation of high data rates in CMOS requires parallel algorithms to process the sampled data at a rate lower than the data rate. The parallel processing algorithms described here were developed jointly by NASA's Goddard Space Flight Center (GSFC) and the Jet Propulsion Laboratory (JPL). The resulting all-digital receiver has the capability to demodulate BPSK, QPSK, OQPSK, and DQPSK at data rates in excess of 300 Mega-bits per second (Mbps) per channel. This paper will provide an overview of the parallel architecture and features of the HRDR ASIC. In addition, this paper will provide an over-view of the implementation of the hardware architectures used to create flexibility over conventional high rate analog or hybrid receivers. This flexibility includes a wide range of data rates, modulation schemes, and operating environments. In conclusion it will be shown how this high rate digital demodulator can be used with an off-the-shelf A/D and a flexible analog front end, both of which are numerically computer controlled, to produce a very flexible, low cost high rate digital receiver.

Ghuman, Parminder↗

Detecting 127 Xe in an atmospheric tracer experiment

The Xcounts algorithm for calculating air concentrations of radioactive xenon isotopes (Eslinger et al., 2023) has been extended to estimate 127 Xe in addition to 131m Xe, 133m Xe, 133 Xe, and 135 Xe. The algorithm was applied to 119 samples collected with a SAUNA Q B system (Ringbom et al., 2023) during a two-month atmospheric tracer release experiment. Finally, the algorithm identified two samples with 127 Xe present from a single 1.5 h release about 3.5 km upwind of the sampler and no false detections of 127 Xe were observed in the other samples.

127Xe calibration↗

Computing water flow through complex landscapes – Part 3: Fill–Spill–Merge: flow routing in depression hierarchies

Abstract. Depressions – inwardly draining regions – are common to many landscapes. When there is sufficient moisture, depressions take the form of lakes and wetlands; otherwise, they may be dry. Hydrological flow models used in geomorphology, hydrology, planetary science, soil and water conservation, and other fields often eliminate depressions through filling or breaching; however, this can produce unrealistic results. Models that retain depressions, on the other hand, are often undesirably expensive to run. In previous work we began to address this by developing a depression hierarchy data structure to capture the full topographic complexity of depressions in a region. Here, we extend this work by presenting the Fill–Spill–Merge algorithm that utilizes our depression hierarchy data structure to rapidly process and distribute runoff. Runoff fills depressions, which then overflow and spill into their neighbors. If both a depression and its neighbor fill, they merge. We provide a detailed explanation of the algorithm and results from two sample study areas. In these case studies, the algorithm runs 90–2600 times faster (with a reduction in compute time of 2000–63 000 times) than the commonly used Jacobi iteration and produces a more accurate output. Complete, well-commented, open-source code with 97 % test coverage is available on GitHub and Zenodo.

58 GEOSCIENCES↗

Estimates of Small Signal/Noise Ratios

Signal/Noise Ratio Meter measures ratio of signal power to noise power in input that contains both signal and noise. Signal and noise first filtered and normalized in analog circuitry, then digitized and sampled. Performance of SNR meter determined by statistical algorithm chosen for analysis of samples.

Howard, L. D.↗

Possibilities and Limitations of Kinematically Identifying Stars from Accreted Ultra-faint Dwarf Galaxies

Abstract The Milky Way has accreted many ultra-faint dwarf galaxies (UFDs), and stars from these galaxies can be found throughout our Galaxy today. Studying these stars provides insight into galaxy formation and early chemical enrichment, but identifying them is difficult. Clustering stellar dynamics in 4D phase space ( E , L z , J r , J z ) is one method of identifying accreted structure that is currently being utilized in the search for accreted UFDs. We produce 32 simulated stellar halos using particle tagging with the Caterpillar simulation suite and thoroughly test the abilities of different clustering algorithms to recover tidally disrupted UFD remnants. We perform over 10,000 clustering runs, testing seven clustering algorithms, roughly twenty hyperparameter choices per algorithm, and six different types of data sets each with up to 32 simulated samples. Of the seven algorithms, HDBSCAN most consistently balances UFD recovery rates and cluster realness rates. We find that, even in highly idealized cases, the vast majority of clusters found by clustering algorithms do not correspond to real accreted UFD remnants and we can generally only recover 6% of UFDs remnants at best. These results focus exclusively on groups of stars from UFDs, which have weak dynamic signatures compared to the background of other stars. The recoverable UFD remnants are those that accreted recently, z accretion ≲ 0.5. Based on these results, we make recommendations to help guide the search for dynamically linked clusters of UFD stars in observational data. We find that real clusters generally have higher median energy and J r , providing a way to help identify real versus fake clusters. We also recommend incorporating chemical tagging as a way to improve clustering results.

79 ASTRONOMY AND ASTROPHYSICS↗

A simulation-based test bed for data-association algorithms

A modular All-Source System-evaluation Test bed (ASSET) designed and developed for aiding in the testing and evaluation of advanced data-acquisition algorithms is described, with focus placed on the problem of integrating surveillance information in supporting command decision making. The evaluation procedure employed is based on a measure of the distance between a baseline representation and the representation produced by the association algorithm at some time instant. Choices for the baseline representation are presented, and scores are defined between these baselines and an algorithm representation. The test-bed architecture implementing the evaluation procedure is described, and sample outputs from performing algorithm evaluations in the test bed are outlined.

Brown, Donald E.↗

Extracting Periodic Signals From Irregularly Sampled Data

Successive approximations formed in Fourier space. Algorithm extracts periodic signals from sparse, irregularly sampled sets of measurement data. Pertains to data processed via fast Fourier transforms (FFTs). Data represents signal components with initially unknown frequencies spanning large spectral range and includes frequencies not integer multiples of minimum FFT frequency.

Wilcox, Jaroslava Z.↗

Convergence of the SMI and the diagonally loaded SMI algorithms with weak interference

Approximations for the power levels at the output of an adaptive array that uses the diagonally loaded sample-matrix inversion (SMI) algorithm are derived. Diagonal loading is a technique where the diagonal of the covariance matrix is augmented with a positive or negative constant prior to inversion. This paper examines how the signal-to-interference-plus-noise ratio (SINR) and signal-to-interference ratio (SIR) at the array output vary with the number of samples taken when the input signals are CW. It is shown that positive loading produces more rapid convergence with a reduction in output SIR. Negative loading provides an improved SIR level, but positive loading produces more rapid convergence. Negative loading provides an improved SIR level, but the output power levels are erratic and slow to converge. Simulation results which verify the theoretical procedure are given.

Ganz, Matthew W.↗

Biased degenerate ground-state sampling of small Ising models with converged quantum approximate optimization algorithm

The quantum alternating operator ansatz, a generalization of the quantum approximate optimization algorithm (QAOA), is a quantum algorithm used for approximately solving combinatorial optimization problems. QAOA typically uses the transverse field mixer as the driving Hamiltonian. One of the interesting properties of the transverse field driving Hamiltonian is that it results in nonuniform sampling of degenerate ground states of optimization problems. In this study, we numerically examine the fair sampling properties of the transverse field mixer QAOA, and Grover mixer QAOA (GM-QAOA), which provides theoretical guarantees of fair sampling of degenerate optimal solutions, up to a large enough p such that the mean expectation value converges to an optimal approximation ratio of 1. This comparison is performed with high-quality heuristically computed, but not necessarily optimal, QAOA angles, which give strictly monotonically improving solution quality as p increases. These angles are computed using the Julia based numerical simulation software JuliQAOA. Fair sampling of degenerate ground states is quantified using the Shannon entropy of the ground-state amplitudes distribution. The fair sampling properties are reported on several quantum signature Hamiltonians from previous quantum annealing fair sampling studies. Small random fully connected spin glasses are shown, which exhibit exponential suppression of some degenerate ground states with transverse field mixer QAOA. The transverse field mixer QAOA simulations show that some problem instances clearly saturate the Shannon entropy of 0 with a maximally biased distribution that occurs when the learning converges to an approximation ratio of 1 while other problem instances never deviate from a maximum Shannon entropy (uniform distribution) at any p step. Published by the American Physical Society 2025

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Fast, Safe, Propellant-Efficient Spacecraft Motion Planning Under Clohessy-Wiltshire-Hill Dynamics

This paper presents a sampling-based motion planning algorithm for real-time and propellant-optimized autonomous spacecraft trajectory generation in near-circular orbits. Specifically, this paper leverages recent algorithmic advances in the field of robot motion planning to the problem of impulsively actuated, propellant- optimized rendezvous and proximity operations under the Clohessy-Wiltshire-Hill dynamics model. The approach calls upon a modified version of the FMT* algorithm to grow a set of feasible trajectories over a deterministic, low-dispersion set of sample points covering the free state space. To enforce safety, the tree is only grown over the subset of actively safe samples, from which there exists a feasible one-burn collision-avoidance maneuver that can safely circularize the spacecraft orbit along its coasting arc under a given set of potential thruster failures. Key features of the proposed algorithm include 1) theoretical guarantees in terms of trajectory safety and performance, 2) amenability to real-time implementation, and 3) generality, in the sense that a large class of constraints can be handled directly. As a result, the proposed algorithm offers the potential for widespread application, ranging from on-orbit satellite servicing to orbital debris removal and autonomous inspection missions.

spacecraft relative motio↗

Wavelength-resolved Neutron Tomography for Crystalline Materials

Wavelength-resolved (WR) neutron transmission tomography is an emerging technique to characterize engineering materials. While tomographic reconstruction for amorphous samples is straightforward, it is challenging to reconstruct samples with single-crystal domains because the attenuation of the sample varies as a function of its orientation with respect to the incident beam due to Bragg scattering. In this paper, we present an algorithm that can reconstruct samples with single-crystal domains from WR neutron tomographic measurements. In particular, we use a model-based iterative reconstruction (MBIR) technique that reconstructs the volume by identifying and leaving out the regions of the measurement that are affected by Bragg scatter. We combine the output of the MBIR method with an algorithm that matches the reconstruction to the identified Bragg scatter to reconstruct a feature that corresponds to the local crystallography of the sample being measured. Using simulated data, we demonstrate how our algorithm can reconstruct materials with single-crystal domains, thereby adding a powerful new capability for WR neutron imaging instruments.

Singanallur Vaidyanathan, Venkatakrishnan↗

Small-Noise Analysis and Symmetrization of Implicit Monte Carlo Samplers

Implicit samplers are algorithms for producing independent, weighted samples from multivariate probability distributions. These are often applied in Bayesian data assimilation algorithms. We use Laplace asymptotic expansions to analyze two implicit samplers in the small noise regime. Our analysis suggests a symmetrization of the algorithms that leads to improved implicit sampling schemes at a relatively small additional cost. Here, computational experiments confirm the theory and show that symmetrization is effective for small noise sampling problems.

97 MATHEMATICS AND COMPUTING↗

Frequency extrapolation by nonconvex compressive sensing

Tomographic imaging modalities sample subjects with a discrete, finite set of measurements, while the underlying object function is continuous. Because of this, inversion of the imaging model, even under ideal conditions, necessarily entails approximation. The error incurred by this approximation can be important when there is rapid variation in the object function or when the objects of interest are small. In this work, we investigate this issue with the Fourier transform (FT), which can be taken as the imaging model for magnetic resonance imaging (MRl) or some forms of wave imaging. Compressive sensing has been successful for inverting this data model when only a sparse set of samples are available. We apply the compressive sensing principle to a somewhat related problem of frequency extrapolation, where the object function is represented by a super-resolution grid with many more pixels than FT measurements. The image on the super-resolution grid is obtained through nonconvex minimization. The method fully utilizes the available FT samples, while controlling aliasing and ringing. The algorithm is demonstrated with continuous FT samples of the Shepp-Logan phantom with additional small, high-contrast objects.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗