Physical Sciences and Mathematics Commons^™

A Machine Learning Approach For Predicting Clinical Trial Patient Enrollment In Drug Development Portfolio Demand Planning, Ahmed Shoieb

Masters Theses

One of the biggest challenges the clinical research industry currently faces is the accurate forecasting of patient enrollment (namely if and when a clinical trial will achieve full enrollment), as the stochastic behavior of enrollment can significantly contribute to delays in the development of new drugs, increases in duration and costs of clinical trials, and the over- or under- estimation of clinical supply. This study proposes a Machine Learning model using a Fully Convolutional Network (FCN) that is trained on a dataset of 100,000 patient enrollment data points including patient age, patient gender, patient disease, investigational product, study phase, blinded …

Optimal Communication Structures For Concurrent Computing, Andrii Berdnikov

Doctoral Dissertations

This research focuses on communicative solvers that run concurrently and exchange information to improve performance. This “team of solvers” enables individual algorithms to communicate information regarding their progress and intermediate solutions, and allows them to synchronize memory structures with more “successful” counterparts. The result is that fewer nodes spend computational resources on “struggling” processes. The research is focused on optimization of communication structures that maximize algorithmic efficiency using the theoretical framework of Markov chains. Existing research addressing communication between the cooperative solvers on parallel systems lacks generality: Most studies consider a limited number of communication topologies and strategies, while the …

Benchmarks And Controls For Optimization With Quantum Annealing, Erica Kelley Grant

Doctoral Dissertations

Quantum annealing (QA) is a metaheuristic specialized for solving optimization problems which uses principles of adiabatic quantum computing, namely the adiabatic theorem. Some devices implement QA using quantum mechanical phenomena. These QA devices do not perfectly adhere to the adiabatic theorem because they are subject to thermal and magnetic noise. Thus, QA devices return statistical solutions with some probability of success where this probability is affected by the level of noise of the system. As these devices improve, it is believed that they will become less noisy and more accurate. However, some tuning strategies may further improve that probability of …

Achieving High Reliability And Efficiency In Maintaining Large-Scale Storage Systems Through Optimal Resource Provisioning And Data Placement, Lipeng Wan

Doctoral Dissertations

With the explosive increase in the amount of data being generated by various applications, large-scale distributed and parallel storage systems have become common data storage solutions and been widely deployed and utilized in both industry and academia. While these high performance storage systems significantly accelerate the data storage and retrieval, they also bring some critical issues in system maintenance and management. In this dissertation, I propose three methodologies to address three of these critical issues.

First, I develop an optimal resource management and spare provisioning model to minimize the impact brought by component failures and ensure a highly operational experience …

Improving Ventricular Catheter Design Through Computational Fluid Dynamics, Sofy Hefets Weisenberg

Masters Theses

Cerebrospinal fluid (CSF) shunts are fully implantable medical devices that are used to treat patients suffering from conditions characterized by elevated intracranial pressure, such as hydrocephalus. In cases of shunt failure or malfunction, patients are often required to endure one or more revision surgeries to replace all or part of the shunt. One of the primary causes of CSF shunt failure is obstruction of the ventricular catheter, a component of the shunt system implanted directly into the brain's ventricular system. This work aims to improve the design of ventricular catheters in order to reduce the incidence of catheter obstruction and …

Developing An Optimal Model For Infant Home Visitation, Isaac Atuahene

Doctoral Dissertations

The United States, Great Britain, Denmark, Canada and many other countries have accepted home visitation (HV) as a promising strategy for interventions for infants after births and for their mothers. Prior HV studies have focused on theoretical foundations, evaluations of programs, cost/benefit analysis and cost estimation by using hospital/payer/insurance data to prove its effectiveness and high cost. As governments and private organizations continue to fund HVs, it is an opportune time to develop and formulate operations research (OR) models of HV coverage, quality and cost so they might be used in program implementation as done for adult home healthcare (HHC) …

Methods For Quantitative Local Structure Analysis Of Crystalline Materials Employing High Performance Computing, Tara Marie Michels-Clark

Doctoral Dissertations

A fundamental computational methodology was investigated to extract quantitative local structure information from single crystal diffuse scattering data. The principles of a highly efficient, parallelizable local structure analysis using massively parallel computing resources at Oak Ridge National Laboratory (ORNL) are demonstrated on an organic hydrocarbon compound containing stacking faults, Tris(bicyclo[2.1.1]hexeno)benzene. A probabilistic model of the stacking variations with a five layer interaction depth was developed. The final model structure motif statistics are verified using the steady state distribution of Markov matrix representing the four to five layer transitions. The computations revealed that highly parallelizable “structure-clones” could replace less computationally efficient …

Indefinite Knapsack Separable Quadratic Programming: Methods And Applications, Jaehwan Jeong

Doctoral Dissertations

Quadratic programming (QP) has received significant consideration due to an extensive list of applications. Although polynomial time algorithms for the convex case have been developed, the solution of large scale QPs is challenging due to the computer memory and speed limitations. Moreover, if the QP is nonconvex or includes integer variables, the problem is NP-hard. Therefore, no known algorithm can solve such QPs efficiently. Alternatively, row-aggregation and diagonalization techniques have been developed to solve QP by a sub-problem, knapsack separable QP (KSQP), which has a separable objective function and is constrained by a single knapsack linear constraint and box constraints. …