不等式约束优化问题的一个势函数

基于Carroll(1961)建立的罚函数，本文给出了不等式约束优化问题的一个势函数，并且讨论了该函数的性质．最后证明了在此基础上建立的对偶算法具有Q-线性收敛性．     

L p -dual Quermassintegral sums

In this paper, we first introduce a concept of L _p -dual Quermassintegral sum function of convex bodies and establish the polar projection Minkowski inequality and the polar projection Aleksandrov-Fenchel inequality for L _p -dual Quermassintegral sums. Moreover, by using Lutwak’s width-integral of index i, we establish the L _p -Brunn-Minkowski inequality for the polar mixed projection bodies. As applications, we prove some interrelated results. This work was partially supported by the National Natural Science Foundation of China (Grant No. 10271071), Zhejiang Provincial Natural Science Foundation of China (Grant No. Y605065) and Foundation of the Education Department of Zhejiang Province of China (Grant No. 20050392)     

Approximation of signals from local averages

This work is concerned with approximation of a signal from local averages. It improves a result of Butzer and Lei [P.L. Butzer, J. Lei, Approximation of signals using measured sampled values and error analysis, Commun. Appl. Anal. 4 (2000) 245–255].     

On the classification of all self-dual additive codes over GF(4) of length up to 12

We consider additive codes over GF(4) that are self-dual with respect to the Hermitian trace inner product. Such codes have a well-known interpretation as quantum codes and correspond to isotropic systems. It has also been shown that these codes can be represented as graphs, and that two codes are equivalent if and only if the corresponding graphs are equivalent with respect to local complementation and graph isomorphism. We use these facts to classify all codes of length up to 12, where previously only all codes of length up to 9 were known. We also classify all extremal Type II codes of length 14. Finally, we find that the smallest Type I and Type II codes with trivial automorphism group have length 9 and 12, respectively.     

Persistence and stability for a two-species ratio-dependent predator-prey system with distributed time delay

A two-species ratio-dependent predator-prey model with distributed time delay is investigated. It is shown that the system is persistent under some appropriate conditions, and sufficient conditions are obtained for both the local and global stability of the positive equilibrium of the system.     

Analysis of Static Simulated Annealing Algorithms

Generalized hill climbing (GHC) algorithms provide a framework for modeling local search algorithms to address intractable discrete optimization problems. This paper introduces a measure for determining the expected number of iterations to visit a predetermined objective function level, given that an inferior objective function level has been reached in a finite number of iterations. A variation of simulated annealing (SA), termed static simulated annealing (S²A), is analyzed using this measure. S²A uses a fixed cooling schedule during the algorithm execution. Though S²A is probably nonconvergent, its finite-time performance can be assessed using the finite-time performance measure defined in this paper.     

Quotient normed cones

Given a normed cone (X, p) and a subconeY, we construct and study the quotient normed cone (X/Y,p) generated byY. In particular we characterize the bicompleteness of (X/Y, ‖·‖ ^p ,p) in terms of the bicompleteness of (X, p), and prove that the dual quotient cone ((X/Y)^*, || · ‖·‖^p,p) can be identified as a distinguished subcone of the dual cone (X ^*, || · ||_{p, u}). Furthermore, some parts of the theory are presented in the general setting of the spaceCL(X, Y) of all continuous linear mappings from a normed cone (X, p) to a normed cone (Y, q), extending several well-known results related to open continuous linear mappings between normed linear spaces.     

Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem

First, this paper deals with lagrangean heuristics for the 0-1 bidimensional knapsack problem. A projected subgradient algorithm is performed for solving a lagrangean dual of the problem, to improve the convergence of the classical subgradient algorithm. Secondly, a local search is introduced to improve the lower bound on the value of the biknapsack produced by lagrangean heuristics. Thirdly, a variable fixing phase is embedded in the process. Finally, the sequence of 0-1 one-dimensional knapsack instances obtained from the algorithm are solved by using reoptimization techniques in order to reduce the total computational time effort. Computational results are presented.     

气体放电等离子体特性测量I-V曲线不对称性的研究

利用气体放电双探针法研究了等离子体的I-V曲线中的电流I相对于电压V轴交点的不对称性,并提出2种可能的解释:一认为是由于两探针表面积不同引起的;二认为是由于探针所在处等离子体电位不等引起的.本文利用仪器的工艺误差和调换放电管电压的方法,对提出的2种可能原因分别进行验证,并指出第二种解释的合理性,并对其进行了理论分析.     

差分流线扩散法的局域稳定性分析

本文讨论差分流线扩散法的局部稳定性分析，在理论上证明了该方法依旧保持着流线扩散法扰动局部影响的特性。