Boundedness of semilinear Duffing equations at resonance in a critical situation

In this paper, we propose a sufficient and necessary condition for the boundedness of all the solutions for the equation $\ddot{x}+n^{2}x+g(x)=p(t)$ with the critical situation that $|{\int }_0^{2\pi }p(t)e^{?int}dt|=2|g(+\infty )?g(?\infty )|$ on g and p, where $n\in {\mathbb{N}}^{+}$, $p(t)$ is periodic and $g(x)$ is bounded.     

k-树的补图的最小填充和树宽

一个图的最小填充问题是寻求边数最少的弦母图,一个图的树宽问题是寻求团数最小的弦母图,这两个问题分别在稀疏矩阵计算及图的算法设计中有非常重要的作用．一个k-树G的补图G称为k-补树．本文给出了k-补树G的最小填充数f(G) 及树宽TW(G)．     

An optodynamic method for the real-time determination of the depth of a laser-drilled hole

An experimental method for determining the real-time depth of laser-drilled holes is presented. The proposed method involves detecting the laser-induced optoacoustic waves generated during the interaction of the laser beam with the material. Our optodynamic study involved measuring the propagation times of these waves as they traveled through the material and analyzing their temporal behavior during the drilling process. The experimental observations revealed an exponential relationship between the propagation time of the longitudinal stress wave and the number of consecutive laser pulses. Received: 25 October 2001 / Accepted: 27 October 2001 / Published online: 20 December 2001     

一类具有非局部反应扩散方程的奇摄动问题

本文讨论一类具非局部反应扩散方程的奇摄动初始边值问题，利用迭代法及微分不等式，研究了初始边值问题的存在唯一及其渐近性态。     

α－萘甲酰呋喃甲酰甲烷的合成及谱学性质的研究

本文用Ｃｌａｉｓｅｎ缩合反应合成了未见文献报道的一种新的β－二酮，α－萘甲酰呋喃甲酰甲烷（α－ＮＦＭ），考察了该化合物的红外光谱、质谱及核磁共振氢谱。确定其存在着互变异构。     

关于NF-环的构造

研究了无限的ＮＦ－环及有限的ＮＦ－环，并且给出了有限ＮＦ－环的构造．     

具有非局部边界条件的奇摄动反应扩散问题

本文研究了一类具有非局部边界条件的奇摄动反应扩散初始边值问题．在适当的条件下，利用比较定理讨论了问题解的渐近性态．     

A Strongly and Superlinearly Convergent SQP Algorithm for Optimization Problems with Linear Complementarity Constraints

This paper discusses a kind of optimization problem with linear complementarity constraints, and presents a sequential quadratic programming (SQP) algorithm for solving a stationary point of the problem. The algorithm is a modification of the SQP algorithm proposed by Fukushima et al. [Computational Optimization and Applications, 10 (1998), 5-34], and is based on a reformulation of complementarity condition as a system of linear equations. At each iteration, one quadratic programming and one system of equations needs to be solved, and a curve search is used to yield the step size. Under some appropriate assumptions, including the lower-level strict complementarity, but without the upper-level strict complementarity for the inequality constraints, the algorithm is proved to possess strong convergence and superlinear convergence. Some preliminary numerical results are reported.