Search NASA⌕ Search

SEARCH · Search NASA

Results for “Algorithms.”

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,117 records · Page 62

Characterization of bandwidth requirements of algorithms for extreme scale science

Technology trends have resulted in widely different rates of improvement in computational throughput as compared to data movement rates in computer systems. With future systems, the cost of data movement through the memory hierarchy is expected to become even more dominant relative to the cost of performing arithmetic operations, both in terms of time and energy. Therefore, optimizing data access costs will become ever more critical in the coming years. However, unlike the well understood model of computational complexity in terms of the number of elementary operations to execute an algorithm, the inherent data-movement complexity of computations is unknown for most algorithms. Given the crucial importance of optimizing data access costs in scalable parallel systems, it is of great interest to develop techniques for understanding the inherent data movement complexity of an algorithm. In this project, we focus on this fundamental and significant problem.

97 MATHEMATICS AND COMPUTING↗

Genetic Algorithm for Hyperparameter Optimization in Gaussian Process Modeling

A genetic algorithm is developed and applied to optimize hyperparameters of convolutional recursively determined dual neural network-Gaussian process (NNGP) kernels. As a specific application of the combined GPNN-GA algorithm, it is applied to image classification in publicly available data of Hyper Suprime-Cam Subaru Strategic Program. Matthews correlation coefficient is calculated based on results of binary star-galaxy classification and used as a fitting function of the GA module of the algorithm. The simulation results confirm significant improvement of the classification accuracy with optimized hyperparameters.

79 ASTRONOMY AND ASTROPHYSICS↗

Quantum Algorithms for Collider Physics (Final Report)

The goal of this project was to unite powerful analysis techniques in high-energy physics (HEP) with cutting-edge advances in quantum information science (QIS). Almost every event at the Large Hadron Collider (LHC) involves jets, collimated sprays of particles that are copiously produced in proton-proton collisions. Current LHC algorithms to identify and classify jets are constrained by the limits of classical computation. Quantum algorithms could fundamentally change how collider data is analyzed, by speeding up existing classical algorithms and by enabling new quantum jet representations. By exploiting the capabilities of quantum computation, this research confronted the challenge of data analysis in collider physics.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Unitary Qubit Lattice Algorithms for Plasma Physics

This final technical report summarizes research conducted under DOE Award DE-SC0021653 to develop unitary Quantum Lattice Algorithms for modeling electromagnetic wave propagation and scattering in complex media, including plasmas. The project developed and validated quantum-inspired formulations of Maxwell's equations that preserve unitary evolution and can be evaluated on classical high-performance computing systems while providing a foundation for future quantum-computing implementations. Major accomplishments include the development of two- and three-dimensional algorithms for electromagnetic scattering; scalable, distributed-memory implementations demonstrated on the Perlmutter supercomputer; formulations for nonlinear lossless fluid dynamics and cold, lossless, inhomogeneous magnetized plasmas; and an explicit quantum algorithm for a time-discretized Lorenz model. Simulations reproduced a range of characteristic wave phenomena, including transient effects that are not readily apparent in conventional frequency-domain studies, demonstrating the effectiveness of the proposed approach for modeling complex electromagnetic and plasma systems. The work establishes a unified theoretical and computational framework for quantum and quantum-inspired simulation and provides a foundation for future implementation on fault-tolerant quantum systems.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A genetic algorithm approach in interface and surface structure optimization

The thesis is divided into two parts. In the first part a global optimization method is developed for the interface and surface structures optimization. Two prototype systems are chosen to be studied. One is Si[001] symmetric tilted grain boundaries and the other is Ag/Au induced Si(111) surface. It is found that Genetic Algorithm is very efficient in finding lowest energy structures in both cases. Not only existing structures in the experiments can be reproduced, but also many new structures can be predicted using Genetic Algorithm. Thus it is shown that Genetic Algorithm is a extremely powerful tool for the material structures predictions. The second part of the thesis is devoted to the explanation of an experimental observation of thermal radiation from three-dimensional tungsten photonic crystal structures. The experimental results seems astounding and confusing, yet the theoretical models in the paper revealed the physics insight behind the phenomena and can well reproduced the experimental results.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Parallelism of the SANDstorm hash algorithm.

Mainstream cryptographic hashing algorithms are not parallelizable. This limits their speed and they are not able to take advantage of the current trend of being run on multi-core platforms. Being limited in speed limits their usefulness as an authentication mechanism in secure communications. Sandia researchers have created a new cryptographic hashing algorithm, SANDstorm, which was specifically designed to take advantage of multi-core processing and be parallelizable on a wide range of platforms. This report describes a late-start LDRD effort to verify the parallelizability claims of the SANDstorm designers. We have shown, with operating code and bench testing, that the SANDstorm algorithm may be trivially parallelized on a wide range of hardware platforms. Implementations using OpenMP demonstrates a linear speedup with multiple cores. We have also shown significant performance gains with optimized C code and the use of assembly instructions to exploit particular platform capabilities.

97 MATHEMATICS AND COMPUTING↗

A Novel Auto-Scaling MPPT Algorithm based on Perturb and Observe Method for Photovoltaic Modules under Partial Shading Conditions

Maximum Power Point Tracking (MPPT) controller is required in a solar photovoltaic (PV) system to deliver the maximum power to load from PV module. This paper proposes a novel stepped MPPT method to realize a simple MPPT controller, which can track the real maximum power point (RMPP) even under partial shading conditions. The proposed algorithm is started by scanning the characteristic curve of the PV modules to detect the global maximum power point and then the algorithm will be switched to the conventional P&O algorithm to track the true maximum power point. The obtained simulation results, using Power electronic simulation software (PSIM), are compared with those found using the P&O method to confirm the performance of our proposed MPPT method even under non-uniform solar irradiation.

14 SOLAR ENERGY↗

A Novel Energy-Aware Distributed Clustering Algorithm for Heterogeneous Wireless Sensor Networks in the Mobile Environment

In order to prolong the network lifetime, energy-efficient protocols adapted to the features of wireless sensor networks should be used. This paper explores in depth the nature of heterogeneous wireless sensor networks, and finally proposes an algorithm to address the problem of finding an effective pathway for heterogeneous clustering energy. The proposed algorithm implements cluster head selection according to the degree of energy attenuation during the network’s running and the degree of candidate nodes’ effective coverage on the whole network, so as to obtain an even energy consumption over the whole network for the situation with high degree of coverage. Simulation results show that the proposed clustering protocol has better adaptability to heterogeneous environments than existing clustering algorithms in prolonging the network lifetime.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Supervisory Algorithm for Autonomous Hemodynamic Management Systems

Future military conflicts will require new solutions to manage combat casualties. The use of automated medical systems can potentially address this need by streamlining and augmenting the delivery of medical care in both emergency and combat trauma environments. However, in many situations, these systems may need to operate in conjunction with other autonomous and semi-autonomous devices. Management of complex patients may require multiple automated systems operating simultaneously and potentially competing with each other. Supervisory controllers capable of harmonizing multiple closed-loop systems are thus essential before multiple automated medical systems can be deployed in managing complex medical situations. The objective for this study was to develop a Supervisory Algorithm for Casualty Management (SACM) that manages decisions and interplay between two automated systems designed for management of hemorrhage control and resuscitation: an automatic extremity tourniquet system and an adaptive resuscitation controller. SACM monitors the required physiological inputs for both systems and synchronizes each respective system as needed. We present a series of trauma experiments carried out in a physiologically relevant benchtop circulatory system in which SACM must recognize extremity or internal hemorrhage, activate the corresponding algorithm to apply a tourniquet, and then resuscitate back to the target pressure setpoint. SACM continues monitoring after the initial stabilization so that additional medical changes can be quickly identified and addressed, essential to extending automation algorithms past initial trauma resuscitation into extended monitoring. Overall, SACM is an important step in transitioning automated medical systems into emergency and combat trauma situations. Future work will address further interplay between these systems and integrate additional medical systems.

42 ENGINEERING↗

An Easy Algorithm to Generate Colored Noise Sequences

The need for accurate and efficient simulation of the noise background arises in statistical significance tests for periodic signals buried in colored noise. This paper discusses techniques for generating colored-noise sequences which simulate processes with a given spectral density. Matlab routines based on the fast fractional difference algorithm are presented. These routines can create various stochastic models (e.g., first-order autoregressive (AR(1)), power law (PL), autoregressive fractionally integrated moving average ((1, d, 0)), and generalized Gauss Markov (GGM)) that serve as possible candidate null hypotheses to test against in various scenarios. Allan variance and power spectral density (PSD) show that our algorithms are accurate and efficient, and can be easily implemented for stationary noise models and non-stationary PLs with spectral indices up to 2. Our algorithms can also be extended to produce a non-stationary PL with a range-limited steeper PSD (spectral indices up to about 4) using a GGM approximation with a proper break frequency. The red-noise leakage effect on the periodogram is further discussed. The result shows that our GGM approximation has a potential for alleviating the red-noise leakage in the PSD estimates. The Timmer and Koenig procedure is also included for comparison.

79 ASTRONOMY AND ASTROPHYSICS↗

Assessment of Gamma-Ray-Spectra Analysis Method Utilizing the Fireworks Algorithm for Various Error Measures

The analysis of measured data plays a significant role in enhancing nuclear nonproliferation mainly by inferring the presence of patterns associated with special nuclear materials. Among various types of measurements, gamma-ray spectra is the widest utilized type of data in nonproliferation applications. In this paper, a method that employs the fireworks algorithm (FWA) for analyzing gamma-ray spectra aiming at detecting gamma signatures is presented. In particular, FWA is utilized to fit a set of known signatures to a measured spectrum by optimizing an objective function, where non-zero coefficients express the detected signatures. FWA is tested on a set of experimentally obtained measurements optimizing various objective functions—MSE, RMSE, Theil-2, MAE, MAPE, MAP—with results exhibiting its potential in providing highly accurate and precise signature detection. Finally and furthermore, FWA is benchmarked against genetic algorithms and multiple linear regression, showing its superiority over those algorithms regarding precision with respect to MAE, MAPE, and MAP measures.

97 MATHEMATICS AND COMPUTING↗

Combining machine-learned and empirical force fields with the parareal algorithm: application to the diffusion of atomistic defects

We numerically investigate an adaptive version of the parareal algorithm in the context of molecular dynamics. This adaptive variant has been originally introduced in [1]. We focus here on test cases of physical interest where the dynamics of the system is modelled by the Langevin equation and is simulated using the molecular dynamics software LAMMPS. In this work, the parareal algorithm uses a family of machine-learning spectral neighbor analysis potentials (SNAP) as fine, reference, potentials and embedded-atom method potentials (EAM) as coarse potentials. We consider a self-interstitial atom in a tungsten lattice and compute the average residence time of the system in metastable states. Our numerical results demonstrate significant computational gains using the adaptive parareal algorithm in comparison to a sequential integration of the Langevin dynamics. We also identify a large regime of numerical parameters for which statistical accuracy is reached without being a consequence of trajectorial accuracy.

36 MATERIALS SCIENCE↗

ALGORITHMS FOR OPTIMIZATION OF SYSYTEM PERFORMANCE IN LAYERED DETECTION SYSTEMS UNDER DETECTOR COORELATION

Almost all of the "architectures" for radiation detection systems in Department of Energy (DOE) and other USG programs rely on some version of layered detector deployment. Efficacy analyses of layered (or more generally extended) detection systems in many contexts often assume statistical independence among detection events and thus predict monotonically increasing system performance with the addition of detection layers. We show this to be a false conclusion for the ROC curves typical of most current technology gamma detectors, and more generally show that statistical independence is often an unwarranted assumption for systems in which there is ambiguity about the objects to be detected. In such systems, a model of correlation among detection events allows optimization of system algorithms for interpretation of detector signals. These algorithms are framed as optimal discriminant functions in joint signal space, and may be applied to gross counting or spectroscopic detector systems. We have shown how system algorithms derived from this model dramatically improve detection probabilities compared to the standard serial detection operating paradigm for these systems. These results would not surprise anyone who has confronted the problem of correlated errors (or failure rates) in the analogous contexts, but is seems to be largely underappreciated among those analyzing the radiation detection problem – independence is widely assumed and experimental studies typical fail to measure correlation. This situation, if not rectified, will lead to several unfortunate results. Including [1] overconfidence in system efficacy, [2] overinvestment in layers of similar technology, and [3] underinvestment in diversity among detection assets.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Can search algorithms save large-scale automatic performance tuning?

Empirical performance optimization of computer codes using autotuners has received significant attention in recent years. Given the increased complexity of computer architectures and scientific codes, evaluating all possible code variants is prohibitively expensive for all but the simplest kernels. One way for autotuners to overcome this hurdle is through use of a search algorithm that finds high-performing code variants while examining relatively few variants. In this paper we examine the search problem in autotuning from a mathematical optimization perspective. As an illustration of the power and limitations of this optimization, we conduct an experimental study of several optimization algorithms on a number of linear algebra kernel codes. We find that the algorithms considered obtain performance gains similar to the optimal ones found by complete enumeration or by large random searches but in a tiny fraction of the computation time.

97 MATHEMATICS AND COMPUTING↗

MRCK_3D contact detonation algorithm

Large-scale Combined Finite-Discrete Element Methods (FEM-DEM) and Discrete Element Methods (DEM) simulations involving contact of a large number of separate bod ies need an efficient, robust and flexible contact detection algorithm. In this work the MRCK-3D search algorithm is outlined and its main CPU perfonnances are evaluated. One of the most important aspects of this newly developed search algorithm is that it is applicable to systems consisting of many bodies of different shapes and sizes.

58 GEOSCIENCES↗

Some domain decomposition algorithms for mixed formulations of elasticity and incompressible fluids.

In this talk, we present a collection of domain decomposition algorithms for mixed finite element formulations of elasticity and incompressible fluids. The key component of each of these algorithms is the coarse space. Here, the coarse spaces are obtained in an algebraic manner by harmonically extending coarse boundary data. Various aspects of the coarse spaces are discussed for both continuous and discontinuous interpolation of pressure. Further, both classical overlapping Schwarz and hybrid iterative substructuring preconditioners are described. Numerical results are presented for almost incompressible elasticity and the Navier Stokes equations which demonstrate the utility of the methods for both structured and irregular mesh decompositions. We also discuss a simple residual scaling approach which often leads to significant reductions in iterations for these algorithms.

99 GENERAL AND MISCELLANEOUS↗

A Log-Scaling Fault Tolerant Agreement Algorithm for a Fault Tolerant MPI

The lack of fault tolerance is becoming a limiting factor for application scalability in HPC systems. The MPI does not provide standardized fault tolerance interfaces and semantics. The MPI Forum's Fault Tolerance Working Group is proposing a collective fault tolerant agreement algorithm for the next MPI standard. Such algorithms play a central role in many fault tolerant applications. This paper combines a log-scaling two-phase commit agreement algorithm with a reduction operation to provide the necessary functionality for the new collective without any additional messages. Error handling mechanisms are described that preserve the fault tolerance properties while maintaining overall scalability.

99 GENERAL AND MISCELLANEOUS↗

Combinatorial approximation algorithms for MAXCUT using random walks.

We give the first combinatorial approximation algorithm for MaxCut that beats the trivial 0.5 factor by a constant. The main partitioning procedure is very intuitive, natural, and easily described. It essentially performs a number of random walks and aggregates the information to provide the partition. We can control the running time to get an approximation factor-running time tradeoff. We show that for any constant b > 1.5, there is an {tilde O}(n{sup b}) algorithm that outputs a (0.5 + {delta})-approximation for MaxCut, where {delta} = {delta}(b) is some positive constant. One of the components of our algorithm is a weak local graph partitioning procedure that may be of independent interest. Given a starting vertex i and a conductance parameter {phi}, unless a random walk of length {ell} = O(log n) starting from i mixes rapidly (in terms of {phi} and {ell}), we can find a cut of conductance at most {phi} close to the vertex. The work done per vertex found in the cut is sublinear in n.

99 GENERAL AND MISCELLANEOUS↗