88 results about "Merge sort" patented technology

A merge sorting apparatus includes a comparison tournament circuit including comparison nodes, and a comparison control circuit for supplying to the corresponding comparison nodes validity flag information concerning the input data to each of the comparison nodes determined based on comparison results from the comparison nodes. The comparison control circuit includes comparison result registers for retaining the comparison results, validity flag registers for retaining the validity flag information, and merge member registers for retaining information as to whether the input data to each of the input registers corresponding to respective pathways should be the object of comparison in the following data comparison processing. With this arrangement, contending readouts of record arrays from a memory can be reduced and the necessity to initialize each register is eliminated, thereby speeding merge sorting.

The invention relates to the field of secure multi-party computation, in particular to a verifiable distributed privacy data comparing and sorting method and a device. The method and the device have the beneficial effects that through the steps of sorting the privacy data of n client sides by using a distributed client side initialization, inquirer initialization and inquirer Pa use merge sorting algorithm and the like; aiming at the situation that the data is stored on a large quantity of distributed nodes, a ceterless mode is completely adopted in the whole inquiry process by utilizing a digital signature and a semi-homomorphic encryption system; all the client side data is encrypted by using a client side public key and is only decrypted by a client side private key to ensure data privacy; and through a verification mechanism, all client sides can not input false data and can also not affectedly behave the comparing and sorting results.

The invention discloses a quick retrieval method and device of face recognition. The method comprises the following steps: establishing a sample database, carrying out binaryzation transformation on sample data, and carrying out Hash mapping on the sample data into a plurality of Hash tables; in the same way, carrying out the binaryzation transformation on the characteristic data of a sample to be queried, and utilizing Hash function projection adopted by establishing the sample database to obtain a binary code queue, and extracting matched samples in the plurality of Hash tables from the corresponding buckets of the Hash tables to carry out merge sort; calculating a Hamming distance between the binary characteristics of the sample to be queried and the binary characteristics of an effective sample subjected to the merge sort; and carrying out 1:1 accurate comparison on the effective sample of which the Hamming distance is smaller than a set threshold value and the sample to be queried to obtain most similar sample data. Through hierarchical query, a retrieval amount is drastically reduced, a floating point calculated amount is greatly reduced, and retrieval efficiency is high. In addition, the retrieval scheme has the advantages of high adaptation, wide application range and good popularization value.

The invention provides a massive data storage method simultaneously applicable to disk and solid state disk reading and writing features. Full sequencing of records in each block is changed into partial sequencing, a Bloom filter is added to the tail portion of each block, a Log-Structured Append-Tree is created, when the quantity of data stored in each block in the tree reaches a threshold and data in the block is directly added to corresponding child blocks, the data of the child blocks is composed of multiple collating sequences rather than full sequencing is achieved in the blocks in a merging sorting mode; each block in the tree stores one Bloom filter. According to the method, on the condition that no other properties are sacrificed, write amplification is greatly reduced, and the random writing efficiency is greatly improved. Besides, the service life of a solid state disk is better protected and prolonged. In read and write mixed scenes, the random read property is also enhanced, and the method has important market value.

The invention relates to a multiple-input multiple-output (MIMO) signal detection method based on breadth-first tree search, mainly solving the problem of high complexity of the existing MIMO detection method. The method is implemented by the following steps: (1) preprocessing a system, wherein the step comprises QR decomposition of a channel matrix and precomputation of a path metric factor; (2)using the concept of breadth-first tree search to detect signals layer by layer: 2a) using survival paths of a previous layer to expand the paths of the current layer: using a Schnorr-Euchner enumeration method to sequentially determine path expansion sequence, expansion paths and path metrics; and 2b) using a merge sorting method to sort the path metrics of the expansion paths to determine survival paths; and (3) if the detection on all layer signals is finished, taking the survival path metric corresponding to the minimum path metric as the final detection output, otherwise, transmitting the survival path to the next layer to detect the signal of the next layer. The method of the invention has the advantages of low complexity and small performance loss, and can be applied to signal detection of an MIMO receiver of a next-generation broadband wireless communication system.

The invention relates to a multi-data-stream processing method based on a wireless sensor network, comprising the following steps of: reading data from a data source generating data continuously by adopting a sliding window with fixed time intervals; merging and sorting the data read by adopting the sliding window with fixed time intervals; then carrying out task split on the obtained merging result in a sampling way; and finally sending the obtained tasks to a load balancing thread for task allocation. With the method, in-time processing of data, no accumulation or overflow of a data stream and the data continuity are ensured, and the loss of the data is reduced as much as possible.

The invention relates to the field of sort algorithms, in particular to a merging sort structure. With the adoption of an FPGA (field programmable gate array) structure, operation of merging sort is achieved; maximization of a resource and the efficiency is achieved; a requirement of sorting characteristic points of a high-definition real-time picture can be fully met; and the time complexity is better than the merging sort based on PC (personal computer) operation. The merging sort structure comprises merging components, wherein the merging components comprise storage queues; the queues are connected with comparers and auxiliary controllers; and counters for counting dequeuing or enqueuing operation are arranged on the auxiliary controllers.

A method for use with an aggregation operation (e.g., on a relational database table) includes a sorting pass and a merging pass. The sorting pass includes: (a) reading blocks of the table from a storage medium into a memory using an aggregation method until the memory is substantially full or until all the data have been read into the memory; (b) determining a number k of blocks to write back to the storage medium from the memory; (c) selecting k blocks from memory, sorting the k blocks, and then writing the k blocks back to the storage medium as a new sublist; and (d) repeating steps (a), (b), and (c) for any unprocessed tuples in the database table. The merging pass includes: merging all the sublists to form an aggregation result using a merge-sort algorithm.

Embodiments of the invention disclose a data merging and sorting method and apparatus. The method comprises the steps of according to at least two sorted sub-tables corresponding to to-be-sorted data,generating sub-table control information corresponding to the sorted sub-tables respectively; obtaining a sub-table control information queue; according to an arrangement sequence of the sub-table control information in the sub-table control information queue, sequentially obtaining at least one sorted sub-table meeting a merging condition and adding the sub-tables to a merging queue; performingmerging and sorting on the sorted sub-tables in the merging queue, and obtaining and outputting a merging and sorting result of the to-be-sorted data; and if it is determined that all data in the at least one sorted sub-table in the merging queue is output, continuing to obtain the sorted sub-tables meeting the merging condition and adding the sub-tables to the merging queue, until all the sortedsub-tables are added to the merging queue. The flexibility of memory resource use can be improved and the data merging and sorting efficiency is improved.

The invention belongs to the technical field of information security, and discloses a ciphertext-based numerical value security sorting method and system, and the method comprises the steps: carrying out the encryption of privacy data held by a plurality of participants through employing a distributed encryption key based on a ciphertext-based numerical value security sorting algorithm; and sending the ciphertext data to a cloud server, comparing the ciphertext data by the cloud server by using a data size comparison protocol, and sorting the ciphertext data in combination with a merge sorting algorithm. According to the invention, a data comparison protocol is constructed based on a private key splitting method to ensure the privacy of data, and the high efficiency of ciphertext sorting is realized by using a merge sorting mechanism. Meanwhile, aiming at the data security problem in a distributed scene, the efficient privacy protection numerical security sorting algorithm designed for the security multi-party sorting model provided by the invention can ensure the security of sensitive information in the multi-source data sorting process, and effectively promote and push the flourishing development of big data related technologies.

The invention relates to a merging-sorting method based on an assembly line process and a valve control device using the merging-sorting method. The merging-sorting method is an effective parallel algorithm based on merging operation. Merging-sorting is operation for combining two ordered arrays into one ordered array; elements in the two arrays are compared, and smaller elements are put into a third array, and so forth; and if one of the arrays arrives at the end firstly, the remaining parts of the other array are put into the third array, so that the two different arrays are combined into one ordered array. Moreover, the method is applied to a valve control system of a flexible direct-current power transmission system, and a key path in the algorithm is shortened by means of an assembly line technology, so that the speediness of capacitive voltage sequencing can be ensured under the situation that IGBT (Insulated Gate Bipolar Translator) sub-modules of each bridge arm are increased; less resources are occupied; and the utilization ratio of a chip is increased.

The invention relates to a dual-adjustment merge-sorting tuning method and device. According to the dual-adjustment merge-sorting tuning method, datasets to be sorted are distributed according to the computing capacity of a GPU and a CPU, and then sorting is carried out by the GPU and the CPU on the datasets to be sorted distributed to the GPU and the CPU respectively. In the sorting process, when data in the GPU and data in the CPU are irrelevant, sorting is carried out by the GPU and the CPU respectively; when the data in the GPU and the data in the CPU are relevant, the data are gathered onto either the GPU or the CPU for sorting. Therefore, overlapping calculation can be achieved better, execution time for dual-adjustment merge-sorting is shortened, and execution efficiency is improved.

The invention discloses a multi-stage merging and sorting method based on FPGA (Field Programmable Gate Array), which comprises the following steps: step 1, detecting a plurality of 2 merging and sorting modules, with each 2 merging and sorting module comprising to-be-sorted data A and to-be-sorted data B; step 2, merging and sorting the plurality of 2 merging and sorting modules respectively, andoutputting sorting results; and step 3, taking the arrangement result as a to-be-sorted next-level queue, entering a next-level merging and sorting module, and repeating the step 1 and the step 2 until a final arrangement result is output. When the merging and sorting number is increased, the gate stage number is constant, and merging of sorting queues of any length can be achieved.

The embodiment of the invention discloses a basic odd-even merge grid unit and survivor path selection and construction method for performing odd-even merging and sorting on an input path which is not an integer power of 2. The method comprises steps of: adding input paths and marking the positions of the added input paths in order that the number of all input paths is equal to the integer power of 2; filling the added input paths with path magnitude values; performing odd-even merging and sorting according to the magnitude values of all the input paths in order to obtain sorted input paths; deleting the input paths with marked positions in the sorted input paths to obtain the residual input paths; and linking the residual paths in the residual input paths and using the link as the input of a basic comparison exchange unit.