Second-order cyclostationarity-based detection and classification of LTE SC-FDMA signals for cognitive radio

Cognitive radio (CR) was developed for utilizing the spectrum bands efficiently. Spectrum sensing and awareness represent main tasks of a CR, providing the possibility of exploiting the unused bands. In this thesis, we investigate the detection and classification of Long Term Evolution (LTE) single carrier-frequency division multiple access (SC-FDMA) signals, which are used in uplink LTE, with applications to cognitive radio. We explore the second-order cyclostationarity of the LTE SC-FDMA signals, and apply results obtained for the cyclic autocorrelation function to signal detection and classification (in other words, to spectrum sensing and awareness). The proposed detection and classification algorithms provide a very good performance under various channel conditions, with a short observation time and at low signal-to-noise ratios, with reduced complexity. The validity of the proposed algorithms is verified using signals generated and acquired by laboratory instrumentation, and the experimental results show a good match with computer simulation results.

A posteriori error estimation for discontinuous Galerkin discretizations of H(curl)-elliptic partial differential equations

We develop the a posteriori error estimation of interior penalty discontinuous Galerkin discretizations for H(curl)-elliptic problems that arise in eddy current models. Computable upper and lower bounds on the error measured in terms of a natural (mesh-dependent) energy norm are derived. The proposed a posteriori error estimator is validated by numerical experiments, illustrating its reliability and efficiency for a range of test problems.

A bistable reaction-diffusion system in a stretching flow

We examine the evolution of a bistable reaction in a one-dimensional stretching flow, as a model for chaotic advection. We derive two reduced systems of ordinary differential equations (ODEs) for the dynamics of the governing advection-reaction-diffusion partial differential equations (PDE), for pulse-like and for plateau-like solutions, based on a non-perturbative approach. This reduction allows us to study the dynamics in two cases: first, close to a saddle-node bifurcation at which a pair of nontrivial steady states are born as the dimensionless reaction rate (Damkoehler number) is increased, and, second, for large Damkoehler number, far away from the bifurcation. The main aim is to investigate the initial-value problem and to determine when an initial condition subject to chaotic stirring will decay to zero and when it will give rise to a nonzero final state. Comparisons with full PDE simulations show that the reduced pulse model accurately predicts the threshold amplitude for a pulse initial condition to give rise to a nontrivial final steady state, and that the reduced plateau model gives an accurate picture of the dynamics of the system at large Damkoehler number. Published in Physica D (2006)

Uniform second-order solution for supersonic flow over delta wing using reverse-flow integral method,

"CM-1034."

Reverse-flow integral methods for second-order supersonic flow theory,

"CM-1033."

Fractional differential equations with dependence on the Caputo-Katugampola derivative

In this paper we present a new type of fractional operator, the Caputo–Katugampola derivative. The Caputo and the Caputo–Hadamard fractional derivatives are special cases of this new operator. An existence and uniqueness theorem for a fractional Cauchy type problem, with dependence on the Caputo–Katugampola derivative, is proven. A decomposition formula for the Caputo–Katugampola derivative is obtained. This formula allows us to provide a simple numerical procedure to solve the fractional differential equation.

Second-order elliptic PDE with discontinuous boundary data

We shall consider the weak formulation of a linear elliptic model problem with discontinuous Dirichlet boundary conditions. Since such problems are typically not well-defined in the standard H^1-H^1 setting, we will introduce a suitable saddle point formulation in terms of weighted Sobolev spaces. Furthermore, we will discuss the numerical solution of such problems. Specifically, we employ an hp-discontinuous Galerkin method and derive an L^2-norm a posteriori error estimate. Numerical experiments demonstrate the effectiveness of the proposed error indicator in both the h- and hp-version setting. Indeed, in the latter case exponential convergence of the error is attained as the mesh is adaptively refined.

Foundational, First-Order, and Second-Order Classification Theory

Both basic and applied research on the construction, implementation, maintenance, and evaluation of classification schemes is called classification theory. If we employ Ritzer’s metatheoretical method of analysis on the over one-hundred year-old body of literature, we can see categories of theory emerge. This paper looks at one particular part of knowledge organization work, namely classification theory, and asks 1) what are the contours of this intellectual space, and, 2) what have we produced in the theoretical reflection on con- structing, implementing, and evaluating classification schemes? The preliminary findings from this work are that classification theory can be separated into three kinds: foundational classification theory, first-order classification theory, and second-order classification theory, each with its own concerns and objects of study.

Combining Legendre's Polynomials and Genetic Algorithm in the Solution of Nonlinear Initial-Value Problems

This work develops a method for solving ordinary differential equations, that is, initial-value problems, with solutions approximated by using Legendre's polynomials. An iterative procedure for the adjustment of the polynomial coefficients is developed, based on the genetic algorithm. This procedure is applied to several examples providing comparisons between its results and the best polynomial fitting when numerical solutions by the traditional Runge-Kutta or Adams methods are available. The resulting algorithm provides reliable solutions even if the numerical solutions are not available, that is, when the mass matrix is singular or the equation produces unstable running processes.

On the basic reproduction number and the topological properties of the contact network: An epidemiological study in mainly locally connected cellular automata

We study the spreading of contagious diseases in a population of constant size using susceptible-infective-recovered (SIR) models described in terms of ordinary differential equations (ODEs) and probabilistic cellular automata (PCA). In the PCA model, each individual (represented by a cell in the lattice) is mainly locally connected to others. We investigate how the topological properties of the random network representing contacts among individuals influence the transient behavior and the permanent regime of the epidemiological system described by ODE and PCA. Our main conclusions are: (1) the basic reproduction number (commonly called R(0)) related to a disease propagation in a population cannot be uniquely determined from some features of transient behavior of the infective group; (2) R(0) cannot be associated to a unique combination of clustering coefficient and average shortest path length characterizing the contact network. We discuss how these results can embarrass the specification of control strategies for combating disease propagations. (C) 2009 Elsevier B.V. All rights reserved.

Asymptotic limits of a self-dual Ginzburg-Landau functional in bounded domains

In the author's joint paper [HJS] with Jest and Struwe, we discuss asymtotic limits of a self-dual Ginzburg-Landau functional involving a section of a line bundle over a closed Riemann surface and a connection on this bundle. In this paper, the author generalizes the above results [HJS] to the case of bounded domains.

A numerical study of large sparse matrix exponentials arising in Markov chains

Krylov subspace techniques have been shown to yield robust methods for the numerical computation of large sparse matrix exponentials and especially the transient solutions of Markov Chains. The attractiveness of these methods results from the fact that they allow us to compute the action of a matrix exponential operator on an operand vector without having to compute, explicitly, the matrix exponential in isolation. In this paper we compare a Krylov-based method with some of the current approaches used for computing transient solutions of Markov chains. After a brief synthesis of the features of the methods used, wide-ranging numerical comparisons are performed on a power challenge array supercomputer on three different models. (C) 1999 Elsevier Science B.V. All rights reserved.AMS Classification: 65F99; 65L05; 65U05.