G-网络排队系统的研究新进展

在研究排队网络的文献中,G-网络(即推广的排队网络)最近受到了国际学者广泛的关注,它的研究在一定程度上丰富了排队网络的内容.正因为有很多学者投入到此项研究中,新的结果是层出不穷的.本文简短地介绍G-网络近年来的发展.     

On the uniqueness of the foliation of spheres of constant mean curvature in asymptotically flat 3-manifolds

In this note we study constant mean curvature surfaces in asymptotically flat 3-manifolds. We prove that, outside a given compact subset in an asymptotically flat 3-manifold with positive mass, stable spheres of given constant mean curvature are unique. Therefore we are able to conclude that the foliation of stable spheres of constant mean curvature in an asymptotically flat 3-manifold with positive mass outside a given compact subset is unique.

     

Mean curvature flow with a forcing term in minkowski space

We study the forced mean curvature flow of graphs in Minkowski space and prove longtime existence of solutions. When the forcing term is a constant, we prove convergence to either a constant mean curvature hypersurface or a translating soliton – depending on the boundary conditions at infinity. It is a pleasure to thank my PhD advisors Klaus Ecker and Gerhard Huisken for their assistance and encouragement. I also thank Maria Athanassenas, Oliver Schnürrer and Marty Ross for their interest and useful comments, and the Max Planck Gesellschaft for financial support.     

Structure of minimizers in linear-quadratic Bolza problems of optimal control

In this paper, we study intersections of extremals in a linear-quadratic Bolza problem of optimal control. The structure of the inter-sections is described. We show that this structure implies the semipositive definiteness of the quadratic cost functional. In addition, we derive necessary and sufficient conditions for the existence of minimizers.     

火工品可靠性试验数据的综合分析方法

升降法试验数据和固定刺激量下的成败型试验数据,是两种最常见的火工品可靠性试验数据．我们应用Markov链,研究了升降法试验数据下,感度分布参数的极大似然估计的特性．在此基础上,应用Bootstrap方法和Bayes方法,给出了综合分析两种试验数据的方法．最后,将该方法应用于520底火的可靠性鉴定,得出了有益的结论．     

Convergence Rate of The Trust Region Method for Nonlinear Equations Under Local Error Bound Condition

In this paper, we present the new trust region method for nonlinear equations with the trust region converging to zero. The new method preserves the global convergence of the traditional trust region methods in which the trust region radius will be larger than a positive constant. We study the convergence rate of the new method under the local error bound condition which is weaker than the nonsingularity. An example given by Y.X. Yuan shows that the convergence rate can not be quadratic. Finally, some numerical results are given. This work is supported by Chinese NSFC grants 10401023 and 10371076, Research Grants for Young Teachers of Shanghai Jiao Tong University, and E-Institute of Computational Sciences of Shanghai Universities. An erratum to this article is available at .     

On Extracting Maximum Stable Sets in Perfect Graphs Using Lovász's Theta Function

We study the maximum stable set problem. For a given graph, we establish several transformations among feasible solutions of different formulations of Lovász's theta function. We propose reductions from feasible solutions corresponding to a graph to those corresponding to its induced subgraphs. We develop an efficient, polynomial-time algorithm to extract a maximum stable set in a perfect graph using the theta function. Our algorithm iteratively transforms an approximate solution of the semidefinite formulation of the theta function into an approximate solution of another formulation, which is then used to identify a vertex that belongs to a maximum stable set. The subgraph induced by that vertex and its neighbors is removed and the same procedure is repeated on successively smaller graphs. We establish that solving the theta problem up to an adaptively chosen, fairly rough accuracy suffices in order for the algorithm to work properly. Furthermore, our algorithm successfully employs a warm-start strategy to recompute the theta function on smaller subgraphs. Computational results demonstrate that our algorithm can efficiently extract maximum stable sets in comparable time it takes to solve the theta problem on the original graph to optimality. This work was supported in part by NSF through CAREER Grant DMI-0237415. Part of this work was performed while the first author was at the Department of Applied Mathematics and Statisticsat Stony Brook University, Stony Brook, NY, USA.     

Nonlinear Time Series Analysis Since 1990:Some Personal Reflections

Abstract I reflect upon the development of nonlinear time series analysis since 1990 by focusing on five majorareas of development. These areas include the interface between nonlinear time series analysis and chaos,thenonparametric/semiparametric approach,nonlinear state space modelling,financial time series and nonlinearmodelling of panels of time series.     

用干涉方法测量薄膜应力

基于基片弯曲法和牛顿环的基本原理,使用He-Ne激光器、扩束镜、凸透镜和带分光镜的移测显微镜,搭建了薄膜应力测量装置.采用直流溅射法制备了厚度为30~144 nm的银薄膜,衬底采用厚度为0.15 mm、直径为18 mm的圆形玻璃片.实验发现,薄膜厚度对银薄膜的内应力有显著的影响,在薄膜厚度很小时,随着薄膜厚度的增加,应力迅速增大,达到最大值后,随着厚度的继续增加,薄膜应力下降较快并趋于稳定值.     

Characterisations of function spaces of generalised smoothness

We investigate function spaces of generalised smoothness of Besov and Triebel–Lizorkin type. Equivalent quasi-norms in terms of maximal functions and local means are given. An atomic decomposition theorem for this type of spaces is proved. Mathematics Subject Classification (2000) 46E35