Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 829 records · Page 46

An Algorithm for Detection of Ground and Canopy Cover in Micropulse Photon-Counting Lidar Altimeter Data in Preparation of the ICESat-2 Mission

The Ice, Cloud and Land Elevation Satellite-II (ICESat-2) mission has been selected by NASA as a Decadal Survey mission, to be launched in 2016. Mission objectives are to measure land ice elevation, sea ice freeboard/ thickness and changes in these variables and to collect measurements over vegetation that will facilitate determination of canopy height, with an accuracy that will allow prediction of future environmental changes and estimation of sea-level rise. The importance of the ICESat-2 project in estimation of biomass and carbon levels has increased substantially, following the recent cancellation of all other planned NASA missions with vegetation-surveying lidars. Two innovative components will characterize the ICESat-2 lidar: (1) Collection of elevation data by a multi-beam system and (2) application of micropulse lidar (photon counting) technology. A micropulse photon-counting altimeter yields clouds of discrete points, which result from returns of individual photons, and hence new data analysis techniques are required for elevation determination and association of returned points to reflectors of interest including canopy and ground in forested areas. The objective of this paper is to derive and validate an algorithm that allows detection of ground under dense canopy and identification of ground and canopy levels in simulated ICESat-2-type data. Data are based on airborne observations with a Sigma Space micropulse lidar and vary with respect to signal strength, noise levels, photon sampling options and other properties. A mathematical algorithm is developed, using spatial statistical and discrete mathematical concepts, including radial basis functions, density measures, geometrical anisotropy, eigenvectors and geostatistical classification parameters and hyperparameters. Validation shows that the algorithm works very well and that ground and canopy elevation, and hence canopy height, can be expected to be observable with a high accuracy during the ICESat-2 mission. A result relevant for instrument design is that even the two weaker beam classes considered can be expected to yield useful results for vegetation measurements (93.01-99.57% correctly selected points for a beam with expected return of 0.93 mean signals per shot (msp9) and 72.85% - 98.68% for 0.48 msp (msp4)). Resampling options affect results more than noise levels. The algorithm derived here is generally applicable for analysis of micropulse lidar altimeter data collected over forested areas as well as other surfaces, including land ice, sea ice and land surfaces.

Herzfeld, Ute C.↗

Sampling-based Sublinear Low-rank Matrix Arithmetic Framework for Dequantizing Quantum Machine Learning

We present an algorithmic framework for quantum-inspired classical algorithms on close-to-low-rank matrices, generalizing the series of results started by Tang’s breakthrough quantum-inspired algorithm for recommendation systems [STOC’19]. Motivated by quantum linear algebra algorithms and the quantum singular value transformation (SVT) framework of Gilyén et al. [STOC’19], we develop classical algorithms for SVT that run in time independent of input dimension, under suitable quantum-inspired sampling assumptions. Our results give compelling evidence that in the corresponding QRAM data structure input model, quantum SVT does not yield exponential quantum speedups. Since the quantum SVT framework generalizes essentially all known techniques for quantum linear algebra, our results, combined with sampling lemmas from previous work, suffice to generalize all prior results about dequantizing quantum machine learning algorithms. In particular, our classical SVT framework recovers and often improves the dequantization results on recommendation systems, principal component analysis, supervised clustering, support vector machines, low-rank regression, and semidefinite program solving. We also give additional dequantization results on low-rank Hamiltonian simulation and discriminant analysis. Our improvements come from identifying the key feature of the quantum-inspired input model that is at the core of all prior quantum-inspired results: ℓ 2 -norm sampling can approximate matrix products in time independent of their dimension. We reduce all our main results to this fact, making our exposition concise, self-contained, and intuitive.

Computer Science↗

Do Epistemic Uncertainties Allow for Replacing Microstructural Experiments with Reconstruction Algorithms?

A novel problem in computational materials modeling is addressed: “Are the computational microstructure reconstruction techniques reliable enough to replace experiments?” Here, “reliable” computations are associated with producing “expected” reconstructions that are adequately close to the experimental data. The output of computational techniques can deviate from the experimental measurements because of the epistemic uncertainties in the algorithms. In this work, an analytical formulation for quantification of epistemic uncertainties in a microstructure reconstruction algorithm based on Markov random field is presented. The method is used to predict the large-scale spatial distribution of a microstructure given an experimental input measured over a small spatial domain. However, small variations are observed on the microstructural features of the synthesized samples due to the Markov random field algorithm. The proposed analytical technique aims to quantify these uncertainties and estimate their propagation to the macroscale material properties to provide a significant understanding on how reliable it is to replace the experiments with the Markov random field model to predict microstructural maps over large spatial domains.

97 MATHEMATICS AND COMPUTING↗

Nonlinear, noniterative, single-distance phase retrieval and developmental biology

For coherent X-ray imaging, based on phase contrast through free-space Fresnel propagation, we discuss two noniterative, nonlinear approaches to the phase-retrieval problem from a single-distance intensity map of a pure-phase object. On one hand, a perturbative set-up is proposed where nonlinear corrections to the linearized transport-of-intensity situation are expanded in powers of the object-detector distance z and are evaluated in terms of the linear estimate. On the other hand, a nonperturbative projection algorithm, which is based on the (linear and local) contrast-transfer function (CTF), works with an effective phase in Fourier space. This effective phase obeys a modified CTF relation between intensity contrast at z > 0 and phase contrast at z= 0: Unphysical singularities of the local CTF model are cut off to yield 'quasiparticles' in analogy to the theory of the Fermi liquid. By identifying the positions of the zeros of the Fourier transformed intensity contrast as order parameters for the dynamical breaking of scaling symmetry we investigate the phase structure of the forward-propagation problem when interpreted as a statistical system. Results justify the quasiparticle approach for a wide range of intermediary phase variations. The latter algorithm is applied to data from biological samples recorded at the beamlines TopoTomo and ID19 at ANKA and ESRF, respectively.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

A Hybrid Semi-supervised Classification Scheme for Mining Multisource Geospatial Data

Supervised learning methods such as Maximum Likelihood (ML) are often used in land cover (thematic) classification of remote sensing imagery. ML classifier relies exclusively on spectral characteristics of thematic classes whose statistical distributions (class conditional probability densities) are often overlapping. The spectral response distributions of thematic classes are dependent on many factors including elevation, soil types, and ecological zones. A second problem with statistical classifiers is the requirement of large number of accurate training samples (10 to 30 |dimensions|), which are often costly and time consuming to acquire over large geographic regions. With the increasing availability of geospatial databases, it is possible to exploit the knowledge derived from these ancillary datasets to improve classification accuracies even when the class distributions are highly overlapping. Likewise newer semi-supervised techniques can be adopted to improve the parameter estimates of statistical model by utilizing a large number of easily available unlabeled training samples. Unfortunately there is no convenient multivariate statistical model that can be employed for mulitsource geospatial databases. In this paper we present a hybrid semi-supervised learning algorithm that effectively exploits freely available unlabeled training samples from multispectral remote sensing images and also incorporates ancillary geospatial databases. We have conducted several experiments on real datasets, and our new hybrid approach shows over 25 to 35% improvement in overall classification accuracy over conventional classification schemes.

54 ENVIRONMENTAL SCIENCES↗

A Decision Theoretic Approach to Evaluate Radiation Detection Algorithms

There are a variety of sensor systems deployed at U.S. border crossings and ports of entry that scan for illicit nuclear material. In this work, we develop a framework for comparing the performance of detection algorithms that interpret the output of these scans and determine when secondary screening is needed. We optimize each algorithm to minimize its risk, or expected loss. We measure an algorithm’s risk by considering its performance over a sample, the probability distribution of threat sources, and the consequence of detection errors. While it is common to optimize algorithms by fixing one error rate and minimizing another, our framework allows one to simultaneously consider multiple types of detection errors. Our framework is flexible and easily adapted to many different assumptions regarding the probability of a vehicle containing illicit material, and the relative consequences of a false positive and false negative errors. Our methods can therefore inform decision makers of the algorithm family and parameter values which best reduce the threat from illicit nuclear material, given their understanding of the environment at any point in time. To illustrate the applicability of our methods, in this paper, we compare the risk from two families of detection algorithms and discuss the policy implications of our results.

Nobles, Mallory A.↗

Evaluating cosmological biases using photometric redshifts for Type Ia Supernova cosmology with the Dark Energy Survey Supernova Program

Cosmological analyses with Type Ia Supernovae (SNe Ia) have traditionally been reliant on spectroscopy for both classifying the type of supernova and obtaining reliable redshifts to measure the distance–redshift relation. While obtaining a host-galaxy spectroscopic redshift for most SNe is feasible for small-area transient surveys, it will be too resource intensive for upcoming large-area surveys such as the Vera Rubin Observatory Legacy Survey of Space and Time, which will observe on the order of millions of SNe. Here, we use data from the Dark Energy Survey (DES) to address this problem with photometric redshifts (photo-z) inferred directly from the SN light curve in combination with Gaussian and full p(z) priors from host-galaxy photo-z estimates. Using the DES 5-yr photometrically classified SN sample, we consider several photo-z algorithms as host-galaxy photo-z priors, including the Self-Organizing Map redshifts (SOMPZ), Bayesian Photometric Redshifts (BPZ), and Directional-Neighbourhood Fitting (DNF) redshift estimates employed in the DES 3 × 2 point analyses. With detailed catalogue-level simulations of the DES 5-yr sample, we find that the simulated w can be recovered within ±0.02 when using SN+SOMPZ or DNF prior photo-z, smaller than the average statistical uncertainty for these samples of 0.03. With data, we obtain biases in w consistent with simulations within ~1σ for three of the five photo-z variants. We further evaluate how photo-z systematics interplay with photometric classification and find classification introduces a subdominant systematic component. This work lays the foundation for next-generation fully photometric SNe Ia cosmological analyses.

(cosmology:) dark energy↗

Crystal structure solution from experimentally determined atomic pair distribution functions

An extension of the Liga algorithm for structure solution from atomic pair distribution functions (PDFs), to handle periodic crystal structures with multiple elements in the unit cell, is described. The procedure is performed in three separate steps. First, pair distances are extracted from the experimental PDF. In the second step the Liga algorithm is used to find unit-cell sites consistent with these pair distances. Finally, the atom species are assigned over the cell sites by minimizing the overlap of their empirical atomic radii. The procedure has been demonstrated on synchrotron X-ray PDF data from 16 test samples. The structure solution was successful for 14 samples, including cases with enlarged supercells. The algorithm success rate and the reasons for the failed cases are discussed, together with enhancements that should improve its convergence and usability.

36 MATERIALS SCIENCE↗

An Efficient Area-Based Algorithm for SAR Radiometric Terrain Correction and Map Projection

This article presents a projection algorithm based on the representation of radar samples as area elements, rather than point elements as traditionally done in previous works. Each area element in the geographic grid (geogrid) is associated with a set of samples in the radar grid that intersect completely or partially the area element according to the topography and the radar geometry. Accurate geocoding with adaptive multi-looking is achieved by successively assigning the weighted average of the radar samples to the corresponding geogrid elements. Analogously, the slant-range projection of geocoded data is improved by projecting the geogrid pixels onto the radar grid according to their projected area. When our slant-range projection approach is used within previously-published radiometric terrain correction (RTC) algorithms, the processing time is significantly reduced, performing 3.6 to 5.2 times faster over multi-looked data and up to 8.9 over single-look data. We demonstrate the strength of the area projection algorithm for RTC and geocoding using UAVSAR and Sentinel-1 data, and evaluate the results in the context of the upcoming NISAR mission.

Shiroma, Gustavo H↗

Trajectory Optimization via Unsupervised Probabilistic Learning On Manifolds

This report investigates the use of unsupervised probabilistic learning techniques for the analysis of hypersonic trajectories. The algorithm first extracts the intrinsic structure in the data via a diffusion map approach. Using the diffusion coordinates on the graph of training samples, the probabilistic framework augments the original data with samples that are statistically consistent with the original set. The augmented samples are then used to construct conditional statistics that are ultimately assembled in a path-planing algorithm. In this framework the controls are determined stage by stage during the flight to adapt to changing mission objectives in real-time. A 3DOF model was employed to generate optimal hypersonic trajectories that comprise the training datasets. The diffusion map algorithm identfied that data resides on manifolds of much lower dimensionality compared to the high-dimensional state space that describes each trajectory. In addition to the path-planing worflow we also propose an algorithm that utilizes the diffusion map coordinates along the manifold to label and possibly remove outlier samples from the training data. This algorithm can be used to both identify edge cases for further analysis as well as to remove them from the training set to create a more robust set of samples to be used for the path-planing process.

42 ENGINEERING↗

Cavity Control Algorithms

A LLRF system typically incorporates either a heterodyne or direct sampling technique, followed by fast ADCs, then an FPGA and finally a transmitting DAC. An ultra low jitter clock system (sub-picoseconds) is required for fast sampling ADCs/DACs to preserve necessary signal to noise ratio. As a result we have universal hardware able to accommodate a variety of firmware for the specific application. The cavity control algorithm, greatly released from hardware constraints, can be developed much faster for very specific and demanding requirements. Based on the type of the accelerator (Pulsed, CW) and nature of the cavity field disturbances ( Lorentz Forces, microphonics, helium drift, temperature drift, beam load etc.) one can select a suitable controller. A generic PID feedback mechanism may be the first and easiest choice for most cases, while Kalman filtering or Adaptive control require more involved system modeling, and extra computational effort. A pulse system usually requires an additional feed forward mechanism while for a CW machine an SEL (Self Excited Loop) can be an excellent approach. Selecting the correct gains for effective control can be challenging and it depends on the beam energy spread requirements, system stability and control system scheme ( I&Q, Amplitude & Phase, SEL). Finally, the computational capability of the FPGA allows it to incorporate digital signal processing (for instance CIC(Cascaded Integrator-Comb filter), tunable IIR) as well as CORDIC ( COordinate Rotation DIgital Computer) to calculate trigonometric quantities. In this talk, a summary of popular algorithms is presented along with an example of the Jefferson Lab 12 GeV cavity field control system.

Plawski, Tomasz↗

Efficiency in nonequilibrium molecular dynamics Monte Carlo simulations

Hybrid algorithms combining nonequilibrium molecular dynamics and Monte Carlo (neMD/MC) offer a powerful avenue for improving the sampling efficiency of computer simulations of complex systems. These neMD/MC algorithms are also increasingly finding use in applications where conventional approaches are impractical, such as constant-pH simulations with explicit solvent. However, selecting an optimal nonequilibrium protocol for maximum efficiency often represents a non-trivial challenge. This work evaluates the efficiency of a broad class of neMD/MC algorithms and protocols within the theoretical framework of linear response theory. The approximations are validated against constant pH-MD simulations and shown to provide accurate predictions of neMD/MC performance. An assessment of a large set of protocols confirms (both theoretically and empirically) that a linear work protocol gives the best neMD/MC performance. Lastly, a well-defined criterion for optimizing the time parameters of the protocol is proposed and demonstrated with an adaptive algorithm that improves the performance on-the-fly with minimal cost.

97 MATHEMATICS AND COMPUTING↗

Understanding the Effect of Sample Geometry on Temperature Distribution during Optical Floating Zone Crystal Growth in Vacuum Environment through Heat Transfer Modeling

Optical floating zone furnaces (OFZ) have had a transformative impact on fundamental science due to their ability to rapidly produce large single crystals of a wide variety of complex materials. However, a quantitative understanding of the OFZ growth environment is generally lacking due to the difficulty of measuring the local sample temperatures during OFZ growth, as well as to the general lack of information about the temperature-dependent physical parameters needed to model heat transfer. To overcome these challenges, we apply a physics-based heat transfer model, parametrized by measurements from synchrotron experiments and a machine-learning (ML) algorithm, to simulate the temperature distributions of samples heated in an OFZ furnace in a vacuum environment. This model is used to quantitatively understand how the sample maximum temperature and temperature gradient (key parameters that influence the success of crystal growth) are affected by the rod size, rod shape, and heat-zone position on the rod. The results of this study can be applied to make informed decisions on how crystal growth parameters can be tuned to modify temperature profiles and to optimize crystal growth outcomes even when data on internal sample temperature profiles (e.g., those obtained through in situ synchrotron experiments) are not accessible.

36 MATERIALS SCIENCE↗

Performance of Replica-Exchange Wang-Landau Sampling for the 2D Ising Model: A Brief Survey

We report a brief performance study of the replica-exchange Wang-Landau algorithm, a recently proposed parallel realization of Wang-Landau sampling, using the 2D Ising model as a test case. The simulation time is found to scale inversely with the square root of the number of subwindows (and thus number of processors) used to span the global parameter space. We also investigate the time profiles for random walkers in dierent subwindows to complete iterations, which will aid the development of and adaptive load-balancing scheme.

Zhao, Yiwei↗

QSO photometric redshifts using machine learning and neural networks

ABSTRACT The scientific value of the next generation of large continuum surveys would be greatly increased if the redshifts of the newly detected sources could be rapidly and reliably estimated. Given the observational expense of obtaining spectroscopic redshifts for the large number of new detections expected, there has been substantial recent work on using machine learning techniques to obtain photometric redshifts. Here, we compare the accuracy of the predicted photometric redshifts obtained from deep learning (DL) with the k-nearest neighbour (kNN) and the decision tree regression (DTR) algorithms. We find using a combination of near-infrared, visible, and ultraviolet magnitudes, trained upon a sample of Sloan Digital Sky Survey quasi-stellar objects, that the kNN and DL algorithms produce the best self-validation result with a standard deviation of σΔz = 0.24 (σΔz(norm) = 0.11). Testing on various subsamples, we find that the DL algorithm generally has lower values of σΔz, in addition to exhibiting a better performance in other measures. Our DL method, which uses an easy to implement off-the-shelf algorithm with neither filtering nor removal of outliers, performs similarly to other, more complex, algorithms, resulting in an accuracy of Δz < 0.1 up to z ∼ 2.5. Applying the DL algorithm trained on our 70 000 strong sample to other independent (radio-selected) data sets, we find σΔz ≤ 0.36 (σΔz(norm) ≤ 0.17) over a wide range of radio flux densities. This indicates much potential in using this method to determine photometric redshifts of quasars detected with the Square Kilometre Array.

Curran, S. J.↗

Improved assemblies using a source-agnostic pipeline for MetaGenomic Assembly by Merging (MeGAMerge) of contigs

Assembly of metagenomic samples is a very complex process, with algorithms designed to address sequencing platform-specific issues, (read length, data volume, and/or community complexity), while also faced with genomes that differ greatly in nucleotide compositional biases and in abundance. To address these issues, we have developed a post-assembly process: MetaGenomic Assembly by Merging (MeGAMerge). We compare this process to the performance of several assemblers, using both real, and in-silico generated samples of different community composition and complexity. MeGAMerge consistently outperforms individual assembly methods, producing larger contigs with an increased number of predicted genes, without replication of data. MeGAMerge contigs are supported by read mapping and contig alignment data, when using synthetically-derived and real metagenomic data, as well as by gene prediction analyses and similarity searches. Ultimately, MeGAMerge is a flexible method that generates improved metagenome assemblies, with the ability to accommodate upcoming sequencing platforms, as well as present and future assembly algorithms.

59 BASIC BIOLOGICAL SCIENCES↗

Utilization of Airborne and in Situ Data Obtained in SGP99, SMEX02, CLASIC and SMAPVEX08 Field Campaigns for SMAP Soil Moisture Algorithm Development and Validation

Field experiment data sets that include coincident remote sensing measurements and in situ sampling will be valuable in the development and validation of the soil moisture algorithms of the NASA's future SMAP (Soil Moisture Active and Passive) mission. This paper presents an overview of the field experiment data collected from SGP99, SMEX02, CLASIC and SMAPVEX08 campaigns. Common in these campaigns were observations of the airborne PALS (Passive and Active L- and S-band) instrument, which was developed to acquire radar and radiometer measurements at low frequencies. The combined set of the PALS measurements and ground truth obtained from all these campaigns was under study. The investigation shows that the data set contains a range of soil moisture values collected under a limited number of conditions. The quality of both PALS and ground truth data meets the needs of the SMAP algorithm development and validation. The data set has already made significant impact on the science behind SMAP mission. The areas where complementing of the data would be most beneficial are also discussed.

Soil moisture↗

Autoindexing the diffraction patterns from crystals with a pseudotranslation

Lattice patterns containing alternating strong and weak reflections can be identified by a targeted search for the weak signals, permitting a wider range of diffraction patterns to be indexed automatically. Rotation photographs can be readily indexed if enough candidate Bragg spots are identified to properly sample the reciprocal lattice. However, while automatic indexing algorithms are widely used for macromolecular data processing, they can produce incorrect results in special situations where a subset of Bragg spots is systematically overlooked. This is a potential outcome in cases where a noncrystallographic translational symmetry operator closely mimics an exact crystallographic translation. In these cases, a visual inspection of the diffraction image will reveal alternating strong and weak reflections. However, reliable detection of the weak-intensity reflections by software requires a systematic search for a diffraction signal targeted at specific reciprocal-space locations calculated a priori by considering all possible pseudotranslations. Care must be exercised to distinguish between true lattice diffraction and spurious signals contributed by neighboring overlapping Bragg spots, non-Bragg diffraction and noise. Such procedures have been implemented within the autoindexing program LABELIT and applied to known cases from publicly available data sets. Routine use of this type of signal search adds only a few seconds to the typical run time for autoindexing. The program can be downloaded from http://cci.lbl.gov/labelit.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗