96results about How to "Reduce the number of traversals" patented technology

The invention relates to a rule conflict detection method and system aimed at a large-scale packet classification rule set. The method includes the first step of receiving and analyzing a rule, the second step of dividing the analyzed rule into a full-prefix rule, a non-full-prefix rule and a non-prefix rule, the third step of organizing a full-prefix rule set in a source IP and target IP double-layer hash table HSIP-DIP or in a target IP hash table H*-DIP and correspondingly adding or deleting or inquiring the rules in the HSIP-DIP or the H*-DIP, the fourth step of organizing a non-full-prefix rule set in a source IP and target IP double-dimension Tire tree TSIP-TDIP and adding or deleting or inquiring the rules in the TSIP-TDIP, the fifth step of organizing a non-prefix rule set in a link table L*-* and adding or deleting or inquiring the rules in the L*-*, and the sixth step of traversing each rule in the HSIP-DIP, each rule in the H*-DIP, each rule in the TSIP-TDIP and each rule in the L*-* to serve as detected rules and detecting all rules which conflict with the detected rules. The rule conflict detection method and system solve the problem that in the prior art, a rule conflict algorithm has defects.

The invention provides an index method for a main storage database based on a T-lt tree, improving the defect of the T tree, adding a tail pointer on each node of the T tree which directly points to a successor of the node to form a T-lt tree. The index method comprises a database inquiring operation, a keyword insertion operation and a keyword deleting operation. The node structure of the T-lt tree has one more tail pointer than the T node. If the node has a tail node, the tail pointer points to the tail node. If the node has no tail node, the tail pointer directly points to the successor. The tail node of the T-lt tree has one more pointer which directly points to the successor than the T node. The method reduces the traversal number to the tree, decrease the rotation number of the tree, can improve the inquiring efficiency in the main storage database and saves the space time spending.

The invention relates to the mobile communication technology, in particular to a low-complexity spatial modulation system detecting method. The method mainly includes the steps that specific subsets are selected from a constellation symbol neighbourhood, first-time traversal search is carried out, so that bit information for activating a transmitting antenna is determined according to selected M minimum Euclidean distance results, or the quadrant where a transmitting symbol is located is determined according to the quadrant where the symbol corresponding to the combination with the minimum Euclidean distance is located, and then secondary search is carried out. First-time traversal search is performed on selection of the specific subsets of four quadrants, the number of possible detection sending signals of search can be reduced, so that detection complexity of a receiver is effectively reduced, and good detection performance is obtained under the condition of low complexity. The detecting method is particularly suitable for a spatial modulation system.

The invention discloses a hyperspectral remote sensing image classification method combined with quick region growth superpixel segmentation. According to the method, superpixels are generated througha region growing method; wherein a distance map is constructed, the generation of superpixels is accelerated; a super-pixel segmentation image and a pixel-based hyperspectral classification image aresubjected to texture adaptive fusion; according to the hyperspectral image classification method, the problem that the classification precision is not high due to the fact that superpixels serve as one unit in a traditional hyperspectral image classification method based on the superpixels is solved, the hyperspectral image classification precision is improved, and the hyperspectral image classification method has important practical significance in the aspects of environment management, crop monitoring, mineral mapping and the like.

The invention discloses a processing method and device of big-field data. The method comprises the following steps: receiving a processing instruction of processing the big-field data, wherein the big-field data are stored in a specified database list in a fragmentation manner; and determining a data page linked list formed by data pages for storing the big-field data, and processing the big-field data in the data page linked list according to the processing instruction, wherein a big-field control page exists in the data page linked list and comprises fragmentation information formed when the big-field data are stored in the fragmentation manner. By the processing method, data to be processed in the data page linked list can be specifically positioned quickly by a positioning means corresponding to fragmentation type storage. Compared with an existing method, the processing method has the characteristics that the amount of traverse to the data pages during processing is reduced greatly, input and output costs during processing of the big-field data are reduced, and integral processing efficiency of the big-field data is improved.

The invention provides a micro-expression recognition method based on the main direction of optical flow, which comprises the following steps: interpolating a micro-expression sequence formed by framing a micro-expression video; positioning the eyes and nose of each frame, and calculating the position of the middle point of the eyes as the origin of the coordinate axis; calculating the distance dem and dmn from the origin of the coordinate axis of each frame to the center of each eye and the nose; constructing normalized mesh according to dem and dmn; calculating the optical flow direction ofeach pixel region in all adjacent frame grids and clustering to obtain the optical flow main direction; a rectangular characteristic region being formed in the main direction of the optical flow, andthe pixel region in the main direction of the optical flow being assigned with weight coefficients to obtain the optical flow field optimized by adjacent frame grids, and the curves formed by connecting the related data drawing points being smoothed to obtain the global optical flow field; the pixel region in the main direction of the optical flow being assigned with weight coefficients. A training classifier inputs each optical flow characteristic region and compares the sum of similarities between the traversed-level microexpression sequence and the trained microexpression sequence with S toobtain a classification result.

The invention relates to a transformer station pointer type instrument identification method based on angle step length and belongs to the instrument identification technology field. According to the method, a Hoff gradient method is employed to extract a circular scale contour, a matching traversal point P is selected on the to-be-detected circular scale contour, a corresponding dynamic ROI of the matching traversal point P and an Hu invariant moment of the dynamic ROI are acquired, image similarity is calculated according to the Hu invariant moment of the dynamic ROI and an Hu invariant moment of a pointer template, after the largest image similarity is acquired, the position of a pointer on a to-be-detected pointer instrument image can be determined, a pointer reading corresponding to the to-be-detected pointer instrument image can be acquired according to the pointer position, a scale of the to-be-detected pointer instrument image and corresponding measuring range relations, traversal matching is carried out through employing the angle step length, plenty of irrelevant area matching searching can be avoided, traversal frequency is substantially reduced, and identification precision and reliability are improved.

The invention provides a game map time-division broadcasting method. The method includes the steps that information needing sending of players is managed on game maps in units of blocks, and a server disperses flow and processing time through time slice division broadcasting; blocks surrounding the players are traversed only when the players log in, move and span blocks, the players needing sending are buffered in units of blocks, time-division broadcasting is conducted, and only a certain number of players are sent every time; the server can manage deletion of the players to avoid inconsistence of client sides and the server; certain time is distributed for each map, and broadcasting of the players stops processing of the game maps if processing of each map is not finished after certain time; due to complexity of the game map, broadcasting information of some players can probably be accumulated for a long time, and at the moment the server can consider about of abandoning the broadcasting information. Through the method, safety of the game server can be effectively improved, execution efficiency of the game server is improved, and experience of the players is improved.

The invention discloses a method and a device for traversing a timer, relates to the technical field of the Internet and is invited for solving the low traversing efficiency of the timer. The method comprises the following steps: constructing a timer binary tree, wherein the node numerical value of the timer binary tree is the arrival time moment value of the timer, the subnode of which the node numerical value is greater than a father node numerical value is the right subnode of the father node, and the subnode of which the node numerical value is smaller than the father node numerical value is the left subnode of the father node; traversing from a root node, and searching a target node of which the node numerical value is smaller than or equal to a current moment value; and closing the timer corresponding to the target node. The method is mainly used for traversing the timer used by a server memory.

The invention discloses a self-adaption rapid video coding method based on a variance. The method comprises the following steps of calculating a variance of a current frame CU; according to the variance of the current frame CU, using a PU dividing-mode rapid decision algorithm based on the variance to carry out PU dividing mode detection so as to obtain a PU dividing mode with minimum rate distortion cost and optimum rate distortion cost of CU non-division; according to the variance of the current frame CU, using a CU dividing-mode rapid decision algorithm based on the variance to carry out CU dividing decision and determining a CU dividing mode with the minimum rate distortion cost; coding according to the PU dividing mode with the minimum rate distortion cost and the CU dividing mode. In the invention, the PU dividing-mode rapid decision algorithm based on the variance and the CU dividing-mode rapid decision algorithm based on the variance are combined to carry out CU and PU dividing mode selection; a coding complexity is greatly reduced, a coding speed is increased and the method can be widely used in a video coding field.

The invention provides a jump source list processing method, a jump source list processing device and a compiler. The jump source list processing method includes that identify of a jump target which corresponds to n jump instructions is acquired, wherein the n is a positive integer larger than or equal to 2; the identify is taken as a pointer pointing to a delay slot behind each jump instruction in the n jump instructions, and the corresponding jump instructions are stored in address information in a code buffer area when the pointer points to the delay slots. The jump instruction address information in a jump source list is stored in the delay slots, so that memory overhead caused by the fact that a special space is arranged in a memory to store the jump instruction address information of the jump source list in a list structure mode can be avoided; after the address of the jump target is determined, modification of the target address of the n jump instructions can be completed in the code buffer area through one-time traversal; compared with the prior art, the jump source list processing method has the advantages that the number of times of traversal in modifying the n jump instructions according to the address of the jump target can be reduced, and execution efficiency in improving the n instructions can be improved.

Embodiments of the invention disclose a data processing method and apparatus. The method comprises the steps of obtaining multiple pieces of to-be-processed data; defining the to-be-processed data in a plurality of preset intervals; determining approximate values of the to-be-processed data in the intervals; and according to the approximate values, determining quantiles corresponding to the to-be-processed data. By utilizing the method and the apparatus, the approximate values are used for replacing the numerical values of the to-be-processed data defined in any interval, so that the quantity of data participating in a calculation process can be reduced. Therefore, the traversal frequency during quantile calculation can be reduced; the I/O operation on a database can be further reduced; and the efficiency of the quantile calculation process can be improved to a certain extent.

The invention discloses a method for quickly positioning a damaged QR code according to image redundancy information. The method comprises the following steps: performing gray processing on a picturecontaining the QR code; carrying out definition evaluation on the grayscale picture; performing filtering and edge detection on the grayscale picture; determining three positioning patterns of the QRcode according to the width ratio of the stripes; performing adaptive binarization on the QR code region in combination with the size of the positioning pattern; and searching four edges of the QR code through affine transformation, and finally performing positioning correction by using homography transformation. According to the method for quickly positioning the damaged QR code, redundant information in the image is fully utilized, the image traversal frequency is reduced as much as possible, and the algorithm speed is increased; self-adaptive threshold edge detection and self-adaptive threshold binaryzation are adopted, so that the edge detection and binaryzation effects are improved; unclear images are filtered, and excessive waste of computing resources can be avoided.