Machine Learning-Powered Mitigation Policy Optimization in Epidemiological Models
Explore the source record for details and available documents.
SEARCH · Search NASA
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.
Explore the source record for details and available documents.
Abstract not provided.
Explore the source record for details and available documents.
Abstract not provided.
The success rate of molecular replacement (MR) falls considerably when search models share less than 35% sequence identity with their templates, but can be improved significantly by using fold-recognition methods combined with exhaustive MR searches. Models based on alignments calculated with fold-recognition algorithms are more accurate than models based on conventional alignment methods such as FASTA or BLAST, which are still widely used for MR. In addition, by designing MR pipelines that integrate phasing and automated refinement and allow parallel processing of such calculations, one can effectively increase the success rate of MR. Here, updated results from the JCSG MR pipeline are presented, which to date has solved 33 MR structures with less than 35% sequence identity to the closest homologue of known structure. By using difficult MR problems as examples, it is demonstrated that successful MR phasing is possible even in cases where the similarity between the model and the template can only be detected with fold-recognition algorithms. In the first step, several search models are built based on all homologues found in the PDB by fold-recognition algorithms. The models resulting from this process are used in parallel MR searches with different combinations of input parameters of the MR phasing algorithm. The putative solutions are subjected to rigid-body and restrained crystallographic refinement and ranked based on the final values of free R factor, figure of merit and deviations from ideal geometry. Finally, crystal packing and electron-density maps are checked to identify the correct solution. If this procedure does not yield a solution with interpretable electron-density maps, then even more alternative models are prepared. The structurally variable regions of a protein family are identified based on alignments of sequences and known structures from that family and appropriate trimmings of the models are proposed. All combinations of these trimmings are applied to the search models and the resulting set of models is used in the MR pipeline. It is estimated that with the improvements in model building and exhaustive parallel searches with existing phasing algorithms, MR can be successful for more than 50% of recognizable homologues of known structures below the threshold of 35% sequence identity. This implies that about one-third of the proteins in a typical bacterial proteome are potential MR targets.
No abstract prepared.
The coordination of interconnected elements across the different layers of the supply chain is essential for all industrial processes and the key to optimal decision-making. Yet, the modeling and optimization of such interdependent systems are still burdensome. Here we address the simultaneous modeling and optimization of medium-term planning and short-term scheduling problems under demand uncertainty using mixed-integer bi-level multi-follower programming and data-driven optimization. Bi-level multi-follower programs model the natural hierarchy between different layers of supply chain management holistically, while scenario analysis and data-driven optimization allow us to retrieve the guaranteed feasible solutions of the integrated formulation under various demand considerations. We address the data-driven optimization of this challenging class of problems using the DOMINO framework, which was initially developed to solve single-leader single-follower bi-level optimization problems to guaranteed feasibility. This framework is extended to solve single-leader multi-follower stochastic formulations and its performance is characterized by well-known single and multi-product process scheduling case studies. Through our data-driven algorithmic approach, we present guaranteed feasible solutions to linear and nonlinear mixed-integer bi-level formulations of simultaneous planning and scheduling problems and further characterize the effects of the scheduling level complexity on the solution performance, which spans over several hundred continuous and binary variables, and thousands of constraints.
This presentation provides an overview of using an advanced distribution management system test bed to evaluate the impact of model quality on volt/VAR optimization.
Optimized docking of models into cryo-EM maps requires exploiting an understanding of the signal expected in the data to minimize the calculation time while maintaining sufficient signal. The likelihood-based rotation function used in crystallography can be employed to establish plausible orientations in a docking search. A phased likelihood translation function yields scores for the placement and rigid-body refinement of oriented models. Optimized strategies for choices of the resolution of data from the cryo-EM maps to use in the calculations and the size of search volumes are based on expected log-likelihood-gain scores computed in advance of the search calculation. Tests demonstrate that the new procedure is fast, robust and effective at placing models into even challenging cryo-EM maps.
In the present study an optimisation problem is formulated to determine the forcing of an eddy-viscosity-based linearised Navier–Stokes model in channel flow at $Re_\tau \approx 5200$ ( $Re_\tau$ is the friction Reynolds number), where the forcing is white-in-time and spatially decorrelated. The objective functional is prescribed such that the forcing drives a response to best match a set of velocity spectra from direct numerical simulation (DNS), as well as remaining sufficiently smooth. Strong quantitative agreement is obtained between the velocity spectra from the linear model with optimal forcing and from DNS, but only qualitative agreement between the Reynolds shear stress co-spectra from the model and DNS. The forcing spectra exhibit a level of self-similarity, associated with the primary peak in the velocity spectra, but they also reveal a non-negligible amount of energy spent in phenomenologically mimicking the non-self-similar part of the velocity spectra associated with energy cascade. By exploiting linearity, the effect of the individual forcing components is assessed and the contributions from the Orr mechanism and the lift-up effect are also identified. Finally, the effect of the strength of the eddy viscosity on the optimisation performance is investigated. The inclusion of the eddy viscosity diffusion operator is shown to be essential in modelling of the near-wall features, while still allowing the forcing of the self-similar primary peak. In particular, reducing the strength of the eddy viscosity results in a considerable increase in the near-wall forcing of wall-parallel components.
Purpose: The purpose of this work is to develop a framework to the inverse problem for radiosurgery treatment planning on the Gamma Knife{sup Registered-Sign} Perfexion Trade-Mark-Sign (PFX) for intracranial targets. Methods: The approach taken in the present study consists of two parts. First, a hybrid grassfire and sphere-packing algorithm is used to obtain shot positions (isocenters) based on the geometry of the target to be treated. For the selected isocenters, a sector duration optimization (SDO) model is used to optimize the duration of radiation delivery from each collimator size from each individual source bank. The SDO model is solved using a projected gradient algorithm. This approach has been retrospectively tested on seven manually planned clinical cases (comprising 11 lesions) including acoustic neuromas and brain metastases. Results: In terms of conformity and organ-at-risk (OAR) sparing, the quality of plans achieved with the inverse planning approach were, on average, improved compared to the manually generated plans. The mean difference in conformity index between inverse and forward plans was -0.12 (range: -0.27 to +0.03) and +0.08 (range: 0.00-0.17) for classic and Paddick definitions, respectively, favoring the inverse plans. The mean difference in volume receiving the prescribed dose (V{sub 100}) between forward and inverse plans was 0.2% (range: -2.4% to +2.0%). After plan renormalization for equivalent coverage (i.e., V{sub 100}), the mean difference in dose to 1 mm{sup 3} of brainstem between forward and inverse plans was -0.24 Gy (range: -2.40 to +2.02 Gy) favoring the inverse plans. Beam-on time varied with the number of isocenters but for the most optimal plans was on average 33 min longer than manual plans (range: -17 to +91 min) when normalized to a calibration dose rate of 3.5 Gy/min. In terms of algorithm performance, the isocenter selection for all the presented plans was performed in less than 3 s, while the SDO was performed in an average of 215 min. Conclusions: PFX inverse planning can be performed using geometric isocenter selection and mathematical modeling and optimization techniques. The obtained treatment plans all meet or exceed clinical guidelines while displaying high conformity.
Conference presentation conveying work conducted on property modeling and implications on cost optimization of seawater desalination technology. The authors assess the accuracy of four different property modeling approaches to represent thermodynamic properties of seawater. These properties are used with process flowsheets that include either reverse osmosis or mechanical vapor compression. The accuracy of property estimation is related to deviations in process design and levelized cost.
Purpose: This study compared normal tissue complication probability (NTCP) modeling of chronic gastrointestinal toxicities following prostate cancer treatment for 2 treatment modalities. Possible factors causing discrepancies in optimal NTCP model parameters between 3-dimensional conformal radiation therapy (3D-CRT) and intensity modulated RT (IMRT) were analyzed and discussed, including the impact of patient characteristics, image guidance, toxicity scoring bias, and NTCP model limitations. Methods and Materials: Rectal wall dose-volume histograms of 1115 patients treated for prostate cancer under an adaptive radiation therapy protocol were used to model gastrointestinal toxicity grade ≥2 (according to Common Terminology Criteria for Adverse Events). A total of 457 patients were treated with 3D-CRT and 658 with IMRT. 3D-CRT patients were matched to IMRT patients based on various patient characteristics, using a propensity score–based algorithm. Parameters of the Lyman equivalent uniform dose and cut-off dose logistic regression NTCP models were estimated for the 2 matched treatment modalities and the combined group. Results: After they were matched, the 3D-CRT and IMRT groups contained 275 and 550 patients with a large discrepancy of 28.7% versus 7.8% toxicities, respectively (P<.001). For both NTCP models, optimal parameters found for the 3D-CRT groups did not fit the IMRT patients well and vice versa. Models developed for the combined data overestimated NTCP for the IMRT patients and underestimated NTCP for the 3D-CRT group. Conclusions: Our analysis did not reveal a single definitive cause for discrepancies of model parameters between 3D-CRT and IMRT. Patient characteristics and bias in toxicity scoring, as well as image guidance alone, are unlikely causes of the large discrepancy of toxicities. Whether the cause was inherent to the specific NTCP models used in this study needs to be verified by future investigations. Because IMRT is increasingly used clinically, it is important that appropriate NTCP model parameters are determined for this treatment modality.
This paper deals with the optimal control of a mathematical model of glioma progression incorporating the basic facts of the evolution of primary brain tumors. We will consider a model of the simplest possible kind, based on the Fischer-Kolmogorov equations, using ideas from Pérez-García (Mathematical models for the radiotherapy of gliomas (preprint), 2016). The control is the 2n-tuple (t{sub 1},..., t{sub n}; d{sub 1},..., d{sub n}), where d{sub i} is the i-th applied radiotherapy dose an t{sub i} is the i-th administration for 1 ≤ i ≤ n. We search for controls that maximize the survival time, that is, the time at which the tumor mass reaches a critical value M{sub ∗}, over the class of admissible radiation times and doses. We present theoretical and numerical results that justify the relevance of the model and the existence of potential medical applications.
Counter-current chromatography (CCC) is capable of unique elution modes that isolate analytes using the movement of the stationary phase in addition to moving the mobile phase. These modes include elution-extrusion CCC (EECCC) and dual-mode CCC (DM CCC) that are not possible in traditional solid-liquid chromatography systems. Although EECCC and DM CCC are widely used to recover highly retained components, to our knowledge, optimizing the elution process in these modes with predictive models has not been reported. To address this gap, we developed a predictive model for CCC dubbed the Cell Utilized Partitioning (CUP) model. The CUP model accurately predicts the effluents of multicomponent separations in EECCC and DM CCC modes when compared to experimental data. Furthermore, CUP model simulations were extended to investigate the influence of operating and intrinsic parameters on the yield and productivity, and to compare the separation performances of EECCC and DM CCC in various conditions. The results demonstrate that low distribution constants, usually a KD less than 1, and a selectivity > 1.3, under specific flowrate ranges, increase both productivity and yield. From these results, generalized optimization and scaleup guidelines are proposed that can apply to research settings and to industrial processes to maximize preparative CCC performance.
This document pertains to the reporting requirements of DOE contract FE-0031767. The document covers the development of a model-based estimation (MBE) library for generating digital twins of coal-fired power plants (CFPPs). The models used by the MBE are transient and physics-based. Model classes in the library that correspond to different components in CFPPs are presented with physical explanations and representative results. MBE library provides Extended Kalman Filter (EKF), and Unscented Kalman Filter (UKF) algorithms. The MBE library is generic and can be used to represent a variety of CFPPs. A digital twin of a CFPP will be created as the reduced-order model of that CFPP is embedded in the developed MBE architecture.
A new adaptive method based on an optimal control approach is proposed for adaptive modeling of an atomic-to-continuum coupling method constructed from the Arlequin framework. The coupling method provides for an approximation of the solution to a fully atomic model in which errors may arise due to the misplacement of the overlap region. The objective is thus to determine, a posteriori, the best position of this overlap region. More precisely, the problem is to find the optimal size of the atomic region that one needs to consider in the coupled formulation in order to accurately estimate predefined quantities of interest. In this new adaptive process, the position of the overlapping domain between the two models is conveniently parameterized and iteratively determined by searching for the optimal parameters. The performance of the method is demonstrated on one-dimensional and two-dimensional test problems. In particular, it is observed that the approach yields better convergence with respect to quantities of interest when compared to a classical adaptive approach based on a posteriori estimates of the modeling error.
We propose a bilevel optimization approach for the determination of parameters in nonlocal image denoising. We consider both spatial weights in front of the fidelity term, as well as weights within the kernel of the nonlocal operator. In both cases we investigate the differentiability of the solution operator in function spaces and derive a first order optimality system that characterizes local minima. For the numerical solution of the problems, we propose a second-order optimization algorithm in combination with a finite element discretization of the nonlocal denoising models and a computational strategy for the solution of the resulting dense linear systems. Several experiments are run in order to show the suitability of our approach.