26 results about "Quicksort" patented technology

The application provides a multi-constraint aircraft assembly scheduling method based on multi-target migration learning, and relates to the technical field of assembly scheduling. Firstly, task decomposition is performed on assembly list requirements in the aircraft scheduling process, an operation station adjustment mechanism is designed, and reconfiguration operation of operation stations corresponding to assembly tasks is completed; then, operation station types required by the assembly tasks are updated, an aircraft scheduling problem is mathematically modeled, a multi-constraint multi-target aircraft assembly scheduling problem model is constructed, an initial task sequence of the tasks is determined, a non-dominated fast sorting genetic algorithm optimization framework with a multi-target elite gene reservation strategy is established, a multi-target migration strategy is established, and a migratable solution set is obtained; finally, a Pareto front solution set is obtained, one solution with the minimum value in the Pareto front solution set is selected, a corresponding specific assembly scheme Gantt chart is obtained, an assembly scheduling table is made, and the assembly process of the aircraft is guided.

The present invention provides a data security storage method and system based on emergency power-off of an in-vehicle network engine terminal. The key points of its technical solution include: obtaining historical normal data and setting various threshold parameters; detecting various vehicle information in real time and obtaining the necessity of reordering at the current moment; when the necessity of reordering is less than the set threshold, the priority sorting code at the current moment remains unchanged; when the necessity of reordering is greater than or equal to the set threshold, reorder the priority of vehicle data to generate a new priority sorting code; in response to the necessity of reordering being greater than or equal to the set threshold or the vehicle power supply being abnormal, trigger a data protection mechanism, and store each vehicle information data in sequence according to the priority order of the sorting code at the current moment; the present invention can achieve dynamic priority fast sorting, improve the storage efficiency of critical data, and ensure that abnormal data can be stored preferentially.

The invention provides a response method and device for a high-concurrency travel budget request, and electronic equipment, and relates to the field of management of travel expenses of enterprises, and the method comprises the steps: constructing a calculation scheme for travel expenses based on gender grouping, intelligent matching and a dynamic rule engine; manual errors are eliminated by means of automatic gender grouping, graph model maximum weight matching room sharing and a Kahan accumulation algorithm, and the error rate is reduced to zero; in terms of processing efficiency, time consumed for multi-person cost calculation is shortened to a second level from traditional manual 30 minutes or more through synchronous data acquisition, rapid sorting and an optimization algorithm; a formula engine is automatically adapted to A / B type independent calculation and rules such as same-gender reimbursement and budget waste, so that excessive reimbursement and budget waste are avoided; modularized design supports newly-added rules, core logic does not need to be reconstructed, and policy adjustment is flexibly adapted. Meanwhile, user operation is reduced through full-process automation, experience is optimized through a configuration formula engine, and the accuracy, efficiency and compliance of business travel reimbursement of enterprises are comprehensively improved.

The present invention belongs to the technical field of user data privacy protection and discloses a dictionary-partitioned two-layer structure encryption index creation method that supports rapid encrypted document sorting and retrieval. The method comprises the following steps: first, extracting keywords from each document in a document collection to construct an initial global dictionary; second, clustering the keywords in the global dictionary using a binary k-means clustering method to achieve rearrangement of the keywords in the global dictionary; then, dividing the rearranged global dictionary into equal-length partitions to generate mutually disjoint equal-length sub-dictionaries; then, constructing a one-hot code selection vector corresponding to the sub-dictionary, and constructing a corresponding document sub-vector for each document containing keywords belonging to the sub-dictionary to construct a two-layer structure plaintext index; finally, encrypting the plaintext index to generate a two-layer structure encrypted index. The encrypted index created by the present invention can be used for rapid sorting and retrieval of encrypted documents in an outsourced environment, thereby improving retrieval efficiency.

The invention relates to a plate sorting and stacking machine and a plate sorting and stacking method. The plate sorting and stacking method mainly comprises the steps that the plate sorting and stacking machine is adopted, cut plates of different sizes are placed in a three-dimensional goods shelf through the plate sorting and stacking machine, only one plate is placed at each storage position in the goods shelf, and then the plates in the three-dimensional goods shelf are sequenced through the plate sorting and stacking machine according to requirements; and each plate is taken out from the original storage position and is put into a new storage position again. According to the method, the plates of different sizes can be quickly sequenced, and the overall efficiency of plate processing can be improved.

The invention discloses a capacity optimization configuration method and device for a tractive power supply system and a medium, and relates to the field of capacity optimization configuration, and the method comprises the steps: obtaining original data; according to original data, a source-storage-load power characteristic model is established, according to the source-storage-load power characteristic model, a double-layer optimization configuration model for source-storage collaborative configuration is established, and the double-layer optimization configuration model for source-storage collaborative configuration is solved based on a multi-target dung beetle optimization algorithm improved based on a Kriging agent model and a non-dominated rapid sorting method. According to the method and the device, refined operation management can be realized, and the optimal planning scheme can be quickly obtained with high quality.

The invention provides a data security storage method and system based on emergency power failure of a vehicle-mounted network engine terminal, and the key point of the technical scheme comprises the steps: obtaining historical normal data, and setting each threshold parameter; detecting various vehicle information in real time, and obtaining the necessity of reordering at the current moment; when the necessity of reordering is smaller than a set threshold value, the priority ordering code at the current moment is not changed; when the reordering necessity is greater than or equal to a set threshold value, reordering the priorities of the vehicle data to generate a new priority ordering code; triggering a data protection mechanism in response to the condition that the necessity of reordering is greater than or equal to a set threshold value or the vehicle power supply is abnormal, and sequentially storing various vehicle information data according to the priority sequence of the ordering codes at the current moment; according to the method, dynamic rapid priority ranking can be achieved, the storage efficiency of key data is improved, and it is ensured that abnormal data can be stored preferentially.

The application discloses a kind of fast star map identification method and system based on adaptive star table, which comprises the following steps: using block, hierarchical extraction method to generate GAIA star table file from original GAIA star table data;GAIA star table file and Tycho2 star table file are read into memory, and star information is stored in partition, and star table index is established;The field of view information of input optical image is input, and according to the input information, the type of star table to be used is selected;According to the pointing and field of view information of input optical image, the required star information is read according to the star table index;Fast sorting method is used to sort image stars and star table stars, and the brightest multiple stars are selected for fast star table matching;Through the voting of matching result, the star mapping with the highest matching accuracy is found out as the successfully identified star.The application is suitable for optical image processing research field, and can be used for fast astronomical positioning of space debris and near-earth asteroids, to gain valuable time for emergency response of space events.

The invention provides a non-maximum suppression optimization method and device, and belongs to the technical field of target detection, and the non-maximum suppression optimization method comprises the steps: uniformly distributing a plurality of groups of original prediction data into at least two threads; calculating coordinate data of a plurality of groups of candidate frames in each thread by adopting an NEON instruction set; performing non-maximum suppression processing on the left upper corner coordinate data, the right lower corner coordinate data and the area data in each thread by using an NEON instruction set; classifying and combining the data subjected to the non-maximum suppression processing in each thread, and then performing the non-maximum suppression processing by using an NEON instruction set; and carrying out inverse quantization processing on the final coordinate value of the candidate box to obtain a final screening result. According to the non-maximum suppression optimization method, on the basis of multi-thread processing, descending sorting is carried out by adopting a rapid sorting method, and fixed-point value calculation is adopted during NEON instruction set calculation, so that low delay and high efficiency of a non-maximum suppression processing process can be realized.

The present invention belongs to the field of radio frequency identification technology and discloses a method, system and electronic device for quickly sorting radio frequency tags. The method comprises: a reader obtains a set of identified unsorted tags S k Calculate the three-segment hash value for each tag and construct a first array B and a second array D based on the hash value. The reader broadcasts the first array B and the second array D to all tags, allowing each tag to extract a codeword from them, modify its own state, and calculate the sorting result through offset calculation. The system and electronic device are constructed based on the method. The present invention uses the fewest possible bits to complete communication between the reader and the tag, thereby reducing communication costs and improving communication efficiency.

A method for fast ordering of targets derived from 2D imagery using space filling curves is provided. The method provides the spatial distance between successive targets is minimized allowing the review process to maintain spatial context when compared to traditional row-major ordering. The ordering is also quick to compute, when compared to MLROSE and Greedy algorithms, supporting near real-time reviewing. The method comprises detecting a plurality of targets in a two-dimensional image; scaling a two-dimensional image to cover all of, or a portion of, a space filling curve matrix, such that each pixel in the image is covered by a cell in the matrix; calculating a space filling curve coordinate for each target in the image, based on its image coordinate; and ordering the plurality of targets according to their respective curve coordinate to generate the ordered list.

The invention provides a multi-constraint aircraft assembly scheduling method based on multi-target transfer learning, and relates to the technical field of assembly scheduling. The method comprises the following steps: firstly, performing task decomposition on an assembly directory demand in an aircraft scheduling process, designing an operation station adjusting mechanism, and completing an operation station reconfiguration operation corresponding to an assembly task; then, updating the type of an operation station required by an assembly task, carrying out mathematical modeling on an aircraft scheduling problem, constructing a multi-constraint multi-target aircraft assembly scheduling problem model, determining an initialized task sequence of the task, establishing a non-dominated rapid sorting genetic algorithm optimization framework with a multi-target elite gene retention strategy, and establishing a multi-target migration strategy; obtaining a transferable solution set; finally, a Pareto frontier solution set is obtained, the solution with the minimum value in the Pareto frontier solution set is selected, a corresponding specific assembly scheme Gantt chart is obtained, an assembly scheduling table is made, and the assembly process of the aircraft is guided.

The present application belongs to the field of databases and specifically discloses an adaptive hybrid sorting method and system based on hash bitmap and quick sort. The method includes: obtaining row identifiers that meet the query conditions from a database index to obtain a query result set; splitting the row identifier into a compression unit identifier and a row number, storing the compression unit identifier in an identifier array, and storing the row number in a hash bitmap; using a hybrid sorting method to quickly sort the identifier array to obtain an array sequence of compression unit identifiers; the hybrid sorting method is implemented based on hash bitmap and quick sort; traversing the array sequence to determine the compression unit bitmap corresponding to each compression unit identifier in the hash bitmap; splicing the compression unit identifier and the compression unit bitmap to obtain a complete row identifier, so as to return a result set based on the complete row identifier for recording. The present application can improve query performance and efficiency.

This specification provides a method and apparatus for secure grouping of multi-party data. When grouping multiple pieces of target data from a target dataset jointly held by multiple participants according to predetermined attributes, each participant can first shuffle the target dataset to cut off their control over the location information of the target data. Then, the shuffled target dataset is sorted according to the attribute values ​​of predetermined attributes using fast sorting and merge sort based on security comparison, resulting in an ordered dataset. Finally, secure comparison is used to group the data based on the ordered dataset. This technical solution can improve the efficiency of secure grouping.

The invention discloses a multi-channel arbitration sorting method, device and equipment and a storage medium, and relates to the technical field of electronic systems.The method comprises the steps that to-be-sorted data input by n input channels respectively is obtained; utilizing an arbiter to compare the n pieces of data to be sorted to obtain a parallel comparison result; wherein the parallel comparison result comprises a comparison result of any two pieces of to-be-sorted data; according to the parallel comparison result, sorting the n pieces of data to be sorted to obtain a sorting result; according to the sorting result and preset output channel sorting, the n pieces of data to be sorted are matched to corresponding n output channels to be output; according to the invention, the plurality of arbiters are used for comparing the n to-be-sorted numbers in parallel, so that the n to-be-sorted numbers are sorted according to the parallel comparison result and are allocated to the corresponding output channels for output, an arbitration mechanism for quickly sorting the input values and quickly matching the input values with the output channels is realized, the arbitration sorting speed and the user experience are improved, and the user experience is improved. And the logic is simple and hardware implementation is easy.

The invention provides a method for quickly sorting seismic data. The method comprises the steps that the segmentation granularity of a seismic data file to be processed is determined, the seismic data file is divided into a plurality of data blocks based on the segmentation granularity, and seismic data, belonging to the same seismic channel, in the seismic data file are located in the same data block after division; key value pair information is extracted from the seismic data in the multiple data blocks, and the key value pair information comprises a trace header field and address information of a seismic trace to which the seismic data belongs; combining the extracted key value pair information into a key value pair information set; and sorting the key value pair information in the key value pair information set according to service requirements, and performing service processing on the seismic data in the seismic data file according to the sorted key value pair information.

The application relates to an FPGA chip data sorting method, an FPGA chip and electronic equipment. The FPGA chip is in communication connection with an extended memory, and the method comprises the following steps: obtaining to-be-sorted data, and writing the to-be-sorted data into the memory; reading the to-be-sorted data in the memory; respectively performing single sorting on the to-be-sorted data according to a preset sorting number; and outputting sorted ordered data in a specified range each time after each single sorting is completed. According to the scheme, the FPGA chip can be combined with the memory, the memory is used to cache to-be-sorted data, the problem of insufficient on-chip caching resources of the FPGA is solved, and therefore, fast sorting of a large amount of data in the FPGA chip is realized. The FPGA implementation logic of the method is simple, the sorting time consumption is less, and the stability of sorting is high.

The present invention relates to a pipeline sorting method based on column storage, and its technical characteristics are: including asynchronous IO thread, pipeline thread and sorting thread, which constructs CU sequence according to the meta information of all CUs, and constructs boundary sequence according to the minimum value information of the CU sequence. In the sorting process, CU is regarded as a data set. For two adjacent CUs, the minimum value of the latter CU is used as the boundary to divide the data into two parts. The former part can be sorted separately as a subset, and the latter part and the second CU form a new set, and then continue to perform the same processing with the latter CU to realize pipeline sorting. The present invention is reasonably designed, realizes the function of fast sorting of data sets that are stored in column and are approximately ordered, and has the characteristics of fast processing speed and small resource occupation.

The utility model provides a fast sequencing and combining steel seal device which comprises a main supporting frame, a main shaft and a plurality of elastic pawls are arranged in the main supporting frame, a plurality of steel seal units are arranged on the main shaft, each steel seal unit comprises a marking wheel and a ratchet wheel which are coaxially connected with each other, and the diameter of each marking wheel is larger than that of each ratchet wheel. Each elastic pawl corresponds to one steel seal unit, one end of each elastic pawl can be clamped to the corresponding ratchet wheel by means of self elasticity, and when the elastic pawls are subjected to external force overcoming the self elasticity, the ends of the elastic pawls can leave the corresponding ratchet wheels. According to the utility model, each elastic pawl locks the ratchet wheel of the corresponding steel seal unit by virtue of the elasticity of the elastic pawl, so that the independent locking and unlocking of each steel seal unit are realized; when the steel seal unit is rotated, other adjacent steel seal units cannot be touched, so that sorting errors are avoided, and the sorting efficiency of the steel seal sequence is improved.

The invention discloses a system state self-tuning device for realizing intelligent optimization of a target quantity, which is characterized in that a quick sorting mechanism is added into an existing firefly self-tuning algorithm to sort firefly brightness, the firefly brightness is recorded into an ordered array through the quick sorting mechanism, and firefly position information is updated according to a sorting result, so that the target quantity is optimized. Meanwhile, the worst to the optimal firefly position is obtained, and the optimal adjustment scheme can be obtained in advance before the maximum number of iterations is achieved; the firefly algorithm is downloaded to the micro-control system, the position data is converted into the actual adjustment amount, the specific objective function of the to-be-adjusted system does not need to be obtained, and optimization is completed directly according to the returned target amount.

The invention relates to the field of steel plate or strip steel production, in particular to a roller three-dimensional library scheduling method, which specifically comprises the following steps of: modeling roller data; calculating a theoretical minimum tray number; generating roller candidate pairing data and storing the roller candidate pairing data in an array; quickly sorting the candidate pairs; performing multi-objective optimization matching; and S6, outputting a selected tray result, and completing issuing of a roller preparation task. The method has the advantages that the tray-roller coupling optimization model is adopted, the minimum tray set covering all the target rollers is found by traversing the roller tray combination, the roller matching principle and the number of standby rollers are met, and the requirement that the number of trays needing to be delivered out of a warehouse is minimum is met; and multi-target optimization matching is adopted, an improved recursive pruning algorithm is utilized, the minimum number of warehouse-out trays serves as a main target, small-diameter roller pairing priority serves as a secondary target, an optimal roller combination scheme is determined, a specific roller tray warehouse-out combination scheme is generated, and the AGV carrying frequency is reduced.

The present application discloses a data sorting system for implementing a variable-scale quantity based on a merge sort algorithm. The data sorting system is used to merge and sort the original data in an external storage module. The acceleration module in the system is used to group and sort the acquired original data by using a data comparison method, and record it as ordered subsequence data; the data output module is used to output the ordered subsequence data to the external storage module; the merge module is used to acquire the ordered subsequence data in the external storage module, and adopt a loop method to merge the acquired ordered subsequence data, and record the merged data as merged sorted data; the data output module is also used to output the merged sorted data to the external storage module. Through the technical solution in the present application, it is possible to quickly sort large amounts of data in a limited local storage space, reduce resource consumption, and improve data sorting speed.

The invention relates to the technical field of data processing, and discloses a statistical monotonic data-oriented time domain splitting parallel rapid sorting method, which comprises the following steps of: obtaining statistical monotonic time sequence data to be sorted, performing data characteristic analysis, and outputting a data characteristic analysis report; performing time domain dynamic splitting on the statistical monotonic time sequence data based on the data feature analysis report to obtain a plurality of ordered sub-data sets; based on an OpenMP shared memory parallel model, mapping the plurality of ordered sub-data sets to a plurality of threads through static task allocation; quickly sorting each thread sub-data set by adopting a reference value selection strategy and a three-way segmentation mode to obtain a sorted ordered sub-sequence; and merging and optimizing all ordered subsequences after sorting, and outputting a completely ordered data set. According to the method, the ordered subintervals can be adaptively divided, the partition imbalance probability is reduced, and the multi-core utilization rate and the sorting efficiency are improved.

The present application relates to the field of steel plate or strip production, and particularly relates to a roller three-dimensional warehouse scheduling method, which specifically comprises the following steps: roller data modeling; calculating the theoretical minimum tray number; generating roller candidate pairing data and saving in an array; quickly sorting the candidate pairing; multi-objective optimization matching; S6, outputting the selected tray result, and completing the standby roller task assignment. The present application has the following advantages: a tray-roller coupling optimization model is adopted, the least tray set covering all target rollers is found by traversing the roller tray combination, the roller pairing principle and the number of standby rollers are satisfied, and the demand for the least number of trays to be discharged from the warehouse is also satisfied; a multi-objective optimization matching is adopted: an improved recursive pruning algorithm is used, the "minimum tray number to be discharged from the warehouse" is taken as the main target, and the "small-diameter roller pairing priority" is taken as the secondary target, so that the optimal roller combination scheme is determined, the specific roller tray discharge combination scheme is generated, and the AGV carrying frequency is reduced.

This invention discloses a method for triggering the readout of time-out-of-order data. The method involves selecting the total depth of the integrated hardware cache, dividing the cache unit into multiple cache partitions, and mapping each cache partition to a corresponding time span on the time axis. Based on the mapping relationship between cache partitions and time spans, the cache partition corresponding to the current data is determined, and the time-out-of-order data is reordered within the cache. A global time counter is constructed based on the system clock, and the time range for triggering the readout is obtained based on the delay, offset, and trigger window information of the system-transmitted trigger signal. Based on the mapping relationship between cache partitions and time spans, the cache partition range corresponding to the time range for triggering the readout is determined in reverse. The time information in the data is compared with the time range for triggering the readout, and all data that meets the time range is selected. This method enables rapid sorting of time-out-of-order data, thereby improving the triggering readout speed while reducing cache capacity and hardware complexity.