Search NASA⌕ Search

SEARCH · Search NASA

Results for “prediction algorithms”

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 847 records · Page 47

Towards a fully automated algorithm driven platform for biosystems design

Large-scale data acquisition and analysis are often required in the successful implementation of the design, build, test, and learn (DBTL) cycle in biosystems design. However, it has long been hindered by experimental cost, variability, biases, and missed insights from traditional analysis methods. Here, we report the application of an integrated robotic system coupled with machine learning algorithms to fully automate the DBTL process for biosystems design. As proof of concept, we have demonstrated its capacity by optimizing the lycopene biosynthetic pathway. This fully-automated robotic platform, BioAutomata, evaluates less than 1% of possible variants while outperforming random screening by 77%. A paired predictive model and Bayesian algorithm select experiments which are performed by Illinois Biological Foundry for Advanced Biomanufacturing (iBioFAB). BioAutomata excels with black-box optimization problems, where experiments are expensive and noisy and the success of the experiment is not dependent on extensive prior knowledge of biological mechanisms.

59 BASIC BIOLOGICAL SCIENCES↗

Demonstration of Algorithmic Quantum Speedup for an Abelian Hidden Subgroup Problem

Simon’s problem is to find a hidden period (a bitstring) encoded into an unknown 2-to-1 function. It is one of the earliest problems for which an exponential quantum speedup was proven for ideal, noiseless quantum computers, albeit in the oracle model. Here, using two different 127-qubit IBM Quantum superconducting processors, we demonstrate an algorithmic quantum speedup for a variant of Simon’s problem where the hidden period has a restricted Hamming weight 𝑤. For sufficiently small values of 𝑤 and for circuits involving up to 58 qubits, we demonstrate an exponential speedup, albeit of a lower quality than the speedup predicted for the noiseless algorithm. The speedup exponent and the range of 𝑤 values for which an exponential speedup exists are significantly enhanced when the computation is protected by dynamical decoupling. Further enhancement is achieved with measurement error mitigation. This case constitutes a demonstration of a bona fide quantum advantage for an Abelian hidden subgroup problem.

computation↗

An economical semi-analytical orbit theory for micro-computer applications

An economical algorithm is presented for predicting the position of a satellite perturbed by drag and zonal harmonics J2 through J4. Simplicity being of the essence, drag is modeled as a secular decay rate in the semimajor axis (retarded motion) with the zonal perturbations modeled from a modified version of Brouwers formulas. The algorithm is developed as an alternative on-board orbit predictor; a back up propagator requiring low energy consumption; or a ground based propagator for microcomputer applications (e.g., at the foot of an antenna). An O(J2) secular retarded state partial matrix (matrizant) is also given to employ with state estimation. The theory has been implemented in BASIC on an inexpensive microcomputer, the program occupying under 8K bytes of memory. Simulated trajectory data and real tracking data are employed to illustrate the theory's ability to accurately accommodate oblateness and drag effects.

Gordon, R. A.↗

Q4FY20 Quarterly Report. LL20-AM-sensor

Tardigrade is an effort to create tunable thermal expansion materials for use in a ruggedized lens housing. This requires new computational algorithms to model and predict thermal performance of meta-materials composed of multiple structured base materials and void-space, along with matching and developing 3D print technology to demonstrate the housing. Project is 13 months into the 30 month on complete project plan. We are continuing effort on 3 main technical thrusts: algorithm development, multi-material additive manufacturing process exploration, and sensor/optics design and engineering. In FY20 we underspent the initial budget, partly due to work restrictions from Covid-19 pandemic, but are working to make up lost time

42 ENGINEERING↗

Tardigrade (NA-22 Quarterly Report)

Tardigrade is an effort to create tunable thermal expansion materials for use in a ruggedized lens housing. This requires new computational algorithms to model and predict thermal performance of meta-materials composed of multiple structured base materials and void-space, along with matching and developing 3D print technology to demonstrate the housing. The project is 24 months into the 36-month plan. We are continuing effort on 3 main technical thrusts: material design algorithm development (transitioning into full 3D design), multi-material additive manufacturing process exploration, and sensor/optics design and engineering. In the last quarter, we have focused on developing the code for 3D Topology Optimization, building data sets for 2D autoencoder training, and finishing lens housing engineering for the microbolometer based test sensor. We are exploring 2 potential multi-material AM technologies, a polymer-based technique in development at LLNL and a metal SLS system produced by Aconity, called the AeroSint deposition head.

36 MATERIALS SCIENCE↗

Tardigrade (Quarterly Report Q1 FY2022)

Tardigrade is an effort to create tunable thermal expansion materials for use in a ruggedized lens housing. This requires new computational algorithms to model and predict thermal performance of meta-materials composed of multiple structured base materials and void-space, along with matching and developing 3D print technology to demonstrate the housing. The project is 27 months into the 36-month plan. We are continuing effort on 3 main technical thrusts: material design algorithm development (transitioning into full 3D design), multi-material additive manufacturing process exploration, and sensor/optics design and engineering. In the last quarter, we have focused on developing the code for 3D Topology Optimization, building data sets for 2D autoencoder training, and finishing lens housing engineering for the microbolometer based test sensor. We are exploring 2 potential multi-material AM technologies, a polymer-based technique in development at LLNL and a metal SLS system produced by Aconity, called the AeroSint deposition head.

36 MATERIALS SCIENCE↗

Analyzing Non Stationary Processes in Radiometers

The lack of well-developed techniques for modeling changing statistical moments in our observations has stymied the application of stochastic process theory for many scientific and engineering applications. Non linear effects of the observation methodology is one of the most perplexing aspects to modeling non stationary processes. This perplexing problem was encountered when modeling the effect of non stationary receiver fluctuations on the performance of radiometer calibration architectures. Existing modeling approaches were found not applicable; particularly problematic is modeling processes across scales over which they begin to exhibit non stationary behavior within the time interval of the calibration algorithm. Alternatively, the radiometer output is modeled as samples from a sequence random variables; the random variables are treated using a conditional probability distribution function conditioned on the use of the variable in the calibration algorithm. This approach of treating a process as a sequence of random variables with non stationary stochastic moments produce sensible predictions of temporal effects of calibration algorithms. To test these model predictions, an experiment using the Millimeter wave Imaging Radiometer (MIR) was conducted. The MIR with its two black body calibration references was configured in a laboratory setting to observe a third ultra-stable reference (CryoTarget). The MIR was programmed to sequentially sample each of the three references in approximately a 1 second cycle. Data were collected over a six-hour interval. The sequence of reference measurements form an ensemble sample set comprised of a series of three reference measurements. Two references are required to estimate the receiver response. A third reference is used to estimate the uncertainty in the estimate. Typically, calibration algorithms are designed to suppress the non stationary effects of receiver fluctuations. By treating the data sequence as an ensemble collection, it is possible to apply temporal algorithms which exacerbate the non stationary effects. By varying the algorithm, information about the properties of the non stationary receiver fluctuations is obtained. Comparisons of analytical calculations and statistical analysis of data demonstrate impressive agreement.

Racette, Paul↗

An economical semi-analytical orbit theory for micro-computer applications

An economical algorithm is presented for predicting the position of a satellite perturbed by drag and zonal harmonics J sub 2 through J sub 4. Simplicity being of the essence, drag is modeled as a secular decay rate in the semi-axis (retarded motion); with the zonal perturbations modeled from a modified version of the Brouwers formulas. The algorithm is developed as: an alternative on-board orbit predictor; a back up propagator requiring low energy consumption; or a ground based propagator for microcomputer applications (e.g., at the foot of an antenna). An O(J sub 2) secular retarded state partial matrix (matrizant) is also given to employ with state estimation. The theory was implemented in BASIC on an inexpensive microcomputer, the program occupying under 8K bytes of memory. Simulated trajectory data and real tracking data are employed to illustrate the theory's ability to accurately accommodate oblateness and drag effects.

Gordon, R. A.↗

SOLAR FLARE PREDICTION USING SDO/HMI VECTOR MAGNETIC FIELD DATA WITH A MACHINE-LEARNING ALGORITHM

We attempt to forecast M- and X-class solar flares using a machine-learning algorithm, called support vector machine (SVM), and four years of data from the Solar Dynamics Observatory's Helioseismic and Magnetic Imager, the first instrument to continuously map the full-disk photospheric vector magnetic field from space. Most flare forecasting efforts described in the literature use either line-of-sight magnetograms or a relatively small number of ground-based vector magnetograms. This is the first time a large data set of vector magnetograms has been used to forecast solar flares. We build a catalog of flaring and non-flaring active regions sampled from a database of 2071 active regions, comprised of 1.5 million active region patches of vector magnetic field data, and characterize each active region by 25 parameters. We then train and test the machine-learning algorithm and we estimate its performances using forecast verification metrics with an emphasis on the true skill statistic (TSS). We obtain relatively high TSS scores and overall predictive abilities. We surmise that this is partly due to fine-tuning the SVM for this purpose and also to an advantageous set of features that can only be calculated from vector magnetic field data. We also apply a feature selection algorithm to determine which of our 25 features are useful for discriminating between flaring and non-flaring active regions and conclude that only a handful are needed for good predictive abilities.

79 ASTRONOMY AND ASTROPHYSICS↗

Rapid sampling of stochastic displacements in Brownian dynamics simulations

Here, we present a new method for sampling stochastic displacements in Brownian Dynamics (BD) simulations of colloidal scale particles. The method relies on a new formulation for Ewald summation of the Rotne-Prager-Yamakawa (RPY) tensor, which guarantees that the real-space and wave-space contributions to the tensor are independently symmetric and positive-definite for all possible particle configurations. Brownian displacements are drawn from a superposition of two independent samples: a wave-space (far-field or long-ranged) contribution, computed using techniques from fluctuating hydrodynamics and non-uniform fast Fourier transforms; and a real-space (near-field or short-ranged) correction, computed using a Krylov subspace method. The combined computational complexity of drawing these two independent samples scales linearly with the number of particles. The proposed method circumvents the super-linear scaling exhibited by all known iterative sampling methods applied directly to the RPY tensor that results from the power law growth of the condition number of tensor with the number of particles. For geometrically dense microstructures (fractal dimension equal three), the performance is independent of volume fraction, while for tenuous microstructures (fractal dimension less than three), such as gels and polymer solutions, the performance improves with decreasing volume fraction. This is in stark contrast with other related linear-scaling methods such as the force coupling method and the fluctuating immersed boundary method, for which performance degrades with decreasing volume fraction. Calculations for hard sphere dispersions and colloidal gels are illustrated and used to explore the role of microstructure on performance of the algorithm. In practice, the logarithmic part of the predicted scaling is not observed and the algorithm scales linearly for up to 4×10 6 particles, obtaining speed ups of over an order of magnitude over existing iterative methods, and making the cost of computing Brownian displacements comparable to the cost of computing deterministic displacements in BD simulations. Finally, a high-performance implementation employing non-uniform fast Fourier transforms implemented on graphics processing units and integrated with the software package HOOMD-blue is used for benchmarking.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Self-tuning Generalized Predictive Control applied to terrain following flight

Generalized Predictive Control (GPC) describes an algorithm for the control of dynamic systems in which a control input is generated which minimizes a quadratic cost function consisting of a weighted sum of errors between desired and predicted future system output and future predicted control increments. The output predictions are obtained from an internal model of the plant dynamics. Self-tuning GPC refers to an implementation of the GPC algorithm in which the parameters of the internal model(s) are estimated on-line and the predictive control law tuned to the parameters so identified. The self-tuning GPC algorithm is applied to a problem of rotorcraft longitudinal/vertical terrain-following flight. The ability of the algorithm to tune to the initial vehicle parameters and to successfully adapt to a stability augmentation failure is demonstrated. Flight path performance is compared to a conventional, classically designed flight path control system.

Hess, R. A.↗

Soil Salinity Level Assessment and Prediction Integrating UAV-borne Hyperspectral Imaging and Machine Learning Algorithms to Combat Desertification

In response to the ongoing global food crisis, the United Nations has identified “Zero Hunger” as one of its Sustainable Development Goals. A central contributor to the crisis is the process in which agricultural lands go through desertification. Research has shown a direct correlation between soil salinity and desertification - increased salinity levels indicate a higher risk for desertification. Furthermore, researchers have explored various techniques to map soil salinity, but these methods are oftentimes inefficient and don’t address future salinity predictions. To improve desertification monitoring, soil salinity can be observed via hyperspectral imaging on unmanned aerial vehicles (UAVs) to predict the risk of agricultural desertification using artificial intelligence (AI) and machine learning (ML) techniques. A significant gap exists in past research that applies ML and imaging techniques to soil salinity: convolutional neural networks (CNNs) and regression models are rarely leveraged together, despite the efficiency and accuracy of these models. To compensate for this gap, the proposed system leverages the use of these AI and ML models to improve soil assessment and prediction techniques. This approach involves three steps - data collection, image analysis, and future prediction. Using hyperspectral cameras on UAVs to collect the data from the region, a trained CNN model will output estimated soil salinity levels at a specific time. The estimations will then be analyzed by a regression model to assess the accuracy of future soil salinity predictions. The proposed system will identify regions at risk of desertification to help farmers mitigate agricultural loss, in turn helping alleviate the food crisis.

UAV systems↗

Protein structure prediction enhanced with evolutionary diversity : SPEED.

For naturally occurring proteins, similar sequence implies similar structure. Consequently, multiple sequence alignments (MSAs) often are used in template-based modeling of protein structure and have been incorporated into fragment-based assembly methods. Our previous homology-free structure prediction study introduced an algorithm that mimics the folding pathway by coupling the formation of secondary and tertiary structure. Moves in the Monte Carlo procedure involve only a change in a single pair of {phi},{psi} backbone dihedral angles that are obtained from a Protein Data Bank-based distribution appropriate for each amino acid, conditional on the type and conformation of the flanking residues. We improve this method by using MSAs to enrich the sampling distribution, but in a manner that does not require structural knowledge of any protein sequence (i.e., not homologous fragment insertion). In combination with other tools, including clustering and refinement, the accuracies of the predicted secondary and tertiary structures are substantially improved and a global and position-resolved measure of confidence is introduced for the accuracy of the predictions. Performance of the method in the Critical Assessment of Structure Prediction (CASP8) is discussed.

59 BASIC BIOLOGICAL SCIENCES↗

Laser powder bed fusion parameter estimation with k-NN

Abstract Laser powder bed fusion (L-PBF) is a technique within additive manufacturing that uses a high power density laser to build parts from fused powdered metal alloy. This technology is well equipped to produce complex parts with otherwise impossible features, such as hidden voids or lattice structures. Alongside capability, reliability and quality are key characteristics considered when choosing a manufacturing method, and these are gaining attention as this method becomes more prevalent in industry. One main indicator of a stable L-PBF process is consistent melt pool geometry, and the properties of which are likely to determine the quality of the part produced. As computing power and sensing technologies become more advanced, this melt pool geometry could be studied in real time. This work addresses the challenge by leveraging a k-nearest neighbor (k-NN) model to identify key features within melt pool imagery and predict the energy density. The k-NN model was trained on data provided by the National Institute of Standards and Technology (NIST). Data preprocessing was performed on the images to extract features that were used in the k-NN model. This approach was used to accurately infer the energy density of unseen layers within the same part. The algorithm was subsequently tested with unique scan strategies and found to reasonably estimate the energy density of different parts. A fivefold cross validation found the algorithm to be consistently predicting the class of 91.4% of the in situ melt pool images.

Jung, Patrick (ORCID:0000000267890859)↗

Application of morphological synthesis for understanding electrode microstructure evolution as a function of applied charge/discharge cycles

Morphological analysis and synthesis operations were employed for analysis of electrode microstructure transformations and evolution accompanying the application of charge/discharge cycles to electrochemical storage systems (batteries). Using state-of-the-art morphological algorithms, it was possible to predict microstructure evolution in porous Si electrodes for Li-ion batteries with sufficient accuracy. Algorithms for image analyses (segmentation, feature extraction, and 3D-reconstructions using 2D-images) were also developed. Altogether, these techniques could be considered supplementary to phase-field mesoscopic approach to microstructure evolution that is based upon clear and definitive changes in the appearance of microstructure. However, unlike in phase-field, the governing equations for morphological approach are geometry-, not physics-based. Similar non-physics based approach to understanding different phenomena was attempted with the introduction of cellular automata. It is anticipated that morphological synthesis and analysis will represent a useful supplementary tool to phase-field and will render assistance to unraveling the underlying microstructure-property relationships. The paper contains data on electrochemical characterization of different electrode materials that was conducted in parallel to morphological study.

25 ENERGY STORAGE↗

An Integrated Centroid Finding and Particle Overlap Decomposition Algorithm for Stereo Imaging Velocimetry

An integrated algorithm for decomposing overlapping particle images (multi-particle objects) along with determining each object s constituent particle centroid(s) has been developed using image analysis techniques. The centroid finding algorithm uses a modified eight-direction search method for finding the perimeter of any enclosed object. The centroid is calculated using the intensity-weighted center of mass of the object. The overlap decomposition algorithm further analyzes the object data and breaks it down into its constituent particle centroid(s). This is accomplished with an artificial neural network, feature based technique and provides an efficient way of decomposing overlapping particles. Combining the centroid finding and overlap decomposition routines into a single algorithm allows us to accurately predict the error associated with finding the centroid(s) of particles in our experiments. This algorithm has been tested using real, simulated, and synthetic data and the results are presented and discussed.

McDowell, Mark↗

Control Effector Unsaturation Modification to the Cascading Generalized Inverse Control Allocation Algorithm

Control allocation has sufficiently progressed such that it is used in front-line fighter aircraft such as the F-18Superhornet and the F-35 Joint Strike Fighter. Published literature shows the F-35 utilizes Nonlinear Dynamic Inversion in conjunction with an Effector Blender that incorporates the Cascading Generalized Inverse control allocation algorithm. While the Cascading Generalized Inverse algorithm is one of the premier generalized inverse methods, it does suffer from three deficiencies. In particular, it suffers from an inability to achieve some desired outcomes, it intermittently provides non-optimal solutions and generally fails to preserve moment direction near maximal achievable moments. An effector unsaturation method based on a Scalar Difference Quadratic was first introduced and implemented on the iterative Prediction Method control allocation algorithm which was shown to consistently achieve optimal (weighted) control allocation solutions throughout the entire Attainable Moment Set while preserving desired moment direction. In this paper, the shortcomings of the Cascading Generalized Inverse algorithm are addressed by augmenting the baseline algorithm with Scalar Difference Quadratic unsaturation identification and location at each iteration. Numerical case studies demonstrate that the Modified Cascading Generalized Inverse algorithm resolves the aforementioned deficiencies.

Michael J Acheson↗

SU-E-T-135: Assessing the Clinical Impact of Approximations in Analytical Dose Calculations for Proton Therapy

Purpose: To estimate the clinical relevance of approximations made in analytical dose calculation methods (ADCs) used for treatment planning on tumor coverage and tumor control probability (TCP) in proton therapy. Methods: We compared dose distributions planned with ADC to delivered dose distributions (as determined by TOPAS Monte Carlo (MC) simulations). We investigated 10 patients per site for 5 treatment sites (head-and-neck, lung, breast, prostate, liver). We evaluated differences between the two dose distributions analyzing dosimetric indices based on the dose-volume-histograms, the γ-index and the TCP. The normal tissue complication probability (NTCP) was estimated for the bladder and anterior rectum for the prostate patients. Results: We find that the target doses are overestimated by the ADC by 1–2% on average for all patients considered. All dosimetric indices (the mean dose, D95, D50 and D02, the dose values covering 95%, 50% and 2% of the target volume, respectively) are predicted within 5% of the delivered dose. A γ-index with a 3%/3mm criteria had a passing rate for target volumes above 96% for all patients. The TCP predicted by the two algorithms was up to 2%, 2.5%, 6%, 6.5%, and 11% for liver and breast, prostate, head-and-neck and lung patients, respectively. Differences in NTCP for anterior-rectum and bladder for prostate patients were less than 3%. Conclusion: We show that ADC provide adequate dose distributions for most patients, however, they can Result in underdosage of the target by as much as 5%. The TCP was found to be up to 11% lower than predicted. Advanced dose-calculation methods like MC simulations may be necessary in proton therapy to ensure target coverage for heterogeneous patient geometries, in clinical trials comparing proton therapy to conventional radiotherapy to avoid biases due to systematic discrepancies in calculated dose distributions, and, if tighter range margins are considered. Fully funded by NIH grants.

60 APPLIED LIFE SCIENCES↗