报告的表扫描次数表示在下午 1点到 2点之间在这个表上执行的扫描。
The number of table scans reported represents the scans on the table between 1:00 p.m. and 2:00 p.m.
避免了再次扫描冲突，从而大大减少了扫描次数，提高了扫描效率。
Therefore, the invention avoids re-scanning conflict, thereby greatly reducing the number of scanning, and improving the efficiency of scanning.
在扫描次数一定的情况下，存在一个最优的累积线能量使弯曲角达到最大；
Under the constant bending times, the biggest bending angle can be obtained with an optimal accumulative line energy value.
用建立的模型分析了多次扫描过程中随扫描次数增加弯曲增量逐渐减小的原因。
The reasons that the bending angle decrease with the number of irradiation are analyzed by using the built model.
这种基于编码通道合并的优化算法，一方面可以减少编码扫描次数，提高编码速度；
The improved algorithm based on the coding pass combination has some advantages as follows: on the one hand, it can speed up coding through reducing scanning times;
在纳米梁电学测试中，反复扫描电流产生的热会减小梁上张应力，从而使电阻随扫描次数增大。
The scan electric current decrease the tensile stress in the nano-beams, so the electric resistance increase with the scan electric current times.
通过实验，确定KNO3为较好的电聚合介质，以及较好的扫描速率、扫描次数、扫描电压范围。
Through experiment, KNO3 is thought a better electro-polymer medium, Moreover. the good parameters of scanning number. Scanning rate and scanning voltage range were determined.
该算法通过分组及时舍弃挖掘过程中生成的非频繁项目集，有效降低主存压力，减少对数据库的扫描次数，能够对时变数据库进行高效地关联规则挖掘。
The stress of main memory is abated, the times of scan of database are cut down, and the algorithm executes more efficient mining of association rules in time-variant database.
full_scans文件表明已经执行的全区域扫描的次数。
The full_scans file indicates the number of full area scans that have been performed.
未通过任何标记完成病毒扫描检查的次数。
The number of times virus scan checks were not satisfied by any stamp.
这避免了后剪枝策略所需的高昂代价，减少了扫描磁盘数据的次数和大量的CPU时间，进一步提高了算法的效率。
This avoid high cost by using post-pruning measure which require many times for scanning disk data and amount of CPU time. So we gain a high efficiency.
指定重复次数，扫描代码，扩展键标志，上下文代码，前期的键状态标志，转换状态标志。
Specifies the repeat count, scan code, extended-key flag, context code, previous key-state flag, and transition-state flag.
传统的挖掘频繁项集的并行算法存在数据偏移、通信量大、同步次数较多和扫描数据库次数较多等问题。
There were problems in traditional parallel algorithms for mining frequent itemsets more or less: data deviation, large scale communication, frequent synchronization and scanning database.
研究表明，该方法不仅算法简单、只需扫描一次数据库，而且还具有动态剪枝、不保存中间候选项和节省大量内存空间等优点。
Studies show that the method is not only simple that needs to scan the database only once, but also has the virtues such as dynamic pruning, without saving mid items and save lots of memories.
用GMK算法只需要扫描一次数据库，并且可以快速减小计算量，实现简单。
GMK only scans the database once, thus it can reduce the quantity of calculation rapidly and can be realized easily.
通过主实例标记完成病毒扫描检查的次数。
The number of times virus scan checks were satisfied by instance stamp.
新算法通过使用旋转数据库和位运算减少了扫描原始数据库的次数，加快了挖掘速度。
The new algorithm reduces the number of scanning the original database through using rotary database and bit operations, and accelerates the speed of data mining.
数据流频繁项挖掘算法需要利用有限的内存，以尽量少的次数扫描数据流就能得到频繁项。
Frequent item mining algorithms need to perform as little data stream scanning as possible while using limited size of memory.
数据流频繁项挖掘算法需要利用有限的内存，以尽量少的次数扫描数据流就能得到频繁项。
Frequent item mining algorithms need to perform as little data stream scanning as possible while using limited size of memory.
应用推荐