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,369 records · Page 76

Maass Cusp Forms on Singly Punctured Two-Torus

Quantum mechanical systems on punctured surfaces modeled by hyperbolic spaces can play an interesting role in exploring quantum chaos and in studying behaviour of future quantum nano-devices. The case of singly-punctured two-torus, for example, has been well-studied in the literature particularly for its scattering states. However, the bound states on the punctured torus given by Maass cusp forms are lesser known. In this note, we report on the algorithm of numerically computing these functions and we present ten lower-lying eigenvalues for each odd and even Maass cusp forms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Clinical application and validation of an iterative forward projection matching algorithm for permanent brachytherapy seed localization from conebeam-CT x-ray projections

Purpose: To experimentally validate a new algorithm for reconstructing the 3D positions of implanted brachytherapy seeds from postoperatively acquired 2D conebeam-CT (CBCT) projection images. Methods: The iterative forward projection matching (IFPM) algorithm finds the 3D seed geometry that minimizes the sum of the squared intensity differences between computed projections of an initial estimate of the seed configuration and radiographic projections of the implant. In-house machined phantoms, containing arrays of 12 and 72 seeds, respectively, are used to validate this method. Also, four {sup 103}Pd postimplant patients are scanned using an ACUITY digital simulator. Three to ten x-ray images are selected from the CBCT projection set and processed to create binary seed-only images. To quantify IFPM accuracy, the reconstructed seed positions are forward projected and overlaid on the measured seed images to find the nearest-neighbor distance between measured and computed seed positions for each image pair. Also, the estimated 3D seed coordinates are compared to known seed positions in the phantom and clinically obtained VariSeed planning coordinates for the patient data. Results: For the phantom study, seed localization error is (0.58{+-}0.33) mm. For all four patient cases, the mean registration error is better than 1 mm while compared against the measured seed projections. IFPM converges in 20-28 iterations, with a computation time of about 1.9-2.8 min/iteration on a 1 GHz processor. Conclusions: The IFPM algorithm avoids the need to match corresponding seeds in each projection as required by standard back-projection methods. The authors' results demonstrate {approx}1 mm accuracy in reconstructing the 3D positions of brachytherapy seeds from the measured 2D projections. This algorithm also successfully localizes overlapping clustered and highly migrated seeds in the implant.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Critical Path-Based Thread Placement for NUMA Systems

Multicore multiprocessors use Non Uniform Memory Architecture (NUMA) to improve their scalability. However,NUMA introduces performance penalties due to remote memory accesses. Without efficiently managing data layout and thread mapping to cores, scientific applications, even if they are optimized for NUMA, may suffer performance loss. In this paper, we present an algorithm that optimizes the placement of OpenMP threads on NUMA processors. By collecting information from hardware counters and defining new metrics to capture the effects of thread placement, the algorithm reduces NUMA performance penalty by minimizing the critical path of OpenMP parallel regions and by avoiding local memory resource contention. We evaluate our algorithm with NPB benchmarks and achieve performance improvement between 8.13% and 25.68%, compared to the OS default scheduling.

99 GENERAL AND MISCELLANEOUS↗

Time reversal signal processing for communication.

Time-reversal is a wave focusing technique that makes use of the reciprocity of wireless propagation channels. It works particularly well in a cluttered environment with associated multipath reflection. This technique uses the multipath in the environment to increase focusing ability. Time-reversal can also be used to null signals, either to reduce unintentional interference or to prevent eavesdropping. It does not require controlled geometric placement of the transmit antennas. Unlike existing techniques it can work without line-of-sight. We have explored the performance of time-reversal focusing in a variety of simulated environments. We have also developed new algorithms to simultaneously focus at a location while nulling at an eavesdropper location. We have experimentally verified these techniques in a realistic cluttered environment.

99 GENERAL AND MISCELLANEOUS↗

Component evaluation testing and analysis algorithms.

The Ground-Based Monitoring R&E Component Evaluation project performs testing on the hardware components that make up Seismic and Infrasound monitoring systems. The majority of the testing is focused on the Digital Waveform Recorder (DWR), Seismic Sensor, and Infrasound Sensor. In order to guarantee consistency, traceability, and visibility into the results of the testing process, it is necessary to document the test and analysis procedures that are in place. Other reports document the testing procedures that are in place (Kromer, 2007). This document serves to provide a comprehensive overview of the analysis and the algorithms that are applied to the Component Evaluation testing. A brief summary of each test is included to provide the context for the analysis that is to be performed.

99 GENERAL AND MISCELLANEOUS↗

Scientific Grand Challenges: Challenges in Climate Change Science and the Role of Computing at the Extreme Scale

The U.S. Department of Energy (DOE) Office of Biological and Environmental Research (BER) in partnership with the Office of Advanced Scientific Computing Research (ASCR) held a workshop on the challenges in climate change science and the role of computing at the extreme scale, November 6-7, 2008, in Bethesda, Maryland. At the workshop, participants identified the scientific challenges facing the field of climate science and outlined the research directions of highest priority that should be pursued to meet these challenges. Representatives from the national and international climate change research community as well as representatives from the high-performance computing community attended the workshop. This group represented a broad mix of expertise. Of the 99 participants, 6 were from international institutions. Before the workshop, each of the four panels prepared a white paper, which provided the starting place for the workshop discussions. These four panels of workshop attendees devoted to their efforts the following themes: Model Development and Integrated Assessment; Algorithms and Computational Environment; Decadal Predictability and Prediction; Data, Visualization, and Computing Productivity. The recommendations of the panels are summarized in the body of this report.

99 GENERAL AND MISCELLANEOUS↗

Design and Implementation of Broadcast Algorithms for Extreme-Scale Systems

The scalability and performance of collective communication operations limit the scalability and performance of many scientific applications. This paper presents two new blocking and nonblocking Broadcast algorithms for communicators with arbitrary communication topology, and studies their performance. These algorithms benefit from increased concurrency and a reduced memory footprint, making them suitable for use on large-scale systems. Measuring small, medium, and large data Broadcasts on a Cray-XT5, using 24,576 MPI processes, the Cheetah algorithms outperform the native MPI on that system by 51%, 69%, and 9%, respectively, at the same process count. These results demonstrate an algorithmic approach to the implementation of the important class of collective communications, which is high performing, scalable, and also uses resources in a scalable manner.

99 GENERAL AND MISCELLANEOUS↗

VLSI Cells Placement Using the Neural Networks

The artificial neural networks have been studied for several years. Their effectiveness makes it possible to expect high performances. The privileged fields of these techniques remain the recognition and classification. Various applications of optimization are also studied under the angle of the artificial neural networks. They make it possible to apply distributed heuristic algorithms. In this article, a solution to placement problem of the various cells at the time of the realization of an integrated circuit is proposed by using the KOHONEN network.

99 GENERAL AND MISCELLANEOUS↗

Constraints on a phenomenologically parametrized neutron-star equation of state

We introduce a parametrized high-density equation of state (EOS) in order to systematize the study of constraints placed by astrophysical observations on the nature of neutron-star matter. To obtain useful constraints, the number of parameters must be smaller than the number of EOS-related neutron-star properties measured, but large enough to accurately approximate the large set of candidate EOSs. We find that a parametrized EOS based on piecewise polytropes with 3 free parameters matches, to about 4% rms error, an extensive set of candidate EOSs at densities below the central density of 1.4M{sub {center_dot}} stars. Adding observations of more massive stars constrains the higher-density part of the EOS and requires an additional parameter. We obtain constraints on the allowed parameter space set by causality and by present and near-future astronomical observations with the least model dependence. Stringent constraints on the EOS parameter space are associated with the future measurement of the moment of inertia of PSR J0737-3039A combined with the maximum known neutron-star mass. We also present in an appendix a more efficient algorithm than has previously been used for finding points of marginal stability and the maximum angular velocity of stable stars.

79 ASTRONOMY AND ASTROPHYSICS↗

Computational biology for target discovery and characterization: a feasibility study in protein-protein interaction detection

In this work we developed new code for detecting putative multi-domain protein-protein interactions for a small network of bacterial pathogen proteins, and determined how structure-driven domain-fusion (DF) methods should be scaled up for whole-proteome analysis. Protein-protein interactions are of great interest in structural biology and are important for understanding the biology of pathogens. The ability to predict protein-protein interactions provides a means for development of anti-microbials that may interfer with key processes in pathogenicity. The function of a protein-protein complex can be elucidated through knowledge of its structure. The overall goal of this project was to determine the feasibility of extending current LLNL capabilities to produce a high-throughput systems bio-informatics capability for identification and characterization of putative interacting protein partners within known or suspected small protein networks. We extended an existing LLNL methodology for identification of putative protein-protein interacting partners (Chakicherla et al (in review)) by writing a new code to identify multi-domain-fusion linkages (3 or more per complex). We applied these codes to the proteins in the Yersinia pestis quorum sensing network, known as the lsr operon, which comprises a virulence mechanism in this pathogen. We determined that efficient application of our computational algorithms in high-throughput for detection of putative protein-protein complexes genome wide would require pre-computation of PDB domains and construction of a domain-domain association database.

99 GENERAL AND MISCELLANEOUS↗

State-of-the-Art in Heterogeneous Computing

Node level heterogeneous architectures have become attractive during the last decade for several reasons: compared to traditional symmetric CPUs, they offer high peak performance and are energy and/or cost efficient. With the increase of fine-grained parallelism in high-performance computing, as well as the introduction of parallelism in workstations, there is an acute need for a good overview and understanding of these architectures. We give an overview of the state-of-the-art in heterogeneous computing, focusing on three commonly found architectures: the Cell Broadband Engine Architecture, graphics processing units (GPUs), and field programmable gate arrays (FPGAs).We present a review of hardware, available software tools, and an overview of state-of-the-art techniques and algorithms. Furthermore, we present a qualitative and quantitative comparison of the architectures, and give our view on the future of heterogeneous computing.

99 GENERAL AND MISCELLANEOUS↗

Charge-and-energy conserving moment-based accelerator for a multi-species Vlasov–Fokker–Planck–Ampère system, part I: Collisionless aspects

In this study, we propose a charge, momentum, and energy conserving discretization for the 1D–1V Vlasov–Ampère system of equations on an Eulerian grid. The new conservative discretization is nonlinear in nature, but can be efficiently converged with a moment-based nonlinear accelerator algorithm. We demonstrate the conservation and convergence properties of the scheme with various numerical examples, including a multi-scale ion–acoustic shockwave problem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Obstacle Bypassing in Optimal Ship Routing Using Simulated Annealing

In this paper we are going to discuss a variation on the problem of finding the shortest path between two points in optimal ship routing problems consisting of obstacles that are not allowed to be crossed by the path. Our main goal are going to be the construction of an appropriate algorithm, based in an earlier work by computing the shortest path between two points in the plane that avoids a set of polygonal obstacles.

97 MATHEMATICS AND COMPUTING↗

Non-orthogonal spin-adaptation of coupled cluster methods: A new implementation of methods including quadruple excitations

The theory of non-orthogonal spin-adaptation for closed-shell molecular systems is applied to coupled cluster methods with quadruple excitations (CCSDTQ). Calculations at this level of detail are of critical importance in describing the properties of molecular systems to an accuracy which can meet or exceed modern experimental techniques. Such calculations are of significant (and growing) importance in such fields as thermodynamics, kinetics, and atomic and molecular spectroscopies. With respect to the implementation of CCSDTQ and related methods, we show that there are significant advantages to non-orthogonal spin-adaption with respect to simplification and factorization of the working equations and to creating an efficient implementation. The resulting algorithm is implemented in the CFOUR program suite for CCSDT, CCSDTQ, and various approximate methods (CCSD(T), CC3, CCSDT-n, and CCSDT(Q))

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Theory and praxis pf map analsys in CHEF part 1: Linear normal form

This memo begins a series which, put together, could comprise the 'CHEF Documentation Project' if there were such a thing. The first--and perhaps only--three will telegraphically describe theory, algorithms, implementation and usage of the normal form map analysis procedures encoded in CHEF's collection of libraries. [1] This one will begin the sequence by explaining the linear manipulations that connect the Jacobian matrix of a symplectic mapping to its normal form. It is a 'Reader's Digest' version of material I wrote in Intermediate Classical Dynamics (ICD) [2] and randomly scattered across technical memos, seminar viewgraphs, and lecture notes for the past quarter century. Much of its content is old, well known, and in some places borders on the trivial.1 Nevertheless, completeness requires their inclusion. The primary objective is the 'fundamental theorem' on normalization written on page 8. I plan to describe the nonlinear procedures in a subsequent memo and devote a third to laying out algorithms and lines of code, connecting them with equations written in the first two. Originally this was to be done in one short paper, but I jettisoned that approach after its first section exceeded a dozen pages. The organization of this document is as follows. A brief description of notation is followed by a section containing a general treatment of the linear problem. After the 'fundamental theorem' is proved, two further subsections discuss the generation of equilibrium distributions and issue of 'phase'. The final major section reviews parameterizations--that is, lattice functions--in two and four dimensions with a passing glance at the six-dimensional version. Appearances to the contrary, for the most part I have tried to restrict consideration to matters needed to understand the code in CHEF's libraries.

99 GENERAL AND MISCELLANEOUS↗

Computationally efficient implementation of combustion chemistry in parallel PDF calculations

In parallel calculations of combustion processes with realistic chemistry, the serial in situ adaptive tabulation (ISAT) algorithm [S.B. Pope, Computationally efficient implementation of combustion chemistry using in situ adaptive tabulation, Combustion Theory and Modelling, 1 (1997) 41-63; L. Lu, S.B. Pope, An improved algorithm for in situ adaptive tabulation, Journal of Computational Physics 228 (2009) 361-386] substantially speeds up the chemistry calculations on each processor. To improve the parallel efficiency of large ensembles of such calculations in parallel computations, in this work, the ISAT algorithm is extended to the multi-processor environment, with the aim of minimizing the wall clock time required for the whole ensemble. Parallel ISAT strategies are developed by combining the existing serial ISAT algorithm with different distribution strategies, namely purely local processing (PLP), uniformly random distribution (URAN), and preferential distribution (PREF). The distribution strategies enable the queued load redistribution of chemistry calculations among processors using message passing. They are implemented in the software x2f{sub m}pi, which is a Fortran 95 library for facilitating many parallel evaluations of a general vector function. The relative performance of the parallel ISAT strategies is investigated in different computational regimes via the PDF calculations of multiple partially stirred reactors burning methane/air mixtures. The results show that the performance of ISAT with a fixed distribution strategy strongly depends on certain computational regimes, based on how much memory is available and how much overlap exists between tabulated information on different processors. No one fixed strategy consistently achieves good performance in all the regimes. Therefore, an adaptive distribution strategy, which blends PLP, URAN and PREF, is devised and implemented. It yields consistently good performance in all regimes. In the adaptive parallel ISAT strategy, the type and extent of redistribution is determined 'on the fly' based on the prediction of future simulation time. Compared to the PLP/ISAT strategy where chemistry calculations are essentially serial, a speed-up factor of up to 30 is achieved. The study also demonstrates that the adaptive strategy has acceptable parallel scalability.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Subspace accelerated inexact Newton method for large scale wave functions calculations in Density Functional Theory

We describe an iterative algorithm to solve electronic structure problems in Density Functional Theory. The approach is presented as a Subspace Accelerated Inexact Newton (SAIN) solver for the non-linear Kohn-Sham equations. It is related to a class of iterative algorithms known as RMM-DIIS in the electronic structure community. The method is illustrated with examples of real applications using a finite difference discretization and multigrid preconditioning.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗