变时滞中立型BAM神经网络的全局稳定性

本文通过构造新型的Lyapunov-Krasosvskii函数并利用矩阵不等式技巧获得了一类变时滞中立型BAM神经网络的全局稳定性判据,该判据便于应用.数值例子表明,与已有结果相比,该判据具有较低的保守性.     

带有时变时滞的中立型神经网络的鲁棒指数稳定性

研究一类带有时变时滞的中立型神经网络的全局指数稳定性问题.通过构造LyapunovKrasovskii泛函并使用线性矩阵不等式方法,建立了保障时滞神经网络全局指数稳定的新的时滞相关充分条件.这些条件用线性矩阵不等式表达.进一步,文章对一类不确定时滞中立型神经网络给出了鲁棒全局指数稳定的新判据.     

具混合时滞中立型随机神经网络均方渐近稳定性

研究了一类具有混合时滞和非线性干扰中立型不确定随机神经网络鲁棒稳定性,所考虑的不确定为范数有界,混合时滞由离散和分布时滞组成,借助李雅普诺夫函数和随机稳定性理论,利用伊藤公式,给出并证明了使系统鲁棒稳定的充分条件,所有结果以线性矩阵不等式的形式给出,数值算例表明了所给方法的有效性.     

具滞后超中立型定常线性大系统的指数稳定性

采用具有加权向量范数型Lyapunov函数，对具滞后超中立型线性大系统进行模型集结，得到集结系统；再运用原理与时域中的微分积分不等式，讨论相应集结系统，通过集结系统的稳定性，获得了具滞后超中立型大系统的指数稳定性．     

基于Razumikhin-Type理论的中立型随机切换非线性系统的P阶矩稳定性与几乎必然稳定性

研究了中立型随机切换非线性系统的P阶矩稳定性与几乎必然稳定性.采用LyapunovRazumikhin方法和随机分析技术,建立了中立型随机切换非线性系统稳定性的判别准则,给出了中立型随机切换非线性系统稳定的充分条件.最后通过仿真算例表明了所得结果的有效性.     

具滞后中立型线性大系统的指数稳定性

采用具有加权向量范数型李雅谱诺夫函数，对具滞后中立型线型大系统进行模型集结，得到集结系统；再运用比较原理与时域中的微分积分不等式，讨论相应集结系统，从而通过集结系统的稳定性，获得了具滞后中立型大系统的指数稳定性。     

具有混合时滞的中立型Hopfield神经网络的概周期解

研究一类具有混合时滞的中立型Hopfield神经网络概周期解.通过运用指数二分性及不动点定理,获得了其概周期解的存在性与全局指数稳定性的充分条件,所得结果是新的,并且推广和改进了已有文献的相关结果.     

关于带跳中立型随机泛函微分方程p阶矩指数稳定性准则

本文研究了带跳中立型随机泛函微分方程的p阶矩指数稳定性,通过构造Lyapunov函数,运用分析的技巧得到了p阶指数稳定的准则.同时给出了一个例子显示出我们的结果是有效的.     

含多个函数时滞的随机延迟微分方程的矩稳定性

本文考虑具有多个函数时滞的中立型随机延迟微分方程p阶矩稳定性.运用Razumikhin方法,建立了一此新的矩稳定性判别法,并以线性方程为例解释了所得判别法的应用.     

时间尺度上漏项中具有变时滞的中立型模糊BAM神经网络的概周期解

本文研究了一类时间尺度上漏项中具有变时滞的中立型模糊BAM神经网络.利用时间尺度上线性动力学方程的指数二分法,Banach不动点定理和时间尺度上的微积分理论,得到了这类模糊BAM神经网络在时间尺度上概周期解的存在性和指数稳定性的充分条件.     

Study of the blow-up of solutions of systems of equations of hydrodynamic type

Mathematical Notes - We study the initial boundary-value problem for three-dimensional systems of equations of pseudoparabolic type. The system is similar to the Oskolkov system, but differs from...     

Distribution of types of symmetry of tensors of high degree

The asymptotic distribution of tensors of degree N in symmetry types is studied in this paper.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 155, pp. 181–186, 1986.     

Axiomatizability of reducts of algebras of relations

In this paper, we prove that any subreduct of the class of representable relation algebras whose similarity type includes intersection, relation composition and converse is a non-finitely axiomatizable quasivariety and that its equational theory is not finitely based. We show the same result for subreducts of the class of representable cylindric algebras of dimension at least three whose similarity types include intersection and cylindrifications. A similar result is proved for subreducts of the class of representable sequential algebras. Received October 7, 1998; accepted in final form September 10, 1999.     

Characterization of types of asymptotic discernibility of families of hypotheses

We give a characterization of the types of asymptotic discernibility of families of hypotheses in the case of hypothetical measures that are not, in general, mutually absolutely continuous. The case when the logarithm of the likelihood ratio admits an asymptotic expansion of the type of an expansion with local asymptotic normality is examined in detail. Examples are studied.Translated fromTeoriya Sluchainykh Protsessov, Vol. 15, pp. 64–71, 1987.     

Lengths of periods of continued fractions of square roots of integers

Empirical study of the period’s length T of the continued fractions of $\sqrt{Q}$ (for growing integers Q) shows several strange asymptotical results, for instance, $T\leq C\sqrt{Q}\ln{Q}$ . These results show important differences between the statistics of the elements of the continued fractions of random real numbers and of square roots of random integers.