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

Physical Sciences and Mathematics Commons

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

2015

Series

PDF

Mathematics

Institution
Keyword
Publication

Articles 1 - 30 of 618

Full-Text Articles in Physical Sciences and Mathematics

The Choice Of Prior Distribution For A Covariance Matrix In Multivariate Meta-Analysis: A Simulation Study, Sandra M. Hurtado Rua, Madhu Mazumdar, Robert L. Strawderman Dec 2015

The Choice Of Prior Distribution For A Covariance Matrix In Multivariate Meta-Analysis: A Simulation Study, Sandra M. Hurtado Rua, Madhu Mazumdar, Robert L. Strawderman

Mathematics and Statistics Faculty Publications

Bayesian meta-analysis is an increasingly important component of clinical research, with multivariate meta-analysis a promising tool for studies with multiple endpoints. Model assumptions, including the choice of priors, are crucial aspects of multivariate Bayesian meta-analysis (MBMA) models. In a given model, two different prior distributions can lead to different inferences about a particular parameter. A simulation study was performed in which the impact of families of prior distributions for the covariance matrix of a multivariate normal random effects MBMA model was analyzed. Inferences about effect sizes were not particularly sensitive to prior choice, but the related covariance estimates were. A …


The Stationary Phase Method For Real Analytic Geometry, Domenico Napoletani, Daniele C. Struppa Dec 2015

The Stationary Phase Method For Real Analytic Geometry, Domenico Napoletani, Daniele C. Struppa

Mathematics, Physics, and Computer Science Faculty Articles and Research

We prove that the existence of isolated solutions of systems of equations of analytical functions on compact real domains in Rp, is equivalent to the convergence of the phase of a suitable complex valued integral I(h) for h→∞. As an application, we then use this result to prove that the problem of establishing the irrationality of the value of an analytic function F(x) at a point x0 can be rephrased in terms of a similar phase convergence.


Concurrent Kleene Algebra With Tests And Branching Automata, Peter Jipsen, M. Andrew Moshier Dec 2015

Concurrent Kleene Algebra With Tests And Branching Automata, Peter Jipsen, M. Andrew Moshier

Mathematics, Physics, and Computer Science Faculty Articles and Research

We introduce concurrent Kleene algebra with tests (CKAT) as a combination of Kleene algebra with tests (KAT) of Kozen and Smith with concurrent Kleene algebras (CKA), introduced by Hoare, Möller, Struth and Wehrman. CKAT provides a relatively simple algebraic model for reasoning about semantics of concurrent programs. We generalize guarded strings to guarded series-parallel strings , or gsp-strings, to give a concrete language model for CKAT. Combining nondeterministic guarded automata of Kozen with branching automata of Lodaya and Weil one obtains a model for processing gsp-strings in parallel. To ensure that the model satisfies the weak exchange law (x‖y)(z‖w)≤(xz)‖(yw) of …


Unique Pseudo-Expectations For C∗-Inclusions, David R. Pitts, Vrej Zarikian Dec 2015

Unique Pseudo-Expectations For C∗-Inclusions, David R. Pitts, Vrej Zarikian

Department of Mathematics: Faculty Publications

Given an inclusion D⊆C of unital C ∗ -algebras (with common unit), a unital completely positive linear map Φ of C into the injective envelope I(D) of D which extends the inclusion of D into I(D) is a pseudo-expectation. Pseudo-expectations are generalizations of conditional expectations, but with the advantage that they always exist. The set PsExp(C,D) of all pseudo-expectations is a convex set, and when D is Abelian, we prove a Krein–Milman type theorem showing that PsExp(C,D) can be recovered from its set of extreme points. In general, PsExp(C,D) is not a singleton. However, there are large and natural classes …


The Varieties Of Indispensability Arguments, Marco Panza, Andrea Sereni Dec 2015

The Varieties Of Indispensability Arguments, Marco Panza, Andrea Sereni

MPP Published Research

The indispensability argument (IA) comes in many different versions that all reduce to a general valid schema. Providing a sound IA amounts to providing a full interpretation of the schema according to which all its premises are true. Hence, arguing whether IA is sound results in wondering whether the schema admits such an interpretation. We discuss in full details all the parameters on which the specification of the general schema may depend. In doing this, we consider how different versions of IA can be obtained, also through different specifications of the notion of indispensability. We then distinguish between schematic and …


Geometric Auxetics, Ciprian Borcea, Ileana Streinu Dec 2015

Geometric Auxetics, Ciprian Borcea, Ileana Streinu

Computer Science: Faculty Publications

We formulate a mathematical theory of auxetic behavior based on one-parameter deformations of periodic frameworks. Our approach is purely geometric, relies on the evolution of the periodicity lattice and works in any dimension. We demonstrate its usefulness by predicting or recognizing, without experiment, computer simulations or numerical approximations, the auxetic capabilities of several well-known structures available in the literature. We propose new principles of auxetic design and rely on the stronger notion of expansive behavior to provide an infinite supply of planar auxetic mechanisms and several new three-dimensional structures.


Optimizing A Game Of Chinese Checkers, Nicholas Fonseca Dec 2015

Optimizing A Game Of Chinese Checkers, Nicholas Fonseca

Honors Program Theses and Projects

Chinese Checkers is a multi-player strategy game in which game play can become surprising complex as the game progresses. In spite of this game's complexity, questions involving games with multiple players have received little research attention. This paper considers the three player case and discusses how to describe short games. By utilizing these tendencies for short games, a heuristic function can be defined which associates a player's possible move with a heuristic value. These heuristic values guide a search algorithm which searches through all the possible moves made in a game. To guide this discussion for three player games, the …


Speedups And Orbit Equivalence Of Finite Extensions Of Ergodic Zᵈ-Actions, Aimee S.A. Johnson, D. M. Mcclendon Dec 2015

Speedups And Orbit Equivalence Of Finite Extensions Of Ergodic Zᵈ-Actions, Aimee S.A. Johnson, D. M. Mcclendon

Mathematics & Statistics Faculty Works

We classify n-point extensions of ergodic Zᵈ-actions up to relative orbit equivalence and establish criteria under which one n-point extension of an ergodic Zᵈ-action can be sped up to be relatively isomorphic to an n-point extension of another ergodic Zᵈ-action. Both results are characterized in terms of an algebraic object associated to each n-point extension which is a conjugacy class of subgroups of the symmetric group on n elements.


A Critical Analysis Of Random Response Techniques, Emanuel Zanzerkia Dec 2015

A Critical Analysis Of Random Response Techniques, Emanuel Zanzerkia

Honors Program Theses and Projects

In order to understand and make informed decision on sensitive topics such as domestic violence and drug use, interviews have been used to collect data. However it is difficult to assess how truthful respondents are since they may not feel at ease revealing the truth to an interviewer. Surveyors of sensitive issues face the problem that respondents may be reluctant to answer truthfully since the respondent may feel pressured socially or may fear the repercussions of their truthful answer. Processes known as random response techniques have been introduced to allow interviewers the ability to extract information they need for a …


Method Of Lines Transpose: An Efficient A-Stable Solver For Wave Propagation, Matthew Causley, Andrew Christlieb, Eric Wolf Dec 2015

Method Of Lines Transpose: An Efficient A-Stable Solver For Wave Propagation, Matthew Causley, Andrew Christlieb, Eric Wolf

Mathematics Publications

Building upon recent results obtained in [7,8,9], we describe an efficient second order, A-stable scheme for solving the wave equation, based on the method of lines transpose (MOLT), and the resulting semi-discrete (i.e. continuous in space) boundary value problem. In [7], A-stable schemes of high order were derived, and in [9] a high order, fast O(N) spatial solver was derived, which is matrix-free and is based on dimensional-splitting. In this work, are interested in building a wave solver, and our main concern is the development of boundary conditions. We demonstrate all desired boundary conditions for a wave solver, including outflow …


The Definitions Of Three-Dimensional Landmarks On The Human Face: An Interdisciplinary View, Stanislav Katina, Kathryn Mcneil, Ashraf Ayoub, Brendan Guilfoyle, Balvinder Khambay, Paul Siebert, Federico Sukno, Mario Rojas, Liberty Vittert, John Waddington, Paul F. Whelan, Adrian W. Bowman Dec 2015

The Definitions Of Three-Dimensional Landmarks On The Human Face: An Interdisciplinary View, Stanislav Katina, Kathryn Mcneil, Ashraf Ayoub, Brendan Guilfoyle, Balvinder Khambay, Paul Siebert, Federico Sukno, Mario Rojas, Liberty Vittert, John Waddington, Paul F. Whelan, Adrian W. Bowman

Publications

The analysis of shape is a key part of anatomical research and in the large majority of cases landmarks provide a standard starting point. However, while the technology of image capture has developed rapidly and in particular three-dimensional imaging is widely available, the definitions of anatomical landmarks remain rooted in their two-dimensional origins. In the important case of the human face, standard definitions often require careful orientation of the subject. This paper considers the definitions of facial landmarks from an interdisciplinary perspective, including biological and clinical motivations, issues associated with imaging and subsequent analysis, and the mathematical definition of surface …


Augmenting The Immersed Boundary Method With Radial Basis Functions (Rbfs) For The Modeling Of Platelets In Hemodynamic Flows, Varun Shankar, Grady B. Wright, Robert M. Kirby, Aaron L. Fogelson Dec 2015

Augmenting The Immersed Boundary Method With Radial Basis Functions (Rbfs) For The Modeling Of Platelets In Hemodynamic Flows, Varun Shankar, Grady B. Wright, Robert M. Kirby, Aaron L. Fogelson

Mathematics Faculty Publications and Presentations

We present a new computational method by extending the Immersed Boundary (IB) method with a geometric model based on parametric Radial Basis Function (RBF) interpolation of the Lagrangian structures. Our specific motivation is the modeling of platelets in hemodynamic flows, though we anticipate that our method will be useful in other applications involving surface elasticity. The efficacy of our new RBF-IB method is shown through a series of numerical experiments. Specifically, we test the convergence of our method and compare our method with the traditional IB method in terms of computational cost, maximum stable time-step size and volume loss. We …


Direct Phenotypic Screening In Mice: Identification Of Individual, Novel Antinociceptive Compounds From A Library Of 734 821 Pyrrolidine Bis-Piperazines, Richard A. Houghten, Michelle L. Ganno, Jay P. Mclaughlin, Colette T. Dooley, Shainnel O. Eans Torrey Pines Institute For Molecular Studies, Radleigh Santos, Travis Lavoi, Adel Nefzi, Greg Welmaker, Marc A. Giulianotti, Lawrence Toll Dec 2015

Direct Phenotypic Screening In Mice: Identification Of Individual, Novel Antinociceptive Compounds From A Library Of 734 821 Pyrrolidine Bis-Piperazines, Richard A. Houghten, Michelle L. Ganno, Jay P. Mclaughlin, Colette T. Dooley, Shainnel O. Eans Torrey Pines Institute For Molecular Studies, Radleigh Santos, Travis Lavoi, Adel Nefzi, Greg Welmaker, Marc A. Giulianotti, Lawrence Toll

Mathematics Faculty Articles

The hypothesis in the current study is that the simultaneous direct in vivo testing of thousands to millions of systematically arranged mixture-based libraries will facilitate the identification of enhanced individual compounds. Individual compounds identified from such libraries may have increased specificity and decreased side effects early in the discovery phase. Testing began by screening ten diverse scaffolds as single mixtures (ranging from 17 340 to 4 879 681 compounds) for analgesia directly in the mouse tail withdrawal model. The “all X” mixture representing the library TPI-1954 was found to produce significant antinociception and lacked respiratory depression and hyperlocomotor effects using …


Finite Groups In Which Pronomality And 𝔉-Pronormality Coincide, Adolfo Ballester-Bolinches, James C. Beidleman, Arnold D. Feldman, Matthew F. Ragland Dec 2015

Finite Groups In Which Pronomality And 𝔉-Pronormality Coincide, Adolfo Ballester-Bolinches, James C. Beidleman, Arnold D. Feldman, Matthew F. Ragland

Mathematics Faculty Publications

For a formation 𝔉, a subgroup U of a finite group G is said to be 𝔉-pronormal in G if for each gG, there exists x ∈ ⟨U, Ug𝔉 such that Ux = Ug. If 𝔉 contains 𝔑, the formation of nilpotent groups, then every 𝔉-pronormal subgroup is pronormal and, in fact, 𝔑-pronormality is just classical pronormality. The main aim of this paper is to study classes of finite soluble groups in which pronormality and 𝔉-pronormality coincide.


Efficient High-Order Methods For Solving Fractional Differential Equations Of Order Α ∈ (0, 1) Using Fast Convolution And Applications In Wave Propagation, Matthew F. Causley, Peter G. Petropoulus Dec 2015

Efficient High-Order Methods For Solving Fractional Differential Equations Of Order Α ∈ (0, 1) Using Fast Convolution And Applications In Wave Propagation, Matthew F. Causley, Peter G. Petropoulus

Mathematics Publications

In this work we develop a means to rapidly and accurately compute the Caputo fractional derivative of a function, using fast convolution. The key element to this approach is the compression of the fractional kernel into a sum of M decaying exponentials, where M is minimal. Specifically, after N time steps we find M= O (log N) leading to a scheme with O (N log N) complexity. We illustrate our method by solving the fractional differential equation representing the Kelvin-Voigt model of viscoelasticity, and the partial differential equations that model the propagation of electromagnetic pulses in the Cole-Cole model of …


Hypercube Unfoldings That Tile R3 And R2, Giovanna Diaz, Joseph O'Rourke Dec 2015

Hypercube Unfoldings That Tile R3 And R2, Giovanna Diaz, Joseph O'Rourke

Computer Science: Faculty Publications

We show that the hypercube has a face-unfolding that tiles space, and that unfolding has an edge-unfolding that tiles the plane. So the hypercube is a "dimension-descending tiler." We also show that the hypercube cross unfolding made famous by Dali tiles space, but we leave open the question of whether or not it has an edge-unfolding that tiles the plane.


Comparison Theorems And Asymptotic Behavior Of Solutions Of Discrete Fractional Equations, Baoguo Jia, Lynn Erbe, Allan Peterson Dec 2015

Comparison Theorems And Asymptotic Behavior Of Solutions Of Discrete Fractional Equations, Baoguo Jia, Lynn Erbe, Allan Peterson

Department of Mathematics: Faculty Publications

Consider the following n-th order nabla and delta fractional difference equations

rn r (a)x(t) = c(t)x(t), t 2 Na+1, x(a) > 0.

and

Va+v-1x(t) = c(t)x(t + v - 1), t 2 Na, x(a + n - 1) > 0

We establish comparison theorems by which we compare the solutions x(t) of (*) and (**) with the solutions of the equations rn r(a)x(t) = bx(t) and Dn a+v-1x(t) = bx(t + v -1), respectively, where b is a constant. We obtain four asymptotic results, one of them extends the recent result [F. M. Atici, P. W. Eloe, Rocky Mountain J. Math. 41(2011), …


Stochastic Optimal Control For Online Seller Under Reputational Mechanisms, Milan Bradonij', Matthew Causley, Albert Cohen Dec 2015

Stochastic Optimal Control For Online Seller Under Reputational Mechanisms, Milan Bradonij', Matthew Causley, Albert Cohen

Mathematics Publications

In this work we propose and analyze a model which addresses the pulsing behavior of sellers in an online auction (store). This pulsing behavior is observed when sellers switch between advertising and processing states. We assert that a seller switches her state in order to maximize her profit, and further that this switch can be identified through the seller’s reputation. We show that for each seller there is an optimal reputation, i.e., the reputation at which the seller should switch her state in order to maximize her total profit. We design a stochastic behavioral model for an online seller, which …


The Minimum And Other Free Energies For Non-Linear Materials With Memory., John Murrough Golden Dec 2015

The Minimum And Other Free Energies For Non-Linear Materials With Memory., John Murrough Golden

Articles

Expressions are obtained for free energies of materials with a certain type of non-linear constitutive relation. In particular, the minimum and related free energies are considered in some detail. Minimal states are defined for these materials, and it is shown that any free energy yielding a linear constitutive equation that is a functional of the minimal state has a counterpart in the non-linear case which is also a minimal state functional in this more general context. These results are explored for simple examples, including discrete spectrum materials.


Quasi-Platonic Psl2(Q)-Actions On Closed Riemann Surfaces, Sean A. Broughton Dec 2015

Quasi-Platonic Psl2(Q)-Actions On Closed Riemann Surfaces, Sean A. Broughton

Mathematical Sciences Technical Reports (MSTR)

This paper is the first of two papers whose combined goal is to explore the dessins d'enfant and symmetries of quasi-platonic actions of PSL2(q). A quasi-platonic action of a group G on a closed Riemann S surface is a conformal action for which S/G is a sphere and S->S/G is branched over {0, 1,infinity}. The unit interval in S/G may be lifted to a dessin d'enfant D, an embedded bipartite graph in S. The dessin forms the edges and vertices of a tiling on S by dihedrally symmetric polygons, generalizing the idea of a …


Canonoid And Poissonoid Transformations, Symmetries And Bihamiltonian Structures, Giovanni Rastelli, Manuele Santoprete Dec 2015

Canonoid And Poissonoid Transformations, Symmetries And Bihamiltonian Structures, Giovanni Rastelli, Manuele Santoprete

Mathematics Faculty Publications

We give a characterization of linear canonoid transformations on symplectic manifolds and we use it to generate biHamiltonian structures for some mechanical systems. Utilizing this characterization we also study the behavior of the harmonic oscillator under canonoid transformations. We present a description of canonoid transformations due to E.T. Whittaker, and we show that it leads, in a natural way, to the modern, coordinate-independent definition of canonoid transformations. We also generalize canonoid transformations to Poisson manifolds by introducing Poissonoid transformations. We give examples of such transformations for Euler’s equations of the rigid body (on so*(3) and so*(4)) and for an integrable …


Discrete Grüss Type Inequality On Fractional Calculus, Elvan Akin, Serkan Asliyuce, Ayse Feza Guvenilir, Billur Kaymakcalan Dec 2015

Discrete Grüss Type Inequality On Fractional Calculus, Elvan Akin, Serkan Asliyuce, Ayse Feza Guvenilir, Billur Kaymakcalan

Mathematics and Statistics Faculty Research & Creative Works

We give a discrete Grüss type inequality on fractional calculus.


Solving Equations (And Systems Of Equations) Under Uncertainty: How Different Practical Problems Lead To Different Mathematical And Computational Formulations, Vladik Kreinovich Dec 2015

Solving Equations (And Systems Of Equations) Under Uncertainty: How Different Practical Problems Lead To Different Mathematical And Computational Formulations, Vladik Kreinovich

Departmental Technical Reports (CS)

Many practical problems are naturally reduced to solving systems of equations. There are many efficient techniques for solving well-defined systems of equations, i.e., systems in which we know the exact values of all the parameters and coefficients. In practice, we usually know these parameters and coefficients with some uncertainty -- uncertainty usually described by an appropriate granule: interval, fuzzy set, rough set, etc. Many techniques have been developed for solving systems of equations under such granular uncertainty. Sometimes, however, practitioners use previously successful techniques and get inadequate results. In this -- mostly pedagogical -- paper, we explain that to obtain …


Interval Methods For Data Fitting Under Uncertainty: A Probabilistic Treatment, Vladik Kreinovich, Sergey P. Shary Dec 2015

Interval Methods For Data Fitting Under Uncertainty: A Probabilistic Treatment, Vladik Kreinovich, Sergey P. Shary

Departmental Technical Reports (CS)

How to estimate parameters from observations subject to errors and uncertainty? Very often, the measurement errors are random quantities that can be adequately described by the probability theory. When we know that the measurement errors are normally distributed with zero mean, then the (asymptotically optimal) Maximum Likelihood Method leads to the popular least squares estimates. In many situations, however, we do not know the shape of the error distribution, we only know that the measurement errors are located on a certain interval. Then the maximum entropy approach leads to a uniform distribution on this interval, and the Maximum Likelihood Method …


Why It Is Healthy To Regularly Challenge Authority: An Algorithmic Explanation, Olga Kosheleva, Vladik Kreinovich Dec 2015

Why It Is Healthy To Regularly Challenge Authority: An Algorithmic Explanation, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

One way to make group decisions is to select the best decision maker(s) in the group as the authority, and to follow his or her decisions. At first glance, it seems that if the selected authority is indeed the best decision maker, it is beneficial for everyone to obey his or her authority. However, history shows that in many cases, challenges to the authority (even to the authority of the best decision maker) were beneficial to the group. In this paper, we provide an algorithmic explanation for this phenomenon. The main idea behind this explanation is that most practical general …


From Tertullian's Credo Quia Absurdum To Bohr's Crazy Theories: A Rational Explanation Of A Seemingly Irrational Idea, Olga Kosheleva, Vladik Kreinovich Dec 2015

From Tertullian's Credo Quia Absurdum To Bohr's Crazy Theories: A Rational Explanation Of A Seemingly Irrational Idea, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

At first glance, Tertullian's idea -- that absurdity of a statement makes it more believable -- sounds irrational, maybe appropriate for theology but definitely not for science. However, somewhat surprisingly, a similar idea was successfully used by the Nobelist Niels Bohr in theoretical physics -- an epitome of rationality in science. In this paper, we show that this Tertullian-Bohr idea actually has a simple rational explanation. Specifically, if previous attempts to construct a theory which is consistent with what is perceived as common sense were unsuccessful, this implies that a true theory much contradict common sense -- and thus, the …


Towards Selecting The Best Abstraction For A Patrolling Game, Anjon Basak, Chris Kiekintveld, Vladik Kreinovich Dec 2015

Towards Selecting The Best Abstraction For A Patrolling Game, Anjon Basak, Chris Kiekintveld, Vladik Kreinovich

Departmental Technical Reports (CS)

When the number of possible strategies is large, it is not computationally feasible to compute the optimal strategy for the original game. Instead, we select our strategy based on an approximate approximate description of the original game. The quality of the resulting strategy depends on which approximation we select. In this paper, on an example of a simple game, we show how to find the optimal approximation, the approximation whose use results in the best strategy.


How To Predict Nesting Sites?, Stephen Escarzaga, Craig Tweedie, Vladik Kreinovich Dec 2015

How To Predict Nesting Sites?, Stephen Escarzaga, Craig Tweedie, Vladik Kreinovich

Departmental Technical Reports (CS)

How to predict nesting sites? Usually, all we know is the past nesting sites, and the fact that the birds select a site which is optimal for them (in some reasonable sense), but we do not know the exact objective function describing this optimality. In this paper, we propose a way to make predictions in such a situation.


Simplest Innovations Are, Empirically, The Most Promising: An Explanation, Olga Kosheleva, Vladik Kreinovich Dec 2015

Simplest Innovations Are, Empirically, The Most Promising: An Explanation, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

Many examples show that the simplest innovation are the most promising. In this paper, we provide a theoretical explanation for this empirical observation.


Comparing The Strength Of Diagonally Non-Recursive Functions In The Absence Of Σ02 Induction, Francois G. Dorais, Jeffry L. Hirst, Paul Shafer Dec 2015

Comparing The Strength Of Diagonally Non-Recursive Functions In The Absence Of Σ02 Induction, Francois G. Dorais, Jeffry L. Hirst, Paul Shafer

Dartmouth Scholarship

We prove that the statement "there is a k such that for every f there is a k-bounded diagonally non-recursive function relative to f" does not imply weak K\"onig's lemma over RCA0+BΣ02. This answers a question posed by Simpson. A recursion-theoretic consequence is that the classic fact that every k-bounded diagonally non-recursive function computes a 2-bounded diagonally non-recursive function may fail in the absence of IΣ02.