30results about How to "Increase search time" patented technology

In a raster stage of a graphics pipeline, a method for accelerated start tile rasterization. The method includes defining a window for clipping a generated image and receiving a graphics primitive for rasterization in a raster stage of a graphics processor. A binary search related to the window is performed to determine a start tile having at least a partial coverage of the graphics primitive, wherein the start tile comprises a plurality of pixels. Based upon the start tile, the raster stage rasterizes the graphics primitive by generating a plurality of adjacent tiles having at least a partial coverage of the graphics primitive.

The invention relates to an image segmentation method based on regional growth and ant colony clustering, which is characterized in that: the premise of the consideration is that the growth starts from a pixel with highest gray value, so the removal of noise from an image is very important. Therefore, the four-neighborhood middle value filtration is adopted for filtering the noise; and the pixel with the maximum gray value is taken as a seed point to carry out the regional growth; then, a new guide function is defined by utilizing spatial information and gray information extracted after the regional growth to be used in the ant colony algorithm for carrying out the cluster merging in the regions, thus obtaining the final segmentation result. The image segmentation method based on regional growth and ant colony clustering proposed by the invention has three evident advantages: firstly, the shortcoming of not being able to obtain the meaningful region from the regional growth is overcome; secondly, the searching time of the ant colony clustering algorithm is greatly improved; thirdly, the definition of the new guide function can accurately and effectively guide the ant colony clustering and improve the accuracy of the image segmentation.

A method of sorting text for memory efficient searching is disclosed. A FM-index is created on received text, and a number of rows are marked. The locations of the marked rows are stored in data buckets as well as the last column of the FM-index, which is stored as a wavelet tree. Data blocks containing the data buckets are created; containing the number of times each character appears in the data block before each data bucket. A header block is created comprising an array of the number of times each character appears in the last column of the FM-index before each data blocks, the location of the end of the data blocks and the location of the end of the data, and appended to the data block. The header and data blocks are stored. The search process loads data buckets into memory as needed to find the required text.

The invention relates to a query optimization method based on an improved genetic algorithm, and belongs to the technical field of query optimization. The method comprises: establishing a mathematical model for a query execution policy set, to transform a query optimization problem into a mathematical problem of finding a global optimal solution, wherein the model is called a cost evaluation model of a query policy; and then improving a genetic algorithm, and using a global search ability of the improved genetic algorithm to perform a parallel search on a query policy set, thereby finally obtaining an ideal query execution policy. According to the method provided by the invention, a conventional genetic algorithm is improved, and the improved genetic algorithm is used for query optimization of a large relational database, thereby overcoming a "premature" convergence phenomenon. Compared with other intelligent optimization algorithms, falling into a local extremum can be effectively avoided, thereby shortening search time. In addition, a gene based search policy and a polyploidy based retention policy in the algorithm greatly improve search accuracy.

The invention discloses a multi-sink-based dynamic multi-routing source node location privacy protection method in a WSN. The method comprises the following steps: firstly, a phantom source node P<h>is randomly selected; then, a real data packet is segmented into M parts by the phantom source node P<h>, and M forwarding nodes are randomly selected in a candidate region; a shortest routing strategy is adopted to transmit M real data segments to the forwarding nodes; afterwards, the M real data segments are randomly transmitted to corresponding sink nodes along a grid by the forwarding nodes, respectively, multiple paths simultaneously exist in the network at the same moment to protect the source node location privacy; and the sink node generates a new pseudo data packet and continues to transmit along the clockwise loop to interfere with the judgement of an attacker. According to factors of network scale, the location of the source node, the number of attackers and the like, the segmented parts of the data packet are controlled, and multipath is manufactured. According to the method in the invention, the difficulty of cracking the location of the source data packet and the source node is enhanced, a large number of data packets need to be simultaneously intercepted so as to obtain the location of the source node, and the dynamic multipath improves the use ratio of the multi-sink.

The embodiments of the invention disclose a Chien search circuit. The Chien search circuit comprises t submodules, t*(P-1) shift registers, P adders and (P-1) dividers. Each submodule in the t submoduels comprises an adder, a dual-input selector (MUX) and a D trigger. The t submodules and one adder form a Pth channel. Every t shift registers, one adder and one divider form a channel so as to form a first channel to a (P-1)th channel. Based on the Chien search circuit, the invention further brings forward an ECC decoding structure and an ECC decoding method employing two-stage streamlines. The Chien search circuit, through adjusting channel number, saves the chip area and greatly shortens the error correction time of Chien search. Besides, the ECC decoding is reduced to the two-stage streamlines, and the ECC decoding speed is accelerated.

The invention relates to a selective querying roll-call method of secondary radar S-mode. Roll-call target sorting part in the selective querying roll-call method comprises combining the roll-call targets and link request information into a target request list G1; obtaining a xth target request Mx in the target request list G1, and calculating a transmission time and a response time of the Mx; calculating the times of remaining N-x targets according to the Mx; sorting the remaining N-x targets from large to small according to receiving times; assigning a value of Rx+1 to the receiving time ofa target appeared firstly and being closest to a receiving time Rx, and assigning a value of Tx+1 to the transmission time thereof; after the assignment is completed, automatically increasing 1 to x,and then judging whether condition A: x<N and Tx>0 is met or not; if the condition A is met, continuing to execute; and if the condition A is not met, completing the roll-call target sorting. According to the selective querying roll-call method of the secondary radar S-mode, the sorting is performed on the targets participating in the roll-call; the global optimization is achieved through the local optimization; the method is fast; more querying targets can be efficiently obtained; the querying efficiency and the time utilization rate are improved.

The invention discloses a double-time-slot RFID anti-collision algorithm based on a search tree. The algorithm is the double-time-slot anti-collision algorithm based on the search tree. According to the algorithm, the further search command is formed by using the reader stack; and response tags are divided into two subsets and data information is transmitted in two time slots, and at most four tags can be identified in one time of searching. The theoretical analysis and simulation result proves that the advantages of the ALOHA algorithm and the search tree algorithm are integrated in the double-time-slot anti-collision algorithm based on the search tree so that the search frequency and the identification time can be reduced and the overall performance of the RFID system can be enhanced. Therefore, the time slot idea of the ALOHA algorithm is introduced after improvement and the advantages of the two algorithms are integrated so that the data communication volume between the reader andthe tags can be reduced, the search frequency can be reduced and the search efficiency can be enhanced.

The invention discloses a searching method and device of search terms in order to improve the searching efficiency, shorten searching time and improve user experience. The searching method comprises the steps that a journal file including all the search items in a preset ranking range and information relates to the search items is generated; a relative number of days between a preset date and today is calculated, and the journal file is named as the relative number of days and then is stored. According to the searching method and device of the search terms, the hot search items of the day are recorded by generating the journal file of the hot search items, inner query of a hot search item database is not needed in the searching process, and therefore the searching time is saved, and the searching efficiency is improved. Meanwhile, the journal file is named as the relative number of days, when query and statistics are performed, the journal file corresponding to the number of days to be counted can be directly obtained and called, therefore, the searching efficiency can be further improved, the searching time is shortened, and user experience is improved.

The invention provides a doubly-fed wind generator high-voltage traversing rotor control method based on a follow-up algorithm aiming at the defects of an existing control method for a doubly-fed wind generator. The high-voltage traversing rotor control method includes the steps that (1), the three-phase current, the three-phase voltage, the rotating speed of the wind driven generator and the swell amplitude of power grid voltage on the rotor side are collected; (2), the collected three-phase current and the three-phase voltage are converted into numerical values in a two-phase synchronous rotating coordinate system; (3), a self-adaptive differential negative feedback value L 'alpha corrected based on the follow-up algorithm is introduced into a current feedback channel on the rotor side; (4), the q-axis voltage component V'rq on the rotor side is obtained through inversion according to the corrected differential negative feedback value L 'alpha; (5), a result of the step (4) is converted into numerical values in the two-phase static coordinate system, and the numerical values are input into a power tube in an inverter module for control. Self-adaptive differential negative feedback values of the doubly-fed wind generator at different rotating speeds and with different swell amplitudes can be optimized, so that the prediction result is more accurate, and the time consumed for processing is shorter.

The invention provides a finished printed circuit board short circuit fault point tracking device, which comprises an excitation signal generator, an excitation signal shunt circuit, four output ends, a probe and a short circuit signal processor, wherein the excitation signal generator sends out two paths of time-sharing independent output DC pulsating excitation signals, the two paths of excitation signals are divided into four paths of electric signals through an excitation signal dividing circuit, the four paths of electric signals are inputted into a circuit board to be tested through four output ends, one end of the probe makes relative contact with the circuit board to be tested to move, and collected short-circuit signals are transmitted to a short-circuit signal processor; and the short-circuit signal processor converts the short-circuit signal into an optical signal for indicating the position of a short-circuit fault point. The device can accurately search welding short-circuit points of tiny devices or damaged onboard devices and the like, is high in detection precision, has no damage to finished printed circuit boards and onboard components, and is advantaged in that the number of times of searching fault points of the circuit boards is small, the searching time is short and the like.

The invention discloses an image searching method, device and system and a programmable logic device. The method is applied to independent hardware equipment without a computer system, and a target record engine table is created in advance. And if an image storage instruction is received, the to-be-stored image and the corresponding target record real-time table are stored, and whether to update the target record engine table is determined according to whether the relationship between the storage time of the to-be-stored image and a preset moment contains a target. If a target search instruction is received, a storage position of a storage image to which a to-be-searched target belongs is searched in the target record engine table; the storage image is read, the storage position of the next storage image with the to-be-searched target is determined from the target record real-time table corresponding to the storage image, and the next storage image is taken as the storage image to repeatedly execute the operation until the next storage image does not exist in the first target record real-time table, rapid jump type object image searching is achieved, and the cost is low.

Apparatus and method searching data in a multi record data structure with at least first and second criteria where criteria are selected for search to preferentially select criteria for speeding search based on criteria from other records.

A mobile communication system transmitting data in frame unit includes a base station apparatus and a terminal apparatus. The transmitter comprises a controller having consecutive first and second frames each divided into a first interval and a second interval following the first interval. In a handoff mode, the controller transmits respective frame data in the first interval of the first frame and the second interval of the second frame and stops transmission of the data in the second interval of the first frame and the first interval of the second frame. Further, the terminal apparatus comprises a receiver for processing received data, a handoff determiner for determining a handoff target base station by analyzing a strength of the received signal, and a controller applying to the receiver a signal transmitted from a present base station in the first interval of the first frame and the second interval of the second frame and applying to the handoff determiner signals transmitted from other base stations in the second interval of the first frame and the first interval of the second frame.