1) weak open covering
弱开覆盖
2) multi-path coverage
弱多径覆盖
3) weak vertex cover
弱顶点覆盖
1.
Considering the equation of flow conservation, the problem of efficient monitoring is regarded as the problem of finding out the minimum weak vertex cover set and the minimum weak vertex cover set based on flow partition for a given graph G(V,E) which are all proved NP-Complete.
考虑网络节点的流守恒特性,网络流量的有效监测问题可抽象为求给定图G(V,E)的最小弱顶点覆盖集的问题和基于流划分的最小弱顶点覆盖集的问题,这是NP难的问题。
2.
A distributed algorithm for finding the weak vertex cover of a graph is presented in this paper,which can be used for monitor-nodes selection in net traffic measurement.
提出了一种分布式求解弱顶点覆盖集的近似算法,用于网络流量有效测量点的选择。
3.
In this paper, the problem of efficient monitoring for the network flow is regarded as the problem to find out the minimum weak vertex cover set for a given graph G=(V,E).
把网络流量的有效测量问题抽象为求给定图G=(V,E)的最小弱顶点覆盖集的问题。
4) (Weakly) covering congruence
(弱)覆盖同余
5) open cover
开覆盖
1.
A space is shrinking if and only if it is normal and there is a σ closed rifinement for its any increasing open cover.
拓扑空间的仿紧性质是拓扑空间的重要性质 ,为了讨论拓扑空间的仿紧性质以及仿紧性质的各种推广 ,讨论了拓扑空间的强收缩性质 ,得了如下结果 :拓扑空间是强收缩的充要条件是它是正规的且对它的任一单增开覆盖存在 σ-闭加细 。
2.
If for any increasing open cover of a topology space there is a countable sub cover of it and it is countable meta compactness,it has Lindel o ¨f property.
如果对拓扑空间的任意单增开覆盖 ,都存在可数子覆盖 ,且是可数亚紧的 ,则是 Lindelo¨f的 。
3.
The definitions of pointwise preimage entropies,preimage branch entropy,and preimage relation entropy for nonautonomous discrete dynamical systems given by a sequence of continuous selfmaps of a compact space are given by using open covers.
对紧致拓扑空间上的连续自映射序列应用开覆盖定义了点原像熵、原像分枝熵以及原像关系熵等几类原像熵。
6) strong open covering
强开覆盖
1.
The concept of strong open covering is used to introduce the m compactness in fuzzy topological space.
在模糊拓扑空间中利用强开覆盖的概念引进一个称作 m-紧的紧性定义 ,并研究了它与模糊网的 m-收敛之间的关系 。
补充资料：弱弱联合
弱弱联合是指两个总体实力都不强但都拥有自己独特的某方面优势的企业之间进行联合，以形成较强的实力。弱弱联合，弱企业之间优势互补，可以形成整体实力变强的效应。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条