片语

bit-string encoding位串编码

bit t string operator位串操

bit string operation位串操作

bit t string位串

bit-string error翻译

bit-string operators位串操作符

configuration bit string配置位串

bit t string operation位串操作

英汉例句

• bit string of mutation and crossover were employed in the operation.

  采用位串的交叉和变异方法，较好地解决了算法的早熟问题。

• the bit string array is very suitable for compressing, coding and storing. it may save the storage of the memory efficiently.

  它非常适合于压缩编码存储，可以有效得减少存储空间。

• it scans transaction database d twice and creates the bit string array constructed by 「0」 and 「1」.

  通过两次扫描事务数据库d，生成完全由「0」、「1」构成的位串数组。

• pdcp pdu is a bit string that is byte aligned (i. e. multiple of 8 bits) in length.

  一个pdcppdu是由字节（8比特组成）队列表示长度的位串。

• genetic algorithm uses linear bit string as chromosome code, and solves ordinary problems.

  遗传算法采用线性编码、求解普通的优化问题。

• suppose you want to encode the bit string 「1110011.」

  假设您要对一个比特串「1110011」进行编码。

• it then passes on the bit string to the gettagandlengthbytes() method, which will return the complete asn.1 byte array representation of the kdc-options field.

  然后它将位字符串传递给 gettagandlengthbytes()方法，这个方法返回kdc-options字段的完整asn.1字节数组表达。

• all we store is the start position of the 1s, then the start position of the 0s, then the position of 1s again, and so on until the bit string is over.

  我们存储的是，开始出现 1的位置，开始出现0的位置，然后再是出现1的位置，如此重复直到比特串结束。

• based on the association rule mining algorithm with bit string array, a fast algorithm for mining maximum frequent itemsets with bit string array(bsa-mfia) is proposed.

  在基于位串数组的数据挖掘算法的基础上，进一步提出了一种快速的基于位串数组的最大频繁项目集挖掘算法（bsamfia）。

• in addition, we add a bit string to each node in the tree to store the prefix of the items. by using the structure we can avoid repeatedly traversing the sub-tree while expanding the patterns.

  除此之外，算法对频繁模式树中每个节点增加一个位串来存储该项目的前缀项目，以避免在模式扩展的时候频繁的遍历子树。

• cluster state of the program is used as a quantum channel, and each group of quantum bit string signed by alice was distributed to alice, notaries ta, and inspection signer bob.

  本方案中用cluster态作为量子信道，每一组量子比特串分别分发给消息拥有和签名者alice，公证人ta，验签名者bob。