改进型遗传算法在加载天线设计中的运用

遗传算法是一种全新的优化搜索方法，可以用来解决各种复杂的实际问题。针对简单型遗传算法的一些不足之处，介绍了一种改进型的遗传算法，并阐述了其在短波宽带集总加载天线优化设计中的运用。     

Wavelet Collocation Methods for a First Kind Boundary Integral Equation in Acoustic Scattering

In this paper we consider a wavelet algorithm for the piecewise constant collocation method applied to the boundary element solution of a first kind integral equation arising in acoustic scattering. The conventional stiffness matrix is transformed into the corresponding matrix with respect to wavelet bases, and it is approximated by a compressed matrix. Finally, the stiffness matrix is multiplied by diagonal preconditioners such that the resulting matrix of the system of linear equations is well conditioned and sparse. Using this matrix, the boundary integral equation can be solved effectively.     

ON THE CONVERGENCE OF MULTIPLICATIVE ITERATIVE ALGORITHMS WITH INEXACT LINE SEARCH

1.IntroductionIntillspaperweanalyzetheconvergenceonmultiplicativeiterativealgorithmsfortheIninimizationofadiffcrentiablefunctiondefinedonthepositiveorthantofR".ThealgorithmissllggestedbyEggermolltl'],andisrelatedtotheEM[2](Expextation--Maximization)algoritllnlforPositronemissiontonlography[']andimagereconstructi..14].Wecollsidertheproblenl"linf(x)s.t.x20.Themultiplicativeiterativealgorithmshavethel'orlniforj=l,2,',n,withAhdeterminedthroughalinesearch.Whilelusem[5]establishedanelegantconv…     

Numerical integration of ordinary differential equations on manifolds

Summary This paper is concerned with the problem of developing numerical integration algorithms for differential equations that, when viewed as equations in some Euclidean space, naturally evolve on some embedded submanifold. It is desired to construct algorithms whose iterates also evolve on the same manifold. These algorithms can therefore be viewed as integrating ordinary differential equations on manifolds. The basic method “decouples” the computation of flows on the submanifold from the numerical integration process. It is shown that two classes of single-step and multistep algorithms can be posed and analyzed theoretically, using the concept of “freezing” the coefficients of differential operators obtained from the defining vector field. Explicit third-order algorithms are derived, with additional equations augmenting those of their classical counterparts, obtained from “obstructions” defined by nonvanishing Lie brackets.     

Local and Parallel Finite Element Algorithms for Eigenvalue Problems

Abstract Some new local and parallel finite element algorithms are proposed and analyzed in this paper foreigenvalue problems.With these algorithms, the solution of an eigenvalue problem on a fine grid is reduced tothe solution of an eigenvalue problem on a relatively coarse grid together with solutions of some linear algebraicsystems on fine grid by using some local and parallel procedure.A theoretical tool for analyzing these algorithmsis some local error estimate that is also obtained in this paper for finite element approximations of eigenvectorson general shape-regular grids.     

Sequential Decoding of Convolutional Codes for Rayleigh Fading Channels

The performance of sequential decoding of long constraint length convolutional codes is evaluated for Rayleigh fading channels. Sequential decoding is not practical below a certain theoretical signal-to-noise ratio, and these theoretical limits are calculated for a number of modulation methods and code rates. As an example, with BPSK modulation, soft decisions and code rate 1/2, the theoretical signal-to-noise ratio per information bit is 5.7 dB. Above this limit the bit error rate can be made arbitrarily small by increasing the constraint length at no significant complexity cost. Furthermore, it is shown that with carefully chosen quantization steps, 8 level uniform quantization gives a negligible loss also for sequential decoding on a Rayleigh fading channel. Simulation results using 8 level quantization correspond well with the theoretical performance bounds. Also, the performance on a correlated channel with finite interleaving has been obtained. With an interleaver depth of 50×50 and a normalized doppler frequency equal to 0.01 we are only 0.5 dB away from the performance with perfect interleaving. Finally, bit error rate results show this scheme to compete well with Turbo codes.     

Generalization of Murty's direct algorithm to linear and convex quadratic programming

Murty's algorithm for the linear complementarity problem is generalized to solve the optimality conditions for linear and convex quadratic programming problems with both equality and inequality constraints. An implementation is suggested which provides both efficiency and tight error control. Numerical experiments as well as field tests in various applications show favorable results.The author thanks K. G. Murty for his encouragement and helpful comments.     

Affine-scaling for linear programs with free variables

The affine-scaling modification of Karmarkar's algorithm is extended to solve problems with free variables. This extended primal algorithm is used to prove two important results. First the geometrically elegant feasibility algorithm proposed by Chandru and Kochar is the same algorithm as the one obtained by appending a single column of residuals to the constraint matrix. Second the dual algorithm as first described by Adler et al., is the same as the extended primal algorithm applied to the dual.     

利用框架理论对信号进行重建

在Hilbert空间中讨论了框架的一些重要的性质,定义了一个框架算子,并讨论了该算子的性质。根据实际问题构造了一框架,使信号在此框架下的投影正好为非均匀采样值。给出了一种框架界的估计方法和重建原信号的迭代算法,最后,用仿真验证了此算法的有效性。     

基于DOCSIS标准的HFC数据加密算法的分析

基于DOCSIS标准的增强型基线保密性接口（BPI＋）采用56bit DES加密分组数据，采用二密钥三重DES加密通信量加密密钥。这种多重加密技术的应用为HFC网络的数据传输提供了相当于或更好于专线级的网络安全与加密性能。