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 1,711 records · Page 95

Global Load Balancing with Parallel Mesh Adaption on Distributed-Memory Systems

Dynamic mesh adaptation on unstructured grids is a powerful tool for efficiently computing unsteady problems to resolve solution features of interest. Unfortunately, this causes load inbalances among processors on a parallel machine. This paper described the parallel implementation of a tetrahedral mesh adaption scheme and a new global load balancing method. A heuristic remapping algorithm is presented that assigns partitions to processors such that the redistribution coast is minimized. Results indicate that the parallel performance of the mesh adaption code depends on the nature of the adaption region and show a 35.5X speedup on 64 processors of an SP2 when 35 percent of the mesh is randomly adapted. For large scale scientific computations, our load balancing strategy gives an almost sixfold reduction in solver execution times over non-balanced loads. Furthermore, our heuristic remappier yields processor assignments that are less than 3 percent of the optimal solutions, but requires only 1 percent of the computational time.

Biswas, Rupak↗

How Can We Harness the Power of Machine Learning With TEMPO Data?

There are many potential applications of machine learning for TEMPO data that include - Improve retrievals by reducing the effect of random instrument noise - Expand coverage by producing data in moderately cloudy conditions (see also Fasnacht et al. poster) - Help diagnose impacts of instrumental artifacts - Produce value-added products quickly by training on existing products from other sensors (land and ocean) - Speed up processing by training on products produced with full-physics algorithms (e.g., NO 2 slant column fitting may take ~1 hour/orbit but with a neural net it may take only minutes)

NO2↗

Direct estimation of the density of states for fermionic systems

Simulating time evolution is one of the most natural applications of quantum computers and is thus one of the most promising prospects for achieving practical quantum advantage. Here, we develop quantum algorithms to extract thermodynamic properties by estimating the density of states (DOS), which is a central object in quantum statistical mechanics. We introduce several key innovations that significantly improve the practicality and extend the generality of previous techniques. First, our approach allows one to estimate the DOS only for a specific subspace of the full Hilbert space. This is crucial for fermionic systems, since both canonical and grand canonical ensemble thermal equilibrium properties depend on subspaces of fixed number. Second, in our approach, by time evolving very simple, random initial states, such as randomly chosen computational basis states, we can exactly recover the DOS on average. Third, due to circuit-depth limitations, we only reconstruct the DOS up to a convolution with a Gaussian window—thus all imperfections that shift the energy levels by less than the width of the convolution window will not significantly affect the estimated DOS. For these reasons, we find the approach is a promising candidate for early quantum advantage as even short-time, noisy dynamics can yield a semiquantitative reconstruction of the DOS (convolution with a broad Gaussian window), while early fault-tolerant devices will likely enable higher-resolution DOS reconstruction through longer time evolutions. We demonstrate the practicality of our approach in representative Fermi-Hubbard and spin models and indeed find that our approach is highly robust against algorithmic errors in the time evolution and against gate noise. We further demonstrate that our approach is compatible with noisy intermediate-scale quantum (NISQ) computing NISQ-friendly variational techniques, introducing and leveraging a technique for variational time evolution.

97 MATHEMATICS AND COMPUTING↗

GEOMETRIC AND DYNAMICAL MODELS OF REVERBERATION MAPPING DATA

We present a general method to analyze reverberation (or echo) mapping data that simultaneously provides estimates for the black hole mass and for the geometry and dynamics of the broad-line region (BLR) in active galactic nuclei (AGNs). While previous methods yield a typical scale size of the BLR or a reconstruction of the transfer function, our method directly infers the spatial and velocity distribution of the BLR from the data, from which a transfer function can be easily derived. Previous echo mapping analysis requires an independent estimate of a scaling factor known as the virial coefficient to infer the mass of the black hole, but this is not needed in our more direct approach. We use the formalism of Bayesian probability theory and implement a Markov Chain Monte Carlo algorithm to obtain estimates and uncertainties for the parameters of our BLR models. Fitting of models to the data requires knowledge of the continuum flux at all times, not just the measured times. We use Gaussian Processes to interpolate and extrapolate the continuum light curve data in a fully consistent probabilistic manner, taking the associated errors into account. We illustrate our method using simple models of BLR geometry and dynamics and show that we can recover the parameter values of our test systems with realistic uncertainties that depend upon the variability of the AGN and the quality of the reverberation mapping observing campaign. With a geometry model we can recover the mean radius of the BLR to within {approx}0.1 dex random uncertainty for simulated data with an integrated line flux uncertainty of 1.5%, while with a dynamical model we can recover the black hole mass and the mean radius to within {approx}0.05 dex random uncertainty, for simulated data with a line profile average signal-to-noise ratio of 4 per spectral pixel. These uncertainties do not include modeling errors, which are likely to be present in the analysis of real data, and should therefore be considered as lower limits to the accuracy of the method.

79 ASTRONOMY AND ASTROPHYSICS↗

NSE abundance data

A novel method of calculating nuclear statistical equilibrium (NSE) is presented. Basic equations are carefully solved using arbitrary precision arithmetic. A special interpolation procedure is then used to retrieve all abundances using tabulated results for neutrons and protons, together with basic nuclear data. Proton and neutron abundance tables, basic nuclear data, and partition functions for nuclides used in the calculations are provided. A simple interpolation algorithm using pre-calculated p and n abundances tabulated as functions of kT, {rho} and Y{sub e} is outlined. Unique properties of this method are: (1) ability to pick up out of NSE selected nuclei only, (2) computational time scaling linearly with number of re-calculated abundances, (3) relatively small amount of stored data: only two large tables, (4) slightly faster than solving the NSE equations using traditional Newton-Raphson methods for small networks (few tens of species); superior for huge (800-3000) networks, (5) does not require initial guess; works well on random input, (6) can be tailored to specific application, (7) ability to use third-party NSE solvers to obtain fully compatible tables, and (8) encapsulation of the NSE code for bug-free calculations. A range of applications for this approach is possible: covering tests of traditional NSE Newton-Raphson codes, generating starting values, code-to-code verification, and possible replacement of the old legacy procedures in supernova simulations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A microbenchmark characterization of the Emu chick

The Emu Chick is a prototype system designed around the concept of migratory memory-side processing. Rather than transferring large amounts of data across power-hungry, high-latency interconnects, the Emu Chick moves lightweight thread contexts to near-memory cores before the beginning of each memory read. The current prototype hardware uses FPGAs to implement cache-less “Gossamer” cores for computational work and rely on a typical stationary core (PowerPC) to run basic operating system functions and migrate threads between nodes. In this multi-node characterization of the Emu Chick, we extend an earlier single-node investigation of the the memory bandwidth characteristics of the system through benchmarks like STREAM, pointer chasing, and sparse matrix-vector multiplication. Here, we compare the Emu Chick hardware to architectural simulation and an Intel Xeon-based platform. Our results demonstrate that for many basic operations the Emu Chick can use available memory bandwidth more efficiently than a more traditional, cache-based architecture although bandwidth usage suffers for computationally intensive workloads like SpMV. Moreover, the Emu Chick provides stable, predictable performance with up to 65% of the peak bandwidth utilization on a random-access pointer chasing benchmark with weak locality.

97 MATHEMATICS AND COMPUTING↗

Estimating contact rates at a mass gathering by using video analysis: a proof-of-concept project

Current approaches for estimating social mixing patterns and infectious disease transmission at mass gatherings have been limited by various constraints, including low participation rates for volunteer-based research projects and challenges in quantifying spatially and temporally accurate person-to-person interactions. We developed a proof-of-concept project to assess the use of automated video analysis for estimating contact rates of attendees of the GameFest 2013 event at Rensselaer Polytechnic Institute (RPI) in Troy, New York. Video tracking and analysis algorithms were used to estimate the number and duration of contacts for 5 attendees during a 3-minute clip from the RPI video. Attendees were considered to have a contact event if the distance between them and another person was ≤1 meter. Contact duration was estimated in seconds. We also simulated 50 attendees assuming random mixing using a geospatially accurate representation of the same GameFest location. The 5 attendees had an overall median of 2 contact events during the 3-minute video clip (range: 0 6). Contact events varied from less than 5 seconds to the full duration of the 3- minute clip. The random mixing simulation was visualized and presented as a contrasting example. We were able to estimate the number and duration of contacts for five GameFest attendees from a 3-minute video clip that can be compared to a random mixing simulation model at the same location. In conclusion, the next phase will involve scaling the system for simultaneous analysis of mixing patterns from hours-long videos and comparing our results with other approaches for collecting contact data from mass gathering attendees.

59 BASIC BIOLOGICAL SCIENCES↗

OPERA models for predicting physicochemical properties and environmental fate endpoints

The collection of chemical structure information and associated experimental data for quantitative structure–activity/ property relationship (QSAR/QSPR) modeling is facilitated by an increasing number of public databases containing large amounts of useful data. However, the performance of QSAR models highly depends on the quality of the data and modeling methodology used. This study aims to develop robust QSAR/QSPR models for chemical properties of environmental interest that can be used for regulatory purposes. This study primarily uses data from the publicly available PHYSPROP database consisting of a set of 13 common physicochemical and environmental fate properties. These datasets have undergone extensive curation using an automated workflow to select only high-quality data, and the chemical structures were standardized prior to calculation of the molecular descriptors. The modeling procedure was developed based on the five Organization for Economic Cooperation and Development (OECD) principles for QSAR models. A weighted k-nearest neighbor approach was adopted using a minimum number of required descriptors calculated using PaDEL, an open-source software. The genetic algorithms selected only the most pertinent and mechanistically interpretable descriptors (2–15, with an average of 11 descriptors). The sizes of the modeled datasets varied from 150 chemicals for biodegradability half-life to 14,050 chemicals for logP, with an average of 3222 chemicals across all endpoints. The optimal models were built on randomly selected training sets (75%) and validated using fivefold cross-validation (CV) and test sets (25%). The CV Q2 of the models varied from 0.72 to 0.95, with an average of 0.86 and an R2 test value from 0.71 to 0.96, with an average of 0.82. Modeling and performance details are described in QSAR model reporting format and were validated by the European Commission’s Joint Research Center to be OECD compliant. All models are freely available as an open-source, command-line application called OPEn structure–activity/property Relationship App (OPERA). OPERA models were applied to more than 750,000 chemicals to produce freely available predicted data on the U.S. Environmental Protection Agency’s CompTox Chemistry Dashboard.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A Further Look at X-33 Entry Guidance and Beyond

An entry guidance design developed at Iowa State University (ISU) for the X-33 advanced technology demonstrator is outlined and compared with the X-33 entry guidance algorithms developed at NASA Marshall. Both designs are based on the Space Shuttle entry guidance concept, but significant improvements have been made to enhance the performance and reduce the complexity. The ISU design was incorporated into MAVERIC, a high fidelity vehicle simulation software for the X-33, and evaluated in Monte Carlo simulations against random dispersions in propulsion system, wind and atmospheric properties, aerodynamic coefficients, interaction between propulsion and aerodynamics, and navigation data. The simulations clearly demonstrated the capability and precision of the ISU entry guidance design in successfully guiding the X-33 in some rather difficult flight scenarios. As the entry guidance development for the X-33 is completing, this report also offers some review of the strength and limitations of the current Shuttle-based entry guidance framework, and finally some potential candidates for next generation of more capable and cost-effective entry guidance designs are discussed.

Lu, Ping↗

Relationship Between Surface Reflectance in the Visible and Mid-IR used in MODIS Aerosol Algorithm-Theory

Data from the Moderate Resolution Imaging Spectroradiometer (MODIS) instrument that flies in polar orbit on the Terra platform, are used to derive the aerosol optical thickness and properties over land and ocean. The relationships between visible reflectance (at blue, rho(sub blue), and red, rho(sub red)) and mid-infrared (at 2.1 microns, rho(sub 2.1)) are used in the MODIS aerosol retrieval algorithm to derive global distribution of aerosols over the land. These relations have been established from a series of measurements indicating that rho(sub blue) is approximately 0.5 rho(sub red) is approximately 0.25 rho(sub 2.1). Here we use a model to describe the transfer of radiation through a vegetation canopy composed of randomly oriented leaves to assess the theoretical foundations for these relationships. Calculations for a wide range of leaf area indices and vegetation fractions show that rho(sub blue) is consistently about 1/4 of rho(sub 2.1) as used by MODIS for the whole range of analyzed cases, except for very dark soils, such as those found in burn scars. For its part, the ratio rho(sub red)/rho(sub 2.1) varies from less than the empirically derived value of 1/2 for dense and dark vegetation, to more than 1/2 for bright mixture of soil and vegetation. This is in agreement with measurements over uniform dense vegetation, but not with measurements over mixed dark scenes. In the later case the discrepancy is probably mitigated by shadows due to uneven canopy and terrain on a large scale. It is concluded that the value of this ratio should ideally be made dependent on the land cover type in the operational processing of MODIS data, especially over dense forests.

Kaufman, Yoram J.↗

On the Natural Structure of Amino Acid Patterns in Families of Protein Sequences

All known terrestrial proteins are coded as continuous strings of ≈20 amino acids. The patterns formed by the repetitions of elements in groups of finite sequences describes the natural architectures of protein families. We present a method to search for patterns and groupings of patterns in protein sequences using a mathematically precise definition for “repetition”, an efficient algorithmic implementation and a robust scoring system with no adjustable parameters. We show that the sequence patterns can be well-separated into disjoint classes according to their recurrence in nested structures. The statistics of the occurrences of patterns indicate that short repetitions are sufficient to account for the differences between natural families and randomized groups of sequences by more than 10 standard deviations, while contiguous sequence patterns shorter than 5 residues are effectively random in their occurrences. A small subset of patterns is sufficient to account for a robust ”familiarity” definition between arbitrary sets of sequences.

Pablo Turjanski↗

Sparse Bayesian Regression with Integrated Feature Selection for Nuclear Reactor Analysis

High-dimensional, nonlinear function estimation using large datasets is a current area of interest in the machine learning community, and applications may be found throughout the analytical sciences, where ever-growing datasets are making more information available to the analyst. In this paper, we leverage the existing relevance vector machine, a sparse Bayesian version of the well-studied support vector machine, and expand the method to include integrated feature selection and automatic function shaping. These innovations produce an algorithm that is able to distinguish variables that are useful for making predictions of a response from variables that are unrelated or confusing. We test the technology using synthetic data, conduct initial performance studies, and develop a model capable of making position-independent predictions of the coreaveraged burnup using a single specimen drawn randomly from a nuclear reactor core.

Dayman, Ken J↗

Generalized master equation for particle transport in binary random media with renewal statistics

Particle transport in binary stochastic mixtures is classically modeled assuming Markovian or exponential mixing statistics but in many applications material memory invalidates the Markov assumption. For non-Markovian mixing characterized by alternating renewal processes, a transport-theoretic framework is presented that provides an exact description of transport in nonscattering random binary media with general non-exponential statistics. Our approach is to Markovianize the problem by augmenting the {material type, particle flux} state space with the age or distance from the last interface. A Chapman-Kolmogorov equation is formulated for the joint probability density of the material type, particle flux, and age, and subsequently reduced to a generalized Master equation (GME) in differential form. This constitutes the primary result of this work. A state-updating Monte Carlo algorithm consistent with the GME is developed and benchmarked against analytical solutions for multiple chord-length laws. For purely absorbing renewal statistical media, the GME reproduces analytical benchmarks for the equilibrium age distribution, interior mean/variance of material-conditioned fluxes, and boundary transmittance. Simulations further demonstrate that a Markov (exponential) approximation of non-exponential statistics can introduce large errors in transmittance and interior flux profiles. Lastly, the reintroduction of memory due to scattering is briefly addressed through heuristic considerations.

Fluctuations & noise↗

Simulation Model of Mobile Detection Systems

In this paper, we consider a mobile source that we attempt to detect with man-portable, vehicle-mounted or boat-mounted radiation detectors. The source is assumed to transit an area populated with these mobile detectors, and the objective is to detect the source before it reaches a perimeter. We describe a simulation model developed to estimate the probability that one of the mobile detectors will come in to close proximity of the moving source and detect it. We illustrate with a maritime simulation example. Our simulation takes place in a 10 km by 5 km rectangular bay patrolled by boats equipped with 2-inch x 4-inch x 16-inch NaI detectors. Boats to be inspected enter the bay and randomly proceed to one of seven harbors on the shore. A source-bearing boat enters the mouth of the bay and proceeds to a pier on the opposite side. We wish to determine the probability that the source is detected and its range from target when detected. Patrol boats select the nearest in-bound boat for inspection and initiate an intercept course. Once within an operational range for the detection system, a detection algorithm is started. If the patrol boat confirms the source is not present, it selects the next nearest boat for inspection. Each run of the simulation ends either when a patrol successfully detects a source or when the source reaches its target. Several statistical detection algorithms have been implemented in the simulation model. First, a simple k-sigma algorithm, which alarms with the counts in a time window exceeds the mean background plus k times the standard deviation of background, is available to the user. The time window used is optimized with respect to the signal-to-background ratio for that range and relative speed. Second, a sequential probability ratio test [Wald 1947] is available, and configured in this simulation with a target false positive probability of 0.001 and false negative probability of 0.1. This test is utilized when the mobile detector maintains a constant range to the vessel being inspected. Finally, a variation of the sequential probability ratio test that is more appropriate when source and detector are not at constant range is available [Nelson 2005]. Each patrol boat in the fleet can be assigned a particular zone of the bay, or all boats can be assigned to monitor the entire bay. Boats assigned to a zone will only intercept and inspect other boats when they enter their zone. In our example simulation, each of two patrol boats operate in a 5 km by 5 km zone. Other parameters for this example include: (1) Detection range - 15 m range maintained between patrol boat and inspected boat; (2) Inbound boat arrival rate - Poisson process with mean arrival rate of 30 boats per hour; (3) Speed of boats to be inspected - Random between 4.5 and 9 knots; (4) Patrol boat speed - 10 knots; (5) Number of detectors per patrol boat - 4-2-inch x 4-inch x 16-inch NaI detectors; (6) Background radiation - 40 counts/sec per detector; and (7) Detector response due to radiation source at 1 meter - 1,589 counts/sec per detector. Simulation results indicate that two patrol boats are able to detect the source 81% of the time without zones and 90% of the time with zones. The average distances between the source and target at the end of the simulation is 5,866 km and 5,712 km for non-zoned and zoned patrols, respectively. Of those that did not reach the target, the average distance to the target is 7,305 km and 6,441 km respectively. Note that a design trade-off exists. While zoned patrols provide a higher probability of detection, the nonzoned patrols tend to detect the source farther from its target. Figure 1 displays the location of the source at the end of 1,000 simulations for the 5 x 10 km bay simulation. The simulation model and analysis described here can be used to determine the number of mobile detectors one would need to deploy in order to have a have reasonable chance of detecting a source in transit. By fixing the source speed to zero, the same model could be used to estimate how long it would take to detect a stationary source. For example, the model could predict how long it would take plant staff performing assigned duties carrying dosimeters to discover a contaminated spot in the facility.

61 RADIATION PROTECTION AND DOSIMETRY↗

Short-Depth QAOA circuits and Quantum Annealing on Higher-Order Ising Models (Rev.2)

The Quantum Alternating Operator Ansatz (QAOA) and Quantum Annealing (QA) are quantum algorithms that are both based on the adiabatic theorem and both have the goal of sampling the optimal solution(s) of combinatorial optimization problems. Quantum annealing has been physically instantiated on D-Wave devices using superconducting flux qubits, and QAOA can be programmed on digital gate-model quantum computers such as the programmable superconducting transmon qubits devices of the IBMQ series, for instance ibm washington. QAOA and QA address the same types of problems, but it is unclear how they will scale to large problem sizes and to larger and higher-fidelity quantum computers. In this article, we present a direct comparison between QAOA, one and two rounds, run on all 127 qubits of ibm washington and QA run on D-Wave Advantage system4.1 and Advantage system6.1. The problems which allow for this comparison are random Ising model problems whose connectivity matches the heavy hexagonal lattice topology of ibm washington and the Pegasus graph connectivity of the two D-Wave devices. We create two classes of problem instances for this comparison: one with higher order terms (ZZZ variable interactions), linear terms, and quadratic terms, and a separate problem type with only linear and quadratic terms. Our QAOA circuits are novel and extremely short depth, with a CNOT depth of 6 per round, which allows whole chip usage of ibm washington’s heavy hexagonal lattice and can be applied to future heavy-hex chips. We also test the effectiveness of the error suppression technique digital dynamical decoupling on the QAOA circuits. The QAOA circuits compiled to ibm washington are composed of several thousand circuit instructions, approximately 3, 000 depending on the details of the circuit, making these some the largest quantum circuits ever executed on a digital quantum processor. QAOA and QA are compared against the classical heuristic algorithm of simulated annealing and all problem instances are exactly solved using CPLEX in order to evaluate which samplers, if any, correctly found the ground state solution(s) of the problem instances. We find that (i) QA outperforms QAOA on all problem instances, (ii) QAOA samples the problems better than random sampling, and (iii) QAOA angle computation exhibits clear parameter concentration across the ensemble of Ising models.

127 Qubits↗

Error Convergence Characterization for Stochastic Transport Methods

There has been increased interest in reliably and efficiently solving engineering systems involving uncertainty in recent years. Characterization of the convergence of errors within the problem, including statistical and bias errors, increases confidence that chosen solution methods are appropriate for a particular problem and quantity of interest (QoI), that implementation errors have not been made, and can aid users or algorithms in solving problems within a tolerance efficiently. We demonstrate a method for characterizing error convergence in a simple stochastic transport problem. Though the approach is applicable to problems with more complicated physics, our simple problem enables analytic QoI solutions so that error convergence behavior and the identification of limiting errors can be presented with high precision. A one-dimensional, two-material, neutral-particle, and absorption-only transport problem involving uniformly distributed uncertain total cross sections is presented. Random sampling (RS) and stochastic collocation (SC) are used as stochastic solvers which sample from the uncertain space and Monte Carlo (MC) transport is employed to solve transport results on the resulting realizations. Probability density functions (PDFs) are created using either RS solutions or samples taken from a polynomial chaos expansion (PCE) constructed with SC solutions. The convergence of each solver is characterized with respect to the QoI against analytic solutions, convergence behavior is used to efficiently solve a QoI within a tolerance, and convergence plots are used to identify dominant solution errors.

42 ENGINEERING↗

Combinatorial theory of the semiclassical evaluation of transport moments II: Algorithmic approach for moment generating functions

Electronic transport through chaotic quantum dots exhibits universal behaviour which can be understood through the semiclassical approximation. Within the approximation, calculation of transport moments reduces to codifying classical correlations between scattering trajectories. These can be represented as ribbon graphs and we develop an algorithmic combinatorial method to generate all such graphs with a given genus. This provides an expansion of the linear transport moments for systems both with and without time reversal symmetry. The computational implementation is then able to progress several orders further than previous semiclassical formulae as well as those derived from an asymptotic expansion of random matrix results. The patterns observed also suggest a general form for the higher orders.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Image-based model of the spectrin cytoskeleton for red blood cell simulation

We simulate deformable red blood cells in the microcirculation using the immersed boundary method with a cytoskeletal model that incorporates structural details revealed by tomographic images. The elasticity of red blood cells is known to be supplied by both their lipid bilayer membranes, which resist bending and local changes in area, and their cytoskeletons, which resist in-plane shear. The cytoskeleton consists of spectrin tetramers that are tethered to the lipid bilayer by ankyrin and by actin-based junctional complexes. We model the cytoskeleton as a random geometric graph, with nodes corresponding to junctional complexes and with edges corresponding to spectrin tetramers such that the edge lengths are given by the end-to-end distances between nodes. The statistical properties of this graph are based on distributions gathered from three-dimensional tomographic images of the cytoskeleton by a segmentation algorithm. We show that the elastic response of our model cytoskeleton, in which the spectrin polymers are treated as entropic springs, is in good agreement with the experimentally measured shear modulus. By simulating red blood cells in flow with the immersed boundary method, we compare this discrete cytoskeletal model to an existing continuum model and predict the extent to which dynamic spectrin network connectivity can protect against failure in the case of a red cell subjected to an applied strain. As a result, the methods presented here could form the basis of disease- and patient-specific computational studies of hereditary diseases affecting the red cell cytoskeleton.

59 BASIC BIOLOGICAL SCIENCES↗