10 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 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 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.

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 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 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.