Search NASA⌕ Search

SEARCH · Search NASA

Results for “sampling algorithms”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 631 records · Page 35

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↗

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↗

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↗

Exploring finite temperature properties of materials with quantum computers

Abstract Thermal properties of nanomaterials are crucial to not only improving our fundamental understanding of condensed matter systems, but also to developing novel materials for applications spanning research and industry. Since quantum effects arise at the nano-scale, these systems are difficult to simulate on classical computers. Quantum computers can efficiently simulate quantum many-body systems, yet current quantum algorithms for calculating thermal properties of these systems incur significant computational costs in that they either prepare the full thermal state on the quantum computer, or they must sample a number of pure states from a distribution that grows with system size. Canonical thermal pure quantum (TPQ) states provide a promising path to estimating thermal properties of quantum materials as they neither require preparation of the full thermal state nor require a growing number of samples with system size. Here, we present an algorithm for preparing canonical TPQ states on quantum computers. We compare three different circuit implementations for the algorithm and demonstrate their capabilities in estimating thermal properties of quantum materials. Due to its increasing accuracy with system size and flexibility in implementation, we anticipate that this method will enable finite temperature explorations of relevant quantum materials on near-term quantum computers.

36 MATERIALS SCIENCE↗

Time-Localization of Forced Oscillations in Power Systems

In power systems forced oscillations occur, and identification of these oscillations is important for the proper operation of the system. Two of the parameters of interest in analyzing and addressing forced oscillations are the starting and ending points. To obtain estimates of these parameters, this paper proposes a time-localization algorithm based on the geometric analysis of the sample cross-correlation between the measured data and a complex sinusoid at the frequency of the forced oscillation. Results from simulated and measured synchrophasor data demonstrate the algorithm's ability to accurately estimate the starting and ending points of forced oscillations.

Forced oscillatitons, synchrophasors, power system↗

Impacts of advanced diesel combustion operation and fuel formulation on soot nanostructure and reactivity

Advanced diesel combustion, accomplished via a single pulse fuel injection and high levels of exhaust gas recirculation (referred to as “PCCI”, partially-premixed charge compression ignition), is shown to be a path to reduce oxides of nitrogen and particulate matter simultaneously. This is well established in the literature. Less established is the extent to which such dilute combustion processes influence soot formation and affect soot that is emitted from diesel engines under such combustion modes. This work focuses on characterization of the nanostructure and oxidative reactivity of soot generated by a light-duty turbodiesel engine operating under a PCCI combustion mode, a dilute, low-temperature combustion process. Previous work on a type of PCCI combustion, referred to as high-efficiency clean combustion (HECC), showed soot samples having a fullerenic nanostructure, characterized by high levels of tortuosity of the fringe layers as seen in transmission electron micrograph images and as quantified using an image processing algorithm. Thermogravimetric analysis of the HECC mode soot samples showed that they displayed higher rates of oxidation than soot samples from a conventional diesel combustion mode. The present work returns to PCCI combustion, considering the timing of the main fuel injection, and the effects of operating on fuels rich in n-alkanes, particularly a fuel produced from a low temperature Fischer-Tropsch process (LTFT) and a renewable diesel fuel (RD) produced via hydrodeoxygenation of a plant oil. PCCI combustion conditions yield soot that shows higher reactivity compared to soot from the conventional combustion mode regardless of fuel type. LTFT and RD fuels produce soots with lower reactivity compared to ULSD. Soots produced from PCCI combustion have higher surface oxygen concentration and higher proportion of amorphous carbon. In addition, TEM images show that PCCI soots from all three fuels have smaller primary particle and particle aggregate sizes, and smaller graphene layers. These properties explain the higher reactivity of soot from PCCI combustion. The less reactive soots, which are produced from LTFT and RD fuel under conventional combustion, show internal burning during oxidation. However, soots with higher reactivity which are produced from late injection PCCI combustion and ULSD show shrinking core oxidation, most likely because of their overall amorphous structure.

42 ENGINEERING↗

A multi-objective optimization approach to optimal sensor location problem in $\mathrm{IGCC}$ power plants

Integrated Gasification Combined Cycle (IGCC) power plants provide a cleaner and more efficient way to obtain energy from coal. In order to operate an IGCC power plant in a safe and stable manner, several input and output process parameters need to be monitored. However, due to economic and operational constraints, it is infeasible to place sensors at every input and output process parameter location. Hence, it becomes important to select the most effective sensor locations which lead to maximum information gain about the plant conditions. Practical issues present in an IGCC power plant, such as harsh physical conditions and variability in process parameters, make the optimal sensor location problem an especially complicated one. Further, sensors can have multiple objectives and they can produce uncertainties due to measurement errors. Here this work considers hybrid hardware and virtual sensing for advanced power systems with multiple objectives. In order to solve this real world large scale problem, we use a novel algorithm called Better Optimization of Nonlinear Uncertain Systems (BONUS). BONUS works in probability distribution space and avoids sampling for each optimization and derivative calculations iterations. A new algorithm for multi-objective optimization is also developed specifically for problem. The result of this nonlinear stochastic multi-objective problem is the non-dominated, or Pareto set, which provides trade-offs between various objectives like observability, cost, and thermal efficiency. This is the first attempt at solving the problem of optimal sensor deployment in advanced power plants, with consideration of hybrid hardware and virtual sensing and incorporation of uncertainty with multiple objectives.

01 COAL, LIGNITE, AND PEAT↗

Compressively sensed complex networks.

The aim of this project is to develop low dimension parametric (deterministic) models of complex networks, to use compressive sensing (CS) and multiscale analysis to do so and to exploit the structure of complex networks (some are self-similar under coarsening). CS provides a new way of sampling and reconstructing networks. The approach is based on multiresolution decomposition of the adjacency matrix and its efficient sampling. It requires preprocessing of the adjacency matrix to make it 'blocky' which is the biggest (combinatorial) algorithm challenge. Current CS reconstruction algorithm makes no use of the structure of a graph, its very general (and so not very efficient/customized). Other model-based CS techniques exist, but not yet adapted to networks. Obvious starting point for future work is to increase the efficiency of reconstruction.

99 GENERAL AND MISCELLANEOUS↗

Dynamically-Spaced Geo-Grid Segmentation for Weighted Point Sampling on a Polygon Map Layer

Geo-grid algorithms divide a large polygon area into several smaller polygons, which are important for studying or executing a set of operations on underlying topological features of a map. The current geo-grid algorithms divide a large polygon in to a set of smaller but equal size polygons only (e.g. is ArcMaps Fishnet). The time to create a geo-grid is typically proportional to number of smaller polygons created. This raises two problems - (i) They cannot skip unwanted areas (such as water bodies, given about 71% percent of the Earth's surface is water-covered); (ii) They are incognizant to any underlying feature set that requires more deliberation. In this work, we propose a novel dynamically spaced geo-grid segmentation algorithm that overcomes these challenges and provides a computationally optimal output for borderline cases of an uneven polygon. Our method uses an underlying topological feature of population distributions, from the LandScan Global 2016 dataset, for creating grids as a function of these weighted features. We benchmark our results against available algorithms and found our approach improves geo-grid creation. Later on, we demonstrate the proposed approach is more effective in harvesting Points of Interest data from a crowd-sourced platform.

Sims, Kelly↗

Restricted Boltzmann Machines for galaxy morphology classification with a quantum annealer

We present the application of Restricted Boltzmann Machines (RBMs) to the task of astronomical image classification using a quantum annealer built by D-Wave Systems. Morphological analysis of galaxies provides critical information for studying their formation and evolution across cosmic time scales. We compress the images using principal component analysis to fit a representation on the quantum hardware. Then, we train RBMs with discriminative and generative algorithms, including contrastive divergence and hybrid generative-discriminative approaches. We compare these methods to Quantum Annealing (QA), Markov Chain Monte Carlo (MCMC) Gibbs Sampling, Simulated Annealing (SA) as well as machine learning algorithms like gradient boosted decision trees. We find that RBMs implemented on D-wave hardware perform well, and that they show some classification performance advantages on small datasets, but they don't offer a broadly strategic advantage for this task. During this exploration, we analyzed the steps required for Boltzmann sampling with the D-Wave 2000Q, including a study of temperature estimation, and examined the impact of qubit noise by comparing and contrasting the original D-Wave 2000Q to the lower-noise version recently made available. While these analyses ultimately had minimal impact on the performance of the RBMs, we include them for reference.

79 ASTRONOMY AND ASTROPHYSICS↗