206results about How to "Reduce search" patented technology

Methods and systems for the design and implementation of optimal multivariable MPC controllers for fast-sampling constrained dynamic systems utilizing a primal-dual feasibility approach and / or a graph approach. The primal-dual feasibility approach can compute and store matrices defining constraints of quadratic programming problems in an off-line part in order to calculate vectors of Lagrange multipliers and an optimizer. Then primal-dual feasibility can be checked in an on-line part using the Lagrange multipliers and the optimizer can provide a unique optimal solution for the constrained dynamic system. The graph approach can compute and store the matrices and the vectors, and also prepare and store a structure of directed graph in off-line part. An optimizer for a given parameter vector can be determined in on-line part using the directed graph, the matrices and the vectors.

The invention discloses a MELF (Metal Electrode Leadless Face) component positioning and detecting method based on match template which belongs to the technical field of component positioning and detecting. Under a traditional match template algorithm, it takes great amount of computing to detect a component with a rotation angle, and the process is also very slow to perform. For these reasons, the positioning and detecting speed for the component is also rather slow. In light of these shortcomings, the invention provides a MELF (Metal Electrode Leadless Face) component positioning and detecting method. The method creates a template image with angle to obtain a distance transformation image of a narrowed image of the component and a distance transformation image of the original image of the component and to obtain a final best match template image and a best match position. Key edge points are extracted from an edge image with interference points to form a minimum external rectangle. According to the number of the non-zero pixels in the minimum external rectangle with added offset value, the method determines that the positioning of the component is correct and that the length and the width of the component are in the bearable range. After that, the positioning and detecting process is complete and positioning information of the component is then transmitted out. The method provided by the invention is capable of reducing the number of positions searched during the computing of a match template value. With the method, the computing efficiency of a match template can be increased and the accurate rate for positioning and detecting reaches 95% to 98%.

The present disclosure provides an apparatus and method for packet classification using a Bloom filter and includes determining a matching length of how long each field value of one or more fields in an input packet coincides with a field value of the corresponding field stored in a rule set by performing a field-by-field search on the fields in the input packet, and generating a tuple list made up of a combination of one or more of the matching length for the respective fields; selecting particular tuples existing in the rule set from the tuple list; filtering each of the selected tuples by using the Bloom filter; and searching for a best matching rule as a search pool exclusively within the tuples with the positive result of the filtering. According to the present disclosure, the object tuples to search can be substantially relieved to improve the searching performance.

The application provides a core network side based system and a core network side based method for initiatively pushing wireless personalized accurate information. The core network side based method for initiatively pushing the wireless personalized accurate information comprises the following steps: step S11, receiving a 3G (the third generation telecommunication) wireless network connection request submitted by a user, wherein the 3G wireless network connection request comprises the user identity information; step S12, judging that whether a personalized information record which corresponds to the user identity information exists or not, and executing the step S13 if the personalized information record which corresponds to the user identity information exists; step S13, judging that whether the personalized information record meets the preset rules, and executing the step S14 if the personalized information record meets the preset rules; and step S14, pushing personalized webpages to the user according to the personalized information record. Accurate personalized services can be provided for the user, the user can use and operate the 3G service more easily, and less flow can be used.

The present disclosure provides an apparatus and method for packet classification using a Bloom filter and includes determining a matching length of how long each field value of one or more fields in an input packet coincides with a field value of the corresponding field stored in a rule set by performing a field-by-field search on the fields in the input packet, and generating a tuple list made up of a combination of one or more of the matching length for the respective fields; selecting particular tuples existing in the rule set from the tuple list; filtering each of the selected tuples by using the Bloom filter; and searching for a best matching rule as a search pool exclusively within the tuples with the positive result of the filtering. According to the present disclosure, the object tuples to search can be substantially relieved to improve the searching performance.

The invention provides an automatic way-finding method in a game. The automatic way-finding method comprises the following steps: S1: dividing a game map into meshed way-finding points, wherein at least one way-finding point is an obstacle point; S2: selecting the two way-finding points as a starting point and a target point, and taking the starting point as a current way-finding point; S3: searching a next way-finding point in the direction from the current way-finding point to the target point, and judging whether the next way-finding point is the obstacle point or not; S4: if the next way-finding point is not the obstacle point, judging whether the next way-finding point is the target point; S5: if the next way-finding point is the obstacle point, taking a searching path as a way-finding path; if the next way-finding point is not the obstacle point, taking the next way-finding point as the current way-finding point, and carrying out the step S3; and S6: if the next way-finding point is the obstacle point, searching the next way-finding point in the left and right directions of the obstacle point, and taking the next way-finding point as the current way-finding point and carrying out the step S3. By the aid of the automatic way-finding method, the search, which is not related with the way-finding point, can be reduced and the searching efficiency is improved.

The invention discloses an electronic book, an electronic book topic interaction method, a computing device and a storage medium. The method comprises the steps that an association relationship of anelectronic book object and an electronic book topic in a topic square page is established; according to a first triggered request which is sent by a client for a first specified text object in an electronic book page, a first specified topic associated with the first specified text object is inquired, and a first specified topic display page is returned to the client; according to a second triggered request which is sent by the client for a second specified topic in the topic square page, a second specified text object associated with the second specified topic is inquired, and a related pageof a second electronic book to which the second specified text object belongs is returned to the client. A user can make a skip to the topic display page from the electronic book page conveniently toview the related topics. The user can make skip to the electronic book page from the topic display page directly to read the electronic book, and the tedious process of searching for the electronic book is omitted.

The invention finds matches in ordered sequences, e.g. program function call stacks from anomalous software program executions for discovering related or identical software flaws and possible known solutions. Call stacks are matched after removing recursive and uninformative subpatterns, e.g. names of common error handling routines, to see if they were generated due to the same possibly known problem. Sequences statistically unlikely to be matches are pruned from the search. Matches found earlier in the sequences may be weighted differently, e.g. to be more important in call stacks, than other matches. Sequences are indexed so that those relevant to a query are identified automatically without detailed exhaustive search. Maximum matches are found by optimizing a cost function based on weighted sequence similarity.