一种分布式的洋葱路由新机制

洋葱路由技术在公网上提供双向、实时的匿名通信，其面向连接和严格的源路由方式导致效率低、扩展性差。利用分布式的概念，采用分段连接技术思想提出了一种安全、高效的分布式洋葱路由机制(DORS)，给出了DORS路由实现算法，并从方案实现效率、安全性方面对DORS进行了分析。分析结果表明DORS具有良好的扩展性、鲁棒性、简单性和有效性。     

基于非锐化掩模的实时自适应图像增强算法

针对传统的非锐化掩模算法的局限性,依据图像中各像素点及以其为中心的若干相邻像素点的均方差值,提出了自适应图像增强算法的原理,并分析其硬件实现方法,然后给出了该算法与其它算法应用于图像增强的对比结果,最后在FPGA（field programmable gate array）实验板上进行验证.实验结果表明,此算法有效的增强图像的细节区域,防止图像边缘区域出现过冲现象,抑制图像平坦区域的噪声放大.因此,该算法取得了良好的视觉效果,硬件实现简单,适合于实时条件下图像的增强.     

Determination of the Coordinates of the Center of a Gaussian Beam by Means of a Matrix Photodetector Using a Weighting Method

A weighting algorithm to determine the coordinates of the center of a Gaussian laser beam projected onto a matrix photodetector is considered. The influence of the internal noise of the photodetector, the maximum brightness of the signal at the beam maximum, and the beam radius on the precision of the algorithm is investigated. Recommendations on image processing are presented.     

基于关键节点和多播节点的多播路由算法

在视频会议等多播应用中，降低多播树网络费用非常重要。本文提出了基于关键节点和目的节点的多播路由KDDMC算法。由于在算法中优先考虑采用关键节点，实现更多链路的共享，从而降低网络费用。在随机网络上的仿真结果表明，KDDMC算法的多播树网络费用优于SPH算法。同时证明了KDDMC算法的复杂度为O(n^3)，且利用所提出的路由表算法易于分布式实现。     

多粒度全光网中的多层联合路由

多粒度交换技术利用波带级路由以及光纤级路由,可有效降低光交叉连接器的复杂度.但多粒度交换增加了光网络的逻辑层次结构,使得网络中的路由与资源分配问题更为复杂,因此,在多粒度全光网中实现多层联合路由是提高网络性能的关键.本文对多粒度交叉连接结构进行了分析,并对多粒度全光网中的多层联合路由问题进行了研究.     

数据挖掘技术在有线电视领域的应用

数据挖掘是近年来在数据库技术、统计学、人工智能、神经网络等学科的基础上发展起来的一门交叉学科，数据挖掘技术已经成功地应用于商业领域，随之又迅速地扩展到社会保险、医学、电信等领域，探讨和分析数据挖掘技术在有线电视领域的应用，并给出了系统体系结构和挖掘算法。     

The Role of Network Topologies in the Optical Core of IP-over-WDM Networks with Static Wavelength Routing

In this paper, we present a performance analysis of network topologies for the optical core of IP-over-WDM networks with static wavelength routing. The performance analysis is focused on regular degree four topologies, and, for comparison purposes, degree three topologies are also considered. It is shown that the increase of the nodal degree from three (degree three topology with smallest diameter) to four (degree four topology with smallest diameter) improves the network performance if a larger number of wavelengths per link is available. However, the influence of wavelength interchange on the nodal degree gain is small. The performance of regular degree four topologies with smallest diameter is also compared with the performance of mesh–torus topologies (which are also degree four topologies), and it is shown that the blocking probability of degree four topologies with smallest diameter is about two orders of magnitude lower than the blocking probability of mesh–torus topologies. It is also presented a performance comparison of WDM-based networks with nodal degrees ranging from two to five and it is shown that the increase of the nodal degree from two to three leads to high nodal degree gains, while de increase of the nodal degree from four to five leads to low nodal degree gains. These results show that degree three and degree four topologies are very attractive for use in the optical core of IP-over-WDM networks.     

采用多级技术的DBF雷达CCAB算法

数字波束形成算法中,CCAB算法在较高信干噪比条件下具有一定优势。但是计算时需要求逆矩阵,在阵元数较多的情形下运算量极大,很难实时实现,严重制约了其进一步的应用。提出了一种基于原有CCAB算法的多级计算方法,可以有效地减少运算量。实验表明,该方法虽然其信噪比性能比普通CCAB算法有所下降,但是仍能在干扰方向上形成较深的零陷并有效地抑制干扰,能够进一步应用于实际工程中。     

腐蚀算法在重建一类特殊管道中的应用

针对一类特殊而不能直接对其观察的管道（如动物的血管），为了准确了解其内部特征和形态，借助计算机给出了一种用腐蚀算法来重建管道原形的方法。这种方法简单易行，而且精确度高。     

Data fitting with a spline using a real-coded genetic algorithm

To obtain a good approximation for data fitting with a spline, frequently we have to deal with knots as variables. The problem to be solved then becomes a continuous nonlinear and multivariate optimization problem with many local optima. Therefore, it is difficult to obtain the global optimum. In this paper, we propose a method for solving this problem by using a real-coded genetic algorithm. Our method can treat not only data with a smooth underlying function, but also data with an underlying function having discontinuous points and/or cusps. We search for the best model among candidate models by using the Bayes Information Criterion (BIC). With this, we can appropriately determine the number and locations of knots automatically and simultaneously. Five examples of data fitting are given to show the performance of our method.