71 results about "Quicksort" patented technology

A method, system, and computer-readable storage medium are disclosed for building ray tracing data structures for three-dimensional scenes. The methods may include accessing an initial data structure representing a coarse hierarchy of a scene geometry, e.g., a scene graph, and sorting elements of the initial data structure into multiple spatial partitions with respect to one or more splitting planes. The sorting may be dependent on spatial bounding ranges of non-leaf nodes of the initial data structure, which may be sorted without visiting the geometric primitives below. Sorting may be performed on pointers to elements of the initial data structure and may comprise a hierarchical quicksort. The resulting ray tracing data structure may comprise a k-dimensional tree, binary space partitioning tree, k-plane tree, bounding interval hierarchy, or fine-grained hierarchical bounding volume tree. The methods described herein may accelerate the building of ray tracing data structures for use in interactive graphics applications.

Mechanisms for searching XML repositories for semantically related schemas from a variety of structured metadata sources, including web services, XSD documents and relational tables, in databases and Internet applications. A search is formulated as a problem of computing a maximum matching in pairwise bipartite graphs formed from query and repository schemas. The edges of such a bipartite graph capture the semantic similarity between corresponding attributes of the schema based on their name and type semantics. Tight upper and lower bounds are also derived on the maximum matching that can be used for fast ranking of matchings whilst still maintaining specified levels of precision and recall. Schema indexing is performed by ‘attribute hashing’, in which matching schemas of a database are found by indexing using query attributes, performing lower bound computations for maximum matching and recording peaks in the resulting histogram of hits.

A computer-implemented data sorting method for sorting data at high speed with small memory capacity. The sorting method sorts an array of data where sorted data is constituted by a combination of a plurality of blocks where each block is produced separately from one another during the sorting process. In another aspect, a navigation method and system utilizes the data sorting method for quickly sorting and displaying requested information such as POIs sorted by distance with use of a small memory.

A data mining and knowledge discovery method and system. A data base is established in a virtual matrix form for each transaction of large scale transactional events. Data is filed and logged in a manner for rapid sorting such that given a set of identifiers for comprised transactions, a limited subset of the matrix only need be accessed for specific knowledge discovery in the nature of point-of-compromise. For each potential point-of-compromise, a tally is compiled. Potential points-of-compromise are sorted according to tally score. Score is indicative of increasing likelihood of a source point-of-compromise.

The invention provides a fast retrieval method based on an inverted technology. The method comprises the following step of: 1, taking out all pieces of data which meet requirements of a corresponding centre from an inverted table by using geometrical consistency according to a quantization table to form a data set A; 2, quickly sorting the data in the data set A and counting the occurrence frequency of the data by using an array-based bucket sorting method; 3, calculating matching rate according to content consistency, and filtering out interference data to obtain a data set B; and 4, according to an accuracy requirement, in the data set B, quickly searching an optimum set C as an output result. By the method which is quite high in operating speed, the data which is concerned by a user can be quickly and accurately found in disordered mass data, and the accuracy of a query result can be adjusted according to practical application. In the method, time complexity is O(n), relevant to the scale n of the data set A and irrelevant to the scale of a total data set, so that query efficiency is greatly improved.

The invention discloses an optimal controlling method for boiler intelligent combustion based on big data. The method comprises the following steps that firstly, the DCS data of a unit is collected and processed to form neural network training samples, and then a combustion optimization neural network model is established according to the training samples; then combustion parameters are optimizedby using multi-objective non-dominated fast sorting genetic algorithm (NSGA) according to the combustion optimization neural network model; and finally, optimization bias is calculated according to the optimized combustion parameters and sent to a DCS for realizing closed-loop optimization control. According to the optimal controlling method for boiler intelligent combustion based on big data, because the big data is adopted and the data of boiler ash blowing conditions is eliminated, the quality of the combustion optimization neural network model is improved; the optimization performance andoptimization effect are improved by adopting the multi-objective genetic algorithm optimize combustion parameters, and the optimal controlling method can adapt to the various optimization requirementsin practical application; and in addition to the boiler efficiency and the flue gas NOx emission of the optimizing objectives, the temperature difference index of smoke on both sides of a chamber outlet is further considered, and the optimal controlling method is more suitable for practical application of engineering.

The invention relates to an O(n log n) recursive, comparison based sorting algorithm that uses multiple pivots to effectively partition a list of records into smaller partitions until the list is sorted. The algorithm is intended for use in software. This sorting method is accomplished by choosing pivot candidates from strategic locations in the list of records, moving those candidates to a section of the list of records (ie back or front of the large list) and sorting this small list. Then, the invention selects pivots from the pivot candidates and partitions the list of records around the pivots. Multiple Pivot Sort may be viewed as the next generation of Quick Sort, and average sorting times on unique random integer lists have beaten times by established algorithms like Quick Sort, Merge Sort, Heap Sort, and even Radix Sort.

The invention is applicable to the electronic digital data processing field in a computer system, and provides a data processing method and a system thereof. The data processing method comprises the following steps of: establishing an assistant array; judging whether the pre-set assistant array is sufficed to store data series or not, if so, carrying out bitmap ordering to the data series, if not, adopting quick ordering to divide the data series into a plurality of grouped data; and judging whether the assistant array is sufficed to store the grouped data or not, if so, carrying out bitmap ordering to the grouped data, if not, adopting quick ordering to divide the grouped data into a plurality of new grouped data and carrying out cyclically until the assistant array is sufficed to store the grouped data. Combining the bitmap ordering with the quick ordering, the data processing method and the system improve the data ordering performance by using bitmap ordering to groups with compact data in quick data ordering and grouping processes.

The invention provides a workpiece intelligent scheduling production scheduling method based on a genetic algorithm. The method comprises the steps of randomly generating an initial population according to order data, and randomly combining an order number, a to-be-processed process, a processing machine and an operator list in the initial population to obtain a first initial population; accordingto a preset time sequence rule, setting starting time of the to-be-processed process in the first initial population to obtain a second initial population; sequentially performing first quick sortingprocessing, crossover operation processing, mutation operation processing and second quick sorting processing on the second initial population to obtain a new initial population, and decoding order data in the new initial population to obtain a scheduling plan; calculating the fitness corresponding to the production scheduling plan according to the production scheduling plan and a preset fitnessfunction; and when the fitness meets a preset optimal condition, outputting the production scheduling plan as an optimal production scheduling plan. According to the workpiece intelligent scheduling production scheduling method based on the genetic algorithm, the obtained optimal production scheduling plan is more accurate.

The invention provides a quick target association method based on the clustering analysis. The quick rapid target association method aims at reducing the unnecessary times of comparison between target positions and attributes, and improving the timeliness of target association on the premise that the association result is not affected. According to the scheme, the method comprises the steps: firstly, constructing a structural body array for storing information of two sub-source targets to be associated at the same time, and marking sub-source serial numbers, information addresses and association status; secondly, utilizing quick position coordinate sorting method and a quick attribute clustering method for conducting recursion quick sorting and quick clustering on the targets to be associated in the structural body array according to position components and attribute information on the basis of the set priority level relation, and constructing a spatial index tree; under the support of the spatial index tree, adopting a density-based clustering algorithm to conduct recursion clustering on the two targets which are measured by sub-sources, are adjacent in position and are the same in attribution; after the sum of sub-sequence targets is smaller than the preset value or when unused attribute information does not exist, converting into a one-by-one comparison association method to complete target association judgment.

The invention discloses a quick sorting and optimized scheduling method of approach flights based on a composite dispatching rule. The method comprises the following steps: step 1: constructing a cost-based approach flight sorting model; step 2, designing the composite dispatching rule to obtain a landing sequence; 3. assigning a landing time meeting constraint conditions to each flight accordingto the obtained sequence by using a CPLEX optimization solver, so that the total cost is minimal. By adoption of the method, the approach flight delay cost can not only be reduced, the utilization efficiency of airspace resources is improved, furthermore, the method is convenient to implement and is good in real-time performance.

The invention provides a running route retrieval method of a moving object in a navigation system, which can perform the retrieval of the running route of the moving object by using an algorithm of A<*>, and simultaneously sort nodes of an open catalog rapidly, and thus, the retrieval time is shortened. In the method, nodes of departure places and destinations of the moving object are input according to the search instruction of the running route, and the nodes of departure places are moved in the open catalog. Then, the nodes of departure places, which are moved in the open catalog, are set as the best nodes and then are moved in a closed catalog, and subsequent nodes of the best nodes are generated. After that each generated subsequent node is moved in the open catalog, and simultaneously whole charges of an elicitation type evaluation function are calculated. The node of the fewest whole charge of the elicitation type evaluation function is set as the best node, and then the action of moving the best node to the closed catalog is carried out repeatedly until the best node reaches the node of the destination.

The method includes at least following steps: based on content of phone book, decomposing name, name of company, or other items in help for query corresponding to each phone item; decomposing English letter, digit, and compound body into relevant digit and English letter, and decomposing Chinese letters into Chinese spelling; then collecting decomposed result to build database of phone book; next, in certain time period, pushing button N (N is larger than and equal to 1) times, when determining the pushed button is one from 0 to 9 digit buttons, converting the pushed buttons to corresponding digits, English letters and Chinese spelling in sequence according to rule; then, carrying out permutation and combination for the converted result so as to form a series of character string. Searching database of phone book is carried out based on the converted character string, and quick sorting phone list based on searched result in order to reach purpose for looking up phone number quickly.

The invention discloses a metamorphic relation testing priority ranking method based on quantitative measurement. The method includes: based on testing coverage, measuring in-degree of input relations of metamorphic relations, measuring complexity of output relations, and measuring spacing of relevant test inputs of the input relations to obtain three effectiveness metric units for the metamorphic relations. When results of the three effectiveness metric units are inconsistent, ranking is performed according to PIR (InD(IR)) > PIR (AC(OR)) > PIR (Dis(IR)). Through the application of the three metric units, metamorphic relation testing priorities can be quickly ranked without prior test execution. The metamorphic relation testing priority ranking method based on quantitative measurement has the advantages that quantitative basis is provided for the effectiveness measurement of metamorphic relations, feasible means is provided for setting testing priorities; through the application of quantitative measurement, the method compared to traditional experiential conclusions is simpler, more accurate and more feasible, the application range of priority design is guaranteed, and the precise, effective method is provided for the selection and ranking of metamorphic relations.

The purpose of the invention is to provide a laser range finder-based method for determining a relative position between two boats. The method comprises the following steps that: a laser range finder is installed on a rescue boat; when the rescue boat approaches in parallel a rescued boat, the laser range finder is installed in the middle of the left and right gunnels of the rescue boat and scansan angular bisector of an open angle, wherein the angular bisector is perpendicular to a central axis of the rescue boat; and when a stern of the rescue boat approaches the rescued boat, the laser range finder is installed on a gunnel of the stern of the rescue boat and scans an angular bisector of an open angle, wherein the angular bisector is superposed on a central axis of the rescue boat; data of all azimuthal angles are real-time measured by the laser range finder and the data is processed by eliminating gross errors; median filtering processing is carried out on the data that has been processed by eliminating the gross errors by utilizing a quicksort method; and a relative position between the rescue boat and the rescued boat is obtained by employing sine and cosine theorems. According to the invention, a laser range finder, which is utilized as a measuring sensor, has advantages of high precision, good real-time performance and large measuring range, so that a measured result can meet a tracking requirement.

The invention discloses a method and a device for realizing network node sorting. The method comprises the following steps: obtaining to-be-sorted network nodes of which the number is not greater thanN, wherein N = 2<n>, and n is a positive integer; generating an N * N-dimensional adjacency matrix A according to the interaction relationship among the to-be-sorted network nodes; determining an out-degree Dout and an in-degree Din of the adjacent matrix according to the adjacent matrix A; according to the adjacent matrix A, the out-degree D<out> and the in-degree D, calculating an Hermitian matrix E and b<arrow>, wherein the Hermitian matrix E = [D<out> + D - (A + A<T>)], and b<arrow> = [D<out> - D]1<arrow>; and according to the value of the Hermitian matrix E and the value of the b<arrow>,outputting a quantum state S<*> containing a sorting result of the to-be-sorted network nodes by utilizing a quantum circuit corresponding to an HHL algorithm, wherein E, S<*> and b<arrow> meet a relationship that ES<*> = b<arrow>. The large-scale network node sorting efficiency can be improved, quick sorting of large-scale network nodes is achieved, the calculation amount of quantum circuits corresponding to the HHL algorithm is reduced, and the calculation efficiency of the quantum circuit is improved.

The invention discloses a method and a system for sorting channels of a digital television based on viewing duration. The method comprises the following steps that a server obtains channel data of all current digital televisions connected to a server; the server obtains a sorting weight corresponding to each television channel according to the viewing duration of all channel data and stores the sorting weight; the digital television uploads the channel data thereof and carries out validity detection on the server; when passing the validity detection, the server queries the sorting weight of each television channel according to the channel data, sorts the television channels according to a sorting weight value, and returns a sorting result to the digital television after optimization for high-definition channels and user language preference; and the digital television re-sorts all channels according to the sorting result and stores a new channel sequence. According to the method and the system, the channels can be quickly sorted, and the habits of the user for viewing the high-definition channels and the specific language channels are considered during sorting in order to provide convenience for the user.

The invention discloses a quick sorting and searching device for a high-capacity lookup table and a method for implementing the quick sorting and searching device. The quick sorting and searching device is provided with a pre-sorting module, a control module, a tag searching module and a sorting module. Searching matches with sorting, the priority of searching is higher than that of sorting, sorting can be interrupted to start searching while sorting is carried out when searching is not required, and a searching result cannot be affected by interrupted sorting operation. Besides, addition sorting operation and deletion sorting operation are carried out by a method based on pre-sorting, a streamline four-section partitioned searching method is used for searching tags, utilization efficiency of a cycle is improved, and searching efficiency and speed are high. In addition, the quick sorting and searching device and the method not only can be used for searching the tags, but also can be used for searching other optional keywords.

The invention relates to a method for evaluating operation reliability based on quick sorting and a block matrix. The method comprises the following steps: Step S1, establishing a time-varying failurerate model, and respectively calculating the failure rates of a transformer, a line and a switch considering the influence of an equipment life cycle and weather factors; Step S2, using a quick sorting method to perform descending sorting on element failure rates, and screening to obtain the first 80% of element failure rates; S3, using a block algorithm to perform blocking on the first 80% of element failure rates obtained by screening, storing block information, and searching a block link matrix according to failure blocks; and Step S4:making statistics of reliability indices of load pointsand a system of each simulation year, and obtaining average values which are the reliability index values of the load points and system. The method for evaluating operation reliability based on quicksorting and a block matrix effectively combines the advantages of the rapidity of the quick sorting method and the blocking algorithm and the processing of a complex system and the time sequence of asequential Monte Carlo simulation method, thereby forming an effective distribution system reliability evaluation algorithm, and thus can quickly and effectively calculate a distribution system reliability index.

The invention discloses a pyramid sorting algorithm. According to the pyramid sorting algorithm, firstly, an integer m being integral power of 2 is found, and n is larger than m / 2 and smaller than or equal to m; then n data required to be sorted are placed into a b array; adjacent data in the b array are compared one by one, and relatively larger subscripts are placed in a (m / 2)-(m-1) unit of a c array; adjacent data in b[c[m-1]]-b[c[m / 2]] are compared one by one, relatively larger subscripts are placed in c[m / 2-1]-c[m / 4], and so on; finally, subscripts of maximum data of the whole b array can be placed in c[1]; then maximum values in the b array are found out continuously, and sorting is completed. Under the condition that to-be-sorted sequences are basically sorted, the sorting speed of the pyramid sorting algorithm is obviously superior to that of quick sorting; under the condition that to-be-sorted elements adopting a more complicated data structure are sorted, the sorting speed of the pyramid sorting algorithm is obviously superior to that of heap sorting.

The invention relates to an enterprise website aviation price ratio searching method based on a SaaS (software as a service) mode, which is characterized by including the steps: firstly, installing a server certificate on an enterprise website server; secondly, enabling an enterprise user to invoke an interface of aviation price ratio searching software, and quickly sequencing transmitted parameters; thirdly, generating message digests for the sequenced parameters by means of an MD5 (message-digest algorithm 5); fourthly, enciphering the sequenced parameters and the message digests by means of an SSL (secure socket layer), and transmitting the enciphered sequenced parameters and the enciphered message digests through a network; fifthly, performing SSL deciphering of the transmitted information, generating message digests for the transmitted plaintext information by means of the MD5, and comparing the message digests for the transmitted plaintext information with the transmitted message digests; sixthly, using a SaaS platform to return structured data according to the searching parameters transmitted by the enterprise user; and finally, presenting the data to a terminal user by the enterprise user. Therefore, small-sized and medium-sized enterprises don't need to individually maintain one aviation price ratio searching software, money, trouble and labor are saved, and fixed asset investment is reduced.

An embodiment of the invention provides a sorting method and a sorting device for tables, a WEB page displaying method, a WEB page displaying device, electronic equipment and readable storage medium of a computer. The sorting method for the tables can include: acquiring various elements in a to-be-sorted table; comparing the elements in same target columns among lines in the to-be-sorted table so as to obtain a comparison result; based on the comparison result, sorting the elements in the to-be-sorted table according to a preset sorting manner. The sorting method has the advantages that the technical problem of how to sort quickly is solved, table sorting can be realized in a WEB page at the network front end directly, sorting in network background is omitted, the problem of occupying a great amount of resources in the background is avoided, and table sorting speed in the WEB page is increased as compared with that of a method for sorting in the background by adopting SQL (structured query language).

A non-recursive clustering algorithm based on quicksort (NR-CAQS) suitable for large data belongs to the technical field of data mining. The algorithm is characterized by using a two-layer circulation to realize data clustering, defining two positioning pointers in advance, randomly selecting one benchmark data to be viewed as representative data of a cluster from a data sequence, and exchanging to the rightmost side of the data to be processed, and simultaneously defining a scanning process pointer and initializing, scanning the data to be processed and calculating a similarity value of residual data and the benchmark data, and comparing with a user threshold, adjusting the position of the residual data in a sequence according to the comparison result, exchanging the data whose similarity value is more than the user threshold to the left side of the sequence, and exchanging the data whose similarity value is less than the user threshold to the right side of the sequence to finish data partitioning, finally resetting the positioning pointer, positioning new data to be processed and returning to a outer circulation to continuously execute until total data sequence clustering is finished. The algorithm is applied to cluster spherical data and a large data set which has high time requirements.

The invention provides a distributed multi-ground station ADS-B data fusion method. The method comprises the following steps that (1) a ground station receives ADS-B data through an ADS-B receiving module; (2) the ground station forwards the received ADS-B data to a data center; (3) after the data center receives the ADS-B data, data verification ia made through a data verification module; (4) after effective ADS-B data is obtained in multiple places, the effective ADS-B data is sent to a data deduplication module for processing; (5) the ADS-B data by the sorting node is sorted by adopting algorithms such as a rapid sorting algorithm or a merging sorting algorithm and the like, and then the data is handled to a fusion data summarization module for processing; and (6) the fusion data summarizing module outputs the data, and the data is processed by other modules. According to the invention, a distributed architecture is utilized, ADS-B data of multiple aircrafts and multiple ground stations are fused, high-precision, low-delay and reliable ADS-B data is obtained, a data center has high-throughput and low-delay data processing capability, and resources such as calculation and storageare effectively utilized.

The invention discloses a personalized hotel intelligent recommendation algorithm based on customer behavior habit preference, and relates to the technical field of hotel management. The algorithm comprises steps of determining a hotel recommendation index for the client; Constructing an algorithm input matrix according to the recommendation indexes; Acquiring data required by the recommendation index; Preprocessing the first four lines of data; Processing the pre-processed first four index data by using a pca algorithm to obtain corresponding characteristic values and characteristic vectors;Selecting a recommendation strategy according to the size of the characteristic value; Using quick sorting as a specific sorting method; Wherein the ranked distances or the pca scores correspond to which hotels in the original data are determined. The problem of personalized recommendation for customers is solved; And a fifth index 'spacing distance' is added to assist decision making under a special condition, so that an algorithm is closed.

The invention relates to a predistortion head up display image anti-aliasing method based on edge direction correlation and belongs to the field of digital image processing. The method includes usingFIFO for row buffering and column buffering of an input DVI image, and extracting 9 pixel values in a 3X3 window; using a quick sorting method to find a maximum value and a minimum value for 9-point pixel data in a template window; using maximum and minimum values in a 3X3 template to determine the correlation of data in a template, and distinguishing an edge region and a non-edge region of the image; for the edge region of the image, using a direction template to determine the edge direction and then performing the weighting process after the distance parameter normalization; for the non-edgeregion, performing direct delay output, and causing the delay time to be consistent with the anti-aliasing processing time; and finally performing gray-scale transformation on overall character images by utilizing a segmentation function curve according to inherent characteristics of a head up display raster image. According to the method, the display quality of the head up display raster image can be improved as a whole, and the gray scale loss and the brightness loss caused by the anti-aliasing process are reduced.

The invention relates to the technical field of advertisements. The invention relates to an intelligent sorting algorithm for advertisements. the algorithm comprises adopts the steps of order sorting,processing specified location advertisement, processing unspecified location advertisement, determining sorting parameter, final order adjustment and interstitial advertisement to reasonably sort theadvertisement order, thereby avoiding the phenomenon of repeated advertisement or missed advertisement. And the continuous broadcast of multiple advertisements of the same type, through the machine to convert the first five days of sorting parameters, so that the tandem list can be quickly sorted.

The invention provides a multi-target scheduling method for minimizing delivery time and delay of high-end equipment, and relates to the technical field of task scheduling. After the parent population is generated, the parent population is divided into a plurality of small populations, different quick sorting and crowding degree calculation rules are set for the plurality of small populations, the plurality of small populations can intersect in the evolution process, excellent genes in individuals can be spread among the populations. The whole population is effectively prevented from falling into a local optimal solution, the search range of the optimal solution is expanded, and the effect of the optimal scheduling scheme is effectively improved. Through the method provided by the invention, the development project collaborative scheduling problem of minimizing the project delivery time and delivery delay is effectively solved, the delivery time and delay time of multiple projects are shortened, and meanwhile, a good decision basis can be provided when an enterprise makes a plan.

The invention discloses a local core point clustering algorithm based on parallel natural neighbors. The local core point clustering algorithm comprises the following steps of S1, carrying out KD-treeconstruction on data set by adopting a rapid sorting method; S2, obtaining neighborhood information of each data object by adopting a parallel natural neighborhood search algorithm; S3, obtaining a local core point by calculating the density of each data object; S4, calculating the distance between the local core points; S5, constructing a decision diagram, and realizing clustering of local corepoints; S6, distributing non-local core points, and achieving clustering of the data set. Through the algorithm, the distance between the local core points based on the shared neighbors is defined, and the efficiency of the clustering algorithm is improved.