Other Applied Mathematics Commons^™

A Cauchy Problem For Some Local Fractional Abstract Differential Equation With Fractal Conditions, Yang Xiaojun, Zhong Weiping, Gao Feng

Xiao-Jun Yang

Fractional calculus is an important method for mathematics and engineering [1-24]. In this paper, we review the existence and uniqueness of solutions to the Cauchy problem for the local fractional differential equation with fractal conditions \[ D^\alpha x\left( t \right)=f\left( {t,x\left( t \right)} \right),t\in \left[ {0,T} \right], x\left( {t_0 } \right)=x_0 , \] where $0<\alpha \le 1$ in a generalized Banach space. We use some new tools from Local Fractional Functional Analysis [25, 26] to obtain the results.

Mechaniczny Rozdział Faz Proj., Wojciech M. Budzianowski

Wojciech Budzianowski

No abstract provided.

Challenges And Prospects Of Processes Utilising Carbonic Anhydrase For Co2 Separation, Patrycja Szeligiewicz, Wojciech M. Budzianowski

Wojciech Budzianowski

This article provides an analysis of processes for separation CO2 by using carbonic anhydrase enzyme with particular emphasis on reactive-membrane solutions. Three available processes are characterised. Main challenges and prospects are given. It is found that in view of numerous challenges practical applications of these processes will be difficult in near future. Further research is therefore needed for improving existing processes through finding methods for eliminating their main drawbacks such as short lifetime of carbonic anhydrase or low resistance of reactive membrane systems to impurities contained in flue gases from power plants.

Near-Optimal Compressed Sensing Guarantees For Anisotropic And Isotropic Total Variation Minimization, Deanna Needell, Rachel Ward

CMC Faculty Publications and Research

Consider the problem of reconstructing a multidimensional signal from partial information, as in the setting of compressed sensing. Without any additional assumptions, this problem is ill-posed. However, for signals such as natural images or movies, the minimal total variation estimate consistent with the measurements often produces a good approximation to the underlying signal, even if the number of measurements is far smaller than the ambient dimensionality. Recently, guarantees for two-dimensional images were established. This paper extends these theoretical results to signals of arbitrary dimension and to both the anisotropic and isotropic total variation problems. To be precise, we show that …

Invisibility: A Mathematical Perspective, Austin G. Gomez

CMC Senior Theses

The concept of rendering an object invisible, once considered unfathomable, can now be deemed achievable using artificial metamaterials. The ability for these advanced structures to refract waves in the negative direction has sparked creativity for future applications. Manipulating electromagnetic waves of all frequencies around an object requires precise and unique parameters, which are calculated from various mathemat- ical laws and equations. We explore the possible interpretations of these parameters and how they are implemented towards the construction of a suitable metamaterial. If carried out correctly, the wave will exit the metamaterial exhibiting the same behavior as when it had entered. …

Clustering Methods And Their Applications To Adolescent Healthcare Data, Morgan Mayer-Jochimsen

Scripps Senior Theses

Clustering is a mathematical method of data analysis which identifies trends in data by efficiently separating data into a specified number of clusters so is incredibly useful and widely applicable for questions of interrelatedness of data. Two methods of clustering are considered here. K-means clustering defines clusters in relation to the centroid, or center, of a cluster. Spectral clustering establishes connections between all of the data points to be clustered, then eliminates those connections that link dissimilar points. This is represented as an eigenvector problem where the solution is given by the eigenvectors of the Normalized Graph Laplacian. Spectral clustering …

Applications Of Fourier Analysis To Audio Signal Processing: An Investigation Of Chord Detection Algorithms, Nathan Lenssen

CMC Senior Theses

The discrete Fourier transform has become an essential tool in the analysis of digital signals. Applications have become widespread since the discovery of the Fast Fourier Transform and the rise of personal computers. The field of digital signal processing is an exciting intersection of mathematics, statistics, and electrical engineering. In this study we aim to gain understanding of the mathematics behind algorithms that can extract chord information from recorded music. We investigate basic music theory, introduce and derive the discrete Fourier transform, and apply Fourier analysis to audio files to extract spectral data.

The Lismullin Enclosure:A Designed Ritual Space, Frank Prendergast

Book/Book Chapter

The discovery in 2007 of a prehistoric post-built enclosure at Lismullin, Co. Meath, during archaeological investigations in advance of the construction of the M3 motorway is, arguably, the most significant Irish archaeological discovery of recent times. This appendix summarises a commissioned specialist report on the spatial and archaeoastronomical features of the enclosure.

Determination Of Kinetic Parameters From The Thermogravimetric Data Set Of Biomass Samples, Karol Postawa, Wojciech M. Budzianowski

Wojciech Budzianowski

This article describes methods of the determination of kinetic parameters from the thermogravimetric data set of biomass samples. It presents the methodology of the research, description of the needed equipment, and the method of analysis of thermogravimetric data. It describes both methodology of obtaining quantitative data such as kinetic parameters as well as of obtaining qualitative data like the composition of biomass. The study is focused mainly on plant biomass because it is easy in harvesting and preparation. Methodology is shown on the sample containing corn stover which is subsequently pyrolysed. The investigated sample show the kinetic of first order …

Application Of Homotopy Analysis Transform Method To Fractional Biological Population Model, Habibolla Latifizadeh

H. L. Zadeh

No abstract provided.

Interactive Visualization Of New Jersey Gang Data, Manfred Minimair

Manfred Minimair

This article describes the design and functionality of an online visualization software of data from a survey on gang activities in New Jersey municipalities. The visualization enables the user to explore the distribution of numbers of gang sets across different municipalities in New Jersey, and study certain derived information. The purpose of the visualization is to make data from the gang survey easily and universally accessible through some engaging visual display, to facilitate seamless exploration of the data, and to thus foster discourse on the data among experts and the general public. In order to achieve these goals, bubble charts, …

Blow-Up Of Solutions To The Generalized Inviscid Proudman-Johnson Equation, Alejandro Sarria

University of New Orleans Theses and Dissertations

The generalized inviscid Proudman-Johnson equation serves as a model for n-dimensional incompressible Euler flow, gas dynamics, high-frequency waves in shallow waters, and orientation of waves in a massive director field of a nematic liquid crystal. Furthermore, the equation also serves as a tool for studying the role that the natural fluid processes of convection and stretching play in the formation of spontaneous singularities, or of their absence.

In this work, we study blow-up, and blow-up properties, in solutions to the generalized, inviscid Proudman-Johnson equation endowed with periodic or Dirichlet boundary conditions. More particularly,regularity of solutions in an Lp setting will …

Novel Constructions Of Improved Square Complex Orthogonal Designs For Eight Transmit Antennas, Le Chung Tran, Tadeusz Wysocki, Jennifer Seberry, Alfred Mertins, Sarah Adams

Dr Le Chung Tran

Constructions of square, maximum rate complex orthogonal space-time block codes (CO STBCs) are well known, however codes constructed via the known methods include numerous zeros, which impede their practical implementation. By modifying the Williamson and Wallis-Whiteman arrays to apply to complex matrices, we propose two methods of construction of square, order-4n CO STBCs from square, order-n codes which satisfy certain properties. Applying the proposed methods, we construct square, maximum rate, order-8 CO STBCs with no zeros, such that the transmitted symbols are equally dispersed through transmit antennas. Those codes, referred to as the improved square CO STBCs, have the advantages …

Investigation Of Nonlinear Problems Of Heat Conduction In Tapered Cooling Fins Via Symbolic Programming, Hooman Fatoorehchi, Hossein Abolghasemi

Applications and Applied Mathematics: An International Journal (AAM)

In this paper, symbolic programming is employed to handle a mathematical model representing conduction in heat dissipating fins with triangular profiles. As the first part of the analysis, the Modified Adomian Decomposition Method (MADM) is converted into a piece of computer code in MATLAB to seek solution for the mentioned problem with constant thermal conductivity (a linear problem). The results show that the proposed solution converges to the analytical solution rapidly. Afterwards, the code is extended to calculate Adomian polynomials and implemented to the similar, but more generalized, problem involving a power law dependence of thermal conductivity on temperature. The …

On The Numerical Solution Of Linear Fredholm-Volterra İntegro Differential Difference Equations With Piecewise İntervals, Mustafa Gülsu, Yalçın Öztürk

Applications and Applied Mathematics: An International Journal (AAM)

The numerical solution of a mixed linear integro delay differential-difference equation with piecewise interval is presented using the Chebyshev collocation method. The aim of this article is to present an efficient numerical procedure for solving a mixed linear integro delay differential difference equations. Our method depends mainly on a Chebyshev expansion approach. This method transforms a mixed linear integro delay differential-difference equations and the given conditions into a matrix equation which corresponds to a system of linear algebraic equation. The reliability and efficiency of the proposed scheme are demonstrated by some numerical experiments and performed on the computer algebraic system …

Incomplete Market Models Of Carbon Emissions Markets, Walid Mnif

Electronic Thesis and Dissertation Repository

New regulatory frameworks have been developed with the aim of decreasing global greenhouse gas emissions over both short and long time periods. Incentives must be established to encourage the transition to a clean energy economy. Emissions taxes represent a "price" incentive for this transition, but economists agree this approach is suboptimal. Instead, the "quantity" instrument provided by cap-and-trade markets are superior from an economic point of view. This thesis focuses on the cap-and-trade instrument. Carbon emissions markets have recently been implemented in different countries. We summarize the state of world cap-and-trade schemes. We also provide a literature review of existing …

Convex Combinations Of Quadrant Dependent Copulas, Martin Egozcue, Luis Fuentes García, Wing Wong, Ricardas Zitikis

Martin Egozcue

It is well known that quadrant dependent (QD) random variables are also quadrant dependent in expectation (QDE). Recent literature has offered examples rigorously establishing the fact that there are QDE random variables which are not QD. The examples are based on convex combinations of specially chosen QD copulas: one negatively QD and another positively QD. In this paper we establish general results that determine when convex combinations of arbitrary QD copulas give rise to negatively or positively QD/QDE copulas. In addition to being an interesting mathematical exercise, the established results are helpful when modeling insurance and financial portfolios.

A Doubling Technique For The Power Method Transformations, Mohan D. Pant, Todd C. Headrick

Mohan Dev Pant

Power method polynomials are used for simulating non-normal distributions with specified product moments or L-moments. The power method is capable of producing distributions with extreme values of skew (L-skew) and kurtosis (L-kurtosis). However, these distributions can be extremely peaked and thus not representative of real-world data. To obviate this problem, two families of distributions are introduced based on a doubling technique with symmetric standard normal and logistic power method distributions. The primary focus of the methodology is in the context of L-moment theory. As such, L-moment based systems of equations are derived for simulating univariate and multivariate non-normal distributions with …

An L-Moment-Based Analog For The Schmeiser-Deutsch Class Of Distributions, Todd C. Headrick, Mohan D. Pant

Mohan Dev Pant

This paper characterizes the conventional moment-based Schmeiser-Deutsch (S-D) class of distributions through the method of L-moments. The system can be used in a variety of settings such as simulation or modeling various processes. A procedure is also described for simulating S-D distributions with specified L-moments and L-correlations. The Monte Carlo results presented in this study indicate that the estimates of L-skew, L-kurtosis, and L-correlation associated with the S-D class of distributions are substantially superior to their corresponding conventional product-moment estimators in terms of relative bias—most notably when sample sizes are small.

Further Applications Of Higher-Order Markov Chains And Developments In Regime-Switching Models, Xiaojing Xi

Electronic Thesis and Dissertation Repository

We consider a higher-order hidden Markov models (HMM), also called weak HMM (WHMM), to capture the regime-switching and memory properties of financial time series. A technique of transforming a WHMM into a regular HMM is employed, which in turn enables the development of recursive filters. With the use of the change of reference probability measure methodology and EM algorithm, a dynamic estimation of model parameters is obtained. Several applications and extensions were investigated. WHMM is adopted in describing the evolution of asset prices and its performance is examined through a forecasting analysis. This is extended to the case when the …

The Minimum Span Of L(2,1)-Labelings Of Certain Generalized Petersen Graphs, Sarah Adams, Jonathan Cass, Matthew Tesch, Denise Troxell, Cody Wheeland

Sarah Spence Adams

In the classical channel assignment problem, transmitters that are sufficiently close together are assigned transmission frequencies that differ by prescribed amounts, with the goal of minimizing the span of frequencies required. This problem can be modeled through the use of an L(2,1)-labeling, which is a function f from the vertex set of a graph G to the non-negative integers such that |f(x)–f(y)|≥ 2 if xand y are adjacent vertices and |f(x)–f(y)|≥1 if xand y are at distance two. The goal is to …

On An Orthogonal Space-Time-Polarization Block Code, Beata Wysocki, Tadeusz Wysocki, Sarah Adams

Sarah Spence Adams

Over the past several years, diversity methods such as space, time, and polarization diversity have been successfully implemented in wireless communications systems. Orthogonal space-time block codes efficiently combine space and time diversity, and they have been studied in detail. Polarization diversity has also been studied, however it is usually considered in a simple concatenation with other coding methods. In this paper, an efficient method for incorporating polarization diversity with space and time diversity is studied. The simple yet highly efficient technique is based on extending orthogonal space-time block codes into the quaternion domain and utilizing a description of the dual-polarized …

Novel Constructions Of Improved Square Complex Orthogonal Designs For Eight Transmit Antennas, Le Chung Tran, Tadeusz Wysocki, Jennifer Seberry, Alfred Mertins, Sarah Adams

Sarah Spence Adams

Constructions of square, maximum rate complex orthogonal space-time block codes (CO STBCs) are well known, however codes constructed via the known methods include numerous zeros, which impede their practical implementation. By modifying the Williamson and Wallis-Whiteman arrays to apply to complex matrices, we propose two methods of construction of square, order-4n CO STBCs from square, order-n codes which satisfy certain properties. Applying the proposed methods, we construct square, maximum rate, order-8 CO STBCs with no zeros, such that the transmitted symbols are equally dispersed through transmit antennas. Those codes, referred to as the improved square CO STBCs, have the advantages …

An Extension Of The Channel-Assignment Problem: L(2, 1)-Labelings Of Generalized Petersen Graphs, Sarah Adams, Jonathan Cass, Denise Troxell

Sarah Spence Adams

The channel-assignment problem involves assigning frequencies represented by nonnegative integers to radio transmitters such that transmitters in close proximity receive frequencies that are sufficiently far apart to avoid interference. In one of its variations, the problem is commonly quantified as follows: transmitters separated bythe smallest unit distance must be assigned frequencies that are at least two apart and transmitters separated by twice the smallest unit distance must be assigned frequencies that are at least one apart. Naturally, thischannel-assignment problem can be modeled with vertex labelings of graphs. An L(2, 1)-labeling of a graph G is a function f from the …

Identifying High-Dimension Subspace Subcodes Of Reed-Solomon Codes, Sarah Adams

Sarah Spence Adams

Subspace subcodes of Reed-Solomon (SSRS) codes were introduced by Hattori, McEliece, Solomo, and Lin in the mid-1990s. These authors found a complicated dimension formula and a simple, tight lower bound on thedimension of SSRS codes over F₂^m. We prove a conjecture of Hattori concerning how to identify subspaces that can be used to build SSRS codes whose dimension exceeds this lower bound.

Quaternion Orthogonal Designs From Complex Companion Designs, Sarah Adams, Jennifer Seberry, Nathaniel Karst, Jonathan Pollack, Tadeusz Wysocki

Sarah Spence Adams

The success of applying generalized complex orthogonal designs as space–time block codes recently motivated the definition of quaternion orthogonal designs as potential building blocks for space–time-polarization block codes. This paper offers techniques for constructing quaternion orthogonal designs via combinations of specially chosen complex orthogonal designs. One technique is used to build quaternion orthogonal designs on complex variables for any even number of columns. A second related technique is applied to maximum rate complex orthogonal designs to generate an infinite family of quaternion orthogonal designs on complex variables such that the resulting designs have no zero entries. This second technique is …

The Final Case Of The Decoding Delay Problem For Maximum Rate Complex Orthogonal Designs, Sarah Adams, Nathaniel Karst, Mathav Murugan

Sarah Spence Adams

Complex orthogonal space-time block codes (COSTBCs) based on generalized complex orthogonal designs (CODs) have been successfully implemented in wireless systems with multiple transmit antennas and single or multiple receive antennas. It has been shown that for a maximum rate COD with 2m-1 or 2m columns, a lower bound on decoding delay is (m-1 2m) and this delay is achievable when the number of columns is congruent to 0, 1 , or 3 modulo 4. In this paper, the final case is addressed, and it is shown that when the number of columns is congruent to 2 modulo 4, the lower …

The Minimum Decoding Delay Of Maximum Rate Complex Orthogonal Space–Time Block Codes, Sarah Adams, Nathaniel Karst, Jonathan Pollack

Sarah Spence Adams

The growing demand for efficient wireless transmissions over fading channels motivated the development ofspace-time block codes. Space-time block codes built from generalized complex orthogonal designs are particularly attractive because the orthogonality permits a simple decoupled maximum-likelihood decodingalgorithm while achieving full transmit diversity. The two main research problems for these complex orthogonalspace-time block codes (COSTBCs) have been to determine for any number of antennas the maximum rate andthe minimum decoding delay for a maximum rate code. The maximum rate for COSTBCs was determined by Liang in 2003. This paper addresses the second fundamental problem by providing a tight lower bound on …

A Real Options Valuation Of Renewable Energy Projects, Natasha Burke

Electronic Thesis and Dissertation Repository

Due to climate change concerns, high oil prices and nuclear dangers there is increasing support for renewable energy. At the forefront of the debate for government support of renewable energy are wind energy and biofuels. Used primarily for power generation and transportation, respectively, there have been many debates surrounding the reliability and efficiency of these resources. These debates often address the uncertainty in the economic value of the resource through time, however it is often difficult to quantify this uncertainty, which stems from the random behavior of prices and the unpredictable nature of the resource itself.

In this thesis we …

Optimal Synthesis Of Mite Translinear Loops, Shyam Subramanian, David Anderson, Paul Hasler, Bradley Minch

Bradley Minch

A procedure for synthesizing multiple-input translinear element (MITE) networks that implement a given system of translinear-loop equations (STLE) is presented. The minimum number of MITEs required for implementing the STLE, which is equal to the number of current variables in the STLE, is attained. The number of input gates ofthe MITEs is minimal amongst those MITE networks that satisfy the STLE and have the minimum number of MITEs. The synthesized MITE networks have a unique operating point and, in many cases, the network is guaranteed to be stable in a particular sense. This synthesis procedure exploits the relationship between MITEproduct-of-power-law …