Search NASA⌕ Search

SEARCH · Search NASA

Results for “randomized 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 451 records · Page 25

Validation of emission-line galaxies target selection algorithms for the Dark Energy Spectroscopic Instrument using the MMT Binospec

ABSTRACT The forthcoming Dark Energy Spectroscopic Instrument (DESI) experiment plans to measure the effects of dark energy on the expansion of the Universe and create a 3D map of the Universe using galaxies up to z ∼ 1.6 and QSOs up to z ∼ 3.5. In order to create this map, DESI will obtain spectroscopic redshifts of over 30 million objects; among them, a majority are [O ii] emitting star-forming galaxies known as emission-line galaxies (ELGs). These ELG targets will be pre-selected by drawing a selection region on the g − r versus r − z colour–colour plot, where high-redshift ELGs form a separate locus from the lower redshift ELGs and interlopers. In this paper, we study the efficiency of three ELG target selection algorithms – the Final Design Report (FDR) cut based on the DEEP2 photometry, Number Density Modelling (NDM) and Random Forest – to determine how the combination of these three algorithms can be best used to yield a simple selection boundary that will be best suited to meet DESI’s science goals. To do this, we selected 17 small patches in the DESI footprint where we run the three target selection algorithms to pre-select ELGs based on their photometry. We observed the pre-selected ELGs using the MMT Binospec, which is similar in functionality to the DESI instrument, to obtain their spectroscopic redshifts and fluxes of 1054 ELGs. By analysing the redshift and fluxing distribution of these galaxies, we find that although NDM performed the best, simple changes in the FDR definition would also yield sufficient performance.

79 ASTRONOMY AND ASTROPHYSICS↗

Iterative spectral method for solving electrostatic or magnetostatic problems in complex and evolving heterostructures

Electrostatic or magnetostatic problems involving complex heterogeneity are nontrivial for modeling and simulation. Most existing numerical methods focus on sharp interface models and the computational cost increases with increasing complexity of the geometry. Here we develop an iterative spectral method, the bound charge successive approximation algorithm, to solve electrostatic or magnetostatic heterogeneity problems in the context of diffuse-interface modeling. As tests and verifications, this algorithm is applied to calculation of the depolarization factor of an ellipsoid, and simulation of random dielectric mixtures and the dielectophoretic motion of multiple particles. The algorithm shows excellent efficiency and the computational cost mainly depends on the permittivity or permeability contrast in the whole system, regardless of the complexity of the geometry. Specifically, for evolving heterostructures the solution of bound charge in one time step can be used as input for the next, which could further significantly shorten the iteration (approximation) process, making it practical to simulate the long-range electrostatic or magnetostatic interaction in complex and evolving heterostructures.

97 MATHEMATICS AND COMPUTING↗

A Distributed-Memory Package for Dense Hierarchically Semi-Separable Matrix Computations Using Randomization

In this paper, we present a distributed-memory library for computations with dense structured matrices. A matrix is considered structured if its off-diagonal blocks can be approximated by a rank-deficient matrix with low numerical rank. Here, we use Hierarchically Semi-Separable (HSS) representations. Such matrices appear in many applications, for example, finite-element methods, boundary element methods, and so on. Exploiting this structure allows for fast solution of linear systems and/or fast computation of matrix-vector products, which are the two main building blocks of matrix computations. The compression algorithm that we use, that computes the HSS form of an input dense matrix, relies on randomized sampling with a novel adaptive sampling mechanism. We discuss the parallelization of this algorithm and also present the parallelization of structured matrix-vector product, structured factorization, and solution routines. The efficiency of the approach is demonstrated on large problems from different academic and industrial applications, on up to 8,000 cores. Finally, this work is part of a more global effort, the STRUctured Matrices PACKage (STRUMPACK) software package for computations with sparse and dense structured matrices. Hence, although useful on their own right, the routines also represent a step in the direction of a distributed-memory sparse solver.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗

Saturated random packing built of arbitrary polygons under random sequential adsorption protocol

Random packings and their properties are a popular and active field of research. Numerical algorithms that can efficiently generate them are useful tools in their study. This paper focuses on random packings produced according to the random sequential adsorption (RSA) protocol. Developing the idea presented by G. Zhang, where saturated random packings built of regular polygons were studied, we create an algorithm that generates strictly saturated packings built of any polygons. Then, the algorithm was used to determine the packing fractions for arbitrary triangles. In this work, the highest mean packing density, 0.552 814 ± 0.000 063, was observed for triangles of side lengths 0.63 : 1 : 1. Additionally, microstructural properties of such packings, kinetics of their growth, as well as distributions of saturated packing fractions and the number of RSA iterations needed to reach saturation were analyzed.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

RANDOM FORESTS FOR PHOTOMETRIC REDSHIFTS

The main challenge today in photometric redshift estimation is not in the accuracy but in understanding the uncertainties. We introduce an empirical method based on Random Forests to address these issues. The training algorithm builds a set of optimal decision trees on subsets of the available spectroscopic sample, which provide independent constraints on the redshift of each galaxy. The combined forest estimates have intriguing statistical properties, notable among which are Gaussian errors. We demonstrate the power of our approach on multi-color measurements of the Sloan Digital Sky Survey.

79 ASTRONOMY AND ASTROPHYSICS↗

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↗

Improving CASINO performance for models with large number of electrons

Quantum Monte Carlo calculations have at their core algorithms based on statistical ensembles of multidimensional random walkers which are straightforward to use on parallel computers. Nevertheless some computations have reached the limit of the memory resources for models with more than 1000 electrons because of the need to store a large amount of electronic orbitals related data. Besides that, for systems with large number of electrons, it is interesting to study if the evolution of one configuration of random walkers can be done faster in parallel. We present a comparative study of two ways to solve these problems: (1) distributed orbital data done with MPI or Unix inter-process communication tools, (2) second level parallelism for configuration computation.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

A New Pivoting and Iterative Text Detection Algorithm for Biomedical Images

There is interest to expand the reach of literature mining to include the analysis of biomedical images, which often contain a paper's key findings. Examples include recent studies that use Optical Character Recognition (OCR) to extract image text, which is used to boost biomedical image retrieval and classification. Such studies rely on the robust identification of text elements in biomedical images, which is a non-trivial task. In this work, we introduce a new text detection algorithm for biomedical images based on iterative projection histograms. We study the effectiveness of our algorithm by evaluating the performance on a set of manually labeled random biomedical images, and compare the performance against other state-of-the-art text detection algorithms. We demonstrate that our projection histogram-based text detection approach is well suited for text detection in biomedical images, and that the iterative application of the algorithm boosts performance to an F score of .60. We provide a C++ implementation of our algorithm freely available for academic use.

60 APPLIED LIFE SCIENCES↗

Picasso: Memory-Efficient Graph Coloring Using Palettes With Applications in Quantum Computing

A coloring of a graph is an assignment of colors to vertices such that no two neighboring vertices have the same color. The need for memory-efficient coloring algorithms is motivated by their application in computing clique partitions of graphs arising in quantum computations where the objective is to map a large set of Pauli strings into a compact set of unitaries. We present Picasso, a randomized memory-efficient iterative parallel graph coloring algorithm with theoretical sublinear space guarantees under practical assumptions. The parameters of our algorithm provide a trade-off between coloring quality and resource consumption. To assist the user, we also propose a machine learning model to predict the coloring algorithm’s parameters considering these trade-offs. We provide a sequential and a parallel implementation of the proposed algorithm. We perform an experimental evaluation on a 64-core AMD CPU equipped with 512 GB of memory and an Nvidia A100 GPU with 40GB of memory. For a small dataset where existing coloring algorithms can be executed within the 512 GB memory budget, we show up to 68× memory savings. On massive datasets we demonstrate that GPU-accelerated Picasso can process inputs with 49.5× more Pauli strings (vertex set in our graph) and 2,478× more edges than state-of-the-art parallel approaches.

artificial intelligence, quantum computing↗

Vectorization of Random Number Generation and Reproducibility of Concurrent Particle Transport Simulation

Efficient random number generation with high quality statistical properties and exact reproducibility of Monte Carlo simulations are important requirements in many areas of computational science. VecRNG is a package providing pseudo-random number generation (pRNG) in the context of a new library VecMath. This library bundles up several general-purpose mathematical utilities, data structures, and algorithms having both SIMD and SIMT (GPUs) support based on VecCore.~Several state-of-the-art RNG algorithms are implemented as kernels supporting parallel generation of random numbers in scalar, vector, and Cuda workflows. In this report, we will present design considerations, implementation details, and computing performance of parallel pRNG engines on both CPU and GPU. Reproducibility of propagating multiple particles in parallel for HEP event simulation is demonstrated, using GeantV-based examples, for both sequential and fine-grain track-level concurrent simulation wor kflows. Strategies for efficient uses of vectorized pRNG and non-overlapping streams of random number sequences in concurrent computing environments is discussed as well.

Jun, S. Y.↗

Quantum Algorithm for Approximating Maximum Independent Sets

We present a quantum algorithm for approximating maximum independent sets of a graph based on quantum non-Abelian adiabatic mixing in the sub-Hilbert space of degenerate ground states, which generates quantum annealing in a secondary Hamiltonian. For both sparse and dense random graphs G , numerical simulation suggests that our algorithm on average finds an independent set of size close to the maximum size α ( G ) in low polynomial time. The best classical algorithms, by contrast, produce independent sets of size about half of α ( G ) in polynomial time.

Physics↗

Characterization and thermometry of dissipatively stabilized steady states

In this work we study the properties of dissipatively stabilized steady states of noisy quantum algorithms, exploring the extent to which they can be well approximated as thermal distributions, and proposing methods to extract the effective temperature T. We study an algorithm called the relaxational quantum eigensolver (RQE), which is one of a family of algorithms that attempt to find ground states and balance error in noisy quantum devices. In RQE, we weakly couple a second register of auxiliary ‘shadow’ qubits to the primary system in Trotterized evolution, thus engineering an approximate zero-temperature bath by periodically resetting the auxiliary qubits during the algorithm’s runtime. Balancing the infinite temperature bath of random gate error, RQE returns states with an average energy equal to a constant fraction of the ground state. We probe the steady states of this algorithm for a range of base error rates, using several methods for estimating both T and deviations from thermal behavior. In particular, we both confirm that the steady states of these systems are often well-approximated by thermal distributions, and show that the same resources used for cooling can be adopted for thermometry, yielding a fairly reliable measure of the temperature. These methods could be readily implemented in near-term quantum hardware, and for stabilizing and probing Hamiltonians where simulating approximate thermal states is hard for classical computers.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Hierarchical fractional-step approximations and parallel kinetic Monte Carlo algorithms

We present a mathematical framework for constructing and analyzing parallel algorithms for lattice kinetic Monte Carlo (KMC) simulations. The resulting algorithms have the capacity to simulate a wide range of spatio-temporal scales in spatially distributed, non-equilibrium physiochemical processes with complex chemistry and transport micro-mechanisms. Rather than focusing on constructing exactly the stochastic trajectories, our approach relies on approximating the evolution of observables, such as density, coverage, correlations and so on. More specifically, we develop a spatial domain decomposition of the Markov operator (generator) that describes the evolution of all observables according to the kinetic Monte Carlo algorithm. This domain decomposition corresponds to a decomposition of the Markov generator into a hierarchy of operators and can be tailored to specific hierarchical parallel architectures such as multi-core processors or clusters of Graphical Processing Units (GPUs). Based on this operator decomposition, we formulate parallel Fractional step kinetic Monte Carlo algorithms by employing the Trotter Theorem and its randomized variants; these schemes, (a) are partially asynchronous on each fractional step time-window, and (b) are characterized by their communication schedule between processors. The proposed mathematical framework allows us to rigorously justify the numerical and statistical consistency of the proposed algorithms, showing the convergence of our approximating schemes to the original serial KMC. The approach also provides a systematic evaluation of different processor communicating schedules. We carry out a detailed benchmarking of the parallel KMC schemes using available exact solutions, for example, in Ising-type systems and we demonstrate the capabilities of the method to simulate complex spatially distributed reactions at very large scales on GPUs. Finally, we discuss work load balancing between processors and propose a re-balancing scheme based on probabilistic mass transport methods.

97 MATHEMATICS AND COMPUTING↗

Comparison between beamforming and super resolution imaging algorithms for non-destructive evaluation

In this paper the performance of total focusing method is compared with the widely used time-reversal MUSIC super resolution technique. The algorithms are tested with simulated and experimental ultrasonic array data, each containing different noise levels. The simulated time domain signals allow the effects of array geometry, frequency, scatterer location, scatterer size, scatterer separation and random noise to be carefully controlled. The performance of the imaging algorithms is evaluated in terms of resolution and sensitivity to random noise. It is shown that for the low noise situation, time-reversal MUSIC provides enhanced lateral resolution when compared to the total focusing method. However, for higher noise levels, the total focusing method shows robustness, whilst the performance of time-reversal MUSIC is significantly degraded.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Informing nuclear physics via machine learning methods with differential and integral experiments

Information from differential nuclear-physics experiments and theory is often too uncertain to accurately define nuclear-physics observables such as cross sections or energy spectra. Integral experimental data, representing the applications of these observables, are often more precise but depend simultaneously on too many of them to unambiguously identify issues in the observable with human expert analysis alone. Here, we explore how we can leverage physics knowledge gained from differential experimental data, nuclear theory, integral experiments, and neutron-transport calculations to better understand nuclear-physics observables in the context of the application area represented by integral experiments. We support this task with machine-learning methods to discern trends in a large amount of convoluted data. Differential and integral information was used in an analysis augmented by the random forest and the Shapley additive explanations metric. We chose as an application area one that is represented by criticality measurements and pulsed-sphere neutron-leakage spectra. We show one representative example ( 241 Pu fission observables) where the combination of differential and integral information allowed to resolve issues in data representing these observables. As a starting point, the machine learning (ML) algorithms highlighted several observables as leading potentially to bias in simulating integral experiments. Differential information, paired with sensitivity to integral quantities, allowed us then to pinpoint one specific observable ( 241 Pu fission cross section) as the main driver of bias. The comparison to integral experiments, on the other hand, allowed us to indicate a likely reliable experiment among several discrepant ones for this observables. In other cases (e.g., 239 Pu observables), we were not able to resolve the confounding introduced by integral experiments but instead highlighted the need for targeted new experiments and theory developments to better constrain the nuclear-physics space for the application area represented by integral experiments. We were able to combine information from differential experimental data, nuclear-physics theory, integral experiments, and neutron-transport simulations of the latter experiments with the help of the random forest algorithm and expert judgment. This combination of knowledge allows to improve our description of nuclear-physics observables as applied to a particular application area.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Optimal Control of a Surge-Mode WEC in Random Waves

The objective of this project was to develop one or more real-time feedback and feed-forward (MPC) control algorithms for an Oscillating Surge Wave Converter (OSWC) developed by RME called SurgeWEC™ that leverages recent innovations in wave energy converter (WEC) control theory to maximize power production in random wave environments. The control algorithms synthesized innovations in dynamic programming and nonlinear wave dynamics using anticipatory wave sensors and localized sensor measurements; e.g. position and velocity of the WEC Power Take Off (PTO), with predictive wave forecasting data. The result was an advanced control system that uses feedback or feed-forward data from an array of sensor channels comprised of both localized and deployed sensors fused into a single decision process that optimally compensates for uncertainties in the system dynamics, wave forecasts, and sensor measurement errors.

16 TIDAL AND WAVE POWER↗

Efficient quantum circuit implementation of quantum walks

Quantum walks, being the quantum analog of classical random walks, are expected to provide a fruitful source of quantum algorithms. A few such algorithms have already been developed, including the 'glued trees' algorithm, which provides an exponential speedup over classical methods, relative to a particular quantum oracle. Here, we discuss the possibility of a quantum walk algorithm yielding such an exponential speedup over possible classical algorithms, without the use of an oracle. We provide examples of some highly symmetric graphs on which efficient quantum circuits implementing quantum walks can be constructed and discuss potential applications to quantum search for marked vertices along these graphs.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Artificial Diversity and Defense Security (ADDSec)

Artificial Diversity and Defense Security (ADDSec) machine learning algorithms are used to classify and cluster threats so that an appropriate response can be initiated as a mitigation strategy. The package includes an ensemble of machine learning algorithms such as Support Vector Machines, naïve bayes, logistic regression, and random forest that evolve with the data to recognize anomalous behavior at the host and network levels. Inputs into the machine learning algorithms include end host system calls, system utilization, packet captures, and syslog messages. The machine learning algorithms can be retrained based on user defined intervals or on the number of packets received. ADDSEC's threat responses include Internet Protocol (IP) Address randomization, application port number randomization, and application library randomization. The IP randomization implementation is built on top of a Software Defined Networking (SDN) framework. The SDN controller installs flows on each of the SDN switches with randomized source and destination IP addresses. The application port numbers are randomized using iptables. The application library randomization is created with a LLVM compiler. All randomization schemes are transparent to the endpoints on the network. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525. SAND2021-3379 O

Cox, RebeccaE.↗