障碍拟阵图

Let G be a simple graph and T={S :S is extreme in G}. If M(V(G), T) is a matroid, then G is called an extreme matroid graph. In this paper, we study the properties of extreme matroid graph.     

On the structure of the optimal server control for fluid networks

This paper derives the optimal trajectories in a general fluid network with server control. The stationary optimal policy in the complete state space is constructed. The optimal policy is constant on polyhedral convex cones. An algorithm is derived that computes these cones and the optimal policy. Generalized Klimov indices are introduced, they are used for characterizing myopic and time-uniformly optimal policies.Received: November 2004 / Revised: February 2005The research of this author has been supported by the project ‘‘Stochastic Networks’’ of the Netherlands Organisation for Scientific Research NWO.     

基于MMD算法的HMM参数重估计的矩阵表示

本文提出的MMD算法用于提高模型区别错误信息和正确信息的能力．利用该算法在对模型的参数进行重估计时．涉及到复杂的目标函数的梯度运算．击运用矩阵运算使得梯度运算变得简单明了，因此本文给出了MMD算法下的HMM参数重估计的矩阵表示形式并给出了证明．     

广义多目标minmax问题的最优性条件和极大熵方法

本文讨论了广义多目标minmax问题的最优性条件。利用极大熵逼近函数，研究了广义多目标minmax；问题的逼近问题，在较弱的条件下，证明了由极大熵逼近函数导出的多目标逼近问题的临界点的任一极限点均为原广义多目标minmax问题的临界点。     

估计死亡率分布的一个最大熵模型

本文提出了一种估计死亡率分布的新模型一最大熵模型。该模型直接从样本信息出发，不需要对待估分布的概率密度函数或先验分布作任何假定，从而克服了极大似然估计和贝叶斯估计的不足。而且通过两个例子的计算结果，表明该方法与样本数据的拟合效果要好于其它两种方法。     

机载海洋激光测深系统参量设计与最大探测深度能力分析

详细讨论了机载海洋激光测深系统最大测量深度与相关因子之间的关系，并利用最小可探测信噪比为判据，对机载海洋激光测深系统在白天和晚上工作进行了数值模拟，通过比较最大测量深度与激光脉冲峰值功率、接收视场角、接收口径和光谱接收带宽等关系，确定了系统的主要参量。以确定的参量建立的系统具有白天49m和晚上65m的最大测深能力，可完全满足在沿岸带以及岛礁的测量要求。     

Elliptic and parabolic problems in unbounded domains

We consider elliptic and parabolic problems in unbounded domains. We give general existence and regularity results in Besov spaces and semi‐explicit representation formulas via operator‐valued fundamental solutions which turn out to be a powerful tool to derive a series of qualitative results about the solutions. We give a sample of possible applications including asymptotic behavior in the large, singular perturbations, exact boundary conditions on artificial boundaries and validity of maximum principles. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Explicit 2-Factorisations of the Odd Graph

In this note we show how 1-factors in the middle two layers of the discrete cube can be used to construct 2-factors in the Odd graph (the Kneser graph of (k − 1)-sets from a (2k − 1)-set). In particular, we use the lexical matchings of Kierstead and Trotter, and the modular matchings of Duffus, Kierstead and Snevily, to give explicit constructions of two different 2-factorisations of the Odd graph. This revised version was published online in September 2006 with corrections to the Cover Date.     

A monotone iterative scheme for a nonlinear second order equation based on a generalized anti–maximum principle

In this paper, a generalized anti–maximum principle for the second order differential operator with potentials is proved. As an application, we will give a monotone iterative scheme for periodic solutions of nonlinear second order equations. Such a scheme involves the L^p norms of the growth, 1 ≤ p ≤ ∞, while the usual one is just the case p = ∞.