Patents
Literature
Patsnap Copilot is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
Patsnap Copilot

40 results about "Insertion sort" patented technology

Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time. It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort.

Universal timed task management realization method

The invention discloses a universal timed task management realization method, which is characterized by comprising three steps. In the first step, a manager consisting of a synchronous ordered queue, a plurality of generator threads and a plurality of consumer threads is set. In the second step, the queue manager manages different timed tasks by the synchronous ordered queue, sorts the tasks in the queue in an ascending way according to execution time, triggers a notice every time when tasks are added into the queue, and ensures that the order of the queue is unchanged by insertion sort. The third step specifically comprises the following steps of: when the consumer threads are started, checking whether the queue comprises periodical tasks or not; if the queue is checked not to comprise the periodic tasks, blocking the threads, awakening waiting tasks by using the notice when the waiting tasks are inserted and rechecking the queue; if the queue is checked to comprise the periodical tasks, checking whether the tasks are expired, and if the tasks are checked to be expired, calculating expiration dates, starting blocking the threads and waiting for a limited time; rechecking the queue if waiting for the limited time or the waiting tasks are awakened by the notice; executing the expired tasks immediately when the expired tasks are found in the queue checking of each time; and for the periodical tasks, modifying execution starting time after the execution of each time, and inserting the periodical tasks into the queue again for calling and execution. The method has the characteristics of universality and high efficiency.
Owner:NANJING NRIET IND CORP

Logging insertion/removal of server blades in a data processing system

This invention is comprised of a data processing system containing at least one main processor connected to a system bus, a system memory connected to the system bus and accessible to each of the main processors, a tamper mechanism, and a local service processor. The tamper mechanism is configured to change state each time the system is inserted into a slot in a rack enclosure. The local service processor is connected to the tamper mechanism and configured to update an insertion log upon detecting a change in state of the tamper mechanism. The insertion log provides a count and a history of rack insertions to which the system has been subjected. The system may include a non-volatile storage element which is updated exclusively by the local service processor that contains the insertion log. The insertion log may include an insertion counter. In this embodiment, the local service processor is configured to increment the insertion counter upon each insertion. The local service processor may be further configured to issue an alert if the insertion counter exceeds a predetermined value. In one embodiment, the system further includes a battery backed real-time clock connected to the local service processor. The local service processor is configured to include real-time information corresponding to each insertion event in the insertion log. Each entry in the insertion log may include the identity of the rack enclosure and the geographical address of the slot of the corresponding insertion event. The local service processor may be configured to detect the tamper mechanism state and update the insertion following a power event such that the insertion log update is independent of configuring the data processing system with a boot image.
Owner:IBM CORP

Time synchronization method based on vehicle ad hoc network topology structure

The invention discloses a time synchronization method based on the vehicle ad hoc network topology structure. According to the feature that the overall distribution of the vehicles is characterized by I type, T type or X type, the vehicle with GPS facility is used as an initial time server; according to the concept of grading, the number of the neighbor nodes in the routing table is taken as the standard, synchronization is carried out while the optical sub-grade time server is selected, wherein the selected lower-grade time server is in accordance with the characteristic shape of the road and satisfies the requirement of having a plurality of unsynchronized lower-grade neighbor nodes. The invention is characterized in that: the synchronization and the selection of the optical sub-grade server are carried out at the same time, thus preventing the selected sub-grade server from failing caused by fast changing routing; multicast and shorter synchronizing information are adopted for time hack, thus reducing the occurrence of the conflicting and paralyzing of the network when the network performs global synchronization; the server only performs the insertion sort process once and other operation is totally shared by other nodes, thus reducing the operand of the server.
Owner:UNIV OF SCI & TECH BEIJING

MMC capacitor voltage-sharing strategy with low switching frequency and complexity

The invention provides an MMC capacitor voltage-sharing strategy with low switching frequency and complexity. The MMC capacitor voltage-sharing strategy comprises the steps of S1, rapidly monitoring acapacitor voltage value of each sub-module; S2, determining the number of input and removed sub-modules, and judging the charging and discharging conditions of the input sub-modules in the bridge arm; S3, continuing to use the sorting result of the last period, grouping the sub-modules in the input state and the cut-off state to perform insertion sorting correction for limiting the step number, the step number being determined by the maximum voltage difference, and the larger the difference value is, the larger the step number is; S4, according to the charging and discharging conditions, introducing a retention factor to the capacitor voltage of the corresponding sub-module; S5, merging the two sub-sequences in the input state and the cut-off state in two paths, and updating and recordinga sorting result; S6, generating the trigger pulse. According to the invention, dual optimization of the sorting algorithm operation speed and the device switching frequency is realized, and the problems of large sorting algorithm operation amount and high device switching frequency in the traditional sub-module capacitor voltage-sharing strategy are solved.
Owner:CHANGSHA UNIVERSITY OF SCIENCE AND TECHNOLOGY

Product mixed sorting method and sorting time calculating method

InactiveCN104368534ASolve problems that are not easy to identify by inventoryImprove picking efficiencySortingParallel sortingSorting time
A product mixed sorting method comprises the following steps: (1) pretreating a received order, determining whether the order can be partially or completely subjected to parallel sorting, if yes, preferentially performing parallel sorting, or else, performing sorting according to a serial sorting strategy; (2) aiming at an order which is partially subjected to parallel sorting, determining whether gaps exist among products in a conveying system after sorting, and if yes, performing gap-insertion sorting on to-be sorted products by utilizing selecting utilizable gaps in unsorted products; (3) sorting finally-residual unsorted products according to the serial sorting strategy; and (4) starting to perform sorting for a next order after all products needed by the order are completely sorted, ejected and conveyed out of a sorting zone. The invention also discloses a sorting time calculation method for product mixed sorting. The product mixed sorting method helps to solve the problems that in a conventional serial sorting strategy, cargos are mixed and overlapped together in a conveying system, cannot be subjected to direct regular packaging and are not easy to count and identify, and is improved in sorting efficiency and saved in sorting time compared with the serial sorting strategy.
Owner:SHANDONG UNIV

Insertion sorting method, system and device based on an external memory, and storage medium

The invention discloses an insertion sorting method, system and device based on an external memory and a storage medium. The method comprises the following steps: reading a locally stored to-be-processed data sequence through an external storage device; setting a current value of an element indicator of the to-be-processed data sequence; reading a corresponding current element from the to-be-processed data sequence according to the current value, and performing insertion sorting on the current element in the to-be-processed data sequence according to an ascending order or a descending order toobtain an undetermined data sequence; taking the to-be-determined data sequence as a to-be-processed data sequence; returning to the step of setting the current value of the element indicator of theto-be-processed data sequence; and obtaining the target data sequence until no readable current element exists in the to-be-processed data sequence, so that the insertion sorting is completely carriedout in the external memory, the memory space is saved, meanwhile, the target data sequence is subjected to halving search in the external memory, the time for importing the data into the memory is saved, and the query speed of the database is increased.
Owner:WUHAN POLYTECHNIC UNIVERSITY

Triangulation method and system for three-dimensional reconstruction

The invention relates to the technical field of three-dimensional reconstruction, discloses a triangulation method and a system for three-dimensional reconstruction, and aims at improving the triangulation speed of the planar point set in three-dimensional scanning and better meeting the real-time requirement of three-dimensional reconstruction. The method comprises the steps: acquiring the three-dimensional coordinate points of the target object to be reconstructed, mapping the three-dimensional coordinate points to the planar point set, traversing the planar point set to construct a target triangle including all the points in the planar point set, setting the region including the target triangle and dividing the region into N*N regions, establishing an entry triangle according to the position of the insertion point, judging whether there is the entry triangle in the region where the next insertion point is located , If there is the entry triangle, a new target triangle is searched according to the positional relationship between the insertion point and the edge pointer of the entry triangle, if not, the new target triangle is searched according to the positional relationship between the insertion point and the first triangle generated by the previous insertion point, and thus the final triangle mesh is obtained.
Owner:CENT SOUTH UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products