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

Applied Mathematics Commons

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

7,920 Full-Text Articles 10,495 Authors 4,986,009 Downloads 243 Institutions

All Articles in Applied Mathematics

Faceted Search

7,920 full-text articles. Page 282 of 294.

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 …


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

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

Branch Mathematics and Statistics Faculty and Staff Publications

The study of DSm linear algebra of refined labels have been done by Florentin Smarandache, Jean Dezert, and Xinde Li.

In this book the authors introduce the notion of DSm vector spaces of refined labels. The reader is requested to refer the paper as the basic concepts are taken from that paper [35]. This book has six chapters. The first one is introductory in nature just giving only the needed concepts to make this book a self contained one. Chapter two introduces the notion of refined plane of labels, the three dimensional space of refined labels DSm vector spaces. Clearly …


Acceleration Techniques By Post-Processing Of Numerical Solutions Of The Hammerstein Equation, Khomsan Neamprem, Hideaki Kaneko 2011 Old Dominion University

Acceleration Techniques By Post-Processing Of Numerical Solutions Of The Hammerstein Equation, Khomsan Neamprem, Hideaki Kaneko

Mathematics & Statistics Faculty Publications

No abstract provided.


Mesoscopic Methods In Engineering And Science, Chuguang Zheng, Jiding Lu, Zhaoli Guo, Li-Shi Luo, Manfred Krafczyk 2011 Old Dominion University

Mesoscopic Methods In Engineering And Science, Chuguang Zheng, Jiding Lu, Zhaoli Guo, Li-Shi Luo, Manfred Krafczyk

Mathematics & Statistics Faculty Publications

Matter, conceptually classified into fluids and solids, can be completely described by the microscopic physics of its constituent atoms or molecules. However, for most engineering applications a macroscopic or continuum description has usually been sufficient, because of the large disparity between the spatial and temporal scales relevant to these applications and the scales of the underlying molecular dynamics. In this case, the microscopic physics merely determines material properties such as the viscosity of a fluid or the elastic constants of a solid. These material properties cannot be derived within the macroscopic framework, but the qualitative nature of the macroscopic dynamics …


Dea With A Perfect Object: Analytical Solutions, Alexander Vaninsky 2011 CUNY Hostos Community College

Dea With A Perfect Object: Analytical Solutions, Alexander Vaninsky

Publications and Research

For the main DEA models, adding a Perfect Object—that is, a virtual object that has the smallest inputs and greatest outputs—to a collection of actual objects permits obtaining solutions analytically. The paper derives formulas for the solutions and demonstrates that computations with them comprise simple operations with ratios of inputs and outputs while avoiding the use of linear programming (LP) algorithms. A numerical example illustrates the utility of the approach.


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 …


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 …


Nonlinear Behaviour Of Sea Surface Waves Based On Low-Gradient Phase-Only Scattering Effects, Jonathan Blackledge, Eugene Coyle, Derek Kearney 2011 Technological University Dublin

Nonlinear Behaviour Of Sea Surface Waves Based On Low-Gradient Phase-Only Scattering Effects, Jonathan Blackledge, Eugene Coyle, Derek Kearney

Conference papers

Nonlinear sea waves generated by the wind, including freak waves, are considered to be phenomena that can be modelled using the nonlinear (cubic) Schrodinger equation, for example. However, there is a problem with this approach which is that sea surface waves, driven by wind speeds of varying strength, must be considered to be composed of two distinct types, namely, linear waves and nonlinear waves. In this paper, we consider a different approach to modelling ‘nonlinear’ waves that is based on a solution to the linear wave equation under a low-gradient, phase-only condition. This approach is entirely compatible with the fluid …


Analytical And Experimental Investigations Of Ships Impact Interaction With One-Sided Barrier, Ihab M. Grace 2011 Wayne State University

Analytical And Experimental Investigations Of Ships Impact Interaction With One-Sided Barrier, Ihab M. Grace

Wayne State University Dissertations

This study deals with impact interaction of ships with one-sided ice barrier during roll dynamics. An analytical model of ship roll motion interacting with ice is developed based on Zhuravlev and Ivanov non-smooth coordinate transformations. These transformations have the advantage of converting the vibro-impact oscillator into an oscillator without barriers such that the corresponding equation of motion does not contain any impact term. Such approaches, however, account for the energy loss at impact times in different ways. The present work, in particular, brings to the attention the fact that the impact dynamics may have qualitatively different response characteristics to different …


Uniform L1 Behavior Of A Time Discretization Method For A Volterra Integrodifferential Equation With Convex Kernel; Stability, Charles B. Harris, Richard D. Noren 2011 Old Dominion University

Uniform L1 Behavior Of A Time Discretization Method For A Volterra Integrodifferential Equation With Convex Kernel; Stability, Charles B. Harris, Richard D. Noren

Mathematics & Statistics Faculty Publications

We study stability of a numerical method in which the backward Euler method is combined with order one convolution quadrature for approximating the integral term of the linear Volterra integrodifferential equation u'(t) + ∫0 β (t - s)Au(s) ds = 0, t ≥ 0, u(0) = u0, which arises in the theory of linear viscoelasticity. Here A is a positive self-adjoint densely defined linear operator in a real Hilbert space, and β (t) is locally integrable, nonnegative, nonincreasing, convex, and -β'(t) is convex. We establish stability of the method under these hypotheses on β(t). Thus, …


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 …


Neural Spike Renormalization. Part Ii — Multiversal Chaos, Bo Deng 2011 University of Nebraska - Lincoln

Neural Spike Renormalization. Part Ii — Multiversal Chaos, Bo Deng

Department of Mathematics: Faculty Publications

Reported here for the first time is a chaotic infinite-dimensional system which contains infinitely many copies of every deterministic and stochastic dynamical system of all finite dimensions. The system is the renormalizing operator of spike maps that was used in a previous paper to show that the first natural number 1 is a universal constant in the generation of metastable and plastic spike-bursts of a class of circuit models of neurons.


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 …


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.


Specification Of Structural Viewer And Analytical Tool (Jecp/Svat), Xingzhong Li 2011 University of Nebraska-Lincoln

Specification Of Structural Viewer And Analytical Tool (Jecp/Svat), Xingzhong Li

Nebraska Center for Materials and Nanoscience: Faculty Publications

Java Electron Crystallography Package (JECP) is a collection of programs for crystallography and electron diffraction analysis. The package is designed and written by Dr. X.Z. Li. The software can be used as a research tool as well as a teaching aid. The need of a structural viewer/an analytical tool, using the same input data format as the JECP and proJECT software, becomes obvious with the growth of the JECP and proJECT programs and users. There exist many programs for structural design and/or display in various levels developed by individual, research group or software company. Some of them are expensive software …


A Dynamic System Model Of Biogeography-Based Optimization, Daniel J. Simon 2011 Cleveland State University

A Dynamic System Model Of Biogeography-Based Optimization, Daniel J. Simon

Electrical and Computer Engineering Faculty Publications

We derive a dynamic system model for biogeography-based optimization (BBO) that is asymptotically exact as the population size approaches infinity. The states of the dynamic system are equal to the proportion of each individual in the population; therefore, the dimension of the dynamic system is equal to the search space cardinality of the optimization problem. The dynamic system model allows us to derive the proportion of each individual in the population for a given optimization problem using theory rather than simulation. The results of the dynamic system model are more precise than simulation, especially for individuals that are very unlikely …


Modular And Graceful Edge Colorings Of Graphs, Ryan Jones 2011 Western Michigan University

Modular And Graceful Edge Colorings Of Graphs, Ryan Jones

Dissertations

Abstract attached as separate file.


Estimating The Efficacy Of Mild Heating Processes Taking Into Account Microbial Non-Linearities: A Case Study On The Thermisation Of A Food Simulant, Vasilis Valdramidis, Brijesh Tiwari, Patrick J. Cullen, Alain Kondjoyan, Jan Van Impe 2011 Technological University Dublin

Estimating The Efficacy Of Mild Heating Processes Taking Into Account Microbial Non-Linearities: A Case Study On The Thermisation Of A Food Simulant, Vasilis Valdramidis, Brijesh Tiwari, Patrick J. Cullen, Alain Kondjoyan, Jan Van Impe

Articles

Traditional and novel approaches for the calculation of the heat treatment efficiency are compared in this work. The Mild Heat value (MH-value), an alternative approach to the commonly used sterilisation, pasteurisation and cook value (F, P, C–value), is calculated to estimate the efficiency of a mild heat process. MH-value is the time needed to achieve a predefined microbial reduction at a reference temperature and a known thermal resistant constant, z, for log-linear or specific types of non log-linear microbial inactivation kinetics. An illustrative example is given in which microbial inactivation data of Listeria innocua CLIP 20-595 are used for estimating …


Some Classes Of Graphs That Are Nearly Cycle-Free, Lisa Warshauer 2011 Louisiana State University and Agricultural and Mechanical College

Some Classes Of Graphs That Are Nearly Cycle-Free, Lisa Warshauer

LSU Doctoral Dissertations

A graph is almost series-parallel if there is some edge that one can add to the graph and then contract out to leave a series-parallel graph, that is, a graph with no K4-minor. In this dissertation, we find the full list of excluded minors for the class of graphs that are almost series-parallel. We also obtain the corresponding result for the class of graphs such that uncontracting an edge and then deleting the uncontracted edge produces a series-parallel graph.

A notable feature of a 3-connected almost series-parallel graph is that it has two vertices whose removal leaves a …


Digital Commons powered by bepress