On the fundamental sloshing frequency in the ice-fishing problemSur la fréquence de ballottement principale dans le problème de la glace avec trous pour pêcher

The sloshing problem is considered in a half-space covered by a rigid dock with apertures. The dependence of the fundamental sloshing frequency on the shape of the free surface region is studied. It is proved that the inequality holds between the fundamental eigenvalues corresponding to two different regions if some conditions are fulfilled. These conditions are verified for particular classes of regions of a fixed area in order to demonstrate that the disk yields the maximum of the fundamental eigenvalue for each of these classes. On the other hand, examples of regions are constructed for which the fundamental eigenfrequency is larger than that for the circular aperture of the same area and even as large as one wishes. To cite this article: V. Kozlov, N. Kuznetsov, C. R. Mecanique 330 (2002) 723–728.     

Well-posedness and stability of the repairable system with N failure modes and one standby unit

The well-posedness and stability of the repairable system with N failure modes and one standby unit were discussed by applying the c₀ semigroups theory of function analysis. Firstly, the integro-differential equations described the system were transformed into some abstract Cauchy problem of Banach space. Secondly, the system operator generates positive contractive c₀ semigroups T(t) and so the well-posedness of the system was obtained. Finally, the spectral distribution of the system operator was analyzed. It was proven that 0 is strictly dominant eigenvalue of the system operator and the dynamic solution of the system converges to the steady-state solution. The steady-state solution was shown to be the eigenvector of the system operator corresponding to the eigenvalue 0. At the same time the dynamic solution exponentially converges to the steady-state solution.     

The distance-regular graphs such that all of its second largest local eigenvalues are at most one

In this paper, we classify distance regular graphs such that all of its second largest local eigenvalues are at most one. Also we discuss the consequences for the smallest eigenvalue of a distance-regular graph. These extend a result by the first author, who classified the distance-regular graphs with smallest eigenvalue .     

The inverse eigenvalue problem of generalized reflexive matrices and its approximation

This paper studies inverse eigenvalue problems of generalized reflexive matrices and their optimal approximations. Necessary and sufficient conditions for the solvability of the problems are derived, the solutions and their optimal approximations are provided.     

Markov-Bernstein inequalities for generalized Gegenbauer weight

The Markov-Bernstein inequalities for generalized Gegenbauer weight are studied. A special basis of the vector space Pn of real polynomials in one variable of degree at most equal to n is proposed. It is produced by quasi-orthogonal polynomials with respect to this generalized Gegenbauer measure. Thanks to this basis the problem to find the Markov-Bernstein constant is separated in two eigenvalue problems. The first has a classical form and we are able to give lower and upper bounds of the Markov-Bernstein constant by using the Newton method and the classical qd algorithm applied to a sequence of orthogonal polynomials. The second is a generalized eigenvalue problem with a five diagonal matrix and a tridiagonal matrix. A lower bound is obtained by using the Newton method applied to the six term recurrence relation produced by the expansion of the characteristic determinant. The asymptotic behavior of an upper bound is studied. Finally, the asymptotic behavior of the Markov-Bernstein constant is O(n²) in both cases.     

The rotational dimension of a graph

Given a connected graph G = (N, E) with node weights s∈? and nonnegative edge lengths, we study the following embedding problem related to an eigenvalue optimization problem over the second smallest eigenvalue of the (scaled) Laplacian of G: Find v_i∈?^|N|, i∈N so that distances between adjacent nodes do not exceed prescribed edge lengths, the weighted barycenter of all points is at the origin, and is maximized. In the case of a two‐dimensional optimal solution this corresponds to the equilibrium position of a quickly rotating net consisting of weighted mass points that are linked by massless cables of given lengths. We define the rotational dimension of G to be the minimal dimension k so that for all choices of lengths and weights an optimal solution can be found in ?^k and show that this is a minor monotone graph parameter. We give forbidden minor characterizations up to rotational dimension 2 and prove that the rotational dimension is always bounded above by the tree‐width of G plus one. © 2010 Wiley Periodicals, Inc. J Graph Theory 66:283‐302, 2011     

图模式挖掘中的子图同构算法

图模式挖掘问题在Web挖掘、生物信息学、社会关系等众多领域有广泛的应用,它涉及到子图的搜索以及子图的同构问题.这两个问题都具有相当高的计算复杂度,现有的子图同构问题大多采用最小编码算法,但对无标签图特别是对无标签无向图,该算法效率较底,从而子图的同构成为图模式挖掘问题的一个瓶颈.针对无标签图,以代数理论为基础,分别利用度序列和特征值构造了两种子图同构算法,用于对有向图和无向图的同构判别.最后对2个真实生物网络进行了仿真实验,结果表明,算法的效率优于现有算法.     

机器人及其安全系统的可靠性分析

是以机器人及其安全系统所构成的一个可修复系统作为研究对象,运用泛函分析方法并结合C_0半群理论,证明了严格占优本征值在本系统的存在性并且是系统严格占优本征值,进一步证明了在一定条件下,系统的动态解以指数化形式收敛于系统的稳态解.     

Extrapolation of Mixed Finite Element Approximations for the Maxwell Eigenvalue Problem

In this paper,a general method to derive asymptotic error expansion formulas for the mixed finite element approximations of the Maxwell eigenvalue problem is established.Abstract lemmas for the error of the eigenvalue approximations are obtained.Based on the asymptotic error expansion formulas,the Richardson extrapolation method is employed to improve the accuracy of the approximations for the eigenvalues of the Maxwell system from θ(h2) to θ(h4) when applying the lowest order Nédé1ec mixed finite element and a nonconforming mixed finite element.To our best knowledge,this is the first superconvergence result of the Maxwell eigenvalue problem by the extrapolation of the mixed finite element approximation.Numerical experiments are provided to demonstrate the theoretical results.