关于推广的Kolmogorov系统的解的定性研究

讨论了推广的单种群Kolmogorov系统的严格正解的存在性,惟一性及全局渐近稳定性,得到了比通常Kolmogorov系统更一般的结果,进一步在周期与概周期的情形下,得到了正周期解与正概周期的存在性。     

Globally Convergent Broyden-Like Methods for Semismooth Equations and Applications to VIP, NCP and MCP

In this paper, we propose a general smoothing Broyden-like quasi-Newton method for solving a class of nonsmooth equations. Under appropriate conditions, the proposed method converges to a solution of the equation globally and superlinearly. In particular, the proposed method provides the possibility of developing a quasi-Newton method that enjoys superlinear convergence even if strict complementarity fails to hold. We pay particular attention to semismooth equations arising from nonlinear complementarity problems, mixed complementarity problems and variational inequality problems. We show that under certain conditions, the related methods based on the perturbed Fischer–Burmeister function, Chen–Harker–Kanzow–Smale smoothing function and the Gabriel–Moré class of smoothing functions converge globally and superlinearly.     

A Cutting Plane Algorithm for Linear Reverse Convex Programs

In this paper, global optimization of linear programs with an additional reverse convex constraint is considered. This type of problem arises in many applications such as engineering design, communications networks, and many management decision support systems with budget constraints and economies-of-scale. The main difficulty with this type of problem is the presence of the complicated reverse convex constraint, which destroys the convexity and possibly the connectivity of the feasible region, putting the problem in a class of difficult and mathematically intractable problems. We present a cutting plane method within the scope of a branch-and-bound scheme that efficiently partitions the polytope associated with the linear constraints and systematically fathoms these portions through the use of the bounds. An upper bound and a lower bound for the optimal value is found and improved at each iteration. The algorithm terminates when all the generated subdivisions have been fathomed.     

Finding the Minimal Root of an Equation with the Multiextremal and Nondifferentiable Left-Hand Part

A problem very often arising in applications is presented: finding the minimal root of an equation with the objective function being multiextremal and nondifferentiable. Applications from the field of electronic measurements are given. Three methods based on global optimization ideas are introduced for solving this problem. The first one uses an a priori estimate of the global Lipschitz constant. The second method adaptively estimates the global Lipschitz constant. The third algorithm adaptively estimates local Lipschitz constants during the search. All the methods either find the minimal root or determine the global minimizers (in the case when the equation under consideration has no roots). Sufficient convergence conditions of the new methods to the desired solution are established. Numerical results including wide experiments with test functions, stability study, and a real-life applied problem are also presented.     

The nonsymmetric case of the Keller-Segel model in chemotaxis: some recent results

Looking at the nonsymmetric case of a reaction-diffusion model known as the Keller-Segel model, we summarize known facts concerning (global in time) existence and prove new blowup results for solutions of this system of two strongly coupled parabolic partial differential equations. We show in Section 4, Theorem 4, that if the solution blows up under a condition on the initial data, blowup takes place at the boundary of a smooth domain . Using variational techniques we prove in Section 5 the existence of nontrivial stationary solutions in a special case of the system. Received April 2000     

A three-parameter family of nonlinear conjugate gradient methods

In this paper, we propose a three-parameter family of conjugate gradient methods for unconstrained optimization. The three-parameter family of methods not only includes the already existing six practical nonlinear conjugate gradient methods, but subsumes some other families of nonlinear conjugate gradient methods as its subfamilies. With Powell's restart criterion, the three-parameter family of methods with the strong Wolfe line search is shown to ensure the descent property of each search direction. Some general convergence results are also established for the three-parameter family of methods. This paper can also be regarded as a brief review on nonlinear conjugate gradient methods.

     

Global stabilization of a Lorenz system

In this paper,using feedback linearizing technique,we show that a Lorenz system can be considered as a cascade system.Moreover,this system satisfies the assumptions of global stabilization of casecade systems.Thus coninuous state feedback control laws are proposed to globally stabilize the Lorenz system at the equilibrium point.Simulation results are presented to verify our method.This method can be further generalized to other chaotic systems such as Chen system,coupled dynamos system,etc.     

基于全局运动信息的视频检索技术

运动信息是描述视频内容的一种重要信息,本文介绍了一个基于全局运动信息的视频检索系统.在该系统中,我们通过对视频数据进行短时全局运动分析,较为精确地提取出了描述全局摄像机运动的双线性运动模型,并以该模型参数为运动特征,以特征点序列顺序匹配以及全局运动矢量距离平方和为基础,构造了一个视频检索方案.实验结果表明,在特定的应用领域,如体育类视频中,我们的检索方案能够实现一定程度的语义内容检索,同时提供了采用其他图像特征所无法实现的检索功能.     

2.5 Gbit/s光发射模块消光比与光接收误码特性

改变2．5Gbit/s光发射模块消光比（EX）,对作为标准接收用的光接收机灵敏度进行了测试。实验表明,EX小于9．0时,光接收灵敏度较差;EX大于15．0时,由于眼图中交叉点偏低或光脉冲波形畸变,可能导致光接收灵敏度恶化;EX在9．0－12．0范围时,光接收灵敏度最佳。     

从GSM到第3代移动通信的演进策略

介绍了第3代移动通信标准的发展,通过对GSM(global system for mobile communications)向UMIS(universal mobiletelecommunications system)的多种演进方式进行的分析与比较,对现有GSM网络运营商如何建设第3代移动通信网提出了一些建议.