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,477 records · Page 82

Digital vibration control techniques

Analog vibration control techniques are reviewed and are compared with digital techniques. The advantages of the digital methods over the analog methods are demonstrated. The following topics are covered: (1) methods of computer-controlled random vibration and reverberation acoustic testing; (2) methods of computer-controlled sinewave vibration testing; and (3) methods of computer-controlled shock testing. Basic concepts are stressed rather than specific techniques or equipment. General algorithms are described in the form of block diagrams and flow diagrams. Specific problems and potential problems are discussed. The material is computer sciences oriented but is kept at a level that facilitates an understanding of the basic concepts of computer-controlled induced environmental test systems.

Chapman, P.↗

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.]↗

Atom Probe Tomography Analysis of the Distribution of Rhenium in Nickel Alloys

Atom probe tomography (APT) is used to characterise the distributions of rhenium in a binary Ni-Re alloy and the nickel-based single-crystal CMSX-4 superalloy. A purpose-built algorithm is developed to quantify the size distribution of solute clusters, and applied to the APT datasets to critique the hypothesis that rhenium is prone to the formation of clusters in these systems. No evidence is found to indicate that rhenium forms solute clusters above the level expected from random fluctuations. In CMSX-4, enrichment of Re is detected in the matrix phase close to the matrix/precipitate ({gamma}/{gamma}{prime}) phase boundaries. Phase field modelling indicates that this is due to the migration of the {gamma}/{gamma}{prime} interface during cooling from the temperature of operation. Thus, neither clustering of rhenium nor interface enrichments can be the cause of the enhancement in high temperature mechanical properties conferred by rhenium alloying.

36 MATERIALS SCIENCE↗

Fast optimization algorithms and the cosmological constant

Denef and Douglas have observed that in certain landscape models the problem of finding small values of the cosmological constant is a large instance of a problem that is hard for the complexity class NP (Nondeterministic Polynomial-time). The number of elementary operations (quantum gates) needed to solve this problem by brute force search exceeds the estimated computational capacity of the observable Universe. Here in this paper, we describe a way out of this puzzling circumstance: despite being NP-hard, the problem of finding a small cosmological constant can be attacked by more sophisticated algorithms whose performance vastly exceeds brute force search. In fact, in some parameter regimes the average-case complexity is polynomial. We demonstrate this by explicitly finding a cosmological constant of order 10 -120 in a randomly generated 10 9 -dimensional Arkani-Hamed–Dimopoulos–Kachru landscape.

79 ASTRONOMY AND ASTROPHYSICS↗

Grid-based diffusion Monte Carlo for fermions without the fixed-node approximation

A diffusion Monte Carlo algorithm is introduced that can determine the correct nodal structure of the wave function of a few-fermion system and its ground-state energy without an uncontrolled bias. This is achieved by confining signed random walkers to the points of a uniform infinite spatial grid, allowing them to meet and annihilate one another to establish the nodal structure without the fixed-node approximation. An imaginary-time propagator is derived rigorously from a discretized Hamiltonian, governing a non-Gaussian, sign-flipping, branching, and mutually annihilating random walk of particles. The accuracy of the resulting stochastic representations of a fermion wave function is limited only by the grid and imaginary-time resolutions and can be improved in a controlled manner. Here, the method is tested for a series of model problems including fermions in a harmonic trap as well as the He atom in its singlet or triplet ground state. For the latter case, the energies approach from above with increasing grid resolution and converge within 0.015 E h of the exact basis-set-limit value for the grid spacing of 0.08 a.u. with a statistical uncertainty of 10 –5 E h without an importance sampling or Jastrow factor.

74 ATOMIC AND MOLECULAR PHYSICS↗

Dynamic Virtual Chunks: On Supporting Efficient Accesses to Compressed Scientific Data

Data compression could ameliorate the I/O pressure of data-intensive scientific applications. Unfortunately, the conventional wisdom of naively applying data compression to the file or block brings the dilemma between efficient random accesses and high compression ratios. File-level compression barely supports efficient random accesses to the compressed data: any retrieval request need trigger the decompression from the beginning of the compressed file. Block-level compression provides flexible random accesses to the compressed blocks, but introduces extra overhead when applying the compressor to each and every block that results in a degraded overall compression ratio. This paper extends our prior work that introduces virtual chunks offering efficient random accesses to the compressed scientific data without sacrificing the compression ratio. Virtual chunks are logical blocks pointed at by appended references without breaking the physical continuity of the file content. These references allow the decompression to start from an arbitrary position (efficient random accesses), while no per-block overhead is introduced because the file’s physical entirety is retained (high compression ratio). One limitation of virtual chunk is it only supports static references. This paper presents the algorithms, analysis, and evaluations of dynamic virtual chunks to deal with the cases where the references are updated dynamically.

I/O compression performance optimization↗

SU-E-J-83: Ion Imaging to Better Estimate In-Vivo Relative Stopping Powers Using X-Ray CT Prior-Knowledge Information

Purpose: To reduce uncertainties in relative stopping power (RSP) estimates for ions (alpha and carbon) by using Ion radiographic-imaging and X-ray CT prior-knowledge. Methods: A 36×36 phantom matrix composed of 9 materials with different thicknesses and randomly placed is generated. Theoretical RSPs are calculated using stopping power (SP) data from three references (Janni, ICRU49 and Bischel). We introduced an artificial systematic error (1.5%, 2.5% or 3.5%) and a random error (<0.5%) to the SP to simulated patient ion-range errors present in clinic environment. Carbon/alpha final energy for each RSPs set (theoretical and from CT images) is obtained with a ray-tracing algorithm. A gradient descent (GD) method is used to minimize the difference in exit particle energy, between theory and X-ray CT RSP maps, by iteratively correcting the RSP map from X-ray CT. Once a new set of RSPs is obtained for a direction a new optimization is done over other direction using the RSPs from the previous optimization. Theoretical RSPs are compared with experimental RSPs obtained with Gammex Phantom. Results: Preliminary results show that optimized RSP values can be obtained with smaller uncertainties (<1%) than clinical RSPs (1.5% to 3.5%). Theoretical values from three different references show uncertainties, up to 3% from experimental values. Further investigation will consider prior-knowledge from RSP obtained with CT images and ion radiographies from Monte Carlo Simulations. Conclusion: GD and ray-tracing methods have been implemented to reduce RSP uncertainties from values obtained for clinical treatment. Experimental RSPs will be obtained using carbon/alpha beams to consider the existence of material dependent systematic errors. Based on the results, it is hoped to show that using ray-tracing optimization with ion radiography and prior knowledge on RPSs, treatment planning accuracy and cost-effectiveness can be improved.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

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.↗

WSBP/NWBP small-world neural network and its performance for wind power forecasting

A small-world neural network has stronger generalization ability with high transfer efficiency than that of the regular neural networks. This paper presents two novel small-world neural networks, the Watts-Strogatz small-world based on a BP neural network (WSBP) and a Newman-Watts small-world neural network based on a BP neural network (NWBP), related to previous research of complex networks. The algorithms are developed separately by adopting WS and NW small-world networks as their topological structures, and their derivation and convergence criterion are progressively discussed. After that, the proposed models are subsequently tested by two typical nonlinear functions which confirm their significant improvement over the regular BP networks and other algorithms. Finally, a wind power prediction system is advanced to verify their generalization abilities, and show that the models are practically feasible and effective with improved accuracy and acceptable forecasting errors caused by wind fluctuation and randomness with a time scale up to 24 h.

17 WIND ENERGY↗

Estimating the Adequacy of a Multi-Objective Optimization

Multi-objective optimization methods can be criticized for lacking a statistically valid measure of the quality and representativeness of a solution. This stance is especially relevant to metaheuristic optimization approaches but can also apply to other methods that typically might only report a small representative subset of a Pareto frontier. Here we present a method to address this deficiency based on random sampling of a solution space to determine, with a specified level of confidence, the fraction of the solution space that is surpassed by an optimization. The Superiority of Multi-Objective Optimization to Random Sampling, or SMORS method, can evaluate quality and representativeness using dominance or other measures, e.g., a spacing measure for high-dimensional spaces. SMORS has been tested in a combinatorial optimization context using a genetic algorithm but could be useful for other optimization methods.

42 ENGINEERING↗

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↗