其次，针对扫描图像可能产生倾斜，论文采用了一种基于有向单连通链的表单倾斜检测与校正算法对倾斜图像进行校正。
Secondly, owing to the form image skew, a skew detection and correction based on the directional single-connected chain is adopted.
在分析跟踪文件中的调用链时，会构建一个连通矩阵，用来表示哪个函数调用了其他哪些函数。
As the call chain is parsed from the trace file, a connectivity matrix is built that identifies which functions call which other functions.
复合结构图：复合结构图探索了在通信链路上协作的连通实例的运行时实例。
Composite structure diagram: a composite structure diagram explores runtime instances of interconnected instances collaborating over communication links.
要验证端口1是激活的，并且链路是连通的。
网络模型：地物被抽象为链，节点等对象，同时要注意其连通关系。
Network model: geographical objects have been abstracted by chain and node etc. , pay attention to the connective relationship among them.
任一对节点之间链路连通性的分析对提前预测网络拓扑变化起着关键作用。
The analysis of link connectivity of a pair of nodes is the key to the prediction of topology change in advance.
路由决策需要动态获取链路连通统计特性以获取传输可靠性。
Link connectivity statistics should be captured dynamically, and be exploited by routing decisions to achieve reliability.
将K -终端剩余连通可靠度的概念推广到链路存在失效状态的网络模型上，并提出了计算该可靠度的基于RVR的蒙特卡洛方法。
The concept of K-terminal residual connectedness reliability is extended to the network with link failures and a Monte Carlo method based on RVR is proposed to estimate it.
根据网络通信模拟器的要求和工作原理，提出了用开关矩阵函数模拟网络的连通关系以及在相关链路上模拟信道误码的新方法。
Based on the principle and requirements of the NCS, a new scheme that USES the on off matrix function to represent the network topology and bit error rate of each link is presented.
本文提出一种算法实现单连通区域的线性四元树表示转换成区域边界的4 -方向链码描述。
An algorithm is presented for converting the linear quadtree representation of a simply connected region into a 4-direction chain code description of the region's boundary.
最终实现高速数字图像传输系统下行链路在无线环境中连通。
At last realize all the down-link of the high speed digital audio transmission system.
利用节点连通度信息和节点邻居链路的带宽信息，把网络划分为簇结构。
According to the connectivity degree and neighbour link bandwidth of node, this protocol divides the networks into clusters.
在信道分配计算阶段按优先级确保瓶颈链路的带宽需求，实现网络信道干扰最小； 在信道分配切换阶段逐层实现切换，确保网络的连通。
In the channel calculation phase, the bottle-neck links' bandwidth was ensured by its higher priority so as to minimize interference among nodes.
在信道分配计算阶段按优先级确保瓶颈链路的带宽需求，实现网络信道干扰最小； 在信道分配切换阶段逐层实现切换，确保网络的连通。
In the channel calculation phase, the bottle-neck links' bandwidth was ensured by its higher priority so as to minimize interference among nodes.
应用推荐