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,387 records · Page 77

THREAT ANTICIPATION AND DECEPTIVE REASONING USING BAYESIAN BELIEF NETWORKS

Recent events highlight the need for tools to anticipate threats posed by terrorists. Assessing these threats requires combining information from disparate data sources such as analytic models, simulations, historical data, sensor networks, and user judgments. These disparate data can be combined in a coherent, analytically defensible, and understandable manner using a Bayesian belief network (BBN). In this paper, we develop a BBN threat anticipatory model based on a deceptive reasoning algorithm using a network engineering process that treats the probability distributions of the BBN nodes within the broader context of the system development process.

97 MATHEMATICS AND COMPUTING↗

Compatible Relaxation and Coarsening in Algebraic Multigrid

We introduce a coarsening algorithm for algebraic multigrid (AMG) based on the concept of compatible relaxation (CR). The algorithm is significantly different from standard methods, most notably because it does not rely on any notion of strength of connection. We study its behavior on a number of model problems, and evaluate the performance of an AMG algorithm that incorporates the coarsening approach. Lastly, we introduce a variant of CR that provides a sharper metric of coarse-grid quality and demonstrate its potential with two simple examples.

99 GENERAL AND MISCELLANEOUS↗

Utilizing High Performance Computing for Chemistry: Parallel Computational Chemistry

Parallel hardware has become readily available to the computational chemistry research community. This perspective will review the current state of parallel computational chemistry software utilizing high-performance parallel computing platforms.Hardware and software trends and their effect on quantum chemistry methodologies, algorithms, and software development will also be discussed.

99 GENERAL AND MISCELLANEOUS↗

EFFICIENT FITTING OF MULTIPLANET KEPLERIAN MODELS TO RADIAL VELOCITY AND ASTROMETRY DATA

We describe a technique for solving for the orbital elements of multiple planets from radial velocity (RV) and/or astrometric data taken with 1 m s{sup -1} and {mu}as precision, appropriate for efforts to detect Earth-massed planets in their stars' habitable zones, such as NASA's proposed Space Interferometry Mission. We include details of calculating analytic derivatives for use in the Levenberg-Marquardt (LM) algorithm for the problems of fitting RV and astrometric data separately and jointly. We also explicate the general method of separating the linear and nonlinear components of a model fit in the context of an LM fit, show how explicit derivatives can be calculated in such a model, and demonstrate the speed up and convergence improvements of such a scheme in the case of a five-planet fit to published RV data for 55 Cnc.

79 ASTRONOMY AND ASTROPHYSICS↗

The Best Rank-(R{sub 1},R{sub 2},R{sub 3}) Approximation of Tensors by Means of a Geometric Newton Method

In the matrix case, the best low-rank approximation can be obtained directly from the truncated singular value decomposition. However, the best rank-(R{sub 1},R{sub 2},...,R{sub N}) approximation of higher-order tensors cannot be computed in a straightforward way. An additional difficulty comes from an invariance property of the cost function by the action of the orthogonal group. This means that the zeros of the cost function are not isolated and the plain Newton method might have difficulties. In this paper, we derive a geometric Newton method using the theory of quotient manifolds. Our algorithm has fast convergence in a neighborhood of the solution and is useful for a large class of problems. We mention some applications.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Accelerating Real-Time String Searching with Multicore Processors

String searching is at the core of tools used to search, filter, and protect data, but this has become increasingly difficult to do in real time as communication speed grows. The authors present an optimization strategy for a popular algorithm that fully exploits the IBM Cell Broadband Engine architecture to perform exact string matching against large dictionaries and also offer various solutions to alleviate memory congestion.

97 MATHEMATICS AND COMPUTING↗

Data intensive computing at Sandia.

Data-Intensive Computing is parallel computing where you design your algorithms and your software around efficient access and traversal of a data set; where hardware requirements are dictated by data size as much as by desired run times usually distilling compact results from massive data.

99 GENERAL AND MISCELLANEOUS↗

Arachne - A web-based event viewer for MINERvA

Neutrino interaction events in the MINERvA detector are visually represented with a web-based tool called Arachne. Data are retrieved from a central server via AJAX, and client-side JavaScript draws images into the user's browser window using the draft HTML 5 standard. These technologies allow neutrino interactions to be viewed by anyone with a web browser, allowing for easy hand-scanning of particle interactions. Arachne has been used in MINERvA to evaluate neutrino data in a prototype detector, to tune reconstruction algorithms, and for public outreach and education.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Assessing the Performance and Scalability of a Novel Multilevel K-Nomial Allgather on CORE-Direct Systems

In this paper, we propose a novel allgather algorithm, Reindexed Recursive K-ing (RRK), which leverages flexibility in the algorithm's tree topology and ability to make asynchronous progress coupled with Core-Direct communication offload capability to optimize the MPI-Allgather for Core-Direct enabled systems. In particular, the RRK introduces a reindexing scheme which ensures contiguous data transfers while adding only a single additional send and receive operation for any radix, k, or communicator size, N. This allows us to improve algorithm scalability by avoiding the use of a scatter/gather elements (SGE) list on InfiniBand networks. The implementations of the RRK algorithm and its evaluation shows that it performs and scales well on Core-Direct systems for a wide range of message sizes and various communicator configurations.

99 GENERAL AND MISCELLANEOUS↗

Efficient antisymmetrization algorithm for the partially correlated wave functions in the free complement-local Schrödinger equation method

We propose here fast antisymmetrization procedures for the partially correlated wave functions that appear in the free complement-local Schrödinger equation (FC-LSE) method. Pre-analysis of the correlation diagram, referred to as dot analysis, combined with the determinant update technique based on the Laplace expansion, drastically reduces the orders of the antisymmetrization computations. When the complement functions include only up to single-correlated terms, the order of computations is O(N{sup 3}), which is the same as the non-correlated case. Similar acceleration is obtained for general correlated functions as a result of dot analysis. This algorithm has been successfully used in our laboratory in actual FC-LSE calculations for accurately solving the many-electron Schrödinger equations of atoms and molecules. The proposed method is general and applicable to the sampling-type methodology of other partially correlated wave functions like those in the quantum Monte Carlo and modern Hylleraas-type methods.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Swarm Intelligence for Urban Dynamics Modelling

In this paper, we propose swarm intelligence algorithms to deal with dynamical and spatial organization emergence. The goal is to model and simulate the developement of spatial centers using multi-criteria. We combine a decentralized approach based on emergent clustering mixed with spatial constraints or attractions. We propose an extension of the ant nest building algorithm with multi-center and adaptive process. Typically, this model is suitable to analyse and simulate urban dynamics like gentrification or the dynamics of the cultural equipment in urban area.

99 GENERAL AND MISCELLANEOUS↗

Sensor Configuration Selection for Discrete-Event Systems under Unreliable Observations

Algorithms for counting the occurrences of special events in the framework of partially-observed discrete event dynamical systems (DEDS) were developed in previous work. Their performances typically become better as the sensors providing the observations become more costly or increase in number. This paper addresses the problem of finding a sensor configuration that achieves an optimal balance between cost and the performance of the special event counting algorithm, while satisfying given observability requirements and constraints. Since this problem is generally computational hard in the framework considered, a sensor optimization algorithm is developed using two greedy heuristics, one myopic and the other based on projected performances of candidate sensors. The two heuristics are sequentially executed in order to find best sensor configurations. The developed algorithm is then applied to a sensor optimization problem for a multiunit- operation system. Results show that improved sensor configurations can be found that may significantly reduce the sensor configuration cost but still yield acceptable performance for counting the occurrences of special events.

97 MATHEMATICS AND COMPUTING↗

On low-rank updates to the singular value and Tucker decompositions

The singular value decomposition is widely used in signal processing and data mining. Since the data often arrives in a stream, the problem of updating matrix decompositions under low-rank modification has been widely studied. Brand developed a technique in 2006 that has many advantages. However, the technique does not directly approximate the updated matrix, but rather its previous low-rank approximation added to the new update, which needs justification. Further, the technique is still too slow for large information processing problems. We show that the technique minimizes the change in error per update, so if the error is small initially it remains small. We show that an updating algorithm for large sparse matrices should be sub-linear in the matrix dimension in order to be practical for large problems, and demonstrate a simple modification to the original technique that meets the requirements.

99 GENERAL AND MISCELLANEOUS↗

An adaptive grid-based all hexahedral meshing algorithm based on 2-refinement.

Most adaptive mesh generation algorithms employ a 3-refinement method. This method, although easy to employ, provides a mesh that is often too coarse in some areas and over refined in other areas. Because this method generates 27 new hexes in place of a single hex, there is little control on mesh density. This paper presents an adaptive all-hexahedral grid-based meshing algorithm that employs a 2-refinement method. 2-refinement is based on dividing the hex to be refined into eight new hexes. This method allows a greater control on mesh density when compared to a 3-refinement procedure. This adaptive all-hexahedral meshing algorithm provides a mesh that is efficient for analysis by providing a high element density in specific locations and a reduced mesh density in other areas. In addition, this tool can be effectively used for inside-out hexahedral grid based schemes, using Cartesian structured grids for the base mesh, which have shown great promise in accommodating automatic all-hexahedral algorithms. This adaptive all-hexahedral grid-based meshing algorithm employs a 2-refinement insertion method. This allows greater control on mesh density when compared to 3-refinement methods. This algorithm uses a two layer transition zone to increase element quality and keeps transitions from lower to higher mesh densities smooth. Templates were introduced to allow both convex and concave refinement.

99 GENERAL AND MISCELLANEOUS↗

Analysis of Massively Parallel Discrete-Ordinates Transport Sweep Algorithms with Collisions

We present theoretical scaling models for a variety of discrete-ordinates sweep algorithms. In these models, we pay particular attention to the way each algorithm handles collisions. A collision is defined as a processor having multiple angles with ready to be swept during one stage of the sweep. The models also take into account how subdomains are assigned to processors and how angles are grouped during the sweep. We describe a data driven algorithm that resolves collisions efficiently during the sweep as well as other algorithms that have been designed to avoid collisions completely. Our models are validated using the ARGES and AMTRAN transport codes. We then use the models to study and predict scaling trends in all of the sweep algorithms.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Detection and Characterisation of H-{alpha} Emission Lines from Gaia BP/RP Spectra

The Gaia probe, set to launch in 2011, will measure an estimated billion astronomical objects, producing an enormous amount of data. One of the data analysis tasks will be the identification and classification of measured objects. A vast majority of them will be 'ordinary' stars from our Galaxy but a certain percentage will belong to 'peculiar' objects. We are interested in detecting emission line stars (ELS). The characteristic feature of most ELS is the presence of a H-{alpha} emission line in their spectra. In the case of Gaia measurements, the influence of this line could be detected in low resolution prismatic spectra which will be recorded both in blue (BP) and red (RP) spectral region. In this work, we compare different algorithms for detecting and characterising H-{alpha} lines in Gaia spectra. These include a simple, integrated flux ratio-based algorithm and several machine learning algorithms, such as neural networks, support vector machines and support vector regression. We study line detection both from single-transit and over-sampled end-of-mission data.

79 ASTRONOMY AND ASTROPHYSICS↗

Construction of a universal quantum computer

We construct a universal quantum computer following Deutsch's original proposal of a universal quantum Turing machine (UQTM). Like Deutsch's UQTM, our machine can emulate any classical Turing machine and can execute any algorithm that can be implemented in the quantum gate array framework but under the control of a quantum program, and hence is universal. We present the architecture of the machine, which consists of a memory tape and a processor and describe the observables that comprise the registers of the processor and the instruction set, which includes a set of operations that can approximate any unitary operation to any desired accuracy and hence is quantum computationally universal. We present the unitary evolution operators that act on the machine to achieve universal computation and discuss each of them in detail and specify and discuss explicit program halting and concatenation schemes. We define and describe a set of primitive programs in order to demonstrate the universal nature of the machine. These primitive programs facilitate the implementation of more complex algorithms and we demonstrate their use by presenting a program that computes the NAND function, thereby also showing that the machine can compute any classically computable function.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Simultaneous motion estimation and image reconstruction (SMEIR) for 4D cone-beam CT

Purpose: Image reconstruction and motion model estimation in four-dimensional cone-beam CT (4D-CBCT) are conventionally handled as two sequential steps. Due to the limited number of projections at each phase, the image quality of 4D-CBCT is degraded by view aliasing artifacts, and the accuracy of subsequent motion modeling is decreased by the inferior 4D-CBCT. The objective of this work is to enhance both the image quality of 4D-CBCT and the accuracy of motion model estimation with a novel strategy enabling simultaneous motion estimation and image reconstruction (SMEIR).Methods: The proposed SMEIR algorithm consists of two alternating steps: (1) model-based iterative image reconstruction to obtain a motion-compensated primary CBCT (m-pCBCT) and (2) motion model estimation to obtain an optimal set of deformation vector fields (DVFs) between the m-pCBCT and other 4D-CBCT phases. The motion-compensated image reconstruction is based on the simultaneous algebraic reconstruction technique (SART) coupled with total variation minimization. During the forward- and backprojection of SART, measured projections from an entire set of 4D-CBCT are used for reconstruction of the m-pCBCT by utilizing the updated DVF. The DVF is estimated by matching the forward projection of the deformed m-pCBCT and measured projections of other phases of 4D-CBCT. The performance of the SMEIR algorithm is quantitatively evaluated on a 4D NCAT phantom. The quality of reconstructed 4D images and the accuracy of tumor motion trajectory are assessed by comparing with those resulting from conventional sequential 4D-CBCT reconstructions (FDK and total variation minimization) and motion estimation (demons algorithm). The performance of the SMEIR algorithm is further evaluated by reconstructing a lung cancer patient 4D-CBCT.Results: Image quality of 4D-CBCT is greatly improved by the SMEIR algorithm in both phantom and patient studies. When all projections are used to reconstruct a 3D-CBCT by FDK, motion-blurring artifacts are present, leading to a 24.4% relative reconstruction error in the NACT phantom. View aliasing artifacts are present in 4D-CBCT reconstructed by FDK from 20 projections, with a relative error of 32.1%. When total variation minimization is used to reconstruct 4D-CBCT, the relative error is 18.9%. Image quality of 4D-CBCT is substantially improved by using the SMEIR algorithm and relative error is reduced to 7.6%. The maximum error (MaxE) of tumor motion determined from the DVF obtained by demons registration on a FDK-reconstructed 4D-CBCT is 3.0, 2.3, and 7.1 mm along left–right (L-R), anterior–posterior (A-P), and superior–inferior (S-I) directions, respectively. From the DVF obtained by demons registration on 4D-CBCT reconstructed by total variation minimization, the MaxE of tumor motion is reduced to 1.5, 0.5, and 5.5 mm along L-R, A-P, and S-I directions. From the DVF estimated by SMEIR algorithm, the MaxE of tumor motion is further reduced to 0.8, 0.4, and 1.5 mm along L-R, A-P, and S-I directions, respectively.Conclusions: The proposed SMEIR algorithm is able to estimate a motion model and reconstruct motion-compensated 4D-CBCT. The SMEIR algorithm improves image reconstruction accuracy of 4D-CBCT and tumor motion trajectory estimation accuracy as compared to conventional sequential 4D-CBCT reconstruction and motion estimation.

62 RADIOLOGY AND NUCLEAR MEDICINE↗