89 results about "Merge sort" patented technology

Methods and apparatus for forwarding packets in a multistage interconnection network are provided which timestamp packets using a substantially system-wide timing reference and a merge sorting variant to restore packets to the proper order, using the timestamp information carried in the packets. One implementation determines when packets passing along different paths in the network can be safely forwarded, even when no packets have recently been received on some of the paths, by forwarding status messages along otherwise idle paths. The status messages provide information that can be used by downstream components to allow them to determine when packets passing over other paths can safely be forwarded. One implementation simultaneously resequences packets being delivered to all n outputs of the multistage interconnection network. The resequencing operations are distributed among a plurality of switching elements making up the interconnection network.

A method for distributing and sorting data among a plurality of nodes is described herein. After receiving a portion of a data set (e.g., a database), each node sorts its portion and estimates a partitioning of the sorted dataset among the nodes based in part on its own sorted data portion. Each node then provides a representation of its estimated partition to a master node. The master node, using the provided estimated partitions, determines a tentative partitioning and submits the tentative partitioning to each node. Each node then determines the effect the tentative partitioning using its data portion. If the effect is acceptable for each node, the tentative partitioning plan is used to partition the data. Otherwise, the tentative partitioning plan is repeatedly revised by the master node and considered by the nodes having data portions until an acceptable or optimum partitioning is determined. Each node then distributes data from its data portion that falls outside the partition assigned to the node to the appropriate node. Upon receipt of this data, each node can perform a merge sort to add the received data to the previously sorted data portion at the node.

The invention relates to a microblog transmission group division and account activeness evaluation method based on a theme possibility model, aiming at effectively dividing according to transmission groups, dividing accounts participating in microblog topic transmission into a plurality of groups and quantifying active microblog accounts in each group. The method comprises: taking a keyword of a specific accident as the foundation and acquiring microblog specific text information and an account set participating in the microblog transmission; constructing a participating personnel list by text content of each microblog and account set input of the microblog; generating a model of each microblog in a sample library based on a theme probability; sampling words and participating personnel from a constructed word list and the participating personnel list according to group-theme, theme-word and group-human in the model; calculating by adopting a Gibbs sampling method; and adopting a merge sorting method to sort the words under each theme and people in each group. The method provided by the invention is simple and can be used for grasping microblog hot spots, emotional tendencies and public opinion guidance in time.

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.

Systems, methods and computer program products for storing data from multiple clients in a database include a Multi-thread Shared Memory message Queue Buffer (MSMQB) that includes multiple First-In First-Out (FIFO) queues, a respective one of which is associated with a respective one of the clients. The MSMQB is configured to store sequential bursts of data records that are received from the clients in the associated FIFO queues. A Semi-Merge Sort Module (SMSM) is configured to sort the sequential bursts in the FIFO queues based on the primary key of at least one selected record but not every record, to produce a semi-sorted record stream for serially stored in the database.

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 an O(n log n) recursive, comparison based sorting algorithm that uses multiple pivots to effectively partition a list of records into smaller partitions until the list is sorted. The algorithm is intended for use in software. This sorting method is accomplished by choosing pivot candidates from strategic locations in the list of records, moving those candidates to a section of the list of records (ie back or front of the large list) and sorting this small list. Then, the invention selects pivots from the pivot candidates and partitions the list of records around the pivots. Multiple Pivot Sort may be viewed as the next generation of Quick Sort, and average sorting times on unique random integer lists have beaten times by established algorithms like Quick Sort, Merge Sort, Heap Sort, and even Radix Sort.

The invention provides an image search method and device. The image search method comprises the steps of acquiring a current image sent by a client, extracting current features from the current image, and searching a reverse index database according to the current features to obtain reverse index values, wherein the reverse index database comprises a plurality of chain tables in one-to-one correspondence to the features of the image; carrying out merging sorting on the corresponding chain tables according to the reverse index values; returning a search result to the client according to a processing result so as to display the search result to a user conveniently. According to the image search method and device, the current features of the current image are extracted, the reverse index database comprising the chain tables is searched according to the current features to obtain the reverse index values, merging sorting is carried out on the corresponding chain tables according to the reverse index values, and the search result is displayed to the user, so that operation is convenient, implementation is easy, and the inconvenience of obtaining a result through character input is avoided.

To realize a high speed merge sort method by applying a coupled node tree, which method extracts a smallest or largest key from a plurality of sorted key storage areas in each of which is stored keys comprised of bit strings that are sorted, and generates a coupled node tree for merge while adding a processing source identifier that identifies the sorted storage area wherefrom the key has been extracted, and repeats the actions of writing out into the merged key storage area a key being obtained by a minimum or maximum value search on the coupled node tree and deleting the key, and inserting into the coupled node tree a key by extracting the key from one of the plurality of sorted key storage areas.

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.

The invention discloses a data processing method based on hardware sorting MapReduce. The method comprises the following steps that CPU-based quick sorting is replaced by GPU-based quick sorting; CPU-based merge sorting is replaced by GPU-based merge sorting; CPU-based heap sort is replaced by GPU-based merge sorting. The GPU-based sort algorithm replaces the CPU-based sort algorithm, the powerful computing capability of a GPU is made full use of, the middle data processing speed is improved, the MapReduce performance is improved, and the method is especially suitable for the large data field.

A data driven parallel sorting method includes distributing input data records to n partitions one by one in a circular manner. Each partition corresponds to a parallel sorting process with an allocated memory chunk sized to store m data records. The method also includes sorting, in parallel, current data records in respective memory chunks in respective partitions. The method also includes in response to distribution of data records of └m / n┘ rounds, circularly controlling one of the n partitions, and writing data records that have been sorted in the memory chunk of the partition into a mass storage as an ordered data chunk, and emptying the memory chunk. The method also includes in response to all data records being distributed, writing data chunks that have been sorted in respective memory chunks into the mass storage, and performing a merge sort on all ordered data chunks in the mass storage.

It is possible to realize a high-speed merge sort method using a coupled node tree. A minimum or a maximum key is extracted from a plurality of sorted key storage regions containing a key formed by a sorted bit string. A coupled node tree for merging is generated by adding a processing source identifier to identify the sorted key storage region as an extraction source. A write-out of a key into the merged key storage region by the minimum value or the maximum value search of the coupled node tree, a deletion of the key, and an extraction of the key from the sorted key storage region are repeatedly executed for an insert process.

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 discloses a database multi-connection query optimization method based on an evolutionary algorithm. According to the method, first, a data preprocessing technology and a bidirectional semi-connection technology are introduced into an SDD-1 algorithm, projection and other unary operation are adopted to simplify data, meanwhile, data of all nodes is ordered by merging, and row data and column data can be reduced at the same time through the bidirectional semi-connection technology; second, all beneficial bidirectional semi-connections are calculated and added into a set BS, a parallel genetic algorithm is adopted to solve a connection query strategy of the SDD-1 algorithm, a group initialization method, a fitness function and a relevant genetic operator suitable for the problem are constructed, and a protocol optimal query path for solving the problem is obtained; and last, the query path is used to initialize a pheromone matrix of an ant colony algorithm, a multi-ant-colony optimization method is utilized to solve an optimal query path again, and the problem that the parallel genetic algorithm has a weak local search ability is solved.

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.

A high throughput and scalable MIMO detector can use a K-Best detection algorithm to find K combinations of transmit symbols that are likely to be the symbols that were actually transmitted. The K-best MIMO detector can include a plurality of stages, where each stage may correspond to a transmit antenna, and each stage can find K best symbol combinations based on information from a previous stage. To find the new K best symbol combinations, at each stage, a plurality of metrics for potential combinations are computed and sorted by magnitude. The MIMO detector preferably uses a high throughput, merge sorting algorithm to sort the metrics.

A data storage system includes storage nodes adapted to provide retrieval of time-based data in response to a receipt of a time-based data retrieval request associated with data streams. Each of the data streams includes time-ordered data items having a header. The header includes timestamps representing a time interval associated with the data items. The data storage system further includes applications issuing the time-based data retrieval requests associated with the data streams and session managers coupled to the applications and storage nodes. Shared resources are dynamically allocated between the applications submitting the requests. Data requested by the requests is retrieved from the storage nodes using timestamp based indexes associated with the data streams in a substantially parallel manner. The retrieved data is merge-sorted by time. The sorted data is transmitted to the applications based on a delivery rate controlled by each application.

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.

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 invention provides an optimized merging and sorting based modular multilevel converter capacitor voltage equalizing method, which is characterized in that a merging and sorting algorithm is optimized through analyzing a capacitor voltage law of nearest level modulation in an ideal condition by using a modular multilevel converter modulation technology, the time complexity of optimized merging and sorting is further reduced, the execution time of actual sorting is reduced to the minimum, the sorting efficiency is very high, and sorting is not restricted by the number of sub-modules. In addition, a non-ideal condition correction optimized merging and sorting algorithm is provided by combining a direct insertion sorting method, the sorting accuracy can be ensured by correcting the optimized algorithm, the voltage equalizing effect is good, and the extra time overhead is small.