关于两类重要微分不等式

本文研究了两类重要微分不等式有界解的性质。引入了赋范线性空间(f,‖‖M),利用比较定理和黎卡提方程解的性质,给出了有界解的上界估计式,推广和改进了文[1,2]中的有关结果.     

变量有广义界线性规划的直接对偶单纯形法

本文讨论变量有广义界线性规划问题借助标准形线性规划同单纯形法技术，建立问题的一个直接对偶单纯形法。分析了方法的性质，给出了初始对偶可行基的计算方法，并用实例说明方法的具体操作。     

有界变量线性规划的基线算法

本文对有界变量线性规划的算法进行了研究，得到了一种解此问题的新算法。文中根据基线算法的算法原理，通过对BL表的旋转，在各变量满足界约束的条件下，使目标函数值不断增大，直至得到有界硬上界，从而得到问题的最优解。文中给出了有界变量线性规划基线算法的计算步骤，并给出了一个例子。与单纯形法相比，采用基线算法解有界变量线性规划操作更简单。迭代次数少，解题速度更快。     

界约束下算子方程最小二乘问题的条件梯度法

研究如下界约束下算子方程最小二乘问题:min x∈Ω‖L(X:A_1,…,At;B_1,…,B_t)-T‖~2,其中‖.‖为Frobenius范数,L(X:A_1…A_t;B_1,…,B_t)为关于X的线性矩阵算子(或齐次线性变换),Ai∈R~(p×m),B_j∈R~(n×q)i,j=1,…,n为算子L的系数矩阵,丁为右端矩阵,ΩR~(m×n)为界约束凸集合.提出了求解问题的条件梯度迭代算法及其简要收敛性分析,并给出条件梯度算法的几类加速形式.随机数据和图像恢复模型数据的实验结果表明说明算法是可行高效的.     

Complexity of games and bounded rationality

An attempt is made to propose a concept of limited rationality for choice junctions based on computability theory in computer science.

Starting with the observation that it is possible to construct a machine simulating strategies of each individual in society, one machine for each individual's preference structure, we identify internal states of this machine with strategies or strategic preferences. Inputs are possible actions of other agents in society thus society is effectively operating as a game generated by machines. The main result states that effective realization of game strategies bound by the “complexity of computing machines'.     

基于洋流运动态势的移动预测水下定位研究

针对基于移动预测定位的SLMP算法在定位中没有参考其他节点的移动预测信息,提出了基于洋流态势的移动预测CMP算法,算法在移动定位的过程中,考虑水流影响,结合了前驱节点的移动预测信息及其他信息来完成预测.大量的仿真结果表明,CMP算法在定位覆盖度及平均通信代价方面有良好的性能,也表明了CMP算法能够更好的适应于大规模水下移动环境.     

Explicit formula of holomorphic automorphism group on complex homogeneous bounded domains

We known that the maximal connected holomorphic automorphism group Aut (D)(0) is a semi-direct product of the triangle group T(D) and the maximal connected isotropic subgroup Iso(D)(0) of a fixed point in the complex homogeneous bounded domain D and any complex homogeneous bounded domain is holomorphic isomorphic to a normal Siegel domain D(VN,F). In this paper, we give the explicit formula of any holomorphic automorphism in T(D(VN, F)) and Iso(D(VN,F))(0), where G(0) is the unit connected component of the Lie group G.     

Bloch spaces on bounded symmetric domains in complex Banach spaces Dedicated to Professor Sheng GONG on the occasion of his 75th birthday

We give a definition of Bloch space on bounded symmetric domains in arbitrary complex Banach space and prove such function space is a Banach space. The properties such as boundedness, compactness and closed range of composition operators on such Bloch space are studied.