查询词典 connecting path

You can trace the outlines of such patterns, you know how to move your head to get a better view, and you know when you have moved it too far to see the whole keyboard. You can obscure any feature of the keyboard by holding your finger at an appropriate location between it and your eye. And instead of describing the relation between the Intel logo and the 'P' key, you can use your finger to trace a connecting path.

你能循迹这样的样式，知道如何移动你的头获得更好的视角，你知道当你移动足够员能够看到全部键盘的时候，你能在它和你的眼睛之间，用手指分不清任何键盘的特征，取代在'图标'和'P键'之间关系的描述，你能用你的手指循迹一个相关路径。

Comment: A graph is CONNECTED if there is a path connecting every two vertices.

说明：如果任意两个顶点之间都存在路径相连，那么称这个图为"连接图"

The node-neighboring protection cycles are connected by the connecting path which doesn′t pass through the common nodes of the neighboring cycles in order to avoid loop.

多播树的所有链路都包含在不同的保护环中，点相邻的保护环通过不经过公共点的接通路径相连。

Based on the theory of system controllability, the path connecting the system initial state with the desired state is planned, and the satellite attitude and joint angle can be controlled at the same time only using the manipulator joint motion.

基于系统能控性理论，规划连接系统初始状态和期望状态的路径，实现了仅通过机械臂关节的运动同时控制基座姿态和机械臂关节角的目的。

In Graph Theory,we shall also be interested in connected graphs in which there is only one path connecting each pair of vertices;such graphs are called trees（generalizing the idea of a family tree）.

在图论中，人们还对树感兴趣，树是每一对顶点间只有一条路的连通图。

The intermediate water path are connecting with weft throwing nozzles.

供水水路的流出口可借助滑动体的上下移动将一对中间水路及一对中间排水水路连接。

Such transactions frequently traverse a path connecting primary care providers, specialists, payors, government agencies, hospitals, labs, and other healthcare entities.

这种事务经常在初级保健单位，专家，付款者，政府机构，医院，实验室及其它医疗单位之间建立联系。

DMCA constructed a MCDS for Ad hoc networks based on a maximal independent set. In DMCA, each node only required the knowledge of its one-hop neighbors and there existed only one shortest path connecting two dominators these were at most three hops away.

DMCA基于最大独立集的构建，只需要周围一跳邻居的信息，在不超过三跳距离的一对支配节点之间找出一条最短路径。

For the np-hard problem of constructing minimum connected dominating set in ad hoc networks, this paper proposed a novel distributed mcds constructing algorithm called dmca. dmca constructed a mcds for ad hoc networks based on a maximal independent set. in dmca, each node only required the knowledge of its one-hop neighbors and there existed only one shortest path connecting two dominators these were at most three hops away.

摘 要：针对无线自组织分组网络中最小连通支配集创建np难问题，提出了一种分布式的最小连通集创建算法dmca.dmca基于最大独立集的构建，只需要周围一跳邻居的信息，在不超过三跳距离的一对支配节点之间找出一条最短路径。

Some innovative approaches were presented to resolve the problem existing in the first generation of boost compressor by increasing the flow area of fluidics nozzle to decrease pressure drop and erosion attack, adding a new flow path in order to improve boosting effect of the second piston bore, connecting a bypass valve in parallel with throttle valve to set a partial flow and regulate pressure drop.

针对第一代样机存在的问题，提出了改进措施：①增加射流元件喷嘴过流面积来降低压耗和冲蚀破坏；②在射流元件输出道与二级活塞缸之间增加新流道，提高二级活塞缸增压效果；③在节流阀位置并联旁通阀进行分流稳压。

It was just a normal day of school

那只是上学的普通一天

Which is a very good reference in this issue.

这是一个在这个问题上很好的参考。