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 775 records · Page 43

Basophile: Accurate Fragment Charge State Prediction Improves Peptide Identification Rates

In shotgun proteomics, database search algorithms rely on fragmentation models to predict fragment ions that should be observed for a given peptide sequence. The most widely used strategy (Naive model) is oversimplified, cleaving all peptide bonds with equal probability to produce fragments of all charges below that of the precursor ion. More accurate models, based on fragmentation simulation, are too computationally intensive for on-the-fly use in database search algorithms. We have created an ordinal-regression-based model called Basophile that takes fragment size and basic residue distribution into account when determining the charge retention during CID/higher-energy collision induced dissociation (HCD) of charged peptides. This model improves the accuracy of predictions by reducing the number of unnecessary fragments that are routinely predicted for highly-charged precursors. Basophile increased the identification rates by 26% (on average) over the Naive model, when analyzing triply-charged precursors from ion trap data. Basophile achieves simplicity and speed by solving the prediction problem with an ordinal regression equation, which can be incorporated into any database search software for shotgun proteomic identification.

59 BASIC BIOLOGICAL SCIENCES↗

Mitigating Errors in External Respiratory Surrogate-Based Models of Tumor Position

Purpose: To investigate the effect of tumor site, measurement precision, tumor-surrogate correlation, training data selection, model design, and interpatient and interfraction variations on the accuracy of external marker-based models of tumor position. Methods and Materials: Cyberknife Synchrony system log files comprising synchronously acquired positions of external markers and the tumor from 167 treatment fractions were analyzed. The accuracy of Synchrony, ordinary-least-squares regression, and partial-least-squares regression models for predicting the tumor position from the external markers was evaluated. The quantity and timing of the data used to build the predictive model were varied. The effects of tumor-surrogate correlation and the precision in both the tumor and the external surrogate position measurements were explored by adding noise to the data. Results: The tumor position prediction errors increased during the duration of a fraction. Increasing the training data quantities did not always lead to more accurate models. Adding uncorrelated noise to the external marker-based inputs degraded the tumor-surrogate correlation models by 16% for partial-least-squares and 57% for ordinary-least-squares. External marker and tumor position measurement errors led to tumor position prediction changes 0.3-3.6 times the magnitude of the measurement errors, varying widely with model algorithm. The tumor position prediction errors were significantly associated with the patient index but not with the fraction index or tumor site. Partial-least-squares was as accurate as Synchrony and more accurate than ordinary-least-squares. Conclusions: The accuracy of surrogate-based inferential models of tumor position was affected by all the investigated factors, except for the tumor site and fraction index.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Averaging analysis of adaptive control algorithms

The method of averaging is used to analyze discrete-time indirect adaptive control. The analysis focuses on various prediction-error-driven identification algorithms coupled with a general linear control law. The plant is not required to be in the model set of the identifier, which accounts for systems with unmodeled plant dynamics. Exogenous input signals including known command signals and unknown disturbances are also included. Both gradient and Newton-based algorithms are considered.

Phillips, Stephen M.↗

A Flexible Reservation Algorithm for Advance Network Provisioning

Many scientific applications need support from a communication infrastructure that provides predictable performance, which requires effective algorithms for bandwidth reservations. Network reservation systems such as ESnet's OSCARS, establish guaranteed bandwidth of secure virtual circuits for a certain bandwidth and length of time. However, users currently cannot inquire about bandwidth availability, nor have alternative suggestions when reservation requests fail. In general, the number of reservation options is exponential with the number of nodes n, and current reservation commitments. We present a novel approach for path finding in time-dependent networks taking advantage of user-provided parameters of total volume and time constraints, which produces options for earliest completion and shortest duration. The theoretical complexity is only O(n2r2) in the worst-case, where r is the number of reservations in the desired time interval. We have implemented our algorithm and developed efficient methodologies for incorporation into network reservation frameworks. Performance measurements confirm the theoretical predictions.

97 MATHEMATICS AND COMPUTING↗

SU-E-T-629: Prediction of the ViewRay Radiotherapy Treatment Time for Clinical Logistics

Purpose: An algorithm is developed in our clinic, given a new treatment plan, to predict treatment delivery time for radiation therapy (RT) treatments of patients on ViewRay magnetic resonance-image guided radiation therapy (MR-IGRT) delivery system. This algorithm is necessary for managing patient treatment appointments, and is useful as an indicator to assess the treatment plan complexity. Methods: A patient’s total treatment delivery time, not including time required for localization, may be described as the sum of four components: (1) the treatment initialization time; (2) the total beam-on time; (3) the gantry rotation time; and (4) the multileaf collimator (MLC) motion time. Each of the four components is predicted separately. The total beam-on time can be calculated using both the planned beam-on time and the decay-corrected delivery dose rate. To predict the remaining components, we quantitatively analyze the patient treatment delivery record files. The initialization time is demonstrated to be random since it depends on the final gantry angle and MLC leaf positions of the previous treatment. Based on modeling the relationships between the gantry rotation angles and the corresponding rotation time, and between the furthest MLC leaf moving distance and the corresponding MLC motion time, the total delivery time is predicted using linear regression. Results: The proposed algorithm has demonstrated the feasibility of predicting the ViewRay treatment delivery time for any treatment plan of any patient. The average prediction error is 0.89 minutes or 5.34%, and the maximal prediction error is 2.09 minutes or 13.87%. Conclusion: We have developed a treatment delivery time prediction algorithm based on the analysis of previous patients’ treatment delivery records. The accuracy of our prediction is sufficient for guiding and arranging patient treatment appointments on a daily basis. The predicted delivery time could also be used as an indicator to assess the treatment plan complexity. This work was supported by a research grant from Viewray Inc.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Strategies for Energy-Efficient Resource Management of Hybrid Programming Models

Many scientific applications are programmed using hybrid programming models that use both message passing and shared memory, due to the increasing prevalence of large-scale systems with multicore, multisocket nodes. Previous work has shown that energy efficiency can be improved using software-controlled execution schemes that consider both the programming model and the power-aware execution capabilities of the system. However, such approaches have focused on identifying optimal resource utilization for one programming model, either shared memory or message passing, in isolation. The potential solution space, thus the challenge, increases substantially when optimizing hybrid models since the possible resource configurations increase exponentially. Nonetheless, with the accelerating adoption of hybrid programming models, we increasingly need improved energy efficiency in hybrid parallel applications on large-scale systems. In this work, we present new software-controlled execution schemes that consider the effects of dynamic concurrency throttling (DCT) and dynamic voltage and frequency scaling (DVFS) in the context of hybrid programming models. Specifically, we present predictive models and novel algorithms based on statistical analysis that anticipate application power and time requirements under different concurrency and frequency configurations. Furthermore, we apply our models and methods to the NPB MZ benchmarks and selected applications from the ASC Sequoia codes. Overall, we achieve substantial energy savings (8.74 percent on average and up to 13.8 percent) with some performance gain (up to 7.5 percent) or negligible performance loss.

97 MATHEMATICS AND COMPUTING↗

Veridical data science

Building and expanding on principles of statistics, machine learning, and scientific inquiry, we propose the predictability, computability, and stability (PCS) framework for veridical data science. Our framework, composed of both a workflow and documentation, aims to provide responsible, reliable, reproducible, and transparent results across the data science life cycle. The PCS workflow uses predictability as a reality check and considers the importance of computation in data collection/storage and algorithm design. It augments predictability and computability with an overarching stability principle. Stability expands on statistical uncertainty considerations to assess how human judgment calls impact data results through data and model/algorithm perturbations. As part of the PCS workflow, we develop PCS inference procedures, namely PCS perturbation intervals and PCS hypothesis testing, to investigate the stability of data results relative to problem formulation, data cleaning, modeling decisions, and interpretations. We illustrate PCS inference through neuroscience and genomics projects of our own and others. Moreover, we demonstrate its favorable performance over existing methods in terms of receiver operating characteristic (ROC) curves in high-dimensional, sparse linear model simulations, including a wide range of misspecified models. Finally, we propose PCS documentation based on R Markdown or Jupyter Notebook, with publicly available, reproducible codes and narratives to back up human choices made throughout an analysis. The PCS workflow and documentation are demonstrated in a genomics case study available on Zenodo.

97 MATHEMATICS AND COMPUTING↗

Scaling Structured Multigrid to 500K+ Cores Through Coarse-Grid Redistribution

The effcient solution of sparse, linear systems resulting from the discretization of partial differential equations is crucial to the performance of many physics-based simulations. The algorithmic optimality of multilevel approaches for common discretizations makes them a good candidate for an efficient parallel solver. Yet, modern architectures for high-performance computing systems continue to challenge the parallel scalability of multilevel solvers. While algebraic multigrid methods are robust for solving a variety of problems, the increasing importance of data locality and cost of data movement in modern architectures motivates the need to carefully exploit structure in the problem. Robust logically structured variational multigrid methods, such as Black Box Multigrid (BoxMG), maintain structure throughout the multigrid hierarchy. This avoids indirection and increased coarse- grid communication costs typical in parallel algebraic multigrid. Nevertheless, the parallel scalability of structured multigrid is challenged by coarse-grid problems where the overhead in communication dominates computation. In this paper, an algorithm is introduced for redistributing coarse-grid problems through incremental agglomeration. Guided by a predictive performance model, this algorithm provides robust redistribution decisions for structured multilevel solvers. A two-dimensional diffusion problem is used to demonstrate the significant gain in performance of this algorithm over the previous approach that used agglomeration to one processor. In addition, the parallel scalability of this approach

97 MATHEMATICS AND COMPUTING↗

Development of an upwind, finite-volume code with finite-rate chemistry

Under this grant, two numerical algorithms were developed to predict the flow of viscous, hypersonic, chemically reacting gases over three-dimensional bodies. Both algorithms take advantage of the benefits of upwind differencing, total variation diminishing techniques, and a finite-volume framework, but obtain their solution in two separate manners. The first algorithm is a zonal, time-marching scheme, and is generally used to obtain solutions in the subsonic portions of the flow field. The second algorithm is a much less expensive, space-marching scheme and can be used for the computation of the larger, supersonic portion of the flow field. Both codes compute their interface fluxes with a temporal Riemann solver and the resulting schemes are made fully implicit including the chemical source terms and boundary conditions. Strong coupling is used between the fluid dynamic, chemical, and turbulence equations. These codes have been validated on numerous hypersonic test cases and have provided excellent comparison with existing data.

Molvik, Gregory A.↗

Development of an upwind, finite-volume code with finite-rate chemistry

Under this grant, two numerical algorithms were developed to predict the flow of viscous, hypersonic, chemically reacting gases over three-dimensional bodies. Both algorithms take advantage of the benefits of upwind differencing, total variation diminishing techniques and of a finite-volume framework, but obtain their solution in two separate manners. The first algorithm is a zonal, time-marching scheme, and is generally used to obtain solutions in the subsonic portions of the flow field. The second algorithm is a much less expensive, space-marching scheme and can be used for the computation of the larger, supersonic portion of the flow field. Both codes compute their interface fluxes with a temporal Riemann solver and the resulting schemes are made fully implicit including the chemical source terms and boundary conditions. Strong coupling is used between the fluid dynamic, chemical and turbulence equations. These codes have been validated on numerous hypersonic test cases and have provided excellent comparison with existing data. This report summarizes the research that took place from August 1,1994 to January 1, 1995.

Molvik, Gregory A.↗

CHEMNODE: CHEMICAL KINETICS SOLVER APPROACH BASED ON NEURAL ORDINARY DIFFERENTIAL EQUATIONS

This software contains an algorithm to model and predict the time evolution of chemical kinetics in reacting flow simulations using neural ordinary differential equations (NODEs). The approach works by using artificial neural networks to predict the chemical source terms. It achieves this by using forward-mode automatic differentiation and the Levenberg-Marquardt algorithm to adjust the neural network parameters, such that the discrepancies between the actual and predicted species profiles are minimized.

OWOYELE, OPEOLUWA↗

Performance of Canberra TruckScan Waste Assay Measurement System - 16361

After the Fukushima accident, large (approximately cubic meter) super-sacks of potentially contaminated soil and vegetation were stored at various temporary locations throughout the prefecture. Canberra has developed the TruckScan system to perform rapid and accurate assay measurements for these waste sacks loaded on trucks to determine the individual and total sack activities for Cs-137 and Cs-134. The measurement system consists of eight 3x3 inch shielded and collimated NaI(Tl) gamma-ray detectors. Data collected with the eight detectors is analyzed using a maximum entropy fitting algorithm which optimizes and predicts the mean and maximum possible activity concentration present in each of the sacks. The algorithm uses SuperISOCS to generate detection efficiencies for each detector-sack combination in the measurement, which are then used to solve for the distribution of activity concentrations in each sack that yields the best agreement with the count rates observed in each detector. Throughout the summer and fall of 2015, a prototype system was developed and tested at Canberra's Meriden CT facility. In October 2015, the prototype system was installed and demonstrated in Japan. Results of the demonstration measurements are presented along with estimates of the total measurement uncertainty (TMU) budget. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

The importance of atmospheric turbulence and stability in machine-learning models of wind farm power production

Machine learning is frequently applied in the wind energy industry to build statistical models of wind farm power production using atmospheric data as input. In the field of wind power forecasting, in particular, there has been substantial research into finding the best-performing learning algorithms that improve model predictions. Overlooked in the literature, however, is the influence of atmospheric turbulence and stability measurements in improving model predictions. It has been well-established through observations and physical models that these effects can have considerable influence on wind farm power production; yet consideration of these effects in statistical models is almost entirely absent from the literature. In this work, we examine the impact of atmospheric turbulence and stability inputs on statistical model predictions of wind farm power output. Hourly observations from a wind farm in the Pacific Northwest United States located in very complex terrain are used. Five common learning algorithms and nine atmospheric variables are considered, five of which represent some measure of turbulence or stability. Here, we find a considerable improvement in hourly power predictions when some measure of turbulence or stability is included in the model. In particular, turbulent kinetic energy was found to be the most important variable apart from wind speed and more important than wind direction, pressure, and temperature. By contrast, the choice of learning algorithm is shown to be relatively less important in improving predictions. Based on this work, we recommend that turbulence and stability variables become standard inputs into statistical models of wind farm power production.

17 WIND ENERGY↗

Tracking and predicting barges on inland waterways

We present a non-linear, probabilistic prediction model developed and implemented to track spatial location and other navigation characteristics of a barge traveling on the inland waterway system. A pre-filter, to check the validity of the measurements, a non-linear speed estimation process, and a Kalman filter to predict the navigation solution of the barge is developed in this work. Due to the complex dynamics involved in the system, a non-linear stochastic model was developed in state space using system dynamics to represent the process and measurement systems while maintaining the fidelity of an actual system. The algorithm was verified using actual measurements obtained from multiple barges on multiple rivers acquired from different sensors. The results show a reliable and robust prediction algorithm for tracking inland waterway barges.

Randeniya, Duminda I↗

The value of integrating pre-clinical data to predict nausea and vomiting risk in humans as illustrated by AZD3514, a novel androgen receptor modulator

Nausea and vomiting are components of a complex mechanism that signals food avoidance and protection of the body against the absorption of ingested toxins. This response can also be triggered by pharmaceuticals. Predicting clinical nausea and vomiting liability for pharmaceutical agents based on pre-clinical data can be problematic as no single animal model is a universal predictor. Moreover, efforts to improve models are hampered by the lack of translational animal and human data in the public domain. AZD3514 is a novel, orally-administered compound that inhibits androgen receptor signaling and down-regulates androgen receptor expression. Here we have explored the utility of integrating data from several pre-clinical models to predict nausea and vomiting in the clinic. Single and repeat doses of AZD3514 resulted in emesis, salivation and gastrointestinal disturbances in the dog, and inhibited gastric emptying in rats after a single dose. AZD3514, at clinically relevant exposures, induced dose-responsive “pica” behaviour in rats after single and multiple daily doses, and induced retching and vomiting behaviour in ferrets after a single dose. We compare these data with the clinical manifestation of nausea and vomiting encountered in patients with castration-resistant prostate cancer receiving AZD3514. Our data reveal a striking relationship between the pre-clinical observations described and the experience of nausea and vomiting in the clinic. In conclusion, the emetic nature of AZD3514 was predicted across a range of pre-clinical models, and the approach presented provides a valuable framework for predicition of clinical nausea and vomiting. - Highlights: • Integrated pre-clinical data can be used to predict clinical nausea and vomiting. • Data integrated from standard toxicology studies is sufficient to make a prediction. • The use of the nausea algorithm developed by Parkinson (2012) aids the prediction. • Additional pre-clinical studies can be used to confirm and quantify the risk.

60 APPLIED LIFE SCIENCES↗

Development of a shock noise prediction code for high-speed helicopters - The subsonically moving shock

A previously defined airfoil subsonic shock-noise prediction formula whose result depends on a mapping of the time-dependent shock surface to a time-independent computational domain is presently coded and incorporated in the NASA-Langley rotor-noise prediction code, WOPWOP. The structure and algorithms used in the shock-noise prediction code are presented; special care has been taken to reduce computation time while maintaining accuracy. Numerical examples of shock-noise prediction are presented for hover and forward flight. It is confirmed that shock noise is an important component of the quadrupole source.

Tadghighi, H.↗

SU-F-T-342: Dosimetric Constraint Prediction Guided Automatic Mulit-Objective Optimization for Intensity Modulated Radiotherapy

Purpose: For intensity modulated radiotherapy, the plan optimization is time consuming with difficulties of selecting objectives and constraints, and their relative weights. A fast and automatic multi-objective optimization algorithm with abilities to predict optimal constraints and manager their trade-offs can help to solve this problem. Our purpose is to develop such a framework and algorithm for a general inverse planning. Methods: There are three main components contained in this proposed multi-objective optimization framework: prediction of initial dosimetric constraints, further adjustment of constraints and plan optimization. We firstly use our previously developed in-house geometry-dosimetry correlation model to predict the optimal patient-specific dosimetric endpoints, and treat them as initial dosimetric constraints. Secondly, we build an endpoint(organ) priority list and a constraint adjustment rule to repeatedly tune these constraints from their initial values, until every single endpoint has no room for further improvement. Lastly, we implement a voxel-independent based FMO algorithm for optimization. During the optimization, a model for tuning these voxel weighting factors respecting to constraints is created. For framework and algorithm evaluation, we randomly selected 20 IMRT prostate cases from the clinic and compared them with our automatic generated plans, in both the efficiency and plan quality. Results: For each evaluated plan, the proposed multi-objective framework could run fluently and automatically. The voxel weighting factor iteration time varied from 10 to 30 under an updated constraint, and the constraint tuning time varied from 20 to 30 for every case until no more stricter constraint is allowed. The average total costing time for the whole optimization procedure is ∼30mins. By comparing the DVHs, better OAR dose sparing could be observed in automatic generated plan, for 13 out of the 20 cases, while others are with competitive results. Conclusion: We have successfully developed a fast and automatic multi-objective optimization for intensity modulated radiotherapy. This work is supported by the National Natural Science Foundation of China (No: 81571771)

60 APPLIED LIFE SCIENCES↗

Baseline Assessment and Prioritization Framework for IVHM Integrity Assurance Enabling Capabilities

Fundamental to vehicle health management is the deployment of systems incorporating advanced technologies for predicting and detecting anomalous conditions in highly complex and integrated environments. Integrated structural integrity health monitoring, statistical algorithms for detection, estimation, prediction, and fusion, and diagnosis supporting adaptive control are examples of advanced technologies that present considerable verification and validation challenges. These systems necessitate interactions between physical and software-based systems that are highly networked with sensing and actuation subsystems, and incorporate technologies that are, in many respects, different from those employed in civil aviation today. A formidable barrier to deploying these advanced technologies in civil aviation is the lack of enabling verification and validation tools, methods, and technologies. The development of new verification and validation capabilities will not only enable the fielding of advanced vehicle health management systems, but will also provide new assurance capabilities for verification and validation of current generation aviation software which has been implicated in anomalous in-flight behavior. This paper describes the research focused on enabling capabilities for verification and validation underway within NASA s Integrated Vehicle Health Management project, discusses the state of the art of these capabilities, and includes a framework for prioritizing activities.

Cooper, Eric G.↗