scan length

scan length的基本解释

-

扫描长度

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

System.out.println("a.length="+ a.length); System.out.println("b.length ="+ b.length);// The handles inside the array are // automatically initialized to null: for(int i = 0; i nbsp;b.length; i++) System.out.println; System.out.println("c.length ="+ c.length); System.out.println("d.length ="+ d.length); a = d; System.out.println("a.length ="+ a.length);// Java 1.1 initialization syntax: a = new Weeble { new Weeble, new Weeble }; System.out.println("a.length ="+ a.length);// Arrays of primitives: int e;// Null handle int f = new int[5]; int g = new int[4]; for(int i = 0; i nbsp;g.length; i++) g = i*i; int h ={ 11, 47, 93 };// Compile error: variable e not initialized://!

句柄。此时，编译器会禁止我们对这个句柄作任何实际操作，除非已正确地初始化了它。数组b被初始化成指向由Weeble句柄构成的一个数组，但那个数组里实际并未放置任何Weeble对象。然而，我们仍然可以查询那个数组的大小，因为b指向的是一个合法对象。这也为我们带来了一个难题：不可知道那个数组里实际包含了多少个元素，因为length只告诉我们可将多少元素置入那个数组。换言之，我们只知道数组对象的大小或容量，不知其实际容纳了多少个元素。尽管如此，由于数组对象在创建之初会自动初始化成null，所以可检查它是否为null，判断一个特定的数组&空位&是否容纳一个对象。类似地，由基本数据类型构成的数组会自动初始化成零、null或者false。

Time is always used as the most important parameter in the current network security visualization techniques on port scan.This makes the slow scan, the dynamic or random scan, concealed scan and spoofed scan hard to detect, and the detection results of the related security anomalies such as DDoS, worms, Trojans etc are bad too. Therefore, a novel network security visualization method for slow scan, concealed scan etc is proposed in this paper.

目前基于端口扫描的网络安全可视化技术常常以时间作为最重要参数指标，往往只能检测那些较快速地扫描行为，对强动态性、强随机性和强隐蔽性的与端口有关的安全事件如DDoS、蠕虫病毒、木马等效果并不好。

Considering the specialty of pseudo-random vector, a partial scan algorithm for BIST, which unifying the structure analysis and testability analysis, is presented in this paper. Then, the fault simulation experiments on ISCAS89 benchmark circuits by this algorithm is made, and the results, which made by the full scan algorithm and the partial scan algorithm only based on the structure analysis, is compared. The conclusion is achieved: for pseudo-random vector, compared with the full scan circuit and the circuit geted by partial scan algorithm only based on the structure analysis, the circuit geted by our partial scan algorithm can greatly reduce the test time with very close or even greater faults coverage and less area than the full scan.

考虑到伪随机测试向量的特殊性，本文借鉴确定性测试向量生成的部分扫描算法，在内建自测试环境中，提出一种综合结构分析和可测性分析的部分扫描算法，PSBAST，并运用此算法对ISCAS89 benchmark电路进行计算，并对经计算后得到的部分扫描电路进行故障模拟，最后将模拟结果与全扫描电路和一种仅考虑结构因素的部分扫描算法得到的结果进行详细分析和比较，结果表明：对于伪随机测试向量，相对于全扫描电路和由仅考虑结构因素的部分扫描算法得到的电路，本文提出的部分扫描算法得到的电路，能够在不低于全扫描结构故障覆盖率前提下，大幅度减少测试时间，并能降低测试面积开销。

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

scan length：扫瞄长度

"扫瞄工作","scan job" | "扫瞄长度","scan length" | "扫瞄限量","scan limit"

scan length：扫描长度

scan interlace ratio 扫描隔行比 | scan length 扫描长度 | scan limit 扫描界限