33 results about "Splaysort" patented technology

The invention is applicable to the technical field of computers, and provides a PoW certification method in a blockchain network and a blockchain, the PoW certification method comprises the followingsteps: acquiring a hash value of a previous block; according to the numerical value of the hash value of the previous block and a corresponding relationship between the numerical value and a hash algorithm, determining the sequence of the hash algorithm; sequentially carrying out hash calculation on blocks consisting of a random value and the transaction information to be packaged according to thethe sequence of a hash algorithm to generate hash values; and replacing the random value, repeating the previous steps until the hash value meets the PoW certification requirement, and broadcasting the block to other nodes for verification. According to the PoW method provided by the invention, the sequence of the hash algorithm is linked with the numerical value of the previous block, so that ahash algorithm used by the blockchain decentralization method each time is a random sequence, and a CPU and a GPU can better adapt to the random sequence, so that the advantages of ASIC in computing power are offset, and the distributed idea of blockchain decentralization is maintained.

A method, system and non-transitory computer readable instructions for data change detection includes decrypting encrypted patch data that includes compressed variable sized patch data chunks. The compressed variable sized patch data chunks are decompressed and a strong hash value is generated. The strong hash values are compared with strong hash values of corresponding variable sized application data chunks to determine a potentially non-referable patch data chunk. A bloom filter is generated for the variable sized application data chunks. A rolling hash value for a window of the potentially non-referable patch data chunk is used to determine a potentially referable area from the potentially non-referable patch data chunk. The potentially referable area is designated as referable when a weak hash and a strong hash of an application data chunk matches the weak hash and the strong hash of the potentially referable area.

A method, apparatus and computer program product for detecting malicious content and predicting cyberattacks are described herein. In the context of a method, the method receives a hash query comprising a file hash based on one or more files. The method queries a cyberattack case studies information database based on the hash query to generate one or more attack correlation information items associated with at least one of the one or more files. The method also generates and outputs a file security analysis based on the attack correlation information items for authorization of the one or more files.

A control module transferring data between a shard and destination shards within a database comprising a plurality of shards, the control module: generating a first hash wheel distribution of shard allocations by applying a defined hashing function to a first integer value per shard allocation; generating a further hash wheel distribution of shard allocations by applying the defined hashing function to a further integer value per shard allocation; determining a range of hash values associated with data to be transferred between the shard and a destination shard, wherein the range of hash values, the shard and the destination shard are defined based on determining a difference between the first hash wheel distribution of shard allocations and the further hash wheel distribution of shard allocations; selecting and controlling the transfer of data associated with the determined range of hash values between the shard and the destination shard.

A method, computer program product, and computing system for receiving a candidate data portion; calculating a distance-preserving hash for the candidate data portion; and performing an entropy analysis on the distance-preserving hash to generate a hash entropy for the candidate data portion.

An example operation may include one or more of obtaining data of a simulation, identifying checkpoints within the simulation data, generating a plurality of sequential data structures based on the identified checkpoints, where each data structure identifies an evolving state of the simulation with respect to a previous data structure among the sequential data structures, and transmitting the generated sequential data structures to nodes of a blockchain network for inclusion in one or more data blocks within a hash-linked chain of data blocks.

The invention discloses a multi-window leakage processing method and device and a computer readable storage medium, and the method comprises the steps: obtaining a process number of an application when the application applies to display a window; obtaining application times corresponding to the application in preset hash data according to the process number; judging whether the application frequency is greater than a preset value or not; if the number of times of application is larger than the preset value, a process corresponding to the application is killed, and if the number of times of application is smaller than the preset value, 1 is added to the number of times of application in the hash data. According to the technical scheme, an efficient memory leak processing scheme applying multiple windows is achieved, window creation is effectively controlled through clear and simple logic condition judgment, the jamming phenomenon is avoided, the fluency of a system is improved, and the use experience of a user is enhanced.

In some examples, a computing device creates an event log when an event occurs. If the event log includes a path comprising one or more components, the computing device may determine a hash, using a hash function and a salt, for each of the components and substitute each component in the path with an index to the hash stored in a dictionary. In this way, the computing device replaces each component of the path with an index to a hash in the dictionary to create a modified path. The resulting modified path can be traversed and searched. For example, a search term may be hashed using the hash function and salt, and the dictionary associated with the logs searched for a match. In this way, a particular file name or a particular folder name can be identified in the modified path.

Method for searching an item using a parametric hash filter includes forming an input vector from input data stream; forming a hash matrix having a first portion and a second portion; multiplying the hash matrix with the input vector to generate a second input vector including a hash values of the first input vector; generating a perfect hash vector and a universal hash vector, by applying a smooth periodic function to the second input vector; mapping onto a Markov random field the coordinates of locations of hash values in a search domain for which there is no possibility of collisions in the perfect hash vector to form an energy function; minimizing the energy function to generate a compressed hash table; fitting a band of acceptable locations in the compressed hash table, based on a predetermined false positive rate; and searching for a new item in the band of acceptable locations.

The invention provides a hash mapping storage method for second flow thickness control. According to the method, second flow thickness control calculation is realized, a data structure of a hash tableis used, inlet thickness measurement values needed in the second flow calculation process are stored in the hash table with the fixed length, the advancing length of a strip serves as a keyword, a hash function is used for calculating a storage index, the thickness value of an inlet entering a roll gap at present is retrieved, and the method participates in calculation of a second flow controller. According to the method, a traditional first-in first-out queue data structure is replaced by a hash table data structure, when the currently used entrance thickness value is retrieved, only one-time calculation is needed, the shifting operation needed in the first-in first-out queue is omitted, the retrieval efficiency is high, the calculation time is short, and the method can be used for entrance thickness calculation in second flow thickness control.

The invention discloses a data table processing method and device and a storage medium, and the method comprises the steps: determining a target hash value of a target data table; obtaining a character string value of a preset position of the target hash value; and performing mathematical operation on the character string value to obtain hash data of the target data table. According to the method,the target hash value of the target data table is determined, then the character string value of the preset position of the target hash value is obtained, and then the character string value is subjected to mathematical operation, so that the hash data of the whole data table can be determined, and the operation and verification efficiency of the data table is effectively improved.

The invention relates to a comparison method implemented by at least one apparatus (A; B), between a first and a second dataset, in particular with a view to determining whether these two datasets are identical, this method not requiring the presence of these two datasets on the apparatus, and comprising the following steps: a) mixing a number, referred to as the mixing number, with the first dataset, using a mixing function (105; 405), in order to obtain mixed data, b) hashing the mixed data using a hash function (106); 406), and c) comparing the hash thus obtained in step b) with a third dataset assumed to be the hash of the second dataset mixed with the same mixing number as that used in step a) and with the same mixing function (105; 405).