Global exponential stability for interval general bidirectional associative memory (BAM) neural networks with proportional delays

This paper is concerned with interval general bidirectional associative memory (BAM) neural networks with proportional delays. Using appropriate nonlinear variable transformations, the interval general BAM neural networks with proportional delays can be equivalently transformed into the interval general BAM neural networks with constant delays. The sufficient condition for the existence and uniqueness of equilibrium point of the model is established by applying Brouwer's fixed point theorem. By constructing suitable delay differential inequalities, some sufficient conditions for the global exponential stability of the model are obtained. Two examples are given to illustrate the effectiveness of the obtained results. This paper ends with a brief conclusion. Copyright © 2016 John Wiley & Sons, Ltd.     

迭代微分方程解的存在性及分支

本文讨论迭代微分方程ｘ（ｔ）＝ｆ（ｘ（ｔ），ｘ（ｘ（ｔ）））的解的性态，并在ｆ（ｘ（ｔ），ｘ（ｘ（ｔ）））＝（ｘ＾２（ｔ）－μ）ｘ（ｘ（ｔ））时研究解的分支问题，更正了现有文献中的错误，结出了正确，完整的结果。     

一类具变号非线性项二阶m点边值问题的正解

利用一个新的不动点定理,研究一类具有变号且依赖一阶导数非线性项二阶m点边值问题正解的存在性,得到了正解存在的充分条件.     

流形元法固定边界约束处理研究

在数值流形方法中,对于材料的固定边界,一般采用罚函数的方法进行处理,即在固定边界上设置刚性弹簧约束其位移来实现固定约束条件的近似满足。罚函数法在理论上不是严格的固定约束处理方法,罚弹簧的布置与弹簧刚度的大小对模拟的效果都会产生影响。基于流形单元上位移函数的组成提出了流形方法固定边界约束处理的新方法,在组成流形单元的物理覆盖上,通过取消相应的覆盖函数在流形单元位移函数中的组成来实现双向固定的约束条件,通过使用只包含单方向位移的覆盖函数使x向固定约束条件和y向固定约束条件得到实现,推导了相应固定约束条件下的流形单元刚度矩阵的数值计算格式。该方法严格满足固定约束的物理意义,简化了固定边界的处理,并经算例证明是有效和准确的,有利于数值流形方法的程序实现和工程应用。     

基于不规则衍射理论的冰晶粒子的光散射研究(英文)

在不规则衍射理论的基础上,分析了从可见光到近红外波段冰晶粒子的光散射特性。计算了粒子尺度为20μm,50μm,80μm的五种典型冰晶粒子的消光效率因子和吸收效率因子。最后,为了评估不规则衍射理论的精确性,与有限时域差分法和几何光学法进行了比较。     

一类二阶多点边值问题正解的存在性

利用锥上不动点定理讨论了二阶常微分方程组多点边值问题正解的存在性，所得结论推广了最近的一些结果．     

Numerical simulation of Rhonegletscher from 1874 to 2100

Due to climatic change, many Alpine glaciers have significantly retreated during the last century. In this study we perform the numerical simulation of the temporal and spatial change of Rhonegletscher, Swiss Alps, from 1874 to 2007, and from 2007 to 2100.     

On the cut‐off phenomenon for the transitivity of randomly generated subgroups

Consider K ≥ 2 independent copies of the random walk on the symmetric group S_N starting from the identity and generated by the products of either independent uniform transpositions or independent uniform neighbor transpositions. At any time $n\in \mathbb{N}$, let G_n be the subgroup of S_N generated by the K positions of the chains. In the uniform transposition model, we prove that there is a cut‐off phenomenon at time N ln(N)/(2K) for the non‐existence of fixed point of G_n and for the transitivity of G_n, thus showing that these properties occur before the chains have reached equilibrium. In the uniform neighbor transposition model, a transition for the non‐existence of a fixed point of G_n appears at time of order $N^{1+\frac{2}{K}}$ (at least for K ≥ 3), but there is no cut‐off phenomenon. In the latter model, we recover a cut‐off phenomenon for the non‐existence of a fixed point at a time proportional to N by allowing the number K to be proportional to ln(N). The main tools of the proofs are spectral analysis and coupling techniques. © 2011 Wiley Periodicals, Inc. Random Struct. Alg., 2012     

APPROXIMATING COMMON FIXED POINTS OF NEARLY ASYMPTOTICALLY NONEXPANSIVE MAPPINGS

We use an iteration scheme to approximate common fixed points of nearly asymptotically nonexpansive mappings.We generalize corresponding theorems of [1] to the case of two nearly asymptotically nonexpansive mappings and those of [9] not only to a larger class of mappings but also with better rate of convergence.