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,189 records · Page 66

Thermodynamically consistent algorithms for models of incompressible multiphase polymer solutions with a variable mobility

Here we present a general strategy for developing structure and property preserving numerical algorithms for thermodynamically consistent models of incompressible multiphase polymer solutions with a variable mobility. We first present a formalism to derive thermodynamically consistent, incompressible, multiphase polymer models. Then, we develop the general strategy, known as the supplementary variable method, to devise thermodynamically consistent numerical approximations to the models. We illustrate the numerical strategy using newly developed models of incompressible diblock copolymer solutions coupled with an electric and a magnetic field, respectively. Mesh refinement is conducted to verify convergence rates of the developed schemes. Some numerical examples are given to exhibit underlying dynamics absent from and driven by the external fields, respectively, highlighting differences between models with the variable and constant mobilities.

97 MATHEMATICS AND COMPUTING↗

A New Pivoting and Iterative Text Detection Algorithm for Biomedical Images

There is interest to expand the reach of literature mining to include the analysis of biomedical images, which often contain a paper's key findings. Examples include recent studies that use Optical Character Recognition (OCR) to extract image text, which is used to boost biomedical image retrieval and classification. Such studies rely on the robust identification of text elements in biomedical images, which is a non-trivial task. In this work, we introduce a new text detection algorithm for biomedical images based on iterative projection histograms. We study the effectiveness of our algorithm by evaluating the performance on a set of manually labeled random biomedical images, and compare the performance against other state-of-the-art text detection algorithms. We demonstrate that our projection histogram-based text detection approach is well suited for text detection in biomedical images, and that the iterative application of the algorithm boosts performance to an F score of .60. We provide a C++ implementation of our algorithm freely available for academic use.

60 APPLIED LIFE SCIENCES↗

A Simplified Algorithm for Statistical Investigation of Damage Spreading

On the way to simulating adaptive evolution of complex system describing a living object or human developed project, a fitness should be defined on node states or network external outputs. Feedbacks lead to circular attractors of these states or outputs which make it difficult to define a fitness. The main statistical effects of adaptive condition are the result of small change tendency and to appear, they only need a statistically correct size of damage initiated by evolutionary change of system. This observation allows to cut loops of feedbacks and in effect to obtain a particular statistically correct state instead of a long circular attractor which in the quenched model is expected for chaotic network with feedback. Defining fitness on such states is simple. We calculate only damaged nodes and only once. Such an algorithm is optimal for investigation of damage spreading i.e. statistical connections of structural parameters of initial change with the size of effected damage. It is a reversed-annealed method--function and states (signals) may be randomly substituted but connections are important and are preserved. The small damages important for adaptive evolution are correctly depicted in comparison to Derrida annealed approximation which expects equilibrium levels for large networks. The algorithm indicates these levels correctly. The relevant program in Pascal, which executes the algorithm for a wide range of parameters, can be obtained from the author.

99 GENERAL AND MISCELLANEOUS↗

Stochastic quasi-steady state approximations for asymptotic solutions of the chemical master equation

In this paper, we propose two methods to carry out the quasi-steady state approximation in stochastic models of enzyme catalytic regulation, based on WKB asymptotics of the chemical master equation or of the corresponding partial differential equation for the generating function. The first of the methods we propose involves the development of multiscale generalisation of a WKB approximation of the solution of the master equation, where the separation of time scales is made explicit which allows us to apply the quasi-steady state approximation in a straightforward manner. To the lowest order, the multi-scale WKB method provides a quasi-steady state, Gaussian approximation of the probability distribution. The second method is based on the Hamilton-Jacobi representation of the stochastic process where, as predicted by large deviation theory, the solution of the partial differential equation for the corresponding characteristic function is given in terms of an effective action functional. The optimal transition paths between two states are then given by those paths that maximise the effective action. Such paths are the solutions of the Hamilton equations for the Hamiltonian associated to the effective action functional. The quasi-steady state approximation is applied to the Hamilton equations thus providing an approximation to the optimal transition paths and the transition time between two states. Using this approximation we predict that, unlike the mean-field quasi-steady approximation result, the rate of enzyme catalysis depends explicitly on the initial number of enzyme molecules. The accuracy and validity of our approximated results as well as that of our predictions regarding the behaviour of the stochastic enzyme catalytic models are verified by direct simulation of the stochastic model using Gillespie stochastic simulation algorithm.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Development of autonomous multirotor platform for exploration missions

This paper outlines development process of unmanned multirotor aerial vehicle HF-4X, which consists of design and manufacturing semi-autonomous UAV dedicated for indoor flight, which would be capable of stable and controllable mission flight. A micro air vehicle was designed to participate in the International Micro Air Vehicle Conference and Flight Competition. In this paper much attention was paid to the structure of flight control system, stabilization algorithms, analysis of IMU sensors, fusion algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DYNAMIC STABILITY OF THE SOLAR SYSTEM: STATISTICALLY INCONCLUSIVE RESULTS FROM ENSEMBLE INTEGRATIONS

Due to the chaotic nature of the solar system, the question of its long-term stability can only be answered in a statistical sense, for instance, based on numerical ensemble integrations of nearby orbits. Destabilization of the inner planets, leading to close encounters and/or collisions can be initiated through a large increase in Mercury's eccentricity, with a currently assumed likelihood of ∼1%. However, little is known at present about the robustness of this number. Here I report ensemble integrations of the full equations of motion of the eight planets and Pluto over 5 Gyr, including contributions from general relativity. The results show that different numerical algorithms lead to statistically different results for the evolution of Mercury's eccentricity (e{sub M}). For instance, starting at present initial conditions (e{sub M}≃0.21), Mercury's maximum eccentricity achieved over 5 Gyr is, on average, significantly higher in symplectic ensemble integrations using heliocentric rather than Jacobi coordinates and stricter error control. In contrast, starting at a possible future configuration (e{sub M}≃0.53), Mercury's maximum eccentricity achieved over the subsequent 500 Myr is, on average, significantly lower using heliocentric rather than Jacobi coordinates. For example, the probability for e{sub M} to increase beyond 0.53 over 500 Myr is >90% (Jacobi) versus only 40%-55% (heliocentric). This poses a dilemma because the physical evolution of the real system—and its probabilistic behavior—cannot depend on the coordinate system or the numerical algorithm chosen to describe it. Some tests of the numerical algorithms suggest that symplectic integrators using heliocentric coordinates underestimate the odds for destabilization of Mercury's orbit at high initial e{sub M}.

79 ASTRONOMY AND ASTROPHYSICS↗

A parallel multigrid preconditioner for the simulation of large fracture networks

Computational modeling of a fracture in disordered materials using discrete lattice models requires the solution of a linear system of equations every time a new lattice bond is broken. Solving these linear systems of equations successively is the most expensive part of fracture simulations using large three-dimensional networks. In this paper, we present a parallel multigrid preconditioned conjugate gradient algorithm to solve these linear systems. Numerical experiments demonstrate that this algorithm performs significantly better than the algorithms previously used to solve this problem.

99 GENERAL AND MISCELLANEOUS↗

A generalized approach for determining electric machine drive switching schemes using evolutionary optimization algorithms

The number of inverter switching events in one fundamental cycle of an electric machine can be limited by many factors such as inverter switching frequency, rotational speed, and computational time required by control algorithms. Even at low and moderate speeds, switching harmonics cause distortion in the phase current, which can lead to increased torque ripple and core losses when compared to operation with ideal waveforms. Furthermore, as rotational speed increases and voltage limitations are encountered, overmodulation schemes must be implemented to overcome increasing reactance and back-EMF (or pseudo back-EMF). The goal of this paper is to establish a framework and demonstrate methods for determining optimal switching times for a set number of switching events in a fundamental cycle using particle swarm optimization and multivariable fitness functions.

Burress, Timothy↗

A Scalable Parallel Wideband MLFMA for Efficient Electromagnetic Simulations on Large Scale Clusters

The development of the multilevel fast multipole algorithm (MLFMA) and its multiscale variants have enabled the use of integral equation (IE) based solvers to compute scattering from complicated structures. Development of scalable parallel algorithms, to extend the reach of these solvers, has been a topic of intense research for about a decade. In this paper, we present a new algorithm for parallel implementation of IE solver that is augmented with a wideband MLFMA and scalable on large number of processors. The wideband MLFMA employed here, to handle multiscale problems, is a hybrid combination of the accelerated Cartesian expansion (ACE) and the classical MLFMA. The salient feature of the presented parallel algorithm is that it is implicitly load balanced and exhibits higher performance. This is achieved by developing a strategy to partition the MLFMA tree, and hence the associated computations, in a self-similar fashion among the parallel processors. As detailed in the paper, the algorithm employs both spatial and direction partitioning approaches in a flexible manner to ensure scalable performance. Plethora of results are presented here to exhibit the scalability of this algorithm on 512 and more processors.

99 GENERAL AND MISCELLANEOUS↗

Gap Closing/Finishing by Targeted Genomic Region Enrichment and Sequencing

Gap Closing/Finishing of draft genome assemblies is a labor and cost intensive process where several rounds of repetitious amplification and sequencing are required. Here we demonstrate a high throughput procedure where custom primers flanking gaps in draft genomes are designed. Primer libraries containing up to 4,000 unique pairs in independent droplets are merged with a fragmented genomic template. From this millions of picoliter scale droplets are formed, each one being the functional equivalent of an individual PCR reaction. The PCR products are concatenated and sequenced by Illumina which is then assembled and used for gap closure. Here we present an overall experimental strategy, primer design algorithm and initial results.

99 GENERAL AND MISCELLANEOUS↗

Implementing a Gaussian Process Learning Algorithm in Mixed Parallel Environment

In this paper, we present a scalability analysis of a parallel Gaussian process training algorithm to simultaneously analyze a massive number of time series. We study three different parallel implementations: using threads, MPI, and a hybrid implementation using threads and MPI. We compare the scalability for the multi-threaded implementation on three different hardware platforms: a Mac desktop with two quad-core Intel Xeon processors (16 virtual cores), a Linux cluster node with four quad-core 2.3 GHz AMD Opteron processors, and SGI Altix ICE 8200 cluster node with two quad-core Intel Xeon processors (16 virtual cores). We also study the scalability of the MPI based and the hybrid MPI and thread based implementations on the SGI cluster with 128 nodes (2048 cores). Experimental results show that the hybrid implementation scales better than the multi-threaded and MPI based implementations. The hybrid implementation, using 1536 cores, can analyze a remote sensing data set with over 4 million time series in nearly 5 seconds while the serial algorithm takes nearly 12 hours to process the same data set.

99 GENERAL AND MISCELLANEOUS↗

Inhomogeneous phase shifting: an algorithm for nonconstant phase displacements

In this work, we have developed a different algorithm than the classical one on phase-shifting interferometry. These algorithms typically use constant or homogeneous phase displacements and they can be quite accurate and insensitive to detuning, taking appropriate weight factors in the formula to recover the wrapped phase. However, these algorithms have not been considered with variable or inhomogeneous displacements. We have generalized these formulas and obtained some expressions for an implementation with variable displacements and ways to get partially insensitive algorithms with respect to these arbitrary error shifts.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Performance of 12 DIR algorithms in low-contrast regions for mass and density conserving deformation

Purpose: Deformable image registration (DIR) has become a key tool for adaptive radiotherapy to account for inter- and intrafraction organ deformation. Of contemporary interest, the application to deformable dose accumulation requires accurate deformation even in low contrast regions where dose gradients may exist within near-uniform tissues. One expects high-contrast features to generally be deformed more accurately by DIR algorithms. The authors systematically assess the accuracy of 12 DIR algorithms and quantitatively examine, in particular, low-contrast regions, where accuracy has not previously been established.Methods: This work investigates DIR algorithms in three dimensions using deformable gel (DEFGEL) [U. J. Yeo, M. L. Taylor, L. Dunn, R. L. Smith, T. Kron, and R. D. Franich, “A novel methodology for 3D deformable dosimetry,” Med. Phys. 39, 2203–2213 (2012)], for application to mass- and density-conserving deformations. CT images of DEFGEL phantoms with 16 fiducial markers (FMs) implanted were acquired in deformed and undeformed states for three different representative deformation geometries. Nonrigid image registration was performed using 12 common algorithms in the public domain. The optimum parameter setup was identified for each algorithm and each was tested for deformation accuracy in three scenarios: (I) original images of the DEFGEL with 16 FMs; (II) images with eight of the FMs mathematically erased; and (III) images with all FMs mathematically erased. The deformation vector fields obtained for scenarios II and III were then applied to the original images containing all 16 FMs. The locations of the FMs estimated by the algorithms were compared to actual locations determined by CT imaging. The accuracy of the algorithms was assessed by evaluation of three-dimensional vectors between true marker locations and predicted marker locations.Results: The mean magnitude of 16 error vectors per sample ranged from 0.3 to 3.7, 1.0 to 6.3, and 1.3 to 7.5 mm across algorithms for scenarios I to III, respectively. The greatest accuracy was exhibited by the original Horn and Schunck optical flow algorithm. In this case, for scenario III (erased FMs not contributing to driving the DIR calculation), the mean error was half that of the modified demons algorithm (which exhibited the greatest error), across all deformations. Some algorithms failed to reproduce the geometry at all, while others accurately deformed high contrast features but not low-contrast regions—indicating poor interpolation between landmarks.Conclusions: The accuracy of DIR algorithms was quantitatively evaluated using a tissue equivalent, mass, and density conserving DEFGEL phantom. For the model studied, optical flow algorithms performed better than demons algorithms, with the original Horn and Schunck performing best. The degree of error is influenced more by the magnitude of displacement than the geometric complexity of the deformation. As might be expected, deformation is estimated less accurately for low-contrast regions than for high-contrast features, and the method presented here allows quantitative analysis of the differences. The evaluation of registration accuracy through observation of the same high contrast features that drive the DIR calculation is shown to be circular and hence misleading.

61 RADIATION PROTECTION AND DOSIMETRY↗

A sufficient condition for the absence of the sign problem in the fermionic quantum Monte-Carlo algorithm

Quantum Monte-Carlo (QMC) simulations involving fermions have the notorious sign problem. Some well-known exceptions of the auxiliary field QMC algorithm rely on the factorizibility of the fermion determinant. Recently, a fermionic QMC algorithm has been found in which the fermion determinant may not necessarily factorizable, but can instead be expressed as a product of complex conjugate pairs of eigenvalues, thus eliminating the sign problem for a much wider class of models. In this paper, we present general conditions for the applicability of this algorithm and point out that it is deeply related to the time reversal symmetry of the fermion matrix. We apply this method to various models of strongly correlated systems at all doping levels and lattice geometries, and show that many novel phases can be simulated without the sign problem.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Generalized quasiharmonic approximation via space group irreducible derivatives

The quasiharmonic approximation (QHA) is the simplest nontrivial approximation for interacting phonons under constant pressure, bringing the effects of anharmonicity into temperature-dependent observables. Nonetheless, the QHA is often implemented with additional approximations due to the complexity of computing phonons under arbitrary strains, and the generalized QHA, which employs constant stress boundary conditions, has not been completely developed. In this work we formulate the generalized QHA, providing a practical algorithm for computing the strain state and other observables as a function of temperature and true stress. We circumvent the complexity of computing phonons under arbitrary strains by employing irreducible second-order displacement derivatives of the Born-Oppenheimer potential and their strain dependence, which are efficiently and precisely computed using the lone irreducible derivative approach. We formulate two complementary strain parametrizations: a discretized strain grid interpolation and a Taylor series expansion in symmetrized strain. We illustrate our approach by evaluating the temperature and pressure dependence of select elastic constants and the thermal expansion in thoria (ThO 2 ) using density functional theory with three exchange-correlation functionals. The QHA results are compared to our measurements of the elastic constant tensor using time-domain Brillouin scattering and inelastic neutron scattering. Our irreducible derivative approach simplifies the implementation of the generalized QHA, which will facilitate reproducible, data-driven applications.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Quantum Krylov subspace algorithms for ground- and excited-state energy estimation

Quantum Krylov subspace diagonalization (QKSD) algorithms provide a low-cost alternative to the conventional quantum phase estimation algorithm for estimating the ground- and excited-state energies of a quantum many-body system. While QKSD algorithms typically rely on using the Hadamard test for estimating Krylov subspace matrix elements of the form $\langle \phi_i|e^{-\widehat{H}τ}|\phi_j\rangle$, the associated quantum circuits require an ancilla qubit with controlled multiqubit gates that can be quite costly for near-term quantum hardware. In this paper, we show that a wide class of Hamiltonians relevant to condensed-matter physics and quantum chemistry contain symmetries that can be exploited to avoid the use of the Hadamard test. We propose a multifidelity estimation protocol that can be used to compute such quantities, showing that our approach, when combined with efficient single-fidelity estimation protocols, provides a substantial reduction in circuit depth. In addition, here we develop a unified theory of quantum Krylov subspace algorithms and present three quantum-classical algorithms for the ground- and excited-state energy estimation problems, where each algorithm provides various advantages and disadvantages in terms of total number of calls to the quantum computer, gate depth, classical complexity, and stability of the generalized eigenvalue problem within the Krylov subspace.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Structures of the fractional spaces generated by the difference neutron transport operator

The initial boundary value problem for the neutron transport equation is considered. The first, second and third order of accuracy difference schemes for the approximate solution of this problem are presented. Highly accurate difference schemes for neutron transport equation based on Padé approximation are constructed. In applications, stability estimates for solutions of difference schemes for the approximate solution of the neutron transport equation are obtained.The positivity of the neutron transport operator in Slobodeckij spaces is proved. Numerical techniques are developed and algorithms are tested on an example in MATLAB.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Analysis of the Multi-Phase Copying Garbage Collection Algorithm

The multi-phase copying garbage collection was designed to avoid the need for large amount of reserved memory usually required for the copying types of garbage collection algorithms. The collection is performed in multiple phases using the available free memory. This paper proves that the number of phases depends on the size of the reserved memory and the ratio of the garbage and accessible objects. The performance of the implemented algorithm is tested in a fine-grained parallel Prolog system. We find that reserving only 10% of memory for garbage collection is sufficient for good performance in practice. Additionally, an improvement of the generic algorithm specifically for the tested parallel Prolog system is described.

97 MATHEMATICS AND COMPUTING↗