Predictor-Corrector Smoothing Methods for Monotone LCP

In this paper, we analyze the global and local convergence properties of two predictor-corrector smoothing methods, which are based on the framework of the method in [1], for monotone linear complementarity problems (LCPs). The difference between the algorithm in [1] and our algorithms is that the neighborhood of smoothing central path in our paper is different to that in [1]. In addition, the difference between Algorithm 2.1 and the algorithm in [1] exists in the calculation of the predictor step. Comparing with the results in [1],the global and local convergence of the two methods can be obtained under very mild conditions. The global convergence of the two methods do not need the boundness of the inverse of the Jacobian. The superlinear convergence of Algorithm 2.1‘ is obtained under the assumption of nonsingularity of generalized Jacobian of Φ(x,y) at the limit point and Algorithm 2.1 obtains superlinear convergence under the assumption of strict complementarity at the solution. The efficiency of the two methods is tested by numerical experiments.     

The General Solution of Ming Antu＇s Problem

In two centuries ago,Ming Autu discovered the famous Catalan numbers while he tried to expand the function sin(2px) as power series of sin(x) for the case p=1,2,3.Very recently,P.J.Larcombe shows that for any p,sin(2px) can always be expressed as an infinite power series of sin(x) involving precise combinations of Catalan numbers as part of all but the initial p terms and gave all expansions for the case p=4,5.The present paper presents the desired expansion for arbitrary integer p.     

Cauchy Problem of Some Doubly Degenerate Parabolic Equations with Initial Datum a Measure

This paper discusses the Cauchy problem of the equation

Existence of Entire Solutions of a Singular Semilinear Elliptic Problem

In this paper, we obtain some existence results for a class of singular semilinear elliptic problems where we improve some earlier results of Zhijun Zhang. We show the existence of entire positive solutions without the monotonic condition imposed in Zhang‘s paper. The main point of our technique is to choose an approximating sequence and prove its convergence. The desired compactness can be obtained by the Sobolev embedding theorems.     

一个新奇的无条件安全的量子密码分发协议

提出了一个基于纠缠交换理论犤2～4犦的量子密钥分发协议。安全性分析证明此QKD协议是无条件安全,而且十分有效。     

A Global Solution to a Two-dimensional Riemann Problem Involving Shocks as Free Boundaries

We present a global solution to a Riemann problem for the pressure gradient system of equations.The Riemann problem has initially two shock waves and two contact discontinuities. The angle between the two shock waves is set initially to be close to 180 degrees. The solution has a shock wave that is usually regarded as a free boundary in the self-similar variable plane. Our main contribution in methodology is handling the tangential oblique derivative boundary values.     

On the Upper Bound of Second Eigenvalues for Uniformly Elliptic Operators of any Orders

Abstract Let Ω R~m(m≥1)be a bounded domain with piecewise smooth boundary Ω.Let t and r bepositive integers with t>r+1. We consider the eigenvalue problems(1.1)and(12),and obtain Theorem 1and Theorem 2, which generalize the results in[1,2.5].     

“调配问题”的动态规划模型与计算

本给出了调配问题的动态规划模型与计算,该表征更具一般化,且便于计算机计算。     

BLOWUP OF SOLUTIONS TO THE CAUCHY PROBLEM FOR NONLINEARWAVE EQUATIONS

gi. IntroductionThis paper deals with solutionS of certain nonlinear wave equationS Of the formcorresponding to Antial conditionSwuersis the wave OPerstor.we are interested in showing the ~ up" Of solutions to (1.1)--(1.2). For that, wereIf ac ~ 1)(n ~ 1) > 2, global solutions of ~ equation subject to very general perturbationsof order p exist Provided the initial data are swhciently small (see I6] and references therein).We are also interested in esthaattw the take when "blow up" occurs. …     

自动波竞争神经网络及其在单源最短路问题中的应用

将竞争机理引入网络的自动波产生与传播过程中，提出自动波竞争神经网络(ACNN)模型，并成功地应用于求解单源最短路问题，给出了基于ACNN的最短路求解算法. 与其他神经网络最短路算法相比，基于ACNN的最短路算法具有网络所需的神经元数目少、神经元及网络的结构简单、易于软硬件的实现、以及全并行方式计算等特点，可用于求解非对称赋权图的最短路径树问题，且其计算时间(迭代次数)仅正比于最短路径上的跃点数，与赋权图的复杂度、路径总长、边长的精度、通路总数等因素无关. 计算机仿真结果表明该算法的有效性和快速求解能力. 关键词： 单源最短路问题 自动波竞争神经网络 脉冲耦合神经网络