传送算法

In this dissertation, we consider following problems: priority-based wavelength assignment algorithm in restorable WDM transport networks, design of resilient WDM mesh networks, design protection for WDM networks without and with considering wavelength continuity constraint, efficient placement of wavelength converters.WDM Network will play important role in future backbone networks.

本文主要研究和WDM光传送网生存性有关的问题，主要集中在以下几个方面：抗毁WDM网络中的基于优先级的波长分配算法，网状WDM网络的抗毁设计，不考虑波长连续性限制时WDM网络的保护设计，以及考虑波长连续性限制时WDM网络的保护设计和波长转换器的合理放置。

Aiming at solving these problems, this paper proposed a parallel algorithm with multi-transmitting redistributed data.

针对这些问题，提出了一种多次传送重新分配数据的并行算法。

DSPR (Dynamic Scanlines Post-Reallocation) algorithm changes the boundary of block assigned to each Transputer after each operation, so that the total number of strips needed to travel around the network can be decreased, and then decrease the cost of communication.

DSPR后动态扫描线分配算法的出法点是运算后根据运算参数动态地改变分配给处理单元的显示区域的边界，这样就可以减少需要传送的不属于自己区域内的条码数量，进而减少运算后的通信开销。

Maximum likelihood detector is the optimal detector and has the best performance. The challenge of MLD is the high computational complexity. K-Best decoding algorithm has been proposed to reduce the computational complexity. K-Best decoder algorithm computes Partial Euclidean Distance and only keeps the best K nodes that have the smallest accumulated PEDs. After completing breadth-first tree search, we will have K leaves with the smallest PEDs.

最大相似度侦测法是公认最佳化的演算法，有著最好的侦测效能，但运算复杂度将会随著调变群集和传送天线数目大小而呈指数型增加。K-Best球型解码演算法因而被提出来，得到近似最大相似度侦测法的结果，解决最大相似度侦测法运算复杂度过高的问题。K-Best球型解码演算法在计算完部份欧几里德距离后，需要取最小K个值做为候选点，再往下层去找候选点。

Do you know, i need you to come back

你知道吗，我需要你回来

Yang yinshu、Wang xiangsheng、Li decang,The first discovery of haemaphysalis conicinna.

1〕 杨银书，王祥生，李德昌。安徽省首次发现嗜群血蜱。