一般形式的密度估计

对于一般形式的核密度估计,我们指出ComposV.S.M.和DoreaC.C.Y.2001年论文中存在的几处错误,且给出了正确的结果及其证明.推广了一些有关文献中关于连续型密度和离散型分布核估计的若干结果.     

刻度指数族参数的经验Bayes检验函数收敛速度的改进

在加权线性损失下导出了刻度指数族中参数单调的Bayes检验函数,利用同分布负相协(NA)样本情形概率密度函数及其导数的核估计构造了经验Bayes(EB)检验函数,获得了EB检验函数的收敛速度.在适当的条件下,这一收敛速度可任意接近O(n~(-1)),改进了文献中已有的结果.对同分布正相协(PA)样本和独立同分布(iid)样本情形,亦可获得类似结论.最后给出了一个满足文中主要结果的例子.     

NA样本密度函数估计一致渐近正态性的收敛速度

在平稳NA样本下,讨论了未知密度函数估计的一致渐近正态性.在适当的条件下给出了该密度函数估计一致渐近正态性的收敛速度.这个速度几乎达到n^{-1/6}     

截断样本下的强率函数和密度函数核估计的渐进正态性

本文用[1]发展的计数过程去研究截断样本下强率函数核估计的渐进正态性．在弱于[7]和[10]的条件下，得到了更一般的结果．接着我们将这种方法运用到密度函数核估计，在较弱的条件下，得到了截断样本下密度函数核估计的渐进正态性．     

相协样本下密度核估计的联合渐近分布

证明了相协样本下密度函数的核估计在有限个不同点上的联合渐近分布为多维正态分布.     

基于相依数据的非参数回归函数和尺度函数的联立稳健估计

该文将Hrdle和Tsybakov的结果推广到数据来自α-混合的严平稳序列的情形,得到了估计的相合性和渐近正太性.在小样本的情形下给出了随机模拟结果,以检查所提出估计的表现.     

关于Romanoff常数及其推广问题

1934年,Romanoff证明了：可表为一个素数和一个2的方幂之和的大奇数在全体正整数中具有正密度．本文证明了此密度大于0．09322,从而改进了该问题的已有结果0．0868．作为此问题的推广,本文还建立了一个类似的数值结果：可表为两个素数的平方和两个2的方幂之和的大偶数具有正密度．     

φ-混合样本下密度函数的导数的核估计的一致强相合性

本文在样本为同分布Φ-混合随机变量序列的情形下研究了密度函数的导数的随机窗宽核估计的一致强相合性。     

双参数指数分布环境因子的Bayes估计

讨论了定数截尾样本下双参数指数分布环境因子的极大似然估计、区间估计和Bayes估计.以参数后验密度的商密度作为环境因子的后验密度,并结合专家经验运用Bayes方法给出了环境因子在平方损失下和LINEX损失下的Bayes估计.最后运用Monte Carlo方法对各估计结果的均方误差(MSE),进行了模拟比较.结果表明LINEX损失下环境因子的估计较好.     

缺失数据下线性EV模型的参数估计

给出EV模型下数据具有随机缺失时,模型参数的一种估计方法,并以一个简单模型为例给出了这种新估计的渐近正态性的具体结果.模拟研究表明,即使在有限样本情形,提出的方法在估计效率上也具有一定优势.     

Extending tests for convergence of number series

Analyzing several classical tests for convergence/divergence of number series, we relax the monotonicity assumption for the sequence of terms of the series. We verify the sharpness of the obtained results on corresponding classes of sequences and functions.     

Existence and uniqueness of global classical solutions to 3D isentropic compressible Navier-Stokes equations with general initial data

In this paper we study the global existence and uniqueness of classical solutions to the Cauchy problem for 3D isentropic compressible Navier-Stokes equations with general initial data which could contain vacuum.We give the relation between the viscosity coefficients and the initial energy,which implies that the Cauchy problem under consideration has a global classical solution.     

‘Multidimensional’ extensions and a nested dual approach for the m-median problem

A general framework for modeling median type locational decisions, where (i) travel costs and demands may be stochastic, (ii) multiple services or commodities need to be considered, and/or (iii) multiple median type objectives might exist, is presented—using the concept of “multidimensional networks”. The classical m-median problem, the stochastic m-median problem, the multicommodity m-median problem and and multiobjective m-median problem are defined within this framework.By an appropriate transformation of variables, the multidimensional m-median problem simplifies to the classical m-median problem but with a K-fold increase in the number of nodes, where K is the number of dimensions of the network. A nested dual approach to solve the resulting classical m-median problem, that uses Erlenkotter's facility location scheme as a subroutine, is presented. Computational results indicate that the procedure may perhaps be the best available one to solve the m-median problem exactly.     

Infinite dimensional general linear groups have finite width

A group is said to have finite width whenever it has finite width with respect to each inverse-closed generating set. Bergman showed [1] that infinite symmetric groups have finite width and asked whether the automorphism groups of several classical structures have finite width, mentioning in particular infinite dimensional general linear groups over fields. In this article we prove that infinite dimensional general linear groups over arbitrary division rings have finite width. We consider the problem of finite width for other infinite dimensional classical groups.     

Initial Value Problem for General Quasilinear Hyperbolic Systems with Characteristics with Constant Multiplicity

The authors consider the global existence and the blow-up phenomenon of classical solutions with small amplitude to the Cauchy problem for general quasilinear hyperbolic systems with characteristics with constant multiplicity and given some applications.     

一类一阶非线性微分方程封闭可积条件

本文得到了较为广泛的一类一阶非线性微分方程的封闭可积充分条件 ,其实用性之一表现在著名的 Riccati方程和 Appel方程的一些古典的和近代的可积性结果都是它的特例     

Caristi 不动点定理的推广及应用

本文推广了古典的Garisti不动点定理,作为应用,古典的Ekeland变分原理得到了推广,并且证明了推广的Garisti不动点定理和推广的Ekeland变分原理是等价的．     

Study of the mixed finite volume method for Stokes and Navier‐Stokes equations

We present finite volume schemes for Stokes and Navier‐Stokes equations. These schemes are based on the mixed finite volume introduced in (Droniou and Eymard, Numer Math 105 (2006), 35‐71), and can be applied to any type of grid (without “orthogonality” assumptions as for classical finite volume methods) and in any space dimension. We present numerical results on some irregular grids, and we prove, for both Stokes and Navier‐Stokes equations, the convergence of the scheme toward a solution of the continuous problem. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2009     

Some proximal algorithms for linearly constrained general variational inequalities

Based on the classical proximal point algorithm (PPA), some PPA-based numerical algorithms for general variational inequalities (GVIs) have been developed recently. Inspired by these algorithms, in this article we propose some proximal algorithms for solving linearly constrained GVIs (LCGVIs). The resulted subproblems are regularized proximally, and they are allowed to be solved either exactly or approximately.     

A parareal approach of semi‐linear parabolic equations based on general waveform relaxation

We present a parareal approach of semi‐linear parabolic equations based on general waveform relaxation (WR) at the partial differential equation (PDE) level. An algorithm for initial‐boundary value problem and two algorithms for time‐periodic boundary value problem are constructed. The convergence analysis of three algorithms are provided. The results show that the algorithm for initial‐boundary value problem is superlinearly convergent while both algorithms for the time‐periodic boundary value problem linearly converge to the exact solutions at most. Numerical experiments show that the parareal algorithms based on general WR at the PDE level, compared with the parareal algorithm based on the classical WR at the ordinary differential equations (ODEs) level (the PDEs is discretized into ODEs), require much fewer number of iterations to converge.