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

Applied Mathematics Commons™

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

7,976 Full-Text Articles 10,592 Authors 5,155,092 Downloads 244 Institutions

All Articles in Applied Mathematics

Faceted Search

7,976 full-text articles. Page 285 of 296.

Variables Affecting Crime Rate, Jaime Zeigler 2011 University of Northern Iowa

Variables Affecting Crime Rate, Jaime Zeigler

Honors Program Theses

The Federal Bureau of Investigation releases data about crime statistics. They publish the raw data and provide factors that influence the crime rate. They provide the general public with a few variables that they deemed most influential, but do not provide the statistical analysis to support. After performing a statistical analysis, I support or disprove their claims. Another way to question the validity of regression is comparing the current regression to a previous regression performed two years ago by myself with the same variables from the same source. An additional aspect that this paper explores the history of factors affecting …


Extremal Problems For Independent Set Enumeration, Jonathan Cutler, A. J. Radcliffe 2011 Montclair State University

Extremal Problems For Independent Set Enumeration, Jonathan Cutler, A. J. Radcliffe

Department of Mathematics: Faculty Publications

The study of the number of independent sets in a graph has a rich history. Recently, Kahn proved that disjoint unions of Kr,r’s have the maximum number of independent sets amongst r-regular bipartite graphs. Zhao extended this to all r-regular graphs. If we instead restrict the class of graphs to those on a fixed number of vertices and edges, then the Kruskal-Katona theorem implies that the graph with the maximum number of independent sets is the lex graph, where edges form an initial segment of the lexicographic ordering. In this paper, we study three related questions. Firstly, we …


An Entropy Proof Of The Kahn-Lovasz Theorem, Jonathan Cutler, A. J. Radcliffe 2011 Montclair State University

An Entropy Proof Of The Kahn-Lovasz Theorem, Jonathan Cutler, A. J. Radcliffe

Department of Mathematics: Faculty Publications

Bregman [2], gave a best possible upper bound for the number of perfect matchings in a balanced bipartite graph in terms of its degree sequence. Recently Kahn and Lovasz [8] extended Bregman’s theorem to general graphs. In this paper, we use entropy methods to give a new proof of the Kahn-Lovasz theorem. Our methods build on Radhakrishnan’s [9] use of entropy to prove Bregman’s theorem.


Short-Term Facilitation May Stabilize Parametric Working Memory Trace, Vladimir Itskov, David Hansel, Misha Tsodyks 2011 University of Nebraska - Lincoln

Short-Term Facilitation May Stabilize Parametric Working Memory Trace, Vladimir Itskov, David Hansel, Misha Tsodyks

Department of Mathematics: Faculty Publications

Networks with continuous set of attractors are considered to be a paradigmatic model for parametric working memory (WM), but require fine tuning of connections and are thus structurally unstable. Here we analyzed the network with ring attractor, where connections are not perfectly tuned and the activity state therefore drifts in the absence of the stabilizing stimulus. We derive an analytical expression for the drift dynamics and conclude that the network cannot function as WM for a period of several seconds, a typical delay time in monkey memory experiments. We propose that short-term synaptic facilitation in recurrent connections significantly improves the …


Algebraic Structures Using Super Interval Matrices, Florentin Smarandache, W.B. Vasantha Kandasamy 2011 University of New Mexico

Algebraic Structures Using Super Interval Matrices, Florentin Smarandache, W.B. Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

The advantage of using super interval matrices is that one can build only one vector space using m × n interval matrices, but in case of super interval matrices we can have several such spaces depending on the partition on the interval matrix.

This book has seven chapters. Chapter one is introductory in nature, just introducing the super interval matrices or interval super matrices. In chapter two essential operations on super interval matrices are defined. Further in this chapter algebraic structures are defined on these super interval matrices using these operation. Using these super interval matrices semirings and semivector spaces …


Studies In Sampling Techniques And Time Series Analysis, Florentin Smarandache, Rajesh Singh 2011 University of New Mexico

Studies In Sampling Techniques And Time Series Analysis, Florentin Smarandache, Rajesh Singh

Branch Mathematics and Statistics Faculty and Staff Publications

This book has been designed for students and researchers who are working in the field of time series analysis and estimation in finite population. There are papers by Rajesh Singh, Florentin Smarandache, Shweta Maurya, Ashish K. Singh, Manoj Kr. Chaudhary, V. K. Singh, Mukesh Kumar and Sachin Malik. First chapter deals with the problem of time series analysis and the rest of four chapters deal with the problems of estimation in finite population. The book is divided in five chapters as follows: Chapter 1. Water pollution is a major global problem. In this chapter, time series analysis is carried out …


Algebraic Structures Using Natural Class Of Intervals, Florentin Smarandache, W.B. Vasantha Kandasamy 2011 University of New Mexico

Algebraic Structures Using Natural Class Of Intervals, Florentin Smarandache, W.B. Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

Authors in this book introduce a new class of intervals called the natural class of intervals, also known as the special class of intervals or as natural intervals. These intervals are built using increasing intervals, decreasing intervals and degenerate intervals. We say an interval [a, b] is an increasing interval if a < b for any a, b in the field of reals R. An interval [a, b] is a decreasing interval if a > b and the interval [a, b] is a degenerate interval if a = b for a, b in the field of reals R. The natural class of intervals consists of the collection of increasing intervals, decreasing intervals and the degenerate intervals. Clearly R is contained in the natural …


Study Of Natural Class Of Intervals Using (–∞,∞) And (∞, –∞), Florentin Smarandache, W.B. Vasantha Kandasamy, D. Datta, H.S. Kushwaha, P.A. Jadhav 2011 University of New Mexico

Study Of Natural Class Of Intervals Using (–∞,∞) And (∞, –∞), Florentin Smarandache, W.B. Vasantha Kandasamy, D. Datta, H.S. Kushwaha, P.A. Jadhav

Branch Mathematics and Statistics Faculty and Staff Publications

In this book the authors study the properties of natural class of intervals built using (–∞, ∞) and (∞, –∞). These natural class of intervals behave like the reals R, as far as the operations of addition, multiplication, subtraction and division are concerned. Using these natural class of intervals we build interval row matrices, interval column matrices and m × n interval matrices. Several properties about them are defined and studied. Also all arithmetic operations are performed on them in the usual way. The authors by defining so have made it easier for operations like multiplication, addition, finding determinant and …


Dsm Super Vector Space Of Refined Labels, Florentin Smarandache, W.B. Vasantha Kandasamy 2011 University of New Mexico

Dsm Super Vector Space Of Refined Labels, Florentin Smarandache, W.B. Vasantha Kandasamy

Branch Mathematics and Statistics Faculty and Staff Publications

In this book authors for the first time introduce the notion of supermatrices of refined labels. Authors prove super row matrix of refined labels form a group under addition. However super row matrix of refined labels do not form a group under product; it only forms a semigroup under multiplication. In this book super column matrix of refined labels and m × n matrix of refined labels are introduced and studied. We mainly study this to introduce to super vector space of refined labels using matrices. We in this book introduce the notion of semifield of refined labels using which …


Physical Process Models As Regularization Constraints On Geophysical Imaging Problems, Rachel Grotheer 2011 Clemson University

Physical Process Models As Regularization Constraints On Geophysical Imaging Problems, Rachel Grotheer

All Theses

Obtaining accurate images of solute plumes in the subsurface is important to understand site-specific subsurface flow and transport processes. Since image reconstruction is an inverse problem, its ill-posed nature makes obtaining an accurate, high-resolution image difficult. Further, current geophysical methods for plume imaging do not take into account models of the specific process being targeted for imaging.
The main objective of the research is to find a suitable basis that gives a sparse representation of the plume. In future work, we seek to use this basis as a physical constraint during the inversion so as to increase accuracy in imaging. …


On Constrained Optimization Schemes For Joint Inversion Of Geophysical Datasets, Uram Anibal Sosa Aguirre 2011 University of Texas at El Paso

On Constrained Optimization Schemes For Joint Inversion Of Geophysical Datasets, Uram Anibal Sosa Aguirre

Open Access Theses & Dissertations

In the area of geological sciences, there exist several experimental techniques used to advance in the understanding of the Earth. We implement a joint inversion least-squares (LSQ) algorithm to characterize one dimensional Earth's structure by using seismic shear wave velocities as a model parameter. We use two geophysical datasets sensitive to shear velocities, namely Receiver Function and Surface Wave dispersion velocity observations, with a choice of an optimization method: Truncated Singular Value Decomposition (TSVD) or Primal-Dual Interior-Point (PDIP). The TSVD and the PDIP methods solve a regularized unconstrained and a constrained minimization problem, respectively. Both techniques include bounds into the …


Software Development For A Three-Dimensional Gravity Inversion And Application To Study Of The Border Ranges Fault System, South-Central Alaska, Rolando Cardenas 2011 University of Texas at El Paso

Software Development For A Three-Dimensional Gravity Inversion And Application To Study Of The Border Ranges Fault System, South-Central Alaska, Rolando Cardenas

Open Access Theses & Dissertations

The Border Ranges Fault System (BRFS) bounds the Cook Inlet and Susitna Basins, an important petroleum province within south-central Alaska. A primary goal in the research is to test several plausible models of structure along the Border Ranges Fault System using a novel three-dimensional inversion utilizing gravity and magnetic data, constrained with other geophysical, borehole and surface geological information. This research involves the development of inversion modeling software using a Borland C++ compiler as part of the Rapid Application Development (RAD) Studio. The novel inversion approach directly models known geology, and "a priori" uncertainties on the geologic model to allow …


Digital Image Processing Based On Sparse Representation And Convex Programming, Carlos Andres Ramirez 2011 University of Texas at El Paso

Digital Image Processing Based On Sparse Representation And Convex Programming, Carlos Andres Ramirez

Open Access Theses & Dissertations

Sparse representation models have been of central interest in recent years due to important achievements in computational harmonic analysis, such as wavelet transformations, and the most recent sampling theory, compressed sensing. Numerous applications based on sparse models have been studied in the last decade leading to promising results. These applications include areas in seismology, image processing, wireless sensor networks, computed tomography and magnetic resonance imaging just to mention a few.

In this work, we propose to extend such applications in the area of image processing, particularly for the image segmentation problem, and examine algorithms involved in sparse modeling from both …


A Sparse Representation Technique For Classification Problems, Reinaldo Sanchez Arias 2011 University of Texas at El Paso

A Sparse Representation Technique For Classification Problems, Reinaldo Sanchez Arias

Open Access Theses & Dissertations

In pattern recognition and machine learning, a classification problem refers to finding an algorithm for assigning a given input data into one of several categories. Many natural signals are sparse or compressible in the sense that they have short representations when expressed in a suitable basis. Motivated by the recent successful development of algorithms for sparse signal recovery, we apply the selective nature of sparse representation to perform classification. In order to find such sparse linear representation, we implement an l1-minimization algorithm. This methodology overcomes the lack of robustness with respect to outliers. In contrast to other classification …


Capturing Elements In Matroid Minors, Deborah Chun 2011 Louisiana State University and Agricultural and Mechanical College

Capturing Elements In Matroid Minors, Deborah Chun

LSU Doctoral Dissertations

In this dissertation, we begin with an introduction to a matroid as the natural generalization of independence arising in three different fields of mathematics. In the first chapter, we develop graph theory and matroid theory terminology necessary to the topic of this dissertation. In Chapter 2 and Chapter 3, we prove two main results. A result of Ding, Oporowski, Oxley, and Vertigan reveals that a large 3-connected matroid M has unavoidable structure. For every n exceeding two, there is an integer f(n) so that if |E(M)| exceeds f(n), then M has a minor isomorphic to the rank-n wheel or whirl, …


Guided Modes And Resonant Transmission In Periodic Structures, Hairui Tu 2011 Louisiana State University and Agricultural and Mechanical College

Guided Modes And Resonant Transmission In Periodic Structures, Hairui Tu

LSU Doctoral Dissertations

We analyze resonant scattering phenomena of scalar fields in periodic slab and pillar structures that are related to the interaction between guided modes of the structure and plane waves emanating from the exterior. The mechanism for the resonance is the nonrobust nature of the guided modes with respect to perturbations of the wavenumber, which reflects the fact that the frequency of the mode is embedded in the continuous spectrum of the pseudo-periodic Helmholtz equation. We extend previous complex perturbation analysis of transmission anomalies to structures whose coefficients are only required to be measurable and bounded from above and below, and …


Symmetric Spaces, Se-Jong Kim 2011 Louisiana State University and Agricultural and Mechanical College

Symmetric Spaces, Se-Jong Kim

LSU Doctoral Dissertations

We first review the basic theory of a general class of symmetric spaces with canonical reflections, midpoints, and displacement groups. We introduce a notion of gyrogroups established by A. A. Ungar and define gyrovector spaces slightly different from Ungar's setting. We see the categorical equivalence of symmetric spaces and gyrovector spaces with respect to their corresponding operations. In a smooth manifold with spray we define weighted means using the exponential map and develop the Lie-Trotter formula with respect to midpoint operation. Via the idea that we associate a spray with a Loos symmetric space, we construct an analytic scalar multiplication …


Excluded-Minor Characterization Of Apex-Outerplanar Graphs, Stanislaw Dziobiak 2011 Louisiana State University and Agricultural and Mechanical College

Excluded-Minor Characterization Of Apex-Outerplanar Graphs, Stanislaw Dziobiak

LSU Doctoral Dissertations

It is well known that the class of outerplanar graphs is minor-closed and can be characterized by two excluded minors: K_4 and K_{2,3}. The class of graphs that contain a vertex whose removal leaves an outerplanar graph is also minor-closed. We provide the complete list of 57 excluded minors for this class.


Improving Math Instruction In Schools That Serve The Poor, John, L. Jr. Sims 2011 Louisiana State University and Agricultural and Mechanical College

Improving Math Instruction In Schools That Serve The Poor, John, L. Jr. Sims

LSU Master's Theses

Public alarm concerning how well U.S. schools are performing in mathematics compared to other developed nations is increasing. Reports of inadequate teaching, poor curriculum design, and low performance on standardized test have been fueled by the media. These issues in American mathematics classrooms are far compounded in schools that serve the poorest in America. When comparing mathematical proficiency rates of U.S. schools with other countries, schools with less than 25% free and reduced lunch score competitively with counterparts in other countries. In contrast, schools with rates of free and reduced lunch higher than 50% score dismally in comparison. Conditions such …


Paley-Wiener Theorems With Respect To The Spectral Parameter, Susanna Dann 2011 Louisiana State University and Agricultural and Mechanical College

Paley-Wiener Theorems With Respect To The Spectral Parameter, Susanna Dann

LSU Doctoral Dissertations

One of the important questions related to any integral transform on a manifold M or on a homogeneous space G/K is the description of the image of a given space of functions. If M=G/K, where (G,K) is a Gelfand pair, then harmonic analysis on M is closely related to the representations of G and the direct integral decomposition of L^2(M) into irreducible representations of G. R^n can be realized as the quotient R^n=E(n)/SO(n), where E(n) is the orientation preserving Euclidean motion group. The pair (E(n), SO(n)) is a Gelfand pair. Hence this realization of R^n comes with its own natural …


Digital Commons powered by bepress