利用最小调整法求解特殊的二维0-1规划

具有特殊约束的二维0-1规划的实际应用广泛,在解法中多是应用传统算法,或是在它基础上进行改进,但是此类解法计算繁琐不易推广.针对这种情形,本文引入最小调整法处理此类问题,并将其与传统算法进行对比,充分展示了该方法的优越性,呈现出灵活、方便、简单、易行的特点.通过举例验证了方法的有效性.     

Convergence analysis of implicit iterative algorithms for asymptotically nonexpansive mappings

In this paper, we consider the weak and strong convergence of an implicit iterative process with errors for two finite families of asymptotically nonexpansive mappings in the framework of Banach spaces. Our results presented in this paper improve and extend the recent ones announced by many others.     

A constructive proof of Ky Fan’s coincidence theorem

We present a constructive proof for the well-known Ky Fan’s coincidence theorem through a simplicial algorithm. In a finite number of steps the algorithm generates a simplex containing an approximate coincidence point. In the limit, when the mesh size converges to zero, the sequence of approximations converges to a coincidence point. This research was carried out while the second author was visiting the CentER for Economic Research, Tilburg University. He would like to thank both CentER and the Netherlands Organization for Scientific Research (NWO) for their financial support.     

A note on a paper “A regularization method for the proximal point algorithm”

In this note, a small gap is corrected in the proof of H.K. Xu [Theorem 3.3, A regularization method for the proximal point algorithm, J. Glob. Optim. 36, 115–125 (2006)], and some strict restriction is removed also.      

Gröbner bases, H-bases and interpolation

The paper is concerned with a construction for H-bases of polynomial ideals without relying on term orders. The main ingredient is a homogeneous reduction algorithm which orthogonalizes leading terms instead of completely canceling them. This allows for an extension of Buchberger's algorithm to construct these H-bases algorithmically. In addition, the close connection of this approach to minimal degree interpolation, and in particular to the least interpolation scheme due to de Boor and Ron, is pointed out.

     

一种适合工程实用的捷联航姿算法

从工程实用的角度出发，针对惯性元件输出中存在干扰这一问题对四元数的三子样旋转矢量算法和四阶龙格－库塔法进行了分析和比较，指出四阶龙格－库塔法是一种具有工程实用价值的捷联航姿算法，并给出了在理想情况和有干扰的情况下算法的仿真结果。     

Temporal tracking of spectral variations

We propose a data adaptive spectral estimation algorithm which is suitable for nonstationary estimation situations. This algorithm is based on the conventional Fourier transform of the estimated autocorrelation function. The data adaptive feature is implemented into the autocorrelation function estimation. The algorithm is computationally efficient due to its recursive nature. Its frequency tracking performance is tested against another adaptive algorithm based on the frequently used least mean square algorithm (LMS) of Widrow and Hoff (1960). The two algorithms demonstrate similar performance in many situations. Computer simulations indicate that, when applied to a signal composed of two sinusoids with different power levels, the proposed algorithm tracks the lower-powered sinusoid better than the LMS algorithm.     

Application of the sequential gradient-restoration algorithm to thermal convective instability problems

The problem of the thermal stability of a horizontal incompressible fluid layer with linear and nonlinear temperature distributions is solved by using the sequential gradient-restoration algorithm developed for optimal control problems. The hydrodynamic boundary conditions for the layer include a rigid or free upper surface and a rigid lower surface. The resulting disturbing equations are solved as a Bolza problem in the calculus of variations. The results of the study are compared with the existing works in the literature.The authors acknowledge valuable discussions with Dr. A. Miele.     

异步光分组交换网的流量建模

研究了异步光分组交换网的流量特性，提出了网络流量的解析模型和近似模型。研究表明，在采用计时门限光分组组装算法的情况下，如输入IP流具有短程相关特性(ShortRangeDependent)，则光分组的到达间隔时间呈负指数分布，光分组的长度趋于高斯分布。     

Characteristics of Good Meta-Heuristic Algorithms for the Frequency Assignment Problem

Most writers on frequency assignment algorithms have described the details of a single algorithm, and evaluated the algorithm on selected data sets. There has been relatively little emphasis on describing the common features that are important if an algorithm is to have good performance. This paper describes the key features, with particular emphasis on algorithms for weighted fixed spectrum problems. The use of algorithms handling weighted constraints has become increasingly common in recent years. The advantages and disadvantages of weighting constraints are demonstrated.