查询词典 hash

This invention relates to a structuring method for a multi-allotter front end system of a cluster server characterizing in including the following steps: setting up more than two front end allotters matched with two net cards, a cluster server front end system of a collecting tray, the data input end net cards of the front allotter are cascade via the collecting tray, the data output end net cards of all front allotters are connected with the switching device of the cluster server back end system, the data input end net cards are matched with a same virtual IP, all input data packets are transmitted to all front end distributes in broadcast way, every front server computes, the input data packet IP addresses or TCP port number in hash to decide if said data packet is processed.

本发明涉及网络服务器技术领域，尤其是一种集群服务器的多分配器前端系统构成方法，其特征在于：包括以下步骤，建立包括两台及以上的配置了两块网卡的前端分配器、一台集线器的集群服务器前端系统，所有前端分配器的数据输入端网卡通过集线器并行集联，所有前端分配器的数据输出端网卡与集群服务器后端系统的交换机相连；所有前端分配器的数据输入端网卡配置一个相同的虚拟IP；通过集线器将输入数据包以广播方式传输到所有前端分配器；各前端分配器对输入数据包IP地址或TCP端口号进行散列计算，决定是否处理该数据包。

During the process, how to calculate a threshold so as to the number of the 1 and 0 are approximately equal.

在实现的过程中重点解决了阈值的选取问题，使图象Hash值中的0，1个数尽可能相同。

This paper proposes an universal e-cash system based on partially blind signature which can be divided to small pieces of arbitrary number one time, so-called single-divisibility.

针对通用电子现金系统的难点在于其可分性，本文提出的方案以SK00系统为基础，实现其转移性(SK00公开问题)，并给商家颁发电子执照行使银行的部分职能，进而提出了一个显式可分(即一次性任意分割电子现金)的离线电子货币系统；同时利用以前的技术实现了一个采用树型结构的可分电子现金系统，并比较了这两个方案和以前方案的效率；二者安全性基于离散对数问题和强无碰撞Hash函数安全性；最后本文利用代理签名给出了一个新的部分盲签名方案。

If you want to use arbitrary data, then you should use either BTree or Hash.

如果你想使用任意类型的数据，你就应该用B树或哈希。

The proposed algorithm does not need complex hash operation, and the matching pointer does not need backdate during matching. Theoretic analysis and experimental results demonstrate that the proposed algorithm efficiently solves the space expansion problem, and process mixed Chinese and English text correctly and efficiently with lower time and space complexity.

理论分析与实验结果表明，所提出的算法在匹配中无需复杂的哈希运算，不需要回溯匹配指针，在中英文混合环境下能够进行正确、高效的匹配，而且不存在空间膨胀问题，具有较低的空间与时间复杂度，有较大理论与应用价值。

Police even detained and interrogated members of the Hash House Harriers, a beery running club, suspicious that the flour they used to mark their runs might be part of a terrorist attack.

一家3H 定向越野俱乐部的成员受到警方讯问，因为他们用粉末标记路径被怀疑是恐怖分子的行为。

This method checks the integrity of data objects via cross-checking with grouped Hashes, where each group Hashes can indicate the integrity of all data independently.

该方法采用独立分组的Hash 对数据对象进行交叉检验，每组Hash 可独立指示所有数据对象的完整性。

These two structures can decrease the adding new failure probability to neglectful level while hold the advantages of easy of implementation and lower system cost.(3) With the analysis of several kinds of high volume hardware hash table, a DRAM based multi-level hash table structure is proposed.

3分析了几种大容量硬件哈希表实现结构，提出了一种基于DRAM的多级硬件哈希表结构，并对其静态查表性能和动态查表性能进行了深入研究，具有一定的理论和实用价值。

The secret key operates on the message hash generated by SHA-1; to verify a signature, one recomputes the hash of the message, uses the public key to decrypt the signature and then compares the results.

密钥运行在由SHA-1产生的消息哈希；为了验证一个签名，要重新计算消息的哈希，使用公钥解密签名然后比较结果。

For some kinds of hash tables, performance may degrade catastrophically when the table becomes too full, so the programmer needs to have a fairly accurate idea of how many data items will need to be stored (or be prepared to periodically transfer data to a larger hash table, a timeconsuming process).

某些哈希表被填满时，性能下降的非常严重，所以程序员必须要清楚表中将要存储多少数据（或者准备好定期地把数据转移到更大的哈希表中，这是个费时的过程

Methods: Five patients with parkinsonism or dystonia were assigned to general anesthesia using an modified endotracheal tube.

本实验依照人体实验之相关规定进行，五位患有帕金森氏症或肌张力异常的病人接受神经立体定位手术。

If you can benefit from this book, it is our honour.

如果您能从本书获益，这将是我们的荣幸。