Search NASA⌕ Search

SEARCH · Search NASA

Results for “Computer 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,207 records · Page 67

Sensitivity of Spaceborne and Ground Radar Comparison Results to Data Analysis Methods and Constraints

With the availability of active weather radar observations from space from the Precipitation Radar (PR) on board the Tropical Rainfall Measuring Mission (TR.MM) satellite, numerous studies have been performed comparing PR reflectivity and derived rain rates to similar observations from ground-based weather radars (GR). These studies have used a variety of algorithms to compute matching PR and GR volumes for comparison. Most studies have used a fixed 3-dimensional Cartesian grid centered on the ground radar, onto which the PR and GR data are interpolated using a proprietary approach and/or commonly available GR analysis software (e.g., SPRINT, REORDER). Other studies have focused on the intersection of the PR and GR viewing geometries either explicitly or using a hybrid of the fixed grid and PR/GR common fields of view. For the Dual-Frequency Precipitation Radar (DPR) of the upcoming Global Precipitation Measurement (GPM) mission, a prototype DPR/GR comparison algorithm based on similar TRMM PR data has been developed that defines the common volumes in terms of the geometric intersection of PR and GR rays, where smoothing of the PR and GR data are minimized and no interpolation is performed. The PR and GR volume-averaged reflectivity values of each sample volume are accompanied by descriptive metadata, for attributes including the variability and maximum of the reflectivity within the sample volume, and the fraction of range gates in the sample average having reflectivity values above an adjustable detection threshold (typically taken to be 18 dBZ for the PR). Sample volumes are further characterized by rain type (Stratiform or Convective), proximity to the melting layer, underlying surface (land/water/mixed), and the time difference between the PR and GR observations. The mean reflectivity differences between the PR and GR can differ between data sets produced by the different analysis methods; and for the GPM prototype, by the type of constraints and categorization applied to the data. In this paper, we will show results comparing the 3-D gridded analysis "black box" approach to the GPM prototype volume-matching approach, using matching TRMM PR and WSR-88D ground radar data. The affects of applying data constraints and data categorizations on the volume-matched data to the results will be shown, and explanations of the differences in terms of data and analysis algorithm characteristics will be presented. Implications of the differences to the determination of PR/DPR calibration differences and use of ground radar data to evaluate the PR and DPR attenuation correction algorithms will be discussed.

Morris, Kenneth R.↗

Assessing decision boundaries under uncertainty

In order to make design decisions, engineers may seek to identify regions of the design domain that are acceptable in a computationally efficient manner. A design is typically considered acceptable if its reliability with respect to parametric uncertainty exceeds the designer’s desired level of confidence. Despite major advancements in reliability estimation and in design classification via decision boundary estimation, the current literature still lacks a design classification strategy that incorporates parametric uncertainty and desired design confidence. To address this gap, this paper offers a novel interpretation of the acceptance region by defining the decision boundary as the hypersurface which isolates the designs that exceed a user-defined level of confidence given parametric uncertainty. This work addresses the construction of this novel decision boundary using computationally efficient algorithms that were developed for reliability analysis and decision boundary estimation. The approach proposed in this paper is verified on two physical examples from structural and thermal analysis using Support Vector Machines and Efficient Global Optimization-based contour estimation.

97 MATHEMATICS AND COMPUTING↗

rBahadur: efficient simulation of structured high-dimensional genotype data with applications to assortative mating

Existing methods for generating synthetic genotype data are ill-suited for replicating the effects of assortative mating (AM). We propose rb_dplr, a novel and computationally efficient algorithm for generating high-dimensional binary random variates that effectively recapitulates AM-induced genetic architectures using the Bahadur order-2 approximation of the multivariate Bernoulli distribution. The rBahadur R library is available through the Comprehensive R Archive Network at https://CRAN.R-project.org/package=rBahadur.

59 BASIC BIOLOGICAL SCIENCES↗

Development of a Numerical Model for High-Temperature Shape Memory Alloys

A thermomechanical hysteresis model for a high-temperature shape memory alloy (HTSMA) actuator material is presented. The model is capable of predicting strain output of a tensile-loaded HTSMA when excited by arbitrary temperature-stress inputs for the purpose of actuator and controls design. Common quasi-static generalized Preisach hysteresis models available in the literature require large sets of experimental data for model identification at a particular operating point, and substantially more data for multiple operating points. The novel algorithm introduced here proposes an alternate approach to Preisach methods that is better suited for research-stage alloys, such as recently-developed HTSMAs, for which a complete database is not yet available. A detailed description of the minor loop hysteresis model is presented in this paper, as well as a methodology for determination of model parameters. The model is then qualitatively evaluated with respect to well-established Preisach properties and against a set of low-temperature cycled loading data using a modified form of the one-dimensional Brinson constitutive equation. The computationally efficient algorithm demonstrates adherence to Preisach properties and excellent agreement to the validation data set.

DeCastro, Jonathan A.↗

Radiative processes on a quantum computer

Radiative processes, where a photon/neutrino is emitted as a result of a collision or decay of a particle, play a central role in atomic, nuclear, and particle physics. Their rate is determined by certain off-diagonal matrix elements between different initial and final states. We propose a method to compute them using quantum computers. It relies on a single extra qubit that, in a certain sense, represents the photon/neutrino. The generic formula relating this matrix element to the amplitude and frequency of oscillations of the extra qubit is derived for the near-resonance case. Furthermore, we demonstrate the feasibility of the method by using it in actual quantum computations and simulations of simple systems.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Muon Tracing and Image Reconstruction Algorithms for Cosmic Ray Muon Computed Tomography

Cosmic ray muon-computed tomography (μCT) is a new imaging modality with unique characteristics that could be particularly important for diverse applications including nuclear nonproliferation, spent nuclear fuel monitoring, cargo scanning, and volcano imaging. The strong scattering dependence of muons on atomic number Z in combination with high penetration range could offer a significant advantage over existing techniques when dense, shielded containers must be imaged. However, μCT reconstruction using conventional filtered back-projection is limited due to the overly simple assumptions that do not consider the curved path caused by multiple Coulomb scattering prompting the need for more sophisticated approaches to be developed. Here, we argue that the use of improved muon tracing and scattering angle projection algorithms as well as an algebraic reconstruction technique should produce muon tomographic images with improved quality–or require fewer muons to produce the same image quality–compared to the case where conventional methods are used. We report on the development and assessment of three novel muon tracing methods and two scattering angle projection methods for μCT. Simulated dry storage casks with single and partial missing fuel assemblies were used as numerical examples to assess and compare the proposed methods. The reconstructed images showed an expected improvement in image quality when compared with conventional techniques, even without muon momentum information, which should lead to improved detection capability, even for partial defects.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

pnnl/HyperNetX

HyperNetX is a Python library of classes, algorithms, and generators for working with multi-way and nested relational data. Given a network of nodes and relationships, the base class HyperNetX.Entity is used to instantiate individual data elements along with their relationships to other elements of the network. By exploiting Python's dictionary data structure we capture both multi-way and nested data structures with constant time lookup. The base class HyperNetX.Hypergraph instantiates a network of this data into a hypergraph structure. Many of the common metrics and features of graphs, such as diameter, connectedness, and clustering coefficient, have analogous definitions with respect to hypergraphs, which are computed using algorithms in the HyperNetX library.

Praggastis, Brenda↗

Modeling the Effective Elasticity of Anisotropic Porous Materials

The development and optimization of composite materials designed for thermal protection of NASA’s spacecraft require understanding their physical response to high-enthalpy environments. To predict their macro-scale properties and behavior, high-fidelity 3D simulations are performed at the microscale on realistic representations of these composites. The digital microstructures are generated either synthetically or through X-ray micro-computed tomography reconstructions. One of the main challenges in the prediction of the structural response of heatshield materials is the computation of the effective elasticity of the fibrous composite, as well as the understanding of the deformation and stresses generated at the microscale. These are driven by the fiber layout within the microstructure and the distribution of the infused matrix. In this effort, the micro-mechanical linear elastic behavior of fibrous ablators is modeled using a numerical method based on the Multi-Point Stress Approximation (MPSA) finite volume scheme, a generalization of the more commonly used Multi-Point Flux Approximation (MPFA) that was presented at the 10th Ablation Workshop. To predict the behavior of fibrous and woven architectures, algorithms that compute the local fiber orientation are used. The implementation of the MPSA was verified using analytical solutions, engineering test cases, and compared against legacy Finite Element Analysis (FEA) software. The stress analysis models were then applied to real geometries used by NASA in thermal protection systems such as fibrous preforms and woven materials and the results were compared to experimental data.

Elasticity↗

A versatile system for processing geostationary satellite data with run-time visualization capability

To better predict global climate change, scientists are developing climate models that require interdisciplinary and collaborative efforts in their building. We are currently involved in several such projects but will briefly discuss activities in support of two such complementary projects: the Atmospheric Radiation Measurement (ARM) program of the Department of Energy and Sequoia 2000, a joint venture of the University of California, the private sector, and government agencies. Our contribution to the ARM program is to investigate the role of clouds on the top of the atmosphere and on surface radiance fields through the data analysis of surface and satellite observations and complex modeling of the interaction of radiation with clouds. One of our first ARM research activities involves the computation of the broadband shortwave surface irradiance from satellite observations. Geostationary satellite images centered over the first ARM observation site are received hourly over the Internet network and processed in real time to compute hourly and daily composite shortwave irradiance fields. The images and the results are transferred via a high-speed network to the Sequoia 2000 storage facility in Berkeley, where they are archived These satellite-derived results are compared with the surface observations to evaluate the accuracy of the satellite estimate and the spatial representation of the surface observations. In developing the software involved in calculating the surface shortwave irradiance, we have produced an environment whereby we can easily modify and monitor the data processing as required. Through the principles of modular programming, we have developed software that is easily modified as new algorithms for computation are developed or input data availability changes. In addition, the software was designed so that it could be run from an interactive, icon-driven, graphical interface, TCL-TK, developed by Sequoia 2000 participants. In this way, the data flow can be interactively assessed and altered as needed. In this environment, the intermediate data processing 'images' can be viewed, enabling the investigator to easily monitor the various data processing steps as they progress. Additionally, this environment allows the rapid testing of new processing modules and allows their effects to be visually compared with previous results.

Landsfeld, M.↗

Examination of Semi-Analytical Solution Methods in the Coarse Operator of Parareal Algorithm for Power System Simulation

With continuing advances in high-performance parallel computing platforms, parallel algorithms have become powerful tools for development of faster than real-time power system dynamic simulations. In particular, it has been demonstrated in recent years that parallel-in-time (Parareal) algorithms have the potential to achieve such an ambitious goal. Here, the selection of a fast and reasonably accurate coarse operator of the Parareal algorithm is crucial for its effective utilization and performance. This paper examines semi-analytical solution (SAS) methods as the coarse operators of the Parareal algorithm and explores performance of the SAS methods to the standard numerical time integration methods. Two promising time-power series-based SAS methods were considered; Adomian decomposition method and Homotopy analysis method with a windowing approach for improving the convergence. Numerical performance case studies on 10-generator 39-bus system and 327-generator 2383-bus system were performed for these coarse operators over different disturbances, evaluating the number of Parareal iterations, computational time, and stability of convergence. All the coarse operators tested with different scenarios have converged to the same corresponding true solution (if they are convergent) and the SAS methods provide comparable computational speed, while having more stable convergence to the true solution in many cases.

97 MATHEMATICS AND COMPUTING↗

Adaptive Wavelet Decomposition of Matrix Flows

Adaptive algorithms for constructing spline-wavelet decompositions of matrix flows from a linear space of matrices over a normed field are presented. The algorithms suggested provides for an a priori prescribed estimate of the deviation of the basic flow from the initial one. Comparative bounds of the volumes of data in the basic flow for various irregularity characteristics of the initial flow are obtained in the cases of pseudo-equidistant and adaptive grids. Limit characteristics of the above-mentioned volumes are given in the cases where the initial flow is generated by differentiable functions.

97 MATHEMATICS AND COMPUTING↗

Emergent hydrodynamic mode on SU(2) plaquette chains and quantum simulation

We search for emergent hydrodynamic modes in real-time Hamiltonian dynamics of 2+1-dimensional SU(2) lattice gauge theory on a quasi-one-dimensional plaquette chain, by numerically computing symmetric correlation functions of energy densities on lattice sizes of about 20 with the local Hilbert space truncated at 𝑗 max = $\frac{1}{2}$. Because of the Umklapp processes, we only find a mode for energy diffusion. The symmetric correlator exhibits transport peak near zero frequency with a width approximately proportional to momentum squared at small momentum, when the system is fully quantum ergodic, as indicated by the eigenenergy level statistics. This transport peak leads to a power-law 𝑡 −$\frac{1}{2}$ decay of the symmetric correlator at late time, also known as the long-time tail, as well as diffusionlike spreading in position space. We also introduce a quantum algorithm for computing the symmetric correlator on a quantum computer and find it gives results consistent with exact diagonalization when tested on the IBM emulator. Finally we discuss the future prospect of searching for the sound modes.

Hamiltonian systems↗

Computing the effective elasticity of anisotropic porous media from X-ray computed micro-tomography images

Development and optimization of composite materials designed for thermal protection of NASA’s spacecraft requires the understanding of their physical response to high-enthalpy environments. To predict their macro-scale properties and behavior, high-fidelity 3D simulations are performed at the micro-scale on realistic representations of these composites. The digital micro-structures are generated either synthetically or through X-ray micro-tomography reconstructions. One of the main challenges in the prediction of heatshield material structural response is the computation of the effective elasticity of the fibrous composite, as well as the understanding of the deformation and stresses generated at the micro-scale. These are driven by the fiber layout within the micro-structure and the distribution of the infused matrix. In this effort, the micro-mechanical linear elastic behavior of fibrous ablators is modeled through the use of a numerical method based on the Multi-Point Stress Approximation (MPSA) finite volume scheme. The MPSA, a generalization of the more commonly used Multi-Point Flux Approximation (MPFA), was discussed in a previous presentation at the 15th USCCN and in reference. To predict the behavior of fibrous and woven architectures, algorithms that compute the local fiber orientation are used. The implementation of the MPSA was verified using analytical solutions, engineering test cases and compared against legacy Finite Element Analysis (FEA) software. The stress analysis models were then applied to real geometries used by NASA in thermal protection systems such as fibrous preforms and woven materials and the results were compared to experimental data.

Federico Semeraro↗

Evaluation of Digital Image Recognition Methods for Mass Spectrometry Imaging Data Analysis

Analyzing mass spectrometry imaging data can be laborious and time consuming, and as the size and complexity of datasets grow, so does the need for robust automated processing methods. We here present a method for comprehensive, semi-targeted discovery of molecular distributions of interest from mass spectrometry imaging data, using widely available image similarity scoring algorithms to rank images by spatial correlation. A fast and powerful batch search method using a MATLAB implementation of structural similarity (SSIM) index scoring with a pre-selected reference distribution is demonstrated for two sample imaging datasets, a plant metabolite study using Artemisia annua leaf, and a drug distribution study using maraviroc-dosed macaque tissue. .

97 MATHEMATICS AND COMPUTING↗

Application of adaptive multilevel splitting on coupled neutron-photon TRIPOLI-4{sup R} Monte Carlo simulations - 25427

In the context of radiation protection simulations, the Adaptive Multilevel Splitting (AMS) algorithm is a challenging variance reduction (VR) technique that has been recently investigated in the field of particle transport simulation. It has been implemented in the forthcoming version 11 of the Monte Carlo code TRIPOLI-4{sup R} and successfully tested in neutron-only and photon-only configurations. This paper addresses the application of the AMS algorithm to coupled simulations, and particularly to neutron-photon Monte Carlo calculations. The branching process occurring during the Monte Carlo coupled transport is taken into account in the new coupled-AMS algorithm and is explained in this paper. Two different neutron-photon configurations are then investigated, leading to a comparison of the coupled-AMS algorithm with the analog simulation on the one hand, and with the Exponential Transform (ET) on the other hand, which is the standard VR technique of TRIPOLI-4. Gains up to 30 are obtained in terms of Figure of Merit relatively to the analog simulation, which is about 4 to 6 times more efficient than the ET method for these configurations. (authors)

61 RADIATION PROTECTION AND DOSIMETRY↗

Change-point Detection and Image Segmentation for Time Series of Astrophysical Images

Many astrophysical phenomena are time-varying, in the sense that their intensity, energy spectrum, and/or the spatial distribution of the emission suddenly change. This paper develops a method for modeling a time series of images. Under the assumption that the arrival times of the photons follow a Poisson process, the data are binned into 4D grids of voxels (time, energy band, and x-y coordinates), and viewed as a time series of non-homogeneous Poisson images. The method assumes that at each time point, the corresponding multiband image stack is an unknown 3D piecewise constant function including Poisson noise. It also assumes that all image stacks between any two adjacent change points (in time domain) share the same unknown piecewise constant function. The proposed method is designed to estimate the number and the locations of all of the change points (in time domain), as well as all of the unknown piecewise constant functions between any pairs of the change points. The method applies the minimum description length principle to perform this task. A practical algorithm is also developed to solve the corresponding complicated optimization problem. Simulation experiments and applications to real data sets show that the proposed method enjoys very promising empirical properties. Applications to two real data sets, the XMM observation of a flaring star and an emerging solar coronal loop, illustrate the usage of the proposed method and the scientific insight gained from it.

79 ASTRONOMY AND ASTROPHYSICS↗

An overlapped grid method for multigrid, finite volume/difference flow solvers: MaGGiE

The objective is to develop a domain decomposition method via overlapping/embedding the component grids, which is to be used by upwind, multi-grid, finite volume solution algorithms. A computer code, given the name MaGGiE (Multi-Geometry Grid Embedder) is developed to meet this objective. MaGGiE takes independently generated component grids as input, and automatically constructs the composite mesh and interpolation data, which can be used by the finite volume solution methods with or without multigrid convergence acceleration. Six demonstrative examples showing various aspects of the overlap technique are presented and discussed. These cases are used for developing the procedure for overlapping grids of different topologies, and to evaluate the grid connection and interpolation data for finite volume calculations on a composite mesh. Time fluxes are transferred between mesh interfaces using a trilinear interpolation procedure. Conservation losses are minimal at the interfaces using this method. The multi-grid solution algorithm, using the coaser grid connections, improves the convergence time history as compared to the solution on composite mesh without multi-gridding.

Baysal, Oktay↗

Towards an Agent-Based Blackboard System for Reactor Design Optimization

The field of reactor design is rich with opportunities for applications of computational optimization algorithms; these applications can range from preliminary core design to reactor shuffling patterns. Many of these schemes rely on sets of previously generated solutions (sometimes referred to as “generations”) to inform future decisions. While it is important to build upon prior knowledge, this process requires a full generation of solutions to be formed before future solutions can be examined. Rather than relying on a generational scheme to perform an optimization, we propose using an agent-based approach in conjunction with a blackboard framework for performing reactor design optimizations. Utilizing an agent-based approach allows agents to perform tasks independently, while retaining the ability to build off of previous solutions. We develop an agent-based blackboard system (ABBS) for determining the Pareto front (PF) in sodium fast reactor design optimization problems and compared this with the Non-Dominated Sorting Genetic Algorithm II (NSGA-II). Our goal is to evaluate the viability of the ABBS in producing a PF that is comparable with the NSGA-II algorithm. The design space consists of the fuel height, fuel smear, and plutonium fraction in the core, and we seek to minimize the reactivity swing and plutonium mass, while maximizing the burnup. The diversity, coverage, and spread of the PFs generated by the two methods are examined, and the ABBS is able to converge to the same PF as the NSGA-II algorithm. These results show that the ABBS is able to find optimal designs that are similar to those found by the NSGA-II algorithm. We conclude our study by applying the ABBS to the design of a sodium-cooled fast reactor to dispose of weapons-grade plutonium. The ABBS finds a core design that can burn upwards of 17.5 kg of weapons-grade plutonium per year and degrade an additional 195 kg of weapons-grade plutonium per year into non-weapons-grade material.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗