CLASSIFICATIONS OF (2,1)-STABLE AND(1,2)-STABLE UNFOLDINGS OF MAP GERMS WITH CODIMENTION<3

This paper classifies (2,1)-stable and (1,2)-stable unfoldings of map germs with codimentions ≤ 3 by means of the algorithm given by Wassermann.     

Cauchy's Theorem on Manifolds

A generalization of the Cauchy theory of forces and stresses to the geometry of differentiable manifolds is presented using the language of differential forms. Body forces and surface forces are defined in terms of the power densities they produce when acting on generalized velocity fields. The normal to the boundary is replaced by the tangent space equipped with the outer orientation induced by outward pointing vectors. Assuming that the dimension of the material manifold is m, stresses are modelled as m − 1 covector valued forms. Cauchy's formula is replaced by the restriction of the stress form to the tangent space of the boundary while the outer orientation of the tangent space is taken into account. The special cases of volume manifolds and Riemannian manifolds are discussed. This revised version was published online in August 2006 with corrections to the Cover Date.     

Convergence of the solution of a nonsymmetric matrix Riccati differential equation to its stable equilibrium solution

We consider the initial value problem for a nonsymmetric matrix Riccati differential equation, where the four coefficient matrices form an M-matrix. We show that for a wide range of initial values the Riccati differential equation has a global solution X(t) on [0,∞) and X(t) converges to the stable equilibrium solution as t goes to infinity.     

Hugoniot–Maslov chains of a shock wave in conservation law with polynomial flow

In this paper we give a theoretical foundation to the asymptotical development proposed by V. P. Maslov for shock type singular solutions of conservations laws, in the framework of Colombeau theory of generalized functions. Indeed, operating with Colombeau differential algebra of simplified generalized functions, we proof that Hugoniot–Maslov chains are necessary conditions for the existence of shock waves in conservation laws with polynomial flows. As a particular case, these equations include the Hugoniot–Maslov chains for shock waves in the Hopf equation. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

On conservation laws and boundary conditions for “short waves” equation

In this paper we study local conservation laws for the equation of short waves in the form of a variational problem. We analyze an infinite symmetry group of the equation and generate a finite number of conservation laws corresponding to given infinite symmetries through appropriate boundary conditions.     

Semidefinite programming in combinatorial optimization

We discuss the use of semidefinite programming for combinatorial optimization problems. The main topics covered include (i) the Lovász theta function and its applications to stable sets, perfect graphs, and coding theory, (ii) the automatic generation of strong valid inequalities, (iii) the maximum cut problem and related problems, and (iv) the embedding of finite metric spaces and its relationship to the sparsest cut problem. Part of this work is supported by NSF contract 9623859-CCR, a Sloan Foundation Fellowship, and ARPA Contract N00014-95-1-1246.     

Lie–Bäcklund and Noether Symmetries with Applications

New identities relating the Euler–Lagrange, Lie–Bäcklund and Noether operators are obtained. Some important results are shown to be consequences of these fundamental identities. Furthermore, we generalise an interesting example presented by Noether in her celebrated paper and prove that any Noether symmetry is equivalent to a strict Noether symmetry, i.e. a Noether symmetry with zero divergence. We then use the symmetry based results deduced from the new identities to construct Lagrangians for partial differential equations. In particular, we show how the knowledge of a symmetry and its corresponding conservation law of a given partial differential equation can be utilised to construct a Lagrangian for the equation. Several examples are given.     

Discrete and Continuous Random Walk Models for Space-Time Fractional Diffusion

A mathematical approach to anomalous diffusion may be based on generalized diffusion equations (containing derivatives of fractional order in space or/and time) and related random walk models. A more general approach is however provided by the integral equation for the so-called continuous time random walk (CTRW), which can be understood as a random walk subordinated to a renewal process. We show how this integral equation reduces to our fractional diffusion equations by a properly scaled passage to the limit of compressed waiting times and jumps. The essential assumption is that the probabilities for waiting times and jumps behave asymptotically like powers with negative exponents related to the orders of the fractional derivatives. Illustrating examples are given, numerical results and plots of simulations are displayed.     

Hamiltonian operators and ℓ-coverings

An efficient method to construct Hamiltonian structures for nonlinear evolution equations is described. It is based on the notions of variational Schouten bracket and ℓ^*-covering. The latter serves the role of the cotangent bundle in the category of nonlinear evolution PDEs. We first consider two illustrative examples (the KdV equation and the Boussinesq system) and reconstruct for them the known Hamiltonian structures by our methods. For the coupled KdV–mKdV system, a new Hamiltonian structure is found and its uniqueness (in the class of polynomial (x,t)-independent structures) is proved. We also construct a nonlocal Hamiltonian structure for this system and prove its compatibility with the local one.     

基于快速轮廓转动力矩特征的激光主动成像目标识别

针对激光主动成像的图像特性,提出一种基于快速轮廓转动力矩的目标识别方法。将转动力矩的概念引入目标识别中,提出的快速轮廓转动力矩特征(FCTF)不仅包含了轮廓的尺寸、位置、规则度以及目标的亮暗等信息,同时对于旋转、尺度缩放等变换具有不变性。采用转动力矩的快速计算方法,提高了识别算法的计算效率。识别算法首先使用最大稳定极值区域(MSER)算法检测出目标特征区域,并将其变换为圆形区域,然后结合快速转动力矩特征算法提取出目标区域的局部不变特征,最后输入训练好的支持向量机分类器进行识别。实验结果表明相比于已有的激光主动成像目标识别方法,所提算法对于旋转、仿射变换均具有更高的识别率,同时单帧平均运算时间为9.68 ms,满足激光主动成像目标识别系统实时性的要求。