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

Use of a Radon Stripping Algorithm for Retrospective Assessment of Air Filter Samples

An evaluation of a large number of air sample filters was undertaken using a commercial alpha and beta spectroscopy system employing a passive implanted planar silicon (PIPS) detector. Samples were only measured after air flow through the filters had ceased. Use of a commercial radon stripping algorithm was implemented to discriminate anthropogenic alpha and beta activity on the filters from the radon progeny. When uncontaminated air filters were evaluated, the results showed that there was a time-dependent bias in both average estimates and measurement dispersion with the relative bias being small compared to the dispersion. By also measuring environmental air sample filters simultaneously with electroplated alpha and beta sources, use of the radon stripping algorithm demonstrated a number of substantial unexpected deviations. Use of the current algorithm is therefore not recommended for assay applications and so use of the PIPS detector should only be utilized for gross counting without appropriate modifications to the curve fitting algorithm. As a screening method, the radon stripping algorithm might be expected to see elevated alpha and beta activities on air sample filters (not due to radon progeny) around the 200 dpm level.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Search for Heavy Resonances in the Dimuon Channel with the DØ Detector

High-energy particle physics is often described as the quest for a fundamental theory. One can think of one theory as being more "fundamental" than a second theory if the first explains some or all of the predictions of the second in terms of processes at smaller distance scales and higher energies. Another sense in which a theory can be thought of as being more fundamental than another, is if the first theory "explains" the second; that is, if some arbitrary aspect of the second theory is a special case of a more general principle in the first theory. The Standard Model of particle physics is the most fundamental experimentally tested theory in either sense. It was developed in its final form in the 1960's and 1970's and continues to successfully predict the outcomes of high-energy physics experiments; the research presented in this thesis offers no exception to this trend ( unfortunately). However, the Standard Model only makes sense as an effective theory; that is, a theory that is not actually fundamental, but which is a low-energy limit of some underlying theory, without being dependent on the details of that underlying theory. Moreover, one important aspect of the Standard Model so far remains unexplained, namely electroweak symmetry breaking. Phase transitions occur in many places in physics, and can often be explained as a low-energy aspect of some more fundamental process. However, there is no such underlying process for electroweak symmetry breaking within the Standard Model; the introduction of the scalar Higgs field does not, in itself, explain electroweak symmetry breaking, it merely parameterizes it. Therefore, it is perhaps not surprising that the (most obvious) problem with the Standard Model, the '·gauge hierarchy problem", occurs in relation with the Higgs field. This problem, the "unnaturalness" of the Standard Model, will be discussed (briefly) in the next chapter. It so happens that the unnaturalness of the Standard Model strongly suggests the presence of new physics at an energy scale that is very close to the energies achieved with the Tevatron collider (and presumably well within the reach of the next collider, the LHC). Therefore, there is a general expectation that new physics is "just around the corner". Many, many models for new physics exist, and it is not possible to devise an optimal search strategy for all of them at once. Therefore (and possibly to reduce bias), it is preferable to search for new physics in a model-independent way. While the analysis presented in this thesis is certainly not model-independent, it uses the fact that many, often very different models share the prediction of a new mass resonance. Specifically, we search for such resonances in the dimuon channel. Since no new resonance was in fact observed, the various models only serve to parameterize the degree to which nothing was found. In chapter 2, an outline of the Standard Model is given, and some extensions to the Standard Model are described. Chapter 3 describes the accelerator complex and the D0 detector. Chapter 4 describes the simulation of both Standard Model and new physics processes and the detector simulation. Chapter 5 describes the data sample, the reconstruction algorithms, the event selection and the kinematic fit. A sample of high-PT dimuon events is obtained by applying a number of cuts, and the simulation is tuned to match the efficiencies and track resolution measured on Z→ μ + μ - data. The integrated luminosity times the trigger efficiency of the final sample is determined by comparing it to the predicted (and well-tested) Z cross section. The mass resolution is improved by a kinematic fit which uses the transverse energy balance in the event to constrain the muon track P T for each event in the final selection. In chapter 6, a final cut on the (fitted) invariant mass of the selected events is chosen in such a way that it maximizes the sensitivity to the presence of new physics for specific models and resonance masses. A counting experiment is performed for several values of the mass of a hypothetical new particle. Since no excess over the predicted background is observed, Bayesian credibility limits on the production cross-section times branching ratio of the hypothetical new particles were calculated, as well as limits on the parameters of new physics models. The uncertainties on the theory and detector simulation are taken into account. An event display of the highest reconstructed mass event is shown as well. Finally, chapter 7 gives a conclusion, some prospects of improving the result and a brief outlook.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Light-cone matrix product

We show how to combine the light-cone and matrix product algorithms to simulate quantum systems far from equilibrium for long times. For the case of the XXZ spin chain at {delta}=0.5, we simulate to a time of {approx_equal}22.5. While part of the long simulation time is due to the use of the light-cone method, we also describe a modification of the infinite time-evolving bond decimation algorithm with improved numerical stability, and we describe how to incorporate symmetry into this algorithm. While statistical sampling error means that we are not yet able to make a definite statement, the behavior of the simulation at long times indicates the appearance of either 'revivals' in the order parameter as predicted by Hastings and Levitov (e-print arXiv:0806.4283) or of a distinct shoulder in the decay of the order parameter.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Hashed Binary Search Sampling for Convolutional Network Training with Large Overhead Image Patches

Very large overhead imagery associated with ground truth maps has the potential to generate billions of training image patches for machine learning algorithms. However, random sampling selection criteria often leads to redundant and noisy-image patches for model training. With minimal research efforts behind this challenge, the current status spells missed opportunities to develop supervised learning algorithms that generalize over wide geographical scenes. In addition, much of the computational cycles for large scale machine learning are poorly spent crunching through noisy and redundant image patches. We demonstrate a potential framework to address these challenges specifically, while evaluating a human settlement detection task. A novel binary search tree sampling scheme is fused with a kernel based hashing procedure that maps image patches into hash-buckets using binary codes generated from image content. The framework exploits inherent redundancy within billions of image patches to promote mostly high variance preserving samples for accelerating algorithmic training and increasing model generalization.

Lunga, Dalton↗

Randomized Sampling for Large Data Applications of SVM

A trend in machine learning is the application of existing algorithms to ever-larger datasets. Support Vector Machines (SVM) have been shown to be very effective, but have been difficult to scale to large-data problems. Some approaches have sought to scale SVM training by approximating and parallelizing the underlying quadratic optimization problem. This paper pursues a different approach. Our algorithm, which we call Sampled SVM, uses an existing SVM training algorithm to create a new SVM training algorithm. It uses randomized data sampling to better extend SVMs to large data applications. Experiments on several datasets show that our method is faster than and comparably accurate to both the original SVM algorithm it is based on and the Cascade SVM, the leading data organization approach for SVMs in the literature. Further, we show that our approach is more amenable to parallelization than Cascade SVM.

large data↗

Effective Gaps Are Not Effective: Quasipolynomial Classical Simulation of Obstructed Stoquastic Hamiltonians

All known examples suggesting an exponential separation between classical simulation algorithms and stoquastic adiabatic quantum computing (StoqAQC) exploit symmetries that constrain adiabatic dynamics to effective, symmetric subspaces. The symmetries produce large effective eigenvalue gaps, which in turn make adiabatic computation efficient. We present a classical algorithm to subexponentially sample from an effective subspace of any k -local stoquastic Hamiltonian H , without a priori knowledge of its symmetries (or near symmetries). Our algorithm maps any k -local Hamiltonian to a graph G = ( V , E ) with | V | = O (poly (n)) , where n is the number of qubits. Given the well-known result of Babai [Graph isomorphism in quasipolynomial time, in Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing (2016), pp. 684–697], we exploit graph isomorphism to study the automorphisms of G and arrive at an algorithm quasipolynomial in | V | for producing samples from effective subspace eigenstates of H . Our results rule out exponential separations between StoqAQC and classical computation that arise from hidden symmetries in k -local Hamiltonians. Our graph representation of H is not limited to stoquastic Hamiltonians and may rule out corresponding obstructions in nonstoquastic cases, or be useful in studying additional properties of k -local Hamiltonians.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Assignment of Freight Traffic in a Large-scale Intermodal Network under Uncertainty

This paper presents a methodology for freight traffic assignment in a large-scale road-rail intermodal network under uncertainty. Network uncertainties caused by natural disasters have dramatically increased in recent years. Several of these disasters (e.g., Hurricane Sandy, Mississippi River Flooding, and Hurricane Harvey) severely disrupted the U.S. freight transportation network, and consequently, the supply chain. To account for these network uncertainties, a stochastic freight traffic assignment model is formulated. An algorithmic framework, involving the sample average approximation and gradient projection algorithm, is proposed to solve this challenging problem. The developed methodology is tested on the U.S. intermodal network with freight flow data from the Freight Analysis Framework. The experiments consider three types of natural disasters that have different risks and impacts on transportation networks: earthquakes, hurricanes, and floods. It is found that for all disaster scenarios, freight ton-miles are higher compared to the base case without uncertainty. The increase in freight ton-miles is the highest under the flooding scenario; this is because there are more states in the flood-risk areas, and they are scattered throughout the U.S.

42 ENGINEERING↗

Comparison of multiobjective optimization methods for the $\mathrm{LCLS-II}$ photoinjector

Particle accelerators are among some of the largest science experiments in the world and can consist of thousands of components with a wide variety of input ranges. These systems can easily become unwieldy optimization problems during design and operations studies. Starting in the early 2000s, searching for better beam dynamics configurations became synonymous with heuristic optimization methods in the accelerator physics community. Genetic algorithms and particle swarm optimization are currently the most widely used. These algorithms can take thousands of simulation evaluations to find optimal solutions for one machine prototype. For large facilities such as the Linac Coherent Light Source (LCLS) and others, this equates to a limited exploration of many possible design configurations. In this paper, the LCLS-II photoinjector is optimized with three optimization algorithms. All optimizations were started from both a uniform random and Latin hypercube sample. In all cases, the optimizations started from Latin hypercube samples outperformed optimizations started from uniform samples. All three algorithms were able to optimize the photoinjector, with the model-based methods approximating the Pareto front in fewer simulation evaluations. This work, in combination with previous optimization observations, indicates objective penalties have a strong impact on the efficiency of such methods. In general, we recommend heuristic methods for initial optimizations and model-based methods when information about the objective space is available.

43 PARTICLE ACCELERATORS↗

High-Throughput Discovery Illuminates Design Principles and Limits for Long-Lived Charged Species in Organic Electrolytes

The chemical stability of charged molecules in all-organic redox flow batteries (RFBs) is required for the prolonged operation of these devices. Molecular engineering and electrolyte optimization are used to mitigate parasitic reactions and extend the lifetimes of the charge carriers. However, how much can structural variation extend the lifetime? To probe this query, we designed a high-throughput kinetic study of the radical cation of N-methylphenothiazinium, guided by statistical sampling and learning algorithms. Using Argonne’s autonomous discovery facility, we conducted over 6,000 kinetic experiments with robotic sample preparation, parallel kinetic measurements, and machine learning inputs, testing 188 solvent molecules selected from a space of over 540 candidates from 11 chemical classes. Algorithmic selections guided us to stable solvent candidates, which were further tested in high concentration with and without supporting electrolyte. Our findings reveal the inherent difficulty of exceeding the current state of the art through solvent variation. The desired stability is statistically rare and poorly predictable. Among the many tested, only three solvents significantly outperformed our baseline, acetonitrile─and none by more than a factor of 3─suggesting a general challenge in achieving the necessary techno-economic targets. Furthermore, we suggest that self-discharge through solvent homolysis is the cause of the observed limitations. Several structural motifs contribute to >1,000 h half-life stability including molecular simplicity, symmetry, oxidation complement, and strategic fluorination. Importantly, this workflow establishes effective assays for diagnosing and predicting oxidative stress for highly stable liquid electrolytes in all batteries.

Batteries↗

Unexpected series of regular frequency spacing of δ Scuti stars in the non-asymptotic regime. II. Sample-Echelle diagrams and rotation

A sequence search method was developed for searching for regular frequency spacing in δ Scuti stars by visual inspection (VI) and algorithmic search. The sample contains 90 δ Scuti stars observed by CoRoT. An example is given to represent the VI. The algorithm (SSA) is described in detail. The data treatment of the CoRoT light curves, the criteria for frequency filtering, and the spacings derived by two methods (i.e., three approaches: VI, SSA, and FT) are given for each target. Echelle diagrams are presented for 77 targets for which at least one sequence of regular spacing was identified. Comparing the spacing and the shifts between pairs of echelle ridges revealed that at least one pair of echelle ridges is shifted to midway between the spacing for 22 stars. The estimated rotational frequencies compared to the shifts revealed rotationally split doublets, triplets, and multiplets not only for single frequencies, but for the complete echelle ridges in 31 δ Scuti stars. Furthermore, using several possible assumptions for the origin of the spacings, we derived the large separation (${\rm{\Delta }}\nu $) that are distributed along the mean density versus large separations relation derived from stellar models.

79 ASTRONOMY AND ASTROPHYSICS↗

High-Dimensional Spectral Sampling

A wide variety of applications in science and engineering depend on effectively and efficiently exploring high- dimensional parameter spaces. Common examples are uncertainty quantification, inverse problems, or various optimization approaches. In such applications, the first step is to create an initial uniform, random sampling of the space to create a baseline of knowledge. The simulations evaluated at these samples are then used for subsequent processing. In its most generic form, the goal of sampling is to produce the maximal amount of information with the minimal number of samples. However, despite being the first step and thus influencing the performance of the entire workflow, the quality of the initial sample designs is rarely analyzed or optimized. This project develops a new spectral sampling theory for analyzing and creating experiment designs in high-dimensional spaces. Further, new algorithms for estimating sample properties and sample synthesis are designed. Finally, applications of the proposed spectral sampling tools in surrogate modeling, scientific machine learning and image analysis are presented.

97 MATHEMATICS AND COMPUTING↗

Simulation of the Interaction of a Magnetic Resonance Force Microscope Probe with a Ferromagnetic Sample

We propose an algorithm and present results of micromagnetic simulation of the resonant response of a probe pickup (cantilever) of a magnetic resonance force microscope. Simulation of induced oscillations of sample magnetization makes it possible to calculate the varying component of the force exerted on the probe by the sample and to construct spectra in the form of dependences of the amplitude of oscillations of the cantilever on the external magnetic field strength. Simulation of time dependences of all magnetization field components makes it possible to analyze the spatial distributions of spin-wave resonances of samples. For test objects in the form of rectangular permalloy microstrips, good agreement between model and experimental spectra is achieved.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

MCCCS-MN

The MCCCS‒MN (Monte Carlo for Complex Chemical Systems‒Minnesota) software is developed by the Siepmann research group at the University of Minnesota. MCCCS‒MN allows for the simulation of multi-component molecular systems in the canonical, isobaric-isothermal (including constant stress for solids), grand-canonical, semi-grand, and Gibbs (NVT, NPT, and more than two simulation boxes) ensembles. It uses the configurational-bias Monte Carlo method to efficiently sample phase space for linear, branched and cyclic chain molecules, the adiabatic nuclear and electronic sampling Monte Carlo method to treat many-body polarization effects, and the aggregation-volume-bias Monte Carlo algorithm to efficiently sample the spatial distribution of associating molecules. MCCCS-MN employs a molecular representation of the system where force fields contain bonded and non-bonded terms. Funding for the development of MCCCS-MN through grants from the National Science Foundation (simulation of fluid phase equilibria and chromatography) and the Department of Energy (simulation of adsorption equilibria) is gratefully acknowledged.

Siepmann, J.Ilja [University of Minnesota - Twin C↗