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.     

全面成绩管理的初探

利用数量化方法,数字特征法,W ilcoxon顺序和检验法以及试卷分析的各种方法(试题难度,区分度,信度,效度等),定量地解决了影响学生成绩的主要因素,并引入全面管理方法,明显地改善了学生成绩,学生综合能力明显加强.     

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₂.     

Bifurcation and Isochronicity at Infinity in a Class of Cubic Polynomial Vector Fields

In this paper, we study the appearance of limit cycles from the equator and isochronicity of infinity in polynomial vector fields with no singular points at infinity. We give a recursive formula to compute the singular point quantities of a class of cubic polynomial systems, which is used to calculate the first seven singular point quantities. Further, we prove that such a cubic vector field can have maximal seven limit cycles in the neighborhood of infinity. We actually and construct a system that has seven limit cycles. The positions of these limit cycles can be given exactly without constructing the Poincare cycle fields. The technique employed in this work is essentially different from the previously widely used ones. Finally, the isochronous center conditions at infinity are given.     

ON DIRECT METHOD OF SOLUTION FOR A CLASS OF SINGULAR INTEGRAL EQUATIONS

In this article, by introducing characteristic singular integral operator and associate singular integral equations (SIEs), the authors discuss the direct method of solution for a class of singular integral equations with certain analytic inputs. They obtain both the conditions of solvability and the solutions in closed form. It is noteworthy that the method is different from the classical one that is due to Lu.