用随机方法证明一类组合恒等式

在组合恒等式∑sk1=0Ck1n1Cs- k1n2 =Csn1+ n2 　　　　 s=0 ,1 ,2 ,… ,n1+n2 ( 1 )的各种证法中 ,最简捷的要数概率方法的证明。恒等式 ( 1 )的一种概率方法证明是 :考虑如下的随机试验 ;设有一批产品 ,其中 n1件是次品 ,n2 件是正品 ,现从中随机地取 s件 ,则这 s件中的次品数“ξ=k”的概率是 P(ξ=k) =Ckn1Cs- kn2Csn1+ n2由于在 S件产品中次品数可能是 0 ,1 ,2 ,… ,s。共 s+1种 ,它们彼此互不相容 ,且这 ( s+1 )个事件之并为必然事件 ,故有∑sk1=0p(ξ =k) =∑sk1=0Ckn1Cs- kn2Csn1+ n2=1　　　　　即 ( 1 )得证　　由等式 ( 1 )…     

半直线上随机环境中的随机游动的常返性

本文讨论半直线上随机环境中的随机游动的常返性。在独立环境下，主要通过强大数定律，找到了非常返和正常返的一个充分条件下，并将这一结果推广到一些特殊情情形。在一般的随机环境下，主要通过数列的有界性，给出了常返与零常返的一个充分条件。     

生产函数的优化回归方法

本文讨沦了生产函数的理论定 义及常用方法，并提出了生产函数的一种优化技术．利用数据包络分析方法确定生产前沿面，求样本点在该边界面上的投影，然后对投影点进行统计回归即获得随机前沿生产函数．     

资源有限网络计划的PRWI启发式优化方法

本文在综合考虑了有资源约束的网络计划结构特征、资源强度、时间约束等方面因素的基础上，提出了一种新的资源优化的启发式优化方法—ＰＲＷＩ方法，并通过分析证明了该方法处理问题的效果较现有的其它方法好。     

三维随机Ising模型的亚稳态性(Ⅱ)

讨论三维格点环面上随机Ising模型当温度趋向零时的亚稳态性,确定从自旋全为-1的组态到自旋全为+1的组态的最大似然路径和临界组态,并计算出从自旋全为-1的组态出发首次到达自旋全为+1的组态的首达时间的渐近对数估计。证明利用一族带指数扰动的Markov链的大偏差估计。     

IPv4/IPv6翻译网关的研究

In this paper, a model of translation gateway is proposed. The communications between IPv4 network and IPv6 network are realized by using the Microsoft intermediate driver technology in environment of Windows 2000.     

Energy-Momentum Pseudo-Tensor of Relic Gravitational Wave of Both the Polarized States

Unlike usual celestial gravitational waves, the relic gravitational waves （RGWs） form random signals in curved spacetime background. We calculate the energy-momentum pseudo-tensor of a certain component of the RGWs propagating along arbitrary directions in Cartesian coordinates. It is found that the energy density of RGWs is positive definitely, and the momentum density components have reasonable behaviour. Such results may provide a theoretical basis for the detection of RGWs.     

Evolution of Weighted Networks by Duplication-Divergence Mechanism

The duplication and divergence process is ubiquitous in nature and man-made networks. Motivated by the duplication-divergence mechanism which depicts the growth of protein networks, we propose a weighted network model in which topological evolution is coupled with weight dynamics. Large scale numerical results indicate that our model can naturally generate networks with power-law-like distributions of degree, strength and weight. The degree-strength correlation is illustrated as well. These properties are in agreement well with empirical data observed in real-world systems. Furthermore, by altering the retention probability δ, weighted, structured exponential networks are realized.     

Synchronizing Complex Networks by an Adaptive Adjustment Mechanism

We propose an adaptive adjustment mechanism for synchronizing complex networks, in particular for sociological or/and biological systems. We do not take it for granted that a dynamical system is put on isolated nodes and they are coupled with each other by one （or more） variable（s）, as employed in most previous models. As a replacement, we suppose that each node may have any finite number of possible states, and their evolutions with time are determined by their nearest-neighbouring （or even second-nearest-neighbouring, etc） nodes in an adaptive adjustment mechanism. It is found that synchronization can be achieved for almost all connected networks and that the scale-free property can evidently improve the synchronizing speed.