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,693 records · Page 94

Studies in astronomical time series analysis. I - Modeling random processes in the time domain

Several random process models in the time domain are defined and discussed. Attention is given to the moving average model, the autoregressive model, and relationships between and combinations of these models. Consideration is then given to methods for investigating pulse structure, procedures of model construction, computational methods, and numerical experiments. A FORTRAN algorithm of time series analysis has been developed which is relatively stable numerically. Results of test cases are given to study the effect of adding noise and of different distributions for the pulse amplitudes. A preliminary analysis of the light curve of the quasar 3C 272 is considered as an example.

Scargle, J. D.↗

Phase noise in pulsed Doppler lidar and limitations on achievable single-shot velocity accuracy

The smaller sampling volumes afforded by Doppler lidars compared to radars allows for spatial resolutions at and below some sheer and turbulence wind structure scale sizes. This has brought new emphasis on achieving the optimum product of wind velocity and range resolutions. Several recent studies have considered the effects of amplitude noise, reduction algorithms, and possible hardware related signal artifacts on obtainable velocity accuracy. We discuss here the limitation on this accuracy resulting from the incoherent nature and finite temporal extent of backscatter from aerosols. For a lidar return from a hard (or slab) target, the phase of the intermediate frequency (IF) signal is random and the total return energy fluctuates from shot to shot due to speckle; however, the offset from the transmitted frequency is determinable with an accuracy subject only to instrumental effects and the signal to noise ratio (SNR), the noise being determined by the LO power in the shot noise limited regime. This is not the case for a return from a media extending over a range on the order of or greater than the spatial extent of the transmitted pulse, such as from atmospheric aerosols. In this case, the phase of the IF signal will exhibit a temporal random walk like behavior. It will be uncorrelated over times greater than the pulse duration as the transmitted pulse samples non-overlapping volumes of scattering centers. Frequency analysis of the IF signal in a window similar to the transmitted pulse envelope will therefore show shot-to-shot frequency deviations on the order of the inverse pulse duration reflecting the random phase rate variations. Like speckle, these deviations arise from the incoherent nature of the scattering process and diminish if the IF signal is averaged over times greater than a single range resolution cell (here the pulse duration). Apart from limiting the high SNR performance of a Doppler lidar, this shot-to-shot variance in velocity estimates has a practical impact on lidar design parameters. In high SNR operation, for example, a lidar's efficiency in obtaining mean wind measurements is determined by its repetition rate and not pulse energy or average power. In addition, this variance puts a practical limit on the shot-to-shot hard target performance required of a lidar.

Mcnicholl, P.↗

Current Trend Towards Using Soft Computing Approaches to Phase Synchronization in Communication Systems

This paper surveys recent advances in communications that utilize soft computing approaches to phase synchronization. Soft computing, as opposed to hard computing, is a collection of complementary methodologies that act in producing the most desirable control, decision, or estimation strategies. Recently, the communications area has explored the use of the principal constituents of soft computing, namely, fuzzy logic, neural networks, and genetic algorithms, for modeling, control, and most recently for the estimation of phase in phase-coherent communications. If the receiver in a digital communications system is phase-coherent, as is often the case, phase synchronization is required. Synchronization thus requires estimation and/or control at the receiver of an unknown or random phase offset.

Drake, Jeffrey T.↗

NEUTRAL HYDROGEN OPTICAL DEPTH NEAR STAR-FORMING GALAXIES AT z Almost-Equal-To 2.4 IN THE KECK BARYONIC STRUCTURE SURVEY

We study the interface between galaxies and the intergalactic medium by measuring the absorption by neutral hydrogen in the vicinity of star-forming galaxies at z Almost-Equal-To 2.4. Our sample consists of 679 rest-frame UV-selected galaxies with spectroscopic redshifts that have impact parameters <2 (proper) Mpc to the line of sight of one of the 15 bright, background QSOs and that fall within the redshift range of its Ly{alpha} forest. We present the first two-dimensional maps of the absorption around galaxies, plotting the median Ly{alpha} pixel optical depth as a function of transverse and line-of-sight separation from galaxies. The Ly{alpha} optical depths are measured using an automatic algorithm that takes advantage of all available Lyman series lines. The median optical depth, and hence the median density of atomic hydrogen, drops by more than an order of magnitude around 100 kpc, which is similar to the virial radius of the halos thought to host the galaxies. The median remains enhanced, at the >3{sigma} level, out to at least 2.8 Mpc (i.e., >9 comoving Mpc), but the scatter at a given distance is large compared with the median excess optical depth, suggesting that the gas is clumpy. Within 100 (200) kpc, and over {+-}165 km s{sup -1}, the covering fraction of gas with Ly{alpha} optical depth greater than unity is 100{sup +0}{sub -32}% (66% {+-} 16%). Absorbers with {tau}{sub Ly{alpha}} > 0.1 are typically closer to galaxies than random. The mean galaxy overdensity around absorbers increases with the optical depth and also as the length scale over which the galaxy overdensity is evaluated is decreased. Absorbers with {tau}{sub Ly{alpha}} {approx} 1 reside in regions where the galaxy number density is close to the cosmic mean on scales {>=}0.25 Mpc. We clearly detect two types of redshift space anisotropies. On scales <200 km s{sup -1}, or <1 Mpc, the absorption is stronger along the line of sight than in the transverse direction. This 'finger of God' effect may be due to redshift errors, but is probably dominated by gas motions within or very close to the halos. On the other hand, on scales of 1.4-2.0 Mpc the absorption is compressed along the line of sight (with >3{sigma} significance), an effect that we attribute to large-scale infall (i.e., the Kaiser effect).

79 ASTRONOMY AND ASTROPHYSICS↗

An adaptive Hessian approximated stochastic gradient MCMC method

Bayesian approaches have been successfully integrated into training deep neural networks. One popular family is stochastic gradient Markov chain Monte Carlo methods (SG-MCMC), which have gained increasing interest due to their ability to handle large datasets and the potential to avoid overfitting. Although standard SG-MCMC methods have shown great performance in a variety of problems, they may be inefficient when the random variables in the target posterior densities have scale differences or are highly correlated. Here, we present an adaptive Hessian approximated stochastic gradient MCMC method to incorporate local geometric information while sampling from the posterior. The idea is to apply stochastic approximation (SA) to sequentially update a preconditioning matrix at each iteration. The preconditioner possesses second-order information and can guide the random walk of a sampler efficiently. Instead of computing and saving the full Hessian of the log posterior, we use limited memory of the samples and their stochastic gradients to approximate the inverse Hessian-vector multiplication in the updating formula. Moreover, by smoothly optimizing the preconditioning matrix via SA, our proposed algorithm can asymptotically converge to the target distribution with a controllable bias under mild conditions. To reduce the training and testing computational burden, we adopt a magnitude-based weight pruning method to enforce the sparsity of the network. Our method is user-friendly and demonstrates better learning results compared to standard SG-MCMC updating rules. The approximation of inverse Hessian alleviates storage and computational complexities for large dimensional models. Numerical experiments are performed on several problems, including sampling from 2D correlated distribution, synthetic regression problems, and learning the numerical solutions of heterogeneous elliptic PDE. The numerical results demonstrate great improvement in both the convergence rate and accuracy.

97 MATHEMATICS AND COMPUTING↗

Accelerating error correction in tomographic reconstruction

Abstract Spurred by recent advances in detector technology and X-ray optics, upgrades to scanning-probe-based tomographic imaging have led to an exponential growth in the amount and complexity of experimental data and have created a clear opportunity for tomographic imaging to approach single-atom sensitivity. The improved spatial resolution, however, is highly susceptible to systematic and random experimental errors, such as center of rotation drifts, which may lead to imaging artifacts and prevent reliable data extraction. Here, we present a model-based approach that simultaneously optimizes the reconstructed specimen and sinogram alignment as a single optimization problem for tomographic reconstruction with center of rotation error correction. Our algorithm utilizes an adaptive regularizer that is dynamically adjusted at each alternating iteration step. Furthermore, we describe its implementation in a software package targeting high-throughput workflows for execution on distributed-memory clusters. We demonstrate the performance of our solver on large-scale synthetic problems and show that it is robust to a wide range of noise and experimental drifts with near-ideal throughput.

Ali, Sajid (ORCID:0000000321864636)↗

Optimizing Classifiers for Radionuclide Identification

Identifying threat nuclear materials is a critical for the prevention of acts of nuclear terrorism on the homeland. For this purpose, many radionuclide identification devices are deployed in the field. However, these will not necessarily be in the hands of non-experts, therefore these devices need to provide ready-made answers for the personnel in the field. This is where advanced algorithms are employed to both interpret the data and provide the identification of the nuclear material being interrogated. We took a machine learning approach to identification, by using training and validation data sets to create and optimize classifiers which determine which radionuclide is consistent with the data. The classifiers investigated were the Random Forest, Decision Tree, Support Vector Machine, and XG Boost and their performance was judged using the F1 Score for both hyperparameter tuning and comparison. In the end, we found out that the Random Forest Classifier worked the best based off the F1 Score they got which was 0.98.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗

Structural dynamics analysis using an unsymmetric block Lanczos algorithm

A method for reducing the order of a dynamical model of a large structure with arbitrary damping is developed analytically and demonstrated. A Lanczos algorithm is described which can reduce square unsymmetric system matrices to block-tridiagonal form, and a procedure for defining the reduced-order model from the right and left Lanczos vectors is outlined. Results for sample problems involving the 8-DOF FEM model of a beam-rotor assembly subjected to random and stepped external forces are presented in extensive graphs and briefly characterized.

Craig, Roy R., Jr.↗

Global Load Balancing with Parallel Mesh Adaption on Distributed-Memory Systems

Dynamic mesh adaption on unstructured grids is a powerful tool for efficiently computing unsteady problems to resolve solution features of interest. Unfortunately, this causes load imbalance among processors on a parallel machine. This paper describes the parallel implementation of a tetrahedral mesh adaption scheme and a new global load balancing method. A heuristic remapping algorithm is presented that assigns partitions to processors such that the redistribution cost is minimized. Results indicate that the parallel performance of the mesh adaption code depends on the nature of the adaption region and show a 35.5X speedup on 64 processors of an SP2 when 35% of the mesh is randomly adapted. For large-scale scientific computations, our load balancing strategy gives almost a sixfold reduction in solver execution times over non-balanced loads. Furthermore, our heuristic remapper yields processor assignments that are less than 3% off the optimal solutions but requires only 1% of the computational time.

Biswas, Rupak↗

An efficient computational approach to model statistical correlations in photon counting x-ray detectors

Purpose: To introduce and evaluate an increment matrix approach (IMA) describing the signal statistics of energy-selective photon counting detectors including spatial–spectral correlations between energy bins of neighboring detector pixels. The importance of the occurring correlations for image-based material decomposition is studied. Methods: An IMA describing the counter increase patterns in a photon counting detector is proposed. This IMA has the potential to decrease the number of required random numbers compared to Monte Carlo simulations by pursuing an approach based on convolutions. To validate and demonstrate the IMA, an approximate semirealistic detector model is provided, simulating a photon counting detector in a simplified manner, e.g., by neglecting count rate-dependent effects. In this way, the spatial–spectral correlations on the detector level are obtained and fed into the IMA. The importance of these correlations in reconstructed energy bin images and the corresponding detector performance in image-based material decomposition is evaluated using a statistically optimal decomposition algorithm. Results: The results of IMA together with the semirealistic detector model were compared to other models and measurements using the spectral response and the energy bin sensitivity, finding a good agreement. Correlations between the different reconstructed energy bin images could be observed, and turned out to be of weak nature. These correlations were found to be not relevant in image-based material decomposition. An even simpler simulation procedure based on the energy bin sensitivity was tested instead and yielded similar results for the image-based material decomposition task, as long as the fact that one incident photon can increase multiple counters across neighboring detector pixels is taken into account. Conclusions: The IMA is computationally efficient as it required about 10{sup 2} random numbers per ray incident on a detector pixel instead of an estimated 10{sup 8} random numbers per ray as Monte Carlo approaches would need. The spatial–spectral correlations as described by IMA are not important for the studied image-based material decomposition task. Respecting the absolute photon counts and thus the multiple counter increases by a single x-ray photon, the same material decomposition performance could be obtained with a simpler detector description using the energy bin sensitivity.

60 APPLIED LIFE SCIENCES↗

Randomized measurement protocols for lattice gauge theories

Randomized measurement protocols, including classical shadows, entanglement tomography, and randomized benchmarking are powerful techniques to estimate observables, perform state tomography, or extract the entanglement properties of quantum states. While unraveling the intricate structure of quantum states is generally difficult and resource-intensive, quantum systems in nature are often tightly constrained by symmetries. Furthermore, this can be leveraged by the symmetry-conscious randomized measurement schemes we propose, yielding clear advantages over symmetry-blind randomization such as reducing measurement costs, enabling symmetry-based error mitigation in experiments, allowing differentiated measurement of (lattice) gauge theory entanglement structure, and, potentially, the verification of topologically ordered states in existing and near-term experiments. Crucially, unlike symmetry-blind randomized measurement protocols, these latter tasks can be performed without relearning symmetries via full reconstruction of the density matrix.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A Machine Learning-Genetic Algorithm (ML-GA) Approach for Rapid Optimization Using High-Performance Computing

A Machine Learning-Genetic Algorithm (ML-GA) approach was developed to virtually discover optimum designs using training data generated from multi-dimensional simulations. Machine learning (ML) presents a pathway to transform complex physical processes that occur in a combustion engine into compact informational processes. In the present work, a total of over 2000 sector-mesh computational fluid dynamics (CFD) simulations of a heavy-duty engine were performed. These were run concurrently on a supercomputer to reduce overall turnaround time. The engine being optimized was run on a low-octane (RON70) gasoline fuel under partially premixed compression ignition (PPCI) mode. A total of nine input parameters were varied, and the CFD simulation cases were generated by randomly sampling points from this nine-dimensional input space. These input parameters included fuel injection strategy, injector design, and various in-cylinder flow and thermodynamic conditions at intake valve closure (IVC). The outputs (targets) of interest from these simulations included five metrics related to engine performance and emissions. Over 2000 samples generated from CFD were then used to train an ML model that could predict these five targets based on the nine input features. A robust super learner approach was employed to build the ML model, where results from a collection of different ML algorithms were pooled together. Thereafter, a stochastic global optimization genetic algorithm (GA) was used, with the ML model as the objective function, to optimize the input parameters based on a merit function so as to minimize fuel consumption while satisfying CO and NOx emissions constraints. The optimized configuration from ML-GA was found to be very close to that obtained from a sequentially performed CFD-GA approach, where a CFD simulation served as the objective function. In addition, the overall turnaround time was (at least) 75% lower with the ML-GA approach, as the training data was generated from concurrent CFD simulations and employing the ML model as the objective function significantly accelerated the GA optimization. Finally, this study demonstrates the potential of ML-GA and high-performance computing (HPC) to reduce the number of CFD simulations to be performed for optimization problems without loss in accuracy, thereby providing significant cost savings compared to traditional approaches.

97 MATHEMATICS AND COMPUTING↗

Error Characteristics and Scale Dependence of Current Satellite Precipitation Estimates Products in Hydrological Modeling

Satellite precipitation estimates (SPEs) are promising alternatives to gauge observations for hydrological applications (e.g., streamflow simulation), especially in remote areas with sparse observation networks. However, the existing SPEs products are still biased due to imperfections in retrieval algorithms, data sources and post-processing, which makes the effective use of SPEs a challenge, especially at different spatial and temporal scales. In this study, we used a distributed hydrological model to evaluate the simulated discharge from eight quasi-global SPEs at different spatial scales and explored their potential scale effects of SPEs on a cascade of basins ranging from approximately 100 to 130,000 km 2 . The results indicate that, regardless of the difference in the accuracy of various SPEs, there is indeed a scale effect in their application in discharge simulation. Specifically, when the catchment area is larger than 20,000 km2, the overall performance of discharge simulation emerges an ascending trend with the increase of catchment area due to the river routing and spatial averaging. Whereas below 20,000 km 2 , the discharge simulation capability of the SPEs is more randomized and relies heavily on local precipitation accuracy. Our study also highlights the need to evaluate SPEs or other precipitation products (e.g., merge product or reanalysis data) not only at the limited station scale, but also at a finer scale depending on the practical application requirements. Here we have verified that the existing SPEs are scale-dependent in hydrological simulation, and they are not enough to be directly used in very fine scale distributed hydrological simulations (e.g., flash flood). More advanced retrieval algorithms, data sources and bias correction methods are needed to further improve the overall quality of SPEs.

DTVGM↗

Statistical Classification of Biosignature Information using Multiple Instrument Observations

The accurate identification of biosignatures (indications of life) from data taken from remote or in situ planetary exploration is one of the most important challenges in astrobiology, the interdisciplinary field examining habitability and the potential for extraterrestrial life. This study employs machine learning algorithms to optimize the identification of biosignatures, with an emphasis on those which are agnostic to a specific biochemical basis. We exploit the wealth of terrestrial data available from biogenic and abiogenic systems to enhance efficient feature prioritization. Our dataset, pulled from public databases and laboratory recorded measurements, includes elemental abundance, isotopic fractionation, and VNIR/Raman spectra The data curation process included standardization for detection limits and ranges. Subsequent feature extraction yielded detailed inputs for machine learning, including combinations of elemental content, isotopic ratios, and parameters of spectral peaks and troughs. Feature significance was evaluated across diverse machine learning methodologies, such as k-nearest neighbors, logistic regression, Random Forest, support vector machines, and Gaussian Naïve Bayes, along with a combined voting classifier. We utilized Receiver Operating Characteristic Area Under the Curve (ROC AUC) across 2,000 50% test-train splits as a robust metric of model performance. Results revealed a promising ROC AUC of 0.853 for the combined voting classifier. Removing elemental abundance data notably reduced model accuracy (13% decrease in AUC), highlighting its critical role in biosignature detection. Several other individual data features exhibited significance within their respective data types, offering additional granularity. This research fortifies the relevance of machine learning to astrobiology, potentially enhancing life detection missions by allowing algorithmic prioritization of high-interest samples for further investigation. Future work will refine data standardization, expand the dataset to include more terrestrial systems, and incorporate convolutional neural networks for spectral feature extraction. The potential for public data sharing is also under exploration, reinforcing our commitment to collective scientific advancement.

Statistical↗

Estimation of many-body quantum Hamiltonians via compressive sensing

We develop an efficient and robust approach for quantum measurement of nearly sparse many-body quantum Hamiltonians based on the method of compressive sensing. This work demonstrates that with only O(sln(d)) experimental configurations, consisting of random local preparations and measurements, one can estimate the Hamiltonian of a d-dimensional system, provided that the Hamiltonian is nearly s sparse in a known basis. The classical postprocessing is a convex optimization problem on the total Hilbert space which is generally not scalable. We numerically simulate the performance of this algorithm for three- and four-body interactions in spin-coupled quantum dots and atoms in optical lattices. Furthermore, we apply the algorithm to characterize Hamiltonian fine structure and unknown system-bath interactions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

SU-F-J-178: A Computer Simulation Model Observer for Task-Based Image Quality Assessment in Radiation Therapy

Purpose: Traditionally, image quality in radiation therapy is assessed subjectively or by utilizing physically-based metrics. Some model observers exist for task-based medical image quality assessment, but almost exclusively for diagnostic imaging tasks. As opposed to disease diagnosis, the task for image observers in radiation therapy is to utilize the available images to design and deliver a radiation dose which maximizes patient disease control while minimizing normal tissue damage. The purpose of this study was to design and implement a new computer simulation model observer to enable task-based image quality assessment in radiation therapy. Methods: A modular computer simulation framework was developed to resemble the radiotherapy observer by simulating an end-to-end radiation therapy treatment. Given images and the ground-truth organ boundaries from a numerical phantom as inputs, the framework simulates an external beam radiation therapy treatment and quantifies patient treatment outcomes using the previously defined therapeutic operating characteristic (TOC) curve. As a preliminary demonstration, TOC curves were calculated for various CT acquisition and reconstruction parameters, with the goal of assessing and optimizing simulation CT image quality for radiation therapy. Sources of randomness and bias within the system were analyzed. Results: The relationship between CT imaging dose and patient treatment outcome was objectively quantified in terms of a singular value, the area under the TOC (AUTOC) curve. The AUTOC decreases more rapidly for low-dose imaging protocols. AUTOC variation introduced by the dose optimization algorithm was approximately 0.02%, at the 95% confidence interval. Conclusion: A model observer has been developed and implemented to assess image quality based on radiation therapy treatment efficacy. It enables objective determination of appropriate imaging parameter values (e.g. imaging dose). Framework flexibility allows for incorporation of additional modules to include any aspect of the treatment process, and therefore has great potential for both assessment and optimization within radiation therapy.

60 APPLIED LIFE SCIENCES↗

Atmospheric disturbance model for aircraft and space capable vehicles

An atmospheric disturbance model (ADM) is developed that considers the requirements of advanced aerospace vehicles and balances algorithmic assumptions with computational constraints. The requirements for an ADM include a realistic power spectrum, inhomogeneity, and the cross-correlation of atmospheric effects. The baseline models examined include the Global Reference Atmospheric Model Perturbation-Modeling Technique, the Dryden Small-Scale Turbulence Description, and the Patchiness Model. The Program to Enhance Random Turbulence (PERT) is developed based on the previous models but includes a revised formulation of large-scale atmospheric disturbance, an inhomogeneous Dryden filter, turbulence statistics, and the cross-correlation between Dryden Turbulence Filters and small-scale thermodynamics. Verification with the Monte Carlo approach demonstrates that the PERT software provides effective simulations of inhomogeneous atmospheric parameters.

Chimene, Beau C.↗

An analysis of gamma ray burst time histories

Gamma ray burst time histories, ranging in durations from milliseconds to thousands of seconds, are as varied as the number of bursts. They show a wide array of structures from those that are very smooth to those that contain a seemingly uncountable number of spikes riding on top of other spikes. These profiles have tantalized researchers for years - they obviously hold important information on the nature of GRB's, but to date no one has been successful in analyzing them. For the past year the author has been working on algorithms to analyze these data. Two approaches have been followed in this investigation. The first is an attempt to quantify the amount of structure, or spikiness, in a profile. The second involves applying the latest theorems on chaos and fractals with the aim of extracting useful information from what seems to be a random collection of shot noise.

Lestrade, John Patrick↗