Loading...
Search for: eigenvalues
0.017 seconds
Total 197 records

    Source Enumeration and Identification in Array Processing Systems

    , Ph.D. Dissertation Sharif University of Technology Yazdian, Ehsan (Author) ; Bastani, Mohammad Hasan (Supervisor)
    Abstract
    Employing array of antennas in amny signal processing application has received considerable attention in recent years due to major advances in design and implementation of large dimentional antennas. In many applications we deal with such large dimentional antennas which challenge the traditional signal processing algorithms. Since most of traditional signal processing algorithms assume that the number of samples is much more than the number of array elements while it is not possible to collect so many samples due to hardware and time constraints.
    In this thesis we exploit new results in random matrix theory to charachterize and describe the properties of Sample Covariance Matrices... 

    Signless Laplacian Spectra of Graphs

    , M.Sc. Thesis Sharif University of Technology Kianizad, Mosayeb (Author) ; Akbari, Saeed (Supervisor)
    Abstract
    Let G be a graph of order n. The signless Laplacian matrix or Q-matrix of G is Q(G)=D(G)+A(G), where A(G) is the adjacency matrix of G and D(G) is diagonal degree matrix of G. The signless Laplacian characteristic polynomial or Q-polinomial of G is QG(x)=det(xI-Q(G)) and its roots are called signless Laplacian eigenvalues or Q-eigenvalues of G. If R is vertex-degree incidence matrix of G, then Q(G)=RRt. So Q(G) is a positive semi-definite matrix, i.e. its eigenvalues are none-negative. Let q1(G)≥q2(G)≥…≥qn(G) denote the signless Laplacian eigenvalues of G. A theory in which graphs are studied by means of eigenvalues of Q(G) is called signless Laplaciian theory or Q-theory.In this research,... 

    Main Eigenvalues of Graphs and Signed Graphs

    , M.Sc. Thesis Sharif University of Technology Kamali, Sara (Author) ; Akbari, Saeed (Supervisor) ; Ghorbani, Ebrahim (Co-Supervisor)
    Abstract
    Let G be a simple graph. An eigenvalue of G, is a main eigenvalue if the corresponding eigenspace has a non-orthogonal eigenvector to the all-one vector j. A signed graph is a graph with a sign to each edge. If in the adjacency matrix of background graph change elements that corresponded by -1, set -1 and in the other elements don’t make any change, then we reach the sign matrix of a signed graph. By an eigenvalue of a signed graph, we mean an eigenvalue of its sign matrix. In this research, we study main eigenvalues of graphs and signed graphs. At first, we present the necessary and sufficient conditions for any graph which has exactly m main eigenvalues. Then, by introducing and creating... 

    Edge Disjoint Spanning Trees and Eigenvalues

    , M.Sc. Thesis Sharif University of Technology Mehdizadeh, Alireza (Author) ; Akbari, Saeed (Supervisor)
    Abstract
    The spectrum of a graph is related to many important combinatorial parameters. Let (G), ′(G) be the maximum number of edge-disjoint spanning trees and edge-connectivity of a graph G,respectively. Motivated by a question of Seymour on the relationship between eigenvalues of a graph G and bounds of (G), we use eigenvalue interlacing for quotient matrix associated to graph to get the relationship between eigenvalues of a graph and bounds of (G) and ′(G). We also study the relationship between eigenvalues and bounds of (G) and ′(G) in a multigraph G. In the first chapter we prove eigenvalue interlacing and give several applications of it for obtaining bounds for characteristic numbers of... 

    On Treewidth of Social Networks

    , M.Sc. Thesis Sharif University of Technology Liaee, Mehraneh (Author) ; Safari, Mohammad Ali (Supervisor) ; Habibi, Jafar (Supervisor)
    Abstract
    In this thesis, we study the treewidth of social networks. The importance of studding treewidth is for two reasons. The first is that for the graph with bounded treewidth, many optimization problems that are NP-hard in general, can be solved in polynomial or even linear time. The second is that the high value of treewidth in a graph, reflects some high degree of connectivity and robustness, which is an essential factor in designing many networks. But the problem is that determining the value of treewidth in a graph is NP-complete so, computing the treewidth of real complex networks is not feasible. We first review the related works and mention the weakness of the past works, then introduce a... 

    Energy of Graphs

    , Ph.D. Dissertation Sharif University of Technology Ghorbani, Ebrahim (Author) ; Akbari, Saeid (Supervisor)
    Abstract
    Let G be a graph with adjacency matrix A and Δ be a diagonal matrix whose diagonal entries are the degree sequence of G. Then the matrices L = Δ− A and Q = Δ+A are called Laplacian matrix and signless Laplacian matrix of G, respectively. The eigenvalues of A, L, and Q are arranged decreasingly and denoted by λ1 ≥ · · · ≥ λn, μ1 ≥ · · · ≥ μn ≥ 0, and q1 ≥ · · · ≥ qn ≥ 0, respectively. The energy of a graph G is defined as E(G) :=
    n
    i=1
    |λi|.
    Furthermore, the incidence energy, the signed incidence energy, and the H¨uckel energy of G are
    defined as
    IE(G) :=
    n
    i=1

    qi, LE(G) :=
    n
    i=1

    μi, HE(G) :=

    2
    r
    i=1 λi, n=... 

    Analysis of Wave Propagation Eigenproblem in Periodic Structures

    , Ph.D. Dissertation Sharif University of Technology Faghihifar, Ehsan (Author) ; Akbari, Mahmood (Supervisor)
    Abstract
    The Fourier modal method is one of the most important methods in the analysis of flat periodic structures (gratings). Using this method, the problem of wave propagation in the periodic medium leads to an eigenproblem, in which eigenvalues represent the propagation constants and eigenvector or eigenfunctions determine the filed distribution of the modes. On the other side, considering all the generalizations and modifications reported so far, the Fourier modal method still faces two fundamental problems. First, for problems involving large dielectric constants or high contrasts, the matrix form of the eigenproblem (the modal matrix) can be large, dense, and require a high computational cost.... 

    Image Steganalysis of Low Rate Embedding in Spatial Domain

    , Ph.D. Dissertation Sharif University of Technology Farhat, Farshid (Author) ; Ghaemmaghami, Shahrokh (Supervisor) ; Aref, Mohammad Reza (Co-Advisor)
    Abstract
    LSB embedding in spatial domain with very low rate can be easily performed and its detection in spite of many researches is very hard, while BOSS competition has been held to break an adaptive embedding algorithm with low rate. Thus, proposing powerful steganalyzer of very low rate in spatial domain is highly requested. In this thesis it has been tried to present some algorithms to detect secret message with very low rate in spatial domain using eigenvalues analysis and relative auto-correlation of image.First approach is based on the analysis of the eigenvalues of the cover correlation matrix that we used for the first time. Image partitioning, correlation function computation,... 

    Blind Steganalysis Based on Multi- resolution Transforms

    , M.Sc. Thesis Sharif University of Technology Zohourian, Mehdi (Author) ; Ghaemmaghami, Shahrokh (Supervisor) ; Gholampour, Iman (Supervisor)
    Abstract
    Blind image steganalysis is a technique used for detecting the existence of the data hidden in an image, where no information about the stenographic algorithm is available or usable. In this way, an important problem is to find sensitive features which make noticeable statistical distinction between cover and stego images. New steganalysis methods based on multi-resolution transform, specifically the wavelet and the contourlet transforms, have been proposed in this thesis in order to enhance the detection accuracy of system especially at low embedding rates. In fact, multi-resolution transforms are powerful space-frequency analysis tools that have been found quite successful in detection of... 

    Improve Performance of Higher Order Statistics in Spatial and Frequency Domains in Blind Image Steganalysis

    , M.Sc. Thesis Sharif University of Technology Shakeri, Ehsan (Author) ; Ghaemmaghami, Shahrokh (Supervisor)
    Abstract
    Blind image steganalysis is a technique used to, which require no prior information about the steganographic method applied to the stego im- age, determine whether the image contains an embedded message or not. The basic idea of blind steganalysis is to extract some features sensitive to information hiding, and then exploit classifiers for judging whether a given test image contains a secret message.The main focus of this research is to design an choose features sen-sitive to the embedding changes. In fact, we use high order moments in different domains, such as spatial, DCT and multi-resolution do-main, in order to improve the performance of existing steganalyzers.Accordingly, First, we... 

    MIMO Radars Waveform Design

    , M.Sc. Thesis Sharif University of Technology Shadi, Kamal (Author) ; Behnia, F (Supervisor)
    Abstract
    MIMO radar is a next generation radar which transmits arbitrary waveforms at each one of its apertures. It has been shown that design of waveforms for MIMO radars in order to synthesize a desired spatial beampattern, is mapped into a waveform correlation matrix (R) design in the narrowband case. Therefore, waveform design in MIMO radar for beamforming could be broken into two steps, namely correlation matrix design and waveform synthesis for achieving given R. As of now, given a desired beampattern or estimated location information of targets, calculating R has been modeled as an optimization problem like SDP. Also, in some special cases like rectangular beampattern, close form solutions for... 

    Damping Critical Electromechanical Oscillations in Power System Through Remedial Actions Using Wide Area Measurement System (WAMS)

    , Ph.D. Dissertation Sharif University of Technology Setareh, Mohammad (Author) ; Parniani, Mostafa (Supervisor) ; Aminifar, Farrokh (Co-Supervisor)
    Abstract
    Nowadays, by proliferation the basis of the phasor-based synchronous wide area measurement system (WAMS), its application for improving electromechanical oscillations damping has been considered by researchers. In interconnected power systems, inter-area modes are usually critical modes. There are two approaches for damping these modes by utilizing WAMS: 1) the traditional approach of using power system stabilizers with wide area signals; and 2) discrete corrective actions by changing the operating conditions. The first approach requires a thorough study at the design stage, installation and testing. Besides, the controller is designed for a specific operating point. Nevertheless, in the... 

    Control of Chaotic Waves in Hard Disk Drives

    , M.Sc. Thesis Sharif University of Technology Rajabi, Majid (Author) ; Jalali, Mir Abbas (Supervisor)
    Abstract
    Hard disk drives are the main component of computers for permanent data storage. The security of the stored data is related closely to the air gap between the read-write head and the surface of disk. This gap which is created by the aerodynamic force between head and the disk is altered continually by lateral oscillations of disk. In the extreme condition of zero gap and contact between the protective coating layer and subsequently the magnetic material of the disk with the head, the disk will be scratched and damaged. Therefore, the active or passive control of these vibrations has a particular importance in the technology of manufacturing of hard disks. The first step in active control... 

    Out-of-plane buckling of Y-braced frames with rigid joints

    , Article Proceedings of the Institution of Civil Engineers: Structures and Buildings ; Volume 166, Issue 1 , 2013 , Pages 28-37 ; 09650911 (ISSN) Zamani, M. S ; Vafai, A ; Kazemi, M.T ; Sharif University of Technology
    2013
    Abstract
    Because of the complicated buckling characteristics of Y-shaped bracings, calculation of their strength is beyond routine engineering procedures. A method based on slope-deflection equations incorporating stability functions has been used for computation of buckling eigenvalues and effective length factors. Lateral strength is computed based on the least buckling strength of bracing members. This study is limited to bracings with similar sections and fixed end connections resisting out-of-plane rotation. Lateral strengths predicted by the analytical method for two cases are compared with experimental results on full-scale specimens. It is shown that the proposed analytical method predicts... 

    Limiting spectral distribution of the sample covariance matrix of the windowed array data

    , Article Eurasip Journal on Advances in Signal Processing ; Volume 2013, Issue 1 , 2013 ; 16876172 (ISSN) Yazdian, E ; Gazor, S ; Bastani, M. H ; Sharif University of Technology
    2013
    Abstract
    In this article, we investigate the limiting spectral distribution of the sample covariance matrix (SCM) of weighted/windowed complex data. We use recent advances in random matrix theory and describe the distribution of eigenvalues of the doubly correlated Wishart matrices. We obtain an approximation for the spectral distribution of the SCM obtained from windowed data. We also determine a condition on the coefficients of the window, under which the fragmentation of the support of noise eigenvalues can be avoided, in the noise-only data case. For the commonly used exponential window, we derive an explicit expression for the l.s.d of the noise-only data. In addition, we present a method to... 

    Source enumeration in large arrays based on moments of eigenvalues in sample starved conditions

    , Article IEEE Workshop on Signal Processing Systems, SiPS: Design and Implementation, 17 October 2012 through 19 October 2012, Quebec ; October , 2012 , Pages 79-84 ; 15206130 (ISSN) ; 9780769548562 (ISBN) Yazdian, E ; Bastani, M. H ; Gazor, S ; Sharif University of Technology
    2012
    Abstract
    This paper presents a scheme to enumerate the incident waves impinging on a high dimensional uniform linear array using relatively few samples. The approach is based on Minimum Description Length (MDL) criteria and statistical properties of eigenvalues of the Sample Covariance Matrix (SCM). We assume that several models, with each model representing a certain number of sources, will compete and MDL criterion will select the best model with the minimum model complexity and maximum model decision. Statistics of noise eigenvalue of SCM can be approximated by the distributional properties of the eigenvalues given by Marcenko-Pastur distribution in the signal-free SCM. In this paper we use random... 

    Spectral distribution of the exponentially windowed sample covariance matrix

    , Article ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings, 25 March 2012 through 30 March 2012, Kyoto ; 2012 , Pages 3529-3532 ; 15206149 (ISSN) ; 9781467300469 (ISBN) Yazdian, E ; Bastani, M. H ; Gazor, S ; Sharif University of Technology
    IEEE  2012
    Abstract
    In this paper, we investigate the effect of applying an exponential window on the limiting spectral distribution (l.s.d.) of the exponentially windowed sample covariance matrix (SCM) of complex array data. We use recent advances in random matrix theory which describe the distribution of eigenvalues of the doubly correlated Wishart matrices. We derive an explicit expression for the l.s.d. of the noise-only data. Simulations are performed to support our theoretical claims  

    Source enumeration in large arrays using moments of eigenvalues and relatively few samples

    , Article IET Signal Processing ; Volume 6, Issue 7 , 2012 , Pages 689-696 ; 17519675 (ISSN) Yazdian, E ; Gazor, S ; Bastani, H ; Sharif University of Technology
    IET  2012
    Abstract
    This study presents a method based on minimum description length criterion to enumerate the incident waves impinging on a large array using a relatively small number of samples. The proposed scheme exploits the statistical properties of eigenvalues of the sample covariance matrix (SCM) of Gaussian processes. The authors use a number of moments of noise eigenvalues of the SCM in order to separate noise and signal subspaces more accurately. In particular, the authors assume a Marcenko-Pastur probability density function (pdf) for the eigenvalues of SCM associated with the noise subspace. We also use an enhanced noise variance estimator to reduce the bias leakage between the subspaces.... 

    Eigenvalue estimation of the exponentially windowed sample covariance matrices

    , Article IEEE Transactions on Information Theory ; Volume 62, Issue 7 , 2016 , Pages 4300-4311 ; 00189448 (ISSN) Yazdian, E ; Gazor, S ; Bastani, M. H ; Sharifitabar, M ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2016
    Abstract
    In this paper, we consider an exponentially windowed sample covariance matrix (EWSCM) and propose an improved estimator for its eigenvalues. We use new advances in random matrix theory, which describe the limiting spectral distribution of the large dimensional doubly correlated Wishart matrices to find the support and distribution of the eigenvalues of the EWSCM. We then employ the complex integration and residue theorem to design an estimator for the eigenvalues, which satisfies the cluster separability condition, assuming that the eigenvalue multiplicities are known. We show that the proposed estimator is consistent in the asymptotic regime and has good performance in finite sample size... 

    Buckling of cracked cylindrical thin shells under combined internal pressure and axial compression

    , Article Thin-Walled Structures ; Volume 44, Issue 2 , 2006 , Pages 141-151 ; 02638231 (ISSN) Vaziri, A ; Estekanchi, H. E ; Sharif University of Technology
    2006
    Abstract
    Linear eigenvalue analysis of cracked cylindrical shells under combined internal pressure and axial compression is carried out to study the effect of crack type, size and orientation on the buckling behavior of cylindrical thin shells. Two types of crack are considered; through crack and thumbnail crack. Our calculations indicate that depending on the crack type, length, orientation and the internal pressure, local buckling may precede the global buckling of the cylindrical shell. The internal pressure, in general, increases the buckling load associated with the global buckling mode of the cylindrical shells. In contrast, the effect of internal pressure on buckling loads associated with the...