directed edge sequence

directed edge sequence的基本解释

-

有向棱序列

与directed edge sequence相关的网络例句 [注：此内容来源于网络，仅供参考]

With the advancement of science and technology, some new theories and new ways emerged gradually, some of them merged with specific theoretical tools, this specific theoretical tools include mathematical morphology, fuzzy techniques, neural networks, wavelet and so on. Secondly, in this paper, it described and analyzed the segmentation method based on the edge in the domain of image segmentation in detail. It did experiments on several edge detection operators using MATLAB, it summarized the advantage and the shortcoming of traditional edge detection operators, and the operating environment. On the basis of the experimental analysis, it implemented an edge location more precise, more efficient operating speed edge extraction method——Template Vector. In this method, it optimized differential approximate calculation of first differential operators the paper mentioned. After experimented on this edge extraction method, contracted with the traditional methods, the edge outline is extracted more accurately and more exquisitely, furthermore, it retained the object outline furthest, and achieved more satisfied edge extraction result.

其次，对图像分割领域中常用的基于边缘的分割方法进行了详细的研究与分析，对各种边缘检测算子进行了MATLAB环境下的实验，分析总结了各种传统边缘检测算子的优缺点和适应环境，并针对传统边缘检测算子在处理显微图像时的缺陷，在实验分析的基础上研究并实现了一种边缘定位更加精确、运算速度更加快捷的边缘提取方法——模板向量算法，在该算法中，对文章提到的一阶微分算子中微分的近似计算作进一步优化，经过对该边缘提取方法进行实验，其结果与传统方法相比，轮廓提取更为精确细腻，且最大程度的保留了图像中物体(目标个体或者明显噪声点)的轮廓，得到了比较理想的边缘提取效果。

Given a ring and a set of communication requests. Each request is represented by a pair of nodes, and associated with a profit. To satisfy a request in the undirected ring, we need to determine a path between the two nodes of the request in the ring. To satisfy a request in the directed ring, we need to determine a directed path from the source to the destination of the request in the directed ring. The goal of the call admission control problem is to determine and satisfy a maximum profit subset of the requests such that for every edge of the ring, the number of satisfied requests that are routed through the edge does not exceed the capacity of the edge.

要在无向环中实现一个呼叫，需在环中指定该请求所对应的两个顶点之间的一条路，要在有向环中实现一个呼叫，需在环中指定该请求的源节点到目的节点的一条路，环网络呼叫接纳控制问题的目标是确定最大利润的呼叫子集，在环中实现该子集中的每一个呼叫，使得经过每一边的呼叫的数目不超过该边的容量，对于无向和有向环网络呼叫接纳控制问题，我们均首次给出了多项式时间近似方案。

To resolve directed cutset of Directed Assembly Connection Graph, an efficient algorithm for the enumeration of all directed cutsets of DACG was presented. This algorithm recursively enumerated a part of DACG directed segs which had one connected subgraph by using the theory of edge contraction.

为解决有向装配图有向割集的求解，给出一个生成有向装配连接图有向割集的高效算法，该算法优先考虑检查有向割集两个子图间边的方向。

与directed edge sequence相关的网络解释 [注：此内容来源于网络，仅供参考]

directed edge sequence：有向棱序列

directed distance 有向距离 | directed edge sequence 有向棱序列 | directed graph 有向图