随机环境中双移民生灭过程的极限性质

引入了随机环境中双移民生灭过程的概念，定义了过程的模态指示函数，在此基础上研究了其转移矩阵的平稳分布，给出了平稳分布众数的位置与模态指示函数之间的关系．研究了平稳分布的众数与边界关系．     

Investigation of Scale Exponents of Complete and Incomplete Aggregation-Annihilation Processes

The complete and incomplete aggregation-annihilation processes are investigated with the method of generating function, and the scale exponents are obtained exactly. We find that the scale exponents of incomplete aggregation-annihilation process are different from the previous exponents obtained by different methods. The time dependence of the total number of clusters and the total mass of clusters are analytically obtained.     

Topics in data assimilation: Stochastic processes

Stochastic models with varying degrees of complexity are increasingly widespread in the oceanic and atmospheric sciences. One application is data assimilation, i.e., the combination of model output with observations to form the best picture of the system under study. For any given quantity to be estimated, the relative weights of the model and the data will be adjusted according to estimated model and data error statistics, so implementation of any data assimilation scheme will require some assumption about errors, which are considered to be random. For dynamical models, some assumption about the evolution of errors will be needed. Stochastic models are also applied in studies of predictability.

The formal theory of stochastic processes was well developed in the last half of the twentieth century. One consequence of this theory is that methods of simulation of deterministic processes cannot be applied to random processes without some modification. In some cases the rules of ordinary calculus must be modified.

The formal theory was developed in terms of mathematical formalism that may be unfamiliar to many oceanic and atmospheric scientists. The purpose of this article is to provide an informal introduction to the relevant theory, and to point out those situations in which that theory must be applied in order to model random processes correctly.     

SUN5500小型机MPI编程与蕴式并行计算的实现方法

基于SUN5500小型计算机并行开发环境，给出了消息传递模型和蕴式行模型的实现方法，通过实例分析了SUNMPI实际编程，并对选取不同模型有不同参数的运算时间进行了比较，结果表明，在SUN5500计算机上MPI模型和蕴式并行模型均能较大地提高运算速度，而且MPI在灵活性和并行程度方面更优。     

两指标双F统计过程控制图

当产品质量指标服从二元正态分时,可用T2控制图与Λ控制图联合判断产品生产的过程是否处于受控状态。本文利用T2统计量与F统计量、Λ统计量与F统计量之间的关系,得到了两指标情形下两类基于F分布统计量的统计过程控制图,简称双F统计过程控制图,并给出了控制图应用实例。     

An Implicit Iteration Process with Errors for a Finite Family of r-strictly Asymptotically Pseudocontractive Mappings

In this paper,we will establish several strong convergence theorems for the approximation ofcommon fixed points of r-strictly asymptotically pseudocontractive mappings in uniformly convex Banachspaces using the modiied implicit iteration sequence with errors,and prove the necessary and sufficient conditionsfor the convergence of the sequence.Our results generalize,extend and improve the recent work,in thistopic.     

Parametric and Non Homogeneous Semi-Markov Process for HIV Control

In AIDS control, physicians have a growing need to use pragmatically useful and interpretable tools in their daily medical taking care of patients. Semi-Markov process seems to be well adapted to model the evolution of HIV-1 infected patients. In this study, we introduce and define a non homogeneous semi-Markov (NHSM) model in continuous time. Then the problem of finding the equations that describe the biological evolution of patient is studied and the interval transition probabilities are computed. A parametric approach is used and the maximum likelihood estimators of the process are given. A Monte Carlo algorithm is presented for realizing non homogeneous semi-Markov trajectories. As results, interval transition probabilities are computed for distinct times and follow-up has an impact on the evolution of patients.      

阴极还原处理对多孔硅发光性能的影响

对经过阴极还原处理后的多孔硅样片进行了光致发光测试和稳定性测试.实验结果表明这种处理能明显改善多孔硅的发光稳定性,使其表面结构更加稳定.利用原子力显微镜对不同还原时间的多孔硅微结构及形貌进行了比较,在一定范围内随着还原时间的增长多孔硅表面粗糙度增大,PL谱增强.     

Speedup estimates for some variants of the parallel implementations of the branch-and-bound method

The efficiency of parallel implementations of the branch-and-bound method in discrete optimization problems is considered. A theoretical analysis and comparison of two parallel implementations of this method is performed. A mathematical model of the computation process is constructed and used to obtain estimates of the maximum possible speedup. Examples of problems in which none of these two parallel implementations can speed up the computations are considered.