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.     

On interpolation by radial polynomials

A lemma of Micchelli's, concerning radial polynomials and weighted sums of point evaluations, is shown to hold for arbitrary linear functionals, as is Schaback's more recent extension of this lemma and Schaback's result concerning interpolation by radial polynomials. Schaback's interpolant is explored. Happy 60th and beyond, Charlie! Mathematics subject classifications (2000) 41A05, 41A6.     

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.     

（0,1;0）-INTERPOLATION ON INFINITE INTERVAL （-∞, ＋∞）

In this paper, we study the explicit representation and convergence of （0, 1;0）-interpolation on infisite interval, which means to determine a polynomial of degree ≤ 3n - 2 when the function values areprescribed at two set of points namely the zeros of Hn（x） and H′n （x） and the first derivatives at the zerosof H′n（x）.     

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

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

水闸闸室结构三维样条边界元分析

用三维样边界元法分析水闸闸室结构。底板，闸墩和载水墙等为其子结构，交通桥，工作桥和胸墙等处理为内部支撑。地基和边载可以是任意的，只要能给定地表位移面力关系。在各种工况下，不论是设置平板门还是弧形门，是平底板是反拱底板，即使在稀疏剖分下也能给出高精度的位移场，应力场和地基反力场。     

系统动力学模型结构分析中表函数的改进方法

分析了非线性系统动力学(SD)模型中表函数环节的传统表示方法,指出该方法对于进行SD模型的结构分析所造成的障碍,并提出了用牛顿插值的承袭性算法来改进表函数环节的表示方法的思路.接着分别介绍了用差商和差分牛顿插值法改进表函数的过程.最后,通过一个实例说明了表函数改进的方法,并展示了以此为基础进行结构分析的思路.     

C~k连续的保形分段2k次多项式插值

1．引言在每个子区间上，通过插入至多一个内结点，Brodlie和Butt［1］给出了分段三次多项式保形插值算法，Randal［2］等讨论了分段五次多项式插值，作者［31讨论了一般分段奇次多项式的保形插值，并且给1了内结点的位置范围公式．这种插值方法完全解决了一般的分段奇次多项式的保形插值问题．关于分段偶次多项式的保形插值，大多数文献只讨论分段二次保形插值，这里要特别指出的是Shumake［4j导出了二次样条保凸的充要条件，并且给出了一个二次样条保形插值的方法．在每一个子区间上至多插入一个内结点，则一个二次插值样条就可得到．作…