基于外推的SAR图像分辨率增强算法

提高合成孔径雷达(SAR)图像的分辨率对自动目标识别等具有重要意义.本文通过对图像的二维频谱进行外推,扩展了SAR系统的等效带宽以达到提高图像分辨率的目的.文中给出了实现外推算法的详尽步骤并进行了仿真验证,仿真结果证实了算法的有效性.     

用于自适应天线的稳健的RLS算法

抗干扰通信是电子战的重要组成部分，自适应天线不仅具有很强的抗干扰能力而且可以与其它通信抗干扰技术相兼容，自适应算法是自适应天线的核心。本文把应用数学学科研究的热门方法之一“稳健估计（RE）”应用于RLS算法中，得到稳健的RLS算法（RRLS），理论分析与计算机模拟结果都证明了RRLS算法基本保持了RLS算法的优点，同时在抗突出值干扰方面，优于RLS算法，提高了RLS算法的稳健性。     

基于进化编程的改进GLA算法

文中提出的矢量量化算法以种群为基础,通过变异算子提高种群的平均适应值,使其逃离局部最小点。降低了该算法对初始码书的敏感程度,然后使用选择算子对种群进行有针对性地操作。高斯－马尔可夫序列实验表明,该算法较好地实现了全局最优,并有助于克服对初始码本较为敏感的缺点。     

一种计算卷积码自由距离的快速算法

本文给出了一种计算卷积码自由距离的快速算法,该算法把遗传算法与模拟退火有机结合并根据随机概率来控制算法的运行,避免了优化迟钝与盲目现象,提出了该算法的收敛质量和速度,模拟结果表明：与已有算法相比,本算法具有更好可靠性,有效性和稳定性。     

Establishment of The Power—Time Curve Equation of Bacterial Growth in the Log Phase

The power-time curves of two species of bacteria, Vibro metschnikovii, Vibro bollisae were determined calorimetrically by using a 2277 bioactivity monitor. The power-time curve equation of bacterial growth in the log phase can be expressed as

Antiferromagnetic Potts Models on the Square Lattice: A High-Precision Monte Carlo Study

We study the antiferromagnetic q-state Potts model on the square lattice for q=3 and q=4, using the Wang–Swendsen–Kotecký (WSK) Monte Carlo algorithm and a powerful finite-size-scaling extrapolation method. For q=3 we obtain good control up to correlation length 5000; the data are consistent with ()=Ae ^{2 p} (1+a ₁ e ^– + ...) as , with p1. The staggered susceptibility behaves as _stagg ^5/3. For q=4 the model is disordered (2) even at zero temperature. In appendices we prove a correlation inequality for Potts antiferromagnets on a bipartite lattice, and we prove ergodicity of the WSK algorithm at zero temperature for Potts antiferromagnets on a bipartite lattice.     

A Shifted-Barrier Primal-Dual Algorithm Model for Linearly Constrained Optimization Problems

In this paper we describe a Newton-type algorithm model for solving smooth constrained optimization problems with nonlinear objective function, general linear constraints and bounded variables. The algorithm model is based on the definition of a continuously differentiable exact merit function that follows an exact penalty approach for the box constraints and an exact augmented Lagrangian approach for the general linear constraints. Under very mild assumptions and without requiring the strict complementarity assumption, the algorithm model produces a sequence of pairs converging quadratically to a pair where satisfies the first order necessary conditions and is a KKT multipliers vector associated to the linear constraints. As regards the behaviour of the sequence x ^k alone, it is guaranteed that it converges at least superlinearly. At each iteration, the algorithm requires only the solution of a linear system that can be performed by means of conjugate gradient methods. Numerical experiments and comparison are reported.     

On the Selection of Random Numbers in the EIGamal Algorithm

The EIGamal algorithm, which can be used for both signature and encryption, is of importance in public-key cryptosystems. However, there has arisen an issue that different criteria of selecting a random number are used for the same algorithm. In the aspects of the sufficiency, necessity, security and computational overhead of parameter selection, this paper analyzes these criteria in a comparative manner and points out the insecurities in some textbook cryptographic schemes. Meanwhile, in order to enhance security a novel generalization of the EIGamal signature scheme is made by expanding the range of selecting random numbers at an acceptable cost of additional computation, and its feasibility is demonstrated.     

A preconditioned conjugate gradient Uzawa-type method for the solution of the stokes problem by mixed Q1–P0 stabilized finite elements

We study the behaviour of a conjugate gradient Uzawa-type method for a stabilized finite element approximation of the Stokes problem. Many variants of the Uzawa algorithm have been described for different finite elements satisfying the well-known Inf-Sup condition of Babu?ka and Brezzi, but it is surprising that developments for unstable ‘low-order’ discretizations with stabilization procedures are still missing. Our paper is presented in this context for the popular (so-called) Q1–P0 element. First we show that a simple stabilization technique for this element permits us to retain the property of a convergence factor bounded independently of the discretization mesh size. The second contribution of this work deals with the construction of a less costly preconditioner taking full advantages of the block diagonal structure of the stabilization matrix. Its efficiency is supported by 2D and. 3D numerical results.     

Neighboring extremals of dynamic optimization problems with path equality constraints

Neighboring extremals of dynamic optimization problems with path equality constraints and with an unknown parameter vector are considered in this paper. With some simplifications, the problem is reduced to solving a linear, time-varying two-point boundary-value problem with integral path equality constraints. A modified backward sweep method is used to solve this problem. Two example problems are solved to illustrate the validity and usefulness of the solution technique. This research was supported in part by the National Aeronautics and Space Administration under NASA Grant No. NCC-2-106. The author is indebted to Professor A. E. Bryson, Jr., Department of Aeronautics and Astronautics, Stanford University, for many stimulating discussions.