SEARCH · Engineering Papers

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 991 records · Page 55

All sources NASA NTRS DOE OSTI

NASA NTRS1999

Random Dopant Induced Threshold Voltage Lowering and Fluctuations in Sub 50 nm MOSFETs: a Statistical 3D 'Atomistic' Simulation Study

A 3D 'atomistic' simulation study of random dopant induced threshold voltage fluctuations and lowering in sub 50 nm MOSFETs is presented. The attention is focused mainly on devices with 30 nm effective channel length which represent the expected level of scaling at the end of the Silicon Roadmap. An efficient algorithm, based on a single 3D ap solution of the Poisson equation and a simplified current continuity equation, is used in the simulations. Large samples of microscopically different devices (typically 200) arc used in order to obtain statistically reliable results. The influence of different aspects of the conventional MOSFET design on the threshold voltage fluctuations and lowering are investigated. Results for fluctuation resistant device architectures based on low-doped epitaxial channel MOSFETs are also presented.

Asenov, Asen↗

NASA NTRS2016

Machine-z: Rapid Machine-Learned Redshift Indicator for Swift Gamma-Ray Bursts

Studies of high-redshift gamma-ray bursts (GRBs) provide important information about the early Universe such as the rates of stellar collapsars and mergers, the metallicity content, constraints on the re-ionization period, and probes of the Hubble expansion. Rapid selection of high-z candidates from GRB samples reported in real time by dedicated space missions such as Swift is the key to identifying the most distant bursts before the optical afterglow becomes too dim to warrant a good spectrum. Here, we introduce 'machine-z', a redshift prediction algorithm and a 'high-z' classifier for Swift GRBs based on machine learning. Our method relies exclusively on canonical data commonly available within the first few hours after the GRB trigger. Using a sample of 284 bursts with measured redshifts, we trained a randomized ensemble of decision trees (random forest) to perform both regression and classification. Cross-validated performance studies show that the correlation coefficient between machine-z predictions and the true redshift is nearly 0.6. At the same time, our high-z classifier can achieve 80 per cent recall of true high-redshift bursts, while incurring a false positive rate of 20 per cent. With 40 per cent false positive rate the classifier can achieve approximately 100 per cent recall. The most reliable selection of high-redshift GRBs is obtained by combining predictions from both the high-z classifier and the machine-z regressor.

gamma-ray burst: general↗

NASA NTRS2018

Toward Long-Term Aquatic Science Products from Heritage Landsat Missions

This paper aims at generating a long-term consistent record of Landsat-derived remote sensing reflectance (Rrs) products, which are central for producing downstream aquatic science products (e.g., concentrations of total suspended solids). The products are derived from Landsat-5 and Landsat-7 observations leading to Landsat-8 era to enable retrospective analyses of inland and nearshore coastal waters. In doing so, the data processing was built into the SeaWiFS Data Analysis System (SeaDAS) followed by vicariously calibrating Landsat-7 and -5 data using reference in situ measurements and near-concurrent ocean color products, respectively. The derived Rrs products are then validated using (a) matchups using the Aerosol Robotic Network (AERONET) data measured by in situ radiometers, i.e., AERONET-OC, and (b) ocean color products at select sites in North America. Following the vicarious calibration adjustments, it is found that the overall biases in Rrs products are significantly reduced. The root-mean-square errors (RMSE), however, indicate noticeable uncertainties due to random and systematic noise. Long-term (since 1984) seasonal Rrs composites over 12 coastal and inland systems are further evaluated to explore the utility of Landsat archive processed via SeaDAS. With all the qualitative and quantitative assessments, it is concluded that with careful algorithm developments, it is possible to discern natural variability in historic water quality conditions using heritage Landsat missions. This requires the changes in Rrs exceed maximum expected uncertainties, i.e., 0.0015 [1/sr], estimated from mean RMSEs associated with the matchups and intercomparison analyses. It is also anticipated that Landsat-5 products will be less susceptible to uncertainties in turbid waters with Rrs(660) > 0.004 [1/sr], which is equivalent of ~1.2% reflectance. Overall, end-users may utilize heritage Rrs products with "fitness-for-purpose" concept in mind, i.e., products could be valuable for one application but may not be viable for another. Further research should be dedicated to enhancing atmospheric correction to account for non-negligible near-infrared reflectance in CDOM-rich and extremely turbid waters.

Pahlevan, Nima↗

NASA NTRS1993

Modifications to the three-component classification algorithm for SAR data

Previously, a scattering model was used to classify SAR data as due to three mechanisms: surface or odd-bounce scattering; double-bounce scattering; and volume scattering. A Bragg rough-surface model was used for odd-bounce scattering, and two reflecting surfaces, as in a dihedral corner reflector, represented the double-bounce scattering mechanism. A random collection of infinitely thin cylinders was used to model the volume scattering contribution. It was assumed that the cylinders are uniformly oriented in all directions. In this work, modifications are made to the above model, which include specifying a preferred orientation for the cylinders representing branches and using thin cylinders of finite thickness as opposed to infinitely thin ones. In the first case, the preferred orientation is represented by a probability density function in the form of a dirac delta function. For the second case, small argument asymptotic expansions of Bessel functions are used to express the volume scattering contributions in terms of quantities containing the average radius of the cylinders. Since in each case the number of unknowns exceeds that of equations, simplifying assumptions are made. The solutions are applied to multifrequency polarimetric SAR data to obtain the new unknowns in addition to the relative contributions of each scattering mechanism. Several results are presented. It is found that the calculated percentage of each mechanism does not change significantly compared to the original model; however, additional information is gained about the scatterers.

Moghaddam, M.↗

NASA NTRS2018

Comparison of First-Come First-Served and Optimization Based Scheduling Algorithms for Integrated Departure and Arrival Management

Korea Aerospace Research Institute (KARI) and National Aeronautics and Space Administration (NASA) are investigating scheduling algorithms that will be a part of an integrated arrival and departure management system. Inha University, one of the Korean collaborators of KARI, developed an Extended First-Come First-Served (EFCFS) algorithm that is robust and efficient. However, since the EFCFS algorithm sequentially computes the schedule based on priority, the end results may not be optimal for system efficiency. The approach based on Mixed Integer Linear Programming (MILP) originally developed by NASA and modified by KARI is known to produce better schedules at the expense of computational cost. In this paper, the two different scheduling approaches are compared using common traffic scenarios and constraints at Incheon International Airport. Capabilities to apply weight class based wake turbulence runway separation minima and Miles-in-Trail (MIT) restrictions at selected meter fixes are added to the previously developed EFCFS scheduler. Based on historic data, 40 departures and 20 arrivals are chosen in a one-hour period and 100 scenarios were created by randomly assigning gate numbers, gate departure times, and runway landing times. With the current runway separation requirements, MILP resulted in about ten to twenty percent smaller average delays depending on the constraints. With artificially increased separation minima, the difference between MILP and EFCFS became more noticeable. However, the EFCFS was about ten times faster with smaller variations among different scenarios and constraints. The comparison suggests that the MILP-based algorithm has a small advantage at the current traffic level; however, has potential to be more effective in higher demand or severe weather situations. The EFCFS algorithm may be better suited for real-time applications or investigating larger scale scheduling problems.

air traffic optimization↗

NASA NTRS1999

Computer Modeling of Electrostatic Aggregation of Granular Materials in Planetary and Astrophysical Settings

Electrostatic forces strongly influence the behavior of granular materials in both dispersed (cloud) systems and semi-packed systems. These forces can cause aggregation or dispersion of particles and are important in a variety of astrophysical and planetary settings. There are also many industrial and commercial settings where granular matter and electrostatics become partners for both good and bad. This partnership is important for human exploration on Mars where dust adheres to suits, machines, and habitats. Long-range Coulombic (electrostatic) forces, as opposed to contact-induced dipoles and van der Waals attractions, are generally regarded as resulting from net charge. We have proposed that in addition to net charge interactions, randomly distributed charge carriers on grains will result in a dipole moment regardless of any net charge. If grains are unconfined, or fluidized, they will rotate so that the dipole always induces attraction between grains. Aggregates are readily formed, and Coulombic polarity resulting from the dipole produces end-to-end stacking of grains to form filamentary aggregates. This has been demonstrated in USML experiments on Space Shuttle where microgravity facilitated the unmasking of static forces. It has also been demonstrated in a computer model using grains with charge carriers of both sign. Model results very closely resembled micro-g results with actual sand grains. Further computer modeling of the aggregation process has been conducted to improve our understanding of the aggregation process, and to provide a predictive tool for microgravity experiments slated for Space Station. These experiments will attempt to prove the dipole concept as outlined above. We have considerably enhanced the original computer model: refinements to the algorithm have improved the fidelity of grain behavior during grain contact, special attention has been paid to simulation time steps to enable establishment of a meaningful, quantitative time axis, and calibration of rounding accuracies have been conducted to test cumulative numerical influences in the model. The model has been run for larger grain populations, variable initial cloud densities, and we have introduced random net charging to individual grains, as well as a net charge to the cloud as a whole. The model uses 3 positive and 3 negative charges randomly distributed on each grain, with up to 160 grains contained within various size "boxes" that define the initial number densities in the clouds. Each charge represents localized charged region on a grain, but does not necessarily imply single quantized charge carriers. The Coulomb equations are then allowed to interact for each monopole: dipoles and any higher order charge coupling is a natural product of these "free" interactions over which the modeler exerts no influence. The charges are placed on surfaces of grains at random locations. A series of runs was conducted for neutral grains that had a perfect balance of negative and positive char carriers. Runs were also conducted with grains having additional fractional charges ranging between 0 and 1. By adding fractional charges of one sign, the model created grain populations in which all grains had excess charges the same sign, giving the cloud an overall net charge. This simulates clouds subjected to ionizing radiation (e. protoplanetary debris disk around a protosun), or any other process of charge biasing in a grain population (e.g., volcanic plumes). In another run series, random fractional charges of either sign were added to the grains so th some grains had a slight net positive charge while others had a slight net negative charge. This simulates triboelectrically-charged grain populations in which acquisition of an electron by one surface is at the expense creating a hole elsewhere. This dual sign charging was applied in two ways: in one case the cloud remained neutral by ensuring that all grain excess charges added to zero; in the other case, the cloud was permitted slight net char by not imposing a charge-balance condition. Additional information is contained in the original.

Marshall, J.↗

DOE OSTI2025

Random Walks With Tweedie: A Unified View of Score-Based Diffusion Models [In the Spotlight]

We present a concise derivation for several influential score-based diffusion models that relies on only a few textbook results. Diffusion models have recently emerged as powerful tools for generating realistic, synthetic signals—particularly natural images—and often play a role in state-of-the-art algorithms for inverse problems in image processing. While these algorithms are often surprisingly simple, the theory behind them is not, and multiple complex theoretical justifications exist in the literature. Here, in this study, we provide a simple and largely self-contained theoretical justification for score-based diffusion models that is targeted towards the signal processing community. This approach leads to generic algorithmic templates for training and generating samples with diffusion models. We show that several influential diffusion models correspond to particular choices within these templates and demonstrate that alternative, more straightforward algorithmic choices can provide comparable results. This approach has the added benefit of enabling conditional sampling without any likelihood approximation.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

A Latent-Variable Formulation of the Poisson Canonical Polyadic Tensor Model: Maximum Likelihood Estimation and Fisher Information

We establish parameter inference for the Poisson canonical polyadic (PCP) tensor model through a latent-variable formulation. Our approach exploits the observation that any random PCP tensor can be derived by marginalizing an unobservable random tensor of one dimension larger. The loglikelihood of this larger dimensional tensor, referred to as the “complete” loglikelihood, is comprised of multiple rank one PCP loglikelihoods. Using this methodology, we first derive maximum likelihood estimators for the PCP model and demonstrate that several existing algorithms for fitting non-negative matrix and tensor factorizations are Expectation-Maximization algorithms. Next, we derive the observed and expected Fisher information matrices for the PCP model. The Fisher information provides us crucial insights into the well-posedness of the tensor model, such as the role that tensor rank plays in identifiability and indeterminacy. For the special case of rank one PCP models, we demonstrate that these results are greatly simplified.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Quantifying wildfire drivers and predictability in boreal peatlands using a two-step error-correcting machine learning framework in TeFire v1.0

Abstract. Wildfires are becoming an increasing challenge to the sustainability of boreal peatland (BP) ecosystems and can alter the stability of boreal carbon storage. However, predicting the occurrence of rare and extreme BP fires proves to be challenging, and gaining a quantitative understanding of the factors, both natural and anthropogenic, inducing BP fires remains elusive. Here, we quantified the predictability of BP fires and their primary controlling factors from 1997 to 2015 using a two-step correcting machine learning (ML) framework that combines multiple ML classifiers, regression models, and an error-correcting technique. We found that (1) the adopted oversampling algorithm effectively addressed the unbalanced data and improved the recall rate by 26.88 %–48.62 % when using multiple datasets, and the error-correcting technique tackled the overestimation of fire sizes during fire seasons; (2) nonparametric models outperformed parametric models in predicting fire occurrences, and the random forest machine learning model performed the best, with the area under the receiver operating characteristic curve ranging from 0.83 to 0.93 across multiple fire datasets; and (3) four sets of factor-control simulations consistently indicated the dominant role of temperature, air dryness, and climate extreme (i.e., frost) for boreal peatland fires, overriding the effects of precipitation, wind speed, and human activities. Our findings demonstrate the efficiency and accuracy of ML techniques in predicting rare and extreme fire events and disentangle the primary factors determining BP fires, which are critical for predicting future fire risks under climate change.

54 ENVIRONMENTAL SCIENCES↗

NASA NTRS1998

Studies of Solar Flare and Interplanetary Particle Acceleration and Coordination of Ground-Based Solar Observations in Support of US and International Space Missions

A primary focus has been to conduct studies of particular types of hard X-ray evolution in solar flares and their associations with high energy interplanetary protons observed near Earth. Previously, two large investigations were conducted that revealed strong associations between episodes of progressive spectral hardening seen in solar events and interplanetary proton events (Kiplinger, 1995). An algorithm was developed for predicting interplanetary protons that is more accurate than those currently in use when hard X-ray spectra are available. The basic research on a third study of the remaining independent subset of Hard X-ray Burst Spectrometer (HXRBS) events randomly not selected by the original studies was completed. This third study involves independent analyses of the data by two analysts. The results echo the success of the earlier studies. Of 405 flares analyzed, 12 events were predicted to have associated interplanetary protons at the Space Environment Service Center (SESC) level. Of these, five events appear to be directly associated with SESC proton events, six other events had lower level associated proton events, and there was only one false alarm with no protons. Another study by Garcia and Kiplinger (1995) established that progressively hardening hard X-ray flares associated with interplanetary proton events are intrinsically cooler and not extremely intense in soft X-rays unless a "contaminating" large impulsive flare accompanies the hardening flare.

Kiplinger, Alan L.↗

NASA NTRSDate not supplied

Using Machine Learning to Infer Material Properties of Debris Fragments from X-ray Images in the DebriSat Project

The DebriSat project is a collaboration effort with the NASA Orbital Debris Program Office, the U.S. Space Force Space Systems Command Center, The Aerospace Corporation, and the University of Florida. To date, over 200,000 fragments from this ground-based, hypervelocity impact experiment have been collected, and processing is underway to determine their physical characteristics, such as material, shape, color, characteristic length, and average cross-sectional area. The x-ray process is primarily used to identify the location of the fragments and estimated size for extraction, so that these physical characteristics can be assessed. This paper proposes a machine learning-based approach to characterize materials from x-ray images of debris fragments embedded in soft-catch foam used in the DebriSat project. The novel methodology discussed in this paper will highlight the use of x-ray imagery data to characterize these fragments without extraction or a human-in-the-loop. Both supervised and unsupervised machine learning techniques are utilized with this approach to infer the physical parameters of the fragments embedded in the soft-catch foam panels used in the impact experiment based on x-ray images of the foam panels. Additionally, 3D reconstructions of the extracted fragments are created with images taken from two different angles using the structure from motion (SfM) method. The characteristic lengths and shape from the 3D reconstruction, alongside the physical characteristics of the debris, are used in the inference of the material type. To develop and test the approach, a dataset of x-ray images of debris fragments of varying sizes and materials is collected. Supervised learning methods such as convolutional neural networks (CNNs), support vector machines (SVM), decision trees, and random forest classifiers are used due to the high-dimensional feature spaces of the debris and nonlinear decision boundaries for material categorization. Given the limited pre-labeled data of embedded debris materials smaller than 10 mm, unsupervised machine learning techniques such as clustering algorithms and autoencoders are used, in addition to supervised learning methods. The clustering algorithms group similar fragments together based on their physical properties, and autoencoders reduce the dimensionality of the x ray images and extract relevant features. The performance of the proposed approach's is analyzed using a range of statistical methods, including confusion matrices, receiver operating characteristic curves, and precision-recall curves. The results are compared with those obtained using a baseline approach that relies on manual identification and classification of debris fragments. To evaluate the effectiveness of different machine learning methods, statistical tests such as t-tests, ANOVA, and cross-validation are performed, comparing the performance of CNNs, SVMs, clustering algorithms, and autoencoders. Additional analysis needs to be conducted to identify any sources of bias or variability that may affect the results, such as variations in imaging conditions or fragmentation patterns. Other topics explored are limitations, refinements, and the potential use of semi-supervised learning techniques, such as self-training to label unlabeled datasets and co-training using x-ray images taken from two different angles as two different models.

Saik Anam Siam↗

NASA NTRS2023

Using Machine Learning to Infer Material Properties of Debris Fragments from X-ray Images in the DebriSat Project

Saik Anam Siam↗

NASA NTRS2006

Active Learning with Irrelevant Examples

Active learning algorithms attempt to accelerate the learning process by requesting labels for the most informative items first. In real-world problems, however, there may exist unlabeled items that are irrelevant to the user's classification goals. Queries about these points slow down learning because they provide no information about the problem of interest. We have observed that when irrelevant items are present, active learning can perform worse than random selection, requiring more time (queries) to achieve the same level of accuracy. Therefore, we propose a novel approach, Relevance Bias, in which the active learner combines its default selection heuristic with the output of a simultaneously trained relevance classifier to favor items that are likely to be both informative and relevant. In our experiments on a real-world problem and two benchmark datasets, the Relevance Bias approach significantly improved the learning rate of three different active learning approaches.

machine learning↗

DOE OSTI2023

Using machine learning to predict the correlation of spectra using SDSS magnitudes as an improvement to the Locus Algorithm

The Locus Algorithm is a new technique to improve the quality of differential photometry by optimising the choices of reference stars. At the heart of this algorithm is a routine to assess how good each potential reference star is by comparing its SDSS magnitude values to those of the target star. In this way, the difference in wavelength-dependent effects of the Earth’s atmospheric scattering between target and reference can be minimised. This paper sets out a new way to estimate the quality of each reference star using machine learning. A random subset of stars from SDSS with spectra was chosen. For each one, a suitable reference star, also with a spectrum, was chosen. The correlation between the two spectra in the SDSS r band (between 550 nm and 700 nm) was taken to be the gold-standard measure of how well they match up for differential photometry. The five SDSS magnitude values for each of these stars were used as predictors. A number of supervised machine learning models were constructed on a training set of the stars and were each evaluated on a testing set. The model using Support Vector Regression had the best performance of these models. It was then tested on a final, hold-out, validation set of stars to get an unbiased measure of its performance. With an R 2 of 0.62, the SVR model presents enhanced performance for the Locus Algorithm technique.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2024

Polynomial chaos expansions on principal geodesic Grassmannian submanifolds for surrogate modeling and uncertainty quantification

In this work we introduce a manifold learning-based surrogate modeling framework for uncertainty quantification in high-dimensional stochastic systems. Our first goal is to perform data mining on the available simulation data to identify a set of low-dimensional (latent) descriptors that efficiently parameterize the response of the high-dimensional computational model. To this end, we employ Principal Geodesic Analysis on the Grassmann manifold of the response to identify a set of disjoint principal geodesic submanifolds, of possibly different dimension, that captures the variation in the data. Since operations on the Grassmann require the data to be concentrated, we propose an adaptive algorithm based on Riemannian K-means and the minimization of the sample Fréchet variance on the Grassmann manifold to identify “local” principal geodesic submanifolds that represent different system behavior across the parameter space. Polynomial chaos expansion is then used to construct a mapping between the random input parameters and the projection of the response on these local principal geodesic submanifolds. Here, the method is demonstrated on four test cases, a toy-example that involves points on a hypersphere, a Lotka-Volterra dynamical system, a continuous-flow stirred-tank chemical reactor system, and a two-dimensional Rayleigh-Bénard convection problem.

42 ENGINEERING↗

DOE OSTI2021

Power Grid Reliability Estimation via Adaptive Importance Sampling

Electricity production currently generates approximately 25% of greenhouse gas emissions in the USA. Thus, increasing the amount of renewable energy is a key step to carbon neutrality. However, integrating a large amount of fluctuating renewable generation is a significant challenge for power grid operating and planning. Grid reliability, i.e., an ability to meet operational constraints under power fluctuations, is probably the most important of them. In this letter, we propose computationally efficient and accurate methods to estimate the probability of line overflow, i.e., reliability constraints violation, under a known distribution of renewable energy generation. To this end, we investigate an importance sampling approach, a flexible extension of Monte-Carlo methods, which adaptively changes the sampling distribution to generate more samples near the reliability boundary. The approach allows to estimate overload probability in real-time based only on a few dozens of random samples, compared to thousands required by the plain Monte-Carlo. Our study focuses on high voltage direct current power transmission grids with linear reliability constraints on power injections and line currents. Herein, we propose a novel theoretically justified physics-informed adaptive importance sampling algorithm and compare its performance to state-of-the-art methods on multiple IEEE power grid test cases.

power system faults↗

DOE OSTI2022

Enhancing scalability of a matrix-free eigensolver for studying many-body localization

We propose several techniques to enhance the parallel scalability of a matrix-free eigensolver designed for studying many-body localization (MBL) of quantum spin chain models with nearest-neighbor interactions and on-site disorder. This type of problem is computationally challenging because the dimension of the associated Hamiltonian matrix grows exponentially with respect to the number of spins L, and we need to average over different realizations of the random disorder to obtain relevant statistical behavior. For each disorder realization, we need to compute eigenvalues from different regions of the spectrum and their corresponding eigenvectors. In previous work, the interior eigenstates for a single eigenvalue problem are computed via the shift-and-invert Lanczos algorithm. Due to the extremely high memory footprint of the LU factorizations, this technique is not well suited for large L’s. For example, we need thousands of compute nodes on modern high performance computing infrastructures to go beyond L = 24. The matrix-free approach does not suffer from this memory bottleneck, however, its scalability is limited by a computation and communication load imbalance. To reduce this imbalance and to significantly enhance the scalability of the matrix-free eigensolver, we reorder the matrix and leverage the consistent space runtime, CSPACER. We also show its efficiency in managing irregular communication patterns at scale compared to optimized MPI non-blocking two-sided and one-sided RMA implementation variants. This effort enables us to study MBL for spin chains with a larger number of spins. The efficiency and effectiveness of the proposed algorithm is demonstrated by computing eigenstates on a massively parallel many-core high performance computer.

METIS↗

NASA NTRS1977

A procedure used for a ground truth study of a land use map of North Alabama generated from LANDSAT data

A land use map of a five county area in North Alabama was generated from LANDSAT data using a supervised classification algorithm. There was good overall agreement between the land use designated and known conditions, but there were also obvious discrepancies. In ground checking the map, two types of errors were encountered - shift and misclassification - and a method was developed to eliminate or greatly reduce the errors. Randomly selected study areas containing 2,525 pixels were analyzed. Overall, 76.3 percent of the pixels were correctly classified. A contingency coefficient of correlation was calculated to be 0.7 which is significant at the alpha = 0.01 level. The land use maps generated by computers from LANDSAT data are useful for overall land use by regional agencies. However, care must be used when making detailed analysis of small areas. The procedure used for conducting the ground truth study together with data from representative study areas is presented.

Downs, S. W., Jr.↗