随机环境中多物种分枝随机游动

引进了随机环境中多物种分枝随机游动的一般模型.在分枝过程非灭绝的情况下,讨论了系统的状态分类,得到了系统暂留及强常返的充要条件是存在k个定义在整数集上的函数分别满足某种性质.最后给出了系统强暂留的充分条件.     

关于微分熵的一类强偏差定理

利用关于乘积分布密度的相对熵和相对熵率的概念,建立了相依连续型随机变量序列关于参考微分熵的一类强偏差定理,证明中给出了将Laplace变换应用于微分熵强偏差定理的研究的一种途径．     

Stratifiable Families of Extremals and Sufficient Conditions for Optimality in Optimal Control Problems

It is shown that, if a parametrized fämily of extremals F can be stratified in a way compatible with the flow map generated by F, then those trajectories of the family which realize the minimal values of the cost in F are indeed optimal in comparison with all trajectories which lie in the region R covered by the trajectories of F. It is not assumed that F is a field covering the state space injectively. As illustration, an optimal synthesis is constructed for a system where the flow of extremals exhibits a simple cusp singularity.     

关于任意随机变量序列泛函的强极限定理

本文在k是固定的正整数，{fn}是R^k 1上的Borel可测函数列时，得到了任意随机变量序列{Xrn≥0}的泛函{fn(Xn-k,…,Xn)}的强极限定理，它是Chung的关于独立随机变量序列的强大数律的推广，作为推论，得到了k重非齐次马尔科夫链的一类强极限定理．     

可交换随机变量序列的随机极限定理

本文讨论了可交换随机变量序列{X_n:n≥1}的极限定理,得到了可交换随机变量序列的随机强大数律及加权和定理,并推广了文[4]中的结果.     

Weaving hadamard matrices with maximum excess and classes with small excess

Weaving is a matrix construction developed in 1990 for the purpose of obtaining new weighing matrices. Hadamard matrices obtained by weaving have the same orders as those obtained using the Kronecker product, but weaving affords greater control over the internal structure of matrices constructed, leading to many new Hadamard equivalence classes among these known orders. It is known that different classes of Hadamard matrices may have different maximum excess. We explain why those classes with smaller excess may be of interest, apply the method of weaving to explore this question, and obtain constructions for new Hadamard matrices with maximum excess in their respective classes. With this method, we are also able to construct Hadamard matrices of near‐maximal excess with ease, in orders too large for other by‐hand constructions to be of much value. We obtain new lower bounds for the maximum excess among Hadamard matrices in some orders by constructing candidates for the largest excess. For example, we construct a Hadamard matrix with excess 1408 in order 128, larger than all previously known values. We obtain classes of Hadamard matrices of order 96 with maximum excess 912 and 920, which demonstrates that the maximum excess for classes of that order may assume at least three different values. Since the excess of a woven Hadamard matrix is determined by the row sums of the matrices used to weave it, we also investigate the properties of row sums of Hadamard matrices and give lists of them in small orders. © 2004 Wiley Periodicals, Inc. J Combin Designs 12: 233–255, 2004.     

A Generally Covariant Wave Equation for Grand Unified Field Theory

A generally covariant wave equation is derived geometrically for grand unified field theory. The equation states most generally that the covariant d'Alembertian acting on the vielbein vanishes for the four fields which are thought to exist in nature: gravitation, electromagnetism, weak field and strong field. The various known field equations are derived from the wave equation when the vielbein is the eigenfunction. When the wave equation is applied to gravitation the wave equation is the eigenequation of wave mechanics corresponding to Einstein's field equation in classical mechanics, the vielbein eigenfunction playing the role of the quantized gravitational field. The three Newton laws, Newton's law of universal gravitation, and the Poisson equation are recovered in the classical and nonrelativistic, weak-field limits of the quantized gravitational field. The single particle wave-equation and Klein-Gordon equations are recovered in the relativistic, weak-field limit of the wave equation when scalar components are considered of the vielbein eigenfunction of the quantized gravitational field. The Schrödinger equation is recovered in the non-relativistec, weak-field limit of the Klein-Gordon equation). The Dirac equation is recovered in this weak-field limit of the quantized gravitational field (the nonrelativistic limit of the relativistic, quantezed gravitational field when the vielbein plays the role of the spinor. The wave and field equations of O(3) electrodynamics are recovered when the vielbein becomes the relativistic dreibein (triad) eigenfunction whose three orthonormal space indices become identified with the three complex circular indices (1), (2), (3), and whose four spacetime indices are the indices of non-Euclidean spacetime (the base manifold). This dreibein is the potential dreibein of the O(3) electromagnetic field (an electromagnetic potential four-vector for each index (1), (2), (3)). The wave equation of the parity violating weak field is recovered when the orthonormal space indices of the relativistic dreibein eigenfunction are identified with the indices of the three massive weak field bosons. The wave equation of the strong field is recovered when the orthonormal space indices of the relativistic vielbein eigenfunction become the eight indices defined by the group generators of the SU (3) group.     

Duality Theory in Fuzzy Linear Programming Problems with Fuzzy Coefficients

The concept of fuzzy scalar (inner) product that will be used in the fuzzy objective and inequality constraints of the fuzzy primal and dual linear programming problems with fuzzy coefficients is proposed in this paper. We also introduce a solution concept that is essentially similar to the notion of Pareto optimal solution in the multiobjective programming problems by imposing a partial ordering on the set of all fuzzy numbers. We then prove the weak and strong duality theorems for fuzzy linear programming problems with fuzzy coefficients.     

半参数方差误差模型的估计

本文综合近邻权函数法及最小二乘法，用两阶段最小二乘估计的方法得到了半参数EV模型中参数的估计量及其强相合性，渐近正态性。同时也得到了非参数函数的估计量及其强相合性，一致强相合性。     

The diameter of randomly perturbed digraphs and some applications

The central observation of this paper is that if εn random arcs are added to any n‐node strongly connected digraph with bounded degree then the resulting graph has diameter 𝒪(lnn) with high probability. We apply this to smoothed analysis of algorithms and property testing. Smoothed Analysis: Recognizing strongly connected digraphs is a basic computational task in graph theory. Even for digraphs with bounded degree, it is NL‐complete. By XORing an arbitrary bounded degree digraph with a sparse random digraph R ∼ 𝔻_n,ε/n we obtain a “smoothed” instance. We show that, with high probability, a log‐space algorithm will correctly determine if a smoothed instance is strongly connected. We also show that if NL ⫅̸ almost‐L then no heuristic can recognize similarly perturbed instances of (s,t)‐connectivity. Property Testing: A digraph is called k‐linked if, for every choice of 2k distinct vertices s₁,…,s_k,t₁,…,t_k, the graph contains k vertex disjoint paths joining s_r to t_r for r = 1,…,k. Recognizing k‐linked digraphs is NP‐complete for k ≥ 2. We describe a polynomial time algorithm for bounded degree digraphs, which accepts k‐linked graphs with high probability, and rejects all graphs that are at least εn arcs away from being k‐linked. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2007