40 results about "Insertion sort" patented technology

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.

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.

This invention provides one method to establish application to intelligent card composed of capacitor and subject memory data, which comprises the following steps: processing capacitor identifying according to order message data; if it passes, then establishing capacitor into capacitor entrance and analyzing subject label from order message to judge whether the current application entrance label is same; if yes, inserting the current analysis subject into current application entrance list for memory. This invention intelligent card can be suitable for each industries with one common flow.

The present invention discloses an inserting-ordering method, which is used to insert keywords of the data to be inserted into the queue list according to the ordering rule of the keywords of node data in the queue list. The present invention comprises the following steps of comparing the keywords of each node data in specified queue list with that of data to be inserted, conducting shifting operation for the node data in specified queue list according to the comparing results, and inserting the data to be inserted into the specified queue list while conducting shifting operation. The adoption of the present invention completes comparing, shifting and inserting operation in a clock period and cancels reverse shifting logic, which ensures that the sequencer adopting the inserting-ordering method can realize linear operation, simplifies the design of sequencer and expands the application of the sequencer.

An online exchange system and method supports open insertion order operations for online advertising markets displaying inefficiencies when delivering advertising media. Inefficiencies occur in an open ad exchange for online advertising when there is an under delivery of advertising content to identified target recipients. The online exchange system anticipates under deliveries and automatically fills instances of under delivery with impressions from the publisher inventory of the exchange according to fill requirements of the ad agency providing the advertising content (for example, budget limits and types of impressions to be used for filling the under delivery). The online exchange system also provides a mechanism for issuing a billing credit or discount to the agency if the bill for total impressions delivered according to the original campaign order and the automated under delivery fills exceeds a campaign budget.

A television playout system that handles playout of a channel, receives a video feed of the channel comprising programming data and a plurality of interstitial content items, and a playout schedule of the channel. Metadata comprising a pre-roll value is inserted at a first insertion point related to a first interstitial content item of the plurality of interstitial content items, based on the playout schedule. An offset is detected in the metadata, based on the first insertion point of the metadata in the video feed, the pre-roll value, and a time-code (TC) jump associated with a second interstitial content item in the video feed. One or more control parameters associated with the insertion of the metadata are calibrated, based on the detected offset to align a splice point related to the first interstitial content item with the TC jump associated with the second interstitial content item.

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.

The invention discloses an ACL (access control list) table insertion sequencing method. The ACL table insertion sorting method comprises the following steps: comparing protocol number range of every table, sequence every table according to size of the protocol number range, and give priority to sequence the table with small protocol number range. If the protocol number of the table is the same, comparing the original IP (internet protocol) address range in the table, and give priority to sequence the table with small original IP address range. The ACL table insertion sorting method can automatically sequence every table; configuration staff needs not to plan the order of every table in ACL in advance; when a new table is added, the ACL table insertion sorting method can automatically sequence according to the protocol number range in the table and the property of the other parameters and then insert to the ACL table.

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.

The invention provides an ordering method applicable to polar code decoding path split. The method comprises the steps of expressing PM (Path Metric) values of to-be-ordered paths through utilizationof vectors; interposing the paths in parallel; ordering elements in each gap in parallel; and outputting L paths with the minimum PM values. According to the method, in an ordering process after polarcode decoding paths are split, through utilization of the feature that original paths in a list are ordered, parallel dichotomy interposition ordering is carried out on the newly generated L paths and then the paths interposed at the same position are ordered. The average number of the paths interposed at each position is relatively low and the paths at each position can be ordered in parallel, so the ordering time delay and comparison times required in decoding based on successive cancellation can be clearly reduced, and moreover, the integrated time delay of the polar code decoding also canbe reduced.

The invention provides a layout method capable of automatically arranging insertion elements. In the method, firstly, a coordinate of an insertion point is obtained, and the insertion point represents the insertion position at which a selected element is pre-inserted into an element group, wherein the elements in the element group are arranged vertically or horizontally. Secondly, two adjacent elements of the insertion point are obtained from the element group according to the coordinate of the insertion point, and the putting angle of the selected element is consistent with that of the two adjacent elements. Thirdly, the pre-set movement distance can be calculated according to the size of the selected element and the putting mode of the selected element and the two adjacent elements. Fourthly, the elements in the element group are moved for the preset movement distance according to the arrangement mode of the elements in the element group, so as to form an enough space at the position pointed by the insertion point for putting the selected element. Finally, the selected element is moved to the spaced formed by moving the elements in the element group, and the central point of the selected element is aligned with that of the space.

The invention discloses a composite software filtering method and system applied to AD collection. The method comprises the following steps: taking N latest continuous measured values for sorting, andselecting a "half-insertion sorting" algorithm to obtain a group of arrays arranged according to a set sequence; processing the obtained arrays by using a median average filtering algorithm to obtainM preprocessed values; storing the obtained preprocessed values according to a timing sequence to obtain a group of arrays comprising M preprocessed values; respectively filtering M data within eachperiod by using an improved moving average filtering method to obtain a group of new arrays; and performing data smoothing processing on the new arrays. The composite software filtering method and system disclosed by the invention have the beneficial effects that the abnormal fluctuation of collected signals caused by external interference can be suppressed, the interference of external signals isavoided as much as possible, the error of data collection is reduced, and the stability of the system is improved.

The invention discloses an online article communication platform. The platform comprises a contribution value management module, an article management module and a user management module, The contribution value management module ranks contribution values of all the current users by using an insertion sorting algorithm every one hour, and transmits a ranking result to the user management module; The user management module gives different levels to the users according to the names or contribution values of the users; When a reader requests to load articles, the article management module loads article contents of different proportions according to different grades of the reader, and the higher the grade of the reader is, the higher the loading proportion is; A reader can select to only read the article content of the proportion or transfer a certain number of contribution values to an author to unlock the remaining article content according to the evaluation of the reader to the article.

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.

The embodiment of the invention discloses an implementation method for storing digital home videos, which comprises the following steps: acquiring a user command, wherein the user command comprises the list of programvideo contents and the priority of the program video contents; starting a video capturing module to capture the program video contents based on the user command; automatically naming the snapped program video contents based on the preset format; and storing the snapped video contents in a corresponding catalogue according to the insertion sort method based on the priority of the program video contents and the length of the snapped video contents. Correspondingly, the embodiment of the invention also discloses a system for storing digital home videos. The invention provides an application platform for users to manage and store videos, and the users can conveniently collect the favorite program contents thereof and can conveniently and effectively operate a digital home set-top box.

The invention provides a method and a system for processing a background image collected in a moving target detection, comprising the following steps: obtaining video images of successive frames, extracting successive frame data of multiple points in a fixed region in the video images of the successive frames, sorting the successive frame data of each point, extracting a median of the sorted sequence of each point, and obtaining the background image of a current frame. The technology further comprises the steps of obtaining a video image of a new frame, extracting data of the new frame of a plurality of points in the fixed region in the video image of the new frame, deleting the data of an oldest frame in the successive frames, carrying out insertion sorting for the data of the new frame, extracting a new median of the sorted sequence, and obtaining the background image of a current frame. The technology can be adapted to different background conditions, can also simply and fast calculate and efficiently prevent the incidence of vehicle motion trace residue in the background image, thereby enhancing the efficiency of the detection.

The invention relates to the technical field of three-dimensional reconstruction, and discloses a triangulation method and system for a planar point set in three-dimensional scanning, so as to improvethe triangulation speed of the planar point set in three-dimensional scanning, and better meet the requirement for real-time performance of three-dimensional reconstruction. The method includes acquiring three-dimensional coordinate points of a target object to be reconstructed, mapping the three-dimensional coordinate points into a planar point set, and traversing the planar point set to construct a target triangle containing all points in the planar point set; and assigning an edge pointer for a triangle, searching the target triangle according to a relation between an insertion point and the edge pointer till insertion of all the coordinate points are inserted, obtaining a final triangular mesh to realize the triangulation of the planar point set in three-dimensional scanning, and thenmapping the triangular mesh into a curved surface to performing fitting of the target object to be reconstructed.

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.

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.

The invention discloses a database insertion sorting method, comprising the following steps: step S1, updating the sorting number of the sorting field according to the size of the sorting number to bea continuous serial number starting from 1; Step S2, enlarging all the sequence numbers by N times, wherein N is an integer greater than or equal to 2; step 3, obtaining that sequence numbers of thedata to be insert and the reference data according to the unique key values of the data to be inserted and the reference data, and if the data to be insert is to be moved forward, modifying the sequence numbers of the data to be inserted into the sequence numbers of the reference data minus M; If it is necessary to move the data to be inserted backward, modifying the sequence number of the data tobe inserted into the sequence number of the reference data plus M, M being an integer greater than 0 and less than N; Step S4, according to the size of the sort number, updating the sorting number ofthe sorting field to be a continuous sequence number starting from 1. The invention only needs to know the unique key value of the data to be inserted and the reference data, and the moving directionto complete the data insertion sorting.

Provided is a color sorting machine capable of properly removing foreign mater even when the specific gravity of the object to be sorted is low. A color sorting machine MI removes foreign matter F in the object to be sorted being conveyed from a conveyance route G into a removal route R. The color sorting machine M1 is equipped with a supply portion 1 supplying the object to be sorted to the conveyance route G, a sorting portion 2 surrounding a sorting region R and partially formed by transparent walls 21a and 21b, a first conveying portion 3 surrounding the periphery of the conveyance route G to the sorting region R, a second conveying portion 4 hermetically surrounding the periphery of the conveyance route G from the sorting region R, a removing portion 5 hermetically surrounding the periphery of the removal route D extending from the sorting region R, an air intake port 32, a detection device 6 optically detecting the foreign matter F in the object to be sorted, a removal device 7 having an ejection port 72 hermetically inserted into the sorting portion 2, and a first suction device 8 provided in the second conveying portion 4 and sucking in the air in the conveyance route G to thereby generating an airflow heading for the second conveying portion 4 from the air intake port 32.

The invention discloses a sorting selection method and device based on external storage, external storage equipment and a storage medium, and the method comprises the steps: reading a local disordereddata sequence through the external storage equipment, and extracting an ascending keyword in the disordered data sequence; Determining a target sorting selection strategy according to the ascending keyword; And sorting the disordered data sequences according to the target sorting selection strategy, so that the memory space can be saved, the time for importing the data into the memory is shortened, frequent data writing operation in the sorting process of insertion sorting is avoided, the data reading and writing speed and efficiency are improved, and the user experience is improved.

A television playout system that handles playout of a channel, receives a video feed of the channel comprising programming data and a plurality of interstitial content items, and a playout schedule of the channel. Metadata comprising a pre-roll value is inserted at a first insertion point related to a first interstitial content item of the plurality of interstitial content items, based on the playout schedule. An offset is detected in the metadata, based on the first insertion point of the metadata in the video feed, the pre-roll value, and a time-code (TC) jump associated with a second interstitial content item in the video feed. One or more control parameters associated with the insertion of the metadata are calibrated, based on the detected offset to align a splice point related to the first interstitial content item with the TC jump associated with the second interstitial content item.

The invention provides a big data visualization processing method and a readable storage medium. The method comprises the following steps: carrying out data format conversion on data read from a datasource according to visualization requirements; preprocessing the converted data, wherein the preprocessing comprises sorting and filtering; gathering the preprocessed data into a data table for representation; and mapping data of different data dimensions in the data table into different attributes of a visual element by utilizing a scalable vector graphic map algorithm to form static and dynamicvisual graphs, thereby finishing visual view display of the data. According to the method, a visual data model is constructed, a field table driving algorithm, an optimized linked list insertion sorting technology, a mixed filtering technology, a scalable vector graphic map layout algorithm, an interaction technology and the like are introduced, and large-scale data analysis and visual display are realized.

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.

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.

The invention is suitable for the field of arithmetic and provides a simulation data processing method by means of a ranking method. The simulation data processing method by means of the ranking method comprises the following steps: a large amount of simulation data generated in a simulation experiment is obtained, and the simulation data are ranked by means of a sort-by-insertion ranking method. After the large amount of unordered simulation data is generated in a simulation mode, the unordered simulation data is ranked by means of the sort-by-insertion ranking method, so the unordered simulation data can be automatically ranked through a computer, and a large amount of manpower is not needed to rank the simulation data with manual work.

This invention provides one method to establish application to intelligent card composed of capacitor and subject memory data, which comprises the following steps: processing capacitor identifying according to order message data; if it passes, then establishing capacitor into capacitor entrance and analyzing subject label from order message to judge whether the current application entrance label is same; if yes, inserting the current analysis subject into current application entrance list for memory. This invention intelligent card can be suitable for each industries with one common flow.

The invention discloses a wind electricity data processing system of a wind power station. The wind electricity data processing system of the wind power station comprises a collection module and othermodules. The randomness generated by selecting a wind power series as input is eliminated by using mutual information, less time is used for completing data insertion sorting, and thus the validity of input data needed for modeling is improved, and the forecasting accuracy of a finally built model is improved.