Patents
Literature
Hiro is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
Hiro

45results about How to "Reduce the number of lookups" patented technology

Routing method based on routing list decomposition storage for extensible router system

InactiveCN102594699AReduce forwarding entries and store-and-forward entries for each line cardReduce the number of lookupsData switching networksDecompositionUnit prefix
The invention discloses a routing method based on routing list decomposition storage for an extensible router system. The method comprises the following steps: A: calculating the number of unit prefixes according to the number (n) of system line cards; B: creating a maping relation between the unit prefixes and the line cards; C: storing real routing lists in a decomposition manner according to the maping relation; D: creating and storing a virtual router of the unit prefixes; and E: forwarding and processing message according to the virtual router and the decomposed real routing lists. Through the method provided by the invention, the total storage and forwarding items of the system and the storage and forwarding items of each line card are greatly reduced, the seeking frequency is reduced, and accordingly, the storage expense and energy consumption of the extensible router are reduced, and the hardware resource is saved.
Owner:TSINGHUA UNIV

Method of carrying out fusion processing on SSR navigation management and IFF multi-mode cooperation track

The invention discloses a method of carrying out fusion processing on SSR navigation management and IFF multi-mode cooperation track. A clear and reliable air monitoring graph can be supported to generate and civil air and an out target monitoring and identification capability can be increased. A technical scheme is characterized by in a secondary monitoring radar SSR navigation management and identification friend or foe recognizer integration system, firstly, carrying out trace point merging and track starting on data of A, C and S general calling mode targets of an SSR navigation management mode; secondly, carrying out prediction and roll-call inquiry on an S general calling mode track so that the SSR navigation management acquires a roll-call track of the S mode; according to a target point track angle, calculating a belonging area number, carrying out relation determination on SSR navigation management target tracks in the same area and an adjacent area and generating a target track after the SSR navigation management and the IFF are fused; and then associating and fusing attributes and positions of target data under different IFF guiding modes and the target tracks of the AC and S modes of the SSR navigation management and forming an SSR navigation management and IFF fusion target track so that continuous monitoring and identification to an air target are realized.
Owner:10TH RES INST OF CETC

Pattern matching method and device for data streams

The invention relates to a pattern matching method and a pattern matching device for data streams. In the method, a pattern set comprising a plurality of patterns is divided into a plurality of mutually exclusive pattern subsets with a given detection window length, so pattern matching checks are performed on the mutually exclusive subsets in a plurality of pattern matching engines respectively, the searching times of the pattern matching engines are greatly decreased, and the working efficiency of a system is improved correspondingly.
Owner:IBM CORP

Dalvik virtual machine just-in-time compilation (JIT) acceleration method based on software Cache

The invention discloses a Dalvik virtual machine just-in-time compilation (JIT) acceleration method based on a software Cache. The technical scheme includes that firstly, the software Cache is built in a Dalvik virtual machine, the software Cache adopts two-group connection structure and is added before a local code hash table; secondly, when a local code is found through a bytecode address, the local code is firstly found in the software Cache, when the local code is found out, the local code is directly accessed, when the local code is not found out, the local code is found in the local code hash table, when the local code is found out in the local code hash table, contents in lines of the software Cache are selected and written, when the local code is not found out, a compiling thread is waken up to compile the bytecode into the local code, and the local code hash table and the corresponding lines in the software Cache are simultaneously updated. Due to the fact that times of finding the local code hash table with a complex Hash algorithm in the Dalvik virtual machine are reduced, the Dalvik virtual machine JIT acceleration method based on the software Cache has the advantages of reducing system overhead of finding the local code hash table, thereby improving performance of a whole Android system.
Owner:SOUTHEAST UNIV

Method and system for finding resonant frequency point of transducer

The present invention provides a method and system for finding the resonant frequency point of a transducer. The method includes the following steps that: S1, the minimum operating frequency and maximum operating frequency of the transducer are obtained; S2, a resonant frequency point preset value is set, a hop-up interval is formed with the maximum operating frequency and the resonant frequency point preset value, and a hop-down interval is formed with the resonant frequency point preset value and the minimum operating frequency; S3, if the current phase of the transducer exceeds the voltagephase of the transducer, a current interval hops to the hop-up interval, otherwise, the current interval hops to the hop-down interval; S4, a new hop-up interval and a new hop-down interval are formedwith two end point values of the current hop-up interval or current hop-down interval and corresponding intermediate point frequencies; and S5, if the current phase exceeds the voltage phase, a current interval hops to the new hop-up interval, otherwise, the current interval hops to the new hop-down interval, and the step S4 and step S5 are repeated, and the frequency of the transducer when the current phase and the voltage phase are the same is adopted as a resonance frequency point. With the method and system of the present invention adopted, the number of the times of finding can be greatly reduced through frequency hopping.
Owner:REACH SURGICAL +1

Big data set searching method based on Grover algorithm and quantum computer

The invention belongs to the technical field of quantum computing, and discloses a big data set search method based on a Grover algorithm and a quantum computer. The method comprpises steps of partitioning the data sets according to the capacity of a quantum processor, wherein the size of each data set is the maximum data volume capable of being processed by the processor at a time; taking the iteration frequency of each piece of data as an independent variable, and listing a total expected value equation of the iteration frequency when a solution is searched; listing constraint conditions ofa search problem, taking a total expected value equation as a target function, and solving an optimization equation; searching the corresponding data block according to the obtained iteration times ofeach piece of data; and comparing with a complete Grover algorithm to obtain the optimization rate of the optimization search algorithm. According to the method, the search frequency can be effectively reduced by searching a large data set, and the optimization rate can be improved by about 6% under the optimal condition. Under the condition of the same search success rate, the search frequency is reduced, and the influence generated by the error rate and the decoherence in the whole system can be counteracted.
Owner:NORTHWEST UNIV(CN)

Network protocol address-regional information matching method and system

The invention relates to the field of massive data network protocol address-regional information matching technology, and particularly relates to a network protocol address-regional information matching method and system. The method comprises the following steps: (1) acquiring a user network protocol address that needs to match regional information; (2) matching the user network protocol address through a high-frequently used regional coding schedule according to a sequential lookup method; and (3) dividing the user network protocol address into a field 1, a field 2, a field 3 and a field 4 from left to right, and separately matching the four fields with a low-frequently used regional coding schedule through a binary lookup algorithm. According to the network protocol address-regional information matching method and system disclosed by the invention, the network protocol addresses in the high-frequently used regional coding schedule are sorted according to the frequency of usage and also adopt a sequential lookup matching algorithm; the network protocol addresses in the low-frequently used regional coding schedule are divided into the four fields, and perform matching for the network protocol address-regional information by adopting the binary lookup algorithm; and thus the number of lookups can be decreased in multiples, and the matching efficiency can be improved.
Owner:SHANGHAI MUNICIPAL ELECTRIC POWER CO

Data name searching method and system and storage medium

The invention discloses a data name searching method and system and a storage medium, an additional step is added on the basis of an existing data name searching algorithm, when data name prefixes arestored in a hash table according to the number of components, the first n bits of each component in the data name prefixes are taken out to serve as feature prefixes of the data name prefixes, and the feature prefixes of the data name prefixes are stored in the hash table. And the feature prefixes of the same component sequence are counted together, and the feature prefixes are stored by using aBloom filter. When the target data name needs to be searched, the feature data name of the target data name is obtained according to the corresponding method, then the feature data name is put into the feature prefix Bloom filter of the corresponding component number to be matched, and if matching fails, the feature data name does not need to enter the hash table of the corresponding component number to be searched. According to the invention, data name search is completed quickly, and network delay is reduced.
Owner:HUNAN UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products