层拓扑

词组短语

etale topology

与层拓扑相关的网络例句 [注：此内容来源于网络，仅供参考]

In the existing network's foundation, will gather slightly turning on to big gathering turning on reforming, the core backbone level does not make turning on principle, only makes the exchange, guaranteed that the IPv4/IPv6 network can simultaneously undertake IPv4 and the IPv6 exchange of information, guarantees its performance, reduces the promotion risk, the network analysis situs by original Shan Xing the analysis situs, changes the two stars analysis situs, the Integral part uses double turns over to turning on, guarantees the IPv4/IPv6 production network stably reliable.

在现有网络的基础上，将小汇聚接入向大汇聚接入转型，核心骨干层原则上不做接入，只做交换，确保 IPv4/IPv6网络能同时承担 IPv4和 IPv6信息交换，保证其性能，降低升级风险，网络拓扑由原来的单星拓扑，改为双星拓扑，重要部门采用双归接入，确保 IPv4/IPv6生产网稳定可靠。

In this paper, an algorithm based on backtrack which calculates the betweenness for simple un-weighted network with O run time complexity is proposed, after which the unique feature of Internet AS graph, i.e, edges between two ASes are associated with some kind of commercial relationships, is considered.

在进一步考虑Internet AS拓扑的特殊性，即任意两个相连的AS都具有某种商业关系的基础上提出了互联网AS层拓扑的Betweenness计算方法。

Firstly, time synchronization packet, produced by the root node, is transmitted along two-layer topology from the father node to child node. Secondly, the dominated nodes adjust their local time according to their received packet, and at the same time update the time of packet, then send it to next node.

首先，通过根节点发送时间同步报文，沿二层拓扑结构从父节点到子节点传递时间同步报文；其次，支配节点根据同步报文到达时刻调整本地时间，更新并发送同步报文；最后，非支配节点根据同步报文到达时刻调整本地时间。

This method combined the traceroute result with the topology information obtained by tomography to construct a final topology using minimum similarity cluster algorithm and merging and constructing anonymous routers algorithm.

该方法可通过提出的最小相似度聚类算法和匿名节点构造归并算法，将网络层析成像获得的拓扑信息与traceroute探测结果融合，构成最终的拓扑结构。

This method combined the traceroute result with the topology information obtained by tomography to construct a final topology using minimum similarity cluster algorithm and merging and constructing anonymous routers algorithm.the simulation on ns2 shows that this method not only be able to infer the network topology which contains uncooperative routers, but also enormously reduce the number of probes.

该方法可通过提出的最小相似度聚类算法和匿名节点构造归并算法，将网络层析成像获得的拓扑信息与traceroute探测结果融合，构成最终的拓扑结构。ns2的仿真表明，该方法不仅可识别包含不协作节点的网络拓扑，且所使用的探测包的数量也大大减少。

Merging logical topologies is a solution of network topology identification in network tomography technology.

网络拓扑合并是解决网络层析成像技术中大规模网络拓扑判定问题的重要研究方向。

Some people introduce subphotosphere magnetic charges or dipole, which can fit magnetic field on the photosphere, then the separatrix and separator above and on the photosphere can be located, the comparison between their location and location of flare ribbon support the idea of magnetic reconnection. It is called Source Method. Some people extrapolate magnetic fields of photosphere to corona by some method, then use QSLs method to investigate the relations between flare ribbons and magnetic field topology. Some people study relations between flare ribbons and singular point on the plane above photosphere. Some people investigate magnetic topology by analyzing magnetic field of photosphere directly.

或者以观测的光球磁场为基础，来构造光球下的磁荷或磁偶极等光球下磁源，进而研究光球上的磁拓扑结构与耀斑的关系；或者利用各种外推方法将光球磁场进行外推，然后用准分隔层的方法来研究磁拓扑结构与耀斑的关系；或者利用势场模型外推光球磁场，然后研究光球之上平行于光球的某一平面的两维奇点与耀斑的关系；或者直接利用观测的光球矢量场来研究磁场拓扑。

So,the massive data acquired in the period from January to December in 2006 and authorized by CAIDA Skitter project were used to analyze the searched topological data at CAIDA(cooperative association for Internet data analysis) router level,thus describing the characteristics of the distribution of the degree s of nodes at router level.

针对目前对路由层面的Internet拓扑研究较少的问题，基于2006年1月至2006年12月采集的CAIDA Skitter项目授权的海量数据，对CAIDA路由层面拓扑探测数据进行了分析，描述了路由级节点度分布的幂率性。在此基础上计算出了更能体现网络拓扑层次性的各节点的核数，描述了节点核的幂率分布性质，进一步分析了节点核数与度之间的关系。研究表明，对低核节点，其度分布存在着幂率性质

Composite layer topology expands the sense of space-time composition to spatial topology, and proves that the static spatial topology representation capability of composite layer topology is as strong as that of static layer topology.

复合图层拓扑扩展了时空复合对空间拓扑的意义，并证明复合图层拓扑的静态空间拓扑表达能力和静态图层拓扑一样强。

In order to solve the accumulation of synchronization error over hop distance in large scale wireless sensor networks, A new time synchronization algorithm has been proposed based on two-layer topology.

为了解决大规模无线传感器网络中同步误差随跳距的累积问题，提出一种基于二层拓扑结构的时间同步算法。

与层拓扑相关的网络解释 [注：此内容来源于网络，仅供参考]

coherent stack：凝聚层

coherent sheaf 凝聚层 | coherent stack 凝聚层 | coherent topology 凝聚拓扑

coherent topology：凝聚拓扑

coherent stack 凝聚层 | coherent topology 凝聚拓扑 | coherently oriented simplex 协同定向单形

etale space：层空间

etale neighborhood 层邻域 | etale space 层空间 | etale topology 层拓扑

etale topology：层拓扑

etale space 层空间 | etale topology 层拓扑 | etalon 标准

final topology：终拓扑

final state 终态 | final topology 终拓扑 | fine sheaf 强层

fine sheaf：强层

final topology 终拓扑 | fine sheaf 强层 | fine topology 细拓扑

fine topology：细拓扑

fine sheaf 强层 | fine topology 细拓扑 | fineness 细度

presheaf：预层

一个预层(presheaf)和一个层相似,但它可能不可以粘起来. 事实上,层使得我们可以用一种细致的方式讨论什么是局部性质,就像应用在函数上的层. 假设X为一个拓扑空间,而C是一个范畴(这经常是集合的范畴,交换群的范畴,交换环的范畴,

bus topology：总线拓扑结构

余校验( C R C )是一种错误检测方法,为帧中包含的整个信息域( S O F,寻址方法,控制信息,一层中的信息是通过称为原语( p r i m i t i v e )的命令来转换到下一总线拓扑结构(bus topology)由从一台P C或文件服务器连向另一台的电缆组成,

trail：路径

需要指出ASTN/ASON和其他传送网一样可支持多客户层-服务器层关系,服务器层仅仅是通过提供其路径(Trail)来支持客户层链路(Link),客户层是看不到服务器层的拓扑信息的,但这并不妨碍上层甚至端用户对带宽提出要求直至控制配置.