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 811 records · Page 45

Determining the 3-D structure and motion of objects using a scanning laser range sensor

In order for the EVAHR robot to autonomously track and grasp objects, its vision system must be able to determine the 3-D structure and motion of an object from a sequence of sensory images. This task is accomplished by the use of a laser radar range sensor which provides dense range maps of the scene. Unfortunately, the currently available laser radar range cameras use a sequential scanning approach which complicates image analysis. Although many algorithms have been developed for recognizing objects from range images, none are suited for use with single beam, scanning, time-of-flight sensors because all previous algorithms assume instantaneous acquisition of the entire image. This assumption is invalid since the EVAHR robot is equipped with a sequential scanning laser range sensor. If an object is moving while being imaged by the device, the apparent structure of the object can be significantly distorted due to the significant non-zero delay time between sampling each image pixel. If an estimate of the motion of the object can be determined, this distortion can be eliminated; but, this leads to the motion-structure paradox - most existing algorithms for 3-D motion estimation use the structure of objects to parameterize their motions. The goal of this research is to design a rigid-body motion recovery technique which overcomes this limitation. The method being developed is an iterative, linear, feature-based approach which uses the non-zero image acquisition time constraint to accurately recover the motion parameters from the distorted structure of the 3-D range maps. Once the motion parameters are determined, the structural distortion in the range images is corrected.

Nandhakumar, N.↗

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↗

Semi-analytical covariance matrices for two-point correlation function for DESI 2024 data

We present an optimized way of producing the fast semi-analytical covariance matrices for the Legendre moments of the two-point correlation function, taking into account survey geometry and mimicking the non-Gaussian effects. We validate the approach on simulated (mock) catalogs for different galaxy types, representative of the Dark Energy Spectroscopic Instrument (DESI) Data Release 1, used in 2024 analyses. We find only a few percent differences between the mock sample covariance matrix and our results, which can be expected given the approximate nature of the mocks, although we do identify discrepancies between the shot-noise properties of the DESI fiber assignment algorithm and the faster approximation (emulator) used in the mocks. Importantly, we find a close agreement (≤ 8% relative differences) in the projected errorbars for distance scale parameters for the baryon acoustic oscillation measurements. This confirms our method as an attractive alternative to simulation-based covariance matrices, especially for non-standard models or galaxy sample selections, making it particularly relevant to the broad current and future analyses of DESI data.

79 ASTRONOMY AND ASTROPHYSICS↗

Partitioned Quantum Subspace Expansion

We present an iterative generalisation of the quantum subspace expansion algorithm used with a Krylov basis. The iterative construction connects a sequence of subspaces via their lowest energy states. Diagonalising a Hamiltonian in a given Krylov subspace requires the same quantum resources in both the single step and sequential cases. We propose a variance-based criterion for determining a good iterative sequence and provide numerical evidence that these good sequences display improved numerical stability over a single step in the presence of finite sampling noise. Implementing the generalisation requires additional classical processing with a polynomial overhead in the subspace dimension. By exchanging quantum circuit depth for additional measurements the quantum subspace expansion algorithm appears to be an approach suited to near term or early error-corrected quantum hardware. Our work suggests that the numerical instability limiting the accuracy of this approach can be substantially alleviated in a parameter-free way.

97 MATHEMATICS AND COMPUTING↗

Precipitation and Latent Heating Distributions from Satellite Passive Microwave Radiometry: Evaluation of Estimates Using Independent Data - Part 2

Rainfall rate estimates from space-borne k&ents are generally accepted as reliable by a majority of the atmospheric science commu&y. One-of the Tropical Rainfall Measuring Mission (TRh4M) facility rain rate algorithms is based upon passive microwave observations fiom the TRMM Microwave Imager (TMI). Part I of this study describes improvements in the TMI algorithm that are required to introduce cloud latent heating and drying as additional algorithm products. Here, estimates of surface rain rate, convective proportion, and latent heating are evaluated using independent ground-based estimates and satellite products. Instantaneous, OP5resolution estimates of surface rain rate over ocean fiom the improved TMI algorithm are well correlated with independent radar estimates (r approx. 0.88 over the Tropics), but bias reduction is the most significant improvement over forerunning algorithms. The bias reduction is attributed to the greater breadth of cloud-resolving model simulations that support the improved algorithm, and the more consistent and specific convective/stratiform rain separation method utilized. The bias of monthly, 2.5 deg. -resolution estimates is similarly reduced, with comparable correlations to radar estimates. Although the amount of independent latent heating data are limited, TMI estimated latent heating profiles compare favorably with instantaneous estimates based upon dual-Doppler radar observations, and time series of surface rain rate and heating profiles are generally consistent with those derived from rawinsonde analyses. Still, some biases in profile shape are evident, and these may be resolved with: (a) additional contextual information brought to the estimation problem, and/or; (b) physically-consistent and representative databases supporting the algorithm. A model of the random error in instantaneous, 0.5 deg-resolution rain rate estimates appears to be consistent with the levels of error determined from TMI comparisons to collocated radar. Error model modifications for non-raining situations will be required, however. Sampling error appears to represent only a fraction of the total error in monthly, 2S0-resolution TMI estimates; the remaining error is attributed to physical inconsistency or non-representativeness of cloud-resolving model simulated profiles supporting the algorithm.

Yang, Song↗

Experiments with a Parallel Multi-Objective Evolutionary Algorithm for Scheduling

Evolutionary multi-objective algorithms have great potential for scheduling in those situations where tradeoffs among competing objectives represent a key requirement. One challenge, however, is runtime performance, as a consequence of evolving not just a single schedule, but an entire population, while attempting to sample the Pareto frontier as accurately and uniformly as possible. The growing availability of multi-core processors in end user workstations, and even laptops, has raised the question of the extent to which such hardware can be used to speed up evolutionary algorithms. In this paper we report on early experiments in parallelizing a Generalized Differential Evolution (GDE) algorithm for scheduling long-range activities on NASA's Deep Space Network. Initial results show that significant speedups can be achieved, but that performance does not necessarily improve as more cores are utilized. We describe our preliminary results and some initial suggestions from parallelizing the GDE algorithm. Directions for future work are outlined.

scheduling↗

The discriminant power of bubble wall velocities: gravitational waves and electroweak baryogenesis

A precise determination of the bubble wall velocity v$_{w}$ is crucial for making accurate predictions of the baryon asymmetry and gravitational wave (GW) signals in models of electroweak baryogenesis (EWBG). Working in the local thermal equilibrium approximation, we exploit entropy conservation to present efficient algorithms for computing v$_{w}$, significantly streamlining the calculation. We then explore the parameter dependencies of v$_{w}$, focusing on two sample models capable of enabling a strong first-order electroweak phase transition: a ℤ$_{2}$-symmetric singlet extension of the SM, and a model for baryogenesis with CP violation in the dark sector. We study correlations among v$_{w}$ and the two common measures of phase transition strength, α$_{n}$ and v$_{n}$/T$_{n}$. Interestingly, we find a relatively model-insensitive relationship between v$_{n}$/T$_{n}$ and α$_{n}$. We also observe an upper bound on α$_{n}$ for the deflagration/hybrid wall profiles naturally compatible with EWBG, the exact value for which varies between models, significantly impacting the strength of the GW signals. In summary, our work provides a framework for exploring the feasibility of EWBG models in light of future GW signals.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

3D imaging of magnetic domains in Nd 2 Fe 14 B using scanning hard X-ray nanotomography

Nanoscale structural and electronic heterogeneities are prevalent in condensed matter physics. Investigating these heterogeneities in 3D has become an important task for understanding material properties. To provide a tool to unravel the connection between nanoscale heterogeneity and macroscopic emergent properties in magnetic materials, scanning transmission X-ray microscopy (STXM) is combined with X-ray magnetic circular dichroism. A vector tomography algorithm has been developed to reconstruct the full 3D magnetic vector field without any prior noise assumptions or knowledge about the sample. Two tomographic scans around the vertical axis are acquired on single-crystalline Nd 2 Fe 14 B pillars tilted at two different angles, with 2D STXM projections recorded using a focused 120 nm X-ray beam with left and right circular polarization. Image alignment and iterative registration have been implemented based on the 2D STXM projections for the two tilts. Dichroic projections obtained from difference images are used for the tomographic reconstruction to obtain the 3D magnetization distribution at the nanoscale.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Two-Stage Distributionally Robust Conic Linear Programming over 1-Wasserstein Balls

Here, this paper studies two-stage distributionally robust conic linear programming under constraint uncertainty over type-1 Wasserstein balls. We present optimality conditions for the dual of the worst-case expectation problem, which characterizes worst-case uncertain parameters for its inner maximization problem. This condition offers an alternative proof, a counterexample, and an extension to previous works. Additionally, the condition highlights the potential advantage of a specific distance metric for out-of-sample performance, as exemplified in a numerical study on a facility location problem with demand uncertainty. Furthermore, cutting-plane-based algorithms, equipped with a unified scenario generation framework, are proposed for addressing both unbounded support and second-stage dual feasible regions, with a finite convergence proof under less stringent assumptions.

Wasserstein↗

HighDimMixedModels.jl: Robust high-dimensional mixed-effects models across omics data

High-dimensional mixed-effects models are an increasingly important form of regression in which the number of covariates rivals or exceeds the number of samples, which are collected in groups or clusters. The penalized likelihood approach to fitting these models relies on a coordinate descent algorithm that lacks guarantees of convergence to a global optimum. Here, we empirically study the behavior of this algorithm on simulated and real examples of three types of data that are common in modern biology: transcriptome, genome-wide association, and microbiome data. Our simulations provide new insights into the algorithm’s behavior in these settings, and, comparing the performance of two popular penalties, we demonstrate that the smoothly clipped absolute deviation (SCAD) penalty consistently outperforms the least absolute shrinkage and selection operator (LASSO) penalty in terms of both variable selection and estimation accuracy across omics data. To empower researchers in biology and other fields to fit models with the SCAD penalty, we implement the algorithm in a Julia package, HighDimMixedModels.jl .

Gorstein, Evan↗

Users manual for flight control design programs

Computer programs for the design of analog and digital flight control systems are documented. The program DIGADAPT uses linear-quadratic-gaussian synthesis algorithms in the design of command response controllers and state estimators, and it applies covariance propagation analysis to the selection of sampling intervals for digital systems. Program SCHED executes correlation and regression analyses for the development of gain and trim schedules to be used in open-loop explicit-adaptive control laws. A linear-time-varying simulation of aircraft motions is provided by the program TVHIS, which includes guidance and control logic, as well as models for control actuator dynamics. The programs are coded in FORTRAN and are compiled and executed on both IBM and CDC computers.

Nalbandian, J. Y.↗

A novel method of calculating far-field patterns of large aperture antennas

A method is described for calculation of the radiation pattern of large aperture antennas. A piece-wise linear approximation of the aperture field using overlapping pyramidal basis functions allows the radiation pattern of an aperture antenna to be calculated as though it were a two-dimensional array. The calculation of radiation pattern data versus theta and phi, suitable for 3-D or contour plot algorithms, is achieved by locating the array in the yz-plane and performing a summation over the aperture field data sampled on a square grid. A FORTRAN subroutine is provided for performing radiation pattern calculations. Numerical results are included to demonstrate the accuracy and convergence of the method. These numerical results indicate that typical accuracies of + or - 0.1 dB for Directivity, + or - dB for the 1st Sidelobe Level, and + - 2dB for the 2nd Sidelobe Level can be obtained with an aperture grid of 45x45 points and requires approximately 0.02 seconds CPU time per far-field data point on a VAX 11/750 with a floating point accelerator.

Bailey, M. C.↗

An Advanced Approach to Simultaneous Monitoring of Multiple Bacteria in Space

The utility of a novel microarray-based microbial analyzer was demonstrated by the rapid detection, imaging, and identification of a mixture of microorganisms found in a waste water sample from the Lunar-Mars Life Support Test Project through the synergistic combination of: (1) judicious RNA probe selection via algorithms developed by University of Houston scientists; (2) tuned surface chemistries developed by Baylor College of Medicine scientists to facilitate hybridization of rRNA targets to DNA probes under very low salt conditions, thereby minimizing secondary structure; and (3) integration of the microarray printing and detection/imaging instrumentation by Genometrix to complete the quantitative analysis of microorganism mixtures.

Eggers, M.↗

Comparisons of Monthly Oceanic Rainfall Derived from TMI and SSM/I

A technique for estimating monthly oceanic rainfall rate using multi-channel microwave measurements has been developed. There are three prominent features of this algorithm. First, the knowledge of the form of the rainfall intensity probability density function used to augment the measurements. Second, utilizing a linear combination of the 19.35 and 22.235 GHz channels to de-emphasize the effect of water vapor. Third, an objective technique has been developed to estimate the rain layer thickness from the 19.35 and 22.235 GHz brightness temperature histograms. This technique is applied to the SSM/I data since 1987 to infer monthly rainfall for the Global Precipitation Climatology Project (GPCP). A modified version of this algorithm is now being applied to the TRMM Microwave Imager (TMI) data. TMI data with better spatial resolution and 24 hour sampling (vs. sun-synchronized sampling, which is limited to two narrow intervals of local solar time for DMSP satellites) prompt us to study the similarity and difference between these two rainfall estimates. Six months of rainfall data (January to June 1998) are used in this study. Means and standard deviations are calculated. Paired student t-tests are administrated to evaluate the differences between rainfall estimates from SSM/I and TMI data. Their differences are discussed in the context of global satellite rainfall estimation.

Chang, A. T. C.↗

Fast-Acquisition/Weak-Signal-Tracking GPS Receiver for HEO

A report discusses the technical background and design of the Navigator Global Positioning System (GPS) receiver -- . a radiation-hardened receiver intended for use aboard spacecraft. Navigator is capable of weak signal acquisition and tracking as well as much faster acquisition of strong or weak signals with no a priori knowledge or external aiding. Weak-signal acquisition and tracking enables GPS use in high Earth orbits (HEO), and fast acquisition allows for the receiver to remain without power until needed in any orbit. Signal acquisition and signal tracking are, respectively, the processes of finding and demodulating a signal. Acquisition is the more computationally difficult process. Previous GPS receivers employ the method of sequentially searching the two-dimensional signal parameter space (code phase and Doppler). Navigator exploits properties of the Fourier transform in a massively parallel search for the GPS signal. This method results in far faster acquisition times [in the lab, 12 GPS satellites have been acquired with no a priori knowledge in a Low-Earth-Orbit (LEO) scenario in less than one second]. Modeling has shown that Navigator will be capable of acquiring signals down to 25 dB-Hz, appropriate for HEO missions. Navigator is built using the radiation-hardened ColdFire microprocessor and housing the most computationally intense functions in dedicated field-programmable gate arrays. The high performance of the algorithm and of the receiver as a whole are made possible by optimizing computational efficiency and carefully weighing tradeoffs among the sampling rate, data format, and data-path bit width.

Wintemitz, Luke↗

The Dark Energy Survey Supernova Programme: Modelling Selection Efficiency and Observed Core-collapse Supernova Contamination

The analysis of current and future cosmological surveys of Type Ia supernovae (SNe Ia) at high redshift depends on the accuratephotometric classification of the SN events detected. Generating realistic simulations of photometric SN surveys constitutes anessential step for training and testing photometric classification algorithms, and for correcting biases introduced by selectioneffects and contamination arising from core-collapse SNe in the photometric SN Ia samples. We use published SN time-seriesspectrophotometric templates, rates, luminosity functions, and empirical relationships between SNe and their host galaxies toconstruct a framework for simulating photometric SN surveys. We present this framework in the context of the Dark EnergySurvey (DES) 5-yr photometric SN sample, comparing our simulations of DES with the observed DES transient populations.We demonstrate excellent agreement in many distributions, including Hubble residuals, between our simulations and data.We estimate the core collapse fraction expected in the DES SN sample after selection requirements are applied and beforephotometric classification. After testing different modelling choices and astrophysical assumptions underlying our simulation,we find that the predicted contamination varies from 7.2 to 11.7 per cent, with an average of 8.8 per cent and an r.m.s. of 1.1 percent. Our simulations are the first to reproduce the observed photometric SN and host galaxy properties in high-redshift surveyswithout fine-tuning the input parameters. The simulation methods presented here will be a critical component of the cosmologyanalysis of the DES photometric SN Ia sample: correcting for biases arising from contamination, and evaluating the associatedsystematic uncertainty.

M Vincenzi↗

Few measurement shots challenge generalization in learning to classify entanglement

The ability to extract general laws from a few known examples depends on the complexity of the problem and on the amount of training data. In the quantum setting, the learner's generalization performance is further challenged by the destructive nature of quantum measurements that, together with the no-cloning theorem, limits the amount of information that can be extracted from each training sample. In this paper we focus on hybrid quantum learning techniques where classical machine-learning methods are paired with quantum algorithms and show that, in some settings, the uncertainty coming from a few measurement shots can be the dominant source of errors. We identify an instance of this possibly general issue by focusing on the classification of maximally entangled vs. separable states, showing that this toy problem becomes challenging for learners unaware of entanglement theory. Finally, we introduce an estimator based on classical shadows that performs better in the big data, few copy regime. Our results show that the naive application of classical machine-learning methods to the quantum setting is problematic, and that a better theoretical foundation of quantum learning is required.

97 MATHEMATICS AND COMPUTING↗

New graph-neural-network flavor tagger for Belle II and measurement of sin 2⁢𝜙 1 in 𝐵 0 → 𝐽/𝜓⁢𝐾$^0_ S$ decays

We present GFlaT, a new algorithm that uses a graph-neural-network to determine the flavor of neutral 𝐵 mesons produced in ϒ⁡(4⁢𝑆) decays. It improves previous algorithms by using the information from all charged final-state particles and the relations between them. We evaluate its performance using 𝐵 decays to flavor-specific hadronic final states reconstructed in a 362 fb −1 sample of electron-positron collisions collected at the ϒ⁡(4⁢𝑆) resonance with the Belle II detector at the SuperKEKB collider. We achieve an effective tagging efficiency of (37.40 ± 0.43 ± 0.36%), where the first uncertainty is statistical and the second systematic, which is 18% better than the previous Belle II algorithm. Demonstrating the algorithm, we use 𝐵 0 →𝐽/𝜓⁢𝐾$^0_ S$ decays to measure the mixing-induced and direct 𝐶⁢𝑃 violation parameters, 𝑆 = (0.724 ± 0.035 ± 0.009) and 𝐶 = (−0.035 ± 0.026 ± 0.029).

CP violation↗