具有hollingⅢ类功能反应的非自治捕食系统概周期解

讨论了一类具有hollingⅢ类功能反应的非自治捕食概周期系统，得到了该系统存在的唯一一致渐近稳定概周期解的充分条件。     

在一个新步长规则下梯度投影算法的全局收敛性

考虑约束最优化问题：minx∈Ωf(x)其中:f:R^n→R是连续可微函数，Ω是一闭凸集。本文研究了解决此问题的梯度投影方法，在步长的选取时采用了一种新的策略，在较弱的条件下，证明了梯度投影响方法的全局收敛性。     

ROBUST GLOBAL EXPONENTIAL STABILITY OF UNCERTAIN IMPULSIVE SYSTEMS

By using the quasi-Lyapunov function, some sufficient conditions of global exponential stability for impulsive systems are established, which is the basis for the following discussion. Then, by employing Riccati inequality and Hamilton-Jacobi inequality approach, some sufficient conditions of robust exponential stability for uncertain linear/nonlinear impulsive systems are derived, respectively. Finally, some examples are given to illustrate the applications of the theory.     

Interaction Dynamics in AEC Global Teamwork

Architecture, engineering, and construction (AEC) global project teamwork is communication intensive and relies heavily on synchronous and asynchronous information and collaboration technologies (ICT). We explore in this paper how an asynchronous ICT, called ThinkTank, reshaped the work practice of design-construction global teams, and how the interaction with this ICT reshaped the purpose and benefits of its use. ThinkTank is a web-based asynchronous collaboration and discussion forum. We introduce the influence diffusion model (IDM) that formalizes the process of identifying the influence of people, messages, and terms mathematically. Discovering who the influence leaders in project teams are can be beneficial and critical from a corporate management perspective, since they can guide or motivate the team towards successful actions and outcomes. We present the ThinkTank-IDM integrated system and its validation with a testbed of 53 AEC global team project archived in ThinkTank over 8 years.     

Besov-Morrey spaces: Function space theory and applications to non-linear PDE

This paper is devoted to the analysis of function spaces modeled on Besov spaces and their applications to non-linear partial differential equations, with emphasis on the incompressible, isotropic Navier-Stokes system and semi-linear heat equations. Specifically, we consider the class, introduced by Hideo Kozono and Masao Yamazaki, of Besov spaces based on Morrey spaces, which we call Besov-Morrey or BM spaces. We obtain equivalent representations in terms of the Weierstrass semigroup and wavelets, and various embeddings in classical spaces. We then establish pseudo-differential and para-differential estimates. Our results cover non-regular and exotic symbols. Although the heat semigroup is not strongly continuous on Morrey spaces, we show that its action defines an equivalent norm. In particular, homogeneous BM spaces belong to a larger class constructed by Grzegorz Karch to analyze scaling in parabolic equations. We compare Karch's results with those of Kozono and Yamazaki and generalize them by obtaining short-time existence and uniqueness of solutions for arbitrary data with subcritical regularity. We exploit pseudo-differential calculus to extend the analysis to compact, smooth, boundaryless, Riemannian manifolds. BM spaces are defined by means of partitions of unity and coordinate patches, and intrinsically in terms of functions of the Laplace operator.

     

略谈全球变化教学中多媒体的运用

文章对全球变化教学中使用多媒体教学手段总结了技能技巧和经验;提出了出现问题的处理方法。在全球变化教学中使用多媒体教学手段,能够形象、生动和真实地展示全球各种参数的变化特征。     

一种改进的进化规划算法

本对于全局优化问题提出一个改进的进化规划算法，该算法以概率p接收基于电磁理论求出合力方向作为随机搜索方向，以概率1-p接收按正态分布产生的随机搜索方向。改进算法不仅克服了传统进化规划算法随机搜索的盲目性，而且保留了传统进化规划算法全局搜索性。本算法应用于几个典型例题，数值结果表明本算法是可行的，有效的。     

Banach空间非线性混合型微分-积分方程整体解的存在性和唯一解

研究了Banach空间中非线性混合型微分-积分方程初值问题u′=f(t,u,Tu,Su),u(0)=x0的整体解,完全没有要求f的任何增性,利用Mnch不动点定理和比较结果得到了初值问题整体解的存在性和唯一解,并且给出了一致收敛于唯一解的迭代序列,改进推广和统一了已有的许多结果.     

线性均衡约束最优化的一个广义投影强次可行方向法

本文讨论带线性均衡约束最优化问题,首先利用摄动技术和一个互补函数将问题等价转化为一般约束最优化问题,然后结合广义投影技术和强次可行方向法思想,建立了问题的一个新算法.算法在迭代过程中保证搜索方向不为零,从而使得每次迭代只需计算一次广义投影.在适当的条件下,证明了算法的全局收敛性,并对算法进行了初步的数值试验.     

Minimum Distance Between the Faces of Two Convex Polyhedra: A Sufficient Condition

The problem of finding the Euclidean distance between two convex polyhedra can be reduced to the combinatorial optimization problem of finding the minimum distance between their faces. This paper presents a global optimality criterion for this problem. An algorithm (QLDPA) for the fast computation of the distance between convex and bounded polyhedra is proposed as an application of it. Computer experiments show its fast performance, especially when the total number of vertices is large.