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,639 records · Page 91

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↗

SAMBA: Sparse Approximation of Moment-Based Arbitrary Polynomial Chaos

A new arbitrary Polynomial Chaos (aPC) method is presented for moderately high-dimensional problems characterised by limited input data availability. The proposed methodology improves the algorithm of aPC and extends the method, that was previously only introduced as tensor product expansion, to moderately high-dimensional stochastic problems. The fundamental idea of aPC is to use the statistical moments of the input random variables to develop the polynomial chaos expansion. This approach provides the possibility to propagate continuous or discrete probability density functions and also histograms (data sets) as long as their moments exist, are finite and the determinant of the moment matrix is strictly positive. For cases with limited data availability, this approach avoids bias and fitting errors caused by wrong assumptions. In this work, an alternative way to calculate the aPC is suggested, which provides the optimal polynomials, Gaussian quadrature collocation points and weights from the moments using only a handful of matrix operations on the Hankel matrix of moments. It can therefore be implemented without requiring prior knowledge about statistical data analysis or a detailed understanding of the mathematics of polynomial chaos expansions. The extension to more input variables suggested in this work, is an anisotropic and adaptive version of Smolyak's algorithm that is solely based on the moments of the input probability distributions. It is referred to as SAMBA (PC), which is short for Sparse Approximation of Moment-Based Arbitrary Polynomial Chaos. It is illustrated that for moderately high-dimensional problems (up to 20 different input variables or histograms) SAMBA can significantly simplify the calculation of sparse Gaussian quadrature rules. SAMBA's efficiency for multivariate functions with regard to data availability is further demonstrated by analysing higher order convergence and accuracy for a set of nonlinear test functions with 2, 5 and 10 different input distributions or histograms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An Anisotropic Fluid-Solid Model of the Mouse Heart

A critical challenge in biomechanical simulations is the spatial discretization of complex fluid-solid geometries created from imaging. This is especially important when dealing with Lagrangian interfaces, as there must be at a minimum both geometric and topological compatibility between fluid and solid phases, with exact matching of the interfacial nodes being highly desirable. We have developed a solution to this problem and applied the approach to the creation of a 3D fluidsolid mesh of the mouse heart. First, a 50 micron isotropic MRI dataset of a perfusion-fixed mouse heart was segmented into blood, tissue, and background using a customized multimaterial connected fuzzy thresholding algorithm. Then, a multimaterial marching cubes algorithm was applied to produce two compatible isosurfaces, one for the blood-tissue boundary and one for the tissue-background boundary. A multimaterial smoothing algorithm that rigorously conserves volume for each phase simultaneously smoothed the isosurfaces. Next we applied novel automated meshing algorithms to generate anisotropic hybrid meshes with the number of layers and the desired element anisotropy for each material as the only input parameters. As the meshes are scale-invariant within a material and include boundary layer prisms, fluid-structure interaction computations would have a relative error equilibrated over the entire mesh. The resulting model is highly detailed mesh representation of the mouse heart, including features such as chordae and coronary vasculature, that is also maximally efficient to produce the best simulation results for the computational resources available

59 BASIC BIOLOGICAL SCIENCES↗

SELF CALIBRATED STMR ARRAY FOR MATERIAL CHARACTERIZATION AND SHM OF ORTHOTROPIC PLATE-LIKE STRUCTURES

A full ring STMR array patch had been used for Structural Health Monitoring (SHM) of anisotropic materials where the elastic moduli, correspond to the virgin sample, were used in the calculations. In the present work an in-situ SHM has been successfully demonstrated using a novel compact sensor patch (Double ring single quadrant small footprint STMR array) through simultaneous reconstruction of the elastic moduli, material symmetry, orientation of principal planes and defect imaging. The direct received signals were used to measure Lamb wave velocities, which were used in a slowness based reconstructed algorithm using Genetic Algorithm to reconstruct the elastic moduli, material symmetry and orientation of principal planes. The measured signals along with the reconstructed elastic moduli were used in the phased addition algorithm for imaging the damages present on the structure. To show the applicability of the method, simulations were carried out with the double ring single quadrant STMR array configuration to image defects and are compared with the images obtained using simulation data of the full ring STMR array configuration. The experimental validation has been carried out using 3.15 mm quasi-isotropic graphite-epoxy composite. The double ring single quadrant STMR array has advantages over the full ring STMR array as it can carry out in-situ SHM with limited footprint on the structure.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An adaptive extended finite element method for the analysis of agglomeration of colloidal particles in a flowing fluid

Direct numerical simulations of the flow-nanoparticle interaction in a colloidal suspension are presented using an extended finite element method (XFEM) in which the dynamics of the nanoparticles is solved in a fully-coupled manner with the flow. The method is capable of accurately describing solid-fluid interfaces without the need of boundary-fitted meshes to investigate the dynamics of particles in complex flows. In order to accurately compute the high interparticle shear stresses and pressures while minimizing computing costs, an adaptive meshing technique is incorporated with the fluid-structure interaction algorithm. The particle-particle interaction at the microscopic level is modeled using the Lennard-Jones (LJ) potential and the corresponding potential parameters are determined by a scaling procedure. The study is relevant to the preparation of inks used in the fabrication of catalyst layers for fuel cells. In this paper, we are particularly interested in investigating agglomeration of the nanoparticles under external shear flow in a sliding bi-periodic Lees-Edwards frame. The results indicate that the external shear has a crucial impact on the structure formation of colloidal particles in a suspension.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A chain-of-states acceleration method for the efficient location of minimum energy paths

We describe a robust and efficient chain-of-states method for computing Minimum Energy Paths (MEPs) associated to barrier-crossing events in poly-atomic systems, which we call the acceleration method. The path is parametrized in terms of a continuous variable t ∈ [0, 1] that plays the role of time. In contrast to previous chain-of-states algorithms such as the nudged elastic band or string methods, where the positions of the states in the chain are taken as variational parameters in the search for the MEP, our strategy is to formulate the problem in terms of the second derivatives of the coordinates with respect to t, i.e., the state accelerations. We show this to result in a very simple and efficient method for determining the MEP. We describe the application of the method to a series of test cases, including two low-dimensional problems and the Stone-Wales transformation in C{sub 60}.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Extraction and applications of skeletons in finite element mesh generation.

This paper focuses on the extraction of skeletons of CAD models and its applications in finite element (FE) mesh generation. The term 'skeleton of a CAD model' can be visualized as analogous to the 'skeleton of a human body'. The skeletal representations covered in this paper include medial axis transform (MAT), Voronoi diagram (VD), chordal axis transform (CAT), mid surface, digital skeletons, and disconnected skeletons. In the literature, the properties of a skeleton have been utilized in developing various algorithms for extracting skeletons. Three main approaches include: (1) the bisection method where the skeleton exists at equidistant from at least two points on boundary, (2) the grassfire propagation method in which the skeleton exists where the opposing fronts meet, and (3) the duality method where the skeleton is a dual of the object. In the last decade, the author has applied different skeletal representations in all-quad meshing, hex meshing, mid-surface meshing, mesh size function generation, defeaturing, and decomposition. A brief discussion on the related work from other researchers in the area of tri meshing, tet meshing, and anisotropic meshing is also included. This paper concludes by summarizing the strengths and weaknesses of the skeleton-based approaches in solving various geometry-centered problems in FE mesh generation. The skeletons have proved to be a great shape abstraction tool in analyzing the geometric complexity of CAD models as they are symmetric, simpler (reduced dimension), and provide local thickness information. However, skeletons generally require some cleanup, and stability and sensitivity of the skeletons should be controlled during extraction. Also, selecting a suitable application-specific skeleton and a computationally efficient method of extraction is critical.

99 GENERAL AND MISCELLANEOUS↗

[Skeleton extractions and applications].

This paper focuses on the extraction of skeletons of CAD models and its applications in finite element (FE) mesh generation. The term 'skeleton of a CAD model' can be visualized as analogous to the 'skeleton of a human body'. The skeletal representations covered in this paper include medial axis transform (MAT), Voronoi diagram (VD), chordal axis transform (CAT), mid surface, digital skeletons, and disconnected skeletons. In the literature, the properties of a skeleton have been utilized in developing various algorithms for extracting skeletons. Three main approaches include: (1) the bisection method where the skeleton exists at equidistant from at least two points on boundary, (2) the grassfire propagation method in which the skeleton exists where the opposing fronts meet, and (3) the duality method where the skeleton is a dual of the object. In the last decade, the author has applied different skeletal representations in all-quad meshing, hex meshing, mid-surface meshing, mesh size function generation, defeaturing, and decomposition. A brief discussion on the related work from other researchers in the area of tri meshing, tet meshing, and anisotropic meshing is also included. This paper concludes by summarizing the strengths and weaknesses of the skeleton-based approaches in solving various geometry-centered problems in FE mesh generation. The skeletons have proved to be a great shape abstraction tool in analyzing the geometric complexity of CAD models as they are symmetric, simpler (reduced dimension), and provide local thickness information. However, skeletons generally require some cleanup, and stability and sensitivity of the skeletons should be controlled during extraction. Also, selecting a suitable application-specific skeleton and a computationally efficient method of extraction is critical.

99 GENERAL AND MISCELLANEOUS↗