具有控制系数的高阶线性微分方程复振荡的一个结果

该文考虑具有控制系数 A\-0 和系数仅有有限个极点的高阶线性齐次微分方程（1.1）。得到了一个复振荡结果，该结果是J. K. Langley［11］等作者在整系数下相应结果的推广。     

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

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

A non‐linear and non‐local boundary condition for a diffusion equation in petroleum engineering

This article deals with a boundary value problem for Laplace equation with a non‐linear and non‐local boundary condition. This problem comes from petroleum engineering and is used to obtain an estimation of well productivity. The non‐linear and non‐local boundary condition is written on the well boundary. On the outer reservoir boundaries, we have both Dirichlet and Neumann conditions. In this paper, we prove the existence and uniqueness of a solution to this problem. The existence is proved by Schauder theorem and the uniqueness is obtained under more restricted conditions, when the involved operator is a contraction. Copyright © 2005 John Wiley & Sons, Ltd.     

Probability Inequalities and Limit Theorems for Generalized L-Statistics

We obtain exponential upper bounds for tails of distributions of generalized L-statistics based on a sample from an exponential distribution. We prove the asymptotic normality of generalized L-statistics based on a sample from the uniform distribution on [0,1] and of L-statistics with decomposed kernels (without any restrictions on the sample distribution type).     

Fractional Brownian Heavy Traffic Approximations of Multiclass Feedforward Queueing Networks

We consider multiclass feedforward queueing networks under first in first out and priority service disciplines driven by long-range dependent arrival and service time processes. We show that in critical loading the normalized workload, queue length and sojourn time processes can converge to a multi-dimensional reflected fractional Brownian motion. This weak heavy traffic approximation is deduced from a deterministic pathwise approximation of the network behavior close to constant critical load in terms of the solution of a Skorokhod problem. Since we model the doubly infinite time interval, our results directly cover the stationary case.AMS subject classification: primary 90B15, secondary 60K25, 68M20     

NCD系统的数学理论

无索赔折扣系统(No Claim Discount system,简记为NCD系统)是世界各国机动车辆险中广泛采用的一种经验费率厘定机制.本文尝试建立了NCD系统严谨的数学理论, 重点讨论了NCD系统的数学建模和稳态分析.此外,作为本文必要的数学前提,首先在第2节着重探讨了随机矩阵间的随机优序关系,并将所得结论运用至齐次不可约且遍历的马尔科夫链的研究中,这些内容也有其独立的数学上的兴趣.     

OSCILLATION RESULTS FOR A SECOND ORDER NEUTRAL DELAY DIFFERENTIAL EQUATIONS

Some new oscillation criteria are established for a second order neutral delay differential equations. These results improve oscillation results of Y.V. Rogo-vchenko for the retarded delay differential equations. The relevance of our theorems is illustrated with two carefully selected examples.     

Minimum Distance Between the Faces of Two Convex Polyhedra: A Sufficient Condition

The problem of finding the Euclidean distance between two convex polyhedra can be reduced to the combinatorial optimization problem of finding the minimum distance between their faces. This paper presents a global optimality criterion for this problem. An algorithm (QLDPA) for the fast computation of the distance between convex and bounded polyhedra is proposed as an application of it. Computer experiments show its fast performance, especially when the total number of vertices is large.     

Multiple Window and Cluster Size Scan Procedures

Researchers apply scan statistics to test for unusually large clusters of events within a time window of specified length w, or alternatively an unusually small window w that contains a specified number of events. In some cases, the researcher is interested in testing for a range of specified window lengths, or a set of several specified number of events k (cluster sizes). In this paper, we derive accurate approximations for the joint distributions of scan statistics for a range of values of w, or of k, that can be used to set an experiment-wide level of significance that takes into account the multiple comparisons involved. We use these methods to compare different ways of choosing the window sizes for the different cluster sizes. One special case is a multiple comparison procedure based on a generalized likelihood ratio test (GLRT) for a range of window sizes. We compare the power of the GLRT with another method for allocating the window sizes. We find that the GLRT is sensitive for very small window sizes at the expense of moderate and larger window sizes. We illustrate these results on two examples, one involving clustering of translocation breakpoints in DNA, and the other involving disease clusters.     

Fourier-Feynman transform, convolution and first variation

We examine several interesting relationships and expressions involving Fourier-Feynman transform, convolution product and first variation for functionals in the Fresnel class F(B) of an abstract Wiener space B. We also prove a translation theorem and Parseval's identity for the analytic Feynman integral. This revised version was published online in June 2006 with corrections to the Cover Date.