Browsing Mathematics and Statistics, Department of by Title
Now showing items 99-118 of 152
-
Nonparametric and Parametric Methods for Solar Oscillation Spectra
(2014-09-27)The study of the systematic oscillations of the Sun has led to better understanding of the Sun’s inner structure and dynamics, and may help to resolve inconsistencies between observations and the standard solar model. ... -
Nonparametric statistical procedures for therapeutic clinical trials with survival endpoints
(2007-08-02)This thesis proposed two nonparametric statistical tests, based on the Kolmogorov-Smirnov distance and L2 mallows disatnce. To implement the proposed tests, nonparametric bootstrap method is employed to approximate the ... -
Nonparametric Testing Methods for Treatment-Biomarker Interaction based on Local Partial-Likelihood
(Wiley, 2015-06-17)In clinical trials, patients with different biomarker features may respond differently to the new treatments or drugs. In personalized medicine, it is important to study the interaction between treatment and biomarkers in ... -
On Malliavin Calculus and Concentration Inequalities
(2014-07-07)We prove new abstract results concerning concentration inequalities and density estimates for Malliavin differentiable random variables. The efficacy of these results are demonstrated by practical computations, such as the ... -
On Renyi Divergence Measures for Continuous Alphabet Sources
(2011-08-30)The idea of `probabilistic distances' (also called divergences), which in some sense assess how `close' two probability distributions are from one another, has been widely employed in probability, statistics, information ... -
On the Convergence and Applications of Mean Shift Type Algorithms
(2013-10-01)Mean shift (MS) and subspace constrained mean shift (SCMS) algorithms are non-parametric, iterative methods to find a representation of a high dimensional data set on a principal curve or surface embedded in a high ... -
On the Equivalence Between Maximum Likelihood and Minimum Distance Decoding for Binary Contagion and Queue-Based Channels with Memory
(2016-02-17)We study the optimal maximum likelihood (ML) block decoding of general binary codes sent over two classes of binary additive noise channels with memory. Specifically, we consider the infinite and finite memory Polya contagion ... -
On the homogeneity of the affine connection model for mechanical control systems
(IEEE, 2000)This work presents a review of a number of control results for mechanical systems. The key technical results derive mainly from the homogeneity properties of affine connection models for a large class of mechanical systems. ... -
On the Optimality of the Hamming Metric for Decoding Block Codes over Binary Additive Noise Channels
(2013-07-12)Most of the basic concepts of algebraic coding theory are derived for the memoryless binary symmetric channel. These concepts do not necessarily hold for time-varying channels or for channels with memory. However, errors ... -
On the Oscillations of Jupiter as Observed by Voyager 2
(2007-12-18)Data recorded from Voyager 2 in 1979 during closest approach to Jupiter is prepared and analyzed for evidence of Jovian modal forcing. Comparisons are drawn between the data set in question and previously performed ... -
On the Reduced Operator Algebras of Free Quantum Groups
(2012-08-03)In this thesis, we study the operator algebraic structure of various classes of unimodular free quantum groups, including thefree orthogonal quantum groups $O_n^+$, free unitary quantum groups $U_n^+$, and trace-preserving ... -
On the role of regularity in mathematical control theory
(2016-04-08)In this thesis, we develop a coherent framework for studying time-varying vector fields of different regularity classes and their flows. This setting has the benefit of unifying all classes of regularity. In particular, ... -
Optimal control for a simplified hovercraft model
(2000)Time-optimal and force-optimal extremals are investigated for a planar rigid body with a single variable direction thruster. A complete and explicit characterisation of the singular extremals is possible for this problem. -
Optimal design in regression and spline smoothing
(2007-07-19)This thesis represents an attempt to generalize the classical Theory of Optimal Design to popular regression models, based on Rational and Spline approximations. The problem of finding optimal designs for such models can ... -
Optimal Quantization and Approximation in Source Coding and Stochastic Control
(2015-06-23)This thesis deals with non-standard optimal quantization and approximation problems in source coding and stochastic control. The first part of the thesis considers randomized quantization. Adapted from stochastic ... -
Optimality of Walrand-Varaiya Type Policies and Approximation Results for Zero-Delay Coding of Markov Sources
(2015-07-28)Optimal zero-delay coding of a finite state Markov source through quantization is considered. Building on previous literature, the existence and structure of optimal policies are studied using a stochastic control problem ... -
Pairwise Optimization of Modulation Constellations for Non-Uniform Sources
(2009-10-07)The design of two-dimensional signal constellations for the transmission of binary non-uniform memoryless sources over additive white Gaussian noise channels is investigated. The main application of this problem is the ... -
Performance analysis of linear block codes over the queue-based channel
(2007-08-29)Most coding schemes used in today's communication systems are designed for memoryless channels. These codes break down when they are transmitted over channels with memory, which is in fact what real-world channels look ... -
Prime divisors of sparse values of cyclotomic polynomials and Wieferich primes
(2019-03-20)Bang (1886), Zsigmondy (1892) and Birkhoff and Vandiver (1904) initiated the study of the largest prime divisors of sequences of the form an−bn, denoted P(an−bn), by essentially proving that for integers a>b>0, P(an−bn)≥n+1 ... -
Push-sum Algorithm on Time-varying Random Graphs
In this thesis, we study the problem of achieving average consensus over a random time-varying sequence of directed graphs by extending the class of so-called push- sum algorithms to such random scenarios. Provided that ...