53 results about "Sorted array" patented technology

Some embodiments implement a linear switching application that provides functionality for switching between different windows based on an x-axis ordering of the windows instead of the z-axis or other ordering of prior art. The linear switching application identifies an array of currently open windows and sorts the array based on the leftmost x-coordinate position of the windows in the array. Optionally, the linear switching application modifies the GUI to display window identifiers based on the leftmost x-coordinate position of each window to orient the user to the x-coordinate position of each of the windows on-screen. The application determines an index in the current x-sorted array for the window that is currently frontmost and changes the frontmost window based on the current frontmost window and a directional input provided by the user.

A method aligns a character to a sampling grid of an image. An original uniform width path that traces a s keleton of the character is specified by input pen commands having original coordinates. The width of the original path is rounded to a nearest integer to produce a hinted width. The original path is traversed using the input pen commands to identify segments of the path. The segments are stored in an array. Hinted coordinates are determined for each segment in the array. The array is sorted, and a directed acyclic graph (DAG) is constructed. Collisions between the segments are resolved using the sorted array, the DAG, and the width of the hinted path. The segments are fitted to the sampling grid, and the result is stored in output pen commands, thereby aligning the skeleton of the character to the sampling grid.

A system and method are disclosed for implementing dynamic set operations on data stored in a sorted array using a hybrid red-black binary search tree as a data structure. More particularly, the subject invention facilitates the implementation of a binary search to access data items stored in a sorted array by position, rather than by key value, as in conventional red-black trees. This is accomplished by generating a balanced red-black binary search tree for a sorted array of data items wherein the information stored at each node of the tree includes: a key value; a color; a left pointer to indicate the presence of a child to the left of the node; a right pointer to indicate the presence of a child to the right of the node; a count of descendents along a branch to the left of the node; and a count of descendants along a branch to the right of the node.

The invention discloses an abnormal traffic detection method. The method comprises the following steps: receiving messages; counting the number of the messages according to a message type, storing the number in an IP hash array, and storing traffic characteristics in the IP hash array; storing IP information of the messages whose number ranks are in the former N positions in a sequencing array, wherein N is a natural number; receiving new IP information, updating the IP information of the messages in the former N positions, and storing the IP information in the sequencing array; and in the updated sequencing array, checking whether messages of corresponding types occur abnormal traffic behaviors according to set characteristic values. By adopting the abnormal traffic detection method in the technical scheme of the invention, the problem that the current abnormal traffic detection method cannot solve report leakage and wrong report, the abnormal traffic detection method in the technical scheme can be used for calculating targets with traffic and other indexes ranking in former positions in the entire network in real time and detecting detailed behaviors of these targets to accurately and timely find attacks and greatly reduce the report leakage rate and the wrong report rate.

The invention relates to an improved average filtering algorithm for A/D (Analog to Digital) sampling. Data are collected by use of an MCU (Micro-programmed Control Unit), A/D conversion is carried out on the collected data, the data are stored in an array AD [N], wherein n is greater than or equal to 100. When sampling values stored in the array are full, the number of N is subject to bubble sort according to the sequence from small to big, front and rear N/5 data in the sorted array are removed, the remaining 3*N/5 are summed, an average value is taken to obtain a final sampling value. The algorithm can effectively eliminate an interference signal, especially the value which has great difference with the sampling value so that the final sampling value is very close to a truth value. Therefore, the software filtering method has the characteristics of easy realization, rapid response and high anti-interference and can effectively suppress noise.

Sorting an array consisting of large number of elements. The present invention provides an apparatus for executing a multiway merging process which generates one output sequence from N input sequences on an array consisting of a large number of elements. The apparatus includes: an input sequence production unit configured to produce an input sequence by pairing a key from an element for use in a comparison during sorting with an index identifying the element for each element or sorted array of elements; an execution unit configured to execute the multiway merging process on N input sequences without rearranging the elements based on which input sequences have been produced; and a generation unit configured to rearrange the elements constituting the input sequences according to an output sequence that has been generated by the multiway merging process in the execution unit so as to generate a sorted array of elements.

The invention discloses a data processing method and a device for astronomical software Gridding based on multi-thread parallelism, which is applied to a KNL platform. The method comprises the following steps of sorting an array-to-be-processed; dividing the sorted array-to-be-processed into a preset number of sub-arrays, and assigning each sub-array to a corresponding one thread by OpenMP; usingthe each thread to calculate the corresponding sub-array, and storing a calculation result in corresponding local grid arrays;merging the corresponding local grid arrays into image grid arrays serially by using all threads. According to the data processing method and the device for astronomical software Gridding,based on the existing MPI multi-process, combined with OpenMP, the multi-process and multi-thread parallelization calculation of the gridding program on the KNL platform is realized, which improves the computing performance. The write conflict problem of multi-thread data processing inthe Gridding program is solved, and the user experience is improved.

A data processing method and apparatus are provided. The method includes: determining a first memory page corresponding to a first Key carried by the read operation command after receiving the read operation command; Obtaining a first position offset represented by an element of the first array from a first sorted array corresponding to the first memory page, and determining a first memory elementin the first memory page corresponding to the first position offset; Judging whether the first Key and the life cycle corresponding to the first Key match the second Key and the life cycle recorded in the first memory element; If so, a data portion corresponding to the first Key is read from the first memory element. Through the technical proposal of the application, the traversal times can be reduced, the target memory element can be quickly read from a large number of memory elements, a large amount of time can be saved, and the page access speed can be improved.

The invention discloses a live broadcast room configuration file analysis method, a storage medium, electronic equipment and a system, and relates to the field of data analysis, the method comprises apreprocessing process and an analysis processing process, the preprocessing process comprises the following steps: obtaining a target configuration file, wherein the target configuration file comprises a plurality of information elements; creating a custom storage model, wherein the custom storage model comprises a plurality of storage elements; storing the information elements in the target configuration file into the storage elements in a one-to-one correspondence manner. The analysis processing process comprises the following steps that all storage elements in all the storage elements areextracted, a user-defined configuration model is generated, and the user-defined configuration model comprises a plurality of configuration model elements; each configuration model element of the custom configuration model is added to the custom sorting array to form a plurality of array elements; the array elements are sorted and fed back to the custom configuration model to form an instant configuration file. Configuration files are analyzed in a centralized mode, and the speed of analyzing the configuration files in the live broadcast room is increased.

A computer-implemented method includes receiving a spatial feature descriptor representing a binary string of comparison results between specified pairings of N patches in a region of an image, N being an integer greater than one. The method further includes compressing the spatial feature descriptor by determining a minimum number of bits needed to represent N, and generating a sorted array representing a ranking of the N patches based on the binary string of comparison results. Each element of the sorted array is associated with a corresponding patch of the N patches and stores a value representing a ranking of the patch relative to the other N−1 patches and coded using the minimum number of bits needed to represent N. The sorted array may be further compressed using a progressive bit representation decimation process.

The invention discloses a high-efficiency parallel simulation method for an electric propulsion plume plasma. The method comprises the following steps that: according to the adjacency matrix M of a grid node, generating an undirected graph; resorting the vertex of the undirected graph G, and numbering to obtain minimum bandwidth and the sorting array of a contour; and according to the sorting array, carrying out particle data structure design, and realizing the solving of a large sparse equation. Through the method, the solving operation of the large matrix and the vector of a large engineering flow field calculation problem is realized, calculation time in the numerical simulation process of the plasma plume is greatly shortened, and efficiency is improved.

Methods, systems, and computer-readable media are provided for providing generic database services within an EFI environment. A database engine is executed within an EFI environment that provides generic database functions on records having arbitrary data types. Database functions such as adding, deleting, and searching records may be performed by the database engine. The database engine utilizes a database structure for organizing the database that includes an initial count field for storing the initial number of records to be stored in the database, a record count field for storing the current number of records in the database, a key count field for storing the number of key fields in a stored data record, a key field for storing a pointer to a function for retrieving the value of a key field, and an index array field for storing a pointer to an index array. The index array is a sorted array of pointers to each of the data records in the database.

The invention discloses a method and system for realizing sorting of tree-shaped hierarchical structure report data, and the method comprises the steps: obtaining a sorting request from a column header region and a row header region, and constructing a sorting array according to the sorting request and a tree-shaped hierarchical structure report, wherein the sorting request comprises original datainformation and the original data information comprises row data under all levels or any level node in the tree-shaped level report corresponding to the column header region and column data corresponding to any region in the column header region; starting from a root node of the tree-shaped hierarchical structure report, marking serial numbers for the data lines, and storing data addresses and serial numbers of the data lines and values of sorting fields into a sorting array; according to the original data information, obtaining data corresponding to the original data information from the sorting array, and carrying out sorting according to values of sorting fields of the data; and writing the sorted data back to the data area.

The embodiment of the invention provides a data processing method, a device and electronic equipment. The method comprises the steps: obtaining a to-be-sorted array A, and enabling the to-be-sorted array A to comprise N elements with ciphertext values; carrying out n1 rounds of sorting on the to-be-sorted array A, wherein the following steps are executed in each round of sorting: to-be-sorted elements in the to-be-sorted array A in the current round are determined, and the to-be-sorted elements in the current round are elements except for one element with the determined position in the elements after the last round of sorting; sequentially performing ciphertext comparison on two adjacent elements A [i] and A [i + 1] in the to-be-sorted elements to obtain a corresponding ciphertext comparison result H; exchanging the positions of the two adjacent elements A [i] and A [i + 1] according to the ciphertext comparison result H so as to determine the position of one element in the elements tobe sorted in the current round of sorting; wherein the ciphertext comparison result H is a ciphertext of 0 or 1; and thus, the sorting of the ciphertext array is realized.