Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 8 of 8

Full-Text Articles in Physical Sciences and Mathematics

Modeling And Control Of Nanoparticle Bloodstream Concentration For Cancer Therapies, Scarlett S. Bracey Oct 2013

Modeling And Control Of Nanoparticle Bloodstream Concentration For Cancer Therapies, Scarlett S. Bracey

Doctoral Dissertations

Currently, the most commonly used treatments for cancerous tumors (chemotherapy, radiation, etc.) have almost no method of monitoring the administration of the treatment for adverse effects in real time. Without any real time feedback or control, treatment becomes a "guess and check" method with no way of predicting the effects of the drugs based on the actual bioavailability to the patient's body. One particular drug may be effective for one patient, yet provide no benefit to another. Doctors and scientists do not routinely attempt to quantifiably explain this discrepancy. In this work, mathematical modeling and analysis techniques are joined together …


On The Performance Of A Hybrid Genetic Algorithm In Dynamic Environments, Quan Yuan, Zhixin Yang Aug 2013

On The Performance Of A Hybrid Genetic Algorithm In Dynamic Environments, Quan Yuan, Zhixin Yang

Mathematics Faculty Research Publications

The ability to track the optimum of dynamic environments is important in many practical applications. In this paper, the capability of a hybrid genetic algorithm (HGA) to track the optimum in some dynamic environments is investigated for different functional dimensions, update frequencies, and displacement strengths in different types of dynamic environments. Experimental results are reported by using the HGA and some other existing evolutionary algorithms in the literature. The results show that the HGA has better capability to track the dynamic optimum than some other existing algorithms.


Bi- And Multi Level Game Theoretic Approaches In Mechanical Design, Ehsan Ghotbi Aug 2013

Bi- And Multi Level Game Theoretic Approaches In Mechanical Design, Ehsan Ghotbi

Theses and Dissertations

This dissertation presents a game theoretic approach to solve bi and multi-level optimization problems arising in mechanical design. Toward this end, Stackelberg (leader-follower), Nash, as well as cooperative game formulations are considered. To solve these problems numerically, a sensitivity based approach is developed in this dissertation. Although game theoretic methods have been used by several authors for solving multi-objective problems, numerical methods and the applications of extensive games to engineering design problems are very limited. This dissertation tries to fill this gap by developing the possible scenarios for multi-objective problems and develops new numerical approaches for solving them.

This dissertation …


√(X2 + Μ) Is The Most Computationally Efficient Smooth Approximation To |X|: A Proof, Carlos Ramirez, Reinaldo Sanchez, Vladik Kreinovich, Miguel Argaez Jun 2013

√(X2 + Μ) Is The Most Computationally Efficient Smooth Approximation To |X|: A Proof, Carlos Ramirez, Reinaldo Sanchez, Vladik Kreinovich, Miguel Argaez

Departmental Technical Reports (CS)

In many practical situations, we need to minimize an expression of the type |c1| + ... + |cn|. The problem is that most efficient optimization techniques use the derivative of the objective function, but the function |x| is not differentiable at 0. To make optimization efficient, it is therefore reasonable to approximate |x| by a smooth function. We show that in some reasonable sense, the most computationally efficient smooth approximation to |x| is the function √(x2 + μ), a function which has indeed been successfully used in such optimization.


Near-Optimal Compressed Sensing Guarantees For Total Variation Minimization, Deanna Needell, R. Ward May 2013

Near-Optimal Compressed Sensing Guarantees For Total Variation Minimization, Deanna Needell, R. Ward

CMC Faculty Publications and Research

Consider the problem of reconstructing a multidimensional signal from an underdetermined set of measurements, as in the setting of compressed sensing. Without any additional assumptions, this problem is ill-posed. However, for signals such as natural images or movies, the minimal total variation estimate consistent with the measurements often produces a good approximation to the underlying signal, even if the number of measurements is far smaller than the ambient dimensionality. This paper extends recent reconstruction guarantees for two-dimensional images x ∈ ℂN2 to signals x ∈ ℂNd of arbitrary dimension d ≥ 2 and to isotropic total variation problems. In this …


Generalized Local Test For Local Extrema In Single-Variable Functions, Eleftherios Gkioulekas May 2013

Generalized Local Test For Local Extrema In Single-Variable Functions, Eleftherios Gkioulekas

School of Mathematical and Statistical Sciences Faculty Publications and Presentations

We give a detailed derivation of a generalization of the second derivative test of single-variable calculus which can classify critical points as local minima or local maxima (or neither), whenever the traditional second derivative test fails, by considering the values of higher-order derivatives evaluated at the critical points. The enhanced test is local, in the sense that it is only necessary to evaluate all relevant derivatives at the critical point itself, and it is reasonably robust. We illustrate an application of the generalized test on a trigonometric function where the second derivative test fails to classify some of the critical …


An Adaptive Total Variation Algorithm For Computing The Balanced Cut Of A Graph, Xavier Bresson, Thomas Laurent, David Uminsky, James H. Von Brecht Jan 2013

An Adaptive Total Variation Algorithm For Computing The Balanced Cut Of A Graph, Xavier Bresson, Thomas Laurent, David Uminsky, James H. Von Brecht

Mathematics Faculty Works

We propose an adaptive version of the total variation algorithm proposed in [3] for computing the balanced cut of a graph. The algorithm from [3] used a sequence of inner total variation minimizations to guarantee descent of the balanced cut energy as well as convergence of the algorithm. In practice the total variation minimization step is never solved exactly. Instead, an accuracy parameter is specified and the total variation minimization terminates once this level of accuracy is reached. The choice of this parameter can vastly impact both the computational time of the overall algorithm as well as the accuracy of …


Optimization In Non-Parametric Survival Analysis And Climate Change Modeling, Iuliana Teodorescu Jan 2013

Optimization In Non-Parametric Survival Analysis And Climate Change Modeling, Iuliana Teodorescu

USF Tampa Graduate Theses and Dissertations

Many of the open problems of current interest in probability and statistics involve complicated data

sets that do not satisfy the strong assumptions of being independent and identically distributed. Often,

the samples are known only empirically, and making assumptions about underlying parametric

distributions is not warranted by the insufficient information available. Under such circumstances,

the usual Fisher or parametric Bayes approaches cannot be used to model the data or make predictions.

However, this situation is quite often encountered in some of the main challenges facing statistical,

data-driven studies of climate change, clinical studies, or financial markets, to name a few. …