截断光束的广义M2因子

使用渐近分析法、广义截断二阶矩法和自收敛束宽法研究了旋转对称截断光束的广义M2因子，分析了这三种方法的物理联系以及如何惟一确定广义M2因子问题，并用数值计算结果做了说明. 关键词： 广义M2因子 渐近分析 广义截断二阶矩法 自收敛束宽     

关于多目标数学规划的最优性条件

本文讨论定义于Ｂａｎａｃｈ空间的多目标数学规划，得到一些ε－最优解和（弱）有效解的必要条件，充分条件和必要充分条件。     

环上矩阵广义Moore-Penrose逆的存在性

讨论带有对合反自同构*有单位元的结合环R上矩阵的广义Moore-Penrose 逆,给出了环R上矩阵的广义Moore-Penrose逆存在的几个充要条件．特别,得到了环 R上矩阵A的关于M和N的广义Moore-Penrose逆存在的充要条件是A有分解A= GDH,其中D2=D,(MD)*=MD,(GD)*MGD+M(I-D)和DHN-1(DH)*+ (I-D)M-1均可逆．     

一类广义长短波方程的整体适定性

In the present paper,we investigate the well-posedness of the global solution for the Cauchy problem of generalized long-short wave equations.Applying Kato's method for abstract quasi-linear evolution equations and a priori estimates of solution,we get the existence of globally smooth solution.     

框式约束凸二次规划问题的内点算法

In this paper,a primal-dual interior point algorithm for convex quadratic progromming problem with box constrains is presented.It can be started at any primal-dual interior feasible point.If the initial point is close to the central path,it becomes a central path-following alogorithm and requires a total of O(√nL)number of iterations,where L is the input length.     

动态广义球对称含荷黑洞的统计熵

利用改进了的brickwall膜模型,计算了动态广义球对称含荷黑洞的熵,研究结果表明,对于动态黑洞,将黑洞熵表示为与视界面积成正比时,则比例系数总与动态黑洞的视界速度有关 关键词： 广义球对称黑洞 黑洞熵 brick-wall膜模型 WKB近似     

The Spirit Is Willing: Nonlinearity, Bifurcations, and Mental Control

In recent years there has been considerable interest in the construction of nonlinear models of the dynamics of human behavior. In this exploratory article we argue that attempts at controlling problematic thoughts, emotions, or behaviors can lead to nonlinearity in mental/behavioral dynamics. We illustrate our model by fitting threshold autoregression models to self-recorded time series of the daily highs in intensity of anxiety and obsessive ruminations, kept by an individual in therapy for this problem. In our discussion, we raise the possibility that bifurcations that occur in this nonlinear model may offer insight into mental control paradoxes.     

广义Schur补的广义逆

对四分块矩阵A=A(︿) A(︿,︿′)A(︿′,︿) A(︿′)来说 ,如果 A和 A(︿)都是非奇异的 ,则A- 1 (︿′) =(A/︿) - 1 ,这里 A/ ︿=A(︿′) -A(︿′,︿) A(︿) - 1 A(︿,︿′)是 A(︿)在 A中的 Schur补 .王伯英教授指出上述等式 ,对半正定的 Hermitian矩阵而言 ,一般也是不能推广到 Moore-Penrose逆上去的 .在某些限制条件下 ,我们证明了广义逆的主子矩阵与广义 Schur补的关系是密切的 ,它使经典结果成为特例     

Quadratic transformations of the sixth Painlevé equation with application to algebraic solutions

In 1991, one of the authors showed the existence of quadratic transformations between the Painlevé VI equations with local monodromy differences (1/2, a, b, ±1/2) and (a, a, b, b). In the present paper we give concise forms of these transformations. They are related to the quadratic transformations obtained by Manin and Ramani–Grammaticos–Tamizhmani via Okamoto transformations. To avoid cumbersome expressions with differentiation, we use contiguous relations instead of the Okamoto transformations. The 1991 transformation is particularly important as it can be realized as a quadratic‐pull back transformation of isomonodromic Fuchsian equations. The new formulas are illustrated by derivation of explicit expressions for several complicated algebraic Painlevé VI functions. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

COSEARCH: A Parallel Cooperative Metaheuristic

In order to design a well-balanced metaheuristic for robustness, we propose the COSEARCH approach which manages the cooperation of complementary heuristic methods via an adaptive memory which contains a history of the search already done. In this paper, we present the idiosyncrasies of the COSEARCH approach and its application for solving large scale instances of the quadratic assignment problem (QAP). We propose an original design of the adaptive memory in order to focus on high quality regions of the search and avoid attractive but deceptive areas. For the QAP, we have hybridized three heuristic agents of complementary behaviours: a Tabu Search is used as the main search algorithm, a Genetic Algorithm is in charge of the diversification and a Kick Operator is applied to intensify the search. The evaluations have been executed on large scale network of workstations via a parallel environment which supports fault tolerance and adaptive dynamic scheduling of tasks.