Discrete global descent method for discrete global optimization and nonlinear integer programming

A novel method, entitled the discrete global descent method, is developed in this paper to solve discrete global optimization problems and nonlinear integer programming problems. This method moves from one discrete minimizer of the objective function f to another better one at each iteration with the help of an auxiliary function, entitled the discrete global descent function. The discrete global descent function guarantees that its discrete minimizers coincide with the better discrete minimizers of f under some standard assumptions. This property also ensures that a better discrete minimizer of f can be found by some classical local search methods. Numerical experiments on several test problems with up to 100 integer variables and up to 1.38 × 10¹⁰⁴ feasible points have demonstrated the applicability and efficiency of the proposed method.     

Solving a class of multiplicative programming problems via c-programming

In this note we show that many classes of global optimization problems can be treated most satisfactorily by classical optimization theory and conventional algorithms. We focus on the class of problems involving the minimization of the product of several convex functions on a convex set which was studied recently by Kunoet al. [3]. It is shown that these problems are typical composite concave programming problems and thus can be handled elegantly by c-programming [4]–[8] and its techniques.     

Cauchy problem in the class of monotone increasing functions

The paper establishes some solvability conditions of the Cauchy problem for linear differential equation in the class of monotone increasing functions. The results are applied for clarifying the possibility of flight along a given trajectory under existence of braking forces.     

一类椭圆型方程的多重解

利用极小极大方法获得了一类Dirichlet问题多重解的存在性结果.     

强色指数的一个新的上界

给出了图的强色指数的一个新的上界，并指出几类恰好达到该上界的图，从而改进了Erodoes和Nesetri的强色指数猜想，在某种意义上证明了这个猜想。     

用光栅衍射法测试液体表面张力

利用π型直线状振源，在待测液面产生正弦形表面驻波，将其作为一种理想的反射式光栅，通过对激光束的衍射，形成线阵衍射光斑．借助LCCD等硬件测试系统及相应的数据采集与处理系统，实时准确地测量液体表面张力。     

良序套张量积的代数中的强不可约算子

设Ｈ为复的可分无限维Ｈｉｌｂｅｒｔ空间，称有界线性算子Ｔ为强不可约的，如果与Ｔ可交换的幂等算子只有０和Ｉ．王宗尧、蒋春澜、纪有清等人证明了在任何一个套的套代数中都存在大量的强不可约算子，并且找到了它们的酉轨道闭包．本文考虑有限个套的张量积的代数中强不可约算子的存在性问题。证明了：对复平面上任何一个连通完备集σ、总存在一个对角算子Ｎ和它的一个范数可以任意小的紧摄动Ｔ＝Ｘ＋Ｋ，使得Ｔ是一个强不可约算子、Ｔ在有限个良序套的张量积的代数中，并且σ（Ｔ）＝σｌｒｅ（Ｔ）＝σ（Ｎ）＝σｌｒｅ（Ｎ）＝σ进一步，文章还对具有单点谱的算子和良序套与正交补为良序套的张量积的代数进行了讨论，得到了一些结果．     

谈普朗克质量

简要介绍了普朗克于1912年提出的三个基本物理量：普朗克质量、普朗克长度和普朗克时间，它们巳被列入1986和1998年基本物理常数表，该文只讨论普朗克质量，假定原子核内存在量子化的核力场，命名其场量子为“引斥子”，其质量推算出恰好等于普朗克质量，由此可用4个耦合常数定量地描述四种相互作用的强度比，从而还可找到一种测定G的新方法。     

关于半线性热方程整体解的注记

利用Besov空间的热核刻画及压缩映射原理,研究半线性热方程ut-△u＝u|u|a的初值问题,得到了当初值u0∈Lp0(Rn)且||u0||(B·)p-n (1/p0-1/p),∞(Rn)(p0＝na/2,p＞p0)充分小时,整体解的存在性及在一定条件下解的惟一性.     

Hyers–Ulam stability of linear differential operator with constant coefficients

Let P(z) be a polynomial of degree n with complex coefficients and consider the n–th order linear differential operator P(D). We show that the equation P(D)f = 0 has the Hyers–Ulam stability, if and only if the equation P(z) = 0 has no pure imaginary solution. (© 2003 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)