电子直线加速器束流均方根发射度变化方程

本文导出了考虑外场和束流效应后束流均方根发射度平方变化方程的一般表达式,并就仅考虑外场,仅考虑空间电荷场和仅考虑尾场等三种特殊情况进行了分析。     

桑蚕种样本良卵数偏差控制方法研究

桑蚕种良卵率是蚕种质量检验的重要指标,控制样本间良卵数偏差是保证良卵率准确性的关键.运用概率理论,针对目前生产上绝大多数批次的良卵率p 99%情况,在置信概率为95%下,样本卵粒数在1601~1700、1701~1800、1801~1900、1901~2000区间内时,给出了样本良卵数的容许偏差分别为16、17、17、18粒;当良卵率p在99%~90%其他区间时,也分别给出了不同克卵粒数情况下样本良卵数的容许偏差.同时在置信概率为90%下,给出了不同克卵粒数情况下样本良卵数的容许偏差.结合实际调查结果,对理论方法进行了比较,确认了理论方法的准确性,为蚕业生产提供了一套控制良卵数偏差的可行性方案.     

QUENCHING PROBLEMS OF DEGENERATE FUNCTIONAL REACTION-DIFFUSION EQUATION

This paper is concerned with the quenching problem of a degenerate functional reaction-diffusion equation. The quenching problem and global existence of solution for the reaction-diffusion equation are derived and, some results of the positive steady state solutions for functional elliptic boundary value are also presented.     

A compactness result for Kähler Ricci solitons

In this paper we prove a compactness result for compact Kähler Ricci gradient shrinking solitons. If (Mi,gi) is a sequence of Kähler Ricci solitons of real dimension n?4, whose curvatures have uniformly bounded Ln/2 norms, whose Ricci curvatures are uniformly bounded from below and μ(gi,1/2)?A (where μ is Perelman's functional), there is a subsequence (Mi,gi) converging to a compact orbifold (M_∞,g_∞) with finitely many isolated singularities, where g_∞ is a Kähler Ricci soliton metric in an orbifold sense (satisfies a soliton equation away from singular points and smoothly extends in some gauge to a metric satisfying Kähler Ricci soliton equation in a lifting around singular points).     

Distributive lattices of numberings

We study into a semilattice of numberings generated by a given fixed numbering via operations of completion and taking least upper bounds. It is proved that, except for the trivial cases, this semilattice is an infinite distributive lattice every principal ideal in which is finite. The least upper and the greatest lower bounds in the semilattice are invariant under extensions in the semilattice of all numberings. Isomorphism types for the semilattices in question are in one-to-one correspondence with pairs of cardinals the first component of which is equal to the cardinality of a set of non-special elements, and the second — to the cardinality of a set of special elements, of the initial numbering. Supported by INTAS grant No. 00-429. __________ Translated from Algebra i Logika, Vol. 46, No. 1, pp. 83–102, January–February, 2007.     

GF(2)上本原多项式的三项倍式的次数研究

研究了二元域上本原多项式的三项倍式的计数问题,通过对三项倍式进行分类,导出了本原多项式三项倍式最低次数的一个上界.利用这一结果,使构造本原多项式的次数最低的三项倍式的计算复杂性降到原来的九分之一.     

Moderate and Small Deviations for the Ranges of One-Dimensional Random Walks

We establish moderate and small deviations for the ranges of integer valued random walks. Our theorems apply to the limsup and the liminf laws of the iterated logarithm. We establish moderate and small deviations for the ranges of integer valued random walks. Our theorems apply to the limsup and the liminf laws of the iterated logarithm.     

Pattern时延差编码四信道水声通信技术研究

本文所研究的是基于Pattern时延差编码（PDS）体制下的水声通信技术.PDS水声编码体制利用Pattern码片出现在码元窗的时延差值进行时延编码,通过码元分割,有效的降低了水声信道的多途干扰;通过频率分割划分四个通信信道,增加通信速率至1000bit/s.在接收端利用带通滤波器来实现通信信道分割,每个信道再应用拷贝相关器实现码元分割并估计出时延差值,完成译码.仿真实验表明,该系统适合于大量不同水声信道高可靠性工作,为水声通信网络化打下坚实基础.     

Carathéodory's method for a class of second order differential equations on the half-line

The method of equivalent variational methods, originally due to Carathéodory for free problems in the calculus of variations is extended to investigate boundary value problems for a class of second order differential equations on the half-line. Some applications are presented to illustrate the potential of this method.     

Enumerating disjunctions and conjunctions of paths and cuts in reliability theory

Let G=(V,E) be a (directed) graph with vertex set V and edge (arc) set E. Given a set P of source-sink pairs of vertices of G, an important problem that arises in the computation of network reliability is the enumeration of minimal subsets of edges (arcs) that connect/disconnect all/at least one of the given source-sink pairs of P. For undirected graphs, we show that the enumeration problems for conjunctions of paths and disjunctions of cuts can be solved in incremental polynomial time. Furthermore, under the assumption that P consists of all pairs within a given vertex set, we also give incremental polynomial time algorithm for enumerating all minimal path disjunctions and cut conjunctions. For directed graphs, the enumeration problem for cut disjunction is known to be NP-complete. We extend this result to path conjunctions and path disjunctions, leaving open the complexity of the enumeration of cut conjunctions. Finally, we give a polynomial delay algorithm for enumerating all minimal sets of arcs connecting two given nodes s₁ and s₂ to, respectively, a given vertex t₁, and each vertex of a given subset of vertices T₂.