LONG-TIME BEHAVIOR OF A CLASS OF REACTION DIFFUSION EQUATIONS WITH TIME DELAYS

The present paper devotes to the long-time behavior of a class of reaction diffusion equations with delays under Dirichlet boundary conditions. The stability and global attractability for the zero solution are provided, and the existence, stability and attractability for the positive stationary solution are also obtained.     

TWO-POINT BOUNDARY VALUE PROBLEM FOR A CLASS OF SECOND-ORDER DIFFERENCE EQUATIONS

In this paper, we apply a critical point theorem and obtain the condition for the existence of three solutions to two-point boundary value problem of a second order nonlinear difference equation.     

猜想M(2k,k+1)=3k-1+[(k-1)/2]的反例

Brualdi与Jung在[1]中研究了一类具有固定线和k的n×n矩阵上的最大跳跃数M(n,k),并提出猜想M(2k, k + 1) = 3k - 1 + [(k-1)/2].本文给出了这一猜想的两个反例．     

Inequalities for the Moments and Distribution of the Ladder Height of a Random Walk

We obtain upper bounds for the tail distribution of the first nonnegative sum of a random walk and for the moments of the overshoot over an arbitrary nonnegative level if the expectation of jumps is positive and close to zero. In addition, we find an estimate for the expectation of the first ladder epoch.     

电感耦合等离子体原子发射光谱法测定中药方剂煎煮液中的微量元素

本文采用HNO3－H2O2对中药方剂煎煮液进行处理，拟定了电感耦合等离子体原子发射光谱法同时测定试样中12个微量元素的方法，选择了仪器的最佳工作条件，考察了基本效应的影响。在选定条件下，12个微量元素的检出限为0．10－5．0ng/g，相对标准偏差为0.10%-9.5%(n=10),加标回收率为85％－103％。该方法简单、快速，已用于大量样品的检测，分析结果满意。     

A primer on perfect simulation for spatial point processes

This primer provides a self-contained exposition of the case where spatial birth-and-death processes are used for perfect simulation of locally stable point processes. Particularly, a simple dominating coupling from the past (CFTP) algorithm and the CFTP algorithms introduced in [13], [14], and [5] are studied. Some empirical results for the algorithms are discussed. Received: 30 June 2002     

Large set of P3‐decompositions

Let G=(V(G),E(G)) be a graph. A (n,G, λ)‐GD is a partition of the edges of λK_n into subgraphs (G‐blocks), each of which is isomorphic to G. The (n,G,λ)‐GD is named as graph design for G or G‐decomposition. The large set of (n,G,λ)‐GD is denoted by (n,G,λ)‐LGD. In this work, we obtain the existence spectrum of (n,P₃,λ)‐LGD. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 151–159, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10008