Search NASA⌕ Search

SEARCH · Search NASA

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 253 records · Page 14

Multiclass Continuous Correspondence Learning

We extend the Structural Correspondence Learning (SCL) domain adaptation algorithm of Blitzer er al. to the realm of continuous signals. Given a set of labeled examples belonging to a 'source' domain, we select a set of unlabeled examples in a related 'target' domain that play similar roles in both domains. Using these 'pivot samples, we map both domains into a common feature space, allowing us to adapt a classifier trained on source examples to classify target examples. We show that when between-class distances are relatively preserved across domains, we can automatically select target pivots to bring the domains into correspondence.

correspondence learning↗

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↗

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↗

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↗

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↗

GalaxyFlow: upsampling hydrodynamical simulations for realistic mock stellar catalogues

ABSTRACT Cosmological N-body simulations of galaxies operate at the level of ‘star particles’ with a mass resolution on the scale of thousands of solar masses. Turning these simulations into stellar mock catalogues requires ‘upsampling’ the star particles into individual stars following the same phase-space density. In this paper, we introduce two new upsampling methods. First, we describe GalaxyFlow, a sophisticated upsampling method that utilizes normalizing flows to both estimate the stellar phase-space density and sample from it. Secondly, we improve on existing upsamplers based on adaptive kernel density estimation (KDE), using maximum likelihood estimation to fine-tune the bandwidth for such algorithms in a way that improves both the density estimation accuracy and upsampling results. We demonstrate our upsampling techniques on a neighbourhood of the Solar location in two simulated galaxies: Auriga 6 and h277. Both yield smooth stellar distributions that closely resemble the stellar densities seen in the Gaia DR3 catalogue. Furthermore, we introduce a novel multimodel classifier test to compare the accuracy of different upsampling methods quantitatively. This test confirms that GalaxyFlow more accurately estimates the density of the underlying star particles than methods based on KDE, at the cost of being more computationally intensive.

Lim, Sung Hak (ORCID:0000000330981092)↗

High Throughput Genome Releaser

In this study, we present the development of a High Throughput Genome Releaser, an innovative device addressing common challenges in screening PCR. This genome DNA releaser is designed for rapid, cost-effective, and efficient DNA extraction, optimized for subsequent PCR reactions. Our experimentation with various synthetic materials led us to select a particular type of plastic that mirrors the properties of glass cover slides, providing a smooth surface and effective compression capabilities. We engineered a 96-well device equipped with a 96-well plate and a top rod, operable both manually and automatically, which is compatible with widely used liquid-handling robot decks. This compatibility enhances ease of use in high-throughput PCR setups. Additionally, we developed software to support its automatic functions. The genome releaser facilitates the extraction of PCR-amplifiable genomic DNA from 96 samples within minutes, eliminates the need for extraction buffers, and is adaptable to a wide range of microorganisms and cells. This versatility could significantly advance biomanufacturing processes.

42 ENGINEERING↗

An Innovative High Throughput Genome Releaser for Rapid and Efficient PCR Screening

High-throughput PCR screening is vital in synthetic biology and metabolic engineering as it allows researchers to rapidly analyze and detect numerous targeted genetic mutation in the genome. Current challenges for high-throughput PCR screening in synthetic biology include efficiently preparing genomic DNA, optimizing protocols for diverse sample types, managing contamination risks, and effectively analyzing the large volumes of data generated while ensuring consistent and accurate results. In this study, we present the development of a High Throughput Genome Releaser (HTGR), an innovative device addressing common challenges in screening PCR. This genome DNA releaser is designed based on a squash method for rapid, cost-effective, and efficient DNA release, optimized for subsequent PCR reactions. After experimenting with various synthetic materials, we selected a plastic that closely replicates the smooth surface and compression properties of microscope slides, ensuring reliable performance. We engineered a device featuring a 96-Well Plate and a shear applicator, operable both manually and automatically, and compatible with standard liquid-handling robot platform. This compatibility enhances ease of use in high-throughput PCR workflows. Additionally, we developed software to support its automatic functions. Our results demonstrated that the specially engineered 96-Well Plate and HTGR can effectively squash fungal spores , which release enough genome DNA for PCR screening. The genome releaser facilitates the preparation of PCR-amplifiable genomic DNA substrate from 96 samples within minutes, eliminates the need for extraction buffers, and is adaptable to a wide range of microorganisms and cells, which could significantly advance biomanufacturing processes.

Yuan, Guoliang [BATTELLE (PACIFIC NW LAB)]↗

ALLMAG, GDALMG, LINTRA: Computer programs for geomagnetic field and field-line calculations

A set of computer programs has been developed for the calculation of the geomagnetic field and the tracing of field lines in space. The basic subroutine, geocentric ALLMAG, contains coefficients for seven recently-published field models as built-in data statements. At execution time the user can vary the model and/or the time period by simply changing input parameters. Subroutine GDALMG is adapted for input and output in geodetic coordinates. ALLMAG and GDALMG are equivalent to Cain's FIELD and FIELDG, with the added flexibility of the choice of seven models. LINTRA traces field lines from any point in space to a specified altitude intersect in the same or opposite hemisphere, using any of the models contained in ALLMAG. Input is in either geocentric or geodetic coordinates, and output is returned in both. McIlwain's INVAR package, which calculates B and L, has been adapted to use ALLMAG. All programs are described in detail, and sample calculations are given.

Stassinopoulos, E. G.↗

A variable-step-size robust delta modulator.

Description of an analytically obtained optimum adaptive delta modulator-demodulator configuration. The device utilizes two past samples to obtain a step size which minimizes the mean square error for a Markov-Gaussian source. The optimum system is compared, using computer simulations, with a linear delta modulator and an enhanced Abate delta modulator. In addition, the performance is compared to the rate distortion bound for a Markov source. It is shown that the optimum delta modulator is neither quantization nor slope-overload limited. The highly nonlinear equations obtained for the optimum transmitter and receiver are approximated by piecewise-linear equations in order to obtain system equations which can be transformed into hardware. The derivation of the experimental system is presented.

Song, C. L.↗

Adaptable structural synthesis using advanced analysis and optimization coupled by a computer operating system

A finite element program is linked with a general purpose optimization program in a 'programing system' which includes user supplied codes that contain problem dependent formulations of the design variables, objective function and constraints. The result is a system adaptable to a wide spectrum of structural optimization problems. In a sample of numerical examples, the design variables are the cross-sectional dimensions and the parameters of overall shape geometry, constraints are applied to stresses, displacements, buckling and vibration characteristics, and structural mass is the objective function. Thin-walled, built-up structures and frameworks are included in the sample. Details of the system organization and characteristics of the component programs are given.

Sobieszczanski-Sobieski, J.↗

Fast Melting and Freezing for Microgravity Experiments

Commercial tube welders adapted to metallurgical research. Proposed furnace melts and resolidifies small metal samples during brief periods. In furnace, sample surrounded by large heat sinks and rapidly heated near midlength by intense source of heat. Furnace intended for use in experiments in microgravity: entire melting-and-freezing process requires less than 20 s of near weightlessness experienced in parabolic climb and dive of KC-135 airplane.

Poorman, Richard M.↗

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↗

Effects of guar gum and cellulose on glucose absorption, hormonal release and hepatic metabolism in the pig

Six Large White pigs (mean body-weight 59 (SE 1.7) kg) were surgically fitted with permanent catheters in the portal vein, the brachiocephalic artery and the right hepatic vein, as well as with electromagnetic flow probes around the portal vein and the hepatic artery, and allowed to recover. The non-anaesthetized animals were given a basal non-fibre diet (diet A) alone or together with 60 g guar gum/kg (diet B) or 150 g purified cellulose/kg (diet C) by substitution for mica. The diets were given for weekly periods and according to a replicated 3 x 3 Latin square design. On the last day of each such adaptation period, test meals of 800 g were given before blood sampling. Sampling was continued for 8 h. Guar gum strongly reduced glucose apparent absorption without changing the absorption and the hepatic uptake profiles. Production rates of insulin, gastric inhibitory polypeptide and insulin-like growth factor-1 (IGF-1) were lowest after guar gum ingestion. However, the reductions in peripheral blood insulin levels caused by guar gum were not associated with a change in hepatic insulin extraction. IGF-1 appeared to be strongly secreted by the gut, whereas the liver had a net uptake of the peptide. Ingestion of guar gum increased the hepatic extraction coefficient of gut-produced IGF-1. Guar gum ingestion appeared also to decrease glucagon secretion. Cellulose at the level consumed had very few effects on the variables considered. It is suggested that the modulation of intestinal mechanisms by guar gum was sufficient to mediate the metabolic effects described.

Cellulose/administration & dosage↗