34 results about "Quicksort algorithm" patented technology

The invention discloses a collaborative Web service performance prediction method based on position clustering. The method comprises the following steps: according to position information of users and services, respectively clustering the users and services which are the same as an Autonomous System; calculating a centroid-based similarity; using a quick sorting algorithm to perform descending sort on similar clusters, finding the previous K neighbor clusters as candidate clusters, so as to finish the neighbor pre-selection; calculating the similarity between an active user and a user in each user candidate cluster, and the similarity between an active service and each service candidate cluster; respectively using the previous K most similar users to predict a performance value of an unknown service for the active user and using the previous K most similar services to predict a performance value of the unknown service for the active service; and synthesizing all performance values to calculate a quality predicted value of a source user relative to a target service. The collaborative Web service performance prediction method based on the position clustering provided by the invention can solve the problems like data sparse and cold boot in Web service recommendation, and improve the precision and coverage rate of Web service performance prediction and Web service recommendation.

The present application discloses a data information sorting method, which includes: a CPU side executes a main program algorithm separated from a quick sort algorithm; wherein, the process of the CPU side executing the main program algorithm includes transferring a data set to be sorted to an FPGA terminal, and sends a sorting start control command to the FPGA terminal; after the FPGA terminal obtains the sorting start control command, it executes the kernel program algorithm separated from the quick sorting algorithm, so that the data set to be sorted is analyzed. Perform sorting processing to obtain the corresponding sorting results. By adding an FPGA terminal to run the core program of the sorting algorithm, the invention breaks through the original hardware limitation, increases the operation speed and improves the work efficiency. The invention also provides a data information sorting system, a CPU end, and an FPGA end, which can run the data information sorting method, and can also increase the operation speed and improve the work efficiency.

The invention relates to a quick paging sorting method based on a quick sorting algorithm. It is difficult for the existing sorting method to know which data are included in the specified range and the order between them before completely sorting all the data, so the existing technology is to completely sort all the data first, and then output the data subset of the specified range, which is There must be a large amount of unnecessary computing overhead, which affects the response speed of the computer system. The method described in the present invention mainly adopts a divide-and-conquer strategy similar to the Quick Sort algorithm, utilizes the cache mechanism, continuously excludes elements that do not belong to the specified range, and gradually sorts and locates the data within the specified range, thereby solving the problem of Problem with quick paging sort. The method of the invention can effectively solve the problem of paging and sorting under the massive data environment, greatly reduce unnecessary calculation overhead, avoid repeated calculation, and improve the response speed of the computer system.

The invention discloses a metamaterial simulation data processing method and a metamaterial simulation data processing device. The metamaterial simulation data processing method includes the steps of obtaining N transferring samples through a simulation algorithm, wherein each transferring sample comprises structural parameters characterizing metamaterial units and N is a natural number, obtaining distance values respectively comparing electromagnetic response characteristics of metamaterial units expressed by the N transferring samples with an electromagnetic response characteristic of a metamaterial unit expressed by a target sample, sequencing the N obtained distance values according to a fast sequencing algorithm, obtaining the transferring samples corresponding to the N distance values which are smaller in the sequenced distance values, and treating the transferring samples corresponding to the N distance values as designed samples, wherein n is a natural number less than N. The metamaterial simulation data processing method and the metamaterial simulation data processing device has the advantages of being capable of achieving automatic processing of metamaterial simulation data and improving data processing efficiency.

The invention belongs to the technical field of integrated circuit design, and specifically relates to a method for dividing a parallel GPDT algorithm on a multi-core SoC. The parallel GPDT algorithm includes two iterations, the inner iteration is responsible for solving the working set, and the outer iteration is responsible for updating the working set. In terms of the critical path of calculation speed, the critical path of the outer loop is the update of the gradient, and the critical path of the inner loop is the calculation of the vector after each projection. These two parts of matrix operations need to be processed in parallel on multi-core; while the rest The calculations can only be implemented serially on the main core, including the gradient projection operation implemented by the Dai-Fletcher algorithm, and the update of the working set by introducing the quick sort algorithm. The vector obtained after the calculation is the support vector of the training data of the GPDT algorithm.

The invention discloses a copper plate packaging and packaging method, and relates to the technical field of copper plate inclusion methods. The method includes the following steps: read out the relevant data of the copper plate from the database, and use an integration algorithm to process the above data; use a quick sort algorithm to process the data processed by the integration algorithm, and the robot completes each step according to the processed data. Packing per pack, per order, and batch of copper plates. The method sorts and packs the data for the integration algorithm, the quick sort algorithm, and the mixed packet algorithm. The operation of the data field is mainly for the processing of the data boundary to prevent data from being reused and unused, and then transmit it to the robot in a specified format The function of automatic packaging is realized, which improves the work efficiency of packaging.