Search NASA⌕ Search

SEARCH · Search NASA

Results for “randomized 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,495 records · Page 83

Ares I-X In-Flight Modal Identification

Operational modal analysis is a procedure that allows the extraction of modal parameters of a structure in its operating environment. It is based on the idealized premise that input to the structure is white noise. In some cases, when free decay responses are corrupted by unmeasured random disturbances, the response data can be processed into cross-correlation functions that approximate free decay responses. Modal parameters can be computed from these functions by time domain identification methods such as the Eigenvalue Realization Algorithm (ERA). The extracted modal parameters have the same characteristics as impulse response functions of the original system. Operational modal analysis is performed on Ares I-X in-flight data. Since the dynamic system is not stationary due to propellant mass loss, modal identification is only possible by analyzing the system as a series of linearized models over short periods of time via a sliding time-window of short time intervals. A time-domain zooming technique was also employed to enhance the modal parameter extraction. Results of this study demonstrate that free-decay time domain modal identification methods can be successfully employed for in-flight launch vehicle modal extraction.

Bartkowicz, Theodore J.↗

On Kalman filter solution of space-time interpolation

The approximate Kalman filtering algorithm presented in [1] for image sequence processing can introduce unacceptable negative eigenvalues in the information matrix and can have degraded performance in some applications. The improved algorithm presented in this note guarantees a positive definite information matrix, leading to more stable filter performance.

data↗

A Multilevel Approach For SolvingLarge-Scale QUBO Problems With Noisy Hybrid Quantum Approximate Optimization

Quantum approximate optimization is one ofthe promising candidates for useful quantum computation,particularly in the context of finding approximate solutionsto Quadratic Unconstrained Binary Optimization (QUBO)problems. However, the existing quantum processing units(QPUs) are of relatively small size, and canonical mappingsof QUBO via the Ising model require one qubit per vari-able, rendering direct large-scale optimization infeasible.In classical optimization, a general strategy for addressingmany large-scale problems is via multilevel/multigrid meth-ods, where the large target problem is iteratively coarsenedand the global solution is constructed from multiple small-scale optimization runs. In this work, we experimentallytest how existing QPUs perform when used as a sub-solverwithin such a multilevel strategy. To this aim, we com-bine and extend (via additional classical processing steps)the recently proposed Noise-Directed Adaptive Remapping(NDAR) and Quantum Relax&Round (QRR) algorithms.We first demonstrate the effectiveness of our heuristicextensions on Rigetti’s superconducting transmon deviceAnkaa-2. We find approximate solutions to10instances offully connected82-qubit Sherrington-Kirkpatrick graphswith random integer-valued coefficients obtaining normal-ized approximation ratios (ARs) in the range∼0.98−1.0,and the same class with real-valued coefficients (ARs∼0.94−1.0). Then, we implement the extended NDAR andQRR algorithms as subsolvers in the multilevel algorithmfor6large-scale graphs with at most∼27,000variables.In practice, the QPU (with classical post-processing steps)is used to find approximate solutions to dozens of at most82-qubit problems, which are iteratively used to constructthe global solution. We observe that quantum optimizationresults are competitive in terms of the quality of solutionswhen compared to classical heuristics used as subsolverswithin the multilevel approach.Reproducibility: source code and data are available at[TBA upon acceptance]

quantum computing↗

Data-Intensive Memory-Map simulator and runtime

DI-MMAP is a simulator for modeling the performance of next generation non-volatile random access memory technologies (NVRAM) and a high-perfromance memory-map runtime for the Linux operating system. It is implemented as a device driver for the Linux operating system. It will be used by algorithm designers to unserstand the impact of future NVRAM on their algorithms and will be used by application developers for high-performance access to NVRAM storage.

Essen, B. B.↗

Rapid estimation of earthquake locations using waveform traveltimes

SUMMARY We introduce a new approach for locating earthquakes using arrival times derived from waveforms. The most costly computational step of the algorithm scales as the number of stations in the active seismographic network. In this approach, a variation on existing grid search methods, a series of full waveform simulations are conducted for all receiver locations, with sources positioned successively at each station. The traveltime field over the region of interest is calculated by applying a phase picking algorithm to the numerical wavefields produced from each simulation. An event is located by subtracting the stored traveltime field from the arrival time at each station. This provides a shifted and time-reversed traveltime field for each station. The shifted and time-reversed fields all approach the origin time of the event at the source location. The mean or median value at the source location thus approximates the event origin time. Measures of dispersion about this mean or median time at each grid point, such as the sample standard error and the average deviation, are minimized at the correct source position. Uncertainty in the event position is provided by the contours of standard error defined over the grid. An application of this technique to a synthetic data set indicates that the approach provides stable locations even when the traveltimes are contaminated by additive random noise containing a significant number of outliers and velocity model errors. It is found that the waveform-based method out-performs one based upon the eikonal equation for a velocity model with rapid spatial variations in properties due to layering. A comparison with conventional location algorithms in both a laboratory and field setting demonstrates that the technique performs at least as well as existing techniques.

58 GEOSCIENCES↗

Multi-cycle boiling water reactor fuel cycle optimization

In this work a new computer code, BWROPT (Boiling Water Reactor Optimization), is presented. BWROPT uses the Parallel Simulated Annealing (PSA) algorithm to solve the out-of-core optimization problem coupled with an in-core optimization that determines the optimum fuel loading pattern. However it uses a Haling power profile for the depletion instead of optimizing the operating strategy. The result of this optimization is the optimum new fuel inventory and the core loading pattern for the first cycle considered in the optimization. Several changes were made to the optimization algorithm with respect to other nuclear fuel cycle optimization codes that use PSA. Instead of using constant sampling probabilities for the solution perturbation types throughout the optimization as is usually done in PSA optimizations the sampling probabilities are varied to get a better solution and/or decrease runtime. The new fuel types available for use can be sorted into an array based on any number of parameters so that each parameter can be incremented or decremented, which allows for more precise fuel type selection compared to random sampling. Also, the results are sorted by the new fuel inventory of the first cycle for ease of comparing alternative solutions. (authors)

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Surface Navigation Using Optimized Waypoints and Particle Swarm Optimization

The design priority for manned space exploration missions is almost always placed on human safety. Proposed manned surface exploration tasks (lunar, asteroid sample returns, Mars) have the possibility of astronauts traveling several kilometers away from a home base. Deviations from preplanned paths are expected while exploring. In a time-critical emergency situation, there is a need to develop an optimal home base return path. The return path may or may not be similar to the outbound path, and what defines optimal may change with, and even within, each mission. A novel path planning algorithm and prototype program was developed using biologically inspired particle swarm optimization (PSO) that generates an optimal path of traversal while avoiding obstacles. Applications include emergency path planning on lunar, Martian, and/or asteroid surfaces, generating multiple scenarios for outbound missions, Earth-based search and rescue, as well as human manual traversal and/or path integration into robotic control systems. The strategy allows for a changing environment, and can be re-tasked at will and run in real-time situations. Given a random extraterrestrial planetary or small body surface position, the goal was to find the fastest (or shortest) path to an arbitrary position such as a safe zone or geographic objective, subject to possibly varying constraints. The problem requires a workable solution 100% of the time, though it does not require the absolute theoretical optimum. Obstacles should be avoided, but if they cannot be, then the algorithm needs to be smart enough to recognize this and deal with it. With some modifications, it works with non-stationary error topologies as well.

Birge, Brian↗

Ice Load Project Final Technical Report

As interest and investment in offshore wind projects increase worldwide, some turbines will be installed in locations where ice of significant thickness forms on the water surface. This ice moves under the driving forces of wind, current, and thermal effects and may result in substantial forces on bottom-fixed support structures. The North and Baltic Seas in Europe have begun to see significant wind energy development and the Great Lakes of the United States and Canada may host wind energy development in the near future. Design of the support structures for these projects is best performed through the use of an integrated tool that can calculate the cumulative effects of forces due to turbine operations, wind, waves, and floating ice. The dynamic nature of ice forces requires that these forces be included in the design simulations, rather than added as static forces to simulation results. The International Electrotechnical Commission (IEC) standard[2] for offshore wind turbine design and the International Organization for Standardization (ISO) standard[3] for offshore structures provide requirements and algorithms for the calculation of forces induced by surface ice; however, currently none of the major wind turbine dynamic simulation codes provides the ability to model ice loads. The scope of work of the project described in this report includes the development of a suite of subroutines, collectively named IceFloe, that meet the requirements of the IEC and ISO standards and couples with four of the major wind turbine dynamic simulation codes. The mechanisms by which ice forces impinge on offshore structures generally include the forces required for crushing of the ice against vertical-sided structures and the forces required to fracture the ice as it rides up on conical-sided structures. Within these two broad categories, the dynamic character of the forces with respect to time is also dependent on other factors such as the velocity and thickness of the moving ice and the response of the structure. In some cases, the dynamic effects are random and in other cases they are deterministic, such as the effect of structural resonance and coupling of the ice forces with the defection of the support structure. The initial versions of the IceFloe routines incorporate modules that address these varied force and dynamic phenomena with seven alternative algorithms that can be specified by the user. The IceFloe routines have been linked and tested with four major wind turbine aeroelastic simulation codes: FAST, a tool developed under the management of the National Renewable Energy Laboratory (NREL) and available free of charge from its web site; Bladed[4], a widely-used commercial package available from DNV GL; ADAMS[5], a general purpose multi-body simulation code used in the wind industry and available from MSC Software; and HAWC2[6], a code developed by and available for purchase from Danmarks Tekniske Universitet (DTU). Interface routines have been developed and tested with full wind turbine simulations for each of these codes and the source code and example inputs and outputs are available from the NREL website.

17 WIND ENERGY↗

Fast Monte Carlo simulation on a voxelized human phantom deformed to a patient

Purpose: A method for performing fast simulations of absorbed dose using a patient's computerized tomography (CT) scan without explicitly relying on a calibration curve is presented. Methods: The method is based on geometrical deformations performed on a standard voxelized human phantom. This involves spatially transforming the human phantom to align it with the patient CT image. Since the chemical composition and density of each voxel are given in the phantom data, a calibration curve is not used in the proposed method. For this study, the Monte Carlo (MC) code PENELOPE has been used as the simulation of reference. The results obtained with PENELOPE simulations are compared to those obtained with PENFAST and with the collapsed cone convolution algorithm implemented in a commercial treatment planning system. Results: The comparisons of the absorbed doses calculated with the different algorithms on two patient CTs and the corresponding deformed phantoms show a maximum distance to agreement of 2 mm, and in general, the obtained absorbed dose distributions are compatible within the reached statistical uncertainty. The validity of the deformation method for a broad range of patients is shown using MC simulations in random density phantoms. A PENFAST simulation of a 6 MV photon beam impinging on a patient CT reaches 2% statistical uncertainty in the absorbed dose, in a 0.1 cm{sup 3} voxel along the central axis, in 10 min running on a single core of a 2.8 GHz CPU. Conclusions: The proposed method of the absorbed dose calculation in a deformed voxelized phantom allows for dosimetric studies in the geometry of a patient CT scan. This is due to the fact that the chemical composition and material density of the phantom are known. Furthermore, simulation using the phantom geometry can provide dosimetric information for each organ. The method can be used for quality assurance procedures. In relation to PENFAST, it is shown that a purely condensed-history algorithm (class I) can be used for absorbed dose estimation in patient CTs.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Eigensolver performance comparison on Cray XC systems

Summary Hermitian (symmetric) eigenvalue solvers are the core constituents of electronic structure, quantum‐chemistry, and other HPC applications such as Quantum ESPRESSO, VASP, CP2K, and NWChem to name a few. Our understanding of the performance of symmetric eigenvalue algorithms on various hardware is clearly important to the quantum chemistry or condensed matter physics community but in fact goes beyond that community. For instance, big data analytics is increasingly utilizing eigenvalues solvers, in the study of randomized singular value decomposition (SVD) or principal component analysis (PCA). Noise, vibration, and harshness (NVH) is another field where fast and efficient eigenvalue solvers are required. Most eigenvalue solver packages feature numerous different parameters which can be tuned for performance, eg, the number of nodes, number of total ranks, the decomposition of the matrix, etc. In this paper, we investigate the performance of different packages as well as the influence of these knobs on the solver performance.

Cook, Brandon↗

Coherent diffractive imaging using randomly coded masks

We experimentally demonstrate an extension to coherent diffractive imaging that encodes additional information through the use of a series of randomly coded masks, removing the need for typical object-domain constraints while guaranteeing a unique solution to the phase retrieval problem. Phase retrieval is performed using a numerical convex relaxation routine known as “PhaseCut,” an iterative algorithm known for its stability and for its ability to find the global solution, which can be found efficiently and which is robust to noise. The experiment is performed using a laser diode at 532.2 nm, enabling rapid prototyping for future X-ray synchrotron and even free electron laser experiments.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Novel Authentication Management for the Data Security of Smart Grid

Bidirectional wireless communication is employed in various smart grid components such as smart meters and control and monitoring applications where security is vital. The Trusted Third Party (TTP) and wireless connectivity between the smart meter and the third party in the key management-based encryption techniques for the smart grid are expected to be totally trustworthy and dependable. In a wired/wireless medium, however, a man-in-the-middle may seek to disrupt, monitor and manipulate the network, or simply execute a replay attack, revealing its vulnerability. Recognizing this, this study presents a novel authentication management (model) comprised of two layer security schema. The first layer implements an efficient novel encryption method for secure data exchange between meters and control center with the help of two partially trusted simple servers (constitutes the TTP). In this setting, one server handles the data encryption between the meter and control center/central database, and the other server administers the random sequence of data transmission. The second layer monitors and verifies exchanged data packets among smart meters. It detects abnormal packets from suspicious sources. To implement this node-to-node authentication, One class support vector machine algorithm is proposed which takes advantages of the location information as well as the data transmission history (node identification, packet size, and data transmission frequency). This schema secures data communication, and imposes a comprehensive privacy throughout the system without considerably extending the complexity of the conventional key management scheme.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Is the Multigrid Method Fault Tolerant? The Two-Grid Case

The predicted reduced resiliency of next-generation high performance computers means that it will become necessary to take into account the effects of randomly occurring faults on numerical methods. Further, in the event of a hard fault occurring, a decision has to be made as to what remedial action should be taken in order to resume the execution of the algorithm. The action that is chosen can have a dramatic effect on the performance and characteristics of the scheme. Ideally, the resulting algorithm should be subjected to the same kind of mathematical analysis that was applied to the original, deterministic variant. The purpose of this work is to provide the first rigorous analysis of the behavior of the multigrid algorithm in the presence of faults. Specifically, we prove estimates on the behavior of the Two Grid Method similar to the classical asymptotic results. Multigrid is arguably the method of choice for the solution of large-scale linear algebra problems arising from discretization of partial differential equations, and it is of considerable importance to anticipate its behavior on an exascale machine. The analysis of resilience of algorithms is in its infancy, and the current work is perhaps the first to provide a mathematical model for faults and analyze the behavior of a state-of-the-art algorithm under the model. It is shown that the Two Grid Method fails to be resilient to faults. Attention is then turned to identifying the minimal necessary remedial action required to restore the rate of convergence to that enjoyed by the ideal fault-free method.

Mathematics↗

Design of optimal partial state feedback controllers for linear systems in stochastic environments

The problem of obtaining an optimal control law, which is constrained to be a feedback of the available measurements, is considered for both continuous and discrete time linear systems subjected to additive white process noise and measurement noise. Necessary conditions are obtained for minimizing a quadratic performance function for both finite and infinite duration cases. The feedback gain matrices are constrained to be constant for the infinite duration cases. For all the cases considered, algorithms are derived for generating sequences of feedback gain matrices which successively improve the performance function. Computational aspects are discussed via application to two continuous time processes, including a helicopter/slung load system subjected to measurement noise and random wind gust input.

Joshi, S. M.↗

Turbulence control on an airborne laser platform

An active flow control device to generate large-scale, periodic structures in a turbulent shear flow is developed. Together with adaptive optics, the device may be used on airborne laser platforms to reduce or eliminate optical distortion caused by the turbulence in the aircraft's boundary layer. A cyclic jet issuing from a spanwise slot is used to collect the turbulent boundary layer for a finite time and then release all of the flow instantaneously in one large eddy that convects downstream. Flow visualization and hot-film probe measurements are used together with pattern recognition algorithms to demonstrate the viability of the flow control method. A flat plate towed in a water channel is used as a test bed. The instantaneous velocity signal is used to compute important statistical quantities of the random velocity field, such as the mean, the root-mean-square, the spectral distribution, and the probability density function. When optimized for a given boundary layer, it is shown that the cyclic jet will produce periodic structures that are similar to the random, naturally occurring ones. These structures seem to trigger the onset of bursting events near the wall of the plate. Thus, the present device generates periodic structures in both the outer and inner regions of a turbulent boundary layer.

Gad-El-hak, Mohamed↗

Algorithm Reveals Sinusoidal Component Of Noisy Signal

Algorithm performs simple statistical analysis of noisy signal to yield preliminary indication of whether or not signal contains sinusoidal component. Suitable for preprocessing or preliminary analysis of vibrations, fluctuations in pressure, and other signals that include large random components. Implemented on personal computer by easy-to-use program.

Kwok, Lloyd C.↗

Recent Advancements in Electrical Capacitance Mass Gauging for Cryogenic PropellantTanks

The current lack of unsettled mass gauging is a key roadblock for many space activities, such as orbital refueling, missions to the Moon and Mars, and nuclear thermal and nuclear electric propulsion technologies. Liquid can form any one of an infinite number of configurations in microgravity, such as floating in globs or accumulating on tank surfaces in discontiguous volumes, or both. Capacitive sensing requires no moving parts and dissipates close to zero heat, making it an ideal candidate for cryogenic fluid mass gauging in settled and unsettled configurations. Capacitive sensing has a history of proven use in space propellant tanks, including tanks on the space shuttle, Saturn V, and the Apollo Lunar Excursion Module. Modern capacitive sensor technology allows using the entire tank as the capacitor volume by placing electrodes on the tank walls and propellant management surfaces. Capacitance is directly related to density, and therefore to mass for fixed volumes. In this presentation, we discuss the concepts behind whole-tank capacitance mass gauging and associated engineering challenges. We describe recent efforts to develop a micro-g unsettled cryogenic mass gauge using whole-tank capacitance sensing, including the development of test beds, electronics, and algorithms. We describe several mathematical processing techniques, including empirical-based averaging, electrical capacitance volume tomography, and spatial regularization. A modeling study, performed using settled configurations in gravity and no gravity, and with a set of 100 random fluid configurations, has indicated that spatial regularization, in which capacitance measurements are weighted to account for non-uniform electric fields, yields a mass fraction accuracy of 8% for any fluid configuration. Such a sensor is expected to operate in real time with a sampling frequency of at least 1 kHz.

cryogenic↗

Z-Sequence: photometric redshift predictions for galaxy clusters with sequential random k-nearest neighbours

ABSTRACT We introduce Z-Sequence, a novel empirical model that utilizes photometric measurements of observed galaxies within a specified search radius to estimate the photometric redshift of galaxy clusters. Z-Sequence itself is composed of a machine learning ensemble based on the k-nearest neighbours algorithm. We implement an automated feature selection strategy that iteratively determines appropriate combinations of filters and colours to minimize photometric redshift prediction error. We intend for Z-Sequence to be a standalone technique but it can be combined with cluster finders that do not intrinsically predict redshift, such as our own DEEP-CEE. In this proof-of-concept study, we train, fine-tune, and test Z-Sequence on publicly available cluster catalogues derived from the Sloan Digital Sky Survey. We determine the photometric redshift prediction error of Z-Sequence via the median value of |Δ$z$|/(1 + $z$) (across a photometric redshift range of 0.05 ≤ $z$ ≤ 0.6) to be ∼0.01 when applying a small search radius. The photometric redshift prediction error for test samples increases by 30–50 per cent when the search radius is enlarged, likely due to line-of-sight interloping galaxies. Eventually, we aim to apply Z-Sequence to upcoming imaging surveys such as the Legacy Survey of Space and Time to provide photometric redshift estimates for large samples of as yet undiscovered and distant clusters.

Chan, Matthew C.↗