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 37 records · Page 2

A New Evaluation Metric for Demand Response-Driven Real-Time Price Prediction Towards Sustainable Manufacturing

Abstract The increasing industry energy demand highlights the urgency of demand response management, while the emerging smart manufacturing technologies pave the way for the implementation of real-time price (RTP)-based demand response management towards sustainable manufacturing. The demand response management requires scheduling of manufacturing systems based on RTP predictions, and thus the prediction quality can directly alter the effectiveness of demand response. However, since the general price prediction algorithms and prediction evaluation metrics are not specifically designed for RTP in demand response problems, a good RTP prediction obtained and evaluated by these algorithms and metrics may not be suitable for demand response scheduling. Therefore, in this study, the relationships between the effectiveness of demand response for manufacturing systems and evaluation results from six commonly used metrics are investigated. Meanwhile, a new metric called k-peak distance (KPD), considering the characteristics of the demand response problem, is proposed and compared with the other six metrics. Furthermore, an encoder-decoder long short-term memory recurrent neural network with KPD is proposed to provide better RTP prediction for manufacturing demand response problems. The case studies indicate that the proposed KPD metric shows a 1.8–3.6 times higher correlation with the demand response effectiveness compared to the other metrics. In addition, the production schedule based on the RTP prediction obtained from the proposed algorithm can improve the effectiveness of demand response by 23.4% on average.

Engineering↗

SU-F-T-262: Commissioning Varian Portal Dosimetry for EPID-Based Patient Specific QA in a Non-Aria Environment

Purpose: Development of an in-house program facilitates a workflow that allows Electronic Portal Imaging Device (EPID) patient specific quality assurance (QA) measurements to be acquired and analyzed in the Portal Dosimetry Application (Varian Medical Systems, Palo Alto, CA) using a non-Aria Record and Verify (R&V) system (MOSAIQ, Elekta, Crawley, UK) to deliver beams in standard clinical treatment mode. Methods: Initial calibration of an in-house software tool includes characterization of EPID dosimetry parameters by importing DICOM images of varying delivered MUs to determine linear mapping factors in order to convert image pixel values to Varian-defined Calibrated Units (CU). Using this information, the Portal Dose Image Prediction (PDIP) algorithm was commissioned by converting images of various field sizes to output factors using the Eclipse Scripting Application Programming Interface (ESAPI) and converting a delivered configuration fluence to absolute dose units. To verify the algorithm configuration, an integrated image was acquired, exported directly from the R&V client, automatically converted to a compatible, calibrated dosimetric image, and compared to a PDIP calculated image using Varian’s Portal Dosimetry Application. Results: For two C-Series and one TrueBeam Varian linear accelerators, gamma comparisons (global 3% / 3mm) of PDIP algorithm predicted dosimetric images and images converted via the inhouse system demonstrated agreement for ≥99% of all pixels, exceeding vendor-recommended commissioning guidelines. Conclusion: Combinations of a programmatic image conversion tool and ESAPI allow for an efficient and accurate method of patient IMRT QA incorporating a 3rd party R&V system.

60 APPLIED LIFE SCIENCES↗

Mechanism of TRIM25 mediated ubiquitination of metastasis associated protein (MTA) 1 in normal liver cells

Ninety percent of all cancer related deaths happen due to metastatic progression. One important protein facilitating metastatic progression in hepatocellular carcinoma (HCC) is the metastasis associated 1 protein (MTA-1). We have earlier shown that in the context of HCC and normal liver cell lines, HuH6 and THLE-2, respectively. MTA-1 protein is actively stabilized in HCC cell lines and actively degraded in normal liver cells. We had also shown that TRIM25 is the E3 ligase that interacts with and degrades MTA-1 protein in normal liver cells. However, the exact mechanism by which TRIM25 degrades MTA-1 protein has still not been elucidated. In the study, we used both in situ prediction algorithms and mass spectrometry based post-translational modification analysis to map the lysine residues in MTA-1 that are polyubiquitinated. Whereas UbPred algorithm revealed a combination of medium and low confidence sites, it revealed only one high confidence lysine (K98) residue. The hCKSAAP{sub U}bSite algorithm also predicted K98 site. Mass spectrometry analysis also showed that K98 has ubiquitin modification. Immunofluorescence analysis showed that in normal liver cell line, THLE-2, which has high expression of TRIM25, ectopically expressed FLAG-tagged wild-type MTA-1 was actively degraded, but the K98R mutant MTA-1 was not. In vitro ubiquitination assay using recombinant wild-type and K98R mutant MTA-1 confirmed that MTA-1 is poly-ubiquitinated at K98 residue by TRIM25. The K98R mutant had a longer half-life than wild-type MTA-1 protein in an in vitro protein stability assay. We establish that TRIM25 ubiquitinates MTA-1 at lysine 98 and degrades it normal liver cells.

60 APPLIED LIFE SCIENCES↗

biodataganache/SIEVE-Ub

Code and data for the SIEVE-Ub prediction algorithm for prediction of E3 ubiquitin ligase mimics The SIEVEUb approach is a novel approach to determination of sequence similarity that retains flexibility in sequence via a reduced amino acid alphabet and does not require sequence alignment, a prohibitive step for many applications.

McDermott, Jason↗

An Advanced Machine Learning and Artificial Intelligence System for Demonstrating Radiation Regulatory Compliance in DOE Accelerator Facilities

In this Phase II proposal, Applied Research LLC (ARLLC), Thomas Jefferson National Accelerator Facility (Jefferson Lab), and Old Dominion University (ODU) propose the combination of domain knowledge (beam characteristics, fixed structural shielding, earthen burden (the soil and foliage added to the dome of the experimental halls as additional shielding), etc.), machine learning (ML) and/or artificial intelligence (AI) to correlate a variety of multi-modal onsite signals and the radiation fields seen in accessible areas of the accelerator site and the site boundary. The ML/AI will consider the complex influence of environmental parameters affecting the radon contribution of the measurements, focusing on actual data obtained from Jefferson Lab. In Phase I, the coded beam and location data were fed into a deep learning model to predict doses at several designated locations in Jefferson Lab’s facility. Moreover, a dense radiation map was generated using only a sparse collection of the samples in a facility. In Phase II, we will develop a software prototype containing a radiation prediction algorithm, dense radiation map algorithms, and background noise prediction algorithms, with actual data used to evaluate the prototype. This work will provide a framework for evaluation of radiation measurement results around the site based on learned responses. In addition, the proposed approach allows more granular mapping of radiation levels. Better understanding and communication of these levels is related to the overall approach in keeping doses to personnel ALARA.

43 PARTICLE ACCELERATORS↗

A unified algorithm for predicting partition coefficients for PBPK modeling of drugs and environmental chemicals

The algorithms in the literature focusing to predict tissue:blood PC (P{sub tb}) for environmental chemicals and tissue:plasma PC based on total (K{sub p}) or unbound concentration (K{sub pu}) for drugs differ in their consideration of binding to hemoglobin, plasma proteins and charged phospholipids. The objective of the present study was to develop a unified algorithm such that P{sub tb}, K{sub p} and K{sub pu} for both drugs and environmental chemicals could be predicted. The development of the unified algorithm was accomplished by integrating all mechanistic algorithms previously published to compute the PCs. Furthermore, the algorithm was structured in such a way as to facilitate predictions of the distribution of organic compounds at the macro (i.e. whole tissue) and micro (i.e. cells and fluids) levels. The resulting unified algorithm was applied to compute the rat P{sub tb}, K{sub p} or K{sub pu} of muscle (n = 174), liver (n = 139) and adipose tissue (n = 141) for acidic, neutral, zwitterionic and basic drugs as well as ketones, acetate esters, alcohols, aliphatic hydrocarbons, aromatic hydrocarbons and ethers. The unified algorithm reproduced adequately the values predicted previously by the published algorithms for a total of 142 drugs and chemicals. The sensitivity analysis demonstrated the relative importance of the various compound properties reflective of specific mechanistic determinants relevant to prediction of PC values of drugs and environmental chemicals. Overall, the present unified algorithm uniquely facilitates the computation of macro and micro level PCs for developing organ and cellular-level PBPK models for both chemicals and drugs.

60 APPLIED LIFE SCIENCES↗

Traffic Prediction for Merging Coordination Control in Mixed Traffic Scenarios

Connected and autonomous vehicles (CAVs) have the potential to bring in safety, mobility, and energy benefits to transportation. The control decisions of CAVs are usually determined for a look-ahead horizon based on previewed traffic information. This requires an effective prediction of future traffic conditions and its integration with the CAV control framework. However, the short-term traffic prediction using information from connectivity is a challenging research topic, especially for mixed traffic scenarios. This work focuses on the development of a traffic prediction framework for a merging coordination controller. The previously developed merging controller coordinates the merging sequence and travel speed of CAVs to maximize the energy efficiency and overall mobility. In mixed traffic scenarios, the controller receives information regarding the position of all the vehicles traveling inside a control zone and controls the desired speed of all CAVs. The controller has no control on the human-driven vehicles. The merging controller does not have direct information or an explicit prediction on the behaviors of human-driven vehicles. Aiming to improve the performance of the merging controller in various mixed traffic conditions, a traffic prediction algorithm is developed and evaluated in this work. The performance of this traffic prediction algorithm is investigated for various penetration rates of connectivity for a single-lane secondary road merging to a single-lane primary road. The results show that compared to a constant speed assumption of human-driven vehicles, the proposed traffic prediction algorithm is able to reduce the prediction error of the arrival time of human-driven vehicles at the merging zone by more than 50%.

Shao, Yunli↗

Fast Demand Forecast of Electric Vehicle Charging Stations for Cell Phone Application

This paper describes the core cellphone application algorithm which has been implemented for the prediction of energy consumption at Electric Vehicle (EV) Charging Stations at UCLA. For this interactive user application, the total time of accessing database, processing the data and making the prediction, needs to be within a few seconds. We analyze four relatively fast Machine Learning based time series prediction algorithms for our prediction engine: Historical Average, kNearest Neighbor, Weighted k-Nearest Neighbor, and Lazy Learning. The Nearest Neighbor algorithm (k Nearest Neighbor with k=1) shows better performance and is selected to be the prediction algorithm implemented for the cellphone application. Two applications have been designed on top of the prediction algorithm: one predicts the expected available energy at the station and the other one predicts the expected charging finishing time. The total time, including accessing the database, data processing, and prediction is about one second for both applications.

Majidpour, Mostafa↗

Adaptive Online Model Update Algorithm for Predictive Control in Networked Systems

In this article, we introduce an adaptive on-line model update algorithm designed for predictive control applications in networked systems, particularly focusing on power distribution systems. Unlike traditional methods that depend on historical data for offline model identification, our approach utilizes real-time data for continuous model updates. This method integrates seamlessly with existing online control and optimization algorithms and provides timely updates in response to real-time changes. This methodology offers significant advantages, including a reduction in the communication network bandwidth requirements by minimizing the data exchanged at each iteration and enabling the model to adapt after disturbances. Furthermore, our algorithm is tailored for non-linear convex models, enhancing its applicability to practical scenarios. The efficacy of the proposed method is validated through a numerical study, demonstrating improved control performance using a synthetic IEEE test case.

data-driven model predictive control↗

A Hybrid Bulk Algorithm to Predict Turbulent Fluxes over Dry and Wet Bare Soils

Measurements made in the Columbia River basin (Oregon) in an area of irregular terrain during the second Wind Forecast Improvement Project (WFIP2) field campaign are used to develop an optimized hybrid bulk algorithm to predict the surface turbulent fluxes from readily measured or modeled quantities over dry and wet bare or lightly vegetated soil surfaces. The hybrid (synthetic) algorithm combines (i) an aerodynamic method for turbulent flow, which is based on the transfer coefficients (drag coefficient and Stanton number), roughness lengths, and Monin–Obukhov similarity; and (ii) a modified Priestley–Taylor (P-T) algorithm with physically based ecophysiological constraints, which is essentially based on the surface energy budget (SEB) equation. Soil heat flux in the latter case was estimated from measurements of soil temperature and soil moisture. In the framework of the hybrid algorithm, bulk estimates of the momentum flux and the sensible heat flux are derived from a traditional aerodynamic approach, whereas the latent heat flux (or moisture flux) is evaluated from a modified P-T model. Direct measurements of the surface fluxes (turbulent and radiative) and other ancillary atmospheric/soil parameters made during WFIP2 for different soil conditions (dry and wet) are used to optimize and tune the hybrid bulk algorithm. The bulk flux estimates are validated against the measured eddy-covariance fluxes. We also discuss the SEB closure over dry and wet surfaces at various time scales based on the modeled and measured fluxes. Although this bulk flux algorithm is optimized for the data collected during the WFIP2, a hybrid approach can be used for similar flux-tower sites and field campaigns.

54 ENVIRONMENTAL SCIENCES↗

Improved machine learning algorithm for predicting ground state properties

Finding the ground state of a quantum many-body system is a fundamental problem in quantum physics. In this work, we give a classical machine learning (ML) algorithm for predicting ground state properties with an inductive bias encoding geometric locality. The proposed ML model can efficiently predict ground state properties of an n-qubit gapped local Hamiltonian after learning from only $\mathcal{O}$(log(n)) data about other Hamiltonians in the same quantum phase of matter. This improves substantially upon previous results that require $\mathcal{O}$(n c ) data for a large constant c. Furthermore, the training and prediction time of the proposed ML model scale as $\mathcal{O}$(n log n) in the number of qubits n. Numerical experiments on physical systems with up to 45 qubits confirm the favorable scaling in predicting ground state properties using a small training dataset.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Benchmarking Parametric and Machine Learning Models for Genomic Prediction of Complex Traits

The usefulness of genomic prediction in crop and livestock breeding programs has prompted efforts to develop new and improved genomic prediction algorithms, such as artificial neural networks and gradient tree boosting. However, the performance of these algorithms has not been compared in a systematic manner using a wide range of datasets and models. Using data of 18 traits across six plant species with different marker densities and training population sizes, we compared the performance of six linear and six non-linear algorithms. First, we found that hyperparameter selection was necessary for all non-linear algorithms and that feature selection prior to model training was critical for artificial neural networks when the markers greatly outnumbered the number of training lines. Across all species and trait combinations, no one algorithm performed best, however predictions based on a combination of results from multiple algorithms (i.e., ensemble predictions) performed consistently well. While linear and non-linear algorithms performed best for a similar number of traits, the performance of non-linear algorithms vary more between traits. Although artificial neural networks did not perform best for any trait, we identified strategies (i.e., feature selection, seeded starting weights) that boosted their performance to near the level of other algorithms. Our results highlight the importance of algorithm selection for the prediction of trait values.

59 BASIC BIOLOGICAL SCIENCES↗

Benchmarking parametric and machine learning models for genomic prediction of complex traits

The usefulness of genomic prediction in crop and livestock breeding programs has prompted efforts to develop new and improved genomic prediction algorithms, such as artificial neural networks and gradient tree boosting. However, the performance of these algorithms has not been compared in a systematic manner using a wide range of datasets and models. Using data of 18 traits across six plant species with different marker densities and training population sizes, we compared the performance of six linear and six non-linear algorithms. First, we found that hyperparameter selection was necessary for all non-linear algorithms and that feature selection prior to model training was critical for artificial neural networks when the markers greatly outnumbered the number of training lines. Across all species and trait combinations, no one algorithm performed best, however predictions based on a combination of results from multiple algorithms (i.e. ensemble predictions) performed consistently well. While linear and non-linear algorithms performed best for a similar number of traits, the performance of non-linear algorithms vary more between traits. Although artificial neural networks did not perform best for any trait, we identified strategies (i.e. feature selection, seeded starting weights) that boosted their performance to near the level of other algorithms. Our results highlight the importance of algorithm selection for the prediction of trait values.

59 BASIC BIOLOGICAL SCIENCES↗

sNebula, a network-based algorithm to predict binding between human leukocyte antigens and peptides

Understanding the binding between human leukocyte antigens (HLAs) and peptides is important to understand the functioning of the immune system. Since it is time-consuming and costly to measure the binding between large numbers of HLAs and peptides, computational methods including machine learning models and network approaches have been developed to predict HLA-peptide binding. However, there are several limitations for the existing methods. We developed a network-based algorithm called sNebula to address these limitations. We curated qualitative Class I HLA-peptide binding data and demonstrated the prediction performance of sNebula on this dataset using leave-one-out cross-validation and five-fold cross-validations. Furthermore, this algorithm can predict not only peptides of different lengths and different types of HLAs, but also the peptides or HLAs that have no existing binding data. We believe sNebula is an effective method to predict HLA-peptide binding and thus improve our understanding of the immune system.

60 APPLIED LIFE SCIENCES↗

Applying fast calorimetry on a spent nuclear fuel calorimeter

Recently at Los Alamos National Laboratory, sophisticated prediction algorithms have been considered for the use of calorimetry for treaty verification. These algorithms aim to predict the equilibrium temperature based on early data and therefore be able to shorten the measurement time while maintaining good accuracy. The algorithms have been implemented in MATLAB and applied on existing equilibrium measurements from a spent nuclear fuel calorimeter located at the Swedish nuclear fuel interim storage facility. The results show significant improvements in measurement time in the order of 15 to 50 compared to equilibrium measurements, but cannot predict the heat accurately in less time than the currently used temperature increase method can. This Is both due to uncertainties in the calibration of the method as well as identified design features of the calorimeter that limits the usefulness of equilibrium type measurements. The conclusions of these findings are discussed, and suggestions of both improvements of the current calorimeter as well as what to keep in mind in a new design are given.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

A New Proposal Generalized Predictive Control Algorithm With Polynomial Reference Tracking Applied for Sodium Fast Reactors

This paper proposes a generalized predictive control (GPC) with constraints and orthonormal Laguerre functions using the simplified model of the primary system (reactor core and intermediate heat exchanger (IHX)) of a prototypical sodium fast reactor (SFR). This paper develops a multiple-input multiple-output (MIMO) GPC with input constraints able to track polynomial references of any degree applied in coolant temperature difference across the core and fractional power. The manipulated variables of the GPC-SFR are the reactivity and the sodium flow rate of the primary and secondary pipes. Moreover, orthonormal Laguerre functions and step down condition number techniques were also applied to avoid the numerical ill-conditioning issue in quadratic programming of large systems. Thus, a GPC type-2 was designed to control fractional power, coolant temperature difference across the core and sodium tank temperature of the SFR primary system when temperature references change according to a linear ramp after reaching their steady-state operation, sustaining 100% power operation on the reactor. In order to analyze the load tracking capability of the GPC-SFR type-2, the load following from 100% fractional power (FP) to 60% FP at 0.8% FP/min rate is simulated. Constraints on the rate of coolant temperature difference across the core and reactivity were applied for the design safety. For comparison criteria, this paper compares the GPC-SFR type-2 with the GPC-SFR type-1, i.e., standard model predictive control (MPC), to verify the viability and superior performance of the proposal regarding: (a) ramp-tracking capability of temperature and load; (b) the rejections of a reactivity disturbance of -1 cent and a secondary sodium inlet temperature disturbance of +10°F; and (c) a simulation with uncertainty in reactor design. The simulations show that the GPC-SFR type-2 overcome the GPC-SFR type-1 robustness and performance.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Prediction-Correction Algorithms for Time-Varying Constrained Optimization

This article develops online algorithms to track solutions of time-varying constrained optimization problems. Particularly, resembling workhorse Kalman filtering-based approaches for dynamical systems, the proposed methods involve prediction-correction steps to provably track the trajectory of the optimal solutions of time-varying convex problems. The merits of existing prediction-correction methods have been shown for unconstrained problems and for setups where computing the inverse of the Hessian of the cost function is computationally affordable. This paper addresses the limitations of existing methods by tackling constrained problems and by designing first-order prediction steps that rely on the Hessian of the cost function (and do not require the computation of its inverse). In addition, the proposed methods are shown to improve the convergence speed of existing prediction-correction methods when applied to unconstrained problems. Numerical simulations corroborate the analytical results and showcase performance and benefits of the proposed algorithms. A realistic application of the proposed method to real-time control of energy resources is presented.

97 MATHEMATICS AND COMPUTING↗

Utilizing computer vision and artificial intelligence algorithms to predict and design the mechanical compression response of direct ink write 3D printed foam replacement structures

Additive Manufacturing (AM) of porous polymeric materials, such as foams, recently became a topic of intensive research due their unique combination of low density, impressive mechanical properties, and stress dissipation capabilities. Conventional methods for fabricating foams rely on complex and stochastic processes, making it challenging to achieve precise architectural control of structured porosity. In contrast, AM provides access to a wide range of printable materials, where precise spatial control over structured porosity can be modulated during the fabrication process enabling the production of foam replacement structures (FRS). Current approaches for designing FRS are based on intuitive understanding of their properties or an extensive number of finite element method (FEM) simulations. These approaches, however, are computationally expensive and time consuming. As such, in this work, we present a novel methodology for determining the mechanical compression response of direct ink write (DIW) 3D printed FRS using a simple cross-sectional image. By obtaining measurement data for a relatively small number of samples, an artificial neural network (ANN) was trained, and a computer vision algorithm was used to make inferences about foam compression characteristics from a single cross-sectional image. Finally, a genetic algorithm (GA) was used to solve the inverse design problem, generating the AM printing parameters that an engineer should use to achieve a desired compression response from a DIW printed FRS. The methods developed herein present an avenue for entirely autonomous design and analysis of additively manufactured structures using artificial intelligence.

36 MATERIALS SCIENCE↗