YoshiZawa型周期解定理和Massera型周期解定理研究进展简介

微分方程解的有界性和周期解的存在性是檄分方程理论研究中的两个重要课题，二者之间有着紧密的联系．在解的有界性与周期解的存在性的研究中，Yoshizawa周期解定理和Massera周期解定理是非常重要的结果，具有重要的理论意义和应用价值．本文以Yoshizawa型周期解定理和Massera型周期解定理的研究为主，简要介绍泛函微分方程周期解理论研究方面的一些新进展。     

一致渐近稳定和周期解、概周期解的存在性

本文建立了系统解一致稳定、解一致渐近稳定和某种Liapunov函数存在的充要条件,并且得到:满足Lipschitz条件而且解一致渐近稳定的概周期系统有唯一的概周期解,周期系统有唯一的周期解。     

不动点理论与里卡提方程两个正周期解的存在性

利用压缩映射原理,得到里卡提方程一个正周期解的存在性;利用变量变换方法,将里卡提方程转化为伯努利方程.根据伯努利方程的周期解和变量变换,得到里卡提方程的另一个周期解.并讨论了两个正周期解的稳定性,一个周期解在某个区间上是吸引的,另一个周期解在R上是不稳定的.     

强平均解与概周期解的存在性

本文定义了概周期微分方程的强平均解,利用强平均解的性质,讨论了强平均解与概周期解的关系,从而建立了概周期解存在的若干定理。     

一类单种群系统正周期解及其稳定性

考虑周期单种群模型 dxdt=xg( t,x)± p( t,x)的正周解及其稳定性 .证明了在一定条件下 ,系统存在全局吸引的正周期解 .给出了系统存在两个正周期解的充分条件 ,同时也给出了种群灭绝的条件 .这些结果用于 Logistic模型和 Odum模型 ,得到了被开发的周期 Logistic模型存在全局吸引的正周期解 ;被开发了的周期 Odum模型只存在两个正周期解 ,其中之一吸引初值大于一个定数的所有解 ,另一个周期解则是种群灭绝的分界线     

全局渐近稳定性质与概周期解的存在唯一性

众所周知,周期系统解的有界性蕴含着周期解的存在性。然而对于概周期系统(1)来说,即使在n=1的情况下其解的有界性也未必蕴含着概周期解的存在性。因此,在讨论(1)的概周期解的存在性时,必需同时考虑有界解的某种稳定性质。 本文首先证明当研究概周期系统(1)的概周期解φ(t)的稳定性时,可假设φ(t)是明显解。其次,我们利用李雅普诺夫函数和比较原理得到了(1)的零解为全局等度(均匀)渐近稳定的一些结果。最后,我们亦得到了(1)存在唯一概周期解的充分条件。所得结果推广了[1,11,13]中有关结论。     

Hopfield神经网络概周期解的存在性和全局吸引性

该文研究Ｈｏｐｆｉｅｌｄ神经网络概周期解的存在性和全局吸性,获得了该网络存在唯一概周期解的充分条件和所有解收敛于此概周期解的充分条件。     

常微分方程解的存在区间和周期解

讨论解的存在区间,说明周期函数如何是周期解以及它和Poincaré映射的关系.对周期的Riccati方程研究了周期解的个数,是文[8]中的定理1的一个补充,同时也研究了周期捕获的人口方程解的存在区间和周期解问题.     

一个造血模型周期解的存在性及其性态

本文得到一个造血模型存在周期解的充分条件，并推出方程全部正解关于这个周期解全局和周期解相交的充分条件。     

非自治Ginzburg-Landau方程的周期解和全局周期吸引子

研究受周期外力影响的非自治Ginzburg-Landau方程的解的长时间行为.首先证明系统在空间H上存在周期解,而且周期解包含在空间V中的一个有界吸收集内.然后证明了当耗散系数λ满足一定条件时,该系统在空间H上具有唯一的周期解,该周期解指数吸引H中的任意有界集.     

两类带有确定潜伏期的SEIS传染病模型的分析

通过研究两类带有确定潜伏期的SEIS传染病模型,发现对种群的常数输入和指数输入会使疾病的传播过程产生本质的差异．对于带有常数输入的情形,找到了地方病平衡点存在及局部渐近稳定的阈值,证明了地方病平衡点存在时一定局部渐近稳定,并且疾病一致持续存在．对于带有指数输入的情形,发现地方病平衡点当潜伏期充分小时是局部渐近稳定的,当潜伏期充分大时是不稳定的．     

Polynomial-time algorithms for regular set-covering and threshold synthesis

A set-covering problem is called regular if a cover always remains a cover when any column in it is replaced by an earlier column. From the input of the problem - the coefficient matrix of the set-covering inequalities - it is possible to check in polynomial time whether the problem is regular or can be made regular by permuting the columns. If it is, then all the minimal covers are generated in polynomial time, and one of them is an optimal solution. The algorithm also yields an explicit bound for the number of minimal covers. These results can be used to check in polynomial time whether a given set-covering problem is equivalent to some knapsack problem without additional variables, or equivalently to recognize positive threshold functions in polynomial time. However, the problem of recognizing when an arbitrary Boolean function is threshold is NP-complete. It is also shown that the list of maximal non-covers is essentially the most compact input possible, even if it is known in advance that the problem is regular.     

AR（p）模型中的缺失数据估计

运用EM算法,对含有缺失数据的AR（p）模型进行参数估计,通过最大似然准则就非左端缺失的情况进行插补.最后,用蒙特卡洛方法给出实验分析,表明如下结果：（i）误差与AR模型的阶数正相关,与缺失比例正相关;（ii）当AR模型的特征根模长相对较小时,误差与数据长度负相关,且误差被控制在了标准差的30％以内;（iii）当模长中等时,误差基本控制在1个标准差左右;（iv）当模长较大时,误差与数据长度正相关,而且误差也相对较大.     

Optimal damping ratio for linear second-order systems

In this paper, it is shown that the optimal damping ratio for linear second-order systems that results in minimum-time no-overshoot response to step inputs is of bang-bang type. The optimal damping ratio is zero at the outset and is switched to some maximum value at an appropriate instant of time. The switching time is shown to be a function of the maximum damping ratio and the system natural frequency. Furthermore, it is shown that the larger the maximum damping ratio is, the shorter it takes for the system to reach the desired set point. Finally, it is shown that, if the optimal damping ratio is switched as a function of the system state, then the minimum-time no-overshoot criterion is satisfied, irrespective of the magnitude of the uncertainty in the value of the system natural frequency.     

The Fraenkel‐Carnap question for Dedekind algebras

It is shown that the second‐order theory of a Dedekind algebra is categorical if it is finitely axiomatizable. This provides a partial answer to an old and neglected question of Fraenkel and Carnap: whether every finitely axiomatizable semantically complete second‐order theory is categorical. It follows that the second‐order theory of a Dedekind algebra is finitely axiomatizable iff the algebra is finitely characterizable. It is also shown that the second‐order theory of a Dedekind algebra is quasi‐finitely axiomatizable iff the algebra is quasi‐finitely characterizable.     

Compromise solutions and estimation of the noninferior set

A general framework is presented in which the relation of the set of noninferior points and the set of compromise solutions is studied. It is shown that the set of compromise solutions is dense in the set of noninferior points and that each compromise solution is properly noninferior. Also, under convexity of the criteria space, a characterization of the properly noninferior points in terms of the compromise solutions is presented. In this characterization, the compromise solutions depend continuously on the weights. Use of the maximum norm is studied also. It is shown that a subset of these max-norm solutions, obtained by taking certain limits of compromise solutions, is dense and contained in the closure of the set of noninferior points.     

Detection of multivariate outliers with location slippage or scale inflation in left orthogonally invariant or elliptically contoured distributions

This paper is concerned with two kinds of multiple outlier problems in multivariate regression. One is a multiple location-slippage problem and the other is a multiple scale-inflation problem. A multi-decision rule is proposed. Its optimality is shown for the first problem in a class of left orthogonally invariant distributions and is also shown for the second problem in a class of elliptically contoured distributions. Thus the decision rule is robust against departures from normality. Further the null robustness of the decision statistic which the rule is based on is pointed out in each problem.     

Maximal and Minimal Semilattices on Ordered Sets

The map which takes an element of an ordered set to its principal ideal is a natural embedding of that ordered set into its powerset, a semilattice. If attention is restricted to all finite intersections of the principal ideals of the original ordered set, then an embedding into a much smaller semilattice is obtained. In this paper the question is answered of when this construction is, in a certain arrow-theoretic sense, minimal. Specifically, a characterisation is given, in terms of ideals and filters, of those ordered sets which admit a so-called minimal embedding into a semilattice. Similarly, a candidate maximal semilattice on an ordered set can be constructed from the principal filters of its elements. A characterisation of those ordered sets that extend to a maximal semilattice is given. Finally, the notion of a free semilattice on an ordered set is given, and it is shown that the candidate maximal semilattice in the embedding-theoretic sense is the free object.     

Nontrivial Attractors in a Model Related to the Three-Body Quantum Problem

A model of a quantum mechanical system related to the three-body problem is studied. The model is defined in terms of a symmetric pseudo-differential operator (PDO) with unbounded symbol. The entire family of self-adjoint extensions of this operator is studied using harmonic analysis. A regularization procedure for this PDO is introduced and the spectral properties of the operators obtained in this way are investigated. The limit behavior of the regularized operators when the regularization parameter is removed is analyzed and a nontrivial attractor is exhibited.     

Milnor方图中的w-凝聚性

整环R称为ω-凝聚整环,是指R的每个有限型理想是有限表现型的.本文证明了ω-凝聚整环是v-凝聚整环,且若(RDTF,M)是Milnor方图,则在Ⅰ型情形,R是ω-凝聚整环当且仅当D和T都是ω-整环,且T_M是赋值环;对于Ⅱ-型情形,R是ω-凝聚整环当且仅当D是域,[F:D]<∞,M是R的有限型理想,T是ω-凝聚整环,且R_M是凝聚整环.