针对因节点失效而产生的网络性能问题,提出了一种刻画节点有效性的算法TQL-WG(Traffic Queue Length based on Wavelet and Geom/Geom/1).该算法首先利用小波变换降低流量的长相关特性,并且基于Geom/Geom/1模型建立流量队长与节点有效...针对因节点失效而产生的网络性能问题,提出了一种刻画节点有效性的算法TQL-WG(Traffic Queue Length based on Wavelet and Geom/Geom/1).该算法首先利用小波变换降低流量的长相关特性,并且基于Geom/Geom/1模型建立流量队长与节点有效性的数学表达式.同时通过仿真实验对比研究了TQLWG算法与以往算法的优劣,并深入分析了有效性与各影响因素之间的关系,结果表明TQLWG更具有适应性.展开更多
This note shows that when studying geometric pro perties, a polynomial system is defined as a line field on a projective space such that its singular set has co dimension at least 2. By this definition, the concept ...This note shows that when studying geometric pro perties, a polynomial system is defined as a line field on a projective space such that its singular set has co dimension at least 2. By this definition, the concept of the degree of a polynomial system does not coincide with the usual one. The usual degenerate polynomial system of degree n+1 should be regarded as a system of degree n . Note that the definition is independent coordinate system. And, by this definition, some geometric properties concerning polynomial vector fields turn out to be evident.展开更多
文摘针对因节点失效而产生的网络性能问题,提出了一种刻画节点有效性的算法TQL-WG(Traffic Queue Length based on Wavelet and Geom/Geom/1).该算法首先利用小波变换降低流量的长相关特性,并且基于Geom/Geom/1模型建立流量队长与节点有效性的数学表达式.同时通过仿真实验对比研究了TQLWG算法与以往算法的优劣,并深入分析了有效性与各影响因素之间的关系,结果表明TQLWG更具有适应性.
文摘This note shows that when studying geometric pro perties, a polynomial system is defined as a line field on a projective space such that its singular set has co dimension at least 2. By this definition, the concept of the degree of a polynomial system does not coincide with the usual one. The usual degenerate polynomial system of degree n+1 should be regarded as a system of degree n . Note that the definition is independent coordinate system. And, by this definition, some geometric properties concerning polynomial vector fields turn out to be evident.
