Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 21 for “"Hankel matrix"”.

  1. Real-Time Detection of GPS Spoofing Attack with Hankel Matrix and Unwrapped Phase Angle Data

    … researchers exploited low-rank approximation of Hankel Matrix to differentiate between FDIA and physical events. We have demonstrated that, together with angle unwrapping algorithm, low-rank approximation of Hankel Matrix can help us separating GPS-spoofing attack with FDIA. The proposed method …

    vt Repository record for Real-Time Detection of GPS Spoofing Attack with Hankel Matrix and Unwrapped Phase Angle Data (opens in a new tab)

  2. Separability between signal and noise components using the distribution of scaled Hankel matrix eigenvalues with application in biomedical signals.

    … the distribution of the eigenvalues of a scaled Hankel matrix, and on dynamical systems, embedding theorem, matrix algebra and statistical theory. The research demonstrates that the proposed approach can be considered as an alternative and promising technique for choosing the optimal values of r …

    bournemouth Download PDF for Separability between signal and noise components using the distribution of scaled Hankel matrix eigenvalues with application in biomedical signals. (opens in a new tab)

  3. Assessment of Cyber Vulnerabilities and Countermeasures for GPS-Time Synchronized Measurements in Smart Grids

    … part of this dissertation is the enhancement of Hankel-matrix based bad data detection model. The existing general Hankel-matrix based bad data detection model provide satisfactory performance. However, it fails in differentiating GPS-spoofing attack from FDIA. We propose an enhanced phase angle …

    vt Repository record for Assessment of Cyber Vulnerabilities and Countermeasures for GPS-Time Synchronized Measurements in Smart Grids (opens in a new tab)

  4. Non-negative Polynomials, Sums of Squares & The Moment Problem

    … problem is well understood when the associated Hankel matrix (which has size 7x7) is positive definite, or positive semi-definite and of rank at most 4. Here we examine the Hankel matrix when it is of rank 5 or 6 and show that there are four canonical cases to study. In two out of the four rank …

    anu Repository record for Non-negative Polynomials, Sums of Squares & The Moment Problem (opens in a new tab)

  5. Towards a behavioral approach to linear approximate modeling

    … level, is addressed. The concept of the block Hankel matrix, constructed from the data measurements, is then introduced, and it is shown that the optimal Hankel-norm approximation theory provides the main tool for a partial solution of the above problem.

    rice Repository record for Towards a behavioral approach to linear approximate modeling (opens in a new tab)

  6. Strategies for Sparsity-based Time-Frequency Analyses

    … to the time or lag is converted to a Hankel matrix, and its missing entries are recovered via atomic norm minimization. The second method generalizes this approach to reduce the effects of TF crossterms. It considers an IAF patch, which is reformulated as a low-rank block Hankel …

    temple Repository record for Strategies for Sparsity-based Time-Frequency Analyses (opens in a new tab)

  7. A Study on Weighted and Structured Low Rank Matrix Optimization Problems

    … such as signal recovery, image processing and matrix learning. Due to the non-convexity of low rank matrix set, this problem is NP-hard and difficult to tackle. In this thesis we firstly focus on weighted low rank Hankel matrix optimization problem, which has become one of the main approaches …

    soton Download PDF for A Study on Weighted and Structured Low Rank Matrix Optimization Problems (opens in a new tab)

  8. The detection of change points in a switched system

    … First method is using the property of the sub-matrix of Hankel matrix along with the characteristics polynomial to detect change points. Because of the limitation of this method, the second method discussed in the paper is based on information criterion. And mainly focused on the stability of …

    ttu Repository record for The detection of change points in a switched system (opens in a new tab)

  9. Algorithms for Linearly Recurrent Sequences of Truncated Polynomials

    … one which computes the kernel of some block-Hankel matrix over A via a minimal approximant basis, and one based on bivariate Pade approximation. We propose complexity improvements for the first two methods, respectively by avoiding the computation of redundant relations and by exploiting the …

    waterloo Repository record for Algorithms for Linearly Recurrent Sequences of Truncated Polynomials (opens in a new tab)

  10. Special Rational Solutions of the Fifth Painlevé Equation and their Asymptotic Behavior.

    … compute its moments alongside the corresponding Hankel determinant. When the latter is nonzero, we will prove that for Painlevé 5, we can construct a Lax pair whose solution is a combination of the solution of the Riemann Hilbert Problem (RHP) and the generating function. An ingredient of that …

    concordia Download PDF for Special Rational Solutions of the Fifth Painlevé Equation and their Asymptotic Behavior. (opens in a new tab)

  11. Linear time-varying systems: Algebraic structure, system properties and control

    … homomorphism) is considered. This leads to the Hankel matrix introduced by Kalman (see C35]). It is shown that reachability and observability can be characterized by coprime polynomial factorization conditions. The relation between the formal impulse response and Rosenbrock's system matrix is …

    ttu Repository record for Linear time-varying systems: Algebraic structure, system properties and control (opens in a new tab)

  12. RECONSTRUCTION OF SIGNALS FROM PHASE: EFFICIENT ALGORITHMS, SEGMENTATION, AND GENERALIZATIONS

    … of simultaneous equations whose of coefficient matrix is representable by a sum of a Toeplitz and a Hankel matrix. It is shown that this system of equations can be solved efficiently by a block-Levinson type algorithm. To handle long duration filter output a procedure for approximately …

    rice Repository record for RECONSTRUCTION OF SIGNALS FROM PHASE: EFFICIENT ALGORITHMS, SEGMENTATION, AND GENERALIZATIONS (opens in a new tab)

  13. Nonconvex Optimization and Model Representation with Applications in Control Theory and Machine Learning

    … sample complexity. We present two results, the Hankel nuclear norm regularization method for learning a low order system, and the overparameterized representation for linear meta-learning. We study dynamical system identification in the first result. We assume the true system order is low. A low …

    washington Repository record for Nonconvex Optimization and Model Representation with Applications in Control Theory and Machine Learning (opens in a new tab)

  14. Model and Data Reduction for Control, Identification and Compressed Sensing

    … for practitioners, and is a first step towards a matrix free approach to solve AREs. Numerical examples for n >= 100,000 unknowns are presented. In Chapter 4, we develop a system identification method which is motivated by tangential interpolation. This addresses the challenge of fitting linear …

    vt Repository record for Model and Data Reduction for Control, Identification and Compressed Sensing (opens in a new tab)

  15. Bit Serial Systolic Architectures for Multiplicative Inversion and Division over GF(2<sup>m</sup>)

    … basis representation. Further results regarding Hankel matrix formation for double-basis inversion is provided. The validity of using the same architecture to compute field division with polynomial or triangular basis representation is proved. Next, a scalable unidirectional bit serial systolic …

    waterloo Repository record for Bit Serial Systolic Architectures for Multiplicative Inversion and Division over GF(2<sup>m</sup>) (opens in a new tab)

  16. Mixture models, theory with application to species richness, clustering, classification and all that jazz

    … groups: tools built upon the determinant of the Hankel matrix of moments of the mixing distribution, minimum distance estimators, likelihood ratio tests. One of the valuable features of all of these approaches is that they all come with theoretical guarantees for consistency. We address …

    ethz Repository record for Mixture models, theory with application to species richness, clustering, classification and all that jazz (opens in a new tab)

  17. Phasor Measurement Unit Data-Based Steady State and Dynamic Model Estimation

    … methods used in power systems: Prony analysis, Matrix Pencil (MP), and Eigensystem Realization Algorithm (ERA) are examined. The first part of this research discusses the optimal PMU placement (OPP) problem to find the optimal number of PMUs to make the system fully observable. Two different …

    usf Repository record for Phasor Measurement Unit Data-Based Steady State and Dynamic Model Estimation (opens in a new tab)

  18. A study of the Hamburger moment problem on the real line

    This thesis contains an exposition of the Hamburger moment problem. The Hamburger moment problem is an interesting question in analysis that deals with finding the existence of a Borel measure representing a given positive semi-definite linear functional. We begin our exposition by constructing …

    sask Repository record for A study of the Hamburger moment problem on the real line (opens in a new tab)

  19. Approximation and interpolation with Bernstein polynomials.

    … and so we introduce a nonstandard matrix norm to study the conditioning of the matrices, showing that the conditioning in this case is better than in the standard 2-norm. We conclude by giving an algorithm for enforcing bounds constraints on the approximating polynomial. Extensions …

    baylor Repository record for Approximation and interpolation with Bernstein polynomials. (opens in a new tab)

Page 1 of 2