Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “adaptive sampling”

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 541 records · Page 30

CV4Quantum: Reducing the Sampling Overhead in Probabilistic Error Cancellation Using Control Variates

Quasiprobabilistic decompositions (QPDs) play a key role in maximizing the utility of near-term quantum hardware. For example, Probabilistic Error Cancellation (PEC) (an error mitigation technique) and circuit cutting (which enables large quantum computations to be performed on quantum hardware with a limited number of qubits) both involve QPDs. Computations based on QPDs typically incur large sampling overheads that grow exponentially with the number of error-terms mitigated or number of circuit-cuts employed, limiting their practical feasibility. In this work, we adapt the control variates variance reduction technique from the statistics literature in order to reduce the sampling overhead in QPD-based computations. We demonstrate our method using simulation experiments that mimic a realistic PEC scenario. In our experiments, we observed a more than 50% reduction in the number of samples needed to achieve a given precision, in more than 50% of the PEC-based estimations performed in the study when using our approach. We discuss how future research on constructing good control variates can lead to even stronger sampling overhead reduction.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Enumeration and Fluorescence In Situ Hybridization of Microbial Bioburden on Cleanroom Surfaces

Introduction: Microorganisms are everywhere on Earth, even in the cleanest of places. Spacecraft assembly cleanrooms can harbor low levels of living and dead microbial cells (e.g., [1,2]), and cleanroom bioburden can also include organic molecules from industrial sources and in situ biomass. Life detection missions require careful attention to avoid contaminants that can be easily convoluted with analytical targets. We are evaluating epifluorescent microscopy and fluorescence in situ hybridization (FISH) as methods to complement organic contamination detection techniques. Epifluorescent cell counting offers an accurate and cost-effective way to quantify low levels of surface biomass. FISH could allow for the identification of residual organisms, and can be targeted to detect active populations of specific organisms such as bacteria known to resist cleaning procedures. This effort is part of a larger study that is concentrated on characterizing the surface and airborne molecular organic contamination background in Johnson Space Center (JSC) Astromaterials curation laboratories and Goddard Space Flight Center (GSFC) spacecraft assembly rooms, and understanding contaminants in the context of cleaning procedures and residual bioburden. Methods: Samples were collected by swabbing surfaces in ISO 5 and ISO 7 equivalent cleanrooms at JSC. Swabs for FISH were fixed in 4% paraformaldehyde (PFA) for 3 hours and then stored in 1:1 ethanol:PBS, while swabs for cell counting were stored in 4% PFA until analysis to avoid any cell loss during centrifugation that could impact quantification of very low biomass samples. Cell counting was performed with SYBR Gold as in [3], but adapted for very low biomass. FISH was performed as in [4], using DAPI as a counterstain for all DNA-containing cells. Negative controls included wells with no probe applied, to test for natural fluorescence, as well as the nonsense probe NONEUB (reverse complement of EUB338) to evaluate non-specific probe binding. Results and Discussion: Cleanroom surfaces had 102-103 cells cm-2. The extremely low biomass of these samples was challenging for enumeration, and required careful and routine use of “field” and laboratory blanks. FISH was performed with the general archaeal and bacterial probes ARCH915 and EUB338 (EUBMIX, [4]), probe GAMBET ([4]), and PSE227, which targets the genus Pseudomonas [5]). The latter two probes were selected because Pseudomonas spp. and other Gammaproteobacteria have not been isolated from cleanroom surfaces but do appear frequently in rRNA gene libraries from these surfaces. While some active bacteria were identified (Fig. 1c), most cells detectable by DAPI did not have a strong or any fluorescent signal (e.g., Fig. 1d), indicating that the vast majority of cells are dead or inactive. This suggests that cleaning protocols are effective at inactivating microbial contaminants, but that dead or inactive cells can remain on surfaces. Cells were often clumped in a weakly autofluorescent matrix, possibly biofilm material (Fig. 1c,d). We also observed other particulate material that was collected by the swabs, including apparent textile fibers (Fig. 1b). Our results are consistent with other studies that show that the bioburden present in clean rooms includes active, dormant, and dead cells. We will discuss how FISH and epifluorescent cell counting could be applied in planetary protection protocols, including the advantages and disadvantages of FISH and cell counting for routine use, as well as different possible applications for more specialized FISH procedures. References: [1] Moissl-Eichinger et al. (2015) Sci Rep, 5, 9156 [2] Hendrickson et al. (2021) Microbiome, 9, 238 [3] Jones et al. (2017) Appl Environ Microbiol, 83, e00909-17 [4] Jones et al. (2015) Appl Environ Microbiol, 81, 1242-1250. [5] Watt et al. (2006) Environ Microbiol, 8, 871-884

C J Huff↗

MPLEx: a Robust and Universal Protocol for Single-Sample Integrative Proteomic, Metabolomic, and Lipidomic Analyses

In systems biology studies, the integration of multiple omics measurements (i.e., genomics, transcriptomics, proteomics, metabolomics, and lipidomics) has been shown to provide a more complete and informative view of biological pathways. Thus, the prospect of extracting different types of molecules (e.g., DNAs, RNAs, proteins, and metabolites) and performing multiple omics measurements on single samples is very attractive, but such studies are challenging due to the fact that the extraction conditions differ according to the molecule type. Here, we adapted an organic solvent-based extraction method that demonstrated broad applicability and robustness, which enabled comprehensive proteomics, metabolomics, and lipidomics analyses from the same sample.

Nakayasu, Ernesto S.↗

Grover-QAOA for 3-SAT: quadratic speedup, fair-sampling, and parameter clustering

Abstract The SAT problem is a prototypical NP-complete problem of fundamental importance in computational complexity theory with many applications in science and engineering; as such, it has long served as an essential benchmark for classical and quantum algorithms. This study shows numerical evidence for a quadratic speedup of the Grover Quantum Approximate Optimization Algorithm (G-QAOA) over random sampling for finding all solutions to 3-SAT (All-SAT) and Max-SAT problems. G-QAOA is less resource-intensive and more adaptable for these problems than Grover’s algorithm, and it surpasses conventional QAOA in its ability to sample all solutions. We show these benefits by classical simulations of many-round G-QAOA on thousands of random 3-SAT instances. We also observe G-QAOA advantages on the IonQ Aria quantum computer for small instances, finding that current hardware suffices to determine and sample all solutions. Interestingly, a single-angle-pair constraint that uses the same pair of angles at each G-QAOA round greatly reduces the classical computational overhead of optimizing the G-QAOA angles while preserving its quadratic speedup. We also find parameter clustering of the angles. The single-angle-pair protocol and parameter clustering significantly reduce obstacles to classical optimization of the G-QAOA angles.

Zhang, Zewen (ORCID:000000032258613X)↗

Improved Compression of Wavelet-Transformed Images

A recently developed data-compression method is an adaptive technique for coding quantized wavelet-transformed data, nominally as part of a complete image-data compressor. Unlike some other approaches, this method admits a simple implementation and does not rely on the use of large code tables. A common data compression approach, particularly for images, is to perform a wavelet transform on the input data, and then losslessly compress a quantized version of the wavelet-transformed data. Under this compression approach, it is common for the quantized data to include long sequences, or runs, of zeros. The new coding method uses prefixfree codes for the nonnegative integers as part of an adaptive algorithm for compressing the quantized wavelet-transformed data by run-length coding. In the form of run-length coding used here, the data sequence to be encoded is parsed into strings consisting of some number (possibly 0) of zeros, followed by a nonzero value. The nonzero value and the length of the run of zeros are encoded. For a data stream that contains a sufficiently high frequency of zeros, this method is known to be more effective than using a single variable length code to encode each symbol. The specific prefix-free codes used are from two classes of variable-length codes: a class known as Golomb codes, and a class known as exponential-Golomb codes. The codes within each class are indexed by a single integer parameter. The present method uses exponential-Golomb codes for the lengths of the runs of zeros, and Golomb codes for the nonzero values. The code parameters within each code class are determined adaptively on the fly as compression proceeds, on the basis of statistics from previously encoded values. In particular, a simple adaptive method has been devised to select the parameter identifying the particular exponential-Golomb code to use. The method tracks the average number of bits used to encode recent runlengths, and takes the difference between this average length and the code parameter. When this difference falls outside a fixed range, the code parameter is updated (increased or decreased). The Golomb code parameter is selected based on the average magnitude of recently encoded nonzero samples. The coding method requires no floating- point operations, and more readily adapts to local statistics than other methods. The method can also accommodate arbitrarily large input values and arbitrarily long runs of zeros. In practice, this means that changes in the dynamic range or size of the input data set would not require a change to the compressor. The algorithm has been tested in computational experiments on test images. A comparison with a previously developed algorithm that uses large code tables (generated via Huffman coding on training data) suggests that the data-compression effectiveness of the present algorithm is comparable to the best performance achievable by the previously developed algorithm.

Kiely, Aaron↗

Exploiting stochastic locality in lattice QCD: hadronic observables and their uncertainties

Abstract Because of the mass gap, lattice QCD simulations exhibit stochastic locality: distant regions of the lattice fluctuate independently. There is a long history of exploiting this to increase statistics by obtaining multiple spatially-separated samples from each gauge field; in the extreme case, we arrive at the master-field approach in which a single gauge field is used. Here we develop techniques for studying hadronic observables using position-space correlators, which are more localized, and compare with the standard time-momentum representation. We also adapt methods for estimating the variance of an observable from autocorrelated Monte Carlo samples to the case of correlated spatially-separated samples.

Physics↗

Adaptive X-ray imaging with reinforcement learning

X-ray imaging is a powerful technique to scan samples in a variety of contexts including biological, environmental and materials science, but commonly requires a synchrotron light source to produce X-rays at sufficient intensity. As these facilities are expensive to operate, the available beam time is limited and always in high demand. Particularly if the illuminated samples are sparse, standard raster scanning methods can be time-consuming, with a majority of that time being spent on areas of the image that carry little information. To increase the efficiency and maximize the information gain for a given time budget, we split the scanning process into a series of steps where previous measurements are used to inform the decision making and adapt the exposure distribution at later stages of the sequence. We formulate this task as a reinforcement learning problem where the goal is to produce a sequence of exposure maps that maximize a predefined scalar metric. We demonstrate the potential of this approach in simulations where the adaptive illumination can accelerate the measurement process by up to an order of magnitude compared with standard raster scanning. Finally, we present the first results from deploying the trained agents on an X-ray fluorescence beamline at the Stanford Synchrotron Radiation Lightsource.

Reinforcement Learning↗

In situ Stripline Electrochemical NMR for Batteries

Here, there exist some long outstanding technical challenges that continue to be of hindrance to fully harnessing the unique investigative advantages of nuclear magnetic resonance (NMR) spectroscopy in the in situ investigation of rechargeable battery chemistry. For instance, the conducting materials and circuitry necessary for an operational battery always deteriorate the coil–based NMR sensitivity when placed inside the coil, and the shape mismatch between them leads to low sample filling factors and even higher detection limits. We report herein a novel and successful adaptation of stripline NMR detection that integrates seamlessly the NMR detection with construction of an electro–chemical device in general (or a battery in particular) which leads to a technique with much higher detection sensitivity, higher sample filling factors, and which is particularly suitable for mass–limited samples.

25 ENERGY STORAGE↗

A search for moderate-redshift survivors from the population of luminous compact passive galaxies at high redshift

From a search of a ∼2400 deg{sup 2} region covered by both the Sloan Digital Sky Survey and UKIRT Infrared Deep Sky Survey databases, we have attempted to identify galaxies at z ∼ 0.5 that are consistent with their being essentially unmodified examples of the luminous passive compact galaxies found at z ∼ 2.5. After isolating good candidates via deeper imaging, we further refine the sample with Keck moderate-resolution spectroscopy and laser guide star adaptive-optics imaging. For four of the five galaxies that so far remain after passing through this sieve, we analyze plausible star-formation histories based on our spectra in order to identify galaxies that may have survived with little modification from the population formed at high redshift. We find two galaxies that are consistent with having formed ≳ 95% of their mass at z > 5. We attempt to estimate masses both from our stellar population determinations and from velocity dispersions. Given the high frequency of small axial ratios, both in our small sample and among samples found at high redshifts, we tentatively suggest that some of the more extreme examples of passive compact galaxies may have prolate morphologies.

79 ASTRONOMY AND ASTROPHYSICS↗

TH-E-17A-06: Anatomical-Adaptive Compressed Sensing (AACS) Reconstruction for Thoracic 4-Dimensional Cone-Beam CT

Purpose: The Feldkamp-Davis-Kress (FDK) algorithm currently used for clinical thoracic 4-dimensional (4D) cone-beam CT (CBCT) reconstruction suffers from noise and streaking artifacts due to projection under-sampling. Compressed sensing theory enables reconstruction of under-sampled datasets via total-variation (TV) minimization, but TV-minimization algorithms such as adaptive-steepest-descent-projection-onto-convex-sets (ASD-POCS) often converge slowly and are prone to over-smoothing anatomical details. These disadvantages can be overcome by incorporating general anatomical knowledge via anatomy segmentation. Based on this concept, we have developed an anatomical-adaptive compressed sensing (AACS) algorithm for thoracic 4D-CBCT reconstruction. Methods: AACS is based on the ASD-POCS framework, where each iteration consists of a TV-minimization step and a data fidelity constraint step. Prior to every AACS iteration, four major thoracic anatomical structures - soft tissue, lungs, bony anatomy, and pulmonary details - were segmented from the updated solution image. Based on the segmentation, an anatomical-adaptive weighting was applied to the TV-minimization step, so that TV-minimization was enhanced at noisy/streaky regions and suppressed at anatomical structures of interest. The image quality and convergence speed of AACS was compared to conventional ASD-POCS using an XCAT digital phantom and a patient scan. Results: For the XCAT phantom, the AACS image represented the ground truth better than the ASD-POCS image, giving a higher structural similarity index (0.93 vs. 0.84) and lower absolute difference (1.1*10{sup 4} vs. 1.4*10{sup 4}). For the patient case, while both algorithms resulted in much less noise and streaking than FDK, the AACS image showed considerably better contrast and sharpness of the vessels, tumor, and fiducial marker than the ASD-POCS image. In addition, AACS converged over 50% faster than ASD-POCS in both cases. Conclusions: The proposed AACS algorithm was shown to reconstruct thoracic 4D-CBCT images more accurately and with faster convergence compared to ASD-POCS. The superior image quality and rapid convergence makes AACS promising for future clinical use.

60 APPLIED LIFE SCIENCES↗

Adaptively pointing spaceborne radar for precipitation measurements

An auxiliary concept of adaptive pointing is presented as an aid to space-based measurements of precipitation using microwave radar. It is recommended that the instantaneous field of view (IFOV) be limited to cloudy regions of possible precipitation rather than scanning clear-sky areas of no interest. A microwave imager is proposed for scanning ahead of the satellite in order to identify areas of precipitation, and then an on-board antenna controller can reposition the scanning antenna to obtain reflectivities for use in rainfall-reflectivity relationships. The precursor beam could delineate the storm boundaries and determine points of peak intensity which can then be selectively sampled to find the rainfall rate distribution for the storm. The adaptive-beam system is suggested to be implementable using an IR sensor on-board geosynchronous satellites.

Atlas, D.↗

The case for planetary sample return missions. 2. History of Mars

Principal science goals for exploration of Mars are to establish the chemical, isotopic, and physical state of Martian material, the nature of major surface-forming processes and their time scales, and the past and present biological potential of the planet. Many of those goals can only be met by detailed analyses of atmospheric gases and carefully selected samples of fresh rocks, weathered rocks, soils, sediments, and ices. The high-fidelity mineral separations, complex chemical treatments, and ultrasensitive instrument systems required for key measurements, as well as the need to adapt analytical strategies to unanticipated results, point to Earth-based laboratory analyses on returned Martian samples as the best means for meeting the stated objectives.

NASA Center ARC↗

SEARCHING FOR BINARY Y DWARFS WITH THE GEMINI MULTI-CONJUGATE ADAPTIVE OPTICS SYSTEM (GeMS)

The NASA Wide-field Infrared Survey Explorer (WISE) has discovered almost all the known members of the new class of Y-type brown dwarfs. Most of these Y dwarfs have been identified as isolated objects in the field. It is known that binaries with L- and T-type brown dwarf primaries are less prevalent than either M-dwarf or solar-type primaries, they tend to have smaller separations and are more frequently detected in near-equal mass configurations. The binary statistics for Y-type brown dwarfs, however, are sparse, and so it is unclear if the same trends that hold for L- and T-type brown dwarfs also hold for Y-type ones. In addition, the detection of binary companions to very cool Y dwarfs may well be the best means available for discovering even colder objects. We present results for binary properties of a sample of five WISE Y dwarfs with the Gemini Multi-Conjugate Adaptive Optics System. We find no evidence for binary companions in these data, which suggests these systems are not equal-luminosity (or equal-mass) binaries with separations larger than ∼0.5–1.9 AU. For equal-mass binaries at an age of 5 Gyr, we find that the binary binding energies ruled out by our observations (i.e., 10{sup 42} erg) are consistent with those observed in previous studies of hotter ultra-cool dwarfs.

79 ASTRONOMY AND ASTROPHYSICS↗

An adaptive Hessian approximated stochastic gradient MCMC method

Bayesian approaches have been successfully integrated into training deep neural networks. One popular family is stochastic gradient Markov chain Monte Carlo methods (SG-MCMC), which have gained increasing interest due to their ability to handle large datasets and the potential to avoid overfitting. Although standard SG-MCMC methods have shown great performance in a variety of problems, they may be inefficient when the random variables in the target posterior densities have scale differences or are highly correlated. Here, we present an adaptive Hessian approximated stochastic gradient MCMC method to incorporate local geometric information while sampling from the posterior. The idea is to apply stochastic approximation (SA) to sequentially update a preconditioning matrix at each iteration. The preconditioner possesses second-order information and can guide the random walk of a sampler efficiently. Instead of computing and saving the full Hessian of the log posterior, we use limited memory of the samples and their stochastic gradients to approximate the inverse Hessian-vector multiplication in the updating formula. Moreover, by smoothly optimizing the preconditioning matrix via SA, our proposed algorithm can asymptotically converge to the target distribution with a controllable bias under mild conditions. To reduce the training and testing computational burden, we adopt a magnitude-based weight pruning method to enforce the sparsity of the network. Our method is user-friendly and demonstrates better learning results compared to standard SG-MCMC updating rules. The approximation of inverse Hessian alleviates storage and computational complexities for large dimensional models. Numerical experiments are performed on several problems, including sampling from 2D correlated distribution, synthetic regression problems, and learning the numerical solutions of heterogeneous elliptic PDE. The numerical results demonstrate great improvement in both the convergence rate and accuracy.

97 MATHEMATICS AND COMPUTING↗

SU-E-J-127: Implementation of An Online Replanning Tool for VMAT Using Flattening Filter-Free Beams

Purpose: This is to report the implementation of an online replanning tool based on segment aperture morphing (SAM) for VMAT with flattening filter free (FFF) beams. Methods: Previously reported SAM algorithm modified to accommodate VMAT with FFF beams was implemented in a tool that was interfaced with a treatment planning system (Monaco, Elekta). The tool allows (1) to output the beam parameters of the original VMAT plan from Monaco, and (2) to input the apertures generated from the SAM algorithm into Monaco for the dose calculation on daily CT/CBCT/MRI in the following steps:(1) Quickly generating target contour based on the image of the day, using an auto-segmentation tool (ADMIRE, Elekta) with manual editing if necessary; (2) Morphing apertures based on the SAM in the original VMAT plan to account for the interfractional change of the target from the planning to the daily images; (3) Calculating dose distribution for new apertures with the same numbers of MU as in the original plan; (4) Transferring the new plan into a record & verify system (MOSAIQ, Elekta); (5) Performing a pre-delivery QA based on software; (6) Delivering the adaptive plan for the fraction.This workflow was implemented on a 16-CPU (2.6 GHz dual-core) hardware with GPU and was tested for sample cases of prostate, pancreas and lung tumors. Results: The online replanning process can be completed within 10 minutes. The adaptive plans generally have improved the plan quality when compared to the IGRT repositioning plans. The adaptive plans with FFF beams have better normal tissue sparing as compared with those of FF beams. Conclusion: The online replanning tool based on SAM can quickly generate adaptive VMAT plans using FFF beams with improved plan quality than those from the IGRT repositioning plans based on daily CT/CBCT/MRI and can be used clinically. This research was supported by Elekta Inc. (Crawley, UK)

60 APPLIED LIFE SCIENCES↗

Enhancing adaptive sparse grid approximations and improving refinement strategies using adjoint-based a posteriori error estimates

In this paper we present an algorithm for adaptive sparse grid approximations of quantities of interest computed from discretized partial differential equations. We use adjoint-based a posteriori error estimates of the physical discretization error and the interpolation error in the sparse grid to enhance the sparse grid approximation and to drive adaptivity of the sparse grid. Utilizing these error estimates provides significantly more accurate functional values for random samples of the sparse grid approximation. We also demonstrate that alternative refinement strategies based upon a posteriori error estimates can lead to further increases in accuracy in the approximation over traditional hierarchical surplus based strategies. Throughout this paper we also provide and test a framework for balancing the physical discretization error with the stochastic interpolation error of the enhanced sparse grid approximation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Application of an Evolutionary Algorithm for Parameter Optimization in a Gully Erosion Model

Herein we demonstrate how to use model optimization to determine a set of best-fit parameters for a landform model simulating gully incision and headcut retreat. To achieve this result we employed the Covariance Matrix Adaptation Evolution Strategy (CMA-ES), an iterative process in which samples are created based on a distribution of parameter values that evolve over time to better fit an objective function. CMA-ES efficiently finds optimal parameters, even with high-dimensional objective functions that are non-convex, multimodal, and non-separable. We ran model instances in parallel on a high-performance cluster, and from hundreds of model runs we obtained the best parameter choices. This method is far superior to brute-force search algorithms, and has great potential for many applications in earth science modeling. We found that parameters representing boundary conditions tended to converge toward an optimal single value, whereas parameters controlling geomorphic processes are defined by a range of optimal values.

97 MATHEMATICS AND COMPUTING↗

Note: A method for minimizing oxide formation during elevated temperature nanoindentation

A standardized method to protect metallic samples and minimize oxide formation during elevated-temperature nanoindentation was adapted to a commercial instrument. Nanoindentation was performed on Al (100), Cu (100), and W (100) single crystals submerged in vacuum oil at 200 °C, while the surface morphology and oxidation was carefully monitored using atomic force microscopy (AFM) and X-ray photoelectron spectroscopy (XPS). The results were compared to room temperature and 200 °C nanoindentation tests performed without oil, in order to evaluate the feasibility of using the oil as a protective medium. Extensive surface characterization demonstrated that this methodology is effective for nanoscale testing.

36 MATERIALS SCIENCE↗