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 577 records · Page 32

Fast decoding techniques for extended single-and-double-error-correcting Reed Solomon codes

A problem in designing semiconductor memories is to provide some measure of error control without requiring excessive coding overhead or decoding time. For example, some 256K-bit dynamic random access memories are organized as 32K x 8 bit-bytes. Byte-oriented codes such as Reed Solomon (RS) codes provide efficient low overhead error control for such memories. However, the standard iterative algorithm for decoding RS codes is too slow for these applications. Some special high speed decoding techniques for extended single and double error correcting RS codes. These techniques are designed to find the error locations and the error values directly from the syndrome without having to form the error locator polynomial and solve for its roots.

Costello, D. J., Jr.↗

A method for remote sensing the emissivity, fractional cloud cover and cloud top temperature of high-level, thin clouds

A methodology for retrieving the emissivity, cloud cover and cloud top temperature of high-level, thin clouds is developed and described. In the thermal infrared windows, the outgoing radiances from the earth's atmosphere contain information about cloud emissivity and cloud top temperature. This information is clearly demonstrated in the brightness temperature difference curves of two window channels. For the purpose of illustration, two window channels centered at 810 and 930 cm are chosen to construct the brightness temperature difference curves for a range of cloud top temperatures. These curves vary for different cloud top temperatures, and along each of these curves the emissivity changes. The brightness temperature difference method is used in a simulation study to demonstrate the feasibility of retrieving the cloud top temperature and emissivity by the utilization of measurements in two window channels. As expected, a perfect retrieval is found if perfect measurements and ideal atmospheric conditions are assumed. If a random error, which has a normal distribution with a mean of zero and standard deviation of + or - 0.5 C, is imposed to the measurements, a reasonable retrieval is found for emissivity greater than 0.3. The algorithm has been applied to a limited amount of HIRS2 data, which has 3.7, 3.98 and 11 micron channels. The cloud top temperature, emissivity and cloud cover are determined by using these channels.

Wu, Man-Li C.↗

Application of Sparse Identification of Nonlinear Dynamics for Physics-Informed Learning

Advances in machine learning and deep neural networks has enabled complex engineering tasks like image recognition, anomaly detection, regression, and multi-objective optimization, to name but a few. The complexity of the algorithm architecture, e.g., the number of hidden layers in a deep neural network, typically grows with the complexity of the problems they are required to solve, leaving little room for interpreting (or explaining) the path that results in a specific solution. This drawback is particularly relevant for autonomous aerospace and aviation systems, where certifications require a complete understanding of the algorithm behavior in all possible scenarios. Including physics knowledge in such data-driven tools may improve the interpretability of the algorithms, thus enhancing model validation against events with low probability but relevant for system certification. Such events include, for example, spacecraft or aircraft sub-system failures, for which data may not be available in the training phase. This paper investigates a recent physics-informed learning algorithm for identification of system dynamics, and shows how the governing equations of a system can be extracted from data using sparse regression. The learned relationships can be utilized as a surrogate model which, unlike typical data-driven surrogate models, relies on the learned underlying dynamics of the system rather than large number of fitting parameters. The work shows that the algorithm can reconstruct the differential equations underlying the observed dynamics using a single trajectory when no uncertainty is involved. However, the training set size must increase when dealing with stochastic systems, e.g., nonlinear dynamics with random initial conditions.

Corbetta, Matteo↗

Salvaging Data Records with Missing Data: Data Imputation using the Multivariate t Distribution

When doing multivariate data analysis, one commonobstacle is the presence of incomplete observations, i.e., observationsfor which one or more key fields are blank. Missing datais often countered by deleting entire observations that containmissing data. The negative effects of deleting entire observationsare multiple: deleting observations reduces sample size andcan also result in biased inferences even if data is missing atrandom. In addition, knowledge contained within incompleteobservations is knowledge lost when they are deleted– and theeffort spent collecting that knowledge is effort wasted. Data imputationmethods, or methods of statistically “filling-in” missingdata, can help combat small sample sizes by using the existinginformation in partially complete observations with the end goalof producing less biased and higher confidence inferences. Whena sample from a multivariate normal population is only partiallycomplete, and the missing data meets appropriate assumptions(missing at random), robust data imputation of the missing datacan be implemented with monotone data augmentation (MDA)using the multivariate t distribution.Missing data imputation is applied to data from the NASA InstrumentCost Model (NICM) using the MDA algorithm underthe assumption of having a multivariate t distribution with fixeddegrees of freedom. A sensitivity analysis to the degrees offreedom parameter is presented to demonstrate robustness ofthe multivariate t distribution when dealing with small samplesas compared to the multivariate normal distribution.

DiNicola, Michael↗

Efficient Floating-Point Arithmetic on Fault-Tolerant Quantum Computers

We propose a novel floating-point encoding scheme that builds on prior work involving fixed-point encodings. We encode floating-point numbers using Two's Complement fixed-point mantissas and Two's Complement integral exponents. We used our proposed approach to develop quantum algorithms for fundamental arithmetic operations, such as bit-shifting, reciprocation, multiplication, and addition. We prototyped and investigated the performance of the floating-point encoding scheme on quantum computer simulations by performing reciprocation on randomly drawn inputs and by solving first-order ordinary differential equations, while varying the number of qubits in the encoding. We observed rapid convergence to the exact solutions as we increased the number of qubits and a significant reduction in the number of ancilla qubits required for reciprocation when compared with similar approaches.

Serrallés, José Cruz [Weill Cornell Med. Coll.]↗

Algorithms and logic for incorporating ILS NASA TCV B-737 airplane area navigation system

The algorithms and logic for use in the implementation of instrument landing system (ILS) localizer deviation signals for the generation of navigation and guidance information are presented. The navigation position estimates, based on range information from a randomly chosen distance measuring equipment (DME) and ILS localizer deviation information, are illustrated. The ILS volumetric coverage and DME geometric checks are described and their addition to area navigation systems with minimum software modification are discussed.

Knox, C. E.↗

Analysis of sequencing and scheduling methods for arrival traffic

The air traffic control subsystem that performs scheduling is discussed. The function of the scheduling algorithms is to plan automatically the most efficient landing order and to assign optimally spaced landing times to all arrivals. Several important scheduling algorithms are described and the statistical performance of the scheduling algorithms is examined. Scheduling brings order to an arrival sequence for aircraft. First-come-first-served scheduling (FCFS) establishes a fair order, based on estimated times of arrival, and determines proper separations. Because of the randomness of the traffic, gaps will remain in the scheduled sequence of aircraft. These gaps are filled, or partially filled, by time-advancing the leading aircraft after a gap while still preserving the FCFS order. Tightly scheduled groups of aircraft remain with a mix of heavy and large aircraft. Separation requirements differ for different types of aircraft trailing each other. Advantage is taken of this fact through mild reordering of the traffic, thus shortening the groups and reducing average delays. Actual delays for different samples with the same statistical parameters vary widely, especially for heavy traffic.

Neuman, Frank↗

In search of random noise

In order to make the best high resolution images of IRAS data it is necessary to incorporate any knowledge about the instrument into a model: the IRAS model. This is necessary since every remaining systematic effect will be amplified by any high resolution technique into spurious artifacts in the images. The search for random noise is in fact the never-ending quest for better quality results, and can only be obtained by better models. The Dutch high-resolution effort has resulted in HIRAS which drives the MEMSYS5 algorithm. It is specifically designed for IRAS image construction. A detailed description of HIRAS with many results is in preparation. In this paper we emphasize many of the instrumental effects incorporated in the IRAS model, including our improved 100 micron IRAS response functions.

Kester, DO↗

Discussion on LDPC Codes and Uplink Coding

This slide presentation reviews the progress that the workgroup on Low-Density Parity-Check (LDPC) for space link coding. The workgroup is tasked with developing and recommending new error correcting codes for near-Earth, Lunar, and deep space applications. Included in the presentation is a summary of the technical progress of the workgroup. Charts that show the LDPC decoder sensitivity to symbol scaling errors are reviewed, as well as a chart showing the performance of several frame synchronizer algorithms compared to that of some good codes and LDPC decoder tests at ESTL. Also reviewed is a study on Coding, Modulation, and Link Protocol (CMLP), and the recommended codes. A design for the Pseudo-Randomizer with LDPC Decoder and CRC is also reviewed. A chart that summarizes the three proposed coding systems is also presented.

uplink↗

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↗

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↗

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↗

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↗