Infrared small moving target detection method based on graph matching

We apply graph matching method to detect infrared small moving targets using image sequences. Candidates （interest points） detected in the first frame form one graph and the same candidates in the last frame form another one. The real moving targets are extracted by matching these two graphs. Experimental results demonstrate that the proposed method is robust and efficient to the translation and rotation of the background.     

线性对流占优Sobolev方程的流线扩散有限元方法

Abastract. In this paper,a streamline-diffusion F. E. M. for linear Sobolev equations with con-vection-dominated term is given. According to the range of space-time F. E mesh parameter h,two choices for artifical diffusion parameter are presented,and for the corresponding computa-tion schemes the stability and error estimates in suitable norms are estabilished.     

关于B值行独立随机元阵列部分和的完全收敛性的注记

讨论了p型Banach空间（1≤p≤2）下,B值行独立随机元阵列部分和的完全收敛性,得到了几个充分条件的结果,它们是实值随机变量阵列完全收敛性的推广。     

行NA随机变量三角阵列的完全收敛性

令{Xm;1≤i≤n,n≥1}是行NA的随机变量三角阵列．利用NA随机变量序列的一个矩不等式,讨论了行NA的随机变量三角阵列在被随机变量X弱平均控制的条件下的完全收敛性．所得到的结果推广了行独立的随机变量三角阵列相应的结果．     

Convergences of Random Variables Under Sublinear Expectations

In this note, the authors survey the existing convergence results for random variables under sublinear expectations, and prove some new results. Concretely, under the assumption that the sublinear expectation has the monotone continuity property, the authors prove that convergence in capacity is stronger than convergence in distribution, and give some equivalent characterizations of convergence in distribution. In addition, they give a dominated convergence theorem under sublinear expectations, which may have its own interest.     

Influence of Lower Terms on the Well-Posedness of Characteristics Problems for Third-Order Hyperbolic Equations

In this paper, we consider a general problem of Goursat type for third-order hyperbolic equations of general form with dominated lower terms. We study the influence of the lower terms contained in the equation, as well as those in the boundary conditions, on the well-posedness of the problem under consideration.     

镀减反射膜后半导体激光器端面反射率谱的测量

比较相同偏置条件下镀减反射膜前后的半导体激光器端面自发辐射谱，测得了端面反射率随波长变化的关系曲线。该方法突破了Ｋａｍｉｎｏｗ法单一波长测量的限制，同时也避免了Ｋａｍｉｎｏｗ法在两端面镀膜后所遇到的调制度过小的问题。实验中确定出了低于８×１０（－５）的第二镀膜端面反射率。     

On the set covering polytope: II. Lifting the facets with coefficients in {0, 1, 2}

In an earlier paper (Mathematical Programming 43 (1989) 57–69) we characterized the class of facets of the set covering polytope defined by inequalities with coefficients equal to 0, 1 or 2. In this paper we connect that characterization to the theory of facet lifting. In particular, we introduce a family of lower dimensional polytopes and associated inequalities having only three nonzero coefficients, whose lifting yields all the valid inequalities in the above class, with the lifting coefficients given by closed form expressions.The research underlying this report was supported by Grant ECS-8601660 of the National Science Foundation, Contract N00014-85-K-0198 with the Office of Naval Research, and Grant AFOSR-870292 of the Air Force Office of Scientific Research.     

Minimization of a quasi-concave function over an efficient set

We introduce a projective approach for studying symmetric travelling salesman polytopes (STSPs). Thesymmetric travelling salesman polytope STSP(V) (resp.,Hamiltonian path polytope HP(V)) is the convex hull of incidence vectors of all Hamiltonian cycles (resp., paths) on the complete undirected graph with node setV. For any nodeh V, HP(V) is aprojection of STSP(V {h}). We show that HP(V) and STSP(V {h}) are isomorphic, and HP(V) is of full dimension minus one. By this projective approach, we obtain generalclique-lifting results, all based on simple conditions, for deriving large new classes of STSP facets. These results apply to all known non-trivial STSP facets, and generalize clique-lifting results of Maurras (1975), Grötschel and Padberg (1979) and Naddef and Rinaldi (1988).This research is supported in part by a grant from the Natural Sciences and Engineering Research Council of Canada to the first author.     

Slope limiting for discontinuous Galerkin approximations with a possibly non‐orthogonal Taylor basis

The use of high‐order polynomials in discontinuous Galerkin (DG) approximations to convection‐dominated transport problems tends to cause a violation of the maximum principle in regions where the derivatives of the solution are large. In this paper, we express the DG solution in terms of Taylor basis functions associated with the cell average and derivatives at the center of the cell. To control the (derivatives of the) discontinuous solution, the values at the vertices of each element are required to be bounded by the means. This constraint is enforced using a hierarchical vertex‐based slope limiter to constrain the coefficients of the Taylor polynomial in a conservative manner starting with the highest‐order terms. The loss of accuracy at smooth extrema is avoided by taking the maximum of the correction factors for derivatives of order p and higher. No free parameters, oscillation detectors, or troubled cell markers are involved. In the case of a non‐orthogonal Taylor basis, the same limiter is applied to the vector of discretized time derivatives before the multiplication by the off‐diagonal part of the consistent mass matrix. This strategy leads to a remarkable gain of accuracy, especially in the case of simplex meshes. A numerical study is performed for a 2D convection equation discretized with linear and quadratic finite elements. Copyright © 2012 John Wiley & Sons, Ltd.