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

Physical Sciences and Mathematics Commons

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

Applied Mathematics

PDF

Series

2007

Institution
Keyword
Publication

Articles 1 - 30 of 103

Full-Text Articles in Physical Sciences and Mathematics

Bayesian Analysis For Penalized Spline Regression Using Win Bugs, Ciprian M. Crainiceanu, David Ruppert, M.P. Wand Dec 2007

Bayesian Analysis For Penalized Spline Regression Using Win Bugs, Ciprian M. Crainiceanu, David Ruppert, M.P. Wand

Johns Hopkins University, Dept. of Biostatistics Working Papers

Penalized splines can be viewed as BLUPs in a mixed model framework, which allows the use of mixed model software for smoothing. Thus, software originally developed for Bayesian analysis of mixed models can be used for penalized spline regression. Bayesian inference for nonparametric models enjoys the flexibility of nonparametric models and the exact inference provided by the Bayesian inferential machinery. This paper provides a simple, yet comprehensive, set of programs for the implementation of nonparametric Bayesian analysis in WinBUGS. MCMC mixing is substantially improved from the previous versions by using low{rank thin{plate splines instead of truncated polynomial basis. Simulation time …


A Lower Estimate For The Norm Of The Kerzman-Stein Operator, Michael Bolt Dec 2007

A Lower Estimate For The Norm Of The Kerzman-Stein Operator, Michael Bolt

University Faculty Publications and Creative Works

We establish an elementary lower estimate for the norm of the Kerzman-Stein operator for a smooth, bounded domain. The estimate involves the boundary length and logarithmic capacity. The estimate is tested on model domains for which the norm is known explicitly. It is shown that the estimate is sharp for an annulus and a strip, and is asymptotically sharp for an ellipse and a wedge. © 2007 Rocky Mountain Mathematics Consortium.


The Substitution Theorem For Semilinear Stochastic Partial Differential Equations, Salah-Eldin A. Mohammed, Tusheng Zhang Dec 2007

The Substitution Theorem For Semilinear Stochastic Partial Differential Equations, Salah-Eldin A. Mohammed, Tusheng Zhang

Articles and Preprints

In this article we establish a substitution theorem for semilinear stochastic evolution equations (see's) depending on the initial condition as an infinite-dimensional parameter. Due to the infinitedimensionality of the initial conditions and of the stochastic dynamics, existing finite-dimensional results do not apply. The substitution theorem is proved using Malliavin calculus techniques together with new estimates on the underlying stochastic semiflow. Applications of the theorem include dynamic characterizations of solutions of stochastic partial differential equations (spde's) with anticipating initial conditions and non-ergodic stationary solutions. In particular, our result gives a new existence theorem for solutions of semilinear Stratonovich spde's with anticipating …


On A Class Of Backward Mckean-Vlasov Stochastic Equations In Hilbert Space: Existence And Convergence Properties, Nazim I. Mahmudov, Mark A. Mckibben Dec 2007

On A Class Of Backward Mckean-Vlasov Stochastic Equations In Hilbert Space: Existence And Convergence Properties, Nazim I. Mahmudov, Mark A. Mckibben

Mathematics Faculty Publications

This investigation is devoted to the study of a class of abstract first-order backward McKean-Vlasov stochastic evolution equations in a Hilbert space. Results concerning the existence and uniqueness of solutions and the convergence of an approximating sequence of solutions (and corresponding probability measures) are established. Examples that illustrate the abstract theory are also provided.


Gravity-Driven Thin Liquid Films With Insoluble Surfactant: Smooth Traveling Waves, Rachel Levy, Michael Shearer, Thomas P. Witelski Dec 2007

Gravity-Driven Thin Liquid Films With Insoluble Surfactant: Smooth Traveling Waves, Rachel Levy, Michael Shearer, Thomas P. Witelski

All HMC Faculty Publications and Research

The flow of a thin layer of fluid down an inclined plane is modified by the presence of insoluble surfactant. For any finite surfactant mass, traveling waves are constructed for a system of lubrication equations describing the evolution of the free-surface fluid height and the surfactant concentration. The one-parameter family of solutions is investigated using perturbation theory with three small parameters: the coefficient of surface tension, the surfactant diffusivity, and the coefficient of the gravity-driven diffusive spreading of the fluid. When all three parameters are zero, the nonlinear PDE system is hyperbolic/degenerateparabolic, and admits traveling wave solutions in which the …


Loss-Based Estimation With Evolutionary Algorithms And Cross-Validation, David Shilane, Richard H. Liang, Sandrine Dudoit Nov 2007

Loss-Based Estimation With Evolutionary Algorithms And Cross-Validation, David Shilane, Richard H. Liang, Sandrine Dudoit

U.C. Berkeley Division of Biostatistics Working Paper Series

Many statistical inference methods rely upon selection procedures to estimate a parameter of the joint distribution of explanatory and outcome data, such as the regression function. Within the general framework for loss-based estimation of Dudoit and van der Laan, this project proposes an evolutionary algorithm (EA) as a procedure for risk optimization. We also analyze the size of the parameter space for polynomial regression under an interaction constraints along with constraints on either the polynomial or variable degree.


Relative Pareto Minimizers To Multiobjective Problems: Existence And Optimality Conditions, Truong Q. Bao, Boris S. Mordukhovich Nov 2007

Relative Pareto Minimizers To Multiobjective Problems: Existence And Optimality Conditions, Truong Q. Bao, Boris S. Mordukhovich

Mathematics Research Reports

In this paper we introduce and study enhanced notions of relative Pareto minimizers to constrained multiobjective problems that are defined via several kinds of relative interiors of ordering cones and occupy intermediate positions between the classical notions of Pareto and weak Pareto efficiency/minimality. Using advanced tools of variational analysis and generalized differentiation, we establish the existence of relative Pareto minimizers to general multiobjective problems under a refined version of the subdifferential Palais-Smale condition for set-valued mappings with values in partially ordered spaces and then derive necessary optimality conditions for these minimizers (as well as for conventional efficient and weak efficient …


Image Reconstruction In Multi-Channel Model Under Gaussian Noise, Veera Holdai, Alexander Korostelev Oct 2007

Image Reconstruction In Multi-Channel Model Under Gaussian Noise, Veera Holdai, Alexander Korostelev

Mathematics Research Reports

The image reconstruction from noisy data is studied. A nonparametric boundary function is estimated from observations in N independent channels in Gaussian white noise. In each channel the image and the background intensities are unknown. They define a non-identifiable nuisance "parameter" that slows down the typical minimax rate of convergence. The large sample asymptotics of the minimax risk is found and an asymptotically optimal estimator for boundary function is suggested.


A Universal Theory Of Pseudocodewords, Nathan Axvig, Emily Price, Eric T. Psota, Deanna Turk, Lance C. Pérez, Judy L. Walker Oct 2007

A Universal Theory Of Pseudocodewords, Nathan Axvig, Emily Price, Eric T. Psota, Deanna Turk, Lance C. Pérez, Judy L. Walker

Department of Mathematics: Faculty Publications

Three types of pseudocodewords for LDPC codes are found in the literature: graph cover pseudocodewords, linear programming pseudocodewords, and computation tree pseudocodewords. In this paper we first review these three notions and known connections between them. We then propose a new decoding rule — universal cover decoding — for LDPC codes. This new decoding rule also has a notion of pseudocodeword attached, and this fourth notion provides a framework in which we can better understand the other three.


Mathematical Analysis Of Pde Systems Which Govern °Uid Structure Interactive Phenomena, George Avalos, Roberto Triggiani Sep 2007

Mathematical Analysis Of Pde Systems Which Govern °Uid Structure Interactive Phenomena, George Avalos, Roberto Triggiani

Department of Mathematics: Faculty Publications

In this paper, we review and comment upon recently derived results for time dependent partial differential equation (PDE) models, which have been used to describe the various fluid-structure interactions which occur in nature. For these fluid-structure PDEs, this survey is particularly focused on the authors' results of (i) semigroup wellposedness, (ii) stability, and (iii) backward uniqueness.


Necessary Conditions For Super Minimizers In Constrained Multiobjective Optimization, Truong Q. Bao, Boris S. Mordukhovich Sep 2007

Necessary Conditions For Super Minimizers In Constrained Multiobjective Optimization, Truong Q. Bao, Boris S. Mordukhovich

Mathematics Research Reports

This paper concerns the study of the so-called super minimizers related to the concept of super efficiency in constrained problems of multiobjective optimization, where cost mappings are generally set-valued. We derive necessary conditions for super minimizers on the base of advanced tools of variational analysis and generalized differentiation that are new in both finite-dimensional and infinite-dimensional settings for problems with single-valued and set-valued objectives.


Time-Dependent Performance Comparison Of Stochastic Optimization Algorithms, David Shilane, Jarno Martikainen, Seppo Ovaska Aug 2007

Time-Dependent Performance Comparison Of Stochastic Optimization Algorithms, David Shilane, Jarno Martikainen, Seppo Ovaska

U.C. Berkeley Division of Biostatistics Working Paper Series

This paper proposes a statistical methodology for comparing the performance of stochastic optimization algorithms that iteratively generate candidate optima. The fundamental data structure of the results of these algorithms is a time series. Algorithmic differences may be assessed through a procedure of statistical sampling and multiple hypothesis testing of time series data. Shilane et al. propose a general framework for performance comparison of stochastic optimization algorithms that result in a single candidate optimum. This project seeks to extend this framework to assess performance in time series data structures. The proposed methodology analyzes empirical data to determine the generation intervals in …


The Barycenter Of The Numerical Range Of A Matrix, Sean A. Broughton, Roger G. Lautzenheiser, Thomas Werne Aug 2007

The Barycenter Of The Numerical Range Of A Matrix, Sean A. Broughton, Roger G. Lautzenheiser, Thomas Werne

Mathematical Sciences Technical Reports (MSTR)

The numerical range W(A) of an nxn matrix A is the totality of the scalar products <Ax,x> as x varies over all unit vectors in Cn The barycenter (center of mass) of the numerical range is defined geometrically as the center of mass of W(A) considered as a planar lamina with variable density and also as a limit of sample averages (<Ax1,x1>+...+<AxN,xN>)/N. Under a wide range the sampling schemes it is shown that the barycenter is the average of the spectrum …


Optimization And Feedback Design Of State-Constrained Parabolic Systems, Boris S. Mordukhovich Aug 2007

Optimization And Feedback Design Of State-Constrained Parabolic Systems, Boris S. Mordukhovich

Mathematics Research Reports

The paper is devoted to optimal control and feedback design of stateconstrained parabolic systems in uncertainty conditions. Problems of this type are among the most challenging and difficult in dynamic optimization for any kind of dynamical systems. We pay the main attention to considering linear multidimensional parabolic'systems with Dirichlet boundary controls and pointwise state constraints, while the methods developed in this study are applicable to other kinds of boundary controls and dynamical systems of the parabolic type. The feedback design problem is formulated in the minimax sense to ensure stabilization of transients within the prescribed diapason and robust stability of …


Decompositions Of Signed-Graphic Matroids, Dan Slilaty, Hongxun Qin Aug 2007

Decompositions Of Signed-Graphic Matroids, Dan Slilaty, Hongxun Qin

Mathematics and Statistics Faculty Publications

We give a decomposition theorem for signed graphs whose frame matroids are binary and a decomposition theorem for signed graphs whose frame matroids are quaternary.


On Backward Stochastic Evolution Equations In Hilbert Space And Optimal Control, Nazim I. Mahmudov, Mark A. Mckibben Aug 2007

On Backward Stochastic Evolution Equations In Hilbert Space And Optimal Control, Nazim I. Mahmudov, Mark A. Mckibben

Mathematics Faculty Publications

In this paper a new result on the existence and uniqueness of the adapted solution to a backward stochastic evolution equation in Hilbert spaces under non Lipschitz condition is established. The applicability of this result is then illustrated in a discussion of some concrete backward stochastic partial differential equation. Furthermore, stochastic maximum principle for optimal control problems of stochastic systems governed by backward stochastic evolution equations in Hilbert spaces is obtained.


Greedy Signal Recovery And Uncertainty Principles, Deanna Needell, Roman Vershynin Jul 2007

Greedy Signal Recovery And Uncertainty Principles, Deanna Needell, Roman Vershynin

CMC Faculty Publications and Research

This paper seeks to bridge the two major algorithmic approaches to sparse signal recovery from an incomplete set of linear measurements – L1-minimization methods and iterative methods (Matching Pursuits). We find a simple regularized version of the Orthogonal Matching Pursuit (ROMP) which has advantages of both approaches: the speed and transparency of OMP and the strong uniform guarantees of the L1-minimization. Our algorithm ROMP reconstructs a sparse signal in a number of iterations linear in the sparsity, and the reconstruction is exact provided the linear measurements satisfy the Uniform Uncertainty Principle. In the case of inaccurate measurements and approximately sparse …


Survival Analysis With Large Dimensional Covariates: An Application In Microarray Studies, David A. Engler, Yi Li Jul 2007

Survival Analysis With Large Dimensional Covariates: An Application In Microarray Studies, David A. Engler, Yi Li

Harvard University Biostatistics Working Paper Series

Use of microarray technology often leads to high-dimensional and low- sample size data settings. Over the past several years, a variety of novel approaches have been proposed for variable selection in this context. However, only a small number of these have been adapted for time-to-event data where censoring is present. Among standard variable selection methods shown both to have good predictive accuracy and to be computationally efficient is the elastic net penalization approach. In this paper, adaptation of the elastic net approach is presented for variable selection both under the Cox proportional hazards model and under an accelerated failure time …


Suboptimality Conditions For Mathematical Programs With Equilibrium Constraints, Truong Q. Bao, Panjak Gupta, Boris S. Mordukhovich Jul 2007

Suboptimality Conditions For Mathematical Programs With Equilibrium Constraints, Truong Q. Bao, Panjak Gupta, Boris S. Mordukhovich

Mathematics Research Reports

In this paper we study mathematical programs with equilibrium constraints (MPECs) described by generalized equations in the extended form 0 is an element of the set G(x,y) + Q(x,y), where both mappings G and Q are set-valued. Such models arise, in particular, from certain optimization-related problems governed by variational inequalities and first-order optimality conditions in nondifferentiable programming. We establish new weak and strong suboptimality conditions for the general MPEC problems under consideration in finite-dimensional and infinite-dimensional spaces that do not assume the existence of optimal solutions. This issue is particularly important for infinite-dimensional optimization problems, where the existence of optimal …


As Flat As Possible, Jon T. Jacobsen Jul 2007

As Flat As Possible, Jon T. Jacobsen

All HMC Faculty Publications and Research

How does one determine a surface which is as flat as possible, such as those created by soap film surfaces? What does it mean to be as flat as possible? In this paper we address this question from two distinct points of view, one local and one global in nature. Continuing with this theme, we put a temporal twist on the question and ask how to evolve a surface so as to flatten it as efficiently as possible. This elementary discussion provides a platform to introduce a wide range of advanced topics in partial differential equations and helps students …


Simultaneous Confidence Intervals Based On The Percentile Bootstrap Approach, Micha Mandel, Rebecca A. Betensky Jun 2007

Simultaneous Confidence Intervals Based On The Percentile Bootstrap Approach, Micha Mandel, Rebecca A. Betensky

Harvard University Biostatistics Working Paper Series

No abstract provided.


Distributed Reproducible Research Using Cached Computations, Roger Peng, Sandrah P. Eckel Jun 2007

Distributed Reproducible Research Using Cached Computations, Roger Peng, Sandrah P. Eckel

Johns Hopkins University, Dept. of Biostatistics Working Papers

The ability to make scientific findings reproducible is increasingly important in areas where substantive results are the product of complex statistical computations. Reproducibility can allow others to verify the published findings and conduct alternate analyses of the same data. A question that arises naturally is how can one conduct and distribute reproducible research? This question is relevant from the point of view of both the authors who want to make their research reproducible and readers who want to reproduce relevant findings reported in the scientific literature. We present a framework in which reproducible research can be conducted and distributed via …


Nonlinear Dynamics In Combinatorial Games: Renormalizing Chomp, Eric J. Friedman, Adam S. Landsberg Jun 2007

Nonlinear Dynamics In Combinatorial Games: Renormalizing Chomp, Eric J. Friedman, Adam S. Landsberg

WM Keck Science Faculty Papers

We develop a new approach to combinatorial games that reveals connections between such games and some of the central ideas of nonlinear dynamics: scaling behaviors, complex dynamics and chaos, universality, and aggregation processes. We take as our model system the combinatorial game Chomp, which is one of the simplest in a class of "unsolved" combinatorial games that includes Chess, Checkers, and Go. We discover that the game possesses an underlying geometric structure that "grows" (reminiscent of crystal growth), and show how this growth can be analyzed using a renormalization procedure adapted from physics. In effect, this methodology allows one to …


Numerical Simulation Of Waves And Fronts In Inhomogeneous Solids, A. Berezovski, M. Berezovski, J. Engelbrecht, G. A. Maugin Jun 2007

Numerical Simulation Of Waves And Fronts In Inhomogeneous Solids, A. Berezovski, M. Berezovski, J. Engelbrecht, G. A. Maugin

Publications

Dynamic response of inhomogeneous materials exhibits new effects, which often do not exist in homogeneous media. It is quite natural that most of studies of wave and front propagation in inhomogeneous materials are associated with numerical simulations. To develop a numerical algorithm and to perform the numerical simulations of moving fronts we need to formulate a kinetic law of progress relating the driving force and the velocity of the discontinuity. The velocity of discontinuity is determined by means of the non-equilibrium jump relations at the front. The obtained numerical method generalizes the wave-propagation algorithm to the case of moving discontinuities …


Trigonometry Without Sines And Geometry Without Angles, Phillip Lestmann Jun 2007

Trigonometry Without Sines And Geometry Without Angles, Phillip Lestmann

ACMS Conference Proceedings 2007

In his book, Divine Proportions, N. J. Wildberger advocates for a "rational" trigonometry by substituting the squares of the common trigonometric ratios for those ratios themselves. This presentation examines and critiques the claims of the book by evaluating its presented methods.


Six Ways, Yea Seven, That Scripture Is Integral To Our Science And Math Classes, Sean Bird Jun 2007

Six Ways, Yea Seven, That Scripture Is Integral To Our Science And Math Classes, Sean Bird

ACMS Conference Proceedings 2007

This paper looks at the ways the Bible informs mathematics and its role in guiding our stewardship of God’s creation.


Counting Tulips: Three Combinatorial Proofs, Eric Gossett Jun 2007

Counting Tulips: Three Combinatorial Proofs, Eric Gossett

ACMS Conference Proceedings 2007

A gardener has r ≥ 1 red tulips and b ≥ 1 blue tulips, each in its own pot. She plans to plant them in a line along the edge of her driveway. In how many visually distinguishable ways can she arrange them?


Rules And Insights: Connecting The Mathematical And Linguistic Abilities Of C.S. Lewis, Kim Jongerius Jun 2007

Rules And Insights: Connecting The Mathematical And Linguistic Abilities Of C.S. Lewis, Kim Jongerius

ACMS Conference Proceedings 2007

While most biographical works on C.S. Lewis give passing reference to Lewis' problems with elementary mathematics, few have made an attempt at diagnosing the difficulty or exploring its impact on his writing. A careful study of family correspondence, however, makes it clear that his learning difficulties were not with mathematics alone and suggests connections between attitudes toward and abilities in both mathematics and language. This paper will make these connections clear and will illustrate their ties to Lewis' effective mathematical references.


The Beautiful And Sublime In Mathematics, Paul Zwier Jun 2007

The Beautiful And Sublime In Mathematics, Paul Zwier

ACMS Conference Proceedings 2007

A précis of Paul Zwier's talk presented at the meetings of the ACMS Conference at Messiah College on June 1, 2007.


Connection-Oriented Computer Science Education, Kim Kihlstrom Jun 2007

Connection-Oriented Computer Science Education, Kim Kihlstrom

ACMS Conference Proceedings 2007

Computers play an important role in every area of our society and are integral in every academic discipline. Today's computer science students need a background that will prepare them for the expanding range of computing opportunities. The opportunities for computer professionals are varied and increasing in diversity. However, undergraduate computer science programs tend to be narrowly focused on programming and related technical skills. Female students in particular tend to be highly interested in exploring connections between computer science and other fields.

How can we leverage these observations at a liberal arts college, where interdisciplinary connections are highly desirable, and where …