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

Preserving Collective Performance Across Process Failure for a Fault Tolerant MPI

Application developers are investigating Algorithm Based Fault Tolerance (ABFT) techniques to improve the efficiency of application recovery beyond what traditional techniques alone can provide. Applications will depend on libraries to sustain failure-free performance across process failure to continue to efficiently use High Performance Computing (HPC) systems even in the presence of process failure. Optimized Message Passing Interface (MPI) collective operations are a critical component of many scalable HPC applications. However, most of the collective algorithms are not able to handle process failure. Next generation MPI implementations must provide fault aware versions of such algorithms that can sustain performance across process failure. This paper discusses the design and implementation of fault aware collective algorithms for tree structured communication patterns. The three design approaches of rerouting, lookup avoiding and rebalancing are described, and analyzed for their performance impact relative to a similar fault unaware collective algorithm. The analysis shows that the rerouting approach causes up to a four times performance degradation while the rebalancing approach can bring the performance within 1% of the fault unaware performance. Additionally, this paper introduces the reader to a set of run-through stabilization semantics being developed by the MPI Forum's Fault Tolerance Working Group to support ABFT. This paper underscores the need for care to be taken when designing new fault aware collective algorithms for fault tolerant MPI implementations.

99 GENERAL AND MISCELLANEOUS↗

Latency Minimizing Tasking for Information Processing Systems

Real-time cyber-physical systems and information processing clusters require system designers to consider the total latency involved in collecting and aggregating data. For example, applications such as wild-fire monitoring require data to be presented to users in a timely manner. However, most models and algorithms for sensor networks have focused on alternative metrics such as energy efficiency. In this paper, we present a new model of sensor network aggregation that focuses on total latency. Our model is flexible and enables users to configure varying transmission and computation time on a node-by-node basis, and thus enables the simulation of complex computational phenomena. In addition, we present results from three tasking algorithms that trade-off local communication for overall latency performance. These algorithms are evaluated in simulated networks of up to 200 nodes. We've presented an aggregation-focused model of sensor networks that can be used to study the trade-offs between computational coverage and total latency. Our model explicitly takes into account transmission and computation times, and enables users to define different values for the basestation. In addition, we've presented three different tasking algorithms that operate over model to produce aggregation schedules of varying quality. In the future, we expect to continue exploring distributed tasking algorithms for information processing systems. We've shown that the gap between highly optimized schedules that use global information is quite large relative to our distributed algorithms. This gives us encouragement that future distributed tasking algorithms can still make large gains.

99 GENERAL AND MISCELLANEOUS↗

Constrained Graph Optimization: Interdiction and Preservation Problems

The maximum flow, shortest path, and maximum matching problems are a set of basic graph problems that are critical in theoretical computer science and applications. Constrained graph optimization, a variation of these basic graph problems involving modification of the underlying graph, is equally important but sometimes significantly harder. In particular, one can explore these optimization problems with additional cost constraints. In the preservation case, the optimizer has a budget to preserve vertices or edges of a graph, preventing them from being deleted. The optimizer wants to find the best set of preserved edges/vertices in which the cost constraints are satisfied and the basic graph problems are optimized. For example, in shortest path preservation, the optimizer wants to find a set of edges/vertices within which the shortest path between two predetermined points is smallest. In interdiction problems, one deletes vertices or edges from the graph with a particular cost in order to impede the basic graph problems as much as possible (for example, delete edges/vertices to maximize the shortest path between two predetermined vertices). Applications of preservation problems include optimal road maintenance, power grid maintenance, and job scheduling, while interdiction problems are related to drug trafficking prevention, network stability assessment, and counterterrorism. Computational hardness results are presented, along with heuristic methods for approximating solutions to the matching interdiction problem. Also, efficient algorithms are presented for special cases of graphs, including on planar graphs. The graphs in many of the listed applications are planar, so these algorithms have important practical implications.

97 MATHEMATICS AND COMPUTING↗

Parameter Sensitivity Analysis of the SparTen High Performance Sparse Tensor Decomposition Software (Extended Analysis)

Tensor decomposition models play an increasingly important role in modern data science applications. One problem of particular interest is fitting a low-rank Canonical Polyadic (CP) tensor decomposition model when the tensor has sparse structure and the tensor elements are nonnegative count data. SparTen is a high-performance C++ library which computes a low-rank decomposition using different solvers: a first-order quasi-Newton or a second-order damped Newton method, along with the appropriate choice of runtime parameters. Since default parameters in SparTen are tuned to experimental results in prior published work on a single real-world dataset conducted using MATLAB implementations of these methods, it remains unclear if the parameter defaults in SparTen are appropriate for general tensor data. Furthermore, it is unknown how sensitive algorithm convergence is to changes in the input parameter values. This report addresses these unresolved issues with large-scale experimentation on three benchmark tensor data sets. Experiments were conducted on several different CPU architectures and replicated with many initial states to establish generalized profiles of algorithm convergence behavior.

97 MATHEMATICS AND COMPUTING↗

The Mobius domain wall fermion algorithm

We present a review of the properties of generalized domain wall Fermions, based on a (real) Möbius transformation on the Wilson overlap kernel, discussing their algorithmic efficiency, the degree of explicit chiral violations measured by the residual mass (m res ) and the Ward–Takahashi identities. The Möbius class interpolates between Shamir’s domain wall operator and Boriçi’s domain wall implementation of Neuberger’s overlap operator without increasing the number of Dirac applications per conjugate gradient iteration. A new scaling parameter (α) reduces chiral violations at finite fifth dimension (L s ) but yields exactly the same overlap action in the limit L s → ∞ . Through the use of 4d Red/Black preconditioning and optimal tuning for the scaling α(L s ), we show that chiral symmetry violations are typically reduced by an order of magnitude at fixed Ls . Here, we argue that the residual mass for a tuned Möbius algorithm with α = O(1/L s γ ) for γ < 1 will eventually fall asymptotically as m res = O(1/L s 1+γ ) in the case of a 5D Hamiltonian with out a spectral gap.

97 MATHEMATICS AND COMPUTING↗

Ozone and Aerosol Retrieval from Backscattered Ultraviolet Radiation

In this presentation we will discuss the techniques to estimate total column ozone and aerosol absorption optical depth from the measurements of backscattered ultraviolet (buv) radiation. The total ozone algorithm has been used to create a unique record of the ozone layer, spanning more than 3 decades, from a series of instruments (BUV, SBUV, TOMS, SBUV/2) flown on NASA, NOAA, Japanese and Russian satellites. We will discuss how this algorithm can be considered a generalization of the well-known Dobson/Brewer technique that has been used to process data from ground-based instruments for many decades, and how it differs from the DOAS techniques that have been used to estimate vertical column densities of a host of trace gases from data collected by GOME and SCIAMACHY instruments. The BUV aerosol algorithm is most suitable for the detection of UV absorbing aerosols (smoke, desert dust, volcanic ash) and is the only technique that can detect aerosols embedded in clouds. This algorithm has been used to create a quarter century record of aerosol absorption optical depth using the BUV data collected by a series of TOMS instruments. We will also discuss how the data from the OM1 instrument launched on July 15,2004 will be combined with data from MODIS and CALIPSO lidar data to enhance the accuracy and information content of satellite-derived aerosol measurements. The OM1 and MODIS instruments are currently flying on EOS Aura and EOS Aqua satellites respectively, part of a constellation of satellites called the "A-train". The CALIPSO satellite is expected to join this constellation in mid 2005.

Bhartia, Pawan K.↗

Ozone and Aerosol Retrieval from Backscattered Ultraviolet Radiation

In this presentation we will discuss the techniques to estimate total column ozone and aerosol absorption optical depth from the measurements of back scattered ultraviolet (buv) radiation. The total ozone algorithm has been used to create a unique record of the ozone layer, spanning more than 3 decades, from a series of instruments (BUV, SBUV, TOMS, SBUV/2) flown on NASA, NOAA, Japanese and Russian satellites. We will discuss how this algorithm can be considered a generalization of the well-known Dobson/Brewer technique that has been used to process data from ground-based instruments for many decades, and how it differs from the DOAS techniques that have been used to estimate vertical column densities of a host of trace gases from data collected by GOME and SCIAMACHY instruments. The buv aerosol algorithm is most suitable for the detection of UV absorbing aerosols (smoke, desert dust, volcanic ash) and is the only technique that can detect aerosols embedded in clouds. This algorithm has been used to create a quarter century record of aerosol absorption optical depth using the buv data collected by a series of TOMS instruments. We will also discuss how the data from the OMI instrument launched on July 15, 2004 will be combined with data from MODIS and CALIPSO lidar data to enhance the accuracy and information content of satellite-derived aerosol measurements. The OMI and MODIS instruments are currently flying on EOS Aura and EOS Aqua satellites respectively, part of a constellation of satellites called the "A-train".

Bhartia, Pawan K.↗

A concept for a fuel efficient flight planning aid for general aviation

A core equation for estimation of fuel burn from path profile data was developed. This equation was used as a necessary ingredient in a dynamic program to define a fuel efficient flight path. The resultant algorithm is oriented toward use by general aviation. The pilot provides a description of the desired ground track, standard aircraft parameters, and weather at selected waypoints. The algorithm then derives the fuel efficient altitudes and velocities at the waypoints.

Collins, B. P.↗

Non-Boolean quantum amplitude amplification and quantum mean estimation

This paper generalizes the quantum amplitude amplification and amplitude estimation algorithms to work with non-Boolean oracles. The action of a non-Boolean oracle $U_\varphi $ on an eigenstate $\mathinner {|{x}\rangle }$ is to apply a state-dependent phase-shift $\varphi (x)$. Unlike Boolean oracles, the eigenvalues $\exp (i\varphi (x))$ of a non-Boolean oracle are not restricted to be $\pm 1$. Two new oracular algorithms based on such non-Boolean oracles are introduced. The first is the non-Boolean amplitude amplification algorithm, which preferentially amplifies the amplitudes of the eigenstates based on the value of $\varphi (x)$. Starting from a given initial superposition state $\mathinner {|{\psi _0}\rangle }$, the basis states with lower values of $\cos (\varphi )$ are amplified at the expense of the basis states with higher values of $\cos (\varphi )$. The second algorithm is the quantum mean estimation algorithm, which uses quantum phase estimation to estimate the expectation $\mathinner {\langle {\psi _0|U_\varphi |\psi _0}\rangle }$, i.e., the expected value of $\exp (i\varphi (x))$ for a random x sampled by making a measurement on $\mathinner {|{\psi _0}\rangle }$. It is shown that the quantum mean estimation algorithm offers a quadratic speedup over the corresponding classical algorithm. Both algorithms are demonstrated using simulations for a toy example. Potential applications of the algorithms are briefly discussed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The Structure and Evolution of LOCBURST: The BATSE Burst Location Algorithm

The gamma-ray burst (GRB) location algorithm used to produce the BATSE GRB locations is described. The general flow of control of the current location algorithm is presented, and the significant properties of the various physical inputs required are identified. The development of the burst location algorithm during the releases of the BATSE IB, 2B, and 3B GRB catalogs is presented so that the reasons for the differences in the positions and error estimates between the catalogs can be understood. In particular, differences between the 2B and 3B locations are discussed for events that have moved significantly and the reasons for the changes explained. The locations of bursts located independently by the interplanetary network (IPN) are used to illustrate the effect on burst location accuracy of various components of the algorithm. IPN data and locations from other gamma-ray instruments are used to calculate estimates of the systematic errors on BATSE burst locations.

Pendleton, Geoffrey N.↗

The Structure of Evolution LOCBURST: The BATSE Burst Location Algorithm

The gamma-ray bursts (GRB) location algorithm used to produce the BATSE GRB locations is described. The general flow of control of the current location algorithm is presented and the significant properties of the various physical inputs required are identified. The development of the burst location algorithm during the releases of the BATSE 1B, 2B, and 3B gamma-ray burst catalogs is presented so that the reasons for the differences in the positions and error estimates between the catalogs can be understood. In particular, differences between the 2B and 3B locations are discussed for events that have moved significantly and the reasons for the changes explained. The locations of bursts located independently by the interplanetary network are used to illustrate the effect on burst location accuracy of various components of the algorithm. IPN data as well as locations from other gamma-ray instruments are used to calculate estimates of the systematic errors on BATSE burst locations.

Pendleton, Geoffrey N.↗

Sheaf Theoretic Models for Routing in Delay Tolerant Networks

One key to communications scalability is routing; as such the goal of this paper is to build upon successful efforts towards general routing for space-based networks. With the ever-increasing accessibility of space, the number of assets is increasing, which becomes a critical communications burden in terms of scheduling, spectrum allocation, and resource allocation. In order to mitigate these concerns, a true networking approach is necessary; a standard approach for space systems is Delay Tolerant Networking (DTN). For DTN to be a meaningful answer to the Solar System Internet (SSI) question, DTN must offer meaningful routing solutions that span the heterogeneous collection of links and nodes. This, in turn, depends on the general structure of these disconnected networks -- a structure that remains largely unknown. In ground communications networks, routing decisions are made based on several pathfinding algorithms working in tandem. In previous work, we modeled Dijkstra's pathfinding algorithm using sheaves and provided a more general framework for determining paths using sheaves over graphs. Continuing our sheaf-theoretic approach, we introduce here an expansion of our pathfinding sheaf to handle more general information, and we expand on additional pathfinding algorithms that can be represented using sheaves. Moreover, we demonstrate means of combining multiple algorithms into a single sheaf structure so that changes of scale can be presented in the language of sheaves. In addition, space communications networks rely upon radio transmitter antennas which can establish broadcast and multicast communications options, rather than the primarily unicast options available to wired networks. Last year, we also introduced a multicast routing sheaf for presenting broadcast, unicast, and multicast communications over a graph. Extending that work, we also introduce queuing sheaves so that we can blend these communications options together to simulate a variety of routing options across space networks. In addition, we include examples to illustrate the applicability of this abstract theory to routing in disconnected networks.

Robert Short↗

Decomposition Algorithms for Solving NP-hard Problems on a Quantum Annealer

NP-hard problems such as the maximum clique or minimum vertex cover problems, two of Karp’s 21 NP-hard problems, have several applications in computational chemistry, biochemistry and computer network security. Adiabatic quantum annealers can search for the optimum value of such NP-hard optimization problems, given the problem can be embedded on their hardware. However, this is often not possible due to certain limitations of the hardware connectivity structure of the annealer. This paper studies a general framework for a decomposition algorithm for NP-hard graph problems aiming to identify an optimal set of vertices. Our generic algorithm allows us to recursively divide an instance until the generated subproblems can be embedded on the quantum annealer hardware and subsequently solved. Furthermore, the framework is applied to the maximum clique and minimum vertex cover problems, and we propose several pruning and reduction techniques to speed up the recursive decomposition. The performance of both algorithms is assessed in a detailed simulation study.

97 MATHEMATICS AND COMPUTING↗

Safety Case Patterns: Theory and Applications

We develop the foundations for a theory of patterns of safety case argument structures, clarifying the concepts involved in pattern specification, including choices, labeling, and well-founded recursion. We specify six new patterns in addition to those existing in the literature. We give a generic way to specify the data required to instantiate patterns and a generic algorithm for their instantiation. This generalizes earlier work on generating argument fragments from requirements tables. We describe an implementation of these concepts in AdvoCATE, the Assurance Case Automation Toolset, showing how patterns are defined and can be instantiated. In particular, we describe how our extended notion of patterns can be specified, how they can be instantiated in an interactive manner, and, finally, how they can be automatically instantiated using our algorithm.

Safety Assurance↗

A Unifying View of Estimation and Control Using Belief Propagation With Application to Path Planning

The use of estimation techniques on stochastic models to solve control problems is an emerging paradigm that falls under the rubric of Active Inference (AI) and Control as Inference (CAI). In this work, we use probability propagation on factor graphs to show that various algorithms proposed in the literature can be seen as specific composition rules in a factor graph. We show how this unified approach, presented both in probability space and in log of the probability space, provides a very general framework that includes the Sum-product, the Max-product, Dynamic programming and mixed Reward/Entropy criteria-based algorithms. The framework also expands algorithmic design options that lead to new smoother or sharper policy distributions. We propose original recursions such as: a generalized Sum/Max-product algorithm, a Smooth Dynamic programming algorithm and a modified versions of the Reward/Entropy algorithm. The discussion is carried over with reference to a path planning problem where the recursions that arise from various cost functions, although they may appear similar in scope, bear noticeable differences. We provide a comprehensive table of composition rules and a comparison through simulations, first on a synthetic small grid with a single goal with obstacles, and then on a grid extrapolated from a real-world scene with multiple goals and a semantic map.

Francesco A. N. Palmieri↗

A survey of upwind methods for flows with equilibrium and non-equilibrium chemistry and thermodynamics

Several versions of flux-vector split and flux-difference split algorithms were compared with regard to general applicability and complexity. Test computations were performed using curve-fit equilibrium air chemistry for an M = 5 high-temperature inviscid flow over a wedge, and an M = 24.5 inviscid flow over a blunt cylinder for test computations; for these cases, little difference in accuracy was found among the versions of the same flux-split algorithm. For flows with nonequilibrium chemistry, the effects of the thermodynamic model on the development of flux-vector split and flux-difference split algorithms were investigated using an equilibrium model, a general nonequilibrium model, and a simplified model based on vibrational relaxation. Several numerical examples are presented, including nonequilibrium air chemistry in a high-temperature shock tube and nonequilibrium hydrogen-air chemistry in a supersonic diffuser.

Grossman, B.↗

TH-E-17A-01: Internal Respiratory Surrogate for 4D CT Using Fourier Transform and Anatomical Features

Purpose: To develop a novel algorithm to generate internal respiratory signals for sorting of four-dimensional (4D) computed tomography (CT) images. Methods: The proposed algorithm extracted multiple time resolved features as potential respiratory signals. These features were taken from the 4D CT images and its Fourier transformed space. Several low-frequency locations in the Fourier space and selected anatomical features from the images were used as potential respiratory signals. A clustering algorithm was then used to search for the group of appropriate potential respiratory signals. The chosen signals were then normalized and averaged to form the final internal respiratory signal. Performance of the algorithm was tested in 50 4D CT data sets and results were compared with external signals from the real-time position management (RPM) system. Results: In almost all cases, the proposed algorithm generated internal respiratory signals that visibly matched the external respiratory signals from the RPM system. On average, the end inspiration times calculated by the proposed algorithm were within 0.1 s of those given by the RPM system. Less than 3% of the calculated end inspiration times were more than one time frame away from those given by the RPM system. In 3 out of the 50 cases, the proposed algorithm generated internal respiratory signals that were significantly smoother than the RPM signals. In these cases, images sorted using the internal respiratory signals showed fewer artifacts in locations corresponding to the discrepancy in the internal and external respiratory signals. Conclusion: We developed a robust algorithm that generates internal respiratory signals from 4D CT images. In some cases, it even showed the potential to outperform the RPM system. The proposed algorithm is completely automatic and generally takes less than 2 min to process. It can be easily implemented into the clinic and can potentially replace the use of external surrogates.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Complex-plane generalization of scalar Levin transforms: A robust, rapidly convergent method to compute potentials and fields in multi-layered media

We propose the complex-plane generalization of a powerful algebraic sequence acceleration algorithm, the method of weighted averages (MWA), to guarantee exponential-cum-algebraic convergence of Fourier and Fourier–Hankel (F–H) integral transforms. This “complex-plane” MWA, effected via a linear-path detour in the complex plane, results in rapid, absolute convergence of field and potential solutions in multi-layered environments regardless of the source-observer geometry and anisotropy/loss of the media present. In this work, we first introduce a new integration path used to evaluate the field contribution arising from the radiation spectra. Subsequently, we (1) exhibit the foundational relations behind the complex-plane extension to a general Levin-type sequence convergence accelerator, (2) specialize this analysis to one member of the Levin transform family (the MWA), (3) address and circumvent restrictions, arising for two-dimensional integrals associated with wave dynamics problems, through minimal complex-plane detour restrictions and a novel partition of the integration domain, (4) develop and compare two formulations based on standard/real-axis MWA variants, and (5) present validation results and convergence characteristics for one of these two formulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗