Search NASA⌕ Search

SEARCH · Search NASA

Results for “generalized 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,729 records · Page 96

Report of experiments and evidence for ASC L2 milestone 4467: demonstration of a legacy application's path to exascale

This report documents thirteen of Sandia's contributions to the Computational Systems and Software Environment (CSSE) within the Advanced Simulation and Computing (ASC) program between fiscal years 2009 and 2012. It describes their impact on ASC applications. Most contributions are implemented in lower software levels allowing for application improvement without source code changes. Improvements are identified in such areas as reduced run time, characterizing power usage, and Input/Output (I/O). Other experiments are more forward looking, demonstrating potential bottlenecks using mini-application versions of the legacy codes and simulating their network activity on Exascale-class hardware. The purpose of this report is to prove that the team has completed milestone 4467-Demonstration of a Legacy Application's Path to Exascale. Cielo is expected to be the last capability system on which existing ASC codes can run without significant modifications. This assertion will be tested to determine where the breaking point is for an existing highly scalable application. The goal is to stretch the performance boundaries of the application by applying recent CSSE RD in areas such as resilience, power, I/O, visualization services, SMARTMAP, lightweight LWKs, virtualization, simulation, and feedback loops. Dedicated system time reservations and/or CCC allocations will be used to quantify the impact of system-level changes to extend the life and performance of the ASC code base. Finally, a simulation of anticipated exascale-class hardware will be performed using SST to supplement the calculations. Determine where the breaking point is for an existing highly scalable application: Chapter 15 presented the CSSE work that sought to identify the breaking point in two ASC legacy applications-Charon and CTH. Their mini-app versions were also employed to complete the task. There is no single breaking point as more than one issue was found with the two codes. The results were that applications can expect to encounter performance issues related to the computing environment, system software, and algorithms. Careful profiling of runtime performance will be needed to identify the source of an issue, in strong combination with knowledge of system software and application source code.

99 GENERAL AND MISCELLANEOUS↗

Asynchronous Programming in UPC: A Case Study and Potential for Improvement

In a traditional Partitioned Global Address Space language like UPC, an application programmer works with the model of a static set of threads performing locality-aware accesses on a global address space. On the other hand, asynchronous programming provides a simple interface for expressing the concurrency in dynamic, irregular algorithms, with the prospect of efficient portable execution from sophisticated runtime schemes handling the exposed concurrency. In this paper, we adopt the asynchronous style of programming to parallelize a nested, tree-based code in UPC. To maximize performance without losing the ease of application programming, we design Asynchronous Remote Methods as a potential extension to the UPC standard. Our prototype implementation of this construct in Berkeley UPC yields within 7% of ideal performance and 20-fold improvement over the original Standard UPC solution in some cases.

97 MATHEMATICS AND COMPUTING↗

Modifying the Asynchronous Jacobi Method for Data Corruption Resilience

Moving scientific computation from high-performance computing (HPC) and cloud computing (CC) environments to devices on the edge, i.e., physically near instruments of interest, has received tremendous interest in recent years. Such edge computing environments can operate on data in situ, offering enticing benefits over data aggregation to HPC and CC facilities that include avoiding costs of transmission, increased data privacy, and real-time data analysis. Because of the inherent unreliability of edge computing environments, new fault-tolerant approaches must be developed before the benefits of edge computing can be realized. Motivated by algorithm-based fault tolerance, a variant of the asynchronous Jacobi (ASJ) method is developed that achieves resilience to data corruption by rejecting solution approximations from neighbor devices according to a bound derived from convergence theory. Numerical results on a two-dimensional Poisson problem show that the new rejection criterion, along with a novel approximation to the shortest path length on which the criterion depends, restores convergence for the ASJ variant in the presence of certain types data corruption. Numerical results are obtained for when the singular values in the analytic bound are approximated. Additional linear systems are also explored, one with a more dense sparsity pattern and one that includes advection. All results indicate that successful resilience to data corruption depends on whether the bound tightens fast enough to reject corrupted data before the iteration evolution deviates significantly from that predicted by the convergence theory defining the bound. This observation generalizes to future work on algorithm-based fault tolerance for other asynchronous algorithms, including upcoming approaches that leverage Krylov subspaces.

97 MATHEMATICS AND COMPUTING↗

A simple introduction to the SiMPL method for density-based topology optimization

We introduce a novel method for solving density-based topology optimization problems: Sigmoidal Mirror descent with a Projected Latent variable (SiMPL). The SiMPL method (pronounced as “the simple method”) optimizes a design using only first-order derivative information of the objective function. The bound constraints on the density field are enforced with the help of the (negative) Fermi–Dirac entropy, which is also used to define a non-symmetric distance function called a Bregman divergence on the set of admissible designs. This Bregman divergence leads to a simple update rule that is further simplified with the help of a so-called latent variable. Because the SiMPL method involves discretizing the latent variable, it produces a sequence of pointwise-feasible iterates, even when high-order finite elements are used in the discretization. Numerical experiments demonstrate that the method outperforms other popular first-order optimization algorithms. In conclusion, to outline the general applicability of the technique, we include examples with (self-load) compliance minimization and compliant mechanism optimization problems.

Calculus of Variations and Optimization↗

An l1-TV algorithm for deconvolution with salt and pepper noise

There has recently been considerable interest in applying Total Variation with an {ell}{sup 1} data fidelity term to the denoising of images subject to salt and pepper noise, but the extension of this formulation to more general problems, such as deconvolution, has received little attention, most probably because most efficient algorithms for {ell}{sup 1}-TV denoising can not handle more general inverse problems. We apply the Iteratively Reweighted Norm algorithm to this problem, and compare performance with an alternative algorithm based on the Mumford-Shah functional.

99 GENERAL AND MISCELLANEOUS↗

Bayesian Neural Networks for Uncertainty Analysis of Hydrologic Modeling: A Comparison of Two Schemes

Bayesian Neural Networks (BNNs) have been shown as useful tools to analyze modeling uncertainty of Neural Networks (NNs). This research focuses on the comparison of two BNNs. The first BNNs (BNN-I) use statistical methods to describe the characteristics of different uncertainty sources (input, parameter, and model structure) and integrate these uncertainties into a Markov Chain Monte Carlo (MCMC) framework to estimate total uncertainty. The second BNNs (BNN-II) lump all uncertainties into a single error term (i.e. the residual between model prediction and measurement). In this study, we propose a simple BNN-II, which use Genetic Algorithms (GA) and Bayesian Model Averaging (BMA) to calibrate Neural Networks with different structures (number of hidden units) and combine the predictions from different NNs to derive predictions and uncertainty analysis. We tested these two BNNs in two watersheds for daily and monthly hydrologic simulation. The BMA based BNNs developed in this study outperforms BNN-I in the two watersheds in terms of both accurate prediction and uncertainty estimation. These results show that, given incomplete understanding of the characteristics associated with each uncertainty source, the simple lumped error approach may yield better prediction and uncertainty estimation.

99 GENERAL AND MISCELLANEOUS↗

Characterization of composite nanoparticles using an improved light scattering

The objectives of this paper are twofold. First, the paper developed an improved algorithm to perform light scattering calculations by coated spheres. The improved algorithm was implemented in FORTRAN90 as a subroutine to allow flexible application of the code. Second, the new program was applied to the characterization of composite aluminum nanoparticles. In this application, multiple elements of the Mueller scattering matrix were measured at multiple angles to infer the properties of the nanoparticles, including the size distribution function and the thickness of the coating. The new program played a key role in the fitting of the measured data, and this application demonstrated the advantages of the new program in situations that demand high efficiency and reliability.

99 GENERAL AND MISCELLANEOUS↗

Automatic Layout Design for Power Module

The layout of power modules is one of the most important elements in power module design, especially for high power densities, where couplings are increased. In this paper, an automatic design process using a genetic algorithm is presented. Some practical considerations are introduced in the optimization of the layout design of the module. This paper presents a process for automatic layout design for high power density modules. Detailed GA implementations are introduced both for outer loop and inner loop. As verified by a design example, the results of the automatic design process presented here are better than those from manual design and also better than the results from a popular design software. This automatic design procedure could be a major step toward improving the overall performance of future layout design.

99 GENERAL AND MISCELLANEOUS↗

Fast-forwarding quantum simulation with real-time quantum Krylov subspace algorithms

Quantum subspace diagonalization (QSD) algorithms have emerged as a competitive family of algorithms that avoid many of the optimization pitfalls associated with parameterized quantum circuit algorithms. While the vast majority of the QSD algorithms have focused on solving the eigenpair problem for ground, excited-state, and thermal observable estimation, there has been a lot less work in considering QSD algorithms for the problem of quantum dynamical simulation. In this work, we propose several quantum Krylov fast-forwarding (QKFF) algorithms capable of predicting long-time dynamics well beyond the coherence time of current quantum hardware. Our algorithms use real-time evolved Krylov basis states prepared on the quantum computer and a multi-reference subspace method to ensure convergence towards high-fidelity, long-time dynamics. In particular, we show that the proposed multi-reference methodology provides a systematic way of trading off circuit depth with classical post-processing complexity. Further, we also demonstrate the efficacy of our approach through numerical implementations for several quantum chemistry problems including the calculation of the auto-correlation and dipole moment correlation functions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Reversed Cherenkov-Transition Radiation by a Charge Crossing a Left-Handed Medium Boundary

We analyze the radiation from a charged particle crossing the boundary between an ordinary medium and a 'left-handed' metamaterial. We obtain exact and approximate expressions for the field components and develop algorithms for their computation. The spatial radiation in this system can be separated into three distinct components, corresponding to ordinary transition radiation having a relatively large magnitude, Cherenkov radiation, and reversed Cherenkov-transition radiation (RCTR). The last one is explained by reflection and refraction of reversed Cherenkov radiation at the interface. Conditions for generating of RCTR are obtained. We note properties of this radiation that have potential applications in the detection of charged particles and accelerator beams and for the characterization of metamaterial macroscopic parameters (epsilon, mu).

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Seismic Data Acquisition at the FACT Site for the CASPAR Project

Since May 2010, we have been recording continuous seismic data at Sandia's FACT site. The collected signals provide us with a realistic archive for testing algorithms under development for local monitoring of explosive testing. Numerous small explosive tests are routinely conducted around Kirtland AFB by different organizations. Our goal is to identify effective methods for distinguishing these events from normal daily activity on and near the base, such as vehicles, aircraft, and storms. In this report, we describe the recording system, and present some observations of the varying ambient noise conditions at FACT. We present examples of various common, non-explosive, sources. Next we show signals from several small explosions, and discuss their characteristic features.

58 GEOSCIENCES↗

MOLECULAR CLOUDS AND CLUMPS IN THE BOSTON UNIVERSITY-FIVE COLLEGE RADIO ASTRONOMY OBSERVATORY GALACTIC RING SURVEY

The Boston University-Five College Radio Astronomy Observatory (BU-FCRAO) Galactic Ring Survey (GRS) of {sup 13}CO J = 1 {yields} 0 emission covers Galactic longitudes 18{sup 0} < l < 55.{sup 0}7 and Galactic latitudes |b| {<=} 1{sup 0}. Using the SEQUOIA array on the FCRAO 14 m telescope, the GRS fully sampled the {sup 13}CO Galactic emission (46'' angular resolution on a 22'' grid) and achieved a spectral resolution of 0.21 km s{sup -1}. Because the GRS uses {sup 13}CO, an optically thin tracer, rather than {sup 12}CO, an optically thick tracer, the GRS allows a much better determination of column density and also a cleaner separation of velocity components along a line of sight. With this homogeneous, fully sampled survey of {sup 13}CO emission, we have identified 829 molecular clouds and 6124 clumps throughout the inner Galaxy using the CLUMPFIND algorithm. Here we present details of the catalog and a preliminary analysis of the properties of the molecular clouds and their clumps. Moreover, we compare clouds inside and outside of the 5 kpc ring and find that clouds within the ring typically have warmer temperatures, higher column densities, larger areas, and more clumps compared with clouds located outside the ring. This is expected if these clouds are actively forming stars. This catalog provides a useful tool for the study of molecular clouds and their embedded young stellar objects.

79 ASTRONOMY AND ASTROPHYSICS↗

IMPROVED SIMULATION OF NON-GAUSSIAN TEMPERATURE AND POLARIZATION COSMIC MICROWAVE BACKGROUND MAPS

We describe an algorithm to generate temperature and polarization maps of the cosmic microwave background (CMB) radiation containing non-Gaussianity of arbitrary local type. We apply an optimized quadrature scheme that allows us to predict and control integration accuracy, speed up the calculations, and reduce memory consumption by an order of magnitude. We generate 1000 non-Gaussian CMB temperature and polarization maps up to a multipole moment of l{sub max} = 1024. We validate the method and code using the power spectrum and the fast cubic (bispectrum) estimator and find consistent results. The simulations are provided to the community.

79 ASTRONOMY AND ASTROPHYSICS↗

A change detection approach to moving object detection in low frame-rate video

Moving object detection is of significant interest in temporal image analysis since it is a first step in many object identification and tracking applications. A key component in almost all moving object detection algorithms is a pixel-level classifier, where each pixel is predicted to be either part of a moving object or part of the background. In this paper we investigate a change detection approach to the pixel-level classification problem and evaluate its impact on moving object detection. The change detection approach that we investigate was previously applied to multi-and hyper-spectral datasets, where images were typically taken several days, or months apart. In this paper, we apply the approach to low-frame rate (1-2 frames per second) video datasets.

99 GENERAL AND MISCELLANEOUS↗

Cazymes Analysis Toolkit (CAT): Webservice for searching and analyzing carbohydrateactive enzymes in a newly sequenced organism using CAZy database

The Carbohydrate-Active Enzyme (CAZy) database provides a rich set of manually annotated enzymes that degrade, modify, or create glycosidic bonds. Despite rich and invaluable information stored in the database, software tools utilizing this information for annotation of newly sequenced genomes by CAZy families are limited. We have employed two annotation approaches to fill the gap between manually curated high-quality protein sequences collected in the CAZy database and the growing number of other protein sequences produced by genome or metagenome sequencing projects. The first approach is based on a similarity search against the entire non-redundant sequences of the CAZy database. The second approach performs annotation using links or correspondences between the CAZy families and protein family domains. The links were discovered using the association rule learning algorithm applied to sequences from the CAZy database. The approaches complement each other and in combination achieved high specificity and sensitivity when cross-evaluated with the manually curated genomes of Clostridium thermocellum ATCC 27405 and Saccharophagus degradans 2-40. The capability of the proposed framework to predict the function of unknown protein domains (DUF) and of hypothetical proteins in the genome of Neurospora crassa is demonstrated. The framework is implemented as a Web service, the CAZymes Analysis Toolkit (CAT), and is available at http://cricket.ornl.gov/cgi-bin/cat.cgi.

59 BASIC BIOLOGICAL SCIENCES↗

Spectral relationships between kicked Harper and on-resonance double kicked rotor operators

Kicked Harper operators and on-resonance double kicked rotor operators model quantum systems whose semiclassical limits exhibit chaotic dynamics. Recent computational studies indicate a striking resemblance between the spectra of these operators. In this paper we apply C*-algebra methods to explain this resemblance. We show that each pair of corresponding operators belongs to a common rotation C*-algebra B{sub {alpha}}, prove that their spectra are equal if {alpha} is irrational, and prove that the Hausdorff distance between their spectra converges to zero as q increases if {alpha}=p/q with p and q coprime integers. Moreover, we show that corresponding operators in B{sub {alpha}} are homomorphic images of mother operators in the universal rotation C*-algebra A{sub {alpha}} that are unitarily equivalent and hence have identical spectra. These results extend analogous results for almost Mathieu operators. We also utilize the C*-algebraic framework to develop efficient algorithms to compute the spectra of these mother operators for rational {alpha} and present preliminary numerical results that support the conjecture that their spectra are Cantor sets if {alpha} is irrational. This conjecture for almost Mathieu operators, called the ten Martini problem, was recently proven after intensive efforts over several decades. This proof for the almost Mathieu operators utilized transfer matrix methods, which do not exist for the kicked operators. We outline a strategy, based on a special property of loop groups of semisimple Lie groups, to prove this conjecture for the kicked operators.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Scalable tensor factorizations with incomplete data.

The problem of incomplete data - i.e., data with missing or unknown values - in multi-way arrays is ubiquitous in biomedical signal processing, network traffic analysis, bibliometrics, social network analysis, chemometrics, computer vision, communication networks, etc. We consider the problem of how to factorize data sets with missing values with the goal of capturing the underlying latent structure of the data and possibly reconstructing missing values (i.e., tensor completion). We focus on one of the most well-known tensor factorizations that captures multi-linear structure, CANDECOMP/PARAFAC (CP). In the presence of missing data, CP can be formulated as a weighted least squares problem that models only the known entries. We develop an algorithm called CP-WOPT (CP Weighted OPTimization) that uses a first-order optimization approach to solve the weighted least squares problem. Based on extensive numerical experiments, our algorithm is shown to successfully factorize tensors with noise and up to 99% missing data. A unique aspect of our approach is that it scales to sparse large-scale data, e.g., 1000 x 1000 x 1000 with five million known entries (0.5% dense). We further demonstrate the usefulness of CP-WOPT on two real-world applications: a novel EEG (electroencephalogram) application where missing data is frequently encountered due to disconnections of electrodes and the problem of modeling computer network traffic where data may be absent due to the expense of the data collection process.

99 GENERAL AND MISCELLANEOUS↗

Using adaptive proper orthogonal decomposition to solve the reaction-diffusion equation

We introduce an adaptive POD method to reduce the computational cost of reacting flow simulations. The scheme is coupled with an operator-splitting algorithm to solve the reaction-diffusion equation. For the reaction sub-steps, locally valid basis vectors, obtained via POD and the method of snapshots, are used to project the minor species mass fractions onto a reduced dimensional space thereby decreasing the number of equations that govern combustion chemistry. The method is applied to a one-dimensional laminar premixed CH{sub 4}-air flame using GRImech 3.0; with errors less than 0:25%, a speed-up factor of 3:5 is observed. The speed-up results from fewer source term evaluations required to compute the Jacobian matrices.

99 GENERAL AND MISCELLANEOUS↗