Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algorithmic efficiency”

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 703 records · Page 39

Sensitivity of Turbine-Height Wind Speeds to Parameters in Planetary Boundary-Layer and Surface-Layer Schemes in the Weather Research and Forecasting Model

We evaluate the sensitivity of simulated turbine-height winds to 26 parameters applied in a planetary boundary layer (PBL) scheme and a surface layer scheme of the Weather Research and Forecasting (WRF) model over an area of complex terrain during the Columbia Basin Wind Energy Study. An efficient sampling algorithm and a generalized linear model are used to explore the multiple-dimensional parameter space and quantify the parametric sensitivity of modeled turbine-height winds. The results indicate that most of the variability in the ensemble simulations is contributed by parameters related to the dissipation of the turbulence kinetic energy (TKE), Prandtl number, turbulence length scales, surface roughness, and the von Kármán constant. The relative contributions of individual parameters are found to be dependent on both the terrain slope and atmospheric stability. The parameter associated with the TKE dissipation rate is found to be the most important one, and a larger dissipation rate can produce larger hub-height winds. A larger Prandtl number results in weaker nighttime winds. Increasing surface roughness reduces the frequencies of both extremely weak and strong winds, implying a reduction in the variability of the wind speed. All of the above parameters can significantly affect the vertical profiles of wind speed, the altitude of the low-level jet and the magnitude of the wind shear strength. The wind direction is found to be modulated by the same subset of influential parameters. Remainder of abstract is in attachment.

54 ENVIRONMENTAL SCIENCES↗

Automatic Code Generation for High-Performance Graph Algorithms

Graph problems are common across fields of scientific computing and social sciences. However, despite their importance, implementing graph algorithms effectively on modern computing systems is a challenging task that requires significant programming effort and generally results in customized implementations. Current computing and memory hierarchies are not architected for irregular computations resulting in challenges for graph algorithms to achieve high performance on those architectures. In this paper, we present GraphX, a novel compiler framework and DSL designed to simplify the development of efficient graph algorithms and achieve high performance on modern computing systems. GraphX consists of a DSL for efficient implementation of graph algorithms, various optimizations, such as support for sparse linear algebra and workspace transformations, optimized graph primitives, including semiring and masking, and a high-performance code generation engine. Using GraphX, users can implement graph algorithms using a semantically-rich language with graph-oriented operators. GraphX uses these semantics to automatically generate efficient code for target architectures, increasing performance and portability across architectures. The composable nature of GraphX makes it possible to extend the set of optimizations and architectures without modifying the source code. We demonstrate GraphX outperforms state-of-the-art graph libraries, such as LAGraph, up to $3.7 speedup in semiring operations, $2.19 speedup in an important sparse computational kernel, and $9.05 speedup in graph processing algorithms.

compiler, graph algorithms, semiring, masking, wor↗

An Artificial Neural Network Model to Predict the Bainite Plate Thickness of Nanostructured Bainitic Steels Using an Efficient Network-Learning Algorithm

Nanostructured bainitic steel has an extraordinary ultrahigh strength of about 2.0 GPa along with good toughness of 30 MPa m{sup 1/2}. The finer thickness of plate 20-80 nm is largely responsible for achieving such a large hardness of 690-720 HV. In this work, a multilayer perceptron-based artificial neural network (ANN) model has been developed to predict the thickness of bainite plate pertaining to nanostructured bainitic steels. The inputs of the ANN model are, namely, Gibbs free energy for bainitic transformation, austenite strength, transformation temperature for bainite and carbon concentration in the steel. The model prediction revealed that the bainite plate thickness critically depends on austenite strength and Gibbs free energy. From the neural prediction, it is concluded that formation of nanostructured bainitic steel is feasible only if sufficient austenite strength (above 165 MPa) has been achieved. This can be accomplished with a minimum carbon content of 0.5 wt.% in steel and transformation temperature below 300 °C. Higher driving force (Gibbs free energy) below − 1800 J/mol is another prerequisite condition of formation of nanostructured bainite steel. The network-learning architecture has been optimized using the Broyden–Fletcher–Goldfarb–Shanno (BFGS) algorithm to minimize the network training error within eight training cycles. The algorithm facilitates a faster convergence of network training and testing errors.

36 MATERIALS SCIENCE↗

Exact and efficient hybrid Monte Carlo algorithm for accelerated Bayesian inference of gene expression models from snapshots of single-cell transcripts

Single cells exhibit a significant amount of variability in transcript levels, which arises from slow, stochastic transitions between gene expression states. Elucidating the nature of these states and understanding how transition rates are affected by different regulatory mechanisms require state-of-the-art methods to infer underlying models of gene expression from single cell data. A Bayesian approach to statistical inference is the most suitable method for model selection and uncertainty quantification of kinetic parameters using small data sets. However, this approach is impractical because current algorithms are too slow to handle typical models of gene expression. To solve this problem, we first show that time-dependent mRNA distributions of discrete-state models of gene expression are dynamic Poisson mixtures, whose mixing kernels are characterized by a piecewise deterministic Markov process. Here, we combined this analytical result with a kinetic Monte Carlo algorithm to create a hybrid numerical method that accelerates the calculation of time-dependent mRNA distributions by 1000-fold compared to current methods. We then integrated the hybrid algorithm into an existing Monte Carlo sampler to estimate the Bayesian posterior distribution of many different, competing models in a reasonable amount of time. We demonstrate that kinetic parameters can be reasonably constrained for modestly sampled data sets if the model is known a priori. If there are many competing models, Bayesian evidence can rigorously quantify the likelihood of a model relative to other models from the data. We demonstrate that Bayesian evidence selects the true model and outperforms approximate metrics typically used for model selection.

59 BASIC BIOLOGICAL SCIENCES↗

TARGET SELECTION FOR THE APACHE POINT OBSERVATORY GALACTIC EVOLUTION EXPERIMENT (APOGEE)

The Apache Point Observatory Galactic Evolution Experiment (APOGEE) is a high-resolution infrared spectroscopic survey spanning all Galactic environments (i.e., bulge, disk, and halo), with the principal goal of constraining dynamical and chemical evolution models of the Milky Way. APOGEE takes advantage of the reduced effects of extinction at infrared wavelengths to observe the inner Galaxy and bulge at an unprecedented level of detail. The survey's broad spatial and wavelength coverage enables users of APOGEE data to address numerous Galactic structure and stellar populations issues. In this paper we describe the APOGEE targeting scheme and document its various target classes to provide the necessary background and reference information to analyze samples of APOGEE data with awareness of the imposed selection criteria and resulting sample properties. APOGEE's primary sample consists of {approx}10{sup 5} red giant stars, selected to minimize observational biases in age and metallicity. We present the methodology and considerations that drive the selection of this sample and evaluate the accuracy, efficiency, and caveats of the selection and sampling algorithms. We also describe additional target classes that contribute to the APOGEE sample, including numerous ancillary science programs, and we outline the targeting data that will be included in the public data releases.

79 ASTRONOMY AND ASTROPHYSICS↗

An Efficient Area-Based Algorithm for SAR Radiometric Terrain Correction and Map Projection

This article presents a projection algorithm based on the representation of radar samples as area elements, rather than point elements as traditionally done in previous works. Each area element in the geographic grid (geogrid) is associated with a set of samples in the radar grid that intersect completely or partially the area element according to the topography and the radar geometry. Accurate geocoding with adaptive multi-looking is achieved by successively assigning the weighted average of the radar samples to the corresponding geogrid elements. Analogously, the slant-range projection of geocoded data is improved by projecting the geogrid pixels onto the radar grid according to their projected area. When our slant-range projection approach is used within previously-published radiometric terrain correction (RTC) algorithms, the processing time is significantly reduced, performing 3.6 to 5.2 times faster over multi-looked data and up to 8.9 over single-look data. We demonstrate the strength of the area projection algorithm for RTC and geocoding using UAVSAR and Sentinel-1 data, and evaluate the results in the context of the upcoming NISAR mission.

Shiroma, Gustavo H↗

Efficient geometric rectification techniques for spectral analysis algorithm

The spectral analysis algorithm is a viable technique for processing synthetic aperture radar (SAR) data in near real time throughput rates by trading the image resolution. One major challenge of the spectral analysis algorithm is that the output image, often referred to as the range-Doppler image, is represented in the iso-range and iso-Doppler lines, a curved grid format. This phenomenon is known to be the fanshape effect. Therefore, resampling is required to convert the range-Doppler image into a rectangular grid format before the individual images can be overlaid together to form seamless multi-look strip imagery. An efficient algorithm for geometric rectification of the range-Doppler image is presented. The proposed algorithm, realized in two one-dimensional resampling steps, takes into consideration the fanshape phenomenon of the range-Doppler image as well as the high squint angle and updates of the cross-track and along-track Doppler parameters. No ground reference points are required.

Chang, C. Y.↗

Fast Gaussian wavepacket transforms and Gaussian beams for the Schroedinger equation

This paper introduces a wavepacket-transform-based Gaussian beam method for solving the Schroedinger equation. We focus on addressing two computational issues of the Gaussian beam method: how to generate a Gaussian beam representation for general initial conditions and how to perform long time propagation for any finite period of time. To address the first question, we introduce fast Gaussian wavepacket transforms and develop on top of them an efficient initialization algorithm for general initial conditions. Based on this new initialization algorithm, we address the second question by reinitializing the beam representation when the beams become too wide. Numerical examples in one, two, and three dimensions demonstrate the efficiency and accuracy of the proposed algorithms. The methodology can be readily generalized to deal with other semi-classical quantum mechanical problems.

97 MATHEMATICS AND COMPUTING↗

Explaining Missing Data in Graphs: A Constraint-based Approach

Abstract: This paper introduces a constraint-based approach to clarify missing values in graphs. Our method capitalizes on a set S of graph data constraints. An explanation is a sequence of operational enforcement of S towards the recovery of interested yet missing data (e.g., attribute values, edges). We show that constraint-based approach helps us to understand not only why a value is missing, but also how to recover the missing value. We study S-explanation problem, which is to compute the optimal explanations with guarantees on the informativeness and conciseness. We show the problem is in ?P^2 for established graph data constraints such as graph keys and graph association rules. We develop an efficient bidirectional algorithm to compute optimal explanations, without enforcing S on the entire graph. We also show our algorithm can be easily extended to support graph refinement within limited time, and to explain missing answers. Using real-world graphs, we experimentally verify the effectiveness and efficiency of our algorithms.

Data Analytics↗

Generalization of mixed multiscale finite element methods with applications

Many science and engineering problems exhibit scale disparity and high contrast. The small scale features cannot be omitted in the physical models because they can affect the macroscopic behavior of the problems. However, resolving all the scales in these problems can be prohibitively expensive. As a consequence, some types of model reduction techniques are required to design efficient solution algorithms. For practical purpose, we are interested in mixed finite element problems as they produce solutions with certain conservative properties. Existing multiscale methods for such problems include the mixed multiscale finite element methods. We show that for complicated problems, the mixed multiscale finite element methods may not be able to produce reliable approximations. This motivates the need of enrichment for coarse spaces. Two enrichment approaches are proposed, one is based on generalized multiscale finte element metthods (GMsFEM), while the other is based on spectral element-based algebraic multigrid (rAMGe). The former one, which is called mixed GMsFEM, is developed for both Darcy’s flow and linear elasticity. Application of the algorithm in two-phase flow simulations are demonstrated. For linear elasticity, the algorithm is subtly modified due to the symmetry requirement of the stress tensor. The latter enrichment approach is based on rAMGe. The algorithm differs from GMsFEM in that both of the velocity and pressure spaces are coarsened. Due the multigrid nature of the algorithm, recursive application is available, which results in an efficient multilevel construction of the coarse spaces. Stability, convergence analysis, and exhaustive numerical experiments are carried out to validate the proposed enrichment approaches. iii

97 MATHEMATICS AND COMPUTING↗

The Pointing Self-calibration Algorithm for Aperture Synthesis Radio Telescopes

This paper is concerned with algorithms for calibration of direction-dependent effects (DDE) in aperture synthesis radio telescopes (ASRT). After correction of direction-independent effects (DIE) using self-calibration, imaging performance can be limited by the imprecise knowledge of the forward gain of the elements in the array. In general, the forward gain pattern is directionally dependent and varies with time due to a number of reasons. Some factors, such as rotation of the primary beam with Parallactic Angle for Azimuth–Elevation mount antennas are known a priori. Some, such as antenna pointing errors and structural deformation/projection effects for aperture-array elements cannot be measured a priori. Thus, in addition to algorithms to correct for DD effects known a priori, algorithms to solve for DD gains are required for high dynamic range imaging. Here, we discuss a mathematical framework for antenna-based DDE calibration algorithms and show that this framework leads to computationally efficient optimal algorithms that scale well in a parallel computing environment. As an example of an antenna-based DD calibration algorithm, we demonstrate the Pointing SelfCal (PSC) algorithm to solve for the antenna pointing errors. Our analysis show that the sensitivity of modern ASRT is sufficient to solve for antenna pointing errors and other DD effects. We also discuss the use of the PSC algorithm in real-time calibration systems and extensions for antenna Shape SelfCal algorithm for real-time tracking and corrections for pointing offsets and changes in antenna shape.

79 ASTRONOMY AND ASTROPHYSICS↗