两种群非自治Lotka-Volterra竞争扩散系统的概周期解

本文讨论两种群概周期竞争扩散系统，利用微分不等式，证明了系统概周期解的存在、唯一性及其在壳扰动下的稳定性．     

具有连续时滞和比率型功能反应的竞争系统的正周期解的存在性

本文利用重合度理论中的延拓定理讨论了具有连续时滞和比率型功能反应的非自治扩散竞争系统的正周期解的存在性,得到了正周期解存在的充分条件。     

具有扩散和比率依赖的三种群混合模型的分析

本文讨论了捕食者具有比率依赖的功能性反应,食饵与另一种群竞争且自身可以 扩散的混合模型.证明了系统一致持久与扩散有关,而且得到了系统存在全局吸引周期 解的充分条件.     

具有连续时滞和功能性反应的非自治竞争系统的持续生存

本文利用Lyapunov-Razumikhin理论讨论了具有连续时滞和Ⅱ类功能性反应的非自治扩散竞争系统．此系统有两个种群n个斑块，其中一个种群可以在n个斑块中自由扩散，另一种群被限定在一斑块中不能扩散．当系数满足一定的条件时，证明了系统是持续生存的，此外，给出了该系统的一周期解全局吸引的充分条件．     

具有连续系数的竞争扩散方程组的周期解(英文)

本文讨论了一类变系数的竞争扩散方程组,其中系数关于空间和时间变元连续,而关于时间变元是周期的.通过构造上下解,运用单调迭代方法证明了带Neumann边界条件的竞争扩散方程组正周期解的存在性和唯一性.     

一类周期反应扩散方程正周期解的存在性

该文运用周期抛物型算子理论,Schauder估计和分歧理论讨论了一类周期反应扩散方程,即带扩散项捕食-食饵系统的周期解的存在性,得出了系统正周期解存在的充要条件.     

反应扩散方程解的渐近性态

本文使用锥映象不动点指数的计算方法，讨论一类反应扩散方程正静态解的存在性，并给出方程的静态解渐适性态．然后，利用上，下解的方法讨论相应周期系统周期解的存在性及其渐近性态．     

具有限时滞的非自治三种群扩散捕食系统的周期解

主要讨论了具有限时滞的非自治三种群扩散捕食系统的周期解的存在性.方法是运用Yoshizawa型周期解定理的推广,得出该系统至少有一个ω周期解.     

N种群周期系数非线性关系捕食—竞争系统的定性分析

本文应用比较定理，Ｂｒｏｕｗｅｒ不动点定理和Ｖ函数方法，讨论了Ｎ种群周期系数非线性关系捕食－竞争系统的正解的有界性，正周期解的存在性，正周期解的全局吸引性及唯一性。     

具有扩散的Lotka-Volterra系统的持续性

利用最大值原理结合上、下解的方法，讨论了一类具有扩散的竞争－捕食的Lotka-Volterra系统静态解的存在性与持续生存。     

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

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

弱空间式Locale

空间式locale范畴SLoc是locale范畴Loc的余反射满子范畴,但对locale乘积不封闭．本文引入弱空间式locale,证明弱空间式locale范畴WSloc为范畴Loc的余反射满子范畴,且对locale秉积封闭．还证明了一个locale A是空间式的当且仅当它的枝映射localeN(A)是弱空间式的;一个空问式locale的每一个子locale都是空间式的当且仅当它的每一个子locale是弱空间式的．最后,证明了弱空间式性在定向函子下保持不变．     

Chaotic synchronization with filter based on wavelet transformation

A kind of chaotic synchronization method is presented in the paper. In the transmitter, part signals are transformed by wavelet and the detail information is removed. In the receiver, the component with low frequency is reconstructed and discrete feedback is used, we show that synchronization of two identical structure chaotic systems is attained. The effect of feedback on chaotic synchronization is discussed. Using the synchronous method, the transmitting signal is transported in compressible way, system resource is saved, the component with high frequency is filtered and the effect of disturbance on synchronization is reduced. The synchronization method is illustrated by numerical simulation experiment.     

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.     

不确定条件下双目标组批生产的交货期设置研究

交货期是调度方法的函数,因而具有不确定性.研究变批量、变批次、变生产能力下,单阶段、双目标有条件相容组批的交货期设置问题,将它转化为订单投放策略和调度模式研究.建立了一个基于目标的双目标订单投放策略数学模型.采用目标序列优先方法进行双目标求解,用两种调度模式求出区间值,进行最优交货期逼近.模式1:松弛掉产品加工约束条件,基于负荷考虑、给出离散生产模式下订单完工率最大的订单排序算法,算法综合考虑了任务紧急程度、可调度性、重要度和流程时间最短四个方面,得到区间的一个端点.模式2是有条件相容的启发式组批调度算法,即通过聚类计算将订单安排问题转化为多队列调度问题,将新来订单的投放转化为某个队列的插单和批量分割问题,不同队列中批的投产顺序由批中优先级最高的订单决定,并在能力约束下进行批量分割计算,得到区间的另一个端点,结合流程可靠性求出区间.实例证明,模式2的交货期设置小,订单完工率和生产率高.     

完备格中的成分理论

在完备格中引入了元素的成分概念．基于此,引入了元素的宽度的概念．在分配格的情形证明了元素的成分集对有限并运算封闭且有某种遗传性．证明了元素的有限宽度的成分之集是定向集．称没有非平凡成分的元素为颗粒．称每个非零元素都可表示为其颗粒成分之并的完备格为颗粒表示格．证明了拓扑空间是局部连通的充要条件是其开集格为颗粒表示格．     

An analysis of a ‘Sunday Supplement’ problem

A problem posed in an influential textbook is analysed in more detail than is given there. The textbook answer to the problem has been represented as counterintuitive, as is probably the case; however, it is here shown that it depends critically on an assumption. If this is relaxed, then a wide variety of possible answers is available. All the same, if the special assumption made is replaced by one of a number of more realistic ones, then the order of magnitude of the approximation given by the author of the textbook is preserved.     

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.     

Borel measures in consonant spaces

A topology on a set X is called consonant if the Scott topology of the lattice is compactly generated; equivalently, if the upper Kuratowski topology and the co-compact topology on closed sets of X coincide. It is proved that every completely regular consonant space is a Prohorov space, and that every first countable regular consonant space is hereditarily Baire. If X is metrizable separable and co-analytic, then X is consonant if and only if X is Polish. Finally, we prove that every pseudocompact topological group which is consonant is compact. Several problems of Dolecki, Greco and Lechicki, of Nogura and Shakmatov, are solved.     

Traveling waves in a nonlocal dispersal population model with age-structure

This paper is concerned with the traveling waves in a single species population model which is derived by considering the nonlocal dispersal and age-structure. If the birth function is monotone, then the existence of traveling wavefront is reduced to the existence of a pair of super and subsolutions without the requirement of smoothness. It is proved that the traveling wavefront is strictly increasing and unique up to a translation. The asymptotic behavior of traveling wavefronts is also obtained. If the birth function is not monotone, the existence of traveling wave solution is affirmed by introducing two auxiliary nonlocal dispersal equations with quasi-monotonicity.