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 discloses an HEVC intra-frame prediction coding method and system, and belongs to the technical field of the video coding technique. The method comprises the steps that each image frame is segmented into largest coding units (LCUs) which are not overlapped; the area smoothness of a current LCU is calculated; the similarity between the current LCU and an adjacent LCU is calculated; self-adaption depth prediction is performed according to the similarity between the current LCU and the adjacent LCU; the depth of the current LCU is determined according to the smoothness of the current LCU and the similarity between the current LCU and the adjacent LCU, and coding is performed according to the depth of the current LCU. By the adoption of the HEVC intra-frame prediction coding method and system, CU partition is stopped in advance by early stopping prediction or a certain layer of partition is omitted; meanwhile, as the number of intra-frame prediction modes in an RDO process is reduced in a PU layer, a CU layer and the PU layer are optimized and integrated together, implementation complexity can be reduced, and HEVC intra-frame prediction time is greatly shortened.

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 trajectory planning method and device, electronic equipment and a storage medium, and relates to the field of automatic driving. The trajectory planning method can be appliedto the field of automatic driving, in particular to the field of automatic parking. The specific implementation scheme includes the steps: carrying out clustering analysis on obstacle information around a target parking space to determine first obstacle information and second obstacle information; determining an initial trajectory midpoint of the target vehicle entering the target parking space according to the first obstacle information; according to the target position of the target vehicle in the target parking space, the initial trajectory midpoint and the first obstacle information, generating a first trajectory between the target position and the initial trajectory midpoint; according to the current position of the target vehicle, the initial trajectory midpoint and the second obstacle information, generating a second trajectory between the current position and the initial trajectory midpoint; and controlling the target vehicle to reach the target position according to the firsttrack and the second track. According to the technical scheme of the embodiment of the invention, the consumption of computing resources can be reduced, and the trajectory planning speed is improved.

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 discloses a method and a device for processing fragment data packets. The method comprises steps: fragment data packets of an IP message is received, a corresponding chain table is acquired according to the address information of the IP message, one or more nodes exist in the chain table, each node is corresponding to one or more sequentially-cascaded fragment data packets, the first offset of each node is the fragment offset of the first fragment data packet corresponding to the node, the second offset of each node is the sum of the fragment offset of the last fragment data packet corresponding to the node and the fragment length of the last fragment data packet, a new node corresponding to the fragment data packet is built, the first offset and the second offset of the new node are set, the target position of the new node in the chain table is determined according to the first offset and / or the second offset of the new node and the first offset and / or the second offset of the node in the chain table, and the chain table is thus updated. The method and the device of the invention improve the recombination efficiency.

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 an efficient electric power network data acquisition and intelligent analysis system, which comprises a data acquisition module for acquiring data information. The data intelligent analysis module is used for filtering out the information of the event contained in the data information; the event merging processing module is used for counting the merging number of differentevents in a period of time, and then sending all merging events to the data storage module through a timer at regular intervals. The data storage module is used for storing acquisition events and acquisition information. The invention can improve the shortcomings of the prior art and enhance the safety of data transmission.

The invention discloses a log analysis method and a log analysis system. The log analysis method comprises the following steps: according to the received log, the log is analyzed to obtain the analyzed field; Storing the parsed fields in a database; Calling the parsed fields in the database for data aggregation; storing The aggregated data. The log analysis method of the invention realizes the analysis of most types of logs, has strong data compatibility and fast data aggregation speed. Which improves the efficiency of log parsing.

The invention discloses a bidirectional matching method, apparatus and transaction system. The method includes the steps of setting business matching state for all business data information issued by a first terminal; setting reservation order matching state for all reservation order data information issued by a second terminal; matching new business data information with the reservation order data information, of which the reservation order matching state is first reservation order state when the new business data information issued by the first terminal is detected, wherein the first reservation order state indicates already conducting unsuccessful matching; and matching new reservation order data information with the business data information, of which the business matching state is first business state when the new reservation order data information issued by the second terminal is detected, wherein the first business state indicates already conducting unsuccessful matching. The method improves concurrent processing capability and matching efficiency.

The invention relates to a multilayer protocol analysis method and device as well as a data matching method and device. The multilayer protocol analysis method applied to a first syntactic analyzer comprises the steps of receiving to-be-matched first protocol data; pushing a terminal symbol of a lower-layer protocol into a stack top of a symbol stack and inputting the to-be-matched first protocol data into a lexical analyzer corresponding to the current stack top state of the state stack; receiving a matching result returned by the lexical analyzer; carrying out syntactic analysis on a first terminal symbol with a predicate; when the syntactic analysis on the first terminal symbol with the predicate is finished, judging whether a next importable event in the current stack top state of the state stack is the target non-terminal symbol of the upper-layer protocol; and when determining that the next importable event is the target non-terminal symbol of the upper-layer protocol, sending the to-be-matched second protocol data to a second syntactic analyzer. Through the technical scheme, data analysis of multilayer protocol can be finished through one data analysis.

The invention discloses a method for generating a polygonal chain with a concentrated topology of a geographic information system. During a polygonal chain search, if one arc section can pass through twice, the arc section is judged to be a hanging arc section, a directed edge corresponding to the hanging arc section can not form the polygonal chain; the polygonal chain is structured by an available directed edge between two directed edges corresponding to the same one hanging arc section in one polygonal chain search; the available directed edge refers to the corresponding directed edge excluding the hanging arc section and the directed edge used for including the polygonal chain as well as the directed edge. The method for generating the polygonal chain with the concentrated topology of the geographic information system is easily carried out; furthermore, generating efficiency of the polygonal chain can be obviously 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 present invention provides a blurred license plate identification method and apparatus. The method comprises: obtaining MxN blurred license plate images being subjected to the inclination correction processing; carrying out graying processing on the MxN blurred license plate images to obtain MxN blurred license plate grayscale images; carrying out vertical projection on the MxN blurred licenseplate images to obtain N vertical projection values, and removing the upper and lower boundaries of the MxN gray license plate grayscale images according to the N vertical projection values; carryingout scaling processing on the blurred license plate grayscale images being subjected to the upper and lower boundary removal processing; carrying out horizontal projection on the scaled blurred license plate grayscale images to obtain M horizontal projection values, and determining traversal points on the scaled blurred license plate grayscale images according to the M horizontal projection values; and using a character template generated based on the neural network to identify the traversal points on the scaled blurred license plate grayscale images, and outputting a blurred license plate identification result. According to the method and apparatus provided by the present invention, a blurred license plate can be accurately and efficiently identified.

The embodiment of the invention provides a method for processing a read / write request, a network storage system and electronic equipment. The method comprises the following steps: when a first read request is received in a first working state, sending the first read request to the network storage device; checking whether a first write request overlapped with the address range corresponding to thefirst read request exists in all the write requests which have been sent but do not receive the execution response or not; and when the first write request does not exist, waiting for receiving an execution response corresponding to the first read request. Compared with the prior art, the technical scheme provided by the embodiment of the invention has the advantages that the time consumed for sending the order-preserving check of the request is saved, the processing efficiency of request sending is improved, and the problem of request processing delay caused by the fact that the order-preserving check consumes a large amount of time in the prior art is further improved.

The invention provides a method of distributed configuration under the protection of an automatically switching optical network (ASON), particularly a method of distributed configuration under the P-cycle (pre-configured cycle) protection of an ASON by combining the characteristics of the ASON, and a scheme used for carrying out the P-cycle distributed configuration, and the invention further provides a method of P-cycle protection against node and link failures in a network. The method comprises the following stages in the specific implementation: an initial configuration stage, a traversal search stage and a convergence stage. By configuring the P-cycle protection on the distributed basis, the invention can provide high-speed protection switching and ensure the high resource utilizationrate; and meanwhile, the invention can avoid the difficulties caused by changes in the network, and effectively reduce the traversal frequency of the algorithm, thereby effectively accelerating the P-cycle configuration and increasing the convergence rate of the algorithm.

The invention discloses a method for eliminating visual errors of two-dimensional vector solid lines in a three-dimensional scene, and mainly solves the problems that, in the process where a two-dimensional line symbol is fit and rendered to the surface of a three-dimensional terrain, intermittent disappear phenomenon, vector solid line boundary sawtooth deformation phenomenon, and the phenomenon that vector solid line width does not change with zooming of the scene and the like are caused for the reason that the vector solid lines are over-thin. The method comprises the following main steps: carrying out surface shape processing according to vector solid line width; calculating coverage area of screen pixels in the two-dimensional space by utilizing a projection back-calculation method; classifying the pixels according to the spatial position relation of two-dimensional space coverage area of the pixels and a vector solid line surface area, and carrying out multiple-sampling processing on the pixels which are in intersection relation with the surface area boundary of the vector solid lines; judging whether sampling points are in the surface area of the vector solid lines; and determining sampling points according to the judgment result and colouring the sampling points, and using the colour mixation values of the sampling points to replace the screen color cache values of the corresponding pixels.

The invention discloses a fragmented data packet processing method and device. The method comprises the following steps: receiving a fragmented data packet of an IP message, wherein the fragmented data packet comprises address information of the IP message; acquiring the IP message according to the address information of the IP message; obtaining a fragmentation data packet set and an MTU value set corresponding to the IP message, with one element in the fragmentation data packet set corresponding to one fragmentation data packet of the IP message, and the element in the MTU value set corresponding to the MTU value of each fragmentation of the IP message during fragmentation; determining a target position of the fragmented data packet in the fragmented data packet set according to the fragmented offset of the received fragmented data packet and the MTU value set; and updating the fragmented data packet set according to the target position of the fragmented data packet in the fragmenteddata packet set. The recombination efficiency is improved.

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.

The invention discloses a load optimization method for a segmented-type LED drive system, and the method comprises the optimization process of LED load combinations M1 to Mn at four steps. The methodemploys a strategy that the selectable range of the LED load combinations is reduced step by step firstly and then the traversal is carried out, thereby reducing the number of traversal times, guaranteeing that the comprehensive performances of a system in a wide input voltage range are approximately optimal, and achieving the improvement of the load optimization speed and effect. A load optimization result can enable the segmented-type LED drive system working in the wide input voltage range to achieve the highest efficiency under the condition that the circuit cost, size, PF, THDi and inputcurrent harmonic standard are met.

The invention discloses a maximum time interval error calculation method. MTIE acceleration calculation is carried out through a classical algorithm and quantum search algorithm mixed calculation framework, the classical algorithm is optimized by adopting a minimum index progressive strategy, parallel acceleration is carried out by utilizing quantum calculation entanglement properties, and a Grover algorithm is improved, so that the time and the complexity of MTIE calculation are remarkably reduced; on the other hand, the invention provides a maximum time interval error calculation system comprising a sampling module and a processing module. According to the maximum time interval error calculation method and system provided by the invention, minimum value and maximum value search acceleration is realized, the number of traversal times is reduced, the MTIE calculation complexity is reduced, and the calculation speed is improved.