单模光纤二阶偏振模色散的Jones矩阵

利用单模光纤PMD矢量与Jones矩阵之间的关系,推导了由该矢量表示的光纤二阶PMD的Jones矩阵解析表达式,利用该矩阵可以确定输出端时域脉冲在二阶PMD近似下的表达式,并由此仿真二阶PMD对信号传输质量的影响.通过比较输入与输出信号脉冲波形和眼图发现,随着传输速率和传输距离的增加输出信号劣化.最后结果表明,当主偏振态的旋转速率为零时,二阶PMD的影响可以忽略;但当其值增大时,输出信号劣化严重.在光纤通信系统设计时,需要考虑偏振模色散影响分析结果,可提供参考依据.     

Stabilization of stochastic singular nonlinear hybrid systems

This paper deals with the control of the class of singular nonlinear stochastic hybrid systems. Under some appropriate assumptions, results on stochastic stability and stochastic stabilization are developed. Two state feedback controllers (linear and nonlinear) that stochastically stabilize the class of systems we are considering are designed. LMI sufficient conditions are developed to compute the gains of these controllers.     

The numerical range of a nonnegative matrix

We offer an almost self-contained development of Perron–Frobenius type results for the numerical range of an (irreducible) nonnegative matrix, rederiving and completing the previous work of Issos, Nylen and Tam, and Tam and Yang on this topic. We solve the open problem of characterizing nonnegative matrices whose numerical ranges are regular convex polygons with center at the origin. Some related results are obtained and some open problems are also posed.     

CRITERION FOR SL（2,Z）－MATRIX TO BE CONJUGATE TO ITS INVERSE

This paper gives a necessary and sufficient condition for a matrix in SL(2, Z) to be conjugate to its inverse. This condition reduces the determination of the conjugation to solving some indeterminate equation of second degree. It yields an algorithm to determine this conjugation in finite steps based on the elementary number theory.     

矩阵系统扰动后的稳定性问题

本文证明：若矩阵系统是广义各态历经的，则系统是稳定的；若矩阵系统是善真的，则系统是条件稳定的。     

A Sharp Upper Bound for the Number of Spanning Trees of a Graph

Let G = (V,E) be a simple graph with n vertices, e edges and d₁ be the highest degree. Further let λ_i, i = 1,2,...,n be the non-increasing eigenvalues of the Laplacian matrix of the graph G. In this paper, we obtain the following result: For connected graph G, λ₂ = λ₃ = ... =  λ_n-1 if and only if G is a complete graph or a star graph or a (d₁,d₁) complete bipartite graph. Also we establish the following upper bound for the number of spanning trees of G on n, e and d₁ only:

Measurements of diffuse backscattering Mueller matrices of turbid media

We report on the development of a method that records spatially dependent intensity patterns of polarized light that arise from illuminating a turbid media with a polarized laser beam and being diffusely backscattered. Our technique employs polarized light from a He-Ne laser () which is focused onto the surface of the scattering medium. A surface area of approximately 2×2 cm centered on the light input point is imaged through polarization analysis optics onto a CCD camera. The Mueller matrix is reconstructed by 49 intensity measurements with various orientations of polarizer and analyzer. The measured Mueller matrix of polystyrene spheres was compared with the theory result of incoherent scattering of light by spheres. The experimental and theory results are in excellent agreement. It appears that the azimuthal patterns of the Mueller matrix are determined by the symmetry of the turbid media.     

On graphs with exactly one anti-adjacency eigenvalue and beyond

The anti-adjacency matrix of a graph is constructed from the distance matrix of a graph by keeping each row and each column only the largest distances. This matrix can be interpreted as the opposite of the adjacency matrix, which is instead constructed from the distance matrix of a graph by keeping in each row and each column only the distances equal to 1. The (anti-)adjacency eigenvalues of a graph are those of its (anti-)adjacency matrix. Employing a novel technique introduced by Haemers (2019) [9], we characterize all connected graphs with exactly one positive anti-adjacency eigenvalue, which is an analog of Smith's classical result that a connected graph has exactly one positive adjacency eigenvalue iff it is a complete multipartite graph. On this basis, we identify the connected graphs with all but at most two anti-adjacency eigenvalues equal to ?2 and 0. Moreover, for the anti-adjacency matrix we determine the HL-index of graphs with exactly one positive anti-adjacency eigenvalue, where the HL-index measures how large in absolute value may be the median eigenvalues of a graph. We finally propose some problems for further study.     

Reconstruction of Sparse Polynomials via Quasi-Orthogonal Matching Pursuit Method

In this paper, we propose a Quasi-Orthogonal Matching Pursuit (QOMP) algorithm for constructing a sparse approximation of functions in terms of expansion by orthonormal polynomials. For the two kinds of sampled data, data with noises and without noises, we apply the mutual coherence of measurement matrix to establish the convergence of the QOMP algorithm which can reconstruct $s$-sparse Legendre polynomials, Chebyshev polynomials and trigonometric polynomials in $s$ step iterations. The results are also extended to general bounded orthogonal system including tensor product of these three univariate orthogonal polynomials. Finally, numerical experiments will be presented to verify the effectiveness of the QOMP method.     

n × n 上三角算子矩阵的单值扩张性以及应用*

设X_i是无穷维复Banach空间, L(X_j,X_i)是X_j到X_i上的有界线性算子全体.考虑 n × n 上三角算子矩阵T=(T_ij)_1≤j≤n, 其中T_ij L(X_j,X_i),1≤j≤n; T_ij=0, i>j.本文研究了T的单值扩张性, 通过考察集合S(T)={λ∈C}: T在点λ没有SVEP},证明了S(T)在i=1 ? nS(T_i)中退化,进而给出等式S(T)=i=1 ? n S(T_i)成立的条件. 同时, 考察了T的单值扩张性扰动,得到了S(T)保持对角稳定时T_i所需的条件并予以证明, 同时举例说明这些条件的合理性.最后, 给出单值扩张性关于谱σ(T)和局部谱σT (x)的应用, 得到了谱扰动和局部谱扰动不变的新条件.