查询词典 partition
- 与 partition 相关的网络例句 [注:此内容来源于网络,仅供参考]
-
The partition data structures are laid out in consecutive sectors, and each map entry has a value for the total number of partitions.
分区数据结构分布在连续的扇区,且每条记录都有一个分区总数的值。
-
The design of the partition system in an Apple system is a nice balance between the complexity of DOS-based partitions and the limited number of partitions that we will see in the BSD disk labels.
苹果系统的分区设计是在基于DOS分区的复杂性和我们会在BSD硬盘标签里看到的有限的分区编号之间的一个完美的平衡。
-
Xie-Beni index decreases with the number of partitions increasing. It is difficult to choose the optimal partition of data when the number of clusters is large. From the point of view of the compactness and the separation of clustering, a novel clustering validity function is proposed, which is based on the improved Huber Г statistic combined with the separation of clustering.
针对此问题,分别考察改进的Hubert Г统计量和聚类分离度,导出一个新的基于数据几何结构的聚类有效性函数,使得它有惟一的最大值,函数值随聚类个数增大而递减的趋势并不影响最优聚类个数的判定。
-
The algorithm combines the simulated annealing algorithm with the ratio-cut idea to ascertain the level of the multi-level multi-way partitioning and considers the number of cut lines while partitions CLB into cluster, then performs a k-way optimization without changing the level, so as to achieve a better partition result and improve the usage in HFPGA, then optimize the FPGA performance.
该算法将模拟退火算法与ratio-cut思想结合,确定多层多划分的规模后,在不影响规模的情况下进行多分优化,实现更好的划分结果,从而提高FPGA芯片的利用率,进而优化整个芯片的性能。
-
Partition search follows this strategy: construct a data structure for quick search and location, and divide the (K-1)th frequency itemset sequence into a number of continuous partitions to obtain a number of disjoint sub-sets of (K-1)th order frequency itemset.
分区查找基于以下策略:建立一种可快速搜索定位的数据结构,将频繁(K-1)-项集序列划分为若干连续的分区,形成(K-1)阶频繁项目集的若干不相交的子集。
-
The algorithm combines the simulated annealing algorithm with ratio-cut method to ascertain the level of the multi-level multi-way partitioning. Considering the number of cut lines while partitions CLB into cluster, it achieves a better partition result and improve the usage in HFPGA, then optimize the FPGA performance.
该算法将模拟退火算法与ratio-cut思想结合,确定多层多划分的规模后,采用数据结构进行多分优化,在将可配置逻辑块(configurable logic block, CLB)划分到各个簇的时候考虑割线数的目标函数,实现了更好的划分结果,提高了FPGA芯片的利用率,优化了整个芯片的性能。
-
Can at this time by pressing the Ctrl key and the numeric keypad on the plus sign to automatically adjust the width of all the best out, double-click between two columns of the partition line can automatically adjust the column width of two columns.
此时可以通过按Ctrl键和数字键盘上的加号来自动调整所有列的最佳宽度,双击两栏之间的分割线可以自动调整两栏的列宽。
-
This clustering algorithm can on-line partition the input data, pointwise update the clusters, and self-organize the fuzzy neural structure.
此聚类算法可以在线地划分输入数据,逐点地更新聚类,自己组织模糊神经网络的结构。
-
Based on the idea of mapping the loops onto the reconfigurable array can improve the performance, the paper proposes a heuristic hardware-software partition algorithm which partitions the big loop into two parts: one is in the processor and another in the array. The objective of the algorithm is to minimize the communication of the two parts.
针对较大循环在可重构处理器上的映射问题提出了一种启发式的算法,将循环划分为在处理器上执行的软件部分和在可重构阵列上执行的硬件部分,并且使两者之间的数据传输量最小。
-
Attempt to use a file handle to an open disk partition for an operation other than raw disk I/O.
试图使用操作的已打开磁盘分区的文件句柄。
- 相关中文对照歌词
- Partition (Remix)
- Yoncé / Partition
- My Head Is Full Of Ghosts
- Lay It Down
- War
- Cingularity Point
- Y'all Don't Wanna
- Natural High
- King Kong
- Lonely Lisa
- 推荐网络例句
-
The dissecting of samples in group2 were difficult. The root of pulmonary artery and ascending aorta failed to be unfolded because fibrous tissue was tough, right and left fibrous trigone were too firm to be solved by hand. Cardiac muscle fibers couldn't be stripped along myofibrillar trajectory since they were prone to break because of their friability.
组2的心脏解剖困难,表现为纤维组织坚韧,游离肺动脉非常困难;徒手无法松解左、右纤维三角,肺动脉和主动脉根部的游离非常困难;心肌纤维坚硬、质脆,解剖时容易断离成碎块,无法沿纤维走行方向剥离。
-
We have battled against the odds in a province that has become increasingly violent.
我们对在一个争夺日益激烈省的可能性。
-
MILAN - The team has left for the States at 10.15am CET from Terminal 1, Milan Malpensa airport. The Rossoneri will land in New York at 12.50am local time (6.50pm CET), after a nine-hour flight.
米兰—球队在上午10:15从米兰马尔朋萨机场第一登机口登机,出发前往美国,预计于纽约时间上午12:50降落(意大利时间下午6:50),飞行时间大约9个小时。