遗传算法在GSM移动通信网络频率规划中的应用

应用遗传算法设计和开发了针对爱立信GSM900系统的频率规划软件。在设计中，采用了交叉点存储、变异回退以及分割分步降维的方法，从而提高遗传算法的执行速度。     

Characteristic Features of the Optimal Processing of the Results of Measurements in the Case of a Random Observation Function

An analysis is made of the characteristic features and problems of the optimal processing of the results of measurements in the case of a random observation function utilizing a nonlinear Kalman filter. A method is proposed for increasing the convergence domain of the filter with additional processing of measurements in the frequency domain.     

An Improved Immune Genetic Algorithm for Solving the Optimization Problems of Computer Communication Networks

1　IntroductionIndesigningacomputercommunicationnet work ,thenetworkaveragedelayisanimportantpa rameterinthenetworkperformance .Inthispaper,weonlyconsiderM /M/1networks,whichmeansthatthemessageprocessingtimeisaprobabilisticdensityfunctionwithnegativepower,thegroupar rivalandsendingisofPoissiondistributionwithasinglequeue .Supposethatthenetworktopologicalstructureandtheestimatesoftheexternaltrafficrequirementsaregiven ,howtoselecttheoptimalroutestobeusedbythecommunicatingnodesinthenetworksoast…     

具有控制项的限定记忆卡尔曼滤波器

在已有的限定记忆卡尔曼滤波器的基础上 ,将确定性先验信息作为控制项加以应用 ,推导出了完整的限定记忆卡尔曼滤波公式 ,从而在记忆长度确定的情况下 ,有效地减小了模型不准的误差 ,降低了滤波总误差。仿真同样表明了该方法的有效性     

复杂背景中移动目标的快速识别与跟踪

本文提出一种基于差值的在复杂背景中快速识别和跟踪移动目标的方法。文章总结了关于移动物体连续两帧图像的特点，在图像对比中利用它们空间位移上的相对变化，确定了一套实用的算法，并在程序中改进了像素灰度的读取方式，从而使整套方法显得更加切实而有效。实验表明，本文算法在复杂背景下．对于移动目标识别快速，跟踪准确，抗干扰能力强。     

卷积码的线性系统

介绍了卷积码的线性离散时不变系统模型。从建立卷积码的状态变量方程出发,研究了卷积码的代数结构,并详细论述了基于状态变量方程描述的迭代译码算法。     

一种基于HMM模型的弱小点目标的检测算法

讨论复杂背景、强干扰条件下移动平台下弱小目标的检测，提出一种基于隐Markov模型的快速检测算法，该算法通过计算摄像机视场的运动，消除背景的干扰，通过计算模型中的目标转移概率和似然函数，确定点目标的运动轨迹，实验表明了该算法的有效性。     

Topology optimization of trusses using genetic algorithm,force method and graph theory

In this article size/topology optimization of trusses is performed using a genetic algorithm (GA), the force method and some concepts of graph theory. One of the main difficulties with optimization with a GA is that the parameters involved are not completely known and the number of operations needed is often quite high. Application of some concepts of the force method, together with theory of graphs, make the generation of a suitable initial population well‐matched with critical paths for the transformation of internal forces feasible. In the process of optimization generated topologically unstable trusses are identified without any matrix manipulation and highly penalized. Identifying a suitable range for the cross‐section of each member for the ground structure in the list of profiles, the length of the substrings representing the cross‐sectional design variables are reduced. Using a contraction algorithm, the length of the strings is further reduced and a GA is performed in a smaller domain of design space. The above process is accompanied by efficient methods for selection, and by using a suitable penalty function in order to reduce the number of numerical operations and to increase the speed of the optimization toward a global optimum. The efficiency of the present method is illustrated using some examples, and compared to those of previous studies. Copyright © 2003 John Wiley & Sons, Ltd.     

一种有效减少ADI-FDTD数值色散的方法

ADI—FDTD算法的数值色散效应较为明显，本文的研究表明一种通过添加各向异性媒质来修正相速误差，从而减少FDTD数值色散的方法，同样适用于ADI-FDTD，且收效更为显著。数值运算结果证明该方法能够简单有效地去除较宽频带范围内的色散。     

Belief-Propagation-Approximated Decoding of Low-Density Parity-Check Codes

In this paper, we propose a new reduced-complexity decoding algorithm of Low-Density Parity-Check (LDPC) codes, called Belief-Propagation-Approximated (BPA) algorithm, which utilizes the idea of normalization and translates approximately the intricate nonlinear operation in the check nodes of the original BP algorithm to only one operation of looking up the table. The normalization factors can be obtained by simulation, or theoretically. Simulation results demonstrate that BPA algorithm exhibits fairly satisfactory bit error performance on the Additive White Gaussian Noise (AWGN) channel.