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…     

卷积码的线性系统

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

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.     

嵌入式数字智能涡街流量计的设计开发

针对目前涡街流重计存在精度不高的问题，采用Toeplitz自相关矩阵近似的准牛顿算法，对涡街传感器输出信号进行数字信号处理。针对客户超低功耗的要求，开发设计以超低功耗的混合信号处理器(MSP430F149)为微处理器，以采用KS0713为控制器的LCD为液晶显示模块，符合HART总线协议的嵌入式智能涡街流量计。     

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

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

遗传算法在期货市场创新决策中的应用

研究了遗传算法在期货市场创新决策中的应用问题，在期货市场的保值者和投资者数目以及期货合约结构模型的基础上，设计了期货市场创新的染色体表达和遗传操作并进行了仿真研究。     

BIDPS^＊：基本的循环加深周边搜索算法

ＢＩＤＰＳ＾＊是一种把ＩＤＡ算法和ＰＳ法相结合而产生的人工智能搜索算法。该文研究了不考虑启发式计算最小化技术的搜索效率问题，提出了一些新的算法效率的度量，用８数码难题检验了ＢＩＤＰＳ算法并与ＩＤＡ算法进行了比较分析，实验结果表明尽管ＢＩＤＰＳ启发式计算量较大，但较ＩＤＡ算法在效率上还有所提高的。