罗尔中值定理的一些新证法(英文)

给出了罗尔微分中值定理的三种新的证明方法,其中第二种很简便的方法仅依赖于大家熟知的Heine-Borel有限覆盖定理.由此可见罗尔微分中值定理可以是实数的完备性的直接推论.     

McKay箭图与覆盖空间

本文研究在自然扩张和嵌入下特殊线性群和一般线性群的有限子群的McKay 箭图间的关系. 我们证明在特定条件下, 一般线性群GL(m;C) 的有限子群G的McKay 箭图是其正规子群G∩SL(m;C)的McKay 箭图的正则覆盖, 而当把G 嵌入SL(m+1;C) 时, 新的McKay 箭图由在原来的McKay 箭图的每一顶点加上一个由其Nakayama 平移到其自身的箭向得到. 作为例子, 我们指出如何用这些方法得到一些有趣的McKay 箭图.     

激光干涉测速技术在内弹道弹丸速度测量中的应用研究

 利用任意反射面激光干涉测速（VISAR）系统以及全光纤位移干涉仪（FDI）,测量了线膛炮弹丸速度,获得了线膛炮弹丸在0~491 μs内从零加速到140 m/s的速度历史,弹丸运动了20.7 mm,出炮口时的弹丸速度为817 m/s。实验结果表明,影响激光干涉测速技术在内弹道测量中应用的主要因素是炮口烟。研究结果对于深入探索激光干涉测速技术在内弹道测量中的应用有重要的参考意义。     

CBERS-02B星HR相机内方位元的在轨标定方法

遥感相机内方位元素的在轨标定对遥感图像的定位和测量具有重要意义.利用线阵推扫传感器构像模型,提出了一种对CBERS-02B星HR相机内方位元素进行在轨标定的方法.该方法以内方位元素和姿态角为未知参数,建立地面控制点和相应像点的共线方程组,通过解算共线方程组获得内方位元素.实验证明,用该方法对内方位元素进行在轨标定,具有...     

Solving the logit-based stochastic user equilibrium problem with elastic demand based on the extended traffic network model

This paper proposes a novel extended traffic network model to solve the logit-based stochastic user equilibrium (SUE) problem with elastic demand. In this model, an extended traffic network is established by properly adding dummy nodes and links to the original traffic network. Based on the extended traffic network, the logit-based SUE problem with elastic demand is transformed to the SUE problem with fixed demand. Such problem is then further converted to a linearly constrained convex programming and addressed by a predictor–corrector interior point algorithm with polynomial complexity. A numerical example is provided to compare the proposed model with the method of successive averages (MSA). The numerical results indicate that the proposed model is more efficient and has a better convergence than the MSA.     

关于凸体覆盖的Hadwiger猜想的两个等价形式

令K是一个内部(记作intK)包含原点o的凸体,bdK为其边界,m为覆盖K所需的intK的平移的最小个数.本文证明,存在正实数η和含于η(bdK)的m元点集C1使得C1+int K覆盖K;存在正实数η′、实数γ∈(0,1)和含于η′(bd K)的m元点集C2使得C2+γK覆盖K.基于这两个事实,本文得到关于凸体覆盖的Hadwiger猜想的两个等价形式.本文还引入一个可以替代宗传明提出的攻克Hadwiger猜想的数量方案中的γm(K)的新泛函.     

A characterization of spaces of constant curvature by minimum covering radius of triangles

In this paper, we prove that if in a Riemannian manifold, the minimum covering radius of a point triple of small diameter depends only on the geodesic distances between the points, then the manifold must be of constant curvature. This implies that if in a complete connected Riemannian manifold, the volume of the intersection of three small geodesic balls of equal radii depends only on the distances between the centers and the radius, then it is one of the simply connected spaces of constant curvature. This generalizes an earlier result of the first author and D. Kunszenti-Kovács (2010).     

Uniform convergence analysis of hybrid numerical scheme for singularly perturbed problems of mixed type

In this article, we consider a class of singularly perturbed mixed parabolic‐elliptic problems whose solutions possess both boundary and interior layers. To solve these problems, a hybrid numerical scheme is proposed and it is constituted on a special rectangular mesh which consists of a layer resolving piecewise‐uniform Shishkin mesh in the spatial direction and a uniform mesh in the temporal direction. The domain under consideration is partitioned into two subdomains. For the spatial discretization, the proposed scheme is comprised of the classical central difference scheme in the first subdomain and a hybrid finite difference scheme in the second subdomain, whereas the time derivative in the given problem is discretized by the backward‐Euler method. We prove that the method converges uniformly with respect to the perturbation parameter with almost second‐order spatial accuracy in the discrete supremum norm. Numerical results are finally presented to validate the theoretical results.© 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 30: 1931–1960, 2014     

ON THE BOREL DIRECTION OF K-QUASIMEROMORPHIC MAPPINGS

For the K-quasimeromorphic mappings, a precise fundamental inequality for the angular domain is established. From this, the Borel direction of the K-quasimeromorphic mappings of zero order is derived.     

Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming

In this paper we present a primal-dual inexact infeasible interior-point algorithm for semidefinite programming problems (SDP). This algorithm allows the use of search directions that are calculated from the defining linear system with only moderate accuracy, and does not require feasibility to be maintained even if the initial iterate happened to be a feasible solution of the problem. Under a mild assumption on the inexactness, we show that the algorithm can find an -approximate solution of an SDP in O(n²ln(1/)) iterations. This bound of our algorithm is the same as that of the exact infeasible interior point algorithms proposed by Y. Zhang.Research supported in part by the Singapore-MIT alliance, and NUS Academic Research Grant R-146-000-032-112.Mathematics Subject Classification (1991): 90C05, 90C30, 65K05