On Burst Length Distribution and Preemption Probabilities in OBS Networks with Burst Segmentation

Recently, preemption techniques have attracted considerable attention as a means to provide differentiated quality of service in optical burst switching (OBS) networks. This paper is focused on the analysis of preemption probabilities for bursts within the same priority class. As proposed by Vokkarane and Jue ((2003)* IEEE J Select Areas Commun 21(7): 1198–1209) an incoming burst will preempt the burst in service, within the same priority class, if the residual length of the burst in service is smaller than the incoming burst length. For a general case with wavelength conversion, the preemption probability of contending bursts with a generic service distribution, not necessarily exponential, is analyzed. First, we show that the size distribution for the preempting bursts is shifted to larger values, in comparison to the original burst size distribution. Second, we obtain an upper and lower bound for the preemption probability. Finally, the asymptotic behavior of the OBS switch is analyzed showing that preemption will always occur for a very large number of wavelengths.     

嵌入式GPS车载系统定位数据压缩算法的实现

根据嵌入式系统的特征，分析数据压缩模型工作原理，结合GPS定位数据的格式和特点，创造性地提出了嵌入式GPS定位数据的实时压缩的新算法，并通过模拟仿真得到验证，效果显著。     

一种新颖的基于非压缩数字视频的水印盲检测算法

数字水印是一种嵌入到多媒体数据中用来进行版权标识的工具。在众多的宿主媒体中，数字视频因具有隐藏容量大、透明性好、鲁棒性强等诸多优点而受到日益广泛的关注。但是很多文献中提到的视频水印都是从数据流中提取单帧图像进行处理，这类算法与静态图像的水印方法如出一辙，没有充分利用视频文件的各种特性。而且对帧平均、视频压缩等常见的运动图像攻击方法十分敏感。针对这些问题，本文以非压缩视频文件为实验对象，结合人类视觉模型和彩色图像场景分割的方法，提出并实现了一种基于视频时间轴的数字水印盲检测算法。实验结果表明算法有效实用。     

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

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

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…     

卷积码的线性系统

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

区域分割法辅助计算复杂图像面积

介绍计算具有复杂边缘轮廓的图像面积的区域分割法。采用鼠标多边形作图法近似圈定待处理的图像区域。本文由格林定理出发得到有限连续边界与其包围区域面积之间的函数关系,并且应用这一函数关系得出多边形与其包围区域面积的数学关系,近似得到图像区域面积。文中以烟幕图像为例对上述结论进行了验证。文章最后给出了在VC++环境下实现多边形分割的部分源代码。     

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.