一类反应扩散方程奇摄动Robin问题的广义解

讨论了一类奇摄动反应扩散方程R ob in问题.在适当的条件下,研究了问题广义解的渐近性态.     

A Class of Nonlinear Singularly Perturbed Problems for Reaction Diffusion Equations with Boundary Perturbation

A class of nonlinear singularly perturbed problems for reaction diffusion equations with boundary perturbation are considered. Under suitable conditions, the asymptotic behavior of solution for the initial boundary value problems is studied using the theory of differential inequalities.     

非局部反应扩散方程组的爆破性质

本文讨论带Dirichlet边界条件的反应扩散方程组ut(x,t)=△u(x,t)+uα(x,t)．up(0,t),vt(x,t)=△v(x,t)+uβ(x,t)vq(0,t),研究了该问题正解的爆破性质并给出爆破集及其爆破速率．     

AN ESTIMATE ON THE DISTRIBUTION AND MOMENTS OF THE LAST EXIT TIME OF AN ELLIPTIC DIFFUSION PROCESS

Let LB be the last exit time from a compact set B of an elliptic diffusion process X. A moderate estimate for the distribution of LB is obtained, and the sufficient and necessary condition for Ex(LBk)<∞is proved.     

DATA PREORDERING IN GENERALIZED PAV ALGORITHM FOR MONOTONIC REGRESSION

Monotonic regression （MR） is a least distance problem with monotonicity constraints induced by a partiaily ordered data set of observations. In our recent publication [In Ser. Nonconvex Optimization and Its Applications, Springer-Verlag, （2006） 83, pp. 25-33], the Pool-Adjazent-Violators algorithm （PAV） was generalized from completely to partially ordered data sets （posets）. The new algorithm, called CPAV, is characterized by the very low computational complexity, which is of second order in the number of observations. It treats the observations in a consecutive order, and it can follow any arbitrarily chosen topological order of the poset of observations. The CPAV algorithm produces a sufficiently accurate solution to the MR problem, but the accuracy depends on the chosen topological order. Here we prove that there exists a topological order for which the resulted CPAV solution is optimal. Furthermore, we present results of extensive numerical experiments, from which we draw conclusions about the most and the least preferable topological orders.     

Hilbert Space of Probability Density Functions Based on Aitchison Geometry

The set of probability functions is a convex subset of L1 and it does not have a linear space structure when using ordinary sum and multiplication by real constants. Moreover, difficulties arise when dealing with distances between densities. The crucial point is that usual distances are not invariant under relevant transformations of densities. To overcome these limitations, Aitchison＇s ideas on compositional data analysis are used, generalizing perturbation and power transformation, as well as the Aitchison inner product, to operations on probability density functions with support on a finite interval. With these operations at hand, it is shown that the set of bounded probability density functions on finite intervals is a pre-Hilbert space. A Hilbert space of densities, whose logarithm is square-integrable, is obtained as the natural completion of the pre-Hilbert space.     

Convergence to Diffusion Waves for Nonlinear Evolution Equations with Ellipticity and Damping, and with Different End States

In this paper, we consider the global existence and the asymptotic behavior of solutions to the Cauchy problem for the following nonlinear evolution equations with ellipticity and dissipative effects： {ψt=-（1-α）ψ-θx＋αψxx, θt=-（1-α）θ＋νψx＋（ψθ）x＋αθxx（E） with initial data （ψ,θ）（x,0）=（ψ0（x）,θ0（x））→（ψ±,θ±）as x→±∞ where α and ν are positive constants such that α 〈 1, ν 〈 4α（1 - α）. Under the assumption that ｜ψ＋ - ψ-｜ ＋ ｜θ＋ - θ-｜ is sufficiently small, we show the global existence of the solutions to Cauchy problem （E） and （I） if the initial data is a small perturbation. And the decay rates of the solutions with exponential rates also are obtained. The analysis is based on the energy method.     

基于Pena距离的加权最小二乘估计的影响分析

利用Pena距离对加权线性最小二乘估计的影响问题进行讨论,得到加权最小二乘估计的Pena距离的表达式,对其性质进行讨论,从而得到高杠异常点的判别方法.文中对Pena距离与Cook距离的性能进行了对比,得到在一定条件下Pena距离优于Cook距离的结论.并通过数值实验对此方法的有效性进行验证.     

The valuations of the near hexagons related to the Witt designs S(5,6,12) and S(5,8,24)

Valuations of dense near polygons were introduced in 16 . In the present paper, we classify all valuations of the near hexagons ??₁ and ??₂, which are related to the respective Witt designs S(5,6,12) and S(5,8,24). Using these classifications, we prove that if a dense near polygon S contains a hex H isomorphic to ??₁ or ??₂, then H is classical in S. We will use this result to determine all dense near octagons that contain a hex isomorphic to ??₁ or ??₂. As a by‐product, we obtain a purely geometrical proof for the nonexistence of regular near 2d‐gons, d ≥ 4, whose parameters s, t, t_i (0 ≤ i ≤ d) satisfy (s, t₂, t₃) = (2, 1, 11) or (2, 2, 14). The nonexistence of these regular near polygons can also be shown with the aid of eigenvalue techniques. © 2005 Wiley Periodicals, Inc. J Combin Designs 14: 214–228, 2006     

The Two-Point Codes with the Designed Distance on a Hermitian Curve in Even Characteristic

In Homma M and Kim SJ [2], the authors considered two-point codes on a Hermitian curve defined over fields of odd characteristic. In this paper, we study the geometry of a Hermitian curve over fields of even characteristic and classify the two-point codes whose minimum distances agree with the designed ones.