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 487 records · Page 27

Design of Neural Networks for Fast Convergence and Accuracy

A novel procedure for the design and training of artificial neural networks, used for rapid and efficient controls and dynamics design and analysis for flexible space systems, has been developed. Artificial neural networks are employed to provide a means of evaluating the impact of design changes rapidly. Specifically, two-layer feedforward neural networks are designed to approximate the functional relationship between the component spacecraft design changes and measures of its performance. A training algorithm, based on statistical sampling theory, is presented, which guarantees that the trained networks provide a designer-specified degree of accuracy in mapping the functional relationship. Within each iteration of this statistical-based algorithm, a sequential design algorithm is used for the design and training of the feedforward network to provide rapid convergence to the network goals. Here, at each sequence a new network is trained to minimize the error of previous network. The design algorithm attempts to avoid the local minima phenomenon that hampers the traditional network training. A numerical example is performed on a spacecraft application in order to demonstrate the feasibility of the proposed approach.

Maghami, Peiman G.↗

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 sparse sampling schemes on image quality in low-dose CT

Purpose: Various scanning methods and image reconstruction algorithms are actively investigated for low-dose computed tomography (CT) that can potentially reduce a health-risk related to radiation dose. Particularly, compressive-sensing (CS) based algorithms have been successfully developed for reconstructing images from sparsely sampled data. Although these algorithms have shown promises in low-dose CT, it has not been studied how sparse sampling schemes affect image quality in CS-based image reconstruction. In this work, the authors present several sparse-sampling schemes for low-dose CT, quantitatively analyze their data property, and compare effects of the sampling schemes on the image quality.Methods: Data properties of several sampling schemes are analyzed with respect to the CS-based image reconstruction using two measures: sampling density and data incoherence. The authors present five different sparse sampling schemes, and simulated those schemes to achieve a targeted dose reduction. Dose reduction factors of about 75% and 87.5%, compared to a conventional scan, were tested. A fully sampled circular cone-beam CT data set was used as a reference, and sparse sampling has been realized numerically based on the CBCT data.Results: It is found that both sampling density and data incoherence affect the image quality in the CS-based reconstruction. Among the sampling schemes the authors investigated, the sparse-view, many-view undersampling (MVUS)-fine, and MVUS-moving cases have shown promising results. These sampling schemes produced images with similar image quality compared to the reference image and their structure similarity index values were higher than 0.92 in the mouse head scan with 75% dose reduction.Conclusions: The authors found that in CS-based image reconstructions both sampling density and data incoherence affect the image quality, and suggest that a sampling scheme should be devised and optimized by use of these indicators. With this strategic approach, one can acquire optimally sampled sparse data so that the CS-based algorithms can best perform in terms of image quality.

61 RADIATION PROTECTION AND DOSIMETRY↗

Sampling frequency thresholds for the quantum advantage of the quantum approximate optimization algorithm

We compare the performance of the Quantum Approximate Optimization Algorithm (QAOA) with state-of-the-art classical solvers Gurobi and MQLib to solve the MaxCut problem on 3-regular graphs. We identify the minimum noiseless sampling frequency and depth p required for a quantum device to outperform classical algorithms. There is potential for quantum advantage on hundreds of qubits and moderate depth with a sampling frequency of 10 kHz. We observe, however, that classical heuristic solvers are capable of producing high-quality approximate solutions in linear time complexity. In order to match this quality for large graph sizes N, a quantum device must support depth p > 11. Additionally, multi-shot QAOA is not efficient on large graphs, indicating that QAOA p ≤ 11 does not scale with N. These results limit achieving quantum advantage for QAOA MaxCut on 3-regular graphs. Other problems, such as different graphs, weighted MaxCut, and 3-SAT, may be better suited for achieving quantum advantage on near-term quantum devices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An algorithm for preferential selection of spectroscopic targets in LEGUE

We describe a general target selection algorithm that is applicable to any survey in which the number of available candidates is much larger than the number of objects to be observed. This routine aims to achieve a balance between a smoothly-varying, well-understood selection function and the desire to preferentially select certain types of targets. Some target-selection examples are shown that illustrate different possibilities of emphasis functions. Although it is generally applicable, the algorithm was developed specifically for the LAMOST Experiment for Galactic Understanding and Exploration (LEGUE) survey that will be carried out using the Chinese Guo Shou Jing Telescope. In particular, this algorithm was designed for the portion of LEGUE targeting the Galactic halo, in which we attempt to balance a variety of science goals that require stars at fainter magnitudes than can be completely sampled by LAMOST. This algorithm has been implemented for the halo portion of the LAMOST pilot survey, which began in October 2011.

79 ASTRONOMY AND ASTROPHYSICS↗

Determination of the Spectral Index in the Fission Spectrum Energy Regime

Neutron reaction cross sections play a vital role in tracking the production and destruction of isotopes exposed to neutron fluence. They are central to the process of reconciling the initial and final atom inventories. Measurements of irradiated samples by radiochemical methods in tangent with an algorithm are used to evaluate the fluence a sample is exposed to over the course of the irradiation. This algorithm is the Isotope Production Code (IPC) created and used by the radiochemistry data assessment team at Los Alamos National Laboratory (LANL). An integral result is calculated by varying the total neutron fluence seen by a sample. A sample, irradiated in a critical assembly, will be exposed to a unique neutron flux defined by the neutron source and distance of the sample from the source. Neutron cross sections utilized are a function of the hardness of the neutron spectrum at the location of irradiation. A spectral index is used an indicator of the hardness of the neutron spectrum. Cross sections fit forms applied in IPC are collapsed from a LANL 30-group energy structure. Several decades of research and development have been performed to formalize the current IPC cross section library. Basis of the current fission spectrum neutron reaction cross section library is rooted in critical assembly experiments performed from the 1950’s through the early 1970’s at LANL. The focus of this report is development of the spectral index used an indicator of the hardness of the neutron spectrum in the fission spectrum energy regime.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Assimilation of Wind Profiles from Multiple Doppler Radar Wind Profilers for Space Launch Vehicle Applications

Atmospheric wind data are required by space launch vehicles in order to assess flight vehicle loads and performance on day-of-launch. Space launch ranges at NASA's Kennedy Space Center co-located with the United States Air Force's (USAF) Eastern Range (ER) at Cape Canaveral Air Force Station and USAF's Western Range (WR) at Vandenberg Air Force Base have extensive networks of in-situ and remote sensing instrumentation to measure atmospheric winds. Each instrument's technique to measure winds has advantages and disadvantages in regards to use within vehicle trajectory analyses. Balloons measure wind at all altitudes necessary for vehicle assessments, but two primary disadvantages exist when applying balloon output. First, balloons require approximately one hour to reach required altitudes. Second, balloons are steered by atmospheric winds down range of the launch site that could significantly differ from those winds along the vehicle ascent trajectory. These issues are mitigated by use of vertically pointing Doppler Radar Wind Profilers (DRWPs). However, multiple DRWP instruments are required to provide wind data over altitude ranges necessary for vehicle trajectory assessments. The various DRWP systems have different operating configurations resulting in different temporal and spatial sampling intervals. Therefore, software was developed to combine data from both DRWP-generated profiles into a single profile for use in vehicle trajectory analyses. This paper will present details of the splicing software algorithms and will provide sample output.

Decker, Ryan K.↗

Determining Physical Parameters of Shielded Uranium using Gamma Spectroscopy and the Differential Evolution Adaptive Metropolis (DREAM) Method

Inverse radiation transport is a well-established method for determining unknown parameters within a system that exhibits particle leakage. Two significant challenges of solving inverse transport problems are (1) to determine multiple unknowns without false convergence on local minima and (2) to be able to quantify uncertainty. It was recently demonstrated that the Differential Evolution Adaptive Metropolis (DREAM) method effectively meets both of these challenges. In Bledsoe's 2014 article, the DREAM method was only applied to numerical test cases in which measured data were simulated using MCNP. This paper provides results of research conducted at Oak Ridge National Laboratory (ORNL) in which DREAM was applied to two-dimensional inverse transport problems using real-world measurements. The DREAM method uses a Markov chain Monte Carlo (MCMC) method to obtain a posterior distribution of unknown parameters. In this application, the posterior distribution is determined by using a uniform prior distribution and a likelihood function. The goal of the inverse problem is to find the regions in which the likelihood function is at or near its maximum. In the traditional MCMC approach, a single Markov chain is employed. In practice, MCMC approaches have a high acceptance rate to solutions that are near the current point of sampling, but they exhibit slow convergence to solutions far from the sampling point. The DREAM algorithm was designed to alleviate this issue by initiating multiple Markov chains and using the differential evolution algorithm to generate trial points for each chain. Solving for the mass of radioactive material within a voluminous source is a challenging problem for gamma-ray spectroscopy. Inverse gamma-ray transport can supply a range of possible material compositions, but reducing the differences between predicted and actual measurements can lead to false results. DREAM is a rapid technique for determining the most likely solution for several unknown parameters in an inverse transport problem. This work applies DREAM to a series of gamma spectroscopy experiments performed at ORNL.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

SAPHIRE 8 Volume 2 - Technical Reference

The Systems Analysis Programs for Hands-on Integrated Reliability Evaluations (SAPHIRE) refers to a set of computer programs that were developed to create and analyze probabilistic risk assessment (PRAs). Herein information is provided on the principles used in the construction and operation of Version 8.0 of the SAPHIRE system. This report summarizes the fundamental mathematical concepts of sets and logic, fault trees, and probability. This volume then describes the algorithms used to construct a fault tree and to obtain the minimal cut sets. It gives the formulas used to obtain the probability of the top event from the minimal cut sets, and the formulas for probabilities that apply for various assumptions concerning reparability and mission time. It defines the measures of basic event importance that SAPHIRE can calculate. This volume gives an overview of uncertainty analysis using simple Monte Carlo sampling or Latin Hypercube sampling, and states the algorithms used by this program to generate random basic event probabilities from various distributions. Also covered are enhance capabilities such as seismic analysis, Workspace algorithms, cut set "recovery," end state manipulation, and use of "compound events."

97 MATHEMATICS AND COMPUTING↗

Azimuthal Sampling of Tectonic Release from Rayleigh Waves, Triggered by Shallow Explosions from the Source Physics Experiment: Theory

Underground explosions often produce Rayleigh waves with non-circular radiation patterns. The presence of significant anisotropic radiation patterns from isotropic sources is often attributed to the coincident release of tectonic strain across faults that are spatially near the explosion working point. However, poor instrument deployment geometries can lead to misinterpretations of these fields as isotropic when the are non-circular. In this work, we construct a physical representation for the first two moments of the Rayleigh wave radiation pattern triggered by a shallow, underground explosion. We then construct a hypothesis test for discriminating between the isotropic and anisotropic portion of the radiated Rayleigh wavefield, using these moments. We find that the screening power is completely quantified by a single parameter λ that depends on azimuthal deployment geometry as well as wavefield sampling. To improve radiation pattern discrimination, we present an algorithm for iteratively including receivers to sample the radiation pattern that increases the performance (power) of the hypothesis test at each iteration. Last, we discuss future applications of our method to data recorded from the Source Physics Experiment taking place at the Nevada National Security Site (NNSS).

42 ENGINEERING↗

An Ensemble Approach to Building Mercer Kernels with Prior Information

This paper presents a new methodology for automatic knowledge driven data mining based on the theory of Mercer Kernels, which are highly nonlinear symmetric positive definite mappings from the original image space to a very high, possibly dimensional feature space. we describe a new method called Mixture Density Mercer Kernels to learn kernel function directly from data, rather than using pre-defined kernels. These data adaptive kernels can encode prior knowledge in the kernel using a Bayesian formulation, thus allowing for physical information to be encoded in the model. Specifically, we demonstrate the use of the algorithm in situations with extremely small samples of data. We compare the results with existing algorithms on data from the Sloan Digital Sky Survey (SDSS) and demonstrate the method's superior performance against standard methods. The code for these experiments has been generated with the AUTOBAYES tool, which automatically generates efficient and documented C/C++ code from abstract statistical model specifications. The core of the system is a schema library which contains templates for learning and knowledge discovery algorithms like different versions of EM, or numeric optimization methods like conjugate gradient methods. The template instantiation is supported by symbolic-algebraic computations, which allows AUTOBAYES to find closed-form solutions and, where possible, to integrate them into the code.

Srivastava, Ashok N.↗

Modified Closures in Monte Carlo Algorithms for Diffusive Binary Stochastic Media Transport Problems

In a stochastic medium, the material properties at a given spatial location are known only statistically. The most common approach to solving particle transport problems involving binary stochastic media (BSM) is to use the atomic mix approximation in which the transport problem is solved using homogenized (volume-averaged) material properties. A common deterministic model developed for solving BSM particle transport problems is the Levermore-Pomraning (LP) model. Zimmerman and Adams proposed a Monte Carlo algorithm (Algorithm A) that solves the LP equations and another Monte Carlo algorithm (Algorithm B) that locally preserves the sampled material realization; we refer to these Monte Carlo algorithms as the LP and LPLRP (LP local realization preserving) algorithms, respectively. One-dimensional (1D) planar geometry benchmark studies have shown that the LPLRP algorithm is often significantly more accurate than the LP algorithm for problems with an incident angular flux as well as for problems with an interior source. The LPLRP algorithm implementation in these benchmark comparisons made explicit use of the one-dimensional nature of the problem. The LP model is derived by assuming an 'upwind' closure in the coupling term relating the two materials in a binary stochastic medium. Su and Pomraning developed a modified form of this closure by considering the small correlation length limit and requiring the modified closure to produce the correct exponential decay for a source-free half-line albedo problem in rod geometry. They concluded that the modified closure is generally not inferior to the LP closure and in some cases is significantly better. Brantley investigated the use of the Su-Pomraning (SP) closure in the Monte Carlo LP algorithm (LP-SP) for the suite of benchmark problems and concluded that 1) the LP-SP algorithm was somewhat more accurate overall than the LP algorithm and somewhat less accurate overall than the LPLRP algorithm for an incident angular flux benchmark suite, and 2) the LP-SP algorithm was generally the least accurate of the algorithms for an interior source benchmark suite. Larsen et al. performed an asymptotic analysis of the transport equation in 1D planar geometry for the situation in which the physical system is 1) a random binary stochastic medium with material macroscopic total cross sections and mean slab width values of O(1) or smaller and 2) optically thick with weak absorption and sources at each spatial point and therefore globally diffusive. The asymptotic analysis demonstrates that, under these assumptions, the transport equation limits to the conventional diffusion equation with atomically-mixed (volume-averaged) material properties. Larsen et al. also demonstrate that, under these same assumptions, the LP equations asymptotically limit to an atomically-mixed diffusion equation with a diffusion coefficient that is too large, leading to an unphysical flattening of the ensemble-averaged scalar flux distribution. Vasques and Yadav recently performed an asymptotic analysis of an adjusted Levermore-Pomraning closure in which the Markovian transition functions are rescaled such that the equations asymptotically limit to the correct atomically-mixed diffusion equation; we refer to this model as LP-VY. In this paper, we demonstrate that the adjusted LP closure proposed by Vasques and Yadav is a special case of the SP closure obtained by assuming that the absorption cross sections in the two materials are equal. We further demonstrate that the Su-Pomraning closure has the correct asymptotic limit for the diffusive physical system and is therefore an appropriate closure for these problems. We also describe how to incorporate these various closures into the Monte Carlo LP and LPLRP particle transport algorithms, and we present numerical results comparing the accuracy of the Monte Carlo LP, LP-VY, LP-SP, LPLRP, and LPLRP-SP algorithms for the set of diffusive benchmark problems. We demonstrated that the SP closure has the correct asymptotic limit for the diffusive physical system under investigation in this paper and that the VY closure is a special case of the SP closure obtained by assuming equal absorption in the two materials. Both of these closures are readily implemented in the Monte Carlo LP and LPLRP algorithms for particle transport in BSM. Through numerical comparisons to a diffusive benchmark suite, we confirmed that 1) the LP and LPLRP algorithms do not limit to the appropriate diffusion solution and 2) the LP-VY, LP-SP, and LPLRP-SP algorithms limit to the appropriate diffusion solution and are of comparable accuracy. The LPLRP algorithm has been shown to be generally more accurate than the LP algorithm for non-diffusive problems. However, the numerical results in this paper indicate that the LPLRP algorithm does not limit to the correct diffusion equation for the asymptotic limit under consideration. The work in this paper demonstrates that the SP algorithm does limit to the correct diffusion equation for the asymptotic limit considered. Future work will investigate the possibility of whether the LPLRP-SP algorithm is accurate for both diffusive and non-diffusive problems.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Intelligent Sampling for Surrogate Modeling, Hyperparameter Optimization, and Data Analysis

Sampling techniques are used in many fields, including design of experiments, image processing, and graphics. The techniques in each field are designed to meet the constraints specific to that field such as uniform coverage of the range of each dimension or random samples that are at least a certain distance apart from each other. When an application imposes new constraints, for example, by requiring samples in a non-rectangular domain or the addition of new samples to an existing set, a common solution is to modify the algorithm currently in use, often with less than satisfactory results. As an alternative, we propose the concept of intelligent sampling, where we devise algorithms specifically tailored to meet our sampling needs, either by creating new algorithms or by modifying suitable algorithms from other fields. Surprisingly, both qualitative and quantitative comparisons indicate that some relatively simple algorithms can be easily modified to meet the many sampling requirements of surrogate modeling, hyperparameter optimization, and data analysis; these algorithms outperform their more sophisticated counterparts currently in use, resulting in better use of time and computer resources.

97 MATHEMATICS AND COMPUTING↗

Reference-independent comparative metagenomics using cross-assembly: crAss

Motivation: Metagenomes are often characterized by high levels of unknown sequences. Reads derived from known microorganisms can easily be identified and analyzed using fast homology search algorithms and a suitable reference database, but the unknown sequences are often ignored in further analyses, biasing conclusions. Nevertheless, it is possible to use more data in a comparative metagenomic analysis by creating a cross-assembly of all reads, i.e. a single assembly of reads from different samples. Comparative metagenomics studies the interrelationships between metagenomes from different samples. Using an assembly algorithm is a fast and intuitive way to link (partially) homologous reads without requiring a database of reference sequences. Results: Here, we introduce crAss, a novel bioinformatic tool that enables fast simple analysis of cross-assembly files, yielding distances between all metagenomic sample pairs and an insightful image displaying the similarities.

59 BASIC BIOLOGICAL SCIENCES↗

Improving Computational Efficiency of Prognostics Algorithms in Resource-Constrained Settings

The field of prognostics and health management provides quantitative methods for monitoring and predicting the health of physical systems. Prognostics algorithms are useful in that they can be employed to assess the current state of a system, propagate the system state throughout time, and predict potential anomalies or failures that may occur. However, effective prognosis can be challenging to achieve in resource-constrained settings due to computational limitations and high computational latency, leading to obsolete predictions. Thus, computationally efficient and accurate algorithms are necessary for some prognostics applications. In this work, we implement three new algorithmic approaches to prediction (sampling methods, variable prediction time step, variable prediction sample size) with the goal of improving computational efficiency while minimizing decrease in model accuracy. To quantitatively analyze our results, we examine a use-case of degradation of a Lithium-ion battery. Notably, through this work it was found that none of the sampling approaches had a significant impact on computational efficiency or model accuracy in predicting EOD of the battery. However, our results show that prediction accuracy is highly dependent on the time step used, and that an appropriate time step can optimize both model accuracy and simulation efficiency. Finally, implementing a variable sample size also affected prediction, and our results show that tuning both the magnitude and timing of the sample size adjustment in an application-specific manner may prove useful in some applications. Taken together, our findings highlight the challenge of performing prognostics in resource-constrained settings, and illustrate the potential of developing new prediction algorithms to improve computational efficiency of prognosis.

Prognostics↗

Device-Centric Ransomware Detection using Machine Learning-Based Memory Forensics for Smart Inverters

Ransomware attacks are the fastest-growing form of cyberattacks worldwide. Recently, ransomware attacks have targeted industrial control systems (ICSs), including power grids. Lessons learned from recent incidents in ICSs show that ransomware groups can deliver ransomware into not only the organization’s control servers, but also the operational technology (OT) devices such as smart inverters and smart grid devices. This paper proposes a machine learning (ML)- based memory forensics method enabling the detection of ransomware binaries stored in the memory of a commercial smart inverter. Device firmware binary files are extracted from a Serial Peripheral Interface (SPI) flash memory, and samples of both benign and ransomware binaries are generated by a binary manipulation method and a real-world ransomware encryption, separately. A deep transfer learning (DTL) method is used to retrain a convolutional neural network (CNN)-based ransomware detection algorithm using the generated samples. The experimental result validates that the proposed ML-based memory forensics method can accurately detect ransomware files.

97 MATHEMATICS AND COMPUTING↗

Stochastic AC optimal power flow: A data-driven approach

There is an emerging need for efficient solutions to stochastic AC Optimal Power Flow (AC-OPF) to ensure optimal and reliable grid operations in the presence of increasing demand and generation uncertainty. Herein this paper presents a highly scalable data-driven algorithm for stochastic AC-OPF that has extremely low sample requirement. The novelty behind the algorithm’s performance involves an iterative scenario design approach that merges information regarding constraint violations in the system with data-driven sparse regression. Compared to conventional methods with random scenario sampling, our approach is able to provide feasible operating points for realistic systems with much lower sample requirements. Furthermore, multiple sub-tasks in our approach can be easily paralleled and based on historical data to enhance its performance and application. We demonstrate the computational improvements of our approach through simulations on different test cases in the IEEE PES PGLib-OPF benchmark library.

42 ENGINEERING↗