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

Physical Sciences and Mathematics Commons

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

Mathematics

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 21121 - 21150 of 27475

Full-Text Articles in Physical Sciences and Mathematics

Forecasting Police Calls During Peak Times For The City Of Cleveland, John P. Holcomb, Norean Radke Sharpe Apr 2006

Forecasting Police Calls During Peak Times For The City Of Cleveland, John P. Holcomb, Norean Radke Sharpe

Mathematics and Statistics Faculty Publications

For a period of time, professors from the Cleveland State University worked closely with the City of Cleveland Police Department. This partnership resulted in access to police records cataloging all emergency 911 calls for the city since 1995. Here, we describe forecasting approaches that can be used by the Police Department based on hourly 911 calls in the years 2001 to 2003 throughout the city during peak call time: the third shift during summer months. This case study is appropriate for class discussions in advanced courses in statistics to explore the application of time series analysis techniques.


New Developments Of The Deformation Method, Jie Liu Apr 2006

New Developments Of The Deformation Method, Jie Liu

Mathematics Dissertations

New developments of deformation method for grid generation are presented in this work. Theorems for three different cases and different methods for implementing deformation method are presented. One of the new developments is a 3D multi-block moving grid method. In this version, a Poisson equation is solved by finite difference method to get the vector field for moving grid. Special treatment applies to the common boundary of different blocks. Another new development is a numerical method for reconstructing a given differentiable transformations by solving a system of div-curl equation directly formed from each point of the graph. The determinacy and …


Correction To "Dependence, Dispersiveness, And Multivariate Hazard Rate Ordering", Baha-Eldin Khaledi, Subhash C. Kochar Apr 2006

Correction To "Dependence, Dispersiveness, And Multivariate Hazard Rate Ordering", Baha-Eldin Khaledi, Subhash C. Kochar

Mathematics and Statistics Faculty Publications and Presentations

In the article published last year, three inequalities should be in the opposite direction.


Homogeneous Products Of Conjugacy Classes, Edith Adan-Bante Apr 2006

Homogeneous Products Of Conjugacy Classes, Edith Adan-Bante

Faculty Publications

Let G be a finite group and aG. Let a G ={g −1 a g | gG} be the conjugacy class of a in G. Assume that a G and b G are conjugacy classes of G with the property that C G (a)=C G (b). Then a G b G is a conjugacy class if and only if [a,G]=[b,G]=[ab,G] and [ab,G] is a normal subgroup of G.


A Beautiful Mind, Christopher D. Goff Apr 2006

A Beautiful Mind, Christopher D. Goff

College of the Pacific Faculty Presentations

No abstract provided.


An Implicit Level Set Model For Firespread, Pallop Huabsomboon Apr 2006

An Implicit Level Set Model For Firespread, Pallop Huabsomboon

Mathematics & Statistics Theses & Dissertations

The level set method is a mathematical and computational, technique for tracking a moving interface over time. It can naturally handle topological changes such as merging or breaking interfaces. Intrinsic geometric properties of the interface, such as curvature and normal direction, are easily determined from the level set function &phis;. There are many applications of the level set method, including kinetic crystal growth, epitaxial growth of thin films, image restoration, vortex dominated flows, and so forth. Most applications described in the growing literature on the applications of level sets advance the level set equation with explicit time integration. Hence, small …


Hessian Matrix-Free Lagrange-Newton-Krylov-Schur-Schwarz Methods For Elliptic Inverse Problems, Widodo Samyono Apr 2006

Hessian Matrix-Free Lagrange-Newton-Krylov-Schur-Schwarz Methods For Elliptic Inverse Problems, Widodo Samyono

Mathematics & Statistics Theses & Dissertations

This study focuses on the solution of inverse problems for elliptic systems. The inverse problem is constructed as a PDE-constrained optimization, where the cost function is the L2 norm of the difference between the measured data and the predicted state variable, and the constraint is an elliptic PDE. Particular examples of the system considered in this stud, are groundwater flow and radiation transport. The inverse problems are typically ill-posed due to error in measurements of the data. Regularization methods are employed to partially alleviate this problem. The PDE-constrained optimization is formulated as the minimization of a Lagrangian functional, formed …


Secondary Terms In The Number Of Vanishings Of Quadratic Twists Of Elliptic Curve L-Functions, J. Brian Conrey, Atul Pocharel, Michael O. Rubinstein, Mark Watkins Mar 2006

Secondary Terms In The Number Of Vanishings Of Quadratic Twists Of Elliptic Curve L-Functions, J. Brian Conrey, Atul Pocharel, Michael O. Rubinstein, Mark Watkins

Mathematics - All Scholarship

We examine the number of vanishings of quadratic twists of the L-function associated to an elliptic curve. Applying a conjecture for the full asymptotics of the moments of critical L-values we obtain a conjecture for the first two terms in the ratio of the number of vanishings of twists sorted according to arithmetic progressions.


Asymptotic Stability Of A Fluid-Structure Semigroup, George Avalos Mar 2006

Asymptotic Stability Of A Fluid-Structure Semigroup, George Avalos

Department of Mathematics: Faculty Publications

The strong stability problem for a fluid-structure interactive partial differential equation (PDE) is considered. The PDE comprises a coupling of the linearized Stokes equations to the classical system of elasticity, with the coupling occurring on the boundary interface between the fluid and solid media. It is now known that this PDE may be modeled by a $C_{0}$-semigroup of contractions on an appropriate Hilbert space. However, because of the nature of the unbounded coupling between fluid and structure, the resolvent of the semigroup generator will \emph{not} be a compact operator. In consequence, the classical solution to the stability problem, by means …


Influence Of Surface Tension On The Conical Miniscus Of A Magnetic Fluid In The Field Of A Current-Carrying Wire, Thomas John, Dirk Rannacher, Adreas Engel Mar 2006

Influence Of Surface Tension On The Conical Miniscus Of A Magnetic Fluid In The Field Of A Current-Carrying Wire, Thomas John, Dirk Rannacher, Adreas Engel

Mathematics - All Scholarship

We study the influence of surface tension on the shape of the conical miniscus built up by a magnetic fluid surrounding a current-carrying wire. Minimization of the total energy of the system leads to a singular second order boundary value problem for the function zeta(r) describing the axially symmetric shape of the free surface. An appropriate transformation regularizes the problem and allows a straightforward numerical solution. We also study the effects a superimposed second liquid, a nonlinear magnetization law of the magnetic fluid, and the influence of the diameter of the wire on the free surface profile.


Optimization And Equilibrium Problems With Equilibrium Constraints In Infinite-Dimensional Spaces, Boris S. Mordukhovich Mar 2006

Optimization And Equilibrium Problems With Equilibrium Constraints In Infinite-Dimensional Spaces, Boris S. Mordukhovich

Mathematics Research Reports

The paper is devoted to applications of modern variational f).nalysis to the study of constrained optimization and equilibrium problems in infinite-dimensional spaces. We pay a particular attention to the remarkable classes of optimization and equilibrium problems identified as MPECs (mathematical programs with equilibrium constraints) and EPECs (equilibrium problems with equilibrium constraints) treated from the viewpoint of multiobjective optimization. Their underlying feature is that the major constraints are governed by parametric generalized equations/variational conditions in the sense of Robinson. Such problems are intrinsically nonsmooth and can be handled by using an appropriate machinery of generalized differentiation exhibiting a rich/full calculus. The …


Analysis Of Mass Spectrometry Data Using Bayesian Wavelet-Based Functional Mixed Models, Jeffrey S. Morris, Philip J. Brown, Keith A. Baggerly, Kevin R. Coombes Mar 2006

Analysis Of Mass Spectrometry Data Using Bayesian Wavelet-Based Functional Mixed Models, Jeffrey S. Morris, Philip J. Brown, Keith A. Baggerly, Kevin R. Coombes

Jeffrey S. Morris

In this chapter, we demonstrate how to analyze MALDI-TOF/SELDITOF mass spectrometry data using the wavelet-based functional mixed model introduced by Morris and Carroll (2006), which generalizes the linear mixed models to the case of functional data. This approach models each spectrum as a function, and is very general, accommodating a broad class of experimental designs and allowing one to model nonparametric functional effects for various factors, which can be conditions of interest (e.g. cancer/normal) or experimental factors (blocking factors). Inference on these functional effects allows us to identify protein peaks related to various outcomes of interest, including dichotomous outcomes, categorical …


Stability Of The Gyroid Phase In Diblock Copolymers At Strong Segregation, Eric W. Cochran, Carlos J. Garcia-Cervera, Glenn H. Fredrickson Mar 2006

Stability Of The Gyroid Phase In Diblock Copolymers At Strong Segregation, Eric W. Cochran, Carlos J. Garcia-Cervera, Glenn H. Fredrickson

Eric W. Cochran

The gyroid phase in diblock copolymers at strong segregation was stabilized. The intriguing topology of the network structure has inspired a diverse array of potential applications ranging from high-performance separation membranes to photonic crystals. The pressure field enforces incompressibility, while the exchange field is conjugate to the composition pattern in the melt. The Laplacian operator is treated implicitly with a fourth-order backward differentiation formula (BDF4), whereas the source term is discretized explicitly using fourth-order accurate Adams-Bashford.


The Local Gromov–Witten Invariants Of Configurations Of Rational Curves, Dagan Karp, Chiu-Chu Melissa Liu, Marcos Mariño Mar 2006

The Local Gromov–Witten Invariants Of Configurations Of Rational Curves, Dagan Karp, Chiu-Chu Melissa Liu, Marcos Mariño

All HMC Faculty Publications and Research

We compute the local Gromov–Witten invariants of certain configurations of rational curves in a Calabi–Yau threefold. These configurations are connected subcurves of the “minimal trivalent configuration”, which is a particular tree of ℙ1’s with specified formal neighborhood. We show that these local invariants are equal to certain global or ordinary Gromov–Witten invariants of a blowup of ℙ3 at points, and we compute these ordinary invariants using the geometry of the Cremona transform. We also realize the configurations in question as formal toric schemes and compute their formal Gromov–Witten invariants using the mathematical and physical theories of the …


Reflection Of A Wave Off A Surface, Brendan Guilfoyle, Wilhelm Klingenberg Mar 2006

Reflection Of A Wave Off A Surface, Brendan Guilfoyle, Wilhelm Klingenberg

Preprints

Recent advances in twistor theory are applied to geometric optics in R 3 . The general formulae for reflection of a wavefront in a surface are derived and in three special cases explicit descriptions are provided: when the reflecting surface is a plane, when the incoming wave is a plane and when the incoming wave is spherical. In each case particular examples are computed exactly and the results plotted to illustrate the outgoing wavefront.


Asynchronous Random Boolean Network Model With Variable Number Of Parents Based On Elementary Cellular Automata Rule 126, Mihaela Teodora Matache Mar 2006

Asynchronous Random Boolean Network Model With Variable Number Of Parents Based On Elementary Cellular Automata Rule 126, Mihaela Teodora Matache

Mathematics Faculty Publications

A Boolean network with N nodes, each node’s state at time t being determined by a certain number of parent nodes, which can vary from one node to another is considered. This is a generalization of previous results obtained for a constant number of parent nodes, by Matache and Heidel in Asynchronous random Boolean network model based on elementary cellular automata rule 126, Phys. Rev. E 71, 026232, 2005. The nodes, with randomly assigned neighborhoods, are updated based on various asynchronous schemes. The Boolean rule is a generalization of rule 126 of elementary cellular automata, and is assumed to be …


A General Theory Of Almost Convex Functions, S J. Dilworth, Ralph Howard, James W. Roberts Mar 2006

A General Theory Of Almost Convex Functions, S J. Dilworth, Ralph Howard, James W. Roberts

Faculty Publications

No abstract provided.


Application Of Fuzzy State Aggregation And Policy Hill Climbing To Multi-Agent Systems In Stochastic Environments, Dean C. Wardell Mar 2006

Application Of Fuzzy State Aggregation And Policy Hill Climbing To Multi-Agent Systems In Stochastic Environments, Dean C. Wardell

Theses and Dissertations

Reinforcement learning is one of the more attractive machine learning technologies, due to its unsupervised learning structure and ability to continually even as the operating environment changes. Applying this learning to multiple cooperative software agents (a multi-agent system) not only allows each individual agent to learn from its own experience, but also opens up the opportunity for the individual agents to learn from the other agents in the system, thus accelerating the rate of learning. This research presents the novel use of fuzzy state aggregation, as the means of function approximation, combined with the policy hill climbing methods of Win …


Fun With Fractals, Borbala Mazzag Feb 2006

Fun With Fractals, Borbala Mazzag

Borbala Mazzag

No abstract provided.


Some New Methodologies For Pattern Recognition Aided By Self-Organizing Maps., Arijit Laha Dr. Feb 2006

Some New Methodologies For Pattern Recognition Aided By Self-Organizing Maps., Arijit Laha Dr.

Doctoral Theses

In this thesis we develop several techniques for performing different pattern recognition tasks. In particular, the pattern recognition tasks considered here are classification and vector quantization. We propose several methods for designing classifiers and address various issues involved in the task. For vector quantization, we develop a method for image compression with superior psychovisual reproduction quality. We also propose a method for fast codebook search in a vector quantizer. We exploit different properties of Self-organizing Map (SOM) network for developing these methods. Along with SOM, we also use fuzzy sets theory and Dempster-Shafer theory of evidence to design classi- fiers …


Studies On Pairing-Based And Constant Round Dynamic Group Key Agreement., Ratna Dutta Dr. Feb 2006

Studies On Pairing-Based And Constant Round Dynamic Group Key Agreement., Ratna Dutta Dr.

Doctoral Theses

This thesis describes research that I conducted during the course of my Ph.D. study at Indian Statistical Institute (ISI), Kolkata. I hope that this work is of use and will be carried on.I would like to begin by thanking my supervisor, Prof. Rana Barua for his support and endless patience. He has provided me background in Cryptography, Combinatorics and Theory of Automata during the period 2000-2002 of my course work of M.Tech in Computer Science at Indian Statistical Institute. I really appreciate his extraordinary patience in reading my numerous inferior drafts, for listening and analyzing all my ideas, forcing me …


Quantum Stochastic Dilation Of A Class Of Quantum Dynamical Semigroups And Quantum Random Walks., Lingaraj Sahu Dr. Feb 2006

Quantum Stochastic Dilation Of A Class Of Quantum Dynamical Semigroups And Quantum Random Walks., Lingaraj Sahu Dr.

Doctoral Theses

No abstract provided.


Duan's Fixed Point Theorem: Proof And Generalization, Martin Arkowitz Feb 2006

Duan's Fixed Point Theorem: Proof And Generalization, Martin Arkowitz

Dartmouth Scholarship

Let X be an H-space of the homotopy type of a connected, finite CW-complex, f : X→X any map and pk : X→X the kth power map. Duan proved that pkf : X → X has a fixed point if k ≥ 2. We give a new, short and elementary proof of this. We then use rational homotopy to generalize to spaces X whose rational cohomology is the tensor product of an exterior algebra on odd dimensional generators with the tensor product of truncated polynomial algebras on even dimensional generators. The role of the power map …


Rational Realizations Of The Minimum Rank Of A Sign Pattern Matrix, Selcuk Koyuncu Feb 2006

Rational Realizations Of The Minimum Rank Of A Sign Pattern Matrix, Selcuk Koyuncu

Mathematics Theses

A sign pattern matrix is a matrix whose entries are from the set {+,-,0}. The minimum rank of a sign pattern matrix A is the minimum of the rank of the real matrices whose entries have signs equal to the corresponding entries of A. It is conjectured that the minimum rank of every sign pattern matrix can be realized by a rational matrix. The equivalence of this conjecture to several seemingly unrelated statements are established. For some special cases, such as when A is entrywise nonzero, or the minimum rank of A is at most 2, or the minimum rank …


Periodic Prime Knots And Toplogically Transitive Flows On 3-Manifolds, William Basener, Michael C. Sullivan Feb 2006

Periodic Prime Knots And Toplogically Transitive Flows On 3-Manifolds, William Basener, Michael C. Sullivan

Articles and Preprints

Suppose that φ is a nonsingular (fixed point free) C1 flow on a smooth closed 3-dimensional manifold M with H2(M)=0. Suppose that φ has a dense orbit. We show that there exists an open dense set NM such that any knotted periodic orbit which intersects N is a nontrivial prime knot.


The Linear Complexity Of A Graph, David L. Neel, Michael E. Orrison Jr. Feb 2006

The Linear Complexity Of A Graph, David L. Neel, Michael E. Orrison Jr.

All HMC Faculty Publications and Research

The linear complexity of a matrix is a measure of the number of additions, subtractions, and scalar multiplications required to multiply that matrix and an arbitrary vector. In this paper, we define the linear complexity of a graph to be the linear complexity of any one of its associated adjacency matrices. We then compute or give upper bounds for the linear complexity of several classes of graphs.


Automated Geometric Theorem Proving: Wu's Method, Joran Elias Feb 2006

Automated Geometric Theorem Proving: Wu's Method, Joran Elias

The Mathematics Enthusiast

Wu’s Method for proving geometric theorems is well known. We investigate the underlying algorithms involved, including the concepts of pseudodivision, Ritt’s Principle and Ritt’s Decomposition algorithm. A simple implementation for these algorithms in Maple is presented, which we then use to prove a few simple geometric theorems to illustrate the method.


Meet The Authors Feb 2006

Meet The Authors

The Mathematics Enthusiast

No abstract provided.


Tme Volume 3, Number 1 Feb 2006

Tme Volume 3, Number 1

The Mathematics Enthusiast

No abstract provided.


Editorial: Growth & Change, Bharath Sriraman Feb 2006

Editorial: Growth & Change, Bharath Sriraman

The Mathematics Enthusiast

No abstract provided.