Reflection functors and symplectic reflection algebras for wreath products

We construct reflection functors on categories of modules over deformed wreath products of the preprojective algebra of a quiver. These functors give equivalences of categories associated to generic parameters which are in the same orbit under the Weyl group action. We give applications to the representation theory of symplectic reflection algebras of wreath product groups.     

On the limiting behavior of the maximum partial sums for arrays of rowwise NA random variables

Let {Xni, 1 ≤ n,i ＜∞} be an array of rowwise NA random variables and {an, n ≥ 1} a sequence of constants with 0 ＜ an ↑∞. The limiting behavior of maximum partial sums 1/an max 1≤k≤n| kΣi=1 Xni| is investigated and some new results are obtained. The results extend and improve the corresponding theorems of rowwise independent random variable arrays by Hu and Taylor [1] and Hu and Chang [2].     

Explicit constructions of separating hash families from algebraic curves over finite fields

Let X be a set of order n and Y be a set of order m. An (n,m,{w ₁, w ₂})-separating hash family is a set of N functions from X to Y such that for any with , |X ₁| = w ₁ and |X ₂| = w ₂, there exists an element such that . In this paper, we provide explicit constructions of separating hash families using algebraic curves over finite fields. In particular, applying the Garcia–Stichtenoth curves, we obtain an infinite class of explicitly constructed (n,m,{w ₁,w ₂})–separating hash families with for fixed m, w ₁, and w ₂. Similar results for strong separating hash families are also obtained. As consequences of our main results, we present explicit constructions of infinite classes of frameproof codes, secure frameproof codes and identifiable parent property codes with length where n is the size of the codes. In fact, all the above explicit constructions of hash families and codes provide the best asymptotic behavior achieving the bound , which substantially improve the results in [ 8, 15, 17] give an answer to the fifth open problem presented in [11].     

CHARACTERIZATIONS OF SYMMETRIC MULTISTEP RUNGE-KUTTA METHODS

Some characterizations for symmetric multistep Runge-Kutta(RK) methods are obtained. Symmetric two-step RK methods with one and two-stages are presented. Numerical examples show that symmetry of multistep RK methods alone is not sufficient for long time integration for reversible Hamiltonian systems. This is an important difference between one-step and multistep symmetric RK methods.     

无界区域R~1上的KDV型方程的指数吸引子

本文研究了无界区域R~1上的KDV型方程,运用带权空间构造一类紧算子和算子分解的方法,得到了该方程在无界区域R~1上拥有一个指数吸引子。     

带调和势的超临界非线性Schrdinger方程的最佳门槛

考虑带调和势的超临界非线性Schroedinger方程，解决了该方程整体解和爆破解存在所依赖的初始条件的最佳分界门槛．通过构造两类强制变分问题和建立局部不变半流，运用势井方法和凹方法，获得了该方程在两个不同的空间中的整体解和爆破解的最佳门槛条件．     

OPTIMAL HARVESTING POLICY FOR INSHORE-OFFSHORE FISHERY MODEL WITH IMPULSIVE DIFFUSION

This article studies the inshore-offshore fishery model with impulsive diffusion. The existence and global asymptotic stability of both the trivial periodic solution and the positive periodic solution are obtained. The complexity of this system is also analyzed. Moreover, the optimal harvesting policy are given for the inshore subpopulation, which includes the maximum sustainable yield and the corresponding harvesting effort.     

Lower-dimensional linear complementarity problem approaches to the solution of a bi-obstacle problem

A globally convergent Broyden-like method for solving a bi-obstacle problem is proposed based on its equivalent lower-dimensional linear complementarity problem. A suitable line search technique is introduced here. The global and superlinear convergence of the method is verified under appropriate assumptions.     

运算放大器一种新的分析方法

从入射阻抗ＺＡ和反馈阻抗ＺＢ的概念出发，借助网络的Ｙ参数导出可供计算机编程的电压增益（ＡＶ）的一般表达式，并引入实例进行理论分析．结果表明：这种方法不仅适用于分析单环和多环反馈型运算放大器电路，同时对设计多种新功能的运算放大器电路是十分有效的     

国际市场营销管理与决策信息系统(IMMADIS)原型研究

分析归纳了国际市场营销管理与信息的特征，把系统目标分解为三级，依此提出的国际市场营销管理与决策信息系统结构模式，充分考虑了计算机在企业管理中应用的优势与特点，同时又考虑到国情，便于企业开发实施。